/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...] |
BlockFrequencyInfoImpl.h | 385 /// \brief Indexed information about loops. 386 std::list<LoopData> Loops; 401 /// every edge should be a local edge (since all the loops are packaged up). 417 /// Insert them into \a Loops before \c Insert. 435 /// backedges and exits are stored in its entry in Loops. 447 /// \brief Unwrap loops. 563 /// loops. 629 /// which is called the header. A given loop, L, can have sub-loops, which are 630 /// loops within the subgraph of L that exclude its header. (A "trivial" SCC 633 /// In addition to loops, this algorithm has limited support for irreducibl [all...] |
LoopInfoImpl.h | 10 // This is the generic implementation of LoopInfo used for both Loops and 181 /// Because of this, it is added as a member of all parent loops, and is added 198 // Add the basic block to this loop and all parent loops... 205 /// replaceChildLoopWith - This is used when splitting loops up. It replaces 306 /// verifyLoop - Verify loop structure of this loop and all nested loops. 309 DenseSet<const LoopT*> *Loops) const { 310 Loops->insert(static_cast<const LoopT *>(this)); 315 (*I)->verifyLoopNest(Loops); 457 /// Add a single Block to its ancestor loops in PostOrder. If the block is a 483 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversa [all...] |
/external/llvm/include/llvm/CodeGen/ |
CalcSpillWeights.h | 52 const MachineLoopInfo &Loops; 59 const MachineLoopInfo &loops, 62 : MF(mf), LIS(lis), Loops(loops), MBFI(mbfi), normalize(norm) {}
|
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) {} 138 Loops.insert(L); 164 if (Loops.count(L)) { 179 if (Loops.count(L)) { 249 PostIncLoopSet &Loops, 252 PostIncTransform Transform(Kind, Loops, SE, DT);
|
DependenceAnalysis.cpp | 666 // instructions and establishes their shared loops. Sets the variables 676 // It's used to help calculate distinct loops referenced by the destination. 677 // Here's the map from loops to levels: 680 // ... - other common loops 682 // ... - loops containing Src but not Dst 684 // ... - loops containing Dst but not Src 685 // MaxLevels - innermost loops containing Dst but not Src 705 // have 2 loops in common, so CommonLevels will equal 2 and the direction 743 // Given one of the loops containing the source, return 750 // Given one of the loops containing the destination [all...] |
BlockFrequencyInfoImpl.cpp | 10 // Loops should be simplified before this analysis. 249 Loops.clear(); 481 for (LoopData &Loop : Loops) 670 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), 685 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); 686 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); 698 return make_range(Loops.begin(), Insert);
|
/external/llvm/lib/Transforms/Scalar/ |
StructurizeCFG.cpp | 142 /// Additionally to that even complicated loops look like this: 179 BB2BBMap Loops; 197 void insertConditions(bool Loops); 288 /// \brief Determine the end of the loops 294 Loops[Exit] = N->getEntry(); 305 Loops[Succ] = BB; 390 if (Visited.count(Other) && !Loops.count(Other) && 431 Loops.clear(); 452 void StructurizeCFG::insertConditions(bool Loops) { 453 BranchVector &Conds = Loops ? LoopConds : Conditions [all...] |
/external/chromium_org/tools/telemetry/telemetry/page/actions/ |
loop.js | 8 // Loops media playback `loopCount` times.
|
/external/llvm/lib/CodeGen/ |
CalcSpillWeights.cpp | 129 loop = Loops.getLoopFor(mbb);
|
EarlyIfConversion.cpp | 586 MachineLoopInfo *Loops; 648 if (!Loops) 653 Loops->removeBlock(Removed[i]); 791 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
ExecutionDepsFix.cpp | 748 SmallVector<MachineBasicBlock*, 16> Loops; 754 Loops.push_back(MBB); 764 for (unsigned i = 0, e = Loops.size(); i != e; ++i) { 765 MachineBasicBlock *MBB = Loops[i];
|
SplitKit.h | 47 const MachineLoopInfo &Loops;
|
MachineTraceMetrics.cpp | 42 MRI(nullptr), Loops(nullptr) { 58 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...] |
/external/llvm/lib/Target/AArch64/ |
AArch64ConditionalCompares.cpp | 731 MachineLoopInfo *Loops; 802 if (!Loops) 805 Loops->removeBlock(Removed[i]); 900 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
/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
|