Home | History | Annotate | Download | only in optimizing

Lines Matching refs:stride_value

799     int64_t stride_value = 0;
800 if (!IsExact(stride_expr, &stride_value)) {
806 if (cmp == kCondNE && ((stride_value == +1 && IsTaken(lower_expr, upper_expr, kCondLE)) ||
807 (stride_value == -1 && IsTaken(lower_expr, upper_expr, kCondGE)))) {
808 cmp = stride_value > 0 ? kCondLT : kCondGT;
815 !FitsNarrowerControl(lower_expr, upper_expr, stride_value, a->type, cmp)) {
821 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) ||
822 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) {
823 VisitTripCount(loop, lower_expr, upper_expr, stride_expr, stride_value, type, cmp);
832 int64_t stride_value,
863 const bool is_finite = IsFinite(upper_expr, stride_value, type, cmp);
864 const bool cancels = (cmp == kCondLT || cmp == kCondGT) && std::abs(stride_value) == 1;
933 int64_t stride_value,
942 return stride_value == 1 ||
943 (IsAtMost(upper_expr, &value) && value <= (max - stride_value + 1));
945 return (IsAtMost(upper_expr, &value) && value <= (max - stride_value));
947 return stride_value == -1 ||
948 (IsAtLeast(upper_expr, &value) && value >= (min - stride_value - 1));
950 return (IsAtLeast(upper_expr, &value) && value >= (min - stride_value));
959 int64_t stride_value,
965 if (stride_value != 1 && stride_value != -1) {