| /external/llvm/test/Transforms/LoopSimplify/ |
| indirectbr-backedge.ll | 3 ; LoopSimplify shouldn't split loop backedges that use indirectbr.
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| unsimplified-loop.ll | 3 ; This loop has no preheader, multiple backedges, etc., but ScalarEvolution
|
| /external/llvm/include/llvm/Analysis/ |
| PathNumbering.h | 11 // graph (DAG) [Ball96]. For a CFG backedges are removed and replaced by phony
76 // backedges.
82 // backedges.
189 // For backedges and split-edges, the phony edge which is linked to the
193 // For backedges and split-edges, the phony edge which is linked to the
251 // All backedges in the DAG.
|
| BlockFrequencyImpl.h | 39 /// algorithm can find "backedges" by itself.
216 // Compute loop's cyclic probability using backedges probabilities.
228 // The cyclic probability is freq(BackEdges) / freq(Head), where freq(Head)
229 // only counts edges entering the loop, not the loop backedges.
|
| LoopInfoImpl.h | 361 /// Discover a subloop with the specified backedges such that: All blocks within
365 static void discoverAndMapSubloop(LoopT *L, ArrayRef<BlockT*> Backedges,
374 std::vector<BlockT *> ReverseCFGWorklist(Backedges.begin(), Backedges.end());
527 SmallVector<BlockT *, 4> Backedges;
537 // If Header dominates predBB, this is a new loop. Collect the backedges.
540 Backedges.push_back(Backedge);
544 if (!Backedges.empty()) {
546 discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this, DomTree);
|
| CFG.h | 30 /// Analyze the specified function to find all of the loop backedges in the
|
| /external/llvm/lib/Analysis/ |
| PathNumbering.cpp | 11 // graph (DAG) [Ball96]. For a CFG backedges are removed and replaced by phony
80 // backedges.
91 // backedges.
97 // backedges.
108 // backedges.
|
| BranchProbabilityInfo.cpp | 304 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
311 SmallVector<unsigned, 8> BackEdges;
319 BackEdges.push_back(I.getSuccessorIndex());
324 if (uint32_t numBackEdges = BackEdges.size()) {
329 for (SmallVectorImpl<unsigned>::iterator EI = BackEdges.begin(),
330 EE = BackEdges.end(); EI != EE; ++EI) {
|
| CFG.cpp | 24 /// loop backedges in the function and return them. This is a relatively cheap
|
| PathProfileInfo.cpp | 127 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges
|
| LoopInfo.cpp | 152 if (PI != pred_end(H)) return 0; // multiple backedges?
434 /// backedges has just been removed.
|
| ProfileInfo.cpp | 888 // Determine backedges, set them to zero.
[all...] |
| /external/llvm/test/Analysis/BlockFrequencyInfo/ |
| basic.ll | 9 ; Loop backedges are weighted and thus their bodies have a greater frequency.
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 245 // preheader and from multiple backedges), we must adjust the loop.
249 // this for loops with a giant number of backedges, just factor them into a
262 // insert a new block that all backedges target, then make it jump to the
530 /// SeparateNestedLoop - If this loop has multiple backedges, try to pull one of
650 /// backedges to target a new basic block and have that block branch to the loop
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| PathProfiling.cpp | 11 // profiling converts the CFG into a DAG by replacing backedges with edges
26 // Ball-Larus DAG - A CFG with an entry node, an exit node, and backedges
339 // backedges. Dag must have initializations, path number increments, and
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 193 // FIXME: Split critical edges if not backedges.
|
| JumpThreading.cpp | 281 /// by finding targets of backedges in the CFG.
286 /// It is also almost always profitable to thread backedges from within the loop
287 /// to exit blocks, and is often profitable to thread backedges to other blocks
[all...] |
| LoopIdiomRecognize.cpp | 322 // Give up if the loop has multiple blocks or multiple backedges.
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineBlockPlacement.cpp | [all...] |
| MachineSink.cpp | 333 // Check for backedges of more "complex" loops.
|
| PHIElimination.cpp | 563 // Avoid splitting backedges of loops. It would introduce small
|
| MachineTraceMetrics.cpp | 445 // Don't follow backedges, don't leave FromLoop when going upwards.
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 433 // For this to be true, we must dominate all blocks with backedges. Such
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 670 /// ignored backedges.
673 /// ignored backedges.
785 // loop backedge. Loop backedges are special.
817 // loop backedge. Loop backedges are special.
[all...] |
| /external/clang/lib/Analysis/ |
| UninitializedValues.cpp | 242 // updates along backedges that we want propagated as quickly as possible.
|
