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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "mozilla/Queue.h"
#include "gtest/gtest.h"
#include <array>
using namespace mozilla;
namespace TestQueue {
struct Movable {
Movable() : mDestructionCounter(nullptr) {}
explicit Movable(uint32_t* aDestructionCounter)
: mDestructionCounter(aDestructionCounter) {}
~Movable() {
if (mDestructionCounter) {
(*mDestructionCounter)++;
}
}
Movable(Movable&& aOther) : mDestructionCounter(aOther.mDestructionCounter) {
aOther.mDestructionCounter = nullptr;
}
uint32_t* mDestructionCounter;
};
template <size_t N, size_t ItemsPerPage>
void PushMovables(Queue<Movable, ItemsPerPage>& aQueue,
std::array<uint32_t, N>& aDestructionCounters) {
auto oldDestructionCounters = aDestructionCounters;
auto oldCount = aQueue.Count();
for (uint32_t i = 0; i < N; ++i) {
aQueue.Push(Movable(&aDestructionCounters[i]));
}
for (uint32_t i = 0; i < N; ++i) {
EXPECT_EQ(aDestructionCounters[i], oldDestructionCounters[i]);
}
EXPECT_EQ(aQueue.Count(), oldCount + N);
EXPECT_FALSE(aQueue.IsEmpty());
}
template <size_t N>
void ExpectCounts(const std::array<uint32_t, N>& aDestructionCounters,
uint32_t aExpected) {
for (const auto& counters : aDestructionCounters) {
EXPECT_EQ(counters, aExpected);
}
}
TEST(Queue, Clear)
{
std::array<uint32_t, 32> counts{0};
Queue<Movable, 8> queue;
PushMovables(queue, counts);
queue.Clear();
ExpectCounts(counts, 1);
EXPECT_EQ(queue.Count(), 0u);
EXPECT_TRUE(queue.IsEmpty());
}
TEST(Queue, Destroy)
{
std::array<uint32_t, 32> counts{0};
{
Queue<Movable, 8> queue;
PushMovables(queue, counts);
}
ExpectCounts(counts, 1u);
}
TEST(Queue, MoveConstruct)
{
std::array<uint32_t, 32> counts{0};
{
Queue<Movable, 8> queue;
PushMovables(queue, counts);
Queue<Movable, 8> queue2(std::move(queue));
EXPECT_EQ(queue2.Count(), 32u);
EXPECT_FALSE(queue2.IsEmpty());
// NOLINTNEXTLINE(bugprone-use-after-move, clang-analyzer-cplusplus.Move)
EXPECT_EQ(queue.Count(), 0u);
// NOLINTNEXTLINE(bugprone-use-after-move, clang-analyzer-cplusplus.Move)
EXPECT_TRUE(queue.IsEmpty());
ExpectCounts(counts, 0u);
}
ExpectCounts(counts, 1u);
}
TEST(Queue, MoveAssign)
{
std::array<uint32_t, 32> counts{0};
std::array<uint32_t, 32> counts2{0};
{
Queue<Movable, 8> queue;
PushMovables(queue, counts);
{
Queue<Movable, 8> queue2;
PushMovables(queue2, counts2);
queue = std::move(queue2);
ExpectCounts(counts, 1);
ExpectCounts(counts2, 0);
EXPECT_EQ(queue.Count(), 32u);
EXPECT_FALSE(queue.IsEmpty());
// NOLINTNEXTLINE(bugprone-use-after-move, clang-analyzer-cplusplus.Move)
EXPECT_EQ(queue2.Count(), 0u);
// NOLINTNEXTLINE(bugprone-use-after-move, clang-analyzer-cplusplus.Move)
EXPECT_TRUE(queue2.IsEmpty());
}
ExpectCounts(counts, 1);
ExpectCounts(counts2, 0);
EXPECT_EQ(queue.Count(), 32u);
EXPECT_FALSE(queue.IsEmpty());
}
ExpectCounts(counts, 1);
ExpectCounts(counts2, 1);
}
TEST(Queue, PopOrder)
{
std::array<uint32_t, 32> counts{0};
Queue<Movable, 8> queue;
PushMovables(queue, counts);
for (auto& count : counts) {
EXPECT_EQ(count, 0u);
{
Movable popped = queue.Pop();
EXPECT_EQ(popped.mDestructionCounter, &count);
EXPECT_EQ(count, 0u);
}
EXPECT_EQ(count, 1u);
}
EXPECT_TRUE(queue.IsEmpty());
EXPECT_EQ(queue.Count(), 0u);
}
void DoPushPopSequence(Queue<uint32_t, 8>& aQueue, uint32_t& aInSerial,
uint32_t& aOutSerial, uint32_t aPush, uint32_t aPop) {
auto initialCount = aQueue.Count();
for (uint32_t i = 0; i < aPush; ++i) {
aQueue.Push(aInSerial++);
}
EXPECT_EQ(aQueue.Count(), initialCount + aPush);
for (uint32_t i = 0; i < aPop; ++i) {
uint32_t popped = aQueue.Pop();
EXPECT_EQ(popped, aOutSerial++);
}
EXPECT_EQ(aQueue.Count(), initialCount + aPush - aPop);
}
void PushPopPushPop(uint32_t aPush1, uint32_t aPop1, uint32_t aPush2,
uint32_t aPop2) {
Queue<uint32_t, 8> queue;
uint32_t inSerial = 0;
uint32_t outSerial = 0;
DoPushPopSequence(queue, inSerial, outSerial, aPush1, aPop1);
DoPushPopSequence(queue, inSerial, outSerial, aPush2, aPop2);
}
TEST(Queue, PushPopSequence)
{
for (uint32_t push1 = 0; push1 < 16; ++push1) {
for (uint32_t pop1 = 0; pop1 < push1; ++pop1) {
for (uint32_t push2 = 0; push2 < 16; ++push2) {
for (uint32_t pop2 = 0; pop2 < push1 - pop1 + push2; ++pop2) {
PushPopPushPop(push1, pop1, push2, pop2);
}
}
}
}
}
TEST(Queue, Iterate)
{
Queue<uint16_t, 8> queue;
for (uint16_t i = 0; i < 256; ++i) {
queue.Push(std::move(i));
}
uint16_t expected = 0;
queue.Iterate([&](uint16_t aItem) {
EXPECT_EQ(aItem, expected);
++expected;
});
EXPECT_EQ(expected, 256u);
}
TEST(Queue, IterateWithNonZeroOffset)
{
Queue<uint16_t, 8> queue;
// This will make the initial page start with index 1, while index 0 will
// still be filled after using up the last index, resulting:
// [7 1 2 3 4 5 6 pointer-to-next]
queue.Push(255);
queue.Pop();
for (uint16_t i = 0; i < 256; ++i) {
queue.Push(std::move(i));
}
uint16_t expected = 0;
queue.Iterate([&](uint16_t aItem) {
EXPECT_EQ(aItem, expected);
++expected;
});
EXPECT_EQ(expected, 256u);
}
} // namespace TestQueue
|
