Searched refs:block2 (Results 1 – 3 of 3) sorted by relevance
30 static HBasicBlock* ForPair(HBasicBlock* block1, HBasicBlock* block2) { in ForPair() argument32 finder.Update(block2); in ForPair()49 HBasicBlock* block2 = dominator_; in Update() local50 DCHECK(block2 != nullptr); in Update()51 if (block == block2) { in Update()62 block2 = block2->GetDominator(); in Update()63 DCHECK(block2 != nullptr); in Update()66 while (block != block2) { in Update()70 block2 = block2->GetDominator(); in Update()71 DCHECK(block2 != nullptr); in Update()
88 HBasicBlock* block2 = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local89 graph_->AddBlock(block2); in TEST_F()96 block2->AddInstruction(null_check); in TEST_F()97 block2->AddInstruction(array_length); in TEST_F()98 block2->AddInstruction(bounds_check2); in TEST_F()99 block2->AddInstruction(array_set); in TEST_F()140 block2->AddSuccessor(exit); in TEST_F()146 block1->AddSuccessor(block2); // False successor in TEST_F()186 HBasicBlock* block2 = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local187 graph_->AddBlock(block2); in TEST_F()[all …]
68 static bool BlocksMergeTogether(HBasicBlock* block1, HBasicBlock* block2) { in BlocksMergeTogether() argument69 return block1->GetSingleSuccessor() == block2->GetSingleSuccessor(); in BlocksMergeTogether()