Commit | Line | Data |
---|---|---|
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> | |
25 | ||
9281acea | 26 | #define KSYM_NAME_LEN 128 |
1da177e4 | 27 | |
1da177e4 LT |
28 | struct sym_entry { |
29 | unsigned long long addr; | |
b3dbb4ec | 30 | unsigned int len; |
f2df3f65 | 31 | unsigned int start_pos; |
1da177e4 LT |
32 | unsigned char *sym; |
33 | }; | |
34 | ||
1da177e4 | 35 | static struct sym_entry *table; |
b3dbb4ec | 36 | static unsigned int table_size, table_cnt; |
a3b81113 | 37 | static unsigned long long _text, _stext, _etext, _sinittext, _einittext; |
1da177e4 | 38 | static int all_symbols = 0; |
41f11a4f | 39 | static char symbol_prefix_char = '\0'; |
1da177e4 | 40 | |
b3dbb4ec | 41 | int token_profit[0x10000]; |
1da177e4 LT |
42 | |
43 | /* the table that holds the result of the compression */ | |
b3dbb4ec | 44 | unsigned char best_table[256][2]; |
1da177e4 LT |
45 | unsigned char best_table_len[256]; |
46 | ||
47 | ||
b3dbb4ec | 48 | static void usage(void) |
1da177e4 | 49 | { |
41f11a4f | 50 | fprintf(stderr, "Usage: kallsyms [--all-symbols] [--symbol-prefix=<prefix char>] < in.map > out.S\n"); |
1da177e4 LT |
51 | exit(1); |
52 | } | |
53 | ||
54 | /* | |
55 | * This ignores the intensely annoying "mapping symbols" found | |
56 | * in ARM ELF files: $a, $t and $d. | |
57 | */ | |
b3dbb4ec | 58 | static inline int is_arm_mapping_symbol(const char *str) |
1da177e4 LT |
59 | { |
60 | return str[0] == '$' && strchr("atd", str[1]) | |
61 | && (str[2] == '\0' || str[2] == '.'); | |
62 | } | |
63 | ||
b3dbb4ec | 64 | static int read_symbol(FILE *in, struct sym_entry *s) |
1da177e4 LT |
65 | { |
66 | char str[500]; | |
b3dbb4ec | 67 | char *sym, stype; |
1da177e4 LT |
68 | int rc; |
69 | ||
b3dbb4ec | 70 | rc = fscanf(in, "%llx %c %499s\n", &s->addr, &stype, str); |
1da177e4 LT |
71 | if (rc != 3) { |
72 | if (rc != EOF) { | |
73 | /* skip line */ | |
74 | fgets(str, 500, in); | |
75 | } | |
76 | return -1; | |
77 | } | |
78 | ||
41f11a4f YS |
79 | sym = str; |
80 | /* skip prefix char */ | |
81 | if (symbol_prefix_char && str[0] == symbol_prefix_char) | |
82 | sym++; | |
83 | ||
1da177e4 | 84 | /* Ignore most absolute/undefined (?) symbols. */ |
fd593d12 EB |
85 | if (strcmp(sym, "_text") == 0) |
86 | _text = s->addr; | |
87 | else if (strcmp(sym, "_stext") == 0) | |
1da177e4 | 88 | _stext = s->addr; |
41f11a4f | 89 | else if (strcmp(sym, "_etext") == 0) |
1da177e4 | 90 | _etext = s->addr; |
41f11a4f | 91 | else if (strcmp(sym, "_sinittext") == 0) |
1da177e4 | 92 | _sinittext = s->addr; |
41f11a4f | 93 | else if (strcmp(sym, "_einittext") == 0) |
1da177e4 | 94 | _einittext = s->addr; |
b3dbb4ec | 95 | else if (toupper(stype) == 'A') |
1da177e4 LT |
96 | { |
97 | /* Keep these useful absolute symbols */ | |
41f11a4f YS |
98 | if (strcmp(sym, "__kernel_syscall_via_break") && |
99 | strcmp(sym, "__kernel_syscall_via_epc") && | |
100 | strcmp(sym, "__kernel_sigtramp") && | |
101 | strcmp(sym, "__gp")) | |
1da177e4 LT |
102 | return -1; |
103 | ||
104 | } | |
b3dbb4ec | 105 | else if (toupper(stype) == 'U' || |
41f11a4f | 106 | is_arm_mapping_symbol(sym)) |
1da177e4 | 107 | return -1; |
6f00df24 RB |
108 | /* exclude also MIPS ELF local symbols ($L123 instead of .L123) */ |
109 | else if (str[0] == '$') | |
110 | return -1; | |
aab34ac8 SR |
111 | /* exclude debugging symbols */ |
112 | else if (stype == 'N') | |
113 | return -1; | |
1da177e4 LT |
114 | |
115 | /* include the type field in the symbol name, so that it gets | |
116 | * compressed together */ | |
117 | s->len = strlen(str) + 1; | |
b3dbb4ec | 118 | s->sym = malloc(s->len + 1); |
f1a136e0 JJ |
119 | if (!s->sym) { |
120 | fprintf(stderr, "kallsyms failure: " | |
121 | "unable to allocate required amount of memory\n"); | |
122 | exit(EXIT_FAILURE); | |
123 | } | |
b3dbb4ec PM |
124 | strcpy((char *)s->sym + 1, str); |
125 | s->sym[0] = stype; | |
1da177e4 LT |
126 | |
127 | return 0; | |
128 | } | |
129 | ||
b3dbb4ec | 130 | static int symbol_valid(struct sym_entry *s) |
1da177e4 LT |
131 | { |
132 | /* Symbols which vary between passes. Passes 1 and 2 must have | |
133 | * identical symbol lists. The kallsyms_* symbols below are only added | |
134 | * after pass 1, they would be included in pass 2 when --all-symbols is | |
135 | * specified so exclude them to get a stable symbol list. | |
136 | */ | |
137 | static char *special_symbols[] = { | |
138 | "kallsyms_addresses", | |
139 | "kallsyms_num_syms", | |
140 | "kallsyms_names", | |
141 | "kallsyms_markers", | |
142 | "kallsyms_token_table", | |
143 | "kallsyms_token_index", | |
144 | ||
145 | /* Exclude linker generated symbols which vary between passes */ | |
146 | "_SDA_BASE_", /* ppc */ | |
147 | "_SDA2_BASE_", /* ppc */ | |
148 | NULL }; | |
149 | int i; | |
41f11a4f YS |
150 | int offset = 1; |
151 | ||
152 | /* skip prefix char */ | |
153 | if (symbol_prefix_char && *(s->sym + 1) == symbol_prefix_char) | |
154 | offset++; | |
1da177e4 LT |
155 | |
156 | /* if --all-symbols is not specified, then symbols outside the text | |
157 | * and inittext sections are discarded */ | |
158 | if (!all_symbols) { | |
159 | if ((s->addr < _stext || s->addr > _etext) | |
a3b81113 | 160 | && (s->addr < _sinittext || s->addr > _einittext)) |
1da177e4 LT |
161 | return 0; |
162 | /* Corner case. Discard any symbols with the same value as | |
a3b81113 RG |
163 | * _etext _einittext; they can move between pass 1 and 2 when |
164 | * the kallsyms data are added. If these symbols move then | |
165 | * they may get dropped in pass 2, which breaks the kallsyms | |
166 | * rules. | |
1da177e4 | 167 | */ |
a3b81113 RG |
168 | if ((s->addr == _etext && |
169 | strcmp((char *)s->sym + offset, "_etext")) || | |
170 | (s->addr == _einittext && | |
171 | strcmp((char *)s->sym + offset, "_einittext"))) | |
1da177e4 LT |
172 | return 0; |
173 | } | |
174 | ||
175 | /* Exclude symbols which vary between passes. */ | |
b3dbb4ec | 176 | if (strstr((char *)s->sym + offset, "_compiled.")) |
1da177e4 LT |
177 | return 0; |
178 | ||
179 | for (i = 0; special_symbols[i]; i++) | |
b3dbb4ec | 180 | if( strcmp((char *)s->sym + offset, special_symbols[i]) == 0 ) |
1da177e4 LT |
181 | return 0; |
182 | ||
183 | return 1; | |
184 | } | |
185 | ||
b3dbb4ec | 186 | static void read_map(FILE *in) |
1da177e4 LT |
187 | { |
188 | while (!feof(in)) { | |
b3dbb4ec PM |
189 | if (table_cnt >= table_size) { |
190 | table_size += 10000; | |
191 | table = realloc(table, sizeof(*table) * table_size); | |
1da177e4 LT |
192 | if (!table) { |
193 | fprintf(stderr, "out of memory\n"); | |
194 | exit (1); | |
195 | } | |
196 | } | |
f2df3f65 PM |
197 | if (read_symbol(in, &table[table_cnt]) == 0) { |
198 | table[table_cnt].start_pos = table_cnt; | |
b3dbb4ec | 199 | table_cnt++; |
f2df3f65 | 200 | } |
1da177e4 LT |
201 | } |
202 | } | |
203 | ||
204 | static void output_label(char *label) | |
205 | { | |
41f11a4f YS |
206 | if (symbol_prefix_char) |
207 | printf(".globl %c%s\n", symbol_prefix_char, label); | |
208 | else | |
209 | printf(".globl %s\n", label); | |
1da177e4 | 210 | printf("\tALGN\n"); |
41f11a4f YS |
211 | if (symbol_prefix_char) |
212 | printf("%c%s:\n", symbol_prefix_char, label); | |
213 | else | |
214 | printf("%s:\n", label); | |
1da177e4 LT |
215 | } |
216 | ||
217 | /* uncompress a compressed symbol. When this function is called, the best table | |
218 | * might still be compressed itself, so the function needs to be recursive */ | |
219 | static int expand_symbol(unsigned char *data, int len, char *result) | |
220 | { | |
221 | int c, rlen, total=0; | |
222 | ||
223 | while (len) { | |
224 | c = *data; | |
225 | /* if the table holds a single char that is the same as the one | |
226 | * we are looking for, then end the search */ | |
227 | if (best_table[c][0]==c && best_table_len[c]==1) { | |
228 | *result++ = c; | |
229 | total++; | |
230 | } else { | |
231 | /* if not, recurse and expand */ | |
232 | rlen = expand_symbol(best_table[c], best_table_len[c], result); | |
233 | total += rlen; | |
234 | result += rlen; | |
235 | } | |
236 | data++; | |
237 | len--; | |
238 | } | |
239 | *result=0; | |
240 | ||
241 | return total; | |
242 | } | |
243 | ||
b3dbb4ec | 244 | static void write_src(void) |
1da177e4 | 245 | { |
b3dbb4ec | 246 | unsigned int i, k, off; |
1da177e4 LT |
247 | unsigned int best_idx[256]; |
248 | unsigned int *markers; | |
9281acea | 249 | char buf[KSYM_NAME_LEN]; |
1da177e4 LT |
250 | |
251 | printf("#include <asm/types.h>\n"); | |
252 | printf("#if BITS_PER_LONG == 64\n"); | |
253 | printf("#define PTR .quad\n"); | |
254 | printf("#define ALGN .align 8\n"); | |
255 | printf("#else\n"); | |
256 | printf("#define PTR .long\n"); | |
257 | printf("#define ALGN .align 4\n"); | |
258 | printf("#endif\n"); | |
259 | ||
aad09470 | 260 | printf("\t.section .rodata, \"a\"\n"); |
1da177e4 | 261 | |
fd593d12 EB |
262 | /* Provide proper symbols relocatability by their '_text' |
263 | * relativeness. The symbol names cannot be used to construct | |
264 | * normal symbol references as the list of symbols contains | |
265 | * symbols that are declared static and are private to their | |
266 | * .o files. This prevents .tmp_kallsyms.o or any other | |
267 | * object from referencing them. | |
268 | */ | |
1da177e4 | 269 | output_label("kallsyms_addresses"); |
b3dbb4ec | 270 | for (i = 0; i < table_cnt; i++) { |
fd593d12 | 271 | if (toupper(table[i].sym[0]) != 'A') { |
2c22d8ba VG |
272 | if (_text <= table[i].addr) |
273 | printf("\tPTR\t_text + %#llx\n", | |
274 | table[i].addr - _text); | |
275 | else | |
276 | printf("\tPTR\t_text - %#llx\n", | |
277 | _text - table[i].addr); | |
fd593d12 EB |
278 | } else { |
279 | printf("\tPTR\t%#llx\n", table[i].addr); | |
280 | } | |
1da177e4 LT |
281 | } |
282 | printf("\n"); | |
283 | ||
284 | output_label("kallsyms_num_syms"); | |
b3dbb4ec | 285 | printf("\tPTR\t%d\n", table_cnt); |
1da177e4 LT |
286 | printf("\n"); |
287 | ||
288 | /* table of offset markers, that give the offset in the compressed stream | |
289 | * every 256 symbols */ | |
f1a136e0 JJ |
290 | markers = malloc(sizeof(unsigned int) * ((table_cnt + 255) / 256)); |
291 | if (!markers) { | |
292 | fprintf(stderr, "kallsyms failure: " | |
293 | "unable to allocate required memory\n"); | |
294 | exit(EXIT_FAILURE); | |
295 | } | |
1da177e4 LT |
296 | |
297 | output_label("kallsyms_names"); | |
1da177e4 | 298 | off = 0; |
b3dbb4ec PM |
299 | for (i = 0; i < table_cnt; i++) { |
300 | if ((i & 0xFF) == 0) | |
301 | markers[i >> 8] = off; | |
1da177e4 LT |
302 | |
303 | printf("\t.byte 0x%02x", table[i].len); | |
304 | for (k = 0; k < table[i].len; k++) | |
305 | printf(", 0x%02x", table[i].sym[k]); | |
306 | printf("\n"); | |
307 | ||
308 | off += table[i].len + 1; | |
1da177e4 LT |
309 | } |
310 | printf("\n"); | |
311 | ||
312 | output_label("kallsyms_markers"); | |
b3dbb4ec | 313 | for (i = 0; i < ((table_cnt + 255) >> 8); i++) |
1da177e4 LT |
314 | printf("\tPTR\t%d\n", markers[i]); |
315 | printf("\n"); | |
316 | ||
317 | free(markers); | |
318 | ||
319 | output_label("kallsyms_token_table"); | |
320 | off = 0; | |
321 | for (i = 0; i < 256; i++) { | |
322 | best_idx[i] = off; | |
b3dbb4ec | 323 | expand_symbol(best_table[i], best_table_len[i], buf); |
1da177e4 LT |
324 | printf("\t.asciz\t\"%s\"\n", buf); |
325 | off += strlen(buf) + 1; | |
326 | } | |
327 | printf("\n"); | |
328 | ||
329 | output_label("kallsyms_token_index"); | |
330 | for (i = 0; i < 256; i++) | |
331 | printf("\t.short\t%d\n", best_idx[i]); | |
332 | printf("\n"); | |
333 | } | |
334 | ||
335 | ||
336 | /* table lookup compression functions */ | |
337 | ||
1da177e4 LT |
338 | /* count all the possible tokens in a symbol */ |
339 | static void learn_symbol(unsigned char *symbol, int len) | |
340 | { | |
341 | int i; | |
342 | ||
343 | for (i = 0; i < len - 1; i++) | |
b3dbb4ec | 344 | token_profit[ symbol[i] + (symbol[i + 1] << 8) ]++; |
1da177e4 LT |
345 | } |
346 | ||
347 | /* decrease the count for all the possible tokens in a symbol */ | |
348 | static void forget_symbol(unsigned char *symbol, int len) | |
349 | { | |
350 | int i; | |
351 | ||
352 | for (i = 0; i < len - 1; i++) | |
b3dbb4ec | 353 | token_profit[ symbol[i] + (symbol[i + 1] << 8) ]--; |
1da177e4 LT |
354 | } |
355 | ||
b3dbb4ec | 356 | /* remove all the invalid symbols from the table and do the initial token count */ |
1da177e4 LT |
357 | static void build_initial_tok_table(void) |
358 | { | |
b3dbb4ec | 359 | unsigned int i, pos; |
1da177e4 | 360 | |
b3dbb4ec PM |
361 | pos = 0; |
362 | for (i = 0; i < table_cnt; i++) { | |
1da177e4 | 363 | if ( symbol_valid(&table[i]) ) { |
b3dbb4ec PM |
364 | if (pos != i) |
365 | table[pos] = table[i]; | |
366 | learn_symbol(table[pos].sym, table[pos].len); | |
367 | pos++; | |
1da177e4 | 368 | } |
1da177e4 | 369 | } |
b3dbb4ec | 370 | table_cnt = pos; |
1da177e4 LT |
371 | } |
372 | ||
7c5d249a PM |
373 | static void *find_token(unsigned char *str, int len, unsigned char *token) |
374 | { | |
375 | int i; | |
376 | ||
377 | for (i = 0; i < len - 1; i++) { | |
378 | if (str[i] == token[0] && str[i+1] == token[1]) | |
379 | return &str[i]; | |
380 | } | |
381 | return NULL; | |
382 | } | |
383 | ||
1da177e4 LT |
384 | /* replace a given token in all the valid symbols. Use the sampled symbols |
385 | * to update the counts */ | |
b3dbb4ec | 386 | static void compress_symbols(unsigned char *str, int idx) |
1da177e4 | 387 | { |
b3dbb4ec PM |
388 | unsigned int i, len, size; |
389 | unsigned char *p1, *p2; | |
1da177e4 | 390 | |
b3dbb4ec | 391 | for (i = 0; i < table_cnt; i++) { |
1da177e4 LT |
392 | |
393 | len = table[i].len; | |
b3dbb4ec PM |
394 | p1 = table[i].sym; |
395 | ||
396 | /* find the token on the symbol */ | |
7c5d249a | 397 | p2 = find_token(p1, len, str); |
b3dbb4ec PM |
398 | if (!p2) continue; |
399 | ||
400 | /* decrease the counts for this symbol's tokens */ | |
401 | forget_symbol(table[i].sym, len); | |
402 | ||
403 | size = len; | |
1da177e4 LT |
404 | |
405 | do { | |
b3dbb4ec PM |
406 | *p2 = idx; |
407 | p2++; | |
408 | size -= (p2 - p1); | |
409 | memmove(p2, p2 + 1, size); | |
410 | p1 = p2; | |
411 | len--; | |
412 | ||
413 | if (size < 2) break; | |
414 | ||
1da177e4 | 415 | /* find the token on the symbol */ |
7c5d249a | 416 | p2 = find_token(p1, size, str); |
1da177e4 | 417 | |
b3dbb4ec | 418 | } while (p2); |
1da177e4 | 419 | |
b3dbb4ec | 420 | table[i].len = len; |
1da177e4 | 421 | |
b3dbb4ec PM |
422 | /* increase the counts for this symbol's new tokens */ |
423 | learn_symbol(table[i].sym, len); | |
1da177e4 LT |
424 | } |
425 | } | |
426 | ||
427 | /* search the token with the maximum profit */ | |
b3dbb4ec | 428 | static int find_best_token(void) |
1da177e4 | 429 | { |
b3dbb4ec | 430 | int i, best, bestprofit; |
1da177e4 LT |
431 | |
432 | bestprofit=-10000; | |
b3dbb4ec | 433 | best = 0; |
1da177e4 | 434 | |
b3dbb4ec PM |
435 | for (i = 0; i < 0x10000; i++) { |
436 | if (token_profit[i] > bestprofit) { | |
437 | best = i; | |
438 | bestprofit = token_profit[i]; | |
1da177e4 | 439 | } |
1da177e4 | 440 | } |
1da177e4 LT |
441 | return best; |
442 | } | |
443 | ||
444 | /* this is the core of the algorithm: calculate the "best" table */ | |
445 | static void optimize_result(void) | |
446 | { | |
b3dbb4ec | 447 | int i, best; |
1da177e4 LT |
448 | |
449 | /* using the '\0' symbol last allows compress_symbols to use standard | |
450 | * fast string functions */ | |
451 | for (i = 255; i >= 0; i--) { | |
452 | ||
453 | /* if this table slot is empty (it is not used by an actual | |
454 | * original char code */ | |
455 | if (!best_table_len[i]) { | |
456 | ||
457 | /* find the token with the breates profit value */ | |
458 | best = find_best_token(); | |
459 | ||
460 | /* place it in the "best" table */ | |
b3dbb4ec PM |
461 | best_table_len[i] = 2; |
462 | best_table[i][0] = best & 0xFF; | |
463 | best_table[i][1] = (best >> 8) & 0xFF; | |
1da177e4 LT |
464 | |
465 | /* replace this token in all the valid symbols */ | |
b3dbb4ec | 466 | compress_symbols(best_table[i], i); |
1da177e4 LT |
467 | } |
468 | } | |
469 | } | |
470 | ||
471 | /* start by placing the symbols that are actually used on the table */ | |
472 | static void insert_real_symbols_in_table(void) | |
473 | { | |
b3dbb4ec | 474 | unsigned int i, j, c; |
1da177e4 LT |
475 | |
476 | memset(best_table, 0, sizeof(best_table)); | |
477 | memset(best_table_len, 0, sizeof(best_table_len)); | |
478 | ||
b3dbb4ec PM |
479 | for (i = 0; i < table_cnt; i++) { |
480 | for (j = 0; j < table[i].len; j++) { | |
481 | c = table[i].sym[j]; | |
482 | best_table[c][0]=c; | |
483 | best_table_len[c]=1; | |
1da177e4 LT |
484 | } |
485 | } | |
486 | } | |
487 | ||
488 | static void optimize_token_table(void) | |
489 | { | |
1da177e4 LT |
490 | build_initial_tok_table(); |
491 | ||
492 | insert_real_symbols_in_table(); | |
493 | ||
41f11a4f | 494 | /* When valid symbol is not registered, exit to error */ |
b3dbb4ec | 495 | if (!table_cnt) { |
41f11a4f YS |
496 | fprintf(stderr, "No valid symbol.\n"); |
497 | exit(1); | |
498 | } | |
499 | ||
1da177e4 LT |
500 | optimize_result(); |
501 | } | |
502 | ||
f2df3f65 PM |
503 | static int compare_symbols(const void *a, const void *b) |
504 | { | |
505 | const struct sym_entry *sa; | |
506 | const struct sym_entry *sb; | |
507 | int wa, wb; | |
508 | ||
509 | sa = a; | |
510 | sb = b; | |
511 | ||
512 | /* sort by address first */ | |
513 | if (sa->addr > sb->addr) | |
514 | return 1; | |
515 | if (sa->addr < sb->addr) | |
516 | return -1; | |
517 | ||
518 | /* sort by "weakness" type */ | |
519 | wa = (sa->sym[0] == 'w') || (sa->sym[0] == 'W'); | |
520 | wb = (sb->sym[0] == 'w') || (sb->sym[0] == 'W'); | |
521 | if (wa != wb) | |
522 | return wa - wb; | |
523 | ||
524 | /* sort by initial order, so that other symbols are left undisturbed */ | |
525 | return sa->start_pos - sb->start_pos; | |
526 | } | |
527 | ||
528 | static void sort_symbols(void) | |
529 | { | |
530 | qsort(table, table_cnt, sizeof(struct sym_entry), compare_symbols); | |
531 | } | |
1da177e4 | 532 | |
b3dbb4ec | 533 | int main(int argc, char **argv) |
1da177e4 | 534 | { |
41f11a4f YS |
535 | if (argc >= 2) { |
536 | int i; | |
537 | for (i = 1; i < argc; i++) { | |
538 | if(strcmp(argv[i], "--all-symbols") == 0) | |
539 | all_symbols = 1; | |
540 | else if (strncmp(argv[i], "--symbol-prefix=", 16) == 0) { | |
541 | char *p = &argv[i][16]; | |
542 | /* skip quote */ | |
543 | if ((*p == '"' && *(p+2) == '"') || (*p == '\'' && *(p+2) == '\'')) | |
544 | p++; | |
545 | symbol_prefix_char = *p; | |
546 | } else | |
547 | usage(); | |
548 | } | |
549 | } else if (argc != 1) | |
1da177e4 LT |
550 | usage(); |
551 | ||
552 | read_map(stdin); | |
f2df3f65 | 553 | sort_symbols(); |
1da177e4 LT |
554 | optimize_token_table(); |
555 | write_src(); | |
556 | ||
557 | return 0; | |
558 | } |