218                                  SetVector<BasicBlock *> &BBs) {  in findBestInsertionSet()  argument
219   assert(!BBs.count(Entry) && "Assume Entry is not in BBs");  in findBestInsertionSet()
226   for (auto *BB : BBs) {  in findBestInsertionSet()
245     } while (!BBs.count(Node));  in findBestInsertionSet()
278     bool NodeInBBs = BBs.count(Node);  in findBestInsertionSet()
284       BBs.clear();  in findBestInsertionSet()
287         BBs.insert(Entry);  in findBestInsertionSet()
289         BBs.insert(InsertPts.begin(), InsertPts.end());  in findBestInsertionSet()
324   SetVector<BasicBlock *> BBs;  in findConstantInsertionPoint()  local
328     BBs.insert(MatInsertPt->getParent());  in findConstantInsertionPoint()
330   if (BBs.count(Entry)) {  in findConstantInsertionPoint()
336     findBestInsertionSet(*DT, *BFI, Entry, BBs);  in findConstantInsertionPoint()
337     for (BasicBlock *BB : BBs)  in findConstantInsertionPoint()
342   while (BBs.size() >= 2) {  in findConstantInsertionPoint()
344     BB1 = BBs.pop_back_val();  in findConstantInsertionPoint()
345     BB2 = BBs.pop_back_val();  in findConstantInsertionPoint()
351     BBs.insert(BB);  in findConstantInsertionPoint()
353   assert((BBs.size() == 1) && "Expected only one element.");  in findConstantInsertionPoint()
354   Instruction &FirstInst = (*BBs.begin())->front();  in findConstantInsertionPoint()