Lines Matching defs:iterations
332 const kmp_iterations_t iterations, kmp_index_t ind,
343 auto iteration = iterations[ind];
359 const kmp_iterations_t iterations, kmp_index_t ind,
366 /*in/out*/ original_ivs, iterations, ind, start_with_lower_bound,
372 /*in/out*/ original_ivs, iterations, ind, start_with_lower_bound,
378 /*in/out*/ original_ivs, iterations, ind, start_with_lower_bound,
384 /*in/out*/ original_ivs, iterations, ind, start_with_lower_bound,
401 const kmp_iterations_t iterations,
404 auto iteration = iterations[ind];
417 const kmp_iterations_t iterations,
424 /*in/out*/ original_ivs, iterations, ind);
429 /*in/out*/ original_ivs, iterations, ind);
434 /*in/out*/ original_ivs, iterations, ind);
439 /*in/out*/ original_ivs, iterations, ind);
493 CollapseAllocator<kmp_loop_nest_iv_t> iterations(n);
505 iterations[ind] = iteration;
512 kmp_calc_one_iv_rectang(bounds, /*in/out*/ original_ivs, iterations, ind);
820 //----------Calculate iterations (in the original or updated space)-----------
822 // Calculate number of iterations in original or updated space resulting in
831 kmp_loop_nest_iv_t iterations = 0;
834 iterations =
840 iterations = (bounds->lb0 +
846 return iterations;
849 // Calculate number of iterations in the original or updated space resulting in
902 //----------Calculate original ivs for provided iterations--------------------
904 // Calculate original IVs for provided iterations, assuming iterations are
910 /*in/out*/ kmp_iterations_t iterations, kmp_index_t ind) {
916 bool good = kmp_calc_one_iv(bounds, /*in/out*/ original_ivs, iterations,
927 ++iterations[ind];
930 iterations[i] = 0;
945 // if on some of the iterations of the outer loops inner loops are empty.
952 CollapseAllocator<kmp_loop_nest_iv_t> iterations(n);
955 iterations[ind] = 0;
961 /*in/out*/ iterations, 0);
973 CollapseAllocator<kmp_loop_nest_iv_t> iterations(n);
977 iterations[ind] = kmp_calc_number_of_iterations(bounds, original_ivs, ind);
984 // Next add one step to the iterations on the inner-most level, and see if we
987 ++iterations[ind];
990 original_bounds_nest, n, /*in/out*/ next_original_ivs, iterations, ind);
1005 /*in/out*/ kmp_point_t original_ivs, const kmp_iterations_t iterations,
1026 // iterations than was planned
1030 auto iteration = iterations[ind];
1089 const kmp_iterations_t iterations,
1100 original_ivs, iterations, ind, start_with_lower_bound,
1108 original_ivs, iterations, ind, start_with_lower_bound,
1116 original_ivs, iterations, ind, start_with_lower_bound,
1124 original_ivs, iterations, ind, start_with_lower_bound,
1154 CollapseAllocator<kmp_loop_nest_iv_t> iterations(n);
1165 iterations[ind] = iteration;
1179 /*in/out*/ original_ivs, iterations, ind, (lengthened_ind < ind),
1190 ++(iterations[ind]);
1193 // We've changed the number of iterations here,
1198 iterations[i] = 0;
1368 // the total number of iterations in the loop is the sum of the arithmetic
1375 // the current thread's number of iterations:
1376 // each thread gets an equal number of iterations: total number of iterations
1382 // cumulative number of iterations executed by all the previous threads:
1385 // iterations executed by the all previous will be the current thread's number
1386 // of iterations multiplied by the number of previous threads which is equal
1389 // iterations previously executed is its number of iterations multipled by the
1391 // PLUS all the remainder iterations that will have been executed by the
1395 // cumulative number of iterations executed with the current thread is
1399 // that gives the number of iterations that is equal or just below the total
1400 // number of iterations executed by the previous threads, for less_than
1415 // iterations required to hit the total number of iterations executed by the
1421 // inner bound except using the total number of iterations executed with the
1430 // iterations required to hit the total number of iterations executed after
1488 // the total number of iterations in the loop is the sum of the arithmetic
1495 // the current thread's number of iterations:
1496 // each thread gets an equal number of iterations: total number of iterations
1502 // cumulative number of iterations executed by all the previous threads:
1505 // iterations executed by the all previous will be the current thread's number
1506 // of iterations multiplied by the number of previous threads which is equal
1509 // iterations previously executed is its number of iterations multipled by the
1511 // PLUS all the remainder iterations that will have been executed by the
1515 // cumulative number of iterations executed with the current thread is
1519 // that gives the number of iterations that is equal or just below the total
1520 // number of iterations executed by the previous threads:
1526 // iterations required to hit the total number of iterations executed by the
1531 // inner bound except using the total number of iterations executed with the
1536 // iterations required to hit the total number of iterations executed after
1741 // no more loop iterations left to process,
1768 // no more loop iterations to process,