FM / scripts

/usr/src/kernels/4.18.0-553.121.1.el8_10.x86_64/scripts/

/usr/src/kernels/4.18.0-553.121.1.el8_10.x86_64/scripts

Name	Size	Mode	Actions
basic/	-	0755	rm
clang-tools/	-	0755	rm
coccinelle/	-	0755	rm
dtc/	-	0755	rm
gcc-plugins/	-	0755	rm
gdb/	-	0755	rm
genksyms/	-	0755	rm
kconfig/	-	0755	rm
ksymoops/	-	0755	rm
mod/	-	0755	rm
package/	-	0755	rm
selinux/	-	0755	rm
adjust_autoksyms.sh	3010	0755	edit dl rm
asn1_compiler	28008	0755	edit dl rm
asn1_compiler.c	36391	0644	edit dl rm
bin2c	7024	0755	edit dl rm
bin2c.c	743	0644	edit dl rm
bloat-o-meter	3313	0755	edit dl rm
bootgraph.pl	6426	0755	edit dl rm
bpf_doc.py	25515	0755	edit dl rm
cc-can-link.sh	166	0755	edit dl rm
checkincludes.pl	1984	0755	edit dl rm
checkkconfigsymbols.py	15895	0755	edit dl rm
checkpatch.pl	197186	0755	edit dl rm
checkstack.pl	5303	0755	edit dl rm
checksyscalls.sh	7094	0755	edit dl rm
checkversion.pl	1938	0755	edit dl rm
check_00index.sh	1333	0755	edit dl rm
check_extable.sh	5049	0755	edit dl rm
clang-version.sh	635	0755	edit dl rm
cleanfile	3538	0755	edit dl rm
cleanpatch	5178	0755	edit dl rm
coccicheck	7407	0755	edit dl rm
config	4635	0755	edit dl rm
conmakehash	11616	0755	edit dl rm
conmakehash.c	6128	0644	edit dl rm
const_structs.checkpatch	964	0644	edit dl rm
decodecode	2525	0755	edit dl rm
decode_stacktrace.sh	3834	0755	edit dl rm
depmod.sh	1119	0755	edit dl rm
diffconfig	3821	0755	edit dl rm
documentation-file-ref-check	3548	0755	edit dl rm
export_report.pl	4654	0755	edit dl rm
extract-cert	11616	0755	edit dl rm
extract-cert.c	3541	0644	edit dl rm
extract-ikconfig	1734	0755	edit dl rm
extract-module-sig.pl	3742	0755	edit dl rm
extract-sys-certs.pl	3832	0755	edit dl rm
extract-vmlinux	1725	0755	edit dl rm
extract_xc3028.pl	45665	0755	edit dl rm
faddr2line	6303	0755	edit dl rm
file-size.sh	86	0755	edit dl rm
find-unused-docs.sh	1310	0755	edit dl rm
gcc-goto.sh	530	0755	edit dl rm
gcc-ld	711	0755	edit dl rm
gcc-plugin.sh	1090	0755	edit dl rm
gcc-version.sh	857	0755	edit dl rm
gcc-x86_32-has-stack-protector.sh	173	0755	edit dl rm
gcc-x86_64-has-stack-protector.sh	198	0755	edit dl rm
gen_initramfs_list.sh	8224	0755	edit dl rm
get_dvb_firmware	25824	0755	edit dl rm
get_maintainer.pl	67369	0755	edit dl rm
gfp-translate	1752	0755	edit dl rm
headerdep.pl	3582	0755	edit dl rm
headers.sh	512	0755	edit dl rm
headers_check.pl	3815	0755	edit dl rm
headers_install.sh	1397	0755	edit dl rm
insert-sys-cert.c	9084	0644	edit dl rm
kallsyms	19992	0755	edit dl rm
kallsyms.c	18580	0644	edit dl rm
Kbuild.include	15468	0644	edit dl rm
Kconfig.include	1173	0644	edit dl rm
kernel-doc	62560	0755	edit dl rm
ld-version.sh	269	0755	edit dl rm
leaking_addresses.pl	13160	0755	edit dl rm
Lindent	502	0755	edit dl rm
link-vmlinux.sh	9176	0755	edit dl rm
Makefile	1741	0644	edit dl rm
Makefile.asm-generic	1193	0644	edit dl rm
Makefile.build	19707	0644	edit dl rm
Makefile.clean	2883	0644	edit dl rm
Makefile.dtbinst	1116	0644	edit dl rm
Makefile.extrawarn	2770	0644	edit dl rm
Makefile.gcc-plugins	1861	0644	edit dl rm
Makefile.headersinst	4079	0644	edit dl rm
Makefile.host	6520	0644	edit dl rm
Makefile.kasan	1679	0644	edit dl rm
Makefile.kcov	319	0644	edit dl rm
Makefile.kcsan	118	0644	edit dl rm
Makefile.lib	15535	0644	edit dl rm
Makefile.modbuiltin	1717	0644	edit dl rm
Makefile.modinst	1149	0644	edit dl rm
Makefile.modpost	5430	0644	edit dl rm
Makefile.modsign	897	0644	edit dl rm
Makefile.ubsan	951	0644	edit dl rm
makelst	808	0755	edit dl rm
markup_oops.pl	8273	0755	edit dl rm
mkcompile_h	2628	0755	edit dl rm
mkmakefile	1218	0755	edit dl rm
mksysmap	1359	0755	edit dl rm
mkuboot.sh	414	0755	edit dl rm
module-common.lds	901	0644	edit dl rm
modules.order	0	0644	edit dl rm
namespace.pl	13358	0755	edit dl rm
objdiff	2917	0755	edit dl rm
parse-maintainers.pl	4646	0755	edit dl rm
patch-kernel	10185	0755	edit dl rm
pnmtologo	15720	0755	edit dl rm
pnmtologo.c	12197	0644	edit dl rm
profile2linkerlist.pl	410	0755	edit dl rm
prune-kernel	708	0755	edit dl rm
recordmcount	24008	0755	edit dl rm
recordmcount.c	17062	0644	edit dl rm
recordmcount.h	16772	0644	edit dl rm
recordmcount.pl	18709	0755	edit dl rm
setlocalversion	4013	0755	edit dl rm
show_delta	3076	0755	edit dl rm
sign-file	15768	0755	edit dl rm
sign-file.c	9994	0644	edit dl rm
sortextable	15712	0755	edit dl rm
sortextable.c	10411	0644	edit dl rm
sortextable.h	5614	0644	edit dl rm
spelling.txt	25611	0644	edit dl rm
sphinx-pre-install	14378	0755	edit dl rm
split-man.pl	600	0755	edit dl rm
stackdelta	1883	0755	edit dl rm
stackusage	794	0755	edit dl rm
subarch.include	641	0644	edit dl rm
tags.sh	9789	0755	edit dl rm
test_fortify.sh	2281	0644	edit dl rm
unifdef	36192	0755	edit dl rm
unifdef.c	35637	0644	edit dl rm
ver_linux	2747	0755	edit dl rm
xen-hypercalls.sh	386	0644	edit dl rm
xz_wrap.sh	562	0755	edit dl rm

