llvm/unittests/DebugInfo/PDB/MsfBuilderTest.cpp

//===- MsfBuilderTest.cpp  Tests manipulation of MSF stream metadata ------===//
//
//                     The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//

#include "ErrorChecking.h"

#include "llvm/DebugInfo/PDB/Raw/MsfBuilder.h"
#include "llvm/DebugInfo/PDB/Raw/MsfCommon.h"

#include "gtest/gtest.h"

using namespace llvm;
using namespace llvm::pdb;
using namespace llvm::pdb::msf;

namespace {
class MsfBuilderTest : public testing::Test {
protected:
  void initializeSimpleSuperBlock(msf::SuperBlock &SB) {
    initializeSuperBlock(SB);
    SB.NumBlocks = 1000;
    SB.NumDirectoryBytes = 8192;
  }

  void initializeSuperBlock(msf::SuperBlock &SB) {
    ::memset(&SB, 0, sizeof(SB));

    ::memcpy(SB.MagicBytes, msf::Magic, sizeof(msf::Magic));
    SB.BlockMapAddr = 1;
    SB.BlockSize = 4096;
    SB.NumDirectoryBytes = 0;
    SB.NumBlocks = 2; // one for the Super Block, one for the directory
  }

  BumpPtrAllocator Allocator;
};
}

TEST_F(MsfBuilderTest, ValidateSuperBlockAccept) {
  // Test that a known good super block passes validation.
  SuperBlock SB;
  initializeSuperBlock(SB);

  EXPECT_NO_ERROR(msf::validateSuperBlock(SB));
}

TEST_F(MsfBuilderTest, ValidateSuperBlockReject) {
  // Test that various known problems cause a super block to be rejected.
  SuperBlock SB;
  initializeSimpleSuperBlock(SB);

  // Mismatched magic
  SB.MagicBytes[0] = 8;
  EXPECT_ERROR(msf::validateSuperBlock(SB));
  initializeSimpleSuperBlock(SB);

  // Block 0 is reserved for super block, can't be occupied by the block map
  SB.BlockMapAddr = 0;
  EXPECT_ERROR(msf::validateSuperBlock(SB));
  initializeSimpleSuperBlock(SB);

  // Block sizes have to be powers of 2.
  SB.BlockSize = 3120;
  EXPECT_ERROR(msf::validateSuperBlock(SB));
  initializeSimpleSuperBlock(SB);

  // The directory itself has a maximum size.
  SB.NumDirectoryBytes = SB.BlockSize * SB.BlockSize / 4;
  EXPECT_NO_ERROR(msf::validateSuperBlock(SB));
  SB.NumDirectoryBytes = SB.NumDirectoryBytes + 4;
  EXPECT_ERROR(msf::validateSuperBlock(SB));
}

TEST_F(MsfBuilderTest, TestUsedBlocksMarkedAsUsed) {
  // Test that when assigning a stream to a known list of blocks, the blocks
  // are correctly marked as used after adding, but no other incorrect blocks
  // are accidentally marked as used.

  // Allocate some extra blocks at the end so we can verify that they're free
  // after the initialization.
  std::vector<uint32_t> Blocks = {2, 3, 4, 5, 6, 7, 8, 9, 10};
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096, Blocks.size() + 10);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  EXPECT_NO_ERROR(Msf.addStream(Blocks.size() * 4096, Blocks));

  for (auto B : Blocks) {
    EXPECT_FALSE(Msf.isBlockFree(B));
  }
  for (int I = 11; I < 21; ++I) {
    EXPECT_TRUE(Msf.isBlockFree(I));
  }
}

