Searched refs:block2 (Results 1 - 3 of 3) sorted by relevance

/art/compiler/optimizing/
H A Dcommon_dominator.h30 static HBasicBlock* ForPair(HBasicBlock* block1, HBasicBlock* block2) { argument
32 finder.Update(block2);
45 HBasicBlock* block2 = dominator_; local
46 DCHECK(block2 != nullptr);
47 if (block == block2) {
58 block2 = block2->GetDominator();
59 DCHECK(block2 != nullptr);
62 while (block != block2) {
66 block2
[all...]
H A Dbounds_check_elimination_test.cc90 HBasicBlock* block2 = new (&allocator_) HBasicBlock(graph_); local
91 graph_->AddBlock(block2);
98 block2->AddInstruction(null_check);
99 block2->AddInstruction(array_length);
100 block2->AddInstruction(bounds_check2);
101 block2->AddInstruction(array_set);
142 block2->AddSuccessor(exit);
148 block1->AddSuccessor(block2); // False successor
188 HBasicBlock* block2 = new (&allocator_) HBasicBlock(graph_); local
189 graph_->AddBlock(block2);
256 HBasicBlock* block2 = new (&allocator_) HBasicBlock(graph_); local
[all...]
H A Dselect_generator.cc48 // Returns true if 'block1' and 'block2' are empty, merge into the same single
50 static bool BlocksMergeTogether(HBasicBlock* block1, HBasicBlock* block2) { argument
51 return block1->GetSingleSuccessor() == block2->GetSingleSuccessor();

Completed in 317 milliseconds