| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 1 //===- LoopInstSimplify.cpp - Loop Instruction Simplification Pass --------===//
10 // This pass performs lightweight instruction simplification on loop bodies.
30 #define DEBUG_TYPE "loop-instsimplify"
42 bool runOnLoop(Loop*, LPPassManager&) override;
58 INITIALIZE_PASS_BEGIN(LoopInstSimplify, "loop-instsimplify",
65 INITIALIZE_PASS_END(LoopInstSimplify, "loop-instsimplify",
72 bool LoopInstSimplify::runOnLoop(Loop *L, LPPassManager &LPM) {
117 // The first time through the loop ToSimplify is empty and we try to
127 // Mark all uses for resimplification next time round the loop.
150 // Add all successors to the worklist, except for loop exit blocks and th
[all...] |
| LoopUnrollPass.cpp | 1 //===-- LoopUnroll.cpp - Loop unroller pass -------------------------------===//
10 // This pass implements a simple loop unroller. It works best when loops have
39 #define DEBUG_TYPE "loop-unroll"
43 cl::desc("The baseline cost threshold for loop unrolling"));
58 cl::desc("Don't allow loop unrolling to simulate more than this number of"
69 "-unroll-threshold loop size is reached."));
107 /// that the loop unroll should be performed regardless of how much
134 bool runOnLoop(Loop *L, LPPassManager &) override;
136 /// This transformation requires natural loop information & requires that
137 /// loop preheaders be inserted into the CFG..
[all...] |
| LoopLoadElimination.cpp | 1 //===- LoopLoadElimination.cpp - Loop Load Elimination Pass ---------------===//
10 // This file implement a loop-aware load elimination pass.
12 // It uses LoopAccessAnalysis to identify loop-carried dependences with a
17 // The pass can also version the loop and add memchecks in order to prove that
34 #define LLE_OPTION "loop-load-elim"
40 "runtime-check-per-loop-load-elim", cl::Hidden,
45 "loop-load-elimination-scev-check-threshold", cl::init(8), cl::Hidden,
46 cl::desc("The maximum number of SCEV checks allowed for Loop "
103 bool doesStoreDominatesAllLatches(BasicBlock *StoreBlock, Loop *L,
113 /// \brief The per-loop class that does most of the work
[all...] |
| IndVarSimplify.cpp | 14 // If the trip count of a loop is computable, this pass also makes the following
16 // 1. The exit condition for the loop is canonicalized to compare the
19 // 2. Any use outside of the loop of an expression derived from the indvar
20 // is changed to compute the derived value outside of the loop, eliminating
22 // purpose of the loop is to compute the exit value of some derived
23 // expression, this transformation will make the loop dead.
61 STATISTIC(NumLFTR , "Number of loop exit tests replaced");
107 bool runOnLoop(Loop *L, LPPassManager &LPM) override;
129 void handleFloatingPointIV(Loop *L, PHINode *PH);
130 void rewriteNonIntegerIVs(Loop *L)
[all...] |
| LoopRerollPass.cpp | 1 //===-- LoopReroll.cpp - Loop rerolling pass ------------------------------===//
10 // This pass implements a simple loop reroller.
40 #define DEBUG_TYPE "loop-reroll"
46 cl::desc("The maximum increment for loop rerolling"));
54 // This loop re-rolling transformation aims to transform loops like this:
65 // into a loop like this:
76 // other induction-variable increments). In other words, we're looking for loop
93 // only of i (and other loop-invariant values).
134 /// The bitvector index used by loop induction variables and other
147 bool runOnLoop(Loop *L, LPPassManager &LPM) override
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
| omxVCM4P2_QuantInvInter_I_s.s | 133 Loop
166 BGT Loop
|
| /external/v8/src/compiler/ |
| loop-analysis.cc | 5 #include "src/compiler/loop-analysis.h"
24 NodeInfo* next; // link in chaining loop members
28 // Temporary loop info needed during traversal and building the loop tree.
33 LoopTree::Loop* loop; member in struct:v8::internal::compiler::LoopInfo
37 // Encapsulation of the loop finding algorithm.
39 // Conceptually, the contents of a loop are those nodes that are "between" the
40 // loop header and the backedges of the loop. Graphs in the soup of nodes ca
335 LoopInfo* loop = &loops_[loop_num - 1]; local
[all...] |
| osr.cc | 17 #include "src/compiler/loop-analysis.h"
48 LoopTree* loop_tree, LoopTree::Loop* osr_loop,
55 // Make a copy of the graph for each outer loop.
57 for (LoopTree::Loop* loop = osr_loop->parent(); loop; loop = loop->parent()) {
63 loop->depth(), loop_tree->HeaderNode(loop)->id()
286 LoopTree::Loop* loop = loop_tree->ContainingLoop(osr_loop); local
[all...] |
| /system/vold/ |
| VolumeManager.cpp | 54 #include "Loop.h"
143 if (Loop::lookupActive(idHash, buffer, len)) {
144 if (Loop::create(idHash, asecFileName, buffer, len)) {
145 SLOGE("ASEC loop device creation failed for %s (%s)", asecFileName, strerror(errno));
149 SLOGD("New loop device created at %s", buffer);
828 if (Loop::createImageFile(asecFileName, numImgSectors + 1)) {
841 if (Loop::create(idHash, asecFileName, loopDevice, sizeof(loopDevice))) {
842 SLOGE("ASEC loop device creation failed (%s)", strerror(errno));
856 Loop::destroyByDevice(loopDevice);
873 Loop::destroyByDevice(loopDevice)
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| AMDGPUTargetTransformInfo.h | 53 void getUnrollingPreferences(Loop *L, TTI::UnrollingPreferences &UP);
|
| SIAnnotateControlFlow.cpp | 42 static const char *const LoopIntrinsic = "llvm.SI.loop";
64 Constant *Loop;
86 Value *handleLoopCondition(Value *Cond, PHINode *Broken, llvm::Loop *L);
146 Loop = M.getOrInsertFunction(
209 /// \brief Recursively handle the condition leading to a loop
211 llvm::Loop *L) {
213 // Only search through PHI nodes which are inside the loop. If we try this
214 // with PHI nodes that are outside of the loop, we end up inserting new PHI
215 // nodes outside of the loop which depend on values defined inside the loop
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonTargetTransformInfo.h | 56 void getUnrollingPreferences(Loop *L, TTI::UnrollingPreferences &UP);
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXTargetTransformInfo.h | 62 void getUnrollingPreferences(Loop *L, TTI::UnrollingPreferences &UP);
|
| NVPTXTargetTransformInfo.cpp | 121 void NVPTXTTIImpl::getUnrollingPreferences(Loop *L,
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCLoopDataPrefetch.cpp | 1 //===-------- PPCLoopDataPrefetch.cpp - Loop Data Prefetching Pass --------===//
10 // This file implements a Loop Data Prefetching Pass.
14 #define DEBUG_TYPE "ppc-loop-data-prefetch"
44 PrefetchWrites("ppc-loop-prefetch-writes", cl::Hidden, cl::init(false),
50 PrefDist("ppc-loop-prefetch-distance", cl::Hidden, cl::init(300),
51 cl::desc("The loop prefetch distance"));
54 CacheLineSize("ppc-loop-prefetch-cache-line", cl::Hidden, cl::init(64),
55 cl::desc("The loop prefetch cache line size"));
83 bool runOnLoop(Loop *L);
95 INITIALIZE_PASS_BEGIN(PPCLoopDataPrefetch, "ppc-loop-data-prefetch"
[all...] |
| PPCLoopPreIncPrep.cpp | 1 //===------ PPCLoopPreIncPrep.cpp - Loop Pre-Inc. AM Prep. Pass -----------===//
11 // modes. Additional PHIs are created for loop induction variables used by
22 #define DEBUG_TYPE "ppc-loop-preinc-prep"
54 cl::desc("Potential PHI threshold for PPC preinc loop prep"));
81 bool runOnLoop(Loop *L);
82 void simplifyLoopLatch(Loop *L);
83 bool rotateLoop(Loop *L);
95 static const char *name = "Prepare loop for pre-inc. addressing modes";
162 bool PPCLoopPreIncPrep::runOnLoop(Loop *L) {
165 // Only prep. the inner-most loop
[all...] |
| /external/llvm/test/MC/AArch64/ |
| arm64-leaf-compact-unwind.s | 89 ; =>This Inner Loop Header: Depth=1
98 ; =>This Inner Loop Header: Depth=1
208 ; =>This Inner Loop Header: Depth=1
219 ; =>This Inner Loop Header: Depth=1
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnrollRuntime.cpp | 1 //===-- UnrollLoopRuntime.cpp - Runtime Loop unrolling utilities ----------===//
10 // This file implements some loop unrolling utilities for loops with run-time
19 // unrolled loop to execute the 'left over' iterations. Other strategies
20 // include generate a loop before or after the unrolled loop.
44 #define DEBUG_TYPE "loop-unroll"
49 /// Connect the unrolling prolog code to the original loop.
57 /// - Add a PHI operand to a PHI node at the loop exit block
58 /// for values that exit the prolog and go around the loop.
59 /// - Branch around the original loop if the trip count is les
[all...] |
| SimplifyIndVar.cpp | 12 // simplify a loop's induction variables based on ScalarEvolution.
45 /// other loop passes that preserve SCEV.
47 Loop *L;
57 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT,
59 : L(Loop), LI(LI), SE(SE), DT(DT), DeadInsts(Dead), Changed(false) {
168 const Loop *ICmpLoop = LI->getLoopFor(ICmp->getParent());
190 // Rewrite the comparison to a loop invariant comparison if it can be done
248 const Loop *ICmpLoop = LI->getLoopFor(Rem->getParent());
498 static bool isSimpleIVUser(Instruction *I, const Loop *L, ScalarEvolution *SE)
[all...] |
| BreakCriticalEdges.cpp | 59 // No loop canonicalization guarantees are broken by this pass.
79 /// createPHIsForSplitLoopExit - When a loop exit edge is split, LCSSA form
81 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
82 /// is the new loop exit block, and DestBB is the old loop exit, now the
208 // loop header) then NewBB dominates DestBB.
211 // If there is a PHI in the block, loop over predecessors with it, which is
261 if (Loop *TIL = LI->getLoopFor(TIBB)) {
262 // If one or the other blocks were not in a loop, the new block is not
264 if (Loop *DestLoop = LI->getLoopFor(DestBB))
[all...] |
| /external/skia/src/core/ |
| SkTaskGroup.cpp | 62 // Acquire pairs with decrement release here or in Loop.
104 fThreads.push(new SkThread(&ThreadPool::Loop, this));
147 static void Loop(void* arg) {
177 // We'd have it be an exact count but for the loop in Wait():
|
| /prebuilts/go/darwin-x86/src/os/signal/ |
| signal_plan9_test.go | 73 Loop:
78 break Loop
84 Loop:
88 break Loop
|
| /prebuilts/go/linux-x86/src/os/signal/ |
| signal_plan9_test.go | 73 Loop:
78 break Loop
84 Loop:
88 break Loop
|
| /external/v8/test/unittests/compiler/ |
| loop-peeling-unittest.cc | 9 #include "src/compiler/loop-peeling.h"
28 Node* loop; member in struct:v8::internal::compiler::While
74 LoopTree::Loop* loop = loop_tree->outer_loops()[0]; local
75 EXPECT_TRUE(LoopPeeler::CanPeel(loop_tree, loop));
76 return Peel(loop_tree, loop);
79 PeeledIteration* Peel(LoopTree* loop_tree, LoopTree::Loop* loop) {
80 EXPECT_TRUE(LoopPeeler::CanPeel(loop_tree, loop));
82 LoopPeeler::Peel(graph(), common(), loop_tree, loop, zone())
108 Node* loop = graph()->NewNode(common()->Loop(2), control, control); local
242 LoopTree::Loop* loop = loop_tree->ContainingLoop(inner.loop); local
279 LoopTree::Loop* loop = loop_tree->ContainingLoop(inner.loop); local
314 Node* loop = graph()->NewNode(common()->Loop(3), start(), start(), start()); local
348 Node* loop = graph()->NewNode(common()->Loop(3), start(), start(), start()); local
396 Node* loop = graph()->NewNode(common()->Loop(3), start(), start(), start()); local
456 Node* loop = graph()->NewNode(common()->Loop(2), start(), start()); local
466 LoopTree::Loop* loop = loop_tree->outer_loops()[0]; local
478 Node* loop = graph()->NewNode(common()->Loop(2), start(), start()); local
492 LoopTree::Loop* loop = loop_tree->outer_loops()[0]; local
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | 204 while (const Loop *L = SE.LI.getLoopFor(Builder.GetInsertBlock())) {
373 /// loop-aware. If some of the indices are loop-invariant while others
375 /// loop-invariant portions of the overall computation outside the loop.
380 /// pushing loop-invariant computation down into loops, so even if the
384 /// loop-invariant portions of expressions, after considering what
531 while (const Loop *L = SE.LI.getLoopFor(Builder.GetInsertBlock())) {
551 while (const Loop *L = SE.LI.getLoopFor(Builder.GetInsertBlock())) {
587 static const Loop *PickMostRelevantLoop(const Loop *A, const Loop *B
[all...] |
