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
31 #include <sys/cdefs.h>
41 ELFTC_VCSID("$Id: libelf_allocate.c 2272 2011-12-03 17:07:31Z jkoshy $");
44 _libelf_allocate_elf(void)
48 if ((e = malloc(sizeof(*e))) == NULL) {
49 LIBELF_SET_ERROR(RESOURCE, errno);
54 e->e_hdr.e_rawhdr = NULL;
55 e->e_byteorder = ELFDATANONE;
56 e->e_class = ELFCLASSNONE;
57 e->e_cmd = ELF_C_NULL;
60 e->e_kind = ELF_K_NONE;
64 e->e_version = LIBELF_PRIVATE(version);
66 (void) memset(&e->e_u, 0, sizeof(e->e_u));
72 _libelf_init_elf(Elf *e, Elf_Kind kind)
75 assert(e->e_kind == ELF_K_NONE);
81 STAILQ_INIT(&e->e_u.e_elf.e_scn);
88 #define FREE(P) do { \
95 _libelf_release_elf(Elf *e)
101 FREE(e->e_u.e_ar.e_symtab);
105 switch (e->e_class) {
107 FREE(e->e_u.e_elf.e_ehdr.e_ehdr32);
108 FREE(e->e_u.e_elf.e_phdr.e_phdr32);
111 FREE(e->e_u.e_elf.e_ehdr.e_ehdr64);
112 FREE(e->e_u.e_elf.e_phdr.e_phdr64);
116 assert(STAILQ_EMPTY(&e->e_u.e_elf.e_scn));
118 if (e->e_flags & LIBELF_F_AR_HEADER) {
119 arh = e->e_hdr.e_arhdr;
121 FREE(arh->ar_rawname);
136 struct _Libelf_Data *
137 _libelf_allocate_data(Elf_Scn *s)
139 struct _Libelf_Data *d;
141 if ((d = calloc((size_t) 1, sizeof(*d))) == NULL) {
142 LIBELF_SET_ERROR(RESOURCE, 0);
151 struct _Libelf_Data *
152 _libelf_release_data(struct _Libelf_Data *d)
155 if (d->d_flags & LIBELF_F_DATA_MALLOCED)
156 free(d->d_data.d_buf);
164 _libelf_allocate_scn(Elf *e, size_t ndx)
168 if ((s = calloc((size_t) 1, sizeof(Elf_Scn))) == NULL) {
169 LIBELF_SET_ERROR(RESOURCE, errno);
176 STAILQ_INIT(&s->s_data);
177 STAILQ_INIT(&s->s_rawdata);
179 STAILQ_INSERT_TAIL(&e->e_u.e_elf.e_scn, s, s_next);
185 _libelf_release_scn(Elf_Scn *s)
188 struct _Libelf_Data *d, *td;
192 STAILQ_FOREACH_SAFE(d, &s->s_data, d_next, td) {
193 STAILQ_REMOVE(&s->s_data, d, _Libelf_Data, d_next);
194 d = _libelf_release_data(d);
197 STAILQ_FOREACH_SAFE(d, &s->s_rawdata, d_next, td) {
198 assert((d->d_flags & LIBELF_F_DATA_MALLOCED) == 0);
199 STAILQ_REMOVE(&s->s_rawdata, d, _Libelf_Data, d_next);
200 d = _libelf_release_data(d);
207 STAILQ_REMOVE(&e->e_u.e_elf.e_scn, s, _Elf_Scn, s_next);