nlist.c revision 1.20 1 1.20 thorpej /* $NetBSD: nlist.c,v 1.20 2002/11/11 19:25:38 thorpej Exp $ */
2 1.5 cgd
3 1.1 cgd /*
4 1.8 cgd * Copyright (c) 1996 Christopher G. Demetriou. All rights reserved.
5 1.4 cgd * Copyright (c) 1989, 1993
6 1.4 cgd * The Regents of the University of California. All rights reserved.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.11 christos #include <sys/cdefs.h>
38 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
39 1.5 cgd #if 0
40 1.4 cgd static char sccsid[] = "@(#)nlist.c 8.1 (Berkeley) 6/4/93";
41 1.5 cgd #else
42 1.20 thorpej __RCSID("$NetBSD: nlist.c,v 1.20 2002/11/11 19:25:38 thorpej Exp $");
43 1.5 cgd #endif
44 1.1 cgd #endif /* LIBC_SCCS and not lint */
45 1.1 cgd
46 1.12 jtc #include "namespace.h"
47 1.4 cgd #include <sys/param.h>
48 1.4 cgd #include <sys/mman.h>
49 1.4 cgd #include <sys/stat.h>
50 1.1 cgd #include <sys/file.h>
51 1.4 cgd
52 1.14 lukem #include <assert.h>
53 1.4 cgd #include <errno.h>
54 1.1 cgd #include <stdio.h>
55 1.1 cgd #include <string.h>
56 1.1 cgd #include <unistd.h>
57 1.8 cgd #include <a.out.h> /* for 'struct nlist' declaration */
58 1.12 jtc
59 1.18 mycroft #if 0
60 1.12 jtc #ifdef __weak_alias
61 1.17 mycroft __weak_alias(nlist,_nlist)
62 1.18 mycroft #endif
63 1.12 jtc #endif
64 1.8 cgd
65 1.8 cgd #include "nlist_private.h"
66 1.1 cgd
67 1.13 mycroft static const struct {
68 1.8 cgd int (*fdnlist) __P((int, struct nlist *));
69 1.8 cgd } fdnlist_fmts[] = {
70 1.8 cgd #ifdef NLIST_AOUT
71 1.9 cgd { __fdnlist_aout },
72 1.16 msaitoh #endif
73 1.16 msaitoh #ifdef NLIST_COFF
74 1.16 msaitoh { __fdnlist_coff },
75 1.8 cgd #endif
76 1.8 cgd #ifdef NLIST_ECOFF
77 1.9 cgd { __fdnlist_ecoff },
78 1.8 cgd #endif
79 1.8 cgd #ifdef NLIST_ELF32
80 1.9 cgd { __fdnlist_elf32 },
81 1.8 cgd #endif
82 1.8 cgd #ifdef NLIST_ELF64
83 1.9 cgd { __fdnlist_elf64 },
84 1.8 cgd #endif
85 1.8 cgd };
86 1.8 cgd
87 1.1 cgd int
88 1.1 cgd nlist(name, list)
89 1.1 cgd const char *name;
90 1.4 cgd struct nlist *list;
91 1.1 cgd {
92 1.4 cgd int fd, n;
93 1.4 cgd
94 1.14 lukem _DIAGASSERT(name != NULL);
95 1.14 lukem _DIAGASSERT(list != NULL);
96 1.14 lukem
97 1.4 cgd fd = open(name, O_RDONLY, 0);
98 1.4 cgd if (fd < 0)
99 1.4 cgd return (-1);
100 1.4 cgd n = __fdnlist(fd, list);
101 1.4 cgd (void)close(fd);
102 1.4 cgd return (n);
103 1.4 cgd }
104 1.1 cgd
105 1.4 cgd int
106 1.4 cgd __fdnlist(fd, list)
107 1.8 cgd int fd;
108 1.8 cgd struct nlist *list;
109 1.4 cgd {
110 1.20 thorpej size_t i;
111 1.20 thorpej int rv;
112 1.6 cgd
113 1.14 lukem _DIAGASSERT(fd != -1);
114 1.14 lukem _DIAGASSERT(list != NULL);
115 1.14 lukem
116 1.8 cgd for (i = 0; i < sizeof(fdnlist_fmts) / sizeof(fdnlist_fmts[0]); i++)
117 1.10 cgd if ((rv = (*fdnlist_fmts[i].fdnlist)(fd, list)) != -1)
118 1.14 lukem return (rv);
119 1.14 lukem return (-1);
120 1.6 cgd }
121