Home
last modified time | relevance | path

Searched refs:new_block (Results 1 – 2 of 2) sorted by relevance

/art/compiler/optimizing/
Dnodes.cc351 HBasicBlock* new_block = new (allocator_) HBasicBlock(this, successor->GetDexPc()); in SplitEdge() local
352 AddBlock(new_block); in SplitEdge()
355 new_block->InsertBetween(block, successor); in SplitEdge()
356 return new_block; in SplitEdge()
362 HBasicBlock* new_block = SplitEdge(block, successor); in SplitCriticalEdge() local
363 new_block->AddInstruction(new (allocator_) HGoto(successor->GetDexPc())); in SplitCriticalEdge()
369 info->AddBackEdge(new_block); in SplitCriticalEdge()
1841 HBasicBlock* new_block = in SplitBefore() local
1843 new_block->instructions_.first_instruction_ = cursor; in SplitBefore()
1844 new_block->instructions_.last_instruction_ = instructions_.last_instruction_; in SplitBefore()
[all …]
Dnodes.h1063 void ReplaceDominatedBlock(HBasicBlock* existing, HBasicBlock* new_block) { in ReplaceDominatedBlock() argument
1064 ReplaceElement(dominated_blocks_, existing, new_block); in ReplaceDominatedBlock()
1087 void ReplaceSuccessor(HBasicBlock* existing, HBasicBlock* new_block) { in ReplaceSuccessor() argument
1090 new_block->predecessors_.push_back(this); in ReplaceSuccessor()
1091 successors_[successor_index] = new_block; in ReplaceSuccessor()
1094 void ReplacePredecessor(HBasicBlock* existing, HBasicBlock* new_block) { in ReplacePredecessor() argument
1097 new_block->successors_.push_back(this); in ReplacePredecessor()
1098 predecessors_[predecessor_index] = new_block; in ReplacePredecessor()