Home | History | Annotate | Line # | Download | only in gen
nlist_elf32.c revision 1.18
      1  1.18    kleink /*	$NetBSD: nlist_elf32.c,v 1.18 1999/10/25 13:57:11 kleink Exp $	*/
      2   1.1       cgd 
      3   1.1       cgd /*
      4   1.1       cgd  * Copyright (c) 1996 Christopher G. Demetriou.  All rights reserved.
      5   1.1       cgd  *
      6   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      7   1.1       cgd  * modification, are permitted provided that the following conditions
      8   1.1       cgd  * are met:
      9   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     10   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     11   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     12   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     13   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     14   1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     15   1.1       cgd  *    must display the following acknowledgement:
     16   1.3       cgd  *      This product includes software developed by Christopher G. Demetriou
     17   1.3       cgd  *	for the NetBSD Project.
     18   1.3       cgd  * 4. The name of the author may not be used to endorse or promote products
     19   1.3       cgd  *    derived from this software without specific prior written permission
     20   1.1       cgd  *
     21   1.3       cgd  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     22   1.3       cgd  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     23   1.3       cgd  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     24   1.3       cgd  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     25   1.3       cgd  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     26   1.3       cgd  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     27   1.3       cgd  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     28   1.3       cgd  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     29   1.3       cgd  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     30   1.3       cgd  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     31   1.1       cgd  */
     32   1.1       cgd 
     33   1.1       cgd /* If not included by nlist_elf64.c, ELFSIZE won't be defined. */
     34   1.1       cgd #ifndef ELFSIZE
     35   1.1       cgd #define	ELFSIZE		32
     36   1.1       cgd #endif
     37   1.1       cgd 
     38  1.11    kleink #include "namespace.h"
     39   1.1       cgd #include <sys/param.h>
     40   1.1       cgd #include <sys/mman.h>
     41   1.1       cgd #include <sys/stat.h>
     42   1.1       cgd #include <sys/file.h>
     43   1.1       cgd 
     44  1.14     lukem #include <assert.h>
     45   1.1       cgd #include <errno.h>
     46   1.1       cgd #include <stdio.h>
     47   1.1       cgd #include <string.h>
     48   1.1       cgd #include <unistd.h>
     49   1.1       cgd #include <a.out.h>			/* for 'struct nlist' declaration */
     50   1.1       cgd 
     51   1.1       cgd #include "nlist_private.h"
     52   1.1       cgd #if defined(NLIST_ELF32) || defined(NLIST_ELF64)
     53   1.1       cgd #include <sys/exec_elf.h>
     54   1.1       cgd #endif
     55   1.1       cgd 
     56   1.1       cgd #if (defined(NLIST_ELF32) && (ELFSIZE == 32)) || \
     57   1.1       cgd     (defined(NLIST_ELF64) && (ELFSIZE == 64))
     58   1.1       cgd 
     59  1.17   hannken #define	CONCAT(x,y)	__CONCAT(x,y)
     60  1.17   hannken #define	ELFNAME(x)	CONCAT(elf,CONCAT(ELFSIZE,CONCAT(_,x)))
     61  1.17   hannken #define	ELFNAME2(x,y)	CONCAT(x,CONCAT(_elf,CONCAT(ELFSIZE,CONCAT(_,y))))
     62  1.17   hannken #define	ELFNAMEEND(x)	CONCAT(x,CONCAT(_elf,ELFSIZE))
     63  1.17   hannken #define	ELFDEFNNAME(x)	CONCAT(ELF,CONCAT(ELFSIZE,CONCAT(_,x)))
     64  1.17   hannken 
     65  1.12  christos /* No need to check for off < 0 because it is unsigned */
     66  1.12  christos #define	check(off, size)	(off + size > mappedsize)
     67  1.12  christos #define	BAD			goto out
     68  1.12  christos #define	BADUNMAP		goto unmap
     69   1.3       cgd 
     70   1.1       cgd int
     71   1.2       cgd ELFNAMEEND(__fdnlist)(fd, list)
     72   1.8     perry 	int fd;
     73   1.8     perry 	struct nlist *list;
     74   1.1       cgd {
     75   1.2       cgd 	struct stat st;
     76   1.3       cgd 	struct nlist *p;
     77   1.3       cgd 	char *mappedfile, *strtab;
     78   1.3       cgd 	size_t mappedsize;
     79   1.3       cgd 	Elf_Ehdr *ehdrp;
     80   1.3       cgd 	Elf_Shdr *shdrp, *symshdrp, *symstrshdrp;
     81   1.3       cgd 	Elf_Sym *symp;
     82   1.5       cgd 	Elf_Off shdr_off;
     83   1.5       cgd 	Elf_Word shdr_size;
     84   1.3       cgd #if (ELFSIZE == 32)
     85   1.3       cgd 	Elf32_Half nshdr;
     86   1.3       cgd #elif (ELFSIZE == 64)
     87   1.3       cgd 	Elf64_Half nshdr;
     88   1.3       cgd #endif
     89  1.12  christos 	size_t i, nsyms;
     90   1.3       cgd 	int rv, nent;
     91  1.14     lukem 
     92  1.14     lukem 	_DIAGASSERT(fd != -1);
     93  1.14     lukem 	_DIAGASSERT(list != NULL);
     94   1.3       cgd 
     95   1.3       cgd 	rv = -1;
     96   1.3       cgd 
     97   1.6   thorpej 	symshdrp = symstrshdrp = NULL;
     98   1.6   thorpej 
     99   1.3       cgd 	/*
    100   1.4       cgd 	 * If we can't fstat() the file, something bad is going on.
    101   1.3       cgd 	 */
    102   1.3       cgd 	if (fstat(fd, &st) < 0)
    103   1.3       cgd 		BAD;
    104   1.4       cgd 
    105   1.4       cgd 	/*
    106   1.4       cgd 	 * Map the file in its entirety.
    107   1.4       cgd 	 */
    108   1.3       cgd 	if (st.st_size > SIZE_T_MAX) {
    109   1.3       cgd 		errno = EFBIG;
    110   1.3       cgd 		BAD;
    111   1.3       cgd 	}
    112  1.12  christos 	mappedsize = (size_t)st.st_size;
    113  1.13   thorpej 	mappedfile = mmap(NULL, mappedsize, PROT_READ, MAP_PRIVATE|MAP_FILE,
    114  1.12  christos 	    fd, (off_t)0);
    115   1.3       cgd 	if (mappedfile == (char *)-1)
    116   1.3       cgd 		BAD;
    117   1.3       cgd 
    118   1.3       cgd 	/*
    119   1.3       cgd 	 * Make sure we can access the executable's header
    120   1.3       cgd 	 * directly, and make sure the recognize the executable
    121   1.3       cgd 	 * as an ELF binary.
    122   1.3       cgd 	 */
    123   1.3       cgd 	if (check(0, sizeof *ehdrp))
    124   1.3       cgd 		BADUNMAP;
    125  1.12  christos 	ehdrp = (Elf_Ehdr *)(void *)&mappedfile[0];
    126   1.1       cgd 
    127  1.18    kleink 	if (memcmp(ehdrp->e_ident, ELFMAG, SELFMAG) != 0 ||
    128  1.18    kleink 	    ehdrp->e_ident[EI_CLASS] != ELFCLASS)
    129   1.3       cgd 		BADUNMAP;
    130   1.1       cgd 
    131   1.3       cgd 	switch (ehdrp->e_machine) {
    132   1.1       cgd 	ELFDEFNNAME(MACHDEP_ID_CASES)
    133   1.1       cgd 
    134   1.1       cgd 	default:
    135   1.3       cgd 		BADUNMAP;
    136   1.1       cgd 	}
    137   1.1       cgd 
    138   1.2       cgd 	/*
    139   1.3       cgd 	 * Find the symbol list and string table.
    140   1.2       cgd 	 */
    141   1.3       cgd 	nshdr = ehdrp->e_shnum;
    142   1.3       cgd 	shdr_off = ehdrp->e_shoff;
    143   1.3       cgd 	shdr_size = ehdrp->e_shentsize * nshdr;
    144   1.3       cgd 
    145   1.3       cgd 	if (check(shdr_off, shdr_size) ||
    146   1.3       cgd 	    (sizeof *shdrp != ehdrp->e_shentsize))
    147   1.3       cgd 		BADUNMAP;
    148  1.12  christos 	shdrp = (Elf_Shdr *)(void *)&mappedfile[shdr_off];
    149   1.3       cgd 
    150   1.3       cgd 	for (i = 0; i < nshdr; i++) {
    151  1.18    kleink 		if (shdrp[i].sh_type == SHT_SYMTAB) {
    152   1.3       cgd 			symshdrp = &shdrp[i];
    153   1.3       cgd 			symstrshdrp = &shdrp[shdrp[i].sh_link];
    154   1.2       cgd 		}
    155   1.2       cgd 	}
    156   1.2       cgd 
    157   1.3       cgd 	/* Make sure we're not stripped. */
    158   1.6   thorpej 	if (symshdrp == NULL || symshdrp->sh_offset == 0)
    159   1.3       cgd 		BADUNMAP;
    160   1.3       cgd 
    161   1.3       cgd 	/* Make sure the symbols and strings are safely mapped. */
    162   1.3       cgd 	if (check(symshdrp->sh_offset, symshdrp->sh_size))
    163   1.3       cgd 		BADUNMAP;
    164   1.3       cgd 	if (check(symstrshdrp->sh_offset, symstrshdrp->sh_size))
    165   1.3       cgd 		BADUNMAP;
    166   1.3       cgd 
    167  1.12  christos 	symp = (Elf_Sym *)(void *)&mappedfile[symshdrp->sh_offset];
    168   1.3       cgd 	nsyms = symshdrp->sh_size / sizeof(*symp);
    169   1.3       cgd 	strtab = &mappedfile[symstrshdrp->sh_offset];
    170   1.1       cgd 
    171   1.2       cgd 	/*
    172   1.4       cgd 	 * Clean out any left-over information for all valid entries.
    173   1.4       cgd 	 * Type and value are defined to be 0 if not found; historical
    174   1.3       cgd 	 * versions cleared other and desc as well.
    175   1.2       cgd 	 *
    176   1.4       cgd 	 * XXX Clearing anything other than n_type and n_value violates
    177   1.2       cgd 	 * the semantics given in the man page.
    178   1.2       cgd 	 */
    179   1.2       cgd 	nent = 0;
    180   1.2       cgd 	for (p = list; !ISLAST(p); ++p) {
    181   1.2       cgd 		p->n_type = 0;
    182   1.2       cgd 		p->n_other = 0;
    183   1.2       cgd 		p->n_desc = 0;
    184   1.2       cgd 		p->n_value = 0;
    185   1.2       cgd 		++nent;
    186   1.2       cgd 	}
    187   1.2       cgd 
    188   1.3       cgd 	for (i = 0; i < nsyms; i++) {
    189   1.3       cgd 		for (p = list; !ISLAST(p); ++p) {
    190   1.9   mycroft 			const char *nlistname;
    191   1.3       cgd 			char *symtabname;
    192   1.3       cgd 
    193   1.3       cgd 			/* This may be incorrect */
    194   1.3       cgd 			nlistname = p->n_un.n_name;
    195   1.3       cgd 			if (*nlistname == '_')
    196   1.3       cgd 				nlistname++;
    197   1.3       cgd 
    198   1.3       cgd 			symtabname = &strtab[symp[i].st_name];
    199   1.3       cgd 
    200   1.3       cgd 			if (!strcmp(symtabname, nlistname)) {
    201   1.4       cgd 				/*
    202   1.4       cgd 				 * Translate (roughly) from ELF to nlist
    203   1.4       cgd 				 */
    204   1.3       cgd 				p->n_value = symp[i].st_value;
    205  1.18    kleink 				switch (ELFDEFNNAME(ST_TYPE)(symp[i].st_info)) {
    206  1.18    kleink 				case STT_NOTYPE:
    207   1.3       cgd 					p->n_type = N_UNDF;
    208   1.3       cgd 					break;
    209  1.18    kleink 				case STT_OBJECT:
    210   1.3       cgd 					p->n_type = N_DATA;
    211   1.3       cgd 					break;
    212  1.18    kleink 				case STT_FUNC:
    213   1.3       cgd 					p->n_type = N_TEXT;
    214   1.3       cgd 					break;
    215  1.18    kleink 				case STT_FILE:
    216   1.3       cgd 					p->n_type = N_FN;
    217   1.6   thorpej 					break;
    218   1.6   thorpej 				default:
    219   1.6   thorpej 					/* catch other enumerations for gcc */
    220   1.3       cgd 					break;
    221   1.2       cgd 				}
    222  1.18    kleink 				if (ELFDEFNNAME(ST_BIND)(symp[i].st_info) !=
    223  1.18    kleink 				    STB_LOCAL)
    224   1.3       cgd 					p->n_type |= N_EXT;
    225   1.3       cgd 				p->n_desc = 0;			/* XXX */
    226   1.3       cgd 				p->n_other = 0;			/* XXX */
    227   1.3       cgd 
    228   1.3       cgd 				if (--nent <= 0)
    229   1.3       cgd 					goto done;
    230   1.3       cgd 				break;	/* into next run of outer loop */
    231   1.2       cgd 			}
    232   1.2       cgd 		}
    233   1.2       cgd 	}
    234   1.3       cgd 
    235   1.2       cgd done:
    236   1.3       cgd 	rv = nent;
    237   1.3       cgd unmap:
    238   1.3       cgd 	munmap(mappedfile, mappedsize);
    239   1.3       cgd out:
    240   1.3       cgd 	return (rv);
    241   1.1       cgd }
    242   1.1       cgd 
    243   1.1       cgd #endif
    244