/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 | 147 /// getLevels - Returns the number of common loops surrounding the 241 /// getLevels - Returns the number of common loops surrounding the 300 /// to dependences). Looking for cycles in the graph shows us loops 333 /// both loops. 349 SmallBitVector Loops; 460 /// instructions and establishes their shared loops. Sets the variables 470 /// It's used to help calculate distinct loops referenced by the destination. 471 /// Here's the map from loops to levels: 474 /// ... - other common loops 476 /// ... - 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...] |
/external/llvm/include/llvm/CodeGen/ |
CalcSpillWeights.h | 46 const MachineLoopInfo &Loops; 51 const MachineLoopInfo &loops, 53 : MF(mf), LIS(lis), Loops(loops), MBFI(mbfi) {}
|
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/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
radeon_emulate_loops.h | 21 struct loop_info * Loops;
|
radeon_emulate_loops.c | 183 * If c->max_alu_inst is -1, then all eligible loops will be unrolled regardless 239 * loops here.*/ 248 /* Don't unroll loops if it has a BRK instruction 252 /* Make sure we haven't entered a nested loops. */ 277 * simple, since we only support increment and decrement loops. 284 * with our loops, if the condition is met, the is exited. */ 427 s->Loops, s->LoopCount, s->LoopReserved, 1); 429 loop = &s->Loops[s->LoopCount++]; 509 /* Iterate backwards of the list of loops so that loops that neste [all...] |
r500_fragprog_emit.c | 84 struct r500_loop_info * Loops; 454 /* Currently all loops use the same integer constant to intialize 467 s->Loops, s->CurrentLoopDepth, s->LoopsReserved, 1); 469 loop = &s->Loops[s->CurrentLoopDepth++]; 480 loop = &s->Loops[s->CurrentLoopDepth - 1]; 495 loop = &s->Loops[s->CurrentLoopDepth - 1]; 510 loop = &s->Loops[s->CurrentLoopDepth - 1]; 517 /* The constant integer at index 0 is used by all loops. */ 679 /* Enable full flow control mode if we are using loops or have if
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
radeon_emulate_loops.h | 21 struct loop_info * Loops;
|
radeon_emulate_loops.c | 183 * If c->max_alu_inst is -1, then all eligible loops will be unrolled regardless 239 * loops here.*/ 248 /* Don't unroll loops if it has a BRK instruction 252 /* Make sure we haven't entered a nested loops. */ 277 * simple, since we only support increment and decrement loops. 284 * with our loops, if the condition is met, the is exited. */ 427 s->Loops, s->LoopCount, s->LoopReserved, 1); 429 loop = &s->Loops[s->LoopCount++]; 509 /* Iterate backwards of the list of loops so that loops that neste [all...] |
r500_fragprog_emit.c | 84 struct r500_loop_info * Loops; 454 /* Currently all loops use the same integer constant to intialize 467 s->Loops, s->CurrentLoopDepth, s->LoopsReserved, 1); 469 loop = &s->Loops[s->CurrentLoopDepth++]; 480 loop = &s->Loops[s->CurrentLoopDepth - 1]; 495 loop = &s->Loops[s->CurrentLoopDepth - 1]; 510 loop = &s->Loops[s->CurrentLoopDepth - 1]; 517 /* The constant integer at index 0 is used by all loops. */ 679 /* Enable full flow control mode if we are using loops or have if
|
/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) 139 /// The IndVarSimplify pass transforms loops to have a canonical induction 209 /// the LoopSimplify form transforms loops to, which is sometimes called 212 // Normal-form loops have a preheader, a single backedge, and all of their 317 // nested parallel loops). The loop identifier metadata refers t [all...] |
/external/llvm/lib/Transforms/Scalar/ |
StructurizeCFG.cpp | 141 /// Additionally to that even complicated loops look like this: 178 BB2BBMap Loops; 196 void insertConditions(bool Loops); 286 /// \brief Determine the end of the loops 292 Loops[Exit] = N->getEntry(); 303 Loops[Succ] = BB; 383 if (Visited.count(Other) && !Loops.count(Other) && 424 Loops.clear(); 445 void StructurizeCFG::insertConditions(bool Loops) { 446 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 | 47 const MachineLoopInfo &Loops;
|
MachineTraceMetrics.cpp | 40 : MachineFunctionPass(ID), MF(0), TII(0), TRI(0), MRI(0), Loops(0) { 56 Loops = &getAnalysis<MachineLoopInfo>(); 160 return MTM.Loops->getLoopFor(MBB); 288 // We never allow traces that leave loops, but we do allow traces to enter 289 // nested loops. We also never allow traces to contain back-edges. 321 // Don't leave loops, and never follow back-edges. 332 // Ignore cycles that aren't natural loops. 362 // Ignore cycles that aren't natural loops. 419 const MachineLoopInfo *Loops; 422 const MachineLoopInfo *loops) [all...] |
LiveRangeEdit.cpp | 392 const MachineLoopInfo &Loops, 394 VirtRegAuxInfo VRAI(MF, LIS, Loops, MBFI);
|
CalcSpillWeights.cpp | 145 loop = Loops.getLoopFor(mbb);
|
InlineSpiller.cpp | 63 MachineLoopInfo &Loops; 148 Loops(pass.getAnalysis<MachineLoopInfo>()), 210 // spill slots which can be important in tight loops. 438 SpillDepth = Loops.getLoopDepth(SV.SpillMBB); 443 if ((Loops.getLoopDepth(DepSV.SpillMBB) > SpillDepth) && [all...] |
/external/chromium_org/chrome/common/extensions/docs/examples/howto/userscript-runat/ |
runat.user.js | 34 * Loops through the urls var and prints its contents to the page DOM.
|
/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;
|