2 * sortextable.c: Sort the kernel's exception table
4 * Copyright 2011 - 2012 Cavium, Inc.
6 * Based on code taken from recortmcount.c which is:
8 * Copyright 2009 John F. Reiser <jreiser@BitWagon.com>. All rights reserved.
9 * Licensed under the GNU General Public License, version 2 (GPLv2).
11 * Restructured to fit Linux format, as well as other updates:
12 * Copyright 2010 Steven Rostedt <srostedt@redhat.com>, Red Hat Inc.
16 * Strategy: alter the vmlinux file in-place.
19 #include <sys/types.h>
31 #include <tools/be_byteshift.h>
32 #include <tools/le_byteshift.h>
35 #define EM_ARCOMPACT 93
43 #define EM_AARCH64 183
47 #define EM_MICROBLAZE 189
54 static int fd_map
; /* File descriptor for file being modified. */
55 static int mmap_failed
; /* Boolean flag. */
56 static void *ehdr_curr
; /* current ElfXX_Ehdr * for resource cleanup */
57 static struct stat sb
; /* Remember .st_size, etc. */
58 static jmp_buf jmpenv
; /* setjmp/longjmp per-file error escape */
60 /* setjmp() return values */
62 SJ_SETJMP
= 0, /* hardwired first return */
67 /* Per-file resource cleanup when multiple files. */
72 munmap(ehdr_curr
, sb
.st_size
);
76 static void __attribute__((noreturn
))
80 longjmp(jmpenv
, SJ_FAIL
);
84 * Get the whole file as a programming convenience in order to avoid
85 * malloc+lseek+read+free of many pieces. If successful, then mmap
86 * avoids copying unused pieces; else just read the whole file.
87 * Open for both read and write.
89 static void *mmap_file(char const *fname
)
93 fd_map
= open(fname
, O_RDWR
);
94 if (fd_map
< 0 || fstat(fd_map
, &sb
) < 0) {
98 if (!S_ISREG(sb
.st_mode
)) {
99 fprintf(stderr
, "not a regular file: %s\n", fname
);
102 addr
= mmap(0, sb
.st_size
, PROT_READ
|PROT_WRITE
, MAP_SHARED
,
104 if (addr
== MAP_FAILED
) {
106 fprintf(stderr
, "Could not mmap file: %s\n", fname
);
112 static uint64_t r8be(const uint64_t *x
)
114 return get_unaligned_be64(x
);
116 static uint32_t rbe(const uint32_t *x
)
118 return get_unaligned_be32(x
);
120 static uint16_t r2be(const uint16_t *x
)
122 return get_unaligned_be16(x
);
124 static uint64_t r8le(const uint64_t *x
)
126 return get_unaligned_le64(x
);
128 static uint32_t rle(const uint32_t *x
)
130 return get_unaligned_le32(x
);
132 static uint16_t r2le(const uint16_t *x
)
134 return get_unaligned_le16(x
);
137 static void w8be(uint64_t val
, uint64_t *x
)
139 put_unaligned_be64(val
, x
);
141 static void wbe(uint32_t val
, uint32_t *x
)
143 put_unaligned_be32(val
, x
);
145 static void w2be(uint16_t val
, uint16_t *x
)
147 put_unaligned_be16(val
, x
);
149 static void w8le(uint64_t val
, uint64_t *x
)
151 put_unaligned_le64(val
, x
);
153 static void wle(uint32_t val
, uint32_t *x
)
155 put_unaligned_le32(val
, x
);
157 static void w2le(uint16_t val
, uint16_t *x
)
159 put_unaligned_le16(val
, x
);
162 static uint64_t (*r8
)(const uint64_t *);
163 static uint32_t (*r
)(const uint32_t *);
164 static uint16_t (*r2
)(const uint16_t *);
165 static void (*w8
)(uint64_t, uint64_t *);
166 static void (*w
)(uint32_t, uint32_t *);
167 static void (*w2
)(uint16_t, uint16_t *);
169 typedef void (*table_sort_t
)(char *, int);
172 * Move reserved section indices SHN_LORESERVE..SHN_HIRESERVE out of
173 * the way to -256..-1, to avoid conflicting with real section
176 #define SPECIAL(i) ((i) - (SHN_HIRESERVE + 1))
178 static inline int is_shndx_special(unsigned int i
)
180 return i
!= SHN_XINDEX
&& i
>= SHN_LORESERVE
&& i
<= SHN_HIRESERVE
;
183 /* Accessor for sym->st_shndx, hides ugliness of "64k sections" */
184 static inline unsigned int get_secindex(unsigned int shndx
,
185 unsigned int sym_offs
,
186 const Elf32_Word
*symtab_shndx_start
)
188 if (is_shndx_special(shndx
))
189 return SPECIAL(shndx
);
190 if (shndx
!= SHN_XINDEX
)
192 return r(&symtab_shndx_start
[sym_offs
]);
195 /* 32 bit and 64 bit are very similar */
196 #include "sortextable.h"
197 #define SORTEXTABLE_64
198 #include "sortextable.h"
200 static int compare_relative_table(const void *a
, const void *b
)
202 int32_t av
= (int32_t)r(a
);
203 int32_t bv
= (int32_t)r(b
);
212 static void x86_sort_relative_table(char *extab_image
, int image_size
)
217 while (i
< image_size
) {
218 uint32_t *loc
= (uint32_t *)(extab_image
+ i
);
221 w(r(loc
+ 1) + i
+ 4, loc
+ 1);
222 w(r(loc
+ 2) + i
+ 8, loc
+ 2);
224 i
+= sizeof(uint32_t) * 3;
227 qsort(extab_image
, image_size
/ 12, 12, compare_relative_table
);
230 while (i
< image_size
) {
231 uint32_t *loc
= (uint32_t *)(extab_image
+ i
);
234 w(r(loc
+ 1) - (i
+ 4), loc
+ 1);
235 w(r(loc
+ 2) - (i
+ 8), loc
+ 2);
237 i
+= sizeof(uint32_t) * 3;
241 static void sort_relative_table(char *extab_image
, int image_size
)
246 * Do the same thing the runtime sort does, first normalize to
247 * being relative to the start of the section.
250 while (i
< image_size
) {
251 uint32_t *loc
= (uint32_t *)(extab_image
+ i
);
256 qsort(extab_image
, image_size
/ 8, 8, compare_relative_table
);
258 /* Now denormalize. */
260 while (i
< image_size
) {
261 uint32_t *loc
= (uint32_t *)(extab_image
+ i
);
268 do_file(char const *const fname
)
270 table_sort_t custom_sort
;
271 Elf32_Ehdr
*ehdr
= mmap_file(fname
);
274 switch (ehdr
->e_ident
[EI_DATA
]) {
276 fprintf(stderr
, "unrecognized ELF data encoding %d: %s\n",
277 ehdr
->e_ident
[EI_DATA
], fname
);
297 if (memcmp(ELFMAG
, ehdr
->e_ident
, SELFMAG
) != 0
298 || (r2(&ehdr
->e_type
) != ET_EXEC
&& r2(&ehdr
->e_type
) != ET_DYN
)
299 || ehdr
->e_ident
[EI_VERSION
] != EV_CURRENT
) {
300 fprintf(stderr
, "unrecognized ET_EXEC/ET_DYN file %s\n", fname
);
305 switch (r2(&ehdr
->e_machine
)) {
307 fprintf(stderr
, "unrecognized e_machine %d %s\n",
308 r2(&ehdr
->e_machine
), fname
);
313 custom_sort
= x86_sort_relative_table
;
321 custom_sort
= sort_relative_table
;
332 switch (ehdr
->e_ident
[EI_CLASS
]) {
334 fprintf(stderr
, "unrecognized ELF class %d %s\n",
335 ehdr
->e_ident
[EI_CLASS
], fname
);
339 if (r2(&ehdr
->e_ehsize
) != sizeof(Elf32_Ehdr
)
340 || r2(&ehdr
->e_shentsize
) != sizeof(Elf32_Shdr
)) {
342 "unrecognized ET_EXEC/ET_DYN file: %s\n", fname
);
345 do32(ehdr
, fname
, custom_sort
);
348 Elf64_Ehdr
*const ghdr
= (Elf64_Ehdr
*)ehdr
;
349 if (r2(&ghdr
->e_ehsize
) != sizeof(Elf64_Ehdr
)
350 || r2(&ghdr
->e_shentsize
) != sizeof(Elf64_Shdr
)) {
352 "unrecognized ET_EXEC/ET_DYN file: %s\n", fname
);
355 do64(ghdr
, fname
, custom_sort
);
364 main(int argc
, char *argv
[])
366 int n_error
= 0; /* gcc-4.3.0 false positive complaint */
370 fprintf(stderr
, "usage: sortextable vmlinux...\n");
374 /* Process each file in turn, allowing deep failure. */
375 for (i
= 1; i
< argc
; i
++) {
376 char *file
= argv
[i
];
377 int const sjval
= setjmp(jmpenv
);
381 fprintf(stderr
, "internal error: %s\n", file
);
384 case SJ_SETJMP
: /* normal sequence */
385 /* Avoid problems if early cleanup() */
391 case SJ_FAIL
: /* error in do_file or below */
394 case SJ_SUCCEED
: /* premature success */