| /art/compiler/optimizing/ |
| D | scheduler_arm.cc | 186 case kCondLT: in HandleGenerateConditionWithZero()
225 case kCondLT: in HandleGenerateLongTestConstant()
261 case kCondLT: { in HandleGenerateLongTestConstant()
291 case kCondLT: { in HandleGenerateLongTest()
327 if (c < kCondLT || c > kCondGE) { in CanGenerateTest()
396 case kCondLT: in HandleGenerateConditionLong()
452 case kCondLT: in HandleGenerateConditionIntegralOrNonPrimitive()
|
| D | induction_var_analysis.cc | 134 case kCondLT: return other_cmp == kCondGT; in IsGuardedBy()
136 case kCondGT: return other_cmp == kCondLT; in IsGuardedBy()
929 case kCondLT: VisitCondition(loop, body, b, a, type, kCondGT); break; in VisitCondition()
931 case kCondGT: VisitCondition(loop, body, b, a, type, kCondLT); break; in VisitCondition()
959 cmp = stride_value > 0 ? kCondLT : kCondGT; in VisitCondition()
970 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) || in VisitCondition()
1013 const bool cancels = (cmp == kCondLT || cmp == kCondGT) && std::abs(stride_value) == 1; in VisitTripCount()
1017 if (cmp == kCondLT) { in VisitTripCount()
1039 case kCondLT: op = kLT; break; in VisitTripCount()
1059 case kCondLT: in IsTaken()
[all …]
|
| D | instruction_simplifier.cc | 906 (((cmp == kCondLT || cmp == kCondLE) && c->IsMax()) || in AllowInMinMax()
911 bool is_max = (cmp == kCondLT || cmp == kCondLE); in AllowInMinMax()
977 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
982 bool is_min = (cmp == kCondLT || cmp == kCondLE) == (a == true_value); in VisitSelect()
984 } else if (((cmp == kCondLT || cmp == kCondLE) && true_value->IsNeg()) || in VisitSelect()
986 bool negLeft = (cmp == kCondLT || cmp == kCondLE); in VisitSelect()
1002 ((cmp == kCondLT || cmp == kCondLE) && in VisitSelect()
|
| D | dead_code_elimination.cc | 117 case kCondLT: in HasEquality()
|
| D | code_generator_mips.cc | 4454 case kCondLT: in GenerateIntCompare()
4580 case kCondLT: in MaterializeIntCompare()
4672 case kCondLT: in GenerateIntCompareAndBranch()
4704 case kCondLT: in GenerateIntCompareAndBranch()
4740 case kCondLT: in GenerateIntCompareAndBranch()
4857 case kCondLT: in GenerateLongCompare()
4901 case kCondLT: in GenerateLongCompare()
4992 case kCondLT: in GenerateLongCompare()
5073 case kCondLT: in GenerateLongCompareAndBranch()
5114 case kCondLT: in GenerateLongCompareAndBranch()
[all …]
|
| D | bounds_check_elimination.cc | 649 if (cond == kCondLT) { in HandleIfBetweenTwoMonotonicValueRanges()
745 if (cond == kCondLT || cond == kCondLE) { in HandleIf()
747 int32_t compensation = (cond == kCondLT) ? -1 : 0; // upper bound is inclusive in HandleIf()
|
| D | code_generator_arm_vixl.cc | 952 case kCondLT: return lt; in ARMCondition()
971 case kCondLT: return lo; in ARMUnsignedCondition()
993 case kCondLT: return gt_bias ? cc : lt /* unordered */; in ARMFPCondition()
1291 *opposite = kCondLT; in AdjustConstantForCondition()
1294 *condition = kCondLT; in AdjustConstantForCondition()
1340 case kCondLT: in GenerateLongTestConstant()
1397 cond = kCondLT; in GenerateLongTestConstant()
1403 opposite = kCondLT; in GenerateLongTestConstant()
1409 case kCondLT: { in GenerateLongTestConstant()
1467 opposite = kCondLT; in GenerateLongTest()
[all …]
|
| D | bounds_check_elimination_test.cc | 516 DCHECK(cond == kCondLT); in BuildSSAGraph2()
569 HInstruction* bounds_check = BuildSSAGraph2(graph_, GetAllocator(), 0, -1, kCondLT); in TEST_F()
|
| D | code_generator_mips64.cc | 3795 case kCondLT: in GenerateIntLongCompare()
3931 case kCondLT: in MaterializeIntLongCompare()
4028 case kCondLT: in GenerateIntLongCompareAndBranch()
4058 case kCondLT: in GenerateIntLongCompareAndBranch()
4105 case kCondLT: in GenerateFpCompare()
4158 case kCondLT: in GenerateFpCompare()
4216 case kCondLT: in MaterializeFpCompare()
4257 case kCondLT: in MaterializeFpCompare()
4309 case kCondLT: in GenerateFpCompareAndBranch()
4356 case kCondLT: in GenerateFpCompareAndBranch()
|
| D | codegen_test.cc | 653 case kCondLT: in TestComparison()
|
| D | nodes.h | 114 kCondLT, // < enumerator
3665 return ((if_cond == kCondLT) || (if_cond == kCondLE)) && IsGtBias(); in IsFPConditionFalseIfNaN()
3817 return kCondLT; in GetCondition()
3939 return kCondLT; in GetOppositeCondition()
|
| D | code_generator_x86.cc | 929 case kCondLT: return kLess; in X86Condition()
948 case kCondLT: return kBelow; in X86UnsignedOrFPCondition()
1463 case kCondLT: in GenerateLongComparesAndJumps()
1467 true_high_cond = kCondLT; in GenerateLongComparesAndJumps()
1470 false_high_cond = kCondLT; in GenerateLongComparesAndJumps()
|
| D | code_generator_arm64.cc | 100 case kCondLT: return lt; in ARM64Condition()
121 case kCondLT: return gt_bias ? cc : lt /* unordered */; in ARM64FPCondition()
2817 __ Cneg(result, result, ARM64FPCondition(kCondLT, compare->IsGtBias())); in VisitCompare()
|
| D | nodes.cc | 3099 case kCondLT: replacement = new (allocator) HLessThan(lhs, rhs); break; in InsertOppositeCondition()
|
| D | code_generator_x86_64.cc | 951 case kCondLT: return kLess; in X86_64IntegerCondition()
969 case kCondLT: return kBelow; in X86_64FPCondition()
|
| /art/compiler/utils/mips64/ |
| D | assembler_mips64.cc | 866 case kCondLT: in EmitBcondR6()
965 case kCondLT: in EmitBcondR2()
2423 case kCondLT: in IsNop()
2478 case kCondLT: in Branch()
2525 case kCondLT: in OppositeCondition()
2528 return kCondLT; in OppositeCondition()
3281 Bcond(label, /* is_r6= */ true, is_bare, kCondLT, rs, rt); in Bltc()
|
| D | assembler_mips64.h | 1454 kCondLT, enumerator
|
| /art/compiler/utils/mips/ |
| D | assembler_mips.cc | 1148 case kCondLT: in EmitBcondR2()
1164 case kCondLT: in EmitBcondR6()
3002 case kCondLT: in IsNop()
3061 case kCondLT: in Branch()
3127 case kCondLT: in OppositeCondition()
3130 return kCondLT; in OppositeCondition()
4392 Bcond(label, IsR6(), is_bare, kCondLT, rs, rt); in Blt()
4393 } else if (!Branch::IsNop(kCondLT, rs, rt)) { in Blt()
4493 Bcond(label, /* is_r6= */ true, is_bare, kCondLT, rs, rt); in Bltc()
|
| D | assembler_mips.h | 1399 kCondLT, enumerator
|