Commit | Line | Data |
---|---|---|
1ab3bf1b | 1 | /* GDB routines for manipulating the minimal symbol tables. |
87273c71 | 2 | Copyright 1992, 1993, 1994, 1996, 1996 Free Software Foundation, Inc. |
1ab3bf1b JG |
3 | Contributed by Cygnus Support, using pieces from other GDB modules. |
4 | ||
5 | This file is part of GDB. | |
6 | ||
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 | |
9 | the Free Software Foundation; either version 2 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
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. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program; if not, write to the Free Software | |
6c9638b4 | 19 | Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ |
1ab3bf1b JG |
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. | |
33 | ||
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 | ||
1ab3bf1b | 40 | #include "defs.h" |
2b576293 | 41 | #include "gdb_string.h" |
1ab3bf1b JG |
42 | #include "symtab.h" |
43 | #include "bfd.h" | |
44 | #include "symfile.h" | |
5e2e79f8 | 45 | #include "objfiles.h" |
2e4964ad | 46 | #include "demangle.h" |
72bba93b | 47 | #include "gdb-stabs.h" |
1ab3bf1b JG |
48 | |
49 | /* Accumulate the minimal symbols for each objfile in bunches of BUNCH_SIZE. | |
50 | At the end, copy them all into one newly allocated location on an objfile's | |
51 | symbol obstack. */ | |
52 | ||
53 | #define BUNCH_SIZE 127 | |
54 | ||
55 | struct msym_bunch | |
56 | { | |
57 | struct msym_bunch *next; | |
58 | struct minimal_symbol contents[BUNCH_SIZE]; | |
59 | }; | |
60 | ||
61 | /* Bunch currently being filled up. | |
62 | The next field points to chain of filled bunches. */ | |
63 | ||
64 | static struct msym_bunch *msym_bunch; | |
65 | ||
66 | /* Number of slots filled in current bunch. */ | |
67 | ||
68 | static int msym_bunch_index; | |
69 | ||
70 | /* Total number of minimal symbols recorded so far for the objfile. */ | |
71 | ||
72 | static int msym_count; | |
73 | ||
74 | /* Prototypes for local functions. */ | |
75 | ||
76 | static int | |
77 | compare_minimal_symbols PARAMS ((const void *, const void *)); | |
78 | ||
79 | static int | |
80 | compact_minimal_symbols PARAMS ((struct minimal_symbol *, int)); | |
81 | ||
2d336b1b JK |
82 | /* Look through all the current minimal symbol tables and find the |
83 | first minimal symbol that matches NAME. If OBJF is non-NULL, limit | |
84 | the search to that objfile. If SFILE is non-NULL, limit the search | |
85 | to that source file. Returns a pointer to the minimal symbol that | |
86 | matches, or NULL if no match is found. | |
1ab3bf1b | 87 | |
507e4004 | 88 | Note: One instance where there may be duplicate minimal symbols with |
1ab3bf1b JG |
89 | the same name is when the symbol tables for a shared library and the |
90 | symbol tables for an executable contain global symbols with the same | |
91 | names (the dynamic linker deals with the duplication). */ | |
92 | ||
93 | struct minimal_symbol * | |
2d336b1b | 94 | lookup_minimal_symbol (name, sfile, objf) |
1ab3bf1b | 95 | register const char *name; |
2d336b1b | 96 | const char *sfile; |
1ab3bf1b JG |
97 | struct objfile *objf; |
98 | { | |
99 | struct objfile *objfile; | |
100 | struct minimal_symbol *msymbol; | |
101 | struct minimal_symbol *found_symbol = NULL; | |
164207ca | 102 | struct minimal_symbol *found_file_symbol = NULL; |
507e4004 | 103 | struct minimal_symbol *trampoline_symbol = NULL; |
1ab3bf1b | 104 | |
2d336b1b JK |
105 | #ifdef SOFUN_ADDRESS_MAYBE_MISSING |
106 | if (sfile != NULL) | |
107 | { | |
108 | char *p = strrchr (sfile, '/'); | |
109 | if (p != NULL) | |
110 | sfile = p + 1; | |
111 | } | |
112 | #endif | |
113 | ||
1ab3bf1b JG |
114 | for (objfile = object_files; |
115 | objfile != NULL && found_symbol == NULL; | |
116 | objfile = objfile -> next) | |
117 | { | |
118 | if (objf == NULL || objf == objfile) | |
119 | { | |
120 | for (msymbol = objfile -> msymbols; | |
2e4964ad | 121 | msymbol != NULL && SYMBOL_NAME (msymbol) != NULL && |
1ab3bf1b JG |
122 | found_symbol == NULL; |
123 | msymbol++) | |
124 | { | |
2e4964ad | 125 | if (SYMBOL_MATCHES_NAME (msymbol, name)) |
1ab3bf1b | 126 | { |
164207ca JK |
127 | switch (MSYMBOL_TYPE (msymbol)) |
128 | { | |
129 | case mst_file_text: | |
130 | case mst_file_data: | |
131 | case mst_file_bss: | |
2d336b1b JK |
132 | #ifdef SOFUN_ADDRESS_MAYBE_MISSING |
133 | if (sfile == NULL || STREQ (msymbol->filename, sfile)) | |
134 | found_file_symbol = msymbol; | |
135 | #else | |
136 | /* We have neither the ability nor the need to | |
137 | deal with the SFILE parameter. If we find | |
138 | more than one symbol, just return the latest | |
139 | one (the user can't expect useful behavior in | |
140 | that case). */ | |
164207ca | 141 | found_file_symbol = msymbol; |
2d336b1b | 142 | #endif |
164207ca JK |
143 | break; |
144 | ||
ae6d035d | 145 | case mst_solib_trampoline: |
164207ca JK |
146 | |
147 | /* If a trampoline symbol is found, we prefer to | |
148 | keep looking for the *real* symbol. If the | |
ae6d035d PS |
149 | actual symbol is not found, then we'll use the |
150 | trampoline entry. */ | |
164207ca JK |
151 | if (trampoline_symbol == NULL) |
152 | trampoline_symbol = msymbol; | |
153 | break; | |
ae6d035d PS |
154 | |
155 | case mst_unknown: | |
164207ca JK |
156 | default: |
157 | found_symbol = msymbol; | |
158 | break; | |
159 | } | |
1ab3bf1b JG |
160 | } |
161 | } | |
162 | } | |
163 | } | |
164207ca JK |
164 | /* External symbols are best. */ |
165 | if (found_symbol) | |
166 | return found_symbol; | |
167 | ||
168 | /* File-local symbols are next best. */ | |
169 | if (found_file_symbol) | |
170 | return found_file_symbol; | |
171 | ||
ae6d035d | 172 | /* Symbols for shared library trampolines are next best. */ |
164207ca JK |
173 | if (trampoline_symbol) |
174 | return trampoline_symbol; | |
507e4004 | 175 | |
164207ca | 176 | return NULL; |
1ab3bf1b JG |
177 | } |
178 | ||
cdd2212f KH |
179 | /* Look through all the current minimal symbol tables and find the |
180 | first minimal symbol that matches NAME and of text type. | |
181 | If OBJF is non-NULL, limit | |
182 | the search to that objfile. If SFILE is non-NULL, limit the search | |
183 | to that source file. Returns a pointer to the minimal symbol that | |
184 | matches, or NULL if no match is found. | |
185 | */ | |
186 | ||
187 | struct minimal_symbol * | |
188 | lookup_minimal_symbol_text (name, sfile, objf) | |
189 | register const char *name; | |
190 | const char *sfile; | |
191 | struct objfile *objf; | |
192 | { | |
193 | struct objfile *objfile; | |
194 | struct minimal_symbol *msymbol; | |
195 | struct minimal_symbol *found_symbol = NULL; | |
196 | struct minimal_symbol *found_file_symbol = NULL; | |
cdd2212f KH |
197 | |
198 | #ifdef SOFUN_ADDRESS_MAYBE_MISSING | |
199 | if (sfile != NULL) | |
200 | { | |
201 | char *p = strrchr (sfile, '/'); | |
202 | if (p != NULL) | |
203 | sfile = p + 1; | |
204 | } | |
205 | #endif | |
206 | ||
207 | for (objfile = object_files; | |
208 | objfile != NULL && found_symbol == NULL; | |
209 | objfile = objfile -> next) | |
210 | { | |
211 | if (objf == NULL || objf == objfile) | |
212 | { | |
213 | for (msymbol = objfile -> msymbols; | |
214 | msymbol != NULL && SYMBOL_NAME (msymbol) != NULL && | |
215 | found_symbol == NULL; | |
216 | msymbol++) | |
217 | { | |
218 | if (SYMBOL_MATCHES_NAME (msymbol, name) && | |
219 | (MSYMBOL_TYPE (msymbol) == mst_text || | |
220 | MSYMBOL_TYPE (msymbol) == mst_file_text)) | |
221 | { | |
222 | switch (MSYMBOL_TYPE (msymbol)) | |
223 | { | |
224 | case mst_file_text: | |
225 | #ifdef SOFUN_ADDRESS_MAYBE_MISSING | |
226 | if (sfile == NULL || STREQ (msymbol->filename, sfile)) | |
227 | found_file_symbol = msymbol; | |
228 | #else | |
229 | /* We have neither the ability nor the need to | |
230 | deal with the SFILE parameter. If we find | |
231 | more than one symbol, just return the latest | |
232 | one (the user can't expect useful behavior in | |
233 | that case). */ | |
234 | found_file_symbol = msymbol; | |
235 | #endif | |
236 | break; | |
237 | default: | |
238 | found_symbol = msymbol; | |
239 | break; | |
240 | } | |
241 | } | |
242 | } | |
243 | } | |
244 | } | |
245 | /* External symbols are best. */ | |
246 | if (found_symbol) | |
247 | return found_symbol; | |
248 | ||
249 | /* File-local symbols are next best. */ | |
250 | if (found_file_symbol) | |
251 | return found_file_symbol; | |
252 | ||
253 | return NULL; | |
254 | } | |
255 | ||
87273c71 JL |
256 | /* Look through all the current minimal symbol tables and find the |
257 | first minimal symbol that matches NAME and of solib trampoline type. | |
258 | If OBJF is non-NULL, limit | |
259 | the search to that objfile. If SFILE is non-NULL, limit the search | |
260 | to that source file. Returns a pointer to the minimal symbol that | |
261 | matches, or NULL if no match is found. | |
262 | */ | |
263 | ||
264 | struct minimal_symbol * | |
265 | lookup_minimal_symbol_solib_trampoline (name, sfile, objf) | |
266 | register const char *name; | |
267 | const char *sfile; | |
268 | struct objfile *objf; | |
269 | { | |
270 | struct objfile *objfile; | |
271 | struct minimal_symbol *msymbol; | |
272 | struct minimal_symbol *found_symbol = NULL; | |
87273c71 JL |
273 | |
274 | #ifdef SOFUN_ADDRESS_MAYBE_MISSING | |
275 | if (sfile != NULL) | |
276 | { | |
277 | char *p = strrchr (sfile, '/'); | |
278 | if (p != NULL) | |
279 | sfile = p + 1; | |
280 | } | |
281 | #endif | |
282 | ||
283 | for (objfile = object_files; | |
284 | objfile != NULL && found_symbol == NULL; | |
285 | objfile = objfile -> next) | |
286 | { | |
287 | if (objf == NULL || objf == objfile) | |
288 | { | |
289 | for (msymbol = objfile -> msymbols; | |
290 | msymbol != NULL && SYMBOL_NAME (msymbol) != NULL && | |
291 | found_symbol == NULL; | |
292 | msymbol++) | |
293 | { | |
294 | if (SYMBOL_MATCHES_NAME (msymbol, name) && | |
295 | MSYMBOL_TYPE (msymbol) == mst_solib_trampoline) | |
296 | return msymbol; | |
297 | } | |
298 | } | |
299 | } | |
300 | ||
301 | return NULL; | |
302 | } | |
303 | ||
304 | ||
1ab3bf1b JG |
305 | /* Search through the minimal symbol table for each objfile and find the |
306 | symbol whose address is the largest address that is still less than or | |
307 | equal to PC. Returns a pointer to the minimal symbol if such a symbol | |
308 | is found, or NULL if PC is not in a suitable range. Note that we need | |
309 | to look through ALL the minimal symbol tables before deciding on the | |
55f65171 JK |
310 | symbol that comes closest to the specified PC. This is because objfiles |
311 | can overlap, for example objfile A has .text at 0x100 and .data at 0x40000 | |
312 | and objfile B has .text at 0x234 and .data at 0x40048. */ | |
1ab3bf1b JG |
313 | |
314 | struct minimal_symbol * | |
315 | lookup_minimal_symbol_by_pc (pc) | |
316 | register CORE_ADDR pc; | |
317 | { | |
318 | register int lo; | |
319 | register int hi; | |
320 | register int new; | |
321 | register struct objfile *objfile; | |
322 | register struct minimal_symbol *msymbol; | |
323 | register struct minimal_symbol *best_symbol = NULL; | |
324 | ||
325 | for (objfile = object_files; | |
326 | objfile != NULL; | |
327 | objfile = objfile -> next) | |
328 | { | |
329 | /* If this objfile has a minimal symbol table, go search it using | |
330 | a binary search. Note that a minimal symbol table always consists | |
331 | of at least two symbols, a "real" symbol and the terminating | |
332 | "null symbol". If there are no real symbols, then there is no | |
333 | minimal symbol table at all. */ | |
334 | ||
335 | if ((msymbol = objfile -> msymbols) != NULL) | |
336 | { | |
337 | lo = 0; | |
a521e93a | 338 | hi = objfile -> minimal_symbol_count - 1; |
9f1e14f4 | 339 | |
1ab3bf1b JG |
340 | /* This code assumes that the minimal symbols are sorted by |
341 | ascending address values. If the pc value is greater than or | |
342 | equal to the first symbol's address, then some symbol in this | |
343 | minimal symbol table is a suitable candidate for being the | |
344 | "best" symbol. This includes the last real symbol, for cases | |
345 | where the pc value is larger than any address in this vector. | |
346 | ||
347 | By iterating until the address associated with the current | |
348 | hi index (the endpoint of the test interval) is less than | |
349 | or equal to the desired pc value, we accomplish two things: | |
350 | (1) the case where the pc value is larger than any minimal | |
351 | symbol address is trivially solved, (2) the address associated | |
352 | with the hi index is always the one we want when the interation | |
353 | terminates. In essence, we are iterating the test interval | |
354 | down until the pc value is pushed out of it from the high end. | |
355 | ||
356 | Warning: this code is trickier than it would appear at first. */ | |
357 | ||
1eeba686 | 358 | /* Should also requires that pc is <= end of objfile. FIXME! */ |
2e4964ad | 359 | if (pc >= SYMBOL_VALUE_ADDRESS (&msymbol[lo])) |
1ab3bf1b | 360 | { |
2e4964ad | 361 | while (SYMBOL_VALUE_ADDRESS (&msymbol[hi]) > pc) |
1ab3bf1b JG |
362 | { |
363 | /* pc is still strictly less than highest address */ | |
364 | /* Note "new" will always be >= lo */ | |
365 | new = (lo + hi) / 2; | |
2e4964ad FF |
366 | if ((SYMBOL_VALUE_ADDRESS (&msymbol[new]) >= pc) || |
367 | (lo == new)) | |
1ab3bf1b JG |
368 | { |
369 | hi = new; | |
370 | } | |
371 | else | |
372 | { | |
373 | lo = new; | |
374 | } | |
375 | } | |
436d4143 JL |
376 | |
377 | /* If we have multiple symbols at the same address, we want | |
378 | hi to point to the last one. That way we can find the | |
379 | right symbol if it has an index greater than hi. */ | |
380 | while (hi < objfile -> minimal_symbol_count - 1 | |
381 | && (SYMBOL_VALUE_ADDRESS (&msymbol[hi]) | |
382 | == SYMBOL_VALUE_ADDRESS (&msymbol[hi+1]))) | |
383 | hi++; | |
384 | ||
1ab3bf1b JG |
385 | /* The minimal symbol indexed by hi now is the best one in this |
386 | objfile's minimal symbol table. See if it is the best one | |
387 | overall. */ | |
388 | ||
291b84ff JK |
389 | /* Skip any absolute symbols. This is apparently what adb |
390 | and dbx do, and is needed for the CM-5. There are two | |
391 | known possible problems: (1) on ELF, apparently end, edata, | |
392 | etc. are absolute. Not sure ignoring them here is a big | |
393 | deal, but if we want to use them, the fix would go in | |
394 | elfread.c. (2) I think shared library entry points on the | |
395 | NeXT are absolute. If we want special handling for this | |
396 | it probably should be triggered by a special | |
397 | mst_abs_or_lib or some such. */ | |
398 | while (hi >= 0 | |
399 | && msymbol[hi].type == mst_abs) | |
400 | --hi; | |
401 | ||
402 | if (hi >= 0 | |
403 | && ((best_symbol == NULL) || | |
404 | (SYMBOL_VALUE_ADDRESS (best_symbol) < | |
405 | SYMBOL_VALUE_ADDRESS (&msymbol[hi])))) | |
1ab3bf1b JG |
406 | { |
407 | best_symbol = &msymbol[hi]; | |
408 | } | |
409 | } | |
9f1e14f4 JK |
410 | } |
411 | } | |
412 | return (best_symbol); | |
413 | } | |
414 | ||
2d336b1b JK |
415 | #ifdef SOFUN_ADDRESS_MAYBE_MISSING |
416 | CORE_ADDR | |
417 | find_stab_function_addr (namestring, pst, objfile) | |
418 | char *namestring; | |
419 | struct partial_symtab *pst; | |
420 | struct objfile *objfile; | |
421 | { | |
422 | struct minimal_symbol *msym; | |
423 | char *p; | |
424 | int n; | |
425 | ||
426 | p = strchr (namestring, ':'); | |
427 | if (p == NULL) | |
428 | p = namestring; | |
429 | n = p - namestring; | |
430 | p = alloca (n + 1); | |
431 | strncpy (p, namestring, n); | |
432 | p[n] = 0; | |
433 | ||
434 | msym = lookup_minimal_symbol (p, pst->filename, objfile); | |
435 | return msym == NULL ? 0 : SYMBOL_VALUE_ADDRESS (msym); | |
436 | } | |
437 | #endif /* SOFUN_ADDRESS_MAYBE_MISSING */ | |
438 | ||
439 | \f | |
02b40a19 PS |
440 | /* Return leading symbol character for a BFD. If BFD is NULL, |
441 | return the leading symbol character from the main objfile. */ | |
442 | ||
443 | static int get_symbol_leading_char PARAMS ((bfd *)); | |
444 | ||
445 | static int | |
446 | get_symbol_leading_char (abfd) | |
447 | bfd * abfd; | |
448 | { | |
449 | if (abfd != NULL) | |
450 | return bfd_get_symbol_leading_char (abfd); | |
451 | if (symfile_objfile != NULL && symfile_objfile->obfd != NULL) | |
452 | return bfd_get_symbol_leading_char (symfile_objfile->obfd); | |
453 | return 0; | |
454 | } | |
455 | ||
1ab3bf1b JG |
456 | /* Prepare to start collecting minimal symbols. Note that presetting |
457 | msym_bunch_index to BUNCH_SIZE causes the first call to save a minimal | |
458 | symbol to allocate the memory for the first bunch. */ | |
459 | ||
460 | void | |
461 | init_minimal_symbol_collection () | |
462 | { | |
463 | msym_count = 0; | |
464 | msym_bunch = NULL; | |
465 | msym_bunch_index = BUNCH_SIZE; | |
466 | } | |
467 | ||
468 | void | |
8d60affd | 469 | prim_record_minimal_symbol (name, address, ms_type, objfile) |
1ab3bf1b JG |
470 | const char *name; |
471 | CORE_ADDR address; | |
472 | enum minimal_symbol_type ms_type; | |
8d60affd | 473 | struct objfile *objfile; |
1ab3bf1b | 474 | { |
ad15bea9 SG |
475 | int section; |
476 | ||
477 | switch (ms_type) | |
478 | { | |
479 | case mst_text: | |
480 | case mst_file_text: | |
481 | case mst_solib_trampoline: | |
482 | section = SECT_OFF_TEXT; | |
483 | break; | |
484 | case mst_data: | |
485 | case mst_file_data: | |
486 | section = SECT_OFF_DATA; | |
487 | break; | |
488 | case mst_bss: | |
489 | case mst_file_bss: | |
490 | section = SECT_OFF_BSS; | |
491 | break; | |
492 | default: | |
493 | section = -1; | |
494 | } | |
495 | ||
240972ec | 496 | prim_record_minimal_symbol_and_info (name, address, ms_type, |
ad15bea9 | 497 | NULL, section, objfile); |
1ab3bf1b JG |
498 | } |
499 | ||
2d336b1b JK |
500 | /* Record a minimal symbol in the msym bunches. Returns the symbol |
501 | newly created. */ | |
502 | struct minimal_symbol * | |
8d60affd JK |
503 | prim_record_minimal_symbol_and_info (name, address, ms_type, info, section, |
504 | objfile) | |
93297ea0 JG |
505 | const char *name; |
506 | CORE_ADDR address; | |
507 | enum minimal_symbol_type ms_type; | |
508 | char *info; | |
3c02636b | 509 | int section; |
8d60affd | 510 | struct objfile *objfile; |
93297ea0 JG |
511 | { |
512 | register struct msym_bunch *new; | |
2e4964ad | 513 | register struct minimal_symbol *msymbol; |
93297ea0 | 514 | |
404f69a8 JK |
515 | if (ms_type == mst_file_text) |
516 | { | |
517 | /* Don't put gcc_compiled, __gnu_compiled_cplus, and friends into | |
518 | the minimal symbols, because if there is also another symbol | |
519 | at the same address (e.g. the first function of the file), | |
520 | lookup_minimal_symbol_by_pc would have no way of getting the | |
521 | right one. */ | |
522 | if (name[0] == 'g' | |
523 | && (strcmp (name, GCC_COMPILED_FLAG_SYMBOL) == 0 | |
524 | || strcmp (name, GCC2_COMPILED_FLAG_SYMBOL) == 0)) | |
6b14af2b | 525 | return (NULL); |
404f69a8 JK |
526 | |
527 | { | |
ab5f7971 | 528 | const char *tempstring = name; |
02b40a19 | 529 | if (tempstring[0] == get_symbol_leading_char (objfile->obfd)) |
404f69a8 JK |
530 | ++tempstring; |
531 | if (STREQN (tempstring, "__gnu_compiled", 14)) | |
6b14af2b | 532 | return (NULL); |
404f69a8 JK |
533 | } |
534 | } | |
535 | ||
93297ea0 JG |
536 | if (msym_bunch_index == BUNCH_SIZE) |
537 | { | |
538 | new = (struct msym_bunch *) xmalloc (sizeof (struct msym_bunch)); | |
539 | msym_bunch_index = 0; | |
540 | new -> next = msym_bunch; | |
541 | msym_bunch = new; | |
542 | } | |
2e4964ad FF |
543 | msymbol = &msym_bunch -> contents[msym_bunch_index]; |
544 | SYMBOL_NAME (msymbol) = (char *) name; | |
7532cf10 | 545 | SYMBOL_INIT_LANGUAGE_SPECIFIC (msymbol, language_unknown); |
2e4964ad | 546 | SYMBOL_VALUE_ADDRESS (msymbol) = address; |
ad15bea9 | 547 | SYMBOL_SECTION (msymbol) = section; |
72bba93b | 548 | |
2e4964ad FF |
549 | MSYMBOL_TYPE (msymbol) = ms_type; |
550 | /* FIXME: This info, if it remains, needs its own field. */ | |
551 | MSYMBOL_INFO (msymbol) = info; /* FIXME! */ | |
93297ea0 JG |
552 | msym_bunch_index++; |
553 | msym_count++; | |
2dd30c72 | 554 | OBJSTAT (objfile, n_minsyms++); |
2d336b1b | 555 | return msymbol; |
93297ea0 JG |
556 | } |
557 | ||
1ab3bf1b JG |
558 | /* Compare two minimal symbols by address and return a signed result based |
559 | on unsigned comparisons, so that we sort into unsigned numeric order. */ | |
560 | ||
561 | static int | |
562 | compare_minimal_symbols (fn1p, fn2p) | |
563 | const PTR fn1p; | |
564 | const PTR fn2p; | |
565 | { | |
566 | register const struct minimal_symbol *fn1; | |
567 | register const struct minimal_symbol *fn2; | |
568 | ||
569 | fn1 = (const struct minimal_symbol *) fn1p; | |
570 | fn2 = (const struct minimal_symbol *) fn2p; | |
571 | ||
2e4964ad | 572 | if (SYMBOL_VALUE_ADDRESS (fn1) < SYMBOL_VALUE_ADDRESS (fn2)) |
1ab3bf1b JG |
573 | { |
574 | return (-1); | |
575 | } | |
2e4964ad | 576 | else if (SYMBOL_VALUE_ADDRESS (fn1) > SYMBOL_VALUE_ADDRESS (fn2)) |
1ab3bf1b JG |
577 | { |
578 | return (1); | |
579 | } | |
580 | else | |
581 | { | |
582 | return (0); | |
583 | } | |
584 | } | |
585 | ||
586 | /* Discard the currently collected minimal symbols, if any. If we wish | |
587 | to save them for later use, we must have already copied them somewhere | |
588 | else before calling this function. | |
589 | ||
590 | FIXME: We could allocate the minimal symbol bunches on their own | |
591 | obstack and then simply blow the obstack away when we are done with | |
592 | it. Is it worth the extra trouble though? */ | |
593 | ||
594 | /* ARGSUSED */ | |
595 | void | |
596 | discard_minimal_symbols (foo) | |
597 | int foo; | |
598 | { | |
599 | register struct msym_bunch *next; | |
600 | ||
601 | while (msym_bunch != NULL) | |
602 | { | |
603 | next = msym_bunch -> next; | |
84ffdec2 | 604 | free ((PTR)msym_bunch); |
1ab3bf1b JG |
605 | msym_bunch = next; |
606 | } | |
607 | } | |
608 | ||
609 | /* Compact duplicate entries out of a minimal symbol table by walking | |
610 | through the table and compacting out entries with duplicate addresses | |
021959e2 JG |
611 | and matching names. Return the number of entries remaining. |
612 | ||
613 | On entry, the table resides between msymbol[0] and msymbol[mcount]. | |
614 | On exit, it resides between msymbol[0] and msymbol[result_count]. | |
1ab3bf1b JG |
615 | |
616 | When files contain multiple sources of symbol information, it is | |
617 | possible for the minimal symbol table to contain many duplicate entries. | |
618 | As an example, SVR4 systems use ELF formatted object files, which | |
619 | usually contain at least two different types of symbol tables (a | |
620 | standard ELF one and a smaller dynamic linking table), as well as | |
621 | DWARF debugging information for files compiled with -g. | |
622 | ||
623 | Without compacting, the minimal symbol table for gdb itself contains | |
624 | over a 1000 duplicates, about a third of the total table size. Aside | |
625 | from the potential trap of not noticing that two successive entries | |
626 | identify the same location, this duplication impacts the time required | |
021959e2 | 627 | to linearly scan the table, which is done in a number of places. So we |
1ab3bf1b JG |
628 | just do one linear scan here and toss out the duplicates. |
629 | ||
630 | Note that we are not concerned here about recovering the space that | |
631 | is potentially freed up, because the strings themselves are allocated | |
632 | on the symbol_obstack, and will get automatically freed when the symbol | |
021959e2 JG |
633 | table is freed. The caller can free up the unused minimal symbols at |
634 | the end of the compacted region if their allocation strategy allows it. | |
1ab3bf1b JG |
635 | |
636 | Also note we only go up to the next to last entry within the loop | |
637 | and then copy the last entry explicitly after the loop terminates. | |
638 | ||
639 | Since the different sources of information for each symbol may | |
640 | have different levels of "completeness", we may have duplicates | |
641 | that have one entry with type "mst_unknown" and the other with a | |
642 | known type. So if the one we are leaving alone has type mst_unknown, | |
643 | overwrite its type with the type from the one we are compacting out. */ | |
644 | ||
645 | static int | |
646 | compact_minimal_symbols (msymbol, mcount) | |
647 | struct minimal_symbol *msymbol; | |
648 | int mcount; | |
649 | { | |
650 | struct minimal_symbol *copyfrom; | |
651 | struct minimal_symbol *copyto; | |
652 | ||
653 | if (mcount > 0) | |
654 | { | |
655 | copyfrom = copyto = msymbol; | |
656 | while (copyfrom < msymbol + mcount - 1) | |
657 | { | |
2e4964ad FF |
658 | if (SYMBOL_VALUE_ADDRESS (copyfrom) == |
659 | SYMBOL_VALUE_ADDRESS ((copyfrom + 1)) && | |
660 | (STREQ (SYMBOL_NAME (copyfrom), SYMBOL_NAME ((copyfrom + 1))))) | |
1ab3bf1b | 661 | { |
2e4964ad | 662 | if (MSYMBOL_TYPE((copyfrom + 1)) == mst_unknown) |
1ab3bf1b | 663 | { |
2e4964ad | 664 | MSYMBOL_TYPE ((copyfrom + 1)) = MSYMBOL_TYPE (copyfrom); |
1ab3bf1b JG |
665 | } |
666 | copyfrom++; | |
667 | } | |
668 | else | |
669 | { | |
670 | *copyto++ = *copyfrom++; | |
671 | } | |
672 | } | |
673 | *copyto++ = *copyfrom++; | |
674 | mcount = copyto - msymbol; | |
675 | } | |
676 | return (mcount); | |
677 | } | |
678 | ||
2e4964ad FF |
679 | /* Add the minimal symbols in the existing bunches to the objfile's official |
680 | minimal symbol table. In most cases there is no minimal symbol table yet | |
681 | for this objfile, and the existing bunches are used to create one. Once | |
682 | in a while (for shared libraries for example), we add symbols (e.g. common | |
683 | symbols) to an existing objfile. | |
684 | ||
685 | Because of the way minimal symbols are collected, we generally have no way | |
686 | of knowing what source language applies to any particular minimal symbol. | |
687 | Specifically, we have no way of knowing if the minimal symbol comes from a | |
688 | C++ compilation unit or not. So for the sake of supporting cached | |
689 | demangled C++ names, we have no choice but to try and demangle each new one | |
690 | that comes in. If the demangling succeeds, then we assume it is a C++ | |
691 | symbol and set the symbol's language and demangled name fields | |
692 | appropriately. Note that in order to avoid unnecessary demanglings, and | |
693 | allocating obstack space that subsequently can't be freed for the demangled | |
694 | names, we mark all newly added symbols with language_auto. After | |
695 | compaction of the minimal symbols, we go back and scan the entire minimal | |
696 | symbol table looking for these new symbols. For each new symbol we attempt | |
697 | to demangle it, and if successful, record it as a language_cplus symbol | |
698 | and cache the demangled form on the symbol obstack. Symbols which don't | |
699 | demangle are marked as language_unknown symbols, which inhibits future | |
700 | attempts to demangle them if we later add more minimal symbols. */ | |
1ab3bf1b JG |
701 | |
702 | void | |
021959e2 | 703 | install_minimal_symbols (objfile) |
1ab3bf1b JG |
704 | struct objfile *objfile; |
705 | { | |
706 | register int bindex; | |
707 | register int mcount; | |
708 | register struct msym_bunch *bunch; | |
709 | register struct minimal_symbol *msymbols; | |
021959e2 | 710 | int alloc_count; |
de9bef49 | 711 | register char leading_char; |
1ab3bf1b JG |
712 | |
713 | if (msym_count > 0) | |
714 | { | |
021959e2 JG |
715 | /* Allocate enough space in the obstack, into which we will gather the |
716 | bunches of new and existing minimal symbols, sort them, and then | |
717 | compact out the duplicate entries. Once we have a final table, | |
718 | we will give back the excess space. */ | |
719 | ||
720 | alloc_count = msym_count + objfile->minimal_symbol_count + 1; | |
721 | obstack_blank (&objfile->symbol_obstack, | |
722 | alloc_count * sizeof (struct minimal_symbol)); | |
1ab3bf1b | 723 | msymbols = (struct minimal_symbol *) |
021959e2 JG |
724 | obstack_base (&objfile->symbol_obstack); |
725 | ||
726 | /* Copy in the existing minimal symbols, if there are any. */ | |
727 | ||
728 | if (objfile->minimal_symbol_count) | |
729 | memcpy ((char *)msymbols, (char *)objfile->msymbols, | |
730 | objfile->minimal_symbol_count * sizeof (struct minimal_symbol)); | |
731 | ||
1ab3bf1b JG |
732 | /* Walk through the list of minimal symbol bunches, adding each symbol |
733 | to the new contiguous array of symbols. Note that we start with the | |
734 | current, possibly partially filled bunch (thus we use the current | |
735 | msym_bunch_index for the first bunch we copy over), and thereafter | |
736 | each bunch is full. */ | |
737 | ||
021959e2 | 738 | mcount = objfile->minimal_symbol_count; |
02b40a19 | 739 | leading_char = get_symbol_leading_char (objfile->obfd); |
021959e2 | 740 | |
1ab3bf1b JG |
741 | for (bunch = msym_bunch; bunch != NULL; bunch = bunch -> next) |
742 | { | |
743 | for (bindex = 0; bindex < msym_bunch_index; bindex++, mcount++) | |
744 | { | |
745 | msymbols[mcount] = bunch -> contents[bindex]; | |
2e4964ad FF |
746 | SYMBOL_LANGUAGE (&msymbols[mcount]) = language_auto; |
747 | if (SYMBOL_NAME (&msymbols[mcount])[0] == leading_char) | |
1ab3bf1b | 748 | { |
2e4964ad | 749 | SYMBOL_NAME(&msymbols[mcount])++; |
1ab3bf1b | 750 | } |
1ab3bf1b JG |
751 | } |
752 | msym_bunch_index = BUNCH_SIZE; | |
753 | } | |
021959e2 | 754 | |
1ab3bf1b JG |
755 | /* Sort the minimal symbols by address. */ |
756 | ||
757 | qsort (msymbols, mcount, sizeof (struct minimal_symbol), | |
758 | compare_minimal_symbols); | |
759 | ||
021959e2 JG |
760 | /* Compact out any duplicates, and free up whatever space we are |
761 | no longer using. */ | |
1ab3bf1b JG |
762 | |
763 | mcount = compact_minimal_symbols (msymbols, mcount); | |
1ab3bf1b | 764 | |
021959e2 JG |
765 | obstack_blank (&objfile->symbol_obstack, |
766 | (mcount + 1 - alloc_count) * sizeof (struct minimal_symbol)); | |
767 | msymbols = (struct minimal_symbol *) | |
768 | obstack_finish (&objfile->symbol_obstack); | |
769 | ||
2e4964ad FF |
770 | /* We also terminate the minimal symbol table with a "null symbol", |
771 | which is *not* included in the size of the table. This makes it | |
772 | easier to find the end of the table when we are handed a pointer | |
773 | to some symbol in the middle of it. Zero out the fields in the | |
774 | "null symbol" allocated at the end of the array. Note that the | |
775 | symbol count does *not* include this null symbol, which is why it | |
776 | is indexed by mcount and not mcount-1. */ | |
777 | ||
778 | SYMBOL_NAME (&msymbols[mcount]) = NULL; | |
779 | SYMBOL_VALUE_ADDRESS (&msymbols[mcount]) = 0; | |
780 | MSYMBOL_INFO (&msymbols[mcount]) = NULL; | |
781 | MSYMBOL_TYPE (&msymbols[mcount]) = mst_unknown; | |
7532cf10 | 782 | SYMBOL_INIT_LANGUAGE_SPECIFIC (&msymbols[mcount], language_unknown); |
021959e2 JG |
783 | |
784 | /* Attach the minimal symbol table to the specified objfile. | |
785 | The strings themselves are also located in the symbol_obstack | |
786 | of this objfile. */ | |
787 | ||
788 | objfile -> minimal_symbol_count = mcount; | |
789 | objfile -> msymbols = msymbols; | |
2e4964ad FF |
790 | |
791 | /* Now walk through all the minimal symbols, selecting the newly added | |
792 | ones and attempting to cache their C++ demangled names. */ | |
793 | ||
794 | for ( ; mcount-- > 0 ; msymbols++) | |
795 | { | |
7532cf10 | 796 | SYMBOL_INIT_DEMANGLED_NAME (msymbols, &objfile->symbol_obstack); |
2e4964ad | 797 | } |
1ab3bf1b JG |
798 | } |
799 | } | |
800 | ||
3a470454 JK |
801 | /* Sort all the minimal symbols in OBJFILE. */ |
802 | ||
803 | void | |
804 | msymbols_sort (objfile) | |
805 | struct objfile *objfile; | |
806 | { | |
807 | qsort (objfile->msymbols, objfile->minimal_symbol_count, | |
808 | sizeof (struct minimal_symbol), compare_minimal_symbols); | |
809 | } | |
810 | ||
2fe3b329 PS |
811 | /* Check if PC is in a shared library trampoline code stub. |
812 | Return minimal symbol for the trampoline entry or NULL if PC is not | |
813 | in a trampoline code stub. */ | |
814 | ||
815 | struct minimal_symbol * | |
816 | lookup_solib_trampoline_symbol_by_pc (pc) | |
817 | CORE_ADDR pc; | |
818 | { | |
819 | struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (pc); | |
820 | ||
821 | if (msymbol != NULL && MSYMBOL_TYPE (msymbol) == mst_solib_trampoline) | |
822 | return msymbol; | |
823 | return NULL; | |
824 | } | |
825 | ||
826 | /* If PC is in a shared library trampoline code stub, return the | |
827 | address of the `real' function belonging to the stub. | |
828 | Return 0 if PC is not in a trampoline code stub or if the real | |
829 | function is not found in the minimal symbol table. | |
830 | ||
831 | We may fail to find the right function if a function with the | |
832 | same name is defined in more than one shared library, but this | |
833 | is considered bad programming style. We could return 0 if we find | |
834 | a duplicate function in case this matters someday. */ | |
835 | ||
836 | CORE_ADDR | |
837 | find_solib_trampoline_target (pc) | |
838 | CORE_ADDR pc; | |
839 | { | |
840 | struct objfile *objfile; | |
841 | struct minimal_symbol *msymbol; | |
842 | struct minimal_symbol *tsymbol = lookup_solib_trampoline_symbol_by_pc (pc); | |
843 | ||
844 | if (tsymbol != NULL) | |
845 | { | |
846 | ALL_MSYMBOLS (objfile, msymbol) | |
847 | { | |
848 | if (MSYMBOL_TYPE (msymbol) == mst_text | |
849 | && STREQ (SYMBOL_NAME (msymbol), SYMBOL_NAME (tsymbol))) | |
850 | return SYMBOL_VALUE_ADDRESS (msymbol); | |
851 | } | |
852 | } | |
853 | return 0; | |
854 | } | |
855 |