[PATCH] kallsyms off-by-one and sorting

[Hugh Dickins]

kallsyms was off-by-one, showing the preceding symbol name.  For
example, if best index 0, no string was copied into the namebuf.

And it seems odd to do stem compression on symbols sorted by value:
save more space sorting by name.  It's harder then to avoid aliases
for a value: but very few in kernel text, so scrap last_addr check.

Against current BK: please apply.

Hugh

--- 2.5.54-bk/Makefile	Thu Jan  2 09:06:03 2003
+++ linux/Makefile	Wed Jan  8 20:46:44 2003
@@ -355,7 +355,7 @@
 kallsyms.o := .tmp_kallsyms2.o
 
 quiet_cmd_kallsyms = KSYM    $@
-cmd_kallsyms = $(NM) -n $< | scripts/kallsyms > $@
+cmd_kallsyms = $(NM) $< | scripts/kallsyms > $@
 
 .tmp_kallsyms1.o .tmp_kallsyms2.o: %.o: %.S scripts FORCE
 	$(call if_changed_dep,as_o_S)
--- 2.5.54-bk/kernel/kallsyms.c	Wed Jan  8 20:14:29 2003
+++ linux/kernel/kallsyms.c	Wed Jan  8 20:46:44 2003
@@ -25,8 +25,6 @@
 			    unsigned long *offset,
 			    char **modname, char *namebuf)
 {
-	unsigned long i, best = 0;
-
 	/* This kernel should never had been booted. */
 	if ((void *)kallsyms_addresses == &kallsyms_dummy)
 		BUG();
@@ -35,32 +33,34 @@
 	namebuf[0] = 0;
 
 	if (addr >= (unsigned long)_stext && addr <= (unsigned long)_etext) {
-		unsigned long symbol_end;
+		unsigned long below = 0;
+		unsigned long above = (unsigned long)_etext;
+		unsigned long i, best = 0;
 		char *name = kallsyms_names;
 
-		/* They're sorted, we could be clever here, but who cares? */
 		for (i = 0; i < kallsyms_num_syms; i++) {
-			if (kallsyms_addresses[i] > kallsyms_addresses[best] &&
-			    kallsyms_addresses[i] <= addr)
-				best = i;
+			unsigned long kaddr = kallsyms_addresses[i];
+			if (kaddr <= addr) {
+				if (kaddr > below) {
+					below = kaddr;
+					best = i;
+				}
+			} else {
+				if (kaddr < above)
+					above = kaddr;
+			}
 		}
 
 		/* Grab name */
-		for (i = 0; i < best; i++) { 
+		for (i = 0; i <= best; i++) {
 			unsigned prefix = *name++;
 			strncpy(namebuf + prefix, name, 127 - prefix);
 			name += strlen(name) + 1;
 		}
 
-		/* Base symbol size on next symbol. */
-		if (best + 1 < kallsyms_num_syms)
-			symbol_end = kallsyms_addresses[best + 1];
-		else
-			symbol_end = (unsigned long)_etext;
-
-		*symbolsize = symbol_end - kallsyms_addresses[best];
+		*symbolsize = above - below;
 		*modname = NULL;
-		*offset = addr - kallsyms_addresses[best];
+		*offset = addr - below;
 		return namebuf;
 	}
 
--- 2.5.54-bk/scripts/kallsyms.c	Wed Jan  8 20:14:30 2003
+++ linux/scripts/kallsyms.c	Wed Jan  8 20:46:44 2003
@@ -5,7 +5,7 @@
  * 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 > symbols.S
+ * Usage: nm vmlinux | scripts/kallsyms > symbols.S
  */
 
 #include <stdio.h>
@@ -91,7 +91,6 @@
 static void
 write_src(void)
 {
-	unsigned long long last_addr;
 	int i, valid = 0;
 	char *prev;
 
@@ -109,16 +108,12 @@
 	printf(".globl kallsyms_addresses\n");
 	printf("\tALGN\n");
 	printf("kallsyms_addresses:\n");
-	for (i = 0, last_addr = 0; i < cnt; i++) {
+	for (i = 0; i < cnt; i++) {
 		if (!symbol_valid(&table[i]))
 			continue;
 		
-		if (table[i].addr == last_addr)
-			continue;
-
 		printf("\tPTR\t%#llx\n", table[i].addr);
 		valid++;
-		last_addr = table[i].addr;
 	}
 	printf("\n");
 
@@ -132,20 +127,16 @@
 	printf("\tALGN\n");
 	printf("kallsyms_names:\n");
 	prev = ""; 
-	for (i = 0, last_addr = 0; i < cnt; i++) {
+	for (i = 0; i < cnt; i++) {
 		int k;
 
 		if (!symbol_valid(&table[i]))
 			continue;
 		
-		if (table[i].addr == last_addr)
-			continue;
-
 		for (k = 0; table[i].sym[k] && table[i].sym[k] == prev[k]; ++k)
 			; 
 
 		printf("\t.byte 0x%02x ; .asciz\t\"%s\"\n", k, table[i].sym + k);
-		last_addr = table[i].addr;
 		prev = table[i].sym;
 	}
 	printf("\n");