Home
last modified time | relevance | path

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

12

/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp82 value a = 0, b = 1, sum; in SerialFib() local
85 sum = a + b; in SerialFib()
87 b = sum; in SerialFib()
89 return sum; in SerialFib()
175 SharedB = sum; in operator ()()
190 SharedB = sum; in operator ()()
330 Matrix2x2 sum; member
340 sum = sum * s.sum; in join()
345 sum = sum * Matrix1110; in operator ()()
354 return b.sum.v[0][0]; in parallel_reduceFib()
[all …]
/oneTBB/test/conformance/
H A Dconformance_enumerable_thread_specific.cpp159 …static inline void sum(minimalNComparable<N> &sum, const int addend ) { sum.set_value( sum.value()… in sum() function
160 …static inline void sum(minimalNComparable<N> &sum, const double addend ) { sum.set_value( sum.valu… in sum() function
169 static inline void sum(ThrowingConstructor &sum, const int addend ) { sum.m_cnt += addend; } in sum() function
611 T sum; member
623 test_helper<T>::sum(sum, *vi); in operator ()()
629 test_helper<T>::sum(sum,b.sum); in join()
664 test_helper<T>::sum(sum, pvrb.sum); in run_parallel_vector_tests()
750 test_helper<T>::sum(sum, pvrb.sum); in run_cross_type_vector_tests()
781 T sum; in run_serial_scalar_tests() local
786 test_helper<T>::sum(sum,1); in run_serial_scalar_tests()
[all …]
H A Dconformance_parallel_scan.cpp37 T sum; member in Body
41 …Body( const std::vector<T>& z_, std::vector<T>& y_, T id ) : identity(id), sum(id), y(y_), z(z_) {} in Body()
42 T get_sum() const { return sum; } in get_sum()
46 T temp = sum; in operator ()()
52 sum = temp; in operator ()()
54 Body( Body& b, oneapi::tbb::split ): identity(b.identity), sum(b.identity), y(b.y), z(b.z) {} in Body()
55 void reverse_join( Body& a ) { sum = Op()(a.sum, sum); } in reverse_join()
56 void assign( Body& b ) { sum = b.sum; } in assign()
121 …[&](const oneapi::tbb::blocked_range<std::size_t>& r, std::size_t sum, bool is_final) -> std::size…
123 std::size_t temp = sum; in __anonb56fb5590102()
H A Dconformance_tick_count.cpp90 interval_type sum; variable
91 sum += i;
92 sum += j;
93 CheckNear(sum.seconds(), k.seconds());
94 sum -= i;
95 CheckNear(sum.seconds(), j.seconds());
96 sum -= j;
97 CheckNear(sum.seconds(), 0.0);
/oneTBB/test/tbb/
H A Dtest_openmp.cpp41 data_type sum = 0; in SerialConvolve() local
43 sum += a[j] * b[i - j]; in SerialConvolve()
44 c[i] = sum; in SerialConvolve()
59 data_type sum; member in InnerBody
61 my_a(a), my_b(b), i(ii), sum(0) in InnerBody()
67 void join( InnerBody& x ) { sum += x.sum; } in join()
70 sum += my_a[j] * my_b[i - j]; in operator ()()
89 c[i] = body.sum; in OpenMP_TBB_Convolve()
116 data_type sum = 0; in operator ()() local
119 sum += my_a[j] * my_b[i - j]; in operator ()()
[all …]
H A Dtest_parallel_scan.cpp108 sum[i] = storage.my_total; in Scan()
126 Scan(r, is_final, storage, sum, addend); in ScanWithInit()
239 …Body(T init, const std::vector<T> &addend, std::vector<T> &sum) :my_addend(addend), my_sum(sum), m… in ScanBody() argument
261 ScanBody<T> sb(init, addend, sum); in operator ()()
296 std::vector<T> sum(MAXN); in TestAccumulator() local
306 sum[i] = -2; in TestAccumulator()
316 Accumulator<T> acc( 42, addend, sum); in TestAccumulator()
339 CHECK(acc.get_total()==sum[n-1]); in TestAccumulator()
343 CHECK(control_sum==sum); in TestAccumulator()
361 std::vector<T> sum(MAXN); in TestInterface() local
[all …]
H A Dtest_collaborative_call_once.cpp52 int sum{0}; member
56 sum += first_op; in operator ()()
161 REQUIRE(f.sum == 10);
168 REQUIRE(f.sum == 0);
175 REQUIRE(f.sum == -6);
H A Dtest_parallel_reduce.cpp472 size_t sum; member in FooBody
483 sum=0xDEADBEEF; in ~FooBody()
489 sum = 0; in FooBody()
496 sum = 0; in init()
510 sum += s.sum; in join()
515 ++sum; in operator ()()
538 REQUIRE_MESSAGE( f.sum==i, "Incorrect reduction" ); in TestSplitting()
H A Dtest_task_group.cpp282 #define FIB_TEST_EPILOGUE(sum) \ argument
284 CHECK( sum == numRepeats * F );
347 std::uintptr_t sum = 0; in RunFibTest() local
349 sum += RunFibTask<fib_task>(N); in RunFibTest()
350 FIB_TEST_EPILOGUE(sum); in RunFibTest()
361 atomic_t sum; in TestFibWithLambdas() local
362 sum = 0; in TestFibWithLambdas()
365 tg.run( [&](){sum += RunFibTask<FibTaskSymmetricTreeWithFunctor<task_group_type> >(N);} ); in TestFibWithLambdas()
367 FIB_TEST_EPILOGUE(sum); in TestFibWithLambdas()
/oneTBB/examples/migration/recursive_fibonacci/
H A Dfibonacci_two_tasks.h34 fib_continuation(int& s) : sum(s) {} in fib_continuation()
37 sum = x + y; in execute()
42 int& sum; member
72 int sum{}; in fibonacci_two_tasks()
75 task_emulation::create_root_task<fib_computation>(/* for root task = */ tg, n, &sum)); in fibonacci_two_tasks()
76 return sum; in fibonacci_two_tasks()
H A Dfibonacci_single_task.h36 sum enumerator
49 case state::sum : { in execute()
75 this->s = state::sum; in compute_impl()
91 int sum{}; in fibonacci_single_task()
93 …d_wait(tg, task_emulation::allocate_root_task<single_fib_task>(/* for root task = */ tg, n, &sum)); in fibonacci_single_task()
94 return sum; in fibonacci_single_task()
/oneTBB/doc/main/tbb_userguide/
H A Dparallel_reduce.rst14 float sum = 0;
16 sum += Foo(a[i]);
17 return sum;
49 float sum = my_sum;
52 sum += Foo(a[i]);
53 my_sum = sum;
81 variables (``a``, ``sum``, ``end``) for scalar values accessed inside
87 temporaries for only written variables (such as ``sum`` in the
144 float sum = 0; // WRONG – should be 'sum = my_sum".
147 sum += Foo(a[i]);
[all …]
H A DData_Flow_Graph.rst18 the middle nodes. As it receives each value, it adds it to a running sum
19 of values. When the application is run to completion, the value of sum
20 will be equal to the sum of the sequence of squares and cubes from 1 to
44 int sum = 0;
53 return sum += v;
66 cout << "Sum is " << sum << "\n";
74 - one to add values to the global sum
78 with an unlimited concurrency. The summer node updates the sum through a
167 int sum = 0;
176 return sum += v;
[all …]
H A Davoiding_data_races.rst49 cout << "global sum = " << global_sum
53 If you run the above example, it will likely calculate a global sum that
H A DParallelizing_Flow_Graph.rst26 adds them to a global sum. After all values in the sequence are
27 completely processed, sum is equal to the sum of the sequence of squares
/oneTBB/examples/parallel_for/tachyon/src/
H A Dvol.cpp165 flt t, tdist, dt, sum, tt; in scalar_volume_texture() local
259 sum = 0.0; in scalar_volume_texture()
280 sum += tt * scalar; in scalar_volume_texture()
286 if (sum < 1.0) { in scalar_volume_texture()
290 if (sum < 0.0) in scalar_volume_texture()
291 sum = 0.0; in scalar_volume_texture()
294 sum = 1.0; in scalar_volume_texture()
298 if (sum < 1.0) { /* spawn transmission rays / refraction */ in scalar_volume_texture()
301 transcol = shade_transmission(ry, hit, 1.0 - sum); in scalar_volume_texture()
H A Dextvol.cpp155 flt t, tdist, dt, ddt, sum, tt; in ext_volume_texture() local
252 sum = 0.0; in ext_volume_texture()
256 if (sum < 1.0) { in ext_volume_texture()
265 sum += transval; in ext_volume_texture()
318 sum = 1.0; in ext_volume_texture()
323 if (sum < 1.0) { /* spawn transmission rays / refraction */ in ext_volume_texture()
326 transcol = shade_transmission(ry, hit, 1.0 - sum); in ext_volume_texture()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_regression.cpp178 for (size_t a=1, b=1, sum=1; sum<=64*1024; ) { variable
179 passed &= TestReallocMsize(sum);
181 b = sum;
182 sum = a+b;
/oneTBB/examples/graph/binpack/
H A Dbinpack.cpp234 value_type sum = 0; in operator ()() local
241 sum += b[i]; in operator ()()
244 my_min = std::min(sum, my_min); in operator ()()
245 my_max = std::max(sum, my_max); in operator ()()
246 avg += sum; in operator ()()
247 running_count += sum; in operator ()()
249 std::cout << "]=" << sum << "; Done/Packed/Total cap: " << running_count << "/" in operator ()()
/oneTBB/doc/main/reference/
H A Dhelpers_for_expressing_graphs.rst64 int sum = 0;
67 sum += sub_sum;
106 int sum = 0;
110 sum += sub_sum;
/oneTBB/doc/GSG/
H A Dnext_steps.rst36 … is a typical example of a |short_name| algorithm. The sample calculates a sum of all integer numb…
43 int sum = oneapi::tbb::parallel_reduce(
56 printf("Sum: %d\n", sum);
87 … is a typical example of a |short_name| algorithm. The sample calculates a sum of all integer numb…
94 int sum = oneapi::tbb::parallel_reduce(
107 printf("Sum: %d\n", sum);
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp197 int sum = 0; in CountRateSum() local
199 sum += sounds[i].rates[part]; in CountRateSum()
200 return sum; in CountRateSum()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DReduction.rst94 // Reduce a subrange and partial sum
122 oneapi::tbb::combinable<T> sum(identity);
126 sum.local() += std::accumulate(r.begin(), r.end(), identity);
129 return sum.combine( []( const T& x, const T& y ) {return x+y;} );
196 // Reduce a subrange and partial sum
/oneTBB/include/oneapi/tbb/
H A Dparallel_scan.h104 final_sum( final_sum& sum, small_object_allocator& alloc ) : in final_sum()
105 m_body(sum.m_body, split()), m_wait_context(sum.m_wait_context), m_allocator(alloc) { in final_sum()
316 …finish_scan(sum_node_type*& return_slot, final_sum_type** sum, sum_node_type& result_, finish_scan… in finish_scan()
317 m_sum_slot(sum), in finish_scan()
/oneTBB/test/common/
H A Dconcurrent_associative_common.h323 std::pair<intptr_t, intptr_t> sum(0, 0); // count, sum
326 ++sum.first;
327 sum.second += Value<Container>::get(*i);
336 REQUIRE_MESSAGE(sum == sum1, "Mismatched ranges afted division");
338 return sum;
1304 int sum = 0;
1306 sum += first_factor * (*it) + second_factor;
1308 return sum % prime;
1312 int sum = 0;
1315 sum += first_factor * key[i++] + second_factor;
[all …]

12