538   auto &bbounds = bounds->b;  in kmp_calc_span_lessoreq_XX()  local
540   if ((bbounds.lb1 != 0) || (bbounds.ub1 != 0)) {  in kmp_calc_span_lessoreq_XX()
545             &(bounds_nest[bbounds.outer_iv]));  in kmp_calc_span_lessoreq_XX()
552           bbounds.lb0 + bbounds.lb1 * previous->span_smallest;  in kmp_calc_span_lessoreq_XX()
554           bbounds.lb0 + bbounds.lb1 * previous->span_biggest;  in kmp_calc_span_lessoreq_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()
578     bounds->span_smallest = bbounds.lb0;  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()
602   auto &bbounds = bounds->b;  in kmp_calc_span_greateroreq_XX()  local
604   if ((bbounds.lb1 != 0) || (bbounds.ub1 != 0)) {  in kmp_calc_span_greateroreq_XX()
609             &(bounds_nest[bbounds.outer_iv]));  in kmp_calc_span_greateroreq_XX()
616           bbounds.lb0 + bbounds.lb1 * previous->span_smallest;  in kmp_calc_span_greateroreq_XX()
618           bbounds.lb0 + bbounds.lb1 * previous->span_biggest;  in kmp_calc_span_greateroreq_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()
643     bounds->span_biggest = bbounds.lb0;  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()
680   auto &bbounds = bounds->b;  in kmp_calc_new_bounds_XX()  local
682   if (bbounds.lb1 == bbounds.ub1) {  in kmp_calc_new_bounds_XX()
688     T old_lb1 = bbounds.lb1;  in kmp_calc_new_bounds_XX()
689     T old_ub1 = bbounds.ub1;  in kmp_calc_new_bounds_XX()
693       bbounds.lb1 = 0;  in kmp_calc_new_bounds_XX()
694       bbounds.ub1 = 0;  in kmp_calc_new_bounds_XX()
701         bbounds.lb1 = old_ub1;  in kmp_calc_new_bounds_XX()
703         bbounds.ub1 = old_lb1;  in kmp_calc_new_bounds_XX()
712             &bounds_nest[bbounds.outer_iv]);  in kmp_calc_new_bounds_XX()
714     if (bbounds.comparison == comparison_t::comp_less_or_eq) {  in kmp_calc_new_bounds_XX()
715       if (old_lb1 < bbounds.lb1) {  in kmp_calc_new_bounds_XX()
720         T sub = (bbounds.lb1 - old_lb1) * previous->span_biggest;  in kmp_calc_new_bounds_XX()
721         bbounds.lb0 -= sub; // OMPTODO: what if it'll go out of unsigned space?  in kmp_calc_new_bounds_XX()
723       } else if (old_lb1 > bbounds.lb1) {  in kmp_calc_new_bounds_XX()
725         T add = (old_lb1 - bbounds.lb1) * previous->span_smallest;  in kmp_calc_new_bounds_XX()
726         bbounds.lb0 += add;  in kmp_calc_new_bounds_XX()
729       if (old_ub1 > bbounds.ub1) {  in kmp_calc_new_bounds_XX()
734         T add = (old_ub1 - bbounds.ub1) * previous->span_biggest;  in kmp_calc_new_bounds_XX()
735         bbounds.ub0 += add;  in kmp_calc_new_bounds_XX()
736       } else if (old_ub1 < bbounds.ub1) {  in kmp_calc_new_bounds_XX()
738         T sub = (bbounds.ub1 - old_ub1) * previous->span_smallest;  in kmp_calc_new_bounds_XX()
739         bbounds.ub0 -= sub;  in kmp_calc_new_bounds_XX()
742       KMP_ASSERT(bbounds.comparison == comparison_t::comp_greater_or_eq);  in kmp_calc_new_bounds_XX()
743       if (old_lb1 < bbounds.lb1) {  in kmp_calc_new_bounds_XX()
745         T sub = (bbounds.lb1 - old_lb1) * previous->span_smallest;  in kmp_calc_new_bounds_XX()
746         bbounds.lb0 -= sub;  in kmp_calc_new_bounds_XX()
747       } else if (old_lb1 > bbounds.lb1) {  in kmp_calc_new_bounds_XX()
748         T add = (old_lb1 - bbounds.lb1) * previous->span_biggest;  in kmp_calc_new_bounds_XX()
749         bbounds.lb0 += add;  in kmp_calc_new_bounds_XX()
752       if (old_ub1 > bbounds.ub1) {  in kmp_calc_new_bounds_XX()
754         T add = (old_ub1 - bbounds.ub1) * previous->span_smallest;  in kmp_calc_new_bounds_XX()
755         bbounds.ub0 += add;  in kmp_calc_new_bounds_XX()
756       } else if (old_ub1 < bbounds.ub1) {  in kmp_calc_new_bounds_XX()
757         T sub = (bbounds.ub1 - old_ub1) * previous->span_biggest;  in kmp_calc_new_bounds_XX()
758         bbounds.ub0 -= sub;  in kmp_calc_new_bounds_XX()