Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 68) sorted by relevance

123

/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DGraph.cpp32 for (std::size_t k = 0; k < number_of_nodes; ++k) { in create_random_dag() local
33 Cell& c = my_vertex_set[k]; in create_random_dag()
35 if (op > int(k)) in create_random_dag()
36 op = int(k); in create_random_dag()
55 for (std::size_t k = 0; k < my_vertex_set.size(); ++k) { in print() local
56 std::cout << "Cell " << k << ":"; in print()
64 for (std::size_t k = 0; k < my_vertex_set.size(); ++k) { in get_root_set() local
65 my_vertex_set[k].successor.clear(); in get_root_set()
68 for (std::size_t k = 0; k < my_vertex_set.size(); ++k) { in get_root_set() local
69 Cell& c = my_vertex_set[k]; in get_root_set()
[all …]
H A Dparallel_preorder.cpp37 for (std::size_t k = 0; k < c->successor.size(); ++k) { in operator ()() local
38 Cell* successor = c->successor[k]; in operator ()()
H A DMatrix.hpp55 for (int k = 0; k < n; ++k) in operator *() local
57 result.array[i][j] += x.array[i][k] * y.array[k][j]; in operator *()
/oneTBB/examples/graph/cholesky/
H A Dcholesky.cpp229 double *A_block = tile[k][k]; in call_dpotf2()
238 double *L_block = tile[k][k]; in call_dtrsm()
273 for (int k = 0; k < p; ++k) { in func() local
437 if (k != p - 1 && j == k + 1 && i == k + 1) { in operator ()()
448 if (j != k + 1 && i != k + 1) { in operator ()()
554 for (int k = p - 1; k >= 0; --k) { in func() local
565 make_edge(*c[k], *t[k][j]); in func()
573 if (k < p - 2 && k + 1 != j && k + 1 != i) { in func()
577 make_edge(*t[k][j], *u[k][j][i]); in func()
590 make_edge(*u[k][k + 1][k + 1], *c[k + 1]); in func()
[all …]
H A Dinit.cpp36 for (int k = 0; k < j; ++k) { in posdef_gen() local
38 L[k * n + j] = in posdef_gen()
39 (((j * k) / ((double)(j + 1)) / ((double)(k + 2)) * 2.0) - 1.0) / ((double)n); in posdef_gen()
/oneTBB/test/common/
H A Dallocator_test_common.h75 return char(j*3 ^ j>>4 ^ k); in PseudoRandomValue()
175 for(std::size_t k = 0; k < 100; ++k) { in TestAllocatorConcept() local
176 array[k] = a.allocate(k); in TestAllocatorConcept()
179 s[j] = PseudoRandomValue(j, k); in TestAllocatorConcept()
183 for(std::size_t k = 0; k < 100; ++k) { in TestAllocatorConcept() local
187 a.deallocate(array[k], k); in TestAllocatorConcept()
256 for(std::size_t k = 0; k < 256; ++k) in operator() local
257 array[k] = nullptr; in operator()
258 for(std::size_t k = 0; k < max_k; ++k) { in operator() local
263 for(std::size_t k = 0; k < 256; ++k) in operator() local
[all …]
H A Drwm_upgrade_downgrade.h47 for (int k = 0; k < 10; ++k) { in operator() local
/oneTBB/examples/getting_started/sub_string_finder/
H A Dsub_string_finder_extended.cpp36 for (std::size_t k = 0; k < limit; ++k) { in SerialSubStringFinder() local
37 if (str[i + k] != str[j + k]) in SerialSubStringFinder()
39 if (k > max_size) { in SerialSubStringFinder()
40 max_size = k; in SerialSubStringFinder()
63 for (std::size_t k = 0; k < limit; ++k) { in operator ()() local
64 if (str[i + k] != str[j + k]) in operator ()()
66 if (k > max_size) { in operator ()()
67 max_size = k; in operator ()()
H A Dsub_string_finder.cpp43 for (std::size_t k = 0; k < limit; ++k) { in operator ()() local
44 if (str[i + k] != str[j + k]) in operator ()()
46 if (k > max_size) { in operator ()()
47 max_size = k; in operator ()()
H A Dsub_string_finder_pretty.cpp40 for (std::size_t k = 0; k < limit; ++k) { in operator ()() local
41 if (str[i + k] != str[j + k]) in operator ()()
43 if (k + 1 > max_size) { in operator ()()
44 max_size = k + 1; in operator ()()
/oneTBB/examples/parallel_reduce/primes/
H A Dprimes.cpp88 for (std::size_t k = 0; k < n_factor; ++k) in find_primes_in_window() local
89 my_striker[k] = strike(my_striker[k] - m / 2, window_size / 2, my_factor[k]); in find_primes_in_window()
91 for (NumberType k = 0; k < window_size / 2; ++k) { in find_primes_in_window() local
92 if (!is_composite[k]) { in find_primes_in_window()
94 printf("%ld\n", long(start + 2 * k + 1)); in find_primes_in_window()
127 for (std::size_t k = 0; k < n_factor; ++k) { in initialize() local
128 NumberType f = my_factor[k]; in initialize()
130 my_striker[k] = (p & 1 ? p + 2 * f : p + f) / 2; in initialize()
131 assert(m / 2 <= my_striker[k]); in initialize()
/oneTBB/test/conformance/
H A Dconformance_blocked_range.cpp62 for( std::size_t k=1; k<10; ++k ) { in SerialTest() local
64 range_type r( i, j, k ); in SerialTest()
71 CHECK( r.grainsize()==k); in SerialTest()
74 CHECK( r.is_divisible()==(std::size_t(y-x)>k) ); in SerialTest()
81 CHECK( r.grainsize()==k ); in SerialTest()
82 CHECK( r2.grainsize()==k ); in SerialTest()
104 for (int k=0; k<N; ++k) { in ParallelTest() local
105 if (Array[k] != (k<i)) CHECK(false); in ParallelTest()
106 Array[k] = 0; in ParallelTest()
H A Dconformance_blocked_range3d.cpp147 … for( oneapi::tbb::blocked_range<int>::const_iterator k=r.cols().begin(); k!=r.cols().end(); ++k ) in operator ()() local
148 ++Array[i][j][k]; in operator ()()
155 for( int k=0; k<N; k=k<3 ? k+1 : k*3 ) { in ParallelTest() local
156 const oneapi::tbb::blocked_range3d<int> r( 0, i, 5, 0, j, 3, 0, k, 1 ); in ParallelTest()
161 if( Array[l][m][n] != (l<i && m<j && n<k) ) REQUIRE(false); in ParallelTest()
H A Dconformance_concurrent_queue.cpp182 for (std::size_t k = 0; k < (std::size_t)size; ++k) { in TestIteratorAux() local
673 for (std::size_t k = 0; k < 3; ++k) in operator ()() local
674 PopKind[k] += pop_kind[k]; in operator ()()
689 for (std::size_t k=0; k < 3; ++k) { in TestPushPop() local
711 for (std::size_t k = 0; k < nthread; ++k) { in TestPushPop() local
733 for (std::size_t k = 0; k < 2; ++k) { in TestPushPop() local
857 for( int k=0; k<N; k++ ) { in TestExceptionBody() local
864 for( int k=0; k<n_pushed; k++ ) { in TestExceptionBody() local
880 for( int k=0; k<(int)tc; k++ ) { in TestExceptionBody() local
888 for( int k=0; k<1000; k++ ) { in TestExceptionBody() local
[all …]
H A Dconformance_tick_count.cpp84 interval_type k = t3 - t1; variable
87 CheckNear((i + j).seconds(), k.seconds());
88 CheckNear((k - j).seconds(), i.seconds());
89 CheckNear(((k - j) + (j - i)).seconds(), k.seconds() - i.seconds());
93 CheckNear(sum.seconds(), k.seconds());
H A Dconformance_concurrent_hash_map.cpp164 return k.key; in hash()
351 Iterator1 i(j), k; in TestIteratorAssignment() local
354 k = j; in TestIteratorAssignment()
355 CHECK(k==j); in TestIteratorAssignment()
356 CHECK(!(k!=j)); in TestIteratorAssignment()
751 CHECK_FAST_MESSAGE((0<=k && size_t(k)<n), "out of bounds key" ); in TraverseTable()
868 CHECK_FAST((0<=k && size_t(k)<n)); in operator ()()
876 for( size_t k=0; k<n; ++k ) { in Check() local
877 if( array[k] != int(UseKey(k)) ) { in Check()
879 int(k), int(array[k]), int(UseKey(k)), int(k)); in Check()
[all …]
/oneTBB/src/tbb/
H A Ddynamic_link.cpp131 for ( std::size_t k = 0; k < required; ++k ) { in resolve_symbols() local
132 dynamic_link_descriptor const & desc = descriptors[k]; in resolve_symbols()
137 h[k] = addr; in resolve_symbols()
142 for( std::size_t k = 0; k < required; ++k ) in resolve_symbols() local
143 *descriptors[k].handler = h[k]; in resolve_symbols()
351 for ( std::size_t k = 0; k < required; ++k ) in weak_symbol_link() local
352 if ( !descriptors[k].ptr ) in weak_symbol_link()
355 for ( std::size_t k = 0; k < required; ++k ) in weak_symbol_link() local
356 *descriptors[k].handler = (pointer_to_handler) descriptors[k].ptr; in weak_symbol_link()
/oneTBB/test/tbb/
H A Dtest_mutex.h60 for (long k = 0; k < N; ++k) { in Invariant() local
61 value[k] = 0; in Invariant()
66 for (long k = 0; k < N; ++k) { in update() local
67 ++value[k]; in update()
74 for (long k = 0; k < N; ++k) { in value_is() local
75 if ((tmp = value[k]) != expected_value) { in value_is()
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_queue_base.h114 k &= -queue_rep_type::n_queue; in prepare_page()
121 invalidate_page( k ); in prepare_page()
171 prepare_page(k, base, allocator, p); in abort_push()
177 k &= -queue_rep_type::n_queue; in pop()
178 spin_wait_until_eq(head_counter, k); in pop()
343 if (c == k) return; in spin_wait_until_my_turn()
489 return k * phi % n_queue; in index()
494 return array[index(k)]; in choose()
545 std::size_t k = my_head_counter; in advance() local
548 get_item(tmp, k); in advance()
[all …]
H A D_flow_graph_tagged_buffer_impl.h215 bool find_ref_with_key(const Knoref& k, pointer_type &v) { in find_ref_with_key() argument
216 size_t i = this->hash(k) & mask(); in find_ref_with_key()
220 if(this->equal(tbb::detail::invoke(*my_key, *pv), k)) { in find_ref_with_key()
228 bool find_with_key( const Knoref& k, value_type &v) { in find_with_key() argument
230 if(find_ref_with_key(k, p)) { in find_with_key()
238 void delete_with_key(const Knoref& k) { in delete_with_key() argument
239 size_t h = this->hash(k) & mask(); in delete_with_key()
244 if(this->equal(tbb::detail::invoke(*my_key, *vp), k)) { in delete_with_key()
/oneTBB/examples/graph/fgbzip2/
H A Dblocksort.cpp297 ftab[j] = k; in fallbackSort()
298 fmap[k] = i; in fallbackSort()
330 if (k < 0) in fallbackSort()
340 while (ISSET_BH(k) && UNALIGNED_BH(k)) in fallbackSort()
341 k++; in fallbackSort()
351 while (!ISSET_BH(k) && UNALIGNED_BH(k)) in fallbackSort()
352 k++; in fallbackSort()
424 Int32 k; in mainGtU() local
514 k = nblock + 8; in mainGtU()
611 k -= 8; in mainGtU()
[all …]
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp79 for (int k = 0; k < 4; ++k) { in InitializeUniverse() local
86 memcpy(c, MaterialColor[k], sizeof(c)); in InitializeUniverse()
90 ColorMap[k][i] = colorizer.get_color(c[2], c[1], c[0]); in InitializeUniverse()
95 for (int k = DamperSize - 1; k > 0; --k) { in InitializeUniverse() local
98 D[k][j] *= d; in InitializeUniverse()
99 D[UniverseHeight - 1 - k][j] *= d; in InitializeUniverse()
102 D[i][k] *= d; in InitializeUniverse()
103 D[i][UniverseWidth - 1 - k] *= d; in InitializeUniverse()
/oneTBB/include/oneapi/tbb/
H A Dparallel_sort.h153 for( RandomAccessIterator k = range.begin(); k != my_end; ++k, ++i ) { in operator() local
157 if( comp(*(k), *(k - 1)) ) { in operator()
191 RandomAccessIterator k = begin; in parallel_quick_sort() local
192 for( ; k != begin + serial_cutoff; ++k ) { in parallel_quick_sort()
193 if( comp(*(k + 1), *k) ) { in parallel_quick_sort()
200 parallel_for(blocked_range<RandomAccessIterator>(k + 1, end), in parallel_quick_sort()
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp494 for (int k = i; k <= ilen && yok; k++) { in GenerateMap() local
495 yok = (tempMap[k * ySize + jlen + 1] == 0); in GenerateMap()
508 for (int k = i; k <= ilen; k++) { in GenerateMap() local
510 tempMap[k * ySize + l] = gNPolygons; in GenerateMap()
591 for (int k = 1; k < int(checkMap->size()) && !anError; k++) { in CheckPolygonMap() local
592 (*checkMap)[k].get(&xlow, &ylow, &xhigh, &yhigh); in CheckPolygonMap()
610 std::cout << "checkMap error: polygons " << cArray[indx(i, j)] << " and " << k in CheckPolygonMap()
615 cArray[indx(i, j)] = k; in CheckPolygonMap()
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp211 bool equal(const int j, const int k) const { in equal()
212 return j == k; in equal()
214 std::size_t hash(const int k) const { in hash()
215 return (std::size_t)k; in hash()
344 for (int k = r.begin() + split_flag; k < r.end(); ++k) in operator ()() local
389 for (int k = r.begin(); k < r.end(); ++k) { in operator ()() local
393 output[k] = product.v[0][1]; in operator ()()

123