HomeSort by relevance Sort by last modified time
    Searched defs:Loops (Results 1 - 25 of 51) sorted by null

1 2 3

  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
CalcSpillWeights.h 45 const MachineLoopInfo &Loops;
49 const MachineLoopInfo &loops) :
50 MF(mf), LIS(lis), Loops(loops) {}
  /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.
73 const MachineLoopInfo *Loops;
  /external/mesa3d/src/gallium/drivers/r300/compiler/
radeon_emulate_loops.h 46 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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
CalcSpillWeights.h 55 const MachineLoopInfo &Loops;
62 VirtRegMap *vrm, const MachineLoopInfo &loops,
65 : 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.
93 const MachineLoopInfo *Loops = nullptr;
  /external/llvm/include/llvm/Analysis/
LoopPassManager.h 11 /// This header provides classes for managing passes over loops in LLVM IR.
54 /// \brief Adaptor that maps from a function to its loops.
93 // We want to visit the loops in reverse post-order. We'll build the stack
94 // of loops to visit in Loops by first walking the loops in pre-order.
95 SmallVector<Loop *, 2> Loops;
100 Loops.push_back(L);
103 // Now pop each element off of the stack to visit the loops in reverse
105 for (auto *L : reverse(Loops)) {
    [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...]
DependenceAnalysis.h 157 /// getLevels - Returns the number of common loops surrounding the
243 /// getLevels - Returns the number of common loops surrounding the
304 /// to dependences). Looking for cycles in the graph shows us loops
337 /// both loops.
355 SmallBitVector Loops;
466 /// instructions and establishes their shared loops. Sets the variables
476 /// It's used to help calculate distinct loops referenced by the destination.
477 /// Here's the map from loops to levels:
480 /// ... - other common loops
482 /// ... - loops containing Src but not Ds
    [all...]
  /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);
  /external/swiftshader/third_party/LLVM/lib/Analysis/
ScalarEvolutionNormalization.cpp 69 PostIncLoopSet &Loops;
76 PostIncTransform(TransformKind kind, PostIncLoopSet &loops,
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
128 Loops.insert(L);
140 if (Loops.count(L)) {
153 if (Loops.count(L))
220 PostIncLoopSet &Loops,
223 PostIncTransform Transform(Kind, Loops, SE, DT);
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/
WebAssemblyCFGSort.cpp 113 /// Sort the blocks, taking special care to make sure that loops are not
146 SmallVector<Entry, 4> Loops;
153 Loops.push_back(Entry(L));
157 for (Entry &E : Loops)
161 while (!Loops.empty() && Loops.back().NumBlocksLeft == 0)
162 Loops.pop_back();
182 if (!Loops.empty() &&
183 !MDT.dominates(Loops.back().Loop->getHeader(), Next)) {
184 Loops.back().Deferred.push_back(Next)
    [all...]
  /external/llvm/lib/TableGen/
TGParser.h 60 /// Loops - Keep track of any foreach loops we are within.
63 LoopVector Loops;
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
MustExecute.cpp 137 // patterns. TODO: support loops with multiple latches.
242 const auto &Loops = MustExec.lookup(&V);
243 const auto NumLoops = Loops.size();
245 OS << " ; (mustexec in " << NumLoops << " loops: ";
250 for (const Loop *L : Loops) {
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/TableGen/
TGParser.h 93 /// Loops - Keep track of any foreach loops we are within.
95 std::vector<std::unique_ptr<ForeachLoop>> Loops;
  /external/llvm/lib/CodeGen/
ExecutionDepsFix.cpp 765 SmallVector<MachineBasicBlock*, 16> Loops;
771 Loops.push_back(MBB);
780 for (MachineBasicBlock *MBB : Loops) {
SplitKit.h 82 const MachineLoopInfo &Loops;
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyCFGStackify.cpp 22 /// WebAssembly, provided that all loops are single-entry.
130 /// Sort the blocks, taking special care to make sure that loops are not
163 SmallVector<Entry, 4> Loops;
170 Loops.push_back(Entry(L));
174 for (Entry &E : Loops)
178 while (!Loops.empty() && Loops.back().NumBlocksLeft == 0)
179 Loops.pop_back();
199 if (!Loops.empty() &&
200 !MDT.dominates(Loops.back().Loop->getHeader(), Next))
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
SplitKit.h 46 const MachineLoopInfo &Loops;
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
SplitKit.h 88 const MachineLoopInfo &Loops;
  /external/swiftshader/third_party/subzero/src/
IceLoopAnalyzer.cpp 27 /// to innermost loops. By deleting the head of the loop from the graph, inner
28 /// loops can be found. This assumes that the head node is not shared between
29 /// loops but instead all paths to the head come from 'continue' constructs.
38 CfgVector<CfgUnorderedSet<SizeT>> getLoopBodies() { return Loops; }
102 /// The function to analyze for loops.
117 /// All the Loops, in descending order of size
118 CfgVector<CfgUnorderedSet<SizeT>> Loops;
249 Loops.push_back(LoopNodes);
260 CfgVector<Loop> Loops;
261 Loops.reserve(LoopBodies.size())
    [all...]
  /external/llvm/lib/Target/AArch64/
AArch64ConditionalCompares.cpp 728 MachineLoopInfo *Loops;
797 if (!Loops)
800 Loops->removeBlock(RemovedMBB);
897 Loops = getAnalysisIfAvailable<MachineLoopInfo>();
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
LoopInfoImpl.h 10 // This is the generic implementation of LoopInfo used for both Loops and
246 /// Because of this, it is added as a member of all parent loops, and is added
269 // Add the basic block to this loop and all parent loops...
276 /// replaceChildLoopWith - This is used when splitting loops up. It replaces
379 /// verifyLoop - Verify loop structure of this loop and all nested loops.
382 DenseSet<const LoopT *> *Loops) const {
384 Loops->insert(static_cast<const LoopT *>(this));
389 (*I)->verifyLoopNest(Loops);
510 /// Add a single Block to its ancestor loops in PostOrder. If the block is a
536 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversa
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AArch64/
AArch64ConditionalCompares.cpp 771 MachineLoopInfo *Loops;
840 if (!Loops)
843 Loops->removeBlock(RemovedMBB);
    [all...]

Completed in 8073 milliseconds

1 2 3