Home
last modified time | relevance | path

Searched refs:HLessThan (Results 1 – 10 of 10) sorted by relevance

/art/compiler/optimizing/
Dboolean_simplifier.cc84 return new (allocator) HLessThan(lhs, rhs); in GetOppositeCondition()
Dcodegen_test.cc664 HLessThan cmp_lt(cst_lhs, cst_rhs); in TEST()
719 HLessThan cmp_lt(cst_lhs, cst_rhs); in TEST()
Dbounds_check_elimination_test.cc86 cmp = new (&allocator) HLessThan(parameter2, array_length); in TEST()
543 cmp = new (allocator) HLessThan(phi, constant_initial); in BuildSSAGraph2()
Dbounds_check_elimination.cc829 cond = new (graph->GetArena()) HLessThan(initial_, end_); in AddLoopBodyEntryTest()
859 HCondition* cond = new (graph->GetArena()) HLessThan(value, const_instr); in AddDeoptimizationConstant()
Dnodes.h2011 class HLessThan : public HCondition {
2013 HLessThan(HInstruction* first, HInstruction* second) in HLessThan() function
2030 DISALLOW_COPY_AND_ASSIGN(HLessThan);
Dcode_generator_mips64.cc3217 void LocationsBuilderMIPS64::VisitLessThan(HLessThan* comp) { in VisitLessThan()
3221 void InstructionCodeGeneratorMIPS64::VisitLessThan(HLessThan* comp) { in VisitLessThan()
Dbuilder.cc1424 IF_XX(HLessThan, LT); in AnalyzeDexInstruction()
Dcode_generator_arm.cc1082 void LocationsBuilderARM::VisitLessThan(HLessThan* comp) { in VisitLessThan()
1086 void InstructionCodeGeneratorARM::VisitLessThan(HLessThan* comp) { in VisitLessThan()
Dcode_generator_x86.cc1037 void LocationsBuilderX86::VisitLessThan(HLessThan* comp) { in VisitLessThan()
1041 void InstructionCodeGeneratorX86::VisitLessThan(HLessThan* comp) { in VisitLessThan()
Dcode_generator_x86_64.cc998 void LocationsBuilderX86_64::VisitLessThan(HLessThan* comp) { in VisitLessThan()
1002 void InstructionCodeGeneratorX86_64::VisitLessThan(HLessThan* comp) { in VisitLessThan()