Nick Kledzik | 8147752 | 2014-02-05 22:22:56 +0000 | [diff] [blame] | 1 | //===- llvm/unittest/ADT/ArrayRefTest.cpp - ArrayRef unit tests -----------===// |
| 2 | // |
| 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 "llvm/ADT/ArrayRef.h" |
| 11 | #include "llvm/Support/Allocator.h" |
| 12 | #include "llvm/Support/raw_ostream.h" |
| 13 | #include "gtest/gtest.h" |
Vedant Kumar | b527f09 | 2017-05-31 21:47:52 +0000 | [diff] [blame] | 14 | #include <limits> |
Aaron Ballman | c4326a1 | 2015-02-17 17:44:07 +0000 | [diff] [blame] | 15 | #include <vector> |
Nick Kledzik | 8147752 | 2014-02-05 22:22:56 +0000 | [diff] [blame] | 16 | using namespace llvm; |
| 17 | |
David Blaikie | 07f3526 | 2014-08-31 01:33:41 +0000 | [diff] [blame] | 18 | // Check that the ArrayRef-of-pointer converting constructor only allows adding |
| 19 | // cv qualifiers (not removing them, or otherwise changing the type) |
| 20 | static_assert( |
| 21 | std::is_convertible<ArrayRef<int *>, ArrayRef<const int *>>::value, |
| 22 | "Adding const"); |
| 23 | static_assert( |
| 24 | std::is_convertible<ArrayRef<int *>, ArrayRef<volatile int *>>::value, |
| 25 | "Adding volatile"); |
| 26 | static_assert(!std::is_convertible<ArrayRef<int *>, ArrayRef<float *>>::value, |
| 27 | "Changing pointer of one type to a pointer of another"); |
| 28 | static_assert( |
| 29 | !std::is_convertible<ArrayRef<const int *>, ArrayRef<int *>>::value, |
| 30 | "Removing const"); |
| 31 | static_assert( |
| 32 | !std::is_convertible<ArrayRef<volatile int *>, ArrayRef<int *>>::value, |
| 33 | "Removing volatile"); |
| 34 | |
Jordan Rose | 8f3f50a | 2016-10-11 20:39:16 +0000 | [diff] [blame] | 35 | // Check that we can't accidentally assign a temporary location to an ArrayRef. |
| 36 | // (Unfortunately we can't make use of the same thing with constructors.) |
| 37 | // |
| 38 | // Disable this check under MSVC; even MSVC 2015 isn't inconsistent between |
| 39 | // std::is_assignable and actually writing such an assignment. |
| 40 | #if !defined(_MSC_VER) |
| 41 | static_assert( |
Richard Smith | b13ea4e | 2018-02-02 22:29:54 +0000 | [diff] [blame] | 42 | !std::is_assignable<ArrayRef<int *>&, int *>::value, |
Jordan Rose | 8f3f50a | 2016-10-11 20:39:16 +0000 | [diff] [blame] | 43 | "Assigning from single prvalue element"); |
| 44 | static_assert( |
Richard Smith | b13ea4e | 2018-02-02 22:29:54 +0000 | [diff] [blame] | 45 | !std::is_assignable<ArrayRef<int *>&, int * &&>::value, |
Jordan Rose | 8f3f50a | 2016-10-11 20:39:16 +0000 | [diff] [blame] | 46 | "Assigning from single xvalue element"); |
| 47 | static_assert( |
Richard Smith | b13ea4e | 2018-02-02 22:29:54 +0000 | [diff] [blame] | 48 | std::is_assignable<ArrayRef<int *>&, int * &>::value, |
Jordan Rose | 8f3f50a | 2016-10-11 20:39:16 +0000 | [diff] [blame] | 49 | "Assigning from single lvalue element"); |
| 50 | static_assert( |
Richard Smith | b13ea4e | 2018-02-02 22:29:54 +0000 | [diff] [blame] | 51 | !std::is_assignable<ArrayRef<int *>&, std::initializer_list<int *>>::value, |
Jordan Rose | 8f3f50a | 2016-10-11 20:39:16 +0000 | [diff] [blame] | 52 | "Assigning from an initializer list"); |
| 53 | #endif |
| 54 | |
Benjamin Kramer | 0d2030d | 2015-08-04 15:52:56 +0000 | [diff] [blame] | 55 | namespace { |
Nick Kledzik | 8147752 | 2014-02-05 22:22:56 +0000 | [diff] [blame] | 56 | |
| 57 | TEST(ArrayRefTest, AllocatorCopy) { |
| 58 | BumpPtrAllocator Alloc; |
| 59 | static const uint16_t Words1[] = { 1, 4, 200, 37 }; |
| 60 | ArrayRef<uint16_t> Array1 = makeArrayRef(Words1, 4); |
| 61 | static const uint16_t Words2[] = { 11, 4003, 67, 64000, 13 }; |
| 62 | ArrayRef<uint16_t> Array2 = makeArrayRef(Words2, 5); |
| 63 | ArrayRef<uint16_t> Array1c = Array1.copy(Alloc); |
Aaron Ballman | ff7ef6c | 2015-06-09 12:03:46 +0000 | [diff] [blame] | 64 | ArrayRef<uint16_t> Array2c = Array2.copy(Alloc); |
Nick Kledzik | 8147752 | 2014-02-05 22:22:56 +0000 | [diff] [blame] | 65 | EXPECT_TRUE(Array1.equals(Array1c)); |
| 66 | EXPECT_NE(Array1.data(), Array1c.data()); |
| 67 | EXPECT_TRUE(Array2.equals(Array2c)); |
| 68 | EXPECT_NE(Array2.data(), Array2c.data()); |
Benjamin Kramer | 0d2030d | 2015-08-04 15:52:56 +0000 | [diff] [blame] | 69 | |
| 70 | // Check that copy can cope with uninitialized memory. |
| 71 | struct NonAssignable { |
| 72 | const char *Ptr; |
| 73 | |
Benjamin Kramer | e0fdfac | 2015-08-05 09:39:41 +0000 | [diff] [blame] | 74 | NonAssignable(const char *Ptr) : Ptr(Ptr) {} |
Benjamin Kramer | 0d2030d | 2015-08-04 15:52:56 +0000 | [diff] [blame] | 75 | NonAssignable(const NonAssignable &RHS) = default; |
| 76 | void operator=(const NonAssignable &RHS) { assert(RHS.Ptr != nullptr); } |
| 77 | bool operator==(const NonAssignable &RHS) const { return Ptr == RHS.Ptr; } |
Benjamin Kramer | e0fdfac | 2015-08-05 09:39:41 +0000 | [diff] [blame] | 78 | } Array3Src[] = {"hello", "world"}; |
Benjamin Kramer | 0d2030d | 2015-08-04 15:52:56 +0000 | [diff] [blame] | 79 | ArrayRef<NonAssignable> Array3Copy = makeArrayRef(Array3Src).copy(Alloc); |
| 80 | EXPECT_EQ(makeArrayRef(Array3Src), Array3Copy); |
| 81 | EXPECT_NE(makeArrayRef(Array3Src).data(), Array3Copy.data()); |
Nick Kledzik | 8147752 | 2014-02-05 22:22:56 +0000 | [diff] [blame] | 82 | } |
| 83 | |
Vedant Kumar | b527f09 | 2017-05-31 21:47:52 +0000 | [diff] [blame] | 84 | TEST(ArrayRefTest, SizeTSizedOperations) { |
| 85 | ArrayRef<char> AR(nullptr, std::numeric_limits<ptrdiff_t>::max()); |
| 86 | |
| 87 | // Check that drop_back accepts size_t-sized numbers. |
| 88 | EXPECT_EQ(1U, AR.drop_back(AR.size() - 1).size()); |
| 89 | |
| 90 | // Check that drop_front accepts size_t-sized numbers. |
| 91 | EXPECT_EQ(1U, AR.drop_front(AR.size() - 1).size()); |
| 92 | |
| 93 | // Check that slice accepts size_t-sized numbers. |
| 94 | EXPECT_EQ(1U, AR.slice(AR.size() - 1).size()); |
| 95 | EXPECT_EQ(AR.size() - 1, AR.slice(1, AR.size() - 1).size()); |
| 96 | } |
| 97 | |
David Majnemer | 38dbb02 | 2014-07-05 06:12:30 +0000 | [diff] [blame] | 98 | TEST(ArrayRefTest, DropBack) { |
| 99 | static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; |
| 100 | ArrayRef<int> AR1(TheNumbers); |
| 101 | ArrayRef<int> AR2(TheNumbers, AR1.size() - 1); |
| 102 | EXPECT_TRUE(AR1.drop_back().equals(AR2)); |
| 103 | } |
| 104 | |
Reid Kleckner | 680266e | 2016-05-03 20:53:20 +0000 | [diff] [blame] | 105 | TEST(ArrayRefTest, DropFront) { |
| 106 | static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; |
| 107 | ArrayRef<int> AR1(TheNumbers); |
| 108 | ArrayRef<int> AR2(&TheNumbers[2], AR1.size() - 2); |
| 109 | EXPECT_TRUE(AR1.drop_front(2).equals(AR2)); |
| 110 | } |
| 111 | |
Zachary Turner | 370e6fd | 2016-11-22 23:22:19 +0000 | [diff] [blame] | 112 | TEST(ArrayRefTest, DropWhile) { |
| 113 | static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; |
| 114 | ArrayRef<int> AR1(TheNumbers); |
| 115 | ArrayRef<int> Expected = AR1.drop_front(3); |
| 116 | EXPECT_EQ(Expected, AR1.drop_while([](const int &N) { return N % 2 == 1; })); |
| 117 | |
| 118 | EXPECT_EQ(AR1, AR1.drop_while([](const int &N) { return N < 0; })); |
| 119 | EXPECT_EQ(ArrayRef<int>(), |
| 120 | AR1.drop_while([](const int &N) { return N > 0; })); |
| 121 | } |
| 122 | |
| 123 | TEST(ArrayRefTest, DropUntil) { |
| 124 | static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; |
| 125 | ArrayRef<int> AR1(TheNumbers); |
| 126 | ArrayRef<int> Expected = AR1.drop_front(3); |
| 127 | EXPECT_EQ(Expected, AR1.drop_until([](const int &N) { return N % 2 == 0; })); |
| 128 | |
| 129 | EXPECT_EQ(ArrayRef<int>(), |
| 130 | AR1.drop_until([](const int &N) { return N < 0; })); |
| 131 | EXPECT_EQ(AR1, AR1.drop_until([](const int &N) { return N > 0; })); |
| 132 | } |
| 133 | |
Zachary Turner | e046d5c | 2016-08-30 18:45:32 +0000 | [diff] [blame] | 134 | TEST(ArrayRefTest, TakeBack) { |
Zachary Turner | bb0403b | 2016-08-30 17:29:59 +0000 | [diff] [blame] | 135 | static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; |
| 136 | ArrayRef<int> AR1(TheNumbers); |
| 137 | ArrayRef<int> AR2(AR1.end() - 1, 1); |
Zachary Turner | e046d5c | 2016-08-30 18:45:32 +0000 | [diff] [blame] | 138 | EXPECT_TRUE(AR1.take_back().equals(AR2)); |
Zachary Turner | bb0403b | 2016-08-30 17:29:59 +0000 | [diff] [blame] | 139 | } |
| 140 | |
Zachary Turner | e046d5c | 2016-08-30 18:45:32 +0000 | [diff] [blame] | 141 | TEST(ArrayRefTest, TakeFront) { |
Zachary Turner | bb0403b | 2016-08-30 17:29:59 +0000 | [diff] [blame] | 142 | static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; |
| 143 | ArrayRef<int> AR1(TheNumbers); |
| 144 | ArrayRef<int> AR2(AR1.data(), 2); |
Zachary Turner | e046d5c | 2016-08-30 18:45:32 +0000 | [diff] [blame] | 145 | EXPECT_TRUE(AR1.take_front(2).equals(AR2)); |
Zachary Turner | bb0403b | 2016-08-30 17:29:59 +0000 | [diff] [blame] | 146 | } |
| 147 | |
Zachary Turner | 370e6fd | 2016-11-22 23:22:19 +0000 | [diff] [blame] | 148 | TEST(ArrayRefTest, TakeWhile) { |
| 149 | static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; |
| 150 | ArrayRef<int> AR1(TheNumbers); |
| 151 | ArrayRef<int> Expected = AR1.take_front(3); |
| 152 | EXPECT_EQ(Expected, AR1.take_while([](const int &N) { return N % 2 == 1; })); |
| 153 | |
| 154 | EXPECT_EQ(ArrayRef<int>(), |
| 155 | AR1.take_while([](const int &N) { return N < 0; })); |
| 156 | EXPECT_EQ(AR1, AR1.take_while([](const int &N) { return N > 0; })); |
| 157 | } |
| 158 | |
| 159 | TEST(ArrayRefTest, TakeUntil) { |
| 160 | static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; |
| 161 | ArrayRef<int> AR1(TheNumbers); |
| 162 | ArrayRef<int> Expected = AR1.take_front(3); |
| 163 | EXPECT_EQ(Expected, AR1.take_until([](const int &N) { return N % 2 == 0; })); |
| 164 | |
| 165 | EXPECT_EQ(AR1, AR1.take_until([](const int &N) { return N < 0; })); |
| 166 | EXPECT_EQ(ArrayRef<int>(), |
| 167 | AR1.take_until([](const int &N) { return N > 0; })); |
| 168 | } |
| 169 | |
Chandler Carruth | 8e704b1 | 2014-07-27 01:11:19 +0000 | [diff] [blame] | 170 | TEST(ArrayRefTest, Equals) { |
| 171 | static const int A1[] = {1, 2, 3, 4, 5, 6, 7, 8}; |
| 172 | ArrayRef<int> AR1(A1); |
Benjamin Kramer | c255d35 | 2015-03-01 21:05:05 +0000 | [diff] [blame] | 173 | EXPECT_TRUE(AR1.equals({1, 2, 3, 4, 5, 6, 7, 8})); |
| 174 | EXPECT_FALSE(AR1.equals({8, 1, 2, 4, 5, 6, 6, 7})); |
| 175 | EXPECT_FALSE(AR1.equals({2, 4, 5, 6, 6, 7, 8, 1})); |
| 176 | EXPECT_FALSE(AR1.equals({0, 1, 2, 4, 5, 6, 6, 7})); |
| 177 | EXPECT_FALSE(AR1.equals({1, 2, 42, 4, 5, 6, 7, 8})); |
| 178 | EXPECT_FALSE(AR1.equals({42, 2, 3, 4, 5, 6, 7, 8})); |
| 179 | EXPECT_FALSE(AR1.equals({1, 2, 3, 4, 5, 6, 7, 42})); |
| 180 | EXPECT_FALSE(AR1.equals({1, 2, 3, 4, 5, 6, 7})); |
| 181 | EXPECT_FALSE(AR1.equals({1, 2, 3, 4, 5, 6, 7, 8, 9})); |
Chandler Carruth | 8e704b1 | 2014-07-27 01:11:19 +0000 | [diff] [blame] | 182 | |
| 183 | ArrayRef<int> AR1a = AR1.drop_back(); |
Benjamin Kramer | c255d35 | 2015-03-01 21:05:05 +0000 | [diff] [blame] | 184 | EXPECT_TRUE(AR1a.equals({1, 2, 3, 4, 5, 6, 7})); |
| 185 | EXPECT_FALSE(AR1a.equals({1, 2, 3, 4, 5, 6, 7, 8})); |
Chandler Carruth | 8e704b1 | 2014-07-27 01:11:19 +0000 | [diff] [blame] | 186 | |
| 187 | ArrayRef<int> AR1b = AR1a.slice(2, 4); |
Benjamin Kramer | c255d35 | 2015-03-01 21:05:05 +0000 | [diff] [blame] | 188 | EXPECT_TRUE(AR1b.equals({3, 4, 5, 6})); |
| 189 | EXPECT_FALSE(AR1b.equals({2, 3, 4, 5, 6})); |
| 190 | EXPECT_FALSE(AR1b.equals({3, 4, 5, 6, 7})); |
Chandler Carruth | 8e704b1 | 2014-07-27 01:11:19 +0000 | [diff] [blame] | 191 | } |
Nick Kledzik | 8147752 | 2014-02-05 22:22:56 +0000 | [diff] [blame] | 192 | |
Duncan P. N. Exon Smith | 7d84c8e | 2014-08-19 19:18:46 +0000 | [diff] [blame] | 193 | TEST(ArrayRefTest, EmptyEquals) { |
| 194 | EXPECT_TRUE(ArrayRef<unsigned>() == ArrayRef<unsigned>()); |
| 195 | } |
| 196 | |
Craig Topper | 8316713 | 2014-08-30 16:48:19 +0000 | [diff] [blame] | 197 | TEST(ArrayRefTest, ConstConvert) { |
| 198 | int buf[4]; |
| 199 | for (int i = 0; i < 4; ++i) |
| 200 | buf[i] = i; |
| 201 | |
| 202 | static int *A[] = {&buf[0], &buf[1], &buf[2], &buf[3]}; |
| 203 | ArrayRef<const int *> a((ArrayRef<int *>(A))); |
| 204 | a = ArrayRef<int *>(A); |
| 205 | } |
| 206 | |
Aaron Ballman | c4326a1 | 2015-02-17 17:44:07 +0000 | [diff] [blame] | 207 | static std::vector<int> ReturnTest12() { return {1, 2}; } |
Aaron Ballman | 4e29d07 | 2015-02-17 17:08:08 +0000 | [diff] [blame] | 208 | static void ArgTest12(ArrayRef<int> A) { |
Aaron Ballman | c4326a1 | 2015-02-17 17:44:07 +0000 | [diff] [blame] | 209 | EXPECT_EQ(2U, A.size()); |
Aaron Ballman | 4e29d07 | 2015-02-17 17:08:08 +0000 | [diff] [blame] | 210 | EXPECT_EQ(1, A[0]); |
| 211 | EXPECT_EQ(2, A[1]); |
| 212 | } |
| 213 | |
Aaron Ballman | 8b0b0a8 | 2015-02-17 15:37:53 +0000 | [diff] [blame] | 214 | TEST(ArrayRefTest, InitializerList) { |
David Blaikie | dffc922 | 2016-08-25 22:09:13 +0000 | [diff] [blame] | 215 | std::initializer_list<int> init_list = { 0, 1, 2, 3, 4 }; |
| 216 | ArrayRef<int> A = init_list; |
Aaron Ballman | 8b0b0a8 | 2015-02-17 15:37:53 +0000 | [diff] [blame] | 217 | for (int i = 0; i < 5; ++i) |
| 218 | EXPECT_EQ(i, A[i]); |
Aaron Ballman | 4e29d07 | 2015-02-17 17:08:08 +0000 | [diff] [blame] | 219 | |
Aaron Ballman | c4326a1 | 2015-02-17 17:44:07 +0000 | [diff] [blame] | 220 | std::vector<int> B = ReturnTest12(); |
| 221 | A = B; |
Aaron Ballman | 4e29d07 | 2015-02-17 17:08:08 +0000 | [diff] [blame] | 222 | EXPECT_EQ(1, A[0]); |
| 223 | EXPECT_EQ(2, A[1]); |
| 224 | |
| 225 | ArgTest12({1, 2}); |
Aaron Ballman | 8b0b0a8 | 2015-02-17 15:37:53 +0000 | [diff] [blame] | 226 | } |
| 227 | |
Jordan Rose | 8f3f50a | 2016-10-11 20:39:16 +0000 | [diff] [blame] | 228 | TEST(ArrayRefTest, EmptyInitializerList) { |
| 229 | ArrayRef<int> A = {}; |
| 230 | EXPECT_TRUE(A.empty()); |
| 231 | |
| 232 | A = {}; |
| 233 | EXPECT_TRUE(A.empty()); |
| 234 | } |
| 235 | |
Mehdi Amini | 4806ac4 | 2015-09-10 00:05:04 +0000 | [diff] [blame] | 236 | // Test that makeArrayRef works on ArrayRef (no-op) |
| 237 | TEST(ArrayRefTest, makeArrayRef) { |
| 238 | static const int A1[] = {1, 2, 3, 4, 5, 6, 7, 8}; |
| 239 | |
| 240 | // No copy expected for non-const ArrayRef (true no-op) |
| 241 | ArrayRef<int> AR1(A1); |
| 242 | ArrayRef<int> &AR1Ref = makeArrayRef(AR1); |
| 243 | EXPECT_EQ(&AR1, &AR1Ref); |
| 244 | |
| 245 | // A copy is expected for non-const ArrayRef (thin copy) |
| 246 | const ArrayRef<int> AR2(A1); |
| 247 | const ArrayRef<int> &AR2Ref = makeArrayRef(AR2); |
| 248 | EXPECT_NE(&AR2Ref, &AR2); |
| 249 | EXPECT_TRUE(AR2.equals(AR2Ref)); |
| 250 | } |
| 251 | |
Nick Kledzik | 8147752 | 2014-02-05 22:22:56 +0000 | [diff] [blame] | 252 | } // end anonymous namespace |