Home
last modified time | relevance | path

Searched refs:kCondGT (Results 1 – 13 of 13) sorted by relevance

/art/compiler/optimizing/
Dinduction_var_analysis.cc134 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 …]
Dscheduler_arm.cc252 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()
Dbounds_check_elimination_test.cc398 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()
Ddead_code_elimination.cc118 case kCondGT: in HasEquality()
Dbounds_check_elimination.cc655 } 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()
Dinstruction_simplifier.cc903 ((cmp == kCondGT || cmp == kCondGE) && c->IsMin()))) { in AllowInMinMax()
973 if ((cmp == kCondLT || cmp == kCondLE || cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
981 ((cmp == kCondGT || cmp == kCondGE) && false_value->IsNeg())) { in VisitSelect()
996 if ((((cmp == kCondGT || cmp == kCondGE) && in VisitSelect()
Dcode_generator_arm_vixl.cc956 case kCondGT: return gt; in ARMCondition()
975 case kCondGT: return hi; in ARMUnsignedCondition()
997 case kCondGT: return gt_bias ? hi /* unordered */ : gt; in ARMFPCondition()
1290 if (*condition == kCondGT) { in AdjustConstantForCondition()
1389 case kCondGT: in GenerateLongTestConstant()
1398 DCHECK_EQ(opposite, kCondGT); in GenerateLongTestConstant()
1402 DCHECK_EQ(cond, kCondGT); in GenerateLongTestConstant()
1465 case kCondGT: in GenerateLongTest()
1467 DCHECK_EQ(opposite, kCondGT); in GenerateLongTest()
1471 DCHECK_EQ(cond, kCondGT); in GenerateLongTest()
[all …]
Dcodegen_test.cc658 case kCondGT: in TestComparison()
Dnodes.h118 kCondGT, // > enumerator
3726 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias(); in IsFPConditionTrueIfNaN()
3933 return kCondGT; in GetOppositeCondition()
3968 return kCondGT; in GetCondition()
Dcode_generator_x86.cc934 case kCondGT: return kGreater; in X86Condition()
953 case kCondGT: return kAbove; in X86UnsignedOrFPCondition()
1554 false_high_cond = kCondGT; in GenerateLongComparesAndJumps()
1559 case kCondGT: in GenerateLongComparesAndJumps()
1563 true_high_cond = kCondGT; in GenerateLongComparesAndJumps()
Dnodes.cc3037 case kCondGT: replacement = new (allocator) HGreaterThan(lhs, rhs); break; in InsertOppositeCondition()
Dcode_generator_arm64.cc102 case kCondGT: return gt; in ARM64Condition()
123 case kCondGT: return gt_bias ? hi /* unordered */ : gt; in ARM64FPCondition()
Dcode_generator_x86_64.cc956 case kCondGT: return kGreater; in X86_64IntegerCondition()
974 case kCondGT: return kAbove; in X86_64FPCondition()