Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dscheduler_arm.cc182 case kCondGE: in HandleGenerateConditionWithZero()
226 case kCondGE: in HandleGenerateLongTestConstant()
260 case kCondGE: in HandleGenerateLongTestConstant()
290 case kCondGE: in HandleGenerateLongTest()
327 if (c < kCondLT || c > kCondGE) { in CanGenerateTest()
397 case kCondGE: in HandleGenerateConditionLong()
453 case kCondGE: in HandleGenerateConditionIntegralOrNonPrimitive()
Dinduction_var_analysis.cc135 case kCondLE: return other_cmp == kCondGE; in IsGuardedBy()
137 case kCondGE: return other_cmp == kCondLE; in IsGuardedBy()
930 case kCondLE: VisitCondition(loop, body, b, a, type, kCondGE); break; in VisitCondition()
932 case kCondGE: VisitCondition(loop, body, b, a, type, kCondLE); break; in VisitCondition()
952 cmp = stride_value > 0 ? kCondLE : kCondGE; in VisitCondition()
958 (stride_value == -1 && IsTaken(lower_expr, upper_expr, kCondGE)))) { in VisitCondition()
971 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) { in VisitCondition()
1042 case kCondGE: op = kGE; break; in VisitTripCount()
1071 case kCondGE: in IsTaken()
1098 case kCondGE: in IsFinite()
[all …]
Dbounds_check_elimination_test.cc362 IfCondition cond = kCondGE) { in BuildSSAGraph1()
395 if (cond == kCondGE) { in BuildSSAGraph1()
622 if (cond == kCondGE) { in BuildSSAGraph3()
656 HInstruction* bounds_check = BuildSSAGraph3(graph_, GetAllocator(), 0, 1, kCondGE); in TEST_F()
664 HInstruction* bounds_check = BuildSSAGraph3(graph_, GetAllocator(), 1, 1, kCondGE); in TEST_F()
680 HInstruction* bounds_check = BuildSSAGraph3(graph_, GetAllocator(), 1, 8, kCondGE); in TEST_F()
689 IfCondition cond = kCondGE) { in BuildSSAGraph4()
723 if (cond == kCondGE) { in BuildSSAGraph4()
Ddead_code_elimination.cc112 case kCondGE: in HasEquality()
Dbounds_check_elimination.cc657 } else if (cond == kCondGE) { in HandleIfBetweenTwoMonotonicValueRanges()
768 } else if (cond == kCondGT || cond == kCondGE) { in HandleIf()
782 int32_t compensation = (cond == kCondGE) ? -1 : 0; // upper bound is inclusive in HandleIf()
Dinstruction_simplifier.cc903 ((cmp == kCondGT || cmp == kCondGE) && c->IsMin()))) { in AllowInMinMax()
973 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
981 ((cmp == kCondGT || cmp == kCondGE) && false_value->IsNeg())) { in VisitSelect()
996 if ((((cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
Dcode_generator_arm_vixl.cc957 case kCondGE: return ge; in ARMCondition()
976 case kCondGE: return hs; in ARMUnsignedCondition()
998 case kCondGE: return gt_bias ? cs /* unordered */ : ge; in ARMFPCondition()
1292 *condition = kCondGE; in AdjustConstantForCondition()
1297 *opposite = kCondGE; in AdjustConstantForCondition()
1343 case kCondGE: in GenerateLongTestConstant()
1400 opposite = kCondGE; in GenerateLongTestConstant()
1404 cond = kCondGE; in GenerateLongTestConstant()
1410 case kCondGE: in GenerateLongTestConstant()
1468 cond = kCondGE; in GenerateLongTest()
[all …]
Dcodegen_test.cc662 case kCondGE: in TestComparison()
Dnodes.h119 kCondGE, // >= enumerator
3726 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias(); in IsFPConditionTrueIfNaN()
3893 return kCondGE; in GetOppositeCondition()
4007 return kCondGE; in GetCondition()
Dnodes.cc3038 case kCondGE: replacement = new (allocator) HGreaterThanOrEqual(lhs, rhs); break; in InsertOppositeCondition()
Dcode_generator_x86.cc935 case kCondGE: return kGreaterEqual; in X86Condition()
954 case kCondGE: return kAboveEqual; in X86UnsignedOrFPCondition()
1562 case kCondGE: in GenerateLongComparesAndJumps()
Dcode_generator_arm64.cc103 case kCondGE: return ge; in ARM64Condition()
124 case kCondGE: return gt_bias ? cs /* unordered */ : ge; in ARM64FPCondition()
Dcode_generator_x86_64.cc957 case kCondGE: return kGreaterEqual; in X86_64IntegerCondition()
975 case kCondGE: return kAboveEqual; in X86_64FPCondition()