Searched refs:isLoopHeader (Results 1 – 13 of 13) sorted by relevance
320 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) { in addToDist() local330 if (!isLoopHeader(Resolved)) in addToDist()339 if (isLoopHeader(Resolved)) { in addToDist()352 if (!isLoopHeader(Pred)) { in addToDist()365 assert(OuterLoop && OuterLoop->isIrreducible() && !isLoopHeader(Resolved) && in addToDist()774 if (BFI.Working[N.Index].isLoopHeader()) in createIrreducibleLoop()
6611 if (!LI || !LI->isLoopHeader(PN->getParent()) || in getUnderlyingObjects()
212 if (!LI.isLoopHeader(To)) in isBackEdge()242 if (LI.isLoopHeader(From)) { in findPathsToMatch()
286 bool isLoopHeader() const { return Loop && Loop->isHeader(Node); } in isLoopHeader() function289 return isLoopHeader() && Loop->Parent && Loop->Parent->isIrreducible() && in isDoubleLoopHeader()294 if (!isLoopHeader()) in getContainingLoop()345 bool isAPackage() const { return isLoopHeader() && Loop->IsPackaged; } in isAPackage()1211 if (Working[Index].isLoopHeader()) {1226 assert(HeaderData.isLoopHeader());1328 assert(!Working[0].isLoopHeader() && "entry block is a loop header");
192 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ]) in hasIrreducibleCFG()447 if (LI.isLoopHeader(BB)) { in deleteDeadLoopBlocks()
249 assert((LI.isLoopHeader(To) || !Visited.count(To)) && in canProveExitOnFirstIteration()
303 assert(LI.isLoopHeader(Headers.front())); in makeReducible()
1358 if (LI && LI->isLoopHeader(BB)) { in SplitBlockPredecessorsImpl()
642 !LI->isLoopHeader(Br->getSuccessor(0)) && in canVectorizeOuterLoop()643 !LI->isLoopHeader(Br->getSuccessor(1))) { in canVectorizeOuterLoop()
135 if (!MLI->isLoopHeader(Header)) in isLoopBackEdge()
615 bool isLoopHeader(const BlockT *BB) const {625 bool isLoopHeader(const BlockT *BB) const { isLoopHeader() function
1702 bool IsLoopHeader = MLI->isLoopHeader(&MBB); in runOnMachineFunction()
422 if (!LI.isLoopHeader(&MBB)) in isLoopHeaderOfNoUnroll()