Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dinduction_var_range.h46 Value() : instruction(nullptr), a_constant(0), b_constant(0), is_known(false) {} in Value()
48 : instruction(a != 0 ? i : nullptr), a_constant(a), b_constant(b), is_known(true) {} in Value()
55 bool is_known; member
Dinduction_var_range.cc122 if (v.is_known && v.a_constant == 1 && v.b_constant <= 0) { in SimplifyMin()
134 if (v.is_known && v.a_constant >= 1) { in SimplifyMax()
154 return v.is_known && v.a_constant == 0; in IsConstantValue()
234 if (!min_val->is_known && info->induction_class == HInductionVarAnalysis::kWrapAround) { in GetInductionRange()
892 if (v1.is_known && v2.is_known && IsSafeAdd(v1.b_constant, v2.b_constant)) { in AddValue()
906 if (v1.is_known && v2.is_known && IsSafeSub(v1.b_constant, v2.b_constant)) { in SubValue()
920 if (v1.is_known && v2.is_known) { in MulValue()
935 if (v1.is_known && v2.is_known && v1.a_constant == 0 && v2.a_constant == 0) { in DivValue()
944 if (v1.is_known && v2.is_known) { in MergeVal()
Dinduction_var_range_test.cc48 EXPECT_EQ(v1.is_known, v2.is_known); in ExpectEqual()
Dbounds_check_elimination.cc1315 if (v1.is_known && (v1.a_constant == 0 || v1.a_constant == 1) && in InductionRangeFitsIn()
1316 v2.is_known && (v2.a_constant == 0 || v2.a_constant == 1)) { in InductionRangeFitsIn()