352         LoopHeaders.erase(&BB);  in runImpl()
369             !LoopHeaders.count(&BB) && !LoopHeaders.count(Succ) &&  in runImpl()
382   LoopHeaders.clear();  in runImpl()
531     LoopHeaders.insert(Edge.second);  in findLoopHeaders()
759     if (PN && PN->getParent() == BB && !LoopHeaders.contains(BB)) {  in computeValueKnownInPredecessorsImpl()
1558   if (LoopHeaders.count(BB))  in processThreadableEdges()
1696                return LoopHeaders.contains(PredToDest.second);  in processThreadableEdges()
1911   if (LoopHeaders.erase(SinglePred))  in maybeMergeBasicBlockIntoOnlyPred()
1912     LoopHeaders.insert(BB);  in maybeMergeBasicBlockIntoOnlyPred()
2183   if (LoopHeaders.count(PredBB))  in maybethreadThroughTwoBasicBlocks()
2234   if (LoopHeaders.count(BB) || LoopHeaders.count(SuccBB)) {  in maybethreadThroughTwoBasicBlocks()
2236       bool BBIsHeader = LoopHeaders.count(BB);  in maybethreadThroughTwoBasicBlocks()
2237       bool SuccIsHeader = LoopHeaders.count(SuccBB);  in maybethreadThroughTwoBasicBlocks()
2354   if (LoopHeaders.count(BB) || LoopHeaders.count(SuccBB)) {  in tryThreadEdge()
2356       bool BBIsHeader = LoopHeaders.count(BB);  in tryThreadEdge()
2357       bool SuccIsHeader = LoopHeaders.count(SuccBB);  in tryThreadEdge()
2386   assert(!LoopHeaders.count(BB) && !LoopHeaders.count(SuccBB) &&  in threadEdge()
2633   if (LoopHeaders.count(BB)) {  in duplicateCondBranchOnPHIIntoPred()
2929   if (LoopHeaders.count(BB))  in tryToUnfoldSelectInCurrBB()