| /art/compiler/optimizing/ |
| 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:
[all...] |
| codegen_test.cc | 868 case kCondLT:
914 TestComparison(kCondLT, i, j, Primitive::kPrimInt, target_isa);
[all...] |
| 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
[all...] |
| bounds_check_elimination_test.cc | 516 DCHECK(cond == kCondLT);
569 HInstruction* bounds_check = BuildSSAGraph2(graph_, &allocator_, 0, -1, kCondLT);
[all...] |
| code_generator_mips.cc | [all...] |
| code_generator_mips64.cc | [all...] |
| code_generator_arm.cc | 683 case kCondLT: return LT;
702 case kCondLT: return LO;
724 case kCondLT: return gt_bias ? CC : LT /* unordered */;
[all...] |
| nodes.h | 92 kCondLT, // <
[all...] |
| code_generator_x86.cc | 700 case kCondLT: return kLess;
719 case kCondLT: return kBelow;
[all...] |
| code_generator_arm64.cc | 83 case kCondLT: return lt;
104 case kCondLT: return gt_bias ? cc : lt /* unordered */;
[all...] |
| nodes.cc | [all...] |
| code_generator_x86_64.cc | 719 case kCondLT: return kLess;
737 case kCondLT: return kBelow;
[all...] |
| /art/compiler/utils/mips/ |
| assembler_mips.cc | 766 case kCondLT:
782 case kCondLT:
[all...] |
| assembler_mips.h | 574 kCondLT,
[all...] |
| /art/compiler/utils/mips64/ |
| assembler_mips64.cc | 639 case kCondLT:
[all...] |
| assembler_mips64.h | 496 kCondLT,
|
