Home
last modified time | relevance | path

Searched refs:T1 (Results 1 – 14 of 14) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_types_impl.h78 template<typename T1, typename T2, size_t REM>
80 char first[sizeof(T1)];
85 template<typename T1, typename T2>
86 struct type_plus_align<T1,T2,0> {
87 char first[sizeof(T1)];
99 template<typename T1, typename T2>
103 typedef type_plus_align<T1, T2, 0 > just_pair;
236 template<class T1, class T2> struct pick_one<true , T1, T2> { typedef T1 type; };
237 template<class T1, class T2> struct pick_one<false, T1, T2> { typedef T2 type; };
241 typedef typename pick_one< (Selector<T1>::value > Selector<T2>::value), T1, T2 >::type type;
[all …]
H A D_flow_graph_join_impl.h1258 typedef type_to_key_function_body<T1, K> *f1_p;
1265 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1292 typedef type_to_key_function_body<T1, K> *f1_p;
1300 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1339 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1382 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1430 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1483 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1541 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
1603 …new type_to_key_function_body_leaf<T1, K, key_from_message_body<K,T1> >(key_from_message_body<K,T1…
[all …]
H A D_utils.h310 template <typename T1, typename T2> in atomic_do_once()
311 auto operator()( const T1& lhs, const T2& rhs ) const in atomic_do_once()
317 if constexpr (std::three_way_comparable_with<T1, T2>) { in atomic_do_once()
331 template <typename T1, typename T2 = T1> in atomic_do_once()
332 using synthesized_three_way_result = decltype(synthesized_three_way_comparator{}(std::declval<T1&>(… in atomic_do_once()
/oneTBB/test/tbb/
H A Dtest_indexer_node.cpp470 class generate_test<TestType, T0, T1, T2, T3, T4, T5, T6, T7> {
482 class generate_test<TestType, T0, T1, T2, T3, T4, T5, T6> {
494 class generate_test<TestType, T0, T1, T2, T3, T4, T5> {
505 class generate_test<TestType, T0, T1, T2, T3, T4> {
515 typename T0, typename T1, typename T2, typename T3>
516 class generate_test<TestType, T0, T1, T2, T3> {
526 typename T0, typename T1, typename T2>
527 class generate_test<TestType, T0, T1, T2> {
537 typename T0, typename T1>
538 class generate_test<TestType, T0, T1> {
[all …]
H A Dtest_join_node_msg_key_matching_n_args.cpp27 template <typename T1, typename T2>
28 using make_tuple = decltype(std::tuple_cat(T1(), std::tuple<T2>()));
29 using T1 = std::tuple<MyMessageKeyWithoutKeyMethod<std::string, double>>; typedef
30 using T2 = make_tuple<T1, MyMessageKeyWithBrokenKey<std::string, int>>;
H A Dtest_join_node_key_matching_n_args.cpp24 template <typename T1, typename T2>
25 using make_tuple = decltype(std::tuple_cat(T1(), std::tuple<T2>()));
26 using T1 = std::tuple<MyKeyFirst<std::string, double>>; typedef
27 using T2 = make_tuple<T1, MyKeySecond<std::string, int>>;
H A Dtest_join_node.h579 my_struct_key<K, T1>()
595 tag_func<T1>(T1(3))
613 my_struct_key<K, T1>(),
631 tag_func<T1>(T1(3)),
673 tag_func<T1>(T1(3)),
718 tag_func<T1>(T1(3)),
766 tag_func<T1>(T1(3)),
819 tag_func<T1>(T1(3)),
876 tag_func<T1>(T1(3)),
937 tag_func<T1>(T1(3)),
[all …]
H A Dtest_async_node.cpp82 template<typename T1, typename T2>
84 static void check(const T1 &, const T2 &) { } in check()
85 static void copy_value(const T1 &in, T2 &out) { out = in; } in copy_value()
88 template<typename T1, typename T2>
89 struct wrapper_helper< place_wrapper<T1>, place_wrapper<T2> > {
90 static void check(const place_wrapper<T1> &a, const place_wrapper<T2> &b) { in check()
94 static void copy_value(const place_wrapper<T1> &in, place_wrapper<T2> &out) { in copy_value()
H A Dtest_composite_node.cpp77 template<int N, typename T1, typename T2>
79 static void compare_refs(T1 tuple1, T2 tuple2) { in compare_refs()
81 compare<N-1, T1, T2>::compare_refs(tuple1, tuple2); in compare_refs()
85 template<typename T1, typename T2>
86 struct compare<1, T1, T2> {
87 static void compare_refs(T1 tuple1, T2 tuple2) { in compare_refs()
/oneTBB/src/tbb/
H A Dmisc.h175 template<typename T1, class Pred>
176 T1 atomic_update(std::atomic<T1>& dst, T1 newValue, Pred compare) { in atomic_update()
177 T1 oldValue = dst.load(std::memory_order_acquire); in atomic_update()
H A Darena_slot.h246 std::size_t T1 = 0; in prepare_task_pool() local
249 task_pool_ptr[T1++] = new_task_pool[i]; in prepare_task_pool()
256 fill_with_canary_pattern( T1, tail ); in prepare_task_pool()
258 commit_relocated_tasks( T1 ); in prepare_task_pool()
260 return T1; in prepare_task_pool()
/oneTBB/test/conformance/
H A Dconformance_composite_node.cpp50 template<int N, typename T1, typename T2>
52 static void compare_refs(T1 tuple1, T2 tuple2) { in compare_refs()
54 compare<N-1, T1, T2>::compare_refs(tuple1, tuple2); in compare_refs()
58 template<typename T1, typename T2>
59 struct compare<1, T1, T2> {
60 static void compare_refs(T1 tuple1, T2 tuple2) { in compare_refs()
/oneTBB/test/common/
H A Dutils.h387 template <typename T1, typename T2>
388 static bool compare( const std::pair< const std::weak_ptr<T1>, std::weak_ptr<T2> > &t1,
389 const std::pair< const std::weak_ptr<T1>, std::weak_ptr<T2> > &t2 ) {
394 template <typename T1, typename T2>
395 static bool compare( const T1 &t1, const T2 &t2 ) {
398 template <typename T1, typename T2>
399 bool operator()( T1 &t1, T2 &t2) const {
400 return compare( (const T1&)t1, (const T2&)t2 );
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h2360 template<typename T0, typename T1>
2361 class indexer_node<T0, T1> : public unfolded_indexer_node<std::tuple<T0, T1> > {
2365 typedef std::tuple<T0, T1> InputTuple;
2388 template<typename T0, typename T1, typename T2>
2389 class indexer_node<T0, T1, T2> : public unfolded_indexer_node<std::tuple<T0, T1, T2> > {
2393 typedef std::tuple<T0, T1, T2> InputTuple;
2417 class indexer_node<T0, T1, T2, T3> : public unfolded_indexer_node<std::tuple<T0, T1, T2, T3> > {
2445 class indexer_node<T0, T1, T2, T3, T4> : public unfolded_indexer_node<std::tuple<T0, T1, T2, T3, T4…
2474 class indexer_node<T0, T1, T2, T3, T4, T5> : public unfolded_indexer_node<std::tuple<T0, T1, T2, T3…
2505 class indexer_node<T0, T1, T2, T3, T4, T5, T6> : public unfolded_indexer_node<std::tuple<T0, T1, T2…
[all …]