]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blame - scripts/kallsyms.c
Merge tag 'for_linus' of git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost
[mirror_ubuntu-zesty-kernel.git] / scripts / kallsyms.c
CommitLineData
1da177e4
LT
1/* Generate assembler source containing symbol information
2 *
3 * Copyright 2002 by Kai Germaschewski
4 *
5 * This software may be used and distributed according to the terms
6 * of the GNU General Public License, incorporated herein by reference.
7 *
8 * Usage: nm -n vmlinux | scripts/kallsyms [--all-symbols] > symbols.S
9 *
1da177e4
LT
10 * Table compression uses all the unused char codes on the symbols and
11 * maps these to the most used substrings (tokens). For instance, it might
12 * map char code 0xF7 to represent "write_" and then in every symbol where
13 * "write_" appears it can be replaced by 0xF7, saving 5 bytes.
14 * The used codes themselves are also placed in the table so that the
15 * decompresion can work without "special cases".
16 * Applied to kernel symbols, this usually produces a compression ratio
17 * of about 50%.
18 *
19 */
20
21#include <stdio.h>
22#include <stdlib.h>
23#include <string.h>
24#include <ctype.h>
2213e9a6 25#include <limits.h>
1da177e4 26
17b1f0de
MF
27#ifndef ARRAY_SIZE
28#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof(arr[0]))
29#endif
30
9281acea 31#define KSYM_NAME_LEN 128
1da177e4 32
1da177e4
LT
33struct sym_entry {
34 unsigned long long addr;
b3dbb4ec 35 unsigned int len;
f2df3f65 36 unsigned int start_pos;
1da177e4 37 unsigned char *sym;
8c996940 38 unsigned int percpu_absolute;
1da177e4
LT
39};
40
78eb7159
KC
41struct addr_range {
42 const char *start_sym, *end_sym;
17b1f0de
MF
43 unsigned long long start, end;
44};
45
46static unsigned long long _text;
2213e9a6 47static unsigned long long relative_base;
78eb7159 48static struct addr_range text_ranges[] = {
17b1f0de
MF
49 { "_stext", "_etext" },
50 { "_sinittext", "_einittext" },
51 { "_stext_l1", "_etext_l1" }, /* Blackfin on-chip L1 inst SRAM */
52 { "_stext_l2", "_etext_l2" }, /* Blackfin on-chip L2 SRAM */
53};
54#define text_range_text (&text_ranges[0])
55#define text_range_inittext (&text_ranges[1])
56
c6bda7c9
RR
57static struct addr_range percpu_range = {
58 "__per_cpu_start", "__per_cpu_end", -1ULL, 0
59};
60
1da177e4 61static struct sym_entry *table;
b3dbb4ec 62static unsigned int table_size, table_cnt;
1da177e4 63static int all_symbols = 0;
c6bda7c9 64static int absolute_percpu = 0;
41f11a4f 65static char symbol_prefix_char = '\0';
2213e9a6 66static int base_relative = 0;
1da177e4 67
b3dbb4ec 68int token_profit[0x10000];
1da177e4
LT
69
70/* the table that holds the result of the compression */
b3dbb4ec 71unsigned char best_table[256][2];
1da177e4
LT
72unsigned char best_table_len[256];
73
74
b3dbb4ec 75static void usage(void)
1da177e4 76{
f6537f2f
ML
77 fprintf(stderr, "Usage: kallsyms [--all-symbols] "
78 "[--symbol-prefix=<prefix char>] "
79 "[--page-offset=<CONFIG_PAGE_OFFSET>] "
2213e9a6 80 "[--base-relative] < in.map > out.S\n");
1da177e4
LT
81 exit(1);
82}
83
84/*
85 * This ignores the intensely annoying "mapping symbols" found
86 * in ARM ELF files: $a, $t and $d.
87 */
b3dbb4ec 88static inline int is_arm_mapping_symbol(const char *str)
1da177e4 89{
6c34f1f5 90 return str[0] == '$' && strchr("axtd", str[1])
1da177e4
LT
91 && (str[2] == '\0' || str[2] == '.');
92}
93
78eb7159
KC
94static int check_symbol_range(const char *sym, unsigned long long addr,
95 struct addr_range *ranges, int entries)
17b1f0de
MF
96{
97 size_t i;
78eb7159 98 struct addr_range *ar;
17b1f0de 99
78eb7159
KC
100 for (i = 0; i < entries; ++i) {
101 ar = &ranges[i];
17b1f0de 102
78eb7159
KC
103 if (strcmp(sym, ar->start_sym) == 0) {
104 ar->start = addr;
17b1f0de 105 return 0;
78eb7159
KC
106 } else if (strcmp(sym, ar->end_sym) == 0) {
107 ar->end = addr;
17b1f0de
MF
108 return 0;
109 }
110 }
111
112 return 1;
113}
114
b3dbb4ec 115static int read_symbol(FILE *in, struct sym_entry *s)
1da177e4
LT
116{
117 char str[500];
b3dbb4ec 118 char *sym, stype;
1da177e4
LT
119 int rc;
120
b3dbb4ec 121 rc = fscanf(in, "%llx %c %499s\n", &s->addr, &stype, str);
1da177e4 122 if (rc != 3) {
ef894870
JS
123 if (rc != EOF && fgets(str, 500, in) == NULL)
124 fprintf(stderr, "Read error or end of file.\n");
1da177e4
LT
125 return -1;
126 }
f3462aa9 127 if (strlen(str) > KSYM_NAME_LEN) {
6f62259b 128 fprintf(stderr, "Symbol %s too long for kallsyms (%zu vs %d).\n"
bb66fc67 129 "Please increase KSYM_NAME_LEN both in kernel and kallsyms.c\n",
f3462aa9
AK
130 str, strlen(str), KSYM_NAME_LEN);
131 return -1;
132 }
1da177e4 133
41f11a4f
YS
134 sym = str;
135 /* skip prefix char */
136 if (symbol_prefix_char && str[0] == symbol_prefix_char)
137 sym++;
138
1da177e4 139 /* Ignore most absolute/undefined (?) symbols. */
fd593d12
EB
140 if (strcmp(sym, "_text") == 0)
141 _text = s->addr;
78eb7159
KC
142 else if (check_symbol_range(sym, s->addr, text_ranges,
143 ARRAY_SIZE(text_ranges)) == 0)
17b1f0de 144 /* nothing to do */;
b3dbb4ec 145 else if (toupper(stype) == 'A')
1da177e4
LT
146 {
147 /* Keep these useful absolute symbols */
41f11a4f
YS
148 if (strcmp(sym, "__kernel_syscall_via_break") &&
149 strcmp(sym, "__kernel_syscall_via_epc") &&
150 strcmp(sym, "__kernel_sigtramp") &&
151 strcmp(sym, "__gp"))
1da177e4
LT
152 return -1;
153
154 }
b3dbb4ec 155 else if (toupper(stype) == 'U' ||
41f11a4f 156 is_arm_mapping_symbol(sym))
1da177e4 157 return -1;
6f00df24
RB
158 /* exclude also MIPS ELF local symbols ($L123 instead of .L123) */
159 else if (str[0] == '$')
160 return -1;
aab34ac8
SR
161 /* exclude debugging symbols */
162 else if (stype == 'N')
163 return -1;
1da177e4
LT
164
165 /* include the type field in the symbol name, so that it gets
166 * compressed together */
167 s->len = strlen(str) + 1;
b3dbb4ec 168 s->sym = malloc(s->len + 1);
f1a136e0
JJ
169 if (!s->sym) {
170 fprintf(stderr, "kallsyms failure: "
171 "unable to allocate required amount of memory\n");
172 exit(EXIT_FAILURE);
173 }
b3dbb4ec
PM
174 strcpy((char *)s->sym + 1, str);
175 s->sym[0] = stype;
1da177e4 176
8c996940
AB
177 s->percpu_absolute = 0;
178
c6bda7c9
RR
179 /* Record if we've found __per_cpu_start/end. */
180 check_symbol_range(sym, s->addr, &percpu_range, 1);
181
1da177e4
LT
182 return 0;
183}
184
78eb7159
KC
185static int symbol_in_range(struct sym_entry *s, struct addr_range *ranges,
186 int entries)
17b1f0de
MF
187{
188 size_t i;
78eb7159 189 struct addr_range *ar;
17b1f0de 190
78eb7159
KC
191 for (i = 0; i < entries; ++i) {
192 ar = &ranges[i];
17b1f0de 193
78eb7159 194 if (s->addr >= ar->start && s->addr <= ar->end)
ac6ca5c8 195 return 1;
17b1f0de
MF
196 }
197
ac6ca5c8 198 return 0;
17b1f0de
MF
199}
200
b3dbb4ec 201static int symbol_valid(struct sym_entry *s)
1da177e4
LT
202{
203 /* Symbols which vary between passes. Passes 1 and 2 must have
2ea03891
SR
204 * identical symbol lists. The kallsyms_* symbols below are only added
205 * after pass 1, they would be included in pass 2 when --all-symbols is
206 * specified so exclude them to get a stable symbol list.
1da177e4
LT
207 */
208 static char *special_symbols[] = {
2ea03891 209 "kallsyms_addresses",
2213e9a6
AB
210 "kallsyms_offsets",
211 "kallsyms_relative_base",
2ea03891
SR
212 "kallsyms_num_syms",
213 "kallsyms_names",
214 "kallsyms_markers",
215 "kallsyms_token_table",
216 "kallsyms_token_index",
217
1da177e4
LT
218 /* Exclude linker generated symbols which vary between passes */
219 "_SDA_BASE_", /* ppc */
220 "_SDA2_BASE_", /* ppc */
221 NULL };
bd8b22d2
AB
222
223 static char *special_suffixes[] = {
bd8b22d2 224 "_veneer", /* arm */
b9b74be1
AB
225 "_from_arm", /* arm */
226 "_from_thumb", /* arm */
bd8b22d2
AB
227 NULL };
228
1da177e4 229 int i;
bd8b22d2
AB
230 char *sym_name = (char *)s->sym + 1;
231
41f11a4f 232 /* skip prefix char */
bd8b22d2
AB
233 if (symbol_prefix_char && *sym_name == symbol_prefix_char)
234 sym_name++;
235
1da177e4
LT
236
237 /* if --all-symbols is not specified, then symbols outside the text
238 * and inittext sections are discarded */
239 if (!all_symbols) {
78eb7159
KC
240 if (symbol_in_range(s, text_ranges,
241 ARRAY_SIZE(text_ranges)) == 0)
1da177e4
LT
242 return 0;
243 /* Corner case. Discard any symbols with the same value as
a3b81113
RG
244 * _etext _einittext; they can move between pass 1 and 2 when
245 * the kallsyms data are added. If these symbols move then
246 * they may get dropped in pass 2, which breaks the kallsyms
247 * rules.
1da177e4 248 */
17b1f0de 249 if ((s->addr == text_range_text->end &&
bd8b22d2 250 strcmp(sym_name,
78eb7159 251 text_range_text->end_sym)) ||
17b1f0de 252 (s->addr == text_range_inittext->end &&
bd8b22d2 253 strcmp(sym_name,
78eb7159 254 text_range_inittext->end_sym)))
1da177e4
LT
255 return 0;
256 }
257
258 /* Exclude symbols which vary between passes. */
1da177e4 259 for (i = 0; special_symbols[i]; i++)
bd8b22d2 260 if (strcmp(sym_name, special_symbols[i]) == 0)
1da177e4
LT
261 return 0;
262
bd8b22d2
AB
263 for (i = 0; special_suffixes[i]; i++) {
264 int l = strlen(sym_name) - strlen(special_suffixes[i]);
265
266 if (l >= 0 && strcmp(sym_name + l, special_suffixes[i]) == 0)
267 return 0;
268 }
269
1da177e4
LT
270 return 1;
271}
272
b3dbb4ec 273static void read_map(FILE *in)
1da177e4
LT
274{
275 while (!feof(in)) {
b3dbb4ec
PM
276 if (table_cnt >= table_size) {
277 table_size += 10000;
278 table = realloc(table, sizeof(*table) * table_size);
1da177e4
LT
279 if (!table) {
280 fprintf(stderr, "out of memory\n");
281 exit (1);
282 }
283 }
f2df3f65
PM
284 if (read_symbol(in, &table[table_cnt]) == 0) {
285 table[table_cnt].start_pos = table_cnt;
b3dbb4ec 286 table_cnt++;
f2df3f65 287 }
1da177e4
LT
288 }
289}
290
291static void output_label(char *label)
292{
41f11a4f
YS
293 if (symbol_prefix_char)
294 printf(".globl %c%s\n", symbol_prefix_char, label);
295 else
296 printf(".globl %s\n", label);
1da177e4 297 printf("\tALGN\n");
41f11a4f
YS
298 if (symbol_prefix_char)
299 printf("%c%s:\n", symbol_prefix_char, label);
300 else
301 printf("%s:\n", label);
1da177e4
LT
302}
303
304/* uncompress a compressed symbol. When this function is called, the best table
305 * might still be compressed itself, so the function needs to be recursive */
306static int expand_symbol(unsigned char *data, int len, char *result)
307{
308 int c, rlen, total=0;
309
310 while (len) {
311 c = *data;
312 /* if the table holds a single char that is the same as the one
313 * we are looking for, then end the search */
314 if (best_table[c][0]==c && best_table_len[c]==1) {
315 *result++ = c;
316 total++;
317 } else {
318 /* if not, recurse and expand */
319 rlen = expand_symbol(best_table[c], best_table_len[c], result);
320 total += rlen;
321 result += rlen;
322 }
323 data++;
324 len--;
325 }
326 *result=0;
327
328 return total;
329}
330
78eb7159
KC
331static int symbol_absolute(struct sym_entry *s)
332{
8c996940 333 return s->percpu_absolute;
78eb7159
KC
334}
335
b3dbb4ec 336static void write_src(void)
1da177e4 337{
b3dbb4ec 338 unsigned int i, k, off;
1da177e4
LT
339 unsigned int best_idx[256];
340 unsigned int *markers;
9281acea 341 char buf[KSYM_NAME_LEN];
1da177e4
LT
342
343 printf("#include <asm/types.h>\n");
344 printf("#if BITS_PER_LONG == 64\n");
345 printf("#define PTR .quad\n");
346 printf("#define ALGN .align 8\n");
347 printf("#else\n");
348 printf("#define PTR .long\n");
349 printf("#define ALGN .align 4\n");
350 printf("#endif\n");
351
aad09470 352 printf("\t.section .rodata, \"a\"\n");
1da177e4 353
2213e9a6
AB
354 /* Provide proper symbols relocatability by their relativeness
355 * to a fixed anchor point in the runtime image, either '_text'
356 * for absolute address tables, in which case the linker will
357 * emit the final addresses at build time. Otherwise, use the
358 * offset relative to the lowest value encountered of all relative
359 * symbols, and emit non-relocatable fixed offsets that will be fixed
360 * up at runtime.
361 *
362 * The symbol names cannot be used to construct normal symbol
363 * references as the list of symbols contains symbols that are
364 * declared static and are private to their .o files. This prevents
365 * .tmp_kallsyms.o or any other object from referencing them.
fd593d12 366 */
2213e9a6
AB
367 if (!base_relative)
368 output_label("kallsyms_addresses");
369 else
370 output_label("kallsyms_offsets");
371
b3dbb4ec 372 for (i = 0; i < table_cnt; i++) {
2213e9a6
AB
373 if (base_relative) {
374 long long offset;
375 int overflow;
376
377 if (!absolute_percpu) {
378 offset = table[i].addr - relative_base;
379 overflow = (offset < 0 || offset > UINT_MAX);
380 } else if (symbol_absolute(&table[i])) {
381 offset = table[i].addr;
382 overflow = (offset < 0 || offset > INT_MAX);
383 } else {
384 offset = relative_base - table[i].addr - 1;
385 overflow = (offset < INT_MIN || offset >= 0);
386 }
387 if (overflow) {
388 fprintf(stderr, "kallsyms failure: "
389 "%s symbol value %#llx out of range in relative mode\n",
390 symbol_absolute(&table[i]) ? "absolute" : "relative",
391 table[i].addr);
392 exit(EXIT_FAILURE);
393 }
394 printf("\t.long\t%#x\n", (int)offset);
395 } else if (!symbol_absolute(&table[i])) {
2c22d8ba
VG
396 if (_text <= table[i].addr)
397 printf("\tPTR\t_text + %#llx\n",
398 table[i].addr - _text);
399 else
2930ffc7
AM
400 printf("\tPTR\t_text - %#llx\n",
401 _text - table[i].addr);
fd593d12
EB
402 } else {
403 printf("\tPTR\t%#llx\n", table[i].addr);
404 }
1da177e4
LT
405 }
406 printf("\n");
407
2213e9a6
AB
408 if (base_relative) {
409 output_label("kallsyms_relative_base");
410 printf("\tPTR\t_text - %#llx\n", _text - relative_base);
411 printf("\n");
412 }
413
1da177e4 414 output_label("kallsyms_num_syms");
b3dbb4ec 415 printf("\tPTR\t%d\n", table_cnt);
1da177e4
LT
416 printf("\n");
417
418 /* table of offset markers, that give the offset in the compressed stream
419 * every 256 symbols */
f1a136e0
JJ
420 markers = malloc(sizeof(unsigned int) * ((table_cnt + 255) / 256));
421 if (!markers) {
422 fprintf(stderr, "kallsyms failure: "
423 "unable to allocate required memory\n");
424 exit(EXIT_FAILURE);
425 }
1da177e4
LT
426
427 output_label("kallsyms_names");
1da177e4 428 off = 0;
b3dbb4ec
PM
429 for (i = 0; i < table_cnt; i++) {
430 if ((i & 0xFF) == 0)
431 markers[i >> 8] = off;
1da177e4
LT
432
433 printf("\t.byte 0x%02x", table[i].len);
434 for (k = 0; k < table[i].len; k++)
435 printf(", 0x%02x", table[i].sym[k]);
436 printf("\n");
437
438 off += table[i].len + 1;
1da177e4
LT
439 }
440 printf("\n");
441
442 output_label("kallsyms_markers");
b3dbb4ec 443 for (i = 0; i < ((table_cnt + 255) >> 8); i++)
1da177e4
LT
444 printf("\tPTR\t%d\n", markers[i]);
445 printf("\n");
446
447 free(markers);
448
449 output_label("kallsyms_token_table");
450 off = 0;
451 for (i = 0; i < 256; i++) {
452 best_idx[i] = off;
b3dbb4ec 453 expand_symbol(best_table[i], best_table_len[i], buf);
1da177e4
LT
454 printf("\t.asciz\t\"%s\"\n", buf);
455 off += strlen(buf) + 1;
456 }
457 printf("\n");
458
459 output_label("kallsyms_token_index");
460 for (i = 0; i < 256; i++)
461 printf("\t.short\t%d\n", best_idx[i]);
462 printf("\n");
463}
464
465
466/* table lookup compression functions */
467
1da177e4
LT
468/* count all the possible tokens in a symbol */
469static void learn_symbol(unsigned char *symbol, int len)
470{
471 int i;
472
473 for (i = 0; i < len - 1; i++)
b3dbb4ec 474 token_profit[ symbol[i] + (symbol[i + 1] << 8) ]++;
1da177e4
LT
475}
476
477/* decrease the count for all the possible tokens in a symbol */
478static void forget_symbol(unsigned char *symbol, int len)
479{
480 int i;
481
482 for (i = 0; i < len - 1; i++)
b3dbb4ec 483 token_profit[ symbol[i] + (symbol[i + 1] << 8) ]--;
1da177e4
LT
484}
485
b3dbb4ec 486/* remove all the invalid symbols from the table and do the initial token count */
1da177e4
LT
487static void build_initial_tok_table(void)
488{
b3dbb4ec 489 unsigned int i, pos;
1da177e4 490
b3dbb4ec
PM
491 pos = 0;
492 for (i = 0; i < table_cnt; i++) {
1da177e4 493 if ( symbol_valid(&table[i]) ) {
b3dbb4ec
PM
494 if (pos != i)
495 table[pos] = table[i];
496 learn_symbol(table[pos].sym, table[pos].len);
497 pos++;
1da177e4 498 }
1da177e4 499 }
b3dbb4ec 500 table_cnt = pos;
1da177e4
LT
501}
502
7c5d249a
PM
503static void *find_token(unsigned char *str, int len, unsigned char *token)
504{
505 int i;
506
507 for (i = 0; i < len - 1; i++) {
508 if (str[i] == token[0] && str[i+1] == token[1])
509 return &str[i];
510 }
511 return NULL;
512}
513
1da177e4
LT
514/* replace a given token in all the valid symbols. Use the sampled symbols
515 * to update the counts */
b3dbb4ec 516static void compress_symbols(unsigned char *str, int idx)
1da177e4 517{
b3dbb4ec
PM
518 unsigned int i, len, size;
519 unsigned char *p1, *p2;
1da177e4 520
b3dbb4ec 521 for (i = 0; i < table_cnt; i++) {
1da177e4
LT
522
523 len = table[i].len;
b3dbb4ec
PM
524 p1 = table[i].sym;
525
526 /* find the token on the symbol */
7c5d249a 527 p2 = find_token(p1, len, str);
b3dbb4ec
PM
528 if (!p2) continue;
529
530 /* decrease the counts for this symbol's tokens */
531 forget_symbol(table[i].sym, len);
532
533 size = len;
1da177e4
LT
534
535 do {
b3dbb4ec
PM
536 *p2 = idx;
537 p2++;
538 size -= (p2 - p1);
539 memmove(p2, p2 + 1, size);
540 p1 = p2;
541 len--;
542
543 if (size < 2) break;
544
1da177e4 545 /* find the token on the symbol */
7c5d249a 546 p2 = find_token(p1, size, str);
1da177e4 547
b3dbb4ec 548 } while (p2);
1da177e4 549
b3dbb4ec 550 table[i].len = len;
1da177e4 551
b3dbb4ec
PM
552 /* increase the counts for this symbol's new tokens */
553 learn_symbol(table[i].sym, len);
1da177e4
LT
554 }
555}
556
557/* search the token with the maximum profit */
b3dbb4ec 558static int find_best_token(void)
1da177e4 559{
b3dbb4ec 560 int i, best, bestprofit;
1da177e4
LT
561
562 bestprofit=-10000;
b3dbb4ec 563 best = 0;
1da177e4 564
b3dbb4ec
PM
565 for (i = 0; i < 0x10000; i++) {
566 if (token_profit[i] > bestprofit) {
567 best = i;
568 bestprofit = token_profit[i];
1da177e4 569 }
1da177e4 570 }
1da177e4
LT
571 return best;
572}
573
574/* this is the core of the algorithm: calculate the "best" table */
575static void optimize_result(void)
576{
b3dbb4ec 577 int i, best;
1da177e4
LT
578
579 /* using the '\0' symbol last allows compress_symbols to use standard
580 * fast string functions */
581 for (i = 255; i >= 0; i--) {
582
583 /* if this table slot is empty (it is not used by an actual
584 * original char code */
585 if (!best_table_len[i]) {
586
587 /* find the token with the breates profit value */
588 best = find_best_token();
e0a04b11
XW
589 if (token_profit[best] == 0)
590 break;
1da177e4
LT
591
592 /* place it in the "best" table */
b3dbb4ec
PM
593 best_table_len[i] = 2;
594 best_table[i][0] = best & 0xFF;
595 best_table[i][1] = (best >> 8) & 0xFF;
1da177e4
LT
596
597 /* replace this token in all the valid symbols */
b3dbb4ec 598 compress_symbols(best_table[i], i);
1da177e4
LT
599 }
600 }
601}
602
603/* start by placing the symbols that are actually used on the table */
604static void insert_real_symbols_in_table(void)
605{
b3dbb4ec 606 unsigned int i, j, c;
1da177e4
LT
607
608 memset(best_table, 0, sizeof(best_table));
609 memset(best_table_len, 0, sizeof(best_table_len));
610
b3dbb4ec
PM
611 for (i = 0; i < table_cnt; i++) {
612 for (j = 0; j < table[i].len; j++) {
613 c = table[i].sym[j];
614 best_table[c][0]=c;
615 best_table_len[c]=1;
1da177e4
LT
616 }
617 }
618}
619
620static void optimize_token_table(void)
621{
1da177e4
LT
622 build_initial_tok_table();
623
624 insert_real_symbols_in_table();
625
41f11a4f 626 /* When valid symbol is not registered, exit to error */
b3dbb4ec 627 if (!table_cnt) {
41f11a4f
YS
628 fprintf(stderr, "No valid symbol.\n");
629 exit(1);
630 }
631
1da177e4
LT
632 optimize_result();
633}
634
b478b782
LJ
635/* guess for "linker script provide" symbol */
636static int may_be_linker_script_provide_symbol(const struct sym_entry *se)
637{
638 const char *symbol = (char *)se->sym + 1;
639 int len = se->len - 1;
640
641 if (len < 8)
642 return 0;
643
644 if (symbol[0] != '_' || symbol[1] != '_')
645 return 0;
646
647 /* __start_XXXXX */
648 if (!memcmp(symbol + 2, "start_", 6))
649 return 1;
650
651 /* __stop_XXXXX */
652 if (!memcmp(symbol + 2, "stop_", 5))
653 return 1;
654
655 /* __end_XXXXX */
656 if (!memcmp(symbol + 2, "end_", 4))
657 return 1;
658
659 /* __XXXXX_start */
660 if (!memcmp(symbol + len - 6, "_start", 6))
661 return 1;
662
663 /* __XXXXX_end */
664 if (!memcmp(symbol + len - 4, "_end", 4))
665 return 1;
666
667 return 0;
668}
669
670static int prefix_underscores_count(const char *str)
671{
672 const char *tail = str;
673
a9ece53c 674 while (*tail == '_')
b478b782
LJ
675 tail++;
676
677 return tail - str;
678}
679
f2df3f65
PM
680static int compare_symbols(const void *a, const void *b)
681{
682 const struct sym_entry *sa;
683 const struct sym_entry *sb;
684 int wa, wb;
685
686 sa = a;
687 sb = b;
688
689 /* sort by address first */
690 if (sa->addr > sb->addr)
691 return 1;
692 if (sa->addr < sb->addr)
693 return -1;
694
695 /* sort by "weakness" type */
696 wa = (sa->sym[0] == 'w') || (sa->sym[0] == 'W');
697 wb = (sb->sym[0] == 'w') || (sb->sym[0] == 'W');
698 if (wa != wb)
699 return wa - wb;
700
b478b782
LJ
701 /* sort by "linker script provide" type */
702 wa = may_be_linker_script_provide_symbol(sa);
703 wb = may_be_linker_script_provide_symbol(sb);
704 if (wa != wb)
705 return wa - wb;
706
707 /* sort by the number of prefix underscores */
708 wa = prefix_underscores_count((const char *)sa->sym + 1);
709 wb = prefix_underscores_count((const char *)sb->sym + 1);
710 if (wa != wb)
711 return wa - wb;
712
f2df3f65
PM
713 /* sort by initial order, so that other symbols are left undisturbed */
714 return sa->start_pos - sb->start_pos;
715}
716
717static void sort_symbols(void)
718{
719 qsort(table, table_cnt, sizeof(struct sym_entry), compare_symbols);
720}
1da177e4 721
c6bda7c9
RR
722static void make_percpus_absolute(void)
723{
724 unsigned int i;
725
726 for (i = 0; i < table_cnt; i++)
8c996940
AB
727 if (symbol_in_range(&table[i], &percpu_range, 1)) {
728 /*
729 * Keep the 'A' override for percpu symbols to
730 * ensure consistent behavior compared to older
731 * versions of this tool.
732 */
c6bda7c9 733 table[i].sym[0] = 'A';
8c996940
AB
734 table[i].percpu_absolute = 1;
735 }
c6bda7c9
RR
736}
737
2213e9a6
AB
738/* find the minimum non-absolute symbol address */
739static void record_relative_base(void)
740{
741 unsigned int i;
742
743 relative_base = -1ULL;
744 for (i = 0; i < table_cnt; i++)
745 if (!symbol_absolute(&table[i]) &&
746 table[i].addr < relative_base)
747 relative_base = table[i].addr;
748}
749
b3dbb4ec 750int main(int argc, char **argv)
1da177e4 751{
41f11a4f
YS
752 if (argc >= 2) {
753 int i;
754 for (i = 1; i < argc; i++) {
755 if(strcmp(argv[i], "--all-symbols") == 0)
756 all_symbols = 1;
c6bda7c9
RR
757 else if (strcmp(argv[i], "--absolute-percpu") == 0)
758 absolute_percpu = 1;
41f11a4f
YS
759 else if (strncmp(argv[i], "--symbol-prefix=", 16) == 0) {
760 char *p = &argv[i][16];
761 /* skip quote */
762 if ((*p == '"' && *(p+2) == '"') || (*p == '\'' && *(p+2) == '\''))
763 p++;
764 symbol_prefix_char = *p;
2213e9a6
AB
765 } else if (strcmp(argv[i], "--base-relative") == 0)
766 base_relative = 1;
767 else
41f11a4f
YS
768 usage();
769 }
770 } else if (argc != 1)
1da177e4
LT
771 usage();
772
773 read_map(stdin);
c6bda7c9
RR
774 if (absolute_percpu)
775 make_percpus_absolute();
2213e9a6
AB
776 if (base_relative)
777 record_relative_base();
2ea03891
SR
778 sort_symbols();
779 optimize_token_table();
1da177e4
LT
780 write_src();
781
782 return 0;
783}