1 // SPDX-License-Identifier: GPL-2.0-only
3 * sorttable.c: Sort the kernel's table
5 * Added ORC unwind tables sort support and other updates:
6 * Copyright (C) 1999-2019 Alibaba Group Holding Limited. by:
7 * Shile Zhang <shile.zhang@linux.alibaba.com>
9 * Copyright 2011 - 2012 Cavium, Inc.
11 * Based on code taken from recortmcount.c which is:
13 * Copyright 2009 John F. Reiser <jreiser@BitWagon.com>. All rights reserved.
15 * Restructured to fit Linux format, as well as other updates:
16 * Copyright 2010 Steven Rostedt <srostedt@redhat.com>, Red Hat Inc.
20 * Strategy: alter the vmlinux file in-place.
23 #include <sys/types.h>
34 #include <tools/be_byteshift.h>
35 #include <tools/le_byteshift.h>
38 #define EM_ARCOMPACT 93
46 #define EM_AARCH64 183
50 #define EM_MICROBLAZE 189
57 static uint32_t (*r)(const uint32_t *);
58 static uint16_t (*r2)(const uint16_t *);
59 static uint64_t (*r8)(const uint64_t *);
60 static void (*w)(uint32_t, uint32_t *);
61 static void (*w2)(uint16_t, uint16_t *);
62 static void (*w8)(uint64_t, uint64_t *);
63 typedef void (*table_sort_t)(char *, int);
66 * Get the whole file as a programming convenience in order to avoid
67 * malloc+lseek+read+free of many pieces. If successful, then mmap
68 * avoids copying unused pieces; else just read the whole file.
69 * Open for both read and write.
71 static void *mmap_file(char const *fname, size_t *size)
77 fd = open(fname, O_RDWR);
82 if (fstat(fd, &sb) < 0) {
86 if (!S_ISREG(sb.st_mode)) {
87 fprintf(stderr, "not a regular file: %s\n", fname);
91 addr = mmap(0, sb.st_size, PROT_READ|PROT_WRITE, MAP_SHARED, fd, 0);
92 if (addr == MAP_FAILED) {
93 fprintf(stderr, "Could not mmap file: %s\n", fname);
104 static uint32_t rbe(const uint32_t *x)
106 return get_unaligned_be32(x);
109 static uint16_t r2be(const uint16_t *x)
111 return get_unaligned_be16(x);
114 static uint64_t r8be(const uint64_t *x)
116 return get_unaligned_be64(x);
119 static uint32_t rle(const uint32_t *x)
121 return get_unaligned_le32(x);
124 static uint16_t r2le(const uint16_t *x)
126 return get_unaligned_le16(x);
129 static uint64_t r8le(const uint64_t *x)
131 return get_unaligned_le64(x);
134 static void wbe(uint32_t val, uint32_t *x)
136 put_unaligned_be32(val, x);
139 static void w2be(uint16_t val, uint16_t *x)
141 put_unaligned_be16(val, x);
144 static void w8be(uint64_t val, uint64_t *x)
146 put_unaligned_be64(val, x);
149 static void wle(uint32_t val, uint32_t *x)
151 put_unaligned_le32(val, x);
154 static void w2le(uint16_t val, uint16_t *x)
156 put_unaligned_le16(val, x);
159 static void w8le(uint64_t val, uint64_t *x)
161 put_unaligned_le64(val, x);
165 * Move reserved section indices SHN_LORESERVE..SHN_HIRESERVE out of
166 * the way to -256..-1, to avoid conflicting with real section
169 #define SPECIAL(i) ((i) - (SHN_HIRESERVE + 1))
171 static inline int is_shndx_special(unsigned int i)
173 return i != SHN_XINDEX && i >= SHN_LORESERVE && i <= SHN_HIRESERVE;
176 /* Accessor for sym->st_shndx, hides ugliness of "64k sections" */
177 static inline unsigned int get_secindex(unsigned int shndx,
178 unsigned int sym_offs,
179 const Elf32_Word *symtab_shndx_start)
181 if (is_shndx_special(shndx))
182 return SPECIAL(shndx);
183 if (shndx != SHN_XINDEX)
185 return r(&symtab_shndx_start[sym_offs]);
188 /* 32 bit and 64 bit are very similar */
189 #include "sorttable.h"
191 #include "sorttable.h"
193 static int compare_relative_table(const void *a, const void *b)
195 int32_t av = (int32_t)r(a);
196 int32_t bv = (int32_t)r(b);
205 static void sort_relative_table(char *extab_image, int image_size)
210 * Do the same thing the runtime sort does, first normalize to
211 * being relative to the start of the section.
213 while (i < image_size) {
214 uint32_t *loc = (uint32_t *)(extab_image + i);
219 qsort(extab_image, image_size / 8, 8, compare_relative_table);
221 /* Now denormalize. */
223 while (i < image_size) {
224 uint32_t *loc = (uint32_t *)(extab_image + i);
230 static void x86_sort_relative_table(char *extab_image, int image_size)
234 while (i < image_size) {
235 uint32_t *loc = (uint32_t *)(extab_image + i);
238 w(r(loc + 1) + i + 4, loc + 1);
239 w(r(loc + 2) + i + 8, loc + 2);
241 i += sizeof(uint32_t) * 3;
244 qsort(extab_image, image_size / 12, 12, compare_relative_table);
247 while (i < image_size) {
248 uint32_t *loc = (uint32_t *)(extab_image + i);
251 w(r(loc + 1) - (i + 4), loc + 1);
252 w(r(loc + 2) - (i + 8), loc + 2);
254 i += sizeof(uint32_t) * 3;
258 static void s390_sort_relative_table(char *extab_image, int image_size)
262 for (i = 0; i < image_size; i += 16) {
263 char *loc = extab_image + i;
266 w(r((uint32_t *)loc) + i, (uint32_t *)loc);
267 w(r((uint32_t *)(loc + 4)) + (i + 4), (uint32_t *)(loc + 4));
269 * 0 is a special self-relative handler value, which means that
270 * handler should be ignored. It is safe, because it means that
271 * handler field points to itself, which should never happen.
272 * When creating extable-relative values, keep it as 0, since
273 * this should never occur either: it would mean that handler
274 * field points to the first extable entry.
276 handler = r8((uint64_t *)(loc + 8));
279 w8(handler, (uint64_t *)(loc + 8));
282 qsort(extab_image, image_size / 16, 16, compare_relative_table);
284 for (i = 0; i < image_size; i += 16) {
285 char *loc = extab_image + i;
288 w(r((uint32_t *)loc) - i, (uint32_t *)loc);
289 w(r((uint32_t *)(loc + 4)) - (i + 4), (uint32_t *)(loc + 4));
290 handler = r8((uint64_t *)(loc + 8));
293 w8(handler, (uint64_t *)(loc + 8));
297 static int do_file(char const *const fname, void *addr)
300 Elf32_Ehdr *ehdr = addr;
301 table_sort_t custom_sort = NULL;
303 switch (ehdr->e_ident[EI_DATA]) {
321 fprintf(stderr, "unrecognized ELF data encoding %d: %s\n",
322 ehdr->e_ident[EI_DATA], fname);
326 if (memcmp(ELFMAG, ehdr->e_ident, SELFMAG) != 0 ||
327 (r2(&ehdr->e_type) != ET_EXEC && r2(&ehdr->e_type) != ET_DYN) ||
328 ehdr->e_ident[EI_VERSION] != EV_CURRENT) {
329 fprintf(stderr, "unrecognized ET_EXEC/ET_DYN file %s\n", fname);
333 switch (r2(&ehdr->e_machine)) {
336 custom_sort = x86_sort_relative_table;
339 custom_sort = s390_sort_relative_table;
345 custom_sort = sort_relative_table;
355 fprintf(stderr, "unrecognized e_machine %d %s\n",
356 r2(&ehdr->e_machine), fname);
360 switch (ehdr->e_ident[EI_CLASS]) {
362 if (r2(&ehdr->e_ehsize) != sizeof(Elf32_Ehdr) ||
363 r2(&ehdr->e_shentsize) != sizeof(Elf32_Shdr)) {
365 "unrecognized ET_EXEC/ET_DYN file: %s\n", fname);
368 rc = do_sort_32(ehdr, fname, custom_sort);
372 Elf64_Ehdr *const ghdr = (Elf64_Ehdr *)ehdr;
373 if (r2(&ghdr->e_ehsize) != sizeof(Elf64_Ehdr) ||
374 r2(&ghdr->e_shentsize) != sizeof(Elf64_Shdr)) {
376 "unrecognized ET_EXEC/ET_DYN file: %s\n",
380 rc = do_sort_64(ghdr, fname, custom_sort);
384 fprintf(stderr, "unrecognized ELF class %d %s\n",
385 ehdr->e_ident[EI_CLASS], fname);
392 int main(int argc, char *argv[])
394 int i, n_error = 0; /* gcc-4.3.0 false positive complaint */
399 fprintf(stderr, "usage: sorttable vmlinux...\n");
403 /* Process each file in turn, allowing deep failure. */
404 for (i = 1; i < argc; i++) {
405 addr = mmap_file(argv[i], &size);
411 if (do_file(argv[i], addr))