1 /* Symbol table lookup for the GNU debugger, GDB.
3 Copyright (C) 1986-2014 Free Software Foundation, Inc.
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/>. */
30 #include "gdb_regex.h"
31 #include "expression.h"
36 #include "filenames.h" /* for FILENAME_CMP */
37 #include "objc-lang.h"
43 #include "cli/cli-utils.h"
47 #include "gdb_obstack.h"
49 #include "dictionary.h"
51 #include <sys/types.h>
57 #include "cp-support.h"
61 #include "macroscope.h"
63 #include "parser-defs.h"
65 /* Prototypes for local functions */
67 static void rbreak_command (char *, int);
69 static void types_info (char *, int);
71 static void functions_info (char *, int);
73 static void variables_info (char *, int);
75 static void sources_info (char *, int);
77 static int find_line_common (struct linetable
*, int, int *, int);
79 static struct symbol
*lookup_symbol_aux (const char *name
,
80 const struct block
*block
,
81 const domain_enum domain
,
82 enum language language
,
83 struct field_of_this_result
*is_a_field_of_this
);
86 struct symbol
*lookup_symbol_aux_local (const char *name
,
87 const struct block
*block
,
88 const domain_enum domain
,
89 enum language language
);
92 struct symbol
*lookup_symbol_aux_symtabs (int block_index
,
94 const domain_enum domain
);
97 struct symbol
*lookup_symbol_aux_quick (struct objfile
*objfile
,
100 const domain_enum domain
);
102 void _initialize_symtab (void);
106 /* Program space key for finding name and language of "main". */
108 static const struct program_space_data
*main_progspace_key
;
110 /* Type of the data stored on the program space. */
114 /* Name of "main". */
118 /* Language of "main". */
120 enum language language_of_main
;
123 /* When non-zero, print debugging messages related to symtab creation. */
124 unsigned int symtab_create_debug
= 0;
126 /* Non-zero if a file may be known by two different basenames.
127 This is the uncommon case, and significantly slows down gdb.
128 Default set to "off" to not slow down the common case. */
129 int basenames_may_differ
= 0;
131 /* Allow the user to configure the debugger behavior with respect
132 to multiple-choice menus when more than one symbol matches during
135 const char multiple_symbols_ask
[] = "ask";
136 const char multiple_symbols_all
[] = "all";
137 const char multiple_symbols_cancel
[] = "cancel";
138 static const char *const multiple_symbols_modes
[] =
140 multiple_symbols_ask
,
141 multiple_symbols_all
,
142 multiple_symbols_cancel
,
145 static const char *multiple_symbols_mode
= multiple_symbols_all
;
147 /* Read-only accessor to AUTO_SELECT_MODE. */
150 multiple_symbols_select_mode (void)
152 return multiple_symbols_mode
;
155 /* Block in which the most recently searched-for symbol was found.
156 Might be better to make this a parameter to lookup_symbol and
159 const struct block
*block_found
;
161 /* Return the name of a domain_enum. */
164 domain_name (domain_enum e
)
168 case UNDEF_DOMAIN
: return "UNDEF_DOMAIN";
169 case VAR_DOMAIN
: return "VAR_DOMAIN";
170 case STRUCT_DOMAIN
: return "STRUCT_DOMAIN";
171 case LABEL_DOMAIN
: return "LABEL_DOMAIN";
172 case COMMON_BLOCK_DOMAIN
: return "COMMON_BLOCK_DOMAIN";
173 default: gdb_assert_not_reached ("bad domain_enum");
177 /* Return the name of a search_domain . */
180 search_domain_name (enum search_domain e
)
184 case VARIABLES_DOMAIN
: return "VARIABLES_DOMAIN";
185 case FUNCTIONS_DOMAIN
: return "FUNCTIONS_DOMAIN";
186 case TYPES_DOMAIN
: return "TYPES_DOMAIN";
187 case ALL_DOMAIN
: return "ALL_DOMAIN";
188 default: gdb_assert_not_reached ("bad search_domain");
192 /* Set the primary field in SYMTAB. */
195 set_symtab_primary (struct symtab
*symtab
, int primary
)
197 symtab
->primary
= primary
;
199 if (symtab_create_debug
&& primary
)
201 fprintf_unfiltered (gdb_stdlog
,
202 "Created primary symtab %s for %s.\n",
203 host_address_to_string (symtab
),
204 symtab_to_filename_for_display (symtab
));
208 /* See whether FILENAME matches SEARCH_NAME using the rule that we
209 advertise to the user. (The manual's description of linespecs
210 describes what we advertise). Returns true if they match, false
214 compare_filenames_for_search (const char *filename
, const char *search_name
)
216 int len
= strlen (filename
);
217 size_t search_len
= strlen (search_name
);
219 if (len
< search_len
)
222 /* The tail of FILENAME must match. */
223 if (FILENAME_CMP (filename
+ len
- search_len
, search_name
) != 0)
226 /* Either the names must completely match, or the character
227 preceding the trailing SEARCH_NAME segment of FILENAME must be a
230 The check !IS_ABSOLUTE_PATH ensures SEARCH_NAME "/dir/file.c"
231 cannot match FILENAME "/path//dir/file.c" - as user has requested
232 absolute path. The sama applies for "c:\file.c" possibly
233 incorrectly hypothetically matching "d:\dir\c:\file.c".
235 The HAS_DRIVE_SPEC purpose is to make FILENAME "c:file.c"
236 compatible with SEARCH_NAME "file.c". In such case a compiler had
237 to put the "c:file.c" name into debug info. Such compatibility
238 works only on GDB built for DOS host. */
239 return (len
== search_len
240 || (!IS_ABSOLUTE_PATH (search_name
)
241 && IS_DIR_SEPARATOR (filename
[len
- search_len
- 1]))
242 || (HAS_DRIVE_SPEC (filename
)
243 && STRIP_DRIVE_SPEC (filename
) == &filename
[len
- search_len
]));
246 /* Check for a symtab of a specific name by searching some symtabs.
247 This is a helper function for callbacks of iterate_over_symtabs.
249 If NAME is not absolute, then REAL_PATH is NULL
250 If NAME is absolute, then REAL_PATH is the gdb_realpath form of NAME.
252 The return value, NAME, REAL_PATH, CALLBACK, and DATA
253 are identical to the `map_symtabs_matching_filename' method of
254 quick_symbol_functions.
256 FIRST and AFTER_LAST indicate the range of symtabs to search.
257 AFTER_LAST is one past the last symtab to search; NULL means to
258 search until the end of the list. */
261 iterate_over_some_symtabs (const char *name
,
262 const char *real_path
,
263 int (*callback
) (struct symtab
*symtab
,
266 struct symtab
*first
,
267 struct symtab
*after_last
)
269 struct symtab
*s
= NULL
;
270 const char* base_name
= lbasename (name
);
272 for (s
= first
; s
!= NULL
&& s
!= after_last
; s
= s
->next
)
274 if (compare_filenames_for_search (s
->filename
, name
))
276 if (callback (s
, data
))
281 /* Before we invoke realpath, which can get expensive when many
282 files are involved, do a quick comparison of the basenames. */
283 if (! basenames_may_differ
284 && FILENAME_CMP (base_name
, lbasename (s
->filename
)) != 0)
287 if (compare_filenames_for_search (symtab_to_fullname (s
), name
))
289 if (callback (s
, data
))
294 /* If the user gave us an absolute path, try to find the file in
295 this symtab and use its absolute path. */
296 if (real_path
!= NULL
)
298 const char *fullname
= symtab_to_fullname (s
);
300 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
301 gdb_assert (IS_ABSOLUTE_PATH (name
));
302 if (FILENAME_CMP (real_path
, fullname
) == 0)
304 if (callback (s
, data
))
314 /* Check for a symtab of a specific name; first in symtabs, then in
315 psymtabs. *If* there is no '/' in the name, a match after a '/'
316 in the symtab filename will also work.
318 Calls CALLBACK with each symtab that is found and with the supplied
319 DATA. If CALLBACK returns true, the search stops. */
322 iterate_over_symtabs (const char *name
,
323 int (*callback
) (struct symtab
*symtab
,
327 struct objfile
*objfile
;
328 char *real_path
= NULL
;
329 struct cleanup
*cleanups
= make_cleanup (null_cleanup
, NULL
);
331 /* Here we are interested in canonicalizing an absolute path, not
332 absolutizing a relative path. */
333 if (IS_ABSOLUTE_PATH (name
))
335 real_path
= gdb_realpath (name
);
336 make_cleanup (xfree
, real_path
);
337 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
340 ALL_OBJFILES (objfile
)
342 if (iterate_over_some_symtabs (name
, real_path
, callback
, data
,
343 objfile
->symtabs
, NULL
))
345 do_cleanups (cleanups
);
350 /* Same search rules as above apply here, but now we look thru the
353 ALL_OBJFILES (objfile
)
356 && objfile
->sf
->qf
->map_symtabs_matching_filename (objfile
,
362 do_cleanups (cleanups
);
367 do_cleanups (cleanups
);
370 /* The callback function used by lookup_symtab. */
373 lookup_symtab_callback (struct symtab
*symtab
, void *data
)
375 struct symtab
**result_ptr
= data
;
377 *result_ptr
= symtab
;
381 /* A wrapper for iterate_over_symtabs that returns the first matching
385 lookup_symtab (const char *name
)
387 struct symtab
*result
= NULL
;
389 iterate_over_symtabs (name
, lookup_symtab_callback
, &result
);
394 /* Mangle a GDB method stub type. This actually reassembles the pieces of the
395 full method name, which consist of the class name (from T), the unadorned
396 method name from METHOD_ID, and the signature for the specific overload,
397 specified by SIGNATURE_ID. Note that this function is g++ specific. */
400 gdb_mangle_name (struct type
*type
, int method_id
, int signature_id
)
402 int mangled_name_len
;
404 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, method_id
);
405 struct fn_field
*method
= &f
[signature_id
];
406 const char *field_name
= TYPE_FN_FIELDLIST_NAME (type
, method_id
);
407 const char *physname
= TYPE_FN_FIELD_PHYSNAME (f
, signature_id
);
408 const char *newname
= type_name_no_tag (type
);
410 /* Does the form of physname indicate that it is the full mangled name
411 of a constructor (not just the args)? */
412 int is_full_physname_constructor
;
415 int is_destructor
= is_destructor_name (physname
);
416 /* Need a new type prefix. */
417 char *const_prefix
= method
->is_const
? "C" : "";
418 char *volatile_prefix
= method
->is_volatile
? "V" : "";
420 int len
= (newname
== NULL
? 0 : strlen (newname
));
422 /* Nothing to do if physname already contains a fully mangled v3 abi name
423 or an operator name. */
424 if ((physname
[0] == '_' && physname
[1] == 'Z')
425 || is_operator_name (field_name
))
426 return xstrdup (physname
);
428 is_full_physname_constructor
= is_constructor_name (physname
);
430 is_constructor
= is_full_physname_constructor
431 || (newname
&& strcmp (field_name
, newname
) == 0);
434 is_destructor
= (strncmp (physname
, "__dt", 4) == 0);
436 if (is_destructor
|| is_full_physname_constructor
)
438 mangled_name
= (char *) xmalloc (strlen (physname
) + 1);
439 strcpy (mangled_name
, physname
);
445 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
447 else if (physname
[0] == 't' || physname
[0] == 'Q')
449 /* The physname for template and qualified methods already includes
451 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
457 xsnprintf (buf
, sizeof (buf
), "__%s%s%d", const_prefix
,
458 volatile_prefix
, len
);
460 mangled_name_len
= ((is_constructor
? 0 : strlen (field_name
))
461 + strlen (buf
) + len
+ strlen (physname
) + 1);
463 mangled_name
= (char *) xmalloc (mangled_name_len
);
465 mangled_name
[0] = '\0';
467 strcpy (mangled_name
, field_name
);
469 strcat (mangled_name
, buf
);
470 /* If the class doesn't have a name, i.e. newname NULL, then we just
471 mangle it using 0 for the length of the class. Thus it gets mangled
472 as something starting with `::' rather than `classname::'. */
474 strcat (mangled_name
, newname
);
476 strcat (mangled_name
, physname
);
477 return (mangled_name
);
480 /* Initialize the cplus_specific structure. 'cplus_specific' should
481 only be allocated for use with cplus symbols. */
484 symbol_init_cplus_specific (struct general_symbol_info
*gsymbol
,
485 struct obstack
*obstack
)
487 /* A language_specific structure should not have been previously
489 gdb_assert (gsymbol
->language_specific
.cplus_specific
== NULL
);
490 gdb_assert (obstack
!= NULL
);
492 gsymbol
->language_specific
.cplus_specific
=
493 OBSTACK_ZALLOC (obstack
, struct cplus_specific
);
496 /* Set the demangled name of GSYMBOL to NAME. NAME must be already
497 correctly allocated. For C++ symbols a cplus_specific struct is
498 allocated so OBJFILE must not be NULL. If this is a non C++ symbol
499 OBJFILE can be NULL. */
502 symbol_set_demangled_name (struct general_symbol_info
*gsymbol
,
504 struct obstack
*obstack
)
506 if (gsymbol
->language
== language_cplus
)
508 if (gsymbol
->language_specific
.cplus_specific
== NULL
)
509 symbol_init_cplus_specific (gsymbol
, obstack
);
511 gsymbol
->language_specific
.cplus_specific
->demangled_name
= name
;
513 else if (gsymbol
->language
== language_ada
)
517 gsymbol
->ada_mangled
= 0;
518 gsymbol
->language_specific
.obstack
= obstack
;
522 gsymbol
->ada_mangled
= 1;
523 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
527 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
530 /* Return the demangled name of GSYMBOL. */
533 symbol_get_demangled_name (const struct general_symbol_info
*gsymbol
)
535 if (gsymbol
->language
== language_cplus
)
537 if (gsymbol
->language_specific
.cplus_specific
!= NULL
)
538 return gsymbol
->language_specific
.cplus_specific
->demangled_name
;
542 else if (gsymbol
->language
== language_ada
)
544 if (!gsymbol
->ada_mangled
)
549 return gsymbol
->language_specific
.mangled_lang
.demangled_name
;
553 /* Initialize the language dependent portion of a symbol
554 depending upon the language for the symbol. */
557 symbol_set_language (struct general_symbol_info
*gsymbol
,
558 enum language language
,
559 struct obstack
*obstack
)
561 gsymbol
->language
= language
;
562 if (gsymbol
->language
== language_d
563 || gsymbol
->language
== language_go
564 || gsymbol
->language
== language_java
565 || gsymbol
->language
== language_objc
566 || gsymbol
->language
== language_fortran
)
568 symbol_set_demangled_name (gsymbol
, NULL
, obstack
);
570 else if (gsymbol
->language
== language_ada
)
572 gdb_assert (gsymbol
->ada_mangled
== 0);
573 gsymbol
->language_specific
.obstack
= obstack
;
575 else if (gsymbol
->language
== language_cplus
)
576 gsymbol
->language_specific
.cplus_specific
= NULL
;
579 memset (&gsymbol
->language_specific
, 0,
580 sizeof (gsymbol
->language_specific
));
584 /* Functions to initialize a symbol's mangled name. */
586 /* Objects of this type are stored in the demangled name hash table. */
587 struct demangled_name_entry
593 /* Hash function for the demangled name hash. */
596 hash_demangled_name_entry (const void *data
)
598 const struct demangled_name_entry
*e
= data
;
600 return htab_hash_string (e
->mangled
);
603 /* Equality function for the demangled name hash. */
606 eq_demangled_name_entry (const void *a
, const void *b
)
608 const struct demangled_name_entry
*da
= a
;
609 const struct demangled_name_entry
*db
= b
;
611 return strcmp (da
->mangled
, db
->mangled
) == 0;
614 /* Create the hash table used for demangled names. Each hash entry is
615 a pair of strings; one for the mangled name and one for the demangled
616 name. The entry is hashed via just the mangled name. */
619 create_demangled_names_hash (struct objfile
*objfile
)
621 /* Choose 256 as the starting size of the hash table, somewhat arbitrarily.
622 The hash table code will round this up to the next prime number.
623 Choosing a much larger table size wastes memory, and saves only about
624 1% in symbol reading. */
626 objfile
->per_bfd
->demangled_names_hash
= htab_create_alloc
627 (256, hash_demangled_name_entry
, eq_demangled_name_entry
,
628 NULL
, xcalloc
, xfree
);
631 /* Try to determine the demangled name for a symbol, based on the
632 language of that symbol. If the language is set to language_auto,
633 it will attempt to find any demangling algorithm that works and
634 then set the language appropriately. The returned name is allocated
635 by the demangler and should be xfree'd. */
638 symbol_find_demangled_name (struct general_symbol_info
*gsymbol
,
641 char *demangled
= NULL
;
643 if (gsymbol
->language
== language_unknown
)
644 gsymbol
->language
= language_auto
;
646 if (gsymbol
->language
== language_objc
647 || gsymbol
->language
== language_auto
)
650 objc_demangle (mangled
, 0);
651 if (demangled
!= NULL
)
653 gsymbol
->language
= language_objc
;
657 if (gsymbol
->language
== language_cplus
658 || gsymbol
->language
== language_auto
)
661 gdb_demangle (mangled
, DMGL_PARAMS
| DMGL_ANSI
);
662 if (demangled
!= NULL
)
664 gsymbol
->language
= language_cplus
;
668 if (gsymbol
->language
== language_java
)
671 gdb_demangle (mangled
,
672 DMGL_PARAMS
| DMGL_ANSI
| DMGL_JAVA
);
673 if (demangled
!= NULL
)
675 gsymbol
->language
= language_java
;
679 if (gsymbol
->language
== language_d
680 || gsymbol
->language
== language_auto
)
682 demangled
= d_demangle(mangled
, 0);
683 if (demangled
!= NULL
)
685 gsymbol
->language
= language_d
;
689 /* FIXME(dje): Continually adding languages here is clumsy.
690 Better to just call la_demangle if !auto, and if auto then call
691 a utility routine that tries successive languages in turn and reports
692 which one it finds. I realize the la_demangle options may be different
693 for different languages but there's already a FIXME for that. */
694 if (gsymbol
->language
== language_go
695 || gsymbol
->language
== language_auto
)
697 demangled
= go_demangle (mangled
, 0);
698 if (demangled
!= NULL
)
700 gsymbol
->language
= language_go
;
705 /* We could support `gsymbol->language == language_fortran' here to provide
706 module namespaces also for inferiors with only minimal symbol table (ELF
707 symbols). Just the mangling standard is not standardized across compilers
708 and there is no DW_AT_producer available for inferiors with only the ELF
709 symbols to check the mangling kind. */
711 /* Check for Ada symbols last. See comment below explaining why. */
713 if (gsymbol
->language
== language_auto
)
715 const char *demangled
= ada_decode (mangled
);
717 if (demangled
!= mangled
&& demangled
!= NULL
&& demangled
[0] != '<')
719 /* Set the gsymbol language to Ada, but still return NULL.
720 Two reasons for that:
722 1. For Ada, we prefer computing the symbol's decoded name
723 on the fly rather than pre-compute it, in order to save
724 memory (Ada projects are typically very large).
726 2. There are some areas in the definition of the GNAT
727 encoding where, with a bit of bad luck, we might be able
728 to decode a non-Ada symbol, generating an incorrect
729 demangled name (Eg: names ending with "TB" for instance
730 are identified as task bodies and so stripped from
731 the decoded name returned).
733 Returning NULL, here, helps us get a little bit of
734 the best of both worlds. Because we're last, we should
735 not affect any of the other languages that were able to
736 demangle the symbol before us; we get to correctly tag
737 Ada symbols as such; and even if we incorrectly tagged
738 a non-Ada symbol, which should be rare, any routing
739 through the Ada language should be transparent (Ada
740 tries to behave much like C/C++ with non-Ada symbols). */
741 gsymbol
->language
= language_ada
;
749 /* Set both the mangled and demangled (if any) names for GSYMBOL based
750 on LINKAGE_NAME and LEN. Ordinarily, NAME is copied onto the
751 objfile's obstack; but if COPY_NAME is 0 and if NAME is
752 NUL-terminated, then this function assumes that NAME is already
753 correctly saved (either permanently or with a lifetime tied to the
754 objfile), and it will not be copied.
756 The hash table corresponding to OBJFILE is used, and the memory
757 comes from the per-BFD storage_obstack. LINKAGE_NAME is copied,
758 so the pointer can be discarded after calling this function. */
760 /* We have to be careful when dealing with Java names: when we run
761 into a Java minimal symbol, we don't know it's a Java symbol, so it
762 gets demangled as a C++ name. This is unfortunate, but there's not
763 much we can do about it: but when demangling partial symbols and
764 regular symbols, we'd better not reuse the wrong demangled name.
765 (See PR gdb/1039.) We solve this by putting a distinctive prefix
766 on Java names when storing them in the hash table. */
768 /* FIXME: carlton/2003-03-13: This is an unfortunate situation. I
769 don't mind the Java prefix so much: different languages have
770 different demangling requirements, so it's only natural that we
771 need to keep language data around in our demangling cache. But
772 it's not good that the minimal symbol has the wrong demangled name.
773 Unfortunately, I can't think of any easy solution to that
776 #define JAVA_PREFIX "##JAVA$$"
777 #define JAVA_PREFIX_LEN 8
780 symbol_set_names (struct general_symbol_info
*gsymbol
,
781 const char *linkage_name
, int len
, int copy_name
,
782 struct objfile
*objfile
)
784 struct demangled_name_entry
**slot
;
785 /* A 0-terminated copy of the linkage name. */
786 const char *linkage_name_copy
;
787 /* A copy of the linkage name that might have a special Java prefix
788 added to it, for use when looking names up in the hash table. */
789 const char *lookup_name
;
790 /* The length of lookup_name. */
792 struct demangled_name_entry entry
;
793 struct objfile_per_bfd_storage
*per_bfd
= objfile
->per_bfd
;
795 if (gsymbol
->language
== language_ada
)
797 /* In Ada, we do the symbol lookups using the mangled name, so
798 we can save some space by not storing the demangled name.
800 As a side note, we have also observed some overlap between
801 the C++ mangling and Ada mangling, similarly to what has
802 been observed with Java. Because we don't store the demangled
803 name with the symbol, we don't need to use the same trick
806 gsymbol
->name
= linkage_name
;
809 char *name
= obstack_alloc (&per_bfd
->storage_obstack
, len
+ 1);
811 memcpy (name
, linkage_name
, len
);
813 gsymbol
->name
= name
;
815 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
820 if (per_bfd
->demangled_names_hash
== NULL
)
821 create_demangled_names_hash (objfile
);
823 /* The stabs reader generally provides names that are not
824 NUL-terminated; most of the other readers don't do this, so we
825 can just use the given copy, unless we're in the Java case. */
826 if (gsymbol
->language
== language_java
)
830 lookup_len
= len
+ JAVA_PREFIX_LEN
;
831 alloc_name
= alloca (lookup_len
+ 1);
832 memcpy (alloc_name
, JAVA_PREFIX
, JAVA_PREFIX_LEN
);
833 memcpy (alloc_name
+ JAVA_PREFIX_LEN
, linkage_name
, len
);
834 alloc_name
[lookup_len
] = '\0';
836 lookup_name
= alloc_name
;
837 linkage_name_copy
= alloc_name
+ JAVA_PREFIX_LEN
;
839 else if (linkage_name
[len
] != '\0')
844 alloc_name
= alloca (lookup_len
+ 1);
845 memcpy (alloc_name
, linkage_name
, len
);
846 alloc_name
[lookup_len
] = '\0';
848 lookup_name
= alloc_name
;
849 linkage_name_copy
= alloc_name
;
854 lookup_name
= linkage_name
;
855 linkage_name_copy
= linkage_name
;
858 entry
.mangled
= lookup_name
;
859 slot
= ((struct demangled_name_entry
**)
860 htab_find_slot (per_bfd
->demangled_names_hash
,
863 /* If this name is not in the hash table, add it. */
865 /* A C version of the symbol may have already snuck into the table.
866 This happens to, e.g., main.init (__go_init_main). Cope. */
867 || (gsymbol
->language
== language_go
868 && (*slot
)->demangled
[0] == '\0'))
870 char *demangled_name
= symbol_find_demangled_name (gsymbol
,
872 int demangled_len
= demangled_name
? strlen (demangled_name
) : 0;
874 /* Suppose we have demangled_name==NULL, copy_name==0, and
875 lookup_name==linkage_name. In this case, we already have the
876 mangled name saved, and we don't have a demangled name. So,
877 you might think we could save a little space by not recording
878 this in the hash table at all.
880 It turns out that it is actually important to still save such
881 an entry in the hash table, because storing this name gives
882 us better bcache hit rates for partial symbols. */
883 if (!copy_name
&& lookup_name
== linkage_name
)
885 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
886 offsetof (struct demangled_name_entry
,
888 + demangled_len
+ 1);
889 (*slot
)->mangled
= lookup_name
;
895 /* If we must copy the mangled name, put it directly after
896 the demangled name so we can have a single
898 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
899 offsetof (struct demangled_name_entry
,
901 + lookup_len
+ demangled_len
+ 2);
902 mangled_ptr
= &((*slot
)->demangled
[demangled_len
+ 1]);
903 strcpy (mangled_ptr
, lookup_name
);
904 (*slot
)->mangled
= mangled_ptr
;
907 if (demangled_name
!= NULL
)
909 strcpy ((*slot
)->demangled
, demangled_name
);
910 xfree (demangled_name
);
913 (*slot
)->demangled
[0] = '\0';
916 gsymbol
->name
= (*slot
)->mangled
+ lookup_len
- len
;
917 if ((*slot
)->demangled
[0] != '\0')
918 symbol_set_demangled_name (gsymbol
, (*slot
)->demangled
,
919 &per_bfd
->storage_obstack
);
921 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
924 /* Return the source code name of a symbol. In languages where
925 demangling is necessary, this is the demangled name. */
928 symbol_natural_name (const struct general_symbol_info
*gsymbol
)
930 switch (gsymbol
->language
)
937 case language_fortran
:
938 if (symbol_get_demangled_name (gsymbol
) != NULL
)
939 return symbol_get_demangled_name (gsymbol
);
942 return ada_decode_symbol (gsymbol
);
946 return gsymbol
->name
;
949 /* Return the demangled name for a symbol based on the language for
950 that symbol. If no demangled name exists, return NULL. */
953 symbol_demangled_name (const struct general_symbol_info
*gsymbol
)
955 const char *dem_name
= NULL
;
957 switch (gsymbol
->language
)
964 case language_fortran
:
965 dem_name
= symbol_get_demangled_name (gsymbol
);
968 dem_name
= ada_decode_symbol (gsymbol
);
976 /* Return the search name of a symbol---generally the demangled or
977 linkage name of the symbol, depending on how it will be searched for.
978 If there is no distinct demangled name, then returns the same value
979 (same pointer) as SYMBOL_LINKAGE_NAME. */
982 symbol_search_name (const struct general_symbol_info
*gsymbol
)
984 if (gsymbol
->language
== language_ada
)
985 return gsymbol
->name
;
987 return symbol_natural_name (gsymbol
);
990 /* Initialize the structure fields to zero values. */
993 init_sal (struct symtab_and_line
*sal
)
995 memset (sal
, 0, sizeof (*sal
));
999 /* Return 1 if the two sections are the same, or if they could
1000 plausibly be copies of each other, one in an original object
1001 file and another in a separated debug file. */
1004 matching_obj_sections (struct obj_section
*obj_first
,
1005 struct obj_section
*obj_second
)
1007 asection
*first
= obj_first
? obj_first
->the_bfd_section
: NULL
;
1008 asection
*second
= obj_second
? obj_second
->the_bfd_section
: NULL
;
1009 struct objfile
*obj
;
1011 /* If they're the same section, then they match. */
1012 if (first
== second
)
1015 /* If either is NULL, give up. */
1016 if (first
== NULL
|| second
== NULL
)
1019 /* This doesn't apply to absolute symbols. */
1020 if (first
->owner
== NULL
|| second
->owner
== NULL
)
1023 /* If they're in the same object file, they must be different sections. */
1024 if (first
->owner
== second
->owner
)
1027 /* Check whether the two sections are potentially corresponding. They must
1028 have the same size, address, and name. We can't compare section indexes,
1029 which would be more reliable, because some sections may have been
1031 if (bfd_get_section_size (first
) != bfd_get_section_size (second
))
1034 /* In-memory addresses may start at a different offset, relativize them. */
1035 if (bfd_get_section_vma (first
->owner
, first
)
1036 - bfd_get_start_address (first
->owner
)
1037 != bfd_get_section_vma (second
->owner
, second
)
1038 - bfd_get_start_address (second
->owner
))
1041 if (bfd_get_section_name (first
->owner
, first
) == NULL
1042 || bfd_get_section_name (second
->owner
, second
) == NULL
1043 || strcmp (bfd_get_section_name (first
->owner
, first
),
1044 bfd_get_section_name (second
->owner
, second
)) != 0)
1047 /* Otherwise check that they are in corresponding objfiles. */
1050 if (obj
->obfd
== first
->owner
)
1052 gdb_assert (obj
!= NULL
);
1054 if (obj
->separate_debug_objfile
!= NULL
1055 && obj
->separate_debug_objfile
->obfd
== second
->owner
)
1057 if (obj
->separate_debug_objfile_backlink
!= NULL
1058 && obj
->separate_debug_objfile_backlink
->obfd
== second
->owner
)
1065 find_pc_sect_symtab_via_partial (CORE_ADDR pc
, struct obj_section
*section
)
1067 struct objfile
*objfile
;
1068 struct bound_minimal_symbol msymbol
;
1070 /* If we know that this is not a text address, return failure. This is
1071 necessary because we loop based on texthigh and textlow, which do
1072 not include the data ranges. */
1073 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
);
1075 && (MSYMBOL_TYPE (msymbol
.minsym
) == mst_data
1076 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_bss
1077 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_abs
1078 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_data
1079 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_bss
))
1082 ALL_OBJFILES (objfile
)
1084 struct symtab
*result
= NULL
;
1087 result
= objfile
->sf
->qf
->find_pc_sect_symtab (objfile
, msymbol
,
1096 /* Debug symbols usually don't have section information. We need to dig that
1097 out of the minimal symbols and stash that in the debug symbol. */
1100 fixup_section (struct general_symbol_info
*ginfo
,
1101 CORE_ADDR addr
, struct objfile
*objfile
)
1103 struct minimal_symbol
*msym
;
1105 /* First, check whether a minimal symbol with the same name exists
1106 and points to the same address. The address check is required
1107 e.g. on PowerPC64, where the minimal symbol for a function will
1108 point to the function descriptor, while the debug symbol will
1109 point to the actual function code. */
1110 msym
= lookup_minimal_symbol_by_pc_name (addr
, ginfo
->name
, objfile
);
1112 ginfo
->section
= MSYMBOL_SECTION (msym
);
1115 /* Static, function-local variables do appear in the linker
1116 (minimal) symbols, but are frequently given names that won't
1117 be found via lookup_minimal_symbol(). E.g., it has been
1118 observed in frv-uclinux (ELF) executables that a static,
1119 function-local variable named "foo" might appear in the
1120 linker symbols as "foo.6" or "foo.3". Thus, there is no
1121 point in attempting to extend the lookup-by-name mechanism to
1122 handle this case due to the fact that there can be multiple
1125 So, instead, search the section table when lookup by name has
1126 failed. The ``addr'' and ``endaddr'' fields may have already
1127 been relocated. If so, the relocation offset (i.e. the
1128 ANOFFSET value) needs to be subtracted from these values when
1129 performing the comparison. We unconditionally subtract it,
1130 because, when no relocation has been performed, the ANOFFSET
1131 value will simply be zero.
1133 The address of the symbol whose section we're fixing up HAS
1134 NOT BEEN adjusted (relocated) yet. It can't have been since
1135 the section isn't yet known and knowing the section is
1136 necessary in order to add the correct relocation value. In
1137 other words, we wouldn't even be in this function (attempting
1138 to compute the section) if it were already known.
1140 Note that it is possible to search the minimal symbols
1141 (subtracting the relocation value if necessary) to find the
1142 matching minimal symbol, but this is overkill and much less
1143 efficient. It is not necessary to find the matching minimal
1144 symbol, only its section.
1146 Note that this technique (of doing a section table search)
1147 can fail when unrelocated section addresses overlap. For
1148 this reason, we still attempt a lookup by name prior to doing
1149 a search of the section table. */
1151 struct obj_section
*s
;
1154 ALL_OBJFILE_OSECTIONS (objfile
, s
)
1156 int idx
= s
- objfile
->sections
;
1157 CORE_ADDR offset
= ANOFFSET (objfile
->section_offsets
, idx
);
1162 if (obj_section_addr (s
) - offset
<= addr
1163 && addr
< obj_section_endaddr (s
) - offset
)
1165 ginfo
->section
= idx
;
1170 /* If we didn't find the section, assume it is in the first
1171 section. If there is no allocated section, then it hardly
1172 matters what we pick, so just pick zero. */
1176 ginfo
->section
= fallback
;
1181 fixup_symbol_section (struct symbol
*sym
, struct objfile
*objfile
)
1188 /* We either have an OBJFILE, or we can get at it from the sym's
1189 symtab. Anything else is a bug. */
1190 gdb_assert (objfile
|| SYMBOL_SYMTAB (sym
));
1192 if (objfile
== NULL
)
1193 objfile
= SYMBOL_SYMTAB (sym
)->objfile
;
1195 if (SYMBOL_OBJ_SECTION (objfile
, sym
))
1198 /* We should have an objfile by now. */
1199 gdb_assert (objfile
);
1201 switch (SYMBOL_CLASS (sym
))
1205 addr
= SYMBOL_VALUE_ADDRESS (sym
);
1208 addr
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
1212 /* Nothing else will be listed in the minsyms -- no use looking
1217 fixup_section (&sym
->ginfo
, addr
, objfile
);
1222 /* Compute the demangled form of NAME as used by the various symbol
1223 lookup functions. The result is stored in *RESULT_NAME. Returns a
1224 cleanup which can be used to clean up the result.
1226 For Ada, this function just sets *RESULT_NAME to NAME, unmodified.
1227 Normally, Ada symbol lookups are performed using the encoded name
1228 rather than the demangled name, and so it might seem to make sense
1229 for this function to return an encoded version of NAME.
1230 Unfortunately, we cannot do this, because this function is used in
1231 circumstances where it is not appropriate to try to encode NAME.
1232 For instance, when displaying the frame info, we demangle the name
1233 of each parameter, and then perform a symbol lookup inside our
1234 function using that demangled name. In Ada, certain functions
1235 have internally-generated parameters whose name contain uppercase
1236 characters. Encoding those name would result in those uppercase
1237 characters to become lowercase, and thus cause the symbol lookup
1241 demangle_for_lookup (const char *name
, enum language lang
,
1242 const char **result_name
)
1244 char *demangled_name
= NULL
;
1245 const char *modified_name
= NULL
;
1246 struct cleanup
*cleanup
= make_cleanup (null_cleanup
, 0);
1248 modified_name
= name
;
1250 /* If we are using C++, D, Go, or Java, demangle the name before doing a
1251 lookup, so we can always binary search. */
1252 if (lang
== language_cplus
)
1254 demangled_name
= gdb_demangle (name
, DMGL_ANSI
| DMGL_PARAMS
);
1257 modified_name
= demangled_name
;
1258 make_cleanup (xfree
, demangled_name
);
1262 /* If we were given a non-mangled name, canonicalize it
1263 according to the language (so far only for C++). */
1264 demangled_name
= cp_canonicalize_string (name
);
1267 modified_name
= demangled_name
;
1268 make_cleanup (xfree
, demangled_name
);
1272 else if (lang
== language_java
)
1274 demangled_name
= gdb_demangle (name
,
1275 DMGL_ANSI
| DMGL_PARAMS
| DMGL_JAVA
);
1278 modified_name
= demangled_name
;
1279 make_cleanup (xfree
, demangled_name
);
1282 else if (lang
== language_d
)
1284 demangled_name
= d_demangle (name
, 0);
1287 modified_name
= demangled_name
;
1288 make_cleanup (xfree
, demangled_name
);
1291 else if (lang
== language_go
)
1293 demangled_name
= go_demangle (name
, 0);
1296 modified_name
= demangled_name
;
1297 make_cleanup (xfree
, demangled_name
);
1301 *result_name
= modified_name
;
1305 /* Find the definition for a specified symbol name NAME
1306 in domain DOMAIN, visible from lexical block BLOCK.
1307 Returns the struct symbol pointer, or zero if no symbol is found.
1308 C++: if IS_A_FIELD_OF_THIS is nonzero on entry, check to see if
1309 NAME is a field of the current implied argument `this'. If so set
1310 *IS_A_FIELD_OF_THIS to 1, otherwise set it to zero.
1311 BLOCK_FOUND is set to the block in which NAME is found (in the case of
1312 a field of `this', value_of_this sets BLOCK_FOUND to the proper value.) */
1314 /* This function (or rather its subordinates) have a bunch of loops and
1315 it would seem to be attractive to put in some QUIT's (though I'm not really
1316 sure whether it can run long enough to be really important). But there
1317 are a few calls for which it would appear to be bad news to quit
1318 out of here: e.g., find_proc_desc in alpha-mdebug-tdep.c. (Note
1319 that there is C++ code below which can error(), but that probably
1320 doesn't affect these calls since they are looking for a known
1321 variable and thus can probably assume it will never hit the C++
1325 lookup_symbol_in_language (const char *name
, const struct block
*block
,
1326 const domain_enum domain
, enum language lang
,
1327 struct field_of_this_result
*is_a_field_of_this
)
1329 const char *modified_name
;
1330 struct symbol
*returnval
;
1331 struct cleanup
*cleanup
= demangle_for_lookup (name
, lang
, &modified_name
);
1333 returnval
= lookup_symbol_aux (modified_name
, block
, domain
, lang
,
1334 is_a_field_of_this
);
1335 do_cleanups (cleanup
);
1340 /* Behave like lookup_symbol_in_language, but performed with the
1341 current language. */
1344 lookup_symbol (const char *name
, const struct block
*block
,
1346 struct field_of_this_result
*is_a_field_of_this
)
1348 return lookup_symbol_in_language (name
, block
, domain
,
1349 current_language
->la_language
,
1350 is_a_field_of_this
);
1353 /* Look up the `this' symbol for LANG in BLOCK. Return the symbol if
1354 found, or NULL if not found. */
1357 lookup_language_this (const struct language_defn
*lang
,
1358 const struct block
*block
)
1360 if (lang
->la_name_of_this
== NULL
|| block
== NULL
)
1367 sym
= lookup_block_symbol (block
, lang
->la_name_of_this
, VAR_DOMAIN
);
1370 block_found
= block
;
1373 if (BLOCK_FUNCTION (block
))
1375 block
= BLOCK_SUPERBLOCK (block
);
1381 /* Given TYPE, a structure/union,
1382 return 1 if the component named NAME from the ultimate target
1383 structure/union is defined, otherwise, return 0. */
1386 check_field (struct type
*type
, const char *name
,
1387 struct field_of_this_result
*is_a_field_of_this
)
1391 /* The type may be a stub. */
1392 CHECK_TYPEDEF (type
);
1394 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
1396 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1398 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1400 is_a_field_of_this
->type
= type
;
1401 is_a_field_of_this
->field
= &TYPE_FIELD (type
, i
);
1406 /* C++: If it was not found as a data field, then try to return it
1407 as a pointer to a method. */
1409 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
1411 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
1413 is_a_field_of_this
->type
= type
;
1414 is_a_field_of_this
->fn_field
= &TYPE_FN_FIELDLIST (type
, i
);
1419 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1420 if (check_field (TYPE_BASECLASS (type
, i
), name
, is_a_field_of_this
))
1426 /* Behave like lookup_symbol except that NAME is the natural name
1427 (e.g., demangled name) of the symbol that we're looking for. */
1429 static struct symbol
*
1430 lookup_symbol_aux (const char *name
, const struct block
*block
,
1431 const domain_enum domain
, enum language language
,
1432 struct field_of_this_result
*is_a_field_of_this
)
1435 const struct language_defn
*langdef
;
1437 /* Make sure we do something sensible with is_a_field_of_this, since
1438 the callers that set this parameter to some non-null value will
1439 certainly use it later. If we don't set it, the contents of
1440 is_a_field_of_this are undefined. */
1441 if (is_a_field_of_this
!= NULL
)
1442 memset (is_a_field_of_this
, 0, sizeof (*is_a_field_of_this
));
1444 /* Search specified block and its superiors. Don't search
1445 STATIC_BLOCK or GLOBAL_BLOCK. */
1447 sym
= lookup_symbol_aux_local (name
, block
, domain
, language
);
1451 /* If requested to do so by the caller and if appropriate for LANGUAGE,
1452 check to see if NAME is a field of `this'. */
1454 langdef
= language_def (language
);
1456 /* Don't do this check if we are searching for a struct. It will
1457 not be found by check_field, but will be found by other
1459 if (is_a_field_of_this
!= NULL
&& domain
!= STRUCT_DOMAIN
)
1461 struct symbol
*sym
= lookup_language_this (langdef
, block
);
1465 struct type
*t
= sym
->type
;
1467 /* I'm not really sure that type of this can ever
1468 be typedefed; just be safe. */
1470 if (TYPE_CODE (t
) == TYPE_CODE_PTR
1471 || TYPE_CODE (t
) == TYPE_CODE_REF
)
1472 t
= TYPE_TARGET_TYPE (t
);
1474 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1475 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1476 error (_("Internal error: `%s' is not an aggregate"),
1477 langdef
->la_name_of_this
);
1479 if (check_field (t
, name
, is_a_field_of_this
))
1484 /* Now do whatever is appropriate for LANGUAGE to look
1485 up static and global variables. */
1487 sym
= langdef
->la_lookup_symbol_nonlocal (name
, block
, domain
);
1491 /* Now search all static file-level symbols. Not strictly correct,
1492 but more useful than an error. */
1494 return lookup_static_symbol_aux (name
, domain
);
1497 /* Search all static file-level symbols for NAME from DOMAIN. Do the symtabs
1498 first, then check the psymtabs. If a psymtab indicates the existence of the
1499 desired name as a file-level static, then do psymtab-to-symtab conversion on
1500 the fly and return the found symbol. */
1503 lookup_static_symbol_aux (const char *name
, const domain_enum domain
)
1505 struct objfile
*objfile
;
1508 sym
= lookup_symbol_aux_symtabs (STATIC_BLOCK
, name
, domain
);
1512 ALL_OBJFILES (objfile
)
1514 sym
= lookup_symbol_aux_quick (objfile
, STATIC_BLOCK
, name
, domain
);
1522 /* Check to see if the symbol is defined in BLOCK or its superiors.
1523 Don't search STATIC_BLOCK or GLOBAL_BLOCK. */
1525 static struct symbol
*
1526 lookup_symbol_aux_local (const char *name
, const struct block
*block
,
1527 const domain_enum domain
,
1528 enum language language
)
1531 const struct block
*static_block
= block_static_block (block
);
1532 const char *scope
= block_scope (block
);
1534 /* Check if either no block is specified or it's a global block. */
1536 if (static_block
== NULL
)
1539 while (block
!= static_block
)
1541 sym
= lookup_symbol_aux_block (name
, block
, domain
);
1545 if (language
== language_cplus
|| language
== language_fortran
)
1547 sym
= cp_lookup_symbol_imports_or_template (scope
, name
, block
,
1553 if (BLOCK_FUNCTION (block
) != NULL
&& block_inlined_p (block
))
1555 block
= BLOCK_SUPERBLOCK (block
);
1558 /* We've reached the edge of the function without finding a result. */
1563 /* Look up OBJFILE to BLOCK. */
1566 lookup_objfile_from_block (const struct block
*block
)
1568 struct objfile
*obj
;
1574 block
= block_global_block (block
);
1575 /* Go through SYMTABS. */
1576 ALL_SYMTABS (obj
, s
)
1577 if (block
== BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
))
1579 if (obj
->separate_debug_objfile_backlink
)
1580 obj
= obj
->separate_debug_objfile_backlink
;
1588 /* Look up a symbol in a block; if found, fixup the symbol, and set
1589 block_found appropriately. */
1592 lookup_symbol_aux_block (const char *name
, const struct block
*block
,
1593 const domain_enum domain
)
1597 sym
= lookup_block_symbol (block
, name
, domain
);
1600 block_found
= block
;
1601 return fixup_symbol_section (sym
, NULL
);
1607 /* Check all global symbols in OBJFILE in symtabs and
1611 lookup_global_symbol_from_objfile (const struct objfile
*main_objfile
,
1613 const domain_enum domain
)
1615 const struct objfile
*objfile
;
1617 const struct blockvector
*bv
;
1618 const struct block
*block
;
1621 for (objfile
= main_objfile
;
1623 objfile
= objfile_separate_debug_iterate (main_objfile
, objfile
))
1625 /* Go through symtabs. */
1626 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1628 bv
= BLOCKVECTOR (s
);
1629 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1630 sym
= lookup_block_symbol (block
, name
, domain
);
1633 block_found
= block
;
1634 return fixup_symbol_section (sym
, (struct objfile
*)objfile
);
1638 sym
= lookup_symbol_aux_quick ((struct objfile
*) objfile
, GLOBAL_BLOCK
,
1647 /* Check to see if the symbol is defined in one of the OBJFILE's
1648 symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK,
1649 depending on whether or not we want to search global symbols or
1652 static struct symbol
*
1653 lookup_symbol_aux_objfile (struct objfile
*objfile
, int block_index
,
1654 const char *name
, const domain_enum domain
)
1656 struct symbol
*sym
= NULL
;
1657 const struct blockvector
*bv
;
1658 const struct block
*block
;
1661 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1663 bv
= BLOCKVECTOR (s
);
1664 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1665 sym
= lookup_block_symbol (block
, name
, domain
);
1668 block_found
= block
;
1669 return fixup_symbol_section (sym
, objfile
);
1676 /* Same as lookup_symbol_aux_objfile, except that it searches all
1677 objfiles. Return the first match found. */
1679 static struct symbol
*
1680 lookup_symbol_aux_symtabs (int block_index
, const char *name
,
1681 const domain_enum domain
)
1684 struct objfile
*objfile
;
1686 ALL_OBJFILES (objfile
)
1688 sym
= lookup_symbol_aux_objfile (objfile
, block_index
, name
, domain
);
1696 /* Wrapper around lookup_symbol_aux_objfile for search_symbols.
1697 Look up LINKAGE_NAME in DOMAIN in the global and static blocks of OBJFILE
1698 and all related objfiles. */
1700 static struct symbol
*
1701 lookup_symbol_in_objfile_from_linkage_name (struct objfile
*objfile
,
1702 const char *linkage_name
,
1705 enum language lang
= current_language
->la_language
;
1706 const char *modified_name
;
1707 struct cleanup
*cleanup
= demangle_for_lookup (linkage_name
, lang
,
1709 struct objfile
*main_objfile
, *cur_objfile
;
1711 if (objfile
->separate_debug_objfile_backlink
)
1712 main_objfile
= objfile
->separate_debug_objfile_backlink
;
1714 main_objfile
= objfile
;
1716 for (cur_objfile
= main_objfile
;
1718 cur_objfile
= objfile_separate_debug_iterate (main_objfile
, cur_objfile
))
1722 sym
= lookup_symbol_aux_objfile (cur_objfile
, GLOBAL_BLOCK
,
1723 modified_name
, domain
);
1725 sym
= lookup_symbol_aux_objfile (cur_objfile
, STATIC_BLOCK
,
1726 modified_name
, domain
);
1729 do_cleanups (cleanup
);
1734 do_cleanups (cleanup
);
1738 /* A helper function that throws an exception when a symbol was found
1739 in a psymtab but not in a symtab. */
1741 static void ATTRIBUTE_NORETURN
1742 error_in_psymtab_expansion (int kind
, const char *name
, struct symtab
*symtab
)
1745 Internal: %s symbol `%s' found in %s psymtab but not in symtab.\n\
1746 %s may be an inlined function, or may be a template function\n \
1747 (if a template, try specifying an instantiation: %s<type>)."),
1748 kind
== GLOBAL_BLOCK
? "global" : "static",
1749 name
, symtab_to_filename_for_display (symtab
), name
, name
);
1752 /* A helper function for lookup_symbol_aux that interfaces with the
1753 "quick" symbol table functions. */
1755 static struct symbol
*
1756 lookup_symbol_aux_quick (struct objfile
*objfile
, int kind
,
1757 const char *name
, const domain_enum domain
)
1759 struct symtab
*symtab
;
1760 const struct blockvector
*bv
;
1761 const struct block
*block
;
1766 symtab
= objfile
->sf
->qf
->lookup_symbol (objfile
, kind
, name
, domain
);
1770 bv
= BLOCKVECTOR (symtab
);
1771 block
= BLOCKVECTOR_BLOCK (bv
, kind
);
1772 sym
= lookup_block_symbol (block
, name
, domain
);
1774 error_in_psymtab_expansion (kind
, name
, symtab
);
1775 return fixup_symbol_section (sym
, objfile
);
1778 /* A default version of lookup_symbol_nonlocal for use by languages
1779 that can't think of anything better to do. This implements the C
1783 basic_lookup_symbol_nonlocal (const char *name
,
1784 const struct block
*block
,
1785 const domain_enum domain
)
1789 /* NOTE: carlton/2003-05-19: The comments below were written when
1790 this (or what turned into this) was part of lookup_symbol_aux;
1791 I'm much less worried about these questions now, since these
1792 decisions have turned out well, but I leave these comments here
1795 /* NOTE: carlton/2002-12-05: There is a question as to whether or
1796 not it would be appropriate to search the current global block
1797 here as well. (That's what this code used to do before the
1798 is_a_field_of_this check was moved up.) On the one hand, it's
1799 redundant with the lookup_symbol_aux_symtabs search that happens
1800 next. On the other hand, if decode_line_1 is passed an argument
1801 like filename:var, then the user presumably wants 'var' to be
1802 searched for in filename. On the third hand, there shouldn't be
1803 multiple global variables all of which are named 'var', and it's
1804 not like decode_line_1 has ever restricted its search to only
1805 global variables in a single filename. All in all, only
1806 searching the static block here seems best: it's correct and it's
1809 /* NOTE: carlton/2002-12-05: There's also a possible performance
1810 issue here: if you usually search for global symbols in the
1811 current file, then it would be slightly better to search the
1812 current global block before searching all the symtabs. But there
1813 are other factors that have a much greater effect on performance
1814 than that one, so I don't think we should worry about that for
1817 sym
= lookup_symbol_static (name
, block
, domain
);
1821 return lookup_symbol_global (name
, block
, domain
);
1824 /* Lookup a symbol in the static block associated to BLOCK, if there
1825 is one; do nothing if BLOCK is NULL or a global block. */
1828 lookup_symbol_static (const char *name
,
1829 const struct block
*block
,
1830 const domain_enum domain
)
1832 const struct block
*static_block
= block_static_block (block
);
1834 if (static_block
!= NULL
)
1835 return lookup_symbol_aux_block (name
, static_block
, domain
);
1840 /* Private data to be used with lookup_symbol_global_iterator_cb. */
1842 struct global_sym_lookup_data
1844 /* The name of the symbol we are searching for. */
1847 /* The domain to use for our search. */
1850 /* The field where the callback should store the symbol if found.
1851 It should be initialized to NULL before the search is started. */
1852 struct symbol
*result
;
1855 /* A callback function for gdbarch_iterate_over_objfiles_in_search_order.
1856 It searches by name for a symbol in the GLOBAL_BLOCK of the given
1857 OBJFILE. The arguments for the search are passed via CB_DATA,
1858 which in reality is a pointer to struct global_sym_lookup_data. */
1861 lookup_symbol_global_iterator_cb (struct objfile
*objfile
,
1864 struct global_sym_lookup_data
*data
=
1865 (struct global_sym_lookup_data
*) cb_data
;
1867 gdb_assert (data
->result
== NULL
);
1869 data
->result
= lookup_symbol_aux_objfile (objfile
, GLOBAL_BLOCK
,
1870 data
->name
, data
->domain
);
1871 if (data
->result
== NULL
)
1872 data
->result
= lookup_symbol_aux_quick (objfile
, GLOBAL_BLOCK
,
1873 data
->name
, data
->domain
);
1875 /* If we found a match, tell the iterator to stop. Otherwise,
1877 return (data
->result
!= NULL
);
1880 /* Lookup a symbol in all files' global blocks (searching psymtabs if
1884 lookup_symbol_global (const char *name
,
1885 const struct block
*block
,
1886 const domain_enum domain
)
1888 struct symbol
*sym
= NULL
;
1889 struct objfile
*objfile
= NULL
;
1890 struct global_sym_lookup_data lookup_data
;
1892 /* Call library-specific lookup procedure. */
1893 objfile
= lookup_objfile_from_block (block
);
1894 if (objfile
!= NULL
)
1895 sym
= solib_global_lookup (objfile
, name
, domain
);
1899 memset (&lookup_data
, 0, sizeof (lookup_data
));
1900 lookup_data
.name
= name
;
1901 lookup_data
.domain
= domain
;
1902 gdbarch_iterate_over_objfiles_in_search_order
1903 (objfile
!= NULL
? get_objfile_arch (objfile
) : target_gdbarch (),
1904 lookup_symbol_global_iterator_cb
, &lookup_data
, objfile
);
1906 return lookup_data
.result
;
1910 symbol_matches_domain (enum language symbol_language
,
1911 domain_enum symbol_domain
,
1914 /* For C++ "struct foo { ... }" also defines a typedef for "foo".
1915 A Java class declaration also defines a typedef for the class.
1916 Similarly, any Ada type declaration implicitly defines a typedef. */
1917 if (symbol_language
== language_cplus
1918 || symbol_language
== language_d
1919 || symbol_language
== language_java
1920 || symbol_language
== language_ada
)
1922 if ((domain
== VAR_DOMAIN
|| domain
== STRUCT_DOMAIN
)
1923 && symbol_domain
== STRUCT_DOMAIN
)
1926 /* For all other languages, strict match is required. */
1927 return (symbol_domain
== domain
);
1930 /* Look up a type named NAME in the struct_domain. The type returned
1931 must not be opaque -- i.e., must have at least one field
1935 lookup_transparent_type (const char *name
)
1937 return current_language
->la_lookup_transparent_type (name
);
1940 /* A helper for basic_lookup_transparent_type that interfaces with the
1941 "quick" symbol table functions. */
1943 static struct type
*
1944 basic_lookup_transparent_type_quick (struct objfile
*objfile
, int kind
,
1947 struct symtab
*symtab
;
1948 const struct blockvector
*bv
;
1949 struct block
*block
;
1954 symtab
= objfile
->sf
->qf
->lookup_symbol (objfile
, kind
, name
, STRUCT_DOMAIN
);
1958 bv
= BLOCKVECTOR (symtab
);
1959 block
= BLOCKVECTOR_BLOCK (bv
, kind
);
1960 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
1962 error_in_psymtab_expansion (kind
, name
, symtab
);
1964 if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1965 return SYMBOL_TYPE (sym
);
1970 /* The standard implementation of lookup_transparent_type. This code
1971 was modeled on lookup_symbol -- the parts not relevant to looking
1972 up types were just left out. In particular it's assumed here that
1973 types are available in struct_domain and only at file-static or
1977 basic_lookup_transparent_type (const char *name
)
1980 struct symtab
*s
= NULL
;
1981 const struct blockvector
*bv
;
1982 struct objfile
*objfile
;
1983 struct block
*block
;
1986 /* Now search all the global symbols. Do the symtab's first, then
1987 check the psymtab's. If a psymtab indicates the existence
1988 of the desired name as a global, then do psymtab-to-symtab
1989 conversion on the fly and return the found symbol. */
1991 ALL_OBJFILES (objfile
)
1993 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1995 bv
= BLOCKVECTOR (s
);
1996 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1997 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
1998 if (sym
&& !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
2000 return SYMBOL_TYPE (sym
);
2005 ALL_OBJFILES (objfile
)
2007 t
= basic_lookup_transparent_type_quick (objfile
, GLOBAL_BLOCK
, name
);
2012 /* Now search the static file-level symbols.
2013 Not strictly correct, but more useful than an error.
2014 Do the symtab's first, then
2015 check the psymtab's. If a psymtab indicates the existence
2016 of the desired name as a file-level static, then do psymtab-to-symtab
2017 conversion on the fly and return the found symbol. */
2019 ALL_OBJFILES (objfile
)
2021 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
2023 bv
= BLOCKVECTOR (s
);
2024 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
2025 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
2026 if (sym
&& !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
2028 return SYMBOL_TYPE (sym
);
2033 ALL_OBJFILES (objfile
)
2035 t
= basic_lookup_transparent_type_quick (objfile
, STATIC_BLOCK
, name
);
2040 return (struct type
*) 0;
2043 /* Search BLOCK for symbol NAME in DOMAIN.
2045 Note that if NAME is the demangled form of a C++ symbol, we will fail
2046 to find a match during the binary search of the non-encoded names, but
2047 for now we don't worry about the slight inefficiency of looking for
2048 a match we'll never find, since it will go pretty quick. Once the
2049 binary search terminates, we drop through and do a straight linear
2050 search on the symbols. Each symbol which is marked as being a ObjC/C++
2051 symbol (language_cplus or language_objc set) has both the encoded and
2052 non-encoded names tested for a match. */
2055 lookup_block_symbol (const struct block
*block
, const char *name
,
2056 const domain_enum domain
)
2058 struct block_iterator iter
;
2061 if (!BLOCK_FUNCTION (block
))
2063 for (sym
= block_iter_name_first (block
, name
, &iter
);
2065 sym
= block_iter_name_next (name
, &iter
))
2067 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2068 SYMBOL_DOMAIN (sym
), domain
))
2075 /* Note that parameter symbols do not always show up last in the
2076 list; this loop makes sure to take anything else other than
2077 parameter symbols first; it only uses parameter symbols as a
2078 last resort. Note that this only takes up extra computation
2081 struct symbol
*sym_found
= NULL
;
2083 for (sym
= block_iter_name_first (block
, name
, &iter
);
2085 sym
= block_iter_name_next (name
, &iter
))
2087 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2088 SYMBOL_DOMAIN (sym
), domain
))
2091 if (!SYMBOL_IS_ARGUMENT (sym
))
2097 return (sym_found
); /* Will be NULL if not found. */
2101 /* Iterate over the symbols named NAME, matching DOMAIN, in BLOCK.
2103 For each symbol that matches, CALLBACK is called. The symbol and
2104 DATA are passed to the callback.
2106 If CALLBACK returns zero, the iteration ends. Otherwise, the
2107 search continues. */
2110 iterate_over_symbols (const struct block
*block
, const char *name
,
2111 const domain_enum domain
,
2112 symbol_found_callback_ftype
*callback
,
2115 struct block_iterator iter
;
2118 for (sym
= block_iter_name_first (block
, name
, &iter
);
2120 sym
= block_iter_name_next (name
, &iter
))
2122 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2123 SYMBOL_DOMAIN (sym
), domain
))
2125 if (!callback (sym
, data
))
2131 /* Find the symtab associated with PC and SECTION. Look through the
2132 psymtabs and read in another symtab if necessary. */
2135 find_pc_sect_symtab (CORE_ADDR pc
, struct obj_section
*section
)
2138 const struct blockvector
*bv
;
2139 struct symtab
*s
= NULL
;
2140 struct symtab
*best_s
= NULL
;
2141 struct objfile
*objfile
;
2142 CORE_ADDR distance
= 0;
2143 struct bound_minimal_symbol msymbol
;
2145 /* If we know that this is not a text address, return failure. This is
2146 necessary because we loop based on the block's high and low code
2147 addresses, which do not include the data ranges, and because
2148 we call find_pc_sect_psymtab which has a similar restriction based
2149 on the partial_symtab's texthigh and textlow. */
2150 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
);
2152 && (MSYMBOL_TYPE (msymbol
.minsym
) == mst_data
2153 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_bss
2154 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_abs
2155 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_data
2156 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_bss
))
2159 /* Search all symtabs for the one whose file contains our address, and which
2160 is the smallest of all the ones containing the address. This is designed
2161 to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000
2162 and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from
2163 0x1000-0x4000, but for address 0x2345 we want to return symtab b.
2165 This happens for native ecoff format, where code from included files
2166 gets its own symtab. The symtab for the included file should have
2167 been read in already via the dependency mechanism.
2168 It might be swifter to create several symtabs with the same name
2169 like xcoff does (I'm not sure).
2171 It also happens for objfiles that have their functions reordered.
2172 For these, the symtab we are looking for is not necessarily read in. */
2174 ALL_PRIMARY_SYMTABS (objfile
, s
)
2176 bv
= BLOCKVECTOR (s
);
2177 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
2179 if (BLOCK_START (b
) <= pc
2180 && BLOCK_END (b
) > pc
2182 || BLOCK_END (b
) - BLOCK_START (b
) < distance
))
2184 /* For an objfile that has its functions reordered,
2185 find_pc_psymtab will find the proper partial symbol table
2186 and we simply return its corresponding symtab. */
2187 /* In order to better support objfiles that contain both
2188 stabs and coff debugging info, we continue on if a psymtab
2190 if ((objfile
->flags
& OBJF_REORDERED
) && objfile
->sf
)
2192 struct symtab
*result
;
2195 = objfile
->sf
->qf
->find_pc_sect_symtab (objfile
,
2204 struct block_iterator iter
;
2205 struct symbol
*sym
= NULL
;
2207 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
2209 fixup_symbol_section (sym
, objfile
);
2210 if (matching_obj_sections (SYMBOL_OBJ_SECTION (objfile
, sym
),
2215 continue; /* No symbol in this symtab matches
2218 distance
= BLOCK_END (b
) - BLOCK_START (b
);
2226 /* Not found in symtabs, search the "quick" symtabs (e.g. psymtabs). */
2228 ALL_OBJFILES (objfile
)
2230 struct symtab
*result
;
2234 result
= objfile
->sf
->qf
->find_pc_sect_symtab (objfile
,
2245 /* Find the symtab associated with PC. Look through the psymtabs and read
2246 in another symtab if necessary. Backward compatibility, no section. */
2249 find_pc_symtab (CORE_ADDR pc
)
2251 return find_pc_sect_symtab (pc
, find_pc_mapped_section (pc
));
2255 /* Find the source file and line number for a given PC value and SECTION.
2256 Return a structure containing a symtab pointer, a line number,
2257 and a pc range for the entire source line.
2258 The value's .pc field is NOT the specified pc.
2259 NOTCURRENT nonzero means, if specified pc is on a line boundary,
2260 use the line that ends there. Otherwise, in that case, the line
2261 that begins there is used. */
2263 /* The big complication here is that a line may start in one file, and end just
2264 before the start of another file. This usually occurs when you #include
2265 code in the middle of a subroutine. To properly find the end of a line's PC
2266 range, we must search all symtabs associated with this compilation unit, and
2267 find the one whose first PC is closer than that of the next line in this
2270 /* If it's worth the effort, we could be using a binary search. */
2272 struct symtab_and_line
2273 find_pc_sect_line (CORE_ADDR pc
, struct obj_section
*section
, int notcurrent
)
2276 struct linetable
*l
;
2279 struct linetable_entry
*item
;
2280 struct symtab_and_line val
;
2281 const struct blockvector
*bv
;
2282 struct bound_minimal_symbol msymbol
;
2283 struct objfile
*objfile
;
2285 /* Info on best line seen so far, and where it starts, and its file. */
2287 struct linetable_entry
*best
= NULL
;
2288 CORE_ADDR best_end
= 0;
2289 struct symtab
*best_symtab
= 0;
2291 /* Store here the first line number
2292 of a file which contains the line at the smallest pc after PC.
2293 If we don't find a line whose range contains PC,
2294 we will use a line one less than this,
2295 with a range from the start of that file to the first line's pc. */
2296 struct linetable_entry
*alt
= NULL
;
2298 /* Info on best line seen in this file. */
2300 struct linetable_entry
*prev
;
2302 /* If this pc is not from the current frame,
2303 it is the address of the end of a call instruction.
2304 Quite likely that is the start of the following statement.
2305 But what we want is the statement containing the instruction.
2306 Fudge the pc to make sure we get that. */
2308 init_sal (&val
); /* initialize to zeroes */
2310 val
.pspace
= current_program_space
;
2312 /* It's tempting to assume that, if we can't find debugging info for
2313 any function enclosing PC, that we shouldn't search for line
2314 number info, either. However, GAS can emit line number info for
2315 assembly files --- very helpful when debugging hand-written
2316 assembly code. In such a case, we'd have no debug info for the
2317 function, but we would have line info. */
2322 /* elz: added this because this function returned the wrong
2323 information if the pc belongs to a stub (import/export)
2324 to call a shlib function. This stub would be anywhere between
2325 two functions in the target, and the line info was erroneously
2326 taken to be the one of the line before the pc. */
2328 /* RT: Further explanation:
2330 * We have stubs (trampolines) inserted between procedures.
2332 * Example: "shr1" exists in a shared library, and a "shr1" stub also
2333 * exists in the main image.
2335 * In the minimal symbol table, we have a bunch of symbols
2336 * sorted by start address. The stubs are marked as "trampoline",
2337 * the others appear as text. E.g.:
2339 * Minimal symbol table for main image
2340 * main: code for main (text symbol)
2341 * shr1: stub (trampoline symbol)
2342 * foo: code for foo (text symbol)
2344 * Minimal symbol table for "shr1" image:
2346 * shr1: code for shr1 (text symbol)
2349 * So the code below is trying to detect if we are in the stub
2350 * ("shr1" stub), and if so, find the real code ("shr1" trampoline),
2351 * and if found, do the symbolization from the real-code address
2352 * rather than the stub address.
2354 * Assumptions being made about the minimal symbol table:
2355 * 1. lookup_minimal_symbol_by_pc() will return a trampoline only
2356 * if we're really in the trampoline.s If we're beyond it (say
2357 * we're in "foo" in the above example), it'll have a closer
2358 * symbol (the "foo" text symbol for example) and will not
2359 * return the trampoline.
2360 * 2. lookup_minimal_symbol_text() will find a real text symbol
2361 * corresponding to the trampoline, and whose address will
2362 * be different than the trampoline address. I put in a sanity
2363 * check for the address being the same, to avoid an
2364 * infinite recursion.
2366 msymbol
= lookup_minimal_symbol_by_pc (pc
);
2367 if (msymbol
.minsym
!= NULL
)
2368 if (MSYMBOL_TYPE (msymbol
.minsym
) == mst_solib_trampoline
)
2370 struct bound_minimal_symbol mfunsym
2371 = lookup_minimal_symbol_text (MSYMBOL_LINKAGE_NAME (msymbol
.minsym
),
2374 if (mfunsym
.minsym
== NULL
)
2375 /* I eliminated this warning since it is coming out
2376 * in the following situation:
2377 * gdb shmain // test program with shared libraries
2378 * (gdb) break shr1 // function in shared lib
2379 * Warning: In stub for ...
2380 * In the above situation, the shared lib is not loaded yet,
2381 * so of course we can't find the real func/line info,
2382 * but the "break" still works, and the warning is annoying.
2383 * So I commented out the warning. RT */
2384 /* warning ("In stub for %s; unable to find real function/line info",
2385 SYMBOL_LINKAGE_NAME (msymbol)); */
2388 else if (BMSYMBOL_VALUE_ADDRESS (mfunsym
)
2389 == BMSYMBOL_VALUE_ADDRESS (msymbol
))
2390 /* Avoid infinite recursion */
2391 /* See above comment about why warning is commented out. */
2392 /* warning ("In stub for %s; unable to find real function/line info",
2393 SYMBOL_LINKAGE_NAME (msymbol)); */
2397 return find_pc_line (BMSYMBOL_VALUE_ADDRESS (mfunsym
), 0);
2401 s
= find_pc_sect_symtab (pc
, section
);
2404 /* If no symbol information, return previous pc. */
2411 bv
= BLOCKVECTOR (s
);
2412 objfile
= s
->objfile
;
2414 /* Look at all the symtabs that share this blockvector.
2415 They all have the same apriori range, that we found was right;
2416 but they have different line tables. */
2418 ALL_OBJFILE_SYMTABS (objfile
, s
)
2420 if (BLOCKVECTOR (s
) != bv
)
2423 /* Find the best line in this symtab. */
2430 /* I think len can be zero if the symtab lacks line numbers
2431 (e.g. gcc -g1). (Either that or the LINETABLE is NULL;
2432 I'm not sure which, and maybe it depends on the symbol
2438 item
= l
->item
; /* Get first line info. */
2440 /* Is this file's first line closer than the first lines of other files?
2441 If so, record this file, and its first line, as best alternate. */
2442 if (item
->pc
> pc
&& (!alt
|| item
->pc
< alt
->pc
))
2445 for (i
= 0; i
< len
; i
++, item
++)
2447 /* Leave prev pointing to the linetable entry for the last line
2448 that started at or before PC. */
2455 /* At this point, prev points at the line whose start addr is <= pc, and
2456 item points at the next line. If we ran off the end of the linetable
2457 (pc >= start of the last line), then prev == item. If pc < start of
2458 the first line, prev will not be set. */
2460 /* Is this file's best line closer than the best in the other files?
2461 If so, record this file, and its best line, as best so far. Don't
2462 save prev if it represents the end of a function (i.e. line number
2463 0) instead of a real line. */
2465 if (prev
&& prev
->line
&& (!best
|| prev
->pc
> best
->pc
))
2470 /* Discard BEST_END if it's before the PC of the current BEST. */
2471 if (best_end
<= best
->pc
)
2475 /* If another line (denoted by ITEM) is in the linetable and its
2476 PC is after BEST's PC, but before the current BEST_END, then
2477 use ITEM's PC as the new best_end. */
2478 if (best
&& i
< len
&& item
->pc
> best
->pc
2479 && (best_end
== 0 || best_end
> item
->pc
))
2480 best_end
= item
->pc
;
2485 /* If we didn't find any line number info, just return zeros.
2486 We used to return alt->line - 1 here, but that could be
2487 anywhere; if we don't have line number info for this PC,
2488 don't make some up. */
2491 else if (best
->line
== 0)
2493 /* If our best fit is in a range of PC's for which no line
2494 number info is available (line number is zero) then we didn't
2495 find any valid line information. */
2500 val
.symtab
= best_symtab
;
2501 val
.line
= best
->line
;
2503 if (best_end
&& (!alt
|| best_end
< alt
->pc
))
2508 val
.end
= BLOCK_END (BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
));
2510 val
.section
= section
;
2514 /* Backward compatibility (no section). */
2516 struct symtab_and_line
2517 find_pc_line (CORE_ADDR pc
, int notcurrent
)
2519 struct obj_section
*section
;
2521 section
= find_pc_overlay (pc
);
2522 if (pc_in_unmapped_range (pc
, section
))
2523 pc
= overlay_mapped_address (pc
, section
);
2524 return find_pc_sect_line (pc
, section
, notcurrent
);
2527 /* Find line number LINE in any symtab whose name is the same as
2530 If found, return the symtab that contains the linetable in which it was
2531 found, set *INDEX to the index in the linetable of the best entry
2532 found, and set *EXACT_MATCH nonzero if the value returned is an
2535 If not found, return NULL. */
2538 find_line_symtab (struct symtab
*symtab
, int line
,
2539 int *index
, int *exact_match
)
2541 int exact
= 0; /* Initialized here to avoid a compiler warning. */
2543 /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE
2547 struct linetable
*best_linetable
;
2548 struct symtab
*best_symtab
;
2550 /* First try looking it up in the given symtab. */
2551 best_linetable
= LINETABLE (symtab
);
2552 best_symtab
= symtab
;
2553 best_index
= find_line_common (best_linetable
, line
, &exact
, 0);
2554 if (best_index
< 0 || !exact
)
2556 /* Didn't find an exact match. So we better keep looking for
2557 another symtab with the same name. In the case of xcoff,
2558 multiple csects for one source file (produced by IBM's FORTRAN
2559 compiler) produce multiple symtabs (this is unavoidable
2560 assuming csects can be at arbitrary places in memory and that
2561 the GLOBAL_BLOCK of a symtab has a begin and end address). */
2563 /* BEST is the smallest linenumber > LINE so far seen,
2564 or 0 if none has been seen so far.
2565 BEST_INDEX and BEST_LINETABLE identify the item for it. */
2568 struct objfile
*objfile
;
2571 if (best_index
>= 0)
2572 best
= best_linetable
->item
[best_index
].line
;
2576 ALL_OBJFILES (objfile
)
2579 objfile
->sf
->qf
->expand_symtabs_with_fullname (objfile
,
2580 symtab_to_fullname (symtab
));
2583 ALL_SYMTABS (objfile
, s
)
2585 struct linetable
*l
;
2588 if (FILENAME_CMP (symtab
->filename
, s
->filename
) != 0)
2590 if (FILENAME_CMP (symtab_to_fullname (symtab
),
2591 symtab_to_fullname (s
)) != 0)
2594 ind
= find_line_common (l
, line
, &exact
, 0);
2604 if (best
== 0 || l
->item
[ind
].line
< best
)
2606 best
= l
->item
[ind
].line
;
2619 *index
= best_index
;
2621 *exact_match
= exact
;
2626 /* Given SYMTAB, returns all the PCs function in the symtab that
2627 exactly match LINE. Returns NULL if there are no exact matches,
2628 but updates BEST_ITEM in this case. */
2631 find_pcs_for_symtab_line (struct symtab
*symtab
, int line
,
2632 struct linetable_entry
**best_item
)
2635 VEC (CORE_ADDR
) *result
= NULL
;
2637 /* First, collect all the PCs that are at this line. */
2643 idx
= find_line_common (LINETABLE (symtab
), line
, &was_exact
, start
);
2649 struct linetable_entry
*item
= &LINETABLE (symtab
)->item
[idx
];
2651 if (*best_item
== NULL
|| item
->line
< (*best_item
)->line
)
2657 VEC_safe_push (CORE_ADDR
, result
, LINETABLE (symtab
)->item
[idx
].pc
);
2665 /* Set the PC value for a given source file and line number and return true.
2666 Returns zero for invalid line number (and sets the PC to 0).
2667 The source file is specified with a struct symtab. */
2670 find_line_pc (struct symtab
*symtab
, int line
, CORE_ADDR
*pc
)
2672 struct linetable
*l
;
2679 symtab
= find_line_symtab (symtab
, line
, &ind
, NULL
);
2682 l
= LINETABLE (symtab
);
2683 *pc
= l
->item
[ind
].pc
;
2690 /* Find the range of pc values in a line.
2691 Store the starting pc of the line into *STARTPTR
2692 and the ending pc (start of next line) into *ENDPTR.
2693 Returns 1 to indicate success.
2694 Returns 0 if could not find the specified line. */
2697 find_line_pc_range (struct symtab_and_line sal
, CORE_ADDR
*startptr
,
2700 CORE_ADDR startaddr
;
2701 struct symtab_and_line found_sal
;
2704 if (startaddr
== 0 && !find_line_pc (sal
.symtab
, sal
.line
, &startaddr
))
2707 /* This whole function is based on address. For example, if line 10 has
2708 two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then
2709 "info line *0x123" should say the line goes from 0x100 to 0x200
2710 and "info line *0x355" should say the line goes from 0x300 to 0x400.
2711 This also insures that we never give a range like "starts at 0x134
2712 and ends at 0x12c". */
2714 found_sal
= find_pc_sect_line (startaddr
, sal
.section
, 0);
2715 if (found_sal
.line
!= sal
.line
)
2717 /* The specified line (sal) has zero bytes. */
2718 *startptr
= found_sal
.pc
;
2719 *endptr
= found_sal
.pc
;
2723 *startptr
= found_sal
.pc
;
2724 *endptr
= found_sal
.end
;
2729 /* Given a line table and a line number, return the index into the line
2730 table for the pc of the nearest line whose number is >= the specified one.
2731 Return -1 if none is found. The value is >= 0 if it is an index.
2732 START is the index at which to start searching the line table.
2734 Set *EXACT_MATCH nonzero if the value returned is an exact match. */
2737 find_line_common (struct linetable
*l
, int lineno
,
2738 int *exact_match
, int start
)
2743 /* BEST is the smallest linenumber > LINENO so far seen,
2744 or 0 if none has been seen so far.
2745 BEST_INDEX identifies the item for it. */
2747 int best_index
= -1;
2758 for (i
= start
; i
< len
; i
++)
2760 struct linetable_entry
*item
= &(l
->item
[i
]);
2762 if (item
->line
== lineno
)
2764 /* Return the first (lowest address) entry which matches. */
2769 if (item
->line
> lineno
&& (best
== 0 || item
->line
< best
))
2776 /* If we got here, we didn't get an exact match. */
2781 find_pc_line_pc_range (CORE_ADDR pc
, CORE_ADDR
*startptr
, CORE_ADDR
*endptr
)
2783 struct symtab_and_line sal
;
2785 sal
= find_pc_line (pc
, 0);
2788 return sal
.symtab
!= 0;
2791 /* Given a function start address FUNC_ADDR and SYMTAB, find the first
2792 address for that function that has an entry in SYMTAB's line info
2793 table. If such an entry cannot be found, return FUNC_ADDR
2797 skip_prologue_using_lineinfo (CORE_ADDR func_addr
, struct symtab
*symtab
)
2799 CORE_ADDR func_start
, func_end
;
2800 struct linetable
*l
;
2803 /* Give up if this symbol has no lineinfo table. */
2804 l
= LINETABLE (symtab
);
2808 /* Get the range for the function's PC values, or give up if we
2809 cannot, for some reason. */
2810 if (!find_pc_partial_function (func_addr
, NULL
, &func_start
, &func_end
))
2813 /* Linetable entries are ordered by PC values, see the commentary in
2814 symtab.h where `struct linetable' is defined. Thus, the first
2815 entry whose PC is in the range [FUNC_START..FUNC_END[ is the
2816 address we are looking for. */
2817 for (i
= 0; i
< l
->nitems
; i
++)
2819 struct linetable_entry
*item
= &(l
->item
[i
]);
2821 /* Don't use line numbers of zero, they mark special entries in
2822 the table. See the commentary on symtab.h before the
2823 definition of struct linetable. */
2824 if (item
->line
> 0 && func_start
<= item
->pc
&& item
->pc
< func_end
)
2831 /* Given a function symbol SYM, find the symtab and line for the start
2833 If the argument FUNFIRSTLINE is nonzero, we want the first line
2834 of real code inside the function. */
2836 struct symtab_and_line
2837 find_function_start_sal (struct symbol
*sym
, int funfirstline
)
2839 struct symtab_and_line sal
;
2841 fixup_symbol_section (sym
, NULL
);
2842 sal
= find_pc_sect_line (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)),
2843 SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
), 0);
2845 /* We always should have a line for the function start address.
2846 If we don't, something is odd. Create a plain SAL refering
2847 just the PC and hope that skip_prologue_sal (if requested)
2848 can find a line number for after the prologue. */
2849 if (sal
.pc
< BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)))
2852 sal
.pspace
= current_program_space
;
2853 sal
.pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2854 sal
.section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2858 skip_prologue_sal (&sal
);
2863 /* Adjust SAL to the first instruction past the function prologue.
2864 If the PC was explicitly specified, the SAL is not changed.
2865 If the line number was explicitly specified, at most the SAL's PC
2866 is updated. If SAL is already past the prologue, then do nothing. */
2869 skip_prologue_sal (struct symtab_and_line
*sal
)
2872 struct symtab_and_line start_sal
;
2873 struct cleanup
*old_chain
;
2874 CORE_ADDR pc
, saved_pc
;
2875 struct obj_section
*section
;
2877 struct objfile
*objfile
;
2878 struct gdbarch
*gdbarch
;
2879 const struct block
*b
, *function_block
;
2880 int force_skip
, skip
;
2882 /* Do not change the SAL if PC was specified explicitly. */
2883 if (sal
->explicit_pc
)
2886 old_chain
= save_current_space_and_thread ();
2887 switch_to_program_space_and_thread (sal
->pspace
);
2889 sym
= find_pc_sect_function (sal
->pc
, sal
->section
);
2892 fixup_symbol_section (sym
, NULL
);
2894 pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2895 section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2896 name
= SYMBOL_LINKAGE_NAME (sym
);
2897 objfile
= SYMBOL_SYMTAB (sym
)->objfile
;
2901 struct bound_minimal_symbol msymbol
2902 = lookup_minimal_symbol_by_pc_section (sal
->pc
, sal
->section
);
2904 if (msymbol
.minsym
== NULL
)
2906 do_cleanups (old_chain
);
2910 objfile
= msymbol
.objfile
;
2911 pc
= BMSYMBOL_VALUE_ADDRESS (msymbol
);
2912 section
= MSYMBOL_OBJ_SECTION (objfile
, msymbol
.minsym
);
2913 name
= MSYMBOL_LINKAGE_NAME (msymbol
.minsym
);
2916 gdbarch
= get_objfile_arch (objfile
);
2918 /* Process the prologue in two passes. In the first pass try to skip the
2919 prologue (SKIP is true) and verify there is a real need for it (indicated
2920 by FORCE_SKIP). If no such reason was found run a second pass where the
2921 prologue is not skipped (SKIP is false). */
2926 /* Be conservative - allow direct PC (without skipping prologue) only if we
2927 have proven the CU (Compilation Unit) supports it. sal->SYMTAB does not
2928 have to be set by the caller so we use SYM instead. */
2929 if (sym
&& SYMBOL_SYMTAB (sym
)->locations_valid
)
2937 /* If the function is in an unmapped overlay, use its unmapped LMA address,
2938 so that gdbarch_skip_prologue has something unique to work on. */
2939 if (section_is_overlay (section
) && !section_is_mapped (section
))
2940 pc
= overlay_unmapped_address (pc
, section
);
2942 /* Skip "first line" of function (which is actually its prologue). */
2943 pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
2944 if (gdbarch_skip_entrypoint_p (gdbarch
))
2945 pc
= gdbarch_skip_entrypoint (gdbarch
, pc
);
2947 pc
= gdbarch_skip_prologue (gdbarch
, pc
);
2949 /* For overlays, map pc back into its mapped VMA range. */
2950 pc
= overlay_mapped_address (pc
, section
);
2952 /* Calculate line number. */
2953 start_sal
= find_pc_sect_line (pc
, section
, 0);
2955 /* Check if gdbarch_skip_prologue left us in mid-line, and the next
2956 line is still part of the same function. */
2957 if (skip
&& start_sal
.pc
!= pc
2958 && (sym
? (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)) <= start_sal
.end
2959 && start_sal
.end
< BLOCK_END (SYMBOL_BLOCK_VALUE (sym
)))
2960 : (lookup_minimal_symbol_by_pc_section (start_sal
.end
, section
).minsym
2961 == lookup_minimal_symbol_by_pc_section (pc
, section
).minsym
)))
2963 /* First pc of next line */
2965 /* Recalculate the line number (might not be N+1). */
2966 start_sal
= find_pc_sect_line (pc
, section
, 0);
2969 /* On targets with executable formats that don't have a concept of
2970 constructors (ELF with .init has, PE doesn't), gcc emits a call
2971 to `__main' in `main' between the prologue and before user
2973 if (gdbarch_skip_main_prologue_p (gdbarch
)
2974 && name
&& strcmp_iw (name
, "main") == 0)
2976 pc
= gdbarch_skip_main_prologue (gdbarch
, pc
);
2977 /* Recalculate the line number (might not be N+1). */
2978 start_sal
= find_pc_sect_line (pc
, section
, 0);
2982 while (!force_skip
&& skip
--);
2984 /* If we still don't have a valid source line, try to find the first
2985 PC in the lineinfo table that belongs to the same function. This
2986 happens with COFF debug info, which does not seem to have an
2987 entry in lineinfo table for the code after the prologue which has
2988 no direct relation to source. For example, this was found to be
2989 the case with the DJGPP target using "gcc -gcoff" when the
2990 compiler inserted code after the prologue to make sure the stack
2992 if (!force_skip
&& sym
&& start_sal
.symtab
== NULL
)
2994 pc
= skip_prologue_using_lineinfo (pc
, SYMBOL_SYMTAB (sym
));
2995 /* Recalculate the line number. */
2996 start_sal
= find_pc_sect_line (pc
, section
, 0);
2999 do_cleanups (old_chain
);
3001 /* If we're already past the prologue, leave SAL unchanged. Otherwise
3002 forward SAL to the end of the prologue. */
3007 sal
->section
= section
;
3009 /* Unless the explicit_line flag was set, update the SAL line
3010 and symtab to correspond to the modified PC location. */
3011 if (sal
->explicit_line
)
3014 sal
->symtab
= start_sal
.symtab
;
3015 sal
->line
= start_sal
.line
;
3016 sal
->end
= start_sal
.end
;
3018 /* Check if we are now inside an inlined function. If we can,
3019 use the call site of the function instead. */
3020 b
= block_for_pc_sect (sal
->pc
, sal
->section
);
3021 function_block
= NULL
;
3024 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
3026 else if (BLOCK_FUNCTION (b
) != NULL
)
3028 b
= BLOCK_SUPERBLOCK (b
);
3030 if (function_block
!= NULL
3031 && SYMBOL_LINE (BLOCK_FUNCTION (function_block
)) != 0)
3033 sal
->line
= SYMBOL_LINE (BLOCK_FUNCTION (function_block
));
3034 sal
->symtab
= SYMBOL_SYMTAB (BLOCK_FUNCTION (function_block
));
3038 /* If P is of the form "operator[ \t]+..." where `...' is
3039 some legitimate operator text, return a pointer to the
3040 beginning of the substring of the operator text.
3041 Otherwise, return "". */
3044 operator_chars (const char *p
, const char **end
)
3047 if (strncmp (p
, "operator", 8))
3051 /* Don't get faked out by `operator' being part of a longer
3053 if (isalpha (*p
) || *p
== '_' || *p
== '$' || *p
== '\0')
3056 /* Allow some whitespace between `operator' and the operator symbol. */
3057 while (*p
== ' ' || *p
== '\t')
3060 /* Recognize 'operator TYPENAME'. */
3062 if (isalpha (*p
) || *p
== '_' || *p
== '$')
3064 const char *q
= p
+ 1;
3066 while (isalnum (*q
) || *q
== '_' || *q
== '$')
3075 case '\\': /* regexp quoting */
3078 if (p
[2] == '=') /* 'operator\*=' */
3080 else /* 'operator\*' */
3084 else if (p
[1] == '[')
3087 error (_("mismatched quoting on brackets, "
3088 "try 'operator\\[\\]'"));
3089 else if (p
[2] == '\\' && p
[3] == ']')
3091 *end
= p
+ 4; /* 'operator\[\]' */
3095 error (_("nothing is allowed between '[' and ']'"));
3099 /* Gratuitous qoute: skip it and move on. */
3121 if (p
[0] == '-' && p
[1] == '>')
3123 /* Struct pointer member operator 'operator->'. */
3126 *end
= p
+ 3; /* 'operator->*' */
3129 else if (p
[2] == '\\')
3131 *end
= p
+ 4; /* Hopefully 'operator->\*' */
3136 *end
= p
+ 2; /* 'operator->' */
3140 if (p
[1] == '=' || p
[1] == p
[0])
3151 error (_("`operator ()' must be specified "
3152 "without whitespace in `()'"));
3157 error (_("`operator ?:' must be specified "
3158 "without whitespace in `?:'"));
3163 error (_("`operator []' must be specified "
3164 "without whitespace in `[]'"));
3168 error (_("`operator %s' not supported"), p
);
3177 /* Cache to watch for file names already seen by filename_seen. */
3179 struct filename_seen_cache
3181 /* Table of files seen so far. */
3183 /* Initial size of the table. It automagically grows from here. */
3184 #define INITIAL_FILENAME_SEEN_CACHE_SIZE 100
3187 /* filename_seen_cache constructor. */
3189 static struct filename_seen_cache
*
3190 create_filename_seen_cache (void)
3192 struct filename_seen_cache
*cache
;
3194 cache
= XNEW (struct filename_seen_cache
);
3195 cache
->tab
= htab_create_alloc (INITIAL_FILENAME_SEEN_CACHE_SIZE
,
3196 filename_hash
, filename_eq
,
3197 NULL
, xcalloc
, xfree
);
3202 /* Empty the cache, but do not delete it. */
3205 clear_filename_seen_cache (struct filename_seen_cache
*cache
)
3207 htab_empty (cache
->tab
);
3210 /* filename_seen_cache destructor.
3211 This takes a void * argument as it is generally used as a cleanup. */
3214 delete_filename_seen_cache (void *ptr
)
3216 struct filename_seen_cache
*cache
= ptr
;
3218 htab_delete (cache
->tab
);
3222 /* If FILE is not already in the table of files in CACHE, return zero;
3223 otherwise return non-zero. Optionally add FILE to the table if ADD
3226 NOTE: We don't manage space for FILE, we assume FILE lives as long
3227 as the caller needs. */
3230 filename_seen (struct filename_seen_cache
*cache
, const char *file
, int add
)
3234 /* Is FILE in tab? */
3235 slot
= htab_find_slot (cache
->tab
, file
, add
? INSERT
: NO_INSERT
);
3239 /* No; maybe add it to tab. */
3241 *slot
= (char *) file
;
3246 /* Data structure to maintain printing state for output_source_filename. */
3248 struct output_source_filename_data
3250 /* Cache of what we've seen so far. */
3251 struct filename_seen_cache
*filename_seen_cache
;
3253 /* Flag of whether we're printing the first one. */
3257 /* Slave routine for sources_info. Force line breaks at ,'s.
3258 NAME is the name to print.
3259 DATA contains the state for printing and watching for duplicates. */
3262 output_source_filename (const char *name
,
3263 struct output_source_filename_data
*data
)
3265 /* Since a single source file can result in several partial symbol
3266 tables, we need to avoid printing it more than once. Note: if
3267 some of the psymtabs are read in and some are not, it gets
3268 printed both under "Source files for which symbols have been
3269 read" and "Source files for which symbols will be read in on
3270 demand". I consider this a reasonable way to deal with the
3271 situation. I'm not sure whether this can also happen for
3272 symtabs; it doesn't hurt to check. */
3274 /* Was NAME already seen? */
3275 if (filename_seen (data
->filename_seen_cache
, name
, 1))
3277 /* Yes; don't print it again. */
3281 /* No; print it and reset *FIRST. */
3283 printf_filtered (", ");
3287 fputs_filtered (name
, gdb_stdout
);
3290 /* A callback for map_partial_symbol_filenames. */
3293 output_partial_symbol_filename (const char *filename
, const char *fullname
,
3296 output_source_filename (fullname
? fullname
: filename
, data
);
3300 sources_info (char *ignore
, int from_tty
)
3303 struct objfile
*objfile
;
3304 struct output_source_filename_data data
;
3305 struct cleanup
*cleanups
;
3307 if (!have_full_symbols () && !have_partial_symbols ())
3309 error (_("No symbol table is loaded. Use the \"file\" command."));
3312 data
.filename_seen_cache
= create_filename_seen_cache ();
3313 cleanups
= make_cleanup (delete_filename_seen_cache
,
3314 data
.filename_seen_cache
);
3316 printf_filtered ("Source files for which symbols have been read in:\n\n");
3319 ALL_SYMTABS (objfile
, s
)
3321 const char *fullname
= symtab_to_fullname (s
);
3323 output_source_filename (fullname
, &data
);
3325 printf_filtered ("\n\n");
3327 printf_filtered ("Source files for which symbols "
3328 "will be read in on demand:\n\n");
3330 clear_filename_seen_cache (data
.filename_seen_cache
);
3332 map_symbol_filenames (output_partial_symbol_filename
, &data
,
3333 1 /*need_fullname*/);
3334 printf_filtered ("\n");
3336 do_cleanups (cleanups
);
3339 /* Compare FILE against all the NFILES entries of FILES. If BASENAMES is
3340 non-zero compare only lbasename of FILES. */
3343 file_matches (const char *file
, const char *files
[], int nfiles
, int basenames
)
3347 if (file
!= NULL
&& nfiles
!= 0)
3349 for (i
= 0; i
< nfiles
; i
++)
3351 if (compare_filenames_for_search (file
, (basenames
3352 ? lbasename (files
[i
])
3357 else if (nfiles
== 0)
3362 /* Free any memory associated with a search. */
3365 free_search_symbols (struct symbol_search
*symbols
)
3367 struct symbol_search
*p
;
3368 struct symbol_search
*next
;
3370 for (p
= symbols
; p
!= NULL
; p
= next
)
3378 do_free_search_symbols_cleanup (void *symbolsp
)
3380 struct symbol_search
*symbols
= *(struct symbol_search
**) symbolsp
;
3382 free_search_symbols (symbols
);
3386 make_cleanup_free_search_symbols (struct symbol_search
**symbolsp
)
3388 return make_cleanup (do_free_search_symbols_cleanup
, symbolsp
);
3391 /* Helper function for sort_search_symbols_remove_dups and qsort. Can only
3392 sort symbols, not minimal symbols. */
3395 compare_search_syms (const void *sa
, const void *sb
)
3397 struct symbol_search
*sym_a
= *(struct symbol_search
**) sa
;
3398 struct symbol_search
*sym_b
= *(struct symbol_search
**) sb
;
3401 c
= FILENAME_CMP (sym_a
->symtab
->filename
, sym_b
->symtab
->filename
);
3405 if (sym_a
->block
!= sym_b
->block
)
3406 return sym_a
->block
- sym_b
->block
;
3408 return strcmp (SYMBOL_PRINT_NAME (sym_a
->symbol
),
3409 SYMBOL_PRINT_NAME (sym_b
->symbol
));
3412 /* Sort the NFOUND symbols in list FOUND and remove duplicates.
3413 The duplicates are freed, and the new list is returned in
3414 *NEW_HEAD, *NEW_TAIL. */
3417 sort_search_symbols_remove_dups (struct symbol_search
*found
, int nfound
,
3418 struct symbol_search
**new_head
,
3419 struct symbol_search
**new_tail
)
3421 struct symbol_search
**symbols
, *symp
, *old_next
;
3424 gdb_assert (found
!= NULL
&& nfound
> 0);
3426 /* Build an array out of the list so we can easily sort them. */
3427 symbols
= (struct symbol_search
**) xmalloc (sizeof (struct symbol_search
*)
3430 for (i
= 0; i
< nfound
; i
++)
3432 gdb_assert (symp
!= NULL
);
3433 gdb_assert (symp
->block
>= 0 && symp
->block
<= 1);
3437 gdb_assert (symp
== NULL
);
3439 qsort (symbols
, nfound
, sizeof (struct symbol_search
*),
3440 compare_search_syms
);
3442 /* Collapse out the dups. */
3443 for (i
= 1, j
= 1; i
< nfound
; ++i
)
3445 if (compare_search_syms (&symbols
[j
- 1], &symbols
[i
]) != 0)
3446 symbols
[j
++] = symbols
[i
];
3451 symbols
[j
- 1]->next
= NULL
;
3453 /* Rebuild the linked list. */
3454 for (i
= 0; i
< nunique
- 1; i
++)
3455 symbols
[i
]->next
= symbols
[i
+ 1];
3456 symbols
[nunique
- 1]->next
= NULL
;
3458 *new_head
= symbols
[0];
3459 *new_tail
= symbols
[nunique
- 1];
3463 /* An object of this type is passed as the user_data to the
3464 expand_symtabs_matching method. */
3465 struct search_symbols_data
3470 /* It is true if PREG contains valid data, false otherwise. */
3471 unsigned preg_p
: 1;
3475 /* A callback for expand_symtabs_matching. */
3478 search_symbols_file_matches (const char *filename
, void *user_data
,
3481 struct search_symbols_data
*data
= user_data
;
3483 return file_matches (filename
, data
->files
, data
->nfiles
, basenames
);
3486 /* A callback for expand_symtabs_matching. */
3489 search_symbols_name_matches (const char *symname
, void *user_data
)
3491 struct search_symbols_data
*data
= user_data
;
3493 return !data
->preg_p
|| regexec (&data
->preg
, symname
, 0, NULL
, 0) == 0;
3496 /* Search the symbol table for matches to the regular expression REGEXP,
3497 returning the results in *MATCHES.
3499 Only symbols of KIND are searched:
3500 VARIABLES_DOMAIN - search all symbols, excluding functions, type names,
3501 and constants (enums)
3502 FUNCTIONS_DOMAIN - search all functions
3503 TYPES_DOMAIN - search all type names
3504 ALL_DOMAIN - an internal error for this function
3506 free_search_symbols should be called when *MATCHES is no longer needed.
3508 Within each file the results are sorted locally; each symtab's global and
3509 static blocks are separately alphabetized.
3510 Duplicate entries are removed. */
3513 search_symbols (const char *regexp
, enum search_domain kind
,
3514 int nfiles
, const char *files
[],
3515 struct symbol_search
**matches
)
3518 const struct blockvector
*bv
;
3521 struct block_iterator iter
;
3523 struct objfile
*objfile
;
3524 struct minimal_symbol
*msymbol
;
3526 static const enum minimal_symbol_type types
[]
3527 = {mst_data
, mst_text
, mst_abs
};
3528 static const enum minimal_symbol_type types2
[]
3529 = {mst_bss
, mst_file_text
, mst_abs
};
3530 static const enum minimal_symbol_type types3
[]
3531 = {mst_file_data
, mst_solib_trampoline
, mst_abs
};
3532 static const enum minimal_symbol_type types4
[]
3533 = {mst_file_bss
, mst_text_gnu_ifunc
, mst_abs
};
3534 enum minimal_symbol_type ourtype
;
3535 enum minimal_symbol_type ourtype2
;
3536 enum minimal_symbol_type ourtype3
;
3537 enum minimal_symbol_type ourtype4
;
3538 struct symbol_search
*found
;
3539 struct symbol_search
*tail
;
3540 struct search_symbols_data datum
;
3543 /* OLD_CHAIN .. RETVAL_CHAIN is always freed, RETVAL_CHAIN .. current
3544 CLEANUP_CHAIN is freed only in the case of an error. */
3545 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
3546 struct cleanup
*retval_chain
;
3548 gdb_assert (kind
<= TYPES_DOMAIN
);
3550 ourtype
= types
[kind
];
3551 ourtype2
= types2
[kind
];
3552 ourtype3
= types3
[kind
];
3553 ourtype4
= types4
[kind
];
3560 /* Make sure spacing is right for C++ operators.
3561 This is just a courtesy to make the matching less sensitive
3562 to how many spaces the user leaves between 'operator'
3563 and <TYPENAME> or <OPERATOR>. */
3565 const char *opname
= operator_chars (regexp
, &opend
);
3570 int fix
= -1; /* -1 means ok; otherwise number of
3573 if (isalpha (*opname
) || *opname
== '_' || *opname
== '$')
3575 /* There should 1 space between 'operator' and 'TYPENAME'. */
3576 if (opname
[-1] != ' ' || opname
[-2] == ' ')
3581 /* There should 0 spaces between 'operator' and 'OPERATOR'. */
3582 if (opname
[-1] == ' ')
3585 /* If wrong number of spaces, fix it. */
3588 char *tmp
= (char *) alloca (8 + fix
+ strlen (opname
) + 1);
3590 sprintf (tmp
, "operator%.*s%s", fix
, " ", opname
);
3595 errcode
= regcomp (&datum
.preg
, regexp
,
3596 REG_NOSUB
| (case_sensitivity
== case_sensitive_off
3600 char *err
= get_regcomp_error (errcode
, &datum
.preg
);
3602 make_cleanup (xfree
, err
);
3603 error (_("Invalid regexp (%s): %s"), err
, regexp
);
3606 make_regfree_cleanup (&datum
.preg
);
3609 /* Search through the partial symtabs *first* for all symbols
3610 matching the regexp. That way we don't have to reproduce all of
3611 the machinery below. */
3613 datum
.nfiles
= nfiles
;
3614 datum
.files
= files
;
3615 expand_symtabs_matching ((nfiles
== 0
3617 : search_symbols_file_matches
),
3618 search_symbols_name_matches
,
3621 /* Here, we search through the minimal symbol tables for functions
3622 and variables that match, and force their symbols to be read.
3623 This is in particular necessary for demangled variable names,
3624 which are no longer put into the partial symbol tables.
3625 The symbol will then be found during the scan of symtabs below.
3627 For functions, find_pc_symtab should succeed if we have debug info
3628 for the function, for variables we have to call
3629 lookup_symbol_in_objfile_from_linkage_name to determine if the variable
3631 If the lookup fails, set found_misc so that we will rescan to print
3632 any matching symbols without debug info.
3633 We only search the objfile the msymbol came from, we no longer search
3634 all objfiles. In large programs (1000s of shared libs) searching all
3635 objfiles is not worth the pain. */
3637 if (nfiles
== 0 && (kind
== VARIABLES_DOMAIN
|| kind
== FUNCTIONS_DOMAIN
))
3639 ALL_MSYMBOLS (objfile
, msymbol
)
3643 if (msymbol
->created_by_gdb
)
3646 if (MSYMBOL_TYPE (msymbol
) == ourtype
3647 || MSYMBOL_TYPE (msymbol
) == ourtype2
3648 || MSYMBOL_TYPE (msymbol
) == ourtype3
3649 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3652 || regexec (&datum
.preg
, MSYMBOL_NATURAL_NAME (msymbol
), 0,
3655 /* Note: An important side-effect of these lookup functions
3656 is to expand the symbol table if msymbol is found, for the
3657 benefit of the next loop on ALL_PRIMARY_SYMTABS. */
3658 if (kind
== FUNCTIONS_DOMAIN
3659 ? find_pc_symtab (MSYMBOL_VALUE_ADDRESS (objfile
,
3661 : (lookup_symbol_in_objfile_from_linkage_name
3662 (objfile
, MSYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3673 retval_chain
= make_cleanup_free_search_symbols (&found
);
3675 ALL_PRIMARY_SYMTABS (objfile
, s
)
3677 bv
= BLOCKVECTOR (s
);
3678 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
3680 b
= BLOCKVECTOR_BLOCK (bv
, i
);
3681 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
3683 struct symtab
*real_symtab
= SYMBOL_SYMTAB (sym
);
3687 /* Check first sole REAL_SYMTAB->FILENAME. It does not need to be
3688 a substring of symtab_to_fullname as it may contain "./" etc. */
3689 if ((file_matches (real_symtab
->filename
, files
, nfiles
, 0)
3690 || ((basenames_may_differ
3691 || file_matches (lbasename (real_symtab
->filename
),
3693 && file_matches (symtab_to_fullname (real_symtab
),
3696 || regexec (&datum
.preg
, SYMBOL_NATURAL_NAME (sym
), 0,
3698 && ((kind
== VARIABLES_DOMAIN
3699 && SYMBOL_CLASS (sym
) != LOC_TYPEDEF
3700 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
3701 && SYMBOL_CLASS (sym
) != LOC_BLOCK
3702 /* LOC_CONST can be used for more than just enums,
3703 e.g., c++ static const members.
3704 We only want to skip enums here. */
3705 && !(SYMBOL_CLASS (sym
) == LOC_CONST
3706 && TYPE_CODE (SYMBOL_TYPE (sym
))
3708 || (kind
== FUNCTIONS_DOMAIN
3709 && SYMBOL_CLASS (sym
) == LOC_BLOCK
)
3710 || (kind
== TYPES_DOMAIN
3711 && SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))))
3714 struct symbol_search
*psr
= (struct symbol_search
*)
3715 xmalloc (sizeof (struct symbol_search
));
3717 psr
->symtab
= real_symtab
;
3719 memset (&psr
->msymbol
, 0, sizeof (psr
->msymbol
));
3734 sort_search_symbols_remove_dups (found
, nfound
, &found
, &tail
);
3735 /* Note: nfound is no longer useful beyond this point. */
3738 /* If there are no eyes, avoid all contact. I mean, if there are
3739 no debug symbols, then print directly from the msymbol_vector. */
3741 if (found_misc
|| (nfiles
== 0 && kind
!= FUNCTIONS_DOMAIN
))
3743 ALL_MSYMBOLS (objfile
, msymbol
)
3747 if (msymbol
->created_by_gdb
)
3750 if (MSYMBOL_TYPE (msymbol
) == ourtype
3751 || MSYMBOL_TYPE (msymbol
) == ourtype2
3752 || MSYMBOL_TYPE (msymbol
) == ourtype3
3753 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3756 || regexec (&datum
.preg
, MSYMBOL_NATURAL_NAME (msymbol
), 0,
3759 /* For functions we can do a quick check of whether the
3760 symbol might be found via find_pc_symtab. */
3761 if (kind
!= FUNCTIONS_DOMAIN
3762 || find_pc_symtab (MSYMBOL_VALUE_ADDRESS (objfile
,
3765 if (lookup_symbol_in_objfile_from_linkage_name
3766 (objfile
, MSYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3770 struct symbol_search
*psr
= (struct symbol_search
*)
3771 xmalloc (sizeof (struct symbol_search
));
3773 psr
->msymbol
.minsym
= msymbol
;
3774 psr
->msymbol
.objfile
= objfile
;
3790 discard_cleanups (retval_chain
);
3791 do_cleanups (old_chain
);
3795 /* Helper function for symtab_symbol_info, this function uses
3796 the data returned from search_symbols() to print information
3797 regarding the match to gdb_stdout. */
3800 print_symbol_info (enum search_domain kind
,
3801 struct symtab
*s
, struct symbol
*sym
,
3802 int block
, const char *last
)
3804 const char *s_filename
= symtab_to_filename_for_display (s
);
3806 if (last
== NULL
|| filename_cmp (last
, s_filename
) != 0)
3808 fputs_filtered ("\nFile ", gdb_stdout
);
3809 fputs_filtered (s_filename
, gdb_stdout
);
3810 fputs_filtered (":\n", gdb_stdout
);
3813 if (kind
!= TYPES_DOMAIN
&& block
== STATIC_BLOCK
)
3814 printf_filtered ("static ");
3816 /* Typedef that is not a C++ class. */
3817 if (kind
== TYPES_DOMAIN
3818 && SYMBOL_DOMAIN (sym
) != STRUCT_DOMAIN
)
3819 typedef_print (SYMBOL_TYPE (sym
), sym
, gdb_stdout
);
3820 /* variable, func, or typedef-that-is-c++-class. */
3821 else if (kind
< TYPES_DOMAIN
3822 || (kind
== TYPES_DOMAIN
3823 && SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
))
3825 type_print (SYMBOL_TYPE (sym
),
3826 (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
3827 ? "" : SYMBOL_PRINT_NAME (sym
)),
3830 printf_filtered (";\n");
3834 /* This help function for symtab_symbol_info() prints information
3835 for non-debugging symbols to gdb_stdout. */
3838 print_msymbol_info (struct bound_minimal_symbol msymbol
)
3840 struct gdbarch
*gdbarch
= get_objfile_arch (msymbol
.objfile
);
3843 if (gdbarch_addr_bit (gdbarch
) <= 32)
3844 tmp
= hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol
)
3845 & (CORE_ADDR
) 0xffffffff,
3848 tmp
= hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol
),
3850 printf_filtered ("%s %s\n",
3851 tmp
, MSYMBOL_PRINT_NAME (msymbol
.minsym
));
3854 /* This is the guts of the commands "info functions", "info types", and
3855 "info variables". It calls search_symbols to find all matches and then
3856 print_[m]symbol_info to print out some useful information about the
3860 symtab_symbol_info (char *regexp
, enum search_domain kind
, int from_tty
)
3862 static const char * const classnames
[] =
3863 {"variable", "function", "type"};
3864 struct symbol_search
*symbols
;
3865 struct symbol_search
*p
;
3866 struct cleanup
*old_chain
;
3867 const char *last_filename
= NULL
;
3870 gdb_assert (kind
<= TYPES_DOMAIN
);
3872 /* Must make sure that if we're interrupted, symbols gets freed. */
3873 search_symbols (regexp
, kind
, 0, NULL
, &symbols
);
3874 old_chain
= make_cleanup_free_search_symbols (&symbols
);
3877 printf_filtered (_("All %ss matching regular expression \"%s\":\n"),
3878 classnames
[kind
], regexp
);
3880 printf_filtered (_("All defined %ss:\n"), classnames
[kind
]);
3882 for (p
= symbols
; p
!= NULL
; p
= p
->next
)
3886 if (p
->msymbol
.minsym
!= NULL
)
3890 printf_filtered (_("\nNon-debugging symbols:\n"));
3893 print_msymbol_info (p
->msymbol
);
3897 print_symbol_info (kind
,
3902 last_filename
= symtab_to_filename_for_display (p
->symtab
);
3906 do_cleanups (old_chain
);
3910 variables_info (char *regexp
, int from_tty
)
3912 symtab_symbol_info (regexp
, VARIABLES_DOMAIN
, from_tty
);
3916 functions_info (char *regexp
, int from_tty
)
3918 symtab_symbol_info (regexp
, FUNCTIONS_DOMAIN
, from_tty
);
3923 types_info (char *regexp
, int from_tty
)
3925 symtab_symbol_info (regexp
, TYPES_DOMAIN
, from_tty
);
3928 /* Breakpoint all functions matching regular expression. */
3931 rbreak_command_wrapper (char *regexp
, int from_tty
)
3933 rbreak_command (regexp
, from_tty
);
3936 /* A cleanup function that calls end_rbreak_breakpoints. */
3939 do_end_rbreak_breakpoints (void *ignore
)
3941 end_rbreak_breakpoints ();
3945 rbreak_command (char *regexp
, int from_tty
)
3947 struct symbol_search
*ss
;
3948 struct symbol_search
*p
;
3949 struct cleanup
*old_chain
;
3950 char *string
= NULL
;
3952 const char **files
= NULL
;
3953 const char *file_name
;
3958 char *colon
= strchr (regexp
, ':');
3960 if (colon
&& *(colon
+ 1) != ':')
3965 colon_index
= colon
- regexp
;
3966 local_name
= alloca (colon_index
+ 1);
3967 memcpy (local_name
, regexp
, colon_index
);
3968 local_name
[colon_index
--] = 0;
3969 while (isspace (local_name
[colon_index
]))
3970 local_name
[colon_index
--] = 0;
3971 file_name
= local_name
;
3974 regexp
= skip_spaces (colon
+ 1);
3978 search_symbols (regexp
, FUNCTIONS_DOMAIN
, nfiles
, files
, &ss
);
3979 old_chain
= make_cleanup_free_search_symbols (&ss
);
3980 make_cleanup (free_current_contents
, &string
);
3982 start_rbreak_breakpoints ();
3983 make_cleanup (do_end_rbreak_breakpoints
, NULL
);
3984 for (p
= ss
; p
!= NULL
; p
= p
->next
)
3986 if (p
->msymbol
.minsym
== NULL
)
3988 const char *fullname
= symtab_to_fullname (p
->symtab
);
3990 int newlen
= (strlen (fullname
)
3991 + strlen (SYMBOL_LINKAGE_NAME (p
->symbol
))
3996 string
= xrealloc (string
, newlen
);
3999 strcpy (string
, fullname
);
4000 strcat (string
, ":'");
4001 strcat (string
, SYMBOL_LINKAGE_NAME (p
->symbol
));
4002 strcat (string
, "'");
4003 break_command (string
, from_tty
);
4004 print_symbol_info (FUNCTIONS_DOMAIN
,
4008 symtab_to_filename_for_display (p
->symtab
));
4012 int newlen
= (strlen (MSYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
)) + 3);
4016 string
= xrealloc (string
, newlen
);
4019 strcpy (string
, "'");
4020 strcat (string
, MSYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
));
4021 strcat (string
, "'");
4023 break_command (string
, from_tty
);
4024 printf_filtered ("<function, no debug info> %s;\n",
4025 MSYMBOL_PRINT_NAME (p
->msymbol
.minsym
));
4029 do_cleanups (old_chain
);
4033 /* Evaluate if NAME matches SYM_TEXT and SYM_TEXT_LEN.
4035 Either sym_text[sym_text_len] != '(' and then we search for any
4036 symbol starting with SYM_TEXT text.
4038 Otherwise sym_text[sym_text_len] == '(' and then we require symbol name to
4039 be terminated at that point. Partial symbol tables do not have parameters
4043 compare_symbol_name (const char *name
, const char *sym_text
, int sym_text_len
)
4045 int (*ncmp
) (const char *, const char *, size_t);
4047 ncmp
= (case_sensitivity
== case_sensitive_on
? strncmp
: strncasecmp
);
4049 if (ncmp (name
, sym_text
, sym_text_len
) != 0)
4052 if (sym_text
[sym_text_len
] == '(')
4054 /* User searches for `name(someth...'. Require NAME to be terminated.
4055 Normally psymtabs and gdbindex have no parameter types so '\0' will be
4056 present but accept even parameters presence. In this case this
4057 function is in fact strcmp_iw but whitespace skipping is not supported
4058 for tab completion. */
4060 if (name
[sym_text_len
] != '\0' && name
[sym_text_len
] != '(')
4067 /* Free any memory associated with a completion list. */
4070 free_completion_list (VEC (char_ptr
) **list_ptr
)
4075 for (i
= 0; VEC_iterate (char_ptr
, *list_ptr
, i
, p
); ++i
)
4077 VEC_free (char_ptr
, *list_ptr
);
4080 /* Callback for make_cleanup. */
4083 do_free_completion_list (void *list
)
4085 free_completion_list (list
);
4088 /* Helper routine for make_symbol_completion_list. */
4090 static VEC (char_ptr
) *return_val
;
4092 #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \
4093 completion_list_add_name \
4094 (SYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word))
4096 #define MCOMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \
4097 completion_list_add_name \
4098 (MSYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word))
4100 /* Test to see if the symbol specified by SYMNAME (which is already
4101 demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN
4102 characters. If so, add it to the current completion list. */
4105 completion_list_add_name (const char *symname
,
4106 const char *sym_text
, int sym_text_len
,
4107 const char *text
, const char *word
)
4109 /* Clip symbols that cannot match. */
4110 if (!compare_symbol_name (symname
, sym_text
, sym_text_len
))
4113 /* We have a match for a completion, so add SYMNAME to the current list
4114 of matches. Note that the name is moved to freshly malloc'd space. */
4119 if (word
== sym_text
)
4121 new = xmalloc (strlen (symname
) + 5);
4122 strcpy (new, symname
);
4124 else if (word
> sym_text
)
4126 /* Return some portion of symname. */
4127 new = xmalloc (strlen (symname
) + 5);
4128 strcpy (new, symname
+ (word
- sym_text
));
4132 /* Return some of SYM_TEXT plus symname. */
4133 new = xmalloc (strlen (symname
) + (sym_text
- word
) + 5);
4134 strncpy (new, word
, sym_text
- word
);
4135 new[sym_text
- word
] = '\0';
4136 strcat (new, symname
);
4139 VEC_safe_push (char_ptr
, return_val
, new);
4143 /* ObjC: In case we are completing on a selector, look as the msymbol
4144 again and feed all the selectors into the mill. */
4147 completion_list_objc_symbol (struct minimal_symbol
*msymbol
,
4148 const char *sym_text
, int sym_text_len
,
4149 const char *text
, const char *word
)
4151 static char *tmp
= NULL
;
4152 static unsigned int tmplen
= 0;
4154 const char *method
, *category
, *selector
;
4157 method
= MSYMBOL_NATURAL_NAME (msymbol
);
4159 /* Is it a method? */
4160 if ((method
[0] != '-') && (method
[0] != '+'))
4163 if (sym_text
[0] == '[')
4164 /* Complete on shortened method method. */
4165 completion_list_add_name (method
+ 1, sym_text
, sym_text_len
, text
, word
);
4167 while ((strlen (method
) + 1) >= tmplen
)
4173 tmp
= xrealloc (tmp
, tmplen
);
4175 selector
= strchr (method
, ' ');
4176 if (selector
!= NULL
)
4179 category
= strchr (method
, '(');
4181 if ((category
!= NULL
) && (selector
!= NULL
))
4183 memcpy (tmp
, method
, (category
- method
));
4184 tmp
[category
- method
] = ' ';
4185 memcpy (tmp
+ (category
- method
) + 1, selector
, strlen (selector
) + 1);
4186 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4187 if (sym_text
[0] == '[')
4188 completion_list_add_name (tmp
+ 1, sym_text
, sym_text_len
, text
, word
);
4191 if (selector
!= NULL
)
4193 /* Complete on selector only. */
4194 strcpy (tmp
, selector
);
4195 tmp2
= strchr (tmp
, ']');
4199 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4203 /* Break the non-quoted text based on the characters which are in
4204 symbols. FIXME: This should probably be language-specific. */
4207 language_search_unquoted_string (const char *text
, const char *p
)
4209 for (; p
> text
; --p
)
4211 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0')
4215 if ((current_language
->la_language
== language_objc
))
4217 if (p
[-1] == ':') /* Might be part of a method name. */
4219 else if (p
[-1] == '[' && (p
[-2] == '-' || p
[-2] == '+'))
4220 p
-= 2; /* Beginning of a method name. */
4221 else if (p
[-1] == ' ' || p
[-1] == '(' || p
[-1] == ')')
4222 { /* Might be part of a method name. */
4225 /* Seeing a ' ' or a '(' is not conclusive evidence
4226 that we are in the middle of a method name. However,
4227 finding "-[" or "+[" should be pretty un-ambiguous.
4228 Unfortunately we have to find it now to decide. */
4231 if (isalnum (t
[-1]) || t
[-1] == '_' ||
4232 t
[-1] == ' ' || t
[-1] == ':' ||
4233 t
[-1] == '(' || t
[-1] == ')')
4238 if (t
[-1] == '[' && (t
[-2] == '-' || t
[-2] == '+'))
4239 p
= t
- 2; /* Method name detected. */
4240 /* Else we leave with p unchanged. */
4250 completion_list_add_fields (struct symbol
*sym
, const char *sym_text
,
4251 int sym_text_len
, const char *text
,
4254 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4256 struct type
*t
= SYMBOL_TYPE (sym
);
4257 enum type_code c
= TYPE_CODE (t
);
4260 if (c
== TYPE_CODE_UNION
|| c
== TYPE_CODE_STRUCT
)
4261 for (j
= TYPE_N_BASECLASSES (t
); j
< TYPE_NFIELDS (t
); j
++)
4262 if (TYPE_FIELD_NAME (t
, j
))
4263 completion_list_add_name (TYPE_FIELD_NAME (t
, j
),
4264 sym_text
, sym_text_len
, text
, word
);
4268 /* Type of the user_data argument passed to add_macro_name or
4269 symbol_completion_matcher. The contents are simply whatever is
4270 needed by completion_list_add_name. */
4271 struct add_name_data
4273 const char *sym_text
;
4279 /* A callback used with macro_for_each and macro_for_each_in_scope.
4280 This adds a macro's name to the current completion list. */
4283 add_macro_name (const char *name
, const struct macro_definition
*ignore
,
4284 struct macro_source_file
*ignore2
, int ignore3
,
4287 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4289 completion_list_add_name (name
,
4290 datum
->sym_text
, datum
->sym_text_len
,
4291 datum
->text
, datum
->word
);
4294 /* A callback for expand_symtabs_matching. */
4297 symbol_completion_matcher (const char *name
, void *user_data
)
4299 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4301 return compare_symbol_name (name
, datum
->sym_text
, datum
->sym_text_len
);
4305 default_make_symbol_completion_list_break_on (const char *text
,
4307 const char *break_on
,
4308 enum type_code code
)
4310 /* Problem: All of the symbols have to be copied because readline
4311 frees them. I'm not going to worry about this; hopefully there
4312 won't be that many. */
4316 struct minimal_symbol
*msymbol
;
4317 struct objfile
*objfile
;
4318 const struct block
*b
;
4319 const struct block
*surrounding_static_block
, *surrounding_global_block
;
4320 struct block_iterator iter
;
4321 /* The symbol we are completing on. Points in same buffer as text. */
4322 const char *sym_text
;
4323 /* Length of sym_text. */
4325 struct add_name_data datum
;
4326 struct cleanup
*back_to
;
4328 /* Now look for the symbol we are supposed to complete on. */
4332 const char *quote_pos
= NULL
;
4334 /* First see if this is a quoted string. */
4336 for (p
= text
; *p
!= '\0'; ++p
)
4338 if (quote_found
!= '\0')
4340 if (*p
== quote_found
)
4341 /* Found close quote. */
4343 else if (*p
== '\\' && p
[1] == quote_found
)
4344 /* A backslash followed by the quote character
4345 doesn't end the string. */
4348 else if (*p
== '\'' || *p
== '"')
4354 if (quote_found
== '\'')
4355 /* A string within single quotes can be a symbol, so complete on it. */
4356 sym_text
= quote_pos
+ 1;
4357 else if (quote_found
== '"')
4358 /* A double-quoted string is never a symbol, nor does it make sense
4359 to complete it any other way. */
4365 /* It is not a quoted string. Break it based on the characters
4366 which are in symbols. */
4369 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0'
4370 || p
[-1] == ':' || strchr (break_on
, p
[-1]) != NULL
)
4379 sym_text_len
= strlen (sym_text
);
4381 /* Prepare SYM_TEXT_LEN for compare_symbol_name. */
4383 if (current_language
->la_language
== language_cplus
4384 || current_language
->la_language
== language_java
4385 || current_language
->la_language
== language_fortran
)
4387 /* These languages may have parameters entered by user but they are never
4388 present in the partial symbol tables. */
4390 const char *cs
= memchr (sym_text
, '(', sym_text_len
);
4393 sym_text_len
= cs
- sym_text
;
4395 gdb_assert (sym_text
[sym_text_len
] == '\0' || sym_text
[sym_text_len
] == '(');
4398 back_to
= make_cleanup (do_free_completion_list
, &return_val
);
4400 datum
.sym_text
= sym_text
;
4401 datum
.sym_text_len
= sym_text_len
;
4405 /* Look through the partial symtabs for all symbols which begin
4406 by matching SYM_TEXT. Expand all CUs that you find to the list.
4407 The real names will get added by COMPLETION_LIST_ADD_SYMBOL below. */
4408 expand_symtabs_matching (NULL
, symbol_completion_matcher
, ALL_DOMAIN
,
4411 /* At this point scan through the misc symbol vectors and add each
4412 symbol you find to the list. Eventually we want to ignore
4413 anything that isn't a text symbol (everything else will be
4414 handled by the psymtab code above). */
4416 if (code
== TYPE_CODE_UNDEF
)
4418 ALL_MSYMBOLS (objfile
, msymbol
)
4421 MCOMPLETION_LIST_ADD_SYMBOL (msymbol
, sym_text
, sym_text_len
, text
,
4424 completion_list_objc_symbol (msymbol
, sym_text
, sym_text_len
, text
,
4429 /* Search upwards from currently selected frame (so that we can
4430 complete on local vars). Also catch fields of types defined in
4431 this places which match our text string. Only complete on types
4432 visible from current context. */
4434 b
= get_selected_block (0);
4435 surrounding_static_block
= block_static_block (b
);
4436 surrounding_global_block
= block_global_block (b
);
4437 if (surrounding_static_block
!= NULL
)
4438 while (b
!= surrounding_static_block
)
4442 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4444 if (code
== TYPE_CODE_UNDEF
)
4446 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4448 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
,
4451 else if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4452 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
)
4453 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4457 /* Stop when we encounter an enclosing function. Do not stop for
4458 non-inlined functions - the locals of the enclosing function
4459 are in scope for a nested function. */
4460 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
4462 b
= BLOCK_SUPERBLOCK (b
);
4465 /* Add fields from the file's types; symbols will be added below. */
4467 if (code
== TYPE_CODE_UNDEF
)
4469 if (surrounding_static_block
!= NULL
)
4470 ALL_BLOCK_SYMBOLS (surrounding_static_block
, iter
, sym
)
4471 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4473 if (surrounding_global_block
!= NULL
)
4474 ALL_BLOCK_SYMBOLS (surrounding_global_block
, iter
, sym
)
4475 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4478 /* Go through the symtabs and check the externs and statics for
4479 symbols which match. */
4481 ALL_PRIMARY_SYMTABS (objfile
, s
)
4484 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4485 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4487 if (code
== TYPE_CODE_UNDEF
4488 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4489 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4490 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4494 ALL_PRIMARY_SYMTABS (objfile
, s
)
4497 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4498 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4500 if (code
== TYPE_CODE_UNDEF
4501 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4502 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4503 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4507 /* Skip macros if we are completing a struct tag -- arguable but
4508 usually what is expected. */
4509 if (current_language
->la_macro_expansion
== macro_expansion_c
4510 && code
== TYPE_CODE_UNDEF
)
4512 struct macro_scope
*scope
;
4514 /* Add any macros visible in the default scope. Note that this
4515 may yield the occasional wrong result, because an expression
4516 might be evaluated in a scope other than the default. For
4517 example, if the user types "break file:line if <TAB>", the
4518 resulting expression will be evaluated at "file:line" -- but
4519 at there does not seem to be a way to detect this at
4521 scope
= default_macro_scope ();
4524 macro_for_each_in_scope (scope
->file
, scope
->line
,
4525 add_macro_name
, &datum
);
4529 /* User-defined macros are always visible. */
4530 macro_for_each (macro_user_macros
, add_macro_name
, &datum
);
4533 discard_cleanups (back_to
);
4534 return (return_val
);
4538 default_make_symbol_completion_list (const char *text
, const char *word
,
4539 enum type_code code
)
4541 return default_make_symbol_completion_list_break_on (text
, word
, "", code
);
4544 /* Return a vector of all symbols (regardless of class) which begin by
4545 matching TEXT. If the answer is no symbols, then the return value
4549 make_symbol_completion_list (const char *text
, const char *word
)
4551 return current_language
->la_make_symbol_completion_list (text
, word
,
4555 /* Like make_symbol_completion_list, but only return STRUCT_DOMAIN
4556 symbols whose type code is CODE. */
4559 make_symbol_completion_type (const char *text
, const char *word
,
4560 enum type_code code
)
4562 gdb_assert (code
== TYPE_CODE_UNION
4563 || code
== TYPE_CODE_STRUCT
4564 || code
== TYPE_CODE_CLASS
4565 || code
== TYPE_CODE_ENUM
);
4566 return current_language
->la_make_symbol_completion_list (text
, word
, code
);
4569 /* Like make_symbol_completion_list, but suitable for use as a
4570 completion function. */
4573 make_symbol_completion_list_fn (struct cmd_list_element
*ignore
,
4574 const char *text
, const char *word
)
4576 return make_symbol_completion_list (text
, word
);
4579 /* Like make_symbol_completion_list, but returns a list of symbols
4580 defined in a source file FILE. */
4583 make_file_symbol_completion_list (const char *text
, const char *word
,
4584 const char *srcfile
)
4589 struct block_iterator iter
;
4590 /* The symbol we are completing on. Points in same buffer as text. */
4591 const char *sym_text
;
4592 /* Length of sym_text. */
4595 /* Now look for the symbol we are supposed to complete on.
4596 FIXME: This should be language-specific. */
4600 const char *quote_pos
= NULL
;
4602 /* First see if this is a quoted string. */
4604 for (p
= text
; *p
!= '\0'; ++p
)
4606 if (quote_found
!= '\0')
4608 if (*p
== quote_found
)
4609 /* Found close quote. */
4611 else if (*p
== '\\' && p
[1] == quote_found
)
4612 /* A backslash followed by the quote character
4613 doesn't end the string. */
4616 else if (*p
== '\'' || *p
== '"')
4622 if (quote_found
== '\'')
4623 /* A string within single quotes can be a symbol, so complete on it. */
4624 sym_text
= quote_pos
+ 1;
4625 else if (quote_found
== '"')
4626 /* A double-quoted string is never a symbol, nor does it make sense
4627 to complete it any other way. */
4633 /* Not a quoted string. */
4634 sym_text
= language_search_unquoted_string (text
, p
);
4638 sym_text_len
= strlen (sym_text
);
4642 /* Find the symtab for SRCFILE (this loads it if it was not yet read
4644 s
= lookup_symtab (srcfile
);
4647 /* Maybe they typed the file with leading directories, while the
4648 symbol tables record only its basename. */
4649 const char *tail
= lbasename (srcfile
);
4652 s
= lookup_symtab (tail
);
4655 /* If we have no symtab for that file, return an empty list. */
4657 return (return_val
);
4659 /* Go through this symtab and check the externs and statics for
4660 symbols which match. */
4662 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4663 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4665 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4668 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4669 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4671 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4674 return (return_val
);
4677 /* A helper function for make_source_files_completion_list. It adds
4678 another file name to a list of possible completions, growing the
4679 list as necessary. */
4682 add_filename_to_list (const char *fname
, const char *text
, const char *word
,
4683 VEC (char_ptr
) **list
)
4686 size_t fnlen
= strlen (fname
);
4690 /* Return exactly fname. */
4691 new = xmalloc (fnlen
+ 5);
4692 strcpy (new, fname
);
4694 else if (word
> text
)
4696 /* Return some portion of fname. */
4697 new = xmalloc (fnlen
+ 5);
4698 strcpy (new, fname
+ (word
- text
));
4702 /* Return some of TEXT plus fname. */
4703 new = xmalloc (fnlen
+ (text
- word
) + 5);
4704 strncpy (new, word
, text
- word
);
4705 new[text
- word
] = '\0';
4706 strcat (new, fname
);
4708 VEC_safe_push (char_ptr
, *list
, new);
4712 not_interesting_fname (const char *fname
)
4714 static const char *illegal_aliens
[] = {
4715 "_globals_", /* inserted by coff_symtab_read */
4720 for (i
= 0; illegal_aliens
[i
]; i
++)
4722 if (filename_cmp (fname
, illegal_aliens
[i
]) == 0)
4728 /* An object of this type is passed as the user_data argument to
4729 map_partial_symbol_filenames. */
4730 struct add_partial_filename_data
4732 struct filename_seen_cache
*filename_seen_cache
;
4736 VEC (char_ptr
) **list
;
4739 /* A callback for map_partial_symbol_filenames. */
4742 maybe_add_partial_symtab_filename (const char *filename
, const char *fullname
,
4745 struct add_partial_filename_data
*data
= user_data
;
4747 if (not_interesting_fname (filename
))
4749 if (!filename_seen (data
->filename_seen_cache
, filename
, 1)
4750 && filename_ncmp (filename
, data
->text
, data
->text_len
) == 0)
4752 /* This file matches for a completion; add it to the
4753 current list of matches. */
4754 add_filename_to_list (filename
, data
->text
, data
->word
, data
->list
);
4758 const char *base_name
= lbasename (filename
);
4760 if (base_name
!= filename
4761 && !filename_seen (data
->filename_seen_cache
, base_name
, 1)
4762 && filename_ncmp (base_name
, data
->text
, data
->text_len
) == 0)
4763 add_filename_to_list (base_name
, data
->text
, data
->word
, data
->list
);
4767 /* Return a vector of all source files whose names begin with matching
4768 TEXT. The file names are looked up in the symbol tables of this
4769 program. If the answer is no matchess, then the return value is
4773 make_source_files_completion_list (const char *text
, const char *word
)
4776 struct objfile
*objfile
;
4777 size_t text_len
= strlen (text
);
4778 VEC (char_ptr
) *list
= NULL
;
4779 const char *base_name
;
4780 struct add_partial_filename_data datum
;
4781 struct filename_seen_cache
*filename_seen_cache
;
4782 struct cleanup
*back_to
, *cache_cleanup
;
4784 if (!have_full_symbols () && !have_partial_symbols ())
4787 back_to
= make_cleanup (do_free_completion_list
, &list
);
4789 filename_seen_cache
= create_filename_seen_cache ();
4790 cache_cleanup
= make_cleanup (delete_filename_seen_cache
,
4791 filename_seen_cache
);
4793 ALL_SYMTABS (objfile
, s
)
4795 if (not_interesting_fname (s
->filename
))
4797 if (!filename_seen (filename_seen_cache
, s
->filename
, 1)
4798 && filename_ncmp (s
->filename
, text
, text_len
) == 0)
4800 /* This file matches for a completion; add it to the current
4802 add_filename_to_list (s
->filename
, text
, word
, &list
);
4806 /* NOTE: We allow the user to type a base name when the
4807 debug info records leading directories, but not the other
4808 way around. This is what subroutines of breakpoint
4809 command do when they parse file names. */
4810 base_name
= lbasename (s
->filename
);
4811 if (base_name
!= s
->filename
4812 && !filename_seen (filename_seen_cache
, base_name
, 1)
4813 && filename_ncmp (base_name
, text
, text_len
) == 0)
4814 add_filename_to_list (base_name
, text
, word
, &list
);
4818 datum
.filename_seen_cache
= filename_seen_cache
;
4821 datum
.text_len
= text_len
;
4823 map_symbol_filenames (maybe_add_partial_symtab_filename
, &datum
,
4824 0 /*need_fullname*/);
4826 do_cleanups (cache_cleanup
);
4827 discard_cleanups (back_to
);
4832 /* Determine if PC is in the prologue of a function. The prologue is the area
4833 between the first instruction of a function, and the first executable line.
4834 Returns 1 if PC *might* be in prologue, 0 if definately *not* in prologue.
4836 If non-zero, func_start is where we think the prologue starts, possibly
4837 by previous examination of symbol table information. */
4840 in_prologue (struct gdbarch
*gdbarch
, CORE_ADDR pc
, CORE_ADDR func_start
)
4842 struct symtab_and_line sal
;
4843 CORE_ADDR func_addr
, func_end
;
4845 /* We have several sources of information we can consult to figure
4847 - Compilers usually emit line number info that marks the prologue
4848 as its own "source line". So the ending address of that "line"
4849 is the end of the prologue. If available, this is the most
4851 - The minimal symbols and partial symbols, which can usually tell
4852 us the starting and ending addresses of a function.
4853 - If we know the function's start address, we can call the
4854 architecture-defined gdbarch_skip_prologue function to analyze the
4855 instruction stream and guess where the prologue ends.
4856 - Our `func_start' argument; if non-zero, this is the caller's
4857 best guess as to the function's entry point. At the time of
4858 this writing, handle_inferior_event doesn't get this right, so
4859 it should be our last resort. */
4861 /* Consult the partial symbol table, to find which function
4863 if (! find_pc_partial_function (pc
, NULL
, &func_addr
, &func_end
))
4865 CORE_ADDR prologue_end
;
4867 /* We don't even have minsym information, so fall back to using
4868 func_start, if given. */
4870 return 1; /* We *might* be in a prologue. */
4872 prologue_end
= gdbarch_skip_prologue (gdbarch
, func_start
);
4874 return func_start
<= pc
&& pc
< prologue_end
;
4877 /* If we have line number information for the function, that's
4878 usually pretty reliable. */
4879 sal
= find_pc_line (func_addr
, 0);
4881 /* Now sal describes the source line at the function's entry point,
4882 which (by convention) is the prologue. The end of that "line",
4883 sal.end, is the end of the prologue.
4885 Note that, for functions whose source code is all on a single
4886 line, the line number information doesn't always end up this way.
4887 So we must verify that our purported end-of-prologue address is
4888 *within* the function, not at its start or end. */
4890 || sal
.end
<= func_addr
4891 || func_end
<= sal
.end
)
4893 /* We don't have any good line number info, so use the minsym
4894 information, together with the architecture-specific prologue
4896 CORE_ADDR prologue_end
= gdbarch_skip_prologue (gdbarch
, func_addr
);
4898 return func_addr
<= pc
&& pc
< prologue_end
;
4901 /* We have line number info, and it looks good. */
4902 return func_addr
<= pc
&& pc
< sal
.end
;
4905 /* Given PC at the function's start address, attempt to find the
4906 prologue end using SAL information. Return zero if the skip fails.
4908 A non-optimized prologue traditionally has one SAL for the function
4909 and a second for the function body. A single line function has
4910 them both pointing at the same line.
4912 An optimized prologue is similar but the prologue may contain
4913 instructions (SALs) from the instruction body. Need to skip those
4914 while not getting into the function body.
4916 The functions end point and an increasing SAL line are used as
4917 indicators of the prologue's endpoint.
4919 This code is based on the function refine_prologue_limit
4923 skip_prologue_using_sal (struct gdbarch
*gdbarch
, CORE_ADDR func_addr
)
4925 struct symtab_and_line prologue_sal
;
4928 const struct block
*bl
;
4930 /* Get an initial range for the function. */
4931 find_pc_partial_function (func_addr
, NULL
, &start_pc
, &end_pc
);
4932 start_pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
4934 prologue_sal
= find_pc_line (start_pc
, 0);
4935 if (prologue_sal
.line
!= 0)
4937 /* For languages other than assembly, treat two consecutive line
4938 entries at the same address as a zero-instruction prologue.
4939 The GNU assembler emits separate line notes for each instruction
4940 in a multi-instruction macro, but compilers generally will not
4942 if (prologue_sal
.symtab
->language
!= language_asm
)
4944 struct linetable
*linetable
= LINETABLE (prologue_sal
.symtab
);
4947 /* Skip any earlier lines, and any end-of-sequence marker
4948 from a previous function. */
4949 while (linetable
->item
[idx
].pc
!= prologue_sal
.pc
4950 || linetable
->item
[idx
].line
== 0)
4953 if (idx
+1 < linetable
->nitems
4954 && linetable
->item
[idx
+1].line
!= 0
4955 && linetable
->item
[idx
+1].pc
== start_pc
)
4959 /* If there is only one sal that covers the entire function,
4960 then it is probably a single line function, like
4962 if (prologue_sal
.end
>= end_pc
)
4965 while (prologue_sal
.end
< end_pc
)
4967 struct symtab_and_line sal
;
4969 sal
= find_pc_line (prologue_sal
.end
, 0);
4972 /* Assume that a consecutive SAL for the same (or larger)
4973 line mark the prologue -> body transition. */
4974 if (sal
.line
>= prologue_sal
.line
)
4976 /* Likewise if we are in a different symtab altogether
4977 (e.g. within a file included via #include). */
4978 if (sal
.symtab
!= prologue_sal
.symtab
)
4981 /* The line number is smaller. Check that it's from the
4982 same function, not something inlined. If it's inlined,
4983 then there is no point comparing the line numbers. */
4984 bl
= block_for_pc (prologue_sal
.end
);
4987 if (block_inlined_p (bl
))
4989 if (BLOCK_FUNCTION (bl
))
4994 bl
= BLOCK_SUPERBLOCK (bl
);
4999 /* The case in which compiler's optimizer/scheduler has
5000 moved instructions into the prologue. We look ahead in
5001 the function looking for address ranges whose
5002 corresponding line number is less the first one that we
5003 found for the function. This is more conservative then
5004 refine_prologue_limit which scans a large number of SALs
5005 looking for any in the prologue. */
5010 if (prologue_sal
.end
< end_pc
)
5011 /* Return the end of this line, or zero if we could not find a
5013 return prologue_sal
.end
;
5015 /* Don't return END_PC, which is past the end of the function. */
5016 return prologue_sal
.pc
;
5021 /* Return the "main_info" object for the current program space. If
5022 the object has not yet been created, create it and fill in some
5025 static struct main_info
*
5026 get_main_info (void)
5028 struct main_info
*info
= program_space_data (current_program_space
,
5029 main_progspace_key
);
5033 /* It may seem strange to store the main name in the progspace
5034 and also in whatever objfile happens to see a main name in
5035 its debug info. The reason for this is mainly historical:
5036 gdb returned "main" as the name even if no function named
5037 "main" was defined the program; and this approach lets us
5038 keep compatibility. */
5039 info
= XCNEW (struct main_info
);
5040 info
->language_of_main
= language_unknown
;
5041 set_program_space_data (current_program_space
, main_progspace_key
,
5048 /* A cleanup to destroy a struct main_info when a progspace is
5052 main_info_cleanup (struct program_space
*pspace
, void *data
)
5054 struct main_info
*info
= data
;
5057 xfree (info
->name_of_main
);
5062 set_main_name (const char *name
, enum language lang
)
5064 struct main_info
*info
= get_main_info ();
5066 if (info
->name_of_main
!= NULL
)
5068 xfree (info
->name_of_main
);
5069 info
->name_of_main
= NULL
;
5070 info
->language_of_main
= language_unknown
;
5074 info
->name_of_main
= xstrdup (name
);
5075 info
->language_of_main
= lang
;
5079 /* Deduce the name of the main procedure, and set NAME_OF_MAIN
5083 find_main_name (void)
5085 const char *new_main_name
;
5086 struct objfile
*objfile
;
5088 /* First check the objfiles to see whether a debuginfo reader has
5089 picked up the appropriate main name. Historically the main name
5090 was found in a more or less random way; this approach instead
5091 relies on the order of objfile creation -- which still isn't
5092 guaranteed to get the correct answer, but is just probably more
5094 ALL_OBJFILES (objfile
)
5096 if (objfile
->per_bfd
->name_of_main
!= NULL
)
5098 set_main_name (objfile
->per_bfd
->name_of_main
,
5099 objfile
->per_bfd
->language_of_main
);
5104 /* Try to see if the main procedure is in Ada. */
5105 /* FIXME: brobecker/2005-03-07: Another way of doing this would
5106 be to add a new method in the language vector, and call this
5107 method for each language until one of them returns a non-empty
5108 name. This would allow us to remove this hard-coded call to
5109 an Ada function. It is not clear that this is a better approach
5110 at this point, because all methods need to be written in a way
5111 such that false positives never be returned. For instance, it is
5112 important that a method does not return a wrong name for the main
5113 procedure if the main procedure is actually written in a different
5114 language. It is easy to guaranty this with Ada, since we use a
5115 special symbol generated only when the main in Ada to find the name
5116 of the main procedure. It is difficult however to see how this can
5117 be guarantied for languages such as C, for instance. This suggests
5118 that order of call for these methods becomes important, which means
5119 a more complicated approach. */
5120 new_main_name
= ada_main_name ();
5121 if (new_main_name
!= NULL
)
5123 set_main_name (new_main_name
, language_ada
);
5127 new_main_name
= d_main_name ();
5128 if (new_main_name
!= NULL
)
5130 set_main_name (new_main_name
, language_d
);
5134 new_main_name
= go_main_name ();
5135 if (new_main_name
!= NULL
)
5137 set_main_name (new_main_name
, language_go
);
5141 new_main_name
= pascal_main_name ();
5142 if (new_main_name
!= NULL
)
5144 set_main_name (new_main_name
, language_pascal
);
5148 /* The languages above didn't identify the name of the main procedure.
5149 Fallback to "main". */
5150 set_main_name ("main", language_unknown
);
5156 struct main_info
*info
= get_main_info ();
5158 if (info
->name_of_main
== NULL
)
5161 return info
->name_of_main
;
5164 /* Return the language of the main function. If it is not known,
5165 return language_unknown. */
5168 main_language (void)
5170 struct main_info
*info
= get_main_info ();
5172 if (info
->name_of_main
== NULL
)
5175 return info
->language_of_main
;
5178 /* Handle ``executable_changed'' events for the symtab module. */
5181 symtab_observer_executable_changed (void)
5183 /* NAME_OF_MAIN may no longer be the same, so reset it for now. */
5184 set_main_name (NULL
, language_unknown
);
5187 /* Return 1 if the supplied producer string matches the ARM RealView
5188 compiler (armcc). */
5191 producer_is_realview (const char *producer
)
5193 static const char *const arm_idents
[] = {
5194 "ARM C Compiler, ADS",
5195 "Thumb C Compiler, ADS",
5196 "ARM C++ Compiler, ADS",
5197 "Thumb C++ Compiler, ADS",
5198 "ARM/Thumb C/C++ Compiler, RVCT",
5199 "ARM C/C++ Compiler, RVCT"
5203 if (producer
== NULL
)
5206 for (i
= 0; i
< ARRAY_SIZE (arm_idents
); i
++)
5207 if (strncmp (producer
, arm_idents
[i
], strlen (arm_idents
[i
])) == 0)
5215 /* The next index to hand out in response to a registration request. */
5217 static int next_aclass_value
= LOC_FINAL_VALUE
;
5219 /* The maximum number of "aclass" registrations we support. This is
5220 constant for convenience. */
5221 #define MAX_SYMBOL_IMPLS (LOC_FINAL_VALUE + 10)
5223 /* The objects representing the various "aclass" values. The elements
5224 from 0 up to LOC_FINAL_VALUE-1 represent themselves, and subsequent
5225 elements are those registered at gdb initialization time. */
5227 static struct symbol_impl symbol_impl
[MAX_SYMBOL_IMPLS
];
5229 /* The globally visible pointer. This is separate from 'symbol_impl'
5230 so that it can be const. */
5232 const struct symbol_impl
*symbol_impls
= &symbol_impl
[0];
5234 /* Make sure we saved enough room in struct symbol. */
5236 gdb_static_assert (MAX_SYMBOL_IMPLS
<= (1 << SYMBOL_ACLASS_BITS
));
5238 /* Register a computed symbol type. ACLASS must be LOC_COMPUTED. OPS
5239 is the ops vector associated with this index. This returns the new
5240 index, which should be used as the aclass_index field for symbols
5244 register_symbol_computed_impl (enum address_class aclass
,
5245 const struct symbol_computed_ops
*ops
)
5247 int result
= next_aclass_value
++;
5249 gdb_assert (aclass
== LOC_COMPUTED
);
5250 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5251 symbol_impl
[result
].aclass
= aclass
;
5252 symbol_impl
[result
].ops_computed
= ops
;
5254 /* Sanity check OPS. */
5255 gdb_assert (ops
!= NULL
);
5256 gdb_assert (ops
->tracepoint_var_ref
!= NULL
);
5257 gdb_assert (ops
->describe_location
!= NULL
);
5258 gdb_assert (ops
->read_needs_frame
!= NULL
);
5259 gdb_assert (ops
->read_variable
!= NULL
);
5264 /* Register a function with frame base type. ACLASS must be LOC_BLOCK.
5265 OPS is the ops vector associated with this index. This returns the
5266 new index, which should be used as the aclass_index field for symbols
5270 register_symbol_block_impl (enum address_class aclass
,
5271 const struct symbol_block_ops
*ops
)
5273 int result
= next_aclass_value
++;
5275 gdb_assert (aclass
== LOC_BLOCK
);
5276 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5277 symbol_impl
[result
].aclass
= aclass
;
5278 symbol_impl
[result
].ops_block
= ops
;
5280 /* Sanity check OPS. */
5281 gdb_assert (ops
!= NULL
);
5282 gdb_assert (ops
->find_frame_base_location
!= NULL
);
5287 /* Register a register symbol type. ACLASS must be LOC_REGISTER or
5288 LOC_REGPARM_ADDR. OPS is the register ops vector associated with
5289 this index. This returns the new index, which should be used as
5290 the aclass_index field for symbols of this type. */
5293 register_symbol_register_impl (enum address_class aclass
,
5294 const struct symbol_register_ops
*ops
)
5296 int result
= next_aclass_value
++;
5298 gdb_assert (aclass
== LOC_REGISTER
|| aclass
== LOC_REGPARM_ADDR
);
5299 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5300 symbol_impl
[result
].aclass
= aclass
;
5301 symbol_impl
[result
].ops_register
= ops
;
5306 /* Initialize elements of 'symbol_impl' for the constants in enum
5310 initialize_ordinary_address_classes (void)
5314 for (i
= 0; i
< LOC_FINAL_VALUE
; ++i
)
5315 symbol_impl
[i
].aclass
= i
;
5320 /* Initialize the symbol SYM. */
5323 initialize_symbol (struct symbol
*sym
)
5325 memset (sym
, 0, sizeof (*sym
));
5326 SYMBOL_SECTION (sym
) = -1;
5329 /* Allocate and initialize a new 'struct symbol' on OBJFILE's
5333 allocate_symbol (struct objfile
*objfile
)
5335 struct symbol
*result
;
5337 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct symbol
);
5338 SYMBOL_SECTION (result
) = -1;
5343 /* Allocate and initialize a new 'struct template_symbol' on OBJFILE's
5346 struct template_symbol
*
5347 allocate_template_symbol (struct objfile
*objfile
)
5349 struct template_symbol
*result
;
5351 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct template_symbol
);
5352 SYMBOL_SECTION (&result
->base
) = -1;
5360 _initialize_symtab (void)
5362 initialize_ordinary_address_classes ();
5365 = register_program_space_data_with_cleanup (NULL
, main_info_cleanup
);
5367 add_info ("variables", variables_info
, _("\
5368 All global and static variable names, or those matching REGEXP."));
5370 add_com ("whereis", class_info
, variables_info
, _("\
5371 All global and static variable names, or those matching REGEXP."));
5373 add_info ("functions", functions_info
,
5374 _("All function names, or those matching REGEXP."));
5376 /* FIXME: This command has at least the following problems:
5377 1. It prints builtin types (in a very strange and confusing fashion).
5378 2. It doesn't print right, e.g. with
5379 typedef struct foo *FOO
5380 type_print prints "FOO" when we want to make it (in this situation)
5381 print "struct foo *".
5382 I also think "ptype" or "whatis" is more likely to be useful (but if
5383 there is much disagreement "info types" can be fixed). */
5384 add_info ("types", types_info
,
5385 _("All type names, or those matching REGEXP."));
5387 add_info ("sources", sources_info
,
5388 _("Source files in the program."));
5390 add_com ("rbreak", class_breakpoint
, rbreak_command
,
5391 _("Set a breakpoint for all functions matching REGEXP."));
5395 add_com ("lf", class_info
, sources_info
,
5396 _("Source files in the program"));
5397 add_com ("lg", class_info
, variables_info
, _("\
5398 All global and static variable names, or those matching REGEXP."));
5401 add_setshow_enum_cmd ("multiple-symbols", no_class
,
5402 multiple_symbols_modes
, &multiple_symbols_mode
,
5404 Set the debugger behavior when more than one symbol are possible matches\n\
5405 in an expression."), _("\
5406 Show how the debugger handles ambiguities in expressions."), _("\
5407 Valid values are \"ask\", \"all\", \"cancel\", and the default is \"all\"."),
5408 NULL
, NULL
, &setlist
, &showlist
);
5410 add_setshow_boolean_cmd ("basenames-may-differ", class_obscure
,
5411 &basenames_may_differ
, _("\
5412 Set whether a source file may have multiple base names."), _("\
5413 Show whether a source file may have multiple base names."), _("\
5414 (A \"base name\" is the name of a file with the directory part removed.\n\
5415 Example: The base name of \"/home/user/hello.c\" is \"hello.c\".)\n\
5416 If set, GDB will canonicalize file names (e.g., expand symlinks)\n\
5417 before comparing them. Canonicalization is an expensive operation,\n\
5418 but it allows the same file be known by more than one base name.\n\
5419 If not set (the default), all source files are assumed to have just\n\
5420 one base name, and gdb will do file name comparisons more efficiently."),
5422 &setlist
, &showlist
);
5424 add_setshow_zuinteger_cmd ("symtab-create", no_class
, &symtab_create_debug
,
5425 _("Set debugging of symbol table creation."),
5426 _("Show debugging of symbol table creation."), _("\
5427 When enabled (non-zero), debugging messages are printed when building\n\
5428 symbol tables. A value of 1 (one) normally provides enough information.\n\
5429 A value greater than 1 provides more verbose information."),
5432 &setdebuglist
, &showdebuglist
);
5434 observer_attach_executable_changed (symtab_observer_executable_changed
);