Home
last modified time | relevance | path

Searched refs:upper_expr (Results 1 – 2 of 2) sorted by relevance

/art/compiler/optimizing/
Dinduction_var_analysis.cc617 InductionInfo* upper_expr = b; in VisitCondition() local
627 if (cmp == kCondNE && ((stride_value == +1 && IsTaken(lower_expr, upper_expr, kCondLE)) || in VisitCondition()
628 (stride_value == -1 && IsTaken(lower_expr, upper_expr, kCondGE)))) { in VisitCondition()
636 !FitsNarrowerControl(lower_expr, upper_expr, stride_value, a->type, cmp)) { in VisitCondition()
644 VisitTripCount(loop, lower_expr, upper_expr, stride_expr, stride_value, type, cmp); in VisitCondition()
651 InductionInfo* upper_expr, in VisitTripCount() argument
682 InductionInfo* trip_count = upper_expr; in VisitTripCount()
683 const bool is_taken = IsTaken(lower_expr, upper_expr, cmp); in VisitTripCount()
684 const bool is_finite = IsFinite(upper_expr, stride_value, type, cmp); in VisitTripCount()
717 InductionInfo* taken_test = CreateInvariantOp(op, lower_expr, upper_expr); in VisitTripCount()
[all …]
Dinduction_var_analysis.h186 InductionInfo* upper_expr,
191 bool IsTaken(InductionInfo* lower_expr, InductionInfo* upper_expr, IfCondition cmp);
192 bool IsFinite(InductionInfo* upper_expr,
197 InductionInfo* upper_expr,