File: compare_exchange.cpp

package info (click to toggle)
swiftlang 6.1.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,791,532 kB
  • sloc: cpp: 9,901,743; ansic: 2,201,431; asm: 1,091,827; python: 308,252; objc: 82,166; f90: 80,126; lisp: 38,358; pascal: 25,559; sh: 20,429; ml: 5,058; perl: 4,745; makefile: 4,484; awk: 3,535; javascript: 3,018; xml: 918; fortran: 664; cs: 573; ruby: 396
file content (106 lines) | stat: -rw-r--r-- 3,264 bytes parent folder | download | duplicates (28)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
// RUN: %clangxx_tsan -O1 %s %link_libcxx_tsan -o %t && %deflake %env_tsan_opts=atexit_sleep_ms=50 %run %t 2>&1 | FileCheck --check-prefix=CHECK-REPORT %s

#include <atomic>
#include <cassert>
#include <stdio.h>
#include <thread>

#define NUM_ORDS 16
#define NUM_THREADS NUM_ORDS * 2
struct node {
  int val;
};
std::atomic<node *> _nodes[NUM_THREADS] = {};

void f1(int i) {
  auto n = new node();
  n->val = 42;
  _nodes[i].store(n, std::memory_order_release);
}

template <int version>
void f2(int i, std::memory_order mo, std::memory_order fmo) {
  node *expected = nullptr;
  while (expected == nullptr) {
    _nodes[i].compare_exchange_weak(expected, nullptr, mo, fmo);
  };

  ++expected->val;
  assert(expected->val == 43);
}

struct MemOrdSuccFail {
  std::memory_order mo;
  std::memory_order fmo;
};

MemOrdSuccFail OrdList[NUM_ORDS] = {
    {std::memory_order_release, std::memory_order_relaxed},
    {std::memory_order_release, std::memory_order_acquire},
    {std::memory_order_release, std::memory_order_consume},
    {std::memory_order_release, std::memory_order_seq_cst},

    {std::memory_order_acq_rel, std::memory_order_relaxed},
    {std::memory_order_acq_rel, std::memory_order_acquire},
    {std::memory_order_acq_rel, std::memory_order_consume},
    {std::memory_order_acq_rel, std::memory_order_seq_cst},

    {std::memory_order_seq_cst, std::memory_order_relaxed},
    {std::memory_order_seq_cst, std::memory_order_acquire},
    {std::memory_order_seq_cst, std::memory_order_consume},
    {std::memory_order_seq_cst, std::memory_order_seq_cst},

    {std::memory_order_relaxed, std::memory_order_relaxed},
    {std::memory_order_relaxed, std::memory_order_acquire},
    {std::memory_order_relaxed, std::memory_order_consume},
    {std::memory_order_relaxed, std::memory_order_seq_cst},
};

int main() {
  std::thread threads[NUM_THREADS];
  int ords = 0;

  // Instantiate a new f2 for each MO so we can dedup reports and actually
  // make sure relaxed FMO triggers a warning for every different MO.
  for (unsigned t = 0; t < 8; t += 2) {
    threads[t] = std::thread(f1, t);
    threads[t + 1] = std::thread(f2<0>, t, OrdList[ords].mo, OrdList[ords].fmo);
    threads[t].join();
    threads[t + 1].join();
    ords++;
  }

  for (unsigned t = 8; t < 16; t += 2) {
    threads[t] = std::thread(f1, t);
    threads[t + 1] = std::thread(f2<1>, t, OrdList[ords].mo, OrdList[ords].fmo);
    threads[t].join();
    threads[t + 1].join();
    ords++;
  }

  for (unsigned t = 16; t < 24; t += 2) {
    threads[t] = std::thread(f1, t);
    threads[t + 1] = std::thread(f2<2>, t, OrdList[ords].mo, OrdList[ords].fmo);
    threads[t].join();
    threads[t + 1].join();
    ords++;
  }

  for (unsigned t = 24; t < 32; t += 2) {
    threads[t] = std::thread(f1, t);
    threads[t + 1] = std::thread(f2<3>, t, OrdList[ords].mo, OrdList[ords].fmo);
    threads[t].join();
    threads[t + 1].join();
    ords++;
  }

  fprintf(stderr, "DONE\n");
  return 0;
}

// CHECK-REPORT: WARNING: ThreadSanitizer: data race
// CHECK-REPORT: WARNING: ThreadSanitizer: data race
// CHECK-REPORT: WARNING: ThreadSanitizer: data race
// CHECK-REPORT: WARNING: ThreadSanitizer: data race
// CHECK-REPORT: DONE
// CHECK-REPORT: ThreadSanitizer: reported 4 warnings