Searched refs:kCondLE (Results 1 – 17 of 17) sorted by relevance
| /art/compiler/optimizing/ |
| D | induction_var_analysis.cc | 103 case kCondLE: return other_cmp == kCondGE; in IsGuardedBy()
105 case kCondGE: return other_cmp == kCondLE; in IsGuardedBy()
1038 case kCondLE: VisitCondition(context, loop, body, b, a, type, kCondGE); break; in VisitCondition()
1040 case kCondGE: VisitCondition(context, loop, body, b, a, type, kCondLE); break; in VisitCondition()
1060 cmp = stride_value > 0 ? kCondLE : kCondGE; in VisitCondition()
1066 ((stride_value == +1 && IsTaken(context, loop, lower_expr, upper_expr, kCondLE)) || in VisitCondition()
1079 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) || in VisitCondition()
1150 case kCondLE: op = kLE; break; in VisitTripCount()
1175 case kCondLE: in IsTaken()
1207 case kCondLE: in IsFinite()
[all …]
|
| D | code_generator_utils.cc | 170 case kCondLE: { in IsComparedValueNonNegativeInBlock()
|
| D | scheduler_arm.cc | 362 case kCondLE: in HandleGenerateLongTestConstant()
399 case kCondLE: in HandleGenerateLongTest()
442 } else if (c == kCondLE || c == kCondGT) { in CanGenerateTest()
514 case kCondLE: in HandleGenerateConditionLong()
569 case kCondLE: in HandleGenerateConditionIntegralOrNonPrimitive()
|
| D | instruction_simplifier.cc | 1061 (((cmp == kCondLT || cmp == kCondLE) && c->IsMax()) || in AllowInMinMax()
1066 bool is_max = (cmp == kCondLT || cmp == kCondLE); in AllowInMinMax()
1141 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
1145 bool is_min = (cmp == kCondLT || cmp == kCondLE) == (a == true_value); in VisitSelect()
1147 } else if (((cmp == kCondLT || cmp == kCondLE) && true_value->IsNeg()) || in VisitSelect()
1149 bool negLeft = (cmp == kCondLT || cmp == kCondLE); in VisitSelect()
1165 ((cmp == kCondLT || cmp == kCondLE) && in VisitSelect()
|
| D | bounds_check_elimination.cc | 666 } else if (cond == kCondLE) { in HandleIfBetweenTwoMonotonicValueRanges()
758 if (cond == kCondLT || cond == kCondLE) { in HandleIf()
772 int32_t compensation = (cond == kCondLE) ? 1 : 0; // lower bound is inclusive in HandleIf()
|
| D | bounds_check_elimination_test.cc | 478 IfCondition cond = kCondLE) { in BuildSSAGraph2()
514 if (cond == kCondLE) { in BuildSSAGraph2()
|
| D | dead_code_elimination.cc | 115 case kCondLE: in HasEquality()
|
| D | code_generator_arm_vixl.cc | 1013 case kCondLE: return le; in ARMCondition()
1032 case kCondLE: return ls; in ARMUnsignedCondition()
1054 case kCondLE: return gt_bias ? ls : le /* unordered */; in ARMFPCondition()
1352 } else if (*condition == kCondLE) { in AdjustConstantForCondition()
1446 case kCondLE: in GenerateLongTestConstant()
1451 ret = cond == kCondLE ? std::make_pair(eq, ne) : std::make_pair(ne, eq); in GenerateLongTestConstant()
1455 if (cond == kCondLE) { in GenerateLongTestConstant()
1461 DCHECK_EQ(opposite, kCondLE); in GenerateLongTestConstant()
1522 case kCondLE: in GenerateLongTest()
1524 if (cond == kCondLE) { in GenerateLongTest()
[all …]
|
| D | codegen_test.cc | 654 case kCondLE: in TestComparison()
|
| D | code_generator_riscv64.cc | 1618 case kCondLE: in GenerateIntLongCondition()
1700 case kCondLE: in GenerateIntLongCompareAndBranch()
1727 case kCondLE: in GenerateIntLongCompareAndBranch()
1820 case kCondLE: in GenerateFpCondition()
2286 case kCondLE: in HandleCondition()
|
| D | nodes.h | 123 kCondLE, // <= enumerator
4094 return ((if_cond == kCondLT) || (if_cond == kCondLE)) && IsGtBias();
4286 return kCondLE;
4329 return kCondLE;
|
| D | nodes.cc | 3357 case kCondLE: replacement = new (allocator) HLessThanOrEqual(lhs, rhs); break; in InsertOppositeCondition()
|
| D | code_generator_x86.cc | 1034 case kCondLE: return kLessEqual; in X86Condition()
1053 case kCondLE: return kBelowEqual; in X86UnsignedOrFPCondition()
1988 case kCondLE: in GenerateLongComparesAndJumps()
|
| D | code_generator_arm64.cc | 114 case kCondLE: return le; in ARM64Condition()
135 case kCondLE: return gt_bias ? ls : le /* unordered */; in ARM64FPCondition()
|
| D | code_generator_x86_64.cc | 1087 case kCondLE: return kLessEqual; in X86_64IntegerCondition()
1105 case kCondLE: return kBelowEqual; in X86_64FPCondition()
|
| /art/compiler/utils/riscv64/ |
| D | assembler_riscv64.cc | 6477 Bcond(label, is_bare, kCondLE, rs, rt); in Ble()
6715 case kCondLE: in IsUncond()
6824 case kCondLE: in OppositeCondition()
6827 return kCondLE; in OppositeCondition()
|
| D | assembler_riscv64.h | 1932 kCondLE, enumerator
|