blob: f46d94e9e577b444c175215a586e847a18cd44f4 [file] [log] [blame]
Misha Brukman5851edb2009-08-20 17:01:14 +00001//===- unittests/Support/MathExtrasTest.cpp - math utils tests ------------===//
Misha Brukman1757a812009-04-01 21:36:40 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10#include "gtest/gtest.h"
11#include "llvm/Support/MathExtras.h"
12
13using namespace llvm;
14
15namespace {
16
Michael J. Spencereb91eac2013-05-24 20:29:47 +000017TEST(MathExtras, countTrailingZeros) {
18 uint8_t Z8 = 0;
19 uint16_t Z16 = 0;
20 uint32_t Z32 = 0;
21 uint64_t Z64 = 0;
Michael J. Spencer795ecd22013-05-24 22:19:05 +000022 EXPECT_EQ(8u, countTrailingZeros(Z8));
23 EXPECT_EQ(16u, countTrailingZeros(Z16));
24 EXPECT_EQ(32u, countTrailingZeros(Z32));
25 EXPECT_EQ(64u, countTrailingZeros(Z64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +000026
27 uint8_t NZ8 = 42;
28 uint16_t NZ16 = 42;
29 uint32_t NZ32 = 42;
30 uint64_t NZ64 = 42;
Michael J. Spencer795ecd22013-05-24 22:19:05 +000031 EXPECT_EQ(1u, countTrailingZeros(NZ8));
32 EXPECT_EQ(1u, countTrailingZeros(NZ16));
33 EXPECT_EQ(1u, countTrailingZeros(NZ32));
34 EXPECT_EQ(1u, countTrailingZeros(NZ64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +000035}
36
37TEST(MathExtras, countLeadingZeros) {
38 uint8_t Z8 = 0;
39 uint16_t Z16 = 0;
40 uint32_t Z32 = 0;
41 uint64_t Z64 = 0;
Michael J. Spencer795ecd22013-05-24 22:19:05 +000042 EXPECT_EQ(8u, countLeadingZeros(Z8));
43 EXPECT_EQ(16u, countLeadingZeros(Z16));
44 EXPECT_EQ(32u, countLeadingZeros(Z32));
45 EXPECT_EQ(64u, countLeadingZeros(Z64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +000046
47 uint8_t NZ8 = 42;
48 uint16_t NZ16 = 42;
49 uint32_t NZ32 = 42;
50 uint64_t NZ64 = 42;
Michael J. Spencer795ecd22013-05-24 22:19:05 +000051 EXPECT_EQ(2u, countLeadingZeros(NZ8));
52 EXPECT_EQ(10u, countLeadingZeros(NZ16));
53 EXPECT_EQ(26u, countLeadingZeros(NZ32));
54 EXPECT_EQ(58u, countLeadingZeros(NZ64));
Michael J. Spencera8db3f62013-05-24 22:58:37 +000055
56 EXPECT_EQ(8u, countLeadingZeros(0x00F000FFu));
57 EXPECT_EQ(8u, countLeadingZeros(0x00F12345u));
58 for (unsigned i = 0; i <= 30; ++i) {
59 EXPECT_EQ(31 - i, countLeadingZeros(1u << i));
60 }
61
62 EXPECT_EQ(8u, countLeadingZeros(0x00F1234500F12345ULL));
63 EXPECT_EQ(1u, countLeadingZeros(1ULL << 62));
64 for (unsigned i = 0; i <= 62; ++i) {
65 EXPECT_EQ(63 - i, countLeadingZeros(1ULL << i));
66 }
Michael J. Spencereb91eac2013-05-24 20:29:47 +000067}
68
Zachary Turnerf19b0c7f2017-04-19 15:45:31 +000069TEST(MathExtras, onesMask) {
70 EXPECT_EQ(0U, maskLeadingOnes<uint8_t>(0));
71 EXPECT_EQ(0U, maskTrailingOnes<uint8_t>(0));
72 EXPECT_EQ(0U, maskLeadingOnes<uint16_t>(0));
73 EXPECT_EQ(0U, maskTrailingOnes<uint16_t>(0));
74 EXPECT_EQ(0U, maskLeadingOnes<uint32_t>(0));
75 EXPECT_EQ(0U, maskTrailingOnes<uint32_t>(0));
76 EXPECT_EQ(0U, maskLeadingOnes<uint64_t>(0));
77 EXPECT_EQ(0U, maskTrailingOnes<uint64_t>(0));
78
79 EXPECT_EQ(0x00000003U, maskTrailingOnes<uint32_t>(2U));
80 EXPECT_EQ(0xC0000000U, maskLeadingOnes<uint32_t>(2U));
81
82 EXPECT_EQ(0x000007FFU, maskTrailingOnes<uint32_t>(11U));
83 EXPECT_EQ(0xFFE00000U, maskLeadingOnes<uint32_t>(11U));
84
85 EXPECT_EQ(0xFFFFFFFFU, maskTrailingOnes<uint32_t>(32U));
86 EXPECT_EQ(0xFFFFFFFFU, maskLeadingOnes<uint32_t>(32U));
Benjamin Kramere25268d2017-04-19 17:46:15 +000087 EXPECT_EQ(0xFFFFFFFFFFFFFFFFULL, maskTrailingOnes<uint64_t>(64U));
88 EXPECT_EQ(0xFFFFFFFFFFFFFFFFULL, maskLeadingOnes<uint64_t>(64U));
89
90 EXPECT_EQ(0x0000FFFFFFFFFFFFULL, maskTrailingOnes<uint64_t>(48U));
91 EXPECT_EQ(0xFFFFFFFFFFFF0000ULL, maskLeadingOnes<uint64_t>(48U));
Zachary Turnerf19b0c7f2017-04-19 15:45:31 +000092}
93
Michael J. Spencereb91eac2013-05-24 20:29:47 +000094TEST(MathExtras, findFirstSet) {
95 uint8_t Z8 = 0;
96 uint16_t Z16 = 0;
97 uint32_t Z32 = 0;
98 uint64_t Z64 = 0;
Michael J. Spencer795ecd22013-05-24 22:19:05 +000099 EXPECT_EQ(0xFFULL, findFirstSet(Z8));
100 EXPECT_EQ(0xFFFFULL, findFirstSet(Z16));
101 EXPECT_EQ(0xFFFFFFFFULL, findFirstSet(Z32));
102 EXPECT_EQ(0xFFFFFFFFFFFFFFFFULL, findFirstSet(Z64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +0000103
104 uint8_t NZ8 = 42;
105 uint16_t NZ16 = 42;
106 uint32_t NZ32 = 42;
107 uint64_t NZ64 = 42;
Michael J. Spencer795ecd22013-05-24 22:19:05 +0000108 EXPECT_EQ(1u, findFirstSet(NZ8));
109 EXPECT_EQ(1u, findFirstSet(NZ16));
110 EXPECT_EQ(1u, findFirstSet(NZ32));
111 EXPECT_EQ(1u, findFirstSet(NZ64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +0000112}
113
114TEST(MathExtras, findLastSet) {
115 uint8_t Z8 = 0;
116 uint16_t Z16 = 0;
117 uint32_t Z32 = 0;
118 uint64_t Z64 = 0;
Michael J. Spencer795ecd22013-05-24 22:19:05 +0000119 EXPECT_EQ(0xFFULL, findLastSet(Z8));
120 EXPECT_EQ(0xFFFFULL, findLastSet(Z16));
121 EXPECT_EQ(0xFFFFFFFFULL, findLastSet(Z32));
122 EXPECT_EQ(0xFFFFFFFFFFFFFFFFULL, findLastSet(Z64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +0000123
124 uint8_t NZ8 = 42;
125 uint16_t NZ16 = 42;
126 uint32_t NZ32 = 42;
127 uint64_t NZ64 = 42;
Michael J. Spencer795ecd22013-05-24 22:19:05 +0000128 EXPECT_EQ(5u, findLastSet(NZ8));
129 EXPECT_EQ(5u, findLastSet(NZ16));
130 EXPECT_EQ(5u, findLastSet(NZ32));
131 EXPECT_EQ(5u, findLastSet(NZ64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +0000132}
133
Dylan McKaya9ba12d2016-06-02 09:00:53 +0000134TEST(MathExtras, isIntN) {
135 EXPECT_TRUE(isIntN(16, 32767));
136 EXPECT_FALSE(isIntN(16, 32768));
137}
138
139TEST(MathExtras, isUIntN) {
140 EXPECT_TRUE(isUIntN(16, 65535));
141 EXPECT_FALSE(isUIntN(16, 65536));
142 EXPECT_TRUE(isUIntN(1, 0));
143 EXPECT_TRUE(isUIntN(6, 63));
144}
145
146TEST(MathExtras, maxIntN) {
147 EXPECT_EQ(32767, maxIntN(16));
148 EXPECT_EQ(2147483647, maxIntN(32));
Justin Lebar1e50e3b2016-07-17 18:19:28 +0000149 EXPECT_EQ(std::numeric_limits<int32_t>::max(), maxIntN(32));
150 EXPECT_EQ(std::numeric_limits<int64_t>::max(), maxIntN(64));
Dylan McKaya9ba12d2016-06-02 09:00:53 +0000151}
152
153TEST(MathExtras, minIntN) {
154 EXPECT_EQ(-32768LL, minIntN(16));
155 EXPECT_EQ(-64LL, minIntN(7));
Justin Lebar1e50e3b2016-07-17 18:19:28 +0000156 EXPECT_EQ(std::numeric_limits<int32_t>::min(), minIntN(32));
157 EXPECT_EQ(std::numeric_limits<int64_t>::min(), minIntN(64));
Dylan McKaya9ba12d2016-06-02 09:00:53 +0000158}
159
160TEST(MathExtras, maxUIntN) {
161 EXPECT_EQ(0xffffULL, maxUIntN(16));
162 EXPECT_EQ(0xffffffffULL, maxUIntN(32));
Justin Lebar8d56f472016-07-16 00:59:41 +0000163 EXPECT_EQ(0xffffffffffffffffULL, maxUIntN(64));
Dylan McKaya9ba12d2016-06-02 09:00:53 +0000164 EXPECT_EQ(1ULL, maxUIntN(1));
165 EXPECT_EQ(0x0fULL, maxUIntN(4));
166}
167
Michael J. Spencereb91eac2013-05-24 20:29:47 +0000168TEST(MathExtras, reverseBits) {
169 uint8_t NZ8 = 42;
170 uint16_t NZ16 = 42;
171 uint32_t NZ32 = 42;
172 uint64_t NZ64 = 42;
Michael J. Spencer795ecd22013-05-24 22:19:05 +0000173 EXPECT_EQ(0x54ULL, reverseBits(NZ8));
174 EXPECT_EQ(0x5400ULL, reverseBits(NZ16));
175 EXPECT_EQ(0x54000000ULL, reverseBits(NZ32));
176 EXPECT_EQ(0x5400000000000000ULL, reverseBits(NZ64));
Michael J. Spencereb91eac2013-05-24 20:29:47 +0000177}
178
Misha Brukman1757a812009-04-01 21:36:40 +0000179TEST(MathExtras, isPowerOf2_32) {
180 EXPECT_TRUE(isPowerOf2_32(1 << 6));
181 EXPECT_TRUE(isPowerOf2_32(1 << 12));
182 EXPECT_FALSE(isPowerOf2_32((1 << 19) + 3));
183 EXPECT_FALSE(isPowerOf2_32(0xABCDEF0));
184}
185
186TEST(MathExtras, isPowerOf2_64) {
187 EXPECT_TRUE(isPowerOf2_64(1LL << 46));
188 EXPECT_TRUE(isPowerOf2_64(1LL << 12));
189 EXPECT_FALSE(isPowerOf2_64((1LL << 53) + 3));
Bill Wendling66b3fff2009-04-01 22:44:18 +0000190 EXPECT_FALSE(isPowerOf2_64(0xABCDEF0ABCDEF0LL));
Misha Brukman1757a812009-04-01 21:36:40 +0000191}
192
Davide Italiano1fb1b9c2016-11-11 02:22:16 +0000193TEST(MathExtras, PowerOf2Ceil) {
Davide Italiano0970ddb2016-11-11 04:03:29 +0000194 EXPECT_EQ(0U, PowerOf2Ceil(0U));
195 EXPECT_EQ(8U, PowerOf2Ceil(8U));
196 EXPECT_EQ(8U, PowerOf2Ceil(7U));
Davide Italiano1fb1b9c2016-11-11 02:22:16 +0000197}
198
Davide Italiano62ede4e2016-11-11 02:38:24 +0000199TEST(MathExtras, PowerOf2Floor) {
Davide Italiano0970ddb2016-11-11 04:03:29 +0000200 EXPECT_EQ(0U, PowerOf2Floor(0U));
201 EXPECT_EQ(8U, PowerOf2Floor(8U));
202 EXPECT_EQ(4U, PowerOf2Floor(7U));
Davide Italiano62ede4e2016-11-11 02:38:24 +0000203}
204
Misha Brukman1757a812009-04-01 21:36:40 +0000205TEST(MathExtras, ByteSwap_32) {
206 EXPECT_EQ(0x44332211u, ByteSwap_32(0x11223344));
207 EXPECT_EQ(0xDDCCBBAAu, ByteSwap_32(0xAABBCCDD));
208}
209
210TEST(MathExtras, ByteSwap_64) {
Bill Wendling66b3fff2009-04-01 22:44:18 +0000211 EXPECT_EQ(0x8877665544332211ULL, ByteSwap_64(0x1122334455667788LL));
212 EXPECT_EQ(0x1100FFEEDDCCBBAAULL, ByteSwap_64(0xAABBCCDDEEFF0011LL));
Misha Brukman1757a812009-04-01 21:36:40 +0000213}
214
Benjamin Kramer5f6a9072015-02-12 15:35:40 +0000215TEST(MathExtras, countLeadingOnes) {
Misha Brukman1757a812009-04-01 21:36:40 +0000216 for (int i = 30; i >= 0; --i) {
217 // Start with all ones and unset some bit.
Benjamin Kramer5f6a9072015-02-12 15:35:40 +0000218 EXPECT_EQ(31u - i, countLeadingOnes(0xFFFFFFFF ^ (1 << i)));
Misha Brukman1757a812009-04-01 21:36:40 +0000219 }
Misha Brukman1757a812009-04-01 21:36:40 +0000220 for (int i = 62; i >= 0; --i) {
221 // Start with all ones and unset some bit.
Benjamin Kramer193c94b2015-02-12 19:53:49 +0000222 EXPECT_EQ(63u - i, countLeadingOnes(0xFFFFFFFFFFFFFFFFULL ^ (1LL << i)));
Misha Brukman1757a812009-04-01 21:36:40 +0000223 }
224 for (int i = 30; i >= 0; --i) {
225 // Start with all ones and unset some bit.
Benjamin Kramer5f6a9072015-02-12 15:35:40 +0000226 EXPECT_EQ(31u - i, countLeadingOnes(0xFFFFFFFF ^ (1 << i)));
Misha Brukman1757a812009-04-01 21:36:40 +0000227 }
228}
229
230TEST(MathExtras, FloatBits) {
Oscar Fuentes98a3c802011-03-01 23:11:57 +0000231 static const float kValue = 5632.34f;
Misha Brukman1757a812009-04-01 21:36:40 +0000232 EXPECT_FLOAT_EQ(kValue, BitsToFloat(FloatToBits(kValue)));
233}
234
235TEST(MathExtras, DoubleBits) {
236 static const double kValue = 87987234.983498;
NAKAMURA Takumifa994252016-03-14 23:11:28 +0000237 EXPECT_DOUBLE_EQ(kValue, BitsToDouble(DoubleToBits(kValue)));
Misha Brukman1757a812009-04-01 21:36:40 +0000238}
239
240TEST(MathExtras, MinAlign) {
241 EXPECT_EQ(1u, MinAlign(2, 3));
242 EXPECT_EQ(2u, MinAlign(2, 4));
243 EXPECT_EQ(1u, MinAlign(17, 64));
244 EXPECT_EQ(256u, MinAlign(256, 512));
245}
246
247TEST(MathExtras, NextPowerOf2) {
248 EXPECT_EQ(4u, NextPowerOf2(3));
249 EXPECT_EQ(16u, NextPowerOf2(15));
250 EXPECT_EQ(256u, NextPowerOf2(128));
251}
252
Rui Ueyamada00f2f2016-01-14 21:06:47 +0000253TEST(MathExtras, alignTo) {
254 EXPECT_EQ(8u, alignTo(5, 8));
255 EXPECT_EQ(24u, alignTo(17, 8));
256 EXPECT_EQ(0u, alignTo(~0LL, 8));
Maksim Panchenkocce239c2015-09-29 22:09:16 +0000257
Rui Ueyamada00f2f2016-01-14 21:06:47 +0000258 EXPECT_EQ(7u, alignTo(5, 8, 7));
259 EXPECT_EQ(17u, alignTo(17, 8, 1));
260 EXPECT_EQ(3u, alignTo(~0LL, 8, 3));
261 EXPECT_EQ(552u, alignTo(321, 255, 42));
Misha Brukman1757a812009-04-01 21:36:40 +0000262}
263
Daniel Sandersbe9db3c2015-11-20 13:13:53 +0000264template<typename T>
265void SaturatingAddTestHelper()
266{
267 const T Max = std::numeric_limits<T>::max();
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000268 bool ResultOverflowed;
269
Daniel Sandersbe9db3c2015-11-20 13:13:53 +0000270 EXPECT_EQ(T(3), SaturatingAdd(T(1), T(2)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000271 EXPECT_EQ(T(3), SaturatingAdd(T(1), T(2), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000272 EXPECT_FALSE(ResultOverflowed);
273
Daniel Sandersbe9db3c2015-11-20 13:13:53 +0000274 EXPECT_EQ(Max, SaturatingAdd(Max, T(1)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000275 EXPECT_EQ(Max, SaturatingAdd(Max, T(1), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000276 EXPECT_TRUE(ResultOverflowed);
277
278 EXPECT_EQ(Max, SaturatingAdd(T(1), T(Max - 1)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000279 EXPECT_EQ(Max, SaturatingAdd(T(1), T(Max - 1), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000280 EXPECT_FALSE(ResultOverflowed);
281
Daniel Sandersbe9db3c2015-11-20 13:13:53 +0000282 EXPECT_EQ(Max, SaturatingAdd(T(1), Max));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000283 EXPECT_EQ(Max, SaturatingAdd(T(1), Max, &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000284 EXPECT_TRUE(ResultOverflowed);
285
Daniel Sandersbe9db3c2015-11-20 13:13:53 +0000286 EXPECT_EQ(Max, SaturatingAdd(Max, Max));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000287 EXPECT_EQ(Max, SaturatingAdd(Max, Max, &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000288 EXPECT_TRUE(ResultOverflowed);
Daniel Sandersbe9db3c2015-11-20 13:13:53 +0000289}
290
291TEST(MathExtras, SaturatingAdd) {
292 SaturatingAddTestHelper<uint8_t>();
293 SaturatingAddTestHelper<uint16_t>();
294 SaturatingAddTestHelper<uint32_t>();
295 SaturatingAddTestHelper<uint64_t>();
296}
297
Nathan Slingerland8a065482015-11-23 15:33:43 +0000298template<typename T>
299void SaturatingMultiplyTestHelper()
300{
301 const T Max = std::numeric_limits<T>::max();
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000302 bool ResultOverflowed;
Nathan Slingerland8a065482015-11-23 15:33:43 +0000303
304 // Test basic multiplication.
305 EXPECT_EQ(T(6), SaturatingMultiply(T(2), T(3)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000306 EXPECT_EQ(T(6), SaturatingMultiply(T(2), T(3), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000307 EXPECT_FALSE(ResultOverflowed);
308
Nathan Slingerland8a065482015-11-23 15:33:43 +0000309 EXPECT_EQ(T(6), SaturatingMultiply(T(3), T(2)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000310 EXPECT_EQ(T(6), SaturatingMultiply(T(3), T(2), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000311 EXPECT_FALSE(ResultOverflowed);
Nathan Slingerland8a065482015-11-23 15:33:43 +0000312
313 // Test multiplication by zero.
314 EXPECT_EQ(T(0), SaturatingMultiply(T(0), T(0)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000315 EXPECT_EQ(T(0), SaturatingMultiply(T(0), T(0), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000316 EXPECT_FALSE(ResultOverflowed);
317
Nathan Slingerland8a065482015-11-23 15:33:43 +0000318 EXPECT_EQ(T(0), SaturatingMultiply(T(1), T(0)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000319 EXPECT_EQ(T(0), SaturatingMultiply(T(1), T(0), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000320 EXPECT_FALSE(ResultOverflowed);
321
Nathan Slingerland8a065482015-11-23 15:33:43 +0000322 EXPECT_EQ(T(0), SaturatingMultiply(T(0), T(1)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000323 EXPECT_EQ(T(0), SaturatingMultiply(T(0), T(1), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000324 EXPECT_FALSE(ResultOverflowed);
325
Nathan Slingerland8a065482015-11-23 15:33:43 +0000326 EXPECT_EQ(T(0), SaturatingMultiply(Max, T(0)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000327 EXPECT_EQ(T(0), SaturatingMultiply(Max, T(0), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000328 EXPECT_FALSE(ResultOverflowed);
329
Nathan Slingerland8a065482015-11-23 15:33:43 +0000330 EXPECT_EQ(T(0), SaturatingMultiply(T(0), Max));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000331 EXPECT_EQ(T(0), SaturatingMultiply(T(0), Max, &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000332 EXPECT_FALSE(ResultOverflowed);
Nathan Slingerland8a065482015-11-23 15:33:43 +0000333
334 // Test multiplication by maximum value.
335 EXPECT_EQ(Max, SaturatingMultiply(Max, T(2)));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000336 EXPECT_EQ(Max, SaturatingMultiply(Max, T(2), &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000337 EXPECT_TRUE(ResultOverflowed);
338
339 EXPECT_EQ(Max, SaturatingMultiply(T(2), Max));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000340 EXPECT_EQ(Max, SaturatingMultiply(T(2), Max, &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000341 EXPECT_TRUE(ResultOverflowed);
342
Nathan Slingerland8a065482015-11-23 15:33:43 +0000343 EXPECT_EQ(Max, SaturatingMultiply(Max, Max));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000344 EXPECT_EQ(Max, SaturatingMultiply(Max, Max, &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000345 EXPECT_TRUE(ResultOverflowed);
Nathan Slingerland8a065482015-11-23 15:33:43 +0000346
347 // Test interesting boundary conditions for algorithm -
348 // ((1 << A) - 1) * ((1 << B) + K) for K in [-1, 0, 1]
349 // and A + B == std::numeric_limits<T>::digits.
350 // We expect overflow iff A > B and K = 1.
351 const int Digits = std::numeric_limits<T>::digits;
352 for (int A = 1, B = Digits - 1; B >= 1; ++A, --B) {
353 for (int K = -1; K <= 1; ++K) {
354 T X = (T(1) << A) - T(1);
355 T Y = (T(1) << B) + K;
356 bool OverflowExpected = A > B && K == 1;
357
358 if(OverflowExpected) {
359 EXPECT_EQ(Max, SaturatingMultiply(X, Y));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000360 EXPECT_EQ(Max, SaturatingMultiply(X, Y, &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000361 EXPECT_TRUE(ResultOverflowed);
Nathan Slingerland8a065482015-11-23 15:33:43 +0000362 } else {
363 EXPECT_EQ(X * Y, SaturatingMultiply(X, Y));
Nathan Slingerland644badb2015-12-09 17:11:28 +0000364 EXPECT_EQ(X * Y, SaturatingMultiply(X, Y, &ResultOverflowed));
Nathan Slingerland2e1d85a2015-11-23 21:54:22 +0000365 EXPECT_FALSE(ResultOverflowed);
Nathan Slingerland8a065482015-11-23 15:33:43 +0000366 }
367 }
368 }
369}
370
371TEST(MathExtras, SaturatingMultiply) {
372 SaturatingMultiplyTestHelper<uint8_t>();
373 SaturatingMultiplyTestHelper<uint16_t>();
374 SaturatingMultiplyTestHelper<uint32_t>();
375 SaturatingMultiplyTestHelper<uint64_t>();
376}
377
Nathan Slingerland7bee3162016-01-12 22:34:00 +0000378template<typename T>
379void SaturatingMultiplyAddTestHelper()
380{
381 const T Max = std::numeric_limits<T>::max();
382 bool ResultOverflowed;
383
384 // Test basic multiply-add.
385 EXPECT_EQ(T(16), SaturatingMultiplyAdd(T(2), T(3), T(10)));
386 EXPECT_EQ(T(16), SaturatingMultiplyAdd(T(2), T(3), T(10), &ResultOverflowed));
387 EXPECT_FALSE(ResultOverflowed);
388
389 // Test multiply overflows, add doesn't overflow
390 EXPECT_EQ(Max, SaturatingMultiplyAdd(Max, Max, T(0), &ResultOverflowed));
391 EXPECT_TRUE(ResultOverflowed);
392
393 // Test multiply doesn't overflow, add overflows
394 EXPECT_EQ(Max, SaturatingMultiplyAdd(T(1), T(1), Max, &ResultOverflowed));
395 EXPECT_TRUE(ResultOverflowed);
396
397 // Test multiply-add with Max as operand
398 EXPECT_EQ(Max, SaturatingMultiplyAdd(T(1), T(1), Max, &ResultOverflowed));
399 EXPECT_TRUE(ResultOverflowed);
400
401 EXPECT_EQ(Max, SaturatingMultiplyAdd(T(1), Max, T(1), &ResultOverflowed));
402 EXPECT_TRUE(ResultOverflowed);
403
404 EXPECT_EQ(Max, SaturatingMultiplyAdd(Max, Max, T(1), &ResultOverflowed));
405 EXPECT_TRUE(ResultOverflowed);
406
407 EXPECT_EQ(Max, SaturatingMultiplyAdd(Max, Max, Max, &ResultOverflowed));
408 EXPECT_TRUE(ResultOverflowed);
409
410 // Test multiply-add with 0 as operand
411 EXPECT_EQ(T(1), SaturatingMultiplyAdd(T(1), T(1), T(0), &ResultOverflowed));
412 EXPECT_FALSE(ResultOverflowed);
413
414 EXPECT_EQ(T(1), SaturatingMultiplyAdd(T(1), T(0), T(1), &ResultOverflowed));
415 EXPECT_FALSE(ResultOverflowed);
416
417 EXPECT_EQ(T(1), SaturatingMultiplyAdd(T(0), T(0), T(1), &ResultOverflowed));
418 EXPECT_FALSE(ResultOverflowed);
419
420 EXPECT_EQ(T(0), SaturatingMultiplyAdd(T(0), T(0), T(0), &ResultOverflowed));
421 EXPECT_FALSE(ResultOverflowed);
422
423}
424
425TEST(MathExtras, SaturatingMultiplyAdd) {
426 SaturatingMultiplyAddTestHelper<uint8_t>();
427 SaturatingMultiplyAddTestHelper<uint16_t>();
428 SaturatingMultiplyAddTestHelper<uint32_t>();
429 SaturatingMultiplyAddTestHelper<uint64_t>();
430}
431
Justin Lebarcbba3c42016-07-17 18:19:21 +0000432TEST(MathExtras, IsShiftedUInt) {
433 EXPECT_TRUE((isShiftedUInt<1, 0>(0)));
434 EXPECT_TRUE((isShiftedUInt<1, 0>(1)));
435 EXPECT_FALSE((isShiftedUInt<1, 0>(2)));
436 EXPECT_FALSE((isShiftedUInt<1, 0>(3)));
437 EXPECT_FALSE((isShiftedUInt<1, 0>(0x8000000000000000)));
438 EXPECT_TRUE((isShiftedUInt<1, 63>(0x8000000000000000)));
439 EXPECT_TRUE((isShiftedUInt<2, 62>(0xC000000000000000)));
440 EXPECT_FALSE((isShiftedUInt<2, 62>(0xE000000000000000)));
441
442 // 0x201 is ten bits long and has a 1 in the MSB and LSB.
443 EXPECT_TRUE((isShiftedUInt<10, 5>(uint64_t(0x201) << 5)));
444 EXPECT_FALSE((isShiftedUInt<10, 5>(uint64_t(0x201) << 4)));
445 EXPECT_FALSE((isShiftedUInt<10, 5>(uint64_t(0x201) << 6)));
Misha Brukman1757a812009-04-01 21:36:40 +0000446}
Justin Lebarcbba3c42016-07-17 18:19:21 +0000447
448TEST(MathExtras, IsShiftedInt) {
449 EXPECT_TRUE((isShiftedInt<1, 0>(0)));
450 EXPECT_TRUE((isShiftedInt<1, 0>(-1)));
451 EXPECT_FALSE((isShiftedInt<1, 0>(2)));
452 EXPECT_FALSE((isShiftedInt<1, 0>(3)));
453 EXPECT_FALSE((isShiftedInt<1, 0>(0x8000000000000000)));
454 EXPECT_TRUE((isShiftedInt<1, 63>(0x8000000000000000)));
455 EXPECT_TRUE((isShiftedInt<2, 62>(0xC000000000000000)));
456 EXPECT_FALSE((isShiftedInt<2, 62>(0xE000000000000000)));
457
458 // 0x201 is ten bits long and has a 1 in the MSB and LSB.
459 EXPECT_TRUE((isShiftedInt<11, 5>(int64_t(0x201) << 5)));
460 EXPECT_FALSE((isShiftedInt<11, 5>(int64_t(0x201) << 3)));
461 EXPECT_FALSE((isShiftedInt<11, 5>(int64_t(0x201) << 6)));
462 EXPECT_TRUE((isShiftedInt<11, 5>(-(int64_t(0x201) << 5))));
463 EXPECT_FALSE((isShiftedInt<11, 5>(-(int64_t(0x201) << 3))));
464 EXPECT_FALSE((isShiftedInt<11, 5>(-(int64_t(0x201) << 6))));
465
466 EXPECT_TRUE((isShiftedInt<6, 10>(-(int64_t(1) << 15))));
467 EXPECT_FALSE((isShiftedInt<6, 10>(int64_t(1) << 15)));
468}
469
470} // namespace