Home
last modified time | relevance | path

Searched refs:kCondNE (Results 1 – 11 of 11) sorted by relevance

/art/compiler/optimizing/
Dscheduler_arm.cc177 case kCondNE: in HandleGenerateConditionWithZero()
218 case kCondNE: in HandleGenerateLongTestConstant()
242 case kCondNE: in HandleGenerateLongTestConstant()
279 case kCondNE: in HandleGenerateLongTest()
364 if (condition == kCondNE) { in HandleGenerateEqualLong()
388 case kCondNE: in HandleGenerateConditionLong()
411 if ((condition == kCondEQ || condition == kCondNE) && in HandleGenerateConditionLong()
448 case kCondNE: in HandleGenerateConditionIntegralOrNonPrimitive()
466 if (condition == kCondEQ || condition == kCondNE) { in HandleGenerateConditionIntegralOrNonPrimitive()
467 if (condition == kCondNE) { in HandleGenerateConditionIntegralOrNonPrimitive()
[all …]
Dinduction_var_analysis.cc933 case kCondNE: VisitCondition(loop, body, b, a, type, kCondNE); break; in VisitCondition()
951 if (cmp == kCondNE && RewriteBreakLoop(loop, body, stride_value, type)) { in VisitCondition()
957 if (cmp == kCondNE && ((stride_value == +1 && IsTaken(lower_expr, upper_expr, kCondLE)) || in VisitCondition()
Ddead_code_elimination.cc116 case kCondNE: in HasEquality()
Dcode_generator_arm_vixl.cc952 case kCondNE: return ne; in ARMCondition()
970 case kCondNE: return ne; in ARMUnsignedCondition()
993 case kCondNE: return ne /* unordered */; in ARMFPCondition()
1282 *opposite = kCondNE; in AdjustConstantForCondition()
1285 *condition = kCondNE; in AdjustConstantForCondition()
1331 case kCondNE: in GenerateLongTestConstant()
1359 case kCondNE: in GenerateLongTestConstant()
1446 case kCondNE: in GenerateLongTest()
1590 DCHECK(condition == kCondEQ || condition == kCondNE) << condition; in GenerateEqualLong()
1592 if (condition == kCondNE && out.IsLow()) { in GenerateEqualLong()
[all …]
Dcodegen_test.cc641 case kCondNE: in TestComparison()
Dnodes.h112 kCondNE, // != enumerator
3665 if (if_cond == kCondNE) { in IsFPConditionTrueIfNaN()
3678 } else if (if_cond == kCondNE) { in IsFPConditionFalseIfNaN()
3751 return kCondNE; in GetOppositeCondition()
3793 return kCondNE; in GetCondition()
Dcode_generator_x86.cc930 case kCondNE: return kNotEqual; in X86Condition()
948 case kCondNE: return kNotEqual; in X86UnsignedOrFPCondition()
1522 case kCondNE: in GenerateLongComparesAndJumps()
1557 if (if_cond == kCondNE) { in GenerateLongComparesAndJumps()
1572 if (if_cond == kCondNE) { in GenerateLongComparesAndJumps()
1585 if (if_cond == kCondNE) { in GenerateLongComparesAndJumps()
Dbounds_check_elimination.cc791 } else if (cond == kCondNE || cond == kCondEQ) { in HandleIf()
Dnodes.cc3098 case kCondNE: replacement = new (allocator) HNotEqual(lhs, rhs); break; in InsertOppositeCondition()
Dcode_generator_arm64.cc99 case kCondNE: return ne; in ARM64Condition()
120 case kCondNE: return ne /* unordered */; in ARM64FPCondition()
Dcode_generator_x86_64.cc952 case kCondNE: return kNotEqual; in X86_64IntegerCondition()
970 case kCondNE: return kNotEqual; in X86_64FPCondition()