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" 14 #include <vector> 15 using namespace llvm; 16 17 // Check that the ArrayRef-of-pointer converting constructor only allows adding 18 // cv qualifiers (not removing them, or otherwise changing the type) 19 static_assert( 20 std::is_convertible<ArrayRef<int *>, ArrayRef<const int *>>::value, 21 "Adding const"); 22 static_assert( 23 std::is_convertible<ArrayRef<int *>, ArrayRef<volatile int *>>::value, 24 "Adding volatile"); 25 static_assert(!std::is_convertible<ArrayRef<int *>, ArrayRef<float *>>::value, 26 "Changing pointer of one type to a pointer of another"); 27 static_assert( 28 !std::is_convertible<ArrayRef<const int *>, ArrayRef<int *>>::value, 29 "Removing const"); 30 static_assert( 31 !std::is_convertible<ArrayRef<volatile int *>, ArrayRef<int *>>::value, 32 "Removing volatile"); 33 34 // Check that we can't accidentally assign a temporary location to an ArrayRef. 35 // (Unfortunately we can't make use of the same thing with constructors.) 36 // 37 // Disable this check under MSVC; even MSVC 2015 isn't inconsistent between 38 // std::is_assignable and actually writing such an assignment. 39 #if !defined(_MSC_VER) 40 static_assert( 41 !std::is_assignable<ArrayRef<int *>, int *>::value, 42 "Assigning from single prvalue element"); 43 static_assert( 44 !std::is_assignable<ArrayRef<int *>, int * &&>::value, 45 "Assigning from single xvalue element"); 46 static_assert( 47 std::is_assignable<ArrayRef<int *>, int * &>::value, 48 "Assigning from single lvalue element"); 49 static_assert( 50 !std::is_assignable<ArrayRef<int *>, std::initializer_list<int *>>::value, 51 "Assigning from an initializer list"); 52 #endif 53 54 namespace { 55 56 TEST(ArrayRefTest, AllocatorCopy) { 57 BumpPtrAllocator Alloc; 58 static const uint16_t Words1[] = { 1, 4, 200, 37 }; 59 ArrayRef<uint16_t> Array1 = makeArrayRef(Words1, 4); 60 static const uint16_t Words2[] = { 11, 4003, 67, 64000, 13 }; 61 ArrayRef<uint16_t> Array2 = makeArrayRef(Words2, 5); 62 ArrayRef<uint16_t> Array1c = Array1.copy(Alloc); 63 ArrayRef<uint16_t> Array2c = Array2.copy(Alloc); 64 EXPECT_TRUE(Array1.equals(Array1c)); 65 EXPECT_NE(Array1.data(), Array1c.data()); 66 EXPECT_TRUE(Array2.equals(Array2c)); 67 EXPECT_NE(Array2.data(), Array2c.data()); 68 69 // Check that copy can cope with uninitialized memory. 70 struct NonAssignable { 71 const char *Ptr; 72 73 NonAssignable(const char *Ptr) : Ptr(Ptr) {} 74 NonAssignable(const NonAssignable &RHS) = default; 75 void operator=(const NonAssignable &RHS) { assert(RHS.Ptr != nullptr); } 76 bool operator==(const NonAssignable &RHS) const { return Ptr == RHS.Ptr; } 77 } Array3Src[] = {"hello", "world"}; 78 ArrayRef<NonAssignable> Array3Copy = makeArrayRef(Array3Src).copy(Alloc); 79 EXPECT_EQ(makeArrayRef(Array3Src), Array3Copy); 80 EXPECT_NE(makeArrayRef(Array3Src).data(), Array3Copy.data()); 81 } 82 83 TEST(ArrayRefTest, DropBack) { 84 static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; 85 ArrayRef<int> AR1(TheNumbers); 86 ArrayRef<int> AR2(TheNumbers, AR1.size() - 1); 87 EXPECT_TRUE(AR1.drop_back().equals(AR2)); 88 89 // Check that drop_back accepts size_t-sized numbers. 90 ArrayRef<char> AR3((const char *)0x10000, SIZE_MAX - 0x10000); 91 EXPECT_EQ(1U, AR3.drop_back(AR3.size() - 1).size()); 92 } 93 94 TEST(ArrayRefTest, DropFront) { 95 static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; 96 ArrayRef<int> AR1(TheNumbers); 97 ArrayRef<int> AR2(&TheNumbers[2], AR1.size() - 2); 98 EXPECT_TRUE(AR1.drop_front(2).equals(AR2)); 99 100 // Check that drop_front accepts size_t-sized numbers. 101 ArrayRef<char> AR3((const char *)0x10000, SIZE_MAX - 0x10000); 102 EXPECT_EQ(1U, AR3.drop_front(AR3.size() - 1).size()); 103 } 104 105 TEST(ArrayRefTest, DropWhile) { 106 static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; 107 ArrayRef<int> AR1(TheNumbers); 108 ArrayRef<int> Expected = AR1.drop_front(3); 109 EXPECT_EQ(Expected, AR1.drop_while([](const int &N) { return N % 2 == 1; })); 110 111 EXPECT_EQ(AR1, AR1.drop_while([](const int &N) { return N < 0; })); 112 EXPECT_EQ(ArrayRef<int>(), 113 AR1.drop_while([](const int &N) { return N > 0; })); 114 } 115 116 TEST(ArrayRefTest, DropUntil) { 117 static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; 118 ArrayRef<int> AR1(TheNumbers); 119 ArrayRef<int> Expected = AR1.drop_front(3); 120 EXPECT_EQ(Expected, AR1.drop_until([](const int &N) { return N % 2 == 0; })); 121 122 EXPECT_EQ(ArrayRef<int>(), 123 AR1.drop_until([](const int &N) { return N < 0; })); 124 EXPECT_EQ(AR1, AR1.drop_until([](const int &N) { return N > 0; })); 125 } 126 127 TEST(ArrayRefTest, TakeBack) { 128 static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; 129 ArrayRef<int> AR1(TheNumbers); 130 ArrayRef<int> AR2(AR1.end() - 1, 1); 131 EXPECT_TRUE(AR1.take_back().equals(AR2)); 132 } 133 134 TEST(ArrayRefTest, TakeFront) { 135 static const int TheNumbers[] = {4, 8, 15, 16, 23, 42}; 136 ArrayRef<int> AR1(TheNumbers); 137 ArrayRef<int> AR2(AR1.data(), 2); 138 EXPECT_TRUE(AR1.take_front(2).equals(AR2)); 139 } 140 141 TEST(ArrayRefTest, TakeWhile) { 142 static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; 143 ArrayRef<int> AR1(TheNumbers); 144 ArrayRef<int> Expected = AR1.take_front(3); 145 EXPECT_EQ(Expected, AR1.take_while([](const int &N) { return N % 2 == 1; })); 146 147 EXPECT_EQ(ArrayRef<int>(), 148 AR1.take_while([](const int &N) { return N < 0; })); 149 EXPECT_EQ(AR1, AR1.take_while([](const int &N) { return N > 0; })); 150 } 151 152 TEST(ArrayRefTest, TakeUntil) { 153 static const int TheNumbers[] = {1, 3, 5, 8, 10, 11}; 154 ArrayRef<int> AR1(TheNumbers); 155 ArrayRef<int> Expected = AR1.take_front(3); 156 EXPECT_EQ(Expected, AR1.take_until([](const int &N) { return N % 2 == 0; })); 157 158 EXPECT_EQ(AR1, AR1.take_until([](const int &N) { return N < 0; })); 159 EXPECT_EQ(ArrayRef<int>(), 160 AR1.take_until([](const int &N) { return N > 0; })); 161 } 162 163 TEST(ArrayRefTest, Equals) { 164 static const int A1[] = {1, 2, 3, 4, 5, 6, 7, 8}; 165 ArrayRef<int> AR1(A1); 166 EXPECT_TRUE(AR1.equals({1, 2, 3, 4, 5, 6, 7, 8})); 167 EXPECT_FALSE(AR1.equals({8, 1, 2, 4, 5, 6, 6, 7})); 168 EXPECT_FALSE(AR1.equals({2, 4, 5, 6, 6, 7, 8, 1})); 169 EXPECT_FALSE(AR1.equals({0, 1, 2, 4, 5, 6, 6, 7})); 170 EXPECT_FALSE(AR1.equals({1, 2, 42, 4, 5, 6, 7, 8})); 171 EXPECT_FALSE(AR1.equals({42, 2, 3, 4, 5, 6, 7, 8})); 172 EXPECT_FALSE(AR1.equals({1, 2, 3, 4, 5, 6, 7, 42})); 173 EXPECT_FALSE(AR1.equals({1, 2, 3, 4, 5, 6, 7})); 174 EXPECT_FALSE(AR1.equals({1, 2, 3, 4, 5, 6, 7, 8, 9})); 175 176 ArrayRef<int> AR1a = AR1.drop_back(); 177 EXPECT_TRUE(AR1a.equals({1, 2, 3, 4, 5, 6, 7})); 178 EXPECT_FALSE(AR1a.equals({1, 2, 3, 4, 5, 6, 7, 8})); 179 180 ArrayRef<int> AR1b = AR1a.slice(2, 4); 181 EXPECT_TRUE(AR1b.equals({3, 4, 5, 6})); 182 EXPECT_FALSE(AR1b.equals({2, 3, 4, 5, 6})); 183 EXPECT_FALSE(AR1b.equals({3, 4, 5, 6, 7})); 184 } 185 186 TEST(ArrayRefTest, EmptyEquals) { 187 EXPECT_TRUE(ArrayRef<unsigned>() == ArrayRef<unsigned>()); 188 } 189 190 TEST(ArrayRefTest, Slice) { 191 // Check that slice accepts size_t-sized numbers. 192 ArrayRef<char> AR((const char *)0x10000, SIZE_MAX - 0x10000); 193 EXPECT_EQ(1U, AR.slice(AR.size() - 1).size()); 194 EXPECT_EQ(AR.size() - 1, AR.slice(1, AR.size() - 1).size()); 195 } 196 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 207 static std::vector<int> ReturnTest12() { return {1, 2}; } 208 static void ArgTest12(ArrayRef<int> A) { 209 EXPECT_EQ(2U, A.size()); 210 EXPECT_EQ(1, A[0]); 211 EXPECT_EQ(2, A[1]); 212 } 213 214 TEST(ArrayRefTest, InitializerList) { 215 std::initializer_list<int> init_list = { 0, 1, 2, 3, 4 }; 216 ArrayRef<int> A = init_list; 217 for (int i = 0; i < 5; ++i) 218 EXPECT_EQ(i, A[i]); 219 220 std::vector<int> B = ReturnTest12(); 221 A = B; 222 EXPECT_EQ(1, A[0]); 223 EXPECT_EQ(2, A[1]); 224 225 ArgTest12({1, 2}); 226 } 227 228 TEST(ArrayRefTest, EmptyInitializerList) { 229 ArrayRef<int> A = {}; 230 EXPECT_TRUE(A.empty()); 231 232 A = {}; 233 EXPECT_TRUE(A.empty()); 234 } 235 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 252 } // end anonymous namespace 253