Home
last modified time | relevance | path

Searched refs:t1 (Results 1 – 25 of 31) sorted by relevance

12

/oneTBB/test/tbb/
H A Dtest_parallel_pipeline.cpp419 input_filter<t1>& i_filter, in run_filter_set()
420 middle_filter<t1,t2>& m_filter, in run_filter_set() argument
509 tbb::make_filter<void, t1>(filter_type[0], [&counter]( tbb::flow_control& control ) -> t1 { in run_lambdas_test()
512 return t1(); } in run_lambdas_test()
514 tbb::make_filter<t1, t2>(filter_type[1], []( t1 /*my_storage*/ ) -> t2 { in run_lambdas_test() argument
527 tbb::filter<void,t1*>(filter_type[0], [&counter]( tbb::flow_control& control ) -> t1* { in run_lambdas_test()
534 tbb::filter<t1*, t2*>(filter_type[1], []( t1* my_storage ) -> t2* { in run_lambdas_test()
535 my_storage->~t1(); in run_lambdas_test()
558 my_storage->~t1(); in run_lambdas_test()
576 return t1(); } in run_lambdas_test()
[all …]
H A Dtest_composite_node.cpp120 tiny_node t1(g, hidden); in test_tiny() local
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()
124 test_input_ports_return_ref(t1); in test_tiny()
125 test_output_ports_return_ref(t1); in test_tiny()
133 tbb::flow::make_edge( t, t1 ); in test_tiny()
134 tbb::flow::make_edge( t1, t2 ); in test_tiny()
150 tbb::flow::remove_edge(t1, t2); in test_tiny()
152 tbb::flow::make_edge( t1 , f3 ); in test_tiny()
H A Dtest_join_node.h1495 OQType t1;
1496 CHECK_MESSAGE( (!oq0.try_get(t1)&&!oq1.try_get(t1)), "oq0 and oq1 not empty");
1506 OQType t1;
1508 … CHECK_MESSAGE( (oq1.try_get(t1)&&std::get<0>(t1)==3&&std::get<1>(t1)==2), "Error in oq1 output");
1581 OQType t1;
1583 … CHECK_MESSAGE( (oq1.try_get(t1)&&std::get<0>(t1)==1&&std::get<1>(t1)==2), "Error in oq1 output");
1677 CheckTupleType t1;
1679 …CHECK_MESSAGE( (checkTupleQueue1.try_get(t1)&&std::get<0>(t1)==loop&&(int)std::get<1>(t1)==loop), …
1722 CheckTupleType t1;
1724 …CHECK_MESSAGE( (checkTupleQueue1.try_get(t1)&&std::get<0>(t1)==lp1 && std::get<1>(t1)==lp1), "Erro…
H A Dtest_semaphore.cpp66 tbb::tick_count t1 = tbb::tick_count::now(); in operator ()() local
67 tottime[tid] += (t1 - t0).seconds(); in operator ()()
/oneTBB/test/conformance/
H A Dconformance_tick_count.cpp30 oneapi::tbb::tick_count t1; variable
31 utils::suppress_unused_warning(t1);
75 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); variable
82 interval_type i = t2 - t1;
84 interval_type k = t3 - t1;
H A Dconformance_concurrent_hash_map.cpp255 test_table_type t1; in TestCopy() local
259 FillTable(t1,i); in TestCopy()
265 swap(t1, t2); in TestCopy()
271 swap(t2, t1); in TestCopy()
277 t1.swap( t2 ); in TestCopy()
328 t1.clear(); in TestAssignment()
402 YourTable1 t1; in TestIteratorsAndRanges() local
403 FillTable( t1, 10 ); in TestIteratorsAndRanges()
405 YourTable2 t2(t1.begin(), t1.end()); in TestIteratorsAndRanges()
411 CHECK(t1 != t2); in TestIteratorsAndRanges()
[all …]
/oneTBB/examples/parallel_for/tachyon/src/
H A Dlight.cpp84 flt b, disc, t1, t2, temp; in light_intersect() local
106 t1 = b - disc; in light_intersect()
107 if (t1 > SPEPSILON) in light_intersect()
108 add_intersection(t1, (object *)l, ry); in light_intersect()
H A Dsphere.cpp93 flt b, disc, t1, t2, temp; in sphere_intersect() local
111 t1 = b - disc; in sphere_intersect()
112 if (t1 > SPEPSILON) in sphere_intersect()
113 add_intersection(t1, (object *)spr, ry); in sphere_intersect()
H A Dtachyon_video.cpp111 timer t0, t1; in rt_finalize() local
116 t1 = gettimer(); in rt_finalize()
117 } while ((timertime(t0, t1) < 10 || video->pausing) && video->next_frame()); in rt_finalize()
H A Dquadric.cpp83 flt t1, t2; in quadric_intersect() local
110 t1 = -Cq / Bq; in quadric_intersect()
111 add_intersection(t1, (object *)q, ry); in quadric_intersect()
117 t1 = (-Bq + disc) / (2.0 * Aq); in quadric_intersect()
119 add_intersection(t1, (object *)q, ry); in quadric_intersect()
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp654 Polygon_map_t *t1, *t2; in ComparePolygonMaps() local
656 t1 = new Polygon_map_t; in ComparePolygonMaps()
657 t1->reserve(map1->size()); in ComparePolygonMaps()
659 t1->push_back(map1->at(i)); in ComparePolygonMaps()
667 sort(t1->begin(), t1->end()); in ComparePolygonMaps()
670 if (t1->size() != t2->size()) { in ComparePolygonMaps()
671 std::cout << "Error: maps not the same size ( " << int(t1->size()) << " vs " 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 …]
H A Dpover_video.cpp74 oneapi::tbb::tick_count t0, t1; in on_process() local
105 t1 = oneapi::tbb::tick_count::now(); in on_process()
106 std::cout << "Serial overlay took " << (t1 - t0).seconds() * 1000 << " msec" in on_process()
108 gSerialTime = (t1 - t0).seconds() * 1000; in on_process()
H A Dpolyover.cpp172 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in NaiveParallelOverlay() local
174 double naiveParallelTime = (t1 - t0).seconds() * 1000; in NaiveParallelOverlay()
407 oneapi::tbb::tick_count t0, t1; in SplitParallelOverlay() local
441 t1 = oneapi::tbb::tick_count::now(); in SplitParallelOverlay()
442 domainSplitParallelTime = (t1 - t0).seconds() * 1000; in SplitParallelOverlay()
536 oneapi::tbb::tick_count t0, t1; in SplitParallelOverlayCV() local
568 t1 = oneapi::tbb::tick_count::now(); in SplitParallelOverlayCV()
569 domainSplitParallelTime = (t1 - t0).seconds() * 1000; in SplitParallelOverlayCV()
671 oneapi::tbb::tick_count t0, t1; in SplitParallelOverlayETS() local
704 t1 = oneapi::tbb::tick_count::now(); in SplitParallelOverlayETS()
[all …]
/oneTBB/examples/parallel_for/game_of_life/
H A DEvolution.cpp63 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in Run() local
65 double work_time = (t1 - t0).seconds(); in Run()
114 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in Run() local
116 double real_work_time = (t1 - t0).seconds(); in Run()
/oneTBB/test/common/
H A Dutils.h377 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;
388 static bool compare( const std::pair< const std::weak_ptr<T1>, std::weak_ptr<T2> > &t1,
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 Dconcurrent_priority_queue_common.h190 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/include/oneapi/tbb/
H A Dtick_count.h52 friend interval_t operator-( const tick_count& t1, const tick_count& t0 );
76 friend interval_t operator-( const tick_count& t1, const tick_count& t0 ) {
77 return tick_count::interval_t(t1.my_time_point - t0.my_time_point);
/oneTBB/examples/migration/recursive_fibonacci/
H A Dfibonacci.cpp35 auto t1 = std::chrono::steady_clock::now(); in measure() local
39 auto time = std::chrono::duration_cast<std::chrono::milliseconds>(t2 - t1).count(); in measure()
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A Dshortpath.cpp310 oneapi::tbb::tick_count t0, t1; in main() local
317 t1 = oneapi::tbb::tick_count::now(); in main()
322 (t1 - t0).seconds(), in main()
330 (t1 - t0).seconds(), in main()
336 utility::report_elapsed_time((t1 - t0).seconds()); in main()
/oneTBB/doc/main/tbb_userguide/
H A DTiming.rst27 tick_count t1 = tick_count::now();
28 printf("work took %g seconds\n",(t1-t0).seconds());
/oneTBB/examples/graph/som/
H A Dsom_graph.cpp493 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in main() local
494 double nSeconds = (t1 - t0).seconds(); in main()
566 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in main() local
572 (t1 - t0).seconds()); in main()
574 single_time = (t1 - t0).seconds(); in main()
576 printf(": speedup == %g\n", single_time / (t1 - t0).seconds()); in main()
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp102 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in CountOccurrences() local
124 "total = %d unique = %u time = %g\n", n, unsigned(table.size()), (t1 - t0).seconds()); in CountOccurrences()
/oneTBB/examples/parallel_pipeline/square/
H A Dsquare.cpp215 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in run_pipeline() local
221 printf("time = %g\n", (t1 - t0).seconds()); in run_pipeline()
/oneTBB/examples/task_arena/fractal/
H A Dfractal.cpp171 oneapi::tbb::tick_count t1 = oneapi::tbb::tick_count::now(); in calc_fractal() local
174 printf(" %s fractal finished. Time: %g\n", num ? "Second" : "First", (t1 - t0).seconds()); in calc_fractal()
/oneTBB/examples/graph/cholesky/
H A Dcholesky.cpp166 oneapi::tbb::tick_count t0, t1; in operator ()() local
176 t1 = oneapi::tbb::tick_count::now(); in operator ()()
184 t1 = oneapi::tbb::tick_count::now(); in operator ()()
188 elapsed_time += (t1 - t0).seconds(); in operator ()()

12