Home
last modified time | relevance | path

Searched refs:get (Results 1 – 25 of 104) sorted by relevance

12345

/oneTBB/python/tbb/
H A Dtest.py111 assert pool.apply_async(return42, []).get() == 42
115 assert pool.map_async(return42, []).get() == []
132 assert result.get() is None # sleep() returns None
149 say(result.get())
155 for i in result.get():
158 for i in result.get():
165 for i in result.get():
167 for i in result.get():
169 r = result.get()
185 for i in result.get():
[all …]
/oneTBB/test/tbb/
H A Dtest_composite_node.cpp80 CHECK_MESSAGE( ( &std::get<N>(tuple1) == &std::get<N>(tuple2)), "ports not set correctly"); in compare_refs()
88 CHECK_MESSAGE( (&std::get<0>(tuple1) == &std::get<0>(tuple2)), "port 0 not correctly set"); in compare_refs()
121 …CHECK_MESSAGE( (&std::get<0>(t1.input_ports()) == &t1.f1), "f1 not bound to input port 0 in compos… in test_tiny()
122 …CHECK_MESSAGE( (&std::get<0>(t1.output_ports()) == &t1.f2), "f2 not bound to output port 0 in comp… in test_tiny()
175 return std::get<0>(t) + std::get<1>(t); in operator ()()
212 …CHECK_MESSAGE( (&std::get<0>(a0.output_ports()) == &a0.f), "f not bound to output port 0 in compos… in test_adder()
354 return my_tuple_t( std::get<0>(t), in operator ()()
355 std::get<0>(t) + std::get<1>(t), in operator ()()
356 std::get<0>(t) + std::get<1>(t) + std::get<2>(t), in operator ()()
357 std::get<0>(t) + std::get<1>(t) + std::get<2>(t) + std::get<3>(t), in operator ()()
[all …]
H A Dtest_global_control.cpp44 tbb::task_scheduler_handle& get() { in get() function
74 switch ( rnd.get() % numCases ) { in operator ()()
95 utils::NativeParallelFor( rnd.get() % 5 + 1, TestMultpleWaitBody( true ) ); in operator ()()
100 bool res = tbb::finalize( init2.get(), std::nothrow ); in operator ()()
105 if ( !myAutoInit && tbb::finalize( init.get(), std::nothrow ) ) in operator ()()
155 tbb::finalize((myIndex == 0 ? tsi1.get() : tsi2.get())); in operator ()()
168 tbb::finalize( init.get() ); in operator ()()
208 bool res1 = tbb::finalize(ctl1.get(), std::nothrow); in TestTerminationAndAutoinit()
214 bool res2 = tbb::finalize(ctl2.get(), std::nothrow); in TestTerminationAndAutoinit()
H A Dtest_scheduler_mix.cpp51 int get() { in get() function
64 int get() { in get() function in Random
70 return s->get(); in get()
249 T* get() { in get() function in PtrRWMutex
279 StatType& get() { in get() function in Statistics
295 ++get().mCounters[a]; in notify()
458 if (arena.get()) { in shutdown()
460 auto a = arena.get(); in shutdown()
556 auto process = r.get() % 2; in do_it()
600 int sz = rnd.get() % 10000; in do_it()
[all …]
H A Dtest_arena_priorities.cpp142 tbb::task_arena& arena = *std::get<arena_pointer>(item).get(); in submit_work()
143 concurrency_type concurrency = std::get<arena_concurrency>(item); in submit_work()
144 tbb::task_arena::priority priority_value = std::get<arena_priority>(item); in submit_work()
145 auto& tg = std::get<associated_task_group>(item); in submit_work()
172 tbb::task_arena& arena = *std::get<arena_pointer>(item).get(); in wait_work_completion()
173 auto& tg = std::get<associated_task_group>(item); in wait_work_completion()
267 overall_tasks_num += std::get<arena_concurrency>(item) * repeats; in test()
309 if( std::get<arena_priority>(item) == p ) { in test()
310 concurrency = std::get<arena_concurrency>(item); in test()
345 return std::get<arena_priority>(info) == priority; in test()
[all …]
H A Dtest_join_node.h490 return TT(std::get<0>(v)) * my_mult;
1065 int ival = (int)std::get<ELEM-1>(v);
1120 CHECK_MESSAGE(std::get<0>(v)==(IT)(i*2), "");
1126 int ival = (int)std::get<0>(v);
1366 int j = int(std::get<0>(v))/2;
1507 … CHECK_MESSAGE( (oq0.try_get(t0)&&std::get<0>(t0)==3&&std::get<1>(t0)==2), "Error in oq0 output");
1508 … CHECK_MESSAGE( (oq1.try_get(t1)&&std::get<0>(t1)==3&&std::get<1>(t1)==2), "Error in oq1 output");
1582 … CHECK_MESSAGE( (oq0.try_get(t0)&&std::get<0>(t0)==1&&std::get<1>(t0)==2), "Error in oq0 output");
1583 … CHECK_MESSAGE( (oq1.try_get(t1)&&std::get<0>(t1)==1&&std::get<1>(t1)==2), "Error in oq1 output");
1723 …CHECK_MESSAGE( (checkTupleQueue0.try_get(t0)&&std::get<0>(t0)==lp1 && std::get<1>(t0)==lp1), "Erro…
[all …]
/oneTBB/examples/graph/som/
H A Dsom_graph.cpp250 std::get<XV>(sr), std::get<YV>(sr), std::get<RADIUS>(sr), xlow, xhigh, ylow, yhigh); in overlap()
296 std::get<RADIUS>(min_sr) = DBL_MAX; in graph_BMU()
301 int x = std::get<XV>(sr) / xsize; in graph_BMU()
302 int y = std::get<YV>(sr) / ysize; in graph_BMU()
321 if (std::get<RADIUS>(sr) < std::get<RADIUS>(min_sr)) in graph_BMU()
323 else if (std::get<RADIUS>(sr) == std::get<RADIUS>(min_sr)) { in graph_BMU()
324 if (std::get<XV>(sr) < std::get<XV>(min_sr)) { in graph_BMU()
327 else if ((std::get<XV>(sr) == std::get<XV>(min_sr) && in graph_BMU()
328 std::get<YV>(sr) < std::get<YV>(min_sr))) { in graph_BMU()
413 std::get<XV>(min_sr), std::get<YV>(min_sr), radius, (epoch + 1) % SPECULATION_CNT); in graph_teach()
[all …]
H A Dsom.cpp61 out << std::get<RADIUS>(s); in operator <<()
62 out << ", " << std::get<XV>(s); in operator <<()
64 out << std::get<YV>(s); in operator <<()
70 printf("<%g,%d,%d>", std::get<RADIUS>(s), std::get<XV>(s), std::get<YV>(s)); in remark_search_result_type()
/oneTBB/doc/main/reference/
H A Dhelpers_for_expressing_graphs.rst66 int sub_sum = std::get<0>(v) + std::get<1>(v) + std::get<2>(v);
74 make_edge(doubler, std::get<0>(join.input_ports()));
75 make_edge(squarer, std::get<1>(join.input_ports()));
76 make_edge(cuber, std::get<2>(join.input_ports()));
109 int sub_sum = std::get<0>(v) + std::get<1>(v) + std::get<2>(v);
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_node_set_impl.h43 static graph& get(const T& object) { in get() function
71 return get_graph_helper::get(std::get<0>(nodes)); in graph_reference()
167 static auto& get(NodeType& node)
169 static auto get(NodeType& node) -> decltype(get_impl(node, has_input_ports_type<NodeType>()))
202 static auto& get(NodeType& node)
204 static auto get(NodeType& node) -> decltype(get_impl(node, is_async_node<NodeType>()))
216 make_edge(std::get<I>(predecessors), successor_selector<I>::get(node));
222 make_edge(predecessor_selector<I>::get(node), std::get<I>(successors));
231 make_edge(std::get<0>(predecessors), successor_selector<0>::get(node));
236 make_edge(predecessor_selector<0>::get(node), std::get<0>(successors));
H A D_range_common.h60 static split get( PartitionerSplitType& ) { return split(); } in get() function
67 static PartitionerSplitType& get( PartitionerSplitType& split_obj ) { return split_obj; }
72 -> decltype(range_split_object_provider<Range>::get(split_obj)) {
73 return range_split_object_provider<Range>::get(split_obj);
H A D_flow_graph_join_impl.h67 std::get<N-1>( my_input ).consume(); in consume_reservations()
84 if ( !std::get<N-1>( my_input ).reserve( std::get<N-1>( out ) ) ) return false; in reserve()
94 bool res = std::get<N-1>(my_input).get_item(std::get<N-1>(out) ); // may fail in get_my_item()
116 std::get<N-1>(my_input).set_my_key_func(std::get<N-1>(my_key_funcs)); in set_key_functors()
127 … std::get<N-1>(my_inputs).set_my_key_func(std::get<N-1>(other_inputs).get_my_key_func()->clone()); in copy_key_functors()
148 std::get<0>( my_input ).consume();
153 std::get<0>( my_input ).release();
163 return std::get<0>( my_input ).reserve( std::get<0>( out ) );
168 return std::get<0>(my_input).get_item(std::get<0>(out));
188 std::get<0>(my_input).set_my_key_func(std::get<0>(my_key_funcs));
[all …]
/oneTBB/test/conformance/
H A Dconformance_parallel_reduce.cpp145 CHECK(result == oneapi::tbb::parallel_reduce(range, identity, body, reduction).get()); in test_preduce_invoke_basic()
146 …::tbb::parallel_reduce(range, identity, body, reduction, oneapi::tbb::simple_partitioner()).get()); in test_preduce_invoke_basic()
147 …pi::tbb::parallel_reduce(range, identity, body, reduction, oneapi::tbb::auto_partitioner()).get()); in test_preduce_invoke_basic()
148 …::tbb::parallel_reduce(range, identity, body, reduction, oneapi::tbb::static_partitioner()).get()); in test_preduce_invoke_basic()
150 CHECK(result == oneapi::tbb::parallel_reduce(range, identity, body, reduction, aff).get()); in test_preduce_invoke_basic()
152 …HECK(result == oneapi::tbb::parallel_deterministic_reduce(range, identity, body, reduction).get()); in test_preduce_invoke_basic()
153 …l_deterministic_reduce(range, identity, body, reduction, oneapi::tbb::simple_partitioner()).get()); in test_preduce_invoke_basic()
154 …l_deterministic_reduce(range, identity, body, reduction, oneapi::tbb::static_partitioner()).get()); in test_preduce_invoke_basic()
162 for (auto i = range.begin(); i.get() != range.end().get(); ++i) { in __anon105f294c0302()
H A Dconformance_blocked_rangeNd.cpp119 …static void check_splitting(const range_t& range_split, const range_t& range_new, int(*get)(const … in check_splitting()
120 if (get(range_split.dim(N - 1).begin()) == get(range_new.dim(N - 1).begin())) { in check_splitting()
121 REQUIRE(get(range_split.dim(N - 1).end()) == get(range_new.dim(N - 1).end())); in check_splitting()
124 …REQUIRE((get(range_split.dim(N - 1).end()) == get(range_new.dim(N - 1).begin()) && !split_checker)… in check_splitting()
127 range_utils<range_t, N - 1>::check_splitting(range_split, range_new, get, split_checker); in check_splitting()
H A Dconformance_enumerable_thread_specific.cpp260 test_helper<T>::set(my_result, test_helper<T>::get(other)); in operator =()
274 test_helper<T>::set(my_result, test_helper<T>::get(other)); in operator =()
284 REQUIRE_MESSAGE(test_helper<T>::get(thread_local_value)==test_helper<T>::get(zero), in AssertClean()
471 REQUIRE(EXPECTED_SUM*p == test_helper<T>::get(range_sum)); in run_parallel_scalar_tests_nocombine()
474 REQUIRE(EXPECTED_SUM*p == test_helper<T>::get(cconst_sum)); in run_parallel_scalar_tests_nocombine()
475 REQUIRE(EXPECTED_SUM*p == test_helper<T>::get(assign_sum)); in run_parallel_scalar_tests_nocombine()
715 double result_value = test_helper<T>::get(sum); in run_parallel_vector_tests()
774 double result_value = test_helper<T>::get(sum); in run_cross_type_vector_tests()
790 double result_value = test_helper<T>::get(sum); in run_serial_scalar_tests()
810 double result_value = test_helper<T>::get(sum); in run_serial_vector_tests()
[all …]
H A Dconformance_composite_node.cpp34 int sum = std::get<0>(t) + std::get<1>(t); in operator ()()
53 CHECK_MESSAGE(( &std::get<N>(tuple1) == &std::get<N>(tuple2)), "ports not set correctly"); in compare_refs()
61 CHECK_MESSAGE((&std::get<0>(tuple1) == &std::get<0>(tuple2)), "port 0 not correctly set"); in compare_refs()
/oneTBB/examples/graph/binpack/
H A Dbinpack.cpp104 std::get<0>(p).try_put(item); in operator ()()
113 std::get<1>(p).try_put(my_bin); in operator ()()
120 std::get<0>(p).try_put(desired_bin_capacity + 1); // send out signal in operator ()()
129 std::get<0>(p).try_put(my_bin[i]); in operator ()()
132 std::get<0>(p).try_put(desired_bin_capacity + 1); // send out signal in operator ()()
139 std::get<1>(p).try_put(my_bin); in operator ()()
153 std::get<0>(p).try_put(desired_bin_capacity + 1); // send out signal in operator ()()
156 std::get<1>(p).try_put(my_bin); in operator ()()
182 std::get<0>(p).try_put(my_bin[i]); in operator ()()
190 std::get<1>(p).try_put(my_bin); in operator ()()
[all …]
/oneTBB/src/tbb/
H A Dgovernor.h100 thread_data* td = theTLS.get(); in get_thread_data()
105 td = theTLS.get(); in get_thread_data()
119 return theTLS.get(); in get_thread_data_if_initialized()
123 return theTLS.get() == td; in is_thread_data_set()
H A Dtls.h45 T get() { return (T)pthread_getspecific(my_key); } in get() function
59 T get() { return (T)TlsGetValue(my_key); }
70 T get() { return (T)FlsGetValue(my_key); }
/oneTBB/examples/common/utility/
H A Dfast_random.hpp38 unsigned short get() { in get() function in utility::FastRandom
39 return get(x); in get()
42 unsigned short get(std::size_t& seed) { in get() function in utility::FastRandom
/oneTBB/test/common/
H A Dutils.h158 result_type get( uint64_t seed ) {
165 result_type get( ) { return get(my_seed); }
379 return t1.lock().get() == t2.lock().get();
391 return t1.first.lock().get() == t2.first.lock().get() &&
392 t1.second.lock().get() == t2.second.lock().get();
H A Dconcurrent_associative_common.h62 static strip_key get( const Value& value ) { return strip_key(value.second); } in get() function
78 static Key get( const Key& value ) { return value; }
248 REQUIRE_MESSAGE(Value<Container>::get(*ins.first) == k1, "Element 1 has not been inserted");
252 REQUIRE_MESSAGE(Value<Container>::get(*it2) == k2, "Element 2 has not been inserted");
327 sum.second += Value<Container>::get(*i);
548 REQUIRE_MESSAGE((Value<T>::get(*it2) == 2), "Element 2 has not been inserted properly");
602 REQUIRE_MESSAGE((Value<T>::get(*it) == 1), "value");
689 REQUIRE_MESSAGE((Value<Container>::get(*(pib.first)) == val),
701 REQUIRE_MESSAGE((Value<Container>::get(*(pib.first)) == val),
757 REQUIRE(k == Value<Container>::get(*i));
[all …]
H A Dcontainers_common.h158 return std::hash<type>()(wr.get());
165 return std::hash<T>()(*wr.lock().get());
181 return *rhs.lock().get() == *lhs.lock().get();
/oneTBB/examples/graph/cholesky/
H A Dcholesky.cpp346 std::get<0>(ports).try_put(std::make_pair(t, A_block)); in operator ()()
359 tagged_tile_t in0 = std::get<0>(in); in operator ()()
360 tagged_tile_t in1 = std::get<1>(in); in operator ()()
376 std::get<0>(ports).try_put(std::make_pair(t, A_block)); in operator ()()
383 std::get<1>(ports).try_put(std::make_pair(t, A_block)); in operator ()()
403 tagged_tile_t in0 = std::get<0>(in); in operator ()()
404 tagged_tile_t in1 = std::get<1>(in); in operator ()()
405 tagged_tile_t in2 = std::get<2>(in); in operator ()()
438 std::get<0>(ports).try_put(std::make_pair(t, A_block)); in operator ()()
445 std::get<1>(ports).try_put(std::make_pair(t, A_block)); in operator ()()
[all …]
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp430 (**newMap)[polyIndx].get(&xlow, &ylow, &xhigh, &yhigh); in GenerateMap()
565 (*checkMap)[0].get(&mapLowX, &mapLowY, &mapXhigh, &mapYhigh); in CheckPolygonMap()
592 (*checkMap)[k].get(&xlow, &ylow, &xhigh, &yhigh); in CheckPolygonMap()
634 p1.get(&xl1, &yl1, &xh1, &yh1); in CompOnePolygon()
635 p2.get(&xl2, &yl2, &xh2, &yh2); in CompOnePolygon()
646 p1->get(&xl1, &yl1, &xh1, &yh1); in PolygonsEqual()
647 p2->get(&xl2, &yl2, &xh2, &yh2); in PolygonsEqual()
703 p.get(&xl, &yl, &xh, &yh); in operator <<()

12345