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