Home
last modified time | relevance | path

Searched refs:step (Results 1 – 25 of 38) sorted by relevance

12

/oneTBB/examples/task_arena/fractal/
H A Dfractal.hpp38 float step; member in fractal
57 fractal(const drawing_memory &dm) : step(0.2), dm(dm) { in fractal()
69 cy += step; in move_up()
72 cy -= step; in move_down()
75 cx += step; in move_left()
78 cx -= step; in move_right()
83 step /= 2.; in zoom_in()
87 step *= 2.; in zoom_out()
H A Dmain.cpp76 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
/oneTBB/include/oneapi/tbb/
H A Dparallel_for.h307 if (step <= 0 ) in parallel_for_impl()
311 Index end = Index(last - first - 1ul) / step + Index(1); in parallel_for_impl()
313 parallel_for_body_wrapper<Function, Index> body(f, first, step); in parallel_for_impl()
321 void parallel_for(Index first, Index last, Index step, const Function& f) { in __TBB_requires()
328 parallel_for_impl<Index,Function,const simple_partitioner>(first, last, step, f, partitioner); in __TBB_requires()
334 parallel_for_impl<Index,Function,const auto_partitioner>(first, last, step, f, partitioner); in __TBB_requires()
346 parallel_for_impl(first, last, step, f, partitioner); in __TBB_requires()
383 if (step <= 0 ) in parallel_for_impl()
387 Index end = (last - first - Index(1)) / step + Index(1); in parallel_for_impl()
389 parallel_for_body_wrapper<Function, Index> body(f, first, step); in parallel_for_impl()
[all …]
/oneTBB/examples/parallel_reduce/pi/
H A Dmain.cpp28 pi_t step = pi_t(0.0); variable
35 step = pi_t(1.0) / num_intervals; in compute_pi_serial()
44 ret *= step; in compute_pi_serial()
64 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
H A Dcommon.h27 extern pi_t step;
32 pi_t dx = (pi_t(i) + pi_t(0.5)) * step; in pi_kernel()
H A Dpi.cpp35 step = pi_t(1.0) / num_intervals; in compute_pi_parallel()
42 ret = body.my_pi * step; in compute_pi_parallel()
/oneTBB/test/conformance/
H A Dconformance_parallel_for.cpp137 …void operator()( const T& first, const T& last, const T& step, const Body& f, empty_partitioner_ta… in operator ()()
138 oneapi::tbb::parallel_for( first, last, step, f ); in operator ()()
147 void operator()( const T& first, const T& last, const T& step, const Body& f, Partitioner& p ) { in operator ()()
148 oneapi::tbb::parallel_for( first, last, step, f, p ); in operator ()()
204 T step; in TestParallelForWithStepSupportHelper() local
205 for (step = 1; step < pfor_buffer_test_size; step++) { in TestParallelForWithStepSupportHelper()
207 if (step == 1){ in TestParallelForWithStepSupportHelper()
210 invoke_for(begin, pfor_buffer_test_size, step, TestFunctor<T>(), p); in TestParallelForWithStepSupportHelper()
213 for (T i = begin; i < pfor_buffer_test_size; i = i + step) { in TestParallelForWithStepSupportHelper()
/oneTBB/examples/common/utility/
H A Dutility.hpp365 int step_function_plus(int previous, double step) { in step_function_plus() argument
366 return static_cast<int>(previous + step); in step_function_plus()
436 friend std::istream& operator>>(std::istream& input_stream, thread_range_step& step) { in operator >>() argument
451 step.step_function = step_function_descriptors[i].function; in operator >>()
452 step.step_function_argument = function_argument; in operator >>()
463 ::utility::internal::thread_range_step step;
475 step(step_) { in thread_number_range()
508 internal::string_to(std::string(s, second_colon + 1), range.step); in operator >>()
511 range = thread_number_range(range.auto_number_of_threads, low, high, range.step); in operator >>()
523 step_function_descriptors[i].function != range.step.step_function; in operator <<()
[all …]
/oneTBB/test/tbb/
H A Dtest_mutex.h159 std::size_t step; in operator() local
160 while( (step = Order.fetch_add(chunk, std::memory_order_acquire)) < TestSize ) { in operator()
161 for (std::size_t i = 0; i < chunk && step < TestSize; ++i, ++step) { in operator()
162 state.flog_once(step); in operator()
H A Dtest_composite_node.cpp47 int step; member in my_input_body
49 my_input_body(int f, int s) : start(1), finish(f), step(s) {} in my_input_body()
54 start+=step; in operator ()()
447 int step = 4; in input_only_output_only_composite() local
452 src_type src(g, my_input_body(finish, step)); in input_only_output_only_composite()
482 for(int i = 1; i<finish/step; ++i) { in input_only_output_only_composite()
/oneTBB/examples/parallel_for/tachyon/src/
H A Dgrid.cpp494 step.x = 0; in grid_intersect()
500 step.x = out.x = -1; in grid_intersect()
505 step.x = 1; in grid_intersect()
513 step.y = 0; in grid_intersect()
519 step.y = out.y = -1; in grid_intersect()
524 step.y = 1; in grid_intersect()
532 step.z = 0; in grid_intersect()
538 step.z = out.z = -1; in grid_intersect()
543 step.z = 1; in grid_intersect()
569 curvox.x += step.x; in grid_intersect()
[all …]
/oneTBB/examples/graph/dining_philosophers/
H A DREADME.md23 …ow\[:high\[:(+|*|#)step\]\], where low and optional high are non-negative integers or 'auto' for t…
/oneTBB/doc/main/tbb_userguide/
H A DLambda_Expressions.rst75 expression ``parallel_for(first,last,step,f)`` is like writing
76 ``for(auto i=first; i<last; i+=step)f(i)`` except that
77 each f(i) can be evaluated in parallel if resources permit. The ``step``
H A DExceptions_and_Cancellation.rst25 The exception thrown in step 3 might be the original exception, or might
/oneTBB/test/common/
H A Dfp_control.h142 inline int SetNextFPMode( int mode, int step = 1 ) {
143 const int nextMode = (mode+step)%numFPModes;
H A Dconcurrent_ordered_common.h140 int step = index % 4 + 1; in test_concurrent_order()
141 bool reverse = (step % 2 == 0); in test_concurrent_order()
143 for (int i = 0; i < items; i += step) { in test_concurrent_order()
147 for (int i = items; i > 0; i -= step) { in test_concurrent_order()
H A Dutils_concurrency_limit.h58 thread_num_type step = 1; in concurrency_range() local
59 for(thread_num_type thread_num = 1; thread_num <= max_threads; thread_num += step++) in concurrency_range()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DAgglomeration.rst144 There agglomeration is part of a four step **PCAM** design method:
154 ones happen between tasks helps guide the agglomeration step.
162 scheduler does this step for you.
H A DLocal_Serializer.rst188 Step 2 could be done after step 3 in some contexts to increase
190 because if step 2 takes non-trivial time, it likely has side effects
/oneTBB/cmake/post_install/
H A DCMakeLists.txt15 # Add code signing as post-install step.
/oneTBB/examples/parallel_for_each/parallel_preorder/
H A Dmain.cpp65 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
/oneTBB/examples/parallel_reduce/primes/
H A Dmain.cpp90 for (int p = options.threads.first; p <= options.threads.last; p = options.threads.step(p)) { in main()
/oneTBB/examples/parallel_for/seismic/
H A Dmain.cpp95 p = options.threads.step(p)) { in main()
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp267 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
/oneTBB/examples/parallel_pipeline/square/
H A Dsquare.cpp248 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()

12