TEST_F(MsfBuilderTest, TestAddStreamNoDirectoryBlockIncrease) {
  // Test that adding a new stream correctly updates the directory.  This only
  // tests the case where the directory *DOES NOT* grow large enough that it
  // crosses a Block boundary.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  auto ExpectedL1 = Msf.build();
  EXPECT_EXPECTED(ExpectedL1);
  Layout &L1 = *ExpectedL1;

  auto OldDirBlocks = L1.DirectoryBlocks;
  EXPECT_EQ(1U, OldDirBlocks.size());

  auto ExpectedMsf2 = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf2);
  auto &Msf2 = *ExpectedMsf2;

  EXPECT_NO_ERROR(Msf2.addStream(4000));
  EXPECT_EQ(1U, Msf2.getNumStreams());
  EXPECT_EQ(4000U, Msf2.getStreamSize(0));
  auto Blocks = Msf2.getStreamBlocks(0);
  EXPECT_EQ(1U, Blocks.size());

  auto ExpectedL2 = Msf2.build();
  EXPECT_EXPECTED(ExpectedL2);
  Layout &L2 = *ExpectedL2;
  auto NewDirBlocks = L2.DirectoryBlocks;
  EXPECT_EQ(1U, NewDirBlocks.size());
}

TEST_F(MsfBuilderTest, TestAddStreamWithDirectoryBlockIncrease) {
  // Test that adding a new stream correctly updates the directory.  This only
  // tests the case where the directory *DOES* grow large enough that it
  // crosses a Block boundary.  This is because the newly added stream occupies
  // so many Blocks that need to be indexed in the directory that the directory
  // crosses a Block boundary.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  EXPECT_NO_ERROR(Msf.addStream(4096 * 4096 / sizeof(uint32_t)));

  auto ExpectedL1 = Msf.build();
  EXPECT_EXPECTED(ExpectedL1);
  Layout &L1 = *ExpectedL1;
  auto DirBlocks = L1.DirectoryBlocks;
  EXPECT_EQ(2U, DirBlocks.size());
}

TEST_F(MsfBuilderTest, TestGrowStreamNoBlockIncrease) {
  // Test growing an existing stream by a value that does not affect the number
  // of blocks it occupies.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  EXPECT_NO_ERROR(Msf.addStream(1024));
  EXPECT_EQ(1024U, Msf.getStreamSize(0));
  auto OldStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(1U, OldStreamBlocks.size());

  EXPECT_NO_ERROR(Msf.setStreamSize(0, 2048));
  EXPECT_EQ(2048U, Msf.getStreamSize(0));
  auto NewStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(1U, NewStreamBlocks.size());

  EXPECT_EQ(OldStreamBlocks, NewStreamBlocks);
}

TEST_F(MsfBuilderTest, TestGrowStreamWithBlockIncrease) {
  // Test that growing an existing stream to a value large enough that it causes
  // the need to allocate new Blocks to the stream correctly updates the
  // stream's
  // block list.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  EXPECT_NO_ERROR(Msf.addStream(2048));
  EXPECT_EQ(2048U, Msf.getStreamSize(0));
  std::vector<uint32_t> OldStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(1U, OldStreamBlocks.size());

  EXPECT_NO_ERROR(Msf.setStreamSize(0, 6144));
  EXPECT_EQ(6144U, Msf.getStreamSize(0));
  std::vector<uint32_t> NewStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(2U, NewStreamBlocks.size());

  EXPECT_EQ(OldStreamBlocks[0], NewStreamBlocks[0]);
  EXPECT_NE(NewStreamBlocks[0], NewStreamBlocks[1]);
}

TEST_F(MsfBuilderTest, TestShrinkStreamNoBlockDecrease) {
  // Test that shrinking an existing stream by a value that does not affect the
  // number of Blocks it occupies makes no changes to stream's block list.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  EXPECT_NO_ERROR(Msf.addStream(2048));
  EXPECT_EQ(2048U, Msf.getStreamSize(0));
  std::vector<uint32_t> OldStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(1U, OldStreamBlocks.size());

  EXPECT_NO_ERROR(Msf.setStreamSize(0, 1024));
  EXPECT_EQ(1024U, Msf.getStreamSize(0));
  std::vector<uint32_t> NewStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(1U, NewStreamBlocks.size());

  EXPECT_EQ(OldStreamBlocks, NewStreamBlocks);
}

