| /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()
20 …ument; expected 'enable', 'assume_safety' or 'disable'}} */ #pragma clang loop vectorize(badidenti… in test()
21 …ument; expected 'enable', 'assume_safety' or 'disable'}} */ #pragma clang loop interleave(badident… in test()
22 …valid argument; expected 'enable', 'full' or 'disable'}} */ #pragma clang loop unroll(badidentifie… in test()
27 …ctives 'vectorize(assume_safety)' and 'vectorize(enable)'}} */ #pragma clang loop vectorize(enable) in test()
28 #pragma clang loop vectorize(assume_safety) in test()
[all …]
|
| /external/dbus/dbus/ |
| D | dbus-mainloop.c | 130 DBusLoop *loop; in _dbus_loop_new() local
132 loop = dbus_new0 (DBusLoop, 1); in _dbus_loop_new()
133 if (loop == NULL) in _dbus_loop_new()
136 loop->watches = _dbus_hash_table_new (DBUS_HASH_INT, NULL, in _dbus_loop_new()
139 loop->socket_set = _dbus_socket_set_new (0); in _dbus_loop_new()
141 if (loop->watches == NULL || loop->socket_set == NULL) in _dbus_loop_new()
143 if (loop->watches != NULL) in _dbus_loop_new()
144 _dbus_hash_table_unref (loop->watches); in _dbus_loop_new()
146 if (loop->socket_set != NULL) in _dbus_loop_new()
147 _dbus_socket_set_free (loop->socket_set); in _dbus_loop_new()
[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 | 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-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 …]
|
| D | trip-count-pow2.ll | 6 br label %loop
7 loop:
8 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
11 br i1 %t, label %loop, label %exit
16 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (96 * %n)) /u 32)
17 ; CHECK: Loop %loop: max backedge-taken count is ((-32 + (96 * %n)) /u 32)
24 br label %loop
25 loop:
26 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
29 br i1 %t, label %loop, label %exit
[all …]
|
| D | infer-prestart-no-wrap.ll | 6 br label %loop
8 loop:
9 %counter = phi i32 [ 0, %entry ], [ %counter.inc, %loop ]
10 %idx = phi i32 [ %start, %entry ], [ %idx.inc, %loop ]
14 ; CHECK-NEXT: --> {(1 + (sext i32 %start to i64))<nsw>,+,1}<nsw><%loop>
17 br i1 %condition, label %exit, label %loop
26 br label %loop
28 loop:
29 %counter = phi i32 [ 0, %entry ], [ %counter.inc, %loop ]
30 %idx = phi i32 [ %start, %entry ], [ %idx.inc, %loop ]
[all …]
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| D | radeon_emulate_loops.c | 59 struct loop_info * loop) in loop_max_possible_iterations() argument
62 unsigned int loop_i = (loop->EndLoop->IP - loop->BeginLoop->IP) - 1; in loop_max_possible_iterations()
67 static void unroll_loop(struct radeon_compiler * c, struct loop_info * loop, in unroll_loop() argument
72 struct rc_instruction * first = loop->BeginLoop->Next; in unroll_loop()
73 struct rc_instruction * last = loop->EndLoop->Prev; in unroll_loop()
75 rc_remove_instruction(loop->BeginLoop); in unroll_loop()
76 rc_remove_instruction(loop->EndLoop); in unroll_loop()
186 static int try_unroll_loop(struct radeon_compiler * c, struct loop_info * loop) in try_unroll_loop() argument
199 if(rc_src_reg_is_immediate(c, loop->Cond->U.I.SrcReg[0].File, in try_unroll_loop()
200 loop->Cond->U.I.SrcReg[0].Index)){ in try_unroll_loop()
[all …]
|
| /external/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 …]
|
| D | sharpen-range.ll | 3 ;; Check if llvm can narrow !range metadata based on loop entry
13 br i1 %entry.pred, label %abort, label %loop.preheader
15 loop.preheader:
16 br label %loop
18 loop:
19 ; CHECK: loop
20 %idx = phi i32 [ %idx.inc, %loop.next ], [ 0, %loop.preheader ]
22 br i1 %oob.pred, label %loop.next, label %oob
23 ; CHECK: br i1 true, label %loop.next, label %oob
25 loop.next:
[all …]
|
| D | no-iv-rewrite.ll | 14 br label %loop
16 ; CHECK: loop:
27 loop:
28 %i.02 = phi i32 [ 0, %ph ], [ %iinc, %loop ]
29 %s.01 = phi i32 [ 0, %ph ], [ %sinc, %loop ]
36 br i1 %cond, label %loop, label %exit
39 %s.lcssa = phi i32 [ %sinc, %loop ]
53 br label %loop
55 ; CHECK: loop:
68 loop:
[all …]
|
| /external/dbus/test/ |
| D | test-utils.c | 6 DBusLoop *loop; member
17 return _dbus_loop_add_watch (cd->loop, watch); in add_watch()
26 _dbus_loop_remove_watch (cd->loop, watch); in remove_watch()
35 _dbus_loop_toggle_watch (cd->loop, watch); in toggle_watch()
44 return _dbus_loop_add_timeout (cd->loop, timeout); in add_timeout()
53 _dbus_loop_remove_timeout (cd->loop, timeout); in remove_timeout()
61 DBusLoop *loop = data; in dispatch_status_function() local
65 while (!_dbus_loop_queue_dispatch (loop, connection)) in dispatch_status_function()
76 _dbus_loop_unref (cd->loop); in cdata_free()
82 cdata_new (DBusLoop *loop, in cdata_new() argument
[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 | 9 ; CHECK-LABEL: loop:
10 br label %loop
12 loop:
15 br label %loop
21 ; CHECK-LABEL: loop:
23 br label %loop
25 loop:
28 br label %loop
34 ; CHECK-LABEL: loop:
35 br label %loop
[all …]
|
| D | preheader-safe.ll | 10 ; CHECK-LABEL: loop
13 br label %loop
15 loop: ; preds = %entry, %for.inc
18 br label %loop
23 ; CHECK-LABEL: loop
27 br label %loop
29 loop: ; preds = %entry, %for.inc
32 br label %loop
35 ; The header is known no throw, but the loop is not. We can
41 ; CHECK-LABEL: loop
[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=CO…
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/v8/src/compiler/ |
| D | ast-loop-assignment-analyzer.cc | 30 void ALAA::Enter(IterationStatement* loop) { in Enter() argument
34 if (info()->is_osr() && info()->osr_ast_id() == loop->OsrEntryId()) in Enter()
40 void ALAA::Exit(IterationStatement* loop) { in Exit() argument
48 std::pair<IterationStatement*, BitVector*>(loop, bits)); in Exit()
230 void ALAA::VisitDoWhileStatement(DoWhileStatement* loop) { in VisitDoWhileStatement() argument
231 Enter(loop); in VisitDoWhileStatement()
232 Visit(loop->body()); in VisitDoWhileStatement()
233 Visit(loop->cond()); in VisitDoWhileStatement()
234 Exit(loop); in VisitDoWhileStatement()
238 void ALAA::VisitWhileStatement(WhileStatement* loop) { in VisitWhileStatement() argument
[all …]
|
| /external/v8/test/cctest/compiler/ |
| D | test-osr.cc | 78 Node* NewOsrPhi(Node* loop, Node* incoming, int osr_value, Node* back1 = NULL, in NewOsrPhi() argument
84 CHECK_EQ(loop->InputCount(), count); in NewOsrPhi()
85 CHECK_EQ(osr_loop_entry, loop->InputAt(1)); in NewOsrPhi()
93 inputs[count] = loop; in NewOsrPhi()
100 Node* loop = graph.NewNode(common.Loop(1), entry); in NewLoop() local
102 loop->AppendInput(graph.zone(), osr_loop_entry); in NewLoop()
105 loop->AppendInput(graph.zone(), loop); in NewLoop()
107 NodeProperties::ChangeOp(loop, common.Loop(loop->InputCount())); in NewLoop()
108 return loop; in NewLoop()
136 Node* loop = T.NewOsrLoop(1); in TEST() local
[all …]
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | full-unroll-heuristics-cast.ll | 1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=100 -unroll-dynamic-cost-sav…
11 ; We expect this loop to be unrolled, because in this case load would become
21 br label %loop
23 loop: ; preds = %loop, %entry
24 %iv = phi i64 [ 0, %entry ], [ %inc, %loop ]
25 %r = phi i8 [ 0, %entry ], [ %add, %loop ]
36 br i1 %exitcond86.i, label %loop.end, label %loop
38 loop.end: ; preds = %loop
39 %r.lcssa = phi i8 [ %r, %loop ]
49 br label %loop
[all …]
|
| 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/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()
23 #pragma clang loop vectorize_width(8) interleave_count(4) unroll(disable) in do_test()
35 #pragma clang loop interleave(enable) in for_test()
36 #pragma clang loop interleave_count(static_cast<int>(Tuner::Interleave)) in for_test()
37 #pragma clang loop unroll_count(static_cast<int>(Tuner::Unroll)) in for_test()
49 #pragma clang loop vectorize_width(2) interleave_count(2) in for_range_test()
58 #pragma clang loop vectorize(disable) unroll(disable) in disable_test()
[all …]
|