Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dnodes.cc2131 new_block->successors_.swap(successors_); in SplitBefore()
2132 DCHECK(successors_.empty()); in SplitBefore()
2146 predecessor->successors_[predecessor->GetSuccessorIndexOf(this)] = new_block; in CreateImmediateDominator()
2176 new_block->successors_.swap(successors_); in SplitBeforeForInlining()
2177 DCHECK(successors_.empty()); in SplitBeforeForInlining()
2203 new_block->successors_.swap(successors_); in SplitAfterForInlining()
2204 DCHECK(successors_.empty()); in SplitAfterForInlining()
2288 DCHECK_EQ(successors_[0], GetLastInstruction()->AsTryBoundary()->GetNormalFlowSuccessor()); in GetNormalSuccessors()
2289 return ArrayRef<HBasicBlock* const>(successors_).SubArray(0u, 1u); in GetNormalSuccessors()
2292 return ArrayRef<HBasicBlock* const>(successors_); in GetNormalSuccessors()
[all …]
Dnodes.h1083 successors_(graph->GetAllocator()->Adapter(kArenaAllocSuccessors)), in graph_()
1093 successors_.reserve(kDefaultNumberOfSuccessors); in graph_()
1106 return successors_; in GetSuccessors()
1113 return ContainsElement(successors_, block, start_from);
1196 successors_.push_back(block); in AddSuccessor()
1204 successors_[successor_index] = new_block; in ReplaceSuccessor()
1210 new_block->successors_.push_back(this); in ReplacePredecessor()
1221 predecessor->successors_[successor_index] = this; in InsertBetween()
1222 successors_.push_back(successor); in InsertBetween()
1231 successors_.erase(successors_.begin() + GetSuccessorIndexOf(block)); in RemoveSuccessor()
[all …]