TEST_F(MsfBuilderTest, TestShrinkStreamWithBlockDecrease) {
  // Test that shrinking an existing stream to a value large enough that it
  // causes the need to deallocate new Blocks to the stream correctly updates
  // the stream's block list.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  EXPECT_NO_ERROR(Msf.addStream(6144));
  EXPECT_EQ(6144U, Msf.getStreamSize(0));
  std::vector<uint32_t> OldStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(2U, OldStreamBlocks.size());

  EXPECT_NO_ERROR(Msf.setStreamSize(0, 2048));
  EXPECT_EQ(2048U, Msf.getStreamSize(0));
  std::vector<uint32_t> NewStreamBlocks = Msf.getStreamBlocks(0);
  EXPECT_EQ(1U, NewStreamBlocks.size());

  EXPECT_EQ(OldStreamBlocks[0], NewStreamBlocks[0]);
}

TEST_F(MsfBuilderTest, TestRejectReusedStreamBlock) {
  // Test that attempting to add a stream and assigning a block that is already
  // in use by another stream fails.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  EXPECT_NO_ERROR(Msf.addStream(6144));

  std::vector<uint32_t> Blocks = {2, 3};
  EXPECT_ERROR(Msf.addStream(6144, Blocks));
}

TEST_F(MsfBuilderTest, TestBlockCountsWhenAddingStreams) {
  // Test that when adding multiple streams, the number of used and free Blocks
  // allocated to the MSF file are as expected.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  // one for the super block, one for the directory block map
  uint32_t NumUsedBlocks = Msf.getNumUsedBlocks();
  EXPECT_EQ(2U, NumUsedBlocks);
  EXPECT_EQ(0U, Msf.getNumFreeBlocks());

  const uint32_t StreamSizes[] = {4000, 6193, 189723};
  for (int I = 0; I < 3; ++I) {
    EXPECT_NO_ERROR(Msf.addStream(StreamSizes[I]));
    NumUsedBlocks += bytesToBlocks(StreamSizes[I], 4096);
    EXPECT_EQ(NumUsedBlocks, Msf.getNumUsedBlocks());
    EXPECT_EQ(0U, Msf.getNumFreeBlocks());
  }
}

TEST_F(MsfBuilderTest, TestBuildMsfLayout) {
  // Test that we can generate an Msf Layout structure from a valid layout
  // specification.
  auto ExpectedMsf = MsfBuilder::create(Allocator, 4096);
  EXPECT_EXPECTED(ExpectedMsf);
  auto &Msf = *ExpectedMsf;

  const uint32_t StreamSizes[] = {4000, 6193, 189723};
  uint32_t ExpectedNumBlocks = 2;
  for (int I = 0; I < 3; ++I) {
    EXPECT_NO_ERROR(Msf.addStream(StreamSizes[I]));
    ExpectedNumBlocks += bytesToBlocks(StreamSizes[I], 4096);
  }
  ++ExpectedNumBlocks; // The directory itself should use 1 block

  auto ExpectedLayout = Msf.build();
  EXPECT_EXPECTED(ExpectedLayout);
  Layout &L = *ExpectedLayout;
  EXPECT_EQ(4096U, L.SB->BlockSize);
  EXPECT_EQ(ExpectedNumBlocks, L.SB->NumBlocks);

  EXPECT_EQ(1U, L.DirectoryBlocks.size());

  EXPECT_EQ(3U, L.StreamMap.size());
  EXPECT_EQ(3U, L.StreamSizes.size());
  for (int I = 0; I < 3; ++I) {
    EXPECT_EQ(StreamSizes[I], L.StreamSizes[I]);
    uint32_t ExpectedNumBlocks = bytesToBlocks(StreamSizes[I], 4096);
    EXPECT_EQ(ExpectedNumBlocks, L.StreamMap[I].size());
  }
}