1 /* GDB routines for manipulating the minimal symbol tables.
2 Copyright 1992, 1993, 1994, 1996, 1996 Free Software Foundation, Inc.
3 Contributed by Cygnus Support, using pieces from other GDB modules.
5 This file is part of GDB.
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.
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.
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
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
22 /* This file contains support routines for creating, manipulating, and
23 destroying minimal symbol tables.
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.
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.
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. */
41 #include "gdb_string.h"
47 #include "gdb-stabs.h"
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
53 #define BUNCH_SIZE 127
57 struct msym_bunch
*next
;
58 struct minimal_symbol contents
[BUNCH_SIZE
];
61 /* Bunch currently being filled up.
62 The next field points to chain of filled bunches. */
64 static struct msym_bunch
*msym_bunch
;
66 /* Number of slots filled in current bunch. */
68 static int msym_bunch_index
;
70 /* Total number of minimal symbols recorded so far for the objfile. */
72 static int msym_count
;
74 /* Prototypes for local functions. */
77 compare_minimal_symbols
PARAMS ((const void *, const void *));
80 compact_minimal_symbols
PARAMS ((struct minimal_symbol
*, int));
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.
88 Note: One instance where there may be duplicate minimal symbols with
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). */
93 struct minimal_symbol
*
94 lookup_minimal_symbol (name
, sfile
, objf
)
95 register const char *name
;
99 struct objfile
*objfile
;
100 struct minimal_symbol
*msymbol
;
101 struct minimal_symbol
*found_symbol
= NULL
;
102 struct minimal_symbol
*found_file_symbol
= NULL
;
103 struct minimal_symbol
*trampoline_symbol
= NULL
;
105 #ifdef SOFUN_ADDRESS_MAYBE_MISSING
108 char *p
= strrchr (sfile
, '/');
114 for (objfile
= object_files
;
115 objfile
!= NULL
&& found_symbol
== NULL
;
116 objfile
= objfile
-> next
)
118 if (objf
== NULL
|| objf
== objfile
)
120 for (msymbol
= objfile
-> msymbols
;
121 msymbol
!= NULL
&& SYMBOL_NAME (msymbol
) != NULL
&&
122 found_symbol
== NULL
;
125 if (SYMBOL_MATCHES_NAME (msymbol
, name
))
127 switch (MSYMBOL_TYPE (msymbol
))
132 #ifdef SOFUN_ADDRESS_MAYBE_MISSING
133 if (sfile
== NULL
|| STREQ (msymbol
->filename
, sfile
))
134 found_file_symbol
= msymbol
;
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
141 found_file_symbol
= msymbol
;
145 case mst_solib_trampoline
:
147 /* If a trampoline symbol is found, we prefer to
148 keep looking for the *real* symbol. If the
149 actual symbol is not found, then we'll use the
151 if (trampoline_symbol
== NULL
)
152 trampoline_symbol
= msymbol
;
157 found_symbol
= msymbol
;
164 /* External symbols are best. */
168 /* File-local symbols are next best. */
169 if (found_file_symbol
)
170 return found_file_symbol
;
172 /* Symbols for shared library trampolines are next best. */
173 if (trampoline_symbol
)
174 return trampoline_symbol
;
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.
187 struct minimal_symbol
*
188 lookup_minimal_symbol_text (name
, sfile
, objf
)
189 register const char *name
;
191 struct objfile
*objf
;
193 struct objfile
*objfile
;
194 struct minimal_symbol
*msymbol
;
195 struct minimal_symbol
*found_symbol
= NULL
;
196 struct minimal_symbol
*found_file_symbol
= NULL
;
198 #ifdef SOFUN_ADDRESS_MAYBE_MISSING
201 char *p
= strrchr (sfile
, '/');
207 for (objfile
= object_files
;
208 objfile
!= NULL
&& found_symbol
== NULL
;
209 objfile
= objfile
-> next
)
211 if (objf
== NULL
|| objf
== objfile
)
213 for (msymbol
= objfile
-> msymbols
;
214 msymbol
!= NULL
&& SYMBOL_NAME (msymbol
) != NULL
&&
215 found_symbol
== NULL
;
218 if (SYMBOL_MATCHES_NAME (msymbol
, name
) &&
219 (MSYMBOL_TYPE (msymbol
) == mst_text
||
220 MSYMBOL_TYPE (msymbol
) == mst_file_text
))
222 switch (MSYMBOL_TYPE (msymbol
))
225 #ifdef SOFUN_ADDRESS_MAYBE_MISSING
226 if (sfile
== NULL
|| STREQ (msymbol
->filename
, sfile
))
227 found_file_symbol
= msymbol
;
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
234 found_file_symbol
= msymbol
;
238 found_symbol
= msymbol
;
245 /* External symbols are best. */
249 /* File-local symbols are next best. */
250 if (found_file_symbol
)
251 return found_file_symbol
;
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.
264 struct minimal_symbol
*
265 lookup_minimal_symbol_solib_trampoline (name
, sfile
, objf
)
266 register const char *name
;
268 struct objfile
*objf
;
270 struct objfile
*objfile
;
271 struct minimal_symbol
*msymbol
;
272 struct minimal_symbol
*found_symbol
= NULL
;
274 #ifdef SOFUN_ADDRESS_MAYBE_MISSING
277 char *p
= strrchr (sfile
, '/');
283 for (objfile
= object_files
;
284 objfile
!= NULL
&& found_symbol
== NULL
;
285 objfile
= objfile
-> next
)
287 if (objf
== NULL
|| objf
== objfile
)
289 for (msymbol
= objfile
-> msymbols
;
290 msymbol
!= NULL
&& SYMBOL_NAME (msymbol
) != NULL
&&
291 found_symbol
== NULL
;
294 if (SYMBOL_MATCHES_NAME (msymbol
, name
) &&
295 MSYMBOL_TYPE (msymbol
) == mst_solib_trampoline
)
305 /* Search through the minimal symbol table for each objfile and find
306 the symbol whose address is the largest address that is still less
307 than or equal to PC, and matches SECTION (if non-null). Returns a
308 pointer to the minimal symbol if such a symbol is found, or NULL if
309 PC is not in a suitable range. Note that we need to look through
310 ALL the minimal symbol tables before deciding on the symbol that
311 comes closest to the specified PC. This is because objfiles can
312 overlap, for example objfile A has .text at 0x100 and .data at
313 0x40000 and objfile B has .text at 0x234 and .data at 0x40048. */
315 struct minimal_symbol
*
316 lookup_minimal_symbol_by_pc_section (pc
, section
)
323 struct objfile
*objfile
;
324 struct minimal_symbol
*msymbol
;
325 struct minimal_symbol
*best_symbol
= NULL
;
327 /* pc has to be in a known section. This ensures that anything beyond
328 the end of the last segment doesn't appear to be part of the last
329 function in the last segment. */
330 if (find_pc_section (pc
) == NULL
)
333 for (objfile
= object_files
;
335 objfile
= objfile
-> next
)
337 /* If this objfile has a minimal symbol table, go search it using
338 a binary search. Note that a minimal symbol table always consists
339 of at least two symbols, a "real" symbol and the terminating
340 "null symbol". If there are no real symbols, then there is no
341 minimal symbol table at all. */
343 if ((msymbol
= objfile
-> msymbols
) != NULL
)
346 hi
= objfile
-> minimal_symbol_count
- 1;
348 /* This code assumes that the minimal symbols are sorted by
349 ascending address values. If the pc value is greater than or
350 equal to the first symbol's address, then some symbol in this
351 minimal symbol table is a suitable candidate for being the
352 "best" symbol. This includes the last real symbol, for cases
353 where the pc value is larger than any address in this vector.
355 By iterating until the address associated with the current
356 hi index (the endpoint of the test interval) is less than
357 or equal to the desired pc value, we accomplish two things:
358 (1) the case where the pc value is larger than any minimal
359 symbol address is trivially solved, (2) the address associated
360 with the hi index is always the one we want when the interation
361 terminates. In essence, we are iterating the test interval
362 down until the pc value is pushed out of it from the high end.
364 Warning: this code is trickier than it would appear at first. */
366 /* Should also require that pc is <= end of objfile. FIXME! */
367 if (pc
>= SYMBOL_VALUE_ADDRESS (&msymbol
[lo
]))
369 while (SYMBOL_VALUE_ADDRESS (&msymbol
[hi
]) > pc
)
371 /* pc is still strictly less than highest address */
372 /* Note "new" will always be >= lo */
374 if ((SYMBOL_VALUE_ADDRESS (&msymbol
[new]) >= pc
) ||
385 /* If we have multiple symbols at the same address, we want
386 hi to point to the last one. That way we can find the
387 right symbol if it has an index greater than hi. */
388 while (hi
< objfile
-> minimal_symbol_count
- 1
389 && (SYMBOL_VALUE_ADDRESS (&msymbol
[hi
])
390 == SYMBOL_VALUE_ADDRESS (&msymbol
[hi
+1])))
393 /* The minimal symbol indexed by hi now is the best one in this
394 objfile's minimal symbol table. See if it is the best one
397 /* Skip any absolute symbols. This is apparently what adb
398 and dbx do, and is needed for the CM-5. There are two
399 known possible problems: (1) on ELF, apparently end, edata,
400 etc. are absolute. Not sure ignoring them here is a big
401 deal, but if we want to use them, the fix would go in
402 elfread.c. (2) I think shared library entry points on the
403 NeXT are absolute. If we want special handling for this
404 it probably should be triggered by a special
405 mst_abs_or_lib or some such. */
407 && msymbol
[hi
].type
== mst_abs
)
410 /* If "section" specified, skip any symbol from wrong section */
411 /* This is the new code that distinguishes it from the old function */
414 && SYMBOL_BFD_SECTION (&msymbol
[hi
]) != section
)
418 && ((best_symbol
== NULL
) ||
419 (SYMBOL_VALUE_ADDRESS (best_symbol
) <
420 SYMBOL_VALUE_ADDRESS (&msymbol
[hi
]))))
422 best_symbol
= &msymbol
[hi
];
427 return (best_symbol
);
430 /* Backward compatibility: search through the minimal symbol table
431 for a matching PC (no section given) */
433 struct minimal_symbol
*
434 lookup_minimal_symbol_by_pc (pc
)
437 return lookup_minimal_symbol_by_pc_section (pc
, find_pc_mapped_section (pc
));
440 #ifdef SOFUN_ADDRESS_MAYBE_MISSING
442 find_stab_function_addr (namestring
, pst
, objfile
)
444 struct partial_symtab
*pst
;
445 struct objfile
*objfile
;
447 struct minimal_symbol
*msym
;
451 p
= strchr (namestring
, ':');
456 strncpy (p
, namestring
, n
);
459 msym
= lookup_minimal_symbol (p
, pst
->filename
, objfile
);
460 return msym
== NULL
? 0 : SYMBOL_VALUE_ADDRESS (msym
);
462 #endif /* SOFUN_ADDRESS_MAYBE_MISSING */
465 /* Return leading symbol character for a BFD. If BFD is NULL,
466 return the leading symbol character from the main objfile. */
468 static int get_symbol_leading_char
PARAMS ((bfd
*));
471 get_symbol_leading_char (abfd
)
475 return bfd_get_symbol_leading_char (abfd
);
476 if (symfile_objfile
!= NULL
&& symfile_objfile
->obfd
!= NULL
)
477 return bfd_get_symbol_leading_char (symfile_objfile
->obfd
);
481 /* Prepare to start collecting minimal symbols. Note that presetting
482 msym_bunch_index to BUNCH_SIZE causes the first call to save a minimal
483 symbol to allocate the memory for the first bunch. */
486 init_minimal_symbol_collection ()
490 msym_bunch_index
= BUNCH_SIZE
;
494 prim_record_minimal_symbol (name
, address
, ms_type
, objfile
)
497 enum minimal_symbol_type ms_type
;
498 struct objfile
*objfile
;
506 case mst_solib_trampoline
:
507 section
= SECT_OFF_TEXT
;
511 section
= SECT_OFF_DATA
;
515 section
= SECT_OFF_BSS
;
521 prim_record_minimal_symbol_and_info (name
, address
, ms_type
,
522 NULL
, section
, NULL
, objfile
);
525 /* Record a minimal symbol in the msym bunches. Returns the symbol
528 struct minimal_symbol
*
529 prim_record_minimal_symbol_and_info (name
, address
, ms_type
, info
, section
,
530 bfd_section
, objfile
)
533 enum minimal_symbol_type ms_type
;
536 asection
*bfd_section
;
537 struct objfile
*objfile
;
539 register struct msym_bunch
*new;
540 register struct minimal_symbol
*msymbol
;
542 if (ms_type
== mst_file_text
)
544 /* Don't put gcc_compiled, __gnu_compiled_cplus, and friends into
545 the minimal symbols, because if there is also another symbol
546 at the same address (e.g. the first function of the file),
547 lookup_minimal_symbol_by_pc would have no way of getting the
550 && (strcmp (name
, GCC_COMPILED_FLAG_SYMBOL
) == 0
551 || strcmp (name
, GCC2_COMPILED_FLAG_SYMBOL
) == 0))
555 const char *tempstring
= name
;
556 if (tempstring
[0] == get_symbol_leading_char (objfile
->obfd
))
558 if (STREQN (tempstring
, "__gnu_compiled", 14))
563 if (msym_bunch_index
== BUNCH_SIZE
)
565 new = (struct msym_bunch
*) xmalloc (sizeof (struct msym_bunch
));
566 msym_bunch_index
= 0;
567 new -> next
= msym_bunch
;
570 msymbol
= &msym_bunch
-> contents
[msym_bunch_index
];
571 SYMBOL_NAME (msymbol
) = obsavestring ((char *) name
, strlen (name
),
572 &objfile
->symbol_obstack
);
573 SYMBOL_INIT_LANGUAGE_SPECIFIC (msymbol
, language_unknown
);
574 SYMBOL_VALUE_ADDRESS (msymbol
) = address
;
575 SYMBOL_SECTION (msymbol
) = section
;
576 SYMBOL_BFD_SECTION (msymbol
) = bfd_section
;
578 MSYMBOL_TYPE (msymbol
) = ms_type
;
579 /* FIXME: This info, if it remains, needs its own field. */
580 MSYMBOL_INFO (msymbol
) = info
; /* FIXME! */
583 OBJSTAT (objfile
, n_minsyms
++);
587 /* Compare two minimal symbols by address and return a signed result based
588 on unsigned comparisons, so that we sort into unsigned numeric order.
589 Within groups with the same address, sort by name. */
592 compare_minimal_symbols (fn1p
, fn2p
)
596 register const struct minimal_symbol
*fn1
;
597 register const struct minimal_symbol
*fn2
;
599 fn1
= (const struct minimal_symbol
*) fn1p
;
600 fn2
= (const struct minimal_symbol
*) fn2p
;
602 if (SYMBOL_VALUE_ADDRESS (fn1
) < SYMBOL_VALUE_ADDRESS (fn2
))
604 return (-1); /* addr 1 is less than addr 2 */
606 else if (SYMBOL_VALUE_ADDRESS (fn1
) > SYMBOL_VALUE_ADDRESS (fn2
))
608 return (1); /* addr 1 is greater than addr 2 */
610 else /* addrs are equal: sort by name */
612 char *name1
= SYMBOL_NAME (fn1
);
613 char *name2
= SYMBOL_NAME (fn2
);
615 if (name1
&& name2
) /* both have names */
616 return strcmp (name1
, name2
);
618 return 1; /* fn1 has no name, so it is "less" */
619 else if (name1
) /* fn2 has no name, so it is "less" */
622 return (0); /* neither has a name, so they're equal. */
626 /* Discard the currently collected minimal symbols, if any. If we wish
627 to save them for later use, we must have already copied them somewhere
628 else before calling this function.
630 FIXME: We could allocate the minimal symbol bunches on their own
631 obstack and then simply blow the obstack away when we are done with
632 it. Is it worth the extra trouble though? */
636 discard_minimal_symbols (foo
)
639 register struct msym_bunch
*next
;
641 while (msym_bunch
!= NULL
)
643 next
= msym_bunch
-> next
;
644 free ((PTR
)msym_bunch
);
649 /* Compact duplicate entries out of a minimal symbol table by walking
650 through the table and compacting out entries with duplicate addresses
651 and matching names. Return the number of entries remaining.
653 On entry, the table resides between msymbol[0] and msymbol[mcount].
654 On exit, it resides between msymbol[0] and msymbol[result_count].
656 When files contain multiple sources of symbol information, it is
657 possible for the minimal symbol table to contain many duplicate entries.
658 As an example, SVR4 systems use ELF formatted object files, which
659 usually contain at least two different types of symbol tables (a
660 standard ELF one and a smaller dynamic linking table), as well as
661 DWARF debugging information for files compiled with -g.
663 Without compacting, the minimal symbol table for gdb itself contains
664 over a 1000 duplicates, about a third of the total table size. Aside
665 from the potential trap of not noticing that two successive entries
666 identify the same location, this duplication impacts the time required
667 to linearly scan the table, which is done in a number of places. So we
668 just do one linear scan here and toss out the duplicates.
670 Note that we are not concerned here about recovering the space that
671 is potentially freed up, because the strings themselves are allocated
672 on the symbol_obstack, and will get automatically freed when the symbol
673 table is freed. The caller can free up the unused minimal symbols at
674 the end of the compacted region if their allocation strategy allows it.
676 Also note we only go up to the next to last entry within the loop
677 and then copy the last entry explicitly after the loop terminates.
679 Since the different sources of information for each symbol may
680 have different levels of "completeness", we may have duplicates
681 that have one entry with type "mst_unknown" and the other with a
682 known type. So if the one we are leaving alone has type mst_unknown,
683 overwrite its type with the type from the one we are compacting out. */
686 compact_minimal_symbols (msymbol
, mcount
)
687 struct minimal_symbol
*msymbol
;
690 struct minimal_symbol
*copyfrom
;
691 struct minimal_symbol
*copyto
;
695 copyfrom
= copyto
= msymbol
;
696 while (copyfrom
< msymbol
+ mcount
- 1)
698 if (SYMBOL_VALUE_ADDRESS (copyfrom
) ==
699 SYMBOL_VALUE_ADDRESS ((copyfrom
+ 1)) &&
700 (STREQ (SYMBOL_NAME (copyfrom
), SYMBOL_NAME ((copyfrom
+ 1)))))
702 if (MSYMBOL_TYPE((copyfrom
+ 1)) == mst_unknown
)
704 MSYMBOL_TYPE ((copyfrom
+ 1)) = MSYMBOL_TYPE (copyfrom
);
710 *copyto
++ = *copyfrom
++;
713 *copyto
++ = *copyfrom
++;
714 mcount
= copyto
- msymbol
;
719 /* Add the minimal symbols in the existing bunches to the objfile's official
720 minimal symbol table. In most cases there is no minimal symbol table yet
721 for this objfile, and the existing bunches are used to create one. Once
722 in a while (for shared libraries for example), we add symbols (e.g. common
723 symbols) to an existing objfile.
725 Because of the way minimal symbols are collected, we generally have no way
726 of knowing what source language applies to any particular minimal symbol.
727 Specifically, we have no way of knowing if the minimal symbol comes from a
728 C++ compilation unit or not. So for the sake of supporting cached
729 demangled C++ names, we have no choice but to try and demangle each new one
730 that comes in. If the demangling succeeds, then we assume it is a C++
731 symbol and set the symbol's language and demangled name fields
732 appropriately. Note that in order to avoid unnecessary demanglings, and
733 allocating obstack space that subsequently can't be freed for the demangled
734 names, we mark all newly added symbols with language_auto. After
735 compaction of the minimal symbols, we go back and scan the entire minimal
736 symbol table looking for these new symbols. For each new symbol we attempt
737 to demangle it, and if successful, record it as a language_cplus symbol
738 and cache the demangled form on the symbol obstack. Symbols which don't
739 demangle are marked as language_unknown symbols, which inhibits future
740 attempts to demangle them if we later add more minimal symbols. */
743 install_minimal_symbols (objfile
)
744 struct objfile
*objfile
;
748 register struct msym_bunch
*bunch
;
749 register struct minimal_symbol
*msymbols
;
751 register char leading_char
;
755 /* Allocate enough space in the obstack, into which we will gather the
756 bunches of new and existing minimal symbols, sort them, and then
757 compact out the duplicate entries. Once we have a final table,
758 we will give back the excess space. */
760 alloc_count
= msym_count
+ objfile
->minimal_symbol_count
+ 1;
761 obstack_blank (&objfile
->symbol_obstack
,
762 alloc_count
* sizeof (struct minimal_symbol
));
763 msymbols
= (struct minimal_symbol
*)
764 obstack_base (&objfile
->symbol_obstack
);
766 /* Copy in the existing minimal symbols, if there are any. */
768 if (objfile
->minimal_symbol_count
)
769 memcpy ((char *)msymbols
, (char *)objfile
->msymbols
,
770 objfile
->minimal_symbol_count
* sizeof (struct minimal_symbol
));
772 /* Walk through the list of minimal symbol bunches, adding each symbol
773 to the new contiguous array of symbols. Note that we start with the
774 current, possibly partially filled bunch (thus we use the current
775 msym_bunch_index for the first bunch we copy over), and thereafter
776 each bunch is full. */
778 mcount
= objfile
->minimal_symbol_count
;
779 leading_char
= get_symbol_leading_char (objfile
->obfd
);
781 for (bunch
= msym_bunch
; bunch
!= NULL
; bunch
= bunch
-> next
)
783 for (bindex
= 0; bindex
< msym_bunch_index
; bindex
++, mcount
++)
785 msymbols
[mcount
] = bunch
-> contents
[bindex
];
786 SYMBOL_LANGUAGE (&msymbols
[mcount
]) = language_auto
;
787 if (SYMBOL_NAME (&msymbols
[mcount
])[0] == leading_char
)
789 SYMBOL_NAME(&msymbols
[mcount
])++;
792 msym_bunch_index
= BUNCH_SIZE
;
795 /* Sort the minimal symbols by address. */
797 qsort (msymbols
, mcount
, sizeof (struct minimal_symbol
),
798 compare_minimal_symbols
);
800 /* Compact out any duplicates, and free up whatever space we are
803 mcount
= compact_minimal_symbols (msymbols
, mcount
);
805 obstack_blank (&objfile
->symbol_obstack
,
806 (mcount
+ 1 - alloc_count
) * sizeof (struct minimal_symbol
));
807 msymbols
= (struct minimal_symbol
*)
808 obstack_finish (&objfile
->symbol_obstack
);
810 /* We also terminate the minimal symbol table with a "null symbol",
811 which is *not* included in the size of the table. This makes it
812 easier to find the end of the table when we are handed a pointer
813 to some symbol in the middle of it. Zero out the fields in the
814 "null symbol" allocated at the end of the array. Note that the
815 symbol count does *not* include this null symbol, which is why it
816 is indexed by mcount and not mcount-1. */
818 SYMBOL_NAME (&msymbols
[mcount
]) = NULL
;
819 SYMBOL_VALUE_ADDRESS (&msymbols
[mcount
]) = 0;
820 MSYMBOL_INFO (&msymbols
[mcount
]) = NULL
;
821 MSYMBOL_TYPE (&msymbols
[mcount
]) = mst_unknown
;
822 SYMBOL_INIT_LANGUAGE_SPECIFIC (&msymbols
[mcount
], language_unknown
);
824 /* Attach the minimal symbol table to the specified objfile.
825 The strings themselves are also located in the symbol_obstack
828 objfile
-> minimal_symbol_count
= mcount
;
829 objfile
-> msymbols
= msymbols
;
831 /* Now walk through all the minimal symbols, selecting the newly added
832 ones and attempting to cache their C++ demangled names. */
834 for ( ; mcount
-- > 0 ; msymbols
++)
836 SYMBOL_INIT_DEMANGLED_NAME (msymbols
, &objfile
->symbol_obstack
);
841 /* Sort all the minimal symbols in OBJFILE. */
844 msymbols_sort (objfile
)
845 struct objfile
*objfile
;
847 qsort (objfile
->msymbols
, objfile
->minimal_symbol_count
,
848 sizeof (struct minimal_symbol
), compare_minimal_symbols
);
851 /* Check if PC is in a shared library trampoline code stub.
852 Return minimal symbol for the trampoline entry or NULL if PC is not
853 in a trampoline code stub. */
855 struct minimal_symbol
*
856 lookup_solib_trampoline_symbol_by_pc (pc
)
859 struct minimal_symbol
*msymbol
= lookup_minimal_symbol_by_pc (pc
);
861 if (msymbol
!= NULL
&& MSYMBOL_TYPE (msymbol
) == mst_solib_trampoline
)
866 /* If PC is in a shared library trampoline code stub, return the
867 address of the `real' function belonging to the stub.
868 Return 0 if PC is not in a trampoline code stub or if the real
869 function is not found in the minimal symbol table.
871 We may fail to find the right function if a function with the
872 same name is defined in more than one shared library, but this
873 is considered bad programming style. We could return 0 if we find
874 a duplicate function in case this matters someday. */
877 find_solib_trampoline_target (pc
)
880 struct objfile
*objfile
;
881 struct minimal_symbol
*msymbol
;
882 struct minimal_symbol
*tsymbol
= lookup_solib_trampoline_symbol_by_pc (pc
);
886 ALL_MSYMBOLS (objfile
, msymbol
)
888 if (MSYMBOL_TYPE (msymbol
) == mst_text
889 && STREQ (SYMBOL_NAME (msymbol
), SYMBOL_NAME (tsymbol
)))
890 return SYMBOL_VALUE_ADDRESS (msymbol
);