Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dnodes.cc1859 new_block->successors_.swap(successors_); in SplitBefore()
1860 DCHECK(successors_.empty()); in SplitBefore()
1874 predecessor->successors_[predecessor->GetSuccessorIndexOf(this)] = new_block; in CreateImmediateDominator()
1904 new_block->successors_.swap(successors_); in SplitBeforeForInlining()
1905 DCHECK(successors_.empty()); in SplitBeforeForInlining()
1931 new_block->successors_.swap(successors_); in SplitAfterForInlining()
1932 DCHECK(successors_.empty()); in SplitAfterForInlining()
2016 DCHECK_EQ(successors_[0], GetLastInstruction()->AsTryBoundary()->GetNormalFlowSuccessor()); in GetNormalSuccessors()
2017 return ArrayRef<HBasicBlock* const>(successors_).SubArray(0u, 1u); in GetNormalSuccessors()
2020 return ArrayRef<HBasicBlock* const>(successors_); in GetNormalSuccessors()
[all …]
Dnodes.h974 successors_(graph->GetAllocator()->Adapter(kArenaAllocSuccessors)), in graph_()
984 successors_.reserve(kDefaultNumberOfSuccessors); in graph_()
993 return successors_; in GetSuccessors()
1000 return ContainsElement(successors_, block, start_from);
1083 successors_.push_back(block); in AddSuccessor()
1091 successors_[successor_index] = new_block; in ReplaceSuccessor()
1097 new_block->successors_.push_back(this); in ReplacePredecessor()
1108 predecessor->successors_[successor_index] = this; in InsertBetween()
1109 successors_.push_back(successor); in InsertBetween()
1118 successors_.erase(successors_.begin() + GetSuccessorIndexOf(block)); in RemoveSuccessor()
[all …]