| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_emulate_loops.h | 21 struct loop_info * Loops;
|
| 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/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/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_emulate_loops.h | 21 struct loop_info * Loops;
|
| 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);
|
| ScalarEvolutionExpander.cpp | 182 // Move the insertion point out of as many loops as we can.
384 /// pushing loop-invariant computation down into loops, so even if the
553 // Move the insertion point out of as many loops as we can.
573 // Move the insertion point out of as many loops as we can.
612 /// PickMostRelevantLoop - Given two loops pick the one that's most relevant for
636 // A constant has no relevant loops.
641 // A non-instruction has no relevant loops.
669 /// LoopCompare - Compare loops by PickMostRelevantLoop.
682 // Compare loops with PickMostRelevantLoop.
705 // Collect all the add operands in a loop, along with their associated loops
[all...] |
| /external/llvm/lib/TableGen/ |
| TGParser.h | 60 /// Loops - Keep track of any foreach loops we are within.
63 LoopVector Loops;
|
| /external/llvm/lib/CodeGen/ |
| SplitKit.h | 47 const MachineLoopInfo &Loops;
|
| 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];
|
| EarlyIfConversion.cpp | 586 MachineLoopInfo *Loops;
648 if (!Loops)
653 Loops->removeBlock(Removed[i]);
791 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
| SplitKit.cpp | 49 Loops(mli),
122 /// analyzeUses - Count instructions, basic blocks, and loops using CurLI.
684 const MachineLoopInfo &Loops = SA.Loops;
685 const MachineLoop *DefLoop = Loops.getLoopFor(DefMBB);
693 const MachineLoop *Loop = Loops.getLoopFor(MBB);
[all...] |
| InlineSpiller.cpp | 65 MachineLoopInfo &Loops;
150 Loops(pass.getAnalysis<MachineLoopInfo>()),
210 // spill slots which can be important in tight loops.
440 SpillDepth = Loops.getLoopDepth(SV.SpillMBB);
457 if ((Loops.getLoopDepth(DepSV.SpillMBB) > SpillDepth) &&
[all...] |
| RegAllocGreedy.cpp | 119 MachineLoopInfo *Loops;
642 /// Cascade numbers are used to prevent infinite loops if this function is a
686 // infinite eviction loops.
761 // evicted by a newer cascade, preventing infinite loops.
[all...] |
| RegisterCoalescer.cpp | 85 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/llvm/include/llvm/Analysis/ |
| 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...] |
| /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...] |
| 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.
[all...] |
