Searched refs:getPSE (Results 1 – 10 of 10) sorted by relevance
132 : L(L), LI(LI), LAI(LAI), DT(DT), PSE(LAI.getPSE()) {} in LoadEliminationForLoop()489 if (LAI.getPSE().getUnionPredicate().getComplexity() > in processLoop()495 if (!Checks.empty() || !LAI.getPSE().getUnionPredicate().isAlwaysTrue()) { in processLoop()507 LV.setSCEVChecks(LAI.getPSE().getUnionPredicate()); in processLoop()
696 const SCEVUnionPredicate &Pred = LAI->getPSE().getUnionPredicate(); in processLoop()725 LVer.setSCEVChecks(LAI->getPSE().getUnionPredicate()); in processLoop()
42 setSCEVChecks(LAI.getPSE().getUnionPredicate()); in LoopVersioning()67 const SCEVUnionPredicate &Pred = LAI.getPSE().getUnionPredicate(); in versionLoop()285 !LAI.getPSE().getUnionPredicate().isAlwaysTrue())) { in runOnFunction()
42 setSCEVChecks(LAI.getPSE().getUnionPredicate()); in LoopVersioning()67 const SCEVUnionPredicate &Pred = LAI.getPSE().getUnionPredicate(); in versionLoop()282 !LAI.getPSE().getUnionPredicate().isAlwaysTrue()) { in runOnFunction()
163 : L(L), LI(LI), LAI(LAI), DT(DT), PSE(LAI.getPSE()) {} in LoadEliminationForLoop()525 if (LAI.getPSE().getUnionPredicate().getComplexity() > in processLoop()531 if (!Checks.empty() || !LAI.getPSE().getUnionPredicate().isAlwaysTrue()) { in processLoop()549 LV.setSCEVChecks(LAI.getPSE().getUnionPredicate()); in processLoop()
739 const SCEVUnionPredicate &Pred = LAI->getPSE().getUnionPredicate(); in processLoop()769 LVer.setSCEVChecks(LAI->getPSE().getUnionPredicate()); in processLoop()
579 const PredicatedScalarEvolution &getPSE() const { return *PSE; } in getPSE() function
630 const PredicatedScalarEvolution &getPSE() const { return *PSE; } in getPSE() function
765 PSE.addPredicate(LAI->getPSE().getUnionPredicate()); in canVectorizeMemory()
4838 PSE.addPredicate(LAI->getPSE().getUnionPredicate()); in canVectorizeMemory()