14484Sbinkertn@umich.edu/*- 24484Sbinkertn@umich.edu * Copyright (c) 2006 Joseph Koshy 34484Sbinkertn@umich.edu * All rights reserved. 44484Sbinkertn@umich.edu * 54484Sbinkertn@umich.edu * Redistribution and use in source and binary forms, with or without 64484Sbinkertn@umich.edu * modification, are permitted provided that the following conditions 74484Sbinkertn@umich.edu * are met: 84484Sbinkertn@umich.edu * 1. Redistributions of source code must retain the above copyright 94484Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer. 104484Sbinkertn@umich.edu * 2. Redistributions in binary form must reproduce the above copyright 114484Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer in the 124484Sbinkertn@umich.edu * documentation and/or other materials provided with the distribution. 134484Sbinkertn@umich.edu * 144484Sbinkertn@umich.edu * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS `AS IS' AND 154484Sbinkertn@umich.edu * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 164484Sbinkertn@umich.edu * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 174484Sbinkertn@umich.edu * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 184484Sbinkertn@umich.edu * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 194484Sbinkertn@umich.edu * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 204484Sbinkertn@umich.edu * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 214484Sbinkertn@umich.edu * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 224484Sbinkertn@umich.edu * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 234484Sbinkertn@umich.edu * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 244484Sbinkertn@umich.edu * SUCH DAMAGE. 254484Sbinkertn@umich.edu */ 264484Sbinkertn@umich.edu 274484Sbinkertn@umich.edu#include <ar.h> 284484Sbinkertn@umich.edu#include <assert.h> 294484Sbinkertn@umich.edu#include <ctype.h> 304484Sbinkertn@umich.edu#include "libelf.h" 314484Sbinkertn@umich.edu#include <stdlib.h> 324484Sbinkertn@umich.edu#include <string.h> 334484Sbinkertn@umich.edu 344484Sbinkertn@umich.edu#include "_libelf.h" 354484Sbinkertn@umich.edu 364484Sbinkertn@umich.edu#define LIBELF_NALLOC_SIZE 16 374484Sbinkertn@umich.edu 384484Sbinkertn@umich.edu/* 394484Sbinkertn@umich.edu * `ar' archive handling. 404484Sbinkertn@umich.edu * 414484Sbinkertn@umich.edu * `ar' archives start with signature `ARMAG'. Each archive member is 424484Sbinkertn@umich.edu * preceded by a header containing meta-data for the member. This 434484Sbinkertn@umich.edu * header is described in <ar.h> (struct ar_hdr). The header always 444484Sbinkertn@umich.edu * starts on an even address. File data is padded with "\n" 454484Sbinkertn@umich.edu * characters to keep this invariant. 464484Sbinkertn@umich.edu * 474484Sbinkertn@umich.edu * Special considerations for `ar' archives: 484484Sbinkertn@umich.edu * 494484Sbinkertn@umich.edu * The `ar' header only has space for a 16 character file name. File 504484Sbinkertn@umich.edu * names are terminated with a '/', so this effectively leaves 15 514484Sbinkertn@umich.edu * characters for the actual file name. In order to accomodate longer 524484Sbinkertn@umich.edu * file names, names may be stored in a separate 'string table' and 534484Sbinkertn@umich.edu * referenced indirectly by a member header. The string table itself 544484Sbinkertn@umich.edu * appears as an archive member with name "// ". An indirect file name 554484Sbinkertn@umich.edu * in an `ar' header matches the pattern "/[0-9]*". The digits form a 564484Sbinkertn@umich.edu * decimal number that corresponds to a byte offset into the string 574484Sbinkertn@umich.edu * table where the actual file name of the object starts. Strings in 584484Sbinkertn@umich.edu * the string table are padded to start on even addresses. 594484Sbinkertn@umich.edu * 604484Sbinkertn@umich.edu * Archives may also have a symbol table (see ranlib(1)), mapping 614484Sbinkertn@umich.edu * program symbols to object files inside the archive. A symbol table 624484Sbinkertn@umich.edu * uses a file name of "/ " in its archive header. The symbol table 634484Sbinkertn@umich.edu * is structured as: 644484Sbinkertn@umich.edu * - a 4-byte count of entries stored as a binary value, MSB first 654484Sbinkertn@umich.edu * - 'n' 4-byte offsets, stored as binary values, MSB first 664484Sbinkertn@umich.edu * - 'n' NUL-terminated strings, for ELF symbol names, stored unpadded. 674484Sbinkertn@umich.edu * 684484Sbinkertn@umich.edu * If the symbol table and string table are is present in an archive 694484Sbinkertn@umich.edu * they must be the very first objects and in that order. 704484Sbinkertn@umich.edu */ 714484Sbinkertn@umich.edu 724484Sbinkertn@umich.edu/* 734484Sbinkertn@umich.edu * Convert a string bounded by `start' and `start+sz' (exclusive) to a 744484Sbinkertn@umich.edu * number in the specified base. 754484Sbinkertn@umich.edu */ 764484Sbinkertn@umich.edustatic int 774484Sbinkertn@umich.edu_libelf_ar_get_number(char *s, size_t sz, int base, size_t *ret) 784484Sbinkertn@umich.edu{ 794484Sbinkertn@umich.edu int c, v; 804484Sbinkertn@umich.edu size_t r; 814484Sbinkertn@umich.edu char *e; 824484Sbinkertn@umich.edu 834484Sbinkertn@umich.edu assert(base <= 10); 844484Sbinkertn@umich.edu 854484Sbinkertn@umich.edu e = s + sz; 864484Sbinkertn@umich.edu 874484Sbinkertn@umich.edu /* skip leading blanks */ 884484Sbinkertn@umich.edu for (;s < e && (c = *s) == ' '; s++) 894484Sbinkertn@umich.edu ; 904484Sbinkertn@umich.edu 914484Sbinkertn@umich.edu r = 0L; 924484Sbinkertn@umich.edu for (;s < e; s++) { 934484Sbinkertn@umich.edu if ((c = *s) == ' ') 944484Sbinkertn@umich.edu break; 954484Sbinkertn@umich.edu if (c < '0' || c > '9') 964484Sbinkertn@umich.edu return (0); 974484Sbinkertn@umich.edu v = c - '0'; 984484Sbinkertn@umich.edu if (v >= base) /* Illegal digit. */ 994484Sbinkertn@umich.edu break; 1004484Sbinkertn@umich.edu r *= base; 1014484Sbinkertn@umich.edu r += v; 1024484Sbinkertn@umich.edu } 1034484Sbinkertn@umich.edu 1044484Sbinkertn@umich.edu *ret = r; 1054484Sbinkertn@umich.edu 1064484Sbinkertn@umich.edu return (1); 1074484Sbinkertn@umich.edu} 1084484Sbinkertn@umich.edu 1094484Sbinkertn@umich.edu/* 1104484Sbinkertn@umich.edu * Retrieve a string from a name field. If `rawname' is set, leave 1114484Sbinkertn@umich.edu * ar(1) control characters in. 1124484Sbinkertn@umich.edu */ 1134484Sbinkertn@umich.edustatic char * 1144484Sbinkertn@umich.edu_libelf_ar_get_string(const char *buf, size_t bufsize, int rawname) 1154484Sbinkertn@umich.edu{ 1164484Sbinkertn@umich.edu const char *q; 1174484Sbinkertn@umich.edu char *r; 1184484Sbinkertn@umich.edu size_t sz; 1194484Sbinkertn@umich.edu 1204484Sbinkertn@umich.edu if (rawname) 1214484Sbinkertn@umich.edu sz = bufsize + 1; 1224484Sbinkertn@umich.edu else { 1234484Sbinkertn@umich.edu /* Skip back over trailing blanks. */ 1244484Sbinkertn@umich.edu for (q = buf + bufsize - 1; q >= buf && *q == ' '; --q) 1254484Sbinkertn@umich.edu ; 1264484Sbinkertn@umich.edu 1274484Sbinkertn@umich.edu if (q < buf) { 1284484Sbinkertn@umich.edu /* 1294484Sbinkertn@umich.edu * If the input buffer only had blanks in it, 1304484Sbinkertn@umich.edu * return a zero-length string. 1314484Sbinkertn@umich.edu */ 1324484Sbinkertn@umich.edu buf = ""; 1334484Sbinkertn@umich.edu sz = 1; 1344484Sbinkertn@umich.edu } else { 1354484Sbinkertn@umich.edu /* 1364484Sbinkertn@umich.edu * Remove the trailing '/' character, but only 1374484Sbinkertn@umich.edu * if the name isn't one of the special names 1384484Sbinkertn@umich.edu * "/" and "//". 1394484Sbinkertn@umich.edu */ 1404484Sbinkertn@umich.edu if (q > buf + 1 || 1414484Sbinkertn@umich.edu (q == (buf + 1) && *buf != '/')) 1424484Sbinkertn@umich.edu q--; 1434484Sbinkertn@umich.edu 1444484Sbinkertn@umich.edu sz = q - buf + 2; /* Space for a trailing NUL. */ 1454484Sbinkertn@umich.edu } 1464484Sbinkertn@umich.edu } 1474484Sbinkertn@umich.edu 1484484Sbinkertn@umich.edu if ((r = malloc(sz)) == NULL) { 1494484Sbinkertn@umich.edu LIBELF_SET_ERROR(RESOURCE, 0); 1504484Sbinkertn@umich.edu return (NULL); 1514484Sbinkertn@umich.edu } 1524484Sbinkertn@umich.edu 1534484Sbinkertn@umich.edu (void) strncpy(r, buf, sz); 1544484Sbinkertn@umich.edu r[sz - 1] = '\0'; 1554484Sbinkertn@umich.edu 1564484Sbinkertn@umich.edu return (r); 1574484Sbinkertn@umich.edu} 1584484Sbinkertn@umich.edu 1594484Sbinkertn@umich.edu/* 1604484Sbinkertn@umich.edu * Retrieve the full name of the archive member. 1614484Sbinkertn@umich.edu */ 1624484Sbinkertn@umich.edustatic char * 1634484Sbinkertn@umich.edu_libelf_ar_get_name(char *buf, size_t bufsize, Elf *e) 1644484Sbinkertn@umich.edu{ 1654484Sbinkertn@umich.edu char c, *q, *r, *s; 1664484Sbinkertn@umich.edu size_t len; 1674484Sbinkertn@umich.edu size_t offset; 1684484Sbinkertn@umich.edu 1694484Sbinkertn@umich.edu assert(e->e_kind == ELF_K_AR); 1704484Sbinkertn@umich.edu 1714484Sbinkertn@umich.edu if (buf[0] == '/' && (c = buf[1]) >= '0' && c <= '9') { 1724484Sbinkertn@umich.edu /* 1734484Sbinkertn@umich.edu * The value in field ar_name is a decimal offset into 1744484Sbinkertn@umich.edu * the archive string table where the actual name 1754484Sbinkertn@umich.edu * resides. 1764484Sbinkertn@umich.edu */ 1774484Sbinkertn@umich.edu if (_libelf_ar_get_number(buf + 1, bufsize - 1, 10, 1784484Sbinkertn@umich.edu &offset) == 0) { 1794484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 1804484Sbinkertn@umich.edu return (NULL); 1814484Sbinkertn@umich.edu } 1824484Sbinkertn@umich.edu 1834484Sbinkertn@umich.edu if (offset > e->e_u.e_ar.e_rawstrtabsz) { 1844484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 1854484Sbinkertn@umich.edu return (NULL); 1864484Sbinkertn@umich.edu } 1874484Sbinkertn@umich.edu 1884484Sbinkertn@umich.edu s = q = e->e_u.e_ar.e_rawstrtab + offset; 1894484Sbinkertn@umich.edu r = e->e_u.e_ar.e_rawstrtab + e->e_u.e_ar.e_rawstrtabsz; 1904484Sbinkertn@umich.edu 1914484Sbinkertn@umich.edu for (s = q; s < r && *s != '/'; s++) 1924484Sbinkertn@umich.edu ; 1934484Sbinkertn@umich.edu len = s - q + 1; /* space for the trailing NUL */ 1944484Sbinkertn@umich.edu 1954484Sbinkertn@umich.edu if ((s = malloc(len)) == NULL) { 1964484Sbinkertn@umich.edu LIBELF_SET_ERROR(RESOURCE, 0); 1974484Sbinkertn@umich.edu return (NULL); 1984484Sbinkertn@umich.edu } 1994484Sbinkertn@umich.edu 2004484Sbinkertn@umich.edu (void) strncpy(s, q, len); 2014484Sbinkertn@umich.edu s[len - 1] = '\0'; 2024484Sbinkertn@umich.edu 2034484Sbinkertn@umich.edu return (s); 2044484Sbinkertn@umich.edu } 2054484Sbinkertn@umich.edu 2064484Sbinkertn@umich.edu /* 2074484Sbinkertn@umich.edu * Normal 'name' 2084484Sbinkertn@umich.edu */ 2094484Sbinkertn@umich.edu return (_libelf_ar_get_string(buf, bufsize, 0)); 2104484Sbinkertn@umich.edu} 2114484Sbinkertn@umich.edu 2124484Sbinkertn@umich.edu 2134484Sbinkertn@umich.eduElf_Arhdr * 2144484Sbinkertn@umich.edu_libelf_ar_gethdr(Elf *e) 2154484Sbinkertn@umich.edu{ 2164484Sbinkertn@umich.edu Elf *parent; 2174484Sbinkertn@umich.edu struct ar_hdr *arh; 2184484Sbinkertn@umich.edu Elf_Arhdr *eh; 2194484Sbinkertn@umich.edu size_t n; 2204484Sbinkertn@umich.edu 2214484Sbinkertn@umich.edu if ((parent = e->e_parent) == NULL) { 2224484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARGUMENT, 0); 2234484Sbinkertn@umich.edu return (NULL); 2244484Sbinkertn@umich.edu } 2254484Sbinkertn@umich.edu 2264484Sbinkertn@umich.edu arh = (struct ar_hdr *) ((uintptr_t) e->e_rawfile - sizeof(struct ar_hdr)); 2274484Sbinkertn@umich.edu 2284484Sbinkertn@umich.edu assert((uintptr_t) arh >= (uintptr_t) parent->e_rawfile + SARMAG); 2294484Sbinkertn@umich.edu assert((uintptr_t) arh <= (uintptr_t) parent->e_rawfile + parent->e_rawsize - 2304484Sbinkertn@umich.edu sizeof(struct ar_hdr)); 2314484Sbinkertn@umich.edu 2324484Sbinkertn@umich.edu if ((eh = malloc(sizeof(Elf_Arhdr))) == NULL) { 2334484Sbinkertn@umich.edu LIBELF_SET_ERROR(RESOURCE, 0); 2344484Sbinkertn@umich.edu return (NULL); 2354484Sbinkertn@umich.edu } 2364484Sbinkertn@umich.edu 2374484Sbinkertn@umich.edu e->e_arhdr = eh; 2384484Sbinkertn@umich.edu eh->ar_name = eh->ar_rawname = NULL; 2394484Sbinkertn@umich.edu 2404484Sbinkertn@umich.edu if ((eh->ar_name = _libelf_ar_get_name(arh->ar_name, sizeof(arh->ar_name), 2414484Sbinkertn@umich.edu parent)) == NULL) 2424484Sbinkertn@umich.edu goto error; 2434484Sbinkertn@umich.edu 2444484Sbinkertn@umich.edu if (_libelf_ar_get_number(arh->ar_uid, sizeof(arh->ar_uid), 10, &n) == 0) 2454484Sbinkertn@umich.edu goto error; 2464484Sbinkertn@umich.edu eh->ar_uid = (uid_t) n; 2474484Sbinkertn@umich.edu 2484484Sbinkertn@umich.edu if (_libelf_ar_get_number(arh->ar_gid, sizeof(arh->ar_gid), 10, &n) == 0) 2494484Sbinkertn@umich.edu goto error; 2504484Sbinkertn@umich.edu eh->ar_gid = (gid_t) n; 2514484Sbinkertn@umich.edu 2524484Sbinkertn@umich.edu if (_libelf_ar_get_number(arh->ar_mode, sizeof(arh->ar_mode), 8, &n) == 0) 2534484Sbinkertn@umich.edu goto error; 2544484Sbinkertn@umich.edu eh->ar_mode = (mode_t) n; 2554484Sbinkertn@umich.edu 2564484Sbinkertn@umich.edu if (_libelf_ar_get_number(arh->ar_size, sizeof(arh->ar_size), 10, &n) == 0) 2574484Sbinkertn@umich.edu goto error; 2584484Sbinkertn@umich.edu eh->ar_size = n; 2594484Sbinkertn@umich.edu 2604484Sbinkertn@umich.edu if ((eh->ar_rawname = _libelf_ar_get_string(arh->ar_name, 2614484Sbinkertn@umich.edu sizeof(arh->ar_name), 1)) == NULL) 2624484Sbinkertn@umich.edu goto error; 2634484Sbinkertn@umich.edu 2644484Sbinkertn@umich.edu return (eh); 2654484Sbinkertn@umich.edu 2664484Sbinkertn@umich.edu error: 2674484Sbinkertn@umich.edu if (eh) { 2684484Sbinkertn@umich.edu if (eh->ar_name) 2694484Sbinkertn@umich.edu free(eh->ar_name); 2704484Sbinkertn@umich.edu if (eh->ar_rawname) 2714484Sbinkertn@umich.edu free(eh->ar_rawname); 2724484Sbinkertn@umich.edu free(eh); 2734484Sbinkertn@umich.edu } 2744484Sbinkertn@umich.edu e->e_arhdr = NULL; 2754484Sbinkertn@umich.edu 2764484Sbinkertn@umich.edu return (NULL); 2774484Sbinkertn@umich.edu} 2784484Sbinkertn@umich.edu 2794484Sbinkertn@umich.eduElf * 2804484Sbinkertn@umich.edu_libelf_ar_open_member(int fd, Elf_Cmd c, Elf *elf) 2814484Sbinkertn@umich.edu{ 2824484Sbinkertn@umich.edu Elf *e; 2834484Sbinkertn@umich.edu off_t next; 2844484Sbinkertn@umich.edu struct ar_hdr *arh; 2854484Sbinkertn@umich.edu size_t sz; 2864484Sbinkertn@umich.edu 2874484Sbinkertn@umich.edu assert(elf->e_kind == ELF_K_AR); 2884484Sbinkertn@umich.edu 2894484Sbinkertn@umich.edu next = elf->e_u.e_ar.e_next; 2904484Sbinkertn@umich.edu 2914484Sbinkertn@umich.edu /* 2924484Sbinkertn@umich.edu * `next' is only set to zero by elf_next() when the last 2934484Sbinkertn@umich.edu * member of an archive is processed. 2944484Sbinkertn@umich.edu */ 2954484Sbinkertn@umich.edu if (next == (off_t) 0) 2964484Sbinkertn@umich.edu return (NULL); 2974484Sbinkertn@umich.edu 2984484Sbinkertn@umich.edu assert((next & 1) == 0); 2994484Sbinkertn@umich.edu 3004484Sbinkertn@umich.edu arh = (struct ar_hdr *) (elf->e_rawfile + next); 3014484Sbinkertn@umich.edu 3024484Sbinkertn@umich.edu if (_libelf_ar_get_number(arh->ar_size, sizeof(arh->ar_size), 10, &sz) == 0) { 3034484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 3044484Sbinkertn@umich.edu return (NULL); 3054484Sbinkertn@umich.edu } 3064484Sbinkertn@umich.edu 3074484Sbinkertn@umich.edu assert(sz > 0); 3084484Sbinkertn@umich.edu 3094484Sbinkertn@umich.edu arh++; /* skip over archive member header */ 3104484Sbinkertn@umich.edu 3114484Sbinkertn@umich.edu if ((e = elf_memory((char *) arh, sz)) == NULL) 3124484Sbinkertn@umich.edu return (NULL); 3134484Sbinkertn@umich.edu 3144484Sbinkertn@umich.edu e->e_fd = fd; 3154484Sbinkertn@umich.edu e->e_cmd = c; 3164484Sbinkertn@umich.edu 3174484Sbinkertn@umich.edu elf->e_u.e_ar.e_nchildren++; 3184484Sbinkertn@umich.edu e->e_parent = elf; 3194484Sbinkertn@umich.edu 3204484Sbinkertn@umich.edu return (e); 3214484Sbinkertn@umich.edu} 3224484Sbinkertn@umich.edu 3234484Sbinkertn@umich.eduElf * 3244484Sbinkertn@umich.edu_libelf_ar_open(Elf *e) 3254484Sbinkertn@umich.edu{ 3264484Sbinkertn@umich.edu int i; 3274484Sbinkertn@umich.edu char *s, *end; 3284484Sbinkertn@umich.edu size_t sz; 3294484Sbinkertn@umich.edu struct ar_hdr arh; 3304484Sbinkertn@umich.edu 3314484Sbinkertn@umich.edu e->e_kind = ELF_K_AR; 3324484Sbinkertn@umich.edu e->e_u.e_ar.e_nchildren = 0; 3334484Sbinkertn@umich.edu e->e_u.e_ar.e_next = (off_t) -1; 3344484Sbinkertn@umich.edu 3354484Sbinkertn@umich.edu /* 3364484Sbinkertn@umich.edu * Look for special members. 3374484Sbinkertn@umich.edu */ 3384484Sbinkertn@umich.edu 3394484Sbinkertn@umich.edu s = e->e_rawfile + SARMAG; 3404484Sbinkertn@umich.edu end = e->e_rawfile + e->e_rawsize; 3414484Sbinkertn@umich.edu 3424484Sbinkertn@umich.edu assert(e->e_rawsize > 0); 3434484Sbinkertn@umich.edu 3444484Sbinkertn@umich.edu /* 3454484Sbinkertn@umich.edu * Look for magic names "/ " and "// " in the first two entries 3464484Sbinkertn@umich.edu * of the archive. 3474484Sbinkertn@umich.edu */ 3484484Sbinkertn@umich.edu for (i = 0; i < 2; i++) { 3494484Sbinkertn@umich.edu 3504484Sbinkertn@umich.edu if (s + sizeof(arh) > end) { 3514484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 3524484Sbinkertn@umich.edu return (NULL); 3534484Sbinkertn@umich.edu } 3544484Sbinkertn@umich.edu 3554484Sbinkertn@umich.edu (void) memcpy(&arh, s, sizeof(arh)); 3564484Sbinkertn@umich.edu 3574484Sbinkertn@umich.edu if (arh.ar_fmag[0] != '`' || arh.ar_fmag[1] != '\n') { 3584484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 3594484Sbinkertn@umich.edu return (NULL); 3604484Sbinkertn@umich.edu } 3614484Sbinkertn@umich.edu 3624484Sbinkertn@umich.edu if (arh.ar_name[0] != '/') /* not a special symbol */ 3634484Sbinkertn@umich.edu break; 3644484Sbinkertn@umich.edu 3654484Sbinkertn@umich.edu if (_libelf_ar_get_number(arh.ar_size, sizeof(arh.ar_size), 10, &sz) == 0) { 3664484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 3674484Sbinkertn@umich.edu return (NULL); 3684484Sbinkertn@umich.edu } 3694484Sbinkertn@umich.edu 3704484Sbinkertn@umich.edu assert(sz > 0); 3714484Sbinkertn@umich.edu 3724484Sbinkertn@umich.edu s += sizeof(arh); 3734484Sbinkertn@umich.edu 3744484Sbinkertn@umich.edu if (arh.ar_name[1] == ' ') { /* "/ " => symbol table */ 3754484Sbinkertn@umich.edu 3764484Sbinkertn@umich.edu e->e_u.e_ar.e_rawsymtab = s; 3774484Sbinkertn@umich.edu e->e_u.e_ar.e_rawsymtabsz = sz; 3784484Sbinkertn@umich.edu 3794484Sbinkertn@umich.edu } else if (arh.ar_name[1] == '/' && arh.ar_name[2] == ' ') { 3804484Sbinkertn@umich.edu 3814484Sbinkertn@umich.edu /* "// " => string table for long file names */ 3824484Sbinkertn@umich.edu e->e_u.e_ar.e_rawstrtab = s; 3834484Sbinkertn@umich.edu e->e_u.e_ar.e_rawstrtabsz = sz; 3844484Sbinkertn@umich.edu } 3854484Sbinkertn@umich.edu 3864484Sbinkertn@umich.edu sz = LIBELF_ADJUST_AR_SIZE(sz); 3874484Sbinkertn@umich.edu 3884484Sbinkertn@umich.edu s += sz; 3894484Sbinkertn@umich.edu } 3904484Sbinkertn@umich.edu 3914484Sbinkertn@umich.edu e->e_u.e_ar.e_next = (off_t) (s - e->e_rawfile); 3924484Sbinkertn@umich.edu 3934484Sbinkertn@umich.edu return (e); 3944484Sbinkertn@umich.edu} 3954484Sbinkertn@umich.edu 3964484Sbinkertn@umich.edu/* 3974484Sbinkertn@umich.edu * An ar(1) symbol table has the following layout: 3984484Sbinkertn@umich.edu * 3994484Sbinkertn@umich.edu * The first 4 bytes are a binary count of the number of entries in the 4004484Sbinkertn@umich.edu * symbol table, stored MSB-first. 4014484Sbinkertn@umich.edu * 4024484Sbinkertn@umich.edu * Then there are 'n' 4-byte binary offsets, also stored MSB first. 4034484Sbinkertn@umich.edu * 4044484Sbinkertn@umich.edu * Following this, there are 'n' null-terminated strings. 4054484Sbinkertn@umich.edu */ 4064484Sbinkertn@umich.edu 4074484Sbinkertn@umich.edu#define GET_WORD(P, V) do { \ 4084484Sbinkertn@umich.edu (V) = 0; \ 4094484Sbinkertn@umich.edu (V) = (P)[0]; (V) <<= 8; \ 4104484Sbinkertn@umich.edu (V) += (P)[1]; (V) <<= 8; \ 4114484Sbinkertn@umich.edu (V) += (P)[2]; (V) <<= 8; \ 4124484Sbinkertn@umich.edu (V) += (P)[3]; \ 4134484Sbinkertn@umich.edu } while (0) 4144484Sbinkertn@umich.edu 4154484Sbinkertn@umich.edu#define INTSZ 4 4164484Sbinkertn@umich.edu 4174484Sbinkertn@umich.eduElf_Arsym * 4184484Sbinkertn@umich.edu_libelf_ar_process_symtab(Elf *e, size_t *count) 4194484Sbinkertn@umich.edu{ 4204484Sbinkertn@umich.edu size_t n, nentries, off; 4214484Sbinkertn@umich.edu Elf_Arsym *symtab, *sym; 4224484Sbinkertn@umich.edu char *p, *s, *end; 4234484Sbinkertn@umich.edu 4244484Sbinkertn@umich.edu assert(e != NULL); 4254484Sbinkertn@umich.edu assert(count != NULL); 4264484Sbinkertn@umich.edu 4274484Sbinkertn@umich.edu if (e->e_u.e_ar.e_rawsymtabsz < INTSZ) { 4284484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 4294484Sbinkertn@umich.edu return (NULL); 4304484Sbinkertn@umich.edu } 4314484Sbinkertn@umich.edu 4324484Sbinkertn@umich.edu p = e->e_u.e_ar.e_rawsymtab; 4334484Sbinkertn@umich.edu end = p + e->e_u.e_ar.e_rawsymtabsz; 4344484Sbinkertn@umich.edu 4354484Sbinkertn@umich.edu GET_WORD(p, nentries); 4364484Sbinkertn@umich.edu p += INTSZ; 4374484Sbinkertn@umich.edu 4384484Sbinkertn@umich.edu if (nentries == 0 || p + nentries * INTSZ >= end) { 4394484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 4404484Sbinkertn@umich.edu return (NULL); 4414484Sbinkertn@umich.edu } 4424484Sbinkertn@umich.edu 4434484Sbinkertn@umich.edu /* Allocate space for a nentries + a sentinel. */ 4444484Sbinkertn@umich.edu if ((symtab = malloc(sizeof(Elf_Arsym) * (nentries+1))) == NULL) { 4454484Sbinkertn@umich.edu LIBELF_SET_ERROR(RESOURCE, 0); 4464484Sbinkertn@umich.edu return (NULL); 4474484Sbinkertn@umich.edu } 4484484Sbinkertn@umich.edu 4494484Sbinkertn@umich.edu s = p + (nentries * INTSZ); /* start of the string table. */ 4504484Sbinkertn@umich.edu 4514484Sbinkertn@umich.edu for (n = nentries, sym = symtab; n > 0; n--) { 4524484Sbinkertn@umich.edu off = 0; 4534484Sbinkertn@umich.edu 4544484Sbinkertn@umich.edu GET_WORD(p, off); 4554484Sbinkertn@umich.edu 4564484Sbinkertn@umich.edu sym->as_off = off; 4574484Sbinkertn@umich.edu sym->as_hash = elf_hash(s); 4584484Sbinkertn@umich.edu sym->as_name = s; 4594484Sbinkertn@umich.edu 4604484Sbinkertn@umich.edu p += INTSZ; 4614484Sbinkertn@umich.edu sym++; 4624484Sbinkertn@umich.edu 4634484Sbinkertn@umich.edu for (; s < end && *s++ != '\0';) /* skip to next string */ 4644484Sbinkertn@umich.edu ; 4654484Sbinkertn@umich.edu if (s > end) { 4664484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARCHIVE, 0); 4674484Sbinkertn@umich.edu free(symtab); 4684484Sbinkertn@umich.edu return (NULL); 4694484Sbinkertn@umich.edu } 4704484Sbinkertn@umich.edu } 4714484Sbinkertn@umich.edu 4724484Sbinkertn@umich.edu /* Fill up the sentinel entry. */ 4734484Sbinkertn@umich.edu sym->as_name = NULL; 4744484Sbinkertn@umich.edu sym->as_hash = ~0UL; 4754484Sbinkertn@umich.edu sym->as_off = (off_t) 0; 4764484Sbinkertn@umich.edu 4774484Sbinkertn@umich.edu *count = e->e_u.e_ar.e_symtabsz = nentries + 1; 4784484Sbinkertn@umich.edu e->e_u.e_ar.e_symtab = symtab; 4794484Sbinkertn@umich.edu 4804484Sbinkertn@umich.edu return (symtab); 4814484Sbinkertn@umich.edu} 482