Searched refs:block2 (Results 1 – 4 of 4) sorted by relevance
69 HBasicBlock* block2 = new (&allocator) HBasicBlock(graph); in TEST() local70 graph->AddBlock(block2); in TEST()77 block2->AddInstruction(null_check); in TEST()78 block2->AddInstruction(array_length); in TEST()79 block2->AddInstruction(bounds_check2); in TEST()80 block2->AddInstruction(array_set); in TEST()121 block2->AddSuccessor(exit); in TEST()127 block1->AddSuccessor(block2); // False successor in TEST()175 HBasicBlock* block2 = new (&allocator) HBasicBlock(graph); in TEST() local176 graph->AddBlock(block2); in TEST()[all …]
43 static bool BlocksDoMergeTogether(HBasicBlock* block1, HBasicBlock* block2) { in BlocksDoMergeTogether() argument44 if (!block1->IsSingleGoto() || !block2->IsSingleGoto()) return false; in BlocksDoMergeTogether()46 HBasicBlock* succ2 = block2->GetSuccessors().Get(0); in BlocksDoMergeTogether()
273 int MIRGraph::FindCommonParent(int block1, int block2) { in FindCommonParent() argument274 while (block1 != block2) { in FindCommonParent()275 while (block1 < block2) { in FindCommonParent()279 while (block2 < block1) { in FindCommonParent()280 block2 = i_dom_list_[block2]; in FindCommonParent()281 DCHECK_NE(block2, NOTVISITED); in FindCommonParent()
1277 int FindCommonParent(int block1, int block2);