c504ae3cef
This was reverted due to a "missing" file, but in reality what happened was that I renamed a file, and then due to a merge conflict both the old file and the new file got added to the repository. This led to an unused cpp file being in the repo and not referenced by any CMakeLists.txt but #including a .h file that wasn't in the repo. In an even more unfortunate coincidence, CMake didn't report the unused cpp file because it was in a subdirectory of the folder with the CMakeLists.txt, and not in the same directory as any CMakeLists.txt. The presence of the unused file was then breaking certain tools that determine file lists by globbing rather than by what's specified in CMakeLists.txt In any case, the fix is to just remove the unused file from the patch set. llvm-svn: 302042
129 lines
4.1 KiB
C++
129 lines
4.1 KiB
C++
//===- PDBStringTable.cpp - PDB String Table ---------------------*- C++-*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/DebugInfo/PDB/Native/PDBStringTable.h"
|
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
#include "llvm/DebugInfo/MSF/MappedBlockStream.h"
|
|
#include "llvm/DebugInfo/PDB/Native/Hash.h"
|
|
#include "llvm/DebugInfo/PDB/Native/RawError.h"
|
|
#include "llvm/DebugInfo/PDB/Native/RawTypes.h"
|
|
#include "llvm/Support/BinaryStreamReader.h"
|
|
#include "llvm/Support/Endian.h"
|
|
|
|
using namespace llvm;
|
|
using namespace llvm::support;
|
|
using namespace llvm::pdb;
|
|
|
|
uint32_t PDBStringTable::getByteSize() const { return ByteSize; }
|
|
uint32_t PDBStringTable::getNameCount() const { return NameCount; }
|
|
uint32_t PDBStringTable::getHashVersion() const { return Header->HashVersion; }
|
|
uint32_t PDBStringTable::getSignature() const { return Header->Signature; }
|
|
|
|
Error PDBStringTable::readHeader(BinaryStreamReader &Reader) {
|
|
if (auto EC = Reader.readObject(Header))
|
|
return EC;
|
|
|
|
if (Header->Signature != PDBStringTableSignature)
|
|
return make_error<RawError>(raw_error_code::corrupt_file,
|
|
"Invalid hash table signature");
|
|
if (Header->HashVersion != 1 && Header->HashVersion != 2)
|
|
return make_error<RawError>(raw_error_code::corrupt_file,
|
|
"Unsupported hash version");
|
|
|
|
assert(Reader.bytesRemaining() == 0);
|
|
return Error::success();
|
|
}
|
|
|
|
Error PDBStringTable::readStrings(BinaryStreamReader &Reader) {
|
|
if (auto EC = Strings.initialize(Reader)) {
|
|
return joinErrors(std::move(EC),
|
|
make_error<RawError>(raw_error_code::corrupt_file,
|
|
"Invalid hash table byte length"));
|
|
}
|
|
|
|
assert(Reader.bytesRemaining() == 0);
|
|
return Error::success();
|
|
}
|
|
|
|
Error PDBStringTable::readHashTable(BinaryStreamReader &Reader) {
|
|
const support::ulittle32_t *HashCount;
|
|
if (auto EC = Reader.readObject(HashCount))
|
|
return EC;
|
|
|
|
if (auto EC = Reader.readArray(IDs, *HashCount)) {
|
|
return joinErrors(std::move(EC),
|
|
make_error<RawError>(raw_error_code::corrupt_file,
|
|
"Could not read bucket array"));
|
|
}
|
|
|
|
return Error::success();
|
|
}
|
|
|
|
Error PDBStringTable::readEpilogue(BinaryStreamReader &Reader) {
|
|
if (auto EC = Reader.readInteger(NameCount))
|
|
return EC;
|
|
|
|
assert(Reader.bytesRemaining() == 0);
|
|
return Error::success();
|
|
}
|
|
|
|
Error PDBStringTable::reload(BinaryStreamReader &Reader) {
|
|
|
|
BinaryStreamReader SectionReader;
|
|
|
|
std::tie(SectionReader, Reader) = Reader.split(sizeof(PDBStringTableHeader));
|
|
if (auto EC = readHeader(SectionReader))
|
|
return EC;
|
|
|
|
std::tie(SectionReader, Reader) = Reader.split(Header->ByteSize);
|
|
if (auto EC = readStrings(SectionReader))
|
|
return EC;
|
|
|
|
// We don't know how long the hash table is until we parse it, so let the
|
|
// function responsible for doing that figure it out.
|
|
if (auto EC = readHashTable(Reader))
|
|
return EC;
|
|
|
|
std::tie(SectionReader, Reader) = Reader.split(sizeof(uint32_t));
|
|
if (auto EC = readEpilogue(SectionReader))
|
|
return EC;
|
|
|
|
assert(Reader.bytesRemaining() == 0);
|
|
return Error::success();
|
|
}
|
|
|
|
StringRef PDBStringTable::getStringForID(uint32_t ID) const {
|
|
return Strings.getString(ID);
|
|
}
|
|
|
|
uint32_t PDBStringTable::getIDForString(StringRef Str) const {
|
|
uint32_t Hash =
|
|
(Header->HashVersion == 1) ? hashStringV1(Str) : hashStringV2(Str);
|
|
size_t Count = IDs.size();
|
|
uint32_t Start = Hash % Count;
|
|
for (size_t I = 0; I < Count; ++I) {
|
|
// The hash is just a starting point for the search, but if it
|
|
// doesn't work we should find the string no matter what, because
|
|
// we iterate the entire array.
|
|
uint32_t Index = (Start + I) % Count;
|
|
|
|
uint32_t ID = IDs[Index];
|
|
StringRef S = getStringForID(ID);
|
|
if (S == Str)
|
|
return ID;
|
|
}
|
|
// IDs[0] contains the ID of the "invalid" entry.
|
|
return IDs[0];
|
|
}
|
|
|
|
FixedStreamArray<support::ulittle32_t> PDBStringTable::name_ids() const {
|
|
return IDs;
|
|
}
|