Edit: /usr/src/kernels/4.18.0-553.121.1.el8_10.x86_64/scripts/kallsyms.c (18580B)

/* 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
 *
 *      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>
#include <limits.h>

#ifndef ARRAY_SIZE
#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof(arr[0]))
#endif

#define KSYM_NAME_LEN		128

struct sym_entry {
	unsigned long long addr;
	unsigned int len;
	unsigned int start_pos;
	unsigned char *sym;
	unsigned int percpu_absolute;
};

struct addr_range {
	const char *start_sym, *end_sym;
	unsigned long long start, end;
};

static unsigned long long _text;
static unsigned long long relative_base;
static struct addr_range text_ranges[] = {
	{ "_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])

static struct addr_range percpu_range = {
	"__per_cpu_start", "__per_cpu_end", -1ULL, 0
};

static struct sym_entry *table;
static unsigned int table_size, table_cnt;
static int all_symbols = 0;
static int absolute_percpu = 0;
static int base_relative = 0;

int token_profit[0x10000];

/* the table that holds the result of the compression */
unsigned char best_table[256][2];
unsigned char best_table_len[256];

static void usage(void)
{
	fprintf(stderr, "Usage: kallsyms [--all-symbols] "
			"[--base-relative] < in.map > out.S\n");
	exit(1);
}

/*
 * This ignores the intensely annoying "mapping symbols" found
 * in ARM ELF files: $a, $t and $d.
 */
static inline int is_arm_mapping_symbol(const char *str)
{
	return str[0] == '$' && strchr("axtd", str[1])
	       && (str[2] == '\0' || str[2] == '.');
}

