Home
last modified time | relevance | path

Searched refs:s2 (Results 1 – 11 of 11) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_sequencer_node.cpp213 tbb::flow::sequencer_node<T> s2(g, seq_inspector<T>()); in test_parallel() local
215 tbb::flow::make_edge( s1, s2 ); in test_parallel()
216 tbb::flow::make_edge( s2, s3 ); in test_parallel()
229 CHECK_MESSAGE( s2.try_get( j ) == false, "" ); in test_parallel()
267 tbb::flow::sequencer_node<T> s2(g, seq_inspector<T>()); in test_serial() local
274 CHECK_MESSAGE( register_predecessor( s, s2 ) == false, "" ); in test_serial()
275 CHECK_MESSAGE( remove_predecessor( s, s2 ) == false, "" ); in test_serial()
306 bool msg = s2.try_put( T(i) ); in test_serial()
312 CHECK_MESSAGE(wait_try_get( g, s2, j ) == true, ""); in test_serial()
317 CHECK_MESSAGE( s2.try_get( j ) == false, "" ); in test_serial()
[all …]
H A Dtest_composite_node.cpp224 tbb::flow::function_node<int,int> s2(g, tbb::flow::unlimited, square_body()); in test_adder() local
236 tbb::flow::make_edge( tbb::flow::output_port<0>(a2), s2 ); in test_adder()
237 tbb::flow::make_edge( s2, q ); in test_adder()
256 tbb::flow::remove_edge(s2, q); in test_adder()
257 tbb::flow::remove_edge( a2, s2 ); in test_adder()
260 tbb::flow::make_edge( a3, s2 ); in test_adder()
261 tbb::flow::make_edge( s2, q ); in test_adder()
H A Dtest_split_node.cpp390 split_node s2(follows(b1, b2)); in test_deduction_guides() local
391 static_assert(std::is_same_v<decltype(s2), split_node<tuple_type>>); in test_deduction_guides()
/oneTBB/examples/graph/fgbzip2/
H A Dblocksort.cpp426 UInt16 s1, s2; in mainGtU() local
523 s2 = quadrant[i2]; in mainGtU()
524 if (s1 != s2) in mainGtU()
534 s2 = quadrant[i2]; in mainGtU()
535 if (s1 != s2) in mainGtU()
546 if (s1 != s2) in mainGtU()
557 if (s1 != s2) in mainGtU()
568 if (s1 != s2) in mainGtU()
579 if (s1 != s2) in mainGtU()
590 if (s1 != s2) in mainGtU()
[all …]
/oneTBB/src/tbb/tools_api/
H A Dittnotify_config.h286 #define __itt_fstrcmp(s1, s2) lstrcmpA(s1, s2) argument
288 #define __itt_fstrcpyn(s1, b, s2, l) strncpy_s(s1, b, s2, l) argument
338 #define __itt_fstrcmp(s1, s2) strcmp(s1, s2) argument
347 #define __itt_fstrcpyn(s1, b, s2, l) SDL_STRNCPY_S(s1, b, s2, l) argument
349 #define __itt_fstrcpyn(s1, b, s2, l) { \ argument
355 strncpy(s1, s2, num_to_copy); \
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_overload.cpp331 BigStruct *s1, *s2, *s3, *s4, *s5, *s6; in CheckNewDeleteOverload() local
337 s2 = new BigStruct[10]; in CheckNewDeleteOverload()
338 scalableMallocCheckSize(s2, 10*sizeof(BigStruct)); in CheckNewDeleteOverload()
339 delete []s2; in CheckNewDeleteOverload()
/oneTBB/test/conformance/
H A Dconformance_sequencer_node.cpp41 sequencer_node s2(follows(br), body); in test_deduction_guides_common() local
42 static_assert(std::is_same_v<decltype(s2), sequencer_node<int>>); in test_deduction_guides_common()
H A Dconformance_input_node.cpp44 input_node s2(g, non_const_lambda); in test_deduction_guides() local
45 static_assert(std::is_same_v<decltype(s2), input_node<int>>); in test_deduction_guides()
H A Dconformance_concurrent_unordered_set.cpp143 TSet s2(v.begin(), v.end(), 5, degenerate_hash<ComplexType>()); in test_deduction_guides() local
144 … static_assert(std::is_same<decltype(s2), TSet<ComplexType, degenerate_hash<ComplexType>>>::value); in test_deduction_guides()
/oneTBB/include/oneapi/tbb/
H A Denumerable_thread_specific.h179 slot& s2 = root->at(j);
180 if( s2.empty() ) {
181 s2.ptr = add_element(static_cast<ets_base<E2>&>(*this), s1.ptr);
182s2.key.store(s1.key.load(std::memory_order_relaxed), std::memory_order_relaxed);
185 else if( s2.match(s1.key.load(std::memory_order_relaxed)) )
/oneTBB/test/common/
H A Ddoctest.h432 #define DOCTEST_CAT_IMPL(s1, s2) s1##s2 argument
433 #define DOCTEST_CAT(s1, s2) DOCTEST_CAT_IMPL(s1, s2) argument