| /external/llvm/include/llvm/Analysis/ |
| 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/Target/PowerPC/ |
| 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/llvm/lib/Transforms/Scalar/ |
| 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...] |
| 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:
61 #define DEBUG_TYPE "loop-idiom"
63 STATISTIC(NumMemSet, "Number of memset's formed from loop stores");
64 STATISTIC(NumMemCpy, "Number of memcpy's formed from loop load+stores");
69 Loop *CurLoop;
84 bool runOnLoop(Loop *L, LPPassManager &LPM) override
[all...] |
| SeparateConstOffsetFromGEP.cpp | 10 // Loop unrolling may create many similar GEPs for array accesses.
11 // e.g., a 2-level loop
149 // LICM (Loop Invariant Code Motion) can not hoist/sink a GEP of multiple
403 bool hasMoreThanOneUseInLoop(Value *v, Loop *L);
408 Loop *CurLoop);
[all...] |
| /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/Analysis/ |
| 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...] |
| CodeMetrics.cpp | 65 const Loop *L, AssumptionCache *AC,
74 // Filter out call sites outside of the loop so we don't to a function's
76 // values in the loop are likely due to @llvm.assume calls in the loop).
129 // basically just a form of loop peeling, and our metrics aren't useful
137 // We don't want inline asm to count as a call - that would prevent loop
|
| VectorUtils.cpp | 254 /// getGEPInductionOperand. However, if there is some other non-loop-invariant
256 Value *llvm::stripGetElementPtr(Value *Ptr, ScalarEvolution *SE, Loop *Lp) {
273 Value *llvm::getUniqueCastUse(Value *Ptr, Loop *Lp, Type *Ty) {
287 /// \brief Get the stride of a pointer access in a loop. Looks for symbolic
289 Value *llvm::getStrideFromPointer(Value *Ptr, ScalarEvolution *SE, Loop *Lp) {
347 // Look for the loop invariant symbolic value.
357 // return the value that is used in this loop so that we can replace it later.
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| AsmPrinter.cpp | [all...] |
| /external/llvm/lib/Fuzzer/ |
| FuzzerInternal.h | 105 void Loop();
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopVersioning.cpp | 1 //===- LoopVersioning.cpp - Utility to version a loop ---------------------===//
10 // This file defines a utility class to perform loop versioning. The versioned
11 // loop speculates that otherwise may-aliasing memory accesses don't overlap and
26 LoopVersioning::LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
87 // Create empty preheader for the loop (and after cloning for the
88 // non-versioned loop).
93 // Clone the loop including the preheader.
114 // loop-defined values used outside of the loop.
121 assert(PHIBlock && "No single successor to loop exit block")
[all...] |
| BasicBlockUtils.cpp | 38 // Can delete self loop.
42 // Loop through all of our successors and make sure they know that one
135 // Can't merge if there is PHI loop.
282 /// the loop info is updated.
291 // The new block lives in whichever loop the old one did. This preserves
294 if (Loop *L = LI->getLoopFor(Old))
324 // The rest of the logic is only relevant for updating the loop structures.
328 Loop *L = LI->getLoopFor(OldBB);
330 // If we need to preserve loop analyses, collect some information about how
338 // If we need to preserve LCSSA, determine if any of the preds is a loop
[all...] |
| CloneFunction.cpp | 48 // Loop over all instructions, and copy them over.
122 // Loop over all of the basic blocks in the function, cloning them as
153 // Loop over all of the instructions in the function, fixing up operand
159 // Loop over all instructions, fixing each one as we find it...
242 // Loop over the arguments, copying the names of the mapped arguments over...
331 // Loop over all instructions, and copy them over, DCE'ing as we go. This
332 // loop doesn't include the terminator.
340 // just break out of the loop (which would cause the terminator to be
404 // just break out of the loop (which would cause the terminator to be
528 // Loop over all of the basic blocks in the old function. If the block wa
[all...] |
| /external/v8/src/compiler/ |
| common-operator.h | 144 const Operator* Loop(int control_input_count);
|
| /external/v8/test/unittests/compiler/ |
| dead-code-elimination-unittest.cc | 237 // Loop
248 graph()->NewNode(common()->Loop(input_count), input_count, inputs));
262 graph()->NewNode(common()->Loop(input_count), input_count, inputs));
277 Node* const loop = graph()->NewNode(common()->Loop(2), c0, c1); local
279 common()->Phi(MachineRepresentation::kTagged, 2), v0, v1, loop);
280 Node* const ephi = graph()->NewNode(common()->EffectPhi(2), e0, e1, loop);
281 Node* const terminate = graph()->NewNode(common()->Terminate(), ephi, loop);
286 Reduction const r = Reduce(&editor, loop);
306 Node* const loop = graph()->NewNode(common()->Loop(4), c0, c1, c2, c3) local
[all...] |
| branch-elimination-unittest.cc | 172 Node* loop = graph()->NewNode(common()->Loop(1), outer_if_true); local
174 graph()->NewNode(common()->EffectPhi(1), graph()->start(), loop);
176 Node* inner_branch = graph()->NewNode(common()->Branch(), condition, loop);
183 loop->AppendInput(zone(), inner_if_false);
184 NodeProperties::ChangeOp(loop, common()->Loop(2));
190 graph()->NewNode(common()->Merge(2), loop, outer_if_false);
197 Node* terminate = graph()->NewNode(common()->Terminate(), effect, loop);
204 EXPECT_THAT(ret1, IsReturn(IsInt32Constant(2), effect, loop));
[all...] |
| /external/v8/test/mjsunit/compiler/ |
| osr-sar.js | 31 // Loop to force OSR.
|
| regress-serialized-slots.js | 32 for (var i = 0; i < 10000; i++) { // Loop to trigger optimization.
|
| to-fast-properties.js | 38 // Loop to hit OSR.
|
| /external/v8/test/mjsunit/regress/ |
| regress-1257.js | 42 // Loop for to hit OSR.
|
| /build/kati/ |
| worker.go | 292 Loop:
313 break Loop
322 break Loop
|
| /external/icu/icu4j/main/classes/charset/src/com/ibm/icu/charset/ |
| CharsetSCSU.java | 232 private boolean LabelLoop;// used to break the while loop
608 private static final int Loop=0;
635 private boolean LabelLoop;//used to break the while loop
661 int labelType = Loop; // set to Loop so that the code starts from loop:
668 case Loop:
669 labelType = loop(source, target, offsets);
763 private int loop(CharBuffer source, ByteBuffer target, IntBuffer offsets){ method in class:CharsetSCSU.CharsetEncoderSCSU
[all...] |
