1 //===--- unittest/Support/ArrayRecyclerTest.cpp ---------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Support/ArrayRecycler.h"
11 #include "llvm/Support/Allocator.h"
12 #include "gtest/gtest.h"
23 typedef ArrayRecycler<Object> ARO;
25 TEST(ArrayRecyclerTest, Capacity) {
26 // Capacity size should never be 0.
27 ARO::Capacity Cap = ARO::Capacity::get(0);
28 EXPECT_LT(0u, Cap.getSize());
30 size_t PrevSize = Cap.getSize();
31 for (unsigned N = 1; N != 100; ++N) {
32 Cap = ARO::Capacity::get(N);
33 EXPECT_LE(N, Cap.getSize());
35 EXPECT_EQ(PrevSize, Cap.getSize());
37 EXPECT_LT(PrevSize, Cap.getSize());
38 PrevSize = Cap.getSize();
41 // Check that the buckets are monotonically increasing.
42 Cap = ARO::Capacity::get(0);
43 PrevSize = Cap.getSize();
44 for (unsigned N = 0; N != 20; ++N) {
46 EXPECT_LT(PrevSize, Cap.getSize());
47 PrevSize = Cap.getSize();
51 TEST(ArrayRecyclerTest, Basics) {
52 BumpPtrAllocator Allocator;
53 ArrayRecycler<Object> DUT;
55 ARO::Capacity Cap = ARO::Capacity::get(8);
56 Object *A1 = DUT.allocate(Cap, Allocator);
60 Object *A2 = DUT.allocate(Cap, Allocator);
64 Object *A3 = DUT.allocate(Cap, Allocator);
68 EXPECT_EQ(21, A1[0].Num);
69 EXPECT_EQ(17, A1[7].Num);
70 EXPECT_EQ(121, A2[0].Num);
71 EXPECT_EQ(117, A2[7].Num);
72 EXPECT_EQ(221, A3[0].Num);
73 EXPECT_EQ(217, A3[7].Num);
75 DUT.deallocate(Cap, A2);
77 // Check that deallocation didn't clobber anything.
78 EXPECT_EQ(21, A1[0].Num);
79 EXPECT_EQ(17, A1[7].Num);
80 EXPECT_EQ(221, A3[0].Num);
81 EXPECT_EQ(217, A3[7].Num);
84 Object *A2x = DUT.allocate(Cap, Allocator);
87 DUT.deallocate(Cap, A2x);
88 DUT.deallocate(Cap, A1);
89 DUT.deallocate(Cap, A3);
91 // Objects are not required to be recycled in reverse deallocation order, but
92 // that is what the current implementation does.
93 Object *A3x = DUT.allocate(Cap, Allocator);
95 Object *A1x = DUT.allocate(Cap, Allocator);
97 Object *A2y = DUT.allocate(Cap, Allocator);
100 // Back to allocation from the BumpPtrAllocator.
101 Object *A4 = DUT.allocate(Cap, Allocator);
106 DUT.clear(Allocator);
109 } // end anonymous namespace