| /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 | 157 /// getLevels - Returns the number of common loops surrounding the
243 /// getLevels - Returns the number of common loops surrounding the
303 /// to dependences). Looking for cycles in the graph shows us loops
336 /// both loops.
352 SmallBitVector Loops;
463 /// instructions and establishes their shared loops. Sets the variables
473 /// It's used to help calculate distinct loops referenced by the destination.
474 /// Here's the map from loops to levels:
477 /// ... - other common loops
479 /// ... - loops containing Src but not Ds
[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);
429 /// Add a single Block to its ancestor loops in PostOrder. If the block is a
455 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversa
[all...] |
| BlockFrequencyInfoImpl.h | 386 /// \brief Indexed information about loops.
387 std::list<LoopData> Loops;
402 /// every edge should be a local edge (since all the loops are packaged up).
418 /// Insert them into \a Loops before \c Insert.
436 /// backedges and exits are stored in its entry in Loops.
447 /// Initially, irreducible loops are assumed to distribute their mass
458 /// \brief Unwrap loops.
576 /// loops.
642 /// which is called the header. A given loop, L, can have sub-loops, which are
643 /// loops within the subgraph of L that exclude its header. (A "trivial" SC
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| CalcSpillWeights.h | 56 const MachineLoopInfo &Loops;
63 VirtRegMap *vrm, const MachineLoopInfo &loops,
66 : MF(mf), LIS(lis), VRM(vrm), 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/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 | 663 // instructions and establishes their shared loops. Sets the variables
673 // It's used to help calculate distinct loops referenced by the destination.
674 // Here's the map from loops to levels:
677 // ... - other common loops
679 // ... - loops containing Src but not Dst
681 // ... - loops containing Dst but not Src
682 // MaxLevels - innermost loops containing Dst but not Src
702 // have 2 loops in common, so CommonLevels will equal 2 and the direction
740 // Given one of the loops containing the source, return
747 // Given one of the loops containing the destination
[all...] |
| BlockFrequencyInfoImpl.cpp | 10 // Loops should be simplified before this analysis.
248 Loops.clear();
339 // Infinite loops need special handling. If we give the back edge an infinite
495 for (LoopData &Loop : Loops)
692 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(),
707 assert((OuterLoop == nullptr) == (Insert == Loops.begin()));
708 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end();
720 return make_range(Loops.begin(), Insert);
736 assert(Loop.isIrreducible() && "this only makes sense on irreducible loops");
|
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 146 /// Additionally to that even complicated loops look like this:
184 BB2BBMap Loops;
202 void insertConditions(bool Loops);
296 // for outer loops will be visited before backedges for inner loops.
348 /// \brief Determine the end of the loops
354 Loops[Exit] = N->getEntry();
363 Loops[Succ] = BB;
447 if (Visited.count(Other) && !Loops.count(Other) &&
488 Loops.clear()
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/internal/actions/ |
| loop.js | 8 // Loops media playback `loopCount` times.
|
| /external/llvm/lib/CodeGen/ |
| EarlyIfConversion.cpp | 595 MachineLoopInfo *Loops;
657 if (!Loops)
662 Loops->removeBlock(Removed[i]);
798 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
| ExecutionDepsFix.cpp | 756 SmallVector<MachineBasicBlock*, 16> Loops;
762 Loops.push_back(MBB);
772 for (unsigned i = 0, e = Loops.size(); i != e; ++i) {
773 MachineBasicBlock *MBB = Loops[i];
|
| SplitKit.h | 47 const MachineLoopInfo &Loops;
|
| MachineTraceMetrics.cpp | 42 MRI(nullptr), Loops(nullptr) {
59 Loops = &getAnalysis<MachineLoopInfo>();
158 return MTM.Loops->getLoopFor(MBB);
284 // We never allow traces that leave loops, but we do allow traces to enter
285 // nested loops. We also never allow traces to contain back-edges.
317 // Don't leave loops, and never follow back-edges.
326 // Ignore cycles that aren't natural loops.
354 // Ignore cycles that aren't natural loops.
411 const MachineLoopInfo *Loops;
414 const MachineLoopInfo *loops)
[all...] |
| LiveRangeEdit.cpp | 405 const MachineLoopInfo &Loops,
407 VirtRegAuxInfo VRAI(MF, LIS, VRM, Loops, MBFI);
|
| CalcSpillWeights.cpp | 166 loop = Loops.getLoopFor(mbb);
|
| InlineSpiller.cpp | 64 MachineLoopInfo &Loops;
146 Loops(pass.getAnalysis<MachineLoopInfo>()), VRM(vrm),
209 // spill slots which can be important in tight loops.
439 SpillDepth = Loops.getLoopDepth(SV.SpillMBB);
456 if ((Loops.getLoopDepth(DepSV.SpillMBB) > SpillDepth) &&
[all...] |
| SplitKit.cpp | 45 : MF(vrm.getMachineFunction()), VRM(vrm), LIS(lis), Loops(mli),
118 /// analyzeUses - Count instructions, basic blocks, and loops using CurLI.
671 const MachineLoopInfo &Loops = SA.Loops;
672 const MachineLoop *DefLoop = Loops.getLoopFor(DefMBB);
680 const MachineLoop *Loop = Loops.getLoopFor(MBB);
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64ConditionalCompares.cpp | 731 MachineLoopInfo *Loops;
802 if (!Loops)
805 Loops->removeBlock(RemovedMBB);
899 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
| /external/llvm/lib/TableGen/ |
| TGParser.h | 60 /// Loops - Keep track of any foreach loops we are within.
63 LoopVector Loops;
|
| TGParser.cpp | 90 // Do not allow assignments like 'X = X'. This will just cause infinite loops
283 /// values in all surrounding foreach loops, creating new records for
286 if (Loops.empty())
301 if (IterVals.size() != Loops.size()) {
302 assert(IterVals.size() < Loops.size());
303 ForeachLoop &CurLoop = Loops[IterVals.size()];
745 for (const auto &L : Loops) {
[all...] |
