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/* 284484Sbinkertn@umich.edu * Internal APIs 294484Sbinkertn@umich.edu */ 304484Sbinkertn@umich.edu 314494Ssaidi@eecs.umich.edu#include <errno.h> 324484Sbinkertn@umich.edu 334484Sbinkertn@umich.edu#include <assert.h> 344484Sbinkertn@umich.edu#include "libelf.h" 354484Sbinkertn@umich.edu#include <stdlib.h> 364484Sbinkertn@umich.edu#include <string.h> 374484Sbinkertn@umich.edu 384484Sbinkertn@umich.edu#include "_libelf.h" 394484Sbinkertn@umich.edu 404484Sbinkertn@umich.eduElf * 414484Sbinkertn@umich.edu_libelf_allocate_elf(void) 424484Sbinkertn@umich.edu{ 434484Sbinkertn@umich.edu Elf *e; 444484Sbinkertn@umich.edu 454484Sbinkertn@umich.edu if ((e = malloc(sizeof(*e))) == NULL) { 464484Sbinkertn@umich.edu LIBELF_SET_ERROR(RESOURCE, errno); 474484Sbinkertn@umich.edu return NULL; 484484Sbinkertn@umich.edu } 494484Sbinkertn@umich.edu 504484Sbinkertn@umich.edu e->e_activations = 1; 514484Sbinkertn@umich.edu e->e_arhdr = NULL; 524484Sbinkertn@umich.edu e->e_byteorder = ELFDATANONE; 534484Sbinkertn@umich.edu e->e_class = ELFCLASSNONE; 544484Sbinkertn@umich.edu e->e_cmd = ELF_C_NULL; 554484Sbinkertn@umich.edu e->e_fd = -1; 564484Sbinkertn@umich.edu e->e_flags = 0; 574484Sbinkertn@umich.edu e->e_kind = ELF_K_NONE; 584484Sbinkertn@umich.edu e->e_parent = NULL; 594484Sbinkertn@umich.edu e->e_rawfile = NULL; 604484Sbinkertn@umich.edu e->e_rawsize = 0; 614484Sbinkertn@umich.edu e->e_version = LIBELF_PRIVATE(version); 624484Sbinkertn@umich.edu 634484Sbinkertn@umich.edu (void) memset(&e->e_u, 0, sizeof(e->e_u)); 644484Sbinkertn@umich.edu 654484Sbinkertn@umich.edu return (e); 664484Sbinkertn@umich.edu} 674484Sbinkertn@umich.edu 684484Sbinkertn@umich.eduvoid 694484Sbinkertn@umich.edu_libelf_init_elf(Elf *e, Elf_Kind kind) 704484Sbinkertn@umich.edu{ 714484Sbinkertn@umich.edu assert(e != NULL); 724484Sbinkertn@umich.edu assert(e->e_kind == ELF_K_NONE); 734484Sbinkertn@umich.edu 744484Sbinkertn@umich.edu e->e_kind = kind; 754484Sbinkertn@umich.edu 764484Sbinkertn@umich.edu switch (kind) { 774484Sbinkertn@umich.edu case ELF_K_ELF: 784484Sbinkertn@umich.edu STAILQ_INIT(&e->e_u.e_elf.e_scn); 794484Sbinkertn@umich.edu break; 804484Sbinkertn@umich.edu default: 814484Sbinkertn@umich.edu break; 824484Sbinkertn@umich.edu } 834484Sbinkertn@umich.edu} 844484Sbinkertn@umich.edu 854484Sbinkertn@umich.edu#define FREE(P) do { \ 864484Sbinkertn@umich.edu if (P) \ 874484Sbinkertn@umich.edu free(P); \ 884484Sbinkertn@umich.edu } while (0) 894484Sbinkertn@umich.edu 904484Sbinkertn@umich.edu 914484Sbinkertn@umich.eduElf * 924484Sbinkertn@umich.edu_libelf_release_elf(Elf *e) 934484Sbinkertn@umich.edu{ 944484Sbinkertn@umich.edu switch (e->e_kind) { 954484Sbinkertn@umich.edu case ELF_K_AR: 964484Sbinkertn@umich.edu FREE(e->e_u.e_ar.e_symtab); 974484Sbinkertn@umich.edu break; 984484Sbinkertn@umich.edu 994484Sbinkertn@umich.edu case ELF_K_ELF: 1004484Sbinkertn@umich.edu switch (e->e_class) { 1014484Sbinkertn@umich.edu case ELFCLASS32: 1024484Sbinkertn@umich.edu FREE(e->e_u.e_elf.e_ehdr.e_ehdr32); 1034484Sbinkertn@umich.edu FREE(e->e_u.e_elf.e_phdr.e_phdr32); 1044484Sbinkertn@umich.edu break; 1054484Sbinkertn@umich.edu case ELFCLASS64: 1064484Sbinkertn@umich.edu FREE(e->e_u.e_elf.e_ehdr.e_ehdr64); 1074484Sbinkertn@umich.edu FREE(e->e_u.e_elf.e_phdr.e_phdr64); 1084484Sbinkertn@umich.edu break; 1094484Sbinkertn@umich.edu } 1104484Sbinkertn@umich.edu 1114484Sbinkertn@umich.edu assert(STAILQ_EMPTY(&e->e_u.e_elf.e_scn)); 1124484Sbinkertn@umich.edu 1134484Sbinkertn@umich.edu if (e->e_arhdr) { 1144484Sbinkertn@umich.edu FREE(e->e_arhdr->ar_name); 1154484Sbinkertn@umich.edu FREE(e->e_arhdr->ar_rawname); 1164484Sbinkertn@umich.edu free(e->e_arhdr); 1174484Sbinkertn@umich.edu } 1184484Sbinkertn@umich.edu 1194484Sbinkertn@umich.edu break; 1204484Sbinkertn@umich.edu 1214484Sbinkertn@umich.edu default: 1224484Sbinkertn@umich.edu break; 1234484Sbinkertn@umich.edu } 1244484Sbinkertn@umich.edu 1254484Sbinkertn@umich.edu free(e); 1264484Sbinkertn@umich.edu 1274484Sbinkertn@umich.edu return (NULL); 1284484Sbinkertn@umich.edu} 1294484Sbinkertn@umich.edu 1304484Sbinkertn@umich.eduElf_Data * 1314484Sbinkertn@umich.edu_libelf_allocate_data(Elf_Scn *s) 1324484Sbinkertn@umich.edu{ 1334484Sbinkertn@umich.edu Elf_Data *d; 1344484Sbinkertn@umich.edu 1354484Sbinkertn@umich.edu if ((d = calloc((size_t) 1, sizeof(Elf_Data))) == NULL) { 1364484Sbinkertn@umich.edu LIBELF_SET_ERROR(RESOURCE, 0); 1374484Sbinkertn@umich.edu return (NULL); 1384484Sbinkertn@umich.edu } 1394484Sbinkertn@umich.edu 1404484Sbinkertn@umich.edu d->d_scn = s; 1414484Sbinkertn@umich.edu 1424484Sbinkertn@umich.edu return (d); 1434484Sbinkertn@umich.edu} 1444484Sbinkertn@umich.edu 1454484Sbinkertn@umich.eduElf_Data * 1464484Sbinkertn@umich.edu_libelf_release_data(Elf_Data *d) 1474484Sbinkertn@umich.edu{ 1484484Sbinkertn@umich.edu 1494484Sbinkertn@umich.edu if (d->d_flags & LIBELF_F_MALLOCED) 1504484Sbinkertn@umich.edu free(d->d_buf); 1514484Sbinkertn@umich.edu 1524484Sbinkertn@umich.edu free(d); 1534484Sbinkertn@umich.edu 1544484Sbinkertn@umich.edu return (NULL); 1554484Sbinkertn@umich.edu} 1564484Sbinkertn@umich.edu 1574484Sbinkertn@umich.eduElf_Scn * 1584484Sbinkertn@umich.edu_libelf_allocate_scn(Elf *e, size_t ndx) 1594484Sbinkertn@umich.edu{ 1604484Sbinkertn@umich.edu Elf_Scn *s; 1614484Sbinkertn@umich.edu 1624484Sbinkertn@umich.edu if ((s = calloc((size_t) 1, sizeof(Elf_Scn))) == NULL) { 1634484Sbinkertn@umich.edu LIBELF_SET_ERROR(RESOURCE, errno); 1644484Sbinkertn@umich.edu return (NULL); 1654484Sbinkertn@umich.edu } 1664484Sbinkertn@umich.edu 1674484Sbinkertn@umich.edu s->s_elf = e; 1684484Sbinkertn@umich.edu s->s_ndx = ndx; 1694484Sbinkertn@umich.edu 1704484Sbinkertn@umich.edu STAILQ_INIT(&s->s_data); 1714484Sbinkertn@umich.edu STAILQ_INIT(&s->s_rawdata); 1724484Sbinkertn@umich.edu 1734484Sbinkertn@umich.edu STAILQ_INSERT_TAIL(&e->e_u.e_elf.e_scn, s, s_next); 1744484Sbinkertn@umich.edu 1754484Sbinkertn@umich.edu return (s); 1764484Sbinkertn@umich.edu} 1774484Sbinkertn@umich.edu 1784484Sbinkertn@umich.eduElf_Scn * 1794484Sbinkertn@umich.edu_libelf_release_scn(Elf_Scn *s) 1804484Sbinkertn@umich.edu{ 1814484Sbinkertn@umich.edu Elf *e; 1824484Sbinkertn@umich.edu Elf_Data *d, *td; 1834484Sbinkertn@umich.edu 1844484Sbinkertn@umich.edu assert(s != NULL); 1854484Sbinkertn@umich.edu 1864484Sbinkertn@umich.edu STAILQ_FOREACH_SAFE(d, &s->s_data, d_next, td) { 1874484Sbinkertn@umich.edu STAILQ_REMOVE(&s->s_data, d, _Elf_Data, d_next); 1884484Sbinkertn@umich.edu d = _libelf_release_data(d); 1894484Sbinkertn@umich.edu } 1904484Sbinkertn@umich.edu 1914484Sbinkertn@umich.edu STAILQ_FOREACH_SAFE(d, &s->s_rawdata, d_next, td) { 1924484Sbinkertn@umich.edu assert((d->d_flags & LIBELF_F_MALLOCED) == 0); 1934484Sbinkertn@umich.edu STAILQ_REMOVE(&s->s_rawdata, d, _Elf_Data, d_next); 1944484Sbinkertn@umich.edu d = _libelf_release_data(d); 1954484Sbinkertn@umich.edu } 1964484Sbinkertn@umich.edu 1974484Sbinkertn@umich.edu e = s->s_elf; 1984484Sbinkertn@umich.edu 1994484Sbinkertn@umich.edu assert(e != NULL); 2004484Sbinkertn@umich.edu 2014484Sbinkertn@umich.edu STAILQ_REMOVE(&e->e_u.e_elf.e_scn, s, _Elf_Scn, s_next); 2024484Sbinkertn@umich.edu 2034484Sbinkertn@umich.edu free(s); 2044484Sbinkertn@umich.edu 2054484Sbinkertn@umich.edu return (NULL); 2064484Sbinkertn@umich.edu} 207