2011-09-28 03:36:55 +08:00
|
|
|
//===- Archive.cpp - ar File Format implementation --------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the ArchiveObjectFile class.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Object/Archive.h"
|
|
|
|
#include "llvm/ADT/APInt.h"
|
2011-11-03 03:33:12 +08:00
|
|
|
#include "llvm/Support/Endian.h"
|
2011-09-28 03:36:55 +08:00
|
|
|
#include "llvm/Support/MemoryBuffer.h"
|
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
using namespace object;
|
|
|
|
|
2012-02-22 21:42:11 +08:00
|
|
|
static const char *Magic = "!<arch>\n";
|
2011-09-28 03:36:55 +08:00
|
|
|
|
2011-10-26 06:30:42 +08:00
|
|
|
static bool isInternalMember(const ArchiveMemberHeader &amh) {
|
2012-05-24 14:35:32 +08:00
|
|
|
static const char *const internals[] = {
|
2011-10-26 06:30:42 +08:00
|
|
|
"/",
|
|
|
|
"//",
|
|
|
|
"#_LLVM_SYM_TAB_#"
|
2012-05-24 14:35:32 +08:00
|
|
|
};
|
2011-10-26 06:30:42 +08:00
|
|
|
|
|
|
|
StringRef name = amh.getName();
|
|
|
|
for (std::size_t i = 0; i < sizeof(internals) / sizeof(*internals); ++i) {
|
|
|
|
if (name == internals[i])
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-12-20 10:50:00 +08:00
|
|
|
void Archive::anchor() { }
|
|
|
|
|
2011-09-28 03:36:55 +08:00
|
|
|
error_code Archive::Child::getName(StringRef &Result) const {
|
|
|
|
StringRef name = ToHeader(Data.data())->getName();
|
|
|
|
// Check if it's a special name.
|
|
|
|
if (name[0] == '/') {
|
|
|
|
if (name.size() == 1) { // Linker member.
|
|
|
|
Result = name;
|
|
|
|
return object_error::success;
|
|
|
|
}
|
|
|
|
if (name.size() == 2 && name[1] == '/') { // String table.
|
|
|
|
Result = name;
|
|
|
|
return object_error::success;
|
|
|
|
}
|
|
|
|
// It's a long name.
|
|
|
|
// Get the offset.
|
2013-01-10 08:07:38 +08:00
|
|
|
std::size_t offset;
|
2013-01-10 09:05:34 +08:00
|
|
|
if (name.substr(1).rtrim(" ").getAsInteger(10, offset))
|
|
|
|
llvm_unreachable("Long name offset is not an integer");
|
2011-09-28 03:36:55 +08:00
|
|
|
const char *addr = Parent->StringTable->Data.begin()
|
|
|
|
+ sizeof(ArchiveMemberHeader)
|
2013-01-10 06:58:43 +08:00
|
|
|
+ offset;
|
2011-09-28 03:36:55 +08:00
|
|
|
// Verify it.
|
|
|
|
if (Parent->StringTable == Parent->end_children()
|
|
|
|
|| addr < (Parent->StringTable->Data.begin()
|
|
|
|
+ sizeof(ArchiveMemberHeader))
|
|
|
|
|| addr > (Parent->StringTable->Data.begin()
|
|
|
|
+ sizeof(ArchiveMemberHeader)
|
|
|
|
+ Parent->StringTable->getSize()))
|
|
|
|
return object_error::parse_failed;
|
2012-11-14 02:38:42 +08:00
|
|
|
|
|
|
|
// GNU long file names end with a /.
|
|
|
|
if (Parent->kind() == K_GNU) {
|
|
|
|
StringRef::size_type End = StringRef(addr).find('/');
|
|
|
|
Result = StringRef(addr, End);
|
|
|
|
} else {
|
|
|
|
Result = addr;
|
|
|
|
}
|
2011-09-28 03:36:55 +08:00
|
|
|
return object_error::success;
|
2011-10-26 06:30:42 +08:00
|
|
|
} else if (name.startswith("#1/")) {
|
2013-01-10 06:58:43 +08:00
|
|
|
uint64_t name_size;
|
2013-01-10 09:05:34 +08:00
|
|
|
if (name.substr(3).rtrim(" ").getAsInteger(10, name_size))
|
|
|
|
llvm_unreachable("Long name length is not an ingeter");
|
|
|
|
Result = Data.substr(sizeof(ArchiveMemberHeader), name_size);
|
2011-10-26 06:30:42 +08:00
|
|
|
return object_error::success;
|
2011-09-28 03:36:55 +08:00
|
|
|
}
|
|
|
|
// It's a simple name.
|
|
|
|
if (name[name.size() - 1] == '/')
|
|
|
|
Result = name.substr(0, name.size() - 1);
|
|
|
|
else
|
|
|
|
Result = name;
|
|
|
|
return object_error::success;
|
|
|
|
}
|
|
|
|
|
|
|
|
error_code Archive::Child::getAsBinary(OwningPtr<Binary> &Result) const {
|
|
|
|
OwningPtr<Binary> ret;
|
2013-02-03 18:48:50 +08:00
|
|
|
OwningPtr<MemoryBuffer> Buff;
|
|
|
|
if (error_code ec = getMemoryBuffer(Buff))
|
|
|
|
return ec;
|
|
|
|
if (error_code ec = createBinary(Buff.take(), ret))
|
2011-09-28 03:36:55 +08:00
|
|
|
return ec;
|
|
|
|
Result.swap(ret);
|
|
|
|
return object_error::success;
|
|
|
|
}
|
|
|
|
|
|
|
|
Archive::Archive(MemoryBuffer *source, error_code &ec)
|
2012-03-10 04:41:57 +08:00
|
|
|
: Binary(Binary::ID_Archive, source) {
|
2011-09-28 03:36:55 +08:00
|
|
|
// Check for sufficient magic.
|
|
|
|
if (!source || source->getBufferSize()
|
|
|
|
< (8 + sizeof(ArchiveMemberHeader) + 2) // Smallest archive.
|
|
|
|
|| StringRef(source->getBufferStart(), 8) != Magic) {
|
|
|
|
ec = object_error::invalid_file_type;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-11-03 03:33:12 +08:00
|
|
|
// Get the special members.
|
|
|
|
child_iterator i = begin_children(false);
|
2011-09-28 03:36:55 +08:00
|
|
|
child_iterator e = end_children();
|
|
|
|
|
2012-11-14 02:38:42 +08:00
|
|
|
StringRef name;
|
|
|
|
if ((ec = i->getName(name)))
|
|
|
|
return;
|
2011-09-28 03:36:55 +08:00
|
|
|
|
2012-11-14 02:38:42 +08:00
|
|
|
// Below is the pattern that is used to figure out the archive format
|
|
|
|
// GNU archive format
|
|
|
|
// First member : / (points to the symbol table )
|
|
|
|
// Second member : // (may exist, if it exists, points to the string table)
|
|
|
|
// Note : The string table is used if the filename exceeds 15 characters
|
|
|
|
// BSD archive format
|
|
|
|
// First member : __.SYMDEF (points to the symbol table)
|
|
|
|
// There is no string table, if the filename exceeds 15 characters or has a
|
|
|
|
// embedded space, the filename has #1/<size>, The size represents the size
|
|
|
|
// of the filename that needs to be read after the archive header
|
|
|
|
// COFF archive format
|
|
|
|
// First member : /
|
|
|
|
// Second member : / (provides a directory of symbols)
|
|
|
|
// Third member : // contains the string table, this is present even if the
|
|
|
|
// string table is empty
|
|
|
|
if (name == "/") {
|
|
|
|
SymbolTable = i;
|
|
|
|
StringTable = e;
|
|
|
|
if (i != e) ++i;
|
2013-01-10 08:07:38 +08:00
|
|
|
if (i == e) {
|
|
|
|
ec = object_error::parse_failed;
|
|
|
|
return;
|
|
|
|
}
|
2012-11-14 02:38:42 +08:00
|
|
|
if ((ec = i->getName(name)))
|
|
|
|
return;
|
|
|
|
if (name[0] != '/') {
|
|
|
|
Format = K_GNU;
|
|
|
|
} else if ((name.size() > 1) && (name == "//")) {
|
|
|
|
Format = K_GNU;
|
|
|
|
StringTable = i;
|
|
|
|
++i;
|
|
|
|
} else {
|
|
|
|
Format = K_COFF;
|
|
|
|
if (i != e) {
|
|
|
|
SymbolTable = i;
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
if (i != e) {
|
|
|
|
StringTable = i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else if (name == "__.SYMDEF") {
|
|
|
|
Format = K_BSD;
|
|
|
|
SymbolTable = i;
|
|
|
|
StringTable = e;
|
|
|
|
}
|
2011-09-28 03:36:55 +08:00
|
|
|
ec = object_error::success;
|
|
|
|
}
|
|
|
|
|
2011-10-26 06:30:42 +08:00
|
|
|
Archive::child_iterator Archive::begin_children(bool skip_internal) const {
|
2012-02-22 21:42:11 +08:00
|
|
|
const char *Loc = Data->getBufferStart() + strlen(Magic);
|
2011-09-28 03:36:55 +08:00
|
|
|
size_t Size = sizeof(ArchiveMemberHeader) +
|
|
|
|
ToHeader(Loc)->getSize();
|
2011-10-26 06:30:42 +08:00
|
|
|
Child c(this, StringRef(Loc, Size));
|
|
|
|
// Skip internals at the beginning of an archive.
|
|
|
|
if (skip_internal && isInternalMember(*ToHeader(Loc)))
|
|
|
|
return c.getNext();
|
|
|
|
return c;
|
2011-09-28 03:36:55 +08:00
|
|
|
}
|
|
|
|
|
2011-10-08 08:17:45 +08:00
|
|
|
Archive::child_iterator Archive::end_children() const {
|
2011-09-28 03:36:55 +08:00
|
|
|
return Child(this, StringRef(0, 0));
|
|
|
|
}
|
2011-11-03 03:33:12 +08:00
|
|
|
|
|
|
|
error_code Archive::Symbol::getName(StringRef &Result) const {
|
2013-02-03 18:48:50 +08:00
|
|
|
Result = StringRef(Parent->SymbolTable->getBuffer().begin() + StringIndex);
|
2011-11-03 03:33:12 +08:00
|
|
|
return object_error::success;
|
|
|
|
}
|
|
|
|
|
|
|
|
error_code Archive::Symbol::getMember(child_iterator &Result) const {
|
2013-02-03 18:48:50 +08:00
|
|
|
const char *Buf = Parent->SymbolTable->getBuffer().begin();
|
2012-11-14 08:04:13 +08:00
|
|
|
const char *Offsets = Buf + 4;
|
|
|
|
uint32_t Offset = 0;
|
2012-11-14 02:38:42 +08:00
|
|
|
if (Parent->kind() == K_GNU) {
|
2012-11-14 08:04:13 +08:00
|
|
|
Offset = *(reinterpret_cast<const support::ubig32_t*>(Offsets)
|
|
|
|
+ SymbolIndex);
|
2012-11-14 02:38:42 +08:00
|
|
|
} else if (Parent->kind() == K_BSD) {
|
2012-11-15 01:58:11 +08:00
|
|
|
llvm_unreachable("BSD format is not supported");
|
2012-11-14 02:38:42 +08:00
|
|
|
} else {
|
2012-11-14 08:04:13 +08:00
|
|
|
uint32_t MemberCount = *reinterpret_cast<const support::ulittle32_t*>(Buf);
|
|
|
|
|
|
|
|
// Skip offsets.
|
|
|
|
Buf += sizeof(support::ulittle32_t)
|
|
|
|
+ (MemberCount * sizeof(support::ulittle32_t));
|
|
|
|
|
|
|
|
uint32_t SymbolCount = *reinterpret_cast<const support::ulittle32_t*>(Buf);
|
|
|
|
|
|
|
|
if (SymbolIndex >= SymbolCount)
|
|
|
|
return object_error::parse_failed;
|
|
|
|
|
2012-11-14 08:21:27 +08:00
|
|
|
// Skip SymbolCount to get to the indices table.
|
|
|
|
const char *Indices = Buf + sizeof(support::ulittle32_t);
|
2012-11-14 08:04:13 +08:00
|
|
|
|
|
|
|
// Get the index of the offset in the file member offset table for this
|
|
|
|
// symbol.
|
|
|
|
uint16_t OffsetIndex =
|
2012-11-14 08:21:27 +08:00
|
|
|
*(reinterpret_cast<const support::ulittle16_t*>(Indices)
|
2012-11-14 02:38:42 +08:00
|
|
|
+ SymbolIndex);
|
2012-11-14 08:04:13 +08:00
|
|
|
// Subtract 1 since OffsetIndex is 1 based.
|
|
|
|
--OffsetIndex;
|
|
|
|
|
|
|
|
if (OffsetIndex >= MemberCount)
|
|
|
|
return object_error::parse_failed;
|
|
|
|
|
|
|
|
Offset = *(reinterpret_cast<const support::ulittle32_t*>(Offsets)
|
|
|
|
+ OffsetIndex);
|
2012-11-14 02:38:42 +08:00
|
|
|
}
|
2011-11-03 03:33:12 +08:00
|
|
|
|
2012-11-14 08:04:13 +08:00
|
|
|
const char *Loc = Parent->getData().begin() + Offset;
|
2011-11-03 03:33:12 +08:00
|
|
|
size_t Size = sizeof(ArchiveMemberHeader) +
|
|
|
|
ToHeader(Loc)->getSize();
|
|
|
|
Result = Child(Parent, StringRef(Loc, Size));
|
|
|
|
|
|
|
|
return object_error::success;
|
|
|
|
}
|
|
|
|
|
|
|
|
Archive::Symbol Archive::Symbol::getNext() const {
|
|
|
|
Symbol t(*this);
|
2011-11-04 21:52:17 +08:00
|
|
|
// Go to one past next null.
|
|
|
|
t.StringIndex =
|
2013-02-03 18:48:50 +08:00
|
|
|
Parent->SymbolTable->getBuffer().find('\0', t.StringIndex) + 1;
|
2011-11-03 03:33:12 +08:00
|
|
|
++t.SymbolIndex;
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
|
|
|
|
Archive::symbol_iterator Archive::begin_symbols() const {
|
2013-02-03 18:48:50 +08:00
|
|
|
const char *buf = SymbolTable->getBuffer().begin();
|
2012-11-14 02:38:42 +08:00
|
|
|
if (kind() == K_GNU) {
|
|
|
|
uint32_t symbol_count = 0;
|
|
|
|
symbol_count = *reinterpret_cast<const support::ubig32_t*>(buf);
|
|
|
|
buf += sizeof(uint32_t) + (symbol_count * (sizeof(uint32_t)));
|
|
|
|
} else if (kind() == K_BSD) {
|
2012-11-15 01:58:11 +08:00
|
|
|
llvm_unreachable("BSD archive format is not supported");
|
2012-11-14 02:38:42 +08:00
|
|
|
} else {
|
|
|
|
uint32_t member_count = 0;
|
|
|
|
uint32_t symbol_count = 0;
|
|
|
|
member_count = *reinterpret_cast<const support::ulittle32_t*>(buf);
|
|
|
|
buf += 4 + (member_count * 4); // Skip offsets.
|
|
|
|
symbol_count = *reinterpret_cast<const support::ulittle32_t*>(buf);
|
|
|
|
buf += 4 + (symbol_count * 2); // Skip indices.
|
|
|
|
}
|
2013-02-03 18:48:50 +08:00
|
|
|
uint32_t string_start_offset = buf - SymbolTable->getBuffer().begin();
|
2011-11-03 03:33:12 +08:00
|
|
|
return symbol_iterator(Symbol(this, 0, string_start_offset));
|
|
|
|
}
|
|
|
|
|
|
|
|
Archive::symbol_iterator Archive::end_symbols() const {
|
2013-02-03 18:48:50 +08:00
|
|
|
const char *buf = SymbolTable->getBuffer().begin();
|
2012-11-14 02:38:42 +08:00
|
|
|
uint32_t symbol_count = 0;
|
|
|
|
if (kind() == K_GNU) {
|
|
|
|
symbol_count = *reinterpret_cast<const support::ubig32_t*>(buf);
|
|
|
|
buf += sizeof(uint32_t) + (symbol_count * (sizeof(uint32_t)));
|
|
|
|
} else if (kind() == K_BSD) {
|
2012-11-15 01:58:11 +08:00
|
|
|
llvm_unreachable("BSD archive format is not supported");
|
2012-11-14 02:38:42 +08:00
|
|
|
} else {
|
|
|
|
uint32_t member_count = 0;
|
|
|
|
member_count = *reinterpret_cast<const support::ulittle32_t*>(buf);
|
|
|
|
buf += 4 + (member_count * 4); // Skip offsets.
|
|
|
|
symbol_count = *reinterpret_cast<const support::ulittle32_t*>(buf);
|
|
|
|
}
|
2011-11-03 03:33:12 +08:00
|
|
|
return symbol_iterator(
|
|
|
|
Symbol(this, symbol_count, 0));
|
|
|
|
}
|
2012-11-14 02:38:42 +08:00
|
|
|
|
|
|
|
Archive::child_iterator Archive::findSym(StringRef name) const {
|
|
|
|
Archive::symbol_iterator bs = begin_symbols();
|
|
|
|
Archive::symbol_iterator es = end_symbols();
|
|
|
|
Archive::child_iterator result;
|
|
|
|
|
|
|
|
StringRef symname;
|
|
|
|
for (; bs != es; ++bs) {
|
|
|
|
if (bs->getName(symname))
|
|
|
|
return end_children();
|
|
|
|
if (symname == name) {
|
|
|
|
if (bs->getMember(result))
|
|
|
|
return end_children();
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return end_children();
|
|
|
|
}
|