brintos

brintos / llvm-project-archived public Read only

0
0
Text · 5.4 KiB · 71567fa Raw
200 lines · cpp
1// RUN: %libomp-cxx20-compile-and-run | FileCheck %s --match-full-lines2 3#ifndef HEADER4#define HEADER5 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    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 76    Iterator &operator++() {77      owner->print("iterator prefix ++");78      pos -= 1;79      return *this;80    }81 82    Iterator operator++(int) {83      owner->print("iterator postfix ++");84      auto result = *this;85      pos -= 1;86      return result;87    }88 89    int operator*() const {90      int result = 2 - pos;91      owner->print("iterator deref: %i", result);92      return result;93    }94 95    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 101    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    void print(const char *msg) const { owner->print(msg); }107  };108 109  Iterator begin() const {110    print("begin()");111    return Iterator(this, 2);112  }113 114  Iterator end() const {115    print("end()");116    return Iterator(this, -1);117  }118 119  void print(const char *msg, ...) const {120    va_list args;121    va_start(args, msg);122    printf("[%s] ", name);123    vprintf(msg, args);124    printf("\n");125    va_end(args);126  }127};128 129int main() {130  printf("do\n");131#pragma omp parallel for collapse(2) num_threads(1)132  for (int i = 0; i < 3; ++i)133#pragma omp unroll partial(2)134    for (Reporter c{"init-stmt"}; auto &&v : Reporter("range"))135      printf("i=%d v=%d\n", i, v);136  printf("done\n");137  return EXIT_SUCCESS;138}139 140#endif /* HEADER */141 142// CHECK:      do143// CHECK-NEXT: [init-stmt] ctor144// CHECK-NEXT: [range] ctor145// CHECK-NEXT: [range] end()146// CHECK-NEXT: [range] begin()147// CHECK-NEXT: [range] begin()148// CHECK-NEXT: [range] iterator distance: 3149// CHECK-NEXT: [range] iterator advance: 0 += 0150// CHECK-NEXT: [range] iterator move assign151// CHECK-NEXT: [range] iterator deref: 0152// CHECK-NEXT: i=0 v=0153// CHECK-NEXT: [range] iterator dtor154// CHECK-NEXT: [range] iterator advance: 0 += 1155// CHECK-NEXT: [range] iterator move assign156// CHECK-NEXT: [range] iterator deref: 1157// CHECK-NEXT: i=0 v=1158// CHECK-NEXT: [range] iterator dtor159// CHECK-NEXT: [range] iterator advance: 0 += 2160// CHECK-NEXT: [range] iterator move assign161// CHECK-NEXT: [range] iterator deref: 2162// CHECK-NEXT: i=0 v=2163// CHECK-NEXT: [range] iterator dtor164// CHECK-NEXT: [range] iterator advance: 0 += 0165// CHECK-NEXT: [range] iterator move assign166// CHECK-NEXT: [range] iterator deref: 0167// CHECK-NEXT: i=1 v=0168// CHECK-NEXT: [range] iterator dtor169// CHECK-NEXT: [range] iterator advance: 0 += 1170// CHECK-NEXT: [range] iterator move assign171// CHECK-NEXT: [range] iterator deref: 1172// CHECK-NEXT: i=1 v=1173// CHECK-NEXT: [range] iterator dtor174// CHECK-NEXT: [range] iterator advance: 0 += 2175// CHECK-NEXT: [range] iterator move assign176// CHECK-NEXT: [range] iterator deref: 2177// CHECK-NEXT: i=1 v=2178// CHECK-NEXT: [range] iterator dtor179// CHECK-NEXT: [range] iterator advance: 0 += 0180// CHECK-NEXT: [range] iterator move assign181// CHECK-NEXT: [range] iterator deref: 0182// CHECK-NEXT: i=2 v=0183// CHECK-NEXT: [range] iterator dtor184// CHECK-NEXT: [range] iterator advance: 0 += 1185// CHECK-NEXT: [range] iterator move assign186// CHECK-NEXT: [range] iterator deref: 1187// CHECK-NEXT: i=2 v=1188// CHECK-NEXT: [range] iterator dtor189// CHECK-NEXT: [range] iterator advance: 0 += 2190// CHECK-NEXT: [range] iterator move assign191// CHECK-NEXT: [range] iterator deref: 2192// CHECK-NEXT: i=2 v=2193// CHECK-NEXT: [range] iterator dtor194// CHECK-NEXT: [range] iterator dtor195// CHECK-NEXT: [range] iterator dtor196// CHECK-NEXT: [range] iterator dtor197// CHECK-NEXT: [range] dtor198// CHECK-NEXT: [init-stmt] dtor199// CHECK-NEXT: done200