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