Home
last modified time | relevance | path

Searched refs:block1 (Results 1 – 4 of 4) sorted by relevance

/art/compiler/optimizing/
Dcommon_dominator.h30 static HBasicBlock* ForPair(HBasicBlock* block1, HBasicBlock* block2) { in ForPair() argument
31 CommonDominator finder(block1); in ForPair()
Dbounds_check_elimination_test.cc80 HBasicBlock* block1 = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
81 graph_->AddBlock(block1); in TEST_F()
84 block1->AddInstruction(cmp); in TEST_F()
85 block1->AddInstruction(if_inst); in TEST_F()
86 entry->AddSuccessor(block1); in TEST_F()
145 block1->AddSuccessor(block3); // True successor in TEST_F()
146 block1->AddSuccessor(block2); // False successor in TEST_F()
178 HBasicBlock* block1 = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
179 graph_->AddBlock(block1); in TEST_F()
182 block1->AddInstruction(cmp); in TEST_F()
[all …]
Dselect_generator.cc70 static bool BlocksMergeTogether(HBasicBlock* block1, HBasicBlock* block2) { in BlocksMergeTogether() argument
71 return block1->GetSingleSuccessor() == block2->GetSingleSuccessor(); in BlocksMergeTogether()
Dscheduler_test.cc75 HBasicBlock* block1 = new (GetAllocator()) HBasicBlock(graph_); in TestBuildDependencyGraphAndSchedule() local
77 graph_->AddBlock(block1); in TestBuildDependencyGraphAndSchedule()
129 block1->AddInstruction(instr); in TestBuildDependencyGraphAndSchedule()