1 /* $NetBSD: nlist_aout.c,v 1.25 2026/08/15 13:39:05 riastradh 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.25 2026/08/15 13:39:05 riastradh Exp $"); 70 #endif 71 #endif /* LIBC_SCCS and not lint */ 72 73 #include "namespace.h" 74 #include <sys/param.h> 75 #include <sys/endian.h> 76 #include <sys/mman.h> 77 #include <sys/stat.h> 78 #include <sys/file.h> 79 80 #include <assert.h> 81 #include <errno.h> 82 #include <stdio.h> 83 #include <string.h> 84 #include <unistd.h> 85 #include <stdlib.h> 86 87 struct nlist; 88 #include "nlist_private.h" 89 90 #ifdef NLIST_AOUT 91 #include <a.out.h> 92 #include <sys/exec_aout.h> 93 94 int 95 __fdnlist_aout(int fd, struct nlist *list) 96 { 97 struct nlist *p, *s; 98 char *strtab; 99 off_t stroff, symoff; 100 int nent; 101 size_t strsize, symsize, cc; 102 struct nlist nbuf[1024]; 103 struct exec exec; 104 struct stat st; 105 char *scoreboard, *scored; 106 107 _DIAGASSERT(fd != -1); 108 _DIAGASSERT(list != NULL); 109 110 if (pread(fd, &exec, sizeof(exec), (off_t)0) != sizeof(exec) || 111 N_BADMAG(exec) || fstat(fd, &st) < 0) 112 return (-1); 113 114 symoff = N_SYMOFF(exec); 115 symsize = (size_t)exec.a_syms; 116 stroff = symoff + symsize; 117 118 /* Check for files too large to mmap. */ 119 if ((uintmax_t)(st.st_size - stroff) > (uintmax_t)SIZE_MAX) { 120 errno = EFBIG; 121 return (-1); 122 } 123 /* 124 * Map string table into our address space. This gives us 125 * an easy way to randomly access all the strings, without 126 * making the memory allocation permanent as with malloc/free 127 * (i.e., munmap will return it to the system). 128 */ 129 strsize = (size_t)(st.st_size - stroff); 130 strtab = mmap(NULL, strsize, PROT_READ, MAP_PRIVATE|MAP_FILE, 131 fd, stroff); 132 if (strtab == (char *)-1) 133 return (-1); 134 /* 135 * clean out any left-over information for all valid entries. 136 * Type and value defined to be 0 if not found; historical 137 * versions cleared other and desc as well. Also figure out 138 * the largest string length so don't read any more of the 139 * string table than we have to. 140 * 141 * XXX clearing anything other than n_type and n_value violates 142 * the semantics given in the man page. 143 */ 144 nent = 0; 145 for (p = list; !ISLAST(p); ++p) { 146 p->n_type = 0; 147 p->n_other = 0; 148 p->n_desc = 0; 149 p->n_value = 0; 150 ++nent; 151 } 152 if (lseek(fd, symoff, SEEK_SET) == -1) 153 return (-1); 154 #if defined(__SSP__) || defined(__SSP_ALL__) 155 scoreboard = malloc((size_t)nent); 156 #else 157 scoreboard = alloca((size_t)nent); 158 #endif 159 if (scoreboard == NULL) 160 return (-1); 161 (void)memset(scoreboard, 0, (size_t)nent); 162 163 while (symsize > 0) { 164 cc = MIN(symsize, sizeof(nbuf)); 165 if (read(fd, nbuf, cc) != (ssize_t) cc) 166 break; 167 symsize -= cc; 168 for (s = nbuf; cc > 0; ++s, cc -= sizeof(*s)) { 169 long soff = s->n_un.n_strx; 170 171 if (soff == 0 || (s->n_type & N_STAB) != 0) 172 continue; 173 for (p = list, scored = scoreboard; !ISLAST(p); 174 p++, scored++) 175 if (*scored == 0 && 176 !strcmp(&strtab[(size_t)soff], 177 p->n_un.n_name)) { 178 p->n_value = s->n_value; 179 p->n_type = s->n_type; 180 p->n_desc = s->n_desc; 181 p->n_other = s->n_other; 182 *scored = 1; 183 if (--nent <= 0) 184 break; 185 } 186 } 187 } 188 munmap(strtab, strsize); 189 #if defined(__SSP__) || defined(__SSP_ALL__) 190 free(scoreboard); 191 #endif 192 return (nent); 193 } 194 #endif /* NLIST_AOUT */ 195
Indexes created Sun Oct 25 00:26:45 UTC 2026