brintos

brintos / llvm-project-archived public Read only

0
0
Text · 4.8 KiB · 552484b Raw
195 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 107  Iterator begin() const {108    print("begin()");109    return Iterator(this, 2);110  }111 112  Iterator end() const {113    print("end()");114    return Iterator(this, -1);115  }116 117  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 127int main() {128  printf("do\n");129  Reporter C("C");130  Reporter D("D");131#pragma omp fuse132  {133    for (auto it = C.begin(); it != C.end(); ++it)134      printf("v=%d\n", *it);135 136    for (auto it = D.begin(); it != D.end(); ++it)137      printf("vv=%d\n", *it);138  }139  printf("done\n");140  return EXIT_SUCCESS;141}142 143#endif /* HEADER */144 145// CHECK: do146// CHECK: [C] ctor147// CHECK-NEXT: [D] ctor148// CHECK-NEXT: [C] begin()149// CHECK-NEXT: [C] begin()150// CHECK-NEXT: [C] end()151// CHECK-NEXT: [C] iterator distance: 3152// CHECK-NEXT: [D] begin()153// CHECK-NEXT: [D] begin()154// CHECK-NEXT: [D] end()155// CHECK-NEXT: [D] iterator distance: 3156// CHECK-NEXT: [C] iterator advance: 0 += 0157// CHECK-NEXT: [C] iterator move assign158// CHECK-NEXT: [C] iterator deref: 0159// CHECK-NEXT: v=0160// CHECK-NEXT: [C] iterator dtor161// CHECK-NEXT: [D] iterator advance: 0 += 0162// CHECK-NEXT: [D] iterator move assign163// CHECK-NEXT: [D] iterator deref: 0164// CHECK-NEXT: vv=0165// CHECK-NEXT: [D] iterator dtor166// CHECK-NEXT: [C] iterator advance: 0 += 1167// CHECK-NEXT: [C] iterator move assign168// CHECK-NEXT: [C] iterator deref: 1169// CHECK-NEXT: v=1170// CHECK-NEXT: [C] iterator dtor171// CHECK-NEXT: [D] iterator advance: 0 += 1172// CHECK-NEXT: [D] iterator move assign173// CHECK-NEXT: [D] iterator deref: 1174// CHECK-NEXT: vv=1175// CHECK-NEXT: [D] iterator dtor176// CHECK-NEXT: [C] iterator advance: 0 += 2177// CHECK-NEXT: [C] iterator move assign178// CHECK-NEXT: [C] iterator deref: 2179// CHECK-NEXT: v=2180// CHECK-NEXT: [C] iterator dtor181// CHECK-NEXT: [D] iterator advance: 0 += 2182// CHECK-NEXT: [D] iterator move assign183// CHECK-NEXT: [D] iterator deref: 2184// CHECK-NEXT: vv=2185// CHECK-NEXT: [D] iterator dtor186// CHECK-NEXT: [D] iterator dtor187// CHECK-NEXT: [D] iterator dtor188// CHECK-NEXT: [C] iterator dtor189// CHECK-NEXT: [C] iterator dtor190// CHECK-NEXT: done191// CHECK-NEXT: [D] iterator dtor192// CHECK-NEXT: [C] iterator dtor193// CHECK-NEXT: [D] dtor194// CHECK-NEXT: [C] dtor195