Searched refs:predecessors_ (Results 1 – 8 of 8) sorted by relevance
87 void AddPredecessor(LivenessAnalyzerBlock* b) { predecessors_.push_back(b); } in AddPredecessor()123 return predecessors_.begin(); in pred_begin()126 return predecessors_.end(); in pred_end()133 ZoneDeque<LivenessAnalyzerBlock*> predecessors_; variable
62 BasicBlockVector& predecessors() { return predecessors_; } in predecessors()63 const BasicBlockVector& predecessors() const { return predecessors_; } in predecessors()64 size_t PredecessorCount() const { return predecessors_.size(); } in PredecessorCount()65 BasicBlock* PredecessorAt(size_t index) { return predecessors_[index]; } in PredecessorAt()66 void ClearPredecessors() { predecessors_.clear(); } in ClearPredecessors()166 BasicBlockVector predecessors_; variable
89 predecessors_(zone), in LivenessAnalyzerBlock()163 for (LivenessAnalyzerBlock* pred : predecessors_) { in Print()
29 predecessors_(zone), in BasicBlock()49 predecessors_.push_back(predecessor); in AddPredecessor()
1116 Predecessors& predecessors() { return predecessors_; } in predecessors()1117 const Predecessors& predecessors() const { return predecessors_; } in predecessors()1118 size_t PredecessorCount() const { return predecessors_.size(); } in PredecessorCount()1146 Predecessors predecessors_; variable
544 predecessors_(zone), in InstructionBlock()562 for (InstructionBlock::Predecessors::const_iterator i = predecessors_.begin(); in PredecessorIndexOf()563 i != predecessors_.end(); ++i, ++j) { in PredecessorIndexOf()
54 const ZoneList<HBasicBlock*>* predecessors() const { return &predecessors_; } in predecessors()55 bool HasPredecessor() const { return predecessors_.length() > 0; } in HasPredecessor()191 ZoneList<HBasicBlock*> predecessors_; variable
77 predecessors_(2, graph->zone()), in HBasicBlock()264 int length = predecessors_.length(); in SetJoinId()267 HBasicBlock* predecessor = predecessors_[i]; in SetJoinId()354 predecessors_.Add(pred, zone()); in RegisterPredecessor()455 for (int i = 0; i < predecessors_.length(); ++i) { in PredecessorIndexOf()456 if (predecessors_[i] == predecessor) return i; in PredecessorIndexOf()470 if (predecessors_.length() > 1) { in Verify()471 for (int i = 0; i < predecessors_.length(); ++i) { in Verify()472 DCHECK(predecessors_[i]->end()->SecondSuccessor() == NULL); in Verify()