Lines Matching defs:ind
113 for (kmp_index_t ind = 0; ind < n; ++ind) {
114 auto bounds = &(original_bounds_nest[ind]);
310 kmp_index_t ind) {
312 T iv = static_cast<T>(original_ivs[ind]);
326 // Calculate one iv corresponding to iteration on the level ind.
332 const kmp_iterations_t iterations, kmp_index_t ind,
343 auto iteration = iterations[ind];
348 original_ivs[ind] = kmp_fix_iv(bounds->loop_iv_type, temp);
351 return kmp_iv_is_in_upper_bound_XX(bounds, original_ivs, 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,
395 // Calculate one iv corresponding to iteration on the level ind.
402 kmp_index_t ind) {
404 auto iteration = iterations[ind];
412 original_ivs[ind] = kmp_fix_iv(bounds->loop_iv_type, temp);
418 kmp_index_t ind) {
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);
468 for (kmp_index_t ind = 0; ind < n; ++ind) {
469 auto bounds = &(original_bounds_nest[ind]);
496 for (kmp_index_t ind = n; ind > 0;) {
497 --ind;
498 auto bounds = &(original_bounds_nest[ind]);
505 iterations[ind] = iteration;
509 for (kmp_index_t ind = 0; ind < n; ++ind) {
510 auto bounds = &(original_bounds_nest[ind]);
512 kmp_calc_one_iv_rectang(bounds, /*in/out*/ original_ivs, iterations, ind);
786 for (kmp_index_t ind = 0; ind < n; ++ind) {
787 auto bounds = &(bounds_nest[ind]);
823 // original_ivs[ind] (only on this level, non-negative)
829 kmp_index_t ind) {
835 (static_cast<T>(original_ivs[ind]) - bounds->lb0 -
842 static_cast<T>(original_ivs[ind])) /
850 // original_ivs[ind] (only on this level, non-negative)
853 kmp_index_t ind) {
858 (bounds_infoXX_template<kmp_int32> *)(bounds), original_ivs, ind);
862 (bounds_infoXX_template<kmp_uint32> *)(bounds), original_ivs, ind);
866 (bounds_infoXX_template<kmp_int64> *)(bounds), original_ivs, ind);
870 (bounds_infoXX_template<kmp_uint64> *)(bounds), original_ivs, ind);
892 for (kmp_index_t ind = 0; ind < n; ++ind) {
893 auto bounds = &(bounds_nest[ind].b);
896 kmp_calc_number_of_iterations(bounds, original_ivs, ind);
910 /*in/out*/ kmp_iterations_t iterations, kmp_index_t ind) {
914 for (; ind < n;) {
915 auto bounds = &(original_bounds_nest[ind]);
917 ind, (lengthened_ind < ind), true);
921 if (ind == 0) {
926 --ind;
927 ++iterations[ind];
928 lengthened_ind = ind;
929 for (kmp_index_t i = ind + 1; i < n; ++i) {
935 ++ind;
953 for (kmp_index_t ind = n; ind > 0;) {
954 --ind;
955 iterations[ind] = 0;
975 for (kmp_index_t ind = 0; ind < n; ++ind) {
976 auto bounds = &(original_bounds_nest[ind]);
977 iterations[ind] = kmp_calc_number_of_iterations(bounds, original_ivs, ind);
980 for (kmp_index_t ind = 0; ind < n; ++ind) {
981 next_original_ivs[ind] = original_ivs[ind];
986 kmp_index_t ind = n - 1;
987 ++iterations[ind];
990 original_bounds_nest, n, /*in/out*/ next_original_ivs, iterations, ind);
1006 kmp_index_t ind, bool start_with_lower_bound, bool compare_with_start,
1030 auto iteration = iterations[ind];
1054 T start = static_cast<T>(original_ivs_start[ind]);
1071 original_ivs[ind] = temp = kmp_fix_iv(bounds->loop_iv_type, temp);
1090 kmp_index_t ind, bool start_with_lower_bound,
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,
1156 for (kmp_index_t ind = n; ind > 0;) {
1157 --ind;
1158 auto &updated_bounds = updated_bounds_nest[ind];
1165 iterations[ind] = iteration;
1173 for (kmp_index_t ind = 0; ind < n;) {
1174 auto bounds = &(original_bounds_nest[ind]);
1175 auto updated_bounds = &(updated_bounds_nest[ind].b);
1179 /*in/out*/ original_ivs, iterations, ind, (lengthened_ind < ind),
1180 (equal_ind >= ind - 1), original_ivs_start);
1184 if (ind == 0) {
1189 --ind;
1190 ++(iterations[ind]);
1191 lengthened_ind = ind;
1197 for (kmp_index_t i = ind + 1; i < n; ++i) {
1204 if ((equal_ind == ind - 1) &&
1205 (kmp_ivs_eq(bounds->loop_iv_type, original_ivs[ind],
1206 original_ivs_start[ind]))) {
1207 equal_ind = ind;
1208 } else if ((equal_ind > ind - 1) &&
1209 !(kmp_ivs_eq(bounds->loop_iv_type, original_ivs[ind],
1210 original_ivs_start[ind]))) {
1211 equal_ind = ind - 1;
1213 ++ind;
1225 kmp_index_t ind) {
1230 original_ivs[ind] = kmp_fix_iv(bounds->loop_iv_type, temp);
1234 /*in/out*/ kmp_point_t original_ivs, kmp_index_t ind) {
1243 /*in/out*/ original_ivs, ind);
1248 /*in/out*/ original_ivs, ind);
1253 /*in/out*/ original_ivs, ind);
1258 /*in/out*/ original_ivs, ind);
1269 for (kmp_index_t ind = 0; ind < n; ++ind) {
1270 auto bounds = &(original_bounds_nest[ind]);
1271 kmp_calc_one_iv_end(bounds, /*in/out*/ original_ivs, ind);