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 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
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. */
314 struct minimal_symbol *
315 lookup_minimal_symbol_by_pc (pc)
316 register CORE_ADDR pc;
321 register struct objfile *objfile;
322 register struct minimal_symbol *msymbol;
323 register struct minimal_symbol *best_symbol = NULL;
325 for (objfile = object_files;
327 objfile = objfile -> next)
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. */
335 if ((msymbol = objfile -> msymbols) != NULL)
338 hi = objfile -> minimal_symbol_count - 1;
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.
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.
356 Warning: this code is trickier than it would appear at first. */
358 /* Should also requires that pc is <= end of objfile. FIXME! */
359 if (pc >= SYMBOL_VALUE_ADDRESS (&msymbol[lo]))
361 while (SYMBOL_VALUE_ADDRESS (&msymbol[hi]) > pc)
363 /* pc is still strictly less than highest address */
364 /* Note "new" will always be >= lo */
366 if ((SYMBOL_VALUE_ADDRESS (&msymbol[new]) >= pc) ||
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])))
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
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. */
399 && msymbol[hi].type == mst_abs)
403 && ((best_symbol == NULL) ||
404 (SYMBOL_VALUE_ADDRESS (best_symbol) <
405 SYMBOL_VALUE_ADDRESS (&msymbol[hi]))))
407 best_symbol = &msymbol[hi];
412 return (best_symbol);
415 #ifdef SOFUN_ADDRESS_MAYBE_MISSING
417 find_stab_function_addr (namestring, pst, objfile)
419 struct partial_symtab *pst;
420 struct objfile *objfile;
422 struct minimal_symbol *msym;
426 p = strchr (namestring, ':');
431 strncpy (p, namestring, n);
434 msym = lookup_minimal_symbol (p, pst->filename, objfile);
435 return msym == NULL ? 0 : SYMBOL_VALUE_ADDRESS (msym);
437 #endif /* SOFUN_ADDRESS_MAYBE_MISSING */
440 /* Return leading symbol character for a BFD. If BFD is NULL,
441 return the leading symbol character from the main objfile. */
443 static int get_symbol_leading_char PARAMS ((bfd *));
446 get_symbol_leading_char (abfd)
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);
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. */
461 init_minimal_symbol_collection ()
465 msym_bunch_index = BUNCH_SIZE;
469 prim_record_minimal_symbol (name, address, ms_type, objfile)
472 enum minimal_symbol_type ms_type;
473 struct objfile *objfile;
481 case mst_solib_trampoline:
482 section = SECT_OFF_TEXT;
486 section = SECT_OFF_DATA;
490 section = SECT_OFF_BSS;
496 prim_record_minimal_symbol_and_info (name, address, ms_type,
497 NULL, section, objfile);
500 /* Record a minimal symbol in the msym bunches. Returns the symbol
502 struct minimal_symbol *
503 prim_record_minimal_symbol_and_info (name, address, ms_type, info, section,
507 enum minimal_symbol_type ms_type;
510 struct objfile *objfile;
512 register struct msym_bunch *new;
513 register struct minimal_symbol *msymbol;
515 if (ms_type == mst_file_text)
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
523 && (strcmp (name, GCC_COMPILED_FLAG_SYMBOL) == 0
524 || strcmp (name, GCC2_COMPILED_FLAG_SYMBOL) == 0))
528 const char *tempstring = name;
529 if (tempstring[0] == get_symbol_leading_char (objfile->obfd))
531 if (STREQN (tempstring, "__gnu_compiled", 14))
536 if (msym_bunch_index == BUNCH_SIZE)
538 new = (struct msym_bunch *) xmalloc (sizeof (struct msym_bunch));
539 msym_bunch_index = 0;
540 new -> next = msym_bunch;
543 msymbol = &msym_bunch -> contents[msym_bunch_index];
544 SYMBOL_NAME (msymbol) = (char *) name;
545 SYMBOL_INIT_LANGUAGE_SPECIFIC (msymbol, language_unknown);
546 SYMBOL_VALUE_ADDRESS (msymbol) = address;
547 SYMBOL_SECTION (msymbol) = section;
549 MSYMBOL_TYPE (msymbol) = ms_type;
550 /* FIXME: This info, if it remains, needs its own field. */
551 MSYMBOL_INFO (msymbol) = info; /* FIXME! */
554 OBJSTAT (objfile, n_minsyms++);
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. */
562 compare_minimal_symbols (fn1p, fn2p)
566 register const struct minimal_symbol *fn1;
567 register const struct minimal_symbol *fn2;
569 fn1 = (const struct minimal_symbol *) fn1p;
570 fn2 = (const struct minimal_symbol *) fn2p;
572 if (SYMBOL_VALUE_ADDRESS (fn1) < SYMBOL_VALUE_ADDRESS (fn2))
576 else if (SYMBOL_VALUE_ADDRESS (fn1) > SYMBOL_VALUE_ADDRESS (fn2))
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.
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? */
596 discard_minimal_symbols (foo)
599 register struct msym_bunch *next;
601 while (msym_bunch != NULL)
603 next = msym_bunch -> next;
604 free ((PTR)msym_bunch);
609 /* Compact duplicate entries out of a minimal symbol table by walking
610 through the table and compacting out entries with duplicate addresses
611 and matching names. Return the number of entries remaining.
613 On entry, the table resides between msymbol[0] and msymbol[mcount].
614 On exit, it resides between msymbol[0] and msymbol[result_count].
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.
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
627 to linearly scan the table, which is done in a number of places. So we
628 just do one linear scan here and toss out the duplicates.
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
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.
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.
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. */
646 compact_minimal_symbols (msymbol, mcount)
647 struct minimal_symbol *msymbol;
650 struct minimal_symbol *copyfrom;
651 struct minimal_symbol *copyto;
655 copyfrom = copyto = msymbol;
656 while (copyfrom < msymbol + mcount - 1)
658 if (SYMBOL_VALUE_ADDRESS (copyfrom) ==
659 SYMBOL_VALUE_ADDRESS ((copyfrom + 1)) &&
660 (STREQ (SYMBOL_NAME (copyfrom), SYMBOL_NAME ((copyfrom + 1)))))
662 if (MSYMBOL_TYPE((copyfrom + 1)) == mst_unknown)
664 MSYMBOL_TYPE ((copyfrom + 1)) = MSYMBOL_TYPE (copyfrom);
670 *copyto++ = *copyfrom++;
673 *copyto++ = *copyfrom++;
674 mcount = copyto - msymbol;
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.
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. */
703 install_minimal_symbols (objfile)
704 struct objfile *objfile;
708 register struct msym_bunch *bunch;
709 register struct minimal_symbol *msymbols;
711 register char leading_char;
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. */
720 alloc_count = msym_count + objfile->minimal_symbol_count + 1;
721 obstack_blank (&objfile->symbol_obstack,
722 alloc_count * sizeof (struct minimal_symbol));
723 msymbols = (struct minimal_symbol *)
724 obstack_base (&objfile->symbol_obstack);
726 /* Copy in the existing minimal symbols, if there are any. */
728 if (objfile->minimal_symbol_count)
729 memcpy ((char *)msymbols, (char *)objfile->msymbols,
730 objfile->minimal_symbol_count * sizeof (struct minimal_symbol));
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. */
738 mcount = objfile->minimal_symbol_count;
739 leading_char = get_symbol_leading_char (objfile->obfd);
741 for (bunch = msym_bunch; bunch != NULL; bunch = bunch -> next)
743 for (bindex = 0; bindex < msym_bunch_index; bindex++, mcount++)
745 msymbols[mcount] = bunch -> contents[bindex];
746 SYMBOL_LANGUAGE (&msymbols[mcount]) = language_auto;
747 if (SYMBOL_NAME (&msymbols[mcount])[0] == leading_char)
749 SYMBOL_NAME(&msymbols[mcount])++;
752 msym_bunch_index = BUNCH_SIZE;
755 /* Sort the minimal symbols by address. */
757 qsort (msymbols, mcount, sizeof (struct minimal_symbol),
758 compare_minimal_symbols);
760 /* Compact out any duplicates, and free up whatever space we are
763 mcount = compact_minimal_symbols (msymbols, mcount);
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);
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. */
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;
782 SYMBOL_INIT_LANGUAGE_SPECIFIC (&msymbols[mcount], language_unknown);
784 /* Attach the minimal symbol table to the specified objfile.
785 The strings themselves are also located in the symbol_obstack
788 objfile -> minimal_symbol_count = mcount;
789 objfile -> msymbols = msymbols;
791 /* Now walk through all the minimal symbols, selecting the newly added
792 ones and attempting to cache their C++ demangled names. */
794 for ( ; mcount-- > 0 ; msymbols++)
796 SYMBOL_INIT_DEMANGLED_NAME (msymbols, &objfile->symbol_obstack);
801 /* Sort all the minimal symbols in OBJFILE. */
804 msymbols_sort (objfile)
805 struct objfile *objfile;
807 qsort (objfile->msymbols, objfile->minimal_symbol_count,
808 sizeof (struct minimal_symbol), compare_minimal_symbols);
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. */
815 struct minimal_symbol *
816 lookup_solib_trampoline_symbol_by_pc (pc)
819 struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (pc);
821 if (msymbol != NULL && MSYMBOL_TYPE (msymbol) == mst_solib_trampoline)
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.
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. */
837 find_solib_trampoline_target (pc)
840 struct objfile *objfile;
841 struct minimal_symbol *msymbol;
842 struct minimal_symbol *tsymbol = lookup_solib_trampoline_symbol_by_pc (pc);
846 ALL_MSYMBOLS (objfile, msymbol)
848 if (MSYMBOL_TYPE (msymbol) == mst_text
849 && STREQ (SYMBOL_NAME (msymbol), SYMBOL_NAME (tsymbol)))
850 return SYMBOL_VALUE_ADDRESS (msymbol);