| /external/llvm/lib/Transforms/Scalar/ |
| LoopRotation.cpp | 1 //===- LoopRotation.cpp - Loop Rotation Pass ------------------------------===//
10 // This file implements Loop Rotation Pass.
41 #define DEBUG_TYPE "loop-rotate"
45 cl::desc("The default maximum header size for automatic loop rotation"));
51 /// these instruction that were outside of the loop, we have to insert PHI nodes
75 // and the loop "next" value in the original header.
114 /// Rotate loop LP. Return true if the loop is rotated.
117 /// loop exit. In this case we may want to rotate even though the new latch is
122 /// form. This property is satisfied because simplifying the loop latch can onl
[all...] |
| Sink.cpp | 126 // unreachable loop there may be nowhere to stop.
218 // Don't sink instructions into a loop.
219 Loop *succ = LI->getLoopFor(SuccToSinkTo);
220 Loop *cur = LI->getLoopFor(Inst->getParent());
|
| PlaceSafepoints.cpp | 89 STATISTIC(CallInLoop, "Number of loops w/o safepoints due to calls in loop");
99 /// How narrow does the trip count of a loop have to be to have to be considered
101 static cl::opt<int> CountedLoopTripWidth("spp-counted-loop-trip-width",
104 // If true, split the backedge of a loop when placing the safepoint, otherwise
138 bool runOnLoop(Loop *);
139 void runOnLoopAndSubLoops(Loop *L) {
211 /// Returns true if this loop is known to contain a call safepoint which
212 /// must unconditionally execute on any iteration of the loop which returns
213 /// to the loop header via an edge from Pred. Returns a conservative correct
215 static bool containsUnconditionalCallSafepoint(Loop *L, BasicBlock *Header
[all...] |
| StructurizeCFG.cpp | 154 /// |/ 2 = "Loop" optional subregion, with all exits at "Flow" block
160 /// while the true side continues the general flow. So the loop condition
291 std::map<Loop*, unsigned> LoopBlocks;
299 Loop *Loop = LI->getLoopFor(BB);
300 if (!LoopBlocks.count(Loop)) {
301 LoopBlocks[Loop] = 1;
304 LoopBlocks[Loop]++;
308 Loop *CurrentLoop = nullptr;
318 // Make sure we have visited all blocks in this loop before moving back t
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | 1 //===- LoopVectorize.cpp - A Loop Vectorizer ------------------------------===//
10 // This is the LLVM loop vectorizer. This pass modifies 'vectorizable' loops
15 // The loop vectorizer combines consecutive loop iterations into a single
20 // 1. The main loop pass that drives the different parts.
111 #define LV_NAME "loop-vectorize"
132 "will be determined by the smallest type in loop."));
151 cl::desc("Enable vectorization on interleaved memory accesses in a loop"));
191 "small-loop-cost", cl::init(20), cl::Hidden,
193 "The cost of a loop that is considered 'small' by the interleaver."))
[all...] |
| /external/v8/src/compiler/ |
| loop-peeling.cc | 7 #include "src/compiler/loop-peeling.h"
13 // Loop peeling is an optimization that copies the body of a loop, creating
15 // first iteration. Beginning with a loop as follows:
25 // ( Loop )<-------- ( phiA ) | | | |
42 // The body of the loop is duplicated so that all nodes considered "inside"
43 // the loop (e.g. {P, U, X, Y, K, L, M}) have a corresponding copies in the
45 // backedges of the loop correspond to edges from the peeled iteration to
46 // the main loop body, with multiple backedges requiring a merge.
48 // Similarly, any exits from the loop body need to be merged with "exits
[all...] |
| /external/llvm/lib/Analysis/ |
| Delinearization.cpp | 96 for (Loop *L = LI->getLoopFor(BB); L != nullptr; L = L->getParentLoop()) {
108 O << "In Loop with Header: " << L->getHeader()->getName() << "\n";
|
| LoopAccessAnalysis.cpp | 1 //===- LoopAccessAnalysis.cpp - Loop Access Analysis Implementation --------==//
10 // The implementation for the loop memory dependence that was originally
11 // developed for the loop vectorizer.
28 #define DEBUG_TYPE "loop-accesses"
65 "loop-access analysis (default = 100)"),
74 const Loop *TheLoop,
127 void RuntimePointerChecking::insert(Loop *Lp, Value *Ptr, bool WritePtr,
416 /// \brief Analyses memory accesses in a loop.
454 Loop *TheLoop, const ValueToValueMap &Strides,
525 Loop *L)
[all...] |
| ScalarEvolutionNormalization.cpp | 27 /// the loop, resulting in reg-reg copies (if we use the pre-inc value when we
30 const Loop *L, DominatorTree *DT) {
31 // If the user is in the loop, use the preinc value.
38 // Ok, the user is outside of the loop. If it is dominated by the latch
110 const Loop *L = AR->getLoop();
111 // The addrec conceptually uses its operands at loop entry.
|
| ScalarEvolution.cpp | 33 // types, computes the execution count of a loop, etc.
49 // Symbolic Evaluation of Chains of Recurrences for Loop Optimization
101 "Number of loops with predictable loop counts");
103 "Number of loops without predictable loop counts");
111 "derived loop"),
507 // For instructions, compare their loop depth, and their operand
512 // Compare loop depths.
548 // Compare addrec loop depths.
549 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop();
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64TargetTransformInfo.h | 120 void getUnrollingPreferences(Loop *L, TTI::UnrollingPreferences &UP);
|
| /external/llvm/lib/Target/AMDGPU/ |
| AMDGPUTargetTransformInfo.cpp | 31 void AMDGPUTTIImpl::getUnrollingPreferences(Loop *L,
53 // compiler bugs. If this loop does an address calculation on an
54 // alloca ptr, then we want to use a higher than normal loop unroll
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCTargetTransformInfo.h | 62 void getUnrollingPreferences(Loop *L, TTI::UnrollingPreferences &UP);
|
| PPCCTRLoops.cpp | 15 // normalizes induction variables, and the Loop Strength Reduction pass
106 bool convertToCTRLoop(Loop *L);
184 Loop *L = *I;
278 // control can't then return to inside the loop unless there is also
433 bool PPCCTRLoops::convertToCTRLoop(Loop *L) {
442 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I) {
444 DEBUG(dbgs() << "Nested loop converted\n");
447 // If a nested loop has been converted, then we can't convert this loop.
462 // want to use the counter register if the loop contains calls
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-loop-analysis.cc | 11 #include "src/compiler/loop-analysis.h"
138 LoopTree::Loop* loop = tree->ContainingLoop(header[0]); local
139 CHECK(loop);
141 CHECK(header_count == static_cast<int>(loop->HeaderSize()));
143 // Each header node should be in the loop.
144 CHECK_EQ(loop, tree->ContainingLoop(header[i]));
145 CheckRangeContains(tree->HeaderNodes(loop), header[i]);
148 CHECK_EQ(body_count, static_cast<int>(loop->BodySize()));
151 // Each body node should be contained in the loop
166 LoopTree::Loop* loop = tree->ContainingLoop(header); local
191 Node* loop; member in struct:v8::internal::compiler::While
619 Node* loop = t.graph.NewNode(t.common.Loop(2), t.start, t.start); local
653 Node* loop = t.graph.NewNode(t.common.Loop(1 + i), 1 + i, loop_inputs); local
691 Node* loop = t.graph.NewNode(t.common.Loop(2), t.start, t.start); local
930 Node* loop = t.graph.NewNode(t.common.Loop(2), last, t.start); local
966 Node* loop = t.graph.NewNode(t.common.Loop(2), entry, t.start); local
[all...] |
| /external/libpng/contrib/gregbook/ |
| makevms.com | 103 $Loop:
122 $ If arg .Le. 8 Then Goto Loop
|
| /external/libpng/contrib/pngminus/ |
| makevms.com | 63 $Loop:
82 $ If arg .Le. 8 Then Goto Loop
|
| /external/llvm/include/llvm/Analysis/ |
| ValueTracking.h | 30 class Loop;
206 /// If LoopInfo is passed, loop phis are further analyzed. If a pointer
208 /// phi node. E.g. consider this loop nest:
217 /// of the outer loop:
343 /// guaranteed for function calls that could loop infinitely.
356 /// is executed for every iteration of the loop L.
358 /// Note that this currently only considers the loop header.
360 const Loop *L);
|
| ScalarEvolutionExpressions.h | 282 /// count of the specified loop. This is the primary focus of the
287 /// All operands of an AddRec are required to be loop invariant.
292 const Loop *L;
295 const SCEV *const *O, size_t N, const Loop *l)
300 const Loop *getLoop() const { return L; }
314 /// A + B*x where A and B are loop invariant values.
322 /// A + B*x + C*x^2 where A, B and C are loop invariant values.
341 /// getNumIterationsInRange - Return the number of iterations of this loop
351 /// this expression one iteration of the loop ahead.
666 typedef DenseMap<const Loop*, const SCEV*> LoopToScevMapT
[all...] |
| TargetTransformInfo.h | 36 class Loop;
226 /// Parameters that control the generic loop unrolling transformation.
228 /// The cost threshold for the unrolled loop. Should be relative to the
230 /// the unrolled loop's instructions when run through that interface should
233 /// profitable. Set this to UINT_MAX to disable the loop body cost
236 /// If complete unrolling will reduce the cost of the loop below its
243 /// The cost threshold for the unrolled loop when optimizing for size (set
246 /// The cost threshold for the unrolled loop, like Threshold, but used
249 /// The cost threshold for the unrolled loop when optimizing for size, like
254 /// original loop in the unrolled loop body). When set to 0, the unrollin
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 1 //===- LoopExtractor.cpp - Extract each loop into a new function ----------===//
11 // top-level loop into its own new function. If the loop is the ONLY loop in a
32 #define DEBUG_TYPE "loop-extract"
46 bool runOnLoop(Loop *L, LPPassManager &) override;
58 INITIALIZE_PASS_BEGIN(LoopExtractor, "loop-extract",
63 INITIALIZE_PASS_END(LoopExtractor, "loop-extract",
75 INITIALIZE_PASS(SingleLoopExtractor, "loop-extract-single",
76 "Extract at most one loop into a new function", false, false
[all...] |
| /external/v8/test/mjsunit/compiler/ |
| osr-uint32.js | 28 // Loop to force OSR.
|
| /system/vold/ |
| Android.mk | 14 Loop.cpp \
|
| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 287 // This means that a loop header can never appear above the center block of a
288 // trace, except as the trace head. Below the center block, loop exiting edges
291 // Return true if an edge from the From loop to the To loop is leaving a loop.
404 // set abstraction that confines the search to the current loop, and doesn't
420 // it is limited to the current loop and doesn't traverse the loop back edges.
446 // that MachineLoopInfo didn't recognize as a natural loop.
456 // Set up loop bounds for the backwards post-order traversal
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| AsmPrinter.cpp | [all...] |
