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