Searched refs:PredToDestList (Results 1 – 1 of 1) sorted by relevance
1017 BasicBlock*> > &PredToDestList) { in FindMostPopularDest()1018 assert(!PredToDestList.empty()); in FindMostPopularDest()1025 for (unsigned i = 0, e = PredToDestList.size(); i != e; ++i) in FindMostPopularDest()1026 if (PredToDestList[i].second) in FindMostPopularDest()1027 DestPopularity[PredToDestList[i].second]++; in FindMostPopularDest()1100 SmallVector<std::pair<BasicBlock*, BasicBlock*>, 16> PredToDestList; in ProcessThreadableEdges() local1131 if (PredToDestList.empty()) in ProcessThreadableEdges()1136 PredToDestList.push_back(std::make_pair(Pred, DestBB)); in ProcessThreadableEdges()1140 if (PredToDestList.empty()) in ProcessThreadableEdges()1150 MostPopularDest = FindMostPopularDest(BB, PredToDestList); in ProcessThreadableEdges()[all …]