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