Home
last modified time | relevance | path

Searched refs:depth (Results 1 – 25 of 33) sorted by relevance

12

/oneTBB/test/common/
H A Dparallel_for_each_common.h110 do_work(depth, feeder); in operator()
125 do_work(depth, feeder); in operator()
132 do_work(depth, feeder); in operator()
139 do_work(depth, feeder); in operator()
160 do_work(depth, feeder); in operator()
167 void TestBodyMove(size_t depth) { in TestBodyMove() argument
180 void TestBody(size_t depth) { in TestBody() argument
185 Iterator end(a_depths + depth); in TestBody()
193 TestBody<Body, Iterator>(depth); in TestBodyWithMove()
219 Iterator end(a_depths + depth); in TestGenericLambda()
[all …]
/oneTBB/test/tbb/
H A Dtest_parallel_for_each.cpp129 for(size_t depth = 0; depth <= depths_nubmer; ++depth) { variable
131 for (size_t i=0; i < depth; ++i)
143 for(size_t depth = 0; depth <= depths_nubmer; ++depth) { variable
145 for (size_t i=0; i < depth; ++i)
147 TestIterator_Modifiable<value_t*>(depth);
157 for(size_t depth = 0; depth <= depths_nubmer; ++depth) { variable
159 for (size_t i=0; i < depth; ++i)
185 for(size_t depth = 0; depth <= depths_nubmer; ++depth) { variable
187 for (size_t i=0; i < depth; ++i)
190 TestIterator_Common<Iterator>(depth);
[all …]
/oneTBB/test/conformance/
H A Dconformance_parallel_for_each.cpp28 for( size_t depth = 0; depth <= depths_nubmer; ++depth ) { variable
30 for ( size_t i=0; i < depth; ++i )
32 TestIterator_Const<utils::InputIterator<value_t>>(depth);
33 TestIterator_Move<utils::InputIterator<value_t>>(depth);
35 TestGenericLambdasCommon<utils::InputIterator<value_t>>(depth);
/oneTBB/examples/parallel_for/tachyon/src/
H A Dtrace.taskq.cpp158 static void parallel_thread(patch *pchin, int depth) { in parallel_thread() argument
160 col[0] = col[1] = col[2] = (32 * depth) % 256; in parallel_thread()
161 depth++; in parallel_thread()
162 #pragma intel omp taskq firstprivate(depth) in parallel_thread()
184 parallel_thread(&pch, depth); in parallel_thread()
H A Dshade.cpp192 specray.depth = incident->depth - 1; /* go up a level in recursion depth */ in shade_reflection()
215 transray.depth = incident->depth - 1; /* go up a level in recursion depth */ in shade_transmission()
H A Dtgafile.cpp155 int format, width, height, w1, w2, h1, h2, depth, flags; in readtga() local
182 depth = getc(ifp); /* image pixel size */ in readtga()
185 if ((format != 2) || (depth != 24)) { in readtga()
H A Dtrace.hpp87 void thread_trace1(thr_parms *, patch *, int depth);
H A Dcamera.cpp99 newray.depth = scene->raydepth; in camray()
H A Dtrace_rest.cpp67 if (primary->depth > 0) { in trace()
H A Dtypes.hpp204 unsigned int depth; /* levels left to recurse.. (maxdepth - curdepth) */ member
/oneTBB/examples/common/gui/
H A Dvideo.hpp64 depth_t depth, red_shift, green_shift, blue_shift; member in video
157 dmem.pixel_depth = depth; in get_drawing_memory()
167 else if (depth >= 24) in get_color()
174 else if (depth > 0) { in get_color()
H A Dmacvideo.cpp37 : depth(24), in video()
45 : depth(24), in video()
H A Dconvideo.cpp48 : depth(24), in video()
H A Dxvideo.cpp152 depth = dispdepth = vinfo.depth; in init_window()
/oneTBB/doc/main/tbb_userguide/
H A DHow_Task_Scheduler_Works.rst19 To achieve this, a balance between depth-first and breadth-first execution strategies
20 must be reached. Assuming that the task graph is finite, depth-first is better for
28 …number of nodes that co-exist simultaneously. In contrast, depth-first execution creates the same …
47 which causes the depth-first execution until the thread runs out of work.
/oneTBB/doc/main/reference/
H A Dmake_node_set_function.rst11 :depth: 1
H A Dparallel_sort_ranges_extension.rst8 :depth: 1
H A Dmake_edges_function.rst11 :depth: 1
H A Dtype_specified_message_keys.rst11 :depth: 1
H A Dconstructors_for_nodes.rst11 :depth: 1
H A Dfollows_and_precedes_functions.rst15 :depth: 1
H A Dhelpers_for_expressing_graphs.rst13 :depth: 1
H A Dparallel_for_each_semantics.rst8 :depth: 1
/oneTBB/doc/main/reference/scalable_memory_pools/
H A Dfixed_pool_cls.rst13 :depth: 1
H A Dmemory_pool_cls.rst13 :depth: 1

12