| /external/llvm-project/llvm/test/Transforms/LoopUnroll/ |
| D | disable-loop-unrolling_forced.ll | 1 ; RUN: opt -disable-loop-unrolling -O1 -S < %s | FileCheck %s
3 ; Check loop unrolling metadata is honored despite automatic unrolling
|
| D | pr18861.ll | 58 ; The difference is that loop unrolling doesn't remove any LCSSA definition,
59 ; yet breaks LCSSA form for the outer loop. It happens because before unrolling
61 ; LCSSA definition for %x), but after unrolling it occurs out of the outer
|
| D | unroll-pragmas-disabled.ll | 3 ; Verify that the unrolling pass removes existing unroll count metadata
4 ; and adds a disable unrolling node after unrolling is complete.
43 ; after unrolling.
97 ; verifies that adding disable metadata to a loop after unrolling doesn't affect
|
| D | unroll-pragmas.ll | 5 ; Run loop unrolling twice to verify that loop unrolling metadata is properly
6 ; removed and further unrolling is disabled after the pass is run once.
12 ; the default unrolling heuristics. It serves as a control for the
62 ; the default unrolling heuristic. It serves as the control for the
143 ; Full unrolling is requested, but loop has a runtime trip count so
144 ; no unrolling should occur.
171 ; Loop has a runtime trip count. Runtime unrolling should occur and loop
239 ; Loop has very high loop count (1 million) and full unrolling was requested.
335 ; Loop has a runtime trip count. Runtime unrolling should occur and loop
|
| D | 2012-04-09-unroll-indirectbr.ll | 2 ; PR12513: Loop unrolling breaks with indirect branches.
3 ; If loop unrolling attempts to transform this loop, it replaces the
|
| D | full-unroll-heuristics.ll | 1 ; In this test we check how heuristics for complete unrolling work. We have
7 ; They control loop-unrolling according to the following rules:
16 ; In this particular test-case, complete unrolling will allow later
28 ; Check that these work when the unroller has partial unrolling enabled too.
|
| D | 2011-10-01-NoopTrunc.ll | 3 ; Verify that trunc i64 to i32 is considered free by loop unrolling
5 ; This should result in full unrolling this loop with size=7, TC=19.
|
| D | scevunroll.ll | 3 ; Unit tests for loop unrolling using ScalarEvolution to compute trip counts.
33 ; SCEV unrolling properly handles loops with multiple exits. In this
35 ; latch block. Canonical unrolling incorrectly unrolls it, but SCEV
36 ; unrolling does not.
177 ; iteration via the early exit. So loop unrolling cannot assume that
|
| D | 2011-08-09-IVSimplify.ll | 3 ; Test induction variable simplify after loop unrolling. It should
6 ; CHECK-NOT: while.body also ensures that loop unrolling (with SCEV)
|
| D | convergent.ll | 128 ; since remainder is forbidden for unrolling convergent loop.
129 ; ToDo: Forbidding remainder for unrolling convergent loop may be relaxed
151 ; since remainder is forbidden for unrolling convergent loop. Instead, the
153 ; ToDo: Forbidding remainder for unrolling convergent loop may be relaxed
|
| D | partial-unroll-const-bounds.ll | 4 ; Also check that the simple unroller doesn't allow the partial unrolling.
8 …e test checks that we choose a smaller, power-of-two, unroll count and do not give up on unrolling.
|
| D | high-cost-trip-count-computation.ll | 6 ;; counts when unrolling loops.
30 ;; Thus, it shouldn't prevent us from unrolling the loop.
|
| /external/eigen/test/ |
| D | vectorization_logic.cpp | 30 bool test_assign(const Dst&, const Src&, int traversal, int unrolling) in test_assign() argument
34 if(unrolling==InnerUnrolling+CompleteUnrolling) in test_assign()
37 res = res && int(traits::Unrolling)==unrolling; in test_assign()
47 std::cerr << " Expected Unrolling == " << demangle_unrolling(unrolling) in test_assign()
54 bool test_assign(int traversal, int unrolling) in test_assign() argument
57 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_assign()
67 std::cerr << " Expected Unrolling == " << demangle_unrolling(unrolling) in test_assign()
74 bool test_redux(const Xpr&, int traversal, int unrolling) in test_redux() argument
79 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_redux()
88 std::cerr << " Expected Unrolling == " << demangle_unrolling(unrolling) in test_redux()
|
| /external/llvm-project/llvm/docs/ |
| D | TransformMetadata.rst | 53 Some attributes describe code transformations (unrolling, vectorizing,
91 specified at the same time, unrolling may occur either before or after
182 is present. Unrolling can be full unrolling, partial unrolling of a loop
183 with constant trip count or runtime unrolling of a loop with a trip
187 partial/runtime unrolling, the original loop of
287 as well as an additional inner loop unrolling. If no follow-up
394 - SimpleLoopUnroll/LoopFullUnroll (only performs full unrolling)
399 - LoopUnroll (partial and runtime unrolling)
404 - SimpleLoopUnroll/LoopFullUnroll (only performs full unrolling)
406 - LoopUnroll (partial and runtime unrolling)
[all …]
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | pr18861.ll | 58 ; The difference is that loop unrolling doesn't remove any LCSSA definition,
59 ; yet breaks LCSSA form for the outer loop. It happens because before unrolling
61 ; LCSSA definition for %x), but after unrolling it occurs out of the outer
|
| D | unroll-pragmas-disabled.ll | 3 ; Verify that the unrolling pass removes existing unroll count metadata
4 ; and adds a disable unrolling node after unrolling is complete.
43 ; after unrolling.
97 ; verifies that adding disable metadata to a loop after unrolling doesn't affect
|
| D | unroll-pragmas.ll | 4 ; Run loop unrolling twice to verify that loop unrolling metadata is properly
5 ; removed and further unrolling is disabled after the pass is run once.
11 ; the default unrolling heuristics. It serves as a control for the
61 ; the default unrolling heuristic. It serves as the control for the
165 ; Full unrolling is requested, but loop has a runtime trip count so
166 ; no unrolling should occur.
193 ; Loop has a runtime trip count. Runtime unrolling should occur and loop
257 ; Loop has very high loop count (1 million) and full unrolling was requested.
350 ; Loop has a runtime trip count. Runtime unrolling should occur and loop
|
| D | 2012-04-09-unroll-indirectbr.ll | 2 ; PR12513: Loop unrolling breaks with indirect branches.
3 ; If loop unrolling attempts to transform this loop, it replaces the
|
| D | 2011-10-01-NoopTrunc.ll | 3 ; Verify that trunc i64 to i32 is considered free by loop unrolling
5 ; This should result in full unrolling this loop with size=7, TC=19.
|
| D | scevunroll.ll | 3 ; Unit tests for loop unrolling using ScalarEvolution to compute trip counts.
33 ; SCEV unrolling properly handles loops with multiple exits. In this
35 ; latch block. Canonical unrolling incorrectly unrolls it, but SCEV
36 ; unrolling does not.
179 ; iteration via the early exit. So loop unrolling cannot assume that
|
| D | 2011-08-09-IVSimplify.ll | 3 ; Test induction variable simplify after loop unrolling. It should
6 ; CHECK-NOT: while.body also ensures that loop unrolling (with SCEV)
|
| D | full-unroll-heuristics.ll | 1 ; In this test we check how heuristics for complete unrolling work. We have
7 ; They control loop-unrolling according to the following rules:
16 ; In this particular test-case, complete unrolling will allow later
|
| D | high-cost-trip-count-computation.ll | 6 ;; counts when unrolling loops.
30 ;; Thus, it shouldn't prevent us from unrolling the loop.
|
| /external/llvm-project/llvm/test/Transforms/LoopVectorize/X86/ |
| D | already-vectorized.ll | 1 ; RUN: opt < %s -disable-loop-unrolling -debug-only=loop-vectorize -passes='default<O3>' -S 2>&1 | …
2 ; RUN: opt < %s -disable-loop-unrolling -debug-only=loop-vectorize -O3 -S 2>&1 | FileCheck %s
|
| /external/llvm/test/Other/ |
| D | pass-pipelines.ll | 76 ; After vectorization we do partial unrolling.
80 ; After vectorization and unrolling we try to do any cleanup of inserted code,
82 ; the runtime unrolling though.
|