2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1989, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 #include <sys/cdefs.h>
33 __SCCSID("@(#)nlist.c 8.1 (Berkeley) 6/4/93");
34 __FBSDID("$FreeBSD$");
36 #include "namespace.h"
37 #include <sys/param.h>
41 #include <arpa/inet.h>
48 #include "un-namespace.h"
50 #include <machine/elf.h>
51 #include <elf-hints.h>
53 int __fdnlist(int, struct nlist *);
54 int __elf_fdnlist(int, struct nlist *);
55 int __elf_is_okay__(Elf_Ehdr *);
58 nlist(const char *name, struct nlist *list)
62 fd = _open(name, O_RDONLY | O_CLOEXEC, 0);
65 n = __fdnlist(fd, list);
70 static struct nlist_handlers {
71 int (*fn)(int fd, struct nlist *list);
77 __fdnlist(int fd, struct nlist *list)
82 for (i = 0; i < nitems(nlist_fn); i++) {
83 n = (nlist_fn[i].fn)(fd, list);
90 #define ISLAST(p) (p->n_un.n_name == 0 || p->n_un.n_name[0] == 0)
92 static void elf_sym_to_nlist(struct nlist *, Elf_Sym *, Elf_Shdr *, int);
95 * __elf_is_okay__ - Determine if ehdr really
96 * is ELF and valid for the target platform.
98 * WARNING: This is NOT an ELF ABI function and
99 * as such its use should be restricted.
102 __elf_is_okay__(Elf_Ehdr *ehdr)
106 * We need to check magic, class size, endianess,
107 * and version before we look at the rest of the
108 * Elf_Ehdr structure. These few elements are
109 * represented in a machine independant fashion.
112 ehdr->e_ident[EI_CLASS] == ELF_TARG_CLASS &&
113 ehdr->e_ident[EI_DATA] == ELF_TARG_DATA &&
114 ehdr->e_ident[EI_VERSION] == ELF_TARG_VER) {
116 /* Now check the machine dependant header */
117 if (ehdr->e_machine == ELF_TARG_MACH &&
118 ehdr->e_version == ELF_TARG_VER)
125 __elf_fdnlist(int fd, struct nlist *list)
128 Elf_Off symoff = 0, symstroff = 0;
129 Elf_Size symsize = 0, symstrsize = 0;
137 Elf_Shdr *shdr = NULL;
142 /* Make sure obj is OK */
143 if (lseek(fd, (off_t)0, SEEK_SET) == -1 ||
144 _read(fd, &ehdr, sizeof(Elf_Ehdr)) != sizeof(Elf_Ehdr) ||
145 !__elf_is_okay__(&ehdr) ||
149 /* calculate section header table size */
150 shdr_size = ehdr.e_shentsize * ehdr.e_shnum;
152 /* Make sure it's not too big to mmap */
153 if (shdr_size > SIZE_T_MAX) {
158 /* mmap section header table */
159 base = mmap(NULL, (size_t)shdr_size, PROT_READ, MAP_PRIVATE, fd,
160 (off_t)ehdr.e_shoff);
161 if (base == MAP_FAILED)
163 shdr = (Elf_Shdr *)base;
166 * Find the symbol table entry and it's corresponding
167 * string table entry. Version 1.1 of the ABI states
168 * that there is only one symbol table but that this
169 * could change in the future.
171 for (i = 0; i < ehdr.e_shnum; i++) {
172 if (shdr[i].sh_type == SHT_SYMTAB) {
173 symoff = shdr[i].sh_offset;
174 symsize = shdr[i].sh_size;
175 symstroff = shdr[shdr[i].sh_link].sh_offset;
176 symstrsize = shdr[shdr[i].sh_link].sh_size;
181 /* Check for files too large to mmap. */
182 if (symstrsize > SIZE_T_MAX) {
187 * Map string table into our address space. This gives us
188 * an easy way to randomly access all the strings, without
189 * making the memory allocation permanent as with malloc/free
190 * (i.e., munmap will return it to the system).
192 base = mmap(NULL, (size_t)symstrsize, PROT_READ, MAP_PRIVATE, fd,
194 if (base == MAP_FAILED)
196 strtab = (char *)base;
199 * clean out any left-over information for all valid entries.
200 * Type and value defined to be 0 if not found; historical
201 * versions cleared other and desc as well. Also figure out
202 * the largest string length so don't read any more of the
203 * string table than we have to.
205 * XXX clearing anything other than n_type and n_value violates
206 * the semantics given in the man page.
209 for (p = list; !ISLAST(p); ++p) {
217 /* Don't process any further if object is stripped. */
221 if (lseek(fd, (off_t) symoff, SEEK_SET) == -1) {
226 while (symsize > 0 && nent > 0) {
227 cc = MIN(symsize, sizeof(sbuf));
228 if (_read(fd, sbuf, cc) != cc)
231 for (s = sbuf; cc > 0 && nent > 0; ++s, cc -= sizeof(*s)) {
235 name = strtab + s->st_name;
238 for (p = list; !ISLAST(p); p++) {
239 if ((p->n_un.n_name[0] == '_' &&
240 strcmp(name, p->n_un.n_name+1) == 0)
241 || strcmp(name, p->n_un.n_name) == 0) {
242 elf_sym_to_nlist(p, s, shdr,
253 munmap(strtab, symstrsize);
255 munmap(shdr, shdr_size);
261 * Convert an Elf_Sym into an nlist structure. This fills in only the
262 * n_value and n_type members.
265 elf_sym_to_nlist(struct nlist *nl, Elf_Sym *s, Elf_Shdr *shdr, int shnum)
267 nl->n_value = s->st_value;
269 switch (s->st_shndx) {
275 nl->n_type = ELF_ST_TYPE(s->st_info) == STT_FILE ?
279 if (s->st_shndx >= shnum)
282 Elf_Shdr *sh = shdr + s->st_shndx;
284 nl->n_type = sh->sh_type == SHT_PROGBITS ?
285 (sh->sh_flags & SHF_WRITE ? N_DATA : N_TEXT) :
286 (sh->sh_type == SHT_NOBITS ? N_BSS : N_UNDF);
291 if (ELF_ST_BIND(s->st_info) == STB_GLOBAL ||
292 ELF_ST_BIND(s->st_info) == STB_WEAK)