nlist_elf32.c revision 1.14 1 1.14 wiz /* $NetBSD: nlist_elf32.c,v 1.14 2001/07/22 13:34:17 wiz Exp $ */
2 1.1 cgd
3 1.1 cgd /*
4 1.12 cgd * Copyright (c) 1996 Christopher G. Demetriou
5 1.12 cgd * All rights reserved.
6 1.12 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.12 cgd * This product includes software developed for the
18 1.12 cgd * NetBSD Project. See http://www.netbsd.org/ for
19 1.12 cgd * information about NetBSD.
20 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
21 1.12 cgd * derived from this software without specific prior written permission.
22 1.12 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.12 cgd *
34 1.12 cgd * <<Id: LICENSE,v 1.2 2000/06/14 15:57:33 cgd Exp>>
35 1.1 cgd */
36 1.1 cgd
37 1.3 lukem #include <sys/cdefs.h>
38 1.1 cgd #ifndef lint
39 1.14 wiz __RCSID("$NetBSD: nlist_elf32.c,v 1.14 2001/07/22 13:34:17 wiz Exp $");
40 1.1 cgd #endif /* not lint */
41 1.1 cgd
42 1.1 cgd /* If not included by nlist_elf64.c, ELFSIZE won't be defined. */
43 1.1 cgd #ifndef ELFSIZE
44 1.1 cgd #define ELFSIZE 32
45 1.1 cgd #endif
46 1.1 cgd
47 1.1 cgd #include <sys/param.h>
48 1.1 cgd #include <sys/mman.h>
49 1.1 cgd #include <sys/stat.h>
50 1.1 cgd
51 1.1 cgd #include <a.out.h>
52 1.1 cgd #include <db.h>
53 1.1 cgd #include <err.h>
54 1.1 cgd #include <errno.h>
55 1.1 cgd #include <fcntl.h>
56 1.1 cgd #include <kvm.h>
57 1.1 cgd #include <limits.h>
58 1.1 cgd #include <stdio.h>
59 1.1 cgd #include <stdlib.h>
60 1.1 cgd #include <string.h>
61 1.1 cgd #include <unistd.h>
62 1.1 cgd
63 1.1 cgd #include "extern.h"
64 1.1 cgd
65 1.1 cgd #if defined(NLIST_ELF32) || defined(NLIST_ELF64)
66 1.1 cgd #include <sys/exec_elf.h>
67 1.1 cgd #endif
68 1.1 cgd
69 1.1 cgd #if (defined(NLIST_ELF32) && (ELFSIZE == 32)) || \
70 1.1 cgd (defined(NLIST_ELF64) && (ELFSIZE == 64))
71 1.1 cgd
72 1.1 cgd typedef struct nlist NLIST;
73 1.1 cgd #define _strx n_un.n_strx
74 1.1 cgd #define _name n_un.n_name
75 1.1 cgd
76 1.1 cgd #define badfmt(str) \
77 1.1 cgd do { \
78 1.1 cgd warnx("%s: %s: %s", kfile, str, strerror(EFTYPE)); \
79 1.1 cgd punt(); \
80 1.1 cgd } while (0)
81 1.1 cgd
82 1.1 cgd #define check(off, size) ((off < 0) || (off + size > mappedsize))
83 1.1 cgd #define BAD do { rv = -1; goto out; } while (0)
84 1.1 cgd #define BADUNMAP do { rv = -1; goto unmap; } while (0)
85 1.1 cgd
86 1.1 cgd static const char *kfile;
87 1.1 cgd
88 1.1 cgd int
89 1.1 cgd ELFNAMEEND(create_knlist)(name, db)
90 1.1 cgd const char *name;
91 1.1 cgd DB *db;
92 1.1 cgd {
93 1.1 cgd struct stat st;
94 1.1 cgd struct nlist nbuf;
95 1.1 cgd DBT key, data;
96 1.1 cgd char *mappedfile, *symname, *fsymname, *tmpcp, *strtab;
97 1.1 cgd size_t mappedsize, symnamesize, fsymnamesize;
98 1.1 cgd Elf_Ehdr *ehdrp;
99 1.1 cgd Elf_Shdr *shdrp, *symshdrp, *symstrshdrp;
100 1.1 cgd Elf_Sym *symp;
101 1.2 cgd Elf_Off shdr_off;
102 1.2 cgd Elf_Word shdr_size;
103 1.1 cgd #if (ELFSIZE == 32)
104 1.1 cgd Elf32_Half nshdr;
105 1.1 cgd #elif (ELFSIZE == 64)
106 1.1 cgd Elf64_Half nshdr;
107 1.1 cgd #endif
108 1.1 cgd unsigned long i, nsyms;
109 1.1 cgd int fd, rv;
110 1.1 cgd
111 1.1 cgd rv = -1;
112 1.5 enami #ifdef __GNUC__
113 1.5 enami /* fix compiler warnings */
114 1.5 enami symshdrp = NULL;
115 1.5 enami symstrshdrp = NULL;
116 1.5 enami #endif
117 1.1 cgd
118 1.1 cgd /*
119 1.1 cgd * Open and map the whole file. If we can't open/stat it,
120 1.1 cgd * something bad is going on so we punt.
121 1.1 cgd */
122 1.1 cgd kfile = name;
123 1.1 cgd if ((fd = open(name, O_RDONLY, 0)) < 0) {
124 1.1 cgd warn("%s", kfile);
125 1.1 cgd punt();
126 1.1 cgd }
127 1.1 cgd if (fstat(fd, &st) < 0) {
128 1.1 cgd warn("%s", kfile);
129 1.1 cgd punt();
130 1.1 cgd }
131 1.1 cgd if (st.st_size > SIZE_T_MAX)
132 1.1 cgd BAD;
133 1.1 cgd
134 1.1 cgd /*
135 1.1 cgd * Map the file in its entirety.
136 1.1 cgd */
137 1.1 cgd mappedsize = st.st_size;
138 1.6 mrg mappedfile = mmap(NULL, mappedsize, PROT_READ, MAP_PRIVATE|MAP_FILE,
139 1.6 mrg fd, 0);
140 1.1 cgd if (mappedfile == (char *)-1)
141 1.1 cgd BAD;
142 1.1 cgd
143 1.1 cgd /*
144 1.1 cgd * Make sure we can access the executable's header
145 1.1 cgd * directly, and make sure the recognize the executable
146 1.1 cgd * as an ELF binary.
147 1.1 cgd */
148 1.1 cgd if (check(0, sizeof *ehdrp))
149 1.1 cgd BADUNMAP;
150 1.1 cgd ehdrp = (Elf_Ehdr *)&mappedfile[0];
151 1.1 cgd
152 1.9 kleink if (memcmp(ehdrp->e_ident, ELFMAG, SELFMAG) != 0 ||
153 1.9 kleink ehdrp->e_ident[EI_CLASS] != ELFCLASS)
154 1.1 cgd BADUNMAP;
155 1.1 cgd
156 1.1 cgd switch (ehdrp->e_machine) {
157 1.1 cgd ELFDEFNNAME(MACHDEP_ID_CASES)
158 1.1 cgd
159 1.1 cgd default:
160 1.1 cgd BADUNMAP;
161 1.1 cgd }
162 1.1 cgd
163 1.1 cgd /*
164 1.1 cgd * We've recognized it as an ELF binary. From here
165 1.1 cgd * on out, all errors are fatal.
166 1.1 cgd */
167 1.1 cgd
168 1.1 cgd /*
169 1.1 cgd * Find the symbol list and string table.
170 1.1 cgd */
171 1.1 cgd nshdr = ehdrp->e_shnum;
172 1.1 cgd shdr_off = ehdrp->e_shoff;
173 1.1 cgd shdr_size = ehdrp->e_shentsize * nshdr;
174 1.1 cgd
175 1.1 cgd if (check(shdr_off, shdr_size) ||
176 1.1 cgd (sizeof *shdrp != ehdrp->e_shentsize))
177 1.1 cgd badfmt("bogus section header table");
178 1.1 cgd shdrp = (Elf_Shdr *)&mappedfile[shdr_off];
179 1.1 cgd
180 1.1 cgd for (i = 0; i < nshdr; i++) {
181 1.9 kleink if (shdrp[i].sh_type == SHT_SYMTAB) {
182 1.1 cgd symshdrp = &shdrp[i];
183 1.1 cgd symstrshdrp = &shdrp[shdrp[i].sh_link];
184 1.1 cgd }
185 1.1 cgd }
186 1.1 cgd
187 1.13 agc if (symshdrp == NULL)
188 1.13 agc badfmt("no symbol section header found");
189 1.1 cgd if (symshdrp->sh_offset == 0)
190 1.1 cgd badfmt("stripped");
191 1.1 cgd if (check(symshdrp->sh_offset, symshdrp->sh_size))
192 1.1 cgd badfmt("bogus symbol section header");
193 1.1 cgd if (check(symstrshdrp->sh_offset, symstrshdrp->sh_size))
194 1.1 cgd badfmt("bogus symbol string section header");
195 1.1 cgd
196 1.1 cgd symp = (Elf_Sym *)&mappedfile[symshdrp->sh_offset];
197 1.1 cgd nsyms = symshdrp->sh_size / sizeof(*symp);
198 1.1 cgd strtab = &mappedfile[symstrshdrp->sh_offset];
199 1.1 cgd
200 1.1 cgd /*
201 1.1 cgd * Set up the data item, pointing to a nlist structure.
202 1.1 cgd * which we fill in for each symbol.
203 1.1 cgd */
204 1.1 cgd data.data = (u_char *)&nbuf;
205 1.1 cgd data.size = sizeof(nbuf);
206 1.1 cgd
207 1.1 cgd /*
208 1.1 cgd * Create a buffer (to be expanded later, if necessary)
209 1.1 cgd * to hold symbol names after we've added underscores
210 1.1 cgd * to them.
211 1.1 cgd */
212 1.1 cgd symnamesize = 1024;
213 1.1 cgd if ((symname = malloc(symnamesize)) == NULL) {
214 1.1 cgd warn("malloc");
215 1.1 cgd punt();
216 1.1 cgd }
217 1.1 cgd
218 1.1 cgd /*
219 1.1 cgd * Read each symbol and enter it into the database.
220 1.1 cgd */
221 1.1 cgd for (i = 0; i < nsyms; i++) {
222 1.1 cgd
223 1.1 cgd /*
224 1.1 cgd * No symbol name; ignore this symbol.
225 1.1 cgd */
226 1.1 cgd if (symp[i].st_name == 0)
227 1.1 cgd continue;
228 1.1 cgd
229 1.1 cgd /*
230 1.1 cgd * Find symbol name, copy it (with added underscore) to
231 1.1 cgd * temporary buffer, and prepare the database key for
232 1.1 cgd * insertion.
233 1.1 cgd */
234 1.1 cgd fsymname = &strtab[symp[i].st_name];
235 1.1 cgd fsymnamesize = strlen(fsymname) + 1;
236 1.1 cgd while (symnamesize < fsymnamesize + 1) {
237 1.1 cgd symnamesize *= 2;
238 1.1 cgd if ((symname = realloc(symname, symnamesize)) == NULL) {
239 1.1 cgd warn("malloc");
240 1.1 cgd punt();
241 1.1 cgd }
242 1.1 cgd }
243 1.1 cgd strcpy(symname, "_");
244 1.1 cgd strcat(symname, fsymname);
245 1.1 cgd
246 1.1 cgd key.data = symname;
247 1.1 cgd key.size = strlen((char *)key.data);
248 1.1 cgd
249 1.1 cgd /*
250 1.1 cgd * Convert the symbol information into an nlist structure,
251 1.1 cgd * as best we can.
252 1.1 cgd */
253 1.1 cgd nbuf.n_value = symp[i].st_value;
254 1.9 kleink switch (ELFDEFNNAME(ST_TYPE)(symp[i].st_info)) {
255 1.1 cgd default:
256 1.9 kleink case STT_NOTYPE:
257 1.1 cgd nbuf.n_type = N_UNDF;
258 1.1 cgd break;
259 1.9 kleink case STT_OBJECT:
260 1.1 cgd nbuf.n_type = N_DATA;
261 1.1 cgd break;
262 1.9 kleink case STT_FUNC:
263 1.1 cgd nbuf.n_type = N_TEXT;
264 1.1 cgd break;
265 1.9 kleink case STT_FILE:
266 1.1 cgd nbuf.n_type = N_FN;
267 1.1 cgd break;
268 1.1 cgd }
269 1.9 kleink if (ELFDEFNNAME(ST_BIND)(symp[i].st_info) != STB_LOCAL)
270 1.1 cgd nbuf.n_type |= N_EXT;
271 1.1 cgd nbuf.n_desc = 0; /* XXX */
272 1.1 cgd nbuf.n_other = 0; /* XXX */
273 1.1 cgd
274 1.1 cgd /*
275 1.1 cgd * Enter the symbol into the database.
276 1.1 cgd */
277 1.1 cgd if (db->put(db, &key, &data, 0)) {
278 1.1 cgd warn("record enter");
279 1.1 cgd punt();
280 1.1 cgd }
281 1.1 cgd
282 1.1 cgd /*
283 1.1 cgd * If it's the kernel version string, we've gotta keep
284 1.14 wiz * some extra data around. Under a separate key,
285 1.1 cgd * we enter the first line (i.e. up to the first newline,
286 1.1 cgd * with the newline replaced by a NUL to terminate the
287 1.1 cgd * entered string) of the version string.
288 1.1 cgd */
289 1.1 cgd if (strcmp((char *)key.data, VRS_SYM) == 0) {
290 1.1 cgd key.data = (u_char *)VRS_KEY;
291 1.1 cgd key.size = sizeof(VRS_KEY) - 1;
292 1.1 cgd /* Find the version string, relative to its section */
293 1.1 cgd data.data = strdup(&mappedfile[nbuf.n_value -
294 1.1 cgd shdrp[symp[i].st_shndx].sh_addr +
295 1.1 cgd shdrp[symp[i].st_shndx].sh_offset]);
296 1.1 cgd /* assumes newline terminates version. */
297 1.1 cgd if ((tmpcp = strchr(data.data, '\n')) != NULL)
298 1.1 cgd *tmpcp = '\0';
299 1.1 cgd data.size = strlen((char *)data.data);
300 1.1 cgd
301 1.1 cgd if (db->put(db, &key, &data, 0)) {
302 1.1 cgd warn("record enter");
303 1.1 cgd punt();
304 1.1 cgd }
305 1.1 cgd
306 1.1 cgd /* free pointer created by strdup(). */
307 1.1 cgd free(data.data);
308 1.1 cgd
309 1.1 cgd /* Restore to original values */
310 1.1 cgd data.data = (u_char *)&nbuf;
311 1.1 cgd data.size = sizeof(nbuf);
312 1.1 cgd }
313 1.1 cgd }
314 1.1 cgd
315 1.1 cgd rv = 0;
316 1.1 cgd
317 1.1 cgd unmap:
318 1.1 cgd munmap(mappedfile, mappedsize);
319 1.1 cgd out:
320 1.1 cgd return (rv);
321 1.1 cgd }
322 1.1 cgd
323 1.1 cgd #endif
324