Searched refs:kCondLE (Results 1 – 13 of 13) sorted by relevance
| /art/compiler/optimizing/ |
| D | induction_var_analysis.cc | 135 case kCondLE: return other_cmp == kCondGE; in IsGuardedBy()
137 case kCondGE: return other_cmp == kCondLE; in IsGuardedBy()
930 case kCondLE: VisitCondition(loop, body, b, a, type, kCondGE); break; in VisitCondition()
932 case kCondGE: VisitCondition(loop, body, b, a, type, kCondLE); break; 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()
970 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) || in VisitCondition()
1040 case kCondLE: op = kLE; break; in VisitTripCount()
1063 case kCondLE: in IsTaken()
1093 case kCondLE: in IsFinite()
[all …]
|
| D | scheduler_arm.cc | 251 case kCondLE: in HandleGenerateLongTestConstant()
288 case kCondLE: in HandleGenerateLongTest()
331 } else if (c == kCondLE || c == kCondGT) { in CanGenerateTest()
403 case kCondLE: in HandleGenerateConditionLong()
458 case kCondLE: in HandleGenerateConditionIntegralOrNonPrimitive()
|
| D | instruction_simplifier.cc | 902 (((cmp == kCondLT || cmp == kCondLE) && c->IsMax()) || in AllowInMinMax()
907 bool is_max = (cmp == kCondLT || cmp == kCondLE); in AllowInMinMax()
973 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
978 bool is_min = (cmp == kCondLT || cmp == kCondLE) == (a == true_value); in VisitSelect()
980 } else if (((cmp == kCondLT || cmp == kCondLE) && true_value->IsNeg()) || in VisitSelect()
982 bool negLeft = (cmp == kCondLT || cmp == kCondLE); in VisitSelect()
998 ((cmp == kCondLT || cmp == kCondLE) && in VisitSelect()
|
| D | dead_code_elimination.cc | 111 case kCondLE: in HasEquality()
|
| D | bounds_check_elimination.cc | 653 } else if (cond == kCondLE) { in HandleIfBetweenTwoMonotonicValueRanges()
745 if (cond == kCondLT || cond == kCondLE) { in HandleIf()
759 int32_t compensation = (cond == kCondLE) ? 1 : 0; // lower bound is inclusive in HandleIf()
|
| D | bounds_check_elimination_test.cc | 477 IfCondition cond = kCondLE) { in BuildSSAGraph2()
513 if (cond == kCondLE) { in BuildSSAGraph2()
|
| D | code_generator_arm_vixl.cc | 955 case kCondLE: return le; in ARMCondition()
974 case kCondLE: return ls; in ARMUnsignedCondition()
996 case kCondLE: return gt_bias ? ls : le /* unordered */; in ARMFPCondition()
1294 } else if (*condition == kCondLE) { in AdjustConstantForCondition()
1388 case kCondLE: in GenerateLongTestConstant()
1393 ret = cond == kCondLE ? std::make_pair(eq, ne) : std::make_pair(ne, eq); in GenerateLongTestConstant()
1397 if (cond == kCondLE) { in GenerateLongTestConstant()
1403 DCHECK_EQ(opposite, kCondLE); in GenerateLongTestConstant()
1464 case kCondLE: in GenerateLongTest()
1466 if (cond == kCondLE) { in GenerateLongTest()
[all …]
|
| D | codegen_test.cc | 654 case kCondLE: in TestComparison()
|
| D | nodes.h | 117 kCondLE, // <= enumerator
3737 return ((if_cond == kCondLT) || (if_cond == kCondLE)) && IsGtBias(); in IsFPConditionFalseIfNaN()
3929 return kCondLE; in GetCondition()
3972 return kCondLE; in GetOppositeCondition()
|
| D | nodes.cc | 3036 case kCondLE: replacement = new (allocator) HLessThanOrEqual(lhs, rhs); break; in InsertOppositeCondition()
|
| D | code_generator_x86.cc | 933 case kCondLE: return kLessEqual; in X86Condition()
952 case kCondLE: return kBelowEqual; in X86UnsignedOrFPCondition()
1556 case kCondLE: in GenerateLongComparesAndJumps()
|
| D | code_generator_arm64.cc | 101 case kCondLE: return le; in ARM64Condition()
122 case kCondLE: return gt_bias ? ls : le /* unordered */; in ARM64FPCondition()
|
| D | code_generator_x86_64.cc | 955 case kCondLE: return kLessEqual; in X86_64IntegerCondition()
973 case kCondLE: return kBelowEqual; in X86_64FPCondition()
|