Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 289) sorted by relevance

12345678910>>...12

/oneTBB/examples/graph/fgbzip2/
H A Dhuffman.cpp123 for (i = 0; i < alphaSize; i++) in BZ2_hbMakeCodeLengths()
134 for (i = 1; i <= alphaSize; i++) { in BZ2_hbMakeCodeLengths()
164 for (i = 1; i <= alphaSize; i++) { in BZ2_hbMakeCodeLengths()
196 for (i = 1; i <= alphaSize; i++) { in BZ2_hbMakeCodeLengths()
210 for (i = 0; i < alphaSize; i++) in BZ2_hbAssignCodes()
230 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
237 for (i = 0; i < BZ_MAX_CODE_LEN; i++) in BZ2_hbCreateDecodeTables()
239 for (i = 0; i < alphaSize; i++) in BZ2_hbCreateDecodeTables()
242 for (i = 1; i < BZ_MAX_CODE_LEN; i++) in BZ2_hbCreateDecodeTables()
245 for (i = 0; i < BZ_MAX_CODE_LEN; i++) in BZ2_hbCreateDecodeTables()
[all …]
H A Dcompress.cpp137 for (i = 0; i < 256; i++) in makeMaps_e()
181 for (i = 0; i <= EOB; i++) in generateMTFValues()
186 for (i = 0; i < s->nInUse; i++) in generateMTFValues()
189 for (i = 0; i < s->nblock; i++) { in generateMTFValues()
304 for (i = 0; i < BZ_N_GROUPS; i++) in sendMTFValues()
367 for (i = 0; i < nGroups; i++) in sendMTFValues()
370 for (i = 0; i < nGroups; i++) in sendMTFValues()
582 for (i = 0; i < nGroups; i++) in sendMTFValues()
627 for (i = 0; i < 16; i++) { in sendMTFValues()
635 for (i = 0; i < 16; i++) in sendMTFValues()
[all …]
H A Dblocksort.cpp94 for (i = hi - 1; i >= lo; i--) { in fallbackSimpleSort()
285 for (i = 0; i < 257; i++) in fallbackSort()
287 for (i = 0; i < nblock; i++) in fallbackSort()
289 for (i = 0; i < 256; i++) in fallbackSort()
291 for (i = 1; i < 257; i++) in fallbackSort()
294 for (i = 0; i < nblock; i++) { in fallbackSort()
302 for (i = 0; i < nBhtab; i++) in fallbackSort()
304 for (i = 0; i < 256; i++) in fallbackSort()
314 for (i = 0; i < 32; i++) { in fallbackSort()
396 for (i = 0; i < nblock; i++) { in fallbackSort()
[all …]
H A Ddecompress.cpp75 for (i = 0; i < 256; i++) in makeMaps_d()
317 for (i = 0; i < 16; i++) { in BZ2_decompress()
325 for (i = 0; i < 256; i++) in BZ2_decompress()
328 for (i = 0; i < 16; i++) in BZ2_decompress()
425 for (i = 0; i <= 255; i++) in BZ2_decompress()
572 for (i = 0; i <= 255; i++) { in BZ2_decompress()
578 for (i = 1; i <= 256; i++) in BZ2_decompress()
580 for (i = 1; i <= 256; i++) in BZ2_decompress()
583 for (i = 0; i <= 256; i++) { in BZ2_decompress()
590 for (i = 1; i <= 256; i++) { in BZ2_decompress()
[all …]
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_regression.cpp58 for( int i=0; i<take_out_count; ++i ) in TestBootstrapLeak() local
64 for( int i=0; i<1000; i++) { in TestBootstrapLeak() local
76 for( int i=0; i<num_thread_runs; ++i ) in TestBootstrapLeak() local
87 for( int i=0; i<take_out_count; ++i ) in TestBootstrapLeak() local
130 for (int i=0; i<NUM; i++) { in TestAlignedMsize() local
135 for (int i=0; i<NUM; i++) { in TestAlignedMsize() local
138 memset(p[i], i, objSizes[i]); in TestAlignedMsize()
140 for (int i=0; i<NUM; i++) { in TestAlignedMsize() local
145 for (int i=0; i<NUM; i++) { in TestAlignedMsize() local
150 for (int i=0; i<NUM; i++) { in TestAlignedMsize() local
[all …]
H A Dtest_malloc_compliance.cpp285 for (i=1; i<ITERS; i++) in ReallocParam()
369 for (int i=0; i<100; i++) { in InvariantDataRealloc() local
423 for (size_t i=0; i<words; i++) in NonZero() local
429 for (size_t i=0; i<tailSz; i++) in NonZero() local
522 for (int i=0; i<COUNT_ELEM; i++) in AddrArifm() local
537 for (int i=0; i<COUNT_ELEM; i++) in AddrArifm() local
557 for (int i=0; i<COUNT_ELEM; i++) in AddrArifm() local
563 for (int i=0; i<COUNT_ELEM; i++) in AddrArifm() local
618 for (size_t i=0; i<n; i++) in myMemset() local
674 for (int i=0; i<num_1024; i++) in NULLReturn() local
[all …]
H A Dtest_malloc_pools.cpp101 for (int i=0; i<100; i++) { in TestPoolReset() local
108 for (int i=0; i<100; i++) { in TestPoolReset() local
150 for (int i=1; i<ITERS; i+=2) { in operator ()() local
160 for (int i=0; i<ITERS; i++) in operator ()() local
286 for (int i=0; i<p; i++) in TestCrossThreadPools() local
349 for (int i=0; i<iters; i++) { in operator ()() local
599 for (int i=0; i<SZ; i++) in TestEntries() local
757 for (int i=0; i<POOLS; i++) in TestPoolDetection() local
766 for (int i=0; i<POOLS; i++) check(i); in TestPoolDetection() local
774 for (int i=0; i<POOLS; i++) { in TestPoolDetection() local
[all …]
/oneTBB/test/tbb/
H A Dtest_input_node.cpp47 for (int i = 0; i < N; ++i ) in test_push_receiver() local
101 for (int i = 0; i < N; ++i ) in function_body() local
121 for (int i = 0; i < N; ++i ) { in test_single_dest() local
134 for (int i = 0; i < N; ++i ) { in test_single_dest() local
148 for (int i = 0; i < N; ++i ) { in test_single_dest() local
159 for (int i = 0; i < N; ++i ) { in test_single_dest() local
177 for (int i = 0; i < N; ++i ) { in test_reset() local
189 for (int i = 0; i < N; ++i ) { in test_reset() local
199 for (int i = 0; i < N; ++i ) { in test_reset() local
209 for (int i = 0; i < N; ++i ) { in test_reset() local
[all …]
H A Dtest_write_once_node.cpp45 for (size_t i = 0; i < M; ++i) { in simple_read_write_tests() local
60 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
65 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
71 for (int i = 1; i <= N; ++i ) { in simple_read_write_tests() local
91 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
95 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
99 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
141 for (int i = 0; i < M; ++i) { in parallel_read_write_tests() local
156 for (int i = 0; i < M; ++i) { in parallel_read_write_tests() local
160 for (int i = 0; i < M; ++i) { in parallel_read_write_tests() local
[all …]
H A Dtest_openmp.cpp38 for (int i = 0; i < m + n - 1; ++i) { in SerialConvolve() local
39 int start = i < n ? 0 : i - n + 1; in SerialConvolve()
40 int finish = i < m ? i + 1 : m; in SerialConvolve()
84 for (int i = 0; i < m + n - 1; ++i) { in OpenMP_TBB_Convolve() local
85 int start = i < n ? 0 : i - n + 1; in OpenMP_TBB_Convolve()
86 int finish = i < m ? i + 1 : m; in OpenMP_TBB_Convolve()
113 for (int i = range.begin(); i != range.end(); ++i) { in operator ()() local
114 int start = i < n ? 0 : i - n + 1; in operator ()()
115 int finish = i < m ? i + 1 : m; in operator ()()
167 for (int i = 0; i < m; ++i) A[i] = data_type(1 + i / 5); variable
[all …]
H A Dtest_overwrite_node.cpp44 for (size_t i = 0; i < M; ++i) { in simple_read_write_tests() local
57 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
61 for (int i = 0; i < N; ++i ) { in simple_read_write_tests() local
71 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
75 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
79 for (int i = 0; i < M; ++i) { in simple_read_write_tests() local
114 for (size_t i = 0; i < M; ++i) { in parallel_read_write_tests() local
118 for (int i = 0; i < M; ++i) { in parallel_read_write_tests() local
132 for (int i = 0; i < M; ++i) { in parallel_read_write_tests() local
136 for (int i = 0; i < M; ++i) { in parallel_read_write_tests() local
[all …]
H A Dtest_concurrent_queue.cpp36 for (std::size_t i=0; i < 1000; ++i) { in operator ()() local
54 for (std::size_t i = 0; i < 100; ++i) { in TestPrimitiveTypes() local
77 for (int i = 0; i < 100; ++i) { in TestVectorTypes() local
87 for (int i=0; i < 100; ++i ) { in TestVectorTypes() local
95 for (int i = 0; i < 101; ++i) { in TestVectorTypes() local
140 for (std::size_t i = 0; i < queue_size; ++i) { in CopyWithThrowElement() local
144 for (std::size_t i = 0; i < 100; ++i) { in CopyWithThrowElement() local
175 for (int i = 0; i < 100000; ++i) { variable
176 src_queue.push(i);
186 for (std::size_t i = 1; i < 1000; ++i) { variable
[all …]
/oneTBB/examples/task_group/sudoku/
H A Dsudoku.cpp57 for (unsigned i = 0; i < BOARD_SIZE; ++i) { in read_board() local
98 for (unsigned i = 0; i < BOARD_SIZE; ++i) in init_board() local
99 b[i].solved_element = b[i].potential_set = 0; in init_board()
103 for (unsigned i = 0; i < BOARD_SIZE; ++i) { in init_board() local
104 b[i].solved_element = arr[i]; in init_board()
110 for (unsigned i = 0; i < BOARD_SIZE; ++i) in init_potentials() local
115 for (int i = BOARD_SIZE - 1; i >= 0; --i) in fixed_board() local
137 for (unsigned i = b_row; i < b_row + 3; ++i) in in_block() local
145 for (unsigned i = 0; i < BOARD_SIZE; ++i) { in calculate_potentials() local
160 for (unsigned i = 0; i < BOARD_SIZE; ++i) { in valid_board() local
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h64 …bool my_item_valid(size_type i) const { return (i < my_tail) && (i >= my_head) && (item(i).second … in my_item_valid() argument
66 bool my_item_reserved(size_type i) const { return item(i).second == reserved_item; } in my_item_reserved() argument
79 destroy_item(i); in set_my_item()
89 destroy_item(i); in fetch_item()
123 item(i).second = no_item; in destroy_item()
141 …void reserve_item(size_type i) { __TBB_ASSERT(my_item_valid(i) && !my_item_reserved(i), "item cann… in reserve_item() argument
142 …void release_item(size_type i) { __TBB_ASSERT(my_item_reserved(i), "item is not reserved"); item(i… in release_item() argument
166 for( size_type i=0; i<new_size; ++i ) { new_array[i].begin()->second = no_item; } in grow_my_array() local
168 for( size_type i=my_head; i<my_tail; ++i) { in grow_my_array() local
173 new_array[i&(new_size-1)].begin()->second = item(i).second; in grow_my_array()
[all …]
/oneTBB/test/common/
H A Dvector_types.h51 ClassWithVectorType( int i ) { init(i); } in ClassWithVectorType() argument
53 for (int i = 0; i < n; ++i) { in ClassWithVectorType() local
54 field[i] = src.field[i]; in ClassWithVectorType()
60 for (int i = 0; i < n; ++i) { variable
61 stack[i^5] = src.field[i];
63 for (int i = 0; i < n; ++i) { variable
64 field[i^5] = stack[i];
72 for( int i = 0; i < F*n; ++i ) { variable
87 for( int i = 0; i < n; ++i ) { in init() local
95 for( int i = 0; i < n; ++i ) in init() local
[all …]
H A Dallocator_stl_test_common.h28 for(int i = 0; i < iter_count; ++i){ in TestSequence() local
29 c.push_back(i * i); in TestSequence()
32 for(int i = 0; i < iter_count; ++i) { in TestSequence() local
33 REQUIRE(*p == i*i); in TestSequence()
44 for(int i = 0; i < 100; ++i) in TestSet() local
46 for( int i = 0; i < 300; ++i ) { in TestSet() local
47 REQUIRE(s.erase(i) == size_t(i % 3 == 0)); in TestSet()
55 for(int i = 0; i < 100; ++i) in TestMap() local
56 m.insert(value_type(i,i*i)); in TestMap()
57 for(int i=0; i < 100; ++i) in TestMap() local
[all …]
/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DMatrix.hpp27 for (int i = 0; i < n; ++i) in Matrix() local
29 array[i][j] = i == j ? z : 0; in Matrix()
33 for (int i = 0; i < n; ++i) in operator -() local
35 result.array[i][j] = -x.array[i][j]; in operator -()
40 for (int i = 0; i < n; ++i) in operator +() local
42 result.array[i][j] = x.array[i][j] + y.array[i][j]; in operator +()
47 for (int i = 0; i < n; ++i) in operator -() local
49 result.array[i][j] = x.array[i][j] - y.array[i][j]; in operator -()
54 for (int i = 0; i < n; ++i) in operator *() local
57 result.array[i][j] += x.array[i][k] * y.array[k][j]; in operator *()
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp46 for (int i = 0; i < UniverseHeight; ++i) in InitializeUniverse() local
49 T[i][j] = S[i][j] = V[i][j] = ValueType(1.0E-6); in InitializeUniverse()
51 for (int i = 1; i < UniverseHeight - 1; ++i) { in InitializeUniverse() local
80 for (int i = 0; i < ColorMapSize; ++i) { in InitializeUniverse() local
101 for (int i = 1; i < UniverseHeight - 1; ++i) { in InitializeUniverse() local
144 for (int i = r.StartY(); i < r.EndY(); ++i) { 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()
183 for (int i = r.StartY(); i < r.EndY(); ++i) in UpdateVelocity() local
186 V[i][j] = in UpdateVelocity()
[all …]
/oneTBB/examples/parallel_for/game_of_life/
H A DUpdate_state.cpp27 for (unsigned i = 0; i < 31u; ++i) in create_record() local
28 dst[0] |= src[i] << (i + 1); in create_record()
41 for (unsigned i = 0; i < size_sse_ar; ++i) { in sum_offset() local
43 A[i] = _mm_xor_si128(A[i], X[shift + i]); in sum_offset()
44 C[i] = _mm_or_si128(C[i], _mm_and_si128(B[i], tmp)); in sum_offset()
104 for (unsigned i = 0; i < size_sse_ar; ++i) { in UpdateState() local
119 for (unsigned i = 0; i < size_sse_ar + 6; ++i) { in UpdateState() local
193 for (unsigned i = 0; i < size_sse_ar; ++i) { in UpdateState() local
198 X[shift + i] = _mm_and_si128(_mm_and_si128(_mm_or_si128(X[shift + i], A[i]), B[i]), C[i]); in UpdateState()
335 for (int i = 1; i < 9; i++) { in CheckCell() local
[all …]
/oneTBB/examples/graph/som/
H A Dsom.cpp38 for (int i = 0; i < (int)s.w.size(); ++i) { in operator <<() local
50 for (int i = 0; i < (int)s.w.size(); ++i) { in remark_SOM_element() local
83 for (int i = 1; i < (int)teaching.size(); ++i) { in find_data_ranges() local
90 for (int i = 0; i < (int)from.size(); ++i) { in add_fraction_of_difference() local
91 to[i] += frac * (from[i] - to[i]); in add_fraction_of_difference()
97 for (int i = 0; i < (int)x.size(); ++i) { in distance_squared() local
98 double diff = x[i] - y[i]; in distance_squared()
107 for (int i = 0; i < (int)max_range.size(); ++i) { in initialize() local
109 my_map[x][y][i] = (randval(min_range[i], max_range[i])); in initialize()
180 for (int i = 0; i < nPasses; ++i) { in teach() local
[all …]
/oneTBB/examples/graph/cholesky/
H A Dinit.cpp46 for (int i = 0; i < n; ++i) { in posdef_gen() local
48 LT[j * n + i] = L[i * n + j]; in posdef_gen()
60 int i; in matrix_init() local
74 for (i = 0; i < n; ++i) { in matrix_init()
75 for (j = 0; j <= i; ++j) { in matrix_init()
80 if (i != j) { in matrix_init()
81 A[j * n + i] = A[i * n + j]; in matrix_init()
96 int i = 0; in matrix_write() local
106 for (i = 0; i < n; ++i) { in matrix_write()
107 for (j = 0; j <= i; ++j) { in matrix_write()
[all …]
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp389 for (int i = 0; i < xSize; i++) { in GenerateMap() local
399 for (int i = 0; i < gNPolygons; i++) { in GenerateMap() local
415 for (int i = 0; i < gNPolygons; i++) { in GenerateMap() local
466 for (int i = xlow; i <= xhigh; i++) { in GenerateMap() local
484 for (int i = 0; i < xSize; i++) { in GenerateMap() local
524 for (int i = 0; i < xSize; i++) { in GenerateMap() local
584 for (int i = 0; i < gMapXSize; i++) { in CheckPolygonMap() local
607 for (int i = xlow; i <= xhigh; i++) { in CheckPolygonMap() local
619 for (int i = 0; i < gMapXSize; i++) { in CheckPolygonMap() local
658 for (unsigned int i = 1; i < map1->size(); i++) { in ComparePolygonMaps() local
[all …]
/oneTBB/test/conformance/
H A Dconformance_parallel_scan.cpp47 for(std::size_t i=r.begin(); i<r.end(); ++i ) { in operator ()() local
93 for(size_t i = 0; i < size; ++i) { variable
94 input[i] = int(i / 2);
96 control[i] = control[i-1] + input[i];
98 control[i] = input[i];
113 for (std::size_t i = 0; i<size; ++i) { variable
114 input[i] = i;
116 control[i] = control[i-1]+input[i];
124 for (std::size_t i = r.begin(); i<r.end(); ++i) { in __anonb56fb5590102() local
157 for (std::size_t i = 1; i < iterations; ++i) { variable
[all …]
/oneTBB/examples/getting_started/sub_string_finder/
H A Dsub_string_finder_extended.cpp31 for (std::size_t i = 0; i < str.size(); ++i) { in SerialSubStringFinder() local
34 if (j != i) { in SerialSubStringFinder()
45 max_array[i] = max_size; in SerialSubStringFinder()
46 pos_array[i] = max_pos; in SerialSubStringFinder()
58 for (std::size_t i = r.begin(); i != r.end(); ++i) { in operator ()() local
61 if (j != i) { in operator ()()
74 pos_array[i] = max_pos; in operator ()()
87 for (std::size_t i = 2; i < N; ++i) in main() local
88 str[i] = str[i - 1] + str[i - 2]; in main()
113 for (std::size_t i = 0; i < num_elem; ++i) { in main() local
[all …]
H A Dsub_string_finder_pretty.cpp35 for (std::size_t i = r.begin(); i != r.end(); ++i) { 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 ()()
50 max_array[i] = max_size; in operator ()()
51 pos_array[i] = max_pos; in operator ()()
63 for (std::size_t i = 2; i < N; ++i) in main() local
64 str[i] = str[i - 1] + str[i - 2]; in main()
75 for (std::size_t i = 0; i < num_elem; ++i) { in main() local
77 if (j >= i && j < i + max[i]) in main()
[all …]

12345678910>>...12