Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dnodes.cc238 header->predecessors_.Put(pred, to_swap); in SimplifyLoop()
239 header->predecessors_.Put(0, predecessor); in SimplifyLoop()
942 successor->predecessors_.Put(successor->GetPredecessorIndexOf(this), new_block); in SplitAfter()
1038 for (size_t i = 0, e = predecessors_.Size(); i < e; ++i) { in DisconnectAndDelete()
1039 HBasicBlock* predecessor = predecessors_.Get(i); in DisconnectAndDelete()
1053 predecessors_.Reset(); in DisconnectAndDelete()
1060 successor->predecessors_.DeleteAt(this_index); in DisconnectAndDelete()
1064 DCHECK(!successor->predecessors_.IsEmpty()); in DisconnectAndDelete()
1067 if (successor->predecessors_.Size() == 1u) { in DisconnectAndDelete()
1136 other->predecessors_.Reset(); in MergeWith()
Dnodes.h492 predecessors_(graph->GetArena(), kDefaultNumberOfPredecessors), in graph_()
504 return predecessors_; in GetPredecessors()
568 block->predecessors_.Add(this); in AddSuccessor()
575 new_block->predecessors_.Add(this); in ReplaceSuccessor()
584 predecessors_.Put(predecessor_index, new_block); in ReplacePredecessor()
595 successor->predecessors_.Put(predecessor_index, this); in InsertBetween()
598 predecessors_.Add(predecessor); in InsertBetween()
602 predecessors_.Delete(block); in RemovePredecessor()
610 predecessors_.Reset(); in ClearAllPredecessors()
614 predecessors_.Add(block); in AddPredecessor()
[all …]