/* $OpenBSD: strip.c,v 1.14 2001/07/18 17:17:39 pvalchev Exp $ */ /* * Copyright (c) 1988 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint char copyright[] = "@(#) Copyright (c) 1988 Regents of the University of California.\n\ All rights reserved.\n"; #endif /* not lint */ #ifndef lint /*static char sccsid[] = "from: @(#)strip.c 5.8 (Berkeley) 11/6/91";*/ static char rcsid[] = "$OpenBSD: strip.c,v 1.14 2001/07/18 17:17:39 pvalchev Exp $"; #endif /* not lint */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include "byte.c" #ifdef MID_MACHINE_OVERRIDE #undef MID_MACHINE #define MID_MACHINE MID_MACHINE_OVERRIDE #endif typedef struct exec EXEC; typedef struct nlist NLIST; #define strx n_un.n_strx int s_stab __P((const char *, int, EXEC *, struct stat *)); int s_sym __P((const char *, int, EXEC *, struct stat *)); void usage __P((void)); int xflag = 0; int main(argc, argv) int argc; char *argv[]; { register int fd; EXEC *ep; struct stat sb; int (*sfcn)__P((const char *, int, EXEC *, struct stat *)); int ch, errors; char *fn; sfcn = s_sym; while ((ch = getopt(argc, argv, "dx")) != -1) switch(ch) { case 'x': xflag = 1; /*FALLTHROUGH*/ case 'd': sfcn = s_stab; break; case '?': default: usage(); } argc -= optind; argv += optind; errors = 0; #define ERROR(x) errors |= 1; warnx("%s: %s", fn, strerror(x)); continue; while ((fn = *argv++)) { if ((fd = open(fn, O_RDWR)) < 0) { ERROR(errno); } if (fstat(fd, &sb)) { (void)close(fd); ERROR(errno); } if (sb.st_size < sizeof(EXEC)) { (void)close(fd); ERROR(EFTYPE); } if ((ep = (EXEC *)mmap(NULL, sb.st_size, PROT_READ|PROT_WRITE, MAP_SHARED, fd, (off_t)0)) == MAP_FAILED) { (void)close(fd); ERROR(errno); } if (BAD_OBJECT(*ep)) { munmap((caddr_t)ep, sb.st_size); (void)close(fd); ERROR(EFTYPE); } /* since we're dealing with an mmap there, we have to convert once for dealing with data in memory, and a second time for out */ fix_header_order(ep); errors |= sfcn(fn, fd, ep, &sb); fix_header_order(ep); munmap((caddr_t)ep, sb.st_size); if (close(fd)) { ERROR(errno); } } #undef ERROR exit(errors); } int s_sym(fn, fd, ep, sp) const char *fn; int fd; register EXEC *ep; struct stat *sp; { register char *neweof; #if 0 register char *mineof; #endif int zmagic; zmagic = ep->a_data && (N_GETMAGIC(*ep) == ZMAGIC || N_GETMAGIC(*ep) == QMAGIC); /* * If no symbols or data/text relocation info and * the file data segment size is already minimized, quit. */ if (!ep->a_syms && !ep->a_trsize && !ep->a_drsize) { #if 0 if (!zmagic) return 0; if (sp->st_size < N_TRELOFF(*ep)) #endif return 0; } /* * New file size is the header plus text and data segments; OMAGIC * and NMAGIC formats have the text/data immediately following the * header. ZMAGIC format wastes the rest of of header page. */ neweof = (char *)ep + N_TRELOFF(*ep); #if 0 /* * Unfortunately, this can't work correctly without changing the way * the loader works. We could cap it at one page, or even fiddle with * a_data and a_bss, but this only works for CLBYTES == NBPG. If we * are on a system where, e.g., CLBYTES is 8k and NBPG is 4k, and we * happen to remove 4.5k, we will lose. And we really don't want to * fiddle with pages, because that breaks binary compatibility. Lose. */ if (zmagic) { /* * Get rid of unneeded zeroes at the end of the data segment * to reduce the file size even more. */ mineof = (char *)ep + N_DATOFF(*ep); while (neweof > mineof && neweof[-1] == '\0') neweof--; } #endif /* Set symbol size and relocation info values to 0. */ ep->a_syms = ep->a_trsize = ep->a_drsize = 0; /* Truncate the file. */ if (ftruncate(fd, neweof - (char *)ep)) { warn("%s", fn); return 1; } return 0; } int s_stab(fn, fd, ep, sp) const char *fn; int fd; EXEC *ep; struct stat *sp; { register int cnt, len; register char *nstr, *nstrbase, *p, *strbase; register NLIST *sym, *nsym; u_long allocsize; int mid; NLIST *symbase; /* Quit if no symbols. */ if (ep->a_syms == 0) return 0; if (N_SYMOFF(*ep) >= sp->st_size) { warnx("%s: bad symbol table", fn); return 1; } mid = N_GETMID(*ep); /* * Initialize old and new symbol pointers. They both point to the * beginning of the symbol table in memory, since we're deleting * entries. */ sym = nsym = symbase = (NLIST *)((char *)ep + N_SYMOFF(*ep)); /* * Allocate space for the new string table, initialize old and * new string pointers. Handle the extra long at the beginning * of the string table. */ strbase = (char *)ep + N_STROFF(*ep); allocsize = fix_long_order(*(u_long *)strbase, mid); if ((nstrbase = malloc((u_int) allocsize)) == NULL) { warnx("%s", strerror(ENOMEM)); return 1; } nstr = nstrbase + sizeof(u_long); /* * Read through the symbol table. For each non-debugging symbol, * copy it and save its string in the new string table. Keep * track of the number of symbols. */ for (cnt = ep->a_syms / sizeof(NLIST); cnt--; ++sym) { fix_nlist_order(sym, mid); if (!(sym->n_type & N_STAB) && sym->strx) { *nsym = *sym; nsym->strx = nstr - nstrbase; p = strbase + sym->strx; if (xflag && (!(sym->n_type & N_EXT) || (sym->n_type & ~N_EXT) == N_FN || strcmp(p, "gcc_compiled.") == 0 || strcmp(p, "gcc2_compiled.") == 0 || strncmp(p, "___gnu_compiled_", 16) == 0)) { continue; } len = strlen(p) + 1; bcopy(p, nstr, len); nstr += len; fix_nlist_order(nsym++, mid); } } /* Fill in new symbol table size. */ ep->a_syms = (nsym - symbase) * sizeof(NLIST); /* Fill in the new size of the string table. */ len = nstr - nstrbase; *(u_long *)nstrbase = fix_long_order(len, mid); /* * Copy the new string table into place. Nsym should be pointing * at the address past the last symbol entry. */ bcopy(nstrbase, (void *)nsym, len); free(nstrbase); /* Truncate to the current length. */ if (ftruncate(fd, (char *)nsym + len - (char *)ep)) { warn("%s", fn); return 1; } return 0; } void usage() { (void)fprintf(stderr, "usage: strip [-dx] file ...\n"); exit(1); }