Home
last modified time | relevance | path

Searched refs:kCondLT (Results 1 – 13 of 13) sorted by relevance

/art/compiler/optimizing/
Dscheduler_arm.cc186 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()
Dinduction_var_analysis.cc134 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 …]
Dinstruction_simplifier.cc896 (((cmp == kCondLT || cmp == kCondLE) && c->IsMax()) || in AllowInMinMax()
901 bool is_max = (cmp == kCondLT || cmp == kCondLE); in AllowInMinMax()
967 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
972 bool is_min = (cmp == kCondLT || cmp == kCondLE) == (a == true_value); in VisitSelect()
974 } else if (((cmp == kCondLT || cmp == kCondLE) && true_value->IsNeg()) || in VisitSelect()
976 bool negLeft = (cmp == kCondLT || cmp == kCondLE); in VisitSelect()
992 ((cmp == kCondLT || cmp == kCondLE) && in VisitSelect()
Ddead_code_elimination.cc117 case kCondLT: in HasEquality()
Dbounds_check_elimination.cc649 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()
Dcode_generator_arm_vixl.cc953 case kCondLT: return lt; in ARMCondition()
972 case kCondLT: return lo; in ARMUnsignedCondition()
994 case kCondLT: return gt_bias ? cc : lt /* unordered */; in ARMFPCondition()
1292 *opposite = kCondLT; in AdjustConstantForCondition()
1295 *condition = kCondLT; in AdjustConstantForCondition()
1341 case kCondLT: in GenerateLongTestConstant()
1398 cond = kCondLT; in GenerateLongTestConstant()
1404 opposite = kCondLT; in GenerateLongTestConstant()
1410 case kCondLT: { in GenerateLongTestConstant()
1468 opposite = kCondLT; in GenerateLongTest()
[all …]
Dbounds_check_elimination_test.cc516 DCHECK(cond == kCondLT); in BuildSSAGraph2()
569 HInstruction* bounds_check = BuildSSAGraph2(graph_, GetAllocator(), 0, -1, kCondLT); in TEST_F()
Dcodegen_test.cc645 case kCondLT: in TestComparison()
Dnodes.h114 kCondLT, // < enumerator
3681 return ((if_cond == kCondLT) || (if_cond == kCondLE)) && IsGtBias(); in IsFPConditionFalseIfNaN()
3833 return kCondLT; in GetCondition()
3955 return kCondLT; in GetOppositeCondition()
Dcode_generator_x86.cc931 case kCondLT: return kLess; in X86Condition()
950 case kCondLT: return kBelow; in X86UnsignedOrFPCondition()
1525 case kCondLT: in GenerateLongComparesAndJumps()
1529 true_high_cond = kCondLT; in GenerateLongComparesAndJumps()
1532 false_high_cond = kCondLT; in GenerateLongComparesAndJumps()
Dcode_generator_arm64.cc100 case kCondLT: return lt; in ARM64Condition()
121 case kCondLT: return gt_bias ? cc : lt /* unordered */; in ARM64FPCondition()
2941 __ Cneg(result, result, ARM64FPCondition(kCondLT, compare->IsGtBias())); in VisitCompare()
Dnodes.cc3099 case kCondLT: replacement = new (allocator) HLessThan(lhs, rhs); break; in InsertOppositeCondition()
Dcode_generator_x86_64.cc953 case kCondLT: return kLess; in X86_64IntegerCondition()
971 case kCondLT: return kBelow; in X86_64FPCondition()