Home
last modified time | relevance | path

Searched refs:op_a (Results 1 – 3 of 3) sorted by relevance

/art/compiler/optimizing/
Dinduction_var_range.cc355 if (IsConstant(info->op_a, kExact, &stride_value) && stride_value == 1) { in IsUnitStride()
384 if (GenerateCode(trip->op_a, nullptr, graph, block, &trip_expr, false, false)) { in GenerateTripCount()
406 *is_constant = IsConstant(trip->op_a, kExact, trip_count); in CheckForFiniteAndConstantProps()
469 HInductionVarAnalysis::InductionInfo* lower = trip->op_b->op_a; in IsWellBehavedTripCount()
484 return HasFetchInLoop(info->op_a) || HasFetchInLoop(info->op_b); in HasFetchInLoop()
493 return IsConstant(info->op_a, kExact, stride_value); in NeedsTripCount()
495 return NeedsTripCount(info->op_a, stride_value); in NeedsTripCount()
534 HInductionVarAnalysis::InductionInfo* trip_expr = trip->op_a; in GetLinear()
537 if (IsConstant(info->op_a, kExact, &stride_value)) { in GetLinear()
545 trip_expr->op_a, in GetLinear()
[all …]
Dinduction_var_analysis.cc511 induction = RotatePeriodicInduction(induction->op_b, induction->op_a); in ClassifyNonTrivial()
539 induction->op_a, in RotatePeriodicInduction()
576 InductionInfo* new_a = TransferAddSub(a->op_a, b->op_a, op); in TransferAddSub()
583 InductionInfo* new_a = b->op_a; in TransferAddSub()
595 InductionInfo* new_a = a->op_a; in TransferAddSub()
618 InductionInfo* new_a = TransferNeg(a->op_a); in TransferNeg()
641 InductionInfo* new_a = TransferMul(a, b->op_a); in TransferMul()
649 InductionInfo* new_a = TransferMul(a->op_a, b); in TransferMul()
669 return CreateInduction(kLinear, kNop, a->op_a, a->op_b, a->fetch, to); in TransferConversion()
940 InductionInfo* stride_expr = a->op_a; in VisitCondition()
[all …]
Dinduction_var_analysis.h109 op_a(a), in InductionInfo()
115 InductionInfo* op_a; member