/art/compiler/optimizing/ |
D | bounds_check_elimination_test.cc | 362 IfCondition cond = kCondGE) { in BuildSSAGraph1() 395 if (cond == kCondGE) { in BuildSSAGraph1() 621 if (cond == kCondGE) { in BuildSSAGraph3() 655 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 0, 1, kCondGE); in TEST_F() 663 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 1, 1, kCondGE); in TEST_F() 679 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 1, 8, kCondGE); in TEST_F() 688 IfCondition cond = kCondGE) { in BuildSSAGraph4() 722 if (cond == kCondGE) { in BuildSSAGraph4()
|
D | induction_var_analysis.cc | 787 case kCondLE: VisitCondition(loop, b, a, type, kCondGE); break; in VisitCondition() 789 case kCondGE: VisitCondition(loop, b, a, type, kCondLE); break; in VisitCondition() 807 (stride_value == -1 && IsTaken(lower_expr, upper_expr, kCondGE)))) { in VisitCondition() 822 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) { in VisitCondition() 893 case kCondGE: op = kGE; break; in VisitTripCount() 922 case kCondGE: in IsTaken() 949 case kCondGE: in IsFinite() 969 } else if (cmp == kCondGE) { in FitsNarrowerControl()
|
D | code_generator_mips.cc | 3949 case kCondGE: in GenerateIntCompare() 3959 if (cond == kCondGE) { in GenerateIntCompare() 4075 case kCondGE: in MaterializeIntCompare() 4085 return (cond == kCondGE); in MaterializeIntCompare() 4169 case kCondGE: in GenerateIntCompareAndBranch() 4201 case kCondGE: in GenerateIntCompareAndBranch() 4243 case kCondGE: in GenerateIntCompareAndBranch() 4354 case kCondGE: in GenerateLongCompare() 4396 case kCondGE: in GenerateLongCompare() 4410 if (cond == kCondGE) { in GenerateLongCompare() [all …]
|
D | dead_code_elimination.cc | 107 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_arm_vixl.cc | 1471 case kCondGE: return ge; in ARMCondition() 1490 case kCondGE: return hs; in ARMUnsignedCondition() 1512 case kCondGE: return gt_bias ? cs /* unordered */ : ge; in ARMFPCondition() 1802 *condition = kCondGE; in AdjustConstantForCondition() 1807 *opposite = kCondGE; in AdjustConstantForCondition() 1853 case kCondGE: in GenerateLongTestConstant() 1899 opposite = kCondGE; in GenerateLongTestConstant() 1903 cond = kCondGE; in GenerateLongTestConstant() 1909 case kCondGE: in GenerateLongTestConstant() 1967 cond = kCondGE; in GenerateLongTest() [all …]
|
D | codegen_test.cc | 663 case kCondGE: in TestComparison()
|
D | code_generator_mips64.cc | 3530 case kCondGE: in GenerateIntLongCompare() 3540 if (cond == kCondGE) { in GenerateIntLongCompare() 3657 case kCondGE: in GenerateIntLongCompareAndBranch() 3687 case kCondGE: in GenerateIntLongCompareAndBranch() 3758 case kCondGE: in GenerateFpCompare() 3811 case kCondGE: in GenerateFpCompare() 3868 case kCondGE: in GenerateFpCompareAndBranch() 3914 case kCondGE: in GenerateFpCompareAndBranch()
|
D | nodes.h | 112 kCondGE, // >= enumerator 3373 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias(); in IsFPConditionTrueIfNaN() 3534 return kCondGE; in GetOppositeCondition() 3641 return kCondGE; in GetCondition()
|
D | nodes.cc | 2802 case kCondGE: replacement = new (allocator) HGreaterThanOrEqual(lhs, rhs); break; in InsertOppositeCondition()
|
D | code_generator_x86.cc | 925 case kCondGE: return kGreaterEqual; in X86Condition() 944 case kCondGE: return kAboveEqual; in X86UnsignedOrFPCondition() 1440 case kCondGE: in GenerateLongComparesAndJumps()
|
D | code_generator_arm64.cc | 116 case kCondGE: return ge; in ARM64Condition() 137 case kCondGE: return gt_bias ? cs /* unordered */ : ge; in ARM64FPCondition()
|
D | code_generator_x86_64.cc | 949 case kCondGE: return kGreaterEqual; in X86_64IntegerCondition() 967 case kCondGE: return kAboveEqual; in X86_64FPCondition()
|
/art/compiler/utils/mips64/ |
D | assembler_mips64.cc | 806 case kCondGE: in EmitBcondc() 2005 case kCondGE: in IsUncond() 2041 case kCondGE: in Branch() 2088 return kCondGE; in OppositeCondition() 2089 case kCondGE: in OppositeCondition() 2808 Bcond(label, kCondGE, rs, rt); in Bgec()
|
D | assembler_mips64.h | 1345 kCondGE, enumerator
|
/art/compiler/utils/mips/ |
D | assembler_mips.cc | 1181 case kCondGE: in EmitBcondR2() 1199 case kCondGE: in EmitBcondR6() 3091 case kCondGE: in IsUncond() 3128 case kCondGE: in Branch() 3195 return kCondGE; in OppositeCondition() 3196 case kCondGE: in OppositeCondition() 4302 Bcond(label, kCondGE, rs, rt); in Bge() 4303 } else if (Branch::IsUncond(kCondGE, rs, rt)) { in Bge()
|
D | assembler_mips.h | 1190 kCondGE, enumerator
|