| /art/compiler/optimizing/ |
| D | scheduler_arm.cc | 182 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()
|
| D | induction_var_analysis.cc | 135 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 …]
|
| D | bounds_check_elimination_test.cc | 362 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()
|
| D | code_generator_mips.cc | 4455 case kCondGE: in GenerateIntCompare()
4465 if (cond == kCondGE) { in GenerateIntCompare()
4581 case kCondGE: in MaterializeIntCompare()
4591 return (cond == kCondGE); in MaterializeIntCompare()
4675 case kCondGE: in GenerateIntCompareAndBranch()
4707 case kCondGE: in GenerateIntCompareAndBranch()
4749 case kCondGE: in GenerateIntCompareAndBranch()
4860 case kCondGE: in GenerateLongCompare()
4902 case kCondGE: in GenerateLongCompare()
4916 if (cond == kCondGE) { in GenerateLongCompare()
[all …]
|
| D | dead_code_elimination.cc | 112 case kCondGE: in HasEquality()
|
| D | bounds_check_elimination.cc | 657 } 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()
|
| D | code_generator_mips64.cc | 3796 case kCondGE: in GenerateIntLongCompare()
3806 if (cond == kCondGE) { in GenerateIntLongCompare()
3932 case kCondGE: in MaterializeIntLongCompare()
3942 return (cond == kCondGE); in MaterializeIntLongCompare()
4031 case kCondGE: in GenerateIntLongCompareAndBranch()
4061 case kCondGE: in GenerateIntLongCompareAndBranch()
4132 case kCondGE: in GenerateFpCompare()
4185 case kCondGE: in GenerateFpCompare()
4237 case kCondGE: in MaterializeFpCompare()
4278 case kCondGE: in MaterializeFpCompare()
[all …]
|
| D | instruction_simplifier.cc | 907 ((cmp == kCondGT || cmp == kCondGE) && c->IsMin()))) { in AllowInMinMax()
977 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
985 ((cmp == kCondGT || cmp == kCondGE) && false_value->IsNeg())) { in VisitSelect()
1000 if ((((cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
|
| D | code_generator_arm_vixl.cc | 955 case kCondGE: return ge; in ARMCondition()
974 case kCondGE: return hs; in ARMUnsignedCondition()
996 case kCondGE: return gt_bias ? cs /* unordered */ : ge; in ARMFPCondition()
1290 *condition = kCondGE; in AdjustConstantForCondition()
1295 *opposite = kCondGE; in AdjustConstantForCondition()
1341 case kCondGE: in GenerateLongTestConstant()
1398 opposite = kCondGE; in GenerateLongTestConstant()
1402 cond = kCondGE; in GenerateLongTestConstant()
1408 case kCondGE: in GenerateLongTestConstant()
1466 cond = kCondGE; in GenerateLongTest()
[all …]
|
| D | codegen_test.cc | 665 case kCondGE: in TestComparison()
|
| D | nodes.h | 117 kCondGE, // >= enumerator
3654 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias(); in IsFPConditionTrueIfNaN()
3821 return kCondGE; in GetOppositeCondition()
3935 return kCondGE; in GetCondition()
|
| D | nodes.cc | 3102 case kCondGE: replacement = new (allocator) HGreaterThanOrEqual(lhs, rhs); break; in InsertOppositeCondition()
|
| D | code_generator_x86.cc | 932 case kCondGE: return kGreaterEqual; in X86Condition()
951 case kCondGE: return kAboveEqual; in X86UnsignedOrFPCondition()
1472 case kCondGE: in GenerateLongComparesAndJumps()
|
| D | code_generator_arm64.cc | 103 case kCondGE: return ge; in ARM64Condition()
124 case kCondGE: return gt_bias ? cs /* unordered */ : ge; in ARM64FPCondition()
|
| D | code_generator_x86_64.cc | 954 case kCondGE: return kGreaterEqual; in X86_64IntegerCondition()
972 case kCondGE: return kAboveEqual; in X86_64FPCondition()
|
| /art/compiler/utils/mips64/ |
| D | assembler_mips64.cc | 869 case kCondGE: in EmitBcondR6()
966 case kCondGE: in EmitBcondR2()
2439 case kCondGE: in IsUncond()
2479 case kCondGE: in Branch()
2526 return kCondGE; in OppositeCondition()
2527 case kCondGE: in OppositeCondition()
3293 Bcond(label, /* is_r6= */ true, is_bare, kCondGE, rs, rt); in Bgec()
|
| D | assembler_mips64.h | 1455 kCondGE, enumerator
|
| /art/compiler/utils/mips/ |
| D | assembler_mips.cc | 1149 case kCondGE: in EmitBcondR2()
1167 case kCondGE: in EmitBcondR6()
3016 case kCondGE: in IsUncond()
3062 case kCondGE: in Branch()
3128 return kCondGE; in OppositeCondition()
3129 case kCondGE: in OppositeCondition()
4402 Bcond(label, IsR6(), is_bare, kCondGE, rs, rt); in Bge()
4403 } else if (Branch::IsUncond(kCondGE, rs, rt)) { in Bge()
4497 Bcond(label, /* is_r6= */ true, is_bare, kCondGE, rs, rt); in Bgec()
|
| D | assembler_mips.h | 1400 kCondGE, enumerator
|