/external/llvm/include/llvm/CodeGen/ |
CalcSpillWeights.h | 45 const MachineLoopInfo &Loops; 49 const MachineLoopInfo &loops) : 50 MF(mf), LIS(lis), Loops(loops) {}
|
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;
|
/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,
|
DependenceAnalysis.h | 138 /// getLevels - Returns the number of common loops surrounding the 207 /// getLevels - Returns the number of common loops surrounding the 266 /// to dependences). Looking for cycles in the graph shows us loops 299 /// both loops. 315 SmallBitVector Loops; 426 /// instructions and establishes their shared loops. Sets the variables 436 /// It's used to help calculate distinct loops referenced by the destination. 437 /// Here's the map from loops to levels: 440 /// ... - other common loops 442 /// ... - loops containing Src but not Ds [all...] |
LoopInfoImpl.h | 10 // This is the generic implementation of LoopInfo used for both Loops and 194 /// Because of this, it is added as a member of all parent loops, and is added 211 // Add the basic block to this loop and all parent loops... 218 /// replaceChildLoopWith - This is used when splitting loops up. It replaces 325 /// verifyLoop - Verify loop structure of this loop and all nested loops. 328 DenseSet<const LoopT*> *Loops) const { 329 Loops->insert(static_cast<const LoopT *>(this)); 334 (*I)->verifyLoopNest(Loops); 476 /// Add a single Block to its ancestor loops in PostOrder. If the block is a 503 /// 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 59 /// LoopBase class - Instances of this class are used to represent loops that 65 // SubLoops - Loops contained entirely within this one. 84 /// blocks, where depth 0 is used for blocks not inside any loops. 120 /// iterator/begin/end - Return the loops contained entirely within this loop. 179 // 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);
|
DependenceAnalysis.cpp | 661 // instructions and establishes their shared loops. Sets the variables 671 // It's used to help calculate distinct loops referenced by the destination. 672 // Here's the map from loops to levels: 675 // ... - other common loops 677 // ... - loops containing Src but not Dst 679 // ... - loops containing Dst but not Src 680 // MaxLevels - innermost loops containing Dst but not Src 700 // have 2 loops in common, so CommonLevels will equal 2 and the direction 738 // Given one of the loops containing the source, return 745 // Given one of the loops containing the destination [all...] |
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 34 // Explicitly instantiate methods in LoopInfoImpl.h for IR-level Loops. 49 INITIALIZE_PASS_BEGIN(LoopInfo, "loops", "Natural Loop Information", true, true) 51 INITIALIZE_PASS_END(LoopInfo, "loops", "Natural Loop Information", true, true) 136 /// The IndVarSimplify pass transforms loops to have a canonical induction 206 /// the LoopSimplify form transforms loops to, which is sometimes called 209 // Normal-form loops have a preheader, a single backedge, and all of their 266 // nested parallel loops). The loop identifier metadata refers t [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/Target/R600/ |
AMDGPUStructurizeCFG.cpp | 148 /// Additionally to that even complicated loops look like this: 188 BB2BBMap Loops; 206 void insertConditions(bool Loops); 290 /// \brief Determine the end of the loops 297 Loops[Exit] = N->getEntry(); 308 Loops[Succ] = BB; 390 if (Visited.count(Other) && !Loops.count(Other) && 432 Loops.clear(); 453 void AMDGPUStructurizeCFG::insertConditions(bool Loops) { 454 BranchVector &Conds = Loops ? LoopConds : Conditions [all...] |
/external/llvm/lib/CodeGen/ |
EarlyIfConversion.cpp | 585 MachineLoopInfo *Loops; 647 if (!Loops) 652 Loops->removeBlock(Removed[i]); 784 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
ExecutionDepsFix.cpp | 679 SmallVector<MachineBasicBlock*, 16> Loops; 685 Loops.push_back(MBB); 694 for (unsigned i = 0, e = Loops.size(); i != e; ++i) { 695 MachineBasicBlock *MBB = Loops[i];
|
SplitKit.h | 46 const MachineLoopInfo &Loops;
|
LiveRangeEdit.cpp | 378 const MachineLoopInfo &Loops) { 379 VirtRegAuxInfo VRAI(MF, LIS, Loops);
|
MachineTraceMetrics.cpp | 39 : MachineFunctionPass(ID), MF(0), TII(0), TRI(0), MRI(0), Loops(0) { 55 Loops = &getAnalysis<MachineLoopInfo>(); 118 return MTM.Loops->getLoopFor(MBB); 195 // We never allow traces that leave loops, but we do allow traces to enter 196 // nested loops. We also never allow traces to contain back-edges. 228 // Don't leave loops, and never follow back-edges. 239 // Ignore cycles that aren't natural loops. 269 // Ignore cycles that aren't natural loops. 326 const MachineLoopInfo *Loops; 329 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...] |
RegAllocGreedy.cpp | 75 MachineLoopInfo *Loops; 484 /// Cascade numbers are used to prevent infinite loops if this function is a 522 // infinite eviction loops. 588 // evicted by a newer cascade, preventing infinite loops. [all...] |
RegisterCoalescer.cpp | 85 const MachineLoopInfo* 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 295 /// values in all surrounding foreach loops, creating new records for 298 if (Loops.empty()) 313 if (IterVals.size() != Loops.size()) { 314 assert(IterVals.size() < Loops.size()); 315 ForeachLoop &CurLoop = Loops[IterVals.size()]; 774 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. 846 // loop at a time. LSR has already run on inner loops, will not run on outer 847 // loops, and cannot be expected to change sibling loops. [all...] |