157 	unsigned int hi = elf->symsearch->table_size;  in symsearch_find_nearest()  local
165 	while (hi > lo) {  in symsearch_find_nearest()
166 		unsigned int mid = lo + (hi - lo) / 2;  /* Avoids overflow */  in symsearch_find_nearest()
169 			hi = mid;  in symsearch_find_nearest()
175 	 * table[hi], if it exists, is the first entry in the array which  in symsearch_find_nearest()
176 	 * lies beyond target.  table[hi - 1], if it exists, is the last  in symsearch_find_nearest()
187 	    hi < elf->symsearch->table_size &&  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()
193 	if (hi > 0 &&  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()