| /art/compiler/optimizing/ |
| D | induction_var_analysis.cc | 102 case kCondLT: return other_cmp == kCondGT; in IsGuardedBy()
104 case kCondGT: return other_cmp == kCondLT; in IsGuardedBy()
1037 case kCondLT: VisitCondition(context, loop, body, b, a, type, kCondGT); break; in VisitCondition()
1039 case kCondGT: VisitCondition(context, loop, body, b, a, type, kCondLT); break; in VisitCondition()
1068 cmp = stride_value > 0 ? kCondLT : kCondGT; in VisitCondition()
1080 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) { in VisitCondition()
1123 const bool cancels = (cmp == kCondLT || cmp == kCondGT) && std::abs(stride_value) == 1; in VisitTripCount()
1129 } else if (cmp == kCondGT) { in VisitTripCount()
1151 case kCondGT: op = kGT; break; in VisitTripCount()
1179 case kCondGT: in IsTaken()
[all …]
|
| D | code_generator_utils.cc | 146 case kCondGT: in IsComparedValueNonNegativeInBlock()
|
| D | scheduler_arm.cc | 363 case kCondGT: in HandleGenerateLongTestConstant()
400 case kCondGT: in HandleGenerateLongTest()
442 } else if (c == kCondLE || c == kCondGT) { in CanGenerateTest()
515 case kCondGT: in HandleGenerateConditionLong()
570 case kCondGT: in HandleGenerateConditionIntegralOrNonPrimitive()
|
| D | bounds_check_elimination_test.cc | 399 DCHECK(cond == kCondGT); in BuildSSAGraph1()
453 HInstruction* bounds_check = BuildSSAGraph1(graph_, GetAllocator(), 0, 1, kCondGT); in TEST_F()
626 DCHECK(cond == kCondGT); in BuildSSAGraph3()
673 HInstruction* bounds_check = BuildSSAGraph3(graph_, GetAllocator(), 0, 1, kCondGT); in TEST_F()
726 } else if (cond == kCondGT) { in BuildSSAGraph4()
777 HInstruction* bounds_check = BuildSSAGraph4(graph_, GetAllocator(), 0, kCondGT); in TEST_F()
|
| D | bounds_check_elimination.cc | 668 } else if (cond == kCondGT) { in HandleIfBetweenTwoMonotonicValueRanges()
781 } else if (cond == kCondGT || cond == kCondGE) { in HandleIf()
784 int32_t compensation = (cond == kCondGT) ? 1 : 0; // lower bound is inclusive in HandleIf()
|
| D | dead_code_elimination.cc | 122 case kCondGT: in HasEquality()
|
| D | instruction_simplifier.cc | 1062 ((cmp == kCondGT || cmp == kCondGE) && c->IsMin()))) { in AllowInMinMax()
1141 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
1148 ((cmp == kCondGT || cmp == kCondGE) && false_value->IsNeg())) { in VisitSelect()
1163 if ((((cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
|
| D | code_generator_arm_vixl.cc | 1014 case kCondGT: return gt; in ARMCondition()
1033 case kCondGT: return hi; in ARMUnsignedCondition()
1055 case kCondGT: return gt_bias ? hi /* unordered */ : gt; in ARMFPCondition()
1348 if (*condition == kCondGT) { in AdjustConstantForCondition()
1447 case kCondGT: in GenerateLongTestConstant()
1456 DCHECK_EQ(opposite, kCondGT); in GenerateLongTestConstant()
1460 DCHECK_EQ(cond, kCondGT); in GenerateLongTestConstant()
1523 case kCondGT: in GenerateLongTest()
1525 DCHECK_EQ(opposite, kCondGT); in GenerateLongTest()
1529 DCHECK_EQ(cond, kCondGT); in GenerateLongTest()
[all …]
|
| D | codegen_test.cc | 658 case kCondGT: in TestComparison()
|
| D | code_generator_riscv64.cc | 1619 case kCondGT: in GenerateIntLongCondition()
1629 reverse_condition = ((cond == kCondGT) == use_imm); in GenerateIntLongCondition()
1703 case kCondGT: in GenerateIntLongCompareAndBranch()
1730 case kCondGT: in GenerateIntLongCompareAndBranch()
1828 case kCondGT: in GenerateFpCondition()
2287 case kCondGT: in HandleCondition()
|
| D | nodes.h | 124 kCondGT, // > enumerator
4083 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias();
4290 return kCondGT;
4325 return kCondGT;
|
| D | code_generator_x86.cc | 1035 case kCondGT: return kGreater; in X86Condition()
1054 case kCondGT: return kAbove; in X86UnsignedOrFPCondition()
1986 false_high_cond = kCondGT; in GenerateLongComparesAndJumps()
1991 case kCondGT: in GenerateLongComparesAndJumps()
1995 true_high_cond = kCondGT; in GenerateLongComparesAndJumps()
|
| D | nodes.cc | 3358 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 | 1088 case kCondGT: return kGreater; in X86_64IntegerCondition()
1106 case kCondGT: return kAbove; in X86_64FPCondition()
|
| /art/compiler/utils/riscv64/ |
| D | assembler_riscv64.cc | 6489 Bcond(label, is_bare, kCondGT, rs, rt); in Bgt()
6700 case kCondGT: in IsNop()
6825 return kCondGT; in OppositeCondition()
6826 case kCondGT: in OppositeCondition()
|
| D | assembler_riscv64.h | 1933 kCondGT, enumerator
|