| /art/compiler/optimizing/ |
| induction_var_analysis.cc | 608 case kCondLE: VisitCondition(loop, b, a, type, kCondGE); break;
610 case kCondGE: VisitCondition(loop, b, a, type, kCondLE); break;
627 if (cmp == kCondNE && ((stride_value == +1 && IsTaken(lower_expr, upper_expr, kCondLE)) ||
642 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) ||
712 case kCondLE: op = kLE; break;
733 case kCondLE:
763 case kCondLE:
[all...] |
| codegen_test.cc | 872 case kCondLE:
915 TestComparison(kCondLE, i, j, Primitive::kPrimInt, target_isa);
[all...] |
| bounds_check_elimination.cc | 665 } else if (cond == kCondLE) {
757 if (cond == kCondLT || cond == kCondLE) {
771 int32_t compensation = (cond == kCondLE) ? 1 : 0; // lower bound is inclusive
[all...] |
| code_generator_mips.cc | [all...] |
| bounds_check_elimination_test.cc | 477 IfCondition cond = kCondLE) {
513 if (cond == kCondLE) {
[all...] |
| code_generator_mips64.cc | [all...] |
| nodes.h | 93 kCondLE, // <=
[all...] |
| code_generator_arm.cc | 684 case kCondLE: return LE;
703 case kCondLE: return LS;
725 case kCondLE: return gt_bias ? LS : LE /* unordered */;
[all...] |
| nodes.cc | [all...] |
| code_generator_x86.cc | 701 case kCondLE: return kLessEqual;
720 case kCondLE: return kBelowEqual;
[all...] |
| code_generator_arm64.cc | 84 case kCondLE: return le;
105 case kCondLE: return gt_bias ? ls : le /* unordered */;
[all...] |
| code_generator_x86_64.cc | 720 case kCondLE: return kLessEqual;
738 case kCondLE: return kBelowEqual;
[all...] |
| /art/compiler/utils/mips/ |
| assembler_mips.cc | 768 case kCondLE:
788 case kCondLE:
[all...] |
| assembler_mips.h | 576 kCondLE,
[all...] |
| /art/compiler/utils/mips64/ |
| assembler_mips64.cc | 645 case kCondLE:
[all...] |
| assembler_mips64.h | 498 kCondLE,
|
