lib/libc/gen/nlist_aout.c

   1 /* $NetBSD: nlist_aout.c,v 1.23 2012/03/21 15:32:26 christos Exp $ */
   2
   3 /*
   4  * Copyright (c) 1989, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  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.
  18  *
  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
  29  * SUCH DAMAGE.
  30  */
  31
  32 /*
  33  * Copyright (c) 1996 Christopher G. Demetriou.  All rights reserved.
  34  *
  35  * Redistribution and use in source and binary forms, with or without
  36  * modification, are permitted provided that the following conditions
  37  * are met:
  38  * 1. Redistributions of source code must retain the above copyright
  39  *    notice, this list of conditions and the following disclaimer.
  40  * 2. Redistributions in binary form must reproduce the above copyright
  41  *    notice, this list of conditions and the following disclaimer in the
  42  *    documentation and/or other materials provided with the distribution.
  43  * 3. All advertising materials mentioning features or use of this software
  44  *    must display the following acknowledgement:
  45  *      This product includes software developed by the University of
  46  *      California, Berkeley and its contributors.
  47  * 4. Neither the name of the University nor the names of its contributors
  48  *    may be used to endorse or promote products derived from this software
  49  *    without specific prior written permission.
  50  *
  51  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  52  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  53  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  54  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  55  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  56  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  57  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  58  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  59  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  60  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  61  * SUCH DAMAGE.
  62  */
  63
  64 #include <sys/cdefs.h>
  65 #if defined(LIBC_SCCS) && !defined(lint)
  66 #if 0
  67 static char sccsid[] = "@(#)nlist.c     8.1 (Berkeley) 6/4/93";
  68 #else
  69 __RCSID("$NetBSD: nlist_aout.c,v 1.23 2012/03/21 15:32:26 christos Exp $");
  70 #endif
  71 #endif /* LIBC_SCCS and not lint */
  72
  73 #include "namespace.h"
  74 #include <sys/param.h>
  75 #include <sys/mman.h>
  76 #include <sys/stat.h>
  77 #include <sys/file.h>
  78
  79 #include <assert.h>
  80 #include <errno.h>
  81 #include <stdio.h>
  82 #include <string.h>
  83 #include <unistd.h>
  84 #include <stdlib.h>
  85
  86 struct nlist;
  87 #include "nlist_private.h"
  88
  89 #ifdef NLIST_AOUT
  90 #include <a.out.h>
  91 #include <sys/exec_aout.h>
  92
  93 int
  94 __fdnlist_aout(int fd, struct nlist *list)
  95 {
  96         struct nlist *p, *s;
  97         char *strtab;
  98         off_t stroff, symoff;
  99         int nent;
 100         size_t strsize, symsize, cc;
 101         struct nlist nbuf[1024];
 102         struct exec exec;
 103         struct stat st;
 104         char *scoreboard, *scored;
 105
 106         _DIAGASSERT(fd != -1);
 107         _DIAGASSERT(list != NULL);
 108
 109         if (pread(fd, &exec, sizeof(exec), (off_t)0) != sizeof(exec) ||
 110             N_BADMAG(exec) || fstat(fd, &st) < 0)
 111                 return (-1);
 112
 113         symoff = N_SYMOFF(exec);
 114         symsize = (size_t)exec.a_syms;
 115         stroff = symoff + symsize;
 116
 117         /* Check for files too large to mmap. */
 118         if ((uintmax_t)(st.st_size - stroff) > (uintmax_t)SIZE_T_MAX) {
 119                 errno = EFBIG;
 120                 return (-1);
 121         }
 122         /*
 123          * Map string table into our address space.  This gives us
 124          * an easy way to randomly access all the strings, without
 125          * making the memory allocation permanent as with malloc/free
 126          * (i.e., munmap will return it to the system).
 127          */
 128         strsize = (size_t)(st.st_size - stroff);
 129         strtab = mmap(NULL, strsize, PROT_READ, MAP_PRIVATE|MAP_FILE,
 130             fd, stroff);
 131         if (strtab == (char *)-1)
 132                 return (-1);
 133         /*
 134          * clean out any left-over information for all valid entries.
 135          * Type and value defined to be 0 if not found; historical
 136          * versions cleared other and desc as well.  Also figure out
 137          * the largest string length so don't read any more of the
 138          * string table than we have to.
 139          *
 140          * XXX clearing anything other than n_type and n_value violates
 141          * the semantics given in the man page.
 142          */
 143         nent = 0;
 144         for (p = list; !ISLAST(p); ++p) {
 145                 p->n_type = 0;
 146                 p->n_other = 0;
 147                 p->n_desc = 0;
 148                 p->n_value = 0;
 149                 ++nent;
 150         }
 151         if (lseek(fd, symoff, SEEK_SET) == -1)
 152                 return (-1);
 153 #if defined(__SSP__) || defined(__SSP_ALL__)
 154         scoreboard = malloc((size_t)nent);
 155 #else
 156         scoreboard = alloca((size_t)nent);
 157 #endif
 158         if (scoreboard == NULL)
 159                 return (-1);
 160         (void)memset(scoreboard, 0, (size_t)nent);
 161
 162         while (symsize > 0) {
 163                 cc = MIN(symsize, sizeof(nbuf));
 164                 if (read(fd, nbuf, cc) != (ssize_t) cc)
 165                         break;
 166                 symsize -= cc;
 167                 for (s = nbuf; cc > 0; ++s, cc -= sizeof(*s)) {
 168                         long soff = s->n_un.n_strx;
 169
 170                         if (soff == 0 || (s->n_type & N_STAB) != 0)
 171                                 continue;
 172                         for (p = list, scored = scoreboard; !ISLAST(p);
 173                             p++, scored++)
 174                                 if (*scored == 0 &&
 175                                     !strcmp(&strtab[(size_t)soff],
 176                                     p->n_un.n_name)) {
 177                                         p->n_value = s->n_value;
 178                                         p->n_type = s->n_type;
 179                                         p->n_desc = s->n_desc;
 180                                         p->n_other = s->n_other;
 181                                         *scored = 1;
 182                                         if (--nent <= 0)
 183                                                 break;
 184                                 }
 185                 }
 186         }
 187         munmap(strtab, strsize);
 188 #if defined(__SSP__) || defined(__SSP_ALL__)
 189         free(scoreboard);
 190 #endif
 191         return (nent);
 192 }
 193 #endif /* NLIST_AOUT */