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
|
//===- SequenceTest.cpp - Unit tests for a sequence abstraciton -----------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "llvm/ADT/Sequence.h"
#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include <algorithm>
#include <numeric>
using namespace llvm;
using testing::ElementsAre;
namespace {
using detail::canTypeFitValue;
using detail::CheckedInt;
using IntegralTypes = testing::Types<uint8_t, // 0
uint16_t, // 1
uint32_t, // 2
uint64_t, // 3
uintmax_t, // 4
int8_t, // 5
int16_t, // 6
int32_t, // 7
int64_t, // 8
intmax_t // 9
>;
template <class T> class StrongIntTest : public testing::Test {};
TYPED_TEST_SUITE(StrongIntTest, IntegralTypes);
TYPED_TEST(StrongIntTest, Operations) {
using T = TypeParam;
auto Max = std::numeric_limits<T>::max();
auto Min = std::numeric_limits<T>::min();
// We bail out for types that are not entirely representable within intmax_t.
if (!canTypeFitValue<intmax_t>(Max) || !canTypeFitValue<intmax_t>(Min))
return;
// All representable values convert back and forth.
EXPECT_EQ(CheckedInt::from(Min).template to<T>(), Min);
EXPECT_EQ(CheckedInt::from(Max).template to<T>(), Max);
// Addition -2, -1, 0, 1, 2.
const T Expected = Max / 2;
const CheckedInt Actual = CheckedInt::from(Expected);
EXPECT_EQ((Actual + -2).template to<T>(), Expected - 2);
EXPECT_EQ((Actual + -1).template to<T>(), Expected - 1);
EXPECT_EQ((Actual + 0).template to<T>(), Expected);
EXPECT_EQ((Actual + 1).template to<T>(), Expected + 1);
EXPECT_EQ((Actual + 2).template to<T>(), Expected + 2);
// EQ/NEQ
EXPECT_EQ(Actual, Actual);
EXPECT_NE(Actual, Actual + 1);
// Difference
EXPECT_EQ(Actual - Actual, 0);
EXPECT_EQ((Actual + 1) - Actual, 1);
EXPECT_EQ(Actual - (Actual + 2), -2);
}
TEST(StrongIntTest, Enums) {
enum UntypedEnum { A = 3 };
EXPECT_EQ(CheckedInt::from(A).to<UntypedEnum>(), A);
enum TypedEnum : uint32_t { B = 3 };
EXPECT_EQ(CheckedInt::from(B).to<TypedEnum>(), B);
enum class ScopedEnum : uint16_t { C = 3 };
EXPECT_EQ(CheckedInt::from(ScopedEnum::C).to<ScopedEnum>(), ScopedEnum::C);
}
#if defined(GTEST_HAS_DEATH_TEST) && !defined(NDEBUG)
TEST(StrongIntDeathTest, OutOfBounds) {
// Values above 'INTMAX_MAX' are not representable.
EXPECT_DEATH(CheckedInt::from<uintmax_t>(INTMAX_MAX + 1ULL), "Out of bounds");
EXPECT_DEATH(CheckedInt::from<uintmax_t>(UINTMAX_MAX), "Out of bounds");
// Casting to narrower type asserts when out of bounds.
EXPECT_DEATH(CheckedInt::from(-1).to<uint8_t>(), "Out of bounds");
EXPECT_DEATH(CheckedInt::from(256).to<uint8_t>(), "Out of bounds");
// Operations leading to intmax_t overflow assert.
EXPECT_DEATH(CheckedInt::from(INTMAX_MAX) + 1, "Out of bounds");
EXPECT_DEATH(CheckedInt::from(INTMAX_MIN) + -1, "Out of bounds");
EXPECT_DEATH(CheckedInt::from(INTMAX_MIN) - CheckedInt::from(INTMAX_MAX),
"Out of bounds");
}
#endif
TEST(SafeIntIteratorTest, Operations) {
detail::SafeIntIterator<int, false> Forward(0);
detail::SafeIntIterator<int, true> Reverse(0);
const auto SetToZero = [&]() {
Forward = detail::SafeIntIterator<int, false>(0);
Reverse = detail::SafeIntIterator<int, true>(0);
};
// Equality / Comparisons
SetToZero();
EXPECT_EQ(Forward, Forward);
EXPECT_LT(Forward - 1, Forward);
EXPECT_LE(Forward, Forward);
EXPECT_LE(Forward - 1, Forward);
EXPECT_GT(Forward + 1, Forward);
EXPECT_GE(Forward, Forward);
EXPECT_GE(Forward + 1, Forward);
EXPECT_EQ(Reverse, Reverse);
EXPECT_LT(Reverse - 1, Reverse);
EXPECT_LE(Reverse, Reverse);
EXPECT_LE(Reverse - 1, Reverse);
EXPECT_GT(Reverse + 1, Reverse);
EXPECT_GE(Reverse, Reverse);
EXPECT_GE(Reverse + 1, Reverse);
// Dereference
SetToZero();
EXPECT_EQ(*Forward, 0);
EXPECT_EQ(*Reverse, 0);
// Indexing
SetToZero();
EXPECT_EQ(Forward[2], 2);
EXPECT_EQ(Reverse[2], -2);
// Pre-increment
SetToZero();
++Forward;
EXPECT_EQ(*Forward, 1);
++Reverse;
EXPECT_EQ(*Reverse, -1);
// Pre-decrement
SetToZero();
--Forward;
EXPECT_EQ(*Forward, -1);
--Reverse;
EXPECT_EQ(*Reverse, 1);
// Post-increment
SetToZero();
EXPECT_EQ(*(Forward++), 0);
EXPECT_EQ(*Forward, 1);
EXPECT_EQ(*(Reverse++), 0);
EXPECT_EQ(*Reverse, -1);
// Post-decrement
SetToZero();
EXPECT_EQ(*(Forward--), 0);
EXPECT_EQ(*Forward, -1);
EXPECT_EQ(*(Reverse--), 0);
EXPECT_EQ(*Reverse, 1);
// Compound assignment operators
SetToZero();
Forward += 1;
EXPECT_EQ(*Forward, 1);
Reverse += 1;
EXPECT_EQ(*Reverse, -1);
SetToZero();
Forward -= 2;
EXPECT_EQ(*Forward, -2);
Reverse -= 2;
EXPECT_EQ(*Reverse, 2);
// Arithmetic
SetToZero();
EXPECT_EQ(*(Forward + 3), 3);
EXPECT_EQ(*(Reverse + 3), -3);
SetToZero();
EXPECT_EQ(*(Forward - 4), -4);
EXPECT_EQ(*(Reverse - 4), 4);
// Difference
SetToZero();
EXPECT_EQ(Forward - Forward, 0);
EXPECT_EQ(Reverse - Reverse, 0);
EXPECT_EQ((Forward + 1) - Forward, 1);
EXPECT_EQ(Forward - (Forward + 1), -1);
EXPECT_EQ((Reverse + 1) - Reverse, 1);
EXPECT_EQ(Reverse - (Reverse + 1), -1);
}
TEST(SequenceTest, Iteration) {
EXPECT_THAT(seq(-4, 5), ElementsAre(-4, -3, -2, -1, 0, 1, 2, 3, 4));
EXPECT_THAT(reverse(seq(-4, 5)), ElementsAre(4, 3, 2, 1, 0, -1, -2, -3, -4));
EXPECT_THAT(seq_inclusive(-4, 5),
ElementsAre(-4, -3, -2, -1, 0, 1, 2, 3, 4, 5));
EXPECT_THAT(reverse(seq_inclusive(-4, 5)),
ElementsAre(5, 4, 3, 2, 1, 0, -1, -2, -3, -4));
}
TEST(SequenceTest, Distance) {
const auto Forward = seq(0, 10);
EXPECT_EQ(std::distance(Forward.begin(), Forward.end()), 10);
EXPECT_EQ(std::distance(Forward.rbegin(), Forward.rend()), 10);
}
TEST(SequenceTest, Dereference) {
const auto Forward = seq(0, 10).begin();
EXPECT_EQ(Forward[0], 0);
EXPECT_EQ(Forward[2], 2);
const auto Backward = seq(0, 10).rbegin();
EXPECT_EQ(Backward[0], 9);
EXPECT_EQ(Backward[2], 7);
}
} // anonymous namespace
|
