| /oneTBB/test/tbb/ |
| H A D | test_parallel_pipeline.cpp | 440 filter12 &= tbb::filter<t2,t2>(filter_type[i], [](t2 x) -> t2 { return x;}); in run_filter_set()
514 tbb::make_filter<t1, t2>(filter_type[1], []( t1 /*my_storage*/ ) -> t2 { in run_lambdas_test()
515 return t2(); } in run_lambdas_test()
517 tbb::make_filter<t2,void>(filter_type[2], [] ( t2 ) -> void { in run_lambdas_test() argument
534 tbb::filter<t1*, t2*>(filter_type[1], []( t1* my_storage ) -> t2* { in run_lambdas_test()
538 tbb::filter<t2*, void>(filter_type[2], [] ( t2* my_storage ) -> void { in run_lambdas_test()
539 my_storage->~t2(); in run_lambdas_test()
560 return t2(); } in run_lambdas_test()
578 tbb::filter<t1, t2*>(filter_type[1], []( t1 /*my_storage*/ ) -> t2* { in run_lambdas_test()
581 tbb::make_filter<t2*, void>(filter_type[2], [] ( t2* my_storage) -> void { in run_lambdas_test()
[all …]
|
| H A D | test_composite_node.cpp | 127 tiny_node t2(g, hidden); in test_tiny() local
128 …CHECK_MESSAGE( (&tbb::flow::input_port<0>(t2) == &t2.f1), "f1 not bound to input port 0 in composi… in test_tiny()
129 …CHECK_MESSAGE( (&tbb::flow::output_port<0>(t2) == &t2.f2), "f2 not bound to output port 0 in compo… in test_tiny()
134 tbb::flow::make_edge( t1, t2 ); in test_tiny()
135 tbb::flow::make_edge( t2 , f3 ); in test_tiny()
149 tbb::flow::remove_edge(t2, f3); in test_tiny()
150 tbb::flow::remove_edge(t1, t2); in test_tiny()
|
| H A D | test_concurrent_vector.cpp | 172 double t2 = TimeFindPrimes( utils::get_platform_max_threads() ); in TestFindPrimes() local
180 INFO("TestFindPrimes: t2 == " << t2 << " tx == " << tx << "k == " << tx / t2); in TestFindPrimes()
186 WARN_MESSAGE( tx <= 1.3*t2, "Warning: grow_by is pathetically slow"); in TestFindPrimes()
187 INFO("t2 == " << t2 << " tx == " << tx << "k == " << tx / t2); in TestFindPrimes()
|
| H A D | test_queue_node.cpp | 295 touches< T > t2( num_threads ); in test_parallel() local
296 utils::NativeParallelFor( num_threads, parallel_put_get<T>(q, t2) ); in test_parallel()
298 CHECK_MESSAGE( t2.validate_touches(), "" ); in test_parallel()
|
| H A D | test_concurrent_hash_map.cpp | 180 static bool IsEqual( const T& t1, const T& t2 ) { in IsEqual()
181 return (t1 == t2) && !(t1 != t2); in IsEqual()
|
| H A D | test_flow_graph_whitebox.cpp | 313 std::thread t2([&] { in TestFunctionNode() local
336 t2.join(); in TestFunctionNode()
|
| H A D | test_eh_algorithms.cpp | 1331 FilterSet( tbb::filter_mode m1, tbb::filter_mode m2, bool t1, bool t2 ) in FilterSet()
1332 : mode1(m1), mode2(m2), throw1(t1), throw2(t2) in FilterSet()
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | light.cpp | 84 flt b, disc, t1, t2, temp; in light_intersect() local
101 t2 = b + disc; in light_intersect()
102 if (t2 <= SPEPSILON) in light_intersect()
104 add_intersection(t2, (object *)l, ry); in light_intersect()
|
| H A D | sphere.cpp | 93 flt b, disc, t1, t2, temp; in sphere_intersect() local
106 t2 = b + disc; in sphere_intersect()
107 if (t2 <= SPEPSILON) in sphere_intersect()
109 add_intersection(t2, (object *)spr, ry); in sphere_intersect()
|
| H A D | quadric.cpp | 83 flt t1, t2; in quadric_intersect() local
118 t2 = (-Bq - disc) / (2.0 * Aq); in quadric_intersect()
120 add_intersection(t2, (object *)q, ry); in quadric_intersect()
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | polymain.cpp | 654 Polygon_map_t *t1, *t2; in ComparePolygonMaps() local
661 t2 = new Polygon_map_t; in ComparePolygonMaps()
662 t2->reserve(map2->size()); in ComparePolygonMaps()
664 t2->push_back(map2->at(i)); in ComparePolygonMaps()
668 sort(t2->begin(), t2->end()); in ComparePolygonMaps()
670 if (t1->size() != t2->size()) { in ComparePolygonMaps()
672 << int(t2->size()) << ")." in ComparePolygonMaps()
675 int maxSize = (int)((t1->size() < t2->size()) ? t1->size() : t2->size()); in ComparePolygonMaps()
677 if (!PolygonsEqual(&((*t1)[i]), &((*t2)[i]))) { in ComparePolygonMaps()
678 std::cout << "Error: polygons unequal (" << (*t1)[i] << " vs " << (*t2)[i] << "\n"; in ComparePolygonMaps()
[all …]
|
| /oneTBB/test/common/ |
| H A D | utils.h | 377 static bool compare( const std::weak_ptr<T> &t1, const std::weak_ptr<T> &t2 ) {
379 return t1.lock().get() == t2.lock().get();
383 static bool compare( const std::unique_ptr<T> &t1, const std::unique_ptr<T> &t2 ) {
385 return *t1 == *t2;
389 const std::pair< const std::weak_ptr<T1>, std::weak_ptr<T2> > &t2 ) {
391 return t1.first.lock().get() == t2.first.lock().get() &&
392 t1.second.lock().get() == t2.second.lock().get();
395 static bool compare( const T1 &t1, const T2 &t2 ) {
396 return t1 == t2;
399 bool operator()( T1 &t1, T2 &t2) const {
[all …]
|
| H A D | concurrent_priority_queue_common.h | 190 bool operator()( const T& t1, const T& t2 ) { in operator()
191 return *t1 < *t2; in operator()
195 bool operator()( const std::weak_ptr<T>& t1, const std::weak_ptr<T>& t2 ) { in operator()
196 return *t1.lock().get() < *t2.lock().get(); in operator()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_hash_map.cpp | 265 swap(t1, t2); in TestCopy()
270 t2.clear(); in TestCopy()
271 swap(t2, t1); in TestCopy()
275 CheckTable(t2,i); in TestCopy()
276 t2.clear(); in TestCopy()
277 t1.swap( t2 ); in TestCopy()
279 CheckTable(t2,0); in TestCopy()
333 t2.clear(); in TestAssignment()
407 CHECK(t2.erase(key)); in TestIteratorsAndRanges()
411 CHECK(t1 != t2); in TestIteratorsAndRanges()
[all …]
|
| H A D | conformance_tick_count.cpp | 77 oneapi::tbb::tick_count t2 = oneapi::tbb::tick_count::now(); variable
82 interval_type i = t2 - t1;
83 interval_type j = t3 - t2;
|
| H A D | conformance_concurrent_vector.cpp | 792 oneapi::tbb::tick_count t2 = oneapi::tbb::tick_count::now(); in TestParallelFor() local
794 " , check time = " << (t2 - t1).seconds()); in TestParallelFor()
|
| /oneTBB/examples/migration/recursive_fibonacci/ |
| H A D | fibonacci.cpp | 37 auto t2 = std::chrono::steady_clock::now(); in measure() local
39 auto time = std::chrono::duration_cast<std::chrono::milliseconds>(t2 - t1).count(); in measure()
|