Lines Matching defs:Predecessors

162 /// \p Predecessors. If \p BB is the header, \p Predecessors will be empty.
165 /// \p CurLoop. We only return Predecessors that are a part of \p CurLoop.
168     SmallPtrSetImpl<const BasicBlock *> &Predecessors) {
169   assert(Predecessors.empty() && "Garbage in predecessors set?");
177     Predecessors.insert(Pred);
193       if (CurLoop->contains(PredPred) && Predecessors.insert(PredPred).second)
209   SmallPtrSet<const BasicBlock *, 4> Predecessors;
210   collectTransitivePredecessors(CurLoop, BB, Predecessors);
216     // Predecessors only contains loop blocks, so we don't have to worry about
218     if (Predecessors.contains(Pred))
228   for (const auto *Pred : Predecessors) {
240           Succ != BB && !Predecessors.count(Succ))
302   SmallPtrSet<const BasicBlock *, 4> Predecessors;
303   collectTransitivePredecessors(CurLoop, BB, Predecessors);
306   for (const auto *Pred : Predecessors)