Lines Matching refs:CurRegion

371     if (!ValidRegions.count(&DC.CurRegion))  in detect()
373 LoopStats Stats = countBeneficialLoops(&DC.CurRegion, SE, LI, 0); in detect()
380 ValidRegions.remove(&DC.CurRegion); in detect()
471 Region &CurRegion = Context.CurRegion; in onlyValidRequiredInvariantLoads() local
472 const DataLayout &DL = CurRegion.getEntry()->getModule()->getDataLayout(); in onlyValidRequiredInvariantLoads()
485 if (!isHoistableLoad(Load, CurRegion, LI, SE, DT, Context.RequiredILS)) in onlyValidRequiredInvariantLoads()
541 if (!isAffineExpr(&Context.CurRegion, Scope, S, SE, &AccessILS)) in isAffine()
593 getUniqueNonErrorValue(PHI, &Context.CurRegion, this)); in isValidBranch()
599 if (!IsLoopBranch && Context.CurRegion.contains(Load)) { in isValidBranch()
623 LHS = tryForwardThroughPHI(LHS, Context.CurRegion, SE, this); in isValidBranch()
624 RHS = tryForwardThroughPHI(RHS, Context.CurRegion, SE, this); in isValidBranch()
657 Region &CurRegion = Context.CurRegion; in isValidCFG() local
665 if (isa<ReturnInst>(TI) && CurRegion.isTopLevelRegion()) in isValidCFG()
905 if (!Context.CurRegion.contains(Inst)) in getDelinearizationTerms()
938 Region &CurRegion = Context.CurRegion; in hasValidArraySizes() local
949 if (Context.CurRegion.contains(Load) && in hasValidArraySizes()
950 isHoistableLoad(Load, CurRegion, LI, SE, DT, Context.RequiredILS)) in hasValidArraySizes()
955 if (hasScalarDepsInsideRegion(DelinearizedSize, &CurRegion, Scope, false, in hasValidArraySizes()
1094 if (!isInvariant(*BV, Context.CurRegion, Context)) in isValidAccess()
1171 if (Inst && Context.CurRegion.contains(Inst)) { in isValidAccess()
1175 if (Load && isHoistableLoad(Load, Context.CurRegion, LI, SE, DT, in isValidAccess()
1222 if (isErrorBlock(*OpInst->getParent(), Context.CurRegion)) { in isValidInstruction()
1345 while (R != &Context.CurRegion && !R->contains(L)) in isValidLoop()
1616 Region &CurRegion = Context.CurRegion; in allBlocksValid() local
1618 for (const BasicBlock *BB : CurRegion.blocks()) { in allBlocksValid()
1621 if (CurRegion.contains(L)) { in allBlocksValid()
1628 if (CurRegion.contains(Latch)) in allBlocksValid()
1635 for (BasicBlock *BB : CurRegion.blocks()) { in allBlocksValid()
1636 bool IsErrorBlock = isErrorBlock(*BB, CurRegion); in allBlocksValid()
1665 for (auto *BB : Context.CurRegion.blocks()) in hasSufficientCompute()
1666 if (Context.CurRegion.contains(LI.getLoopFor(BB))) in hasSufficientCompute()
1676 for (auto *BB : Context.CurRegion.blocks()) { in hasPossiblyDistributableLoop()
1678 if (!Context.CurRegion.contains(L)) in hasPossiblyDistributableLoop()
1695 Region &CurRegion = Context.CurRegion; in isProfitableRegion() local
1703 return invalid<ReportUnprofitable>(Context, /*Assert=*/true, &CurRegion); in isProfitableRegion()
1706 countBeneficialLoops(&CurRegion, SE, LI, MIN_LOOP_TRIP_COUNT).NumLoops; in isProfitableRegion()
1727 return invalid<ReportUnprofitable>(Context, /*Assert=*/true, &CurRegion); in isProfitableRegion()
1731 Region &CurRegion = Context.CurRegion; in isValidRegion() local
1733 LLVM_DEBUG(dbgs() << "Checking region: " << CurRegion.getNameStr() << "\n\t"); in isValidRegion()
1735 if (!PollyAllowFullFunction && CurRegion.isTopLevelRegion()) { in isValidRegion()
1741 if (CurRegion.getExit() && in isValidRegion()
1742 isa<UnreachableInst>(CurRegion.getExit()->getTerminator())) { in isValidRegion()
1745 CurRegion.getExit(), DbgLoc); in isValidRegion()
1749 !CurRegion.getEntry()->getName().count(OnlyRegion)) { in isValidRegion()
1757 for (BasicBlock *Pred : predecessors(CurRegion.getEntry())) { in isValidRegion()
1767 CurRegion.getEntry() == in isValidRegion()
1768 &(CurRegion.getEntry()->getParent()->getEntryBlock())) in isValidRegion()
1769 return invalid<ReportEntry>(Context, /*Assert=*/true, CurRegion.getEntry()); in isValidRegion()
1774 if (!isReducibleRegion(CurRegion, DbgLoc)) in isValidRegion()
1776 &CurRegion, DbgLoc); in isValidRegion()