File: seqlock_test.cpp

package info (click to toggle)
xenium 0.0.2%2Bds-10
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 1,152 kB
  • sloc: cpp: 12,299; makefile: 20
file content (147 lines) | stat: -rw-r--r-- 2,976 bytes parent folder | download | duplicates (3)
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include <xenium/seqlock.hpp>

#include <gtest/gtest.h>
#include <thread>

namespace {
 
struct Foo {
  int32_t v1;
  float v2;
  double v3;
  int64_t v4;

  Foo& operator++() {
    ++v1;
    ++v2;
    ++v3;
    ++v4;
    return *this;
  }

  bool verify() const {
    return v1 == v2 && v2 == v3 && v3 == v4;
  }
  bool operator==(const Foo& rhs) const {
    return v1 == rhs.v1 && v2 == rhs.v2 && v3 == rhs.v3 && v4 == rhs.v4;
  }
};

TEST(SeqLock, load_returns_initial_value)
{
  xenium::seqlock<Foo> data{{0, 1, 2, 3}};
  Foo expected = {0, 1, 2, 3};
  EXPECT_EQ(expected, data.load());
}

TEST(SeqLock, load_returns_previously_stored_value)
{
  Foo f = {0, 1, 2, 3};
  xenium::seqlock<Foo> data{};
  for (int32_t i = 0; i < 4; ++i) {
    EXPECT_EQ(i, f.v1);
    data.store(f);
    EXPECT_EQ(f, data.load());
    ++f;
  }
}


TEST(SeqLock, load_returns_previously_stored_value_with_multiple_slots)
{
  Foo f = {0, 1, 2, 3};
  xenium::seqlock<Foo, xenium::policy::slots<8>> data{};
  for (int32_t i = 0; i < 8; ++i) {
    EXPECT_EQ(i, f.v1);
    data.store(f);
    EXPECT_EQ(f, data.load());
    ++f;
  }
}

TEST(SeqLock, update_functor_receives_latest_value_as_parameter)
{
  Foo f = {0, 1, 2, 3};
  xenium::seqlock<Foo> data{f};
  for (int32_t i = 0; i < 4; ++i) {
    EXPECT_EQ(i, f.v1);
    data.update([&f](Foo& cur) {
      EXPECT_EQ(f, cur);
      ++cur;
    });
    ++f;
  }
}

TEST(SeqLock, update_functor_receives_latest_value_as_parameter_with_multple_slots)
{
  Foo f = {0, 1, 2, 3};
  xenium::seqlock<Foo, xenium::policy::slots<4>> data{f};
  for (int32_t i = 0; i < 8; ++i) {
    EXPECT_EQ(i, f.v1);
    data.update([&f](Foo& cur) {
      EXPECT_EQ(f, cur);
      ++cur;
    });
    ++f;
  }
}

TEST(SeqLock, read_returns_value_stored_by_update)
{
  Foo f = {0, 1, 2, 3};
  xenium::seqlock<Foo> data{f};
  for (int32_t i = 0; i < 4; ++i) {
    EXPECT_EQ(i, f.v1);
    data.update([](Foo& cur) { ++cur; });
    ++f;
    EXPECT_EQ(f, data.load());
  }
}

TEST(SeqLock, read_returns_value_stored_by_update_with_multiple_slots)
{
  Foo f = {0, 1, 2, 3};
  xenium::seqlock<Foo, xenium::policy::slots<4>> data{f};
  for (int32_t i = 0; i < 9; ++i) {
    EXPECT_EQ(i, f.v1);
    data.update([](Foo& cur) { ++cur; });
    ++f;
    EXPECT_EQ(f, data.load());
  }
}

TEST(SeqLock, parallel_usage)
{
  xenium::seqlock<Foo, xenium::policy::slots<8>> data{{0, 0, 0, 0}};

  std::vector<std::thread> threads;
  for (int i = 0; i < 4; ++i)
  {
    threads.push_back(std::thread([&data]
    {
    #ifdef DEBUG
      const int MaxIterations = 5000;
    #else
      const int MaxIterations = 50000;
    #endif
      for (int j = 0; j < MaxIterations; ++j) {
        auto d = data.load();
        EXPECT_TRUE(d.verify());
        data.store(++d);

        d = data.load();
        EXPECT_TRUE(d.verify());
        data.update([](Foo& f) {
          EXPECT_TRUE(f.verify());
          ++f;
        });
      }
    }));
  }

  for (auto& thread : threads)
    thread.join();
}

}