1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-only
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun * sorttable.c: Sort the kernel's table
4*4882a593Smuzhiyun *
5*4882a593Smuzhiyun * Added ORC unwind tables sort support and other updates:
6*4882a593Smuzhiyun * Copyright (C) 1999-2019 Alibaba Group Holding Limited. by:
7*4882a593Smuzhiyun * Shile Zhang <shile.zhang@linux.alibaba.com>
8*4882a593Smuzhiyun *
9*4882a593Smuzhiyun * Copyright 2011 - 2012 Cavium, Inc.
10*4882a593Smuzhiyun *
11*4882a593Smuzhiyun * Based on code taken from recortmcount.c which is:
12*4882a593Smuzhiyun *
13*4882a593Smuzhiyun * Copyright 2009 John F. Reiser <jreiser@BitWagon.com>. All rights reserved.
14*4882a593Smuzhiyun *
15*4882a593Smuzhiyun * Restructured to fit Linux format, as well as other updates:
16*4882a593Smuzhiyun * Copyright 2010 Steven Rostedt <srostedt@redhat.com>, Red Hat Inc.
17*4882a593Smuzhiyun */
18*4882a593Smuzhiyun
19*4882a593Smuzhiyun /*
20*4882a593Smuzhiyun * Strategy: alter the vmlinux file in-place.
21*4882a593Smuzhiyun */
22*4882a593Smuzhiyun
23*4882a593Smuzhiyun #include <sys/types.h>
24*4882a593Smuzhiyun #include <sys/mman.h>
25*4882a593Smuzhiyun #include <sys/stat.h>
26*4882a593Smuzhiyun #include <getopt.h>
27*4882a593Smuzhiyun #include <elf.h>
28*4882a593Smuzhiyun #include <fcntl.h>
29*4882a593Smuzhiyun #include <stdio.h>
30*4882a593Smuzhiyun #include <stdlib.h>
31*4882a593Smuzhiyun #include <string.h>
32*4882a593Smuzhiyun #include <unistd.h>
33*4882a593Smuzhiyun
34*4882a593Smuzhiyun #include <tools/be_byteshift.h>
35*4882a593Smuzhiyun #include <tools/le_byteshift.h>
36*4882a593Smuzhiyun
37*4882a593Smuzhiyun #ifndef EM_ARCOMPACT
38*4882a593Smuzhiyun #define EM_ARCOMPACT 93
39*4882a593Smuzhiyun #endif
40*4882a593Smuzhiyun
41*4882a593Smuzhiyun #ifndef EM_XTENSA
42*4882a593Smuzhiyun #define EM_XTENSA 94
43*4882a593Smuzhiyun #endif
44*4882a593Smuzhiyun
45*4882a593Smuzhiyun #ifndef EM_AARCH64
46*4882a593Smuzhiyun #define EM_AARCH64 183
47*4882a593Smuzhiyun #endif
48*4882a593Smuzhiyun
49*4882a593Smuzhiyun #ifndef EM_MICROBLAZE
50*4882a593Smuzhiyun #define EM_MICROBLAZE 189
51*4882a593Smuzhiyun #endif
52*4882a593Smuzhiyun
53*4882a593Smuzhiyun #ifndef EM_ARCV2
54*4882a593Smuzhiyun #define EM_ARCV2 195
55*4882a593Smuzhiyun #endif
56*4882a593Smuzhiyun
57*4882a593Smuzhiyun static uint32_t (*r)(const uint32_t *);
58*4882a593Smuzhiyun static uint16_t (*r2)(const uint16_t *);
59*4882a593Smuzhiyun static uint64_t (*r8)(const uint64_t *);
60*4882a593Smuzhiyun static void (*w)(uint32_t, uint32_t *);
61*4882a593Smuzhiyun static void (*w2)(uint16_t, uint16_t *);
62*4882a593Smuzhiyun static void (*w8)(uint64_t, uint64_t *);
63*4882a593Smuzhiyun typedef void (*table_sort_t)(char *, int);
64*4882a593Smuzhiyun
65*4882a593Smuzhiyun /*
66*4882a593Smuzhiyun * Get the whole file as a programming convenience in order to avoid
67*4882a593Smuzhiyun * malloc+lseek+read+free of many pieces. If successful, then mmap
68*4882a593Smuzhiyun * avoids copying unused pieces; else just read the whole file.
69*4882a593Smuzhiyun * Open for both read and write.
70*4882a593Smuzhiyun */
mmap_file(char const * fname,size_t * size)71*4882a593Smuzhiyun static void *mmap_file(char const *fname, size_t *size)
72*4882a593Smuzhiyun {
73*4882a593Smuzhiyun int fd;
74*4882a593Smuzhiyun struct stat sb;
75*4882a593Smuzhiyun void *addr = NULL;
76*4882a593Smuzhiyun
77*4882a593Smuzhiyun fd = open(fname, O_RDWR);
78*4882a593Smuzhiyun if (fd < 0) {
79*4882a593Smuzhiyun perror(fname);
80*4882a593Smuzhiyun return NULL;
81*4882a593Smuzhiyun }
82*4882a593Smuzhiyun if (fstat(fd, &sb) < 0) {
83*4882a593Smuzhiyun perror(fname);
84*4882a593Smuzhiyun goto out;
85*4882a593Smuzhiyun }
86*4882a593Smuzhiyun if (!S_ISREG(sb.st_mode)) {
87*4882a593Smuzhiyun fprintf(stderr, "not a regular file: %s\n", fname);
88*4882a593Smuzhiyun goto out;
89*4882a593Smuzhiyun }
90*4882a593Smuzhiyun
91*4882a593Smuzhiyun addr = mmap(0, sb.st_size, PROT_READ|PROT_WRITE, MAP_SHARED, fd, 0);
92*4882a593Smuzhiyun if (addr == MAP_FAILED) {
93*4882a593Smuzhiyun fprintf(stderr, "Could not mmap file: %s\n", fname);
94*4882a593Smuzhiyun goto out;
95*4882a593Smuzhiyun }
96*4882a593Smuzhiyun
97*4882a593Smuzhiyun *size = sb.st_size;
98*4882a593Smuzhiyun
99*4882a593Smuzhiyun out:
100*4882a593Smuzhiyun close(fd);
101*4882a593Smuzhiyun return addr;
102*4882a593Smuzhiyun }
103*4882a593Smuzhiyun
rbe(const uint32_t * x)104*4882a593Smuzhiyun static uint32_t rbe(const uint32_t *x)
105*4882a593Smuzhiyun {
106*4882a593Smuzhiyun return get_unaligned_be32(x);
107*4882a593Smuzhiyun }
108*4882a593Smuzhiyun
r2be(const uint16_t * x)109*4882a593Smuzhiyun static uint16_t r2be(const uint16_t *x)
110*4882a593Smuzhiyun {
111*4882a593Smuzhiyun return get_unaligned_be16(x);
112*4882a593Smuzhiyun }
113*4882a593Smuzhiyun
r8be(const uint64_t * x)114*4882a593Smuzhiyun static uint64_t r8be(const uint64_t *x)
115*4882a593Smuzhiyun {
116*4882a593Smuzhiyun return get_unaligned_be64(x);
117*4882a593Smuzhiyun }
118*4882a593Smuzhiyun
rle(const uint32_t * x)119*4882a593Smuzhiyun static uint32_t rle(const uint32_t *x)
120*4882a593Smuzhiyun {
121*4882a593Smuzhiyun return get_unaligned_le32(x);
122*4882a593Smuzhiyun }
123*4882a593Smuzhiyun
r2le(const uint16_t * x)124*4882a593Smuzhiyun static uint16_t r2le(const uint16_t *x)
125*4882a593Smuzhiyun {
126*4882a593Smuzhiyun return get_unaligned_le16(x);
127*4882a593Smuzhiyun }
128*4882a593Smuzhiyun
r8le(const uint64_t * x)129*4882a593Smuzhiyun static uint64_t r8le(const uint64_t *x)
130*4882a593Smuzhiyun {
131*4882a593Smuzhiyun return get_unaligned_le64(x);
132*4882a593Smuzhiyun }
133*4882a593Smuzhiyun
wbe(uint32_t val,uint32_t * x)134*4882a593Smuzhiyun static void wbe(uint32_t val, uint32_t *x)
135*4882a593Smuzhiyun {
136*4882a593Smuzhiyun put_unaligned_be32(val, x);
137*4882a593Smuzhiyun }
138*4882a593Smuzhiyun
w2be(uint16_t val,uint16_t * x)139*4882a593Smuzhiyun static void w2be(uint16_t val, uint16_t *x)
140*4882a593Smuzhiyun {
141*4882a593Smuzhiyun put_unaligned_be16(val, x);
142*4882a593Smuzhiyun }
143*4882a593Smuzhiyun
w8be(uint64_t val,uint64_t * x)144*4882a593Smuzhiyun static void w8be(uint64_t val, uint64_t *x)
145*4882a593Smuzhiyun {
146*4882a593Smuzhiyun put_unaligned_be64(val, x);
147*4882a593Smuzhiyun }
148*4882a593Smuzhiyun
wle(uint32_t val,uint32_t * x)149*4882a593Smuzhiyun static void wle(uint32_t val, uint32_t *x)
150*4882a593Smuzhiyun {
151*4882a593Smuzhiyun put_unaligned_le32(val, x);
152*4882a593Smuzhiyun }
153*4882a593Smuzhiyun
w2le(uint16_t val,uint16_t * x)154*4882a593Smuzhiyun static void w2le(uint16_t val, uint16_t *x)
155*4882a593Smuzhiyun {
156*4882a593Smuzhiyun put_unaligned_le16(val, x);
157*4882a593Smuzhiyun }
158*4882a593Smuzhiyun
w8le(uint64_t val,uint64_t * x)159*4882a593Smuzhiyun static void w8le(uint64_t val, uint64_t *x)
160*4882a593Smuzhiyun {
161*4882a593Smuzhiyun put_unaligned_le64(val, x);
162*4882a593Smuzhiyun }
163*4882a593Smuzhiyun
164*4882a593Smuzhiyun /*
165*4882a593Smuzhiyun * Move reserved section indices SHN_LORESERVE..SHN_HIRESERVE out of
166*4882a593Smuzhiyun * the way to -256..-1, to avoid conflicting with real section
167*4882a593Smuzhiyun * indices.
168*4882a593Smuzhiyun */
169*4882a593Smuzhiyun #define SPECIAL(i) ((i) - (SHN_HIRESERVE + 1))
170*4882a593Smuzhiyun
is_shndx_special(unsigned int i)171*4882a593Smuzhiyun static inline int is_shndx_special(unsigned int i)
172*4882a593Smuzhiyun {
173*4882a593Smuzhiyun return i != SHN_XINDEX && i >= SHN_LORESERVE && i <= SHN_HIRESERVE;
174*4882a593Smuzhiyun }
175*4882a593Smuzhiyun
176*4882a593Smuzhiyun /* Accessor for sym->st_shndx, hides ugliness of "64k sections" */
get_secindex(unsigned int shndx,unsigned int sym_offs,const Elf32_Word * symtab_shndx_start)177*4882a593Smuzhiyun static inline unsigned int get_secindex(unsigned int shndx,
178*4882a593Smuzhiyun unsigned int sym_offs,
179*4882a593Smuzhiyun const Elf32_Word *symtab_shndx_start)
180*4882a593Smuzhiyun {
181*4882a593Smuzhiyun if (is_shndx_special(shndx))
182*4882a593Smuzhiyun return SPECIAL(shndx);
183*4882a593Smuzhiyun if (shndx != SHN_XINDEX)
184*4882a593Smuzhiyun return shndx;
185*4882a593Smuzhiyun return r(&symtab_shndx_start[sym_offs]);
186*4882a593Smuzhiyun }
187*4882a593Smuzhiyun
188*4882a593Smuzhiyun /* 32 bit and 64 bit are very similar */
189*4882a593Smuzhiyun #include "sorttable.h"
190*4882a593Smuzhiyun #define SORTTABLE_64
191*4882a593Smuzhiyun #include "sorttable.h"
192*4882a593Smuzhiyun
compare_relative_table(const void * a,const void * b)193*4882a593Smuzhiyun static int compare_relative_table(const void *a, const void *b)
194*4882a593Smuzhiyun {
195*4882a593Smuzhiyun int32_t av = (int32_t)r(a);
196*4882a593Smuzhiyun int32_t bv = (int32_t)r(b);
197*4882a593Smuzhiyun
198*4882a593Smuzhiyun if (av < bv)
199*4882a593Smuzhiyun return -1;
200*4882a593Smuzhiyun if (av > bv)
201*4882a593Smuzhiyun return 1;
202*4882a593Smuzhiyun return 0;
203*4882a593Smuzhiyun }
204*4882a593Smuzhiyun
sort_relative_table(char * extab_image,int image_size)205*4882a593Smuzhiyun static void sort_relative_table(char *extab_image, int image_size)
206*4882a593Smuzhiyun {
207*4882a593Smuzhiyun int i = 0;
208*4882a593Smuzhiyun
209*4882a593Smuzhiyun /*
210*4882a593Smuzhiyun * Do the same thing the runtime sort does, first normalize to
211*4882a593Smuzhiyun * being relative to the start of the section.
212*4882a593Smuzhiyun */
213*4882a593Smuzhiyun while (i < image_size) {
214*4882a593Smuzhiyun uint32_t *loc = (uint32_t *)(extab_image + i);
215*4882a593Smuzhiyun w(r(loc) + i, loc);
216*4882a593Smuzhiyun i += 4;
217*4882a593Smuzhiyun }
218*4882a593Smuzhiyun
219*4882a593Smuzhiyun qsort(extab_image, image_size / 8, 8, compare_relative_table);
220*4882a593Smuzhiyun
221*4882a593Smuzhiyun /* Now denormalize. */
222*4882a593Smuzhiyun i = 0;
223*4882a593Smuzhiyun while (i < image_size) {
224*4882a593Smuzhiyun uint32_t *loc = (uint32_t *)(extab_image + i);
225*4882a593Smuzhiyun w(r(loc) - i, loc);
226*4882a593Smuzhiyun i += 4;
227*4882a593Smuzhiyun }
228*4882a593Smuzhiyun }
229*4882a593Smuzhiyun
x86_sort_relative_table(char * extab_image,int image_size)230*4882a593Smuzhiyun static void x86_sort_relative_table(char *extab_image, int image_size)
231*4882a593Smuzhiyun {
232*4882a593Smuzhiyun int i = 0;
233*4882a593Smuzhiyun
234*4882a593Smuzhiyun while (i < image_size) {
235*4882a593Smuzhiyun uint32_t *loc = (uint32_t *)(extab_image + i);
236*4882a593Smuzhiyun
237*4882a593Smuzhiyun w(r(loc) + i, loc);
238*4882a593Smuzhiyun w(r(loc + 1) + i + 4, loc + 1);
239*4882a593Smuzhiyun w(r(loc + 2) + i + 8, loc + 2);
240*4882a593Smuzhiyun
241*4882a593Smuzhiyun i += sizeof(uint32_t) * 3;
242*4882a593Smuzhiyun }
243*4882a593Smuzhiyun
244*4882a593Smuzhiyun qsort(extab_image, image_size / 12, 12, compare_relative_table);
245*4882a593Smuzhiyun
246*4882a593Smuzhiyun i = 0;
247*4882a593Smuzhiyun while (i < image_size) {
248*4882a593Smuzhiyun uint32_t *loc = (uint32_t *)(extab_image + i);
249*4882a593Smuzhiyun
250*4882a593Smuzhiyun w(r(loc) - i, loc);
251*4882a593Smuzhiyun w(r(loc + 1) - (i + 4), loc + 1);
252*4882a593Smuzhiyun w(r(loc + 2) - (i + 8), loc + 2);
253*4882a593Smuzhiyun
254*4882a593Smuzhiyun i += sizeof(uint32_t) * 3;
255*4882a593Smuzhiyun }
256*4882a593Smuzhiyun }
257*4882a593Smuzhiyun
s390_sort_relative_table(char * extab_image,int image_size)258*4882a593Smuzhiyun static void s390_sort_relative_table(char *extab_image, int image_size)
259*4882a593Smuzhiyun {
260*4882a593Smuzhiyun int i;
261*4882a593Smuzhiyun
262*4882a593Smuzhiyun for (i = 0; i < image_size; i += 16) {
263*4882a593Smuzhiyun char *loc = extab_image + i;
264*4882a593Smuzhiyun uint64_t handler;
265*4882a593Smuzhiyun
266*4882a593Smuzhiyun w(r((uint32_t *)loc) + i, (uint32_t *)loc);
267*4882a593Smuzhiyun w(r((uint32_t *)(loc + 4)) + (i + 4), (uint32_t *)(loc + 4));
268*4882a593Smuzhiyun /*
269*4882a593Smuzhiyun * 0 is a special self-relative handler value, which means that
270*4882a593Smuzhiyun * handler should be ignored. It is safe, because it means that
271*4882a593Smuzhiyun * handler field points to itself, which should never happen.
272*4882a593Smuzhiyun * When creating extable-relative values, keep it as 0, since
273*4882a593Smuzhiyun * this should never occur either: it would mean that handler
274*4882a593Smuzhiyun * field points to the first extable entry.
275*4882a593Smuzhiyun */
276*4882a593Smuzhiyun handler = r8((uint64_t *)(loc + 8));
277*4882a593Smuzhiyun if (handler)
278*4882a593Smuzhiyun handler += i + 8;
279*4882a593Smuzhiyun w8(handler, (uint64_t *)(loc + 8));
280*4882a593Smuzhiyun }
281*4882a593Smuzhiyun
282*4882a593Smuzhiyun qsort(extab_image, image_size / 16, 16, compare_relative_table);
283*4882a593Smuzhiyun
284*4882a593Smuzhiyun for (i = 0; i < image_size; i += 16) {
285*4882a593Smuzhiyun char *loc = extab_image + i;
286*4882a593Smuzhiyun uint64_t handler;
287*4882a593Smuzhiyun
288*4882a593Smuzhiyun w(r((uint32_t *)loc) - i, (uint32_t *)loc);
289*4882a593Smuzhiyun w(r((uint32_t *)(loc + 4)) - (i + 4), (uint32_t *)(loc + 4));
290*4882a593Smuzhiyun handler = r8((uint64_t *)(loc + 8));
291*4882a593Smuzhiyun if (handler)
292*4882a593Smuzhiyun handler -= i + 8;
293*4882a593Smuzhiyun w8(handler, (uint64_t *)(loc + 8));
294*4882a593Smuzhiyun }
295*4882a593Smuzhiyun }
296*4882a593Smuzhiyun
do_file(char const * const fname,void * addr)297*4882a593Smuzhiyun static int do_file(char const *const fname, void *addr)
298*4882a593Smuzhiyun {
299*4882a593Smuzhiyun int rc = -1;
300*4882a593Smuzhiyun Elf32_Ehdr *ehdr = addr;
301*4882a593Smuzhiyun table_sort_t custom_sort = NULL;
302*4882a593Smuzhiyun
303*4882a593Smuzhiyun switch (ehdr->e_ident[EI_DATA]) {
304*4882a593Smuzhiyun case ELFDATA2LSB:
305*4882a593Smuzhiyun r = rle;
306*4882a593Smuzhiyun r2 = r2le;
307*4882a593Smuzhiyun r8 = r8le;
308*4882a593Smuzhiyun w = wle;
309*4882a593Smuzhiyun w2 = w2le;
310*4882a593Smuzhiyun w8 = w8le;
311*4882a593Smuzhiyun break;
312*4882a593Smuzhiyun case ELFDATA2MSB:
313*4882a593Smuzhiyun r = rbe;
314*4882a593Smuzhiyun r2 = r2be;
315*4882a593Smuzhiyun r8 = r8be;
316*4882a593Smuzhiyun w = wbe;
317*4882a593Smuzhiyun w2 = w2be;
318*4882a593Smuzhiyun w8 = w8be;
319*4882a593Smuzhiyun break;
320*4882a593Smuzhiyun default:
321*4882a593Smuzhiyun fprintf(stderr, "unrecognized ELF data encoding %d: %s\n",
322*4882a593Smuzhiyun ehdr->e_ident[EI_DATA], fname);
323*4882a593Smuzhiyun return -1;
324*4882a593Smuzhiyun }
325*4882a593Smuzhiyun
326*4882a593Smuzhiyun if (memcmp(ELFMAG, ehdr->e_ident, SELFMAG) != 0 ||
327*4882a593Smuzhiyun (r2(&ehdr->e_type) != ET_EXEC && r2(&ehdr->e_type) != ET_DYN) ||
328*4882a593Smuzhiyun ehdr->e_ident[EI_VERSION] != EV_CURRENT) {
329*4882a593Smuzhiyun fprintf(stderr, "unrecognized ET_EXEC/ET_DYN file %s\n", fname);
330*4882a593Smuzhiyun return -1;
331*4882a593Smuzhiyun }
332*4882a593Smuzhiyun
333*4882a593Smuzhiyun switch (r2(&ehdr->e_machine)) {
334*4882a593Smuzhiyun case EM_386:
335*4882a593Smuzhiyun case EM_X86_64:
336*4882a593Smuzhiyun custom_sort = x86_sort_relative_table;
337*4882a593Smuzhiyun break;
338*4882a593Smuzhiyun case EM_S390:
339*4882a593Smuzhiyun custom_sort = s390_sort_relative_table;
340*4882a593Smuzhiyun break;
341*4882a593Smuzhiyun case EM_AARCH64:
342*4882a593Smuzhiyun case EM_PARISC:
343*4882a593Smuzhiyun case EM_PPC:
344*4882a593Smuzhiyun case EM_PPC64:
345*4882a593Smuzhiyun custom_sort = sort_relative_table;
346*4882a593Smuzhiyun break;
347*4882a593Smuzhiyun case EM_ARCOMPACT:
348*4882a593Smuzhiyun case EM_ARCV2:
349*4882a593Smuzhiyun case EM_ARM:
350*4882a593Smuzhiyun case EM_MICROBLAZE:
351*4882a593Smuzhiyun case EM_MIPS:
352*4882a593Smuzhiyun case EM_XTENSA:
353*4882a593Smuzhiyun break;
354*4882a593Smuzhiyun default:
355*4882a593Smuzhiyun fprintf(stderr, "unrecognized e_machine %d %s\n",
356*4882a593Smuzhiyun r2(&ehdr->e_machine), fname);
357*4882a593Smuzhiyun return -1;
358*4882a593Smuzhiyun }
359*4882a593Smuzhiyun
360*4882a593Smuzhiyun switch (ehdr->e_ident[EI_CLASS]) {
361*4882a593Smuzhiyun case ELFCLASS32:
362*4882a593Smuzhiyun if (r2(&ehdr->e_ehsize) != sizeof(Elf32_Ehdr) ||
363*4882a593Smuzhiyun r2(&ehdr->e_shentsize) != sizeof(Elf32_Shdr)) {
364*4882a593Smuzhiyun fprintf(stderr,
365*4882a593Smuzhiyun "unrecognized ET_EXEC/ET_DYN file: %s\n", fname);
366*4882a593Smuzhiyun break;
367*4882a593Smuzhiyun }
368*4882a593Smuzhiyun rc = do_sort_32(ehdr, fname, custom_sort);
369*4882a593Smuzhiyun break;
370*4882a593Smuzhiyun case ELFCLASS64:
371*4882a593Smuzhiyun {
372*4882a593Smuzhiyun Elf64_Ehdr *const ghdr = (Elf64_Ehdr *)ehdr;
373*4882a593Smuzhiyun if (r2(&ghdr->e_ehsize) != sizeof(Elf64_Ehdr) ||
374*4882a593Smuzhiyun r2(&ghdr->e_shentsize) != sizeof(Elf64_Shdr)) {
375*4882a593Smuzhiyun fprintf(stderr,
376*4882a593Smuzhiyun "unrecognized ET_EXEC/ET_DYN file: %s\n",
377*4882a593Smuzhiyun fname);
378*4882a593Smuzhiyun break;
379*4882a593Smuzhiyun }
380*4882a593Smuzhiyun rc = do_sort_64(ghdr, fname, custom_sort);
381*4882a593Smuzhiyun }
382*4882a593Smuzhiyun break;
383*4882a593Smuzhiyun default:
384*4882a593Smuzhiyun fprintf(stderr, "unrecognized ELF class %d %s\n",
385*4882a593Smuzhiyun ehdr->e_ident[EI_CLASS], fname);
386*4882a593Smuzhiyun break;
387*4882a593Smuzhiyun }
388*4882a593Smuzhiyun
389*4882a593Smuzhiyun return rc;
390*4882a593Smuzhiyun }
391*4882a593Smuzhiyun
main(int argc,char * argv[])392*4882a593Smuzhiyun int main(int argc, char *argv[])
393*4882a593Smuzhiyun {
394*4882a593Smuzhiyun int i, n_error = 0; /* gcc-4.3.0 false positive complaint */
395*4882a593Smuzhiyun size_t size = 0;
396*4882a593Smuzhiyun void *addr = NULL;
397*4882a593Smuzhiyun
398*4882a593Smuzhiyun if (argc < 2) {
399*4882a593Smuzhiyun fprintf(stderr, "usage: sorttable vmlinux...\n");
400*4882a593Smuzhiyun return 0;
401*4882a593Smuzhiyun }
402*4882a593Smuzhiyun
403*4882a593Smuzhiyun /* Process each file in turn, allowing deep failure. */
404*4882a593Smuzhiyun for (i = 1; i < argc; i++) {
405*4882a593Smuzhiyun addr = mmap_file(argv[i], &size);
406*4882a593Smuzhiyun if (!addr) {
407*4882a593Smuzhiyun ++n_error;
408*4882a593Smuzhiyun continue;
409*4882a593Smuzhiyun }
410*4882a593Smuzhiyun
411*4882a593Smuzhiyun if (do_file(argv[i], addr))
412*4882a593Smuzhiyun ++n_error;
413*4882a593Smuzhiyun
414*4882a593Smuzhiyun munmap(addr, size);
415*4882a593Smuzhiyun }
416*4882a593Smuzhiyun
417*4882a593Smuzhiyun return !!n_error;
418*4882a593Smuzhiyun }
419