100     bounds->ub0 -= 1;  in kmp_canonicalize_one_loop_XX()
103     bounds->ub0 += 1;  in kmp_canonicalize_one_loop_XX()
157     if (bounds->ub0 < bounds->lb0) {  in kmp_calculate_trip_count_XX()
165           static_cast<kmp_loop_nest_iv_t>(bounds->ub0 - bounds->lb0) /  in kmp_calculate_trip_count_XX()
170     if (bounds->lb0 < bounds->ub0) {  in kmp_calculate_trip_count_XX()
178           static_cast<kmp_loop_nest_iv_t>(bounds->lb0 - bounds->ub0) /  in kmp_calculate_trip_count_XX()
316        (iv > (bounds->ub0 + bounds->ub1 * outer_iv))) ||  in kmp_iv_is_in_upper_bound_XX()
318        (iv < (bounds->ub0 + bounds->ub1 * outer_iv)))) {  in kmp_iv_is_in_upper_bound_XX()
567           bbounds.ub0 + bbounds.ub1 * previous->span_smallest;  in kmp_calc_span_lessoreq_XX()
569           bbounds.ub0 + bbounds.ub1 * previous->span_biggest;  in kmp_calc_span_lessoreq_XX()
579     bounds->span_biggest = bbounds.ub0;  in kmp_calc_span_lessoreq_XX()
586         (static_cast<UT>(bbounds.ub0 - bbounds.lb0)) % bbounds.step; // abs?  in kmp_calc_span_lessoreq_XX()
631           bbounds.ub0 + bbounds.ub1 * previous->span_smallest;  in kmp_calc_span_greateroreq_XX()
633           bbounds.ub0 + bbounds.ub1 * previous->span_biggest;  in kmp_calc_span_greateroreq_XX()
644     bounds->span_smallest = bbounds.ub0;  in kmp_calc_span_greateroreq_XX()
651         (static_cast<UT>(bbounds.ub0 - bbounds.lb0)) % bbounds.step; // abs?  in kmp_calc_span_greateroreq_XX()
735         bbounds.ub0 += add;  in kmp_calc_new_bounds_XX()
739         bbounds.ub0 -= sub;  in kmp_calc_new_bounds_XX()
755         bbounds.ub0 += add;  in kmp_calc_new_bounds_XX()
758         bbounds.ub0 -= sub;  in kmp_calc_new_bounds_XX()
1074        (temp > (bounds->ub0 + bounds->ub1 * outer_iv))) ||  in kmp_calc_one_iv_for_chunk_end_XX()
1076        (temp < (bounds->ub0 + bounds->ub1 * outer_iv)))) {  in kmp_calc_one_iv_for_chunk_end_XX()
1227   T temp = bounds->ub0 +  in kmp_calc_one_iv_end_XX()