Annotation of src/usr.bin/strip/strip.c, Revision 1.28
1.28 ! jmc 1: /* $OpenBSD: strip.c,v 1.27 2010/05/24 20:07:07 deraadt Exp $ */
1.2 deraadt 2:
1.1 deraadt 3: /*
4: * Copyright (c) 1988 Regents of the University of California.
5: * 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.
1.19 millert 15: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 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:
1.4 deraadt 32: #include <sys/param.h>
1.1 deraadt 33: #include <sys/types.h>
34: #include <sys/stat.h>
35: #include <sys/mman.h>
36: #include <fcntl.h>
37: #include <errno.h>
38: #include <a.out.h>
39: #include <unistd.h>
40: #include <stdio.h>
41: #include <stdlib.h>
42: #include <string.h>
1.7 mickey 43: #include <err.h>
1.11 espie 44: #include <ranlib.h>
45: #include "byte.c"
1.10 niklas 46:
47: #ifdef MID_MACHINE_OVERRIDE
48: #undef MID_MACHINE
49: #define MID_MACHINE MID_MACHINE_OVERRIDE
1.21 mickey 50: #if MID_MACHINE_OVERRIDE == MID_M68K
51: #undef __LDPGSZ
52: #undef ELF_TARG_DATA
53: #undef ELF_TARG_MACH
54: #include "m68k/exec.h"
1.22 miod 55: #elif MID_MACHINE_OVERRIDE == MID_M88K
56: #undef __LDPGSZ
57: #undef ELF_TARG_DATA
58: #undef ELF_TARG_MACH
59: #include "m88k/exec.h"
1.21 mickey 60: #endif
1.10 niklas 61: #endif
1.1 deraadt 62:
63: typedef struct exec EXEC;
64: typedef struct nlist NLIST;
65:
66: #define strx n_un.n_strx
67:
1.17 espie 68: int s_stab(const char *, int, EXEC *, struct stat *, off_t *);
69: int s_sym(const char *, int, EXEC *, struct stat *, off_t *);
1.16 millert 70: void usage(void);
1.1 deraadt 71:
72: int xflag = 0;
1.27 deraadt 73:
1.9 deraadt 74: int
1.20 deraadt 75: main(int argc, char *argv[])
1.1 deraadt 76: {
1.15 mpech 77: int fd;
1.1 deraadt 78: EXEC *ep;
79: struct stat sb;
1.17 espie 80: int (*sfcn)(const char *, int, EXEC *, struct stat *, off_t *);
1.1 deraadt 81: int ch, errors;
1.27 deraadt 82: char *fn, *ofile = NULL;
1.17 espie 83: off_t newsize;
1.1 deraadt 84:
85: sfcn = s_sym;
1.27 deraadt 86: while ((ch = getopt(argc, argv, "dxo:")) != -1)
1.1 deraadt 87: switch(ch) {
1.27 deraadt 88: case 'x':
89: xflag = 1;
90: /*FALLTHROUGH*/
1.1 deraadt 91: case 'd':
92: sfcn = s_stab;
93: break;
1.27 deraadt 94: case 'o':
95: ofile = optarg;
96: break;
1.1 deraadt 97: case '?':
98: default:
99: usage();
100: }
101: argc -= optind;
102: argv += optind;
103:
1.27 deraadt 104: if (ofile != NULL && argc > 1)
105: usage();
1.1 deraadt 106: errors = 0;
1.8 mickey 107: #define ERROR(x) errors |= 1; warnx("%s: %s", fn, strerror(x)); continue;
1.9 deraadt 108: while ((fn = *argv++)) {
1.27 deraadt 109: if (ofile) {
110: char buf[8192];
111: ssize_t wn;
112: size_t rn;
113: off_t off;
114: int wfd;
115:
116: if ((fd = open(fn, O_RDONLY)) < 0) {
117: ERROR(errno);
118: break;
119: }
120: if ((wfd = open(ofile, O_RDWR|O_CREAT)) < 0) {
121: ERROR(errno);
122: break;
123: }
124: do {
125: rn = read(fd, buf, sizeof buf);
126: if (rn == (ssize_t)-1) {
127: int save_errno = errno;
128:
129: unlink(ofile);
130: ERROR(save_errno);
131: exit(errors);
132: }
133: if (rn == 0)
134: break;
135:
136: off = 0;
137: while (rn - off > 0) {
138: wn = write(wfd, buf + off, rn - off);
139: if (wn == (ssize_t)-1) {
140: int save_errno = errno;
141:
142: unlink(ofile);
143: ERROR(save_errno);
144: exit(errors);
145: }
146: off += wn;
147: }
148: } while (rn > 0);
149:
150: fn = ofile;
151: close(fd);
152: fd = wfd;
153: } else if ((fd = open(fn, O_RDWR)) < 0) {
1.1 deraadt 154: ERROR(errno);
155: }
1.27 deraadt 156: if (fstat(fd, &sb)) {
1.1 deraadt 157: (void)close(fd);
158: ERROR(errno);
159: }
160: if (sb.st_size < sizeof(EXEC)) {
161: (void)close(fd);
162: ERROR(EFTYPE);
163: }
164: if ((ep = (EXEC *)mmap(NULL, sb.st_size, PROT_READ|PROT_WRITE,
1.13 art 165: MAP_SHARED, fd, (off_t)0)) == MAP_FAILED) {
1.1 deraadt 166: (void)close(fd);
167: ERROR(errno);
168: }
1.11 espie 169: if (BAD_OBJECT(*ep)) {
1.1 deraadt 170: munmap((caddr_t)ep, sb.st_size);
171: (void)close(fd);
172: ERROR(EFTYPE);
173: }
1.25 sobrado 174: /*
175: * Since we're dealing with an mmap there, we have to convert
176: * once for dealing with data in memory, and a second time
177: * for out.
1.11 espie 178: */
179: fix_header_order(ep);
1.17 espie 180: newsize = 0;
181: errors |= sfcn(fn, fd, ep, &sb, &newsize);
1.11 espie 182: fix_header_order(ep);
1.1 deraadt 183: munmap((caddr_t)ep, sb.st_size);
1.17 espie 184: if (newsize && ftruncate(fd, newsize)) {
185: warn("%s", fn);
186: errors = 1;
187: }
1.1 deraadt 188: if (close(fd)) {
189: ERROR(errno);
190: }
191: }
192: #undef ERROR
193: exit(errors);
194: }
195:
196: int
1.20 deraadt 197: s_sym(const char *fn, int fd, EXEC *ep, struct stat *sp, off_t *sz)
1.1 deraadt 198: {
1.15 mpech 199: char *neweof;
1.14 pvalchev 200: #if 0
1.15 mpech 201: char *mineof;
1.14 pvalchev 202: #endif
1.1 deraadt 203: int zmagic;
204:
205: zmagic = ep->a_data &&
206: (N_GETMAGIC(*ep) == ZMAGIC || N_GETMAGIC(*ep) == QMAGIC);
207:
208: /*
209: * If no symbols or data/text relocation info and
210: * the file data segment size is already minimized, quit.
211: */
212: if (!ep->a_syms && !ep->a_trsize && !ep->a_drsize) {
213: #if 0
214: if (!zmagic)
215: return 0;
216: if (sp->st_size < N_TRELOFF(*ep))
217: #endif
218: return 0;
219: }
220:
221: /*
222: * New file size is the header plus text and data segments; OMAGIC
223: * and NMAGIC formats have the text/data immediately following the
224: * header. ZMAGIC format wastes the rest of of header page.
225: */
226: neweof = (char *)ep + N_TRELOFF(*ep);
227:
228: #if 0
229: /*
230: * Unfortunately, this can't work correctly without changing the way
231: * the loader works. We could cap it at one page, or even fiddle with
232: * a_data and a_bss, but this only works for CLBYTES == NBPG. If we
233: * are on a system where, e.g., CLBYTES is 8k and NBPG is 4k, and we
234: * happen to remove 4.5k, we will lose. And we really don't want to
235: * fiddle with pages, because that breaks binary compatibility. Lose.
236: */
237:
238: if (zmagic) {
239: /*
240: * Get rid of unneeded zeroes at the end of the data segment
241: * to reduce the file size even more.
242: */
243: mineof = (char *)ep + N_DATOFF(*ep);
244: while (neweof > mineof && neweof[-1] == '\0')
245: neweof--;
246: }
247: #endif
248:
249: /* Set symbol size and relocation info values to 0. */
250: ep->a_syms = ep->a_trsize = ep->a_drsize = 0;
251:
252: /* Truncate the file. */
1.17 espie 253: *sz = neweof - (char *)ep;
1.1 deraadt 254:
255: return 0;
256: }
257:
258: int
1.20 deraadt 259: s_stab(const char *fn, int fd, EXEC *ep, struct stat *sp, off_t *sz)
1.1 deraadt 260: {
1.15 mpech 261: int cnt, len;
1.18 espie 262: char *nstr, *nstrbase=0, *used=0, *p, *strbase;
1.15 mpech 263: NLIST *sym, *nsym;
1.11 espie 264: u_long allocsize;
265: int mid;
1.1 deraadt 266: NLIST *symbase;
1.18 espie 267: unsigned int *mapping=0;
268: int error=1;
269: unsigned int nsyms;
270: struct relocation_info *reloc_base;
271: unsigned int i, j;
1.1 deraadt 272:
273: /* Quit if no symbols. */
274: if (ep->a_syms == 0)
275: return 0;
276:
277: if (N_SYMOFF(*ep) >= sp->st_size) {
1.7 mickey 278: warnx("%s: bad symbol table", fn);
1.1 deraadt 279: return 1;
280: }
281:
1.11 espie 282: mid = N_GETMID(*ep);
283:
1.1 deraadt 284: /*
285: * Initialize old and new symbol pointers. They both point to the
286: * beginning of the symbol table in memory, since we're deleting
287: * entries.
288: */
289: sym = nsym = symbase = (NLIST *)((char *)ep + N_SYMOFF(*ep));
290:
291: /*
292: * Allocate space for the new string table, initialize old and
293: * new string pointers. Handle the extra long at the beginning
294: * of the string table.
295: */
296: strbase = (char *)ep + N_STROFF(*ep);
1.23 mickey 297: allocsize = fix_32_order(*(u_long *)strbase, mid);
1.11 espie 298: if ((nstrbase = malloc((u_int) allocsize)) == NULL) {
1.7 mickey 299: warnx("%s", strerror(ENOMEM));
1.18 espie 300: goto end;
1.1 deraadt 301: }
302: nstr = nstrbase + sizeof(u_long);
303:
1.18 espie 304: /* okay, so we also need to keep symbol numbers for relocations. */
305: nsyms = ep->a_syms/ sizeof(NLIST);
306: used = calloc(nsyms, 1);
307: if (!used) {
308: warnx("%s", strerror(ENOMEM));
309: goto end;
310: }
1.24 deraadt 311: mapping = calloc(nsyms, sizeof(unsigned int));
1.18 espie 312: if (!mapping) {
313: warnx("%s", strerror(ENOMEM));
314: goto end;
315: }
316:
317: if ((ep->a_trsize || ep->a_drsize) && byte_sex(mid) != BYTE_ORDER) {
318: warnx("%s: cross-stripping not supported", fn);
319: goto end;
320: }
321:
322: /* first check the relocations for used symbols, and mark them */
323: /* text */
324: reloc_base = (struct relocation_info *) ((char *)ep + N_TRELOFF(*ep));
325: if (N_TRELOFF(*ep) + ep->a_trsize > sp->st_size) {
326: warnx("%s: bad text relocation", fn);
327: goto end;
328: }
329: for (i = 0; i < ep->a_trsize / sizeof(struct relocation_info); i++) {
330: if (!reloc_base[i].r_extern)
331: continue;
332: if (reloc_base[i].r_symbolnum > nsyms) {
333: warnx("%s: bad symbol number in text relocation", fn);
334: goto end;
335: }
336: used[reloc_base[i].r_symbolnum] = 1;
337: }
338: /* data */
339: reloc_base = (struct relocation_info *) ((char *)ep + N_DRELOFF(*ep));
340: if (N_DRELOFF(*ep) + ep->a_drsize > sp->st_size) {
341: warnx("%s: bad data relocation", fn);
342: goto end;
343: }
344: for (i = 0; i < ep->a_drsize / sizeof(struct relocation_info); i++) {
345: if (!reloc_base[i].r_extern)
346: continue;
347: if (reloc_base[i].r_symbolnum > nsyms) {
348: warnx("%s: bad symbol number in data relocation", fn);
349: goto end;
350: }
351: used[reloc_base[i].r_symbolnum] = 1;
352: }
353:
1.1 deraadt 354: /*
355: * Read through the symbol table. For each non-debugging symbol,
356: * copy it and save its string in the new string table. Keep
357: * track of the number of symbols.
358: */
1.18 espie 359: for (cnt = nsyms, i = 0, j = 0; cnt--; ++sym, ++i) {
1.11 espie 360: fix_nlist_order(sym, mid);
1.1 deraadt 361: if (!(sym->n_type & N_STAB) && sym->strx) {
362: *nsym = *sym;
363: nsym->strx = nstr - nstrbase;
364: p = strbase + sym->strx;
1.27 deraadt 365: if (xflag && !used[i] &&
366: (!(sym->n_type & N_EXT) ||
367: (sym->n_type & ~N_EXT) == N_FN ||
368: strcmp(p, "gcc_compiled.") == 0 ||
369: strcmp(p, "gcc2_compiled.") == 0 ||
370: strncmp(p, "___gnu_compiled_", 16) == 0)) {
371: continue;
372: }
1.1 deraadt 373: len = strlen(p) + 1;
1.18 espie 374: mapping[i] = j++;
1.17 espie 375: if (N_STROFF(*ep) + sym->strx + len > sp->st_size) {
376: warnx("%s: bad symbol table", fn);
1.18 espie 377: goto end;
1.17 espie 378: }
1.1 deraadt 379: bcopy(p, nstr, len);
380: nstr += len;
1.11 espie 381: fix_nlist_order(nsym++, mid);
1.1 deraadt 382: }
1.11 espie 383: }
1.1 deraadt 384:
1.18 espie 385: /* renumber symbol relocations */
386: /* text */
387: reloc_base = (struct relocation_info *) ((char *)ep + N_TRELOFF(*ep));
388: for (i = 0; i < ep->a_trsize / sizeof(struct relocation_info); i++) {
389: if (!reloc_base[i].r_extern)
390: continue;
391: reloc_base[i].r_symbolnum = mapping[reloc_base[i].r_symbolnum];
392: }
393: /* data */
394: reloc_base = (struct relocation_info *) ((char *)ep + N_DRELOFF(*ep));
395: for (i = 0; i < ep->a_drsize / sizeof(struct relocation_info); i++) {
396: if (!reloc_base[i].r_extern)
397: continue;
398: reloc_base[i].r_symbolnum = mapping[reloc_base[i].r_symbolnum];
399: }
400:
1.1 deraadt 401: /* Fill in new symbol table size. */
402: ep->a_syms = (nsym - symbase) * sizeof(NLIST);
403:
404: /* Fill in the new size of the string table. */
1.11 espie 405: len = nstr - nstrbase;
1.23 mickey 406: *(u_long *)nstrbase = fix_32_order(len, mid);
1.1 deraadt 407:
408: /*
409: * Copy the new string table into place. Nsym should be pointing
410: * at the address past the last symbol entry.
411: */
412: bcopy(nstrbase, (void *)nsym, len);
1.18 espie 413: error = 0;
414: end:
1.1 deraadt 415: free(nstrbase);
1.18 espie 416: free(used);
417: free(mapping);
1.1 deraadt 418:
419: /* Truncate to the current length. */
1.17 espie 420: *sz = (char *)nsym + len - (char *)ep;
1.1 deraadt 421:
1.18 espie 422: return error;
1.1 deraadt 423: }
424:
425: void
1.20 deraadt 426: usage(void)
1.1 deraadt 427: {
1.21 mickey 428: extern char *__progname;
429:
1.28 ! jmc 430: fprintf(stderr, "usage: %s [-dx] [-o outfile] file ...\n", __progname);
1.1 deraadt 431: exit(1);
432: }
433:
![[BACK]](/icons/back.gif){kind=icon}
Return to strip.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / strip