Commit | Line | Data |
---|---|---|
c906108c | 1 | /* GDB routines for manipulating the minimal symbol tables. |
197e01b6 | 2 | Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, |
9b254dd1 | 3 | 2002, 2003, 2004, 2007, 2008 Free Software Foundation, Inc. |
c906108c SS |
4 | Contributed by Cygnus Support, using pieces from other GDB modules. |
5 | ||
c5aa993b | 6 | This file is part of GDB. |
c906108c | 7 | |
c5aa993b JM |
8 | This program is free software; you can redistribute it and/or modify |
9 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 10 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 11 | (at your option) any later version. |
c906108c | 12 | |
c5aa993b JM |
13 | This program is distributed in the hope that it will be useful, |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
c906108c | 17 | |
c5aa993b | 18 | You should have received a copy of the GNU General Public License |
a9762ec7 | 19 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
20 | |
21 | ||
22 | /* This file contains support routines for creating, manipulating, and | |
23 | destroying minimal symbol tables. | |
24 | ||
25 | Minimal symbol tables are used to hold some very basic information about | |
26 | all defined global symbols (text, data, bss, abs, etc). The only two | |
27 | required pieces of information are the symbol's name and the address | |
28 | associated with that symbol. | |
29 | ||
30 | In many cases, even if a file was compiled with no special options for | |
31 | debugging at all, as long as was not stripped it will contain sufficient | |
32 | information to build useful minimal symbol tables using this structure. | |
c5aa993b | 33 | |
c906108c SS |
34 | Even when a file contains enough debugging information to build a full |
35 | symbol table, these minimal symbols are still useful for quickly mapping | |
36 | between names and addresses, and vice versa. They are also sometimes used | |
37 | to figure out what full symbol table entries need to be read in. */ | |
38 | ||
39 | ||
40 | #include "defs.h" | |
9227b5eb | 41 | #include <ctype.h> |
c906108c SS |
42 | #include "gdb_string.h" |
43 | #include "symtab.h" | |
44 | #include "bfd.h" | |
45 | #include "symfile.h" | |
46 | #include "objfiles.h" | |
47 | #include "demangle.h" | |
7ed49443 JB |
48 | #include "value.h" |
49 | #include "cp-abi.h" | |
c906108c SS |
50 | |
51 | /* Accumulate the minimal symbols for each objfile in bunches of BUNCH_SIZE. | |
52 | At the end, copy them all into one newly allocated location on an objfile's | |
53 | symbol obstack. */ | |
54 | ||
55 | #define BUNCH_SIZE 127 | |
56 | ||
57 | struct msym_bunch | |
c5aa993b JM |
58 | { |
59 | struct msym_bunch *next; | |
60 | struct minimal_symbol contents[BUNCH_SIZE]; | |
61 | }; | |
c906108c SS |
62 | |
63 | /* Bunch currently being filled up. | |
64 | The next field points to chain of filled bunches. */ | |
65 | ||
66 | static struct msym_bunch *msym_bunch; | |
67 | ||
68 | /* Number of slots filled in current bunch. */ | |
69 | ||
70 | static int msym_bunch_index; | |
71 | ||
72 | /* Total number of minimal symbols recorded so far for the objfile. */ | |
73 | ||
74 | static int msym_count; | |
75 | ||
9227b5eb JB |
76 | /* Compute a hash code based using the same criteria as `strcmp_iw'. */ |
77 | ||
78 | unsigned int | |
79 | msymbol_hash_iw (const char *string) | |
80 | { | |
81 | unsigned int hash = 0; | |
82 | while (*string && *string != '(') | |
83 | { | |
84 | while (isspace (*string)) | |
85 | ++string; | |
86 | if (*string && *string != '(') | |
375f3d86 DJ |
87 | { |
88 | hash = hash * 67 + *string - 113; | |
89 | ++string; | |
90 | } | |
9227b5eb | 91 | } |
261397f8 | 92 | return hash; |
9227b5eb JB |
93 | } |
94 | ||
95 | /* Compute a hash code for a string. */ | |
96 | ||
97 | unsigned int | |
98 | msymbol_hash (const char *string) | |
99 | { | |
100 | unsigned int hash = 0; | |
101 | for (; *string; ++string) | |
375f3d86 | 102 | hash = hash * 67 + *string - 113; |
261397f8 | 103 | return hash; |
9227b5eb JB |
104 | } |
105 | ||
106 | /* Add the minimal symbol SYM to an objfile's minsym hash table, TABLE. */ | |
107 | void | |
108 | add_minsym_to_hash_table (struct minimal_symbol *sym, | |
109 | struct minimal_symbol **table) | |
110 | { | |
111 | if (sym->hash_next == NULL) | |
112 | { | |
f56f77c1 DC |
113 | unsigned int hash |
114 | = msymbol_hash (SYMBOL_LINKAGE_NAME (sym)) % MINIMAL_SYMBOL_HASH_SIZE; | |
9227b5eb JB |
115 | sym->hash_next = table[hash]; |
116 | table[hash] = sym; | |
117 | } | |
118 | } | |
119 | ||
0729fd50 DB |
120 | /* Add the minimal symbol SYM to an objfile's minsym demangled hash table, |
121 | TABLE. */ | |
122 | static void | |
123 | add_minsym_to_demangled_hash_table (struct minimal_symbol *sym, | |
124 | struct minimal_symbol **table) | |
125 | { | |
126 | if (sym->demangled_hash_next == NULL) | |
127 | { | |
261397f8 | 128 | unsigned int hash = msymbol_hash_iw (SYMBOL_DEMANGLED_NAME (sym)) % MINIMAL_SYMBOL_HASH_SIZE; |
0729fd50 DB |
129 | sym->demangled_hash_next = table[hash]; |
130 | table[hash] = sym; | |
131 | } | |
132 | } | |
133 | ||
c906108c SS |
134 | |
135 | /* Look through all the current minimal symbol tables and find the | |
136 | first minimal symbol that matches NAME. If OBJF is non-NULL, limit | |
72a5efb3 DJ |
137 | the search to that objfile. If SFILE is non-NULL, the only file-scope |
138 | symbols considered will be from that source file (global symbols are | |
139 | still preferred). Returns a pointer to the minimal symbol that | |
c906108c SS |
140 | matches, or NULL if no match is found. |
141 | ||
142 | Note: One instance where there may be duplicate minimal symbols with | |
143 | the same name is when the symbol tables for a shared library and the | |
144 | symbol tables for an executable contain global symbols with the same | |
d73f140a JB |
145 | names (the dynamic linker deals with the duplication). |
146 | ||
147 | It's also possible to have minimal symbols with different mangled | |
148 | names, but identical demangled names. For example, the GNU C++ v3 | |
149 | ABI requires the generation of two (or perhaps three) copies of | |
150 | constructor functions --- "in-charge", "not-in-charge", and | |
151 | "allocate" copies; destructors may be duplicated as well. | |
152 | Obviously, there must be distinct mangled names for each of these, | |
153 | but the demangled names are all the same: S::S or S::~S. */ | |
c906108c SS |
154 | |
155 | struct minimal_symbol * | |
aa1ee363 | 156 | lookup_minimal_symbol (const char *name, const char *sfile, |
fba45db2 | 157 | struct objfile *objf) |
c906108c SS |
158 | { |
159 | struct objfile *objfile; | |
160 | struct minimal_symbol *msymbol; | |
161 | struct minimal_symbol *found_symbol = NULL; | |
162 | struct minimal_symbol *found_file_symbol = NULL; | |
163 | struct minimal_symbol *trampoline_symbol = NULL; | |
164 | ||
261397f8 DJ |
165 | unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; |
166 | unsigned int dem_hash = msymbol_hash_iw (name) % MINIMAL_SYMBOL_HASH_SIZE; | |
9227b5eb | 167 | |
c906108c SS |
168 | if (sfile != NULL) |
169 | { | |
170 | char *p = strrchr (sfile, '/'); | |
171 | if (p != NULL) | |
172 | sfile = p + 1; | |
173 | } | |
c906108c SS |
174 | |
175 | for (objfile = object_files; | |
176 | objfile != NULL && found_symbol == NULL; | |
c5aa993b | 177 | objfile = objfile->next) |
c906108c | 178 | { |
56e3f43c DJ |
179 | if (objf == NULL || objf == objfile |
180 | || objf->separate_debug_objfile == objfile) | |
c906108c | 181 | { |
9227b5eb JB |
182 | /* Do two passes: the first over the ordinary hash table, |
183 | and the second over the demangled hash table. */ | |
0729fd50 | 184 | int pass; |
9227b5eb | 185 | |
0729fd50 | 186 | for (pass = 1; pass <= 2 && found_symbol == NULL; pass++) |
c906108c | 187 | { |
0729fd50 DB |
188 | /* Select hash list according to pass. */ |
189 | if (pass == 1) | |
190 | msymbol = objfile->msymbol_hash[hash]; | |
191 | else | |
192 | msymbol = objfile->msymbol_demangled_hash[dem_hash]; | |
193 | ||
194 | while (msymbol != NULL && found_symbol == NULL) | |
c906108c | 195 | { |
e06963ff AC |
196 | /* FIXME: carlton/2003-02-27: This is an unholy |
197 | mixture of linkage names and natural names. If | |
198 | you want to test the linkage names with strcmp, | |
199 | do that. If you want to test the natural names | |
200 | with strcmp_iw, use SYMBOL_MATCHES_NATURAL_NAME. */ | |
201 | if (strcmp (DEPRECATED_SYMBOL_NAME (msymbol), (name)) == 0 | |
202 | || (SYMBOL_DEMANGLED_NAME (msymbol) != NULL | |
203 | && strcmp_iw (SYMBOL_DEMANGLED_NAME (msymbol), | |
204 | (name)) == 0)) | |
c906108c | 205 | { |
0729fd50 DB |
206 | switch (MSYMBOL_TYPE (msymbol)) |
207 | { | |
208 | case mst_file_text: | |
209 | case mst_file_data: | |
210 | case mst_file_bss: | |
6314a349 AC |
211 | if (sfile == NULL |
212 | || strcmp (msymbol->filename, sfile) == 0) | |
0729fd50 | 213 | found_file_symbol = msymbol; |
0729fd50 DB |
214 | break; |
215 | ||
216 | case mst_solib_trampoline: | |
217 | ||
218 | /* If a trampoline symbol is found, we prefer to | |
219 | keep looking for the *real* symbol. If the | |
220 | actual symbol is not found, then we'll use the | |
221 | trampoline entry. */ | |
222 | if (trampoline_symbol == NULL) | |
223 | trampoline_symbol = msymbol; | |
224 | break; | |
225 | ||
226 | case mst_unknown: | |
227 | default: | |
228 | found_symbol = msymbol; | |
229 | break; | |
230 | } | |
c906108c | 231 | } |
9227b5eb | 232 | |
0729fd50 DB |
233 | /* Find the next symbol on the hash chain. */ |
234 | if (pass == 1) | |
235 | msymbol = msymbol->hash_next; | |
236 | else | |
237 | msymbol = msymbol->demangled_hash_next; | |
9227b5eb | 238 | } |
c906108c SS |
239 | } |
240 | } | |
241 | } | |
242 | /* External symbols are best. */ | |
243 | if (found_symbol) | |
244 | return found_symbol; | |
245 | ||
246 | /* File-local symbols are next best. */ | |
247 | if (found_file_symbol) | |
248 | return found_file_symbol; | |
249 | ||
250 | /* Symbols for shared library trampolines are next best. */ | |
251 | if (trampoline_symbol) | |
252 | return trampoline_symbol; | |
253 | ||
254 | return NULL; | |
255 | } | |
256 | ||
257 | /* Look through all the current minimal symbol tables and find the | |
72a5efb3 | 258 | first minimal symbol that matches NAME and has text type. If OBJF |
5520a790 EZ |
259 | is non-NULL, limit the search to that objfile. Returns a pointer |
260 | to the minimal symbol that matches, or NULL if no match is found. | |
72a5efb3 DJ |
261 | |
262 | This function only searches the mangled (linkage) names. */ | |
c5aa993b | 263 | |
c906108c | 264 | struct minimal_symbol * |
5520a790 | 265 | lookup_minimal_symbol_text (const char *name, struct objfile *objf) |
c906108c SS |
266 | { |
267 | struct objfile *objfile; | |
268 | struct minimal_symbol *msymbol; | |
269 | struct minimal_symbol *found_symbol = NULL; | |
270 | struct minimal_symbol *found_file_symbol = NULL; | |
271 | ||
72a5efb3 DJ |
272 | unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; |
273 | ||
c906108c SS |
274 | for (objfile = object_files; |
275 | objfile != NULL && found_symbol == NULL; | |
c5aa993b | 276 | objfile = objfile->next) |
c906108c | 277 | { |
56e3f43c DJ |
278 | if (objf == NULL || objf == objfile |
279 | || objf->separate_debug_objfile == objfile) | |
c906108c | 280 | { |
72a5efb3 DJ |
281 | for (msymbol = objfile->msymbol_hash[hash]; |
282 | msymbol != NULL && found_symbol == NULL; | |
283 | msymbol = msymbol->hash_next) | |
c906108c | 284 | { |
f56f77c1 | 285 | if (strcmp (SYMBOL_LINKAGE_NAME (msymbol), name) == 0 && |
c906108c SS |
286 | (MSYMBOL_TYPE (msymbol) == mst_text || |
287 | MSYMBOL_TYPE (msymbol) == mst_file_text)) | |
288 | { | |
289 | switch (MSYMBOL_TYPE (msymbol)) | |
290 | { | |
291 | case mst_file_text: | |
c906108c | 292 | found_file_symbol = msymbol; |
c906108c SS |
293 | break; |
294 | default: | |
295 | found_symbol = msymbol; | |
296 | break; | |
297 | } | |
298 | } | |
299 | } | |
300 | } | |
301 | } | |
302 | /* External symbols are best. */ | |
303 | if (found_symbol) | |
304 | return found_symbol; | |
305 | ||
306 | /* File-local symbols are next best. */ | |
307 | if (found_file_symbol) | |
308 | return found_file_symbol; | |
309 | ||
310 | return NULL; | |
311 | } | |
312 | ||
313 | /* Look through all the current minimal symbol tables and find the | |
5520a790 EZ |
314 | first minimal symbol that matches NAME and is a solib trampoline. |
315 | If OBJF is non-NULL, limit the search to that objfile. Returns a | |
316 | pointer to the minimal symbol that matches, or NULL if no match is | |
317 | found. | |
72a5efb3 DJ |
318 | |
319 | This function only searches the mangled (linkage) names. */ | |
c5aa993b | 320 | |
c906108c | 321 | struct minimal_symbol * |
aa1ee363 | 322 | lookup_minimal_symbol_solib_trampoline (const char *name, |
aa1ee363 | 323 | struct objfile *objf) |
c906108c SS |
324 | { |
325 | struct objfile *objfile; | |
326 | struct minimal_symbol *msymbol; | |
327 | struct minimal_symbol *found_symbol = NULL; | |
328 | ||
72a5efb3 DJ |
329 | unsigned int hash = msymbol_hash (name) % MINIMAL_SYMBOL_HASH_SIZE; |
330 | ||
c906108c SS |
331 | for (objfile = object_files; |
332 | objfile != NULL && found_symbol == NULL; | |
c5aa993b | 333 | objfile = objfile->next) |
c906108c | 334 | { |
56e3f43c DJ |
335 | if (objf == NULL || objf == objfile |
336 | || objf->separate_debug_objfile == objfile) | |
c906108c | 337 | { |
72a5efb3 DJ |
338 | for (msymbol = objfile->msymbol_hash[hash]; |
339 | msymbol != NULL && found_symbol == NULL; | |
340 | msymbol = msymbol->hash_next) | |
c906108c | 341 | { |
f56f77c1 | 342 | if (strcmp (SYMBOL_LINKAGE_NAME (msymbol), name) == 0 && |
c906108c SS |
343 | MSYMBOL_TYPE (msymbol) == mst_solib_trampoline) |
344 | return msymbol; | |
345 | } | |
346 | } | |
347 | } | |
348 | ||
349 | return NULL; | |
350 | } | |
351 | ||
c906108c SS |
352 | /* Search through the minimal symbol table for each objfile and find |
353 | the symbol whose address is the largest address that is still less | |
43b54b88 | 354 | than or equal to PC, and matches SECTION (if non-NULL). Returns a |
c906108c SS |
355 | pointer to the minimal symbol if such a symbol is found, or NULL if |
356 | PC is not in a suitable range. Note that we need to look through | |
357 | ALL the minimal symbol tables before deciding on the symbol that | |
358 | comes closest to the specified PC. This is because objfiles can | |
359 | overlap, for example objfile A has .text at 0x100 and .data at | |
360 | 0x40000 and objfile B has .text at 0x234 and .data at 0x40048. */ | |
361 | ||
362 | struct minimal_symbol * | |
fba45db2 | 363 | lookup_minimal_symbol_by_pc_section (CORE_ADDR pc, asection *section) |
c906108c SS |
364 | { |
365 | int lo; | |
366 | int hi; | |
367 | int new; | |
368 | struct objfile *objfile; | |
369 | struct minimal_symbol *msymbol; | |
370 | struct minimal_symbol *best_symbol = NULL; | |
64ae9269 | 371 | struct obj_section *pc_section; |
c906108c | 372 | |
43b54b88 AC |
373 | /* PC has to be in a known section. This ensures that anything |
374 | beyond the end of the last segment doesn't appear to be part of | |
375 | the last function in the last segment. */ | |
64ae9269 DJ |
376 | pc_section = find_pc_section (pc); |
377 | if (pc_section == NULL) | |
c906108c SS |
378 | return NULL; |
379 | ||
96225718 DJ |
380 | /* We can not require the symbol found to be in pc_section, because |
381 | e.g. IRIX 6.5 mdebug relies on this code returning an absolute | |
382 | symbol - but find_pc_section won't return an absolute section and | |
383 | hence the code below would skip over absolute symbols. We can | |
384 | still take advantage of the call to find_pc_section, though - the | |
385 | object file still must match. In case we have separate debug | |
386 | files, search both the file and its separate debug file. There's | |
387 | no telling which one will have the minimal symbols. */ | |
388 | ||
389 | objfile = pc_section->objfile; | |
390 | if (objfile->separate_debug_objfile) | |
391 | objfile = objfile->separate_debug_objfile; | |
392 | ||
393 | for (; objfile != NULL; objfile = objfile->separate_debug_objfile_backlink) | |
c906108c SS |
394 | { |
395 | /* If this objfile has a minimal symbol table, go search it using | |
c5aa993b JM |
396 | a binary search. Note that a minimal symbol table always consists |
397 | of at least two symbols, a "real" symbol and the terminating | |
398 | "null symbol". If there are no real symbols, then there is no | |
399 | minimal symbol table at all. */ | |
c906108c | 400 | |
15831452 | 401 | if (objfile->minimal_symbol_count > 0) |
c906108c | 402 | { |
29e8a844 DJ |
403 | int best_zero_sized = -1; |
404 | ||
15831452 | 405 | msymbol = objfile->msymbols; |
c906108c | 406 | lo = 0; |
c5aa993b | 407 | hi = objfile->minimal_symbol_count - 1; |
c906108c SS |
408 | |
409 | /* This code assumes that the minimal symbols are sorted by | |
410 | ascending address values. If the pc value is greater than or | |
411 | equal to the first symbol's address, then some symbol in this | |
412 | minimal symbol table is a suitable candidate for being the | |
413 | "best" symbol. This includes the last real symbol, for cases | |
414 | where the pc value is larger than any address in this vector. | |
415 | ||
416 | By iterating until the address associated with the current | |
417 | hi index (the endpoint of the test interval) is less than | |
418 | or equal to the desired pc value, we accomplish two things: | |
419 | (1) the case where the pc value is larger than any minimal | |
420 | symbol address is trivially solved, (2) the address associated | |
421 | with the hi index is always the one we want when the interation | |
422 | terminates. In essence, we are iterating the test interval | |
423 | down until the pc value is pushed out of it from the high end. | |
424 | ||
425 | Warning: this code is trickier than it would appear at first. */ | |
426 | ||
427 | /* Should also require that pc is <= end of objfile. FIXME! */ | |
428 | if (pc >= SYMBOL_VALUE_ADDRESS (&msymbol[lo])) | |
429 | { | |
430 | while (SYMBOL_VALUE_ADDRESS (&msymbol[hi]) > pc) | |
431 | { | |
432 | /* pc is still strictly less than highest address */ | |
433 | /* Note "new" will always be >= lo */ | |
434 | new = (lo + hi) / 2; | |
435 | if ((SYMBOL_VALUE_ADDRESS (&msymbol[new]) >= pc) || | |
436 | (lo == new)) | |
437 | { | |
438 | hi = new; | |
439 | } | |
440 | else | |
441 | { | |
442 | lo = new; | |
443 | } | |
444 | } | |
445 | ||
446 | /* If we have multiple symbols at the same address, we want | |
c5aa993b JM |
447 | hi to point to the last one. That way we can find the |
448 | right symbol if it has an index greater than hi. */ | |
449 | while (hi < objfile->minimal_symbol_count - 1 | |
c906108c | 450 | && (SYMBOL_VALUE_ADDRESS (&msymbol[hi]) |
c5aa993b | 451 | == SYMBOL_VALUE_ADDRESS (&msymbol[hi + 1]))) |
c906108c SS |
452 | hi++; |
453 | ||
29e8a844 DJ |
454 | /* Skip various undesirable symbols. */ |
455 | while (hi >= 0) | |
456 | { | |
457 | /* Skip any absolute symbols. This is apparently | |
458 | what adb and dbx do, and is needed for the CM-5. | |
459 | There are two known possible problems: (1) on | |
460 | ELF, apparently end, edata, etc. are absolute. | |
461 | Not sure ignoring them here is a big deal, but if | |
462 | we want to use them, the fix would go in | |
463 | elfread.c. (2) I think shared library entry | |
464 | points on the NeXT are absolute. If we want | |
465 | special handling for this it probably should be | |
466 | triggered by a special mst_abs_or_lib or some | |
467 | such. */ | |
468 | ||
469 | if (msymbol[hi].type == mst_abs) | |
470 | { | |
471 | hi--; | |
472 | continue; | |
473 | } | |
474 | ||
475 | /* If SECTION was specified, skip any symbol from | |
476 | wrong section. */ | |
477 | if (section | |
478 | /* Some types of debug info, such as COFF, | |
479 | don't fill the bfd_section member, so don't | |
480 | throw away symbols on those platforms. */ | |
481 | && SYMBOL_BFD_SECTION (&msymbol[hi]) != NULL | |
94277a38 DJ |
482 | && (!matching_bfd_sections |
483 | (SYMBOL_BFD_SECTION (&msymbol[hi]), section))) | |
29e8a844 DJ |
484 | { |
485 | hi--; | |
486 | continue; | |
487 | } | |
488 | ||
489 | /* If the minimal symbol has a zero size, save it | |
490 | but keep scanning backwards looking for one with | |
491 | a non-zero size. A zero size may mean that the | |
492 | symbol isn't an object or function (e.g. a | |
493 | label), or it may just mean that the size was not | |
494 | specified. */ | |
495 | if (MSYMBOL_SIZE (&msymbol[hi]) == 0 | |
496 | && best_zero_sized == -1) | |
497 | { | |
498 | best_zero_sized = hi; | |
499 | hi--; | |
500 | continue; | |
501 | } | |
502 | ||
f7a6bb70 DJ |
503 | /* If we are past the end of the current symbol, try |
504 | the previous symbol if it has a larger overlapping | |
505 | size. This happens on i686-pc-linux-gnu with glibc; | |
506 | the nocancel variants of system calls are inside | |
507 | the cancellable variants, but both have sizes. */ | |
508 | if (hi > 0 | |
509 | && MSYMBOL_SIZE (&msymbol[hi]) != 0 | |
510 | && pc >= (SYMBOL_VALUE_ADDRESS (&msymbol[hi]) | |
511 | + MSYMBOL_SIZE (&msymbol[hi])) | |
512 | && pc < (SYMBOL_VALUE_ADDRESS (&msymbol[hi - 1]) | |
513 | + MSYMBOL_SIZE (&msymbol[hi - 1]))) | |
514 | { | |
515 | hi--; | |
516 | continue; | |
517 | } | |
518 | ||
29e8a844 DJ |
519 | /* Otherwise, this symbol must be as good as we're going |
520 | to get. */ | |
521 | break; | |
522 | } | |
523 | ||
524 | /* If HI has a zero size, and best_zero_sized is set, | |
525 | then we had two or more zero-sized symbols; prefer | |
526 | the first one we found (which may have a higher | |
527 | address). Also, if we ran off the end, be sure | |
528 | to back up. */ | |
529 | if (best_zero_sized != -1 | |
530 | && (hi < 0 || MSYMBOL_SIZE (&msymbol[hi]) == 0)) | |
531 | hi = best_zero_sized; | |
532 | ||
533 | /* If the minimal symbol has a non-zero size, and this | |
534 | PC appears to be outside the symbol's contents, then | |
535 | refuse to use this symbol. If we found a zero-sized | |
536 | symbol with an address greater than this symbol's, | |
537 | use that instead. We assume that if symbols have | |
538 | specified sizes, they do not overlap. */ | |
539 | ||
540 | if (hi >= 0 | |
541 | && MSYMBOL_SIZE (&msymbol[hi]) != 0 | |
542 | && pc >= (SYMBOL_VALUE_ADDRESS (&msymbol[hi]) | |
543 | + MSYMBOL_SIZE (&msymbol[hi]))) | |
544 | { | |
545 | if (best_zero_sized != -1) | |
546 | hi = best_zero_sized; | |
547 | else | |
548 | /* Go on to the next object file. */ | |
549 | continue; | |
550 | } | |
551 | ||
c906108c | 552 | /* The minimal symbol indexed by hi now is the best one in this |
c5aa993b JM |
553 | objfile's minimal symbol table. See if it is the best one |
554 | overall. */ | |
c906108c | 555 | |
c906108c SS |
556 | if (hi >= 0 |
557 | && ((best_symbol == NULL) || | |
c5aa993b | 558 | (SYMBOL_VALUE_ADDRESS (best_symbol) < |
c906108c SS |
559 | SYMBOL_VALUE_ADDRESS (&msymbol[hi])))) |
560 | { | |
561 | best_symbol = &msymbol[hi]; | |
562 | } | |
563 | } | |
564 | } | |
565 | } | |
566 | return (best_symbol); | |
567 | } | |
568 | ||
569 | /* Backward compatibility: search through the minimal symbol table | |
570 | for a matching PC (no section given) */ | |
571 | ||
572 | struct minimal_symbol * | |
fba45db2 | 573 | lookup_minimal_symbol_by_pc (CORE_ADDR pc) |
c906108c | 574 | { |
43b54b88 AC |
575 | /* NOTE: cagney/2004-01-27: This was using find_pc_mapped_section to |
576 | force the section but that (well unless you're doing overlay | |
577 | debugging) always returns NULL making the call somewhat useless. */ | |
578 | struct obj_section *section = find_pc_section (pc); | |
579 | if (section == NULL) | |
580 | return NULL; | |
581 | return lookup_minimal_symbol_by_pc_section (pc, section->the_bfd_section); | |
c906108c | 582 | } |
c906108c | 583 | \f |
c5aa993b | 584 | |
c906108c SS |
585 | /* Return leading symbol character for a BFD. If BFD is NULL, |
586 | return the leading symbol character from the main objfile. */ | |
587 | ||
a14ed312 | 588 | static int get_symbol_leading_char (bfd *); |
c906108c SS |
589 | |
590 | static int | |
fba45db2 | 591 | get_symbol_leading_char (bfd *abfd) |
c906108c SS |
592 | { |
593 | if (abfd != NULL) | |
594 | return bfd_get_symbol_leading_char (abfd); | |
595 | if (symfile_objfile != NULL && symfile_objfile->obfd != NULL) | |
596 | return bfd_get_symbol_leading_char (symfile_objfile->obfd); | |
597 | return 0; | |
598 | } | |
599 | ||
600 | /* Prepare to start collecting minimal symbols. Note that presetting | |
601 | msym_bunch_index to BUNCH_SIZE causes the first call to save a minimal | |
602 | symbol to allocate the memory for the first bunch. */ | |
603 | ||
604 | void | |
fba45db2 | 605 | init_minimal_symbol_collection (void) |
c906108c SS |
606 | { |
607 | msym_count = 0; | |
608 | msym_bunch = NULL; | |
609 | msym_bunch_index = BUNCH_SIZE; | |
610 | } | |
611 | ||
612 | void | |
fba45db2 KB |
613 | prim_record_minimal_symbol (const char *name, CORE_ADDR address, |
614 | enum minimal_symbol_type ms_type, | |
615 | struct objfile *objfile) | |
c906108c SS |
616 | { |
617 | int section; | |
618 | ||
619 | switch (ms_type) | |
620 | { | |
621 | case mst_text: | |
622 | case mst_file_text: | |
623 | case mst_solib_trampoline: | |
b8fbeb18 | 624 | section = SECT_OFF_TEXT (objfile); |
c906108c SS |
625 | break; |
626 | case mst_data: | |
627 | case mst_file_data: | |
b8fbeb18 | 628 | section = SECT_OFF_DATA (objfile); |
c906108c SS |
629 | break; |
630 | case mst_bss: | |
631 | case mst_file_bss: | |
b8fbeb18 | 632 | section = SECT_OFF_BSS (objfile); |
c906108c SS |
633 | break; |
634 | default: | |
635 | section = -1; | |
636 | } | |
637 | ||
638 | prim_record_minimal_symbol_and_info (name, address, ms_type, | |
639 | NULL, section, NULL, objfile); | |
640 | } | |
641 | ||
642 | /* Record a minimal symbol in the msym bunches. Returns the symbol | |
643 | newly created. */ | |
644 | ||
645 | struct minimal_symbol * | |
fba45db2 KB |
646 | prim_record_minimal_symbol_and_info (const char *name, CORE_ADDR address, |
647 | enum minimal_symbol_type ms_type, | |
648 | char *info, int section, | |
649 | asection *bfd_section, | |
650 | struct objfile *objfile) | |
c906108c | 651 | { |
52f0bd74 AC |
652 | struct msym_bunch *new; |
653 | struct minimal_symbol *msymbol; | |
c906108c | 654 | |
66337bb1 CV |
655 | /* Don't put gcc_compiled, __gnu_compiled_cplus, and friends into |
656 | the minimal symbols, because if there is also another symbol | |
657 | at the same address (e.g. the first function of the file), | |
658 | lookup_minimal_symbol_by_pc would have no way of getting the | |
659 | right one. */ | |
660 | if (ms_type == mst_file_text && name[0] == 'g' | |
661 | && (strcmp (name, GCC_COMPILED_FLAG_SYMBOL) == 0 | |
662 | || strcmp (name, GCC2_COMPILED_FLAG_SYMBOL) == 0)) | |
663 | return (NULL); | |
664 | ||
665 | /* It's safe to strip the leading char here once, since the name | |
666 | is also stored stripped in the minimal symbol table. */ | |
667 | if (name[0] == get_symbol_leading_char (objfile->obfd)) | |
668 | ++name; | |
669 | ||
670 | if (ms_type == mst_file_text && strncmp (name, "__gnu_compiled", 14) == 0) | |
671 | return (NULL); | |
c906108c SS |
672 | |
673 | if (msym_bunch_index == BUNCH_SIZE) | |
674 | { | |
675 | new = (struct msym_bunch *) xmalloc (sizeof (struct msym_bunch)); | |
676 | msym_bunch_index = 0; | |
c5aa993b | 677 | new->next = msym_bunch; |
c906108c SS |
678 | msym_bunch = new; |
679 | } | |
c5aa993b | 680 | msymbol = &msym_bunch->contents[msym_bunch_index]; |
c906108c | 681 | SYMBOL_INIT_LANGUAGE_SPECIFIC (msymbol, language_unknown); |
2de7ced7 DJ |
682 | SYMBOL_LANGUAGE (msymbol) = language_auto; |
683 | SYMBOL_SET_NAMES (msymbol, (char *)name, strlen (name), objfile); | |
684 | ||
c906108c SS |
685 | SYMBOL_VALUE_ADDRESS (msymbol) = address; |
686 | SYMBOL_SECTION (msymbol) = section; | |
687 | SYMBOL_BFD_SECTION (msymbol) = bfd_section; | |
688 | ||
689 | MSYMBOL_TYPE (msymbol) = ms_type; | |
690 | /* FIXME: This info, if it remains, needs its own field. */ | |
c5aa993b | 691 | MSYMBOL_INFO (msymbol) = info; /* FIXME! */ |
f594e5e9 | 692 | MSYMBOL_SIZE (msymbol) = 0; |
9227b5eb | 693 | |
a79dea61 | 694 | /* The hash pointers must be cleared! If they're not, |
72a0cf8f | 695 | add_minsym_to_hash_table will NOT add this msymbol to the hash table. */ |
9227b5eb JB |
696 | msymbol->hash_next = NULL; |
697 | msymbol->demangled_hash_next = NULL; | |
698 | ||
c906108c SS |
699 | msym_bunch_index++; |
700 | msym_count++; | |
701 | OBJSTAT (objfile, n_minsyms++); | |
702 | return msymbol; | |
703 | } | |
704 | ||
705 | /* Compare two minimal symbols by address and return a signed result based | |
706 | on unsigned comparisons, so that we sort into unsigned numeric order. | |
707 | Within groups with the same address, sort by name. */ | |
708 | ||
709 | static int | |
12b9c64f | 710 | compare_minimal_symbols (const void *fn1p, const void *fn2p) |
c906108c | 711 | { |
52f0bd74 AC |
712 | const struct minimal_symbol *fn1; |
713 | const struct minimal_symbol *fn2; | |
c906108c SS |
714 | |
715 | fn1 = (const struct minimal_symbol *) fn1p; | |
716 | fn2 = (const struct minimal_symbol *) fn2p; | |
717 | ||
718 | if (SYMBOL_VALUE_ADDRESS (fn1) < SYMBOL_VALUE_ADDRESS (fn2)) | |
719 | { | |
c5aa993b | 720 | return (-1); /* addr 1 is less than addr 2 */ |
c906108c SS |
721 | } |
722 | else if (SYMBOL_VALUE_ADDRESS (fn1) > SYMBOL_VALUE_ADDRESS (fn2)) | |
723 | { | |
c5aa993b | 724 | return (1); /* addr 1 is greater than addr 2 */ |
c906108c | 725 | } |
c5aa993b JM |
726 | else |
727 | /* addrs are equal: sort by name */ | |
c906108c | 728 | { |
f56f77c1 DC |
729 | char *name1 = SYMBOL_LINKAGE_NAME (fn1); |
730 | char *name2 = SYMBOL_LINKAGE_NAME (fn2); | |
c906108c SS |
731 | |
732 | if (name1 && name2) /* both have names */ | |
733 | return strcmp (name1, name2); | |
734 | else if (name2) | |
c5aa993b JM |
735 | return 1; /* fn1 has no name, so it is "less" */ |
736 | else if (name1) /* fn2 has no name, so it is "less" */ | |
c906108c SS |
737 | return -1; |
738 | else | |
c5aa993b | 739 | return (0); /* neither has a name, so they're equal. */ |
c906108c SS |
740 | } |
741 | } | |
742 | ||
743 | /* Discard the currently collected minimal symbols, if any. If we wish | |
744 | to save them for later use, we must have already copied them somewhere | |
745 | else before calling this function. | |
746 | ||
747 | FIXME: We could allocate the minimal symbol bunches on their own | |
748 | obstack and then simply blow the obstack away when we are done with | |
749 | it. Is it worth the extra trouble though? */ | |
750 | ||
56e290f4 AC |
751 | static void |
752 | do_discard_minimal_symbols_cleanup (void *arg) | |
c906108c | 753 | { |
52f0bd74 | 754 | struct msym_bunch *next; |
c906108c SS |
755 | |
756 | while (msym_bunch != NULL) | |
757 | { | |
c5aa993b | 758 | next = msym_bunch->next; |
b8c9b27d | 759 | xfree (msym_bunch); |
c906108c SS |
760 | msym_bunch = next; |
761 | } | |
762 | } | |
763 | ||
56e290f4 AC |
764 | struct cleanup * |
765 | make_cleanup_discard_minimal_symbols (void) | |
766 | { | |
767 | return make_cleanup (do_discard_minimal_symbols_cleanup, 0); | |
768 | } | |
769 | ||
770 | ||
9227b5eb | 771 | |
c906108c SS |
772 | /* Compact duplicate entries out of a minimal symbol table by walking |
773 | through the table and compacting out entries with duplicate addresses | |
774 | and matching names. Return the number of entries remaining. | |
775 | ||
776 | On entry, the table resides between msymbol[0] and msymbol[mcount]. | |
777 | On exit, it resides between msymbol[0] and msymbol[result_count]. | |
778 | ||
779 | When files contain multiple sources of symbol information, it is | |
780 | possible for the minimal symbol table to contain many duplicate entries. | |
781 | As an example, SVR4 systems use ELF formatted object files, which | |
782 | usually contain at least two different types of symbol tables (a | |
783 | standard ELF one and a smaller dynamic linking table), as well as | |
784 | DWARF debugging information for files compiled with -g. | |
785 | ||
786 | Without compacting, the minimal symbol table for gdb itself contains | |
787 | over a 1000 duplicates, about a third of the total table size. Aside | |
788 | from the potential trap of not noticing that two successive entries | |
789 | identify the same location, this duplication impacts the time required | |
790 | to linearly scan the table, which is done in a number of places. So we | |
791 | just do one linear scan here and toss out the duplicates. | |
792 | ||
793 | Note that we are not concerned here about recovering the space that | |
794 | is potentially freed up, because the strings themselves are allocated | |
4a146b47 | 795 | on the objfile_obstack, and will get automatically freed when the symbol |
c906108c SS |
796 | table is freed. The caller can free up the unused minimal symbols at |
797 | the end of the compacted region if their allocation strategy allows it. | |
798 | ||
799 | Also note we only go up to the next to last entry within the loop | |
800 | and then copy the last entry explicitly after the loop terminates. | |
801 | ||
802 | Since the different sources of information for each symbol may | |
803 | have different levels of "completeness", we may have duplicates | |
804 | that have one entry with type "mst_unknown" and the other with a | |
805 | known type. So if the one we are leaving alone has type mst_unknown, | |
806 | overwrite its type with the type from the one we are compacting out. */ | |
807 | ||
808 | static int | |
fba45db2 KB |
809 | compact_minimal_symbols (struct minimal_symbol *msymbol, int mcount, |
810 | struct objfile *objfile) | |
c906108c SS |
811 | { |
812 | struct minimal_symbol *copyfrom; | |
813 | struct minimal_symbol *copyto; | |
814 | ||
815 | if (mcount > 0) | |
816 | { | |
817 | copyfrom = copyto = msymbol; | |
818 | while (copyfrom < msymbol + mcount - 1) | |
819 | { | |
6314a349 AC |
820 | if (SYMBOL_VALUE_ADDRESS (copyfrom) |
821 | == SYMBOL_VALUE_ADDRESS ((copyfrom + 1)) | |
822 | && strcmp (SYMBOL_LINKAGE_NAME (copyfrom), | |
823 | SYMBOL_LINKAGE_NAME ((copyfrom + 1))) == 0) | |
c906108c | 824 | { |
c5aa993b | 825 | if (MSYMBOL_TYPE ((copyfrom + 1)) == mst_unknown) |
c906108c SS |
826 | { |
827 | MSYMBOL_TYPE ((copyfrom + 1)) = MSYMBOL_TYPE (copyfrom); | |
828 | } | |
829 | copyfrom++; | |
830 | } | |
831 | else | |
afbb8d7a | 832 | *copyto++ = *copyfrom++; |
c906108c SS |
833 | } |
834 | *copyto++ = *copyfrom++; | |
835 | mcount = copyto - msymbol; | |
836 | } | |
837 | return (mcount); | |
838 | } | |
839 | ||
afbb8d7a KB |
840 | /* Build (or rebuild) the minimal symbol hash tables. This is necessary |
841 | after compacting or sorting the table since the entries move around | |
842 | thus causing the internal minimal_symbol pointers to become jumbled. */ | |
843 | ||
844 | static void | |
845 | build_minimal_symbol_hash_tables (struct objfile *objfile) | |
846 | { | |
847 | int i; | |
848 | struct minimal_symbol *msym; | |
849 | ||
850 | /* Clear the hash tables. */ | |
851 | for (i = 0; i < MINIMAL_SYMBOL_HASH_SIZE; i++) | |
852 | { | |
853 | objfile->msymbol_hash[i] = 0; | |
854 | objfile->msymbol_demangled_hash[i] = 0; | |
855 | } | |
856 | ||
857 | /* Now, (re)insert the actual entries. */ | |
858 | for (i = objfile->minimal_symbol_count, msym = objfile->msymbols; | |
859 | i > 0; | |
860 | i--, msym++) | |
861 | { | |
862 | msym->hash_next = 0; | |
863 | add_minsym_to_hash_table (msym, objfile->msymbol_hash); | |
864 | ||
865 | msym->demangled_hash_next = 0; | |
4725b721 | 866 | if (SYMBOL_SEARCH_NAME (msym) != SYMBOL_LINKAGE_NAME (msym)) |
afbb8d7a KB |
867 | add_minsym_to_demangled_hash_table (msym, |
868 | objfile->msymbol_demangled_hash); | |
869 | } | |
870 | } | |
871 | ||
c906108c SS |
872 | /* Add the minimal symbols in the existing bunches to the objfile's official |
873 | minimal symbol table. In most cases there is no minimal symbol table yet | |
874 | for this objfile, and the existing bunches are used to create one. Once | |
875 | in a while (for shared libraries for example), we add symbols (e.g. common | |
876 | symbols) to an existing objfile. | |
877 | ||
878 | Because of the way minimal symbols are collected, we generally have no way | |
879 | of knowing what source language applies to any particular minimal symbol. | |
880 | Specifically, we have no way of knowing if the minimal symbol comes from a | |
881 | C++ compilation unit or not. So for the sake of supporting cached | |
882 | demangled C++ names, we have no choice but to try and demangle each new one | |
883 | that comes in. If the demangling succeeds, then we assume it is a C++ | |
884 | symbol and set the symbol's language and demangled name fields | |
885 | appropriately. Note that in order to avoid unnecessary demanglings, and | |
886 | allocating obstack space that subsequently can't be freed for the demangled | |
887 | names, we mark all newly added symbols with language_auto. After | |
888 | compaction of the minimal symbols, we go back and scan the entire minimal | |
889 | symbol table looking for these new symbols. For each new symbol we attempt | |
890 | to demangle it, and if successful, record it as a language_cplus symbol | |
891 | and cache the demangled form on the symbol obstack. Symbols which don't | |
892 | demangle are marked as language_unknown symbols, which inhibits future | |
893 | attempts to demangle them if we later add more minimal symbols. */ | |
894 | ||
895 | void | |
fba45db2 | 896 | install_minimal_symbols (struct objfile *objfile) |
c906108c | 897 | { |
52f0bd74 AC |
898 | int bindex; |
899 | int mcount; | |
900 | struct msym_bunch *bunch; | |
901 | struct minimal_symbol *msymbols; | |
c906108c | 902 | int alloc_count; |
c906108c SS |
903 | |
904 | if (msym_count > 0) | |
905 | { | |
906 | /* Allocate enough space in the obstack, into which we will gather the | |
c5aa993b JM |
907 | bunches of new and existing minimal symbols, sort them, and then |
908 | compact out the duplicate entries. Once we have a final table, | |
909 | we will give back the excess space. */ | |
c906108c SS |
910 | |
911 | alloc_count = msym_count + objfile->minimal_symbol_count + 1; | |
4a146b47 | 912 | obstack_blank (&objfile->objfile_obstack, |
c906108c SS |
913 | alloc_count * sizeof (struct minimal_symbol)); |
914 | msymbols = (struct minimal_symbol *) | |
4a146b47 | 915 | obstack_base (&objfile->objfile_obstack); |
c906108c SS |
916 | |
917 | /* Copy in the existing minimal symbols, if there are any. */ | |
918 | ||
919 | if (objfile->minimal_symbol_count) | |
c5aa993b JM |
920 | memcpy ((char *) msymbols, (char *) objfile->msymbols, |
921 | objfile->minimal_symbol_count * sizeof (struct minimal_symbol)); | |
c906108c SS |
922 | |
923 | /* Walk through the list of minimal symbol bunches, adding each symbol | |
c5aa993b JM |
924 | to the new contiguous array of symbols. Note that we start with the |
925 | current, possibly partially filled bunch (thus we use the current | |
926 | msym_bunch_index for the first bunch we copy over), and thereafter | |
927 | each bunch is full. */ | |
928 | ||
c906108c | 929 | mcount = objfile->minimal_symbol_count; |
c5aa993b JM |
930 | |
931 | for (bunch = msym_bunch; bunch != NULL; bunch = bunch->next) | |
c906108c SS |
932 | { |
933 | for (bindex = 0; bindex < msym_bunch_index; bindex++, mcount++) | |
66337bb1 | 934 | msymbols[mcount] = bunch->contents[bindex]; |
c906108c SS |
935 | msym_bunch_index = BUNCH_SIZE; |
936 | } | |
937 | ||
938 | /* Sort the minimal symbols by address. */ | |
c5aa993b | 939 | |
c906108c SS |
940 | qsort (msymbols, mcount, sizeof (struct minimal_symbol), |
941 | compare_minimal_symbols); | |
c5aa993b | 942 | |
c906108c | 943 | /* Compact out any duplicates, and free up whatever space we are |
c5aa993b JM |
944 | no longer using. */ |
945 | ||
9227b5eb | 946 | mcount = compact_minimal_symbols (msymbols, mcount, objfile); |
c906108c | 947 | |
4a146b47 | 948 | obstack_blank (&objfile->objfile_obstack, |
c5aa993b | 949 | (mcount + 1 - alloc_count) * sizeof (struct minimal_symbol)); |
c906108c | 950 | msymbols = (struct minimal_symbol *) |
4a146b47 | 951 | obstack_finish (&objfile->objfile_obstack); |
c906108c SS |
952 | |
953 | /* We also terminate the minimal symbol table with a "null symbol", | |
c5aa993b JM |
954 | which is *not* included in the size of the table. This makes it |
955 | easier to find the end of the table when we are handed a pointer | |
956 | to some symbol in the middle of it. Zero out the fields in the | |
957 | "null symbol" allocated at the end of the array. Note that the | |
958 | symbol count does *not* include this null symbol, which is why it | |
959 | is indexed by mcount and not mcount-1. */ | |
c906108c | 960 | |
f56f77c1 | 961 | SYMBOL_LINKAGE_NAME (&msymbols[mcount]) = NULL; |
c906108c SS |
962 | SYMBOL_VALUE_ADDRESS (&msymbols[mcount]) = 0; |
963 | MSYMBOL_INFO (&msymbols[mcount]) = NULL; | |
f594e5e9 | 964 | MSYMBOL_SIZE (&msymbols[mcount]) = 0; |
c906108c SS |
965 | MSYMBOL_TYPE (&msymbols[mcount]) = mst_unknown; |
966 | SYMBOL_INIT_LANGUAGE_SPECIFIC (&msymbols[mcount], language_unknown); | |
967 | ||
968 | /* Attach the minimal symbol table to the specified objfile. | |
4a146b47 | 969 | The strings themselves are also located in the objfile_obstack |
c5aa993b | 970 | of this objfile. */ |
c906108c | 971 | |
c5aa993b JM |
972 | objfile->minimal_symbol_count = mcount; |
973 | objfile->msymbols = msymbols; | |
c906108c | 974 | |
7ed49443 JB |
975 | /* Try to guess the appropriate C++ ABI by looking at the names |
976 | of the minimal symbols in the table. */ | |
977 | { | |
978 | int i; | |
979 | ||
980 | for (i = 0; i < mcount; i++) | |
981 | { | |
6aca59a3 DJ |
982 | /* If a symbol's name starts with _Z and was successfully |
983 | demangled, then we can assume we've found a GNU v3 symbol. | |
984 | For now we set the C++ ABI globally; if the user is | |
985 | mixing ABIs then the user will need to "set cp-abi" | |
986 | manually. */ | |
f56f77c1 | 987 | const char *name = SYMBOL_LINKAGE_NAME (&objfile->msymbols[i]); |
6aca59a3 DJ |
988 | if (name[0] == '_' && name[1] == 'Z' |
989 | && SYMBOL_DEMANGLED_NAME (&objfile->msymbols[i]) != NULL) | |
7ed49443 | 990 | { |
fe1f4a5e | 991 | set_cp_abi_as_auto_default ("gnu-v3"); |
7ed49443 JB |
992 | break; |
993 | } | |
994 | } | |
995 | } | |
afbb8d7a KB |
996 | |
997 | /* Now build the hash tables; we can't do this incrementally | |
998 | at an earlier point since we weren't finished with the obstack | |
999 | yet. (And if the msymbol obstack gets moved, all the internal | |
1000 | pointers to other msymbols need to be adjusted.) */ | |
1001 | build_minimal_symbol_hash_tables (objfile); | |
c906108c SS |
1002 | } |
1003 | } | |
1004 | ||
1005 | /* Sort all the minimal symbols in OBJFILE. */ | |
1006 | ||
1007 | void | |
fba45db2 | 1008 | msymbols_sort (struct objfile *objfile) |
c906108c SS |
1009 | { |
1010 | qsort (objfile->msymbols, objfile->minimal_symbol_count, | |
1011 | sizeof (struct minimal_symbol), compare_minimal_symbols); | |
afbb8d7a | 1012 | build_minimal_symbol_hash_tables (objfile); |
c906108c SS |
1013 | } |
1014 | ||
1015 | /* Check if PC is in a shared library trampoline code stub. | |
1016 | Return minimal symbol for the trampoline entry or NULL if PC is not | |
1017 | in a trampoline code stub. */ | |
1018 | ||
1019 | struct minimal_symbol * | |
fba45db2 | 1020 | lookup_solib_trampoline_symbol_by_pc (CORE_ADDR pc) |
c906108c SS |
1021 | { |
1022 | struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (pc); | |
1023 | ||
1024 | if (msymbol != NULL && MSYMBOL_TYPE (msymbol) == mst_solib_trampoline) | |
1025 | return msymbol; | |
1026 | return NULL; | |
1027 | } | |
1028 | ||
1029 | /* If PC is in a shared library trampoline code stub, return the | |
1030 | address of the `real' function belonging to the stub. | |
1031 | Return 0 if PC is not in a trampoline code stub or if the real | |
1032 | function is not found in the minimal symbol table. | |
1033 | ||
1034 | We may fail to find the right function if a function with the | |
1035 | same name is defined in more than one shared library, but this | |
1036 | is considered bad programming style. We could return 0 if we find | |
1037 | a duplicate function in case this matters someday. */ | |
1038 | ||
1039 | CORE_ADDR | |
52f729a7 | 1040 | find_solib_trampoline_target (struct frame_info *frame, CORE_ADDR pc) |
c906108c SS |
1041 | { |
1042 | struct objfile *objfile; | |
1043 | struct minimal_symbol *msymbol; | |
1044 | struct minimal_symbol *tsymbol = lookup_solib_trampoline_symbol_by_pc (pc); | |
1045 | ||
1046 | if (tsymbol != NULL) | |
1047 | { | |
1048 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b JM |
1049 | { |
1050 | if (MSYMBOL_TYPE (msymbol) == mst_text | |
6314a349 AC |
1051 | && strcmp (SYMBOL_LINKAGE_NAME (msymbol), |
1052 | SYMBOL_LINKAGE_NAME (tsymbol)) == 0) | |
c5aa993b JM |
1053 | return SYMBOL_VALUE_ADDRESS (msymbol); |
1054 | } | |
c906108c SS |
1055 | } |
1056 | return 0; | |
1057 | } |