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>
36 #include <tools/be_byteshift.h>
37 #include <tools/le_byteshift.h>
40 #define EM_ARCOMPACT 93
48 #define EM_AARCH64 183
52 #define EM_MICROBLAZE 189
63 static uint32_t (*r)(const uint32_t *);
64 static uint16_t (*r2)(const uint16_t *);
65 static uint64_t (*r8)(const uint64_t *);
66 static void (*w)(uint32_t, uint32_t *);
67 static void (*w2)(uint16_t, uint16_t *);
68 static void (*w8)(uint64_t, uint64_t *);
69 typedef void (*table_sort_t)(char *, int);
72 * Get the whole file as a programming convenience in order to avoid
73 * malloc+lseek+read+free of many pieces. If successful, then mmap
74 * avoids copying unused pieces; else just read the whole file.
75 * Open for both read and write.
77 static void *mmap_file(char const *fname, size_t *size)
83 fd = open(fname, O_RDWR);
88 if (fstat(fd, &sb) < 0) {
92 if (!S_ISREG(sb.st_mode)) {
93 fprintf(stderr, "not a regular file: %s\n", fname);
97 addr = mmap(0, sb.st_size, PROT_READ|PROT_WRITE, MAP_SHARED, fd, 0);
98 if (addr == MAP_FAILED) {
99 fprintf(stderr, "Could not mmap file: %s\n", fname);
110 static uint32_t rbe(const uint32_t *x)
112 return get_unaligned_be32(x);
115 static uint16_t r2be(const uint16_t *x)
117 return get_unaligned_be16(x);
120 static uint64_t r8be(const uint64_t *x)
122 return get_unaligned_be64(x);
125 static uint32_t rle(const uint32_t *x)
127 return get_unaligned_le32(x);
130 static uint16_t r2le(const uint16_t *x)
132 return get_unaligned_le16(x);
135 static uint64_t r8le(const uint64_t *x)
137 return get_unaligned_le64(x);
140 static void wbe(uint32_t val, uint32_t *x)
142 put_unaligned_be32(val, x);
145 static void w2be(uint16_t val, uint16_t *x)
147 put_unaligned_be16(val, x);
150 static void w8be(uint64_t val, uint64_t *x)
152 put_unaligned_be64(val, x);
155 static void wle(uint32_t val, uint32_t *x)
157 put_unaligned_le32(val, x);
160 static void w2le(uint16_t val, uint16_t *x)
162 put_unaligned_le16(val, x);
165 static void w8le(uint64_t val, uint64_t *x)
167 put_unaligned_le64(val, x);
171 * Move reserved section indices SHN_LORESERVE..SHN_HIRESERVE out of
172 * the way to -256..-1, to avoid conflicting with real section
175 #define SPECIAL(i) ((i) - (SHN_HIRESERVE + 1))
177 static inline int is_shndx_special(unsigned int i)
179 return i != SHN_XINDEX && i >= SHN_LORESERVE && i <= SHN_HIRESERVE;
182 /* Accessor for sym->st_shndx, hides ugliness of "64k sections" */
183 static inline unsigned int get_secindex(unsigned int shndx,
184 unsigned int sym_offs,
185 const Elf32_Word *symtab_shndx_start)
187 if (is_shndx_special(shndx))
188 return SPECIAL(shndx);
189 if (shndx != SHN_XINDEX)
191 return r(&symtab_shndx_start[sym_offs]);
194 /* 32 bit and 64 bit are very similar */
195 #include "sorttable.h"
197 #include "sorttable.h"
199 static int compare_relative_table(const void *a, const void *b)
201 int32_t av = (int32_t)r(a);
202 int32_t bv = (int32_t)r(b);
211 static void sort_relative_table(char *extab_image, int image_size)
216 * Do the same thing the runtime sort does, first normalize to
217 * being relative to the start of the section.
219 while (i < image_size) {
220 uint32_t *loc = (uint32_t *)(extab_image + i);
225 qsort(extab_image, image_size / 8, 8, compare_relative_table);
227 /* Now denormalize. */
229 while (i < image_size) {
230 uint32_t *loc = (uint32_t *)(extab_image + i);
236 static void sort_relative_table_with_data(char *extab_image, int image_size)
240 while (i < image_size) {
241 uint32_t *loc = (uint32_t *)(extab_image + i);
244 w(r(loc + 1) + i + 4, loc + 1);
245 /* Don't touch the fixup type or data */
247 i += sizeof(uint32_t) * 3;
250 qsort(extab_image, image_size / 12, 12, compare_relative_table);
253 while (i < image_size) {
254 uint32_t *loc = (uint32_t *)(extab_image + i);
257 w(r(loc + 1) - (i + 4), loc + 1);
258 /* Don't touch the fixup type or data */
260 i += sizeof(uint32_t) * 3;
264 static int do_file(char const *const fname, void *addr)
267 Elf32_Ehdr *ehdr = addr;
268 table_sort_t custom_sort = NULL;
270 switch (ehdr->e_ident[EI_DATA]) {
288 fprintf(stderr, "unrecognized ELF data encoding %d: %s\n",
289 ehdr->e_ident[EI_DATA], fname);
293 if (memcmp(ELFMAG, ehdr->e_ident, SELFMAG) != 0 ||
294 (r2(&ehdr->e_type) != ET_EXEC && r2(&ehdr->e_type) != ET_DYN) ||
295 ehdr->e_ident[EI_VERSION] != EV_CURRENT) {
296 fprintf(stderr, "unrecognized ET_EXEC/ET_DYN file %s\n", fname);
300 switch (r2(&ehdr->e_machine)) {
306 custom_sort = sort_relative_table_with_data;
311 custom_sort = sort_relative_table;
321 fprintf(stderr, "unrecognized e_machine %d %s\n",
322 r2(&ehdr->e_machine), fname);
326 switch (ehdr->e_ident[EI_CLASS]) {
328 if (r2(&ehdr->e_ehsize) != sizeof(Elf32_Ehdr) ||
329 r2(&ehdr->e_shentsize) != sizeof(Elf32_Shdr)) {
331 "unrecognized ET_EXEC/ET_DYN file: %s\n", fname);
334 rc = do_sort_32(ehdr, fname, custom_sort);
338 Elf64_Ehdr *const ghdr = (Elf64_Ehdr *)ehdr;
339 if (r2(&ghdr->e_ehsize) != sizeof(Elf64_Ehdr) ||
340 r2(&ghdr->e_shentsize) != sizeof(Elf64_Shdr)) {
342 "unrecognized ET_EXEC/ET_DYN file: %s\n",
346 rc = do_sort_64(ghdr, fname, custom_sort);
350 fprintf(stderr, "unrecognized ELF class %d %s\n",
351 ehdr->e_ident[EI_CLASS], fname);
358 int main(int argc, char *argv[])
360 int i, n_error = 0; /* gcc-4.3.0 false positive complaint */
365 fprintf(stderr, "usage: sorttable vmlinux...\n");
369 /* Process each file in turn, allowing deep failure. */
370 for (i = 1; i < argc; i++) {
371 addr = mmap_file(argv[i], &size);
377 if (do_file(argv[i], addr))