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
11 struct Reporter {
12 const char *name;
13
ReporterReporter14 Reporter(const char *name) : name(name) { print("ctor"); }
15
ReporterReporter16 Reporter() : name("<anon>") { print("ctor"); }
17
ReporterReporter18 Reporter(const Reporter &that) : name(that.name) { print("copy ctor"); }
19
ReporterReporter20 Reporter(Reporter &&that) : name(that.name) { print("move ctor"); }
21
~ReporterReporter22 ~Reporter() { print("dtor"); }
23
operator =Reporter24 const Reporter &operator=(const Reporter &that) {
25 print("copy assign");
26 this->name = that.name;
27 return *this;
28 }
29
operator =Reporter30 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
IteratorReporter::Iterator40 Iterator(const Reporter *owner, int pos) : owner(owner), pos(pos) {}
41
IteratorReporter::Iterator42 Iterator(const Iterator &that) : owner(that.owner), pos(that.pos) {
43 owner->print("iterator copy ctor");
44 }
45
IteratorReporter::Iterator46 Iterator(Iterator &&that) : owner(that.owner), pos(that.pos) {
47 owner->print("iterator move ctor");
48 }
49
~IteratorReporter::Iterator50 ~Iterator() { owner->print("iterator dtor"); }
51
operator =Reporter::Iterator52 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
operator =Reporter::Iterator59 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
operator ==Reporter::Iterator66 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
operator !=Reporter::Iterator71 bool operator!=(const Iterator &that) const {
72 owner->print("iterator %d != %d", 2 - this->pos, 2 - that.pos);
73 return this->pos == that.pos;
74 }
75
operator ++Reporter::Iterator76 Iterator &operator++() {
77 owner->print("iterator prefix ++");
78 pos -= 1;
79 return *this;
80 }
81
operator ++Reporter::Iterator82 Iterator operator++(int) {
83 owner->print("iterator postfix ++");
84 auto result = *this;
85 pos -= 1;
86 return result;
87 }
88
operator *Reporter::Iterator89 int operator*() const {
90 int result = 2 - pos;
91 owner->print("iterator deref: %i", result);
92 return result;
93 }
94
operator -Reporter::Iterator95 size_t operator-(const Iterator &that) const {
96 int result = (2 - this->pos) - (2 - that.pos);
97 owner->print("iterator distance: %d", result);
98 return result;
99 }
100
operator +Reporter::Iterator101 Iterator operator+(int steps) const {
102 owner->print("iterator advance: %i += %i", 2 - this->pos, steps);
103 return Iterator(owner, pos - steps);
104 }
105 };
106
beginReporter107 Iterator begin() const {
108 print("begin()");
109 return Iterator(this, 2);
110 }
111
endReporter112 Iterator end() const {
113 print("end()");
114 return Iterator(this, -1);
115 }
116
printReporter117 void print(const char *msg, ...) const {
118 va_list args;
119 va_start(args, msg);
120 printf("[%s] ", name);
121 vprintf(msg, args);
122 printf("\n");
123 va_end(args);
124 }
125 };
126
main()127 int main() {
128 printf("do\n");
129 {
130 Reporter A("A"), B("B");
131 #pragma omp tile sizes(2, 2)
132 for (auto it = A.begin(); it != A.end(); ++it)
133 for (auto jt = B.begin(); jt != B.end(); ++jt)
134 printf("i=%d j=%d\n", *it, *jt);
135 }
136 printf("done\n");
137 return EXIT_SUCCESS;
138 }
139
140 #endif /* HEADER */
141
142 // CHECK: do
143 // CHECK-NEXT: [A] ctor
144 // CHECK-NEXT: [B] ctor
145 // CHECK-NEXT: [A] begin()
146 // CHECK-NEXT: [A] begin()
147 // CHECK-NEXT: [A] end()
148 // CHECK-NEXT: [A] iterator distance: 3
149 // CHECK-NEXT: [B] begin()
150 // CHECK-NEXT: [B] begin()
151 // CHECK-NEXT: [B] end()
152 // CHECK-NEXT: [B] iterator distance: 3
153 // CHECK-NEXT: [A] iterator advance: 0 += 0
154 // CHECK-NEXT: [A] iterator move assign
155 // CHECK-NEXT: [B] iterator advance: 0 += 0
156 // CHECK-NEXT: [B] iterator move assign
157 // CHECK-NEXT: [A] iterator deref: 0
158 // CHECK-NEXT: [B] iterator deref: 0
159 // CHECK-NEXT: i=0 j=0
160 // CHECK-NEXT: [B] iterator dtor
161 // CHECK-NEXT: [B] iterator advance: 0 += 1
162 // CHECK-NEXT: [B] iterator move assign
163 // CHECK-NEXT: [A] iterator deref: 0
164 // CHECK-NEXT: [B] iterator deref: 1
165 // CHECK-NEXT: i=0 j=1
166 // CHECK-NEXT: [B] iterator dtor
167 // CHECK-NEXT: [A] iterator dtor
168 // CHECK-NEXT: [A] iterator advance: 0 += 1
169 // CHECK-NEXT: [A] iterator move assign
170 // CHECK-NEXT: [B] iterator advance: 0 += 0
171 // CHECK-NEXT: [B] iterator move assign
172 // CHECK-NEXT: [A] iterator deref: 1
173 // CHECK-NEXT: [B] iterator deref: 0
174 // CHECK-NEXT: i=1 j=0
175 // CHECK-NEXT: [B] iterator dtor
176 // CHECK-NEXT: [B] iterator advance: 0 += 1
177 // CHECK-NEXT: [B] iterator move assign
178 // CHECK-NEXT: [A] iterator deref: 1
179 // CHECK-NEXT: [B] iterator deref: 1
180 // CHECK-NEXT: i=1 j=1
181 // CHECK-NEXT: [B] iterator dtor
182 // CHECK-NEXT: [A] iterator dtor
183 // CHECK-NEXT: [A] iterator advance: 0 += 0
184 // CHECK-NEXT: [A] iterator move assign
185 // CHECK-NEXT: [B] iterator advance: 0 += 2
186 // CHECK-NEXT: [B] iterator move assign
187 // CHECK-NEXT: [A] iterator deref: 0
188 // CHECK-NEXT: [B] iterator deref: 2
189 // CHECK-NEXT: i=0 j=2
190 // CHECK-NEXT: [B] iterator dtor
191 // CHECK-NEXT: [A] iterator dtor
192 // CHECK-NEXT: [A] iterator advance: 0 += 1
193 // CHECK-NEXT: [A] iterator move assign
194 // CHECK-NEXT: [B] iterator advance: 0 += 2
195 // CHECK-NEXT: [B] iterator move assign
196 // CHECK-NEXT: [A] iterator deref: 1
197 // CHECK-NEXT: [B] iterator deref: 2
198 // CHECK-NEXT: i=1 j=2
199 // CHECK-NEXT: [B] iterator dtor
200 // CHECK-NEXT: [A] iterator dtor
201 // CHECK-NEXT: [A] iterator advance: 0 += 2
202 // CHECK-NEXT: [A] iterator move assign
203 // CHECK-NEXT: [B] iterator advance: 0 += 0
204 // CHECK-NEXT: [B] iterator move assign
205 // CHECK-NEXT: [A] iterator deref: 2
206 // CHECK-NEXT: [B] iterator deref: 0
207 // CHECK-NEXT: i=2 j=0
208 // CHECK-NEXT: [B] iterator dtor
209 // CHECK-NEXT: [B] iterator advance: 0 += 1
210 // CHECK-NEXT: [B] iterator move assign
211 // CHECK-NEXT: [A] iterator deref: 2
212 // CHECK-NEXT: [B] iterator deref: 1
213 // CHECK-NEXT: i=2 j=1
214 // CHECK-NEXT: [B] iterator dtor
215 // CHECK-NEXT: [A] iterator dtor
216 // CHECK-NEXT: [A] iterator advance: 0 += 2
217 // CHECK-NEXT: [A] iterator move assign
218 // CHECK-NEXT: [B] iterator advance: 0 += 2
219 // CHECK-NEXT: [B] iterator move assign
220 // CHECK-NEXT: [A] iterator deref: 2
221 // CHECK-NEXT: [B] iterator deref: 2
222 // CHECK-NEXT: i=2 j=2
223 // CHECK-NEXT: [B] iterator dtor
224 // CHECK-NEXT: [A] iterator dtor
225 // CHECK-NEXT: [B] iterator dtor
226 // CHECK-NEXT: [B] iterator dtor
227 // CHECK-NEXT: [A] iterator dtor
228 // CHECK-NEXT: [A] iterator dtor
229 // CHECK-NEXT: [B] iterator dtor
230 // CHECK-NEXT: [A] iterator dtor
231 // CHECK-NEXT: [B] dtor
232 // CHECK-NEXT: [A] dtor
233 // CHECK-NEXT: done
234