Searched refs:Loops (Results 1 - 25 of 33) sorted by relevance

12

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DScalarEvolutionNormalization.h53 /// Loops.
54 const SCEV *normalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops,
63 /// Loops.
64 const SCEV *denormalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops,
H A DDependenceAnalysis.h348 SmallBitVector Loops; member in struct:llvm::DependenceInfo::Subscript
541 SmallBitVector &Loops) const;
547 SmallBitVector &Loops);
553 SmallBitVector &Loops);
593 SmallBitVector &Loops);
639 const SmallBitVector &Loops,
779 const SmallBitVector &Loops,
816 const SmallBitVector &Loops,
866 SmallBitVector &Loops,
934 SmallBitVector &Loops, boo
[all...]
H A DLoopCacheAnalysis.h181 /// Construct a CacheCost object for the loop nest described by \p Loops.
185 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
245 /// Loops in the loop nest associated with this object.
246 LoopVectorTy Loops;
H A DLoopInfoImpl.h9 // This is the generic implementation of LoopInfo used for both Loops and
366 DenseSet<const LoopT *> *Loops) const {
368 Loops->insert(static_cast<const LoopT *>(this));
373 (*I)->verifyLoopNest(Loops);
683 DenseSet<const LoopT *> Loops; local
686 (*I)->verifyLoopNest(&Loops);
694 assert(Loops.count(L) && "orphaned loop");
H A DBlockFrequencyInfoImpl.h422 std::list<LoopData> Loops; member in class:llvm::BlockFrequencyInfoImplBase
459 /// Insert them into \a Loops before \c Insert.
477 /// backedges and exits are stored in its entry in Loops.
885 /// Build up \a Loops using \a LoopInfo. \a LoopInfo gives us a mapping from
922 /// Find the irreducible SCCs in \c OuterLoop, add them to \a Loops (in front
1103 Loops.emplace_back(Parent, Header);
1104 Working[Header.Index].Loop = &Loops.back();
1108 Q.emplace_back(L, &Loops.back());
1141 for (auto L = Loops.rbegin(), E = Loops
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolutionNormalization.cpp97 const PostIncLoopSet &Loops,
100 return Loops.count(AR->getLoop());
111 const PostIncLoopSet &Loops,
114 return Loops.count(AR->getLoop());
96 normalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops, ScalarEvolution &SE) argument
110 denormalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops, ScalarEvolution &SE) argument
H A DLoopCacheAnalysis.cpp52 /// Retrieve the innermost loop in the given loop nest \p Loops. It returns a
56 static Loop *getInnerMostLoop(const LoopVectorTy &Loops) { argument
57 assert(!Loops.empty() && "Expecting a non-empy loop vector");
59 Loop *LastLoop = Loops.back();
63 assert(Loops.size() == 1 && "Expecting a single loop");
67 return (std::is_sorted(Loops.begin(), Loops.end(),
455 CacheCost::CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI,
459 : Loops(Loops), TripCount
[all...]
H A DDependenceAnalysis.cpp803 SmallBitVector &Loops) const {
807 Loops.set(Level);
886 // Collect any loops mentioned in the set of "Loops".
888 SmallBitVector &Loops, bool IsSrc) {
905 Loops.set(mapSrcLoop(AddRec->getLoop()));
907 Loops.set(mapDstLoop(AddRec->getLoop()));
908 return checkSubscript(Start, LoopNest, Loops, IsSrc);
912 // Collect any loops mentioned in the set of "Loops".
914 SmallBitVector &Loops) {
915 return checkSubscript(Src, LoopNest, Loops, tru
887 checkSubscript(const SCEV *Expr, const Loop *LoopNest, SmallBitVector &Loops, bool IsSrc) argument
913 checkSrcSubscript(const SCEV *Src, const Loop *LoopNest, SmallBitVector &Loops) argument
920 checkDstSubscript(const SCEV *Dst, const Loop *LoopNest, SmallBitVector &Loops) argument
930 classifyPair(const SCEV *Src, const Loop *SrcLoopNest, const SCEV *Dst, const Loop *DstLoopNest, SmallBitVector &Loops) argument
2284 testMIV(const SCEV *Src, const SCEV *Dst, const SmallBitVector &Loops, FullDependence &Result) const argument
2529 banerjeeMIVtest(const SCEV *Src, const SCEV *Dst, const SmallBitVector &Loops, FullDependence &Result) const argument
2609 exploreDirections(unsigned Level, CoefficientInfo *A, CoefficientInfo *B, BoundInfo *Bound, const SmallBitVector &Loops, unsigned &DepthExpanded, const SCEV *Delta) const argument
3064 propagate(const SCEV *&Src, const SCEV *&Dst, SmallBitVector &Loops, SmallVectorImpl<Constraint> &Constraints, bool &Consistent) argument
[all...]
H A DBlockFrequencyInfoImpl.cpp9 // Loops should be simplified before this analysis.
276 Loops.clear();
526 for (LoopData &Loop : Loops)
762 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(),
777 assert((OuterLoop == nullptr) == (Insert == Loops.begin()));
778 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end();
790 return make_range(Loops.begin(), Insert);
H A DMustExecute.cpp440 const auto &Loops = MustExec.lookup(&V); variable
441 const auto NumLoops = Loops.size();
448 for (const Loop *L : Loops) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DCalcSpillWeights.h54 const MachineLoopInfo &Loops; member in class:llvm::VirtRegAuxInfo
64 : MF(mf), LIS(lis), VRM(vrm), Loops(loops), MBFI(mbfi), normalize(norm) {}
H A DMachineTraceMetrics.h92 const MachineLoopInfo *Loops = nullptr; member in class:llvm::MachineTraceMetrics
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp206 BB2BBMap Loops; member in class:__anon2763::StructurizeCFG
227 void insertConditions(bool Loops);
391 Loops[Exit] = N->getEntry();
400 Loops[Succ] = BB;
476 if (Visited.count(Other) && !Loops.count(Other) &&
514 Loops.clear();
538 void StructurizeCFG::insertConditions(bool Loops) { argument
539 BranchVector &Conds = Loops ? LoopConds : Conditions;
540 Value *Default = Loops ? BoolTrue : BoolFalse;
552 PhiInserter.AddAvailableValue(Loops
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp707 MachineLoopInfo *Loops; member in class:__anon1708::EarlyIfConverter
768 void updateLoops(MachineLoopInfo *Loops, argument
770 if (!Loops)
775 Loops->removeBlock(B);
894 updateLoops(Loops, RemovedBlocks);
915 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
945 MachineLoopInfo *Loops; member in class:__anon1710::EarlyIfPredicator
1032 updateLoops(Loops, RemovedBlocks);
1049 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
H A DMachineTraceMetrics.cpp72 Loops = &getAnalysis<MachineLoopInfo>();
170 return MTM.Loops->getLoopFor(MBB);
430 const MachineLoopInfo *Loops;
434 const MachineLoopInfo *loops) : Blocks(blocks), Loops(loops) {}
460 if (const MachineLoop *FromLoop = LB.Loops->getLoopFor(*From)) {
465 if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To)))
482 LoopBounds Bounds(BlockInfo, MTM.Loops);
H A DLiveRangeEdit.cpp463 const MachineLoopInfo &Loops,
465 VirtRegAuxInfo VRAI(MF, LIS, VRM, Loops, MBFI);
462 calculateRegClassAndHint(MachineFunction &MF, const MachineLoopInfo &Loops, const MachineBlockFrequencyInfo &MBFI) argument
H A DSplitKit.h100 const MachineLoopInfo &Loops; member in class:llvm::SplitAnalysis
H A DCalcSpillWeights.cpp228 loop = Loops.getLoopFor(mbb);
H A DInlineSpiller.cpp91 MachineLoopInfo &Loops; member in class:__anon1729::HoistSpillHelper
145 Loops(pass.getAnalysis<MachineLoopInfo>()), VRM(vrm),
164 MachineLoopInfo &Loops; member in class:__anon1729::InlineSpiller
201 Loops(pass.getAnalysis<MachineLoopInfo>()), VRM(vrm),
1131 Edit->calculateRegClassAndHint(MF, Loops, MBFI);
H A DRegAllocGreedy.cpp170 MachineLoopInfo *Loops; member in class:__anon1792::RAGreedy
550 for (MachineLoop *L : *Loops) {
3173 if (Loops->getLoopFor(MBB) == L)
3244 Loops = &getAnalysis<MachineLoopInfo>();
3252 calculateSpillWeightsAndHints(*LIS, mf, VRM, *Loops, *MBFI);
3256 SA.reset(new SplitAnalysis(*VRM, *LIS, *Loops));
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h15 /// 1) Loops are, where possible, in simplified form.
16 /// 2) Loops are *always* in LCSSA form.
113 inline void appendLoopsToWorklist(RangeT &&Loops, argument
121 for (Loop *RootL : reverse(Loops)) {
349 "Loops must remain in LCSSA form!");
380 // Loops. This precludes *any* invalidation of loop analyses by the proxy,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp224 SmallVector<MachineLoop *, 4> Loops(MLI.begin(), MLI.end());
227 for (int i = 0; i < (int)Loops.size(); ++i)
228 for (MachineLoop *Child : Loops[i]->getSubLoops())
229 Loops.push_back(Child);
231 for (MachineLoop *CurrLoop : Loops) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp770 MachineLoopInfo *Loops; member in class:__anon2025::AArch64ConditionalCompares
839 if (!Loops)
842 Loops->removeBlock(RemovedMBB);
939 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/TableGen/
H A DTGParser.cpp347 if (!Loops.empty()) {
348 Loops.back()->Entries.push_back(std::move(E));
879 for (const auto &L : Loops) {
2882 Loops.push_back(std::make_unique<ForeachLoop>(Loc, IterName, ListValue));
2910 std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back());
2911 Loops.pop_back();
2952 Loops.push_back(std::make_unique<ForeachLoop>(Loc, nullptr, ThenClauseList));
2957 std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back());
2958 Loops.pop_back();
2976 Loops
[all...]
H A DTGParser.h136 /// Loops - Keep track of any foreach loops we are within.
138 std::vector<std::unique_ptr<ForeachLoop>> Loops; member in class:llvm::TGParser

Completed in 248 milliseconds

12