| /art/compiler/optimizing/ |
| H A D | bounds_check_elimination.cc | 661 if (cond == kCondLT) {
757 if (cond == kCondLT || cond == kCondLE) {
759 int32_t compensation = (cond == kCondLT) ? -1 : 0; // upper bound is inclusive
960 cmp == kCondLT || cmp == kCondLE) {
|
| H A D | bounds_check_elimination_test.cc | 516 DCHECK(cond == kCondLT);
569 HInstruction* bounds_check = BuildSSAGraph2(graph_, &allocator_, 0, -1, kCondLT);
|
| H A D | code_generator_arm.cc | 683 case kCondLT: return LT;
702 case kCondLT: return LO;
724 case kCondLT: return gt_bias ? CC : LT /* unordered */;
1285 case kCondLT:
1289 true_high_cond = kCondLT;
1292 false_high_cond = kCondLT;
3676 less_cond = ARMFPCondition(kCondLT, compare->IsGtBias());
|
| H A D | code_generator_arm64.cc | 83 case kCondLT: return lt;
104 case kCondLT: return gt_bias ? cc : lt /* unordered */;
2450 __ Cneg(result, result, ARM64FPCondition(kCondLT, compare->IsGtBias()));
|
| H A D | code_generator_mips.cc | 2651 case kCondLT:
2771 case kCondLT:
2802 case kCondLT:
2863 case kCondLT:
2904 case kCondLT:
2987 case kCondLT:
3062 case kCondLT:
3107 case kCondLT:
3155 case kCondLT:
3200 case kCondLT
[all...] |
| H A D | code_generator_mips64.cc | 2280 case kCondLT:
2405 case kCondLT:
2435 case kCondLT:
2480 case kCondLT:
2526 case kCondLT:
|
| H A D | code_generator_x86.cc | 700 case kCondLT: return kLess;
719 case kCondLT: return kBelow;
1205 case kCondLT:
1209 true_high_cond = kCondLT;
1212 false_high_cond = kCondLT;
|
| H A D | code_generator_x86_64.cc | 719 case kCondLT: return kLess;
737 case kCondLT: return kBelow;
|
| H A D | codegen_test.cc | 868 case kCondLT:
914 TestComparison(kCondLT, i, j, Primitive::kPrimInt, target_isa);
942 TestComparison(kCondLT, i, j, Primitive::kPrimLong, target_isa);
|
| H A D | induction_var_analysis.cc | 607 case kCondLT: VisitCondition(loop, b, a, type, kCondGT); break;
609 case kCondGT: VisitCondition(loop, b, a, type, kCondLT); break;
629 cmp = stride_value > 0 ? kCondLT : kCondGT;
642 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) ||
685 const bool cancels = (cmp == kCondLT || cmp == kCondGT) && std::abs(stride_value) == 1;
689 if (cmp == kCondLT) {
711 case kCondLT: op = kLT; break;
729 case kCondLT:
760 case kCondLT:
|
| H A D | nodes.cc | 2518 case kCondLT: replacement = new (allocator) HLessThan(lhs, rhs); break;
|
| H A D | nodes.h | 92 kCondLT, // < enumerator in enum:art::IfCondition
3082 return ((if_cond == kCondLT) || (if_cond == kCondLE)) && IsGtBias();
3228 return kCondLT;
3343 return kCondLT;
|
| /art/compiler/utils/mips/ |
| H A D | assembler_mips.cc | 766 case kCondLT:
782 case kCondLT:
1505 case kCondLT:
1553 case kCondLT:
1611 case kCondLT:
1614 return kCondLT;
2197 Bcond(label, kCondLT, rs, rt);
2198 } else if (!Branch::IsNop(kCondLT, rs, rt)) {
|
| H A D | assembler_mips.h | 574 kCondLT, enumerator in enum:art::mips::FINAL::BranchCondition
|
| /art/compiler/utils/mips64/ |
| H A D | assembler_mips64.cc | 639 case kCondLT:
1195 case kCondLT:
1246 case kCondLT:
1294 case kCondLT:
1297 return kCondLT;
1748 Bcond(label, kCondLT, rs, rt);
|
| H A D | assembler_mips64.h | 496 kCondLT, enumerator in enum:art::mips64::FINAL::BranchCondition
|