2 * Copyright (c) 2006,2008,2010 Joseph Koshy
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS `AS IS' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include "_libelf_ar.h"
36 ELFTC_VCSID("$Id: libelf_ar.c 3712 2019-03-16 22:23:34Z jkoshy $");
38 #define LIBELF_NALLOC_SIZE 16
41 * `ar' archive handling.
43 * `ar' archives start with signature `ARMAG'. Each archive member is
44 * preceded by a header containing meta-data for the member. This
45 * header is described in <ar.h> (struct ar_hdr). The header always
46 * starts on an even address. File data is padded with "\n"
47 * characters to keep this invariant.
49 * Special considerations for `ar' archives:
51 * There are two variants of the `ar' archive format: traditional BSD
52 * and SVR4. These differ in the way long file names are treated, and
53 * in the layout of the archive symbol table.
55 * The `ar' header only has space for a 16 character file name.
57 * In the SVR4 format, file names are terminated with a '/', so this
58 * effectively leaves 15 characters for the actual file name. Longer
59 * file names stored in a separate 'string table' and referenced
60 * indirectly from the name field. The string table itself appears as
61 * an archive member with name "// ". An `indirect' file name in an
62 * `ar' header matches the pattern "/[0-9]*". The digits form a
63 * decimal number that corresponds to a byte offset into the string
64 * table where the actual file name of the object starts. Strings in
65 * the string table are padded to start on even addresses.
67 * In the BSD format, file names can be up to 16 characters. File
68 * names shorter than 16 characters are padded to 16 characters using
69 * (ASCII) space characters. File names with embedded spaces and file
70 * names longer than 16 characters are stored immediately after the
71 * archive header and the name field set to a special indirect name
72 * matching the pattern "#1/[0-9]+". The digits form a decimal number
73 * that corresponds to the actual length of the file name following
74 * the archive header. The content of the archive member immediately
75 * follows the file name, and the size field of the archive member
76 * holds the sum of the sizes of the member and of the appended file
79 * Archives may also have a symbol table (see ranlib(1)), mapping
80 * program symbols to object files inside the archive.
82 * In the SVR4 format, a symbol table uses a file name of "/ " in its
83 * archive header. The symbol table is structured as:
84 * - a 4-byte count of entries stored as a binary value, MSB first
85 * - 'n' 4-byte offsets, stored as binary values, MSB first
86 * - 'n' NUL-terminated strings, for ELF symbol names, stored unpadded.
88 * In the BSD format, the symbol table uses a file name of "__.SYMDEF".
89 * It is structured as two parts:
90 * - The first part is an array of "ranlib" structures preceded by
91 * the size of the array in bytes. Each "ranlib" structure
92 * describes one symbol. Each structure contains an offset into
93 * the string table for the symbol name, and a file offset into the
94 * archive for the member defining the symbol.
95 * - The second part is a string table containing NUL-terminated
96 * strings, preceded by the size of the string table in bytes.
98 * If the symbol table and string table are is present in an archive
99 * they must be the very first objects and in that order.
104 * Retrieve an archive header descriptor.
108 _libelf_ar_gethdr(Elf *e)
116 if ((parent = e->e_parent) == NULL) {
117 LIBELF_SET_ERROR(ARGUMENT, 0);
121 assert((e->e_flags & LIBELF_F_AR_HEADER) == 0);
123 arh = (struct ar_hdr *) (uintptr_t) e->e_hdr.e_rawhdr;
125 assert((uintptr_t) arh >= (uintptr_t) parent->e_rawfile + SARMAG);
128 * There needs to be enough space remaining in the file for the
131 if ((uintptr_t) arh > (uintptr_t) parent->e_rawfile +
132 (uintptr_t) parent->e_rawsize - sizeof(struct ar_hdr)) {
133 LIBELF_SET_ERROR(ARCHIVE, 0);
137 if ((eh = malloc(sizeof(Elf_Arhdr))) == NULL) {
138 LIBELF_SET_ERROR(RESOURCE, 0);
142 e->e_hdr.e_arhdr = eh;
143 e->e_flags |= LIBELF_F_AR_HEADER;
145 eh->ar_name = eh->ar_rawname = NULL;
147 if ((eh->ar_name = _libelf_ar_get_translated_name(arh, parent)) ==
151 if (_libelf_ar_get_number(arh->ar_uid, sizeof(arh->ar_uid), 10,
154 eh->ar_uid = (uid_t) n;
156 if (_libelf_ar_get_number(arh->ar_gid, sizeof(arh->ar_gid), 10,
159 eh->ar_gid = (gid_t) n;
161 if (_libelf_ar_get_number(arh->ar_mode, sizeof(arh->ar_mode), 8,
164 eh->ar_mode = (mode_t) n;
166 if (_libelf_ar_get_number(arh->ar_size, sizeof(arh->ar_size), 10,
171 * Get the true size of the member if extended naming is being used.
173 if (IS_EXTENDED_BSD_NAME(arh->ar_name)) {
174 namelen = arh->ar_name +
175 LIBELF_AR_BSD_EXTENDED_NAME_PREFIX_SIZE;
176 if (_libelf_ar_get_number(namelen, sizeof(arh->ar_name) -
177 LIBELF_AR_BSD_EXTENDED_NAME_PREFIX_SIZE, 10, &nlen) == 0)
184 if ((eh->ar_rawname = _libelf_ar_get_raw_name(arh)) == NULL)
196 free(eh->ar_rawname);
200 e->e_flags &= ~LIBELF_F_AR_HEADER;
201 e->e_hdr.e_rawhdr = (unsigned char *) arh;
207 _libelf_ar_open_member(int fd, Elf_Cmd c, Elf *elf)
213 char *member, *namelen;
215 assert(elf->e_kind == ELF_K_AR);
217 next = elf->e_u.e_ar.e_next;
220 * `next' is only set to zero by elf_next() when the last
221 * member of an archive is processed.
223 if (next == (off_t) 0)
226 assert((next & 1) == 0);
229 * There needs to be enough space in the file to contain an
232 end = next + (off_t) sizeof(struct ar_hdr);
233 if ((uintmax_t) end < (uintmax_t) next || /* Overflow. */
234 end > (off_t) elf->e_rawsize) {
235 LIBELF_SET_ERROR(ARCHIVE, 0);
239 arh = (struct ar_hdr *) (elf->e_rawfile + next);
242 * Retrieve the size of the member.
244 if (_libelf_ar_get_number(arh->ar_size, sizeof(arh->ar_size), 10,
246 LIBELF_SET_ERROR(ARCHIVE, 0);
251 * Check if the archive member that follows will fit in the
252 * containing archive.
255 if (end < next || /* Overflow. */
256 end > (off_t) elf->e_rawsize) {
257 LIBELF_SET_ERROR(ARCHIVE, 0);
262 * Adjust the size field for members in BSD archives using
265 if (IS_EXTENDED_BSD_NAME(arh->ar_name)) {
266 namelen = arh->ar_name +
267 LIBELF_AR_BSD_EXTENDED_NAME_PREFIX_SIZE;
268 if (_libelf_ar_get_number(namelen, sizeof(arh->ar_name) -
269 LIBELF_AR_BSD_EXTENDED_NAME_PREFIX_SIZE, 10, &nsz) == 0) {
270 LIBELF_SET_ERROR(ARCHIVE, 0);
274 member = (char *) (arh + 1) + nsz;
277 member = (char *) (arh + 1);
280 if ((e = elf_memory(member, sz)) == NULL)
285 e->e_hdr.e_rawhdr = (unsigned char *) arh;
287 elf->e_u.e_ar.e_nchildren++;
294 * A BSD-style ar(1) symbol table has the following layout:
296 * - A count of bytes used by the following array of 'ranlib'
297 * structures, stored as a 'long'.
298 * - An array of 'ranlib' structures. Each array element is
299 * two 'long's in size.
300 * - A count of bytes used for the following symbol table.
301 * - The symbol table itself.
305 * A helper macro to read in a 'long' value from the archive.
307 * We use memcpy() since the source pointer may be misaligned with
308 * respect to the natural alignment for a C 'long'.
310 #define GET_LONG(P, V)do { \
311 memcpy(&(V), (P), sizeof(long)); \
312 (P) += sizeof(long); \
316 _libelf_ar_process_bsd_symtab(Elf *e, size_t *count)
318 Elf_Arsym *symtab, *sym;
321 unsigned char *end, *p, *p0, *s, *s0;
322 const size_t entrysize = 2 * sizeof(long);
323 long arraysize, fileoffset, stroffset, strtabsize;
326 assert(count != NULL);
327 assert(e->e_u.e_ar.e_symtab == NULL);
332 * The BSD symbol table always contains the count fields even
333 * if there are no entries in it.
335 if (e->e_u.e_ar.e_rawsymtabsz < 2 * sizeof(long))
338 p = p0 = (unsigned char *) e->e_u.e_ar.e_rawsymtab;
339 end = p0 + e->e_u.e_ar.e_rawsymtabsz;
342 * Retrieve the size of the array of ranlib descriptors and
343 * check it for validity.
345 GET_LONG(p, arraysize);
347 if (arraysize < 0 || p0 + arraysize >= end ||
348 ((size_t) arraysize % entrysize != 0))
352 * Check the value of the string table size.
355 GET_LONG(s, strtabsize);
357 s0 = s; /* Start of string table. */
358 if (strtabsize < 0 || s0 + strtabsize > end)
361 nentries = (size_t) arraysize / entrysize;
364 * Allocate space for the returned Elf_Arsym array.
366 if ((symtab = malloc(sizeof(Elf_Arsym) * (nentries + 1))) == NULL) {
367 LIBELF_SET_ERROR(RESOURCE, 0);
371 /* Read in symbol table entries. */
372 for (n = 0, sym = symtab; n < nentries; n++, sym++) {
373 GET_LONG(p, stroffset);
374 GET_LONG(p, fileoffset);
376 if (stroffset < 0 || fileoffset < 0 ||
377 (off_t) fileoffset >= e->e_rawsize)
385 sym->as_off = (off_t) fileoffset;
386 sym->as_hash = elf_hash((char *) s);
387 sym->as_name = (char *) s;
390 /* Fill up the sentinel entry. */
393 sym->as_off = (off_t) 0;
395 /* Remember the processed symbol table. */
396 e->e_u.e_ar.e_symtab = symtab;
398 *count = e->e_u.e_ar.e_symtabsz = nentries + 1;
405 LIBELF_SET_ERROR(ARCHIVE, 0);
410 * An SVR4-style ar(1) symbol table has the following layout:
412 * - The first 4 bytes are a binary count of the number of entries in the
413 * symbol table, stored MSB-first.
414 * - Then there are 'n' 4-byte binary offsets, also stored MSB first.
415 * - Following this, there are 'n' null-terminated strings.
418 #define GET_WORD(P, V) do { \
420 (V) = (P)[0]; (V) <<= 8; \
421 (V) += (P)[1]; (V) <<= 8; \
422 (V) += (P)[2]; (V) <<= 8; \
430 _libelf_ar_process_svr4_symtab(Elf *e, size_t *count)
434 Elf_Arsym *symtab, *sym;
435 unsigned char *p, *s, *end;
438 assert(count != NULL);
439 assert(e->e_u.e_ar.e_symtab == NULL);
443 if (e->e_u.e_ar.e_rawsymtabsz < INTSZ)
446 p = (unsigned char *) e->e_u.e_ar.e_rawsymtab;
447 end = p + e->e_u.e_ar.e_rawsymtabsz;
449 GET_WORD(p, nentries);
452 if (nentries == 0 || p + nentries * INTSZ >= end)
455 /* Allocate space for a nentries + a sentinel. */
456 if ((symtab = malloc(sizeof(Elf_Arsym) * (nentries+1))) == NULL) {
457 LIBELF_SET_ERROR(RESOURCE, 0);
461 s = p + (nentries * INTSZ); /* start of the string table. */
463 for (n = nentries, sym = symtab; n > 0; n--) {
468 if (off >= e->e_rawsize)
471 sym->as_off = (off_t) off;
472 sym->as_hash = elf_hash((char *) s);
473 sym->as_name = (char *) s;
478 for (; s < end && *s++ != '\0';) /* skip to next string */
482 /* Fill up the sentinel entry. */
485 sym->as_off = (off_t) 0;
487 *count = e->e_u.e_ar.e_symtabsz = nentries + 1;
488 e->e_u.e_ar.e_symtab = symtab;
495 LIBELF_SET_ERROR(ARCHIVE, 0);