| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | 183 while (const Loop *L = SE.LI->getLoopFor(Builder.GetInsertBlock())) {
377 /// loop-aware. If some of the indices are loop-invariant while others
379 /// loop-invariant portions of the overall computation outside the loop.
384 /// pushing loop-invariant computation down into loops, so even if the
388 /// loop-invariant portions of expressions, after considering what
554 while (const Loop *L = SE.LI->getLoopFor(Builder.GetInsertBlock())) {
574 while (const Loop *L = SE.LI->getLoopFor(Builder.GetInsertBlock())) {
615 static const Loop *PickMostRelevantLoop(const Loop *A, const Loop *B
[all...] |
| DependenceAnalysis.cpp | 219 // variable associated with the loop at this level.
258 // variable associated with the loop at this level.
265 // Returns true if peeling the first iteration from this loop
273 // Returns true if peeling the last iteration from this loop
281 // Returns true if splitting this loop will break the dependence.
342 // Returns the loop associated with this constraint.
343 const Loop *DependenceAnalysis::Constraint::getAssociatedLoop() const {
352 const Loop *CurLoop) {
363 const Loop *CurLoop) {
373 const Loop *CurLoop)
[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.
|
| Delinearization.cpp | 96 for (Loop *L = LI->getLoopFor(BB); L != nullptr; L = L->getParentLoop()) {
114 O << "In Loop with Header: " << L->getHeader()->getName() << "\n";
|
| ScalarEvolution.cpp | 33 // types, computes the execution count of a loop, etc.
49 // Symbolic Evaluation of Chains of Recurrences for Loop Optimization
96 "Number of loops with predictable loop counts");
98 "Number of loops without predictable loop counts");
106 "derived loop"),
512 // For instructions, compare their loop depth, and their operand
517 // Compare loop depths.
553 // Compare addrec loop depths.
554 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop();
[all...] |
| /external/chromium_org/third_party/webrtc/modules/audio_processing/aecm/ |
| aecm_core_neon.S | 42 mov r12, #(PART_LEN / 8) @ Loop counter, unrolled by 8.
101 mov r12, #(PART_LEN / 8) @ Loop counter, unrolled by 8.
130 mov r3, #(PART_LEN / 8) @ Loop counter, unrolled by 8.
|
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 41 static const char *const LoopIntrinsic = "llvm.SI.loop";
63 Constant *Loop;
142 Loop = M.getOrInsertFunction(
205 /// \brief Recursively handle the condition leading to a loop
257 llvm_unreachable("Unhandled loop condition!");
262 /// \brief Handle a back edge (loop)
278 Term->setCondition(CallInst::Create(Loop, Arg, "", Term));
|
| /external/chromium_org/third_party/markdown/extensions/ |
| headerid.py | 142 """ Loop through all children and return text only.
|
| /external/lldb/tools/lldb-perf/lib/ |
| TestCase.h | 109 Loop();
|
| TestCase.cpp | 142 TestCase::Loop ()
325 test.Loop();
|
| /external/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 53 Loop, ///< Instr is a loop (backwards branch).
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 1 //===-- UnrollLoop.cpp - Loop unrolling utilities -------------------------===//
10 // This file implements some loop unrolling utilities. It does not define any
11 // actual pass or policy, but provides a single function to perform loop
39 #define DEBUG_TYPE "loop-unroll"
104 // ScalarEvolution holds references to loop exit blocks.
107 if (Loop *L = LI->getLoopFor(BB))
122 /// Unroll the given loop by Count. The loop must be in LCSSA form. Returns true
123 /// if unrolling was successful, or false if the loop was unmodified. Unrolling
124 /// can only fail when the loop's latch block is not terminated by a conditiona
[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.
99 #define LV_NAME "loop-vectorize"
179 "small-loop-cost", cl::init(20), cl::Hidden,
180 cl::desc("The cost of a loop that is considered 'small' by the unroller."));
183 "loop-vectorize-with-block-frequency", cl::init(false), cl::Hidden,
193 /// The number of stores in a loop that are allowed to need predication
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/api/processes/show_tabs/ |
| popup.js | 27 // Loop over all windows and their tabs
|
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| osr-sar.js | 31 // Loop to force OSR.
|
| osr-uint32.js | 28 // Loop to force OSR.
|
| /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/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 &LPM) override;
57 INITIALIZE_PASS_BEGIN(LoopExtractor, "loop-extract",
62 INITIALIZE_PASS_END(LoopExtractor, "loop-extract",
74 INITIALIZE_PASS(SingleLoopExtractor, "loop-extract-single",
75 "Extract at most one loop into a new function", false, false
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopIdiomRecognize.cpp | 1 //===-- LoopIdiomRecognize.cpp - Loop idiom recognition -------------------===//
11 // non-loop form. In cases that this kicks in, it can be a significant
18 // Future loop memory idioms to recognize:
27 // would be good to enhance isel to emit a loop for ctpop in this case.
30 // the loop. This would handle things like:
63 #define DEBUG_TYPE "loop-idiom"
65 STATISTIC(NumMemSet, "Number of memset's formed from loop stores");
66 STATISTIC(NumMemCpy, "Number of memcpy's formed from loop load+stores");
72 /// This class defines some utility functions for loop idiom recognization.
83 /// Derive the precondition block (i.e the block that guards the loop
[all...] |
| Sink.cpp | 128 // unreachable loop there may be nowhere to stop.
208 // Don't sink instructions into a loop.
209 Loop *succ = LI->getLoopFor(SuccToSinkTo);
210 Loop *cur = LI->getLoopFor(Inst->getParent());
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 281 /// count of the specified loop. This is the primary focus of the
286 /// All operands of an AddRec are required to be loop invariant.
291 const Loop *L;
294 const SCEV *const *O, size_t N, const Loop *l)
299 const Loop *getLoop() const { return L; }
313 /// an expressions A+B*x where A and B are loop invariant values.
321 /// represents an expressions A+B*x+C*x^2 where A, B and C are loop
340 /// getNumIterationsInRange - Return the number of iterations of this loop
350 /// this expression one iteration of the loop ahead.
381 /// Remainder is the subscript of the innermost dimension. Loop over al
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 15 // normalizes induction variables, and the Loop Strength Reduction pass
106 bool convertToCTRLoop(Loop *L);
182 Loop *L = *I;
247 // control can't then return to inside the loop unless there is also
398 bool PPCCTRLoops::convertToCTRLoop(Loop *L) {
407 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I) {
411 // If a nested loop has been converted, then we can't convert this loop.
426 // want to use the counter register if the loop contains calls.
427 for (Loop::block_iterator I = L->block_begin(), IE = L->block_end()
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 291 // This means that a loop header can never appear above the center block of a
292 // trace, except as the trace head. Below the center block, loop exiting edges
295 // Return true if an edge from the From loop to the To loop is leaving a loop.
412 // set abstraction that confines the search to the current loop, and doesn't
428 // it is limited to the current loop and doesn't traverse the loop back edges.
454 // that MachineLoopInfo didn't recognize as a natural loop.
464 // Set up loop bounds for the backwards post-order traversal
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| AsmPrinter.cpp | [all...] |
