brintos

brintos / llvm-project-archived public Read only

0
0
Text · 6.4 KiB · 05b5677 Raw
236 lines · cpp
1// XFAIL: msvc2// Fails on windows due to issue #1290233// RUN: %libomp-cxx20-compile-and-run | FileCheck %s --match-full-lines4 5#ifndef HEADER6#define HEADER7 8#include <cstdlib>9#include <cstdarg>10#include <cstdio>11#include <vector>12 13struct Reporter {14  const char *name;15 16  Reporter(const char *name) : name(name) { print("ctor"); }17 18  Reporter() : name("<anon>") { print("ctor"); }19 20  Reporter(const Reporter &that) : name(that.name) { print("copy ctor"); }21 22  Reporter(Reporter &&that) : name(that.name) { print("move ctor"); }23 24  ~Reporter() { print("dtor"); }25 26  const Reporter &operator=(const Reporter &that) {27    print("copy assign");28    this->name = that.name;29    return *this;30  }31 32  const Reporter &operator=(Reporter &&that) {33    print("move assign");34    this->name = that.name;35    return *this;36  }37 38  struct Iterator {39    const Reporter *owner;40    int pos;41 42    Iterator(const Reporter *owner, int pos) : owner(owner), pos(pos) {}43 44    Iterator(const Iterator &that) : owner(that.owner), pos(that.pos) {45      owner->print("iterator copy ctor");46    }47 48    Iterator(Iterator &&that) : owner(that.owner), pos(that.pos) {49      owner->print("iterator move ctor");50    }51 52    ~Iterator() { owner->print("iterator dtor"); }53 54    const Iterator &operator=(const Iterator &that) {55      owner->print("iterator copy assign");56      this->owner = that.owner;57      this->pos = that.pos;58      return *this;59    }60 61    const Iterator &operator=(Iterator &&that) {62      owner->print("iterator move assign");63      this->owner = that.owner;64      this->pos = that.pos;65      return *this;66    }67 68    bool operator==(const Iterator &that) const {69      owner->print("iterator %d == %d", 2 - this->pos, 2 - that.pos);70      return this->pos == that.pos;71    }72 73    bool operator!=(const Iterator &that) const {74      owner->print("iterator %d != %d", 2 - this->pos, 2 - that.pos);75      return this->pos == that.pos;76    }77 78    Iterator &operator++() {79      owner->print("iterator prefix ++");80      pos -= 1;81      return *this;82    }83 84    Iterator operator++(int) {85      owner->print("iterator postfix ++");86      auto result = *this;87      pos -= 1;88      return result;89    }90 91    int operator*() const {92      int result = 2 - pos;93      owner->print("iterator deref: %i", result);94      return result;95    }96 97    size_t operator-(const Iterator &that) const {98      int result = (2 - this->pos) - (2 - that.pos);99      owner->print("iterator distance: %d", result);100      return result;101    }102 103    Iterator operator+(int steps) const {104      owner->print("iterator advance: %i += %i", 2 - this->pos, steps);105      return Iterator(owner, pos - steps);106    }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  {132    Reporter A("A"), B("B");133#pragma omp tile sizes(2, 2)134    for (auto it = A.begin(); it != A.end(); ++it)135      for (auto jt = B.begin(); jt != B.end(); ++jt)136        printf("i=%d j=%d\n", *it, *jt);137  }138  printf("done\n");139  return EXIT_SUCCESS;140}141 142#endif /* HEADER */143 144// CHECK:      do145// CHECK-NEXT: [A] ctor146// CHECK-NEXT: [B] ctor147// CHECK-NEXT: [A] begin()148// CHECK-NEXT: [A] begin()149// CHECK-NEXT: [A] end()150// CHECK-NEXT: [A] iterator distance: 3151// CHECK-NEXT: [B] begin()152// CHECK-NEXT: [B] begin()153// CHECK-NEXT: [B] end()154// CHECK-NEXT: [B] iterator distance: 3155// CHECK-NEXT: [A] iterator advance: 0 += 0156// CHECK-NEXT: [A] iterator move assign157// CHECK-NEXT: [B] iterator advance: 0 += 0158// CHECK-NEXT: [B] iterator move assign159// CHECK-NEXT: [A] iterator deref: 0160// CHECK-NEXT: [B] iterator deref: 0161// CHECK-NEXT: i=0 j=0162// CHECK-NEXT: [B] iterator dtor163// CHECK-NEXT: [B] iterator advance: 0 += 1164// CHECK-NEXT: [B] iterator move assign165// CHECK-NEXT: [A] iterator deref: 0166// CHECK-NEXT: [B] iterator deref: 1167// CHECK-NEXT: i=0 j=1168// CHECK-NEXT: [B] iterator dtor169// CHECK-NEXT: [A] iterator dtor170// CHECK-NEXT: [A] iterator advance: 0 += 1171// CHECK-NEXT: [A] iterator move assign172// CHECK-NEXT: [B] iterator advance: 0 += 0173// CHECK-NEXT: [B] iterator move assign174// CHECK-NEXT: [A] iterator deref: 1175// CHECK-NEXT: [B] iterator deref: 0176// CHECK-NEXT: i=1 j=0177// CHECK-NEXT: [B] iterator dtor178// CHECK-NEXT: [B] iterator advance: 0 += 1179// CHECK-NEXT: [B] iterator move assign180// CHECK-NEXT: [A] iterator deref: 1181// CHECK-NEXT: [B] iterator deref: 1182// CHECK-NEXT: i=1 j=1183// CHECK-NEXT: [B] iterator dtor184// CHECK-NEXT: [A] iterator dtor185// CHECK-NEXT: [A] iterator advance: 0 += 0186// CHECK-NEXT: [A] iterator move assign187// CHECK-NEXT: [B] iterator advance: 0 += 2188// CHECK-NEXT: [B] iterator move assign189// CHECK-NEXT: [A] iterator deref: 0190// CHECK-NEXT: [B] iterator deref: 2191// CHECK-NEXT: i=0 j=2192// CHECK-NEXT: [B] iterator dtor193// CHECK-NEXT: [A] iterator dtor194// CHECK-NEXT: [A] iterator advance: 0 += 1195// CHECK-NEXT: [A] iterator move assign196// CHECK-NEXT: [B] iterator advance: 0 += 2197// CHECK-NEXT: [B] iterator move assign198// CHECK-NEXT: [A] iterator deref: 1199// CHECK-NEXT: [B] iterator deref: 2200// CHECK-NEXT: i=1 j=2201// CHECK-NEXT: [B] iterator dtor202// CHECK-NEXT: [A] iterator dtor203// CHECK-NEXT: [A] iterator advance: 0 += 2204// CHECK-NEXT: [A] iterator move assign205// CHECK-NEXT: [B] iterator advance: 0 += 0206// CHECK-NEXT: [B] iterator move assign207// CHECK-NEXT: [A] iterator deref: 2208// CHECK-NEXT: [B] iterator deref: 0209// CHECK-NEXT: i=2 j=0210// CHECK-NEXT: [B] iterator dtor211// CHECK-NEXT: [B] iterator advance: 0 += 1212// CHECK-NEXT: [B] iterator move assign213// CHECK-NEXT: [A] iterator deref: 2214// CHECK-NEXT: [B] iterator deref: 1215// CHECK-NEXT: i=2 j=1216// CHECK-NEXT: [B] iterator dtor217// CHECK-NEXT: [A] iterator dtor218// CHECK-NEXT: [A] iterator advance: 0 += 2219// CHECK-NEXT: [A] iterator move assign220// CHECK-NEXT: [B] iterator advance: 0 += 2221// CHECK-NEXT: [B] iterator move assign222// CHECK-NEXT: [A] iterator deref: 2223// CHECK-NEXT: [B] iterator deref: 2224// CHECK-NEXT: i=2 j=2225// CHECK-NEXT: [B] iterator dtor226// CHECK-NEXT: [A] iterator dtor227// CHECK-NEXT: [B] iterator dtor228// CHECK-NEXT: [B] iterator dtor229// CHECK-NEXT: [A] iterator dtor230// CHECK-NEXT: [A] iterator dtor231// CHECK-NEXT: [B] iterator dtor232// CHECK-NEXT: [A] iterator dtor233// CHECK-NEXT: [B] dtor234// CHECK-NEXT: [A] dtor235// CHECK-NEXT: done236