static int check_symbol_range(const char *sym, unsigned long long addr,
			      struct addr_range *ranges, int entries)
{
	size_t i;
	struct addr_range *ar;

for (i = 0; i < entries; ++i) {
		ar = &ranges[i];

if (strcmp(sym, ar->start_sym) == 0) {
			ar->start = addr;
			return 0;
		} else if (strcmp(sym, ar->end_sym) == 0) {
			ar->end = addr;
			return 0;
		}
	}

return 1;
}

static int read_symbol(FILE *in, struct sym_entry *s)
{
	char sym[500], stype;
	int rc;

rc = fscanf(in, "%llx %c %499s\n", &s->addr, &stype, sym);
	if (rc != 3) {
		if (rc != EOF && fgets(sym, 500, in) == NULL)
			fprintf(stderr, "Read error or end of file.\n");
		return -1;
	}
	if (strlen(sym) > KSYM_NAME_LEN) {
		fprintf(stderr, "Symbol %s too long for kallsyms (%zu vs %d).\n"
				"Please increase KSYM_NAME_LEN both in kernel and kallsyms.c\n",
			sym, strlen(sym), KSYM_NAME_LEN);
		return -1;
	}

/* Ignore most absolute/undefined (?) symbols. */
	if (strcmp(sym, "_text") == 0)
		_text = s->addr;
	else if (check_symbol_range(sym, s->addr, text_ranges,
				    ARRAY_SIZE(text_ranges)) == 0)
		/* nothing to do */;
	else if (toupper(stype) == 'A')
	{
		/* Keep these useful absolute symbols */
		if (strcmp(sym, "__kernel_syscall_via_break") &&
		    strcmp(sym, "__kernel_syscall_via_epc") &&
		    strcmp(sym, "__kernel_sigtramp") &&
		    strcmp(sym, "__gp"))
			return -1;

}
	else if (toupper(stype) == 'U' ||
		 is_arm_mapping_symbol(sym))
		return -1;
	/* exclude also MIPS ELF local symbols ($L123 instead of .L123) */
	else if (sym[0] == '$')
		return -1;
	/* exclude debugging symbols */
	else if (stype == 'N' || stype == 'n')
		return -1;

/* include the type field in the symbol name, so that it gets
	 * compressed together */
	s->len = strlen(sym) + 1;
	s->sym = malloc(s->len + 1);
	if (!s->sym) {
		fprintf(stderr, "kallsyms failure: "
			"unable to allocate required amount of memory\n");
		exit(EXIT_FAILURE);
	}
	strcpy((char *)s->sym + 1, sym);
	s->sym[0] = stype;

s->percpu_absolute = 0;

/* Record if we've found __per_cpu_start/end. */
	check_symbol_range(sym, s->addr, &percpu_range, 1);

return 0;
}

static int symbol_in_range(struct sym_entry *s, struct addr_range *ranges,
			   int entries)
{
	size_t i;
	struct addr_range *ar;

for (i = 0; i < entries; ++i) {
		ar = &ranges[i];

if (s->addr >= ar->start && s->addr <= ar->end)
			return 1;
	}

return 0;
}

static int symbol_valid(struct sym_entry *s)
{
	/* Symbols which vary between passes.  Passes 1 and 2 must have
	 * 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.
	 */
	static char *special_symbols[] = {
		"kallsyms_addresses",
		"kallsyms_offsets",
		"kallsyms_relative_base",
		"kallsyms_num_syms",
		"kallsyms_names",
		"kallsyms_markers",
		"kallsyms_token_table",
		"kallsyms_token_index",

/* Exclude linker generated symbols which vary between passes */
		"_SDA_BASE_",		/* ppc */
		"_SDA2_BASE_",		/* ppc */
		NULL };

static char *special_prefixes[] = {
		"__crc_",		/* modversions */
		"__efistub_",		/* arm64 EFI stub namespace */
		"__kvm_nvhe_",		/* arm64 non-VHE KVM namespace */
		NULL };

static char *special_suffixes[] = {
		"_veneer",		/* arm */
		"_from_arm",		/* arm */
		"_from_thumb",		/* arm */
		NULL };

int i;
	char *sym_name = (char *)s->sym + 1;

/* if --all-symbols is not specified, then symbols outside the text
	 * and inittext sections are discarded */
	if (!all_symbols) {
		if (symbol_in_range(s, text_ranges,
				    ARRAY_SIZE(text_ranges)) == 0)
			return 0;
		/* Corner case.  Discard any symbols with the same value as
		 * _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.
		 */
		if ((s->addr == text_range_text->end &&
				strcmp(sym_name,
				       text_range_text->end_sym)) ||
		    (s->addr == text_range_inittext->end &&
				strcmp(sym_name,
				       text_range_inittext->end_sym)))
			return 0;
	}

/* Exclude symbols which vary between passes. */
	for (i = 0; special_symbols[i]; i++)
		if (strcmp(sym_name, special_symbols[i]) == 0)
			return 0;

for (i = 0; special_prefixes[i]; i++) {
		int l = strlen(special_prefixes[i]);

if (l <= strlen(sym_name) &&
		    strncmp(sym_name, special_prefixes[i], l) == 0)
			return 0;
	}

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;
	}

