| /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,
|
| LoopInfoImpl.h | 10 // This is the generic implementation of LoopInfo used for both Loops and
193 /// Because of this, it is added as a member of all parent loops, and is added
210 // Add the basic block to this loop and all parent loops...
217 /// replaceChildLoopWith - This is used when splitting loops up. It replaces
324 /// verifyLoop - Verify loop structure of this loop and all nested loops.
327 DenseSet<const LoopT*> *Loops) const {
328 Loops->insert(static_cast<const LoopT *>(this));
333 (*I)->verifyLoopNest(Loops);
475 /// Add a single Block to its ancestor loops in PostOrder. If the block is a
502 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversa
[all...] |
| 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.
125 /// iterator/begin/end - Return the loops contained entirely within this loop.
184 // 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
33 // Explicitly instantiate methods in LoopInfoImpl.h for IR-level Loops.
48 INITIALIZE_PASS_BEGIN(LoopInfo, "loops", "Natural Loop Information", true, true)
50 INITIALIZE_PASS_END(LoopInfo, "loops", "Natural Loop Information", true, true)
135 /// The IndVarSimplify pass transforms loops to have a canonical induction
205 /// the LoopSimplify form transforms loops to, which is sometimes called
208 // Normal-form loops have a preheader, a single backedge, and all of their
329 // loops within these subloops will not change parents. However, an immediat
[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/ |
| EarlyIfConversion.cpp | 586 MachineLoopInfo *Loops;
647 if (!Loops)
652 Loops->removeBlock(Removed[i]);
783 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
| ExecutionDepsFix.cpp | 676 SmallVector<MachineBasicBlock*, 16> Loops;
682 Loops.push_back(MBB);
691 for (unsigned i = 0, e = Loops.size(); i != e; ++i) {
692 MachineBasicBlock *MBB = Loops[i];
|
| MachineTraceMetrics.h | 31 // Traces tend to align with loops. The trace through a block in an inner loop
33 // nested loops, the trace may begin and end at those instead.
72 const MachineLoopInfo *Loops;
|
| SplitKit.h | 46 const MachineLoopInfo &Loops;
|
| LiveRangeEdit.cpp | 371 const MachineLoopInfo &Loops) {
372 VirtRegAuxInfo VRAI(MF, LIS, Loops);
|
| MachineTraceMetrics.cpp | 38 : MachineFunctionPass(ID), MF(0), TII(0), TRI(0), MRI(0), Loops(0) {
55 Loops = &getAnalysis<MachineLoopInfo>();
115 return MTM.Loops->getLoopFor(MBB);
192 // We never allow traces that leave loops, but we do allow traces to enter
193 // nested loops. We also never allow traces to contain back-edges.
225 // Don't leave loops, and never follow back-edges.
236 // Ignore cycles that aren't natural loops.
266 // Ignore cycles that aren't natural loops.
323 const MachineLoopInfo *Loops;
326 const MachineLoopInfo *loops)
[all...] |
| CalcSpillWeights.cpp | 142 loop = Loops.getLoopFor(mbb);
|
| InlineSpiller.cpp | 60 MachineLoopInfo &Loops;
144 Loops(pass.getAnalysis<MachineLoopInfo>()),
205 // spill slots which can be important in tight loops.
433 SpillDepth = Loops.getLoopDepth(SV.SpillMBB);
438 if ((Loops.getLoopDepth(DepSV.SpillMBB) > SpillDepth) &&
[all...] |
| SplitKit.cpp | 48 Loops(mli),
121 /// analyzeUses - Count instructions, basic blocks, and loops using CurLI.
682 const MachineLoopInfo &Loops = SA.Loops;
683 const MachineLoop *DefLoop = Loops.getLoopFor(DefMBB);
691 const MachineLoop *Loop = Loops.getLoopFor(MBB);
[all...] |
| RegisterCoalescer.cpp | 79 const MachineLoopInfo* Loops;
[all...] |
| RegAllocGreedy.cpp | 77 MachineLoopInfo *Loops;
486 /// Cascade numbers are used to prevent infinite loops if this function is a
524 // infinite eviction loops.
590 // evicted by a newer cascade, preventing infinite loops.
[all...] |
| /external/oprofile/events/i386/westmere/ |
| events | 28 event:0x20 counters:0,1,2,3 um:x01 minimum:2000000 name:LSD_OVERFLOW : Loops that can't stream from the instruction queue
|
| /external/llvm/lib/TableGen/ |
| TGParser.h | 60 /// Loops - Keep track of any foreach loops we are within.
63 LoopVector Loops;
|
| TGParser.cpp | 93 // Do not allow assignments like 'X = X'. This will just cause infinite loops
293 /// values in all surrounding foreach loops, creating new records for
296 if (Loops.empty())
311 if (IterVals.size() != Loops.size()) {
312 assert(IterVals.size() < Loops.size());
313 ForeachLoop &CurLoop = Loops[IterVals.size()];
781 for (LoopVector::iterator i = Loops.begin(), iend = Loops.end();
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 1 //===- LoopStrengthReduce.cpp - Strength Reduce IVs in Loops --------------===//
14 // This pass performs a strength reduction on array references inside loops that
38 // TODO: Handle multiple loops at a time.
835 // loop at a time. LSR has already run on inner loops, will not run on outer
836 // loops, and cannot be expected to change sibling loops.
[all...] |
