brintos

brintos / llvm-project-archived public Read only

0
0
Text · 5.5 KiB · dcbbdf1 Raw
208 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    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 124int main() {125  printf("do\n");126#pragma omp parallel for collapse(2) num_threads(1)127  for (int i = 0; i < 3; ++i)128#pragma omp fuse129  {130    for (Reporter c{"init-stmt"}; auto &&v : Reporter("range"))131      printf("i=%d v=%d\n", i, v);132    for (int vv = 0; vv < 3; ++vv)133      printf("i=%d vv=%d\n", i, vv);134  }135  printf("done\n");136  return EXIT_SUCCESS;137}138 139#endif /* HEADER */140 141// CHECK: do142// CHECK-NEXT: [init-stmt] ctor143// CHECK-NEXT: [range] ctor144// CHECK-NEXT: [range] end()145// CHECK-NEXT: [range] begin()146// CHECK-NEXT: [range] begin()147// CHECK-NEXT: [range] iterator distance: 3148// CHECK-NEXT: [range] iterator advance: 0 += 0149// CHECK-NEXT: [range] iterator move assign150// CHECK-NEXT: [range] iterator deref: 0151// CHECK-NEXT: i=0 v=0152// CHECK-NEXT: [range] iterator dtor153// CHECK-NEXT: i=0 vv=0154// 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: i=0 vv=1160// CHECK-NEXT: [range] iterator advance: 0 += 2161// CHECK-NEXT: [range] iterator move assign162// CHECK-NEXT: [range] iterator deref: 2163// CHECK-NEXT: i=0 v=2164// CHECK-NEXT: [range] iterator dtor165// CHECK-NEXT: i=0 vv=2166// CHECK-NEXT: [range] iterator advance: 0 += 0167// CHECK-NEXT: [range] iterator move assign168// CHECK-NEXT: [range] iterator deref: 0169// CHECK-NEXT: i=1 v=0170// CHECK-NEXT: [range] iterator dtor171// CHECK-NEXT: i=1 vv=0172// CHECK-NEXT: [range] iterator advance: 0 += 1173// CHECK-NEXT: [range] iterator move assign174// CHECK-NEXT: [range] iterator deref: 1175// CHECK-NEXT: i=1 v=1176// CHECK-NEXT: [range] iterator dtor177// CHECK-NEXT: i=1 vv=1178// CHECK-NEXT: [range] iterator advance: 0 += 2179// CHECK-NEXT: [range] iterator move assign180// CHECK-NEXT: [range] iterator deref: 2181// CHECK-NEXT: i=1 v=2182// CHECK-NEXT: [range] iterator dtor183// CHECK-NEXT: i=1 vv=2184// CHECK-NEXT: [range] iterator advance: 0 += 0185// CHECK-NEXT: [range] iterator move assign186// CHECK-NEXT: [range] iterator deref: 0187// CHECK-NEXT: i=2 v=0188// CHECK-NEXT: [range] iterator dtor189// CHECK-NEXT: i=2 vv=0190// CHECK-NEXT: [range] iterator advance: 0 += 1191// CHECK-NEXT: [range] iterator move assign192// CHECK-NEXT: [range] iterator deref: 1193// CHECK-NEXT: i=2 v=1194// CHECK-NEXT: [range] iterator dtor195// CHECK-NEXT: i=2 vv=1196// CHECK-NEXT: [range] iterator advance: 0 += 2197// CHECK-NEXT: [range] iterator move assign198// CHECK-NEXT: [range] iterator deref: 2199// CHECK-NEXT: i=2 v=2200// CHECK-NEXT: [range] iterator dtor201// CHECK-NEXT: i=2 vv=2202// CHECK-NEXT: [range] iterator dtor203// CHECK-NEXT: [range] iterator dtor204// CHECK-NEXT: [range] iterator dtor205// CHECK-NEXT: [range] dtor206// CHECK-NEXT: [init-stmt] dtor207// CHECK-NEXT: done208