27 	struct syminfo table[];  member
69 			       struct syminfo *table,  in symsearch_populate()  argument
78 			table->symbol_index = sym - elf->symtab_start;  in symsearch_populate()
79 			table->section_index = get_secindex(elf, sym);  in symsearch_populate()
80 			table->addr = sym->st_value;  in symsearch_populate()
88 				table->addr &= ~1;  in symsearch_populate()
90 			table++;  in symsearch_populate()
113 static void symsearch_fixup(struct syminfo *table, unsigned int table_size)  in symsearch_fixup()  argument
117 		if (table[i].addr == table[i - 1].addr &&  in symsearch_fixup()
118 		    table[i].section_index == table[i - 1].section_index) {  in symsearch_fixup()
119 			table[i].symbol_index = table[i - 1].symbol_index;  in symsearch_fixup()
132 	symsearch_populate(elf, elf->symsearch->table, table_size);  in symsearch_init()
133 	qsort(elf->symsearch->table, table_size,  in symsearch_init()
136 	symsearch_fixup(elf->symsearch->table, table_size);  in symsearch_init()
159 	struct syminfo *table = elf->symsearch->table;  in symsearch_find_nearest()  local
168 		if (syminfo_compare(&table[mid], &target) > 0)  in symsearch_find_nearest()
188 	    table[hi].section_index == secndx &&  in symsearch_find_nearest()
189 	    table[hi].addr - addr <= min_distance) {  in symsearch_find_nearest()
190 		min_distance = table[hi].addr - addr;  in symsearch_find_nearest()
191 		result = &elf->symtab_start[table[hi].symbol_index];  in symsearch_find_nearest()
194 	    table[hi - 1].section_index == secndx &&  in symsearch_find_nearest()
195 	    addr - table[hi - 1].addr <= min_distance) {  in symsearch_find_nearest()
196 		result = &elf->symtab_start[table[hi - 1].symbol_index];  in symsearch_find_nearest()