Home | History | Annotate | Line # | Download | only in gen
nlist_aout.c revision 1.10 
      1 /*	$NetBSD: nlist_aout.c,v 1.10 1999/09/16 11:45:01 lukem 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.10 1999/09/16 11:45:01 lukem Exp $");
     43 #endif
     44 #endif /* LIBC_SCCS and not lint */
     45 
     46 #include "namespace.h"
     47 #include <sys/param.h>
     48 #include <sys/mman.h>
     49 #include <sys/stat.h>
     50 #include <sys/file.h>
     51 
     52 #include <assert.h>
     53 #include <errno.h>
     54 #include <stdio.h>
     55 #include <string.h>
     56 #include <unistd.h>
     57 #include <a.out.h>			/* for 'struct nlist' declaration */
     58 
     59 #include "nlist_private.h"
     60 
     61 #ifdef NLIST_AOUT
     62 int
     63 __fdnlist_aout(fd, list)
     64 	int fd;
     65 	struct nlist *list;
     66 {
     67 	struct nlist *p, *s;
     68 	char *strtab;
     69 	off_t stroff, symoff;
     70 	int nent;
     71 	size_t strsize, symsize, cc;
     72 	struct nlist nbuf[1024];
     73 	struct exec exec;
     74 	struct stat st;
     75 
     76 	_DIAGASSERT(fd != -1);
     77 	_DIAGASSERT(list != NULL);
     78 #ifdef _DIAGNOSTIC
     79 	if (fd == -1) {
     80 		errno = EBADF;
     81 		return (-1);
     82 	}
     83 	if (list == NULL) {
     84 		errno = EFAULT;
     85 		return (-1);
     86 	}
     87 #endif
     88 
     89 	if (pread(fd, &exec, sizeof(exec), (off_t)0) != sizeof(exec) ||
     90 	    N_BADMAG(exec) || fstat(fd, &st) < 0)
     91 		return (-1);
     92 
     93 	symoff = N_SYMOFF(exec);
     94 	symsize = (size_t)exec.a_syms;
     95 	stroff = symoff + symsize;
     96 
     97 	/* Check for files too large to mmap. */
     98 	if (st.st_size - stroff > SIZE_T_MAX) {
     99 		errno = EFBIG;
    100 		return (-1);
    101 	}
    102 	/*
    103 	 * Map string table into our address space.  This gives us
    104 	 * an easy way to randomly access all the strings, without
    105 	 * making the memory allocation permanent as with malloc/free
    106 	 * (i.e., munmap will return it to the system).
    107 	 */
    108 	strsize = (size_t)(st.st_size - stroff);
    109 	strtab = mmap(NULL, strsize, PROT_READ, MAP_PRIVATE|MAP_FILE,
    110 	    fd, stroff);
    111 	if (strtab == (char *)-1)
    112 		return (-1);
    113 	/*
    114 	 * clean out any left-over information for all valid entries.
    115 	 * Type and value defined to be 0 if not found; historical
    116 	 * versions cleared other and desc as well.  Also figure out
    117 	 * the largest string length so don't read any more of the
    118 	 * string table than we have to.
    119 	 *
    120 	 * XXX clearing anything other than n_type and n_value violates
    121 	 * the semantics given in the man page.
    122 	 */
    123 	nent = 0;
    124 	for (p = list; !ISLAST(p); ++p) {
    125 		p->n_type = 0;
    126 		p->n_other = 0;
    127 		p->n_desc = 0;
    128 		p->n_value = 0;
    129 		++nent;
    130 	}
    131 	if (lseek(fd, symoff, SEEK_SET) == -1)
    132 		return (-1);
    133 
    134 	while (symsize > 0) {
    135 		cc = MIN(symsize, sizeof(nbuf));
    136 		if (read(fd, nbuf, cc) != cc)
    137 			break;
    138 		symsize -= cc;
    139 		for (s = nbuf; cc > 0; ++s, cc -= sizeof(*s)) {
    140 			long soff = s->n_un.n_strx;
    141 
    142 			if (soff == 0 || (s->n_type & N_STAB) != 0)
    143 				continue;
    144 			for (p = list; !ISLAST(p); p++)
    145 				if (!strcmp(&strtab[(size_t)soff],
    146 				    p->n_un.n_name)) {
    147 					p->n_value = s->n_value;
    148 					p->n_type = s->n_type;
    149 					p->n_desc = s->n_desc;
    150 					p->n_other = s->n_other;
    151 					if (--nent <= 0)
    152 						break;
    153 				}
    154 		}
    155 	}
    156 	munmap(strtab, strsize);
    157 	return (nent);
    158 }
    159 #endif /* NLIST_AOUT */
    160