| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull_bench.cpp | 129 H.push_back(p1); in divide_and_conquer()
130 H.insert(H.end(), P_reduced.begin(), P_reduced.end()); in divide_and_conquer()
136 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
137 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
149 pointVec_t H; in quickhull() local
153 hull.insert(hull.end(), H.begin(), H.end()); in quickhull()
544 H.insert(H.end(), P_reduced.begin(), P_reduced.end()); in divide_and_conquer()
555 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
556 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
574 pointVec_t H; in quickhull() local
[all …]
|
| H A D | convex_hull_sample.cpp | 228 void divide_and_conquer(const pointVec_t &P, pointVec_t &H, point_t p1, point_t p2) { in divide_and_conquer() argument
234 H.push_back(p1); in divide_and_conquer()
235 appendVector(P_reduced, H); in divide_and_conquer()
241 appendVector(H1, H); in divide_and_conquer()
242 appendVector(H2, H); in divide_and_conquer()
255 pointVec_t H; in quickhull() local
258 divide_and_conquer(points, H, p_minx, p_maxx); in quickhull()
260 appendVector(H, hull); in quickhull()
|
| /oneTBB/src/tbb/ |
| H A D | arena_slot.cpp | 154 std::size_t H = head.load(std::memory_order_relaxed); // mirror in steal_task() local
155 std::size_t H0 = H; in steal_task()
159 H = ++head; in steal_task()
162 if ((std::intptr_t)H > (std::intptr_t)(tail.load(std::memory_order_acquire))) { in steal_task()
168 result = victim_pool[H-1]; in steal_task()
187 __TBB_ASSERT( H0 == H-1, nullptr ); in steal_task()
189 H0 = H; in steal_task()
195 poison_pointer( victim_pool[H-1] ); in steal_task()
198 victim_pool[H-1] = nullptr; in steal_task()
|
| H A D | arena_slot.h | 228 std::size_t H = head.load(std::memory_order_relaxed); // mirror in prepare_task_pool() local
232 for ( std::size_t i = H; i < T; ++i ) in prepare_task_pool()
247 for ( std::size_t i = H; i < T; ++i ) { in prepare_task_pool()
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | shade.cpp | 234 vector H, V; in shade_phong() local
239 VAdd(&V, L, &H); in shade_phong()
240 VScale(&H, 0.5); in shade_phong()
241 VNorm(&H); in shade_phong()
242 inten = VDot(N, &H); in shade_phong()
|
| /oneTBB/src/tbb/def/ |
| H A D | win32-tbb.def | 97 ?isolate_within_arena@r1@detail@tbb@@YAXAAVdelegate_base@d1@23@H@Z
109 ?constraints_default_concurrency@r1@detail@tbb@@YAHABUconstraints@d1@23@H@Z
110 ?constraints_threads_per_core@r1@detail@tbb@@YAHABUconstraints@d1@23@H@Z
129 ?finalize@r1@detail@tbb@@YA_NAAVtask_scheduler_handle@d1@23@H@Z
|
| /oneTBB/examples/graph/fgbzip2/ |
| H A D | blocksort.cpp | 274 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort() local
320 H = 1; in fallbackSort()
323 VPrintf1(" depth %6d has ", H); in fallbackSort()
329 k = fmap[i] - H; in fallbackSort()
383 H *= 2; in fallbackSort()
384 if (H > nblock || nNotDone == 0) in fallbackSort()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Parallelizing_Flow_Graph.rst | 24 function F. For each value in the sequence, G squares the value and H
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | README.md | 4 …, as described in Parallelizing the [Polygon Overlay Problem Using Orca, by H.F. Langendoen](http:…
|