| /art/compiler/optimizing/ |
| D | induction_var_analysis.cc | 786 case kCondLT: VisitCondition(loop, b, a, type, kCondGT); break; in VisitCondition()
788 case kCondGT: VisitCondition(loop, b, a, type, kCondLT); break; in VisitCondition()
808 cmp = stride_value > 0 ? kCondLT : kCondGT; in VisitCondition()
822 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) { in VisitCondition()
864 const bool cancels = (cmp == kCondLT || cmp == kCondGT) && std::abs(stride_value) == 1; in VisitTripCount()
870 } else if (cmp == kCondGT) { in VisitTripCount()
892 case kCondGT: op = kGT; break; in VisitTripCount()
918 case kCondGT: in IsTaken()
946 case kCondGT: in IsFinite()
|
| D | bounds_check_elimination_test.cc | 398 DCHECK(cond == kCondGT); in BuildSSAGraph1()
452 HInstruction* bounds_check = BuildSSAGraph1(graph_, &allocator_, 0, 1, kCondGT); in TEST_F()
624 DCHECK(cond == kCondGT); in BuildSSAGraph3()
671 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 0, 1, kCondGT); in TEST_F()
724 } else if (cond == kCondGT) { in BuildSSAGraph4()
775 HInstruction* bounds_check = BuildSSAGraph4(graph_, &allocator_, 0, kCondGT); in TEST_F()
|
| D | dead_code_elimination.cc | 113 case kCondGT: in HasEquality()
|
| D | code_generator_mips.cc | 3967 case kCondGT: in GenerateIntCompare()
3971 if (cond == kCondGT) { in GenerateIntCompare()
4088 case kCondGT: in MaterializeIntCompare()
4092 return (cond == kCondGT); in MaterializeIntCompare()
4175 case kCondGT: in GenerateIntCompareAndBranch()
4207 case kCondGT: in GenerateIntCompareAndBranch()
4262 case kCondGT: in GenerateIntCompareAndBranch()
4364 case kCondGT: in GenerateLongCompare()
4414 case kCondGT: in GenerateLongCompare()
4497 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_arm_vixl.cc | 1470 case kCondGT: return gt; in ARMCondition()
1489 case kCondGT: return hi; in ARMUnsignedCondition()
1511 case kCondGT: return gt_bias ? hi /* unordered */ : gt; in ARMFPCondition()
1800 if (*condition == kCondGT) { in AdjustConstantForCondition()
1888 case kCondGT: in GenerateLongTestConstant()
1897 DCHECK_EQ(opposite, kCondGT); in GenerateLongTestConstant()
1901 DCHECK_EQ(cond, kCondGT); in GenerateLongTestConstant()
1964 case kCondGT: in GenerateLongTest()
1966 DCHECK_EQ(opposite, kCondGT); in GenerateLongTest()
1970 DCHECK_EQ(cond, kCondGT); in GenerateLongTest()
[all …]
|
| D | codegen_test.cc | 659 case kCondGT: in TestComparison()
|
| D | code_generator_mips64.cc | 3548 case kCondGT: in GenerateIntLongCompare()
3552 if (cond == kCondGT) { in GenerateIntLongCompare()
3663 case kCondGT: in GenerateIntLongCompareAndBranch()
3693 case kCondGT: in GenerateIntLongCompareAndBranch()
3749 case kCondGT: in GenerateFpCompare()
3802 case kCondGT: in GenerateFpCompare()
3860 case kCondGT: in GenerateFpCompareAndBranch()
3906 case kCondGT: in GenerateFpCompareAndBranch()
|
| D | nodes.h | 111 kCondGT, // > enumerator
3373 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias(); in IsFPConditionTrueIfNaN()
3571 return kCondGT; in GetOppositeCondition()
3604 return kCondGT; in GetCondition()
|
| D | code_generator_x86.cc | 924 case kCondGT: return kGreater; in X86Condition()
943 case kCondGT: return kAbove; in X86UnsignedOrFPCondition()
1432 false_high_cond = kCondGT; in GenerateLongComparesAndJumps()
1437 case kCondGT: in GenerateLongComparesAndJumps()
1441 true_high_cond = kCondGT; in GenerateLongComparesAndJumps()
|
| D | nodes.cc | 2801 case kCondGT: replacement = new (allocator) HGreaterThan(lhs, rhs); break; in InsertOppositeCondition()
|
| D | code_generator_arm64.cc | 115 case kCondGT: return gt; in ARM64Condition()
136 case kCondGT: return gt_bias ? hi /* unordered */ : gt; in ARM64FPCondition()
|
| D | code_generator_x86_64.cc | 948 case kCondGT: return kGreater; in X86_64IntegerCondition()
966 case kCondGT: return kAbove; in X86_64FPCondition()
|
| /art/compiler/utils/mips64/ |
| D | assembler_mips64.cc | 812 case kCondGT: in EmitBcondc()
1990 case kCondGT: in IsNop()
2043 case kCondGT: in Branch()
2092 return kCondGT; in OppositeCondition()
2093 case kCondGT: in OppositeCondition()
|
| D | assembler_mips64.h | 1347 kCondGT, enumerator
|
| /art/compiler/utils/mips/ |
| D | assembler_mips.cc | 1183 case kCondGT: in EmitBcondR2()
1205 case kCondGT: in EmitBcondR6()
3078 case kCondGT: in IsNop()
3130 case kCondGT: in Branch()
3199 return kCondGT; in OppositeCondition()
3200 case kCondGT: in OppositeCondition()
|
| D | assembler_mips.h | 1192 kCondGT, enumerator
|