2011-09-27 19:36:55 +00:00
|
|
|
//===- Archive.h - ar archive file format -----------------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file declares the ar archive file format class.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_OBJECT_ARCHIVE_H
|
|
|
|
#define LLVM_OBJECT_ARCHIVE_H
|
|
|
|
|
2013-02-03 10:48:50 +00:00
|
|
|
#include "llvm/ADT/SmallString.h"
|
2011-09-27 19:36:55 +00:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
2013-02-03 10:48:50 +00:00
|
|
|
#include "llvm/ADT/Twine.h"
|
2012-12-03 17:02:12 +00:00
|
|
|
#include "llvm/Object/Binary.h"
|
2011-09-27 19:36:55 +00:00
|
|
|
#include "llvm/Support/DataTypes.h"
|
2013-02-03 10:48:50 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
|
|
|
#include "llvm/Support/MemoryBuffer.h"
|
2011-09-27 19:36:55 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
namespace object {
|
2013-02-03 10:48:50 +00:00
|
|
|
struct ArchiveMemberHeader {
|
|
|
|
char Name[16];
|
|
|
|
char LastModified[12];
|
|
|
|
char UID[6];
|
|
|
|
char GID[6];
|
|
|
|
char AccessMode[8];
|
|
|
|
char Size[10]; ///< Size of data, not including header or padding.
|
|
|
|
char Terminator[2];
|
|
|
|
|
|
|
|
///! Get the name without looking up long names.
|
|
|
|
llvm::StringRef getName() const {
|
|
|
|
char EndCond;
|
|
|
|
if (Name[0] == '/' || Name[0] == '#')
|
|
|
|
EndCond = ' ';
|
|
|
|
else
|
|
|
|
EndCond = '/';
|
|
|
|
llvm::StringRef::size_type end =
|
|
|
|
llvm::StringRef(Name, sizeof(Name)).find(EndCond);
|
|
|
|
if (end == llvm::StringRef::npos)
|
|
|
|
end = sizeof(Name);
|
|
|
|
assert(end <= sizeof(Name) && end > 0);
|
|
|
|
// Don't include the EndCond if there is one.
|
|
|
|
return llvm::StringRef(Name, end);
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t getSize() const {
|
|
|
|
uint64_t ret;
|
|
|
|
if (llvm::StringRef(Size, sizeof(Size)).rtrim(" ").getAsInteger(10, ret))
|
|
|
|
llvm_unreachable("Size is not an integer.");
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ArchiveMemberHeader *ToHeader(const char *base) {
|
|
|
|
return reinterpret_cast<const ArchiveMemberHeader *>(base);
|
|
|
|
}
|
2011-09-27 19:36:55 +00:00
|
|
|
|
|
|
|
class Archive : public Binary {
|
2011-12-20 02:50:00 +00:00
|
|
|
virtual void anchor();
|
2011-09-27 19:36:55 +00:00
|
|
|
public:
|
|
|
|
class Child {
|
2011-10-08 00:17:45 +00:00
|
|
|
const Archive *Parent;
|
2013-02-03 10:48:50 +00:00
|
|
|
/// \brief Includes header but not padding byte.
|
2011-09-27 19:36:55 +00:00
|
|
|
StringRef Data;
|
2013-02-03 10:48:50 +00:00
|
|
|
/// \brief Offset from Data to the start of the file.
|
|
|
|
uint16_t StartOfFile;
|
2011-09-27 19:36:55 +00:00
|
|
|
|
|
|
|
public:
|
2013-02-03 10:48:50 +00:00
|
|
|
Child(const Archive *p, StringRef d) : Parent(p), Data(d) {
|
|
|
|
if (!p || d.empty())
|
|
|
|
return;
|
|
|
|
// Setup StartOfFile and PaddingBytes.
|
|
|
|
StartOfFile = sizeof(ArchiveMemberHeader);
|
|
|
|
// Don't include attached name.
|
|
|
|
StringRef Name = ToHeader(Data.data())->getName();
|
|
|
|
if (Name.startswith("#1/")) {
|
|
|
|
uint64_t NameSize;
|
|
|
|
if (Name.substr(3).rtrim(" ").getAsInteger(10, NameSize))
|
|
|
|
llvm_unreachable("Long name length is not an integer");
|
|
|
|
StartOfFile += NameSize;
|
|
|
|
}
|
|
|
|
}
|
2011-09-27 19:36:55 +00:00
|
|
|
|
|
|
|
bool operator ==(const Child &other) const {
|
|
|
|
return (Parent == other.Parent) && (Data.begin() == other.Data.begin());
|
|
|
|
}
|
|
|
|
|
2011-11-16 01:25:13 +00:00
|
|
|
bool operator <(const Child &other) const {
|
|
|
|
return Data.begin() < other.Data.begin();
|
|
|
|
}
|
|
|
|
|
2013-02-03 10:48:50 +00:00
|
|
|
Child getNext() const {
|
|
|
|
size_t SpaceToSkip = Data.size();
|
|
|
|
// If it's odd, add 1 to make it even.
|
|
|
|
if (SpaceToSkip & 1)
|
|
|
|
++SpaceToSkip;
|
|
|
|
|
|
|
|
const char *NextLoc = Data.data() + SpaceToSkip;
|
|
|
|
|
|
|
|
// Check to see if this is past the end of the archive.
|
|
|
|
if (NextLoc >= Parent->Data->getBufferEnd())
|
|
|
|
return Child(Parent, StringRef(0, 0));
|
|
|
|
|
|
|
|
size_t NextSize =
|
|
|
|
sizeof(ArchiveMemberHeader) + ToHeader(NextLoc)->getSize();
|
|
|
|
|
|
|
|
return Child(Parent, StringRef(NextLoc, NextSize));
|
|
|
|
}
|
|
|
|
|
2011-09-27 19:36:55 +00:00
|
|
|
error_code getName(StringRef &Result) const;
|
|
|
|
int getLastModified() const;
|
|
|
|
int getUID() const;
|
|
|
|
int getGID() const;
|
|
|
|
int getAccessMode() const;
|
2013-02-03 10:48:50 +00:00
|
|
|
/// \return the size of the archive member without the header or padding.
|
|
|
|
uint64_t getSize() const { return Data.size() - StartOfFile; }
|
|
|
|
|
|
|
|
StringRef getBuffer() const {
|
|
|
|
return StringRef(Data.data() + StartOfFile, getSize());
|
|
|
|
}
|
|
|
|
|
|
|
|
error_code getMemoryBuffer(OwningPtr<MemoryBuffer> &Result,
|
|
|
|
bool FullPath = false) const {
|
|
|
|
StringRef Name;
|
|
|
|
if (error_code ec = getName(Name))
|
|
|
|
return ec;
|
|
|
|
SmallString<128> Path;
|
|
|
|
Result.reset(MemoryBuffer::getMemBuffer(
|
|
|
|
getBuffer(), FullPath ? (Twine(Parent->getFileName()) + "(" + Name +
|
|
|
|
")").toStringRef(Path) : Name, false));
|
|
|
|
return error_code::success();
|
|
|
|
}
|
2011-09-27 19:36:55 +00:00
|
|
|
|
|
|
|
error_code getAsBinary(OwningPtr<Binary> &Result) const;
|
|
|
|
};
|
|
|
|
|
|
|
|
class child_iterator {
|
|
|
|
Child child;
|
|
|
|
public:
|
2011-11-02 19:33:12 +00:00
|
|
|
child_iterator() : child(Child(0, StringRef())) {}
|
2011-09-27 19:36:55 +00:00
|
|
|
child_iterator(const Child &c) : child(c) {}
|
|
|
|
const Child* operator->() const {
|
|
|
|
return &child;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator==(const child_iterator &other) const {
|
|
|
|
return child == other.child;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const child_iterator &other) const {
|
|
|
|
return !(*this == other);
|
|
|
|
}
|
|
|
|
|
2011-11-16 01:25:13 +00:00
|
|
|
bool operator <(const child_iterator &other) const {
|
|
|
|
return child < other.child;
|
|
|
|
}
|
|
|
|
|
2011-09-27 19:36:55 +00:00
|
|
|
child_iterator& operator++() { // Preincrement
|
|
|
|
child = child.getNext();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-11-02 19:33:12 +00:00
|
|
|
class Symbol {
|
|
|
|
const Archive *Parent;
|
|
|
|
uint32_t SymbolIndex;
|
|
|
|
uint32_t StringIndex; // Extra index to the string.
|
|
|
|
|
|
|
|
public:
|
|
|
|
bool operator ==(const Symbol &other) const {
|
|
|
|
return (Parent == other.Parent) && (SymbolIndex == other.SymbolIndex);
|
|
|
|
}
|
|
|
|
|
|
|
|
Symbol(const Archive *p, uint32_t symi, uint32_t stri)
|
|
|
|
: Parent(p)
|
|
|
|
, SymbolIndex(symi)
|
|
|
|
, StringIndex(stri) {}
|
|
|
|
error_code getName(StringRef &Result) const;
|
|
|
|
error_code getMember(child_iterator &Result) const;
|
|
|
|
Symbol getNext() const;
|
|
|
|
};
|
|
|
|
|
|
|
|
class symbol_iterator {
|
|
|
|
Symbol symbol;
|
|
|
|
public:
|
|
|
|
symbol_iterator(const Symbol &s) : symbol(s) {}
|
|
|
|
const Symbol *operator->() const {
|
|
|
|
return &symbol;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator==(const symbol_iterator &other) const {
|
|
|
|
return symbol == other.symbol;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const symbol_iterator &other) const {
|
|
|
|
return !(*this == other);
|
|
|
|
}
|
|
|
|
|
|
|
|
symbol_iterator& operator++() { // Preincrement
|
|
|
|
symbol = symbol.getNext();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-09-27 19:36:55 +00:00
|
|
|
Archive(MemoryBuffer *source, error_code &ec);
|
|
|
|
|
2012-11-13 18:38:42 +00:00
|
|
|
enum Kind {
|
|
|
|
K_GNU,
|
|
|
|
K_BSD,
|
|
|
|
K_COFF
|
|
|
|
};
|
|
|
|
|
|
|
|
Kind kind() const {
|
|
|
|
return Format;
|
|
|
|
}
|
|
|
|
|
2011-10-25 22:30:42 +00:00
|
|
|
child_iterator begin_children(bool skip_internal = true) const;
|
2011-10-08 00:17:45 +00:00
|
|
|
child_iterator end_children() const;
|
2011-09-27 19:36:55 +00:00
|
|
|
|
2011-11-02 19:33:12 +00:00
|
|
|
symbol_iterator begin_symbols() const;
|
|
|
|
symbol_iterator end_symbols() const;
|
|
|
|
|
2011-09-27 19:36:55 +00:00
|
|
|
// Cast methods.
|
|
|
|
static inline bool classof(Binary const *v) {
|
2012-03-09 20:41:57 +00:00
|
|
|
return v->isArchive();
|
2011-09-27 19:36:55 +00:00
|
|
|
}
|
|
|
|
|
2012-11-13 18:38:42 +00:00
|
|
|
// check if a symbol is in the archive
|
|
|
|
child_iterator findSym(StringRef name) const;
|
|
|
|
|
2011-09-27 19:36:55 +00:00
|
|
|
private:
|
2011-11-02 19:33:12 +00:00
|
|
|
child_iterator SymbolTable;
|
2011-09-27 19:36:55 +00:00
|
|
|
child_iterator StringTable;
|
2012-11-13 18:38:42 +00:00
|
|
|
Kind Format;
|
2011-09-27 19:36:55 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|