Lines Matching defs:BBs
213 /// Given \p BBs as input, find another set of BBs which collectively
214 /// dominates \p BBs and have the minimal sum of frequencies. Return the BB
215 /// set found in \p BBs.
218 SetVector<BasicBlock *> &BBs) {
219 assert(!BBs.count(Entry) && "Assume Entry is not in BBs");
222 // Candidates includes any block 'BB' in set 'BBs' that is not strictly
223 // dominated by any other blocks in set 'BBs', and all nodes in the path
226 for (auto *BB : BBs) {
231 // Walk up the dominator tree until Entry or another BB in BBs
245 } while (!BBs.count(Node));
247 // If isCandidate is false, Node is another Block in BBs dominating
278 bool NodeInBBs = BBs.count(Node);
282 // Return the optimal insert points in BBs.
284 BBs.clear();
287 BBs.insert(Entry);
289 BBs.insert(InsertPts.begin(), InsertPts.end());
324 SetVector<BasicBlock *> BBs;
328 BBs.insert(MatInsertPt->getParent());
330 if (BBs.count(Entry)) {
336 findBestInsertionSet(*DT, *BFI, Entry, BBs);
337 for (BasicBlock *BB : BBs)
342 while (BBs.size() >= 2) {
344 BB1 = BBs.pop_back_val();
345 BB2 = BBs.pop_back_val();
351 BBs.insert(BB);
353 assert((BBs.size() == 1) && "Expected only one element.");
354 Instruction &FirstInst = (*BBs.begin())->front();