nlist.c revision 1.6 1 1.6 cgd /* $NetBSD: nlist.c,v 1.6 1995/09/29 04:19:59 cgd Exp $ */
2 1.5 cgd
3 1.1 cgd /*
4 1.4 cgd * Copyright (c) 1989, 1993
5 1.4 cgd * The Regents of the University of California. All rights reserved.
6 1.1 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.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
37 1.5 cgd #if 0
38 1.4 cgd static char sccsid[] = "@(#)nlist.c 8.1 (Berkeley) 6/4/93";
39 1.5 cgd #else
40 1.6 cgd static char rcsid[] = "$NetBSD: nlist.c,v 1.6 1995/09/29 04:19:59 cgd Exp $";
41 1.5 cgd #endif
42 1.1 cgd #endif /* LIBC_SCCS and not lint */
43 1.1 cgd
44 1.6 cgd #ifdef __alpha__
45 1.6 cgd #define DO_ECOFF
46 1.6 cgd #else
47 1.6 cgd #define DO_AOUT
48 1.6 cgd #endif
49 1.6 cgd
50 1.6 cgd #if defined(DO_AOUT) + defined(DO_ECOFF) != 1
51 1.6 cgd ERROR: NOT PROPERLY CONFIGURED
52 1.6 cgd #endif
53 1.6 cgd
54 1.4 cgd #include <sys/param.h>
55 1.4 cgd #include <sys/mman.h>
56 1.4 cgd #include <sys/stat.h>
57 1.1 cgd #include <sys/file.h>
58 1.4 cgd
59 1.4 cgd #include <errno.h>
60 1.1 cgd #include <a.out.h>
61 1.6 cgd #ifdef DO_ECOFF
62 1.6 cgd #include <sys/exec_ecoff.h>
63 1.6 cgd #endif
64 1.1 cgd #include <stdio.h>
65 1.1 cgd #include <string.h>
66 1.1 cgd #include <unistd.h>
67 1.1 cgd
68 1.1 cgd int
69 1.1 cgd nlist(name, list)
70 1.1 cgd const char *name;
71 1.4 cgd struct nlist *list;
72 1.1 cgd {
73 1.4 cgd int fd, n;
74 1.4 cgd
75 1.4 cgd fd = open(name, O_RDONLY, 0);
76 1.4 cgd if (fd < 0)
77 1.4 cgd return (-1);
78 1.4 cgd n = __fdnlist(fd, list);
79 1.4 cgd (void)close(fd);
80 1.4 cgd return (n);
81 1.4 cgd }
82 1.1 cgd
83 1.4 cgd #define ISLAST(p) (p->n_un.n_name == 0 || p->n_un.n_name[0] == 0)
84 1.1 cgd
85 1.6 cgd #ifdef DO_AOUT
86 1.4 cgd int
87 1.4 cgd __fdnlist(fd, list)
88 1.4 cgd register int fd;
89 1.4 cgd register struct nlist *list;
90 1.4 cgd {
91 1.4 cgd register struct nlist *p, *s;
92 1.4 cgd register caddr_t strtab;
93 1.4 cgd register off_t stroff, symoff;
94 1.4 cgd register u_long symsize;
95 1.4 cgd register int nent, cc;
96 1.4 cgd size_t strsize;
97 1.4 cgd struct nlist nbuf[1024];
98 1.4 cgd struct exec exec;
99 1.4 cgd struct stat st;
100 1.4 cgd
101 1.4 cgd if (lseek(fd, (off_t)0, SEEK_SET) == -1 ||
102 1.4 cgd read(fd, &exec, sizeof(exec)) != sizeof(exec) ||
103 1.4 cgd N_BADMAG(exec) || fstat(fd, &st) < 0)
104 1.4 cgd return (-1);
105 1.4 cgd
106 1.4 cgd symoff = N_SYMOFF(exec);
107 1.4 cgd symsize = exec.a_syms;
108 1.4 cgd stroff = symoff + symsize;
109 1.4 cgd
110 1.4 cgd /* Check for files too large to mmap. */
111 1.4 cgd if (st.st_size - stroff > SIZE_T_MAX) {
112 1.4 cgd errno = EFBIG;
113 1.4 cgd return (-1);
114 1.4 cgd }
115 1.4 cgd /*
116 1.4 cgd * Map string table into our address space. This gives us
117 1.4 cgd * an easy way to randomly access all the strings, without
118 1.4 cgd * making the memory allocation permanent as with malloc/free
119 1.4 cgd * (i.e., munmap will return it to the system).
120 1.4 cgd */
121 1.4 cgd strsize = st.st_size - stroff;
122 1.4 cgd strtab = mmap(NULL, (size_t)strsize, PROT_READ, 0, fd, stroff);
123 1.4 cgd if (strtab == (char *)-1)
124 1.4 cgd return (-1);
125 1.1 cgd /*
126 1.1 cgd * clean out any left-over information for all valid entries.
127 1.1 cgd * Type and value defined to be 0 if not found; historical
128 1.1 cgd * versions cleared other and desc as well. Also figure out
129 1.1 cgd * the largest string length so don't read any more of the
130 1.1 cgd * string table than we have to.
131 1.4 cgd *
132 1.4 cgd * XXX clearing anything other than n_type and n_value violates
133 1.4 cgd * the semantics given in the man page.
134 1.1 cgd */
135 1.4 cgd nent = 0;
136 1.4 cgd for (p = list; !ISLAST(p); ++p) {
137 1.1 cgd p->n_type = 0;
138 1.1 cgd p->n_other = 0;
139 1.1 cgd p->n_desc = 0;
140 1.1 cgd p->n_value = 0;
141 1.4 cgd ++nent;
142 1.1 cgd }
143 1.4 cgd if (lseek(fd, symoff, SEEK_SET) == -1)
144 1.4 cgd return (-1);
145 1.1 cgd
146 1.4 cgd while (symsize > 0) {
147 1.4 cgd cc = MIN(symsize, sizeof(nbuf));
148 1.4 cgd if (read(fd, nbuf, cc) != cc)
149 1.4 cgd break;
150 1.4 cgd symsize -= cc;
151 1.4 cgd for (s = nbuf; cc > 0; ++s, cc -= sizeof(*s)) {
152 1.4 cgd register int soff = s->n_un.n_strx;
153 1.4 cgd
154 1.4 cgd if (soff == 0 || (s->n_type & N_STAB) != 0)
155 1.4 cgd continue;
156 1.4 cgd for (p = list; !ISLAST(p); p++)
157 1.4 cgd if (!strcmp(&strtab[soff], p->n_un.n_name)) {
158 1.4 cgd p->n_value = s->n_value;
159 1.4 cgd p->n_type = s->n_type;
160 1.4 cgd p->n_desc = s->n_desc;
161 1.4 cgd p->n_other = s->n_other;
162 1.4 cgd if (--nent <= 0)
163 1.4 cgd break;
164 1.4 cgd }
165 1.4 cgd }
166 1.1 cgd }
167 1.4 cgd munmap(strtab, strsize);
168 1.4 cgd return (nent);
169 1.1 cgd }
170 1.6 cgd #endif /* DO_AOUT */
171 1.6 cgd
172 1.6 cgd #ifdef DO_ECOFF
173 1.6 cgd #define check(off, size) ((off < 0) || (off + size > mappedsize))
174 1.6 cgd #define BAD do { rv = -1; goto out; } while (0)
175 1.6 cgd #define BADUNMAP do { rv = -1; goto unmap; } while (0)
176 1.6 cgd
177 1.6 cgd int
178 1.6 cgd __fdnlist(fd, list)
179 1.6 cgd register int fd;
180 1.6 cgd register struct nlist *list;
181 1.6 cgd {
182 1.6 cgd struct nlist *p;
183 1.6 cgd struct ecoff_filehdr *filehdrp;
184 1.6 cgd struct ecoff_symhdr *symhdrp;
185 1.6 cgd struct ecoff_extsym *esyms;
186 1.6 cgd struct stat st;
187 1.6 cgd char *mappedfile;
188 1.6 cgd size_t mappedsize;
189 1.6 cgd u_long symhdroff, extstroff;
190 1.6 cgd u_int symhdrsize;
191 1.6 cgd int rv, nent;
192 1.6 cgd long i, nesyms;
193 1.6 cgd
194 1.6 cgd rv = -3;
195 1.6 cgd
196 1.6 cgd if (fstat(fd, &st) < 0)
197 1.6 cgd BAD;
198 1.6 cgd if (st.st_size > SIZE_T_MAX) {
199 1.6 cgd errno = EFBIG;
200 1.6 cgd BAD;
201 1.6 cgd }
202 1.6 cgd mappedsize = st.st_size;
203 1.6 cgd mappedfile = mmap(NULL, mappedsize, PROT_READ, 0, fd, 0);
204 1.6 cgd if (mappedfile == (char *)-1)
205 1.6 cgd BAD;
206 1.6 cgd
207 1.6 cgd if (check(0, sizeof *filehdrp))
208 1.6 cgd BADUNMAP;
209 1.6 cgd filehdrp = (struct ecoff_filehdr *)&mappedfile[0];
210 1.6 cgd
211 1.6 cgd if (ECOFF_BADMAG(filehdrp))
212 1.6 cgd BADUNMAP;
213 1.6 cgd
214 1.6 cgd symhdroff = filehdrp->ef_symptr;
215 1.6 cgd symhdrsize = filehdrp->ef_syms;
216 1.6 cgd
217 1.6 cgd if (check(symhdroff, sizeof *symhdrp) ||
218 1.6 cgd sizeof *symhdrp != symhdrsize)
219 1.6 cgd BADUNMAP;
220 1.6 cgd symhdrp = (struct ecoff_symhdr *)&mappedfile[symhdroff];
221 1.6 cgd
222 1.6 cgd nesyms = symhdrp->sh_esymmax;
223 1.6 cgd if (check(symhdrp->sh_esymoff, nesyms * sizeof *esyms))
224 1.6 cgd BADUNMAP;
225 1.6 cgd esyms = (struct ecoff_extsym *)&mappedfile[symhdrp->sh_esymoff];
226 1.6 cgd extstroff = symhdrp->sh_estroff;
227 1.6 cgd
228 1.6 cgd /*
229 1.6 cgd * clean out any left-over information for all valid entries.
230 1.6 cgd * Type and value defined to be 0 if not found; historical
231 1.6 cgd * versions cleared other and desc as well.
232 1.6 cgd *
233 1.6 cgd * XXX clearing anything other than n_type and n_value violates
234 1.6 cgd * the semantics given in the man page.
235 1.6 cgd */
236 1.6 cgd nent = 0;
237 1.6 cgd for (p = list; !ISLAST(p); ++p) {
238 1.6 cgd p->n_type = 0;
239 1.6 cgd p->n_other = 0;
240 1.6 cgd p->n_desc = 0;
241 1.6 cgd p->n_value = 0;
242 1.6 cgd ++nent;
243 1.6 cgd }
244 1.6 cgd
245 1.6 cgd for (i = 0; i < nesyms; i++) {
246 1.6 cgd for (p = list; !ISLAST(p); p++) {
247 1.6 cgd char *nlistname;
248 1.6 cgd char *symtabname;
249 1.6 cgd
250 1.6 cgd nlistname = p->n_un.n_name;
251 1.6 cgd if (*nlistname == '_')
252 1.6 cgd nlistname++;
253 1.6 cgd symtabname =
254 1.6 cgd &mappedfile[extstroff + esyms[i].es_strindex];
255 1.6 cgd
256 1.6 cgd if (!strcmp(symtabname, nlistname)) {
257 1.6 cgd p->n_value = esyms[i].es_value;
258 1.6 cgd p->n_type = N_EXT; /* XXX */
259 1.6 cgd p->n_desc = 0; /* XXX */
260 1.6 cgd p->n_other = 0; /* XXX */
261 1.6 cgd if (--nent <= 0)
262 1.6 cgd break;
263 1.6 cgd }
264 1.6 cgd }
265 1.6 cgd }
266 1.6 cgd rv = nent;
267 1.6 cgd
268 1.6 cgd unmap:
269 1.6 cgd munmap(mappedfile, mappedsize);
270 1.6 cgd out:
271 1.6 cgd return (rv);
272 1.6 cgd }
273 1.6 cgd #endif /* DO_ECOFF */
274