1 /* $NetBSD: nlist_aout.c,v 1.22 2009/08/20 11:08:59 martin Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 /* 33 * Copyright (c) 1996 Christopher G. Demetriou. All rights reserved. 34 * 35 * Redistribution and use in source and binary forms, with or without 36 * modification, are permitted provided that the following conditions 37 * are met: 38 * 1. Redistributions of source code must retain the above copyright 39 * notice, this list of conditions and the following disclaimer. 40 * 2. Redistributions in binary form must reproduce the above copyright 41 * notice, this list of conditions and the following disclaimer in the 42 * documentation and/or other materials provided with the distribution. 43 * 3. All advertising materials mentioning features or use of this software 44 * must display the following acknowledgement: 45 * This product includes software developed by the University of 46 * California, Berkeley and its contributors. 47 * 4. Neither the name of the University nor the names of its contributors 48 * may be used to endorse or promote products derived from this software 49 * without specific prior written permission. 50 * 51 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 52 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 53 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 54 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 55 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 56 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 57 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 58 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 59 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 60 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 61 * SUCH DAMAGE. 62 */ 63 64 #include <sys/cdefs.h> 65 #if defined(LIBC_SCCS) && !defined(lint) 66 #if 0 67 static char sccsid[] = "@(#)nlist.c 8.1 (Berkeley) 6/4/93"; 68 #else 69 __RCSID("$NetBSD: nlist_aout.c,v 1.22 2009/08/20 11:08:59 martin Exp $"); 70 #endif 71 #endif /* LIBC_SCCS and not lint */ 72 73 #include "namespace.h" 74 #include <sys/param.h> 75 #include <sys/mman.h> 76 #include <sys/stat.h> 77 #include <sys/file.h> 78 79 #include <assert.h> 80 #include <errno.h> 81 #include <stdio.h> 82 #include <string.h> 83 #include <unistd.h> 84 #include <stdlib.h> 85 86 struct nlist; 87 #include "nlist_private.h" 88 89 #ifdef NLIST_AOUT 90 #include <a.out.h> 91 #include <sys/exec_aout.h> 92 93 int 94 __fdnlist_aout(fd, list) 95 int fd; 96 struct nlist *list; 97 { 98 struct nlist *p, *s; 99 char *strtab; 100 off_t stroff, symoff; 101 int nent; 102 size_t strsize, symsize, cc; 103 struct nlist nbuf[1024]; 104 struct exec exec; 105 struct stat st; 106 char *scoreboard, *scored; 107 108 _DIAGASSERT(fd != -1); 109 _DIAGASSERT(list != NULL); 110 111 if (pread(fd, &exec, sizeof(exec), (off_t)0) != sizeof(exec) || 112 N_BADMAG(exec) || fstat(fd, &st) < 0) 113 return (-1); 114 115 symoff = N_SYMOFF(exec); 116 symsize = (size_t)exec.a_syms; 117 stroff = symoff + symsize; 118 119 /* Check for files too large to mmap. */ 120 if ((uintmax_t)(st.st_size - stroff) > (uintmax_t)SIZE_T_MAX) { 121 errno = EFBIG; 122 return (-1); 123 } 124 /* 125 * Map string table into our address space. This gives us 126 * an easy way to randomly access all the strings, without 127 * making the memory allocation permanent as with malloc/free 128 * (i.e., munmap will return it to the system). 129 */ 130 strsize = (size_t)(st.st_size - stroff); 131 strtab = mmap(NULL, strsize, PROT_READ, MAP_PRIVATE|MAP_FILE, 132 fd, stroff); 133 if (strtab == (char *)-1) 134 return (-1); 135 /* 136 * clean out any left-over information for all valid entries. 137 * Type and value defined to be 0 if not found; historical 138 * versions cleared other and desc as well. Also figure out 139 * the largest string length so don't read any more of the 140 * string table than we have to. 141 * 142 * XXX clearing anything other than n_type and n_value violates 143 * the semantics given in the man page. 144 */ 145 nent = 0; 146 for (p = list; !ISLAST(p); ++p) { 147 p->n_type = 0; 148 p->n_other = 0; 149 p->n_desc = 0; 150 p->n_value = 0; 151 ++nent; 152 } 153 if (lseek(fd, symoff, SEEK_SET) == -1) 154 return (-1); 155 #if defined(__SSP__) || defined(__SSP_ALL__) 156 scoreboard = malloc((size_t)nent); 157 #else 158 scoreboard = alloca((size_t)nent); 159 #endif 160 if (scoreboard == NULL) 161 return (-1); 162 (void)memset(scoreboard, 0, (size_t)nent); 163 164 while (symsize > 0) { 165 cc = MIN(symsize, sizeof(nbuf)); 166 if (read(fd, nbuf, cc) != (ssize_t) cc) 167 break; 168 symsize -= cc; 169 for (s = nbuf; cc > 0; ++s, cc -= sizeof(*s)) { 170 long soff = s->n_un.n_strx; 171 172 if (soff == 0 || (s->n_type & N_STAB) != 0) 173 continue; 174 for (p = list, scored = scoreboard; !ISLAST(p); 175 p++, scored++) 176 if (*scored == 0 && 177 !strcmp(&strtab[(size_t)soff], 178 p->n_un.n_name)) { 179 p->n_value = s->n_value; 180 p->n_type = s->n_type; 181 p->n_desc = s->n_desc; 182 p->n_other = s->n_other; 183 *scored = 1; 184 if (--nent <= 0) 185 break; 186 } 187 } 188 } 189 munmap(strtab, strsize); 190 #if defined(__SSP__) || defined(__SSP_ALL__) 191 free(scoreboard); 192 #endif 193 return (nent); 194 } 195 #endif /* NLIST_AOUT */ 196