Searched refs:PredToDestList (Results 1 – 2 of 2) sorted by relevance
980 BasicBlock*> > &PredToDestList) { in FindMostPopularDest()981 assert(!PredToDestList.empty()); in FindMostPopularDest()988 for (unsigned i = 0, e = PredToDestList.size(); i != e; ++i) in FindMostPopularDest()989 if (PredToDestList[i].second) in FindMostPopularDest()990 DestPopularity[PredToDestList[i].second]++; in FindMostPopularDest()1063 SmallVector<std::pair<BasicBlock*, BasicBlock*>, 16> PredToDestList; in ProcessThreadableEdges() local1094 if (PredToDestList.empty()) in ProcessThreadableEdges()1099 PredToDestList.push_back(std::make_pair(Pred, DestBB)); in ProcessThreadableEdges()1103 if (PredToDestList.empty()) in ProcessThreadableEdges()1113 MostPopularDest = FindMostPopularDest(BB, PredToDestList); in ProcessThreadableEdges()[all …]
1115 BasicBlock*> > &PredToDestList) { in FindMostPopularDest()1116 assert(!PredToDestList.empty()); in FindMostPopularDest()1123 for (const auto &PredToDest : PredToDestList) in FindMostPopularDest()1199 SmallVector<std::pair<BasicBlock*, BasicBlock*>, 16> PredToDestList; in ProcessThreadableEdges() local1230 if (PredToDestList.empty()) in ProcessThreadableEdges()1235 PredToDestList.push_back(std::make_pair(Pred, DestBB)); in ProcessThreadableEdges()1239 if (PredToDestList.empty()) in ProcessThreadableEdges()1249 MostPopularDest = FindMostPopularDest(BB, PredToDestList); in ProcessThreadableEdges()1254 for (const auto &PredToDest : PredToDestList) in ProcessThreadableEdges()