| /external/llvm/include/llvm/CodeGen/ |
| CalcSpillWeights.h | 45 const MachineLoopInfo &Loops;
49 const MachineLoopInfo &loops) :
50 MF(mf), LIS(lis), Loops(loops) {}
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionNormalization.h | 31 // paired with a set of loops for which the expression is in "post-increment"
32 // mode (there may be multiple loops).
53 /// Normalize - Normalize according to the given loops.
63 /// PostIncLoopSet - A set of loops.
72 PostIncLoopSet &Loops,
|
| LoopInfo.h | 10 // This file defines the LoopInfo class that is used to identify natural loops
13 // loops may actually be several loops that share the same header node.
15 // This analysis calculates the nesting structure of loops in a function. For
16 // each natural loop identified, this analysis identifies natural loops
63 /// LoopBase class - Instances of this class are used to represent loops that
69 // SubLoops - Loops contained entirely within this one.
89 /// blocks, where depth 0 is used for blocks not inside any loops.
122 /// iterator/begin/end - Return the loops contained entirely within this loop.
175 // Note that all of these methods can fail on general loops (ie, there may no
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionNormalization.cpp | 69 PostIncLoopSet &Loops;
76 PostIncTransform(TransformKind kind, PostIncLoopSet &loops,
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
127 Loops.insert(L);
139 if (Loops.count(L)) {
152 if (Loops.count(L))
218 PostIncLoopSet &Loops,
221 PostIncTransform Transform(Kind, Loops, SE, DT);
|
| LoopInfo.cpp | 10 // This file defines the LoopInfo class that is used to identify natural loops
12 // loops identified may actually be several natural loops that share the same
43 INITIALIZE_PASS_BEGIN(LoopInfo, "loops", "Natural Loop Information", true, true)
45 INITIALIZE_PASS_END(LoopInfo, "loops", "Natural Loop Information", true, true)
130 /// The IndVarSimplify pass transforms loops to have a canonical induction
200 /// the LoopSimplify form transforms loops to, which is sometimes called
203 // Normal-form loops have a preheader, a single backedge, and all of their
322 // loops within these subloops will not change parents. However, an immediate
360 // For reducible loops, NL is now an ancestor of Unloop
[all...] |
| LoopDependenceAnalysis.cpp | 11 // framework, which is used to detect dependences in memory accesses in loops.
138 DenseSet<const Loop*>* Loops) const {
142 Loops->insert(L);
146 DenseSet<const Loop*> loops; local
147 getLoops(S, &loops);
148 return loops.empty();
161 DenseSet<const Loop*> loops; local
162 getLoops(A, &loops);
163 getLoops(B, &loops);
164 return loops.size() == 1
[all...] |
| ScalarEvolutionExpander.cpp | 182 // Move the insertion point out of as many loops as we can.
389 /// pushing loop-invariant computation down into loops, so even if the
555 // Move the insertion point out of as many loops as we can.
580 // Move the insertion point out of as many loops as we can.
620 /// PickMostRelevantLoop - Given two loops pick the one that's most relevant for
644 // A constant has no relevant loops.
649 // A non-instruction has no relevant loops.
677 /// LoopCompare - Compare loops by PickMostRelevantLoop.
690 // Compare loops with PickMostRelevantLoop.
713 // Collect all the add operands in a loop, along with their associated loops
[all...] |
| /external/llvm/lib/CodeGen/ |
| CalcSpillWeights.cpp | 121 loop = Loops.getLoopFor(mbb);
|
| ExecutionDepsFix.cpp | 675 SmallVector<MachineBasicBlock*, 16> Loops;
681 Loops.push_back(MBB);
690 for (unsigned i = 0, e = Loops.size(); i != e; ++i) {
691 MachineBasicBlock *MBB = Loops[i];
|
| SplitKit.h | 46 const MachineLoopInfo &Loops;
|
| LiveRangeEdit.cpp | 315 const MachineLoopInfo &Loops) {
316 VirtRegAuxInfo VRAI(MF, LIS, Loops);
|
| InlineSpiller.cpp | 61 MachineLoopInfo &Loops;
146 Loops(pass.getAnalysis<MachineLoopInfo>()),
207 // spill slots which can be important in tight loops.
435 SpillDepth = Loops.getLoopDepth(SV.SpillMBB);
440 if ((Loops.getLoopDepth(DepSV.SpillMBB) > SpillDepth) &&
[all...] |
| SplitKit.cpp | 48 Loops(mli),
121 /// analyzeUses - Count instructions, basic blocks, and loops using CurLI.
678 const MachineLoopInfo &Loops = SA.Loops;
679 const MachineLoop *DefLoop = Loops.getLoopFor(DefMBB);
687 const MachineLoop *Loop = Loops.getLoopFor(MBB);
[all...] |