mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 11:42:57 +01:00
ae65e281f3
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
139 lines
4.9 KiB
C++
139 lines
4.9 KiB
C++
//===- MSFBuilderTest.cpp Tests manipulation of MSF stream metadata ------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/DebugInfo/MSF/MSFCommon.h"
|
|
#include "llvm/Testing/Support/Error.h"
|
|
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace llvm;
|
|
using namespace llvm::msf;
|
|
|
|
TEST(MSFCommonTest, BytesToBlocks) {
|
|
EXPECT_EQ(0ULL, bytesToBlocks(0, 4096));
|
|
EXPECT_EQ(1ULL, bytesToBlocks(12, 4096));
|
|
EXPECT_EQ(1ULL, bytesToBlocks(4096, 4096));
|
|
EXPECT_EQ(2ULL, bytesToBlocks(4097, 4096));
|
|
EXPECT_EQ(2ULL, bytesToBlocks(600, 512));
|
|
}
|
|
|
|
TEST(MSFCommonTest, FpmIntervals) {
|
|
SuperBlock SB;
|
|
SB.FreeBlockMapBlock = 1;
|
|
SB.BlockSize = 4096;
|
|
|
|
MSFLayout L;
|
|
L.SB = &SB;
|
|
|
|
SB.NumBlocks = 12;
|
|
EXPECT_EQ(1u, getNumFpmIntervals(L, false));
|
|
SB.NumBlocks = SB.BlockSize;
|
|
EXPECT_EQ(1u, getNumFpmIntervals(L, false));
|
|
SB.NumBlocks = SB.BlockSize + 1;
|
|
EXPECT_EQ(1u, getNumFpmIntervals(L, false));
|
|
SB.NumBlocks = SB.BlockSize * 8;
|
|
EXPECT_EQ(1u, getNumFpmIntervals(L, false));
|
|
SB.NumBlocks = SB.BlockSize * 8 + 1;
|
|
EXPECT_EQ(2u, getNumFpmIntervals(L, false));
|
|
|
|
SB.NumBlocks = 12;
|
|
EXPECT_EQ(1u, getNumFpmIntervals(L, true));
|
|
SB.NumBlocks = SB.BlockSize;
|
|
EXPECT_EQ(1u, getNumFpmIntervals(L, true));
|
|
SB.NumBlocks = SB.BlockSize * 8;
|
|
EXPECT_EQ(8u, getNumFpmIntervals(L, true));
|
|
|
|
// The FPM is going to look like this:
|
|
// | 0 | 1 | 2 | ... | 4096 | 4097 | 4098 | ... |
|
|
// | SB | FPM0 | FPM1 | Data | Data | FPM0 | FPM1 | ... |
|
|
//
|
|
// So when there are up to 4097 blocks (last index 4096), the final blocks
|
|
// are data blocks. When there are 4098 blocks (last index 4097), there is
|
|
// one terminating FPM block, and when there are 4099 blocks, there are two
|
|
// terminating FPM blocks. Make sure all these cases are handled.
|
|
|
|
// With 4096 or 4097 blocks, the last block is a data block so we only have
|
|
// 1 interval.
|
|
for (uint32_t I : {4096, 4097}) {
|
|
// 1 FPM0 interval
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, I, true, 1));
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, I, false, 1));
|
|
|
|
// 1 FPM1 interval
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, I, true, 2));
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, I, false, 2));
|
|
}
|
|
|
|
// With 4098 blocks, the last block belongs to FPM0 so we should have 2 FPM0
|
|
// intervals.
|
|
EXPECT_EQ(2U, getNumFpmIntervals(4096, 4098, true, 1));
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, 4098, false, 1));
|
|
|
|
// And 1 FPM1 interval.
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, 4098, true, 2));
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, 4098, false, 2));
|
|
|
|
// With 4099 blocks, the last block belongs to FPM1 so we should have 2
|
|
// FPM0 intervals.
|
|
EXPECT_EQ(2U, getNumFpmIntervals(4096, 4099, true, 1));
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, 4099, false, 1));
|
|
|
|
// And 2 FPM1 intervals.
|
|
EXPECT_EQ(2U, getNumFpmIntervals(4096, 4099, true, 2));
|
|
EXPECT_EQ(1U, getNumFpmIntervals(4096, 4099, false, 2));
|
|
}
|
|
|
|
TEST(MSFCommonTest, FpmStreamLayout) {
|
|
SuperBlock SB;
|
|
MSFLayout L;
|
|
L.SB = &SB;
|
|
SB.FreeBlockMapBlock = 1;
|
|
|
|
// Each FPM block has 4096 bytes for a maximum of 4096*8 allocation states.
|
|
SB.BlockSize = 4096;
|
|
|
|
// 1. When we're not including unused FPM data, the length of the FPM stream
|
|
// should be only long enough to contain 1 bit for each block.
|
|
|
|
// 1a. When the PDB has <= 4096*8 blocks, there should only be one FPM block.
|
|
SB.NumBlocks = 8000;
|
|
MSFStreamLayout SL = getFpmStreamLayout(L, false, false);
|
|
EXPECT_EQ(1000u, SL.Length);
|
|
EXPECT_EQ(1u, SL.Blocks.size());
|
|
EXPECT_EQ(SB.FreeBlockMapBlock, SL.Blocks.front());
|
|
|
|
SL = getFpmStreamLayout(L, false, true);
|
|
EXPECT_EQ(1000u, SL.Length);
|
|
EXPECT_EQ(1u, SL.Blocks.size());
|
|
EXPECT_EQ(3u - SB.FreeBlockMapBlock, SL.Blocks.front());
|
|
|
|
// 1b. When the PDB has > 4096*8 blocks, there should be multiple FPM blocks.
|
|
SB.NumBlocks = SB.BlockSize * 8 + 1;
|
|
SL = getFpmStreamLayout(L, false, false);
|
|
EXPECT_EQ(SB.BlockSize + 1, SL.Length);
|
|
EXPECT_EQ(2u, SL.Blocks.size());
|
|
EXPECT_EQ(SB.FreeBlockMapBlock, SL.Blocks[0]);
|
|
EXPECT_EQ(SB.FreeBlockMapBlock + SB.BlockSize, SL.Blocks[1]);
|
|
|
|
SL = getFpmStreamLayout(L, false, true);
|
|
EXPECT_EQ(SB.BlockSize + 1, SL.Length);
|
|
EXPECT_EQ(2u, SL.Blocks.size());
|
|
EXPECT_EQ(3u - SB.FreeBlockMapBlock, SL.Blocks[0]);
|
|
EXPECT_EQ(3u - SB.FreeBlockMapBlock + SB.BlockSize, SL.Blocks[1]);
|
|
|
|
// 2. When we are including unused FPM data, there should be one FPM block
|
|
// at every BlockSize interval in the file, even if entire FPM blocks are
|
|
// unused.
|
|
SB.NumBlocks = SB.BlockSize * 8 + 3;
|
|
SL = getFpmStreamLayout(L, true, false);
|
|
EXPECT_EQ(SB.BlockSize * 9, SL.Length);
|
|
EXPECT_EQ(9u, SL.Blocks.size());
|
|
for (int I = 0; I < 9; ++I)
|
|
EXPECT_EQ(I * SB.BlockSize + SB.FreeBlockMapBlock, SL.Blocks[I]);
|
|
}
|