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