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
39 ELFTC_VCSID("$Id: libelf_allocate.c 3174 2015-03-27 17:13:41Z emaste $");
42 _libelf_allocate_elf(void)
46 if ((e = malloc(sizeof(*e))) == NULL) {
47 LIBELF_SET_ERROR(RESOURCE, errno);
52 e->e_hdr.e_rawhdr = NULL;
53 e->e_byteorder = ELFDATANONE;
54 e->e_class = ELFCLASSNONE;
55 e->e_cmd = ELF_C_NULL;
58 e->e_kind = ELF_K_NONE;
62 e->e_version = LIBELF_PRIVATE(version);
64 (void) memset(&e->e_u, 0, sizeof(e->e_u));
70 _libelf_init_elf(Elf *e, Elf_Kind kind)
73 assert(e->e_kind == ELF_K_NONE);
79 STAILQ_INIT(&e->e_u.e_elf.e_scn);
86 #define FREE(P) do { \
93 _libelf_release_elf(Elf *e)
99 FREE(e->e_u.e_ar.e_symtab);
103 switch (e->e_class) {
105 FREE(e->e_u.e_elf.e_ehdr.e_ehdr32);
106 FREE(e->e_u.e_elf.e_phdr.e_phdr32);
109 FREE(e->e_u.e_elf.e_ehdr.e_ehdr64);
110 FREE(e->e_u.e_elf.e_phdr.e_phdr64);
114 assert(STAILQ_EMPTY(&e->e_u.e_elf.e_scn));
116 if (e->e_flags & LIBELF_F_AR_HEADER) {
117 arh = e->e_hdr.e_arhdr;
119 FREE(arh->ar_rawname);
134 struct _Libelf_Data *
135 _libelf_allocate_data(Elf_Scn *s)
137 struct _Libelf_Data *d;
139 if ((d = calloc((size_t) 1, sizeof(*d))) == NULL) {
140 LIBELF_SET_ERROR(RESOURCE, 0);
149 struct _Libelf_Data *
150 _libelf_release_data(struct _Libelf_Data *d)
153 if (d->d_flags & LIBELF_F_DATA_MALLOCED)
154 free(d->d_data.d_buf);
162 _libelf_allocate_scn(Elf *e, size_t ndx)
166 if ((s = calloc((size_t) 1, sizeof(Elf_Scn))) == NULL) {
167 LIBELF_SET_ERROR(RESOURCE, errno);
174 STAILQ_INIT(&s->s_data);
175 STAILQ_INIT(&s->s_rawdata);
177 STAILQ_INSERT_TAIL(&e->e_u.e_elf.e_scn, s, s_next);
183 _libelf_release_scn(Elf_Scn *s)
186 struct _Libelf_Data *d, *td;
190 STAILQ_FOREACH_SAFE(d, &s->s_data, d_next, td) {
191 STAILQ_REMOVE(&s->s_data, d, _Libelf_Data, d_next);
192 d = _libelf_release_data(d);
195 STAILQ_FOREACH_SAFE(d, &s->s_rawdata, d_next, td) {
196 assert((d->d_flags & LIBELF_F_DATA_MALLOCED) == 0);
197 STAILQ_REMOVE(&s->s_rawdata, d, _Libelf_Data, d_next);
198 d = _libelf_release_data(d);
205 STAILQ_REMOVE(&e->e_u.e_elf.e_scn, s, _Elf_Scn, s_next);