Home
last modified time | relevance | path

Searched defs:new_block (Results 1 – 4 of 4) sorted by relevance

/art/compiler/optimizing/
Dnodes.cc550 HBasicBlock* new_block = new (allocator_) HBasicBlock(this, successor->GetDexPc()); in SplitEdge() local
561 HBasicBlock* new_block = SplitEdge(block, successor); in SplitCriticalEdge() local
574 HBasicBlock* new_block = SplitEdge(block, successor); in SplitEdgeAndUpdateRPO() local
2165 HBasicBlock* new_block = in SplitBefore() local
2195 HBasicBlock* new_block = new (GetGraph()->GetAllocator()) HBasicBlock(GetGraph(), GetDexPc()); in CreateImmediateDominator() local
2211 HBasicBlock* new_block = in SplitBeforeForInlining() local
2244 HBasicBlock* new_block = new (GetGraph()->GetAllocator()) HBasicBlock(GetGraph(), GetDexPc()); in SplitAfterForInlining() local
2920 HBasicBlock* new_block = outer_graph->SplitEdge(predecessor, to); in InlineInto() local
Dcode_sinking.cc564 HBasicBlock* new_block = new (graph_->GetAllocator()) HBasicBlock(graph_, exit->GetDexPc()); in ReturnSinking() local
Ddead_code_elimination.cc295 HBasicBlock* new_block = block->SplitBefore(throwing_invoke->GetNext(), in SimplifyAlwaysThrows() local
Dnodes.h1196 void ReplaceDominatedBlock(HBasicBlock* existing, HBasicBlock* new_block) { in ReplaceDominatedBlock()
1220 void ReplaceSuccessor(HBasicBlock* existing, HBasicBlock* new_block) { in ReplaceSuccessor()
1227 void ReplacePredecessor(HBasicBlock* existing, HBasicBlock* new_block) { in ReplacePredecessor()