| /external/clang/test/Parser/ |
| D | pragma-loop.cpp | 8 #pragma clang loop vectorize_width(V) interleave_count(I) in test_nontype_template_param()
13 #pragma clang loop vectorize_width(V + 4) interleave_count(I + 4) in test_nontype_template_param()
21 …/* expected-error {{invalid value '-1'; must be positive}} */ #pragma clang loop vectorize_width(V) in test_nontype_template_vectorize()
26 …/* expected-error {{invalid value '0'; must be positive}} */ #pragma clang loop vectorize_width(V … in test_nontype_template_vectorize()
34 …/* expected-error {{invalid value '-1'; must be positive}} */ #pragma clang loop interleave_count(… in test_nontype_template_interleave()
39 …/* expected-error {{invalid value '0'; must be positive}} */ #pragma clang loop interleave_count(2… in test_nontype_template_interleave()
47 …nvalid argument of type 'char'; expected an integer type}} */ #pragma clang loop vectorize_width(V) in test_nontype_template_char()
55 …nvalid argument of type 'bool'; expected an integer type}} */ #pragma clang loop vectorize_width(V) in test_nontype_template_bool()
63 …/* expected-error {{use of undeclared identifier 'Vec'}} */ #pragma clang loop vectorize_width(Vec… in test_nontype_template_badarg()
64 …/* expected-error {{use of undeclared identifier 'Int'}} */ #pragma clang loop vectorize_width(V) … in test_nontype_template_badarg()
[all …]
|
| D | pragma-loop-safety.cpp | 9 #pragma clang loop vectorize(assume_safety) in test()
10 #pragma clang loop interleave(assume_safety) in test()
15 /* expected-error {{expected ')'}} */ #pragma clang loop vectorize(assume_safety in test()
16 /* expected-error {{expected ')'}} */ #pragma clang loop interleave(assume_safety in test()
18 …valid argument; expected 'enable', 'full' or 'disable'}} */ #pragma clang loop unroll(assume_safet… in test()
19 /* expected-error {{invalid argument; expected 'enable' or 'disable'}} */ #pragma clang loop distri… in test()
21 …ument; expected 'enable', 'assume_safety' or 'disable'}} */ #pragma clang loop vectorize(badidenti… in test()
22 …ument; expected 'enable', 'assume_safety' or 'disable'}} */ #pragma clang loop interleave(badident… in test()
23 …valid argument; expected 'enable', 'full' or 'disable'}} */ #pragma clang loop unroll(badidentifie… in test()
28 …ctives 'vectorize(assume_safety)' and 'vectorize(enable)'}} */ #pragma clang loop vectorize(enable) in test()
[all …]
|
| /external/llvm/test/Other/ |
| D | loop-pass-ordering.ll | 2 ; RUN: -passes='no-op-loop' %s 2>&1 \
7 ; loop.0 loop.1
9 ; loop.0.0 loop.0.1 loop.1.0
11 ; CHECK: Running pass: NoOpLoopPass on loop.1.0
12 ; CHECK: Running pass: NoOpLoopPass on loop.1
13 ; CHECK: Running pass: NoOpLoopPass on loop.0.0
14 ; CHECK: Running pass: NoOpLoopPass on loop.0.1
15 ; CHECK: Running pass: NoOpLoopPass on loop.0
18 br label %loop.0
19 loop.0:
[all …]
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | trip-count9.ll | 11 ; CHECK: Determining loop execution counts for: @foo
12 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n)
13 ; CHECK: Loop %loop: max backedge-taken count is 6
17 br i1 %s, label %loop, label %exit
18 loop:
19 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
22 br i1 %t, label %loop, label %exit
27 ; CHECK: Determining loop execution counts for: @step2
28 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
29 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
[all …]
|
| D | increasing-or-decreasing-iv.ll | 8 br label %loop
10 loop:
11 %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
12 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
13 ; CHECK: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
14 ; CHECK-NEXT: --> {%start,+,%step}<%loop> U: [0,128) S: [0,128)
16 %loop.iv.inc = add i32 %loop.iv, 1
17 %be.cond = icmp ne i32 %loop.iv.inc, 128
18 br i1 %be.cond, label %loop, label %leave
29 br label %loop
[all …]
|
| D | shift-op.ll | 5 ; CHECK: Loop %loop: max backedge-taken count is 32
7 br label %loop
9 loop:
10 %iv = phi i32 [ %init, %entry ], [ %iv.shift, %loop ]
13 br i1 %exit.cond, label %leave, label %loop
21 ; CHECK: Loop %loop: max backedge-taken count is 32
23 br label %loop
25 loop:
26 %iv = phi i32 [ %init, %entry ], [ %iv.shift, %loop ]
29 br i1 %exit.cond, label %leave, label %loop
[all …]
|
| D | trip-count13.ll | 7 br label %loop
9 loop:
10 %iv = phi i8 [ %start, %entry ], [ %iv.inc, %loop ]
13 br i1 %iv.cmp, label %loop, label %leave
15 ; CHECK-LABEL: Determining loop execution counts for: @u_0
16 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) umax %rhs))
17 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
27 br label %loop
29 loop:
30 %iv = phi i8 [ %start, %entry ], [ %iv.inc, %loop ]
[all …]
|
| D | trip-count10.ll | 5 ; CHECK: Determining loop execution counts for: @a
6 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
7 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
9 ; CHECK: Determining loop execution counts for: @b
10 ; CHECK: Loop %loop: backedge-taken count is false
11 ; CHECK: Loop %loop: max backedge-taken count is false
13 ; CHECK: Determining loop execution counts for: @c
14 ; CHECK: Loop %loop: backedge-taken count is false
15 ; CHECK: Loop %loop: max backedge-taken count is false
17 ; CHECK: Determining loop execution counts for: @d
[all …]
|
| D | unsimplified-loop.ll | 3 ; This loop has no preheader, multiple backedges, etc., but ScalarEvolution
6 ; CHECK: %i = phi i64 [ 5, %entry ], [ 5, %alt ], [ %i.next, %loop.a ], [ %i.next, %loop.b ]
7 ; CHECK-NEXT: --> {5,+,1}<%loop>
11 br i1 %p, label %loop, label %alt
14 br i1 %s, label %loop, label %exit
16 loop:
17 %i = phi i64 [ 5, %entry ], [ 5, %alt ], [ %i.next, %loop.a ], [ %i.next, %loop.b ]
19 br i1 %q, label %loop.a, label %loop.b
21 loop.a:
22 br label %loop
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Analysis/ScalarEvolution/ |
| D | trip-count9.ll | 11 ; CHECK: Determining loop execution counts for: @foo
12 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n)
13 ; CHECK: Loop %loop: max backedge-taken count is 6
17 br i1 %s, label %loop, label %exit
18 loop:
19 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
22 br i1 %t, label %loop, label %exit
27 ; CHECK: Determining loop execution counts for: @step2
28 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
29 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
[all …]
|
| D | trip-count10.ll | 5 ; CHECK: Determining loop execution counts for: @a
6 ; CHECK: Loop %loop: Unpredictable backedge-taken count.
7 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
9 ; CHECK: Determining loop execution counts for: @b
10 ; CHECK: Loop %loop: backedge-taken count is false
11 ; CHECK: Loop %loop: max backedge-taken count is false
13 ; CHECK: Determining loop execution counts for: @c
14 ; CHECK: Loop %loop: backedge-taken count is false
15 ; CHECK: Loop %loop: max backedge-taken count is false
17 ; CHECK: Determining loop execution counts for: @d
[all …]
|
| D | unsimplified-loop.ll | 3 ; This loop has no preheader, multiple backedges, etc., but ScalarEvolution
6 ; CHECK: %i = phi i64 [ 5, %entry ], [ 5, %alt ], [ %i.next, %loop.a ], [ %i.next, %loop.b ]
7 ; CHECK-NEXT: --> {5,+,1}<%loop>
11 br i1 %p, label %loop, label %alt
14 br i1 %s, label %loop, label %exit
16 loop:
17 %i = phi i64 [ 5, %entry ], [ 5, %alt ], [ %i.next, %loop.a ], [ %i.next, %loop.b ]
19 br i1 %q, label %loop.a, label %loop.b
21 loop.a:
22 br label %loop
[all …]
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| D | radeon_emulate_loops.c | 60 struct loop_info * loop) in loop_max_possible_iterations() argument
63 unsigned int loop_i = (loop->EndLoop->IP - loop->BeginLoop->IP) - 1; in loop_max_possible_iterations()
68 static void unroll_loop(struct radeon_compiler * c, struct loop_info * loop, in unroll_loop() argument
73 struct rc_instruction * first = loop->BeginLoop->Next; in unroll_loop()
74 struct rc_instruction * last = loop->EndLoop->Prev; in unroll_loop()
76 rc_remove_instruction(loop->BeginLoop); in unroll_loop()
77 rc_remove_instruction(loop->EndLoop); in unroll_loop()
187 static int try_unroll_loop(struct radeon_compiler * c, struct loop_info * loop) in try_unroll_loop() argument
200 if(rc_src_reg_is_immediate(c, loop->Cond->U.I.SrcReg[0].File, in try_unroll_loop()
201 loop->Cond->U.I.SrcReg[0].Index)){ in try_unroll_loop()
[all …]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | sharpen-range.ll | 2 ; RUN: opt -lcssa -loop-simplify -S < %s | opt -S -passes='require<targetir>,require<scalar-evoluti…
4 ;; Check if llvm can narrow !range metadata based on loop entry
14 br i1 %entry.pred, label %abort, label %loop.preheader
16 loop.preheader:
17 br label %loop
19 loop:
20 ; CHECK: loop
21 %idx = phi i32 [ %idx.inc, %loop.next ], [ 0, %loop.preheader ]
23 br i1 %oob.pred, label %loop.next, label %oob
24 ; CHECK: br i1 true, label %loop.next, label %oob
[all …]
|
| D | tripcount_compute.ll | 4 ; loops. If the trip count of the loop is computable, then we will know what
5 ; the exit value of the loop will be for some value, allowing us to substitute
6 ; it directly into users outside of the loop, making the loop dead.
13 br label %loop
15 loop: ; preds = %loop, %entry
16 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
19 br i1 %c, label %loop, label %loopexit
21 loopexit: ; preds = %loop
30 br label %loop
32 loop: ; preds = %loop, %entry
[all …]
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | full-unroll-heuristics-2.ll | 1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=1000 -unroll-threshold=10 -…
8 ; it as a constant, so we shouldn't unroll the loop.
13 br label %loop
15 loop: ; preds = %loop, %entry
16 %iv = phi i64 [ 0, %entry ], [ %inc, %loop ]
17 %r = phi i32 [ 0, %entry ], [ %add, %loop ]
26 br i1 %exitcond86.i, label %loop.end, label %loop
28 loop.end: ; preds = %loop
29 %r.lcssa = phi i32 [ %r, %loop ]
34 ; shouldn't unroll the loop.
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Transforms/IndVarSimplify/ |
| D | tripcount_compute.ll | 4 ; loops. If the trip count of the loop is computable, then we will know what
5 ; the exit value of the loop will be for some value, allowing us to substitute
6 ; it directly into users outside of the loop, making the loop dead.
13 br label %loop
15 loop: ; preds = %loop, %entry
16 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
19 br i1 %c, label %loop, label %loopexit
21 loopexit: ; preds = %loop
30 br label %loop
32 loop: ; preds = %loop, %entry
[all …]
|
| /external/mesa3d/src/compiler/nir/ |
| D | nir_opt_loop_unroll.c | 40 loop_prepare_for_unroll(nir_loop *loop) in loop_prepare_for_unroll() argument
42 nir_convert_loop_to_lcssa(loop); in loop_prepare_for_unroll()
44 nir_lower_phis_to_regs_block(nir_loop_first_block(loop)); in loop_prepare_for_unroll()
47 nir_cf_node_as_block(nir_cf_node_next(&loop->cf_node)); in loop_prepare_for_unroll()
51 nir_instr *last_instr = nir_block_last_instr(nir_loop_last_block(loop)); in loop_prepare_for_unroll()
87 simple_unroll(nir_loop *loop) in simple_unroll() argument
89 nir_loop_terminator *limiting_term = loop->info->limiting_terminator; in simple_unroll()
93 loop_prepare_for_unroll(loop); in simple_unroll()
97 &loop->info->loop_terminator_list, in simple_unroll()
131 nir_block *header_blk = nir_loop_first_block(loop); in simple_unroll()
[all …]
|
| /external/llvm/test/CodeGen/SystemZ/ |
| D | loop-01.ll | 1 ; Test loop tuning.
13 br label %loop
15 loop:
16 %index = phi i64 [ 0, %entry ], [ %next, %loop ]
21 br i1 %cmp, label %loop, label %exit
27 ; Test a loop that should be converted into dbr form and then use BRCT.
31 ; CHECK: [[LABEL:\.[^:]*]]:{{.*}} %loop
35 br label %loop
37 loop:
38 %count = phi i32 [ 0, %entry ], [ %next, %loop.next ]
[all …]
|
| D | branch-04.ll | 12 br label %loop
13 loop:
16 br i1 %cond, label %loop, label %exit
27 br label %loop
28 loop:
31 br i1 %cond, label %loop, label %exit
42 br label %loop
43 loop:
46 br i1 %cond, label %loop, label %exit
57 br label %loop
[all …]
|
| /external/llvm/test/Transforms/IRCE/ |
| D | with-parent-loops.ll | 1 ; RUN: opt -verify-loop-info -irce-print-changed-loops -irce < %s 2>&1 | FileCheck %s
8 ; CHECK: irce: in function inner_loop: constrained Loop at depth 1 containing: %loop<header><exitin…
13 br i1 %first.itr.check, label %loop, label %exit
15 loop: ; preds = %in.bounds, %entry
21 in.bounds: ; preds = %loop
25 br i1 %next, label %loop, label %exit
27 out.of.bounds: ; preds = %loop
36 ; CHECK: irce: in function with_parent: constrained Loop at depth 2 containing: %loop.i<header><exi…
39 br label %loop
41 loop: ; preds = %inner_loop.exit, %entry
[all …]
|
| /external/llvm/test/Transforms/LICM/ |
| D | argmemonly-call.ll | 2 …basic-aa -passes='require<aa>,require<targetir>,require<scalar-evolution>,loop(licm)' < %s -S | Fi…
10 ; CHECK-LABEL: loop:
11 br label %loop
13 loop:
16 br label %loop
22 ; CHECK-LABEL: loop:
24 br label %loop
26 loop:
29 br label %loop
35 ; CHECK-LABEL: loop:
[all …]
|
| D | preheader-safe.ll | 2 …basic-aa -passes='require<aa>,require<targetir>,require<scalar-evolution>,loop(licm)' -S %s | File…
11 ; CHECK-LABEL: loop
14 br label %loop
16 loop: ; preds = %entry, %for.inc
22 br label %loop
27 ; CHECK-LABEL: loop
31 br label %loop
33 loop: ; preds = %entry, %for.inc
36 br label %loop
39 ; The header is known no throw, but the loop is not. We can
[all …]
|
| /external/llvm/test/Transforms/PlaceSafepoints/ |
| D | finite-loops.ll | 3 ;; RUN: opt < %s -place-safepoints -spp-counted-loop-trip-width=32 -S | FileCheck %s
4 ;; RUN: opt < %s -place-safepoints -spp-counted-loop-trip-width=64 -S | FileCheck %s -check-prefix=…
7 ; A simple counted loop with trivially known range
12 ; CHECK-LABEL: loop
17 br label %loop
19 loop:
20 %counter = phi i32 [ 0 , %entry ], [ %counter.inc , %loop ]
23 br i1 %counter.cmp, label %loop, label %exit
29 ; The same counted loop, but with an unknown early exit
34 ; CHECK-LABEL: loop
[all …]
|
| /external/clang/test/CodeGenCXX/ |
| D | pragma-loop.cpp | 8 #pragma clang loop vectorize(enable) in while_test()
9 #pragma clang loop interleave_count(4) in while_test()
10 #pragma clang loop vectorize_width(4) in while_test()
11 #pragma clang loop unroll(full) in while_test()
12 #pragma clang loop distribute(enable) in while_test()
24 #pragma clang loop vectorize_width(8) interleave_count(4) unroll(disable) distribute(disable) in do_test()
36 #pragma clang loop interleave(enable) in for_test()
37 #pragma clang loop interleave_count(static_cast<int>(Tuner::Interleave)) in for_test()
38 #pragma clang loop unroll_count(static_cast<int>(Tuner::Unroll)) in for_test()
50 #pragma clang loop vectorize_width(2) interleave_count(2) in for_range_test()
[all …]
|