Home
last modified time | relevance | path

Searched refs:HGreaterThan (Results 1 – 9 of 9) sorted by relevance

/art/compiler/optimizing/
Dboolean_simplifier.cc79 return new (allocator) HGreaterThan(lhs, rhs); in GetOppositeCondition()
Dbounds_check_elimination_test.cc405 cmp = new (allocator) HGreaterThan(phi, array_length); in BuildSSAGraph1()
667 cmp = new (allocator) HGreaterThan(phi, constant_10); in BuildSSAGraph3()
783 cmp = new (allocator) HGreaterThan(phi, array_length); in BuildSSAGraph4()
Dbounds_check_elimination.cc822 cond = new (graph->GetArena()) HGreaterThan(initial_, end_); in AddLoopBodyEntryTest()
1007 HCondition* cond = new (graph->GetArena()) HGreaterThan(value, added); in AddDeoptimizationArrayLength()
Dnodes.h2055 class HGreaterThan : public HCondition {
2057 HGreaterThan(HInstruction* first, HInstruction* second) in HGreaterThan() function
2074 DISALLOW_COPY_AND_ASSIGN(HGreaterThan);
Dcode_generator_mips64.cc3233 void LocationsBuilderMIPS64::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()
3237 void InstructionCodeGeneratorMIPS64::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()
Dbuilder.cc1426 IF_XX(HGreaterThan, GT); in AnalyzeDexInstruction()
Dcode_generator_arm.cc1098 void LocationsBuilderARM::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()
1102 void InstructionCodeGeneratorARM::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()
Dcode_generator_x86.cc1053 void LocationsBuilderX86::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()
1057 void InstructionCodeGeneratorX86::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()
Dcode_generator_x86_64.cc1014 void LocationsBuilderX86_64::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()
1018 void InstructionCodeGeneratorX86_64::VisitGreaterThan(HGreaterThan* comp) { in VisitGreaterThan()