Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 112) sorted by relevance

12345

/oneTBB/examples/graph/cholesky/
H A Dinit.cpp35 for (int j = 0; j < n; ++j) { in posdef_gen() local
42 L[j * n + j] = 1; in posdef_gen()
47 for (int j = 0; j < n; ++j) { in posdef_gen() local
48 LT[j * n + i] = L[i * n + j]; in posdef_gen()
75 for (j = 0; j <= i; ++j) { in matrix_init()
81 A[j * n + i] = A[i * n + j]; in matrix_init()
107 for (j = 0; j <= i; ++j) { in matrix_write()
111 for (; j < n; ++j) { in matrix_write()
116 for (; j < n; ++j) { in matrix_write()
125 for (j = 0; j < i; ++j) { in matrix_write()
[all …]
H A Dcholesky.cpp74 for (int j = 0; j < p; ++j) { in create_tile_array() local
78 for (int j = 0; j < p; ++j) { in create_tile_array() local
97 for (int j = 0; j < p; ++j) { in collapse_tile_array() local
130 for (int j = i + 1; j < n; ++j) { in check_if_valid() local
137 for (int j = 0; j < n; ++j) { in check_if_valid() local
276 for (int j = k + 1; j < p; ++j) { in func() local
344 for (int j = k + 1; j < p; ++j) { in operator ()() local
509 for (int j = 1; j < p; ++j) { in func() local
519 for (int j = i; j < p; ++j) { in func() local
561 for (int j = k + 1; j < p; ++j) { in func() local
[all …]
/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DMatrix.hpp28 for (int j = 0; j < n; ++j) in Matrix() local
29 array[i][j] = i == j ? z : 0; in Matrix()
34 for (int j = 0; j < n; ++j) in operator -() local
35 result.array[i][j] = -x.array[i][j]; in operator -()
41 for (int j = 0; j < n; ++j) in operator +() local
42 result.array[i][j] = x.array[i][j] + y.array[i][j]; in operator +()
48 for (int j = 0; j < n; ++j) in operator -() local
49 result.array[i][j] = x.array[i][j] - y.array[i][j]; in operator -()
56 for (int j = 0; j < n; ++j) in operator *() local
57 result.array[i][j] += x.array[i][k] * y.array[k][j]; in operator *()
H A DGraph.cpp47 for (int j = 0; j < ArityOfOp[c.op]; ++j) { in create_random_dag() local
49 c.input[j] = &input; in create_random_dag()
57 for (std::size_t j = 0; j < my_vertex_set[k].successor.size(); ++j) in print() local
58 std::cout << " " << int(my_vertex_set[k].successor[j] - &my_vertex_set[0]); in print()
71 for (int j = 0; j < ArityOfOp[c.op]; ++j) { in get_root_set() local
72 c.input[j]->successor.push_back(&c); in get_root_set()
/oneTBB/test/tbb/
H A Dtest_priority_queue_node.cpp59 for (int j = 0; j < N; ++j) { in operator ()() local
73 for (int j = 0; j < N-1; ++j) { in operator ()() local
89 for ( int j = i; j < j_end; ++j ) { in operator ()() local
93 for ( int j = i; j < j_end; ++j ) { in operator ()() local
189 j = bogus_value; in test_parallel()
195 j = bogus_value; in test_parallel()
205 j = bogus_value; in test_parallel()
218 j = bogus_value; in test_parallel()
273 j = bogus_value; in test_serial()
288 j = bogus_value; in test_serial()
[all …]
H A Dtest_buffer_node.cpp53 for (int j = 0; j < N; ++j) { in operator ()() local
107 for (int j = 0; j < N; ++j) { in operator ()() local
129 for ( int j = i; j < j_end; ++j ) { in operator ()() local
133 for ( int j = i; j < j_end; ++j ) { in operator ()() local
221 j = bogus_value; in test_parallel()
234 j = bogus_value; in test_parallel()
245 j = bogus_value; in test_parallel()
259 j = bogus_value; in test_parallel()
345 vsum += j; in test_serial()
364 vsum += j; in test_serial()
[all …]
H A Dtest_queue_node.cpp73 for (int j = 0; j < N; ++j) { in operator ()() local
159 for (int j = 0; j < N; ++j) { in operator ()() local
181 for ( int j = i; j < j_end; ++j ) { in operator ()() local
185 for ( int j = i; j < j_end; ++j ) { in operator ()() local
276 j = bogus_value; in test_parallel()
289 j = bogus_value; in test_parallel()
300 j = bogus_value; in test_parallel()
314 j = bogus_value; in test_parallel()
327 j = bogus_value; in test_parallel()
337 j = bogus_value; in test_parallel()
[all …]
H A Dtest_sequencer_node.cpp64 for (int j = tid; j < N; j+=my_num_threads) { in operator ()() local
146 for (int j = tid; j < N; j+=my_num_threads) { in operator ()() local
207 T j = bogus_value; in test_parallel() local
238 j = bogus_value; in test_parallel()
242 j = bogus_value; in test_parallel()
268 T j = bogus_value; in test_serial() local
291 j = bogus_value; in test_serial()
296 j = bogus_value; in test_serial()
315 j = bogus_value; in test_serial()
340 j = bogus_value; in test_serial()
[all …]
H A Dtest_eh_algorithms.cpp394 for (size_t j = 0; j < 4; ++j) { in __anone85726900102() local
415 for (size_t j = 0; j < 4; ++j) { in __anone85726900202() local
436 for (size_t j = 0; j < 4; ++j) { in __anone85726900302() local
457 for (size_t j = 0; j < 4; ++j) { in __anone85726900402() local
478 for (size_t j = 0; j < 4; ++j) { in __anone85726900502() local
690 for (size_t j = 0; j < 4; ++j) { in __anone85726900602() local
711 for (size_t j = 0; j < 4; ++j) { in __anone85726900702() local
732 for (size_t j = 0; j < 4; ++j) { in __anone85726900802() local
753 for (size_t j = 0; j < 4; ++j) { in __anone85726900902() local
1046 for (size_t j = 0; j < 4; ++j) { in __anone85726900a02() local
[all …]
H A Dtest_composite_node.cpp141 int i, j =0; in test_tiny() local
144 q.try_get(j); in test_tiny()
160 q.try_get(j); in test_tiny()
181 tbb::flow::make_edge( j, f ); in adder_node()
248 int j; in test_adder() local
250 q.try_get(j); in test_adder()
251 result += j; in test_adder()
273 q.try_get(j); in test_adder()
274 result += j; in test_adder()
364 tbb::flow::make_edge( j, f ); in prefix_node()
[all …]
H A Dtest_openmp.cpp42 for (int j = start; j < finish; ++j) in SerialConvolve() local
43 sum += a[j] * b[i - j]; in SerialConvolve()
69 for (int j = range.begin(); j != range.end(); ++j) in operator ()() local
70 sum += my_a[j] * my_b[i - j]; in operator ()()
118 for (int j = start; j < finish; ++j) in operator ()() local
119 sum += my_a[j] * my_b[i - j]; in operator ()()
H A Dtest_enumerable_thread_specific.cpp133 for (int j = 0; j < FLOG_REPETITIONS; ++j) { in flog_key_creation_and_deletion() local
161 for (int j = 0; j < FLOG_REPETITIONS; ++j) { in flog_key_creation_and_deletion() local
194 for(int j = 0; j < maxval; j++) { in flog_segmented_interator() local
195 my_vec.at(i).push_back((T)(maxval * i + j)); in flog_segmented_interator()
228 for(int j = 0; j < maxval; ++j) { in flog_segmented_interator() local
229 my_vec.at(i).push_back((T)(maxval * (i/2) + j)); in flog_segmented_interator()
266 for(int j = 0; j < maxval; ++j) { in flog_segmented_interator() local
267 my_vec.at(i).push_back((T)(maxval * (i/2) + j)); in flog_segmented_interator()
295 for(int j = 0; j < maxval; j++) { in flog_segmented_iterator_map() local
296 my_vec.at(i).insert(std::make_pair<Key,Val>(maxval * i + j, 2*(maxval*i + j))); in flog_segmented_iterator_map()
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp48 for (int j = 0; j < UniverseWidth; ++j) { in InitializeUniverse() local
49 T[i][j] = S[i][j] = V[i][j] = ValueType(1.0E-6); in InitializeUniverse()
52 for (int j = 1; j < UniverseWidth - 1; ++j) { in InitializeUniverse() local
56 D[i][j] = 1.0; in InitializeUniverse()
97 for (int j = 1; j < UniverseWidth - 1; ++j) { in InitializeUniverse() local
147 for (int j = r.StartX(); j < r.EndX(); ++j) { in UpdateStress() local
148 S[i][j] += M[i][j] * (V[i][j + 1] - V[i][j]); in UpdateStress()
149 T[i][j] += M[i][j] * (V[i + 1][j] - V[i][j]); in UpdateStress()
185 for (int j = r.StartX(); j < r.EndX(); ++j) in UpdateVelocity() local
186 V[i][j] = in UpdateVelocity()
[all …]
/oneTBB/examples/graph/fgbzip2/
H A Dblocksort.cpp88 for (j = i + 4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4) in fallbackSimpleSort()
97 for (j = i + 1; j <= hi && ec_tmp > eclass[fmap[j]]; j++) in fallbackSimpleSort()
98 fmap[j - 1] = fmap[j]; in fallbackSimpleSort()
660 j = j - h; in mainSimpleSort()
674 j = j - h; in mainSimpleSort()
688 j = j - h; in mainSimpleSort()
1035 j = j - h; in mainSort()
1068 for (j = 0; j <= 255; j++) { in mainSort()
1102 for (j = 0; j <= 255; j++) { in mainSort()
1132 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK; in mainSort()
[all …]
H A Dhuffman.cpp165 j = 0; in BZ2_hbMakeCodeLengths()
169 j++; in BZ2_hbMakeCodeLengths()
171 len[i - 1] = j; in BZ2_hbMakeCodeLengths()
172 if (j > maxLen) in BZ2_hbMakeCodeLengths()
197 j = weight[i] >> 8; in BZ2_hbMakeCodeLengths()
198 j = 1 + (j / 2); in BZ2_hbMakeCodeLengths()
206 Int32 j, vec, i; in BZ2_hbAssignCodes() local
209 for (j = minLen; j <= maxLen; j++) { in BZ2_hbAssignCodes()
227 Int32 pp, i, j, vec; in BZ2_hbCreateDecodeTables() local
231 for (j = 0; j < alphaSize; j++) in BZ2_hbCreateDecodeTables()
[all …]
H A Dcompress.cpp147 Int32 i, j; in generateMTFValues() local
193 if (j < 0) in generateMTFValues()
305 for (j = 0; j < alphaSize; j++) in sendMTFValues()
371 for (j = 0; j < alphaSize; j++) in sendMTFValues()
480 for (j = 0; j < nGroups; j++) in sendMTFValues()
481 cost[j] += s->len[j][icv]; in sendMTFValues()
596 j = 0; in sendMTFValues()
610 for (j = 0; j < nGroups; j++) { in sendMTFValues()
629 for (j = 0; j < 16; j++) in sendMTFValues()
643 for (j = 0; j < 16; j++) { in sendMTFValues()
[all …]
H A Ddecompress.cpp155 Int32 j; in BZ2_decompress() local
209 j = s->save_j; in BZ2_decompress()
330 for (j = 0; j < 16; j++) { in BZ2_decompress()
348 j = 0; in BZ2_decompress()
353 j++; in BZ2_decompress()
379 for (j = 0; j < nGroups; j++) { in BZ2_decompress()
399 for (j = 0; j < nGroups; j++) { in BZ2_decompress()
433 for (j = MTFL_SIZE - 1; j >= 0; j--) { in BZ2_decompress()
541 for (j = MTFL_SIZE - 1; j >= 0; j--) { in BZ2_decompress()
621 i = j; in BZ2_decompress()
[all …]
/oneTBB/examples/getting_started/sub_string_finder/
H A Dsub_string_finder_pretty.cpp37 for (std::size_t j = 0; j < str.size(); ++j) { in operator ()() local
38 if (j != i) { in operator ()()
39 std::size_t limit = str.size() - (std::max)(i, j); in operator ()()
41 if (str[i + k] != str[j + k]) in operator ()()
45 max_pos = j; in operator ()()
76 for (std::size_t j = 0; j < num_elem; ++j) { in main() local
77 if (j >= i && j < i + max[i]) in main()
84 for (std::size_t j = 0; j < num_elem; ++j) { in main() local
85 if (j >= pos[i] && j < pos[i] + max[i]) in main()
H A Dsub_string_finder_extended.cpp33 for (std::size_t j = 0; j < str.size(); ++j) in SerialSubStringFinder() local
34 if (j != i) { in SerialSubStringFinder()
35 std::size_t limit = str.size() - (std::max)(i, j); in SerialSubStringFinder()
37 if (str[i + k] != str[j + k]) in SerialSubStringFinder()
41 max_pos = j; in SerialSubStringFinder()
60 for (std::size_t j = 0; j < len; ++j) { in operator ()() local
61 if (j != i) { in operator ()()
62 std::size_t limit = len - (std::max)(i, j); in operator ()()
64 if (str[i + k] != str[j + k]) in operator ()()
68 max_pos = j; in operator ()()
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp390 for (int j = 0; j < ySize; j++) { in GenerateMap() local
460 for (int j = ylow; (j <= yhigh) && okay_to_extend; j++) { in GenerateMap() local
467 for (int j = ylow; j <= yhigh && okay_to_extend; j++) { in GenerateMap() local
483 for (int j = 0; j < ySize; j++) { in GenerateMap() local
488 int jlen = j; in GenerateMap()
522 for (int j = 0; j < ySize; j++) { in GenerateMap() local
545 #define indx(i, j) (i * gMapYSize + j) in CheckPolygonMap() argument
585 for (int j = 0; j < gMapYSize; j++) { in CheckPolygonMap() local
586 cArray[indx(i, j)] = 0; in CheckPolygonMap()
608 for (int j = ylow; j <= yhigh; j++) { in CheckPolygonMap() local
[all …]
/oneTBB/doc/main/tbb_userguide/
H A Duse_nested_flow_graphs.rst36 return j;
40 return j;
44 return j;
48 return j;
77 cout << "m1: " << j << "\n";
78 return j;
81 cout << "m2: " << j << "\n";
82 return j;
85 cout << "m3: " << j << "\n";
86 return j;
[all …]
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DWavefront.rst86 for( size_t j=1; j<=ylen; ++j )
87 F[i][j] = x[i-1]==y[j-1] ? F[i-1][j-1]+1:
88 max(F[i][j-1],F[i-1][j]);
92 The kernel sets ``F[i][j]`` to the length of the longest common
99 ``F[i][j]``.
128 Another consideration is grain size. Scheduling each ``F[i][j]``
155 for( int j=0; j<n; ++j )
156 Count[i][j] = (i>0)+(j>0);
171 for( size_t j=yl; j<yu; ++j )
172 F[i][j] = x[i-1]==y[j-1] ? F[i-1][j-1]+1:
[all …]
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_shutdown_hang.cpp44 for (int j = 0; j < rand() % ARRAY_SIZE; ++j) { in allocatorRandomThrashing() local
45 arr[j] = scalable_malloc(rand() % MAX_ALLOC); in allocatorRandomThrashing()
48 for (int j = 0; j < ARRAY_SIZE; ++j) { in allocatorRandomThrashing() local
49 scalable_free(arr[j]); in allocatorRandomThrashing()
50 arr[j] = nullptr; in allocatorRandomThrashing()
H A Dtest_malloc_pure_c.c56 size_t i, j; in main() local
85 for (j=0; j<i; j++) in main()
86 assert(0==*((char*)p2+j)); in main()
88 for (j=0; j<i; j+=sizeof(size_t)) in main()
89 assert(0==*((size_t*)p2+j)); in main()
H A Dtest_malloc_regression.cpp141 for (unsigned j=0; j<objSizes[i]; j++) in TestAlignedMsize() local
142 CHECK_FAST_MESSAGE((((char*)p[i])[j] == i), "Error: data broken"); in TestAlignedMsize()
151 for (unsigned j=0; j<allocSz[s]; j++) in TestAlignedMsize() local
152 CHECK_FAST_MESSAGE((((char*)p[i])[j] == i), "Error: data broken"); in TestAlignedMsize()
153 for (size_t j=allocSz[s]; j<2*allocSz[s]; j++) in TestAlignedMsize() local
154 CHECK_FAST_MESSAGE((((char*)p[i])[j] == i+1), "Error: data broken"); in TestAlignedMsize()

12345