1540                                           BasicBlock *>> &PredToDestList) {  in findMostPopularDest()  argument
1541   assert(!PredToDestList.empty());  in findMostPopularDest()
1557   for (const auto &PredToDest : PredToDestList)  in findMostPopularDest()
1642   SmallVector<std::pair<BasicBlock*, BasicBlock*>, 16> PredToDestList;  in processThreadableEdges()  local
1673     if (PredToDestList.empty()) {  in processThreadableEdges()
1690     PredToDestList.emplace_back(Pred, DestBB);  in processThreadableEdges()
1694   if (PredToDestList.empty())  in processThreadableEdges()
1701     if (BB->hasNPredecessors(PredToDestList.size())) {  in processThreadableEdges()
1752     erase_if(PredToDestList,  in processThreadableEdges()
1757     if (PredToDestList.empty())  in processThreadableEdges()
1760     MostPopularDest = findMostPopularDest(BB, PredToDestList);  in processThreadableEdges()
1766   for (const auto &PredToDest : PredToDestList)  in processThreadableEdges()