Home
last modified time | relevance | path

Searched refs:stride_value (Results 1 – 4 of 4) sorted by relevance

/art/compiler/optimizing/
Dinduction_var_range.cc218 int64_t stride_value = 0; in GetInductionRange() local
221 *needs_finite_test = NeedsTripCount(info, &stride_value) && IsUnsafeTripCount(trip); in GetInductionRange()
235 int64_t stride_value = 0; in CanGenerateRange() local
244 &stride_value, in CanGenerateRange()
247 && (stride_value == -1 || in CanGenerateRange()
248 stride_value == 0 || in CanGenerateRange()
249 stride_value == 1); // avoid arithmetic wrap-around anomalies. in CanGenerateRange()
259 int64_t stride_value = 0; in GenerateRange() local
269 &stride_value, in GenerateRange()
281 int64_t stride_value = 0; in GenerateTakenTest() local
[all …]
Dinduction_var_analysis.cc942 int64_t stride_value = 0; in VisitCondition() local
943 if (!IsExact(stride_expr, &stride_value)) { in VisitCondition()
951 if (cmp == kCondNE && RewriteBreakLoop(loop, body, stride_value, type)) { in VisitCondition()
952 cmp = stride_value > 0 ? kCondLE : kCondGE; in VisitCondition()
957 if (cmp == kCondNE && ((stride_value == +1 && IsTaken(lower_expr, upper_expr, kCondLE)) || in VisitCondition()
958 (stride_value == -1 && IsTaken(lower_expr, upper_expr, kCondGE)))) { in VisitCondition()
959 cmp = stride_value > 0 ? kCondLT : kCondGT; in VisitCondition()
964 !FitsNarrowerControl(lower_expr, upper_expr, stride_value, a->type, cmp)) { in VisitCondition()
970 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) || in VisitCondition()
971 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) { in VisitCondition()
[all …]
Dinduction_var_analysis.h214 int64_t stride_value,
219 int64_t stride_value,
224 int64_t stride_value,
229 int64_t stride_value,
Dinduction_var_range.h227 /*out*/ int64_t* stride_value) const;
297 /*out*/ int64_t* stride_value,