Home
last modified time | relevance | path

Searched refs:loop (Results 1 – 25 of 4030) sorted by relevance

12345678910>>...162

/llvm-project/clang/test/SemaOpenACC/
H A Dloop-construct-auto_seq_independent-clauses.c4 #pragma acc loop auto in uses()
6 #pragma acc loop seq in uses()
8 #pragma acc loop independent in uses()
11 // expected-error@+2{{OpenACC clause 'seq' on 'loop' construct conflicts with previous data dependence clause}} in uses()
13 #pragma acc loop auto seq in uses()
15 // expected-error@+2{{OpenACC clause 'independent' on 'loop' construct conflicts with previous data dependence clause}} in uses()
17 #pragma acc loop auto independent in uses()
19 // expected-error@+2{{OpenACC clause 'auto' on 'loop' construct conflicts with previous data dependence clause}} in uses()
21 #pragma acc loop seq auto in uses()
23 // expected-error@+2{{OpenACC clause 'independent' on 'loop' construc in uses()
[all...]
H A Dloop-construct-device_type-clause.c9 #pragma acc loop device_type(I) in uses()
11 #pragma acc loop device_type(S) dtype(STy) in uses()
13 #pragma acc loop dtype(SImpl) in uses()
15 #pragma acc loop dtype(int) device_type(*) in uses()
17 #pragma acc loop dtype(true) device_type(false) in uses()
21 #pragma acc loop dtype(int, *) in uses()
24 #pragma acc loop device_type(I, int) in uses()
28 #pragma acc loop dtype(int{}) in uses()
31 #pragma acc loop dtype(5) in uses()
34 #pragma acc loop dtyp in uses()
[all...]
H A Dloop-construct-private-clause.c25 #pragma acc loop private(LocalInt) in uses()
29 #pragma acc loop private(LocalInt, LocalPointer, LocalArray) in uses()
31 #pragma acc loop private(LocalArray) in uses()
33 #pragma acc loop private(LocalArray[:]) in uses()
35 #pragma acc loop private(LocalArray[:5]) in uses()
37 #pragma acc loop private(LocalArray[2:]) in uses()
39 #pragma acc loop private(LocalArray[2:1]) in uses()
41 #pragma acc loop private(LocalArray[2]) in uses()
43 #pragma acc loop private(LocalComposite) in uses()
45 #pragma acc loop privat in uses()
[all...]
H A Dloop-construct-private-clause.cpp26 #pragma acc loop private(LocalInt) in uses()
30 #pragma acc loop private(LocalInt, LocalPointer, LocalArray) in uses()
32 #pragma acc loop private(LocalArray) in uses()
34 #pragma acc loop private(LocalArray[2]) in uses()
36 #pragma acc loop private(LocalComposite) in uses()
38 #pragma acc loop private(LocalComposite.EnumMember) in uses()
40 #pragma acc loop private(LocalComposite.ScalarMember) in uses()
42 #pragma acc loop private(LocalComposite.ArrayMember) in uses()
44 #pragma acc loop private(LocalComposite.ArrayMember[5]) in uses()
46 #pragma acc loop privat in uses()
[all...]
/llvm-project/clang/test/Parser/
H A Dpragma-loop.cpp8 #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()
65 …/* expected-error {{use of undeclared identifier 'Int'}} */ #pragma clang loop vectorize_width(V) … in test_nontype_template_badarg()
[all …]
/llvm-project/llvm/test/Analysis/ScalarEvolution/
H A Dincreasing-or-decreasing-iv.ll11 ; CHECK-NEXT: %loop.iv = phi i32 [ 0, %entry ], [ %loop.iv.inc, %loop ]
12 ; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,128) S: [0,128) Exits: 127 LoopDispositions: { …
13 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
14 … --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> + %start) Lo…
16 …tep + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128 * %step)<nsw> + %start)…
17 ; CHECK-NEXT: %loop.iv.inc = add i32 %loop.iv, 1
18 ; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,129) S: [1,129) Exits: 128 LoopDispositions: { …
19 ; CHECK-NEXT: Determining loop execution counts for: @f0
20 ; CHECK-NEXT: Loop %loop: backedge-taken count is i32 127
21 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 127
[all …]
H A Dshift-recurrences.ll7 ; CHECK-NEXT: %iv.lshr = phi i64 [ 1023, %entry ], [ %iv.lshr.next, %loop ]
8 ; CHECK-NEXT: --> %iv.lshr U: [0,1024) S: [0,1024) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
10 ; CHECK-NEXT: --> (%iv.lshr /u 2) U: [0,512) S: [0,512) Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
11 ; CHECK-NEXT: Determining loop execution counts for: @test_lshr
12 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
13 ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
14 ; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
17 br label %loop
18 loop:
19 %iv.lshr = phi i64 [1023, %entry], [%iv.lshr.next, %loop]
[all...]
H A Dtrip-count9.ll14 ; CHECK-NEXT: Determining loop execution counts for: @foo
15 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + %n)
16 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i4 6
17 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %n)
18 ; CHECK-NEXT: Loop %loop: Trip multiple is 1
22 br i1 %s, label %loop, label %exit
23 loop:
24 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
27 br i1 %t, label %loop, label %exit
34 ; CHECK-NEXT: Determining loop execution counts for: @step2
[all …]
H A Dtrip-count-andor.ll9 ; CHECK-NEXT: Determining loop execution counts for: @unsimplified_and1
10 ; CHECK-NEXT: Loop %loop: backedge-taken count is %n
11 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 -1
12 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
13 ; CHECK-NEXT: Loop %loop: Trip multiple is 1
16 br label %loop
18 loop:
19 %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
23 br i1 %and, label %loop, label %leave
31 ; CHECK-NEXT: Determining loop execution counts for: @unsimplified_and2
[all …]
H A Dtrip-count-andor-selectform.ll9 ; CHECK-NEXT: Determining loop execution counts for: @unsimplified_and1
10 ; CHECK-NEXT: Loop %loop: backedge-taken count is %n
11 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 -1
12 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
13 ; CHECK-NEXT: Loop %loop: Trip multiple is 1
16 br label %loop
18 loop:
19 %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
23 br i1 %and, label %loop, label %leave
31 ; CHECK-NEXT: Determining loop execution counts for: @unsimplified_and2
[all …]
H A Dshift-op.ll7 ; CHECK-NEXT: Determining loop execution counts for: @test0
8 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
9 ; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 32
10 ; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i32 32
13 br label %loop
15 loop:
16 %iv = phi i32 [ %init, %entry ], [ %iv.shift, %loop ]
19 br i1 %exit.cond, label %leave, label %loop
28 ; CHECK-NEXT: Determining loop execution counts for: @test1
29 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
[all …]
H A Div-poison.ll16 ; CHECK-NEXT: Determining loop execution counts for: @iv_nsw_poison
39 ; CHECK-NEXT: %iv.0 = phi i4 [ %start, %entry ], [ %iv.0.next, %loop ]
40 ; CHECK-NEXT: --> {%start,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDisposition…
41 ; CHECK-NEXT: %iv.1 = phi i4 [ %start, %entry ], [ %iv.1.next, %loop ]
42 … CHECK-NEXT: --> {%start,+,1}<nsw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
44 …K-NEXT: --> {(1 + %start),+,1}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
46 …K-NEXT: --> {(1 + %start),+,1}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispos…
47 ; CHECK-NEXT: Determining loop execution counts for: @iv_nsw_poison2
48 ; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
49 ; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
[all …]
H A Dranges.ll17 ; CHECK-NEXT: Determining loop execution counts for: @ashr
33 ; CHECK-NEXT: Determining loop execution counts for: @ashr_global
47 ; CHECK-NEXT: Determining loop execution counts for: @shl
60 ; CHECK-NEXT: Determining loop execution counts for: @lshr
74 ; CHECK-NEXT: Determining loop execution counts for: @udiv
87 ; CHECK-NEXT: Determining loop execution counts for: @sext
100 ; CHECK-NEXT: Determining loop execution counts for: @zext
111 ; CHECK-NEXT: %range.1 = phi i32 [ 0, %entry ], [ %shr, %loop ]
112 ; CHECK-NEXT: --> %range.1 U: [0,1) S: [0,1) Exits: <<Unknown>> LoopDispositions: { %loop: Varia…
114 ; CHECK-NEXT: --> (%range.1 /u 2) U: [0,1) S: [0,1) Exits: <<Unknown>> LoopDispositions: { %loop…
[all …]
/llvm-project/llvm/test/Transforms/DFAJumpThreading/
H A Ddfa-jump-threading-analysis.ll43 ; complicated CFG. Here the FSM is represented as a nested loop, with
46 ; CHECK: < loop.1.backedge loop.1 loop.2 loop.3 > [ 1, loop.1 ]
47 ; CHECK-NEXT: < case4 loop.1.backedge state.1.be2.si.unfold.false loop.1 loop.2 loop
[all...]
/llvm-project/llvm/test/Transforms/LoopStrengthReduce/X86/
H A Dnormalization-during-scev-expansion.ll2 ; RUN: opt -loop-reduce -S %s | FileCheck %s
30 ; CHECK: loop:
51 br label %loop
53 loop:
54 %iv = phi ptr [ %add.ptr249, %entry ], [ %iv.next, %loop ]
59 br i1 %c, label %exit, label %loop
62 %res = phi ptr [ %iv.next, %loop ]
74 ; CHECK: loop.1.preheader:
79 ; CHECK: loop.1:
83 ; CHECK: loop.1.loop.2_crit_edge:
[all …]
/llvm-project/llvm/test/Other/
H A Dloop-pass-ordering.ll2 ; 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 %loop.0.0 in function f
12 ; CHECK: Running pass: NoOpLoopPass on loop %loop
[all...]
H A Dloopnest-pass-ordering.ll7 ; loop.0 loop.1
9 ; loop.0.0 loop.0.1 loop.1.0
11 ; CHECK: Running pass: NoOpLoopNestPass on loop %loop.0 in function f
12 ; CHECK: Running pass: NoOpLoopNestPass on loop %loop.1 in function f
13 ; CHECK-NOT: Running pass: NoOpLoopNestPass on {{loop\
[all...]
/llvm-project/llvm/test/Transforms/LoopVectorize/
H A Dscev-during-mutation.ll1 ; RUN: opt -passes=loop-vectorize -force-vector-width=2 -force-vector-interleave=2 -scev-verify-ir …
12 br label %loop.0
14 loop.0:
15 %iv.0 = phi i16 [ -1, %entry ], [ %iv.0.next, %loop.0.latch ]
16 br label %loop.1
18 loop.1:
19 %iv.1 = phi i16 [ -1, %loop.0 ], [ %iv.1.next, %loop.1 ]
22 br i1 %i6, label %loop.0.latch, label %loop.1
24 loop.0.latch:
25 %i8 = phi i16 [ 1, %loop.1 ]
[all …]
/llvm-project/llvm/test/Transforms/SimpleLoopUnswitch/
H A Dpartial-unswitch-loop-and-block-dispositions.ll2 ; RUN: opt -passes='loop(loop-interchange),loop-mssa(simple-loop-unswitch<nontrivial>)' -S -verify-…
6 ; Make sure SCEV loop and block dispositions are properly invalidated after
17 ; CHECK: loop.1.header.us.us:
19 ; CHECK: loop.1.header.split.us.us.us:
21 ; CHECK: loop.1.header.split.us.split.us.split.us.split.us:
25 ; CHECK: loop.1.header.us:
27 ; CHECK: loop.4.header.us5:
29 ; CHECK: loop.5.us6:
36 ; CHECK: loop.4.latch.us11:
38 ; CHECK: loop.1.latch.us:
[all …]
/llvm-project/llvm/test/Transforms/CodeExtractor/
H A DLoopExtractor.ll1 ; RUN: opt < %s -passes='function(break-crit-edges,loop-simplify),loop-extract' -S | FileCheck %s
9 ; CHECK-NEXT: call void @test3.loop.0()
10 ; CHECK-NEXT: br label %loop.0.loop.1_crit_edge
11 ; CHECK: loop.0.loop.1_crit_edge:
14 ; CHECK-NEXT: call void @test3.loop.1()
20 br label %loop.0
22 loop.0: ; preds = %loop.0, %entry
23 %index.0 = phi i32 [ 10, %entry ], [ %next.0, %loop.0 ]
27 br i1 %repeat.0, label %loop.0, label %loop.1
29 loop.1: ; preds = %loop.0, %loop.1
[all …]
/llvm-project/llvm/test/Analysis/MustExecute/
H A Dpr57780.ll9 br label %loop
11 loop: ; preds = %loop.latch, %entry
12 %v = phi i32 [ 10, %entry ], [ 0, %loop.latch ]
14 br i1 %c, label %loop.exit, label %loop.cont
16 loop.cont: ; preds = %loop
17 br i1 false, label %loop.irreducible, label %loop.latch
19 loop.irreducible: ; preds = %loop.latch, %loop.cont
21 br label %loop.latch
23 loop.latch: ; preds = %loop.irreducible, %loop.cont
24 br i1 false, label %loop.irreducible, label %loop
[all …]
/llvm-project/llvm/test/Transforms/LoopPredication/
H A Dnested.ll2 ; RUN: opt -S -passes=loop-predication < %s 2>&1 | FileCheck %s
3 ; RUN: opt -S -passes='require<scalar-evolution>,loop-mssa(loop-predication)' -verify-memoryssa < %…
12 ; CHECK: outer.loop.preheader:
14 ; CHECK: outer.loop:
19 ; CHECK: inner.loop.preheader:
25 ; CHECK: inner.loop:
38 ; CHECK: outer.loop.inc.loopexit:
41 ; CHECK: outer.loop.inc:
55 br i1 %tmp5, label %exit, label %outer.loop.preheader
57 outer.loop.preheader:
[all …]
/llvm-project/mlir/test/Dialect/Affine/
H A Dloop-fusion-slice-computation.mlir1 // RUN: mlir-opt %s -test-loop-fusion=test-loop-fusion-slice-computation -split-input-file -verify-…
10 …// expected-remark@-1 {{Incorrect slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1…
14 …// expected-remark@-1 {{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bou…
27 …// expected-remark@-1 {{slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 1) loop bou…
31 …// expected-remark@-1 {{Incorrect slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0…
39 // Loop %i0 writes to locations [2, 17] and loop %i0 reads from locations [3, 6]
40 // Slice loop bounds should be adjusted such that the load/store are for the
47 …// expected-remark@-1 {{Incorrect slice ( src loop: 1, dst loop: 0, depth: 1 : insert point: (1, 2…
52 …// expected-remark@-1 {{slice ( src loop: 0, dst loop: 1, depth: 1 : insert point: (1, 0) loop bou…
61 // Slices at loop depth 1 should only slice the loop bounds of the first scf.
[all …]
/llvm-project/llvm/test/Transforms/LoopInstSimplify/
H A Dbasic.ll2 ; RUN: opt -S %s -passes=loop-instsimplify | FileCheck %s
3 ; RUN: opt -S %s -passes='loop-mssa(loop-instsimplify)' -verify-memoryssa | FileCheck %s
5 ; Test very basic folding and propagation occurs within a loop body. This should
6 ; collapse to the loop iteration structure and the LCSSA PHI node.
11 ; CHECK: loop:
21 br label %loop
23 loop:
24 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
30 br i1 %i.cmp, label %loop, label %exit
33 %x.lcssa = phi i32 [ %x.and, %loop ]
[all …]
/llvm-project/lldb/unittests/Host/
H A DMainLoopTest.cpp57 return [&](MainLoopBase &loop) { in make_callback()
59 loop.RequestTermination(); in make_callback()
72 MainLoop loop; in TEST_F()
75 auto handle = loop.RegisterReadObject(socketpair[1], make_callback(), error); in TEST_F()
78 ASSERT_TRUE(loop.Run().Success()); in TEST_F()
88 MainLoop loop; in TEST_F()
91 auto handle = loop.RegisterReadObject( in TEST_F()
107 // Terminate the loop after one second. in TEST_F() argument
108 loop.AddCallback([](MainLoopBase &loop) { loo in TEST_F()
56 __anona76be6ae0202(MainLoopBase &loop) make_callback() argument
71 MainLoop loop; TEST_F() local
87 MainLoop loop; TEST_F() local
103 MainLoop loop; TEST_F() local
125 MainLoop loop; TEST_F() local
129 __anona76be6ae0402(MainLoopBase &loop) TEST_F() argument
132 __anona76be6ae0502(MainLoopBase &loop) TEST_F() argument
149 MainLoop loop; TEST_F() local
152 __anona76be6ae0602(MainLoopBase &loop) TEST_F() argument
164 __anona76be6ae0902(MainLoopBase &loop) TEST_F() argument
178 MainLoop loop; TEST_F() local
183 __anona76be6ae0a02(MainLoopBase &loop) TEST_F() argument
196 MainLoop loop; TEST_F() local
207 MainLoop loop; TEST_F() local
220 MainLoop loop; TEST_F() local
239 MainLoop loop; TEST_F() local
250 __anona76be6ae0c02(MainLoopBase &loop) TEST_F() argument
263 __anona76be6ae0d02(MainLoopBase &loop) TEST_F() argument
[all...]

12345678910>>...162