Lines Matching defs:bbounds

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