| /external/llvm/test/Transforms/IndVarSimplify/ |
| loop_evaluate8.ll | 3 ; This loop has backedge-taken-count zero. Indvars shouldn't expand any
|
| lftr-reuse.ll | 152 ; Verify that SCEV can still compute a backedge count from the sign
187 ; Exercise backedge taken count verification with a never-taken loop.
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 140 // loop, thus the edge is a backedge, continue and do not check if the
143 printEdgeError(edge, "but is backedge, continuing");
147 // no backedge) return, this block is currently non estimatable.
178 // There is at least one incoming backedge that will bring us this flow later
|
| ScalarEvolution.cpp | [all...] |
| /external/swiftshader/third_party/LLVM/test/Analysis/ScalarEvolution/ |
| SolveQuadraticEquation.ll | 34 ; CHECK-NEXT: backedge-taken count is 100
|
| nsw.ll | 102 ; CHECK: Loop %for.body.i.i: backedge-taken count is ((-4 + (-1 * %begin) + %end) /u 4)
103 ; CHECK: Loop %for.body.i.i: max backedge-taken count is ((-4 + (-1 * %begin) + %end) /u 4)
|
| trip-count3.ll | 2 ; RUN: | grep {Loop %bb3\\.i: Unpredictable backedge-taken count\\.}
|
| /external/swiftshader/third_party/LLVM/test/Transforms/IndVarSimplify/ |
| loop_evaluate8.ll | 3 ; This loop has backedge-taken-count zero. Indvars shouldn't expand any
|
| lftr-reuse.ll | 154 ; Verify that SCEV can still compute a backedge count from the sign
186 ; Exercise backedge taken count verification with a never-taken loop.
|
| /external/llvm/docs/ |
| BlockFrequencyTerminology.rst | 92 As mass is distributed through the loop's DAG, the (otherwise ignored) backedge
93 mass is collected. This backedge mass is used to compute the exit frequency,
|
| /external/llvm/test/CodeGen/ARM/ |
| 2008-04-10-ScavengerAssert.ll | 141 bb151.i: ; preds = %bb226.backedge.i, %bb151.i.preheader
142 %i.154.i = phi i32 [ %tmp15747.i, %bb226.backedge.i ], [ 0, %bb151.i.preheader ] ; <i32> [#uses=2]
144 br i1 false, label %bb155.i, label %bb226.backedge.i
145 bb226.backedge.i: ; preds = %cond_next215.i, %bb151.i
168 br i1 %exitcond99.i87, label %bb226.backedge.i, label %bb155.i
169 amp_scalefac_bands.exit: ; preds = %bb226.backedge.i
|
| code-placement.ll | 2 ; PHI elimination shouldn't break backedge.
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/ARM/ |
| 2008-04-10-ScavengerAssert.ll | 141 bb151.i: ; preds = %bb226.backedge.i, %bb151.i.preheader
142 %i.154.i = phi i32 [ %tmp15747.i, %bb226.backedge.i ], [ 0, %bb151.i.preheader ] ; <i32> [#uses=2]
144 br i1 false, label %bb155.i, label %bb226.backedge.i
145 bb226.backedge.i: ; preds = %cond_next215.i, %bb151.i
168 br i1 %exitcond99.i87, label %bb226.backedge.i, label %bb155.i
169 amp_scalefac_bands.exit: ; preds = %bb226.backedge.i
|
| code-placement.ll | 2 ; PHI elimination shouldn't break backedge.
|
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| validate_cfg.cpp | 93 /// the node in pre order, post order. It also calls the backedge function
103 /// @param[in] backedge A function that will be called when a backedge is
113 function<void(cbb_ptr, cbb_ptr)> backedge) {
134 backedge(top.block, child);
241 /// Update the continue construct's exit blocks once the backedge blocks are
|
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 388 br label %SKIP_COMMENTS.i.backedge
390 SKIP_COMMENTS.i: ; preds = %SKIP_COMMENTS.i.backedge, %bb128
403 br i1 false, label %bb4.i153, label %SKIP_COMMENTS.i.backedge
405 SKIP_COMMENTS.i.backedge: ; preds = %bb3.i152, %SKIP_COMMENTS.i.loopexit
510 READ_LITERAL.i.outer: ; preds = %READ_LITERAL.i.outer.backedge, %bb28.i188
514 br label %READ_LITERAL.i.backedge
516 READ_LITERAL.i: ; preds = %READ_LITERAL.i.backedge, %READ_LITERAL.i.outer
541 br i1 false, label %bb40.i200, label %READ_LITERAL.i.backedge
543 READ_LITERAL.i.backedge: ; preds = %bb39.i199, %READ_LITERAL.i.loopexit
595 br label %READ_LITERAL.i.outer.backedge
[all...] |
| /external/swiftshader/third_party/LLVM/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 388 br label %SKIP_COMMENTS.i.backedge
390 SKIP_COMMENTS.i: ; preds = %SKIP_COMMENTS.i.backedge, %bb128
403 br i1 false, label %bb4.i153, label %SKIP_COMMENTS.i.backedge
405 SKIP_COMMENTS.i.backedge: ; preds = %bb3.i152, %SKIP_COMMENTS.i.loopexit
510 READ_LITERAL.i.outer: ; preds = %READ_LITERAL.i.outer.backedge, %bb28.i188
514 br label %READ_LITERAL.i.backedge
516 READ_LITERAL.i: ; preds = %READ_LITERAL.i.backedge, %READ_LITERAL.i.outer
541 br i1 false, label %bb40.i200, label %READ_LITERAL.i.backedge
543 READ_LITERAL.i.backedge: ; preds = %bb39.i199, %READ_LITERAL.i.loopexit
595 br label %READ_LITERAL.i.outer.backedge
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 141 /// isBackedge - Return if edge Src -> Dst is a backedge.
246 assert(N <= EntryFreq && "Backedge frequency must be <= EntryFreq!");
|
| PathNumbering.h | 132 enum EdgeType { NORMAL, BACKEDGE, SPLITEDGE,
298 // Adds a backedge with its phony edges. Updates the DAG state.
|
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 486 BlockT *Backedge = *PI;
489 if (DomTree.dominates(Header, Backedge)
490 && DomTree.isReachableFromEntry(Backedge)) {
491 Backedges.push_back(Backedge);
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| SolveQuadraticEquation.ll | 33 ; CHECK-NEXT: backedge-taken count is 100
|
| /external/llvm/test/Transforms/PlaceSafepoints/ |
| finite-loops.ll | 1 ; Tests to ensure that we are not placing backedge safepoints in
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2008-05-16-PHIBlockMerge.ll | 77 ; This adds a backedge, so the %b phi node gets a third branch and is
|
| /external/swiftshader/third_party/LLVM/test/Transforms/SimplifyCFG/ |
| 2008-05-16-PHIBlockMerge.ll | 77 ; This adds a backedge, so the %b phi node gets a third branch and is
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| loopreschedchecks.go | 9 // an edgeMemCtr records a backedge, together with the memory and
10 // counter phi functions at the target of the backedge that must
11 // be updated when a rescheduling check replaces the backedge.
295 // backedge at index i.
|
