Home | History | Annotate | Line # | Download | only in gen
nlist.c revision 1.16 
      1 /*	$NetBSD: nlist.c,v 1.16 2000/01/03 02:13:32 msaitoh 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.c,v 1.16 2000/01/03 02:13:32 msaitoh 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 #ifdef __weak_alias
     60 __weak_alias(nlist,_nlist);
     61 #endif
     62 
     63 #include "nlist_private.h"
     64 
     65 static const struct {
     66 	int	(*fdnlist) __P((int, struct nlist *));
     67 } fdnlist_fmts[] = {
     68 #ifdef NLIST_AOUT
     69 	{	__fdnlist_aout		},
     70 #endif
     71 #ifdef NLIST_COFF
     72 	{	__fdnlist_coff		},
     73 #endif
     74 #ifdef NLIST_ECOFF
     75 	{	__fdnlist_ecoff		},
     76 #endif
     77 #ifdef NLIST_ELF32
     78 	{	__fdnlist_elf32		},
     79 #endif
     80 #ifdef NLIST_ELF64
     81 	{	__fdnlist_elf64		},
     82 #endif
     83 };
     84 
     85 int
     86 nlist(name, list)
     87 	const char *name;
     88 	struct nlist *list;
     89 {
     90 	int fd, n;
     91 
     92 	_DIAGASSERT(name != NULL);
     93 	_DIAGASSERT(list != NULL);
     94 
     95 	fd = open(name, O_RDONLY, 0);
     96 	if (fd < 0)
     97 		return (-1);
     98 	n = __fdnlist(fd, list);
     99 	(void)close(fd);
    100 	return (n);
    101 }
    102 
    103 int
    104 __fdnlist(fd, list)
    105 	int fd;
    106 	struct nlist *list;
    107 {
    108 	int i, rv;
    109 
    110 	_DIAGASSERT(fd != -1);
    111 	_DIAGASSERT(list != NULL);
    112 
    113 	for (i = 0; i < sizeof(fdnlist_fmts) / sizeof(fdnlist_fmts[0]); i++)
    114 		if ((rv = (*fdnlist_fmts[i].fdnlist)(fd, list)) != -1)
    115 			return (rv);
    116 	return (-1);
    117 }
    118