1 /* GDB routines for manipulating the minimal symbol tables.
2 Copyright (C) 1992-2019 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 3 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, see <http://www.gnu.org/licenses/>. */
21 /* This file contains support routines for creating, manipulating, and
22 destroying minimal symbol tables.
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.
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.
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
36 to figure out what full symbol table entries need to be read in. */
43 #include "filenames.h"
50 #include "cp-support.h"
52 #include "cli/cli-utils.h"
53 #include "gdbsupport/symbol.h"
55 #include "safe-ctype.h"
56 #include "gdbsupport/parallel-for.h"
66 msymbol_is_function (struct objfile
*objfile
, minimal_symbol
*minsym
,
67 CORE_ADDR
*func_address_p
)
69 CORE_ADDR msym_addr
= MSYMBOL_VALUE_ADDRESS (objfile
, minsym
);
73 case mst_slot_got_plt
:
79 case mst_data_gnu_ifunc
:
81 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
83 = gdbarch_convert_from_func_ptr_addr (gdbarch
, msym_addr
,
84 current_top_target ());
87 if (func_address_p
!= NULL
)
94 if (func_address_p
!= NULL
)
95 *func_address_p
= msym_addr
;
100 /* Accumulate the minimal symbols for each objfile in bunches of BUNCH_SIZE.
101 At the end, copy them all into one newly allocated array. */
103 #define BUNCH_SIZE 127
107 struct msym_bunch
*next
;
108 struct minimal_symbol contents
[BUNCH_SIZE
];
114 msymbol_hash_iw (const char *string
)
116 unsigned int hash
= 0;
118 while (*string
&& *string
!= '(')
120 string
= skip_spaces (string
);
121 if (*string
&& *string
!= '(')
123 hash
= SYMBOL_HASH_NEXT (hash
, *string
);
133 msymbol_hash (const char *string
)
135 unsigned int hash
= 0;
137 for (; *string
; ++string
)
138 hash
= SYMBOL_HASH_NEXT (hash
, *string
);
142 /* Add the minimal symbol SYM to an objfile's minsym hash table, TABLE. */
144 add_minsym_to_hash_table (struct minimal_symbol
*sym
,
145 struct minimal_symbol
**table
,
146 unsigned int hash_value
)
148 if (sym
->hash_next
== NULL
)
150 unsigned int hash
= hash_value
% MINIMAL_SYMBOL_HASH_SIZE
;
152 sym
->hash_next
= table
[hash
];
157 /* Add the minimal symbol SYM to an objfile's minsym demangled hash table,
160 add_minsym_to_demangled_hash_table (struct minimal_symbol
*sym
,
161 struct objfile
*objfile
,
162 unsigned int hash_value
)
164 if (sym
->demangled_hash_next
== NULL
)
166 objfile
->per_bfd
->demangled_hash_languages
.set (MSYMBOL_LANGUAGE (sym
));
168 struct minimal_symbol
**table
169 = objfile
->per_bfd
->msymbol_demangled_hash
;
170 unsigned int hash_index
= hash_value
% MINIMAL_SYMBOL_HASH_SIZE
;
171 sym
->demangled_hash_next
= table
[hash_index
];
172 table
[hash_index
] = sym
;
176 /* Worker object for lookup_minimal_symbol. Stores temporary results
177 while walking the symbol tables. */
179 struct found_minimal_symbols
181 /* External symbols are best. */
182 bound_minimal_symbol external_symbol
{};
184 /* File-local symbols are next best. */
185 bound_minimal_symbol file_symbol
{};
187 /* Symbols for shared library trampolines are next best. */
188 bound_minimal_symbol trampoline_symbol
{};
190 /* Called when a symbol name matches. Check if the minsym is a
191 better type than what we had already found, and record it in one
192 of the members fields if so. Returns true if we collected the
193 real symbol, in which case we can stop searching. */
194 bool maybe_collect (const char *sfile
, objfile
*objf
,
195 minimal_symbol
*msymbol
);
198 /* See declaration above. */
201 found_minimal_symbols::maybe_collect (const char *sfile
,
202 struct objfile
*objfile
,
203 minimal_symbol
*msymbol
)
205 switch (MSYMBOL_TYPE (msymbol
))
211 || filename_cmp (msymbol
->filename
, sfile
) == 0)
213 file_symbol
.minsym
= msymbol
;
214 file_symbol
.objfile
= objfile
;
218 case mst_solib_trampoline
:
220 /* If a trampoline symbol is found, we prefer to keep
221 looking for the *real* symbol. If the actual symbol
222 is not found, then we'll use the trampoline
224 if (trampoline_symbol
.minsym
== NULL
)
226 trampoline_symbol
.minsym
= msymbol
;
227 trampoline_symbol
.objfile
= objfile
;
233 external_symbol
.minsym
= msymbol
;
234 external_symbol
.objfile
= objfile
;
235 /* We have the real symbol. No use looking further. */
243 /* Walk the mangled name hash table, and pass each symbol whose name
244 matches LOOKUP_NAME according to NAMECMP to FOUND. */
247 lookup_minimal_symbol_mangled (const char *lookup_name
,
249 struct objfile
*objfile
,
250 struct minimal_symbol
**table
,
252 int (*namecmp
) (const char *, const char *),
253 found_minimal_symbols
&found
)
255 for (minimal_symbol
*msymbol
= table
[hash
];
257 msymbol
= msymbol
->hash_next
)
259 const char *symbol_name
= msymbol
->linkage_name ();
261 if (namecmp (symbol_name
, lookup_name
) == 0
262 && found
.maybe_collect (sfile
, objfile
, msymbol
))
267 /* Walk the demangled name hash table, and pass each symbol whose name
268 matches LOOKUP_NAME according to MATCHER to FOUND. */
271 lookup_minimal_symbol_demangled (const lookup_name_info
&lookup_name
,
273 struct objfile
*objfile
,
274 struct minimal_symbol
**table
,
276 symbol_name_matcher_ftype
*matcher
,
277 found_minimal_symbols
&found
)
279 for (minimal_symbol
*msymbol
= table
[hash
];
281 msymbol
= msymbol
->demangled_hash_next
)
283 const char *symbol_name
= msymbol
->search_name ();
285 if (matcher (symbol_name
, lookup_name
, NULL
)
286 && found
.maybe_collect (sfile
, objfile
, msymbol
))
291 /* Look through all the current minimal symbol tables and find the
292 first minimal symbol that matches NAME. If OBJF is non-NULL, limit
293 the search to that objfile. If SFILE is non-NULL, the only file-scope
294 symbols considered will be from that source file (global symbols are
295 still preferred). Returns a pointer to the minimal symbol that
296 matches, or NULL if no match is found.
298 Note: One instance where there may be duplicate minimal symbols with
299 the same name is when the symbol tables for a shared library and the
300 symbol tables for an executable contain global symbols with the same
301 names (the dynamic linker deals with the duplication).
303 It's also possible to have minimal symbols with different mangled
304 names, but identical demangled names. For example, the GNU C++ v3
305 ABI requires the generation of two (or perhaps three) copies of
306 constructor functions --- "in-charge", "not-in-charge", and
307 "allocate" copies; destructors may be duplicated as well.
308 Obviously, there must be distinct mangled names for each of these,
309 but the demangled names are all the same: S::S or S::~S. */
311 struct bound_minimal_symbol
312 lookup_minimal_symbol (const char *name
, const char *sfile
,
313 struct objfile
*objf
)
315 found_minimal_symbols found
;
317 unsigned int mangled_hash
= msymbol_hash (name
) % MINIMAL_SYMBOL_HASH_SIZE
;
320 = (case_sensitivity
== case_sensitive_on
325 sfile
= lbasename (sfile
);
327 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
329 for (objfile
*objfile
: current_program_space
->objfiles ())
331 if (found
.external_symbol
.minsym
!= NULL
)
334 if (objf
== NULL
|| objf
== objfile
335 || objf
== objfile
->separate_debug_objfile_backlink
)
337 if (symbol_lookup_debug
)
339 fprintf_unfiltered (gdb_stdlog
,
340 "lookup_minimal_symbol (%s, %s, %s)\n",
341 name
, sfile
!= NULL
? sfile
: "NULL",
342 objfile_debug_name (objfile
));
345 /* Do two passes: the first over the ordinary hash table,
346 and the second over the demangled hash table. */
347 lookup_minimal_symbol_mangled (name
, sfile
, objfile
,
348 objfile
->per_bfd
->msymbol_hash
,
349 mangled_hash
, mangled_cmp
, found
);
351 /* If not found, try the demangled hash table. */
352 if (found
.external_symbol
.minsym
== NULL
)
354 /* Once for each language in the demangled hash names
355 table (usually just zero or one languages). */
356 for (unsigned iter
= 0; iter
< nr_languages
; ++iter
)
358 if (!objfile
->per_bfd
->demangled_hash_languages
.test (iter
))
360 enum language lang
= (enum language
) iter
;
363 = (lookup_name
.search_name_hash (lang
)
364 % MINIMAL_SYMBOL_HASH_SIZE
);
366 symbol_name_matcher_ftype
*match
367 = get_symbol_name_matcher (language_def (lang
),
369 struct minimal_symbol
**msymbol_demangled_hash
370 = objfile
->per_bfd
->msymbol_demangled_hash
;
372 lookup_minimal_symbol_demangled (lookup_name
, sfile
, objfile
,
373 msymbol_demangled_hash
,
376 if (found
.external_symbol
.minsym
!= NULL
)
383 /* External symbols are best. */
384 if (found
.external_symbol
.minsym
!= NULL
)
386 if (symbol_lookup_debug
)
388 minimal_symbol
*minsym
= found
.external_symbol
.minsym
;
390 fprintf_unfiltered (gdb_stdlog
,
391 "lookup_minimal_symbol (...) = %s (external)\n",
392 host_address_to_string (minsym
));
394 return found
.external_symbol
;
397 /* File-local symbols are next best. */
398 if (found
.file_symbol
.minsym
!= NULL
)
400 if (symbol_lookup_debug
)
402 minimal_symbol
*minsym
= found
.file_symbol
.minsym
;
404 fprintf_unfiltered (gdb_stdlog
,
405 "lookup_minimal_symbol (...) = %s (file-local)\n",
406 host_address_to_string (minsym
));
408 return found
.file_symbol
;
411 /* Symbols for shared library trampolines are next best. */
412 if (found
.trampoline_symbol
.minsym
!= NULL
)
414 if (symbol_lookup_debug
)
416 minimal_symbol
*minsym
= found
.trampoline_symbol
.minsym
;
418 fprintf_unfiltered (gdb_stdlog
,
419 "lookup_minimal_symbol (...) = %s (trampoline)\n",
420 host_address_to_string (minsym
));
423 return found
.trampoline_symbol
;
427 if (symbol_lookup_debug
)
428 fprintf_unfiltered (gdb_stdlog
, "lookup_minimal_symbol (...) = NULL\n");
434 struct bound_minimal_symbol
435 lookup_bound_minimal_symbol (const char *name
)
437 return lookup_minimal_symbol (name
, NULL
, NULL
);
440 /* See gdbsupport/symbol.h. */
443 find_minimal_symbol_address (const char *name
, CORE_ADDR
*addr
,
444 struct objfile
*objfile
)
446 struct bound_minimal_symbol sym
447 = lookup_minimal_symbol (name
, NULL
, objfile
);
449 if (sym
.minsym
!= NULL
)
450 *addr
= BMSYMBOL_VALUE_ADDRESS (sym
);
452 return sym
.minsym
== NULL
;
455 /* Get the lookup name form best suitable for linkage name
459 linkage_name_str (const lookup_name_info
&lookup_name
)
461 /* Unlike most languages (including C++), Ada uses the
462 encoded/linkage name as the search name recorded in symbols. So
463 if debugging in Ada mode, prefer the Ada-encoded name. This also
464 makes Ada's verbatim match syntax ("<...>") work, because
465 "lookup_name.name()" includes the "<>"s, while
466 "lookup_name.ada().lookup_name()" is the encoded name with "<>"s
468 if (current_language
->la_language
== language_ada
)
469 return lookup_name
.ada ().lookup_name ().c_str ();
471 return lookup_name
.name ().c_str ();
477 iterate_over_minimal_symbols
478 (struct objfile
*objf
, const lookup_name_info
&lookup_name
,
479 gdb::function_view
<bool (struct minimal_symbol
*)> callback
)
481 /* The first pass is over the ordinary hash table. */
483 const char *name
= linkage_name_str (lookup_name
);
484 unsigned int hash
= msymbol_hash (name
) % MINIMAL_SYMBOL_HASH_SIZE
;
486 = (case_sensitivity
== case_sensitive_on
490 for (minimal_symbol
*iter
= objf
->per_bfd
->msymbol_hash
[hash
];
492 iter
= iter
->hash_next
)
494 if (mangled_cmp (iter
->linkage_name (), name
) == 0)
500 /* The second pass is over the demangled table. Once for each
501 language in the demangled hash names table (usually just zero or
503 for (unsigned liter
= 0; liter
< nr_languages
; ++liter
)
505 if (!objf
->per_bfd
->demangled_hash_languages
.test (liter
))
508 enum language lang
= (enum language
) liter
;
509 const language_defn
*lang_def
= language_def (lang
);
510 symbol_name_matcher_ftype
*name_match
511 = get_symbol_name_matcher (lang_def
, lookup_name
);
514 = lookup_name
.search_name_hash (lang
) % MINIMAL_SYMBOL_HASH_SIZE
;
515 for (minimal_symbol
*iter
= objf
->per_bfd
->msymbol_demangled_hash
[hash
];
517 iter
= iter
->demangled_hash_next
)
518 if (name_match (iter
->search_name (), lookup_name
, NULL
))
527 lookup_minimal_symbol_linkage (const char *name
, struct objfile
*objf
)
529 unsigned int hash
= msymbol_hash (name
) % MINIMAL_SYMBOL_HASH_SIZE
;
531 for (objfile
*objfile
: objf
->separate_debug_objfiles ())
533 for (minimal_symbol
*msymbol
= objfile
->per_bfd
->msymbol_hash
[hash
];
535 msymbol
= msymbol
->hash_next
)
537 if (strcmp (msymbol
->linkage_name (), name
) == 0
538 && (MSYMBOL_TYPE (msymbol
) == mst_data
539 || MSYMBOL_TYPE (msymbol
) == mst_bss
))
540 return {msymbol
, objfile
};
549 struct bound_minimal_symbol
550 lookup_minimal_symbol_text (const char *name
, struct objfile
*objf
)
552 struct minimal_symbol
*msymbol
;
553 struct bound_minimal_symbol found_symbol
= { NULL
, NULL
};
554 struct bound_minimal_symbol found_file_symbol
= { NULL
, NULL
};
556 unsigned int hash
= msymbol_hash (name
) % MINIMAL_SYMBOL_HASH_SIZE
;
558 for (objfile
*objfile
: current_program_space
->objfiles ())
560 if (found_symbol
.minsym
!= NULL
)
563 if (objf
== NULL
|| objf
== objfile
564 || objf
== objfile
->separate_debug_objfile_backlink
)
566 for (msymbol
= objfile
->per_bfd
->msymbol_hash
[hash
];
567 msymbol
!= NULL
&& found_symbol
.minsym
== NULL
;
568 msymbol
= msymbol
->hash_next
)
570 if (strcmp (msymbol
->linkage_name (), name
) == 0 &&
571 (MSYMBOL_TYPE (msymbol
) == mst_text
572 || MSYMBOL_TYPE (msymbol
) == mst_text_gnu_ifunc
573 || MSYMBOL_TYPE (msymbol
) == mst_file_text
))
575 switch (MSYMBOL_TYPE (msymbol
))
578 found_file_symbol
.minsym
= msymbol
;
579 found_file_symbol
.objfile
= objfile
;
582 found_symbol
.minsym
= msymbol
;
583 found_symbol
.objfile
= objfile
;
590 /* External symbols are best. */
591 if (found_symbol
.minsym
)
594 /* File-local symbols are next best. */
595 return found_file_symbol
;
600 struct minimal_symbol
*
601 lookup_minimal_symbol_by_pc_name (CORE_ADDR pc
, const char *name
,
602 struct objfile
*objf
)
604 struct minimal_symbol
*msymbol
;
606 unsigned int hash
= msymbol_hash (name
) % MINIMAL_SYMBOL_HASH_SIZE
;
608 for (objfile
*objfile
: current_program_space
->objfiles ())
610 if (objf
== NULL
|| objf
== objfile
611 || objf
== objfile
->separate_debug_objfile_backlink
)
613 for (msymbol
= objfile
->per_bfd
->msymbol_hash
[hash
];
615 msymbol
= msymbol
->hash_next
)
617 if (MSYMBOL_VALUE_ADDRESS (objfile
, msymbol
) == pc
618 && strcmp (msymbol
->linkage_name (), name
) == 0)
627 /* A helper function that makes *PC section-relative. This searches
628 the sections of OBJFILE and if *PC is in a section, it subtracts
629 the section offset and returns true. Otherwise it returns
633 frob_address (struct objfile
*objfile
, CORE_ADDR
*pc
)
635 struct obj_section
*iter
;
637 ALL_OBJFILE_OSECTIONS (objfile
, iter
)
639 if (*pc
>= obj_section_addr (iter
) && *pc
< obj_section_endaddr (iter
))
641 *pc
-= obj_section_offset (iter
);
649 /* Helper for lookup_minimal_symbol_by_pc_section. Convert a
650 lookup_msym_prefer to a minimal_symbol_type. */
652 static minimal_symbol_type
653 msym_prefer_to_msym_type (lookup_msym_prefer prefer
)
657 case lookup_msym_prefer::TEXT
:
659 case lookup_msym_prefer::TRAMPOLINE
:
660 return mst_solib_trampoline
;
661 case lookup_msym_prefer::GNU_IFUNC
:
662 return mst_text_gnu_ifunc
;
665 /* Assert here instead of in a default switch case above so that
666 -Wswitch warns if a new enumerator is added. */
667 gdb_assert_not_reached ("unhandled lookup_msym_prefer");
670 /* Search through the minimal symbol table for each objfile and find
671 the symbol whose address is the largest address that is still less
672 than or equal to PC, and matches SECTION (which is not NULL).
673 Returns a pointer to the minimal symbol if such a symbol is found,
674 or NULL if PC is not in a suitable range.
675 Note that we need to look through ALL the minimal symbol tables
676 before deciding on the symbol that comes closest to the specified PC.
677 This is because objfiles can overlap, for example objfile A has .text
678 at 0x100 and .data at 0x40000 and objfile B has .text at 0x234 and
681 If WANT_TRAMPOLINE is set, prefer mst_solib_trampoline symbols when
682 there are text and trampoline symbols at the same address.
683 Otherwise prefer mst_text symbols. */
686 lookup_minimal_symbol_by_pc_section (CORE_ADDR pc_in
, struct obj_section
*section
,
687 lookup_msym_prefer prefer
)
692 struct minimal_symbol
*msymbol
;
693 struct minimal_symbol
*best_symbol
= NULL
;
694 struct objfile
*best_objfile
= NULL
;
695 struct bound_minimal_symbol result
;
699 section
= find_pc_section (pc_in
);
704 minimal_symbol_type want_type
= msym_prefer_to_msym_type (prefer
);
706 /* We can not require the symbol found to be in section, because
707 e.g. IRIX 6.5 mdebug relies on this code returning an absolute
708 symbol - but find_pc_section won't return an absolute section and
709 hence the code below would skip over absolute symbols. We can
710 still take advantage of the call to find_pc_section, though - the
711 object file still must match. In case we have separate debug
712 files, search both the file and its separate debug file. There's
713 no telling which one will have the minimal symbols. */
715 gdb_assert (section
!= NULL
);
717 for (objfile
*objfile
: section
->objfile
->separate_debug_objfiles ())
719 CORE_ADDR pc
= pc_in
;
721 /* If this objfile has a minimal symbol table, go search it
722 using a binary search. */
724 if (objfile
->per_bfd
->minimal_symbol_count
> 0)
726 int best_zero_sized
= -1;
728 msymbol
= objfile
->per_bfd
->msymbols
.get ();
730 hi
= objfile
->per_bfd
->minimal_symbol_count
- 1;
732 /* This code assumes that the minimal symbols are sorted by
733 ascending address values. If the pc value is greater than or
734 equal to the first symbol's address, then some symbol in this
735 minimal symbol table is a suitable candidate for being the
736 "best" symbol. This includes the last real symbol, for cases
737 where the pc value is larger than any address in this vector.
739 By iterating until the address associated with the current
740 hi index (the endpoint of the test interval) is less than
741 or equal to the desired pc value, we accomplish two things:
742 (1) the case where the pc value is larger than any minimal
743 symbol address is trivially solved, (2) the address associated
744 with the hi index is always the one we want when the iteration
745 terminates. In essence, we are iterating the test interval
746 down until the pc value is pushed out of it from the high end.
748 Warning: this code is trickier than it would appear at first. */
750 if (frob_address (objfile
, &pc
)
751 && pc
>= MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[lo
]))
753 while (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
]) > pc
)
755 /* pc is still strictly less than highest address. */
756 /* Note "new" will always be >= lo. */
757 newobj
= (lo
+ hi
) / 2;
758 if ((MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[newobj
]) >= pc
)
769 /* If we have multiple symbols at the same address, we want
770 hi to point to the last one. That way we can find the
771 right symbol if it has an index greater than hi. */
772 while (hi
< objfile
->per_bfd
->minimal_symbol_count
- 1
773 && (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
])
774 == MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
+ 1])))
777 /* Skip various undesirable symbols. */
780 /* Skip any absolute symbols. This is apparently
781 what adb and dbx do, and is needed for the CM-5.
782 There are two known possible problems: (1) on
783 ELF, apparently end, edata, etc. are absolute.
784 Not sure ignoring them here is a big deal, but if
785 we want to use them, the fix would go in
786 elfread.c. (2) I think shared library entry
787 points on the NeXT are absolute. If we want
788 special handling for this it probably should be
789 triggered by a special mst_abs_or_lib or some
792 if (MSYMBOL_TYPE (&msymbol
[hi
]) == mst_abs
)
798 /* If SECTION was specified, skip any symbol from
801 /* Some types of debug info, such as COFF,
802 don't fill the bfd_section member, so don't
803 throw away symbols on those platforms. */
804 && MSYMBOL_OBJ_SECTION (objfile
, &msymbol
[hi
]) != NULL
805 && (!matching_obj_sections
806 (MSYMBOL_OBJ_SECTION (objfile
, &msymbol
[hi
]),
813 /* If we are looking for a trampoline and this is a
814 text symbol, or the other way around, check the
815 preceding symbol too. If they are otherwise
816 identical prefer that one. */
818 && MSYMBOL_TYPE (&msymbol
[hi
]) != want_type
819 && MSYMBOL_TYPE (&msymbol
[hi
- 1]) == want_type
820 && (MSYMBOL_SIZE (&msymbol
[hi
])
821 == MSYMBOL_SIZE (&msymbol
[hi
- 1]))
822 && (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
])
823 == MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
- 1]))
824 && (MSYMBOL_OBJ_SECTION (objfile
, &msymbol
[hi
])
825 == MSYMBOL_OBJ_SECTION (objfile
, &msymbol
[hi
- 1])))
831 /* If the minimal symbol has a zero size, save it
832 but keep scanning backwards looking for one with
833 a non-zero size. A zero size may mean that the
834 symbol isn't an object or function (e.g. a
835 label), or it may just mean that the size was not
837 if (MSYMBOL_SIZE (&msymbol
[hi
]) == 0)
839 if (best_zero_sized
== -1)
840 best_zero_sized
= hi
;
845 /* If we are past the end of the current symbol, try
846 the previous symbol if it has a larger overlapping
847 size. This happens on i686-pc-linux-gnu with glibc;
848 the nocancel variants of system calls are inside
849 the cancellable variants, but both have sizes. */
851 && MSYMBOL_SIZE (&msymbol
[hi
]) != 0
852 && pc
>= (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
])
853 + MSYMBOL_SIZE (&msymbol
[hi
]))
854 && pc
< (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
- 1])
855 + MSYMBOL_SIZE (&msymbol
[hi
- 1])))
861 /* Otherwise, this symbol must be as good as we're going
866 /* If HI has a zero size, and best_zero_sized is set,
867 then we had two or more zero-sized symbols; prefer
868 the first one we found (which may have a higher
869 address). Also, if we ran off the end, be sure
871 if (best_zero_sized
!= -1
872 && (hi
< 0 || MSYMBOL_SIZE (&msymbol
[hi
]) == 0))
873 hi
= best_zero_sized
;
875 /* If the minimal symbol has a non-zero size, and this
876 PC appears to be outside the symbol's contents, then
877 refuse to use this symbol. If we found a zero-sized
878 symbol with an address greater than this symbol's,
879 use that instead. We assume that if symbols have
880 specified sizes, they do not overlap. */
883 && MSYMBOL_SIZE (&msymbol
[hi
]) != 0
884 && pc
>= (MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
])
885 + MSYMBOL_SIZE (&msymbol
[hi
])))
887 if (best_zero_sized
!= -1)
888 hi
= best_zero_sized
;
890 /* Go on to the next object file. */
894 /* The minimal symbol indexed by hi now is the best one in this
895 objfile's minimal symbol table. See if it is the best one
899 && ((best_symbol
== NULL
) ||
900 (MSYMBOL_VALUE_RAW_ADDRESS (best_symbol
) <
901 MSYMBOL_VALUE_RAW_ADDRESS (&msymbol
[hi
]))))
903 best_symbol
= &msymbol
[hi
];
904 best_objfile
= objfile
;
910 result
.minsym
= best_symbol
;
911 result
.objfile
= best_objfile
;
917 struct bound_minimal_symbol
918 lookup_minimal_symbol_by_pc (CORE_ADDR pc
)
920 return lookup_minimal_symbol_by_pc_section (pc
, NULL
);
923 /* Return non-zero iff PC is in an STT_GNU_IFUNC function resolver. */
926 in_gnu_ifunc_stub (CORE_ADDR pc
)
928 bound_minimal_symbol msymbol
929 = lookup_minimal_symbol_by_pc_section (pc
, NULL
,
930 lookup_msym_prefer::GNU_IFUNC
);
931 return msymbol
.minsym
&& MSYMBOL_TYPE (msymbol
.minsym
) == mst_text_gnu_ifunc
;
934 /* See elf_gnu_ifunc_resolve_addr for its real implementation. */
937 stub_gnu_ifunc_resolve_addr (struct gdbarch
*gdbarch
, CORE_ADDR pc
)
939 error (_("GDB cannot resolve STT_GNU_IFUNC symbol at address %s without "
940 "the ELF support compiled in."),
941 paddress (gdbarch
, pc
));
944 /* See elf_gnu_ifunc_resolve_name for its real implementation. */
947 stub_gnu_ifunc_resolve_name (const char *function_name
,
948 CORE_ADDR
*function_address_p
)
950 error (_("GDB cannot resolve STT_GNU_IFUNC symbol \"%s\" without "
951 "the ELF support compiled in."),
955 /* See elf_gnu_ifunc_resolver_stop for its real implementation. */
958 stub_gnu_ifunc_resolver_stop (struct breakpoint
*b
)
960 internal_error (__FILE__
, __LINE__
,
961 _("elf_gnu_ifunc_resolver_stop cannot be reached."));
964 /* See elf_gnu_ifunc_resolver_return_stop for its real implementation. */
967 stub_gnu_ifunc_resolver_return_stop (struct breakpoint
*b
)
969 internal_error (__FILE__
, __LINE__
,
970 _("elf_gnu_ifunc_resolver_return_stop cannot be reached."));
973 /* See elf_gnu_ifunc_fns for its real implementation. */
975 static const struct gnu_ifunc_fns stub_gnu_ifunc_fns
=
977 stub_gnu_ifunc_resolve_addr
,
978 stub_gnu_ifunc_resolve_name
,
979 stub_gnu_ifunc_resolver_stop
,
980 stub_gnu_ifunc_resolver_return_stop
,
983 /* A placeholder for &elf_gnu_ifunc_fns. */
985 const struct gnu_ifunc_fns
*gnu_ifunc_fns_p
= &stub_gnu_ifunc_fns
;
989 /* Return leading symbol character for a BFD. If BFD is NULL,
990 return the leading symbol character from the main objfile. */
993 get_symbol_leading_char (bfd
*abfd
)
996 return bfd_get_symbol_leading_char (abfd
);
997 if (symfile_objfile
!= NULL
&& symfile_objfile
->obfd
!= NULL
)
998 return bfd_get_symbol_leading_char (symfile_objfile
->obfd
);
1002 /* See minsyms.h. */
1004 minimal_symbol_reader::minimal_symbol_reader (struct objfile
*obj
)
1006 m_msym_bunch (NULL
),
1007 /* Note that presetting m_msym_bunch_index to BUNCH_SIZE causes the
1008 first call to save a minimal symbol to allocate the memory for
1010 m_msym_bunch_index (BUNCH_SIZE
),
1015 /* Discard the currently collected minimal symbols, if any. If we wish
1016 to save them for later use, we must have already copied them somewhere
1017 else before calling this function. */
1019 minimal_symbol_reader::~minimal_symbol_reader ()
1021 struct msym_bunch
*next
;
1023 while (m_msym_bunch
!= NULL
)
1025 next
= m_msym_bunch
->next
;
1026 xfree (m_msym_bunch
);
1027 m_msym_bunch
= next
;
1031 /* See minsyms.h. */
1034 minimal_symbol_reader::record (const char *name
, CORE_ADDR address
,
1035 enum minimal_symbol_type ms_type
)
1042 case mst_text_gnu_ifunc
:
1044 case mst_solib_trampoline
:
1045 section
= SECT_OFF_TEXT (m_objfile
);
1048 case mst_data_gnu_ifunc
:
1050 section
= SECT_OFF_DATA (m_objfile
);
1054 section
= SECT_OFF_BSS (m_objfile
);
1060 record_with_info (name
, address
, ms_type
, section
);
1063 /* Convert an enumerator of type minimal_symbol_type to its string
1067 mst_str (minimal_symbol_type t
)
1069 #define MST_TO_STR(x) case x: return #x;
1072 MST_TO_STR (mst_unknown
);
1073 MST_TO_STR (mst_text
);
1074 MST_TO_STR (mst_text_gnu_ifunc
);
1075 MST_TO_STR (mst_slot_got_plt
);
1076 MST_TO_STR (mst_data
);
1077 MST_TO_STR (mst_bss
);
1078 MST_TO_STR (mst_abs
);
1079 MST_TO_STR (mst_solib_trampoline
);
1080 MST_TO_STR (mst_file_text
);
1081 MST_TO_STR (mst_file_data
);
1082 MST_TO_STR (mst_file_bss
);
1090 /* See minsyms.h. */
1092 struct minimal_symbol
*
1093 minimal_symbol_reader::record_full (gdb::string_view name
,
1094 bool copy_name
, CORE_ADDR address
,
1095 enum minimal_symbol_type ms_type
,
1098 struct msym_bunch
*newobj
;
1099 struct minimal_symbol
*msymbol
;
1101 /* Don't put gcc_compiled, __gnu_compiled_cplus, and friends into
1102 the minimal symbols, because if there is also another symbol
1103 at the same address (e.g. the first function of the file),
1104 lookup_minimal_symbol_by_pc would have no way of getting the
1106 if (ms_type
== mst_file_text
&& name
[0] == 'g'
1107 && (name
== GCC_COMPILED_FLAG_SYMBOL
1108 || name
== GCC2_COMPILED_FLAG_SYMBOL
))
1111 /* It's safe to strip the leading char here once, since the name
1112 is also stored stripped in the minimal symbol table. */
1113 if (name
[0] == get_symbol_leading_char (m_objfile
->obfd
))
1114 name
= name
.substr (1);
1116 if (ms_type
== mst_file_text
&& startswith (name
, "__gnu_compiled"))
1119 if (symtab_create_debug
>= 2)
1120 printf_unfiltered ("Recording minsym: %-21s %18s %4d %.*s\n",
1121 mst_str (ms_type
), hex_string (address
), section
,
1122 (int) name
.size (), name
.data ());
1124 if (m_msym_bunch_index
== BUNCH_SIZE
)
1126 newobj
= XCNEW (struct msym_bunch
);
1127 m_msym_bunch_index
= 0;
1128 newobj
->next
= m_msym_bunch
;
1129 m_msym_bunch
= newobj
;
1131 msymbol
= &m_msym_bunch
->contents
[m_msym_bunch_index
];
1132 symbol_set_language (msymbol
, language_auto
,
1133 &m_objfile
->per_bfd
->storage_obstack
);
1136 msymbol
->name
= obstack_strndup (&m_objfile
->per_bfd
->storage_obstack
,
1137 name
.data (), name
.size ());
1139 msymbol
->name
= name
.data ();
1141 if (worker_threads_disabled ())
1143 /* To keep our behavior as close as possible to the previous non-threaded
1144 behavior for GDB 9.1, we call symbol_set_names here when threads
1146 symbol_set_names (msymbol
, msymbol
->name
, false, m_objfile
->per_bfd
);
1147 msymbol
->name_set
= 1;
1150 SET_MSYMBOL_VALUE_ADDRESS (msymbol
, address
);
1151 MSYMBOL_SECTION (msymbol
) = section
;
1153 MSYMBOL_TYPE (msymbol
) = ms_type
;
1155 /* If we already read minimal symbols for this objfile, then don't
1156 ever allocate a new one. */
1157 if (!m_objfile
->per_bfd
->minsyms_read
)
1159 m_msym_bunch_index
++;
1160 m_objfile
->per_bfd
->n_minsyms
++;
1166 /* Compare two minimal symbols by address and return true if FN1's address
1167 is less than FN2's, so that we sort into unsigned numeric order.
1168 Within groups with the same address, sort by name. */
1171 minimal_symbol_is_less_than (const minimal_symbol
&fn1
,
1172 const minimal_symbol
&fn2
)
1174 if (MSYMBOL_VALUE_RAW_ADDRESS (&fn1
) < MSYMBOL_VALUE_RAW_ADDRESS (&fn2
))
1176 return true; /* addr 1 is less than addr 2. */
1178 else if (MSYMBOL_VALUE_RAW_ADDRESS (&fn1
) > MSYMBOL_VALUE_RAW_ADDRESS (&fn2
))
1180 return false; /* addr 1 is greater than addr 2. */
1183 /* addrs are equal: sort by name */
1185 const char *name1
= fn1
.linkage_name ();
1186 const char *name2
= fn2
.linkage_name ();
1188 if (name1
&& name2
) /* both have names */
1189 return strcmp (name1
, name2
) < 0;
1191 return true; /* fn1 has no name, so it is "less". */
1192 else if (name1
) /* fn2 has no name, so it is "less". */
1195 return false; /* Neither has a name, so they're equal. */
1199 /* Compact duplicate entries out of a minimal symbol table by walking
1200 through the table and compacting out entries with duplicate addresses
1201 and matching names. Return the number of entries remaining.
1203 On entry, the table resides between msymbol[0] and msymbol[mcount].
1204 On exit, it resides between msymbol[0] and msymbol[result_count].
1206 When files contain multiple sources of symbol information, it is
1207 possible for the minimal symbol table to contain many duplicate entries.
1208 As an example, SVR4 systems use ELF formatted object files, which
1209 usually contain at least two different types of symbol tables (a
1210 standard ELF one and a smaller dynamic linking table), as well as
1211 DWARF debugging information for files compiled with -g.
1213 Without compacting, the minimal symbol table for gdb itself contains
1214 over a 1000 duplicates, about a third of the total table size. Aside
1215 from the potential trap of not noticing that two successive entries
1216 identify the same location, this duplication impacts the time required
1217 to linearly scan the table, which is done in a number of places. So we
1218 just do one linear scan here and toss out the duplicates.
1220 Since the different sources of information for each symbol may
1221 have different levels of "completeness", we may have duplicates
1222 that have one entry with type "mst_unknown" and the other with a
1223 known type. So if the one we are leaving alone has type mst_unknown,
1224 overwrite its type with the type from the one we are compacting out. */
1227 compact_minimal_symbols (struct minimal_symbol
*msymbol
, int mcount
,
1228 struct objfile
*objfile
)
1230 struct minimal_symbol
*copyfrom
;
1231 struct minimal_symbol
*copyto
;
1235 copyfrom
= copyto
= msymbol
;
1236 while (copyfrom
< msymbol
+ mcount
- 1)
1238 if (MSYMBOL_VALUE_RAW_ADDRESS (copyfrom
)
1239 == MSYMBOL_VALUE_RAW_ADDRESS ((copyfrom
+ 1))
1240 && MSYMBOL_SECTION (copyfrom
) == MSYMBOL_SECTION (copyfrom
+ 1)
1241 && strcmp (copyfrom
->linkage_name (),
1242 (copyfrom
+ 1)->linkage_name ()) == 0)
1244 if (MSYMBOL_TYPE ((copyfrom
+ 1)) == mst_unknown
)
1246 MSYMBOL_TYPE ((copyfrom
+ 1)) = MSYMBOL_TYPE (copyfrom
);
1251 *copyto
++ = *copyfrom
++;
1253 *copyto
++ = *copyfrom
++;
1254 mcount
= copyto
- msymbol
;
1260 clear_minimal_symbol_hash_tables (struct objfile
*objfile
)
1262 for (size_t i
= 0; i
< MINIMAL_SYMBOL_HASH_SIZE
; i
++)
1264 objfile
->per_bfd
->msymbol_hash
[i
] = 0;
1265 objfile
->per_bfd
->msymbol_demangled_hash
[i
] = 0;
1269 /* This struct is used to store values we compute for msymbols on the
1270 background threads but don't need to keep around long term. */
1271 struct computed_hash_values
1273 /* Length of the linkage_name of the symbol. */
1275 /* Hash code (using fast_hash) of the linkage_name. */
1276 hashval_t mangled_name_hash
;
1277 /* The msymbol_hash of the linkage_name. */
1278 unsigned int minsym_hash
;
1279 /* The msymbol_hash of the search_name. */
1280 unsigned int minsym_demangled_hash
;
1283 /* Build (or rebuild) the minimal symbol hash tables. This is necessary
1284 after compacting or sorting the table since the entries move around
1285 thus causing the internal minimal_symbol pointers to become jumbled. */
1288 build_minimal_symbol_hash_tables
1289 (struct objfile
*objfile
,
1290 const std::vector
<computed_hash_values
>& hash_values
)
1293 struct minimal_symbol
*msym
;
1295 /* (Re)insert the actual entries. */
1296 int mcount
= objfile
->per_bfd
->minimal_symbol_count
;
1298 msym
= objfile
->per_bfd
->msymbols
.get ());
1302 msym
->hash_next
= 0;
1303 add_minsym_to_hash_table (msym
, objfile
->per_bfd
->msymbol_hash
,
1304 hash_values
[i
].minsym_hash
);
1306 msym
->demangled_hash_next
= 0;
1307 if (msym
->search_name () != msym
->linkage_name ())
1308 add_minsym_to_demangled_hash_table
1309 (msym
, objfile
, hash_values
[i
].minsym_demangled_hash
);
1313 /* Add the minimal symbols in the existing bunches to the objfile's official
1314 minimal symbol table. In most cases there is no minimal symbol table yet
1315 for this objfile, and the existing bunches are used to create one. Once
1316 in a while (for shared libraries for example), we add symbols (e.g. common
1317 symbols) to an existing objfile. */
1320 minimal_symbol_reader::install ()
1323 struct msym_bunch
*bunch
;
1324 struct minimal_symbol
*msymbols
;
1327 if (m_objfile
->per_bfd
->minsyms_read
)
1330 if (m_msym_count
> 0)
1332 if (symtab_create_debug
)
1334 fprintf_unfiltered (gdb_stdlog
,
1335 "Installing %d minimal symbols of objfile %s.\n",
1336 m_msym_count
, objfile_name (m_objfile
));
1339 /* Allocate enough space, into which we will gather the bunches
1340 of new and existing minimal symbols, sort them, and then
1341 compact out the duplicate entries. Once we have a final
1342 table, we will give back the excess space. */
1344 alloc_count
= m_msym_count
+ m_objfile
->per_bfd
->minimal_symbol_count
;
1345 gdb::unique_xmalloc_ptr
<minimal_symbol
>
1346 msym_holder (XNEWVEC (minimal_symbol
, alloc_count
));
1347 msymbols
= msym_holder
.get ();
1349 /* Copy in the existing minimal symbols, if there are any. */
1351 if (m_objfile
->per_bfd
->minimal_symbol_count
)
1352 memcpy (msymbols
, m_objfile
->per_bfd
->msymbols
.get (),
1353 m_objfile
->per_bfd
->minimal_symbol_count
1354 * sizeof (struct minimal_symbol
));
1356 /* Walk through the list of minimal symbol bunches, adding each symbol
1357 to the new contiguous array of symbols. Note that we start with the
1358 current, possibly partially filled bunch (thus we use the current
1359 msym_bunch_index for the first bunch we copy over), and thereafter
1360 each bunch is full. */
1362 mcount
= m_objfile
->per_bfd
->minimal_symbol_count
;
1364 for (bunch
= m_msym_bunch
; bunch
!= NULL
; bunch
= bunch
->next
)
1366 memcpy (&msymbols
[mcount
], &bunch
->contents
[0],
1367 m_msym_bunch_index
* sizeof (struct minimal_symbol
));
1368 mcount
+= m_msym_bunch_index
;
1369 m_msym_bunch_index
= BUNCH_SIZE
;
1372 /* Sort the minimal symbols by address. */
1374 std::sort (msymbols
, msymbols
+ mcount
, minimal_symbol_is_less_than
);
1376 /* Compact out any duplicates, and free up whatever space we are
1379 mcount
= compact_minimal_symbols (msymbols
, mcount
, m_objfile
);
1380 msym_holder
.reset (XRESIZEVEC (struct minimal_symbol
,
1381 msym_holder
.release (),
1384 /* Attach the minimal symbol table to the specified objfile.
1385 The strings themselves are also located in the storage_obstack
1388 if (m_objfile
->per_bfd
->minimal_symbol_count
!= 0)
1389 clear_minimal_symbol_hash_tables (m_objfile
);
1391 m_objfile
->per_bfd
->minimal_symbol_count
= mcount
;
1392 m_objfile
->per_bfd
->msymbols
= std::move (msym_holder
);
1395 /* Mutex that is used when modifying or accessing the demangled
1397 std::mutex demangled_mutex
;
1400 std::vector
<computed_hash_values
> hash_values (mcount
);
1402 msymbols
= m_objfile
->per_bfd
->msymbols
.get ();
1403 gdb::parallel_for_each
1404 (&msymbols
[0], &msymbols
[mcount
],
1405 [&] (minimal_symbol
*start
, minimal_symbol
*end
)
1407 for (minimal_symbol
*msym
= start
; msym
< end
; ++msym
)
1409 size_t idx
= msym
- msymbols
;
1410 hash_values
[idx
].name_length
= strlen (msym
->name
);
1411 if (!msym
->name_set
)
1413 /* This will be freed later, by symbol_set_names. */
1414 char *demangled_name
1415 = symbol_find_demangled_name (msym
, msym
->name
);
1416 symbol_set_demangled_name
1417 (msym
, demangled_name
,
1418 &m_objfile
->per_bfd
->storage_obstack
);
1421 /* This mangled_name_hash computation has to be outside of
1422 the name_set check, or symbol_set_names below will
1423 be called with an invalid hash value. */
1424 hash_values
[idx
].mangled_name_hash
1425 = fast_hash (msym
->name
, hash_values
[idx
].name_length
);
1426 hash_values
[idx
].minsym_hash
1427 = msymbol_hash (msym
->linkage_name ());
1428 /* We only use this hash code if the search name differs
1429 from the linkage name. See the code in
1430 build_minimal_symbol_hash_tables. */
1431 if (msym
->search_name () != msym
->linkage_name ())
1432 hash_values
[idx
].minsym_demangled_hash
1433 = search_name_hash (MSYMBOL_LANGUAGE (msym
),
1434 msym
->search_name ());
1437 /* To limit how long we hold the lock, we only acquire it here
1438 and not while we demangle the names above. */
1440 std::lock_guard
<std::mutex
> guard (demangled_mutex
);
1442 for (minimal_symbol
*msym
= start
; msym
< end
; ++msym
)
1444 size_t idx
= msym
- msymbols
;
1447 gdb::string_view(msym
->name
,
1448 hash_values
[idx
].name_length
),
1451 hash_values
[idx
].mangled_name_hash
);
1456 build_minimal_symbol_hash_tables (m_objfile
, hash_values
);
1460 /* Check if PC is in a shared library trampoline code stub.
1461 Return minimal symbol for the trampoline entry or NULL if PC is not
1462 in a trampoline code stub. */
1464 static struct minimal_symbol
*
1465 lookup_solib_trampoline_symbol_by_pc (CORE_ADDR pc
)
1467 bound_minimal_symbol msymbol
1468 = lookup_minimal_symbol_by_pc_section (pc
, NULL
,
1469 lookup_msym_prefer::TRAMPOLINE
);
1471 if (msymbol
.minsym
!= NULL
1472 && MSYMBOL_TYPE (msymbol
.minsym
) == mst_solib_trampoline
)
1473 return msymbol
.minsym
;
1477 /* If PC is in a shared library trampoline code stub, return the
1478 address of the `real' function belonging to the stub.
1479 Return 0 if PC is not in a trampoline code stub or if the real
1480 function is not found in the minimal symbol table.
1482 We may fail to find the right function if a function with the
1483 same name is defined in more than one shared library, but this
1484 is considered bad programming style. We could return 0 if we find
1485 a duplicate function in case this matters someday. */
1488 find_solib_trampoline_target (struct frame_info
*frame
, CORE_ADDR pc
)
1490 struct minimal_symbol
*tsymbol
= lookup_solib_trampoline_symbol_by_pc (pc
);
1492 if (tsymbol
!= NULL
)
1494 for (objfile
*objfile
: current_program_space
->objfiles ())
1496 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
1498 /* Also handle minimal symbols pointing to function
1500 if ((MSYMBOL_TYPE (msymbol
) == mst_text
1501 || MSYMBOL_TYPE (msymbol
) == mst_text_gnu_ifunc
1502 || MSYMBOL_TYPE (msymbol
) == mst_data
1503 || MSYMBOL_TYPE (msymbol
) == mst_data_gnu_ifunc
)
1504 && strcmp (msymbol
->linkage_name (),
1505 tsymbol
->linkage_name ()) == 0)
1509 /* Ignore data symbols that are not function
1511 if (msymbol_is_function (objfile
, msymbol
, &func
))
1520 /* See minsyms.h. */
1523 minimal_symbol_upper_bound (struct bound_minimal_symbol minsym
)
1526 struct obj_section
*obj_section
;
1528 struct minimal_symbol
*iter
, *msymbol
;
1530 gdb_assert (minsym
.minsym
!= NULL
);
1532 /* If the minimal symbol has a size, use it. Otherwise use the
1533 lesser of the next minimal symbol in the same section, or the end
1534 of the section, as the end of the function. */
1536 if (MSYMBOL_SIZE (minsym
.minsym
) != 0)
1537 return BMSYMBOL_VALUE_ADDRESS (minsym
) + MSYMBOL_SIZE (minsym
.minsym
);
1539 /* Step over other symbols at this same address, and symbols in
1540 other sections, to find the next symbol in this section with a
1541 different address. */
1543 struct minimal_symbol
*past_the_end
1544 = (minsym
.objfile
->per_bfd
->msymbols
.get ()
1545 + minsym
.objfile
->per_bfd
->minimal_symbol_count
);
1546 msymbol
= minsym
.minsym
;
1547 section
= MSYMBOL_SECTION (msymbol
);
1548 for (iter
= msymbol
+ 1; iter
!= past_the_end
; ++iter
)
1550 if ((MSYMBOL_VALUE_RAW_ADDRESS (iter
)
1551 != MSYMBOL_VALUE_RAW_ADDRESS (msymbol
))
1552 && MSYMBOL_SECTION (iter
) == section
)
1556 obj_section
= MSYMBOL_OBJ_SECTION (minsym
.objfile
, minsym
.minsym
);
1557 if (iter
!= past_the_end
1558 && (MSYMBOL_VALUE_ADDRESS (minsym
.objfile
, iter
)
1559 < obj_section_endaddr (obj_section
)))
1560 result
= MSYMBOL_VALUE_ADDRESS (minsym
.objfile
, iter
);
1562 /* We got the start address from the last msymbol in the objfile.
1563 So the end address is the end of the section. */
1564 result
= obj_section_endaddr (obj_section
);