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 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 void print(const char *msg) const { owner->print(msg); } 102 }; 103 104 Iterator begin() const { 105 print("begin()"); 106 return Iterator(this, 2); 107 } 108 109 Iterator end() const { 110 print("end()"); 111 return Iterator(this, -1); 112 } 113 114 void print(const char *msg, ...) const { 115 va_list args; 116 va_start(args, msg); 117 printf("[%s] ", name); 118 vprintf(msg, args); 119 printf("\n"); 120 va_end(args); 121 } 122 }; 123 124 int main() { 125 printf("do\n"); 126 #pragma omp parallel for collapse(3) num_threads(1) 127 for (int i = 0; i < 3; ++i) 128 #pragma omp reverse 129 for (Reporter c{"init-stmt"}; auto &&v : Reporter("range")) 130 for (int k = 0; k < 3; ++k) 131 printf("i=%d j=%d k=%d\n", i, v, k); 132 printf("done\n"); 133 return EXIT_SUCCESS; 134 } 135 136 #endif /* HEADER */ 137 138 // CHECK: do 139 // CHECK-NEXT: [init-stmt] ctor 140 // CHECK-NEXT: [range] ctor 141 // CHECK-NEXT: [range] end() 142 // CHECK-NEXT: [range] begin() 143 // CHECK-NEXT: [range] begin() 144 // CHECK-NEXT: [range] iterator distance: 3 145 // CHECK-NEXT: [range] iterator advance: 0 += 2 146 // CHECK-NEXT: [range] iterator move assign 147 // CHECK-NEXT: [range] iterator deref: 2 148 // CHECK-NEXT: i=0 j=2 k=0 149 // CHECK-NEXT: [range] iterator dtor 150 // CHECK-NEXT: [range] iterator advance: 0 += 2 151 // CHECK-NEXT: [range] iterator move assign 152 // CHECK-NEXT: [range] iterator deref: 2 153 // CHECK-NEXT: i=0 j=2 k=1 154 // CHECK-NEXT: [range] iterator dtor 155 // CHECK-NEXT: [range] iterator advance: 0 += 2 156 // CHECK-NEXT: [range] iterator move assign 157 // CHECK-NEXT: [range] iterator deref: 2 158 // CHECK-NEXT: i=0 j=2 k=2 159 // CHECK-NEXT: [range] iterator dtor 160 // CHECK-NEXT: [range] iterator advance: 0 += 1 161 // CHECK-NEXT: [range] iterator move assign 162 // CHECK-NEXT: [range] iterator deref: 1 163 // CHECK-NEXT: i=0 j=1 k=0 164 // CHECK-NEXT: [range] iterator dtor 165 // CHECK-NEXT: [range] iterator advance: 0 += 1 166 // CHECK-NEXT: [range] iterator move assign 167 // CHECK-NEXT: [range] iterator deref: 1 168 // CHECK-NEXT: i=0 j=1 k=1 169 // CHECK-NEXT: [range] iterator dtor 170 // CHECK-NEXT: [range] iterator advance: 0 += 1 171 // CHECK-NEXT: [range] iterator move assign 172 // CHECK-NEXT: [range] iterator deref: 1 173 // CHECK-NEXT: i=0 j=1 k=2 174 // CHECK-NEXT: [range] iterator dtor 175 // CHECK-NEXT: [range] iterator advance: 0 += 0 176 // CHECK-NEXT: [range] iterator move assign 177 // CHECK-NEXT: [range] iterator deref: 0 178 // CHECK-NEXT: i=0 j=0 k=0 179 // CHECK-NEXT: [range] iterator dtor 180 // CHECK-NEXT: [range] iterator advance: 0 += 0 181 // CHECK-NEXT: [range] iterator move assign 182 // CHECK-NEXT: [range] iterator deref: 0 183 // CHECK-NEXT: i=0 j=0 k=1 184 // CHECK-NEXT: [range] iterator dtor 185 // CHECK-NEXT: [range] iterator advance: 0 += 0 186 // CHECK-NEXT: [range] iterator move assign 187 // CHECK-NEXT: [range] iterator deref: 0 188 // CHECK-NEXT: i=0 j=0 k=2 189 // CHECK-NEXT: [range] iterator dtor 190 // CHECK-NEXT: [range] iterator advance: 0 += 2 191 // CHECK-NEXT: [range] iterator move assign 192 // CHECK-NEXT: [range] iterator deref: 2 193 // CHECK-NEXT: i=1 j=2 k=0 194 // CHECK-NEXT: [range] iterator dtor 195 // CHECK-NEXT: [range] iterator advance: 0 += 2 196 // CHECK-NEXT: [range] iterator move assign 197 // CHECK-NEXT: [range] iterator deref: 2 198 // CHECK-NEXT: i=1 j=2 k=1 199 // CHECK-NEXT: [range] iterator dtor 200 // CHECK-NEXT: [range] iterator advance: 0 += 2 201 // CHECK-NEXT: [range] iterator move assign 202 // CHECK-NEXT: [range] iterator deref: 2 203 // CHECK-NEXT: i=1 j=2 k=2 204 // CHECK-NEXT: [range] iterator dtor 205 // CHECK-NEXT: [range] iterator advance: 0 += 1 206 // CHECK-NEXT: [range] iterator move assign 207 // CHECK-NEXT: [range] iterator deref: 1 208 // CHECK-NEXT: i=1 j=1 k=0 209 // CHECK-NEXT: [range] iterator dtor 210 // CHECK-NEXT: [range] iterator advance: 0 += 1 211 // CHECK-NEXT: [range] iterator move assign 212 // CHECK-NEXT: [range] iterator deref: 1 213 // CHECK-NEXT: i=1 j=1 k=1 214 // CHECK-NEXT: [range] iterator dtor 215 // CHECK-NEXT: [range] iterator advance: 0 += 1 216 // CHECK-NEXT: [range] iterator move assign 217 // CHECK-NEXT: [range] iterator deref: 1 218 // CHECK-NEXT: i=1 j=1 k=2 219 // CHECK-NEXT: [range] iterator dtor 220 // CHECK-NEXT: [range] iterator advance: 0 += 0 221 // CHECK-NEXT: [range] iterator move assign 222 // CHECK-NEXT: [range] iterator deref: 0 223 // CHECK-NEXT: i=1 j=0 k=0 224 // CHECK-NEXT: [range] iterator dtor 225 // CHECK-NEXT: [range] iterator advance: 0 += 0 226 // CHECK-NEXT: [range] iterator move assign 227 // CHECK-NEXT: [range] iterator deref: 0 228 // CHECK-NEXT: i=1 j=0 k=1 229 // CHECK-NEXT: [range] iterator dtor 230 // CHECK-NEXT: [range] iterator advance: 0 += 0 231 // CHECK-NEXT: [range] iterator move assign 232 // CHECK-NEXT: [range] iterator deref: 0 233 // CHECK-NEXT: i=1 j=0 k=2 234 // CHECK-NEXT: [range] iterator dtor 235 // CHECK-NEXT: [range] iterator advance: 0 += 2 236 // CHECK-NEXT: [range] iterator move assign 237 // CHECK-NEXT: [range] iterator deref: 2 238 // CHECK-NEXT: i=2 j=2 k=0 239 // CHECK-NEXT: [range] iterator dtor 240 // CHECK-NEXT: [range] iterator advance: 0 += 2 241 // CHECK-NEXT: [range] iterator move assign 242 // CHECK-NEXT: [range] iterator deref: 2 243 // CHECK-NEXT: i=2 j=2 k=1 244 // CHECK-NEXT: [range] iterator dtor 245 // CHECK-NEXT: [range] iterator advance: 0 += 2 246 // CHECK-NEXT: [range] iterator move assign 247 // CHECK-NEXT: [range] iterator deref: 2 248 // CHECK-NEXT: i=2 j=2 k=2 249 // CHECK-NEXT: [range] iterator dtor 250 // CHECK-NEXT: [range] iterator advance: 0 += 1 251 // CHECK-NEXT: [range] iterator move assign 252 // CHECK-NEXT: [range] iterator deref: 1 253 // CHECK-NEXT: i=2 j=1 k=0 254 // CHECK-NEXT: [range] iterator dtor 255 // CHECK-NEXT: [range] iterator advance: 0 += 1 256 // CHECK-NEXT: [range] iterator move assign 257 // CHECK-NEXT: [range] iterator deref: 1 258 // CHECK-NEXT: i=2 j=1 k=1 259 // CHECK-NEXT: [range] iterator dtor 260 // CHECK-NEXT: [range] iterator advance: 0 += 1 261 // CHECK-NEXT: [range] iterator move assign 262 // CHECK-NEXT: [range] iterator deref: 1 263 // CHECK-NEXT: i=2 j=1 k=2 264 // CHECK-NEXT: [range] iterator dtor 265 // CHECK-NEXT: [range] iterator advance: 0 += 0 266 // CHECK-NEXT: [range] iterator move assign 267 // CHECK-NEXT: [range] iterator deref: 0 268 // CHECK-NEXT: i=2 j=0 k=0 269 // CHECK-NEXT: [range] iterator dtor 270 // CHECK-NEXT: [range] iterator advance: 0 += 0 271 // CHECK-NEXT: [range] iterator move assign 272 // CHECK-NEXT: [range] iterator deref: 0 273 // CHECK-NEXT: i=2 j=0 k=1 274 // CHECK-NEXT: [range] iterator dtor 275 // CHECK-NEXT: [range] iterator advance: 0 += 0 276 // CHECK-NEXT: [range] iterator move assign 277 // CHECK-NEXT: [range] iterator deref: 0 278 // CHECK-NEXT: i=2 j=0 k=2 279 // CHECK-NEXT: [range] iterator dtor 280 // CHECK-NEXT: [range] iterator dtor 281 // CHECK-NEXT: [range] iterator dtor 282 // CHECK-NEXT: [range] iterator dtor 283 // CHECK-NEXT: [range] dtor 284 // CHECK-NEXT: [init-stmt] dtor 285 // CHECK-NEXT: done 286