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