| /art/compiler/optimizing/ |
| 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()
971 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) { in VisitCondition()
1013 const bool cancels = (cmp == kCondLT || cmp == kCondGT) && std::abs(stride_value) == 1; in VisitTripCount()
1019 } else if (cmp == kCondGT) { in VisitTripCount()
1041 case kCondGT: op = kGT; break; in VisitTripCount()
1067 case kCondGT: in IsTaken()
[all …]
|
| D | scheduler_arm.cc | 252 case kCondGT: in HandleGenerateLongTestConstant()
289 case kCondGT: in HandleGenerateLongTest()
331 } else if (c == kCondLE || c == kCondGT) { in CanGenerateTest()
404 case kCondGT: in HandleGenerateConditionLong()
459 case kCondGT: in HandleGenerateConditionIntegralOrNonPrimitive()
|
| D | bounds_check_elimination_test.cc | 398 DCHECK(cond == kCondGT); in BuildSSAGraph1()
452 HInstruction* bounds_check = BuildSSAGraph1(graph_, GetAllocator(), 0, 1, kCondGT); in TEST_F()
625 DCHECK(cond == kCondGT); in BuildSSAGraph3()
672 HInstruction* bounds_check = BuildSSAGraph3(graph_, GetAllocator(), 0, 1, kCondGT); in TEST_F()
725 } else if (cond == kCondGT) { in BuildSSAGraph4()
776 HInstruction* bounds_check = BuildSSAGraph4(graph_, GetAllocator(), 0, kCondGT); in TEST_F()
|
| D | dead_code_elimination.cc | 118 case kCondGT: in HasEquality()
|
| D | code_generator_mips.cc | 4473 case kCondGT: in GenerateIntCompare()
4477 if (cond == kCondGT) { in GenerateIntCompare()
4594 case kCondGT: in MaterializeIntCompare()
4598 return (cond == kCondGT); in MaterializeIntCompare()
4681 case kCondGT: in GenerateIntCompareAndBranch()
4713 case kCondGT: in GenerateIntCompareAndBranch()
4768 case kCondGT: in GenerateIntCompareAndBranch()
4870 case kCondGT: in GenerateLongCompare()
4920 case kCondGT: in GenerateLongCompare()
5003 case kCondGT: in GenerateLongCompare()
[all …]
|
| D | bounds_check_elimination.cc | 655 } else if (cond == kCondGT) { in HandleIfBetweenTwoMonotonicValueRanges()
768 } else if (cond == kCondGT || cond == kCondGE) { in HandleIf()
771 int32_t compensation = (cond == kCondGT) ? 1 : 0; // lower bound is inclusive in HandleIf()
|
| D | code_generator_mips64.cc | 3814 case kCondGT: in GenerateIntLongCompare()
3818 if (cond == kCondGT) { in GenerateIntLongCompare()
3945 case kCondGT: in MaterializeIntLongCompare()
3949 return (cond == kCondGT); in MaterializeIntLongCompare()
4037 case kCondGT: in GenerateIntLongCompareAndBranch()
4067 case kCondGT: in GenerateIntLongCompareAndBranch()
4123 case kCondGT: in GenerateFpCompare()
4176 case kCondGT: in GenerateFpCompare()
4230 case kCondGT: in MaterializeFpCompare()
4271 case kCondGT: 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 | 954 case kCondGT: return gt; in ARMCondition()
973 case kCondGT: return hi; in ARMUnsignedCondition()
995 case kCondGT: return gt_bias ? hi /* unordered */ : gt; in ARMFPCondition()
1288 if (*condition == kCondGT) { in AdjustConstantForCondition()
1387 case kCondGT: in GenerateLongTestConstant()
1396 DCHECK_EQ(opposite, kCondGT); in GenerateLongTestConstant()
1400 DCHECK_EQ(cond, kCondGT); in GenerateLongTestConstant()
1463 case kCondGT: in GenerateLongTest()
1465 DCHECK_EQ(opposite, kCondGT); in GenerateLongTest()
1469 DCHECK_EQ(cond, kCondGT); in GenerateLongTest()
[all …]
|
| D | codegen_test.cc | 661 case kCondGT: in TestComparison()
|
| D | nodes.h | 116 kCondGT, // > enumerator
3654 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias(); in IsFPConditionTrueIfNaN()
3861 return kCondGT; in GetOppositeCondition()
3896 return kCondGT; in GetCondition()
|
| D | code_generator_x86.cc | 931 case kCondGT: return kGreater; in X86Condition()
950 case kCondGT: return kAbove; in X86UnsignedOrFPCondition()
1464 false_high_cond = kCondGT; in GenerateLongComparesAndJumps()
1469 case kCondGT: in GenerateLongComparesAndJumps()
1473 true_high_cond = kCondGT; in GenerateLongComparesAndJumps()
|
| D | nodes.cc | 3101 case kCondGT: replacement = new (allocator) HGreaterThan(lhs, rhs); break; in InsertOppositeCondition()
|
| D | code_generator_arm64.cc | 102 case kCondGT: return gt; in ARM64Condition()
123 case kCondGT: return gt_bias ? hi /* unordered */ : gt; in ARM64FPCondition()
|
| D | code_generator_x86_64.cc | 953 case kCondGT: return kGreater; in X86_64IntegerCondition()
971 case kCondGT: return kAbove; in X86_64FPCondition()
|
| /art/compiler/utils/mips64/ |
| D | assembler_mips64.cc | 875 case kCondGT: in EmitBcondR6()
968 case kCondGT: in EmitBcondR2()
2424 case kCondGT: in IsNop()
2481 case kCondGT: in Branch()
2530 return kCondGT; in OppositeCondition()
2531 case kCondGT: in OppositeCondition()
|
| D | assembler_mips64.h | 1457 kCondGT, enumerator
|
| /art/compiler/utils/mips/ |
| D | assembler_mips.cc | 1151 case kCondGT: in EmitBcondR2()
1173 case kCondGT: in EmitBcondR6()
3003 case kCondGT: in IsNop()
3064 case kCondGT: in Branch()
3132 return kCondGT; in OppositeCondition()
3133 case kCondGT: in OppositeCondition()
|
| D | assembler_mips.h | 1402 kCondGT, enumerator
|