return 1;
}

static void read_map(FILE *in)
{
	while (!feof(in)) {
		if (table_cnt >= table_size) {
			table_size += 10000;
			table = realloc(table, sizeof(*table) * table_size);
			if (!table) {
				fprintf(stderr, "out of memory\n");
				exit (1);
			}
		}
		if (read_symbol(in, &table[table_cnt]) == 0) {
			table[table_cnt].start_pos = table_cnt;
			table_cnt++;
		}
	}
}

static void output_label(char *label)
{
	printf(".globl %s\n", label);
	printf("\tALGN\n");
	printf("%s:\n", label);
}

/* 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;
}

static int symbol_absolute(struct sym_entry *s)
{
	return s->percpu_absolute;
}

static void write_src(void)
{
	unsigned int i, k, off;
	unsigned int best_idx[256];
	unsigned int *markers;
	char buf[KSYM_NAME_LEN];

printf("#include <asm/types.h>\n");
	printf("#if BITS_PER_LONG == 64\n");
	printf("#define PTR .quad\n");
	printf("#define ALGN .align 8\n");
	printf("#else\n");
	printf("#define PTR .long\n");
	printf("#define ALGN .align 4\n");
	printf("#endif\n");

printf("\t.section .rodata, \"a\"\n");

/* 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.
	 */
	if (!base_relative)
		output_label("kallsyms_addresses");
	else
		output_label("kallsyms_offsets");

for (i = 0; i < table_cnt; i++) {
		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\n",
					symbol_absolute(&table[i]) ? "absolute" : "relative",
					table[i].addr);
				exit(EXIT_FAILURE);
			}
			printf("\t.long\t%#x\n", (int)offset);
		} else if (!symbol_absolute(&table[i])) {
			if (_text <= table[i].addr)
				printf("\tPTR\t_text + %#llx\n",
					table[i].addr - _text);
			else
				printf("\tPTR\t_text - %#llx\n",
					_text - table[i].addr);
		} else {
			printf("\tPTR\t%#llx\n", table[i].addr);
		}
	}
	printf("\n");

if (base_relative) {
		output_label("kallsyms_relative_base");
		printf("\tPTR\t_text - %#llx\n", _text - relative_base);
		printf("\n");
	}

output_label("kallsyms_num_syms");
	printf("\tPTR\t%u\n", table_cnt);
	printf("\n");

/* table of offset markers, that give the offset in the compressed stream
	 * every 256 symbols */
	markers = malloc(sizeof(unsigned int) * ((table_cnt + 255) / 256));
	if (!markers) {
		fprintf(stderr, "kallsyms failure: "
			"unable to allocate required memory\n");
		exit(EXIT_FAILURE);
	}

output_label("kallsyms_names");
	off = 0;
	for (i = 0; i < table_cnt; i++) {
		if ((i & 0xFF) == 0)
			markers[i >> 8] = off;

printf("\t.byte 0x%02x", table[i].len);
		for (k = 0; k < table[i].len; k++)
			printf(", 0x%02x", table[i].sym[k]);
		printf("\n");

off += table[i].len + 1;
	}
	printf("\n");

output_label("kallsyms_markers");
	for (i = 0; i < ((table_cnt + 255) >> 8); i++)
		printf("\tPTR\t%d\n", markers[i]);
	printf("\n");

free(markers);

output_label("kallsyms_token_table");
	off = 0;
	for (i = 0; i < 256; i++) {
		best_idx[i] = off;
		expand_symbol(best_table[i], best_table_len[i], buf);
		printf("\t.asciz\t\"%s\"\n", buf);
		off += strlen(buf) + 1;
	}
	printf("\n");

