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