mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-05 18:28:29 +00:00
9d44e70272
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@101783 91177308-0d34-0410-b5e6-96231b3b80d8
256 lines
7.5 KiB
C++
256 lines
7.5 KiB
C++
//===-- Archive.cpp - Generic LLVM archive functions ------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file contains the implementation of the Archive and ArchiveMember
|
|
// classes that is common to both reading and writing archives..
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "ArchiveInternals.h"
|
|
#include "llvm/Bitcode/ReaderWriter.h"
|
|
#include "llvm/Module.h"
|
|
#include "llvm/Support/MemoryBuffer.h"
|
|
#include "llvm/System/Process.h"
|
|
#include <memory>
|
|
#include <cstring>
|
|
using namespace llvm;
|
|
|
|
// getMemberSize - compute the actual physical size of the file member as seen
|
|
// on disk. This isn't the size of member's payload. Use getSize() for that.
|
|
unsigned
|
|
ArchiveMember::getMemberSize() const {
|
|
// Basically its the file size plus the header size
|
|
unsigned result = info.fileSize + sizeof(ArchiveMemberHeader);
|
|
|
|
// If it has a long filename, include the name length
|
|
if (hasLongFilename())
|
|
result += path.str().length() + 1;
|
|
|
|
// If its now odd lengthed, include the padding byte
|
|
if (result % 2 != 0 )
|
|
result++;
|
|
|
|
return result;
|
|
}
|
|
|
|
// This default constructor is only use by the ilist when it creates its
|
|
// sentry node. We give it specific static values to make it stand out a bit.
|
|
ArchiveMember::ArchiveMember()
|
|
: parent(0), path("--invalid--"), flags(0), data(0)
|
|
{
|
|
info.user = sys::Process::GetCurrentUserId();
|
|
info.group = sys::Process::GetCurrentGroupId();
|
|
info.mode = 0777;
|
|
info.fileSize = 0;
|
|
info.modTime = sys::TimeValue::now();
|
|
}
|
|
|
|
// This is the constructor that the Archive class uses when it is building or
|
|
// reading an archive. It just defaults a few things and ensures the parent is
|
|
// set for the iplist. The Archive class fills in the ArchiveMember's data.
|
|
// This is required because correctly setting the data may depend on other
|
|
// things in the Archive.
|
|
ArchiveMember::ArchiveMember(Archive* PAR)
|
|
: parent(PAR), path(), flags(0), data(0)
|
|
{
|
|
}
|
|
|
|
// This method allows an ArchiveMember to be replaced with the data for a
|
|
// different file, presumably as an update to the member. It also makes sure
|
|
// the flags are reset correctly.
|
|
bool ArchiveMember::replaceWith(const sys::Path& newFile, std::string* ErrMsg) {
|
|
if (!newFile.exists()) {
|
|
if (ErrMsg)
|
|
*ErrMsg = "Can not replace an archive member with a non-existent file";
|
|
return true;
|
|
}
|
|
|
|
data = 0;
|
|
path = newFile;
|
|
|
|
// SVR4 symbol tables have an empty name
|
|
if (path.str() == ARFILE_SVR4_SYMTAB_NAME)
|
|
flags |= SVR4SymbolTableFlag;
|
|
else
|
|
flags &= ~SVR4SymbolTableFlag;
|
|
|
|
// BSD4.4 symbol tables have a special name
|
|
if (path.str() == ARFILE_BSD4_SYMTAB_NAME)
|
|
flags |= BSD4SymbolTableFlag;
|
|
else
|
|
flags &= ~BSD4SymbolTableFlag;
|
|
|
|
// LLVM symbol tables have a very specific name
|
|
if (path.str() == ARFILE_LLVM_SYMTAB_NAME)
|
|
flags |= LLVMSymbolTableFlag;
|
|
else
|
|
flags &= ~LLVMSymbolTableFlag;
|
|
|
|
// String table name
|
|
if (path.str() == ARFILE_STRTAB_NAME)
|
|
flags |= StringTableFlag;
|
|
else
|
|
flags &= ~StringTableFlag;
|
|
|
|
// If it has a slash then it has a path
|
|
bool hasSlash = path.str().find('/') != std::string::npos;
|
|
if (hasSlash)
|
|
flags |= HasPathFlag;
|
|
else
|
|
flags &= ~HasPathFlag;
|
|
|
|
// If it has a slash or its over 15 chars then its a long filename format
|
|
if (hasSlash || path.str().length() > 15)
|
|
flags |= HasLongFilenameFlag;
|
|
else
|
|
flags &= ~HasLongFilenameFlag;
|
|
|
|
// Get the signature and status info
|
|
const char* signature = (const char*) data;
|
|
std::string magic;
|
|
if (!signature) {
|
|
path.getMagicNumber(magic,4);
|
|
signature = magic.c_str();
|
|
std::string err;
|
|
const sys::FileStatus *FSinfo = path.getFileStatus(false, ErrMsg);
|
|
if (FSinfo)
|
|
info = *FSinfo;
|
|
else
|
|
return true;
|
|
}
|
|
|
|
// Determine what kind of file it is.
|
|
switch (sys::IdentifyFileType(signature,4)) {
|
|
case sys::Bitcode_FileType:
|
|
flags |= BitcodeFlag;
|
|
break;
|
|
default:
|
|
flags &= ~BitcodeFlag;
|
|
break;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
// Archive constructor - this is the only constructor that gets used for the
|
|
// Archive class. Everything else (default,copy) is deprecated. This just
|
|
// initializes and maps the file into memory, if requested.
|
|
Archive::Archive(const sys::Path& filename, LLVMContext& C)
|
|
: archPath(filename), members(), mapfile(0), base(0), symTab(), strtab(),
|
|
symTabSize(0), firstFileOffset(0), modules(), foreignST(0), Context(C) {
|
|
}
|
|
|
|
bool
|
|
Archive::mapToMemory(std::string* ErrMsg) {
|
|
mapfile = MemoryBuffer::getFile(archPath.c_str(), ErrMsg);
|
|
if (mapfile == 0)
|
|
return true;
|
|
base = mapfile->getBufferStart();
|
|
return false;
|
|
}
|
|
|
|
void Archive::cleanUpMemory() {
|
|
// Shutdown the file mapping
|
|
delete mapfile;
|
|
mapfile = 0;
|
|
base = 0;
|
|
|
|
// Forget the entire symbol table
|
|
symTab.clear();
|
|
symTabSize = 0;
|
|
|
|
firstFileOffset = 0;
|
|
|
|
// Free the foreign symbol table member
|
|
if (foreignST) {
|
|
delete foreignST;
|
|
foreignST = 0;
|
|
}
|
|
|
|
// Delete any Modules and ArchiveMember's we've allocated as a result of
|
|
// symbol table searches.
|
|
for (ModuleMap::iterator I=modules.begin(), E=modules.end(); I != E; ++I ) {
|
|
delete I->second.first;
|
|
delete I->second.second;
|
|
}
|
|
}
|
|
|
|
// Archive destructor - just clean up memory
|
|
Archive::~Archive() {
|
|
cleanUpMemory();
|
|
}
|
|
|
|
|
|
|
|
static void getSymbols(Module*M, std::vector<std::string>& symbols) {
|
|
// Loop over global variables
|
|
for (Module::global_iterator GI = M->global_begin(), GE=M->global_end(); GI != GE; ++GI)
|
|
if (!GI->isDeclaration() && !GI->hasLocalLinkage())
|
|
if (!GI->getName().empty())
|
|
symbols.push_back(GI->getName());
|
|
|
|
// Loop over functions
|
|
for (Module::iterator FI = M->begin(), FE = M->end(); FI != FE; ++FI)
|
|
if (!FI->isDeclaration() && !FI->hasLocalLinkage())
|
|
if (!FI->getName().empty())
|
|
symbols.push_back(FI->getName());
|
|
|
|
// Loop over aliases
|
|
for (Module::alias_iterator AI = M->alias_begin(), AE = M->alias_end();
|
|
AI != AE; ++AI) {
|
|
if (AI->hasName())
|
|
symbols.push_back(AI->getName());
|
|
}
|
|
}
|
|
|
|
// Get just the externally visible defined symbols from the bitcode
|
|
bool llvm::GetBitcodeSymbols(const sys::Path& fName,
|
|
LLVMContext& Context,
|
|
std::vector<std::string>& symbols,
|
|
std::string* ErrMsg) {
|
|
std::auto_ptr<MemoryBuffer> Buffer(
|
|
MemoryBuffer::getFileOrSTDIN(fName.c_str()));
|
|
if (!Buffer.get()) {
|
|
if (ErrMsg) *ErrMsg = "Could not open file '" + fName.str() + "'";
|
|
return true;
|
|
}
|
|
|
|
Module *M = ParseBitcodeFile(Buffer.get(), Context, ErrMsg);
|
|
if (!M)
|
|
return true;
|
|
|
|
// Get the symbols
|
|
getSymbols(M, symbols);
|
|
|
|
// Done with the module.
|
|
delete M;
|
|
return true;
|
|
}
|
|
|
|
Module*
|
|
llvm::GetBitcodeSymbols(const char *BufPtr, unsigned Length,
|
|
const std::string& ModuleID,
|
|
LLVMContext& Context,
|
|
std::vector<std::string>& symbols,
|
|
std::string* ErrMsg) {
|
|
// Get the module.
|
|
std::auto_ptr<MemoryBuffer> Buffer(
|
|
MemoryBuffer::getMemBufferCopy(StringRef(BufPtr, Length),ModuleID.c_str()));
|
|
|
|
Module *M = ParseBitcodeFile(Buffer.get(), Context, ErrMsg);
|
|
if (!M)
|
|
return 0;
|
|
|
|
// Get the symbols
|
|
getSymbols(M, symbols);
|
|
|
|
// Done with the module. Note that it's the caller's responsibility to delete
|
|
// the Module.
|
|
return M;
|
|
}
|