output_label("kallsyms_token_index");
	for (i = 0; i < 256; i++)
		printf("\t.short\t%d\n", best_idx[i]);
	printf("\n");
}

/* table lookup compression functions */

/* 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++)
		token_profit[ symbol[i] + (symbol[i + 1] << 8) ]++;
}

/* 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++)
		token_profit[ symbol[i] + (symbol[i + 1] << 8) ]--;
}

/* remove all the invalid symbols from the table and do the initial token count */
static void build_initial_tok_table(void)
{
	unsigned int i, pos;

pos = 0;
	for (i = 0; i < table_cnt; i++) {
		if ( symbol_valid(&table[i]) ) {
			if (pos != i)
				table[pos] = table[i];
			learn_symbol(table[pos].sym, table[pos].len);
			pos++;
		}
	}
	table_cnt = pos;
}

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;
}

/* replace a given token in all the valid symbols. Use the sampled symbols
 * to update the counts */
static void compress_symbols(unsigned char *str, int idx)
{
	unsigned int i, len, size;
	unsigned char *p1, *p2;

for (i = 0; i < table_cnt; i++) {

len = table[i].len;
		p1 = table[i].sym;

/* find the token on the symbol */
		p2 = find_token(p1, len, str);
		if (!p2) continue;

/* decrease the counts for this symbol's tokens */
		forget_symbol(table[i].sym, len);

size = len;

do {
			*p2 = idx;
			p2++;
			size -= (p2 - p1);
			memmove(p2, p2 + 1, size);
			p1 = p2;
			len--;

if (size < 2) break;

/* find the token on the symbol */
			p2 = find_token(p1, size, str);

} while (p2);

table[i].len = len;

/* increase the counts for this symbol's new tokens */
		learn_symbol(table[i].sym, len);
	}
}

/* search the token with the maximum profit */
static int find_best_token(void)
{
	int i, best, bestprofit;

bestprofit=-10000;
	best = 0;

for (i = 0; i < 0x10000; i++) {
		if (token_profit[i] > bestprofit) {
			best = i;
			bestprofit = token_profit[i];
		}
	}
	return best;
}

/* this is the core of the algorithm: calculate the "best" table */
static void optimize_result(void)
{
	int i, best;

/* 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 best profit value */
			best = find_best_token();
			if (token_profit[best] == 0)
				break;

/* place it in the "best" table */
			best_table_len[i] = 2;
			best_table[i][0] = best & 0xFF;
			best_table[i][1] = (best >> 8) & 0xFF;

/* replace this token in all the valid symbols */
			compress_symbols(best_table[i], i);
		}
	}
}

/* start by placing the symbols that are actually used on the table */
static void insert_real_symbols_in_table(void)
{
	unsigned int i, j, c;

memset(best_table, 0, sizeof(best_table));
	memset(best_table_len, 0, sizeof(best_table_len));

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;
		}
	}
}

static void optimize_token_table(void)
{
	build_initial_tok_table();

insert_real_symbols_in_table();

/* When valid symbol is not registered, exit to error */
	if (!table_cnt) {
		fprintf(stderr, "No valid symbol.\n");
		exit(1);
	}

optimize_result();
}

/* 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;

while (*tail == '_')
		tail++;

return tail - str;
}

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;

/* 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;

/* 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);
}

static void make_percpus_absolute(void)
{
	unsigned int i;

for (i = 0; i < table_cnt; i++)
		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.
			 */
			table[i].sym[0] = 'A';
			table[i].percpu_absolute = 1;
		}
}

/* 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;
}

int main(int argc, char **argv)
{
	if (argc >= 2) {
		int i;
		for (i = 1; i < argc; i++) {
			if(strcmp(argv[i], "--all-symbols") == 0)
				all_symbols = 1;
			else if (strcmp(argv[i], "--absolute-percpu") == 0)
				absolute_percpu = 1;
			else if (strcmp(argv[i], "--base-relative") == 0)
				base_relative = 1;
			else
				usage();
		}
	} else if (argc != 1)
		usage();

read_map(stdin);
	if (absolute_percpu)
		make_percpus_absolute();
	if (base_relative)
		record_relative_base();
	sort_symbols();
	optimize_token_table();
	write_src();

return 0;
}

cmd: