Commit | Line | Data |
---|---|---|
c906108c | 1 | /* GDB routines for manipulating the minimal symbol tables. |
42a4f53d | 2 | Copyright (C) 1992-2019 Free Software Foundation, Inc. |
c906108c SS |
3 | Contributed by Cygnus Support, using pieces from other GDB modules. |
4 | ||
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
7 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 10 | (at your option) any later version. |
c906108c | 11 | |
c5aa993b JM |
12 | This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
c906108c | 16 | |
c5aa993b | 17 | You should have received a copy of the GNU General Public License |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | ||
21 | /* This file contains support routines for creating, manipulating, and | |
22 | destroying minimal symbol tables. | |
23 | ||
24 | Minimal symbol tables are used to hold some very basic information about | |
25 | all defined global symbols (text, data, bss, abs, etc). The only two | |
26 | required pieces of information are the symbol's name and the address | |
27 | associated with that symbol. | |
28 | ||
29 | In many cases, even if a file was compiled with no special options for | |
30 | debugging at all, as long as was not stripped it will contain sufficient | |
31 | information to build useful minimal symbol tables using this structure. | |
c5aa993b | 32 | |
c906108c SS |
33 | Even when a file contains enough debugging information to build a full |
34 | symbol table, these minimal symbols are still useful for quickly mapping | |
35 | between names and addresses, and vice versa. They are also sometimes used | |
025bb325 | 36 | to figure out what full symbol table entries need to be read in. */ |
c906108c SS |
37 | |
38 | ||
39 | #include "defs.h" | |
9227b5eb | 40 | #include <ctype.h> |
c906108c SS |
41 | #include "symtab.h" |
42 | #include "bfd.h" | |
0ba1096a | 43 | #include "filenames.h" |
c906108c SS |
44 | #include "symfile.h" |
45 | #include "objfiles.h" | |
46 | #include "demangle.h" | |
7ed49443 JB |
47 | #include "value.h" |
48 | #include "cp-abi.h" | |
42848c96 | 49 | #include "target.h" |
71c25dea TT |
50 | #include "cp-support.h" |
51 | #include "language.h" | |
529480d0 | 52 | #include "cli/cli-utils.h" |
268a13a5 | 53 | #include "gdbsupport/symbol.h" |
b5ec771e | 54 | #include <algorithm> |
deeeba55 | 55 | #include "safe-ctype.h" |
d55c9a68 TT |
56 | #include "gdbsupport/parallel-for.h" |
57 | ||
58 | #if CXX_STD_THREAD | |
59 | #include <mutex> | |
60 | #endif | |
c906108c | 61 | |
bf223d3e PA |
62 | /* See minsyms.h. */ |
63 | ||
64 | bool | |
4024cf2b PA |
65 | msymbol_is_function (struct objfile *objfile, minimal_symbol *minsym, |
66 | CORE_ADDR *func_address_p) | |
bf223d3e | 67 | { |
4024cf2b PA |
68 | CORE_ADDR msym_addr = MSYMBOL_VALUE_ADDRESS (objfile, minsym); |
69 | ||
70 | switch (minsym->type) | |
bf223d3e | 71 | { |
4024cf2b PA |
72 | case mst_slot_got_plt: |
73 | case mst_data: | |
74 | case mst_bss: | |
75 | case mst_abs: | |
76 | case mst_file_data: | |
77 | case mst_file_bss: | |
f50776aa | 78 | case mst_data_gnu_ifunc: |
4024cf2b PA |
79 | { |
80 | struct gdbarch *gdbarch = get_objfile_arch (objfile); | |
8b88a78e PA |
81 | CORE_ADDR pc |
82 | = gdbarch_convert_from_func_ptr_addr (gdbarch, msym_addr, | |
83 | current_top_target ()); | |
4024cf2b PA |
84 | if (pc != msym_addr) |
85 | { | |
86 | if (func_address_p != NULL) | |
87 | *func_address_p = pc; | |
88 | return true; | |
89 | } | |
90 | return false; | |
91 | } | |
bf223d3e | 92 | default: |
4024cf2b PA |
93 | if (func_address_p != NULL) |
94 | *func_address_p = msym_addr; | |
95 | return true; | |
bf223d3e PA |
96 | } |
97 | } | |
98 | ||
c906108c | 99 | /* Accumulate the minimal symbols for each objfile in bunches of BUNCH_SIZE. |
79e7ae11 | 100 | At the end, copy them all into one newly allocated array. */ |
c906108c SS |
101 | |
102 | #define BUNCH_SIZE 127 | |
103 | ||
104 | struct msym_bunch | |
c5aa993b JM |
105 | { |
106 | struct msym_bunch *next; | |
107 | struct minimal_symbol contents[BUNCH_SIZE]; | |
108 | }; | |
c906108c | 109 | |
b19686e0 | 110 | /* See minsyms.h. */ |
9227b5eb JB |
111 | |
112 | unsigned int | |
113 | msymbol_hash_iw (const char *string) | |
114 | { | |
115 | unsigned int hash = 0; | |
b8d56208 | 116 | |
9227b5eb JB |
117 | while (*string && *string != '(') |
118 | { | |
f1735a53 | 119 | string = skip_spaces (string); |
9227b5eb | 120 | if (*string && *string != '(') |
375f3d86 | 121 | { |
59d7bcaf | 122 | hash = SYMBOL_HASH_NEXT (hash, *string); |
375f3d86 DJ |
123 | ++string; |
124 | } | |
9227b5eb | 125 | } |
261397f8 | 126 | return hash; |
9227b5eb JB |
127 | } |
128 | ||
b19686e0 | 129 | /* See minsyms.h. */ |
9227b5eb JB |
130 | |
131 | unsigned int | |
132 | msymbol_hash (const char *string) | |
133 | { | |
134 | unsigned int hash = 0; | |
b8d56208 | 135 | |
9227b5eb | 136 | for (; *string; ++string) |
59d7bcaf | 137 | hash = SYMBOL_HASH_NEXT (hash, *string); |
261397f8 | 138 | return hash; |
9227b5eb JB |
139 | } |
140 | ||
141 | /* Add the minimal symbol SYM to an objfile's minsym hash table, TABLE. */ | |
984ac464 | 142 | static void |
9227b5eb JB |
143 | add_minsym_to_hash_table (struct minimal_symbol *sym, |
144 | struct minimal_symbol **table) | |
145 | { | |
146 | if (sym->hash_next == NULL) | |
147 | { | |
f56f77c1 | 148 | unsigned int hash |
c9d95fa3 | 149 | = msymbol_hash (sym->linkage_name ()) % MINIMAL_SYMBOL_HASH_SIZE; |
b8d56208 | 150 | |
9227b5eb JB |
151 | sym->hash_next = table[hash]; |
152 | table[hash] = sym; | |
153 | } | |
154 | } | |
155 | ||
0729fd50 DB |
156 | /* Add the minimal symbol SYM to an objfile's minsym demangled hash table, |
157 | TABLE. */ | |
158 | static void | |
159 | add_minsym_to_demangled_hash_table (struct minimal_symbol *sym, | |
b5ec771e | 160 | struct objfile *objfile) |
0729fd50 DB |
161 | { |
162 | if (sym->demangled_hash_next == NULL) | |
163 | { | |
b5ec771e | 164 | unsigned int hash = search_name_hash (MSYMBOL_LANGUAGE (sym), |
c9d95fa3 | 165 | sym->search_name ()); |
b5ec771e | 166 | |
1b7a07cb | 167 | objfile->per_bfd->demangled_hash_languages.set (MSYMBOL_LANGUAGE (sym)); |
b5ec771e PA |
168 | |
169 | struct minimal_symbol **table | |
170 | = objfile->per_bfd->msymbol_demangled_hash; | |
171 | unsigned int hash_index = hash % MINIMAL_SYMBOL_HASH_SIZE; | |
172 | sym->demangled_hash_next = table[hash_index]; | |
173 | table[hash_index] = sym; | |
174 | } | |
175 | } | |
b8d56208 | 176 | |
b5ec771e PA |
177 | /* Worker object for lookup_minimal_symbol. Stores temporary results |
178 | while walking the symbol tables. */ | |
179 | ||
180 | struct found_minimal_symbols | |
181 | { | |
182 | /* External symbols are best. */ | |
183 | bound_minimal_symbol external_symbol {}; | |
184 | ||
185 | /* File-local symbols are next best. */ | |
186 | bound_minimal_symbol file_symbol {}; | |
187 | ||
188 | /* Symbols for shared library trampolines are next best. */ | |
189 | bound_minimal_symbol trampoline_symbol {}; | |
190 | ||
191 | /* Called when a symbol name matches. Check if the minsym is a | |
192 | better type than what we had already found, and record it in one | |
193 | of the members fields if so. Returns true if we collected the | |
194 | real symbol, in which case we can stop searching. */ | |
195 | bool maybe_collect (const char *sfile, objfile *objf, | |
196 | minimal_symbol *msymbol); | |
197 | }; | |
198 | ||
199 | /* See declaration above. */ | |
200 | ||
201 | bool | |
202 | found_minimal_symbols::maybe_collect (const char *sfile, | |
203 | struct objfile *objfile, | |
204 | minimal_symbol *msymbol) | |
205 | { | |
206 | switch (MSYMBOL_TYPE (msymbol)) | |
207 | { | |
208 | case mst_file_text: | |
209 | case mst_file_data: | |
210 | case mst_file_bss: | |
211 | if (sfile == NULL | |
212 | || filename_cmp (msymbol->filename, sfile) == 0) | |
213 | { | |
214 | file_symbol.minsym = msymbol; | |
215 | file_symbol.objfile = objfile; | |
216 | } | |
217 | break; | |
218 | ||
219 | case mst_solib_trampoline: | |
220 | ||
221 | /* If a trampoline symbol is found, we prefer to keep | |
222 | looking for the *real* symbol. If the actual symbol | |
223 | is not found, then we'll use the trampoline | |
224 | entry. */ | |
225 | if (trampoline_symbol.minsym == NULL) | |
226 | { | |
227 | trampoline_symbol.minsym = msymbol; | |
228 | trampoline_symbol.objfile = objfile; | |
229 | } | |
230 | break; | |
231 | ||
232 | case mst_unknown: | |
233 | default: | |
234 | external_symbol.minsym = msymbol; | |
235 | external_symbol.objfile = objfile; | |
236 | /* We have the real symbol. No use looking further. */ | |
237 | return true; | |
238 | } | |
239 | ||
240 | /* Keep looking. */ | |
241 | return false; | |
242 | } | |
243 | ||
244 | /* Walk the mangled name hash table, and pass each symbol whose name | |
245 | matches LOOKUP_NAME according to NAMECMP to FOUND. */ | |
246 | ||
247 | static void | |
248 | lookup_minimal_symbol_mangled (const char *lookup_name, | |
249 | const char *sfile, | |
250 | struct objfile *objfile, | |
251 | struct minimal_symbol **table, | |
252 | unsigned int hash, | |
253 | int (*namecmp) (const char *, const char *), | |
254 | found_minimal_symbols &found) | |
255 | { | |
256 | for (minimal_symbol *msymbol = table[hash]; | |
257 | msymbol != NULL; | |
258 | msymbol = msymbol->hash_next) | |
259 | { | |
c9d95fa3 | 260 | const char *symbol_name = msymbol->linkage_name (); |
b5ec771e PA |
261 | |
262 | if (namecmp (symbol_name, lookup_name) == 0 | |
263 | && found.maybe_collect (sfile, objfile, msymbol)) | |
264 | return; | |
265 | } | |
266 | } | |
267 | ||
268 | /* Walk the demangled name hash table, and pass each symbol whose name | |
269 | matches LOOKUP_NAME according to MATCHER to FOUND. */ | |
270 | ||
271 | static void | |
272 | lookup_minimal_symbol_demangled (const lookup_name_info &lookup_name, | |
273 | const char *sfile, | |
274 | struct objfile *objfile, | |
275 | struct minimal_symbol **table, | |
276 | unsigned int hash, | |
277 | symbol_name_matcher_ftype *matcher, | |
278 | found_minimal_symbols &found) | |
279 | { | |
280 | for (minimal_symbol *msymbol = table[hash]; | |
281 | msymbol != NULL; | |
282 | msymbol = msymbol->demangled_hash_next) | |
283 | { | |
c9d95fa3 | 284 | const char *symbol_name = msymbol->search_name (); |
b5ec771e PA |
285 | |
286 | if (matcher (symbol_name, lookup_name, NULL) | |
287 | && found.maybe_collect (sfile, objfile, msymbol)) | |
288 | return; | |
0729fd50 DB |
289 | } |
290 | } | |
291 | ||
c906108c SS |
292 | /* Look through all the current minimal symbol tables and find the |
293 | first minimal symbol that matches NAME. If OBJF is non-NULL, limit | |
72a5efb3 DJ |
294 | the search to that objfile. If SFILE is non-NULL, the only file-scope |
295 | symbols considered will be from that source file (global symbols are | |
296 | still preferred). Returns a pointer to the minimal symbol that | |
c906108c SS |
297 | matches, or NULL if no match is found. |
298 | ||
299 | Note: One instance where there may be duplicate minimal symbols with | |
300 | the same name is when the symbol tables for a shared library and the | |
301 | symbol tables for an executable contain global symbols with the same | |
d73f140a JB |
302 | names (the dynamic linker deals with the duplication). |
303 | ||
304 | It's also possible to have minimal symbols with different mangled | |
305 | names, but identical demangled names. For example, the GNU C++ v3 | |
306 | ABI requires the generation of two (or perhaps three) copies of | |
307 | constructor functions --- "in-charge", "not-in-charge", and | |
308 | "allocate" copies; destructors may be duplicated as well. | |
309 | Obviously, there must be distinct mangled names for each of these, | |
310 | but the demangled names are all the same: S::S or S::~S. */ | |
c906108c | 311 | |
3b7344d5 TT |
312 | struct bound_minimal_symbol |
313 | lookup_minimal_symbol (const char *name, const char *sfile, | |
314 | struct objfile *objf) | |
c906108c | 315 | { |
b5ec771e | 316 | found_minimal_symbols found; |
c906108c | 317 | |
b5ec771e | 318 | unsigned int mangled_hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; |
9227b5eb | 319 | |
b5ec771e PA |
320 | auto *mangled_cmp |
321 | = (case_sensitivity == case_sensitive_on | |
322 | ? strcmp | |
323 | : strcasecmp); | |
71c25dea | 324 | |
c906108c | 325 | if (sfile != NULL) |
9f37bbcc | 326 | sfile = lbasename (sfile); |
c906108c | 327 | |
b5ec771e | 328 | lookup_name_info lookup_name (name, symbol_name_match_type::FULL); |
71c25dea | 329 | |
bf227d61 | 330 | for (objfile *objfile : current_program_space->objfiles ()) |
c906108c | 331 | { |
bf227d61 TT |
332 | if (found.external_symbol.minsym != NULL) |
333 | break; | |
334 | ||
56e3f43c | 335 | if (objf == NULL || objf == objfile |
15d123c9 | 336 | || objf == objfile->separate_debug_objfile_backlink) |
c906108c | 337 | { |
b5ec771e PA |
338 | if (symbol_lookup_debug) |
339 | { | |
340 | fprintf_unfiltered (gdb_stdlog, | |
341 | "lookup_minimal_symbol (%s, %s, %s)\n", | |
342 | name, sfile != NULL ? sfile : "NULL", | |
343 | objfile_debug_name (objfile)); | |
344 | } | |
345 | ||
9227b5eb JB |
346 | /* Do two passes: the first over the ordinary hash table, |
347 | and the second over the demangled hash table. */ | |
b5ec771e PA |
348 | lookup_minimal_symbol_mangled (name, sfile, objfile, |
349 | objfile->per_bfd->msymbol_hash, | |
350 | mangled_hash, mangled_cmp, found); | |
cc485e62 | 351 | |
b5ec771e PA |
352 | /* If not found, try the demangled hash table. */ |
353 | if (found.external_symbol.minsym == NULL) | |
c906108c | 354 | { |
b5ec771e PA |
355 | /* Once for each language in the demangled hash names |
356 | table (usually just zero or one languages). */ | |
1b7a07cb | 357 | for (unsigned iter = 0; iter < nr_languages; ++iter) |
c906108c | 358 | { |
1b7a07cb TT |
359 | if (!objfile->per_bfd->demangled_hash_languages.test (iter)) |
360 | continue; | |
361 | enum language lang = (enum language) iter; | |
362 | ||
b5ec771e PA |
363 | unsigned int hash |
364 | = (lookup_name.search_name_hash (lang) | |
365 | % MINIMAL_SYMBOL_HASH_SIZE); | |
366 | ||
367 | symbol_name_matcher_ftype *match | |
618daa93 PA |
368 | = get_symbol_name_matcher (language_def (lang), |
369 | lookup_name); | |
b5ec771e PA |
370 | struct minimal_symbol **msymbol_demangled_hash |
371 | = objfile->per_bfd->msymbol_demangled_hash; | |
372 | ||
373 | lookup_minimal_symbol_demangled (lookup_name, sfile, objfile, | |
374 | msymbol_demangled_hash, | |
375 | hash, match, found); | |
376 | ||
377 | if (found.external_symbol.minsym != NULL) | |
378 | break; | |
9227b5eb | 379 | } |
c906108c SS |
380 | } |
381 | } | |
382 | } | |
71c25dea | 383 | |
c906108c | 384 | /* External symbols are best. */ |
b5ec771e | 385 | if (found.external_symbol.minsym != NULL) |
cc485e62 DE |
386 | { |
387 | if (symbol_lookup_debug) | |
388 | { | |
b5ec771e PA |
389 | minimal_symbol *minsym = found.external_symbol.minsym; |
390 | ||
cc485e62 | 391 | fprintf_unfiltered (gdb_stdlog, |
b5ec771e PA |
392 | "lookup_minimal_symbol (...) = %s (external)\n", |
393 | host_address_to_string (minsym)); | |
cc485e62 | 394 | } |
b5ec771e | 395 | return found.external_symbol; |
cc485e62 | 396 | } |
c906108c SS |
397 | |
398 | /* File-local symbols are next best. */ | |
b5ec771e | 399 | if (found.file_symbol.minsym != NULL) |
cc485e62 DE |
400 | { |
401 | if (symbol_lookup_debug) | |
402 | { | |
b5ec771e PA |
403 | minimal_symbol *minsym = found.file_symbol.minsym; |
404 | ||
cc485e62 | 405 | fprintf_unfiltered (gdb_stdlog, |
b5ec771e PA |
406 | "lookup_minimal_symbol (...) = %s (file-local)\n", |
407 | host_address_to_string (minsym)); | |
cc485e62 | 408 | } |
b5ec771e | 409 | return found.file_symbol; |
cc485e62 | 410 | } |
c906108c SS |
411 | |
412 | /* Symbols for shared library trampolines are next best. */ | |
b5ec771e | 413 | if (found.trampoline_symbol.minsym != NULL) |
cc485e62 | 414 | { |
b5ec771e PA |
415 | if (symbol_lookup_debug) |
416 | { | |
417 | minimal_symbol *minsym = found.trampoline_symbol.minsym; | |
418 | ||
419 | fprintf_unfiltered (gdb_stdlog, | |
420 | "lookup_minimal_symbol (...) = %s (trampoline)\n", | |
421 | host_address_to_string (minsym)); | |
422 | } | |
423 | ||
424 | return found.trampoline_symbol; | |
cc485e62 | 425 | } |
b5ec771e PA |
426 | |
427 | /* Not found. */ | |
428 | if (symbol_lookup_debug) | |
429 | fprintf_unfiltered (gdb_stdlog, "lookup_minimal_symbol (...) = NULL\n"); | |
430 | return {}; | |
7c7b6655 TT |
431 | } |
432 | ||
433 | /* See minsyms.h. */ | |
c906108c | 434 | |
7c7b6655 TT |
435 | struct bound_minimal_symbol |
436 | lookup_bound_minimal_symbol (const char *name) | |
437 | { | |
3b7344d5 | 438 | return lookup_minimal_symbol (name, NULL, NULL); |
c906108c SS |
439 | } |
440 | ||
268a13a5 | 441 | /* See gdbsupport/symbol.h. */ |
bd9269f7 GB |
442 | |
443 | int | |
444 | find_minimal_symbol_address (const char *name, CORE_ADDR *addr, | |
445 | struct objfile *objfile) | |
446 | { | |
447 | struct bound_minimal_symbol sym | |
448 | = lookup_minimal_symbol (name, NULL, objfile); | |
449 | ||
450 | if (sym.minsym != NULL) | |
451 | *addr = BMSYMBOL_VALUE_ADDRESS (sym); | |
452 | ||
453 | return sym.minsym == NULL; | |
454 | } | |
455 | ||
8825213e PA |
456 | /* Get the lookup name form best suitable for linkage name |
457 | matching. */ | |
458 | ||
459 | static const char * | |
460 | linkage_name_str (const lookup_name_info &lookup_name) | |
461 | { | |
462 | /* Unlike most languages (including C++), Ada uses the | |
463 | encoded/linkage name as the search name recorded in symbols. So | |
464 | if debugging in Ada mode, prefer the Ada-encoded name. This also | |
465 | makes Ada's verbatim match syntax ("<...>") work, because | |
466 | "lookup_name.name()" includes the "<>"s, while | |
467 | "lookup_name.ada().lookup_name()" is the encoded name with "<>"s | |
468 | stripped. */ | |
469 | if (current_language->la_language == language_ada) | |
470 | return lookup_name.ada ().lookup_name ().c_str (); | |
471 | ||
472 | return lookup_name.name ().c_str (); | |
473 | } | |
474 | ||
b19686e0 | 475 | /* See minsyms.h. */ |
f8eba3c6 TT |
476 | |
477 | void | |
41c1efc6 TT |
478 | iterate_over_minimal_symbols |
479 | (struct objfile *objf, const lookup_name_info &lookup_name, | |
ca31ab1d | 480 | gdb::function_view<bool (struct minimal_symbol *)> callback) |
f8eba3c6 | 481 | { |
f8eba3c6 | 482 | /* The first pass is over the ordinary hash table. */ |
f8eba3c6 | 483 | { |
8825213e | 484 | const char *name = linkage_name_str (lookup_name); |
b5ec771e PA |
485 | unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; |
486 | auto *mangled_cmp | |
487 | = (case_sensitivity == case_sensitive_on | |
488 | ? strcmp | |
489 | : strcasecmp); | |
490 | ||
491 | for (minimal_symbol *iter = objf->per_bfd->msymbol_hash[hash]; | |
492 | iter != NULL; | |
493 | iter = iter->hash_next) | |
494 | { | |
c9d95fa3 | 495 | if (mangled_cmp (iter->linkage_name (), name) == 0) |
ca31ab1d PA |
496 | if (callback (iter)) |
497 | return; | |
b5ec771e | 498 | } |
f8eba3c6 TT |
499 | } |
500 | ||
b5ec771e PA |
501 | /* The second pass is over the demangled table. Once for each |
502 | language in the demangled hash names table (usually just zero or | |
503 | one). */ | |
1b7a07cb | 504 | for (unsigned liter = 0; liter < nr_languages; ++liter) |
f8eba3c6 | 505 | { |
1b7a07cb TT |
506 | if (!objf->per_bfd->demangled_hash_languages.test (liter)) |
507 | continue; | |
508 | ||
509 | enum language lang = (enum language) liter; | |
b5ec771e PA |
510 | const language_defn *lang_def = language_def (lang); |
511 | symbol_name_matcher_ftype *name_match | |
618daa93 | 512 | = get_symbol_name_matcher (lang_def, lookup_name); |
b5ec771e PA |
513 | |
514 | unsigned int hash | |
515 | = lookup_name.search_name_hash (lang) % MINIMAL_SYMBOL_HASH_SIZE; | |
516 | for (minimal_symbol *iter = objf->per_bfd->msymbol_demangled_hash[hash]; | |
517 | iter != NULL; | |
518 | iter = iter->demangled_hash_next) | |
c9d95fa3 | 519 | if (name_match (iter->search_name (), lookup_name, NULL)) |
ca31ab1d PA |
520 | if (callback (iter)) |
521 | return; | |
f8eba3c6 TT |
522 | } |
523 | } | |
524 | ||
b19686e0 | 525 | /* See minsyms.h. */ |
c5aa993b | 526 | |
4b610737 TT |
527 | bound_minimal_symbol |
528 | lookup_minimal_symbol_linkage (const char *name, struct objfile *objf) | |
529 | { | |
530 | unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; | |
531 | ||
532 | for (objfile *objfile : objf->separate_debug_objfiles ()) | |
533 | { | |
534 | for (minimal_symbol *msymbol = objfile->per_bfd->msymbol_hash[hash]; | |
535 | msymbol != NULL; | |
536 | msymbol = msymbol->hash_next) | |
537 | { | |
c9d95fa3 | 538 | if (strcmp (msymbol->linkage_name (), name) == 0 |
4b610737 TT |
539 | && (MSYMBOL_TYPE (msymbol) == mst_data |
540 | || MSYMBOL_TYPE (msymbol) == mst_bss)) | |
541 | return {msymbol, objfile}; | |
542 | } | |
543 | } | |
544 | ||
545 | return {}; | |
546 | } | |
547 | ||
548 | /* See minsyms.h. */ | |
549 | ||
3b7344d5 | 550 | struct bound_minimal_symbol |
5520a790 | 551 | lookup_minimal_symbol_text (const char *name, struct objfile *objf) |
c906108c | 552 | { |
c906108c | 553 | struct minimal_symbol *msymbol; |
3b7344d5 TT |
554 | struct bound_minimal_symbol found_symbol = { NULL, NULL }; |
555 | struct bound_minimal_symbol found_file_symbol = { NULL, NULL }; | |
c906108c | 556 | |
72a5efb3 DJ |
557 | unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; |
558 | ||
bf227d61 | 559 | for (objfile *objfile : current_program_space->objfiles ()) |
c906108c | 560 | { |
bf227d61 TT |
561 | if (found_symbol.minsym != NULL) |
562 | break; | |
563 | ||
56e3f43c | 564 | if (objf == NULL || objf == objfile |
15d123c9 | 565 | || objf == objfile->separate_debug_objfile_backlink) |
c906108c | 566 | { |
34643a32 | 567 | for (msymbol = objfile->per_bfd->msymbol_hash[hash]; |
3b7344d5 | 568 | msymbol != NULL && found_symbol.minsym == NULL; |
72a5efb3 | 569 | msymbol = msymbol->hash_next) |
c906108c | 570 | { |
c9d95fa3 | 571 | if (strcmp (msymbol->linkage_name (), name) == 0 && |
0875794a JK |
572 | (MSYMBOL_TYPE (msymbol) == mst_text |
573 | || MSYMBOL_TYPE (msymbol) == mst_text_gnu_ifunc | |
574 | || MSYMBOL_TYPE (msymbol) == mst_file_text)) | |
c906108c SS |
575 | { |
576 | switch (MSYMBOL_TYPE (msymbol)) | |
577 | { | |
578 | case mst_file_text: | |
3b7344d5 TT |
579 | found_file_symbol.minsym = msymbol; |
580 | found_file_symbol.objfile = objfile; | |
c906108c SS |
581 | break; |
582 | default: | |
3b7344d5 TT |
583 | found_symbol.minsym = msymbol; |
584 | found_symbol.objfile = objfile; | |
c906108c SS |
585 | break; |
586 | } | |
587 | } | |
588 | } | |
589 | } | |
590 | } | |
591 | /* External symbols are best. */ | |
3b7344d5 | 592 | if (found_symbol.minsym) |
c906108c SS |
593 | return found_symbol; |
594 | ||
595 | /* File-local symbols are next best. */ | |
3b7344d5 | 596 | return found_file_symbol; |
c906108c SS |
597 | } |
598 | ||
b19686e0 | 599 | /* See minsyms.h. */ |
907fc202 UW |
600 | |
601 | struct minimal_symbol * | |
602 | lookup_minimal_symbol_by_pc_name (CORE_ADDR pc, const char *name, | |
603 | struct objfile *objf) | |
604 | { | |
907fc202 UW |
605 | struct minimal_symbol *msymbol; |
606 | ||
607 | unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; | |
608 | ||
bf227d61 | 609 | for (objfile *objfile : current_program_space->objfiles ()) |
907fc202 UW |
610 | { |
611 | if (objf == NULL || objf == objfile | |
15d123c9 | 612 | || objf == objfile->separate_debug_objfile_backlink) |
907fc202 | 613 | { |
34643a32 | 614 | for (msymbol = objfile->per_bfd->msymbol_hash[hash]; |
907fc202 UW |
615 | msymbol != NULL; |
616 | msymbol = msymbol->hash_next) | |
617 | { | |
77e371c0 | 618 | if (MSYMBOL_VALUE_ADDRESS (objfile, msymbol) == pc |
c9d95fa3 | 619 | && strcmp (msymbol->linkage_name (), name) == 0) |
907fc202 UW |
620 | return msymbol; |
621 | } | |
622 | } | |
623 | } | |
624 | ||
625 | return NULL; | |
626 | } | |
627 | ||
77e371c0 TT |
628 | /* A helper function that makes *PC section-relative. This searches |
629 | the sections of OBJFILE and if *PC is in a section, it subtracts | |
630 | the section offset and returns true. Otherwise it returns | |
631 | false. */ | |
632 | ||
633 | static int | |
634 | frob_address (struct objfile *objfile, CORE_ADDR *pc) | |
635 | { | |
636 | struct obj_section *iter; | |
637 | ||
638 | ALL_OBJFILE_OSECTIONS (objfile, iter) | |
639 | { | |
640 | if (*pc >= obj_section_addr (iter) && *pc < obj_section_endaddr (iter)) | |
641 | { | |
642 | *pc -= obj_section_offset (iter); | |
643 | return 1; | |
644 | } | |
645 | } | |
646 | ||
647 | return 0; | |
648 | } | |
649 | ||
6ae50267 PA |
650 | /* Helper for lookup_minimal_symbol_by_pc_section. Convert a |
651 | lookup_msym_prefer to a minimal_symbol_type. */ | |
652 | ||
653 | static minimal_symbol_type | |
654 | msym_prefer_to_msym_type (lookup_msym_prefer prefer) | |
655 | { | |
656 | switch (prefer) | |
657 | { | |
658 | case lookup_msym_prefer::TEXT: | |
659 | return mst_text; | |
660 | case lookup_msym_prefer::TRAMPOLINE: | |
661 | return mst_solib_trampoline; | |
662 | case lookup_msym_prefer::GNU_IFUNC: | |
663 | return mst_text_gnu_ifunc; | |
664 | } | |
665 | ||
666 | /* Assert here instead of in a default switch case above so that | |
667 | -Wswitch warns if a new enumerator is added. */ | |
668 | gdb_assert_not_reached ("unhandled lookup_msym_prefer"); | |
669 | } | |
670 | ||
c906108c SS |
671 | /* Search through the minimal symbol table for each objfile and find |
672 | the symbol whose address is the largest address that is still less | |
00878c6e PP |
673 | than or equal to PC, and matches SECTION (which is not NULL). |
674 | Returns a pointer to the minimal symbol if such a symbol is found, | |
675 | or NULL if PC is not in a suitable range. | |
676 | Note that we need to look through ALL the minimal symbol tables | |
677 | before deciding on the symbol that comes closest to the specified PC. | |
678 | This is because objfiles can overlap, for example objfile A has .text | |
679 | at 0x100 and .data at 0x40000 and objfile B has .text at 0x234 and | |
680 | .data at 0x40048. | |
c906108c | 681 | |
2eaf8d2a DJ |
682 | If WANT_TRAMPOLINE is set, prefer mst_solib_trampoline symbols when |
683 | there are text and trampoline symbols at the same address. | |
684 | Otherwise prefer mst_text symbols. */ | |
685 | ||
20944a6e PA |
686 | bound_minimal_symbol |
687 | lookup_minimal_symbol_by_pc_section (CORE_ADDR pc_in, struct obj_section *section, | |
688 | lookup_msym_prefer prefer) | |
c906108c SS |
689 | { |
690 | int lo; | |
691 | int hi; | |
fe978cb0 | 692 | int newobj; |
c906108c SS |
693 | struct minimal_symbol *msymbol; |
694 | struct minimal_symbol *best_symbol = NULL; | |
7cbd4a93 TT |
695 | struct objfile *best_objfile = NULL; |
696 | struct bound_minimal_symbol result; | |
c906108c | 697 | |
20944a6e PA |
698 | if (section == NULL) |
699 | { | |
700 | section = find_pc_section (pc_in); | |
701 | if (section == NULL) | |
702 | return {}; | |
703 | } | |
704 | ||
6ae50267 | 705 | minimal_symbol_type want_type = msym_prefer_to_msym_type (prefer); |
00878c6e PP |
706 | |
707 | /* We can not require the symbol found to be in section, because | |
96225718 DJ |
708 | e.g. IRIX 6.5 mdebug relies on this code returning an absolute |
709 | symbol - but find_pc_section won't return an absolute section and | |
710 | hence the code below would skip over absolute symbols. We can | |
711 | still take advantage of the call to find_pc_section, though - the | |
712 | object file still must match. In case we have separate debug | |
713 | files, search both the file and its separate debug file. There's | |
714 | no telling which one will have the minimal symbols. */ | |
715 | ||
00878c6e | 716 | gdb_assert (section != NULL); |
96225718 | 717 | |
bde09ab7 | 718 | for (objfile *objfile : section->objfile->separate_debug_objfiles ()) |
c906108c | 719 | { |
77e371c0 TT |
720 | CORE_ADDR pc = pc_in; |
721 | ||
741d7538 TT |
722 | /* If this objfile has a minimal symbol table, go search it |
723 | using a binary search. */ | |
c906108c | 724 | |
34643a32 | 725 | if (objfile->per_bfd->minimal_symbol_count > 0) |
c906108c | 726 | { |
29e8a844 DJ |
727 | int best_zero_sized = -1; |
728 | ||
042d75e4 | 729 | msymbol = objfile->per_bfd->msymbols.get (); |
c906108c | 730 | lo = 0; |
34643a32 | 731 | hi = objfile->per_bfd->minimal_symbol_count - 1; |
c906108c SS |
732 | |
733 | /* This code assumes that the minimal symbols are sorted by | |
734 | ascending address values. If the pc value is greater than or | |
735 | equal to the first symbol's address, then some symbol in this | |
736 | minimal symbol table is a suitable candidate for being the | |
737 | "best" symbol. This includes the last real symbol, for cases | |
738 | where the pc value is larger than any address in this vector. | |
739 | ||
740 | By iterating until the address associated with the current | |
741 | hi index (the endpoint of the test interval) is less than | |
742 | or equal to the desired pc value, we accomplish two things: | |
743 | (1) the case where the pc value is larger than any minimal | |
744 | symbol address is trivially solved, (2) the address associated | |
30baf67b | 745 | with the hi index is always the one we want when the iteration |
c906108c SS |
746 | terminates. In essence, we are iterating the test interval |
747 | down until the pc value is pushed out of it from the high end. | |
748 | ||
025bb325 | 749 | Warning: this code is trickier than it would appear at first. */ |
c906108c | 750 | |
77e371c0 TT |
751 | if (frob_address (objfile, &pc) |
752 | && pc >= MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[lo])) | |
c906108c | 753 | { |
77e371c0 | 754 | while (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi]) > pc) |
c906108c | 755 | { |
025bb325 MS |
756 | /* pc is still strictly less than highest address. */ |
757 | /* Note "new" will always be >= lo. */ | |
fe978cb0 PA |
758 | newobj = (lo + hi) / 2; |
759 | if ((MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[newobj]) >= pc) | |
760 | || (lo == newobj)) | |
c906108c | 761 | { |
fe978cb0 | 762 | hi = newobj; |
c906108c SS |
763 | } |
764 | else | |
765 | { | |
fe978cb0 | 766 | lo = newobj; |
c906108c SS |
767 | } |
768 | } | |
769 | ||
770 | /* If we have multiple symbols at the same address, we want | |
c5aa993b JM |
771 | hi to point to the last one. That way we can find the |
772 | right symbol if it has an index greater than hi. */ | |
34643a32 | 773 | while (hi < objfile->per_bfd->minimal_symbol_count - 1 |
77e371c0 TT |
774 | && (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi]) |
775 | == MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi + 1]))) | |
c906108c SS |
776 | hi++; |
777 | ||
29e8a844 DJ |
778 | /* Skip various undesirable symbols. */ |
779 | while (hi >= 0) | |
780 | { | |
781 | /* Skip any absolute symbols. This is apparently | |
782 | what adb and dbx do, and is needed for the CM-5. | |
783 | There are two known possible problems: (1) on | |
784 | ELF, apparently end, edata, etc. are absolute. | |
785 | Not sure ignoring them here is a big deal, but if | |
786 | we want to use them, the fix would go in | |
787 | elfread.c. (2) I think shared library entry | |
788 | points on the NeXT are absolute. If we want | |
789 | special handling for this it probably should be | |
790 | triggered by a special mst_abs_or_lib or some | |
791 | such. */ | |
792 | ||
712f90be | 793 | if (MSYMBOL_TYPE (&msymbol[hi]) == mst_abs) |
29e8a844 DJ |
794 | { |
795 | hi--; | |
796 | continue; | |
797 | } | |
798 | ||
799 | /* If SECTION was specified, skip any symbol from | |
800 | wrong section. */ | |
801 | if (section | |
802 | /* Some types of debug info, such as COFF, | |
803 | don't fill the bfd_section member, so don't | |
804 | throw away symbols on those platforms. */ | |
efd66ac6 | 805 | && MSYMBOL_OBJ_SECTION (objfile, &msymbol[hi]) != NULL |
714835d5 | 806 | && (!matching_obj_sections |
efd66ac6 | 807 | (MSYMBOL_OBJ_SECTION (objfile, &msymbol[hi]), |
e27d198c | 808 | section))) |
29e8a844 DJ |
809 | { |
810 | hi--; | |
811 | continue; | |
812 | } | |
813 | ||
2eaf8d2a DJ |
814 | /* If we are looking for a trampoline and this is a |
815 | text symbol, or the other way around, check the | |
177b42fe | 816 | preceding symbol too. If they are otherwise |
2eaf8d2a DJ |
817 | identical prefer that one. */ |
818 | if (hi > 0 | |
20944a6e | 819 | && MSYMBOL_TYPE (&msymbol[hi]) != want_type |
2eaf8d2a DJ |
820 | && MSYMBOL_TYPE (&msymbol[hi - 1]) == want_type |
821 | && (MSYMBOL_SIZE (&msymbol[hi]) | |
822 | == MSYMBOL_SIZE (&msymbol[hi - 1])) | |
77e371c0 TT |
823 | && (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi]) |
824 | == MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi - 1])) | |
efd66ac6 TT |
825 | && (MSYMBOL_OBJ_SECTION (objfile, &msymbol[hi]) |
826 | == MSYMBOL_OBJ_SECTION (objfile, &msymbol[hi - 1]))) | |
2eaf8d2a DJ |
827 | { |
828 | hi--; | |
829 | continue; | |
830 | } | |
831 | ||
29e8a844 DJ |
832 | /* If the minimal symbol has a zero size, save it |
833 | but keep scanning backwards looking for one with | |
834 | a non-zero size. A zero size may mean that the | |
835 | symbol isn't an object or function (e.g. a | |
836 | label), or it may just mean that the size was not | |
837 | specified. */ | |
5506f9f6 | 838 | if (MSYMBOL_SIZE (&msymbol[hi]) == 0) |
29e8a844 | 839 | { |
5506f9f6 KB |
840 | if (best_zero_sized == -1) |
841 | best_zero_sized = hi; | |
29e8a844 DJ |
842 | hi--; |
843 | continue; | |
844 | } | |
845 | ||
f7a6bb70 DJ |
846 | /* If we are past the end of the current symbol, try |
847 | the previous symbol if it has a larger overlapping | |
848 | size. This happens on i686-pc-linux-gnu with glibc; | |
849 | the nocancel variants of system calls are inside | |
850 | the cancellable variants, but both have sizes. */ | |
851 | if (hi > 0 | |
852 | && MSYMBOL_SIZE (&msymbol[hi]) != 0 | |
77e371c0 | 853 | && pc >= (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi]) |
f7a6bb70 | 854 | + MSYMBOL_SIZE (&msymbol[hi])) |
77e371c0 | 855 | && pc < (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi - 1]) |
f7a6bb70 DJ |
856 | + MSYMBOL_SIZE (&msymbol[hi - 1]))) |
857 | { | |
858 | hi--; | |
859 | continue; | |
860 | } | |
861 | ||
29e8a844 DJ |
862 | /* Otherwise, this symbol must be as good as we're going |
863 | to get. */ | |
864 | break; | |
865 | } | |
866 | ||
867 | /* If HI has a zero size, and best_zero_sized is set, | |
868 | then we had two or more zero-sized symbols; prefer | |
869 | the first one we found (which may have a higher | |
870 | address). Also, if we ran off the end, be sure | |
871 | to back up. */ | |
872 | if (best_zero_sized != -1 | |
873 | && (hi < 0 || MSYMBOL_SIZE (&msymbol[hi]) == 0)) | |
874 | hi = best_zero_sized; | |
875 | ||
876 | /* If the minimal symbol has a non-zero size, and this | |
877 | PC appears to be outside the symbol's contents, then | |
878 | refuse to use this symbol. If we found a zero-sized | |
879 | symbol with an address greater than this symbol's, | |
880 | use that instead. We assume that if symbols have | |
881 | specified sizes, they do not overlap. */ | |
882 | ||
883 | if (hi >= 0 | |
884 | && MSYMBOL_SIZE (&msymbol[hi]) != 0 | |
77e371c0 | 885 | && pc >= (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi]) |
29e8a844 DJ |
886 | + MSYMBOL_SIZE (&msymbol[hi]))) |
887 | { | |
888 | if (best_zero_sized != -1) | |
889 | hi = best_zero_sized; | |
890 | else | |
891 | /* Go on to the next object file. */ | |
892 | continue; | |
893 | } | |
894 | ||
c906108c | 895 | /* The minimal symbol indexed by hi now is the best one in this |
c5aa993b | 896 | objfile's minimal symbol table. See if it is the best one |
025bb325 | 897 | overall. */ |
c906108c | 898 | |
c906108c SS |
899 | if (hi >= 0 |
900 | && ((best_symbol == NULL) || | |
77e371c0 TT |
901 | (MSYMBOL_VALUE_RAW_ADDRESS (best_symbol) < |
902 | MSYMBOL_VALUE_RAW_ADDRESS (&msymbol[hi])))) | |
c906108c SS |
903 | { |
904 | best_symbol = &msymbol[hi]; | |
7cbd4a93 | 905 | best_objfile = objfile; |
c906108c SS |
906 | } |
907 | } | |
908 | } | |
909 | } | |
7cbd4a93 TT |
910 | |
911 | result.minsym = best_symbol; | |
912 | result.objfile = best_objfile; | |
913 | return result; | |
c906108c SS |
914 | } |
915 | ||
b19686e0 | 916 | /* See minsyms.h. */ |
c906108c | 917 | |
7cbd4a93 | 918 | struct bound_minimal_symbol |
fba45db2 | 919 | lookup_minimal_symbol_by_pc (CORE_ADDR pc) |
c906108c | 920 | { |
20944a6e | 921 | return lookup_minimal_symbol_by_pc_section (pc, NULL); |
c906108c | 922 | } |
0d5392b8 | 923 | |
0875794a JK |
924 | /* Return non-zero iff PC is in an STT_GNU_IFUNC function resolver. */ |
925 | ||
ececd218 | 926 | bool |
0875794a JK |
927 | in_gnu_ifunc_stub (CORE_ADDR pc) |
928 | { | |
20944a6e PA |
929 | bound_minimal_symbol msymbol |
930 | = lookup_minimal_symbol_by_pc_section (pc, NULL, | |
931 | lookup_msym_prefer::GNU_IFUNC); | |
7cbd4a93 | 932 | return msymbol.minsym && MSYMBOL_TYPE (msymbol.minsym) == mst_text_gnu_ifunc; |
0875794a JK |
933 | } |
934 | ||
07be84bf JK |
935 | /* See elf_gnu_ifunc_resolve_addr for its real implementation. */ |
936 | ||
937 | static CORE_ADDR | |
938 | stub_gnu_ifunc_resolve_addr (struct gdbarch *gdbarch, CORE_ADDR pc) | |
939 | { | |
940 | error (_("GDB cannot resolve STT_GNU_IFUNC symbol at address %s without " | |
941 | "the ELF support compiled in."), | |
942 | paddress (gdbarch, pc)); | |
943 | } | |
944 | ||
945 | /* See elf_gnu_ifunc_resolve_name for its real implementation. */ | |
946 | ||
ececd218 | 947 | static bool |
07be84bf JK |
948 | stub_gnu_ifunc_resolve_name (const char *function_name, |
949 | CORE_ADDR *function_address_p) | |
950 | { | |
951 | error (_("GDB cannot resolve STT_GNU_IFUNC symbol \"%s\" without " | |
952 | "the ELF support compiled in."), | |
953 | function_name); | |
954 | } | |
955 | ||
0e30163f JK |
956 | /* See elf_gnu_ifunc_resolver_stop for its real implementation. */ |
957 | ||
958 | static void | |
959 | stub_gnu_ifunc_resolver_stop (struct breakpoint *b) | |
960 | { | |
961 | internal_error (__FILE__, __LINE__, | |
962 | _("elf_gnu_ifunc_resolver_stop cannot be reached.")); | |
963 | } | |
964 | ||
965 | /* See elf_gnu_ifunc_resolver_return_stop for its real implementation. */ | |
966 | ||
967 | static void | |
968 | stub_gnu_ifunc_resolver_return_stop (struct breakpoint *b) | |
969 | { | |
970 | internal_error (__FILE__, __LINE__, | |
971 | _("elf_gnu_ifunc_resolver_return_stop cannot be reached.")); | |
972 | } | |
973 | ||
07be84bf JK |
974 | /* See elf_gnu_ifunc_fns for its real implementation. */ |
975 | ||
976 | static const struct gnu_ifunc_fns stub_gnu_ifunc_fns = | |
977 | { | |
978 | stub_gnu_ifunc_resolve_addr, | |
979 | stub_gnu_ifunc_resolve_name, | |
0e30163f JK |
980 | stub_gnu_ifunc_resolver_stop, |
981 | stub_gnu_ifunc_resolver_return_stop, | |
07be84bf JK |
982 | }; |
983 | ||
984 | /* A placeholder for &elf_gnu_ifunc_fns. */ | |
985 | ||
986 | const struct gnu_ifunc_fns *gnu_ifunc_fns_p = &stub_gnu_ifunc_fns; | |
987 | ||
c906108c | 988 | \f |
c5aa993b | 989 | |
025bb325 | 990 | /* Return leading symbol character for a BFD. If BFD is NULL, |
c906108c SS |
991 | return the leading symbol character from the main objfile. */ |
992 | ||
c906108c | 993 | static int |
fba45db2 | 994 | get_symbol_leading_char (bfd *abfd) |
c906108c SS |
995 | { |
996 | if (abfd != NULL) | |
997 | return bfd_get_symbol_leading_char (abfd); | |
998 | if (symfile_objfile != NULL && symfile_objfile->obfd != NULL) | |
999 | return bfd_get_symbol_leading_char (symfile_objfile->obfd); | |
1000 | return 0; | |
1001 | } | |
1002 | ||
b19686e0 | 1003 | /* See minsyms.h. */ |
c906108c | 1004 | |
d25e8719 | 1005 | minimal_symbol_reader::minimal_symbol_reader (struct objfile *obj) |
8dddcb8f TT |
1006 | : m_objfile (obj), |
1007 | m_msym_bunch (NULL), | |
1008 | /* Note that presetting m_msym_bunch_index to BUNCH_SIZE causes the | |
b19686e0 TT |
1009 | first call to save a minimal symbol to allocate the memory for |
1010 | the first bunch. */ | |
8dddcb8f TT |
1011 | m_msym_bunch_index (BUNCH_SIZE), |
1012 | m_msym_count (0) | |
1013 | { | |
c906108c SS |
1014 | } |
1015 | ||
873a915e TT |
1016 | /* Discard the currently collected minimal symbols, if any. If we wish |
1017 | to save them for later use, we must have already copied them somewhere | |
79e7ae11 | 1018 | else before calling this function. */ |
873a915e TT |
1019 | |
1020 | minimal_symbol_reader::~minimal_symbol_reader () | |
1021 | { | |
1022 | struct msym_bunch *next; | |
1023 | ||
8dddcb8f | 1024 | while (m_msym_bunch != NULL) |
873a915e | 1025 | { |
8dddcb8f TT |
1026 | next = m_msym_bunch->next; |
1027 | xfree (m_msym_bunch); | |
1028 | m_msym_bunch = next; | |
873a915e TT |
1029 | } |
1030 | } | |
1031 | ||
b19686e0 TT |
1032 | /* See minsyms.h. */ |
1033 | ||
c906108c | 1034 | void |
8dddcb8f | 1035 | minimal_symbol_reader::record (const char *name, CORE_ADDR address, |
ce6c454e | 1036 | enum minimal_symbol_type ms_type) |
c906108c SS |
1037 | { |
1038 | int section; | |
1039 | ||
1040 | switch (ms_type) | |
1041 | { | |
1042 | case mst_text: | |
0875794a | 1043 | case mst_text_gnu_ifunc: |
c906108c SS |
1044 | case mst_file_text: |
1045 | case mst_solib_trampoline: | |
8dddcb8f | 1046 | section = SECT_OFF_TEXT (m_objfile); |
c906108c SS |
1047 | break; |
1048 | case mst_data: | |
f50776aa | 1049 | case mst_data_gnu_ifunc: |
c906108c | 1050 | case mst_file_data: |
8dddcb8f | 1051 | section = SECT_OFF_DATA (m_objfile); |
c906108c SS |
1052 | break; |
1053 | case mst_bss: | |
1054 | case mst_file_bss: | |
8dddcb8f | 1055 | section = SECT_OFF_BSS (m_objfile); |
c906108c SS |
1056 | break; |
1057 | default: | |
1058 | section = -1; | |
1059 | } | |
1060 | ||
8dddcb8f | 1061 | record_with_info (name, address, ms_type, section); |
c906108c SS |
1062 | } |
1063 | ||
e08b849e SM |
1064 | /* Convert an enumerator of type minimal_symbol_type to its string |
1065 | representation. */ | |
1066 | ||
1067 | static const char * | |
1068 | mst_str (minimal_symbol_type t) | |
1069 | { | |
1070 | #define MST_TO_STR(x) case x: return #x; | |
1071 | switch (t) | |
1072 | { | |
1073 | MST_TO_STR (mst_unknown); | |
1074 | MST_TO_STR (mst_text); | |
1075 | MST_TO_STR (mst_text_gnu_ifunc); | |
1076 | MST_TO_STR (mst_slot_got_plt); | |
1077 | MST_TO_STR (mst_data); | |
1078 | MST_TO_STR (mst_bss); | |
1079 | MST_TO_STR (mst_abs); | |
1080 | MST_TO_STR (mst_solib_trampoline); | |
1081 | MST_TO_STR (mst_file_text); | |
1082 | MST_TO_STR (mst_file_data); | |
1083 | MST_TO_STR (mst_file_bss); | |
1084 | ||
1085 | default: | |
1086 | return "mst_???"; | |
1087 | } | |
1088 | #undef MST_TO_STR | |
1089 | } | |
1090 | ||
b19686e0 | 1091 | /* See minsyms.h. */ |
c906108c SS |
1092 | |
1093 | struct minimal_symbol * | |
31edb802 | 1094 | minimal_symbol_reader::record_full (gdb::string_view name, |
ce6c454e TT |
1095 | bool copy_name, CORE_ADDR address, |
1096 | enum minimal_symbol_type ms_type, | |
1097 | int section) | |
c906108c | 1098 | { |
fe978cb0 | 1099 | struct msym_bunch *newobj; |
52f0bd74 | 1100 | struct minimal_symbol *msymbol; |
c906108c | 1101 | |
66337bb1 CV |
1102 | /* Don't put gcc_compiled, __gnu_compiled_cplus, and friends into |
1103 | the minimal symbols, because if there is also another symbol | |
1104 | at the same address (e.g. the first function of the file), | |
1105 | lookup_minimal_symbol_by_pc would have no way of getting the | |
1106 | right one. */ | |
1107 | if (ms_type == mst_file_text && name[0] == 'g' | |
31edb802 CB |
1108 | && (name == GCC_COMPILED_FLAG_SYMBOL |
1109 | || name == GCC2_COMPILED_FLAG_SYMBOL)) | |
66337bb1 CV |
1110 | return (NULL); |
1111 | ||
1112 | /* It's safe to strip the leading char here once, since the name | |
025bb325 | 1113 | is also stored stripped in the minimal symbol table. */ |
8dddcb8f | 1114 | if (name[0] == get_symbol_leading_char (m_objfile->obfd)) |
31edb802 | 1115 | name = name.substr (1); |
66337bb1 | 1116 | |
61012eef | 1117 | if (ms_type == mst_file_text && startswith (name, "__gnu_compiled")) |
66337bb1 | 1118 | return (NULL); |
c906108c | 1119 | |
e08b849e | 1120 | if (symtab_create_debug >= 2) |
31edb802 CB |
1121 | printf_unfiltered ("Recording minsym: %-21s %18s %4d %.*s\n", |
1122 | mst_str (ms_type), hex_string (address), section, | |
1123 | (int) name.size (), name.data ()); | |
e08b849e | 1124 | |
8dddcb8f | 1125 | if (m_msym_bunch_index == BUNCH_SIZE) |
c906108c | 1126 | { |
fe978cb0 | 1127 | newobj = XCNEW (struct msym_bunch); |
8dddcb8f TT |
1128 | m_msym_bunch_index = 0; |
1129 | newobj->next = m_msym_bunch; | |
1130 | m_msym_bunch = newobj; | |
c906108c | 1131 | } |
8dddcb8f | 1132 | msymbol = &m_msym_bunch->contents[m_msym_bunch_index]; |
eefba3da TT |
1133 | symbol_set_language (msymbol, language_auto, |
1134 | &m_objfile->per_bfd->storage_obstack); | |
5a79c107 TT |
1135 | |
1136 | if (copy_name) | |
1137 | msymbol->name = obstack_strndup (&m_objfile->per_bfd->storage_obstack, | |
1138 | name.data (), name.size ()); | |
1139 | else | |
1140 | msymbol->name = name.data (); | |
2de7ced7 | 1141 | |
40c1a007 | 1142 | SET_MSYMBOL_VALUE_ADDRESS (msymbol, address); |
efd66ac6 | 1143 | MSYMBOL_SECTION (msymbol) = section; |
714835d5 | 1144 | |
c906108c | 1145 | MSYMBOL_TYPE (msymbol) = ms_type; |
9227b5eb | 1146 | |
34643a32 TT |
1147 | /* If we already read minimal symbols for this objfile, then don't |
1148 | ever allocate a new one. */ | |
8dddcb8f | 1149 | if (!m_objfile->per_bfd->minsyms_read) |
5f6cac40 | 1150 | { |
8dddcb8f TT |
1151 | m_msym_bunch_index++; |
1152 | m_objfile->per_bfd->n_minsyms++; | |
5f6cac40 | 1153 | } |
8dddcb8f | 1154 | m_msym_count++; |
c906108c SS |
1155 | return msymbol; |
1156 | } | |
1157 | ||
6fb08628 CB |
1158 | /* Compare two minimal symbols by address and return true if FN1's address |
1159 | is less than FN2's, so that we sort into unsigned numeric order. | |
c906108c SS |
1160 | Within groups with the same address, sort by name. */ |
1161 | ||
6fb08628 CB |
1162 | static inline bool |
1163 | minimal_symbol_is_less_than (const minimal_symbol &fn1, | |
1164 | const minimal_symbol &fn2) | |
c906108c | 1165 | { |
6fb08628 | 1166 | if (MSYMBOL_VALUE_RAW_ADDRESS (&fn1) < MSYMBOL_VALUE_RAW_ADDRESS (&fn2)) |
c906108c | 1167 | { |
6fb08628 | 1168 | return true; /* addr 1 is less than addr 2. */ |
c906108c | 1169 | } |
6fb08628 | 1170 | else if (MSYMBOL_VALUE_RAW_ADDRESS (&fn1) > MSYMBOL_VALUE_RAW_ADDRESS (&fn2)) |
c906108c | 1171 | { |
6fb08628 | 1172 | return false; /* addr 1 is greater than addr 2. */ |
c906108c | 1173 | } |
c5aa993b JM |
1174 | else |
1175 | /* addrs are equal: sort by name */ | |
c906108c | 1176 | { |
c9d95fa3 CB |
1177 | const char *name1 = fn1.linkage_name (); |
1178 | const char *name2 = fn2.linkage_name (); | |
c906108c SS |
1179 | |
1180 | if (name1 && name2) /* both have names */ | |
6fb08628 | 1181 | return strcmp (name1, name2) < 0; |
c906108c | 1182 | else if (name2) |
6fb08628 | 1183 | return true; /* fn1 has no name, so it is "less". */ |
025bb325 | 1184 | else if (name1) /* fn2 has no name, so it is "less". */ |
6fb08628 | 1185 | return false; |
c906108c | 1186 | else |
6fb08628 | 1187 | return false; /* Neither has a name, so they're equal. */ |
c906108c SS |
1188 | } |
1189 | } | |
1190 | ||
c906108c SS |
1191 | /* Compact duplicate entries out of a minimal symbol table by walking |
1192 | through the table and compacting out entries with duplicate addresses | |
1193 | and matching names. Return the number of entries remaining. | |
1194 | ||
1195 | On entry, the table resides between msymbol[0] and msymbol[mcount]. | |
1196 | On exit, it resides between msymbol[0] and msymbol[result_count]. | |
1197 | ||
1198 | When files contain multiple sources of symbol information, it is | |
1199 | possible for the minimal symbol table to contain many duplicate entries. | |
1200 | As an example, SVR4 systems use ELF formatted object files, which | |
1201 | usually contain at least two different types of symbol tables (a | |
1202 | standard ELF one and a smaller dynamic linking table), as well as | |
1203 | DWARF debugging information for files compiled with -g. | |
1204 | ||
1205 | Without compacting, the minimal symbol table for gdb itself contains | |
1206 | over a 1000 duplicates, about a third of the total table size. Aside | |
1207 | from the potential trap of not noticing that two successive entries | |
1208 | identify the same location, this duplication impacts the time required | |
1209 | to linearly scan the table, which is done in a number of places. So we | |
1210 | just do one linear scan here and toss out the duplicates. | |
1211 | ||
c906108c SS |
1212 | Since the different sources of information for each symbol may |
1213 | have different levels of "completeness", we may have duplicates | |
1214 | that have one entry with type "mst_unknown" and the other with a | |
1215 | known type. So if the one we are leaving alone has type mst_unknown, | |
1216 | overwrite its type with the type from the one we are compacting out. */ | |
1217 | ||
1218 | static int | |
fba45db2 KB |
1219 | compact_minimal_symbols (struct minimal_symbol *msymbol, int mcount, |
1220 | struct objfile *objfile) | |
c906108c SS |
1221 | { |
1222 | struct minimal_symbol *copyfrom; | |
1223 | struct minimal_symbol *copyto; | |
1224 | ||
1225 | if (mcount > 0) | |
1226 | { | |
1227 | copyfrom = copyto = msymbol; | |
1228 | while (copyfrom < msymbol + mcount - 1) | |
1229 | { | |
77e371c0 TT |
1230 | if (MSYMBOL_VALUE_RAW_ADDRESS (copyfrom) |
1231 | == MSYMBOL_VALUE_RAW_ADDRESS ((copyfrom + 1)) | |
1232 | && MSYMBOL_SECTION (copyfrom) == MSYMBOL_SECTION (copyfrom + 1) | |
c9d95fa3 CB |
1233 | && strcmp (copyfrom->linkage_name (), |
1234 | (copyfrom + 1)->linkage_name ()) == 0) | |
c906108c | 1235 | { |
c5aa993b | 1236 | if (MSYMBOL_TYPE ((copyfrom + 1)) == mst_unknown) |
c906108c SS |
1237 | { |
1238 | MSYMBOL_TYPE ((copyfrom + 1)) = MSYMBOL_TYPE (copyfrom); | |
1239 | } | |
1240 | copyfrom++; | |
1241 | } | |
1242 | else | |
afbb8d7a | 1243 | *copyto++ = *copyfrom++; |
c906108c SS |
1244 | } |
1245 | *copyto++ = *copyfrom++; | |
1246 | mcount = copyto - msymbol; | |
1247 | } | |
1248 | return (mcount); | |
1249 | } | |
1250 | ||
808590ec CB |
1251 | static void |
1252 | clear_minimal_symbol_hash_tables (struct objfile *objfile) | |
1253 | { | |
1254 | for (size_t i = 0; i < MINIMAL_SYMBOL_HASH_SIZE; i++) | |
1255 | { | |
1256 | objfile->per_bfd->msymbol_hash[i] = 0; | |
1257 | objfile->per_bfd->msymbol_demangled_hash[i] = 0; | |
1258 | } | |
1259 | } | |
1260 | ||
afbb8d7a KB |
1261 | /* Build (or rebuild) the minimal symbol hash tables. This is necessary |
1262 | after compacting or sorting the table since the entries move around | |
025bb325 | 1263 | thus causing the internal minimal_symbol pointers to become jumbled. */ |
afbb8d7a KB |
1264 | |
1265 | static void | |
1266 | build_minimal_symbol_hash_tables (struct objfile *objfile) | |
1267 | { | |
1268 | int i; | |
1269 | struct minimal_symbol *msym; | |
1270 | ||
808590ec | 1271 | /* (Re)insert the actual entries. */ |
34643a32 | 1272 | for ((i = objfile->per_bfd->minimal_symbol_count, |
042d75e4 | 1273 | msym = objfile->per_bfd->msymbols.get ()); |
afbb8d7a KB |
1274 | i > 0; |
1275 | i--, msym++) | |
1276 | { | |
1277 | msym->hash_next = 0; | |
34643a32 | 1278 | add_minsym_to_hash_table (msym, objfile->per_bfd->msymbol_hash); |
afbb8d7a KB |
1279 | |
1280 | msym->demangled_hash_next = 0; | |
c9d95fa3 | 1281 | if (msym->search_name () != msym->linkage_name ()) |
b5ec771e | 1282 | add_minsym_to_demangled_hash_table (msym, objfile); |
afbb8d7a KB |
1283 | } |
1284 | } | |
1285 | ||
c906108c SS |
1286 | /* Add the minimal symbols in the existing bunches to the objfile's official |
1287 | minimal symbol table. In most cases there is no minimal symbol table yet | |
1288 | for this objfile, and the existing bunches are used to create one. Once | |
1289 | in a while (for shared libraries for example), we add symbols (e.g. common | |
79e7ae11 | 1290 | symbols) to an existing objfile. */ |
c906108c SS |
1291 | |
1292 | void | |
d25e8719 | 1293 | minimal_symbol_reader::install () |
c906108c | 1294 | { |
52f0bd74 AC |
1295 | int mcount; |
1296 | struct msym_bunch *bunch; | |
1297 | struct minimal_symbol *msymbols; | |
c906108c | 1298 | int alloc_count; |
c906108c | 1299 | |
d25e8719 | 1300 | if (m_objfile->per_bfd->minsyms_read) |
34643a32 TT |
1301 | return; |
1302 | ||
8dddcb8f | 1303 | if (m_msym_count > 0) |
c906108c | 1304 | { |
45cfd468 DE |
1305 | if (symtab_create_debug) |
1306 | { | |
1307 | fprintf_unfiltered (gdb_stdlog, | |
1308 | "Installing %d minimal symbols of objfile %s.\n", | |
8dddcb8f | 1309 | m_msym_count, objfile_name (m_objfile)); |
45cfd468 DE |
1310 | } |
1311 | ||
79e7ae11 TT |
1312 | /* Allocate enough space, into which we will gather the bunches |
1313 | of new and existing minimal symbols, sort them, and then | |
1314 | compact out the duplicate entries. Once we have a final | |
1315 | table, we will give back the excess space. */ | |
c906108c | 1316 | |
741d7538 | 1317 | alloc_count = m_msym_count + m_objfile->per_bfd->minimal_symbol_count; |
042d75e4 TT |
1318 | gdb::unique_xmalloc_ptr<minimal_symbol> |
1319 | msym_holder (XNEWVEC (minimal_symbol, alloc_count)); | |
1320 | msymbols = msym_holder.get (); | |
c906108c SS |
1321 | |
1322 | /* Copy in the existing minimal symbols, if there are any. */ | |
1323 | ||
d25e8719 | 1324 | if (m_objfile->per_bfd->minimal_symbol_count) |
042d75e4 TT |
1325 | memcpy (msymbols, m_objfile->per_bfd->msymbols.get (), |
1326 | m_objfile->per_bfd->minimal_symbol_count | |
1327 | * sizeof (struct minimal_symbol)); | |
c906108c SS |
1328 | |
1329 | /* Walk through the list of minimal symbol bunches, adding each symbol | |
c5aa993b JM |
1330 | to the new contiguous array of symbols. Note that we start with the |
1331 | current, possibly partially filled bunch (thus we use the current | |
1332 | msym_bunch_index for the first bunch we copy over), and thereafter | |
025bb325 | 1333 | each bunch is full. */ |
c5aa993b | 1334 | |
d25e8719 | 1335 | mcount = m_objfile->per_bfd->minimal_symbol_count; |
c5aa993b | 1336 | |
8dddcb8f | 1337 | for (bunch = m_msym_bunch; bunch != NULL; bunch = bunch->next) |
c906108c | 1338 | { |
0de2420c TT |
1339 | memcpy (&msymbols[mcount], &bunch->contents[0], |
1340 | m_msym_bunch_index * sizeof (struct minimal_symbol)); | |
1341 | mcount += m_msym_bunch_index; | |
8dddcb8f | 1342 | m_msym_bunch_index = BUNCH_SIZE; |
c906108c SS |
1343 | } |
1344 | ||
1345 | /* Sort the minimal symbols by address. */ | |
c5aa993b | 1346 | |
6fb08628 | 1347 | std::sort (msymbols, msymbols + mcount, minimal_symbol_is_less_than); |
c5aa993b | 1348 | |
c906108c | 1349 | /* Compact out any duplicates, and free up whatever space we are |
c5aa993b JM |
1350 | no longer using. */ |
1351 | ||
d25e8719 | 1352 | mcount = compact_minimal_symbols (msymbols, mcount, m_objfile); |
042d75e4 TT |
1353 | msym_holder.reset (XRESIZEVEC (struct minimal_symbol, |
1354 | msym_holder.release (), | |
1355 | mcount)); | |
c906108c | 1356 | |
c906108c | 1357 | /* Attach the minimal symbol table to the specified objfile. |
34643a32 | 1358 | The strings themselves are also located in the storage_obstack |
c5aa993b | 1359 | of this objfile. */ |
c906108c | 1360 | |
808590ec CB |
1361 | if (m_objfile->per_bfd->minimal_symbol_count != 0) |
1362 | clear_minimal_symbol_hash_tables (m_objfile); | |
1363 | ||
d25e8719 | 1364 | m_objfile->per_bfd->minimal_symbol_count = mcount; |
042d75e4 | 1365 | m_objfile->per_bfd->msymbols = std::move (msym_holder); |
c906108c | 1366 | |
d55c9a68 TT |
1367 | #if CXX_STD_THREAD |
1368 | /* Mutex that is used when modifying or accessing the demangled | |
1369 | hash table. */ | |
1370 | std::mutex demangled_mutex; | |
1371 | #endif | |
1372 | ||
5a79c107 | 1373 | msymbols = m_objfile->per_bfd->msymbols.get (); |
d55c9a68 TT |
1374 | gdb::parallel_for_each |
1375 | (&msymbols[0], &msymbols[mcount], | |
1376 | [&] (minimal_symbol *start, minimal_symbol *end) | |
1377 | { | |
1378 | for (minimal_symbol *msym = start; msym < end; ++msym) | |
1379 | { | |
1380 | if (!msym->name_set) | |
1381 | { | |
1382 | /* This will be freed later, by symbol_set_names. */ | |
1383 | char *demangled_name | |
1384 | = symbol_find_demangled_name (msym, msym->name); | |
1385 | symbol_set_demangled_name | |
1386 | (msym, demangled_name, | |
1387 | &m_objfile->per_bfd->storage_obstack); | |
1388 | msym->name_set = 1; | |
1389 | } | |
1390 | } | |
1391 | { | |
1392 | /* To limit how long we hold the lock, we only acquire it here | |
1393 | and not while we demangle the names above. */ | |
1394 | #if CXX_STD_THREAD | |
1395 | std::lock_guard<std::mutex> guard (demangled_mutex); | |
1396 | #endif | |
1397 | for (minimal_symbol *msym = start; msym < end; ++msym) | |
1398 | { | |
1399 | symbol_set_names (msym, msym->name, false, | |
1400 | m_objfile->per_bfd); | |
1401 | } | |
1402 | } | |
1403 | }); | |
5a79c107 | 1404 | |
d25e8719 | 1405 | build_minimal_symbol_hash_tables (m_objfile); |
c906108c SS |
1406 | } |
1407 | } | |
1408 | ||
c9630d9c TT |
1409 | /* Check if PC is in a shared library trampoline code stub. |
1410 | Return minimal symbol for the trampoline entry or NULL if PC is not | |
1411 | in a trampoline code stub. */ | |
c906108c | 1412 | |
c9630d9c | 1413 | static struct minimal_symbol * |
fba45db2 | 1414 | lookup_solib_trampoline_symbol_by_pc (CORE_ADDR pc) |
c906108c | 1415 | { |
20944a6e PA |
1416 | bound_minimal_symbol msymbol |
1417 | = lookup_minimal_symbol_by_pc_section (pc, NULL, | |
1418 | lookup_msym_prefer::TRAMPOLINE); | |
c906108c | 1419 | |
7cbd4a93 TT |
1420 | if (msymbol.minsym != NULL |
1421 | && MSYMBOL_TYPE (msymbol.minsym) == mst_solib_trampoline) | |
1422 | return msymbol.minsym; | |
c906108c SS |
1423 | return NULL; |
1424 | } | |
1425 | ||
1426 | /* If PC is in a shared library trampoline code stub, return the | |
1427 | address of the `real' function belonging to the stub. | |
1428 | Return 0 if PC is not in a trampoline code stub or if the real | |
1429 | function is not found in the minimal symbol table. | |
1430 | ||
1431 | We may fail to find the right function if a function with the | |
1432 | same name is defined in more than one shared library, but this | |
025bb325 | 1433 | is considered bad programming style. We could return 0 if we find |
c906108c SS |
1434 | a duplicate function in case this matters someday. */ |
1435 | ||
1436 | CORE_ADDR | |
52f729a7 | 1437 | find_solib_trampoline_target (struct frame_info *frame, CORE_ADDR pc) |
c906108c | 1438 | { |
c906108c SS |
1439 | struct minimal_symbol *tsymbol = lookup_solib_trampoline_symbol_by_pc (pc); |
1440 | ||
1441 | if (tsymbol != NULL) | |
1442 | { | |
2030c079 | 1443 | for (objfile *objfile : current_program_space->objfiles ()) |
5325b9bf | 1444 | { |
7932255d | 1445 | for (minimal_symbol *msymbol : objfile->msymbols ()) |
5325b9bf TT |
1446 | { |
1447 | /* Also handle minimal symbols pointing to function | |
1448 | descriptors. */ | |
1449 | if ((MSYMBOL_TYPE (msymbol) == mst_text | |
1450 | || MSYMBOL_TYPE (msymbol) == mst_text_gnu_ifunc | |
1451 | || MSYMBOL_TYPE (msymbol) == mst_data | |
1452 | || MSYMBOL_TYPE (msymbol) == mst_data_gnu_ifunc) | |
c9d95fa3 CB |
1453 | && strcmp (msymbol->linkage_name (), |
1454 | tsymbol->linkage_name ()) == 0) | |
5325b9bf TT |
1455 | { |
1456 | CORE_ADDR func; | |
b8d56208 | 1457 | |
5325b9bf TT |
1458 | /* Ignore data symbols that are not function |
1459 | descriptors. */ | |
1460 | if (msymbol_is_function (objfile, msymbol, &func)) | |
1461 | return func; | |
1462 | } | |
1463 | } | |
1464 | } | |
c906108c SS |
1465 | } |
1466 | return 0; | |
1467 | } | |
50e65b17 TT |
1468 | |
1469 | /* See minsyms.h. */ | |
1470 | ||
1471 | CORE_ADDR | |
1472 | minimal_symbol_upper_bound (struct bound_minimal_symbol minsym) | |
1473 | { | |
50e65b17 TT |
1474 | short section; |
1475 | struct obj_section *obj_section; | |
1476 | CORE_ADDR result; | |
20dc7e9b | 1477 | struct minimal_symbol *iter, *msymbol; |
50e65b17 TT |
1478 | |
1479 | gdb_assert (minsym.minsym != NULL); | |
1480 | ||
1481 | /* If the minimal symbol has a size, use it. Otherwise use the | |
1482 | lesser of the next minimal symbol in the same section, or the end | |
1483 | of the section, as the end of the function. */ | |
1484 | ||
1485 | if (MSYMBOL_SIZE (minsym.minsym) != 0) | |
77e371c0 | 1486 | return BMSYMBOL_VALUE_ADDRESS (minsym) + MSYMBOL_SIZE (minsym.minsym); |
50e65b17 TT |
1487 | |
1488 | /* Step over other symbols at this same address, and symbols in | |
1489 | other sections, to find the next symbol in this section with a | |
1490 | different address. */ | |
1491 | ||
20dc7e9b PW |
1492 | struct minimal_symbol *past_the_end |
1493 | = (minsym.objfile->per_bfd->msymbols.get () | |
1494 | + minsym.objfile->per_bfd->minimal_symbol_count); | |
50e65b17 | 1495 | msymbol = minsym.minsym; |
efd66ac6 | 1496 | section = MSYMBOL_SECTION (msymbol); |
20dc7e9b | 1497 | for (iter = msymbol + 1; iter != past_the_end; ++iter) |
50e65b17 | 1498 | { |
20dc7e9b | 1499 | if ((MSYMBOL_VALUE_RAW_ADDRESS (iter) |
77e371c0 | 1500 | != MSYMBOL_VALUE_RAW_ADDRESS (msymbol)) |
20dc7e9b | 1501 | && MSYMBOL_SECTION (iter) == section) |
50e65b17 TT |
1502 | break; |
1503 | } | |
1504 | ||
efd66ac6 | 1505 | obj_section = MSYMBOL_OBJ_SECTION (minsym.objfile, minsym.minsym); |
20dc7e9b PW |
1506 | if (iter != past_the_end |
1507 | && (MSYMBOL_VALUE_ADDRESS (minsym.objfile, iter) | |
efd66ac6 | 1508 | < obj_section_endaddr (obj_section))) |
20dc7e9b | 1509 | result = MSYMBOL_VALUE_ADDRESS (minsym.objfile, iter); |
50e65b17 TT |
1510 | else |
1511 | /* We got the start address from the last msymbol in the objfile. | |
1512 | So the end address is the end of the section. */ | |
1513 | result = obj_section_endaddr (obj_section); | |
1514 | ||
1515 | return result; | |
1516 | } |