LLVM OpenMP 20.0.0git
parallel-wsloop-collapse-foreach.cpp
Go to the documentation of this file.
1// RUN: %libomp-cxx20-compile-and-run | FileCheck %s --match-full-lines
2
3#ifndef HEADER
4#define HEADER
5
6#include <cstdlib>
7#include <cstdarg>
8#include <cstdio>
9#include <vector>
10
11struct Reporter {
12 const char *name;
13
14 Reporter(const char *name) : name(name) { print("ctor"); }
15
16 Reporter() : name("<anon>") { print("ctor"); }
17
18 Reporter(const Reporter &that) : name(that.name) { print("copy ctor"); }
19
20 Reporter(Reporter &&that) : name(that.name) { print("move ctor"); }
21
22 ~Reporter() { print("dtor"); }
23
24 const Reporter &operator=(const Reporter &that) {
25 print("copy assign");
26 this->name = that.name;
27 return *this;
28 }
29
30 const Reporter &operator=(Reporter &&that) {
31 print("move assign");
32 this->name = that.name;
33 return *this;
34 }
35
36 struct Iterator {
37 const Reporter *owner;
38 int pos;
39
40 Iterator(const Reporter *owner, int pos) : owner(owner), pos(pos) {}
41
42 Iterator(const Iterator &that) : owner(that.owner), pos(that.pos) {
43 owner->print("iterator copy ctor");
44 }
45
46 Iterator(Iterator &&that) : owner(that.owner), pos(that.pos) {
47 owner->print("iterator move ctor");
48 }
49
50 ~Iterator() { owner->print("iterator dtor"); }
51
52 const Iterator &operator=(const Iterator &that) {
53 owner->print("iterator copy assign");
54 this->owner = that.owner;
55 this->pos = that.pos;
56 return *this;
57 }
58
59 const Iterator &operator=(Iterator &&that) {
60 owner->print("iterator move assign");
61 this->owner = that.owner;
62 this->pos = that.pos;
63 return *this;
64 }
65
66 bool operator==(const Iterator &that) const {
67 owner->print("iterator %d == %d", 2 - this->pos, 2 - that.pos);
68 return this->pos == that.pos;
69 }
70
71 Iterator &operator++() {
72 owner->print("iterator prefix ++");
73 pos -= 1;
74 return *this;
75 }
76
77 Iterator operator++(int) {
78 owner->print("iterator postfix ++");
79 auto result = *this;
80 pos -= 1;
81 return result;
82 }
83
84 int operator*() const {
85 int result = 2 - pos;
86 owner->print("iterator deref: %i", result);
87 return result;
88 }
89
90 size_t operator-(const Iterator &that) const {
91 int result = (2 - this->pos) - (2 - that.pos);
92 owner->print("iterator distance: %d", result);
93 return result;
94 }
95
96 Iterator operator+(int steps) const {
97 owner->print("iterator advance: %i += %i", 2 - this->pos, steps);
98 return Iterator(owner, pos - steps);
99 }
100 };
101
102 Iterator begin() const {
103 print("begin()");
104 return Iterator(this, 2);
105 }
106
107 Iterator end() const {
108 print("end()");
109 return Iterator(this, -1);
110 }
111
112 void print(const char *msg, ...) const {
113 va_list args;
114 va_start(args, msg);
115 printf("[%s] ", name);
116 vprintf(msg, args);
117 printf("\n");
118 va_end(args);
119 }
120};
121
122int main() {
123 printf("do\n");
124#pragma omp parallel for collapse(3) num_threads(1)
125 for (int i = 0; i < 3; ++i)
126#pragma omp tile sizes(2, 2)
127 for (Reporter c{"C"}; auto &&v : Reporter("A"))
128 for (Reporter d{"D"}; auto &&w : Reporter("B"))
129 printf("i=%d v=%d w=%d\n", i, v, w);
130 printf("done\n");
131 return EXIT_SUCCESS;
132}
133
134#endif /* HEADER */
135
136// CHECK: do
137// CHECK-NEXT: [C] ctor
138// CHECK-NEXT: [A] ctor
139// CHECK-NEXT: [A] end()
140// CHECK-NEXT: [A] begin()
141// CHECK-NEXT: [A] begin()
142// CHECK-NEXT: [A] iterator distance: 3
143// CHECK-NEXT: [D] ctor
144// CHECK-NEXT: [B] ctor
145// CHECK-NEXT: [B] end()
146// CHECK-NEXT: [B] begin()
147// CHECK-NEXT: [B] begin()
148// CHECK-NEXT: [B] iterator distance: 3
149// CHECK-NEXT: [A] iterator advance: 0 += 0
150// CHECK-NEXT: [A] iterator move assign
151// CHECK-NEXT: [A] iterator deref: 0
152// CHECK-NEXT: [B] iterator advance: 0 += 0
153// CHECK-NEXT: [B] iterator move assign
154// CHECK-NEXT: [B] iterator deref: 0
155// CHECK-NEXT: i=0 v=0 w=0
156// CHECK-NEXT: [B] iterator dtor
157// CHECK-NEXT: [B] iterator advance: 0 += 1
158// CHECK-NEXT: [B] iterator move assign
159// CHECK-NEXT: [B] iterator deref: 1
160// CHECK-NEXT: i=0 v=0 w=1
161// CHECK-NEXT: [B] iterator dtor
162// CHECK-NEXT: [A] iterator dtor
163// CHECK-NEXT: [A] iterator advance: 0 += 1
164// CHECK-NEXT: [A] iterator move assign
165// CHECK-NEXT: [A] iterator deref: 1
166// CHECK-NEXT: [B] iterator advance: 0 += 0
167// CHECK-NEXT: [B] iterator move assign
168// CHECK-NEXT: [B] iterator deref: 0
169// CHECK-NEXT: i=0 v=1 w=0
170// CHECK-NEXT: [B] iterator dtor
171// CHECK-NEXT: [B] iterator advance: 0 += 1
172// CHECK-NEXT: [B] iterator move assign
173// CHECK-NEXT: [B] iterator deref: 1
174// CHECK-NEXT: i=0 v=1 w=1
175// CHECK-NEXT: [B] iterator dtor
176// CHECK-NEXT: [A] iterator dtor
177// CHECK-NEXT: [A] iterator advance: 0 += 0
178// CHECK-NEXT: [A] iterator move assign
179// CHECK-NEXT: [A] iterator deref: 0
180// CHECK-NEXT: [B] iterator advance: 0 += 2
181// CHECK-NEXT: [B] iterator move assign
182// CHECK-NEXT: [B] iterator deref: 2
183// CHECK-NEXT: i=0 v=0 w=2
184// CHECK-NEXT: [B] iterator dtor
185// CHECK-NEXT: [A] iterator dtor
186// CHECK-NEXT: [A] iterator advance: 0 += 1
187// CHECK-NEXT: [A] iterator move assign
188// CHECK-NEXT: [A] iterator deref: 1
189// CHECK-NEXT: [B] iterator advance: 0 += 2
190// CHECK-NEXT: [B] iterator move assign
191// CHECK-NEXT: [B] iterator deref: 2
192// CHECK-NEXT: i=0 v=1 w=2
193// CHECK-NEXT: [B] iterator dtor
194// CHECK-NEXT: [A] iterator dtor
195// CHECK-NEXT: [A] iterator advance: 0 += 2
196// CHECK-NEXT: [A] iterator move assign
197// CHECK-NEXT: [A] iterator deref: 2
198// CHECK-NEXT: [B] iterator advance: 0 += 0
199// CHECK-NEXT: [B] iterator move assign
200// CHECK-NEXT: [B] iterator deref: 0
201// CHECK-NEXT: i=0 v=2 w=0
202// CHECK-NEXT: [B] iterator dtor
203// CHECK-NEXT: [B] iterator advance: 0 += 1
204// CHECK-NEXT: [B] iterator move assign
205// CHECK-NEXT: [B] iterator deref: 1
206// CHECK-NEXT: i=0 v=2 w=1
207// CHECK-NEXT: [B] iterator dtor
208// CHECK-NEXT: [A] iterator dtor
209// CHECK-NEXT: [A] iterator advance: 0 += 2
210// CHECK-NEXT: [A] iterator move assign
211// CHECK-NEXT: [A] iterator deref: 2
212// CHECK-NEXT: [B] iterator advance: 0 += 2
213// CHECK-NEXT: [B] iterator move assign
214// CHECK-NEXT: [B] iterator deref: 2
215// CHECK-NEXT: i=0 v=2 w=2
216// CHECK-NEXT: [B] iterator dtor
217// CHECK-NEXT: [A] iterator dtor
218// CHECK-NEXT: [A] iterator advance: 0 += 0
219// CHECK-NEXT: [A] iterator move assign
220// CHECK-NEXT: [A] iterator deref: 0
221// CHECK-NEXT: [B] iterator advance: 0 += 0
222// CHECK-NEXT: [B] iterator move assign
223// CHECK-NEXT: [B] iterator deref: 0
224// CHECK-NEXT: i=1 v=0 w=0
225// CHECK-NEXT: [B] iterator dtor
226// CHECK-NEXT: [B] iterator advance: 0 += 1
227// CHECK-NEXT: [B] iterator move assign
228// CHECK-NEXT: [B] iterator deref: 1
229// CHECK-NEXT: i=1 v=0 w=1
230// CHECK-NEXT: [B] iterator dtor
231// CHECK-NEXT: [A] iterator dtor
232// CHECK-NEXT: [A] iterator advance: 0 += 1
233// CHECK-NEXT: [A] iterator move assign
234// CHECK-NEXT: [A] iterator deref: 1
235// CHECK-NEXT: [B] iterator advance: 0 += 0
236// CHECK-NEXT: [B] iterator move assign
237// CHECK-NEXT: [B] iterator deref: 0
238// CHECK-NEXT: i=1 v=1 w=0
239// CHECK-NEXT: [B] iterator dtor
240// CHECK-NEXT: [B] iterator advance: 0 += 1
241// CHECK-NEXT: [B] iterator move assign
242// CHECK-NEXT: [B] iterator deref: 1
243// CHECK-NEXT: i=1 v=1 w=1
244// CHECK-NEXT: [B] iterator dtor
245// CHECK-NEXT: [A] iterator dtor
246// CHECK-NEXT: [A] iterator advance: 0 += 0
247// CHECK-NEXT: [A] iterator move assign
248// CHECK-NEXT: [A] iterator deref: 0
249// CHECK-NEXT: [B] iterator advance: 0 += 2
250// CHECK-NEXT: [B] iterator move assign
251// CHECK-NEXT: [B] iterator deref: 2
252// CHECK-NEXT: i=1 v=0 w=2
253// CHECK-NEXT: [B] iterator dtor
254// CHECK-NEXT: [A] iterator dtor
255// CHECK-NEXT: [A] iterator advance: 0 += 1
256// CHECK-NEXT: [A] iterator move assign
257// CHECK-NEXT: [A] iterator deref: 1
258// CHECK-NEXT: [B] iterator advance: 0 += 2
259// CHECK-NEXT: [B] iterator move assign
260// CHECK-NEXT: [B] iterator deref: 2
261// CHECK-NEXT: i=1 v=1 w=2
262// CHECK-NEXT: [B] iterator dtor
263// CHECK-NEXT: [A] iterator dtor
264// CHECK-NEXT: [A] iterator advance: 0 += 2
265// CHECK-NEXT: [A] iterator move assign
266// CHECK-NEXT: [A] iterator deref: 2
267// CHECK-NEXT: [B] iterator advance: 0 += 0
268// CHECK-NEXT: [B] iterator move assign
269// CHECK-NEXT: [B] iterator deref: 0
270// CHECK-NEXT: i=1 v=2 w=0
271// CHECK-NEXT: [B] iterator dtor
272// CHECK-NEXT: [B] iterator advance: 0 += 1
273// CHECK-NEXT: [B] iterator move assign
274// CHECK-NEXT: [B] iterator deref: 1
275// CHECK-NEXT: i=1 v=2 w=1
276// CHECK-NEXT: [B] iterator dtor
277// CHECK-NEXT: [A] iterator dtor
278// CHECK-NEXT: [A] iterator advance: 0 += 2
279// CHECK-NEXT: [A] iterator move assign
280// CHECK-NEXT: [A] iterator deref: 2
281// CHECK-NEXT: [B] iterator advance: 0 += 2
282// CHECK-NEXT: [B] iterator move assign
283// CHECK-NEXT: [B] iterator deref: 2
284// CHECK-NEXT: i=1 v=2 w=2
285// CHECK-NEXT: [B] iterator dtor
286// CHECK-NEXT: [A] iterator dtor
287// CHECK-NEXT: [A] iterator advance: 0 += 0
288// CHECK-NEXT: [A] iterator move assign
289// CHECK-NEXT: [A] iterator deref: 0
290// CHECK-NEXT: [B] iterator advance: 0 += 0
291// CHECK-NEXT: [B] iterator move assign
292// CHECK-NEXT: [B] iterator deref: 0
293// CHECK-NEXT: i=2 v=0 w=0
294// CHECK-NEXT: [B] iterator dtor
295// CHECK-NEXT: [B] iterator advance: 0 += 1
296// CHECK-NEXT: [B] iterator move assign
297// CHECK-NEXT: [B] iterator deref: 1
298// CHECK-NEXT: i=2 v=0 w=1
299// CHECK-NEXT: [B] iterator dtor
300// CHECK-NEXT: [A] iterator dtor
301// CHECK-NEXT: [A] iterator advance: 0 += 1
302// CHECK-NEXT: [A] iterator move assign
303// CHECK-NEXT: [A] iterator deref: 1
304// CHECK-NEXT: [B] iterator advance: 0 += 0
305// CHECK-NEXT: [B] iterator move assign
306// CHECK-NEXT: [B] iterator deref: 0
307// CHECK-NEXT: i=2 v=1 w=0
308// CHECK-NEXT: [B] iterator dtor
309// CHECK-NEXT: [B] iterator advance: 0 += 1
310// CHECK-NEXT: [B] iterator move assign
311// CHECK-NEXT: [B] iterator deref: 1
312// CHECK-NEXT: i=2 v=1 w=1
313// CHECK-NEXT: [B] iterator dtor
314// CHECK-NEXT: [A] iterator dtor
315// CHECK-NEXT: [A] iterator advance: 0 += 0
316// CHECK-NEXT: [A] iterator move assign
317// CHECK-NEXT: [A] iterator deref: 0
318// CHECK-NEXT: [B] iterator advance: 0 += 2
319// CHECK-NEXT: [B] iterator move assign
320// CHECK-NEXT: [B] iterator deref: 2
321// CHECK-NEXT: i=2 v=0 w=2
322// CHECK-NEXT: [B] iterator dtor
323// CHECK-NEXT: [A] iterator dtor
324// CHECK-NEXT: [A] iterator advance: 0 += 1
325// CHECK-NEXT: [A] iterator move assign
326// CHECK-NEXT: [A] iterator deref: 1
327// CHECK-NEXT: [B] iterator advance: 0 += 2
328// CHECK-NEXT: [B] iterator move assign
329// CHECK-NEXT: [B] iterator deref: 2
330// CHECK-NEXT: i=2 v=1 w=2
331// CHECK-NEXT: [B] iterator dtor
332// CHECK-NEXT: [A] iterator dtor
333// CHECK-NEXT: [A] iterator advance: 0 += 2
334// CHECK-NEXT: [A] iterator move assign
335// CHECK-NEXT: [A] iterator deref: 2
336// CHECK-NEXT: [B] iterator advance: 0 += 0
337// CHECK-NEXT: [B] iterator move assign
338// CHECK-NEXT: [B] iterator deref: 0
339// CHECK-NEXT: i=2 v=2 w=0
340// CHECK-NEXT: [B] iterator dtor
341// CHECK-NEXT: [B] iterator advance: 0 += 1
342// CHECK-NEXT: [B] iterator move assign
343// CHECK-NEXT: [B] iterator deref: 1
344// CHECK-NEXT: i=2 v=2 w=1
345// CHECK-NEXT: [B] iterator dtor
346// CHECK-NEXT: [A] iterator dtor
347// CHECK-NEXT: [A] iterator advance: 0 += 2
348// CHECK-NEXT: [A] iterator move assign
349// CHECK-NEXT: [A] iterator deref: 2
350// CHECK-NEXT: [B] iterator advance: 0 += 2
351// CHECK-NEXT: [B] iterator move assign
352// CHECK-NEXT: [B] iterator deref: 2
353// CHECK-NEXT: i=2 v=2 w=2
354// CHECK-NEXT: [B] iterator dtor
355// CHECK-NEXT: [A] iterator dtor
356// CHECK-NEXT: [B] iterator dtor
357// CHECK-NEXT: [B] iterator dtor
358// CHECK-NEXT: [B] iterator dtor
359// CHECK-NEXT: [B] dtor
360// CHECK-NEXT: [D] dtor
361// CHECK-NEXT: [A] iterator dtor
362// CHECK-NEXT: [A] iterator dtor
363// CHECK-NEXT: [A] iterator dtor
364// CHECK-NEXT: [A] dtor
365// CHECK-NEXT: [C] dtor
366// CHECK-NEXT: done
result
int result[2]
Definition: cancellation_for_sections.c:13
d
void const char const char int ITT_FORMAT __itt_group_sync x void const char ITT_FORMAT __itt_group_sync s void ITT_FORMAT __itt_group_sync p void ITT_FORMAT p void ITT_FORMAT p no args __itt_suppress_mode_t unsigned int void size_t ITT_FORMAT d
Definition: ittnotify_static.h:200
args
#define args
i
#define i
Definition: kmp_stub.cpp:87
sizes
size_t sizes[]
Definition: kmp_taskdeps.cpp:60
Reporter::Iterator::owner
const Reporter * owner
Definition: foreach.cpp:37
Reporter::Iterator::operator=
const Iterator & operator=(const Iterator &that)
Definition: parallel-wsloop-collapse-foreach.cpp:52
Reporter::Iterator::operator==
bool operator==(const Iterator &that) const
Definition: parallel-wsloop-collapse-foreach.cpp:66
Reporter::Iterator::operator+
Iterator operator+(int steps) const
Definition: parallel-wsloop-collapse-foreach.cpp:96
Reporter::Iterator::Iterator
Iterator(const Reporter *owner, int pos)
Definition: parallel-wsloop-collapse-foreach.cpp:40
Reporter::Iterator::operator-
size_t operator-(const Iterator &that) const
Definition: parallel-wsloop-collapse-foreach.cpp:90
Reporter::Iterator::operator=
const Iterator & operator=(Iterator &&that)
Definition: parallel-wsloop-collapse-foreach.cpp:59
Reporter::print
void print(const char *msg,...) const
Definition: foreach.cpp:114
Reporter::operator=
const Reporter & operator=(const Reporter &that)
Definition: parallel-wsloop-collapse-foreach.cpp:24
Reporter::operator=
const Reporter & operator=(Reporter &&that)
Definition: parallel-wsloop-collapse-foreach.cpp:30
Reporter::name
const char * name
Definition: foreach.cpp:12
Reporter::Reporter
Reporter(const char *name)
Definition: parallel-wsloop-collapse-foreach.cpp:14
Reporter::Reporter
Reporter(const Reporter &that)
Definition: parallel-wsloop-collapse-foreach.cpp:18
Generated on Wed Feb 5 2025 10:57:21 for LLVM OpenMP by doxygen 1.9.6