xref: /openbsd-src/lib/libelf/libelf_allocate.c (revision 63b9365298cb9b8f7a9d67494526f438709cd72a)
1a1b5ec25Sjsg /*-
2a1b5ec25Sjsg  * Copyright (c) 2006,2008,2010 Joseph Koshy
3a1b5ec25Sjsg  * All rights reserved.
4a1b5ec25Sjsg  *
5a1b5ec25Sjsg  * Redistribution and use in source and binary forms, with or without
6a1b5ec25Sjsg  * modification, are permitted provided that the following conditions
7a1b5ec25Sjsg  * are met:
8a1b5ec25Sjsg  * 1. Redistributions of source code must retain the above copyright
9a1b5ec25Sjsg  *    notice, this list of conditions and the following disclaimer.
10a1b5ec25Sjsg  * 2. Redistributions in binary form must reproduce the above copyright
11a1b5ec25Sjsg  *    notice, this list of conditions and the following disclaimer in the
12a1b5ec25Sjsg  *    documentation and/or other materials provided with the distribution.
13a1b5ec25Sjsg  *
14a1b5ec25Sjsg  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15a1b5ec25Sjsg  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16a1b5ec25Sjsg  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17a1b5ec25Sjsg  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18a1b5ec25Sjsg  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19a1b5ec25Sjsg  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20a1b5ec25Sjsg  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21a1b5ec25Sjsg  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22a1b5ec25Sjsg  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23a1b5ec25Sjsg  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24a1b5ec25Sjsg  * SUCH DAMAGE.
25a1b5ec25Sjsg  */
26a1b5ec25Sjsg 
27a1b5ec25Sjsg /*
28a1b5ec25Sjsg  * Internal APIs
29a1b5ec25Sjsg  */
30a1b5ec25Sjsg 
31a1b5ec25Sjsg #include <assert.h>
32a1b5ec25Sjsg #include <errno.h>
33a1b5ec25Sjsg #include <libelf.h>
34a1b5ec25Sjsg #include <stdlib.h>
35a1b5ec25Sjsg #include <string.h>
36a1b5ec25Sjsg 
37a1b5ec25Sjsg #include "_libelf.h"
38a1b5ec25Sjsg 
39*63b93652Sjsg ELFTC_VCSID("$Id: libelf_allocate.c,v 1.3 2020/05/18 06:46:23 jsg Exp $");
40a1b5ec25Sjsg 
41a1b5ec25Sjsg Elf *
_libelf_allocate_elf(void)42a1b5ec25Sjsg _libelf_allocate_elf(void)
43a1b5ec25Sjsg {
44a1b5ec25Sjsg 	Elf *e;
45a1b5ec25Sjsg 
46e219834fSjsg 	if ((e = calloc((size_t) 1, sizeof(*e))) == NULL) {
47a1b5ec25Sjsg 		LIBELF_SET_ERROR(RESOURCE, errno);
48a1b5ec25Sjsg 		return NULL;
49a1b5ec25Sjsg 	}
50a1b5ec25Sjsg 
51a1b5ec25Sjsg 	e->e_activations = 1;
52a1b5ec25Sjsg 	e->e_byteorder   = ELFDATANONE;
53a1b5ec25Sjsg 	e->e_class       = ELFCLASSNONE;
54a1b5ec25Sjsg 	e->e_cmd         = ELF_C_NULL;
55a1b5ec25Sjsg 	e->e_fd          = -1;
56a1b5ec25Sjsg 	e->e_kind        = ELF_K_NONE;
57a1b5ec25Sjsg 	e->e_version     = LIBELF_PRIVATE(version);
58a1b5ec25Sjsg 
59a1b5ec25Sjsg 	return (e);
60a1b5ec25Sjsg }
61a1b5ec25Sjsg 
62a1b5ec25Sjsg void
_libelf_init_elf(Elf * e,Elf_Kind kind)63a1b5ec25Sjsg _libelf_init_elf(Elf *e, Elf_Kind kind)
64a1b5ec25Sjsg {
65a1b5ec25Sjsg 	assert(e != NULL);
66a1b5ec25Sjsg 	assert(e->e_kind == ELF_K_NONE);
67a1b5ec25Sjsg 
68a1b5ec25Sjsg 	e->e_kind = kind;
69a1b5ec25Sjsg 
70a1b5ec25Sjsg 	switch (kind) {
71a1b5ec25Sjsg 	case ELF_K_ELF:
72a1b5ec25Sjsg 		STAILQ_INIT(&e->e_u.e_elf.e_scn);
73a1b5ec25Sjsg 		break;
74a1b5ec25Sjsg 	default:
75a1b5ec25Sjsg 		break;
76a1b5ec25Sjsg 	}
77a1b5ec25Sjsg }
78a1b5ec25Sjsg 
79*63b93652Sjsg void
_libelf_release_elf(Elf * e)80a1b5ec25Sjsg _libelf_release_elf(Elf *e)
81a1b5ec25Sjsg {
82a1b5ec25Sjsg 	Elf_Arhdr *arh;
83a1b5ec25Sjsg 
84a1b5ec25Sjsg 	switch (e->e_kind) {
85a1b5ec25Sjsg 	case ELF_K_AR:
86e219834fSjsg 		free(e->e_u.e_ar.e_symtab);
87a1b5ec25Sjsg 		break;
88a1b5ec25Sjsg 
89a1b5ec25Sjsg 	case ELF_K_ELF:
90a1b5ec25Sjsg 		switch (e->e_class) {
91a1b5ec25Sjsg 		case ELFCLASS32:
92e219834fSjsg 			free(e->e_u.e_elf.e_ehdr.e_ehdr32);
93e219834fSjsg 			free(e->e_u.e_elf.e_phdr.e_phdr32);
94a1b5ec25Sjsg 			break;
95a1b5ec25Sjsg 		case ELFCLASS64:
96e219834fSjsg 			free(e->e_u.e_elf.e_ehdr.e_ehdr64);
97e219834fSjsg 			free(e->e_u.e_elf.e_phdr.e_phdr64);
98a1b5ec25Sjsg 			break;
99a1b5ec25Sjsg 		}
100a1b5ec25Sjsg 
101a1b5ec25Sjsg 		assert(STAILQ_EMPTY(&e->e_u.e_elf.e_scn));
102a1b5ec25Sjsg 
103a1b5ec25Sjsg 		if (e->e_flags & LIBELF_F_AR_HEADER) {
104a1b5ec25Sjsg 			arh = e->e_hdr.e_arhdr;
105e219834fSjsg 			free(arh->ar_name);
106e219834fSjsg 			free(arh->ar_rawname);
107a1b5ec25Sjsg 			free(arh);
108a1b5ec25Sjsg 		}
109a1b5ec25Sjsg 
110a1b5ec25Sjsg 		break;
111a1b5ec25Sjsg 
112a1b5ec25Sjsg 	default:
113a1b5ec25Sjsg 		break;
114a1b5ec25Sjsg 	}
115a1b5ec25Sjsg 
116a1b5ec25Sjsg 	free(e);
117a1b5ec25Sjsg }
118a1b5ec25Sjsg 
119a1b5ec25Sjsg struct _Libelf_Data *
_libelf_allocate_data(Elf_Scn * s)120a1b5ec25Sjsg _libelf_allocate_data(Elf_Scn *s)
121a1b5ec25Sjsg {
122a1b5ec25Sjsg 	struct _Libelf_Data *d;
123a1b5ec25Sjsg 
124a1b5ec25Sjsg 	if ((d = calloc((size_t) 1, sizeof(*d))) == NULL) {
125a1b5ec25Sjsg 		LIBELF_SET_ERROR(RESOURCE, 0);
126a1b5ec25Sjsg 		return (NULL);
127a1b5ec25Sjsg 	}
128a1b5ec25Sjsg 
129a1b5ec25Sjsg 	d->d_scn = s;
130a1b5ec25Sjsg 
131a1b5ec25Sjsg 	return (d);
132a1b5ec25Sjsg }
133a1b5ec25Sjsg 
134a1b5ec25Sjsg struct _Libelf_Data *
_libelf_release_data(struct _Libelf_Data * d)135a1b5ec25Sjsg _libelf_release_data(struct _Libelf_Data *d)
136a1b5ec25Sjsg {
137a1b5ec25Sjsg 
138a1b5ec25Sjsg 	if (d->d_flags & LIBELF_F_DATA_MALLOCED)
139a1b5ec25Sjsg 		free(d->d_data.d_buf);
140a1b5ec25Sjsg 
141a1b5ec25Sjsg 	free(d);
142a1b5ec25Sjsg 
143a1b5ec25Sjsg 	return (NULL);
144a1b5ec25Sjsg }
145a1b5ec25Sjsg 
146a1b5ec25Sjsg Elf_Scn *
_libelf_allocate_scn(Elf * e,size_t ndx)147a1b5ec25Sjsg _libelf_allocate_scn(Elf *e, size_t ndx)
148a1b5ec25Sjsg {
149a1b5ec25Sjsg 	Elf_Scn *s;
150a1b5ec25Sjsg 
151a1b5ec25Sjsg 	if ((s = calloc((size_t) 1, sizeof(Elf_Scn))) == NULL) {
152a1b5ec25Sjsg 		LIBELF_SET_ERROR(RESOURCE, errno);
153a1b5ec25Sjsg 		return (NULL);
154a1b5ec25Sjsg 	}
155a1b5ec25Sjsg 
156a1b5ec25Sjsg 	s->s_elf = e;
157a1b5ec25Sjsg 	s->s_ndx = ndx;
158a1b5ec25Sjsg 
159a1b5ec25Sjsg 	STAILQ_INIT(&s->s_data);
160a1b5ec25Sjsg 	STAILQ_INIT(&s->s_rawdata);
161a1b5ec25Sjsg 
162a1b5ec25Sjsg 	STAILQ_INSERT_TAIL(&e->e_u.e_elf.e_scn, s, s_next);
163a1b5ec25Sjsg 
164a1b5ec25Sjsg 	return (s);
165a1b5ec25Sjsg }
166a1b5ec25Sjsg 
167a1b5ec25Sjsg Elf_Scn *
_libelf_release_scn(Elf_Scn * s)168a1b5ec25Sjsg _libelf_release_scn(Elf_Scn *s)
169a1b5ec25Sjsg {
170a1b5ec25Sjsg 	Elf *e;
171a1b5ec25Sjsg 	struct _Libelf_Data *d, *td;
172a1b5ec25Sjsg 
173a1b5ec25Sjsg 	assert(s != NULL);
174a1b5ec25Sjsg 
175a1b5ec25Sjsg 	STAILQ_FOREACH_SAFE(d, &s->s_data, d_next, td) {
176a1b5ec25Sjsg 		STAILQ_REMOVE(&s->s_data, d, _Libelf_Data, d_next);
177a1b5ec25Sjsg 		d = _libelf_release_data(d);
178a1b5ec25Sjsg 	}
179a1b5ec25Sjsg 
180a1b5ec25Sjsg 	STAILQ_FOREACH_SAFE(d, &s->s_rawdata, d_next, td) {
181a1b5ec25Sjsg 		assert((d->d_flags & LIBELF_F_DATA_MALLOCED) == 0);
182a1b5ec25Sjsg 		STAILQ_REMOVE(&s->s_rawdata, d, _Libelf_Data, d_next);
183a1b5ec25Sjsg 		d = _libelf_release_data(d);
184a1b5ec25Sjsg 	}
185a1b5ec25Sjsg 
186a1b5ec25Sjsg 	e = s->s_elf;
187a1b5ec25Sjsg 
188a1b5ec25Sjsg 	assert(e != NULL);
189a1b5ec25Sjsg 
190a1b5ec25Sjsg 	STAILQ_REMOVE(&e->e_u.e_elf.e_scn, s, _Elf_Scn, s_next);
191a1b5ec25Sjsg 
192a1b5ec25Sjsg 	free(s);
193a1b5ec25Sjsg 
194a1b5ec25Sjsg 	return (NULL);
195a1b5ec25Sjsg }
196