Duncan P. N. Exon Smith | 030d7d6 | 2017-03-20 17:58:26 +0000 | [diff] [blame] | 1 | //===- MemoryBufferCacheTest.cpp - MemoryBufferCache 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 "clang/Basic/MemoryBufferCache.h" |
| 11 | #include "llvm/Support/MemoryBuffer.h" |
| 12 | #include "gtest/gtest.h" |
| 13 | |
| 14 | using namespace llvm; |
| 15 | using namespace clang; |
| 16 | |
| 17 | namespace { |
| 18 | |
| 19 | std::unique_ptr<MemoryBuffer> getBuffer(int I) { |
| 20 | SmallVector<char, 8> Bytes; |
| 21 | raw_svector_ostream(Bytes) << "data:" << I; |
| 22 | return MemoryBuffer::getMemBuffer(StringRef(Bytes.data(), Bytes.size()), "", |
| 23 | /* RequiresNullTerminator = */ false); |
| 24 | } |
| 25 | |
| 26 | TEST(MemoryBufferCacheTest, addBuffer) { |
| 27 | auto B1 = getBuffer(1); |
| 28 | auto B2 = getBuffer(2); |
| 29 | auto B3 = getBuffer(3); |
| 30 | auto *RawB1 = B1.get(); |
| 31 | auto *RawB2 = B2.get(); |
| 32 | auto *RawB3 = B3.get(); |
| 33 | |
| 34 | // Add a few buffers. |
| 35 | MemoryBufferCache Cache; |
| 36 | EXPECT_EQ(RawB1, &Cache.addBuffer("1", std::move(B1))); |
| 37 | EXPECT_EQ(RawB2, &Cache.addBuffer("2", std::move(B2))); |
| 38 | EXPECT_EQ(RawB3, &Cache.addBuffer("3", std::move(B3))); |
| 39 | EXPECT_EQ(RawB1, Cache.lookupBuffer("1")); |
| 40 | EXPECT_EQ(RawB2, Cache.lookupBuffer("2")); |
| 41 | EXPECT_EQ(RawB3, Cache.lookupBuffer("3")); |
| 42 | EXPECT_FALSE(Cache.isBufferFinal("1")); |
| 43 | EXPECT_FALSE(Cache.isBufferFinal("2")); |
| 44 | EXPECT_FALSE(Cache.isBufferFinal("3")); |
| 45 | |
| 46 | // Remove the middle buffer. |
| 47 | EXPECT_FALSE(Cache.tryToRemoveBuffer("2")); |
| 48 | EXPECT_EQ(nullptr, Cache.lookupBuffer("2")); |
| 49 | EXPECT_FALSE(Cache.isBufferFinal("2")); |
| 50 | |
| 51 | // Replace the middle buffer. |
| 52 | B2 = getBuffer(2); |
Duncan P. N. Exon Smith | 030d7d6 | 2017-03-20 17:58:26 +0000 | [diff] [blame] | 53 | RawB2 = B2.get(); |
| 54 | EXPECT_EQ(RawB2, &Cache.addBuffer("2", std::move(B2))); |
| 55 | |
| 56 | // Check that nothing is final. |
| 57 | EXPECT_FALSE(Cache.isBufferFinal("1")); |
| 58 | EXPECT_FALSE(Cache.isBufferFinal("2")); |
| 59 | EXPECT_FALSE(Cache.isBufferFinal("3")); |
| 60 | } |
| 61 | |
| 62 | TEST(MemoryBufferCacheTest, finalizeCurrentBuffers) { |
| 63 | // Add a buffer. |
| 64 | MemoryBufferCache Cache; |
| 65 | auto B1 = getBuffer(1); |
| 66 | auto *RawB1 = B1.get(); |
| 67 | Cache.addBuffer("1", std::move(B1)); |
| 68 | ASSERT_FALSE(Cache.isBufferFinal("1")); |
| 69 | |
| 70 | // Finalize it. |
| 71 | Cache.finalizeCurrentBuffers(); |
| 72 | EXPECT_TRUE(Cache.isBufferFinal("1")); |
| 73 | EXPECT_TRUE(Cache.tryToRemoveBuffer("1")); |
| 74 | EXPECT_EQ(RawB1, Cache.lookupBuffer("1")); |
| 75 | EXPECT_TRUE(Cache.isBufferFinal("1")); |
| 76 | |
| 77 | // Repeat. |
| 78 | auto B2 = getBuffer(2); |
| 79 | auto *RawB2 = B2.get(); |
| 80 | Cache.addBuffer("2", std::move(B2)); |
| 81 | EXPECT_FALSE(Cache.isBufferFinal("2")); |
| 82 | |
| 83 | Cache.finalizeCurrentBuffers(); |
| 84 | EXPECT_TRUE(Cache.isBufferFinal("1")); |
| 85 | EXPECT_TRUE(Cache.isBufferFinal("2")); |
| 86 | EXPECT_TRUE(Cache.tryToRemoveBuffer("1")); |
| 87 | EXPECT_TRUE(Cache.tryToRemoveBuffer("2")); |
| 88 | EXPECT_EQ(RawB1, Cache.lookupBuffer("1")); |
| 89 | EXPECT_EQ(RawB2, Cache.lookupBuffer("2")); |
| 90 | EXPECT_TRUE(Cache.isBufferFinal("1")); |
| 91 | EXPECT_TRUE(Cache.isBufferFinal("2")); |
| 92 | } |
| 93 | |
| 94 | } // namespace |