| /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 | 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/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) {}
127 Loops.insert(L);
139 if (Loops.count(L)) {
152 if (Loops.count(L))
218 PostIncLoopSet &Loops,
221 PostIncTransform Transform(Kind, Loops, SE, DT);
|
| ScalarEvolutionExpander.cpp | 182 // Move the insertion point out of as many loops as we can.
388 /// pushing loop-invariant computation down into loops, so even if the
554 // Move the insertion point out of as many loops as we can.
579 // Move the insertion point out of as many loops as we can.
619 /// PickMostRelevantLoop - Given two loops pick the one that's most relevant for
643 // A constant has no relevant loops.
648 // A non-instruction has no relevant loops.
676 /// LoopCompare - Compare loops by PickMostRelevantLoop.
689 // Compare loops with PickMostRelevantLoop.
712 // 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 | 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];
|
| EarlyIfConversion.cpp | 585 MachineLoopInfo *Loops;
647 if (!Loops)
652 Loops->removeBlock(Removed[i]);
784 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
|
| RegAllocGreedy.cpp | 77 MachineLoopInfo *Loops;
529 /// Cascade numbers are used to prevent infinite loops if this function is a
569 // infinite eviction loops.
644 // evicted by a newer cascade, preventing infinite loops.
[all...] |
| SplitKit.cpp | 48 Loops(mli),
121 /// 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 | 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...] |
| RegisterCoalescer.cpp | 85 const MachineLoopInfo* Loops;
[all...] |
| /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...] |
| /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...] |
| 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.
859 // loop at a time. LSR has already run on inner loops, will not run on outer
860 // loops, and cannot be expected to change sibling loops.
[all...] |
