1 //===- Archive.cpp - ar File Format implementation --------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the ArchiveObjectFile class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Object/Archive.h"
15 #include "llvm/ADT/APInt.h"
16 #include "llvm/Support/MemoryBuffer.h"
19 using namespace object;
21 static const StringRef Magic = "!<arch>\n";
24 struct ArchiveMemberHeader {
26 char LastModified[12];
30 char Size[10]; //< Size of data, not including header or padding.
33 ///! Get the name without looking up long names.
34 StringRef getName() const {
36 if (Name[0] == '/' || Name[0] == '#')
40 StringRef::size_type end = StringRef(Name, sizeof(Name)).find(EndCond);
41 if (end == StringRef::npos)
43 assert(end <= sizeof(Name) && end > 0);
44 // Don't include the EndCond if there is one.
45 return StringRef(Name, end);
48 uint64_t getSize() const {
50 StringRef(Size, sizeof(Size)).getAsInteger(10, ret);
51 return ret.getZExtValue();
56 static const ArchiveMemberHeader *ToHeader(const char *base) {
57 return reinterpret_cast<const ArchiveMemberHeader *>(base);
61 static bool isInternalMember(const ArchiveMemberHeader &amh) {
62 const char *internals[] = {
68 StringRef name = amh.getName();
69 for (std::size_t i = 0; i < sizeof(internals) / sizeof(*internals); ++i) {
70 if (name == internals[i])
76 Archive::Child Archive::Child::getNext() const {
77 size_t SpaceToSkip = sizeof(ArchiveMemberHeader) +
78 ToHeader(Data.data())->getSize();
79 // If it's odd, add 1 to make it even.
83 const char *NextLoc = Data.data() + SpaceToSkip;
85 // Check to see if this is past the end of the archive.
86 if (NextLoc >= Parent->Data->getBufferEnd())
87 return Child(Parent, StringRef(0, 0));
89 size_t NextSize = sizeof(ArchiveMemberHeader) +
90 ToHeader(NextLoc)->getSize();
92 return Child(Parent, StringRef(NextLoc, NextSize));
95 error_code Archive::Child::getName(StringRef &Result) const {
96 StringRef name = ToHeader(Data.data())->getName();
97 // Check if it's a special name.
99 if (name.size() == 1) { // Linker member.
101 return object_error::success;
103 if (name.size() == 2 && name[1] == '/') { // String table.
105 return object_error::success;
110 name.substr(1).getAsInteger(10, offset);
111 const char *addr = Parent->StringTable->Data.begin()
112 + sizeof(ArchiveMemberHeader)
113 + offset.getZExtValue();
115 if (Parent->StringTable == Parent->end_children()
116 || addr < (Parent->StringTable->Data.begin()
117 + sizeof(ArchiveMemberHeader))
118 || addr > (Parent->StringTable->Data.begin()
119 + sizeof(ArchiveMemberHeader)
120 + Parent->StringTable->getSize()))
121 return object_error::parse_failed;
123 return object_error::success;
124 } else if (name.startswith("#1/")) {
126 name.substr(3).getAsInteger(10, name_size);
127 Result = Data.substr(0, name_size.getZExtValue());
128 return object_error::success;
130 // It's a simple name.
131 if (name[name.size() - 1] == '/')
132 Result = name.substr(0, name.size() - 1);
135 return object_error::success;
138 uint64_t Archive::Child::getSize() const {
139 uint64_t size = ToHeader(Data.data())->getSize();
140 // Don't include attached name.
141 StringRef name = ToHeader(Data.data())->getName();
142 if (name.startswith("#1/")) {
144 name.substr(3).getAsInteger(10, name_size);
145 size -= name_size.getZExtValue();
150 MemoryBuffer *Archive::Child::getBuffer() const {
152 if (getName(name)) return NULL;
153 int size = sizeof(ArchiveMemberHeader);
154 if (name.startswith("#1/")) {
156 name.substr(3).getAsInteger(10, name_size);
157 size += name_size.getZExtValue();
159 return MemoryBuffer::getMemBuffer(Data.substr(size, getSize()),
164 error_code Archive::Child::getAsBinary(OwningPtr<Binary> &Result) const {
165 OwningPtr<Binary> ret;
167 createBinary(getBuffer(), ret))
170 return object_error::success;
173 Archive::Archive(MemoryBuffer *source, error_code &ec)
174 : Binary(Binary::isArchive, source)
175 , StringTable(Child(this, StringRef(0, 0))) {
176 // Check for sufficient magic.
177 if (!source || source->getBufferSize()
178 < (8 + sizeof(ArchiveMemberHeader) + 2) // Smallest archive.
179 || StringRef(source->getBufferStart(), 8) != Magic) {
180 ec = object_error::invalid_file_type;
184 // Get the string table. It's the 3rd member.
185 child_iterator StrTable = begin_children(false);
186 child_iterator e = end_children();
187 for (int i = 0; StrTable != e && i < 2; ++StrTable, ++i) {}
189 // Check to see if there were 3 members, or the 3rd member wasn't named "//".
191 if (StrTable != e && !StrTable->getName(name) && name == "//")
192 StringTable = StrTable;
194 ec = object_error::success;
197 Archive::child_iterator Archive::begin_children(bool skip_internal) const {
198 const char *Loc = Data->getBufferStart() + Magic.size();
199 size_t Size = sizeof(ArchiveMemberHeader) +
200 ToHeader(Loc)->getSize();
201 Child c(this, StringRef(Loc, Size));
202 // Skip internals at the beginning of an archive.
203 if (skip_internal && isInternalMember(*ToHeader(Loc)))
208 Archive::child_iterator Archive::end_children() const {
209 return Child(this, StringRef(0, 0));