blob: 5a866942f8eae7774e82166ec536cb3e5f64510a [file] [log] [blame]
Alexander Musmana5f070a2014-10-01 06:03:56 +00001// RUN: %clang_cc1 -verify -fopenmp=libiomp5 -x c++ -emit-llvm %s -fexceptions -fcxx-exceptions -o - | FileCheck %s
2// RUN: %clang_cc1 -fopenmp=libiomp5 -x c++ -std=c++11 -triple x86_64-unknown-unknown -fexceptions -fcxx-exceptions -emit-pch -o %t %s
3// RUN: %clang_cc1 -fopenmp=libiomp5 -x c++ -triple x86_64-unknown-unknown -fexceptions -fcxx-exceptions -g -std=c++11 -include-pch %t -verify %s -emit-llvm -o - | FileCheck %s
Alexey Bataev36bf0112015-03-10 05:15:26 +00004// RUN: %clang_cc1 -verify -triple x86_64-apple-darwin10 -fopenmp=libiomp5 -fexceptions -fcxx-exceptions -gline-tables-only -x c++ -emit-llvm %s -o - | FileCheck %s --check-prefix=TERM_DEBUG
Adrian Prantlcbc368c2015-02-25 02:44:04 +00005//
Alexander Musmana5f070a2014-10-01 06:03:56 +00006// expected-no-diagnostics
7#ifndef HEADER
8#define HEADER
9
10// CHECK-LABEL: define {{.*void}} @{{.*}}simple{{.*}}(float* {{.+}}, float* {{.+}}, float* {{.+}}, float* {{.+}})
11void simple(float *a, float *b, float *c, float *d) {
12 #pragma omp simd
13// CHECK: store i32 0, i32* [[OMP_IV:%[^,]+]]
14
David Blaikiea953f282015-02-27 21:19:58 +000015// CHECK: [[IV:%.+]] = load i32, i32* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP1_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000016// CHECK-NEXT: [[CMP:%.+]] = icmp slt i32 [[IV]], 6
17// CHECK-NEXT: br i1 [[CMP]], label %[[SIMPLE_LOOP1_BODY:.+]], label %[[SIMPLE_LOOP1_END:[^,]+]]
18 for (int i = 3; i < 32; i += 5) {
19// CHECK: [[SIMPLE_LOOP1_BODY]]
20// Start of body: calculate i from IV:
David Blaikiea953f282015-02-27 21:19:58 +000021// CHECK: [[IV1_1:%.+]] = load i32, i32* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP1_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000022// CHECK: [[CALC_I_1:%.+]] = mul nsw i32 [[IV1_1]], 5
23// CHECK-NEXT: [[CALC_I_2:%.+]] = add nsw i32 3, [[CALC_I_1]]
24// CHECK-NEXT: store i32 [[CALC_I_2]], i32* [[LC_I:.+]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP1_ID]]
25// ... loop body ...
26// End of body: store into a[i]:
27// CHECK: store float [[RESULT:%.+]], float* {{%.+}}{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP1_ID]]
28 a[i] = b[i] * c[i] * d[i];
David Blaikiea953f282015-02-27 21:19:58 +000029// CHECK: [[IV1_2:%.+]] = load i32, i32* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP1_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000030// CHECK-NEXT: [[ADD1_2:%.+]] = add nsw i32 [[IV1_2]], 1
31// CHECK-NEXT: store i32 [[ADD1_2]], i32* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP1_ID]]
32// br label %{{.+}}, !llvm.loop !{{.+}}
33 }
34// CHECK: [[SIMPLE_LOOP1_END]]
35
36 #pragma omp simd
37// CHECK: store i32 0, i32* [[OMP_IV2:%[^,]+]]
38
David Blaikiea953f282015-02-27 21:19:58 +000039// CHECK: [[IV2:%.+]] = load i32, i32* [[OMP_IV2]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP2_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000040// CHECK-NEXT: [[CMP2:%.+]] = icmp slt i32 [[IV2]], 9
41// CHECK-NEXT: br i1 [[CMP2]], label %[[SIMPLE_LOOP2_BODY:.+]], label %[[SIMPLE_LOOP2_END:[^,]+]]
42 for (int i = 10; i > 1; i--) {
43// CHECK: [[SIMPLE_LOOP2_BODY]]
44// Start of body: calculate i from IV:
David Blaikiea953f282015-02-27 21:19:58 +000045// CHECK: [[IV2_0:%.+]] = load i32, i32* [[OMP_IV2]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP2_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000046// FIXME: It is interesting, why the following "mul 1" was not constant folded?
47// CHECK-NEXT: [[IV2_1:%.+]] = mul nsw i32 [[IV2_0]], 1
48// CHECK-NEXT: [[LC_I_1:%.+]] = sub nsw i32 10, [[IV2_1]]
49// CHECK-NEXT: store i32 [[LC_I_1]], i32* {{.+}}, !llvm.mem.parallel_loop_access ![[SIMPLE_LOOP2_ID]]
50 a[i]++;
David Blaikiea953f282015-02-27 21:19:58 +000051// CHECK: [[IV2_2:%.+]] = load i32, i32* [[OMP_IV2]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP2_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000052// CHECK-NEXT: [[ADD2_2:%.+]] = add nsw i32 [[IV2_2]], 1
53// CHECK-NEXT: store i32 [[ADD2_2]], i32* [[OMP_IV2]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP2_ID]]
54// br label {{.+}}, !llvm.loop ![[SIMPLE_LOOP2_ID]]
55 }
56// CHECK: [[SIMPLE_LOOP2_END]]
57
58 #pragma omp simd
59// CHECK: store i64 0, i64* [[OMP_IV3:%[^,]+]]
60
David Blaikiea953f282015-02-27 21:19:58 +000061// CHECK: [[IV3:%.+]] = load i64, i64* [[OMP_IV3]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP3_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000062// CHECK-NEXT: [[CMP3:%.+]] = icmp ult i64 [[IV3]], 4
63// CHECK-NEXT: br i1 [[CMP3]], label %[[SIMPLE_LOOP3_BODY:.+]], label %[[SIMPLE_LOOP3_END:[^,]+]]
64 for (unsigned long long it = 2000; it >= 600; it-=400) {
65// CHECK: [[SIMPLE_LOOP3_BODY]]
66// Start of body: calculate it from IV:
David Blaikiea953f282015-02-27 21:19:58 +000067// CHECK: [[IV3_0:%.+]] = load i64, i64* [[OMP_IV3]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP3_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000068// CHECK-NEXT: [[LC_IT_1:%.+]] = mul i64 [[IV3_0]], 400
69// CHECK-NEXT: [[LC_IT_2:%.+]] = sub i64 2000, [[LC_IT_1]]
70// CHECK-NEXT: store i64 [[LC_IT_2]], i64* {{.+}}, !llvm.mem.parallel_loop_access ![[SIMPLE_LOOP3_ID]]
71 a[it]++;
David Blaikiea953f282015-02-27 21:19:58 +000072// CHECK: [[IV3_2:%.+]] = load i64, i64* [[OMP_IV3]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP3_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000073// CHECK-NEXT: [[ADD3_2:%.+]] = add i64 [[IV3_2]], 1
74// CHECK-NEXT: store i64 [[ADD3_2]], i64* [[OMP_IV3]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP3_ID]]
75 }
76// CHECK: [[SIMPLE_LOOP3_END]]
77
78 #pragma omp simd
79// CHECK: store i32 0, i32* [[OMP_IV4:%[^,]+]]
80
David Blaikiea953f282015-02-27 21:19:58 +000081// CHECK: [[IV4:%.+]] = load i32, i32* [[OMP_IV4]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP4_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000082// CHECK-NEXT: [[CMP4:%.+]] = icmp slt i32 [[IV4]], 4
83// CHECK-NEXT: br i1 [[CMP4]], label %[[SIMPLE_LOOP4_BODY:.+]], label %[[SIMPLE_LOOP4_END:[^,]+]]
84 for (short it = 6; it <= 20; it-=-4) {
85// CHECK: [[SIMPLE_LOOP4_BODY]]
86// Start of body: calculate it from IV:
David Blaikiea953f282015-02-27 21:19:58 +000087// CHECK: [[IV4_0:%.+]] = load i32, i32* [[OMP_IV4]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP4_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000088// CHECK-NEXT: [[LC_IT_1:%.+]] = mul nsw i32 [[IV4_0]], 4
89// CHECK-NEXT: [[LC_IT_2:%.+]] = add nsw i32 6, [[LC_IT_1]]
90// CHECK-NEXT: [[LC_IT_3:%.+]] = trunc i32 [[LC_IT_2]] to i16
91// CHECK-NEXT: store i16 [[LC_IT_3]], i16* {{.+}}, !llvm.mem.parallel_loop_access ![[SIMPLE_LOOP4_ID]]
92
David Blaikiea953f282015-02-27 21:19:58 +000093// CHECK: [[IV4_2:%.+]] = load i32, i32* [[OMP_IV4]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP4_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +000094// CHECK-NEXT: [[ADD4_2:%.+]] = add nsw i32 [[IV4_2]], 1
95// CHECK-NEXT: store i32 [[ADD4_2]], i32* [[OMP_IV4]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP4_ID]]
96 }
97// CHECK: [[SIMPLE_LOOP4_END]]
98
99 #pragma omp simd
100// CHECK: store i32 0, i32* [[OMP_IV5:%[^,]+]]
101
David Blaikiea953f282015-02-27 21:19:58 +0000102// CHECK: [[IV5:%.+]] = load i32, i32* [[OMP_IV5]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP5_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000103// CHECK-NEXT: [[CMP5:%.+]] = icmp slt i32 [[IV5]], 26
104// CHECK-NEXT: br i1 [[CMP5]], label %[[SIMPLE_LOOP5_BODY:.+]], label %[[SIMPLE_LOOP5_END:[^,]+]]
105 for (unsigned char it = 'z'; it >= 'a'; it+=-1) {
106// CHECK: [[SIMPLE_LOOP5_BODY]]
107// Start of body: calculate it from IV:
David Blaikiea953f282015-02-27 21:19:58 +0000108// CHECK: [[IV5_0:%.+]] = load i32, i32* [[OMP_IV5]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP5_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000109// CHECK-NEXT: [[IV5_1:%.+]] = mul nsw i32 [[IV5_0]], 1
110// CHECK-NEXT: [[LC_IT_1:%.+]] = sub nsw i32 122, [[IV5_1]]
111// CHECK-NEXT: [[LC_IT_2:%.+]] = trunc i32 [[LC_IT_1]] to i8
112// CHECK-NEXT: store i8 [[LC_IT_2]], i8* {{.+}}, !llvm.mem.parallel_loop_access ![[SIMPLE_LOOP5_ID]]
113
David Blaikiea953f282015-02-27 21:19:58 +0000114// CHECK: [[IV5_2:%.+]] = load i32, i32* [[OMP_IV5]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP5_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000115// CHECK-NEXT: [[ADD5_2:%.+]] = add nsw i32 [[IV5_2]], 1
116// CHECK-NEXT: store i32 [[ADD5_2]], i32* [[OMP_IV5]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP5_ID]]
117 }
118// CHECK: [[SIMPLE_LOOP5_END]]
119
120 #pragma omp simd
121// FIXME: I think we would get wrong result using 'unsigned' in the loop below.
122// So we'll need to add zero trip test for 'unsigned' counters.
123//
124// CHECK: store i32 0, i32* [[OMP_IV6:%[^,]+]]
125
David Blaikiea953f282015-02-27 21:19:58 +0000126// CHECK: [[IV6:%.+]] = load i32, i32* [[OMP_IV6]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP6_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000127// CHECK-NEXT: [[CMP6:%.+]] = icmp slt i32 [[IV6]], -8
128// CHECK-NEXT: br i1 [[CMP6]], label %[[SIMPLE_LOOP6_BODY:.+]], label %[[SIMPLE_LOOP6_END:[^,]+]]
129 for (int i=100; i<10; i+=10) {
130// CHECK: [[SIMPLE_LOOP6_BODY]]
131// Start of body: calculate i from IV:
David Blaikiea953f282015-02-27 21:19:58 +0000132// CHECK: [[IV6_0:%.+]] = load i32, i32* [[OMP_IV6]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP6_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000133// CHECK-NEXT: [[LC_IT_1:%.+]] = mul nsw i32 [[IV6_0]], 10
134// CHECK-NEXT: [[LC_IT_2:%.+]] = add nsw i32 100, [[LC_IT_1]]
135// CHECK-NEXT: store i32 [[LC_IT_2]], i32* {{.+}}, !llvm.mem.parallel_loop_access ![[SIMPLE_LOOP6_ID]]
136
David Blaikiea953f282015-02-27 21:19:58 +0000137// CHECK: [[IV6_2:%.+]] = load i32, i32* [[OMP_IV6]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP6_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000138// CHECK-NEXT: [[ADD6_2:%.+]] = add nsw i32 [[IV6_2]], 1
139// CHECK-NEXT: store i32 [[ADD6_2]], i32* [[OMP_IV6]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP6_ID]]
140 }
141// CHECK: [[SIMPLE_LOOP6_END]]
142
143 int A;
144 #pragma omp simd lastprivate(A)
145// Clause 'lastprivate' implementation is not completed yet.
146// Test checks that one iteration is separated in presence of lastprivate.
147//
148// CHECK: store i64 0, i64* [[OMP_IV7:%[^,]+]]
149// CHECK: br i1 true, label %[[SIMPLE_IF7_THEN:.+]], label %[[SIMPLE_IF7_END:[^,]+]]
150// CHECK: [[SIMPLE_IF7_THEN]]
151// CHECK: br label %[[SIMD_LOOP7_COND:[^,]+]]
152// CHECK: [[SIMD_LOOP7_COND]]
David Blaikiea953f282015-02-27 21:19:58 +0000153// CHECK-NEXT: [[IV7:%.+]] = load i64, i64* [[OMP_IV7]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP7_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000154// CHECK-NEXT: [[CMP7:%.+]] = icmp slt i64 [[IV7]], 6
155// CHECK-NEXT: br i1 [[CMP7]], label %[[SIMPLE_LOOP7_BODY:.+]], label %[[SIMPLE_LOOP7_END:[^,]+]]
156 for (long long i = -10; i < 10; i += 3) {
157// CHECK: [[SIMPLE_LOOP7_BODY]]
158// Start of body: calculate i from IV:
David Blaikiea953f282015-02-27 21:19:58 +0000159// CHECK: [[IV7_0:%.+]] = load i64, i64* [[OMP_IV7]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP7_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000160// CHECK-NEXT: [[LC_IT_1:%.+]] = mul nsw i64 [[IV7_0]], 3
161// CHECK-NEXT: [[LC_IT_2:%.+]] = add nsw i64 -10, [[LC_IT_1]]
162// CHECK-NEXT: store i64 [[LC_IT_2]], i64* {{.+}}, !llvm.mem.parallel_loop_access ![[SIMPLE_LOOP7_ID]]
163 A = i;
David Blaikiea953f282015-02-27 21:19:58 +0000164// CHECK: [[IV7_2:%.+]] = load i64, i64* [[OMP_IV7]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP7_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000165// CHECK-NEXT: [[ADD7_2:%.+]] = add nsw i64 [[IV7_2]], 1
166// CHECK-NEXT: store i64 [[ADD7_2]], i64* [[OMP_IV7]]{{.*}}!llvm.mem.parallel_loop_access ![[SIMPLE_LOOP7_ID]]
167 }
168// CHECK: [[SIMPLE_LOOP7_END]]
169// Separated last iteration.
David Blaikiea953f282015-02-27 21:19:58 +0000170// CHECK: [[IV7_4:%.+]] = load i64, i64* [[OMP_IV7]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000171// CHECK-NEXT: [[LC_FIN_1:%.+]] = mul nsw i64 [[IV7_4]], 3
172// CHECK-NEXT: [[LC_FIN_2:%.+]] = add nsw i64 -10, [[LC_FIN_1]]
173// CHECK-NEXT: store i64 [[LC_FIN_2]], i64* [[ADDR_I:%[^,]+]]
David Blaikiea953f282015-02-27 21:19:58 +0000174// CHECK: [[LOAD_I:%.+]] = load i64, i64* [[ADDR_I]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000175// CHECK-NEXT: [[CONV_I:%.+]] = trunc i64 [[LOAD_I]] to i32
176//
177// CHECK: br label %[[SIMPLE_IF7_END]]
178// CHECK: [[SIMPLE_IF7_END]]
179//
180
181// CHECK: ret void
182}
183
184template <class T, unsigned K> T tfoo(T a) { return a + K; }
185
186template <typename T, unsigned N>
187int templ1(T a, T *z) {
188 #pragma omp simd collapse(N)
189 for (int i = 0; i < N * 2; i++) {
190 for (long long j = 0; j < (N + N + N + N); j += 2) {
191 z[i + j] = a + tfoo<T, N>(i + j);
192 }
193 }
194 return 0;
195}
196
197// Instatiation templ1<float,2>
198// CHECK-LABEL: define {{.*i32}} @{{.*}}templ1{{.*}}(float {{.+}}, float* {{.+}})
199// CHECK: store i64 0, i64* [[T1_OMP_IV:[^,]+]]
200// ...
David Blaikiea953f282015-02-27 21:19:58 +0000201// CHECK: [[IV:%.+]] = load i64, i64* [[T1_OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[T1_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000202// CHECK-NEXT: [[CMP1:%.+]] = icmp slt i64 [[IV]], 16
203// CHECK-NEXT: br i1 [[CMP1]], label %[[T1_BODY:.+]], label %[[T1_END:[^,]+]]
204// CHECK: [[T1_BODY]]
205// Loop counters i and j updates:
David Blaikiea953f282015-02-27 21:19:58 +0000206// CHECK: [[IV1:%.+]] = load i64, i64* [[T1_OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[T1_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000207// CHECK-NEXT: [[I_1:%.+]] = sdiv i64 [[IV1]], 4
208// CHECK-NEXT: [[I_1_MUL1:%.+]] = mul nsw i64 [[I_1]], 1
209// CHECK-NEXT: [[I_1_ADD0:%.+]] = add nsw i64 0, [[I_1_MUL1]]
210// CHECK-NEXT: [[I_2:%.+]] = trunc i64 [[I_1_ADD0]] to i32
211// CHECK-NEXT: store i32 [[I_2]], i32* {{%.+}}{{.*}}!llvm.mem.parallel_loop_access ![[T1_ID]]
David Blaikiea953f282015-02-27 21:19:58 +0000212// CHECK: [[IV2:%.+]] = load i64, i64* [[T1_OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[T1_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000213// CHECK-NEXT: [[J_1:%.+]] = srem i64 [[IV2]], 4
214// CHECK-NEXT: [[J_2:%.+]] = mul nsw i64 [[J_1]], 2
215// CHECK-NEXT: [[J_2_ADD0:%.+]] = add nsw i64 0, [[J_2]]
216// CHECK-NEXT: store i64 [[J_2_ADD0]], i64* {{%.+}}{{.*}}!llvm.mem.parallel_loop_access ![[T1_ID]]
217// simd.for.inc:
David Blaikiea953f282015-02-27 21:19:58 +0000218// CHECK: [[IV3:%.+]] = load i64, i64* [[T1_OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[T1_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000219// CHECK-NEXT: [[INC:%.+]] = add nsw i64 [[IV3]], 1
220// CHECK-NEXT: store i64 [[INC]], i64* [[T1_OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[T1_ID]]
221// CHECK-NEXT: br label {{%.+}}
222// CHECK: [[T1_END]]
223// CHECK: ret i32 0
224//
225void inst_templ1() {
226 float a;
227 float z[100];
228 templ1<float,2> (a, z);
229}
230
231
232typedef int MyIdx;
233
234class IterDouble {
235 double *Ptr;
236public:
237 IterDouble operator++ () const {
238 IterDouble n;
239 n.Ptr = Ptr + 1;
240 return n;
241 }
242 bool operator < (const IterDouble &that) const {
243 return Ptr < that.Ptr;
244 }
245 double & operator *() const {
246 return *Ptr;
247 }
248 MyIdx operator - (const IterDouble &that) const {
249 return (MyIdx) (Ptr - that.Ptr);
250 }
251 IterDouble operator + (int Delta) {
252 IterDouble re;
253 re.Ptr = Ptr + Delta;
254 return re;
255 }
256
257 ///~IterDouble() {}
258};
259
260// CHECK-LABEL: define {{.*void}} @{{.*}}iter_simple{{.*}}
261void iter_simple(IterDouble ia, IterDouble ib, IterDouble ic) {
262//
263// CHECK: store i32 0, i32* [[IT_OMP_IV:%[^,]+]]
264// Calculate number of iterations before the loop body.
Alexey Bataev36bf0112015-03-10 05:15:26 +0000265// CHECK: [[DIFF1:%.+]] = invoke {{.*}}i32 @{{.*}}IterDouble{{.*}}
266// CHECK: [[DIFF2:%.+]] = sub nsw i32 [[DIFF1]], 1
Alexander Musmana5f070a2014-10-01 06:03:56 +0000267// CHECK-NEXT: [[DIFF3:%.+]] = add nsw i32 [[DIFF2]], 1
268// CHECK-NEXT: [[DIFF4:%.+]] = sdiv i32 [[DIFF3]], 1
269// CHECK-NEXT: [[DIFF5:%.+]] = sub nsw i32 [[DIFF4]], 1
270// CHECK-NEXT: store i32 [[DIFF5]], i32* [[OMP_LAST_IT:%[^,]+]]{{.+}}
271 #pragma omp simd
272
David Blaikiea953f282015-02-27 21:19:58 +0000273// CHECK: [[IV:%.+]] = load i32, i32* [[IT_OMP_IV]]{{.+}} !llvm.mem.parallel_loop_access ![[ITER_LOOP_ID:[0-9]+]]
274// CHECK-NEXT: [[LAST_IT:%.+]] = load i32, i32* [[OMP_LAST_IT]]{{.+}}!llvm.mem.parallel_loop_access ![[ITER_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000275// CHECK-NEXT: [[NUM_IT:%.+]] = add nsw i32 [[LAST_IT]], 1
276// CHECK-NEXT: [[CMP:%.+]] = icmp slt i32 [[IV]], [[NUM_IT]]
277// CHECK-NEXT: br i1 [[CMP]], label %[[IT_BODY:[^,]+]], label %[[IT_END:[^,]+]]
278 for (IterDouble i = ia; i < ib; ++i) {
279// CHECK: [[IT_BODY]]
280// Start of body: calculate i from index:
David Blaikiea953f282015-02-27 21:19:58 +0000281// CHECK: [[IV1:%.+]] = load i32, i32* [[IT_OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[ITER_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000282// Call of operator+ (i, IV).
Alexey Bataev36bf0112015-03-10 05:15:26 +0000283// CHECK: {{%.+}} = invoke {{.+}} @{{.*}}IterDouble{{.*}}
Alexander Musmana5f070a2014-10-01 06:03:56 +0000284// ... loop body ...
285 *i = *ic * 0.5;
286// Float multiply and save result.
287// CHECK: [[MULR:%.+]] = fmul double {{%.+}}, 5.000000e-01
Alexey Bataev36bf0112015-03-10 05:15:26 +0000288// CHECK-NEXT: invoke {{.+}} @{{.*}}IterDouble{{.*}}
Alexander Musmana5f070a2014-10-01 06:03:56 +0000289// CHECK: store double [[MULR:%.+]], double* [[RESULT_ADDR:%.+]], !llvm.mem.parallel_loop_access ![[ITER_LOOP_ID]]
290 ++ic;
291//
David Blaikiea953f282015-02-27 21:19:58 +0000292// CHECK: [[IV2:%.+]] = load i32, i32* [[IT_OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[ITER_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000293// CHECK-NEXT: [[ADD2:%.+]] = add nsw i32 [[IV2]], 1
294// CHECK-NEXT: store i32 [[ADD2]], i32* [[IT_OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[ITER_LOOP_ID]]
295// br label %{{.*}}, !llvm.loop ![[ITER_LOOP_ID]]
296 }
297// CHECK: [[IT_END]]
298// CHECK: ret void
299}
300
301
302// CHECK-LABEL: define {{.*void}} @{{.*}}collapsed{{.*}}
303void collapsed(float *a, float *b, float *c, float *d) {
304 int i; // outer loop counter
305 unsigned j; // middle loop couter, leads to unsigned icmp in loop header.
306 // k declared in the loop init below
307 short l; // inner loop counter
308// CHECK: store i32 0, i32* [[OMP_IV:[^,]+]]
309//
310 #pragma omp simd collapse(4)
311
David Blaikiea953f282015-02-27 21:19:58 +0000312// CHECK: [[IV:%.+]] = load i32, i32* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID:[0-9]+]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000313// CHECK-NEXT: [[CMP:%.+]] = icmp ult i32 [[IV]], 120
314// CHECK-NEXT: br i1 [[CMP]], label %[[COLL1_BODY:[^,]+]], label %[[COLL1_END:[^,]+]]
315 for (i = 1; i < 3; i++) // 2 iterations
316 for (j = 2u; j < 5u; j++) //3 iterations
317 for (int k = 3; k <= 6; k++) // 4 iterations
318 for (l = 4; l < 9; ++l) // 5 iterations
319 {
320// CHECK: [[COLL1_BODY]]
321// Start of body: calculate i from index:
David Blaikiea953f282015-02-27 21:19:58 +0000322// CHECK: [[IV1:%.+]] = load i32, i32* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000323// Calculation of the loop counters values.
324// CHECK: [[CALC_I_1:%.+]] = udiv i32 [[IV1]], 60
325// CHECK-NEXT: [[CALC_I_1_MUL1:%.+]] = mul i32 [[CALC_I_1]], 1
326// CHECK-NEXT: [[CALC_I_2:%.+]] = add i32 1, [[CALC_I_1_MUL1]]
327// CHECK-NEXT: store i32 [[CALC_I_2]], i32* [[LC_I:.+]]
David Blaikiea953f282015-02-27 21:19:58 +0000328// CHECK: [[IV1_2:%.+]] = load i32, i32* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000329// CHECK-NEXT: [[CALC_J_1:%.+]] = udiv i32 [[IV1_2]], 20
330// CHECK-NEXT: [[CALC_J_2:%.+]] = urem i32 [[CALC_J_1]], 3
331// CHECK-NEXT: [[CALC_J_2_MUL1:%.+]] = mul i32 [[CALC_J_2]], 1
332// CHECK-NEXT: [[CALC_J_3:%.+]] = add i32 2, [[CALC_J_2_MUL1]]
333// CHECK-NEXT: store i32 [[CALC_J_3]], i32* [[LC_J:.+]]
David Blaikiea953f282015-02-27 21:19:58 +0000334// CHECK: [[IV1_3:%.+]] = load i32, i32* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000335// CHECK-NEXT: [[CALC_K_1:%.+]] = udiv i32 [[IV1_3]], 5
336// CHECK-NEXT: [[CALC_K_2:%.+]] = urem i32 [[CALC_K_1]], 4
337// CHECK-NEXT: [[CALC_K_2_MUL1:%.+]] = mul i32 [[CALC_K_2]], 1
338// CHECK-NEXT: [[CALC_K_3:%.+]] = add i32 3, [[CALC_K_2_MUL1]]
339// CHECK-NEXT: store i32 [[CALC_K_3]], i32* [[LC_K:.+]]
David Blaikiea953f282015-02-27 21:19:58 +0000340// CHECK: [[IV1_4:%.+]] = load i32, i32* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000341// CHECK-NEXT: [[CALC_L_1:%.+]] = urem i32 [[IV1_4]], 5
342// CHECK-NEXT: [[CALC_L_1_MUL1:%.+]] = mul i32 [[CALC_L_1]], 1
343// CHECK-NEXT: [[CALC_L_2:%.+]] = add i32 4, [[CALC_L_1_MUL1]]
344// CHECK-NEXT: [[CALC_L_3:%.+]] = trunc i32 [[CALC_L_2]] to i16
345// CHECK-NEXT: store i16 [[CALC_L_3]], i16* [[LC_L:.+]]
346// ... loop body ...
347// End of body: store into a[i]:
348// CHECK: store float [[RESULT:%.+]], float* [[RESULT_ADDR:%.+]]{{.+}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID]]
349 float res = b[j] * c[k];
350 a[i] = res * d[l];
David Blaikiea953f282015-02-27 21:19:58 +0000351// CHECK: [[IV2:%.+]] = load i32, i32* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000352// CHECK-NEXT: [[ADD2:%.+]] = add i32 [[IV2]], 1
353// CHECK-NEXT: store i32 [[ADD2]], i32* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[COLL1_LOOP_ID]]
354// br label %{{[^,]+}}, !llvm.loop ![[COLL1_LOOP_ID]]
355// CHECK: [[COLL1_END]]
356 }
357// i,j,l are updated; k is not updated.
358// CHECK: store i32 3, i32* [[I:%[^,]+]]
359// CHECK-NEXT: store i32 5, i32* [[I:%[^,]+]]
360// CHECK-NEXT: store i16 9, i16* [[I:%[^,]+]]
361// CHECK: ret void
362}
363
364extern char foo();
365
366// CHECK-LABEL: define {{.*void}} @{{.*}}widened{{.*}}
367void widened(float *a, float *b, float *c, float *d) {
368 int i; // outer loop counter
369 short j; // inner loop counter
370// Counter is widened to 64 bits.
371// CHECK: store i64 0, i64* [[OMP_IV:[^,]+]]
372//
373 #pragma omp simd collapse(2)
374
David Blaikiea953f282015-02-27 21:19:58 +0000375// CHECK: [[IV:%.+]] = load i64, i64* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[WIDE1_LOOP_ID:[0-9]+]]
376// CHECK-NEXT: [[LI:%.+]] = load i64, i64* [[OMP_LI:%[^,]+]]{{.+}}!llvm.mem.parallel_loop_access ![[WIDE1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000377// CHECK-NEXT: [[NUMIT:%.+]] = add nsw i64 [[LI]], 1
378// CHECK-NEXT: [[CMP:%.+]] = icmp slt i64 [[IV]], [[NUMIT]]
379// CHECK-NEXT: br i1 [[CMP]], label %[[WIDE1_BODY:[^,]+]], label %[[WIDE1_END:[^,]+]]
380 for (i = 1; i < 3; i++) // 2 iterations
381 for (j = 0; j < foo(); j++) // foo() iterations
382 {
383// CHECK: [[WIDE1_BODY]]
384// Start of body: calculate i from index:
David Blaikiea953f282015-02-27 21:19:58 +0000385// CHECK: [[IV1:%.+]] = load i64, i64* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[WIDE1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000386// Calculation of the loop counters values...
387// CHECK: store i32 {{[^,]+}}, i32* [[LC_I:.+]]
David Blaikiea953f282015-02-27 21:19:58 +0000388// CHECK: [[IV1_2:%.+]] = load i64, i64* [[OMP_IV]]{{.+}}!llvm.mem.parallel_loop_access ![[WIDE1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000389// CHECK: store i16 {{[^,]+}}, i16* [[LC_J:.+]]
390// ... loop body ...
391// End of body: store into a[i]:
392// CHECK: store float [[RESULT:%.+]], float* [[RESULT_ADDR:%.+]]{{.+}}!llvm.mem.parallel_loop_access ![[WIDE1_LOOP_ID]]
393 float res = b[j] * c[j];
394 a[i] = res * d[i];
David Blaikiea953f282015-02-27 21:19:58 +0000395// CHECK: [[IV2:%.+]] = load i64, i64* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[WIDE1_LOOP_ID]]
Alexander Musmana5f070a2014-10-01 06:03:56 +0000396// CHECK-NEXT: [[ADD2:%.+]] = add nsw i64 [[IV2]], 1
397// CHECK-NEXT: store i64 [[ADD2]], i64* [[OMP_IV]]{{.*}}!llvm.mem.parallel_loop_access ![[WIDE1_LOOP_ID]]
398// br label %{{[^,]+}}, !llvm.loop ![[WIDE1_LOOP_ID]]
399// CHECK: [[WIDE1_END]]
400 }
401// i,j are updated.
402// CHECK: store i32 3, i32* [[I:%[^,]+]]
403// CHECK: store i16
404// CHECK: ret void
405}
406
Alexey Bataev36bf0112015-03-10 05:15:26 +0000407// TERM_DEBUG-LABEL: bar
408int bar() {return 0;};
409
410// TERM_DEBUG-LABEL: parallel_simd
Alexey Bataev8cbe0a62015-02-26 10:27:34 +0000411void parallel_simd(float *a) {
412#pragma omp parallel
413#pragma omp simd
Alexey Bataev36bf0112015-03-10 05:15:26 +0000414 // TERM_DEBUG-NOT: __kmpc_global_thread_num
415 // TERM_DEBUG: invoke i32 {{.*}}bar{{.*}}()
416 // TERM_DEBUG: unwind label %[[TERM_LPAD:.+]],
417 // TERM_DEBUG-NOT: __kmpc_global_thread_num
418 // TERM_DEBUG: [[TERM_LPAD]]:
419 // TERM_DEBUG: call void @__clang_call_terminate
420 // TERM_DEBUG: unreachable
Alexey Bataev8cbe0a62015-02-26 10:27:34 +0000421 for (unsigned i = 131071; i <= 2147483647; i += 127)
Alexey Bataev36bf0112015-03-10 05:15:26 +0000422 a[i] += bar();
Alexey Bataev8cbe0a62015-02-26 10:27:34 +0000423}
Alexey Bataev36bf0112015-03-10 05:15:26 +0000424// TERM_DEBUG: !{{[0-9]+}} = !MDLocation(line: 413,
Alexander Musmana5f070a2014-10-01 06:03:56 +0000425#endif // HEADER
426