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>
56 #include "cp-support.h"
60 #include "macroscope.h"
62 #include "parser-defs.h"
64 /* Forward declarations for local functions. */
66 static void rbreak_command (char *, int);
68 static int find_line_common (struct linetable
*, int, int *, int);
70 static struct symbol
*lookup_symbol_aux (const char *name
,
71 const struct block
*block
,
72 const domain_enum domain
,
73 enum language language
,
74 struct field_of_this_result
*);
77 struct symbol
*lookup_symbol_aux_local (const char *name
,
78 const struct block
*block
,
79 const domain_enum domain
,
80 enum language language
);
83 struct symbol
*lookup_symbol_aux_symtabs (int block_index
,
85 const domain_enum domain
);
88 struct symbol
*lookup_symbol_aux_quick (struct objfile
*objfile
,
91 const domain_enum domain
);
93 extern initialize_file_ftype _initialize_symtab
;
95 /* Program space key for finding name and language of "main". */
97 static const struct program_space_data
*main_progspace_key
;
99 /* Type of the data stored on the program space. */
103 /* Name of "main". */
107 /* Language of "main". */
109 enum language language_of_main
;
112 /* When non-zero, print debugging messages related to symtab creation. */
113 unsigned int symtab_create_debug
= 0;
115 /* Non-zero if a file may be known by two different basenames.
116 This is the uncommon case, and significantly slows down gdb.
117 Default set to "off" to not slow down the common case. */
118 int basenames_may_differ
= 0;
120 /* Allow the user to configure the debugger behavior with respect
121 to multiple-choice menus when more than one symbol matches during
124 const char multiple_symbols_ask
[] = "ask";
125 const char multiple_symbols_all
[] = "all";
126 const char multiple_symbols_cancel
[] = "cancel";
127 static const char *const multiple_symbols_modes
[] =
129 multiple_symbols_ask
,
130 multiple_symbols_all
,
131 multiple_symbols_cancel
,
134 static const char *multiple_symbols_mode
= multiple_symbols_all
;
136 /* Read-only accessor to AUTO_SELECT_MODE. */
139 multiple_symbols_select_mode (void)
141 return multiple_symbols_mode
;
144 /* Block in which the most recently searched-for symbol was found.
145 Might be better to make this a parameter to lookup_symbol and
148 const struct block
*block_found
;
150 /* Return the name of a domain_enum. */
153 domain_name (domain_enum e
)
157 case UNDEF_DOMAIN
: return "UNDEF_DOMAIN";
158 case VAR_DOMAIN
: return "VAR_DOMAIN";
159 case STRUCT_DOMAIN
: return "STRUCT_DOMAIN";
160 case LABEL_DOMAIN
: return "LABEL_DOMAIN";
161 case COMMON_BLOCK_DOMAIN
: return "COMMON_BLOCK_DOMAIN";
162 default: gdb_assert_not_reached ("bad domain_enum");
166 /* Return the name of a search_domain . */
169 search_domain_name (enum search_domain e
)
173 case VARIABLES_DOMAIN
: return "VARIABLES_DOMAIN";
174 case FUNCTIONS_DOMAIN
: return "FUNCTIONS_DOMAIN";
175 case TYPES_DOMAIN
: return "TYPES_DOMAIN";
176 case ALL_DOMAIN
: return "ALL_DOMAIN";
177 default: gdb_assert_not_reached ("bad search_domain");
181 /* Set the primary field in SYMTAB. */
184 set_symtab_primary (struct symtab
*symtab
, int primary
)
186 symtab
->primary
= primary
;
188 if (symtab_create_debug
&& primary
)
190 fprintf_unfiltered (gdb_stdlog
,
191 "Created primary symtab %s for %s.\n",
192 host_address_to_string (symtab
),
193 symtab_to_filename_for_display (symtab
));
197 /* See whether FILENAME matches SEARCH_NAME using the rule that we
198 advertise to the user. (The manual's description of linespecs
199 describes what we advertise). Returns true if they match, false
203 compare_filenames_for_search (const char *filename
, const char *search_name
)
205 int len
= strlen (filename
);
206 size_t search_len
= strlen (search_name
);
208 if (len
< search_len
)
211 /* The tail of FILENAME must match. */
212 if (FILENAME_CMP (filename
+ len
- search_len
, search_name
) != 0)
215 /* Either the names must completely match, or the character
216 preceding the trailing SEARCH_NAME segment of FILENAME must be a
219 The check !IS_ABSOLUTE_PATH ensures SEARCH_NAME "/dir/file.c"
220 cannot match FILENAME "/path//dir/file.c" - as user has requested
221 absolute path. The sama applies for "c:\file.c" possibly
222 incorrectly hypothetically matching "d:\dir\c:\file.c".
224 The HAS_DRIVE_SPEC purpose is to make FILENAME "c:file.c"
225 compatible with SEARCH_NAME "file.c". In such case a compiler had
226 to put the "c:file.c" name into debug info. Such compatibility
227 works only on GDB built for DOS host. */
228 return (len
== search_len
229 || (!IS_ABSOLUTE_PATH (search_name
)
230 && IS_DIR_SEPARATOR (filename
[len
- search_len
- 1]))
231 || (HAS_DRIVE_SPEC (filename
)
232 && STRIP_DRIVE_SPEC (filename
) == &filename
[len
- search_len
]));
235 /* Check for a symtab of a specific name by searching some symtabs.
236 This is a helper function for callbacks of iterate_over_symtabs.
238 If NAME is not absolute, then REAL_PATH is NULL
239 If NAME is absolute, then REAL_PATH is the gdb_realpath form of NAME.
241 The return value, NAME, REAL_PATH, CALLBACK, and DATA
242 are identical to the `map_symtabs_matching_filename' method of
243 quick_symbol_functions.
245 FIRST and AFTER_LAST indicate the range of symtabs to search.
246 AFTER_LAST is one past the last symtab to search; NULL means to
247 search until the end of the list. */
250 iterate_over_some_symtabs (const char *name
,
251 const char *real_path
,
252 int (*callback
) (struct symtab
*symtab
,
255 struct symtab
*first
,
256 struct symtab
*after_last
)
258 struct symtab
*s
= NULL
;
259 const char* base_name
= lbasename (name
);
261 for (s
= first
; s
!= NULL
&& s
!= after_last
; s
= s
->next
)
263 if (compare_filenames_for_search (s
->filename
, name
))
265 if (callback (s
, data
))
270 /* Before we invoke realpath, which can get expensive when many
271 files are involved, do a quick comparison of the basenames. */
272 if (! basenames_may_differ
273 && FILENAME_CMP (base_name
, lbasename (s
->filename
)) != 0)
276 if (compare_filenames_for_search (symtab_to_fullname (s
), name
))
278 if (callback (s
, data
))
283 /* If the user gave us an absolute path, try to find the file in
284 this symtab and use its absolute path. */
285 if (real_path
!= NULL
)
287 const char *fullname
= symtab_to_fullname (s
);
289 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
290 gdb_assert (IS_ABSOLUTE_PATH (name
));
291 if (FILENAME_CMP (real_path
, fullname
) == 0)
293 if (callback (s
, data
))
303 /* Check for a symtab of a specific name; first in symtabs, then in
304 psymtabs. *If* there is no '/' in the name, a match after a '/'
305 in the symtab filename will also work.
307 Calls CALLBACK with each symtab that is found and with the supplied
308 DATA. If CALLBACK returns true, the search stops. */
311 iterate_over_symtabs (const char *name
,
312 int (*callback
) (struct symtab
*symtab
,
316 struct objfile
*objfile
;
317 char *real_path
= NULL
;
318 struct cleanup
*cleanups
= make_cleanup (null_cleanup
, NULL
);
320 /* Here we are interested in canonicalizing an absolute path, not
321 absolutizing a relative path. */
322 if (IS_ABSOLUTE_PATH (name
))
324 real_path
= gdb_realpath (name
);
325 make_cleanup (xfree
, real_path
);
326 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
329 ALL_OBJFILES (objfile
)
331 if (iterate_over_some_symtabs (name
, real_path
, callback
, data
,
332 objfile
->symtabs
, NULL
))
334 do_cleanups (cleanups
);
339 /* Same search rules as above apply here, but now we look thru the
342 ALL_OBJFILES (objfile
)
345 && objfile
->sf
->qf
->map_symtabs_matching_filename (objfile
,
351 do_cleanups (cleanups
);
356 do_cleanups (cleanups
);
359 /* The callback function used by lookup_symtab. */
362 lookup_symtab_callback (struct symtab
*symtab
, void *data
)
364 struct symtab
**result_ptr
= data
;
366 *result_ptr
= symtab
;
370 /* A wrapper for iterate_over_symtabs that returns the first matching
374 lookup_symtab (const char *name
)
376 struct symtab
*result
= NULL
;
378 iterate_over_symtabs (name
, lookup_symtab_callback
, &result
);
383 /* Mangle a GDB method stub type. This actually reassembles the pieces of the
384 full method name, which consist of the class name (from T), the unadorned
385 method name from METHOD_ID, and the signature for the specific overload,
386 specified by SIGNATURE_ID. Note that this function is g++ specific. */
389 gdb_mangle_name (struct type
*type
, int method_id
, int signature_id
)
391 int mangled_name_len
;
393 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, method_id
);
394 struct fn_field
*method
= &f
[signature_id
];
395 const char *field_name
= TYPE_FN_FIELDLIST_NAME (type
, method_id
);
396 const char *physname
= TYPE_FN_FIELD_PHYSNAME (f
, signature_id
);
397 const char *newname
= type_name_no_tag (type
);
399 /* Does the form of physname indicate that it is the full mangled name
400 of a constructor (not just the args)? */
401 int is_full_physname_constructor
;
404 int is_destructor
= is_destructor_name (physname
);
405 /* Need a new type prefix. */
406 char *const_prefix
= method
->is_const
? "C" : "";
407 char *volatile_prefix
= method
->is_volatile
? "V" : "";
409 int len
= (newname
== NULL
? 0 : strlen (newname
));
411 /* Nothing to do if physname already contains a fully mangled v3 abi name
412 or an operator name. */
413 if ((physname
[0] == '_' && physname
[1] == 'Z')
414 || is_operator_name (field_name
))
415 return xstrdup (physname
);
417 is_full_physname_constructor
= is_constructor_name (physname
);
419 is_constructor
= is_full_physname_constructor
420 || (newname
&& strcmp (field_name
, newname
) == 0);
423 is_destructor
= (strncmp (physname
, "__dt", 4) == 0);
425 if (is_destructor
|| is_full_physname_constructor
)
427 mangled_name
= (char *) xmalloc (strlen (physname
) + 1);
428 strcpy (mangled_name
, physname
);
434 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
436 else if (physname
[0] == 't' || physname
[0] == 'Q')
438 /* The physname for template and qualified methods already includes
440 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
446 xsnprintf (buf
, sizeof (buf
), "__%s%s%d", const_prefix
,
447 volatile_prefix
, len
);
449 mangled_name_len
= ((is_constructor
? 0 : strlen (field_name
))
450 + strlen (buf
) + len
+ strlen (physname
) + 1);
452 mangled_name
= (char *) xmalloc (mangled_name_len
);
454 mangled_name
[0] = '\0';
456 strcpy (mangled_name
, field_name
);
458 strcat (mangled_name
, buf
);
459 /* If the class doesn't have a name, i.e. newname NULL, then we just
460 mangle it using 0 for the length of the class. Thus it gets mangled
461 as something starting with `::' rather than `classname::'. */
463 strcat (mangled_name
, newname
);
465 strcat (mangled_name
, physname
);
466 return (mangled_name
);
469 /* Initialize the cplus_specific structure. 'cplus_specific' should
470 only be allocated for use with cplus symbols. */
473 symbol_init_cplus_specific (struct general_symbol_info
*gsymbol
,
474 struct obstack
*obstack
)
476 /* A language_specific structure should not have been previously
478 gdb_assert (gsymbol
->language_specific
.cplus_specific
== NULL
);
479 gdb_assert (obstack
!= NULL
);
481 gsymbol
->language_specific
.cplus_specific
=
482 OBSTACK_ZALLOC (obstack
, struct cplus_specific
);
485 /* Set the demangled name of GSYMBOL to NAME. NAME must be already
486 correctly allocated. For C++ symbols a cplus_specific struct is
487 allocated so OBJFILE must not be NULL. If this is a non C++ symbol
488 OBJFILE can be NULL. */
491 symbol_set_demangled_name (struct general_symbol_info
*gsymbol
,
493 struct obstack
*obstack
)
495 if (gsymbol
->language
== language_cplus
)
497 if (gsymbol
->language_specific
.cplus_specific
== NULL
)
498 symbol_init_cplus_specific (gsymbol
, obstack
);
500 gsymbol
->language_specific
.cplus_specific
->demangled_name
= name
;
502 else if (gsymbol
->language
== language_ada
)
506 gsymbol
->ada_mangled
= 0;
507 gsymbol
->language_specific
.obstack
= obstack
;
511 gsymbol
->ada_mangled
= 1;
512 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
516 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
519 /* Return the demangled name of GSYMBOL. */
522 symbol_get_demangled_name (const struct general_symbol_info
*gsymbol
)
524 if (gsymbol
->language
== language_cplus
)
526 if (gsymbol
->language_specific
.cplus_specific
!= NULL
)
527 return gsymbol
->language_specific
.cplus_specific
->demangled_name
;
531 else if (gsymbol
->language
== language_ada
)
533 if (!gsymbol
->ada_mangled
)
538 return gsymbol
->language_specific
.mangled_lang
.demangled_name
;
542 /* Initialize the language dependent portion of a symbol
543 depending upon the language for the symbol. */
546 symbol_set_language (struct general_symbol_info
*gsymbol
,
547 enum language language
,
548 struct obstack
*obstack
)
550 gsymbol
->language
= language
;
551 if (gsymbol
->language
== language_d
552 || gsymbol
->language
== language_go
553 || gsymbol
->language
== language_java
554 || gsymbol
->language
== language_objc
555 || gsymbol
->language
== language_fortran
)
557 symbol_set_demangled_name (gsymbol
, NULL
, obstack
);
559 else if (gsymbol
->language
== language_ada
)
561 gdb_assert (gsymbol
->ada_mangled
== 0);
562 gsymbol
->language_specific
.obstack
= obstack
;
564 else if (gsymbol
->language
== language_cplus
)
565 gsymbol
->language_specific
.cplus_specific
= NULL
;
568 memset (&gsymbol
->language_specific
, 0,
569 sizeof (gsymbol
->language_specific
));
573 /* Functions to initialize a symbol's mangled name. */
575 /* Objects of this type are stored in the demangled name hash table. */
576 struct demangled_name_entry
582 /* Hash function for the demangled name hash. */
585 hash_demangled_name_entry (const void *data
)
587 const struct demangled_name_entry
*e
= data
;
589 return htab_hash_string (e
->mangled
);
592 /* Equality function for the demangled name hash. */
595 eq_demangled_name_entry (const void *a
, const void *b
)
597 const struct demangled_name_entry
*da
= a
;
598 const struct demangled_name_entry
*db
= b
;
600 return strcmp (da
->mangled
, db
->mangled
) == 0;
603 /* Create the hash table used for demangled names. Each hash entry is
604 a pair of strings; one for the mangled name and one for the demangled
605 name. The entry is hashed via just the mangled name. */
608 create_demangled_names_hash (struct objfile
*objfile
)
610 /* Choose 256 as the starting size of the hash table, somewhat arbitrarily.
611 The hash table code will round this up to the next prime number.
612 Choosing a much larger table size wastes memory, and saves only about
613 1% in symbol reading. */
615 objfile
->per_bfd
->demangled_names_hash
= htab_create_alloc
616 (256, hash_demangled_name_entry
, eq_demangled_name_entry
,
617 NULL
, xcalloc
, xfree
);
620 /* Try to determine the demangled name for a symbol, based on the
621 language of that symbol. If the language is set to language_auto,
622 it will attempt to find any demangling algorithm that works and
623 then set the language appropriately. The returned name is allocated
624 by the demangler and should be xfree'd. */
627 symbol_find_demangled_name (struct general_symbol_info
*gsymbol
,
630 char *demangled
= NULL
;
632 if (gsymbol
->language
== language_unknown
)
633 gsymbol
->language
= language_auto
;
635 if (gsymbol
->language
== language_objc
636 || gsymbol
->language
== language_auto
)
639 objc_demangle (mangled
, 0);
640 if (demangled
!= NULL
)
642 gsymbol
->language
= language_objc
;
646 if (gsymbol
->language
== language_cplus
647 || gsymbol
->language
== language_auto
)
650 gdb_demangle (mangled
, DMGL_PARAMS
| DMGL_ANSI
);
651 if (demangled
!= NULL
)
653 gsymbol
->language
= language_cplus
;
657 if (gsymbol
->language
== language_java
)
660 gdb_demangle (mangled
,
661 DMGL_PARAMS
| DMGL_ANSI
| DMGL_JAVA
);
662 if (demangled
!= NULL
)
664 gsymbol
->language
= language_java
;
668 if (gsymbol
->language
== language_d
669 || gsymbol
->language
== language_auto
)
671 demangled
= d_demangle(mangled
, 0);
672 if (demangled
!= NULL
)
674 gsymbol
->language
= language_d
;
678 /* FIXME(dje): Continually adding languages here is clumsy.
679 Better to just call la_demangle if !auto, and if auto then call
680 a utility routine that tries successive languages in turn and reports
681 which one it finds. I realize the la_demangle options may be different
682 for different languages but there's already a FIXME for that. */
683 if (gsymbol
->language
== language_go
684 || gsymbol
->language
== language_auto
)
686 demangled
= go_demangle (mangled
, 0);
687 if (demangled
!= NULL
)
689 gsymbol
->language
= language_go
;
694 /* We could support `gsymbol->language == language_fortran' here to provide
695 module namespaces also for inferiors with only minimal symbol table (ELF
696 symbols). Just the mangling standard is not standardized across compilers
697 and there is no DW_AT_producer available for inferiors with only the ELF
698 symbols to check the mangling kind. */
700 /* Check for Ada symbols last. See comment below explaining why. */
702 if (gsymbol
->language
== language_auto
)
704 const char *demangled
= ada_decode (mangled
);
706 if (demangled
!= mangled
&& demangled
!= NULL
&& demangled
[0] != '<')
708 /* Set the gsymbol language to Ada, but still return NULL.
709 Two reasons for that:
711 1. For Ada, we prefer computing the symbol's decoded name
712 on the fly rather than pre-compute it, in order to save
713 memory (Ada projects are typically very large).
715 2. There are some areas in the definition of the GNAT
716 encoding where, with a bit of bad luck, we might be able
717 to decode a non-Ada symbol, generating an incorrect
718 demangled name (Eg: names ending with "TB" for instance
719 are identified as task bodies and so stripped from
720 the decoded name returned).
722 Returning NULL, here, helps us get a little bit of
723 the best of both worlds. Because we're last, we should
724 not affect any of the other languages that were able to
725 demangle the symbol before us; we get to correctly tag
726 Ada symbols as such; and even if we incorrectly tagged
727 a non-Ada symbol, which should be rare, any routing
728 through the Ada language should be transparent (Ada
729 tries to behave much like C/C++ with non-Ada symbols). */
730 gsymbol
->language
= language_ada
;
738 /* Set both the mangled and demangled (if any) names for GSYMBOL based
739 on LINKAGE_NAME and LEN. Ordinarily, NAME is copied onto the
740 objfile's obstack; but if COPY_NAME is 0 and if NAME is
741 NUL-terminated, then this function assumes that NAME is already
742 correctly saved (either permanently or with a lifetime tied to the
743 objfile), and it will not be copied.
745 The hash table corresponding to OBJFILE is used, and the memory
746 comes from the per-BFD storage_obstack. LINKAGE_NAME is copied,
747 so the pointer can be discarded after calling this function. */
749 /* We have to be careful when dealing with Java names: when we run
750 into a Java minimal symbol, we don't know it's a Java symbol, so it
751 gets demangled as a C++ name. This is unfortunate, but there's not
752 much we can do about it: but when demangling partial symbols and
753 regular symbols, we'd better not reuse the wrong demangled name.
754 (See PR gdb/1039.) We solve this by putting a distinctive prefix
755 on Java names when storing them in the hash table. */
757 /* FIXME: carlton/2003-03-13: This is an unfortunate situation. I
758 don't mind the Java prefix so much: different languages have
759 different demangling requirements, so it's only natural that we
760 need to keep language data around in our demangling cache. But
761 it's not good that the minimal symbol has the wrong demangled name.
762 Unfortunately, I can't think of any easy solution to that
765 #define JAVA_PREFIX "##JAVA$$"
766 #define JAVA_PREFIX_LEN 8
769 symbol_set_names (struct general_symbol_info
*gsymbol
,
770 const char *linkage_name
, int len
, int copy_name
,
771 struct objfile
*objfile
)
773 struct demangled_name_entry
**slot
;
774 /* A 0-terminated copy of the linkage name. */
775 const char *linkage_name_copy
;
776 /* A copy of the linkage name that might have a special Java prefix
777 added to it, for use when looking names up in the hash table. */
778 const char *lookup_name
;
779 /* The length of lookup_name. */
781 struct demangled_name_entry entry
;
782 struct objfile_per_bfd_storage
*per_bfd
= objfile
->per_bfd
;
784 if (gsymbol
->language
== language_ada
)
786 /* In Ada, we do the symbol lookups using the mangled name, so
787 we can save some space by not storing the demangled name.
789 As a side note, we have also observed some overlap between
790 the C++ mangling and Ada mangling, similarly to what has
791 been observed with Java. Because we don't store the demangled
792 name with the symbol, we don't need to use the same trick
795 gsymbol
->name
= linkage_name
;
798 char *name
= obstack_alloc (&per_bfd
->storage_obstack
, len
+ 1);
800 memcpy (name
, linkage_name
, len
);
802 gsymbol
->name
= name
;
804 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
809 if (per_bfd
->demangled_names_hash
== NULL
)
810 create_demangled_names_hash (objfile
);
812 /* The stabs reader generally provides names that are not
813 NUL-terminated; most of the other readers don't do this, so we
814 can just use the given copy, unless we're in the Java case. */
815 if (gsymbol
->language
== language_java
)
819 lookup_len
= len
+ JAVA_PREFIX_LEN
;
820 alloc_name
= alloca (lookup_len
+ 1);
821 memcpy (alloc_name
, JAVA_PREFIX
, JAVA_PREFIX_LEN
);
822 memcpy (alloc_name
+ JAVA_PREFIX_LEN
, linkage_name
, len
);
823 alloc_name
[lookup_len
] = '\0';
825 lookup_name
= alloc_name
;
826 linkage_name_copy
= alloc_name
+ JAVA_PREFIX_LEN
;
828 else if (linkage_name
[len
] != '\0')
833 alloc_name
= alloca (lookup_len
+ 1);
834 memcpy (alloc_name
, linkage_name
, len
);
835 alloc_name
[lookup_len
] = '\0';
837 lookup_name
= alloc_name
;
838 linkage_name_copy
= alloc_name
;
843 lookup_name
= linkage_name
;
844 linkage_name_copy
= linkage_name
;
847 entry
.mangled
= lookup_name
;
848 slot
= ((struct demangled_name_entry
**)
849 htab_find_slot (per_bfd
->demangled_names_hash
,
852 /* If this name is not in the hash table, add it. */
854 /* A C version of the symbol may have already snuck into the table.
855 This happens to, e.g., main.init (__go_init_main). Cope. */
856 || (gsymbol
->language
== language_go
857 && (*slot
)->demangled
[0] == '\0'))
859 char *demangled_name
= symbol_find_demangled_name (gsymbol
,
861 int demangled_len
= demangled_name
? strlen (demangled_name
) : 0;
863 /* Suppose we have demangled_name==NULL, copy_name==0, and
864 lookup_name==linkage_name. In this case, we already have the
865 mangled name saved, and we don't have a demangled name. So,
866 you might think we could save a little space by not recording
867 this in the hash table at all.
869 It turns out that it is actually important to still save such
870 an entry in the hash table, because storing this name gives
871 us better bcache hit rates for partial symbols. */
872 if (!copy_name
&& lookup_name
== linkage_name
)
874 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
875 offsetof (struct demangled_name_entry
,
877 + demangled_len
+ 1);
878 (*slot
)->mangled
= lookup_name
;
884 /* If we must copy the mangled name, put it directly after
885 the demangled name so we can have a single
887 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
888 offsetof (struct demangled_name_entry
,
890 + lookup_len
+ demangled_len
+ 2);
891 mangled_ptr
= &((*slot
)->demangled
[demangled_len
+ 1]);
892 strcpy (mangled_ptr
, lookup_name
);
893 (*slot
)->mangled
= mangled_ptr
;
896 if (demangled_name
!= NULL
)
898 strcpy ((*slot
)->demangled
, demangled_name
);
899 xfree (demangled_name
);
902 (*slot
)->demangled
[0] = '\0';
905 gsymbol
->name
= (*slot
)->mangled
+ lookup_len
- len
;
906 if ((*slot
)->demangled
[0] != '\0')
907 symbol_set_demangled_name (gsymbol
, (*slot
)->demangled
,
908 &per_bfd
->storage_obstack
);
910 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
913 /* Return the source code name of a symbol. In languages where
914 demangling is necessary, this is the demangled name. */
917 symbol_natural_name (const struct general_symbol_info
*gsymbol
)
919 switch (gsymbol
->language
)
926 case language_fortran
:
927 if (symbol_get_demangled_name (gsymbol
) != NULL
)
928 return symbol_get_demangled_name (gsymbol
);
931 return ada_decode_symbol (gsymbol
);
935 return gsymbol
->name
;
938 /* Return the demangled name for a symbol based on the language for
939 that symbol. If no demangled name exists, return NULL. */
942 symbol_demangled_name (const struct general_symbol_info
*gsymbol
)
944 const char *dem_name
= NULL
;
946 switch (gsymbol
->language
)
953 case language_fortran
:
954 dem_name
= symbol_get_demangled_name (gsymbol
);
957 dem_name
= ada_decode_symbol (gsymbol
);
965 /* Return the search name of a symbol---generally the demangled or
966 linkage name of the symbol, depending on how it will be searched for.
967 If there is no distinct demangled name, then returns the same value
968 (same pointer) as SYMBOL_LINKAGE_NAME. */
971 symbol_search_name (const struct general_symbol_info
*gsymbol
)
973 if (gsymbol
->language
== language_ada
)
974 return gsymbol
->name
;
976 return symbol_natural_name (gsymbol
);
979 /* Initialize the structure fields to zero values. */
982 init_sal (struct symtab_and_line
*sal
)
984 memset (sal
, 0, sizeof (*sal
));
988 /* Return 1 if the two sections are the same, or if they could
989 plausibly be copies of each other, one in an original object
990 file and another in a separated debug file. */
993 matching_obj_sections (struct obj_section
*obj_first
,
994 struct obj_section
*obj_second
)
996 asection
*first
= obj_first
? obj_first
->the_bfd_section
: NULL
;
997 asection
*second
= obj_second
? obj_second
->the_bfd_section
: NULL
;
1000 /* If they're the same section, then they match. */
1001 if (first
== second
)
1004 /* If either is NULL, give up. */
1005 if (first
== NULL
|| second
== NULL
)
1008 /* This doesn't apply to absolute symbols. */
1009 if (first
->owner
== NULL
|| second
->owner
== NULL
)
1012 /* If they're in the same object file, they must be different sections. */
1013 if (first
->owner
== second
->owner
)
1016 /* Check whether the two sections are potentially corresponding. They must
1017 have the same size, address, and name. We can't compare section indexes,
1018 which would be more reliable, because some sections may have been
1020 if (bfd_get_section_size (first
) != bfd_get_section_size (second
))
1023 /* In-memory addresses may start at a different offset, relativize them. */
1024 if (bfd_get_section_vma (first
->owner
, first
)
1025 - bfd_get_start_address (first
->owner
)
1026 != bfd_get_section_vma (second
->owner
, second
)
1027 - bfd_get_start_address (second
->owner
))
1030 if (bfd_get_section_name (first
->owner
, first
) == NULL
1031 || bfd_get_section_name (second
->owner
, second
) == NULL
1032 || strcmp (bfd_get_section_name (first
->owner
, first
),
1033 bfd_get_section_name (second
->owner
, second
)) != 0)
1036 /* Otherwise check that they are in corresponding objfiles. */
1039 if (obj
->obfd
== first
->owner
)
1041 gdb_assert (obj
!= NULL
);
1043 if (obj
->separate_debug_objfile
!= NULL
1044 && obj
->separate_debug_objfile
->obfd
== second
->owner
)
1046 if (obj
->separate_debug_objfile_backlink
!= NULL
1047 && obj
->separate_debug_objfile_backlink
->obfd
== second
->owner
)
1054 find_pc_sect_symtab_via_partial (CORE_ADDR pc
, struct obj_section
*section
)
1056 struct objfile
*objfile
;
1057 struct bound_minimal_symbol msymbol
;
1059 /* If we know that this is not a text address, return failure. This is
1060 necessary because we loop based on texthigh and textlow, which do
1061 not include the data ranges. */
1062 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
);
1064 && (MSYMBOL_TYPE (msymbol
.minsym
) == mst_data
1065 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_bss
1066 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_abs
1067 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_data
1068 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_bss
))
1071 ALL_OBJFILES (objfile
)
1073 struct symtab
*result
= NULL
;
1076 result
= objfile
->sf
->qf
->find_pc_sect_symtab (objfile
, msymbol
,
1085 /* Debug symbols usually don't have section information. We need to dig that
1086 out of the minimal symbols and stash that in the debug symbol. */
1089 fixup_section (struct general_symbol_info
*ginfo
,
1090 CORE_ADDR addr
, struct objfile
*objfile
)
1092 struct minimal_symbol
*msym
;
1094 /* First, check whether a minimal symbol with the same name exists
1095 and points to the same address. The address check is required
1096 e.g. on PowerPC64, where the minimal symbol for a function will
1097 point to the function descriptor, while the debug symbol will
1098 point to the actual function code. */
1099 msym
= lookup_minimal_symbol_by_pc_name (addr
, ginfo
->name
, objfile
);
1101 ginfo
->section
= MSYMBOL_SECTION (msym
);
1104 /* Static, function-local variables do appear in the linker
1105 (minimal) symbols, but are frequently given names that won't
1106 be found via lookup_minimal_symbol(). E.g., it has been
1107 observed in frv-uclinux (ELF) executables that a static,
1108 function-local variable named "foo" might appear in the
1109 linker symbols as "foo.6" or "foo.3". Thus, there is no
1110 point in attempting to extend the lookup-by-name mechanism to
1111 handle this case due to the fact that there can be multiple
1114 So, instead, search the section table when lookup by name has
1115 failed. The ``addr'' and ``endaddr'' fields may have already
1116 been relocated. If so, the relocation offset (i.e. the
1117 ANOFFSET value) needs to be subtracted from these values when
1118 performing the comparison. We unconditionally subtract it,
1119 because, when no relocation has been performed, the ANOFFSET
1120 value will simply be zero.
1122 The address of the symbol whose section we're fixing up HAS
1123 NOT BEEN adjusted (relocated) yet. It can't have been since
1124 the section isn't yet known and knowing the section is
1125 necessary in order to add the correct relocation value. In
1126 other words, we wouldn't even be in this function (attempting
1127 to compute the section) if it were already known.
1129 Note that it is possible to search the minimal symbols
1130 (subtracting the relocation value if necessary) to find the
1131 matching minimal symbol, but this is overkill and much less
1132 efficient. It is not necessary to find the matching minimal
1133 symbol, only its section.
1135 Note that this technique (of doing a section table search)
1136 can fail when unrelocated section addresses overlap. For
1137 this reason, we still attempt a lookup by name prior to doing
1138 a search of the section table. */
1140 struct obj_section
*s
;
1143 ALL_OBJFILE_OSECTIONS (objfile
, s
)
1145 int idx
= s
- objfile
->sections
;
1146 CORE_ADDR offset
= ANOFFSET (objfile
->section_offsets
, idx
);
1151 if (obj_section_addr (s
) - offset
<= addr
1152 && addr
< obj_section_endaddr (s
) - offset
)
1154 ginfo
->section
= idx
;
1159 /* If we didn't find the section, assume it is in the first
1160 section. If there is no allocated section, then it hardly
1161 matters what we pick, so just pick zero. */
1165 ginfo
->section
= fallback
;
1170 fixup_symbol_section (struct symbol
*sym
, struct objfile
*objfile
)
1177 /* We either have an OBJFILE, or we can get at it from the sym's
1178 symtab. Anything else is a bug. */
1179 gdb_assert (objfile
|| SYMBOL_SYMTAB (sym
));
1181 if (objfile
== NULL
)
1182 objfile
= SYMBOL_SYMTAB (sym
)->objfile
;
1184 if (SYMBOL_OBJ_SECTION (objfile
, sym
))
1187 /* We should have an objfile by now. */
1188 gdb_assert (objfile
);
1190 switch (SYMBOL_CLASS (sym
))
1194 addr
= SYMBOL_VALUE_ADDRESS (sym
);
1197 addr
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
1201 /* Nothing else will be listed in the minsyms -- no use looking
1206 fixup_section (&sym
->ginfo
, addr
, objfile
);
1211 /* Compute the demangled form of NAME as used by the various symbol
1212 lookup functions. The result is stored in *RESULT_NAME. Returns a
1213 cleanup which can be used to clean up the result.
1215 For Ada, this function just sets *RESULT_NAME to NAME, unmodified.
1216 Normally, Ada symbol lookups are performed using the encoded name
1217 rather than the demangled name, and so it might seem to make sense
1218 for this function to return an encoded version of NAME.
1219 Unfortunately, we cannot do this, because this function is used in
1220 circumstances where it is not appropriate to try to encode NAME.
1221 For instance, when displaying the frame info, we demangle the name
1222 of each parameter, and then perform a symbol lookup inside our
1223 function using that demangled name. In Ada, certain functions
1224 have internally-generated parameters whose name contain uppercase
1225 characters. Encoding those name would result in those uppercase
1226 characters to become lowercase, and thus cause the symbol lookup
1230 demangle_for_lookup (const char *name
, enum language lang
,
1231 const char **result_name
)
1233 char *demangled_name
= NULL
;
1234 const char *modified_name
= NULL
;
1235 struct cleanup
*cleanup
= make_cleanup (null_cleanup
, 0);
1237 modified_name
= name
;
1239 /* If we are using C++, D, Go, or Java, demangle the name before doing a
1240 lookup, so we can always binary search. */
1241 if (lang
== language_cplus
)
1243 demangled_name
= gdb_demangle (name
, DMGL_ANSI
| DMGL_PARAMS
);
1246 modified_name
= demangled_name
;
1247 make_cleanup (xfree
, demangled_name
);
1251 /* If we were given a non-mangled name, canonicalize it
1252 according to the language (so far only for C++). */
1253 demangled_name
= cp_canonicalize_string (name
);
1256 modified_name
= demangled_name
;
1257 make_cleanup (xfree
, demangled_name
);
1261 else if (lang
== language_java
)
1263 demangled_name
= gdb_demangle (name
,
1264 DMGL_ANSI
| DMGL_PARAMS
| DMGL_JAVA
);
1267 modified_name
= demangled_name
;
1268 make_cleanup (xfree
, demangled_name
);
1271 else if (lang
== language_d
)
1273 demangled_name
= d_demangle (name
, 0);
1276 modified_name
= demangled_name
;
1277 make_cleanup (xfree
, demangled_name
);
1280 else if (lang
== language_go
)
1282 demangled_name
= go_demangle (name
, 0);
1285 modified_name
= demangled_name
;
1286 make_cleanup (xfree
, demangled_name
);
1290 *result_name
= modified_name
;
1296 This function (or rather its subordinates) have a bunch of loops and
1297 it would seem to be attractive to put in some QUIT's (though I'm not really
1298 sure whether it can run long enough to be really important). But there
1299 are a few calls for which it would appear to be bad news to quit
1300 out of here: e.g., find_proc_desc in alpha-mdebug-tdep.c. (Note
1301 that there is C++ code below which can error(), but that probably
1302 doesn't affect these calls since they are looking for a known
1303 variable and thus can probably assume it will never hit the C++
1307 lookup_symbol_in_language (const char *name
, const struct block
*block
,
1308 const domain_enum domain
, enum language lang
,
1309 struct field_of_this_result
*is_a_field_of_this
)
1311 const char *modified_name
;
1312 struct symbol
*returnval
;
1313 struct cleanup
*cleanup
= demangle_for_lookup (name
, lang
, &modified_name
);
1315 returnval
= lookup_symbol_aux (modified_name
, block
, domain
, lang
,
1316 is_a_field_of_this
);
1317 do_cleanups (cleanup
);
1325 lookup_symbol (const char *name
, const struct block
*block
,
1327 struct field_of_this_result
*is_a_field_of_this
)
1329 return lookup_symbol_in_language (name
, block
, domain
,
1330 current_language
->la_language
,
1331 is_a_field_of_this
);
1337 lookup_language_this (const struct language_defn
*lang
,
1338 const struct block
*block
)
1340 if (lang
->la_name_of_this
== NULL
|| block
== NULL
)
1347 sym
= lookup_block_symbol (block
, lang
->la_name_of_this
, VAR_DOMAIN
);
1350 block_found
= block
;
1353 if (BLOCK_FUNCTION (block
))
1355 block
= BLOCK_SUPERBLOCK (block
);
1361 /* Given TYPE, a structure/union,
1362 return 1 if the component named NAME from the ultimate target
1363 structure/union is defined, otherwise, return 0. */
1366 check_field (struct type
*type
, const char *name
,
1367 struct field_of_this_result
*is_a_field_of_this
)
1371 /* The type may be a stub. */
1372 CHECK_TYPEDEF (type
);
1374 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
1376 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1378 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1380 is_a_field_of_this
->type
= type
;
1381 is_a_field_of_this
->field
= &TYPE_FIELD (type
, i
);
1386 /* C++: If it was not found as a data field, then try to return it
1387 as a pointer to a method. */
1389 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
1391 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
1393 is_a_field_of_this
->type
= type
;
1394 is_a_field_of_this
->fn_field
= &TYPE_FN_FIELDLIST (type
, i
);
1399 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1400 if (check_field (TYPE_BASECLASS (type
, i
), name
, is_a_field_of_this
))
1406 /* Behave like lookup_symbol except that NAME is the natural name
1407 (e.g., demangled name) of the symbol that we're looking for. */
1409 static struct symbol
*
1410 lookup_symbol_aux (const char *name
, const struct block
*block
,
1411 const domain_enum domain
, enum language language
,
1412 struct field_of_this_result
*is_a_field_of_this
)
1415 const struct language_defn
*langdef
;
1417 /* Make sure we do something sensible with is_a_field_of_this, since
1418 the callers that set this parameter to some non-null value will
1419 certainly use it later. If we don't set it, the contents of
1420 is_a_field_of_this are undefined. */
1421 if (is_a_field_of_this
!= NULL
)
1422 memset (is_a_field_of_this
, 0, sizeof (*is_a_field_of_this
));
1424 /* Search specified block and its superiors. Don't search
1425 STATIC_BLOCK or GLOBAL_BLOCK. */
1427 sym
= lookup_symbol_aux_local (name
, block
, domain
, language
);
1431 /* If requested to do so by the caller and if appropriate for LANGUAGE,
1432 check to see if NAME is a field of `this'. */
1434 langdef
= language_def (language
);
1436 /* Don't do this check if we are searching for a struct. It will
1437 not be found by check_field, but will be found by other
1439 if (is_a_field_of_this
!= NULL
&& domain
!= STRUCT_DOMAIN
)
1441 struct symbol
*sym
= lookup_language_this (langdef
, block
);
1445 struct type
*t
= sym
->type
;
1447 /* I'm not really sure that type of this can ever
1448 be typedefed; just be safe. */
1450 if (TYPE_CODE (t
) == TYPE_CODE_PTR
1451 || TYPE_CODE (t
) == TYPE_CODE_REF
)
1452 t
= TYPE_TARGET_TYPE (t
);
1454 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1455 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1456 error (_("Internal error: `%s' is not an aggregate"),
1457 langdef
->la_name_of_this
);
1459 if (check_field (t
, name
, is_a_field_of_this
))
1464 /* Now do whatever is appropriate for LANGUAGE to look
1465 up static and global variables. */
1467 sym
= langdef
->la_lookup_symbol_nonlocal (name
, block
, domain
);
1471 /* Now search all static file-level symbols. Not strictly correct,
1472 but more useful than an error. */
1474 return lookup_static_symbol_aux (name
, domain
);
1480 lookup_static_symbol_aux (const char *name
, const domain_enum domain
)
1482 struct objfile
*objfile
;
1485 sym
= lookup_symbol_aux_symtabs (STATIC_BLOCK
, name
, domain
);
1489 ALL_OBJFILES (objfile
)
1491 sym
= lookup_symbol_aux_quick (objfile
, STATIC_BLOCK
, name
, domain
);
1499 /* Check to see if the symbol is defined in BLOCK or its superiors.
1500 Don't search STATIC_BLOCK or GLOBAL_BLOCK. */
1502 static struct symbol
*
1503 lookup_symbol_aux_local (const char *name
, const struct block
*block
,
1504 const domain_enum domain
,
1505 enum language language
)
1508 const struct block
*static_block
= block_static_block (block
);
1509 const char *scope
= block_scope (block
);
1511 /* Check if either no block is specified or it's a global block. */
1513 if (static_block
== NULL
)
1516 while (block
!= static_block
)
1518 sym
= lookup_symbol_aux_block (name
, block
, domain
);
1522 if (language
== language_cplus
|| language
== language_fortran
)
1524 sym
= cp_lookup_symbol_imports_or_template (scope
, name
, block
,
1530 if (BLOCK_FUNCTION (block
) != NULL
&& block_inlined_p (block
))
1532 block
= BLOCK_SUPERBLOCK (block
);
1535 /* We've reached the end of the function without finding a result. */
1543 lookup_objfile_from_block (const struct block
*block
)
1545 struct objfile
*obj
;
1551 block
= block_global_block (block
);
1552 /* Go through SYMTABS. */
1553 ALL_SYMTABS (obj
, s
)
1554 if (block
== BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
))
1556 if (obj
->separate_debug_objfile_backlink
)
1557 obj
= obj
->separate_debug_objfile_backlink
;
1568 lookup_symbol_aux_block (const char *name
, const struct block
*block
,
1569 const domain_enum domain
)
1573 sym
= lookup_block_symbol (block
, name
, domain
);
1576 block_found
= block
;
1577 return fixup_symbol_section (sym
, NULL
);
1586 lookup_global_symbol_from_objfile (const struct objfile
*main_objfile
,
1588 const domain_enum domain
)
1590 const struct objfile
*objfile
;
1592 const struct blockvector
*bv
;
1593 const struct block
*block
;
1596 for (objfile
= main_objfile
;
1598 objfile
= objfile_separate_debug_iterate (main_objfile
, objfile
))
1600 /* Go through symtabs. */
1601 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1603 bv
= BLOCKVECTOR (s
);
1604 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1605 sym
= lookup_block_symbol (block
, name
, domain
);
1608 block_found
= block
;
1609 return fixup_symbol_section (sym
, (struct objfile
*)objfile
);
1613 sym
= lookup_symbol_aux_quick ((struct objfile
*) objfile
, GLOBAL_BLOCK
,
1622 /* Check to see if the symbol is defined in one of the OBJFILE's
1623 symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK,
1624 depending on whether or not we want to search global symbols or
1627 static struct symbol
*
1628 lookup_symbol_aux_objfile (struct objfile
*objfile
, int block_index
,
1629 const char *name
, const domain_enum domain
)
1631 struct symbol
*sym
= NULL
;
1632 const struct blockvector
*bv
;
1633 const struct block
*block
;
1636 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1638 bv
= BLOCKVECTOR (s
);
1639 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1640 sym
= lookup_block_symbol (block
, name
, domain
);
1643 block_found
= block
;
1644 return fixup_symbol_section (sym
, objfile
);
1651 /* Same as lookup_symbol_aux_objfile, except that it searches all
1652 objfiles. Return the first match found. */
1654 static struct symbol
*
1655 lookup_symbol_aux_symtabs (int block_index
, const char *name
,
1656 const domain_enum domain
)
1659 struct objfile
*objfile
;
1661 ALL_OBJFILES (objfile
)
1663 sym
= lookup_symbol_aux_objfile (objfile
, block_index
, name
, domain
);
1671 /* Wrapper around lookup_symbol_aux_objfile for search_symbols.
1672 Look up LINKAGE_NAME in DOMAIN in the global and static blocks of OBJFILE
1673 and all related objfiles. */
1675 static struct symbol
*
1676 lookup_symbol_in_objfile_from_linkage_name (struct objfile
*objfile
,
1677 const char *linkage_name
,
1680 enum language lang
= current_language
->la_language
;
1681 const char *modified_name
;
1682 struct cleanup
*cleanup
= demangle_for_lookup (linkage_name
, lang
,
1684 struct objfile
*main_objfile
, *cur_objfile
;
1686 if (objfile
->separate_debug_objfile_backlink
)
1687 main_objfile
= objfile
->separate_debug_objfile_backlink
;
1689 main_objfile
= objfile
;
1691 for (cur_objfile
= main_objfile
;
1693 cur_objfile
= objfile_separate_debug_iterate (main_objfile
, cur_objfile
))
1697 sym
= lookup_symbol_aux_objfile (cur_objfile
, GLOBAL_BLOCK
,
1698 modified_name
, domain
);
1700 sym
= lookup_symbol_aux_objfile (cur_objfile
, STATIC_BLOCK
,
1701 modified_name
, domain
);
1704 do_cleanups (cleanup
);
1709 do_cleanups (cleanup
);
1713 /* A helper function that throws an exception when a symbol was found
1714 in a psymtab but not in a symtab. */
1716 static void ATTRIBUTE_NORETURN
1717 error_in_psymtab_expansion (int block_index
, const char *name
,
1718 struct symtab
*symtab
)
1721 Internal: %s symbol `%s' found in %s psymtab but not in symtab.\n\
1722 %s may be an inlined function, or may be a template function\n \
1723 (if a template, try specifying an instantiation: %s<type>)."),
1724 block_index
== GLOBAL_BLOCK
? "global" : "static",
1725 name
, symtab_to_filename_for_display (symtab
), name
, name
);
1728 /* A helper function for lookup_symbol_aux that interfaces with the
1729 "quick" symbol table functions. */
1731 static struct symbol
*
1732 lookup_symbol_aux_quick (struct objfile
*objfile
, int block_index
,
1733 const char *name
, const domain_enum domain
)
1735 struct symtab
*symtab
;
1736 const struct blockvector
*bv
;
1737 const struct block
*block
;
1742 symtab
= objfile
->sf
->qf
->lookup_symbol (objfile
, block_index
, name
, domain
);
1746 bv
= BLOCKVECTOR (symtab
);
1747 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1748 sym
= lookup_block_symbol (block
, name
, domain
);
1750 error_in_psymtab_expansion (block_index
, name
, symtab
);
1751 block_found
= block
;
1752 return fixup_symbol_section (sym
, objfile
);
1758 basic_lookup_symbol_nonlocal (const char *name
,
1759 const struct block
*block
,
1760 const domain_enum domain
)
1764 /* NOTE: carlton/2003-05-19: The comments below were written when
1765 this (or what turned into this) was part of lookup_symbol_aux;
1766 I'm much less worried about these questions now, since these
1767 decisions have turned out well, but I leave these comments here
1770 /* NOTE: carlton/2002-12-05: There is a question as to whether or
1771 not it would be appropriate to search the current global block
1772 here as well. (That's what this code used to do before the
1773 is_a_field_of_this check was moved up.) On the one hand, it's
1774 redundant with the lookup_symbol_aux_symtabs search that happens
1775 next. On the other hand, if decode_line_1 is passed an argument
1776 like filename:var, then the user presumably wants 'var' to be
1777 searched for in filename. On the third hand, there shouldn't be
1778 multiple global variables all of which are named 'var', and it's
1779 not like decode_line_1 has ever restricted its search to only
1780 global variables in a single filename. All in all, only
1781 searching the static block here seems best: it's correct and it's
1784 /* NOTE: carlton/2002-12-05: There's also a possible performance
1785 issue here: if you usually search for global symbols in the
1786 current file, then it would be slightly better to search the
1787 current global block before searching all the symtabs. But there
1788 are other factors that have a much greater effect on performance
1789 than that one, so I don't think we should worry about that for
1792 sym
= lookup_symbol_static (name
, block
, domain
);
1796 return lookup_symbol_global (name
, block
, domain
);
1802 lookup_symbol_static (const char *name
,
1803 const struct block
*block
,
1804 const domain_enum domain
)
1806 const struct block
*static_block
= block_static_block (block
);
1808 if (static_block
!= NULL
)
1809 return lookup_symbol_aux_block (name
, static_block
, domain
);
1814 /* Private data to be used with lookup_symbol_global_iterator_cb. */
1816 struct global_sym_lookup_data
1818 /* The name of the symbol we are searching for. */
1821 /* The domain to use for our search. */
1824 /* The field where the callback should store the symbol if found.
1825 It should be initialized to NULL before the search is started. */
1826 struct symbol
*result
;
1829 /* A callback function for gdbarch_iterate_over_objfiles_in_search_order.
1830 It searches by name for a symbol in the GLOBAL_BLOCK of the given
1831 OBJFILE. The arguments for the search are passed via CB_DATA,
1832 which in reality is a pointer to struct global_sym_lookup_data. */
1835 lookup_symbol_global_iterator_cb (struct objfile
*objfile
,
1838 struct global_sym_lookup_data
*data
=
1839 (struct global_sym_lookup_data
*) cb_data
;
1841 gdb_assert (data
->result
== NULL
);
1843 data
->result
= lookup_symbol_aux_objfile (objfile
, GLOBAL_BLOCK
,
1844 data
->name
, data
->domain
);
1845 if (data
->result
== NULL
)
1846 data
->result
= lookup_symbol_aux_quick (objfile
, GLOBAL_BLOCK
,
1847 data
->name
, data
->domain
);
1849 /* If we found a match, tell the iterator to stop. Otherwise,
1851 return (data
->result
!= NULL
);
1857 lookup_symbol_global (const char *name
,
1858 const struct block
*block
,
1859 const domain_enum domain
)
1861 struct symbol
*sym
= NULL
;
1862 struct objfile
*objfile
= NULL
;
1863 struct global_sym_lookup_data lookup_data
;
1865 /* Call library-specific lookup procedure. */
1866 objfile
= lookup_objfile_from_block (block
);
1867 if (objfile
!= NULL
)
1868 sym
= solib_global_lookup (objfile
, name
, domain
);
1872 memset (&lookup_data
, 0, sizeof (lookup_data
));
1873 lookup_data
.name
= name
;
1874 lookup_data
.domain
= domain
;
1875 gdbarch_iterate_over_objfiles_in_search_order
1876 (objfile
!= NULL
? get_objfile_arch (objfile
) : target_gdbarch (),
1877 lookup_symbol_global_iterator_cb
, &lookup_data
, objfile
);
1879 return lookup_data
.result
;
1883 symbol_matches_domain (enum language symbol_language
,
1884 domain_enum symbol_domain
,
1887 /* For C++ "struct foo { ... }" also defines a typedef for "foo".
1888 A Java class declaration also defines a typedef for the class.
1889 Similarly, any Ada type declaration implicitly defines a typedef. */
1890 if (symbol_language
== language_cplus
1891 || symbol_language
== language_d
1892 || symbol_language
== language_java
1893 || symbol_language
== language_ada
)
1895 if ((domain
== VAR_DOMAIN
|| domain
== STRUCT_DOMAIN
)
1896 && symbol_domain
== STRUCT_DOMAIN
)
1899 /* For all other languages, strict match is required. */
1900 return (symbol_domain
== domain
);
1906 lookup_transparent_type (const char *name
)
1908 return current_language
->la_lookup_transparent_type (name
);
1911 /* A helper for basic_lookup_transparent_type that interfaces with the
1912 "quick" symbol table functions. */
1914 static struct type
*
1915 basic_lookup_transparent_type_quick (struct objfile
*objfile
, int block_index
,
1918 struct symtab
*symtab
;
1919 const struct blockvector
*bv
;
1920 struct block
*block
;
1925 symtab
= objfile
->sf
->qf
->lookup_symbol (objfile
, block_index
, name
,
1930 bv
= BLOCKVECTOR (symtab
);
1931 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1932 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
1934 error_in_psymtab_expansion (block_index
, name
, symtab
);
1936 if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1937 return SYMBOL_TYPE (sym
);
1942 /* The standard implementation of lookup_transparent_type. This code
1943 was modeled on lookup_symbol -- the parts not relevant to looking
1944 up types were just left out. In particular it's assumed here that
1945 types are available in STRUCT_DOMAIN and only in file-static or
1949 basic_lookup_transparent_type (const char *name
)
1952 struct symtab
*s
= NULL
;
1953 const struct blockvector
*bv
;
1954 struct objfile
*objfile
;
1955 struct block
*block
;
1958 /* Now search all the global symbols. Do the symtab's first, then
1959 check the psymtab's. If a psymtab indicates the existence
1960 of the desired name as a global, then do psymtab-to-symtab
1961 conversion on the fly and return the found symbol. */
1963 ALL_OBJFILES (objfile
)
1965 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1967 bv
= BLOCKVECTOR (s
);
1968 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1969 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
1970 if (sym
&& !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1972 return SYMBOL_TYPE (sym
);
1977 ALL_OBJFILES (objfile
)
1979 t
= basic_lookup_transparent_type_quick (objfile
, GLOBAL_BLOCK
, name
);
1984 /* Now search the static file-level symbols.
1985 Not strictly correct, but more useful than an error.
1986 Do the symtab's first, then
1987 check the psymtab's. If a psymtab indicates the existence
1988 of the desired name as a file-level static, 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
, STATIC_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
, STATIC_BLOCK
, name
);
2012 return (struct type
*) 0;
2017 Note that if NAME is the demangled form of a C++ symbol, we will fail
2018 to find a match during the binary search of the non-encoded names, but
2019 for now we don't worry about the slight inefficiency of looking for
2020 a match we'll never find, since it will go pretty quick. Once the
2021 binary search terminates, we drop through and do a straight linear
2022 search on the symbols. Each symbol which is marked as being a ObjC/C++
2023 symbol (language_cplus or language_objc set) has both the encoded and
2024 non-encoded names tested for a match. */
2027 lookup_block_symbol (const struct block
*block
, const char *name
,
2028 const domain_enum domain
)
2030 struct block_iterator iter
;
2033 if (!BLOCK_FUNCTION (block
))
2035 for (sym
= block_iter_name_first (block
, name
, &iter
);
2037 sym
= block_iter_name_next (name
, &iter
))
2039 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2040 SYMBOL_DOMAIN (sym
), domain
))
2047 /* Note that parameter symbols do not always show up last in the
2048 list; this loop makes sure to take anything else other than
2049 parameter symbols first; it only uses parameter symbols as a
2050 last resort. Note that this only takes up extra computation
2053 struct symbol
*sym_found
= NULL
;
2055 for (sym
= block_iter_name_first (block
, name
, &iter
);
2057 sym
= block_iter_name_next (name
, &iter
))
2059 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2060 SYMBOL_DOMAIN (sym
), domain
))
2063 if (!SYMBOL_IS_ARGUMENT (sym
))
2069 return (sym_found
); /* Will be NULL if not found. */
2073 /* Iterate over the symbols named NAME, matching DOMAIN, in BLOCK.
2075 For each symbol that matches, CALLBACK is called. The symbol and
2076 DATA are passed to the callback.
2078 If CALLBACK returns zero, the iteration ends. Otherwise, the
2079 search continues. */
2082 iterate_over_symbols (const struct block
*block
, const char *name
,
2083 const domain_enum domain
,
2084 symbol_found_callback_ftype
*callback
,
2087 struct block_iterator iter
;
2090 for (sym
= block_iter_name_first (block
, name
, &iter
);
2092 sym
= block_iter_name_next (name
, &iter
))
2094 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2095 SYMBOL_DOMAIN (sym
), domain
))
2097 if (!callback (sym
, data
))
2103 /* Find the symtab associated with PC and SECTION. Look through the
2104 psymtabs and read in another symtab if necessary. */
2107 find_pc_sect_symtab (CORE_ADDR pc
, struct obj_section
*section
)
2110 const struct blockvector
*bv
;
2111 struct symtab
*s
= NULL
;
2112 struct symtab
*best_s
= NULL
;
2113 struct objfile
*objfile
;
2114 CORE_ADDR distance
= 0;
2115 struct bound_minimal_symbol msymbol
;
2117 /* If we know that this is not a text address, return failure. This is
2118 necessary because we loop based on the block's high and low code
2119 addresses, which do not include the data ranges, and because
2120 we call find_pc_sect_psymtab which has a similar restriction based
2121 on the partial_symtab's texthigh and textlow. */
2122 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
);
2124 && (MSYMBOL_TYPE (msymbol
.minsym
) == mst_data
2125 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_bss
2126 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_abs
2127 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_data
2128 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_bss
))
2131 /* Search all symtabs for the one whose file contains our address, and which
2132 is the smallest of all the ones containing the address. This is designed
2133 to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000
2134 and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from
2135 0x1000-0x4000, but for address 0x2345 we want to return symtab b.
2137 This happens for native ecoff format, where code from included files
2138 gets its own symtab. The symtab for the included file should have
2139 been read in already via the dependency mechanism.
2140 It might be swifter to create several symtabs with the same name
2141 like xcoff does (I'm not sure).
2143 It also happens for objfiles that have their functions reordered.
2144 For these, the symtab we are looking for is not necessarily read in. */
2146 ALL_PRIMARY_SYMTABS (objfile
, s
)
2148 bv
= BLOCKVECTOR (s
);
2149 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
2151 if (BLOCK_START (b
) <= pc
2152 && BLOCK_END (b
) > pc
2154 || BLOCK_END (b
) - BLOCK_START (b
) < distance
))
2156 /* For an objfile that has its functions reordered,
2157 find_pc_psymtab will find the proper partial symbol table
2158 and we simply return its corresponding symtab. */
2159 /* In order to better support objfiles that contain both
2160 stabs and coff debugging info, we continue on if a psymtab
2162 if ((objfile
->flags
& OBJF_REORDERED
) && objfile
->sf
)
2164 struct symtab
*result
;
2167 = objfile
->sf
->qf
->find_pc_sect_symtab (objfile
,
2176 struct block_iterator iter
;
2177 struct symbol
*sym
= NULL
;
2179 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
2181 fixup_symbol_section (sym
, objfile
);
2182 if (matching_obj_sections (SYMBOL_OBJ_SECTION (objfile
, sym
),
2187 continue; /* No symbol in this symtab matches
2190 distance
= BLOCK_END (b
) - BLOCK_START (b
);
2198 /* Not found in symtabs, search the "quick" symtabs (e.g. psymtabs). */
2200 ALL_OBJFILES (objfile
)
2202 struct symtab
*result
;
2206 result
= objfile
->sf
->qf
->find_pc_sect_symtab (objfile
,
2217 /* Find the symtab associated with PC. Look through the psymtabs and read
2218 in another symtab if necessary. Backward compatibility, no section. */
2221 find_pc_symtab (CORE_ADDR pc
)
2223 return find_pc_sect_symtab (pc
, find_pc_mapped_section (pc
));
2227 /* Find the source file and line number for a given PC value and SECTION.
2228 Return a structure containing a symtab pointer, a line number,
2229 and a pc range for the entire source line.
2230 The value's .pc field is NOT the specified pc.
2231 NOTCURRENT nonzero means, if specified pc is on a line boundary,
2232 use the line that ends there. Otherwise, in that case, the line
2233 that begins there is used. */
2235 /* The big complication here is that a line may start in one file, and end just
2236 before the start of another file. This usually occurs when you #include
2237 code in the middle of a subroutine. To properly find the end of a line's PC
2238 range, we must search all symtabs associated with this compilation unit, and
2239 find the one whose first PC is closer than that of the next line in this
2242 /* If it's worth the effort, we could be using a binary search. */
2244 struct symtab_and_line
2245 find_pc_sect_line (CORE_ADDR pc
, struct obj_section
*section
, int notcurrent
)
2248 struct linetable
*l
;
2251 struct linetable_entry
*item
;
2252 struct symtab_and_line val
;
2253 const struct blockvector
*bv
;
2254 struct bound_minimal_symbol msymbol
;
2255 struct objfile
*objfile
;
2257 /* Info on best line seen so far, and where it starts, and its file. */
2259 struct linetable_entry
*best
= NULL
;
2260 CORE_ADDR best_end
= 0;
2261 struct symtab
*best_symtab
= 0;
2263 /* Store here the first line number
2264 of a file which contains the line at the smallest pc after PC.
2265 If we don't find a line whose range contains PC,
2266 we will use a line one less than this,
2267 with a range from the start of that file to the first line's pc. */
2268 struct linetable_entry
*alt
= NULL
;
2270 /* Info on best line seen in this file. */
2272 struct linetable_entry
*prev
;
2274 /* If this pc is not from the current frame,
2275 it is the address of the end of a call instruction.
2276 Quite likely that is the start of the following statement.
2277 But what we want is the statement containing the instruction.
2278 Fudge the pc to make sure we get that. */
2280 init_sal (&val
); /* initialize to zeroes */
2282 val
.pspace
= current_program_space
;
2284 /* It's tempting to assume that, if we can't find debugging info for
2285 any function enclosing PC, that we shouldn't search for line
2286 number info, either. However, GAS can emit line number info for
2287 assembly files --- very helpful when debugging hand-written
2288 assembly code. In such a case, we'd have no debug info for the
2289 function, but we would have line info. */
2294 /* elz: added this because this function returned the wrong
2295 information if the pc belongs to a stub (import/export)
2296 to call a shlib function. This stub would be anywhere between
2297 two functions in the target, and the line info was erroneously
2298 taken to be the one of the line before the pc. */
2300 /* RT: Further explanation:
2302 * We have stubs (trampolines) inserted between procedures.
2304 * Example: "shr1" exists in a shared library, and a "shr1" stub also
2305 * exists in the main image.
2307 * In the minimal symbol table, we have a bunch of symbols
2308 * sorted by start address. The stubs are marked as "trampoline",
2309 * the others appear as text. E.g.:
2311 * Minimal symbol table for main image
2312 * main: code for main (text symbol)
2313 * shr1: stub (trampoline symbol)
2314 * foo: code for foo (text symbol)
2316 * Minimal symbol table for "shr1" image:
2318 * shr1: code for shr1 (text symbol)
2321 * So the code below is trying to detect if we are in the stub
2322 * ("shr1" stub), and if so, find the real code ("shr1" trampoline),
2323 * and if found, do the symbolization from the real-code address
2324 * rather than the stub address.
2326 * Assumptions being made about the minimal symbol table:
2327 * 1. lookup_minimal_symbol_by_pc() will return a trampoline only
2328 * if we're really in the trampoline.s If we're beyond it (say
2329 * we're in "foo" in the above example), it'll have a closer
2330 * symbol (the "foo" text symbol for example) and will not
2331 * return the trampoline.
2332 * 2. lookup_minimal_symbol_text() will find a real text symbol
2333 * corresponding to the trampoline, and whose address will
2334 * be different than the trampoline address. I put in a sanity
2335 * check for the address being the same, to avoid an
2336 * infinite recursion.
2338 msymbol
= lookup_minimal_symbol_by_pc (pc
);
2339 if (msymbol
.minsym
!= NULL
)
2340 if (MSYMBOL_TYPE (msymbol
.minsym
) == mst_solib_trampoline
)
2342 struct bound_minimal_symbol mfunsym
2343 = lookup_minimal_symbol_text (MSYMBOL_LINKAGE_NAME (msymbol
.minsym
),
2346 if (mfunsym
.minsym
== NULL
)
2347 /* I eliminated this warning since it is coming out
2348 * in the following situation:
2349 * gdb shmain // test program with shared libraries
2350 * (gdb) break shr1 // function in shared lib
2351 * Warning: In stub for ...
2352 * In the above situation, the shared lib is not loaded yet,
2353 * so of course we can't find the real func/line info,
2354 * but the "break" still works, and the warning is annoying.
2355 * So I commented out the warning. RT */
2356 /* warning ("In stub for %s; unable to find real function/line info",
2357 SYMBOL_LINKAGE_NAME (msymbol)); */
2360 else if (BMSYMBOL_VALUE_ADDRESS (mfunsym
)
2361 == BMSYMBOL_VALUE_ADDRESS (msymbol
))
2362 /* Avoid infinite recursion */
2363 /* See above comment about why warning is commented out. */
2364 /* warning ("In stub for %s; unable to find real function/line info",
2365 SYMBOL_LINKAGE_NAME (msymbol)); */
2369 return find_pc_line (BMSYMBOL_VALUE_ADDRESS (mfunsym
), 0);
2373 s
= find_pc_sect_symtab (pc
, section
);
2376 /* If no symbol information, return previous pc. */
2383 bv
= BLOCKVECTOR (s
);
2384 objfile
= s
->objfile
;
2386 /* Look at all the symtabs that share this blockvector.
2387 They all have the same apriori range, that we found was right;
2388 but they have different line tables. */
2390 ALL_OBJFILE_SYMTABS (objfile
, s
)
2392 if (BLOCKVECTOR (s
) != bv
)
2395 /* Find the best line in this symtab. */
2402 /* I think len can be zero if the symtab lacks line numbers
2403 (e.g. gcc -g1). (Either that or the LINETABLE is NULL;
2404 I'm not sure which, and maybe it depends on the symbol
2410 item
= l
->item
; /* Get first line info. */
2412 /* Is this file's first line closer than the first lines of other files?
2413 If so, record this file, and its first line, as best alternate. */
2414 if (item
->pc
> pc
&& (!alt
|| item
->pc
< alt
->pc
))
2417 for (i
= 0; i
< len
; i
++, item
++)
2419 /* Leave prev pointing to the linetable entry for the last line
2420 that started at or before PC. */
2427 /* At this point, prev points at the line whose start addr is <= pc, and
2428 item points at the next line. If we ran off the end of the linetable
2429 (pc >= start of the last line), then prev == item. If pc < start of
2430 the first line, prev will not be set. */
2432 /* Is this file's best line closer than the best in the other files?
2433 If so, record this file, and its best line, as best so far. Don't
2434 save prev if it represents the end of a function (i.e. line number
2435 0) instead of a real line. */
2437 if (prev
&& prev
->line
&& (!best
|| prev
->pc
> best
->pc
))
2442 /* Discard BEST_END if it's before the PC of the current BEST. */
2443 if (best_end
<= best
->pc
)
2447 /* If another line (denoted by ITEM) is in the linetable and its
2448 PC is after BEST's PC, but before the current BEST_END, then
2449 use ITEM's PC as the new best_end. */
2450 if (best
&& i
< len
&& item
->pc
> best
->pc
2451 && (best_end
== 0 || best_end
> item
->pc
))
2452 best_end
= item
->pc
;
2457 /* If we didn't find any line number info, just return zeros.
2458 We used to return alt->line - 1 here, but that could be
2459 anywhere; if we don't have line number info for this PC,
2460 don't make some up. */
2463 else if (best
->line
== 0)
2465 /* If our best fit is in a range of PC's for which no line
2466 number info is available (line number is zero) then we didn't
2467 find any valid line information. */
2472 val
.symtab
= best_symtab
;
2473 val
.line
= best
->line
;
2475 if (best_end
&& (!alt
|| best_end
< alt
->pc
))
2480 val
.end
= BLOCK_END (BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
));
2482 val
.section
= section
;
2486 /* Backward compatibility (no section). */
2488 struct symtab_and_line
2489 find_pc_line (CORE_ADDR pc
, int notcurrent
)
2491 struct obj_section
*section
;
2493 section
= find_pc_overlay (pc
);
2494 if (pc_in_unmapped_range (pc
, section
))
2495 pc
= overlay_mapped_address (pc
, section
);
2496 return find_pc_sect_line (pc
, section
, notcurrent
);
2499 /* Find line number LINE in any symtab whose name is the same as
2502 If found, return the symtab that contains the linetable in which it was
2503 found, set *INDEX to the index in the linetable of the best entry
2504 found, and set *EXACT_MATCH nonzero if the value returned is an
2507 If not found, return NULL. */
2510 find_line_symtab (struct symtab
*symtab
, int line
,
2511 int *index
, int *exact_match
)
2513 int exact
= 0; /* Initialized here to avoid a compiler warning. */
2515 /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE
2519 struct linetable
*best_linetable
;
2520 struct symtab
*best_symtab
;
2522 /* First try looking it up in the given symtab. */
2523 best_linetable
= LINETABLE (symtab
);
2524 best_symtab
= symtab
;
2525 best_index
= find_line_common (best_linetable
, line
, &exact
, 0);
2526 if (best_index
< 0 || !exact
)
2528 /* Didn't find an exact match. So we better keep looking for
2529 another symtab with the same name. In the case of xcoff,
2530 multiple csects for one source file (produced by IBM's FORTRAN
2531 compiler) produce multiple symtabs (this is unavoidable
2532 assuming csects can be at arbitrary places in memory and that
2533 the GLOBAL_BLOCK of a symtab has a begin and end address). */
2535 /* BEST is the smallest linenumber > LINE so far seen,
2536 or 0 if none has been seen so far.
2537 BEST_INDEX and BEST_LINETABLE identify the item for it. */
2540 struct objfile
*objfile
;
2543 if (best_index
>= 0)
2544 best
= best_linetable
->item
[best_index
].line
;
2548 ALL_OBJFILES (objfile
)
2551 objfile
->sf
->qf
->expand_symtabs_with_fullname (objfile
,
2552 symtab_to_fullname (symtab
));
2555 ALL_SYMTABS (objfile
, s
)
2557 struct linetable
*l
;
2560 if (FILENAME_CMP (symtab
->filename
, s
->filename
) != 0)
2562 if (FILENAME_CMP (symtab_to_fullname (symtab
),
2563 symtab_to_fullname (s
)) != 0)
2566 ind
= find_line_common (l
, line
, &exact
, 0);
2576 if (best
== 0 || l
->item
[ind
].line
< best
)
2578 best
= l
->item
[ind
].line
;
2591 *index
= best_index
;
2593 *exact_match
= exact
;
2598 /* Given SYMTAB, returns all the PCs function in the symtab that
2599 exactly match LINE. Returns NULL if there are no exact matches,
2600 but updates BEST_ITEM in this case. */
2603 find_pcs_for_symtab_line (struct symtab
*symtab
, int line
,
2604 struct linetable_entry
**best_item
)
2607 VEC (CORE_ADDR
) *result
= NULL
;
2609 /* First, collect all the PCs that are at this line. */
2615 idx
= find_line_common (LINETABLE (symtab
), line
, &was_exact
, start
);
2621 struct linetable_entry
*item
= &LINETABLE (symtab
)->item
[idx
];
2623 if (*best_item
== NULL
|| item
->line
< (*best_item
)->line
)
2629 VEC_safe_push (CORE_ADDR
, result
, LINETABLE (symtab
)->item
[idx
].pc
);
2637 /* Set the PC value for a given source file and line number and return true.
2638 Returns zero for invalid line number (and sets the PC to 0).
2639 The source file is specified with a struct symtab. */
2642 find_line_pc (struct symtab
*symtab
, int line
, CORE_ADDR
*pc
)
2644 struct linetable
*l
;
2651 symtab
= find_line_symtab (symtab
, line
, &ind
, NULL
);
2654 l
= LINETABLE (symtab
);
2655 *pc
= l
->item
[ind
].pc
;
2662 /* Find the range of pc values in a line.
2663 Store the starting pc of the line into *STARTPTR
2664 and the ending pc (start of next line) into *ENDPTR.
2665 Returns 1 to indicate success.
2666 Returns 0 if could not find the specified line. */
2669 find_line_pc_range (struct symtab_and_line sal
, CORE_ADDR
*startptr
,
2672 CORE_ADDR startaddr
;
2673 struct symtab_and_line found_sal
;
2676 if (startaddr
== 0 && !find_line_pc (sal
.symtab
, sal
.line
, &startaddr
))
2679 /* This whole function is based on address. For example, if line 10 has
2680 two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then
2681 "info line *0x123" should say the line goes from 0x100 to 0x200
2682 and "info line *0x355" should say the line goes from 0x300 to 0x400.
2683 This also insures that we never give a range like "starts at 0x134
2684 and ends at 0x12c". */
2686 found_sal
= find_pc_sect_line (startaddr
, sal
.section
, 0);
2687 if (found_sal
.line
!= sal
.line
)
2689 /* The specified line (sal) has zero bytes. */
2690 *startptr
= found_sal
.pc
;
2691 *endptr
= found_sal
.pc
;
2695 *startptr
= found_sal
.pc
;
2696 *endptr
= found_sal
.end
;
2701 /* Given a line table and a line number, return the index into the line
2702 table for the pc of the nearest line whose number is >= the specified one.
2703 Return -1 if none is found. The value is >= 0 if it is an index.
2704 START is the index at which to start searching the line table.
2706 Set *EXACT_MATCH nonzero if the value returned is an exact match. */
2709 find_line_common (struct linetable
*l
, int lineno
,
2710 int *exact_match
, int start
)
2715 /* BEST is the smallest linenumber > LINENO so far seen,
2716 or 0 if none has been seen so far.
2717 BEST_INDEX identifies the item for it. */
2719 int best_index
= -1;
2730 for (i
= start
; i
< len
; i
++)
2732 struct linetable_entry
*item
= &(l
->item
[i
]);
2734 if (item
->line
== lineno
)
2736 /* Return the first (lowest address) entry which matches. */
2741 if (item
->line
> lineno
&& (best
== 0 || item
->line
< best
))
2748 /* If we got here, we didn't get an exact match. */
2753 find_pc_line_pc_range (CORE_ADDR pc
, CORE_ADDR
*startptr
, CORE_ADDR
*endptr
)
2755 struct symtab_and_line sal
;
2757 sal
= find_pc_line (pc
, 0);
2760 return sal
.symtab
!= 0;
2763 /* Given a function symbol SYM, find the symtab and line for the start
2765 If the argument FUNFIRSTLINE is nonzero, we want the first line
2766 of real code inside the function. */
2768 struct symtab_and_line
2769 find_function_start_sal (struct symbol
*sym
, int funfirstline
)
2771 struct symtab_and_line sal
;
2773 fixup_symbol_section (sym
, NULL
);
2774 sal
= find_pc_sect_line (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)),
2775 SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
), 0);
2777 /* We always should have a line for the function start address.
2778 If we don't, something is odd. Create a plain SAL refering
2779 just the PC and hope that skip_prologue_sal (if requested)
2780 can find a line number for after the prologue. */
2781 if (sal
.pc
< BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)))
2784 sal
.pspace
= current_program_space
;
2785 sal
.pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2786 sal
.section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2790 skip_prologue_sal (&sal
);
2795 /* Given a function start address FUNC_ADDR and SYMTAB, find the first
2796 address for that function that has an entry in SYMTAB's line info
2797 table. If such an entry cannot be found, return FUNC_ADDR
2801 skip_prologue_using_lineinfo (CORE_ADDR func_addr
, struct symtab
*symtab
)
2803 CORE_ADDR func_start
, func_end
;
2804 struct linetable
*l
;
2807 /* Give up if this symbol has no lineinfo table. */
2808 l
= LINETABLE (symtab
);
2812 /* Get the range for the function's PC values, or give up if we
2813 cannot, for some reason. */
2814 if (!find_pc_partial_function (func_addr
, NULL
, &func_start
, &func_end
))
2817 /* Linetable entries are ordered by PC values, see the commentary in
2818 symtab.h where `struct linetable' is defined. Thus, the first
2819 entry whose PC is in the range [FUNC_START..FUNC_END[ is the
2820 address we are looking for. */
2821 for (i
= 0; i
< l
->nitems
; i
++)
2823 struct linetable_entry
*item
= &(l
->item
[i
]);
2825 /* Don't use line numbers of zero, they mark special entries in
2826 the table. See the commentary on symtab.h before the
2827 definition of struct linetable. */
2828 if (item
->line
> 0 && func_start
<= item
->pc
&& item
->pc
< func_end
)
2835 /* Adjust SAL to the first instruction past the function prologue.
2836 If the PC was explicitly specified, the SAL is not changed.
2837 If the line number was explicitly specified, at most the SAL's PC
2838 is updated. If SAL is already past the prologue, then do nothing. */
2841 skip_prologue_sal (struct symtab_and_line
*sal
)
2844 struct symtab_and_line start_sal
;
2845 struct cleanup
*old_chain
;
2846 CORE_ADDR pc
, saved_pc
;
2847 struct obj_section
*section
;
2849 struct objfile
*objfile
;
2850 struct gdbarch
*gdbarch
;
2851 const struct block
*b
, *function_block
;
2852 int force_skip
, skip
;
2854 /* Do not change the SAL if PC was specified explicitly. */
2855 if (sal
->explicit_pc
)
2858 old_chain
= save_current_space_and_thread ();
2859 switch_to_program_space_and_thread (sal
->pspace
);
2861 sym
= find_pc_sect_function (sal
->pc
, sal
->section
);
2864 fixup_symbol_section (sym
, NULL
);
2866 pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2867 section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2868 name
= SYMBOL_LINKAGE_NAME (sym
);
2869 objfile
= SYMBOL_SYMTAB (sym
)->objfile
;
2873 struct bound_minimal_symbol msymbol
2874 = lookup_minimal_symbol_by_pc_section (sal
->pc
, sal
->section
);
2876 if (msymbol
.minsym
== NULL
)
2878 do_cleanups (old_chain
);
2882 objfile
= msymbol
.objfile
;
2883 pc
= BMSYMBOL_VALUE_ADDRESS (msymbol
);
2884 section
= MSYMBOL_OBJ_SECTION (objfile
, msymbol
.minsym
);
2885 name
= MSYMBOL_LINKAGE_NAME (msymbol
.minsym
);
2888 gdbarch
= get_objfile_arch (objfile
);
2890 /* Process the prologue in two passes. In the first pass try to skip the
2891 prologue (SKIP is true) and verify there is a real need for it (indicated
2892 by FORCE_SKIP). If no such reason was found run a second pass where the
2893 prologue is not skipped (SKIP is false). */
2898 /* Be conservative - allow direct PC (without skipping prologue) only if we
2899 have proven the CU (Compilation Unit) supports it. sal->SYMTAB does not
2900 have to be set by the caller so we use SYM instead. */
2901 if (sym
&& SYMBOL_SYMTAB (sym
)->locations_valid
)
2909 /* If the function is in an unmapped overlay, use its unmapped LMA address,
2910 so that gdbarch_skip_prologue has something unique to work on. */
2911 if (section_is_overlay (section
) && !section_is_mapped (section
))
2912 pc
= overlay_unmapped_address (pc
, section
);
2914 /* Skip "first line" of function (which is actually its prologue). */
2915 pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
2916 if (gdbarch_skip_entrypoint_p (gdbarch
))
2917 pc
= gdbarch_skip_entrypoint (gdbarch
, pc
);
2919 pc
= gdbarch_skip_prologue (gdbarch
, pc
);
2921 /* For overlays, map pc back into its mapped VMA range. */
2922 pc
= overlay_mapped_address (pc
, section
);
2924 /* Calculate line number. */
2925 start_sal
= find_pc_sect_line (pc
, section
, 0);
2927 /* Check if gdbarch_skip_prologue left us in mid-line, and the next
2928 line is still part of the same function. */
2929 if (skip
&& start_sal
.pc
!= pc
2930 && (sym
? (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)) <= start_sal
.end
2931 && start_sal
.end
< BLOCK_END (SYMBOL_BLOCK_VALUE (sym
)))
2932 : (lookup_minimal_symbol_by_pc_section (start_sal
.end
, section
).minsym
2933 == lookup_minimal_symbol_by_pc_section (pc
, section
).minsym
)))
2935 /* First pc of next line */
2937 /* Recalculate the line number (might not be N+1). */
2938 start_sal
= find_pc_sect_line (pc
, section
, 0);
2941 /* On targets with executable formats that don't have a concept of
2942 constructors (ELF with .init has, PE doesn't), gcc emits a call
2943 to `__main' in `main' between the prologue and before user
2945 if (gdbarch_skip_main_prologue_p (gdbarch
)
2946 && name
&& strcmp_iw (name
, "main") == 0)
2948 pc
= gdbarch_skip_main_prologue (gdbarch
, pc
);
2949 /* Recalculate the line number (might not be N+1). */
2950 start_sal
= find_pc_sect_line (pc
, section
, 0);
2954 while (!force_skip
&& skip
--);
2956 /* If we still don't have a valid source line, try to find the first
2957 PC in the lineinfo table that belongs to the same function. This
2958 happens with COFF debug info, which does not seem to have an
2959 entry in lineinfo table for the code after the prologue which has
2960 no direct relation to source. For example, this was found to be
2961 the case with the DJGPP target using "gcc -gcoff" when the
2962 compiler inserted code after the prologue to make sure the stack
2964 if (!force_skip
&& sym
&& start_sal
.symtab
== NULL
)
2966 pc
= skip_prologue_using_lineinfo (pc
, SYMBOL_SYMTAB (sym
));
2967 /* Recalculate the line number. */
2968 start_sal
= find_pc_sect_line (pc
, section
, 0);
2971 do_cleanups (old_chain
);
2973 /* If we're already past the prologue, leave SAL unchanged. Otherwise
2974 forward SAL to the end of the prologue. */
2979 sal
->section
= section
;
2981 /* Unless the explicit_line flag was set, update the SAL line
2982 and symtab to correspond to the modified PC location. */
2983 if (sal
->explicit_line
)
2986 sal
->symtab
= start_sal
.symtab
;
2987 sal
->line
= start_sal
.line
;
2988 sal
->end
= start_sal
.end
;
2990 /* Check if we are now inside an inlined function. If we can,
2991 use the call site of the function instead. */
2992 b
= block_for_pc_sect (sal
->pc
, sal
->section
);
2993 function_block
= NULL
;
2996 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
2998 else if (BLOCK_FUNCTION (b
) != NULL
)
3000 b
= BLOCK_SUPERBLOCK (b
);
3002 if (function_block
!= NULL
3003 && SYMBOL_LINE (BLOCK_FUNCTION (function_block
)) != 0)
3005 sal
->line
= SYMBOL_LINE (BLOCK_FUNCTION (function_block
));
3006 sal
->symtab
= SYMBOL_SYMTAB (BLOCK_FUNCTION (function_block
));
3010 /* Determine if PC is in the prologue of a function. The prologue is the area
3011 between the first instruction of a function, and the first executable line.
3012 Returns 1 if PC *might* be in prologue, 0 if definately *not* in prologue.
3014 If non-zero, func_start is where we think the prologue starts, possibly
3015 by previous examination of symbol table information. */
3018 in_prologue (struct gdbarch
*gdbarch
, CORE_ADDR pc
, CORE_ADDR func_start
)
3020 struct symtab_and_line sal
;
3021 CORE_ADDR func_addr
, func_end
;
3023 /* We have several sources of information we can consult to figure
3025 - Compilers usually emit line number info that marks the prologue
3026 as its own "source line". So the ending address of that "line"
3027 is the end of the prologue. If available, this is the most
3029 - The minimal symbols and partial symbols, which can usually tell
3030 us the starting and ending addresses of a function.
3031 - If we know the function's start address, we can call the
3032 architecture-defined gdbarch_skip_prologue function to analyze the
3033 instruction stream and guess where the prologue ends.
3034 - Our `func_start' argument; if non-zero, this is the caller's
3035 best guess as to the function's entry point. At the time of
3036 this writing, handle_inferior_event doesn't get this right, so
3037 it should be our last resort. */
3039 /* Consult the partial symbol table, to find which function
3041 if (! find_pc_partial_function (pc
, NULL
, &func_addr
, &func_end
))
3043 CORE_ADDR prologue_end
;
3045 /* We don't even have minsym information, so fall back to using
3046 func_start, if given. */
3048 return 1; /* We *might* be in a prologue. */
3050 prologue_end
= gdbarch_skip_prologue (gdbarch
, func_start
);
3052 return func_start
<= pc
&& pc
< prologue_end
;
3055 /* If we have line number information for the function, that's
3056 usually pretty reliable. */
3057 sal
= find_pc_line (func_addr
, 0);
3059 /* Now sal describes the source line at the function's entry point,
3060 which (by convention) is the prologue. The end of that "line",
3061 sal.end, is the end of the prologue.
3063 Note that, for functions whose source code is all on a single
3064 line, the line number information doesn't always end up this way.
3065 So we must verify that our purported end-of-prologue address is
3066 *within* the function, not at its start or end. */
3068 || sal
.end
<= func_addr
3069 || func_end
<= sal
.end
)
3071 /* We don't have any good line number info, so use the minsym
3072 information, together with the architecture-specific prologue
3074 CORE_ADDR prologue_end
= gdbarch_skip_prologue (gdbarch
, func_addr
);
3076 return func_addr
<= pc
&& pc
< prologue_end
;
3079 /* We have line number info, and it looks good. */
3080 return func_addr
<= pc
&& pc
< sal
.end
;
3083 /* Given PC at the function's start address, attempt to find the
3084 prologue end using SAL information. Return zero if the skip fails.
3086 A non-optimized prologue traditionally has one SAL for the function
3087 and a second for the function body. A single line function has
3088 them both pointing at the same line.
3090 An optimized prologue is similar but the prologue may contain
3091 instructions (SALs) from the instruction body. Need to skip those
3092 while not getting into the function body.
3094 The functions end point and an increasing SAL line are used as
3095 indicators of the prologue's endpoint.
3097 This code is based on the function refine_prologue_limit
3101 skip_prologue_using_sal (struct gdbarch
*gdbarch
, CORE_ADDR func_addr
)
3103 struct symtab_and_line prologue_sal
;
3106 const struct block
*bl
;
3108 /* Get an initial range for the function. */
3109 find_pc_partial_function (func_addr
, NULL
, &start_pc
, &end_pc
);
3110 start_pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
3112 prologue_sal
= find_pc_line (start_pc
, 0);
3113 if (prologue_sal
.line
!= 0)
3115 /* For languages other than assembly, treat two consecutive line
3116 entries at the same address as a zero-instruction prologue.
3117 The GNU assembler emits separate line notes for each instruction
3118 in a multi-instruction macro, but compilers generally will not
3120 if (prologue_sal
.symtab
->language
!= language_asm
)
3122 struct linetable
*linetable
= LINETABLE (prologue_sal
.symtab
);
3125 /* Skip any earlier lines, and any end-of-sequence marker
3126 from a previous function. */
3127 while (linetable
->item
[idx
].pc
!= prologue_sal
.pc
3128 || linetable
->item
[idx
].line
== 0)
3131 if (idx
+1 < linetable
->nitems
3132 && linetable
->item
[idx
+1].line
!= 0
3133 && linetable
->item
[idx
+1].pc
== start_pc
)
3137 /* If there is only one sal that covers the entire function,
3138 then it is probably a single line function, like
3140 if (prologue_sal
.end
>= end_pc
)
3143 while (prologue_sal
.end
< end_pc
)
3145 struct symtab_and_line sal
;
3147 sal
= find_pc_line (prologue_sal
.end
, 0);
3150 /* Assume that a consecutive SAL for the same (or larger)
3151 line mark the prologue -> body transition. */
3152 if (sal
.line
>= prologue_sal
.line
)
3154 /* Likewise if we are in a different symtab altogether
3155 (e.g. within a file included via #include). */
3156 if (sal
.symtab
!= prologue_sal
.symtab
)
3159 /* The line number is smaller. Check that it's from the
3160 same function, not something inlined. If it's inlined,
3161 then there is no point comparing the line numbers. */
3162 bl
= block_for_pc (prologue_sal
.end
);
3165 if (block_inlined_p (bl
))
3167 if (BLOCK_FUNCTION (bl
))
3172 bl
= BLOCK_SUPERBLOCK (bl
);
3177 /* The case in which compiler's optimizer/scheduler has
3178 moved instructions into the prologue. We look ahead in
3179 the function looking for address ranges whose
3180 corresponding line number is less the first one that we
3181 found for the function. This is more conservative then
3182 refine_prologue_limit which scans a large number of SALs
3183 looking for any in the prologue. */
3188 if (prologue_sal
.end
< end_pc
)
3189 /* Return the end of this line, or zero if we could not find a
3191 return prologue_sal
.end
;
3193 /* Don't return END_PC, which is past the end of the function. */
3194 return prologue_sal
.pc
;
3197 /* If P is of the form "operator[ \t]+..." where `...' is
3198 some legitimate operator text, return a pointer to the
3199 beginning of the substring of the operator text.
3200 Otherwise, return "". */
3203 operator_chars (const char *p
, const char **end
)
3206 if (strncmp (p
, "operator", 8))
3210 /* Don't get faked out by `operator' being part of a longer
3212 if (isalpha (*p
) || *p
== '_' || *p
== '$' || *p
== '\0')
3215 /* Allow some whitespace between `operator' and the operator symbol. */
3216 while (*p
== ' ' || *p
== '\t')
3219 /* Recognize 'operator TYPENAME'. */
3221 if (isalpha (*p
) || *p
== '_' || *p
== '$')
3223 const char *q
= p
+ 1;
3225 while (isalnum (*q
) || *q
== '_' || *q
== '$')
3234 case '\\': /* regexp quoting */
3237 if (p
[2] == '=') /* 'operator\*=' */
3239 else /* 'operator\*' */
3243 else if (p
[1] == '[')
3246 error (_("mismatched quoting on brackets, "
3247 "try 'operator\\[\\]'"));
3248 else if (p
[2] == '\\' && p
[3] == ']')
3250 *end
= p
+ 4; /* 'operator\[\]' */
3254 error (_("nothing is allowed between '[' and ']'"));
3258 /* Gratuitous qoute: skip it and move on. */
3280 if (p
[0] == '-' && p
[1] == '>')
3282 /* Struct pointer member operator 'operator->'. */
3285 *end
= p
+ 3; /* 'operator->*' */
3288 else if (p
[2] == '\\')
3290 *end
= p
+ 4; /* Hopefully 'operator->\*' */
3295 *end
= p
+ 2; /* 'operator->' */
3299 if (p
[1] == '=' || p
[1] == p
[0])
3310 error (_("`operator ()' must be specified "
3311 "without whitespace in `()'"));
3316 error (_("`operator ?:' must be specified "
3317 "without whitespace in `?:'"));
3322 error (_("`operator []' must be specified "
3323 "without whitespace in `[]'"));
3327 error (_("`operator %s' not supported"), p
);
3336 /* Cache to watch for file names already seen by filename_seen. */
3338 struct filename_seen_cache
3340 /* Table of files seen so far. */
3342 /* Initial size of the table. It automagically grows from here. */
3343 #define INITIAL_FILENAME_SEEN_CACHE_SIZE 100
3346 /* filename_seen_cache constructor. */
3348 static struct filename_seen_cache
*
3349 create_filename_seen_cache (void)
3351 struct filename_seen_cache
*cache
;
3353 cache
= XNEW (struct filename_seen_cache
);
3354 cache
->tab
= htab_create_alloc (INITIAL_FILENAME_SEEN_CACHE_SIZE
,
3355 filename_hash
, filename_eq
,
3356 NULL
, xcalloc
, xfree
);
3361 /* Empty the cache, but do not delete it. */
3364 clear_filename_seen_cache (struct filename_seen_cache
*cache
)
3366 htab_empty (cache
->tab
);
3369 /* filename_seen_cache destructor.
3370 This takes a void * argument as it is generally used as a cleanup. */
3373 delete_filename_seen_cache (void *ptr
)
3375 struct filename_seen_cache
*cache
= ptr
;
3377 htab_delete (cache
->tab
);
3381 /* If FILE is not already in the table of files in CACHE, return zero;
3382 otherwise return non-zero. Optionally add FILE to the table if ADD
3385 NOTE: We don't manage space for FILE, we assume FILE lives as long
3386 as the caller needs. */
3389 filename_seen (struct filename_seen_cache
*cache
, const char *file
, int add
)
3393 /* Is FILE in tab? */
3394 slot
= htab_find_slot (cache
->tab
, file
, add
? INSERT
: NO_INSERT
);
3398 /* No; maybe add it to tab. */
3400 *slot
= (char *) file
;
3405 /* Data structure to maintain printing state for output_source_filename. */
3407 struct output_source_filename_data
3409 /* Cache of what we've seen so far. */
3410 struct filename_seen_cache
*filename_seen_cache
;
3412 /* Flag of whether we're printing the first one. */
3416 /* Slave routine for sources_info. Force line breaks at ,'s.
3417 NAME is the name to print.
3418 DATA contains the state for printing and watching for duplicates. */
3421 output_source_filename (const char *name
,
3422 struct output_source_filename_data
*data
)
3424 /* Since a single source file can result in several partial symbol
3425 tables, we need to avoid printing it more than once. Note: if
3426 some of the psymtabs are read in and some are not, it gets
3427 printed both under "Source files for which symbols have been
3428 read" and "Source files for which symbols will be read in on
3429 demand". I consider this a reasonable way to deal with the
3430 situation. I'm not sure whether this can also happen for
3431 symtabs; it doesn't hurt to check. */
3433 /* Was NAME already seen? */
3434 if (filename_seen (data
->filename_seen_cache
, name
, 1))
3436 /* Yes; don't print it again. */
3440 /* No; print it and reset *FIRST. */
3442 printf_filtered (", ");
3446 fputs_filtered (name
, gdb_stdout
);
3449 /* A callback for map_partial_symbol_filenames. */
3452 output_partial_symbol_filename (const char *filename
, const char *fullname
,
3455 output_source_filename (fullname
? fullname
: filename
, data
);
3459 sources_info (char *ignore
, int from_tty
)
3462 struct objfile
*objfile
;
3463 struct output_source_filename_data data
;
3464 struct cleanup
*cleanups
;
3466 if (!have_full_symbols () && !have_partial_symbols ())
3468 error (_("No symbol table is loaded. Use the \"file\" command."));
3471 data
.filename_seen_cache
= create_filename_seen_cache ();
3472 cleanups
= make_cleanup (delete_filename_seen_cache
,
3473 data
.filename_seen_cache
);
3475 printf_filtered ("Source files for which symbols have been read in:\n\n");
3478 ALL_SYMTABS (objfile
, s
)
3480 const char *fullname
= symtab_to_fullname (s
);
3482 output_source_filename (fullname
, &data
);
3484 printf_filtered ("\n\n");
3486 printf_filtered ("Source files for which symbols "
3487 "will be read in on demand:\n\n");
3489 clear_filename_seen_cache (data
.filename_seen_cache
);
3491 map_symbol_filenames (output_partial_symbol_filename
, &data
,
3492 1 /*need_fullname*/);
3493 printf_filtered ("\n");
3495 do_cleanups (cleanups
);
3498 /* Compare FILE against all the NFILES entries of FILES. If BASENAMES is
3499 non-zero compare only lbasename of FILES. */
3502 file_matches (const char *file
, const char *files
[], int nfiles
, int basenames
)
3506 if (file
!= NULL
&& nfiles
!= 0)
3508 for (i
= 0; i
< nfiles
; i
++)
3510 if (compare_filenames_for_search (file
, (basenames
3511 ? lbasename (files
[i
])
3516 else if (nfiles
== 0)
3521 /* Free any memory associated with a search. */
3524 free_search_symbols (struct symbol_search
*symbols
)
3526 struct symbol_search
*p
;
3527 struct symbol_search
*next
;
3529 for (p
= symbols
; p
!= NULL
; p
= next
)
3537 do_free_search_symbols_cleanup (void *symbolsp
)
3539 struct symbol_search
*symbols
= *(struct symbol_search
**) symbolsp
;
3541 free_search_symbols (symbols
);
3545 make_cleanup_free_search_symbols (struct symbol_search
**symbolsp
)
3547 return make_cleanup (do_free_search_symbols_cleanup
, symbolsp
);
3550 /* Helper function for sort_search_symbols_remove_dups and qsort. Can only
3551 sort symbols, not minimal symbols. */
3554 compare_search_syms (const void *sa
, const void *sb
)
3556 struct symbol_search
*sym_a
= *(struct symbol_search
**) sa
;
3557 struct symbol_search
*sym_b
= *(struct symbol_search
**) sb
;
3560 c
= FILENAME_CMP (sym_a
->symtab
->filename
, sym_b
->symtab
->filename
);
3564 if (sym_a
->block
!= sym_b
->block
)
3565 return sym_a
->block
- sym_b
->block
;
3567 return strcmp (SYMBOL_PRINT_NAME (sym_a
->symbol
),
3568 SYMBOL_PRINT_NAME (sym_b
->symbol
));
3571 /* Sort the NFOUND symbols in list FOUND and remove duplicates.
3572 The duplicates are freed, and the new list is returned in
3573 *NEW_HEAD, *NEW_TAIL. */
3576 sort_search_symbols_remove_dups (struct symbol_search
*found
, int nfound
,
3577 struct symbol_search
**new_head
,
3578 struct symbol_search
**new_tail
)
3580 struct symbol_search
**symbols
, *symp
, *old_next
;
3583 gdb_assert (found
!= NULL
&& nfound
> 0);
3585 /* Build an array out of the list so we can easily sort them. */
3586 symbols
= (struct symbol_search
**) xmalloc (sizeof (struct symbol_search
*)
3589 for (i
= 0; i
< nfound
; i
++)
3591 gdb_assert (symp
!= NULL
);
3592 gdb_assert (symp
->block
>= 0 && symp
->block
<= 1);
3596 gdb_assert (symp
== NULL
);
3598 qsort (symbols
, nfound
, sizeof (struct symbol_search
*),
3599 compare_search_syms
);
3601 /* Collapse out the dups. */
3602 for (i
= 1, j
= 1; i
< nfound
; ++i
)
3604 if (compare_search_syms (&symbols
[j
- 1], &symbols
[i
]) != 0)
3605 symbols
[j
++] = symbols
[i
];
3610 symbols
[j
- 1]->next
= NULL
;
3612 /* Rebuild the linked list. */
3613 for (i
= 0; i
< nunique
- 1; i
++)
3614 symbols
[i
]->next
= symbols
[i
+ 1];
3615 symbols
[nunique
- 1]->next
= NULL
;
3617 *new_head
= symbols
[0];
3618 *new_tail
= symbols
[nunique
- 1];
3622 /* An object of this type is passed as the user_data to the
3623 expand_symtabs_matching method. */
3624 struct search_symbols_data
3629 /* It is true if PREG contains valid data, false otherwise. */
3630 unsigned preg_p
: 1;
3634 /* A callback for expand_symtabs_matching. */
3637 search_symbols_file_matches (const char *filename
, void *user_data
,
3640 struct search_symbols_data
*data
= user_data
;
3642 return file_matches (filename
, data
->files
, data
->nfiles
, basenames
);
3645 /* A callback for expand_symtabs_matching. */
3648 search_symbols_name_matches (const char *symname
, void *user_data
)
3650 struct search_symbols_data
*data
= user_data
;
3652 return !data
->preg_p
|| regexec (&data
->preg
, symname
, 0, NULL
, 0) == 0;
3655 /* Search the symbol table for matches to the regular expression REGEXP,
3656 returning the results in *MATCHES.
3658 Only symbols of KIND are searched:
3659 VARIABLES_DOMAIN - search all symbols, excluding functions, type names,
3660 and constants (enums)
3661 FUNCTIONS_DOMAIN - search all functions
3662 TYPES_DOMAIN - search all type names
3663 ALL_DOMAIN - an internal error for this function
3665 free_search_symbols should be called when *MATCHES is no longer needed.
3667 Within each file the results are sorted locally; each symtab's global and
3668 static blocks are separately alphabetized.
3669 Duplicate entries are removed. */
3672 search_symbols (const char *regexp
, enum search_domain kind
,
3673 int nfiles
, const char *files
[],
3674 struct symbol_search
**matches
)
3677 const struct blockvector
*bv
;
3680 struct block_iterator iter
;
3682 struct objfile
*objfile
;
3683 struct minimal_symbol
*msymbol
;
3685 static const enum minimal_symbol_type types
[]
3686 = {mst_data
, mst_text
, mst_abs
};
3687 static const enum minimal_symbol_type types2
[]
3688 = {mst_bss
, mst_file_text
, mst_abs
};
3689 static const enum minimal_symbol_type types3
[]
3690 = {mst_file_data
, mst_solib_trampoline
, mst_abs
};
3691 static const enum minimal_symbol_type types4
[]
3692 = {mst_file_bss
, mst_text_gnu_ifunc
, mst_abs
};
3693 enum minimal_symbol_type ourtype
;
3694 enum minimal_symbol_type ourtype2
;
3695 enum minimal_symbol_type ourtype3
;
3696 enum minimal_symbol_type ourtype4
;
3697 struct symbol_search
*found
;
3698 struct symbol_search
*tail
;
3699 struct search_symbols_data datum
;
3702 /* OLD_CHAIN .. RETVAL_CHAIN is always freed, RETVAL_CHAIN .. current
3703 CLEANUP_CHAIN is freed only in the case of an error. */
3704 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
3705 struct cleanup
*retval_chain
;
3707 gdb_assert (kind
<= TYPES_DOMAIN
);
3709 ourtype
= types
[kind
];
3710 ourtype2
= types2
[kind
];
3711 ourtype3
= types3
[kind
];
3712 ourtype4
= types4
[kind
];
3719 /* Make sure spacing is right for C++ operators.
3720 This is just a courtesy to make the matching less sensitive
3721 to how many spaces the user leaves between 'operator'
3722 and <TYPENAME> or <OPERATOR>. */
3724 const char *opname
= operator_chars (regexp
, &opend
);
3729 int fix
= -1; /* -1 means ok; otherwise number of
3732 if (isalpha (*opname
) || *opname
== '_' || *opname
== '$')
3734 /* There should 1 space between 'operator' and 'TYPENAME'. */
3735 if (opname
[-1] != ' ' || opname
[-2] == ' ')
3740 /* There should 0 spaces between 'operator' and 'OPERATOR'. */
3741 if (opname
[-1] == ' ')
3744 /* If wrong number of spaces, fix it. */
3747 char *tmp
= (char *) alloca (8 + fix
+ strlen (opname
) + 1);
3749 sprintf (tmp
, "operator%.*s%s", fix
, " ", opname
);
3754 errcode
= regcomp (&datum
.preg
, regexp
,
3755 REG_NOSUB
| (case_sensitivity
== case_sensitive_off
3759 char *err
= get_regcomp_error (errcode
, &datum
.preg
);
3761 make_cleanup (xfree
, err
);
3762 error (_("Invalid regexp (%s): %s"), err
, regexp
);
3765 make_regfree_cleanup (&datum
.preg
);
3768 /* Search through the partial symtabs *first* for all symbols
3769 matching the regexp. That way we don't have to reproduce all of
3770 the machinery below. */
3772 datum
.nfiles
= nfiles
;
3773 datum
.files
= files
;
3774 expand_symtabs_matching ((nfiles
== 0
3776 : search_symbols_file_matches
),
3777 search_symbols_name_matches
,
3780 /* Here, we search through the minimal symbol tables for functions
3781 and variables that match, and force their symbols to be read.
3782 This is in particular necessary for demangled variable names,
3783 which are no longer put into the partial symbol tables.
3784 The symbol will then be found during the scan of symtabs below.
3786 For functions, find_pc_symtab should succeed if we have debug info
3787 for the function, for variables we have to call
3788 lookup_symbol_in_objfile_from_linkage_name to determine if the variable
3790 If the lookup fails, set found_misc so that we will rescan to print
3791 any matching symbols without debug info.
3792 We only search the objfile the msymbol came from, we no longer search
3793 all objfiles. In large programs (1000s of shared libs) searching all
3794 objfiles is not worth the pain. */
3796 if (nfiles
== 0 && (kind
== VARIABLES_DOMAIN
|| kind
== FUNCTIONS_DOMAIN
))
3798 ALL_MSYMBOLS (objfile
, msymbol
)
3802 if (msymbol
->created_by_gdb
)
3805 if (MSYMBOL_TYPE (msymbol
) == ourtype
3806 || MSYMBOL_TYPE (msymbol
) == ourtype2
3807 || MSYMBOL_TYPE (msymbol
) == ourtype3
3808 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3811 || regexec (&datum
.preg
, MSYMBOL_NATURAL_NAME (msymbol
), 0,
3814 /* Note: An important side-effect of these lookup functions
3815 is to expand the symbol table if msymbol is found, for the
3816 benefit of the next loop on ALL_PRIMARY_SYMTABS. */
3817 if (kind
== FUNCTIONS_DOMAIN
3818 ? find_pc_symtab (MSYMBOL_VALUE_ADDRESS (objfile
,
3820 : (lookup_symbol_in_objfile_from_linkage_name
3821 (objfile
, MSYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3832 retval_chain
= make_cleanup_free_search_symbols (&found
);
3834 ALL_PRIMARY_SYMTABS (objfile
, s
)
3836 bv
= BLOCKVECTOR (s
);
3837 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
3839 b
= BLOCKVECTOR_BLOCK (bv
, i
);
3840 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
3842 struct symtab
*real_symtab
= SYMBOL_SYMTAB (sym
);
3846 /* Check first sole REAL_SYMTAB->FILENAME. It does not need to be
3847 a substring of symtab_to_fullname as it may contain "./" etc. */
3848 if ((file_matches (real_symtab
->filename
, files
, nfiles
, 0)
3849 || ((basenames_may_differ
3850 || file_matches (lbasename (real_symtab
->filename
),
3852 && file_matches (symtab_to_fullname (real_symtab
),
3855 || regexec (&datum
.preg
, SYMBOL_NATURAL_NAME (sym
), 0,
3857 && ((kind
== VARIABLES_DOMAIN
3858 && SYMBOL_CLASS (sym
) != LOC_TYPEDEF
3859 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
3860 && SYMBOL_CLASS (sym
) != LOC_BLOCK
3861 /* LOC_CONST can be used for more than just enums,
3862 e.g., c++ static const members.
3863 We only want to skip enums here. */
3864 && !(SYMBOL_CLASS (sym
) == LOC_CONST
3865 && TYPE_CODE (SYMBOL_TYPE (sym
))
3867 || (kind
== FUNCTIONS_DOMAIN
3868 && SYMBOL_CLASS (sym
) == LOC_BLOCK
)
3869 || (kind
== TYPES_DOMAIN
3870 && SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))))
3873 struct symbol_search
*psr
= (struct symbol_search
*)
3874 xmalloc (sizeof (struct symbol_search
));
3876 psr
->symtab
= real_symtab
;
3878 memset (&psr
->msymbol
, 0, sizeof (psr
->msymbol
));
3893 sort_search_symbols_remove_dups (found
, nfound
, &found
, &tail
);
3894 /* Note: nfound is no longer useful beyond this point. */
3897 /* If there are no eyes, avoid all contact. I mean, if there are
3898 no debug symbols, then print directly from the msymbol_vector. */
3900 if (found_misc
|| (nfiles
== 0 && kind
!= FUNCTIONS_DOMAIN
))
3902 ALL_MSYMBOLS (objfile
, msymbol
)
3906 if (msymbol
->created_by_gdb
)
3909 if (MSYMBOL_TYPE (msymbol
) == ourtype
3910 || MSYMBOL_TYPE (msymbol
) == ourtype2
3911 || MSYMBOL_TYPE (msymbol
) == ourtype3
3912 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3915 || regexec (&datum
.preg
, MSYMBOL_NATURAL_NAME (msymbol
), 0,
3918 /* For functions we can do a quick check of whether the
3919 symbol might be found via find_pc_symtab. */
3920 if (kind
!= FUNCTIONS_DOMAIN
3921 || find_pc_symtab (MSYMBOL_VALUE_ADDRESS (objfile
,
3924 if (lookup_symbol_in_objfile_from_linkage_name
3925 (objfile
, MSYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3929 struct symbol_search
*psr
= (struct symbol_search
*)
3930 xmalloc (sizeof (struct symbol_search
));
3932 psr
->msymbol
.minsym
= msymbol
;
3933 psr
->msymbol
.objfile
= objfile
;
3949 discard_cleanups (retval_chain
);
3950 do_cleanups (old_chain
);
3954 /* Helper function for symtab_symbol_info, this function uses
3955 the data returned from search_symbols() to print information
3956 regarding the match to gdb_stdout. */
3959 print_symbol_info (enum search_domain kind
,
3960 struct symtab
*s
, struct symbol
*sym
,
3961 int block
, const char *last
)
3963 const char *s_filename
= symtab_to_filename_for_display (s
);
3965 if (last
== NULL
|| filename_cmp (last
, s_filename
) != 0)
3967 fputs_filtered ("\nFile ", gdb_stdout
);
3968 fputs_filtered (s_filename
, gdb_stdout
);
3969 fputs_filtered (":\n", gdb_stdout
);
3972 if (kind
!= TYPES_DOMAIN
&& block
== STATIC_BLOCK
)
3973 printf_filtered ("static ");
3975 /* Typedef that is not a C++ class. */
3976 if (kind
== TYPES_DOMAIN
3977 && SYMBOL_DOMAIN (sym
) != STRUCT_DOMAIN
)
3978 typedef_print (SYMBOL_TYPE (sym
), sym
, gdb_stdout
);
3979 /* variable, func, or typedef-that-is-c++-class. */
3980 else if (kind
< TYPES_DOMAIN
3981 || (kind
== TYPES_DOMAIN
3982 && SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
))
3984 type_print (SYMBOL_TYPE (sym
),
3985 (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
3986 ? "" : SYMBOL_PRINT_NAME (sym
)),
3989 printf_filtered (";\n");
3993 /* This help function for symtab_symbol_info() prints information
3994 for non-debugging symbols to gdb_stdout. */
3997 print_msymbol_info (struct bound_minimal_symbol msymbol
)
3999 struct gdbarch
*gdbarch
= get_objfile_arch (msymbol
.objfile
);
4002 if (gdbarch_addr_bit (gdbarch
) <= 32)
4003 tmp
= hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol
)
4004 & (CORE_ADDR
) 0xffffffff,
4007 tmp
= hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol
),
4009 printf_filtered ("%s %s\n",
4010 tmp
, MSYMBOL_PRINT_NAME (msymbol
.minsym
));
4013 /* This is the guts of the commands "info functions", "info types", and
4014 "info variables". It calls search_symbols to find all matches and then
4015 print_[m]symbol_info to print out some useful information about the
4019 symtab_symbol_info (char *regexp
, enum search_domain kind
, int from_tty
)
4021 static const char * const classnames
[] =
4022 {"variable", "function", "type"};
4023 struct symbol_search
*symbols
;
4024 struct symbol_search
*p
;
4025 struct cleanup
*old_chain
;
4026 const char *last_filename
= NULL
;
4029 gdb_assert (kind
<= TYPES_DOMAIN
);
4031 /* Must make sure that if we're interrupted, symbols gets freed. */
4032 search_symbols (regexp
, kind
, 0, NULL
, &symbols
);
4033 old_chain
= make_cleanup_free_search_symbols (&symbols
);
4036 printf_filtered (_("All %ss matching regular expression \"%s\":\n"),
4037 classnames
[kind
], regexp
);
4039 printf_filtered (_("All defined %ss:\n"), classnames
[kind
]);
4041 for (p
= symbols
; p
!= NULL
; p
= p
->next
)
4045 if (p
->msymbol
.minsym
!= NULL
)
4049 printf_filtered (_("\nNon-debugging symbols:\n"));
4052 print_msymbol_info (p
->msymbol
);
4056 print_symbol_info (kind
,
4061 last_filename
= symtab_to_filename_for_display (p
->symtab
);
4065 do_cleanups (old_chain
);
4069 variables_info (char *regexp
, int from_tty
)
4071 symtab_symbol_info (regexp
, VARIABLES_DOMAIN
, from_tty
);
4075 functions_info (char *regexp
, int from_tty
)
4077 symtab_symbol_info (regexp
, FUNCTIONS_DOMAIN
, from_tty
);
4082 types_info (char *regexp
, int from_tty
)
4084 symtab_symbol_info (regexp
, TYPES_DOMAIN
, from_tty
);
4087 /* Breakpoint all functions matching regular expression. */
4090 rbreak_command_wrapper (char *regexp
, int from_tty
)
4092 rbreak_command (regexp
, from_tty
);
4095 /* A cleanup function that calls end_rbreak_breakpoints. */
4098 do_end_rbreak_breakpoints (void *ignore
)
4100 end_rbreak_breakpoints ();
4104 rbreak_command (char *regexp
, int from_tty
)
4106 struct symbol_search
*ss
;
4107 struct symbol_search
*p
;
4108 struct cleanup
*old_chain
;
4109 char *string
= NULL
;
4111 const char **files
= NULL
;
4112 const char *file_name
;
4117 char *colon
= strchr (regexp
, ':');
4119 if (colon
&& *(colon
+ 1) != ':')
4124 colon_index
= colon
- regexp
;
4125 local_name
= alloca (colon_index
+ 1);
4126 memcpy (local_name
, regexp
, colon_index
);
4127 local_name
[colon_index
--] = 0;
4128 while (isspace (local_name
[colon_index
]))
4129 local_name
[colon_index
--] = 0;
4130 file_name
= local_name
;
4133 regexp
= skip_spaces (colon
+ 1);
4137 search_symbols (regexp
, FUNCTIONS_DOMAIN
, nfiles
, files
, &ss
);
4138 old_chain
= make_cleanup_free_search_symbols (&ss
);
4139 make_cleanup (free_current_contents
, &string
);
4141 start_rbreak_breakpoints ();
4142 make_cleanup (do_end_rbreak_breakpoints
, NULL
);
4143 for (p
= ss
; p
!= NULL
; p
= p
->next
)
4145 if (p
->msymbol
.minsym
== NULL
)
4147 const char *fullname
= symtab_to_fullname (p
->symtab
);
4149 int newlen
= (strlen (fullname
)
4150 + strlen (SYMBOL_LINKAGE_NAME (p
->symbol
))
4155 string
= xrealloc (string
, newlen
);
4158 strcpy (string
, fullname
);
4159 strcat (string
, ":'");
4160 strcat (string
, SYMBOL_LINKAGE_NAME (p
->symbol
));
4161 strcat (string
, "'");
4162 break_command (string
, from_tty
);
4163 print_symbol_info (FUNCTIONS_DOMAIN
,
4167 symtab_to_filename_for_display (p
->symtab
));
4171 int newlen
= (strlen (MSYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
)) + 3);
4175 string
= xrealloc (string
, newlen
);
4178 strcpy (string
, "'");
4179 strcat (string
, MSYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
));
4180 strcat (string
, "'");
4182 break_command (string
, from_tty
);
4183 printf_filtered ("<function, no debug info> %s;\n",
4184 MSYMBOL_PRINT_NAME (p
->msymbol
.minsym
));
4188 do_cleanups (old_chain
);
4192 /* Evaluate if NAME matches SYM_TEXT and SYM_TEXT_LEN.
4194 Either sym_text[sym_text_len] != '(' and then we search for any
4195 symbol starting with SYM_TEXT text.
4197 Otherwise sym_text[sym_text_len] == '(' and then we require symbol name to
4198 be terminated at that point. Partial symbol tables do not have parameters
4202 compare_symbol_name (const char *name
, const char *sym_text
, int sym_text_len
)
4204 int (*ncmp
) (const char *, const char *, size_t);
4206 ncmp
= (case_sensitivity
== case_sensitive_on
? strncmp
: strncasecmp
);
4208 if (ncmp (name
, sym_text
, sym_text_len
) != 0)
4211 if (sym_text
[sym_text_len
] == '(')
4213 /* User searches for `name(someth...'. Require NAME to be terminated.
4214 Normally psymtabs and gdbindex have no parameter types so '\0' will be
4215 present but accept even parameters presence. In this case this
4216 function is in fact strcmp_iw but whitespace skipping is not supported
4217 for tab completion. */
4219 if (name
[sym_text_len
] != '\0' && name
[sym_text_len
] != '(')
4226 /* Free any memory associated with a completion list. */
4229 free_completion_list (VEC (char_ptr
) **list_ptr
)
4234 for (i
= 0; VEC_iterate (char_ptr
, *list_ptr
, i
, p
); ++i
)
4236 VEC_free (char_ptr
, *list_ptr
);
4239 /* Callback for make_cleanup. */
4242 do_free_completion_list (void *list
)
4244 free_completion_list (list
);
4247 /* Helper routine for make_symbol_completion_list. */
4249 static VEC (char_ptr
) *return_val
;
4251 #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \
4252 completion_list_add_name \
4253 (SYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word))
4255 #define MCOMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \
4256 completion_list_add_name \
4257 (MSYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word))
4259 /* Test to see if the symbol specified by SYMNAME (which is already
4260 demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN
4261 characters. If so, add it to the current completion list. */
4264 completion_list_add_name (const char *symname
,
4265 const char *sym_text
, int sym_text_len
,
4266 const char *text
, const char *word
)
4268 /* Clip symbols that cannot match. */
4269 if (!compare_symbol_name (symname
, sym_text
, sym_text_len
))
4272 /* We have a match for a completion, so add SYMNAME to the current list
4273 of matches. Note that the name is moved to freshly malloc'd space. */
4278 if (word
== sym_text
)
4280 new = xmalloc (strlen (symname
) + 5);
4281 strcpy (new, symname
);
4283 else if (word
> sym_text
)
4285 /* Return some portion of symname. */
4286 new = xmalloc (strlen (symname
) + 5);
4287 strcpy (new, symname
+ (word
- sym_text
));
4291 /* Return some of SYM_TEXT plus symname. */
4292 new = xmalloc (strlen (symname
) + (sym_text
- word
) + 5);
4293 strncpy (new, word
, sym_text
- word
);
4294 new[sym_text
- word
] = '\0';
4295 strcat (new, symname
);
4298 VEC_safe_push (char_ptr
, return_val
, new);
4302 /* ObjC: In case we are completing on a selector, look as the msymbol
4303 again and feed all the selectors into the mill. */
4306 completion_list_objc_symbol (struct minimal_symbol
*msymbol
,
4307 const char *sym_text
, int sym_text_len
,
4308 const char *text
, const char *word
)
4310 static char *tmp
= NULL
;
4311 static unsigned int tmplen
= 0;
4313 const char *method
, *category
, *selector
;
4316 method
= MSYMBOL_NATURAL_NAME (msymbol
);
4318 /* Is it a method? */
4319 if ((method
[0] != '-') && (method
[0] != '+'))
4322 if (sym_text
[0] == '[')
4323 /* Complete on shortened method method. */
4324 completion_list_add_name (method
+ 1, sym_text
, sym_text_len
, text
, word
);
4326 while ((strlen (method
) + 1) >= tmplen
)
4332 tmp
= xrealloc (tmp
, tmplen
);
4334 selector
= strchr (method
, ' ');
4335 if (selector
!= NULL
)
4338 category
= strchr (method
, '(');
4340 if ((category
!= NULL
) && (selector
!= NULL
))
4342 memcpy (tmp
, method
, (category
- method
));
4343 tmp
[category
- method
] = ' ';
4344 memcpy (tmp
+ (category
- method
) + 1, selector
, strlen (selector
) + 1);
4345 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4346 if (sym_text
[0] == '[')
4347 completion_list_add_name (tmp
+ 1, sym_text
, sym_text_len
, text
, word
);
4350 if (selector
!= NULL
)
4352 /* Complete on selector only. */
4353 strcpy (tmp
, selector
);
4354 tmp2
= strchr (tmp
, ']');
4358 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4362 /* Break the non-quoted text based on the characters which are in
4363 symbols. FIXME: This should probably be language-specific. */
4366 language_search_unquoted_string (const char *text
, const char *p
)
4368 for (; p
> text
; --p
)
4370 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0')
4374 if ((current_language
->la_language
== language_objc
))
4376 if (p
[-1] == ':') /* Might be part of a method name. */
4378 else if (p
[-1] == '[' && (p
[-2] == '-' || p
[-2] == '+'))
4379 p
-= 2; /* Beginning of a method name. */
4380 else if (p
[-1] == ' ' || p
[-1] == '(' || p
[-1] == ')')
4381 { /* Might be part of a method name. */
4384 /* Seeing a ' ' or a '(' is not conclusive evidence
4385 that we are in the middle of a method name. However,
4386 finding "-[" or "+[" should be pretty un-ambiguous.
4387 Unfortunately we have to find it now to decide. */
4390 if (isalnum (t
[-1]) || t
[-1] == '_' ||
4391 t
[-1] == ' ' || t
[-1] == ':' ||
4392 t
[-1] == '(' || t
[-1] == ')')
4397 if (t
[-1] == '[' && (t
[-2] == '-' || t
[-2] == '+'))
4398 p
= t
- 2; /* Method name detected. */
4399 /* Else we leave with p unchanged. */
4409 completion_list_add_fields (struct symbol
*sym
, const char *sym_text
,
4410 int sym_text_len
, const char *text
,
4413 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4415 struct type
*t
= SYMBOL_TYPE (sym
);
4416 enum type_code c
= TYPE_CODE (t
);
4419 if (c
== TYPE_CODE_UNION
|| c
== TYPE_CODE_STRUCT
)
4420 for (j
= TYPE_N_BASECLASSES (t
); j
< TYPE_NFIELDS (t
); j
++)
4421 if (TYPE_FIELD_NAME (t
, j
))
4422 completion_list_add_name (TYPE_FIELD_NAME (t
, j
),
4423 sym_text
, sym_text_len
, text
, word
);
4427 /* Type of the user_data argument passed to add_macro_name or
4428 symbol_completion_matcher. The contents are simply whatever is
4429 needed by completion_list_add_name. */
4430 struct add_name_data
4432 const char *sym_text
;
4438 /* A callback used with macro_for_each and macro_for_each_in_scope.
4439 This adds a macro's name to the current completion list. */
4442 add_macro_name (const char *name
, const struct macro_definition
*ignore
,
4443 struct macro_source_file
*ignore2
, int ignore3
,
4446 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4448 completion_list_add_name (name
,
4449 datum
->sym_text
, datum
->sym_text_len
,
4450 datum
->text
, datum
->word
);
4453 /* A callback for expand_symtabs_matching. */
4456 symbol_completion_matcher (const char *name
, void *user_data
)
4458 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4460 return compare_symbol_name (name
, datum
->sym_text
, datum
->sym_text_len
);
4464 default_make_symbol_completion_list_break_on (const char *text
,
4466 const char *break_on
,
4467 enum type_code code
)
4469 /* Problem: All of the symbols have to be copied because readline
4470 frees them. I'm not going to worry about this; hopefully there
4471 won't be that many. */
4475 struct minimal_symbol
*msymbol
;
4476 struct objfile
*objfile
;
4477 const struct block
*b
;
4478 const struct block
*surrounding_static_block
, *surrounding_global_block
;
4479 struct block_iterator iter
;
4480 /* The symbol we are completing on. Points in same buffer as text. */
4481 const char *sym_text
;
4482 /* Length of sym_text. */
4484 struct add_name_data datum
;
4485 struct cleanup
*back_to
;
4487 /* Now look for the symbol we are supposed to complete on. */
4491 const char *quote_pos
= NULL
;
4493 /* First see if this is a quoted string. */
4495 for (p
= text
; *p
!= '\0'; ++p
)
4497 if (quote_found
!= '\0')
4499 if (*p
== quote_found
)
4500 /* Found close quote. */
4502 else if (*p
== '\\' && p
[1] == quote_found
)
4503 /* A backslash followed by the quote character
4504 doesn't end the string. */
4507 else if (*p
== '\'' || *p
== '"')
4513 if (quote_found
== '\'')
4514 /* A string within single quotes can be a symbol, so complete on it. */
4515 sym_text
= quote_pos
+ 1;
4516 else if (quote_found
== '"')
4517 /* A double-quoted string is never a symbol, nor does it make sense
4518 to complete it any other way. */
4524 /* It is not a quoted string. Break it based on the characters
4525 which are in symbols. */
4528 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0'
4529 || p
[-1] == ':' || strchr (break_on
, p
[-1]) != NULL
)
4538 sym_text_len
= strlen (sym_text
);
4540 /* Prepare SYM_TEXT_LEN for compare_symbol_name. */
4542 if (current_language
->la_language
== language_cplus
4543 || current_language
->la_language
== language_java
4544 || current_language
->la_language
== language_fortran
)
4546 /* These languages may have parameters entered by user but they are never
4547 present in the partial symbol tables. */
4549 const char *cs
= memchr (sym_text
, '(', sym_text_len
);
4552 sym_text_len
= cs
- sym_text
;
4554 gdb_assert (sym_text
[sym_text_len
] == '\0' || sym_text
[sym_text_len
] == '(');
4557 back_to
= make_cleanup (do_free_completion_list
, &return_val
);
4559 datum
.sym_text
= sym_text
;
4560 datum
.sym_text_len
= sym_text_len
;
4564 /* Look through the partial symtabs for all symbols which begin
4565 by matching SYM_TEXT. Expand all CUs that you find to the list.
4566 The real names will get added by COMPLETION_LIST_ADD_SYMBOL below. */
4567 expand_symtabs_matching (NULL
, symbol_completion_matcher
, ALL_DOMAIN
,
4570 /* At this point scan through the misc symbol vectors and add each
4571 symbol you find to the list. Eventually we want to ignore
4572 anything that isn't a text symbol (everything else will be
4573 handled by the psymtab code above). */
4575 if (code
== TYPE_CODE_UNDEF
)
4577 ALL_MSYMBOLS (objfile
, msymbol
)
4580 MCOMPLETION_LIST_ADD_SYMBOL (msymbol
, sym_text
, sym_text_len
, text
,
4583 completion_list_objc_symbol (msymbol
, sym_text
, sym_text_len
, text
,
4588 /* Search upwards from currently selected frame (so that we can
4589 complete on local vars). Also catch fields of types defined in
4590 this places which match our text string. Only complete on types
4591 visible from current context. */
4593 b
= get_selected_block (0);
4594 surrounding_static_block
= block_static_block (b
);
4595 surrounding_global_block
= block_global_block (b
);
4596 if (surrounding_static_block
!= NULL
)
4597 while (b
!= surrounding_static_block
)
4601 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4603 if (code
== TYPE_CODE_UNDEF
)
4605 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4607 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
,
4610 else if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4611 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
)
4612 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4616 /* Stop when we encounter an enclosing function. Do not stop for
4617 non-inlined functions - the locals of the enclosing function
4618 are in scope for a nested function. */
4619 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
4621 b
= BLOCK_SUPERBLOCK (b
);
4624 /* Add fields from the file's types; symbols will be added below. */
4626 if (code
== TYPE_CODE_UNDEF
)
4628 if (surrounding_static_block
!= NULL
)
4629 ALL_BLOCK_SYMBOLS (surrounding_static_block
, iter
, sym
)
4630 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4632 if (surrounding_global_block
!= NULL
)
4633 ALL_BLOCK_SYMBOLS (surrounding_global_block
, iter
, sym
)
4634 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4637 /* Go through the symtabs and check the externs and statics for
4638 symbols which match. */
4640 ALL_PRIMARY_SYMTABS (objfile
, s
)
4643 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4644 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4646 if (code
== TYPE_CODE_UNDEF
4647 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4648 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4649 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4653 ALL_PRIMARY_SYMTABS (objfile
, s
)
4656 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4657 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4659 if (code
== TYPE_CODE_UNDEF
4660 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4661 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4662 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4666 /* Skip macros if we are completing a struct tag -- arguable but
4667 usually what is expected. */
4668 if (current_language
->la_macro_expansion
== macro_expansion_c
4669 && code
== TYPE_CODE_UNDEF
)
4671 struct macro_scope
*scope
;
4673 /* Add any macros visible in the default scope. Note that this
4674 may yield the occasional wrong result, because an expression
4675 might be evaluated in a scope other than the default. For
4676 example, if the user types "break file:line if <TAB>", the
4677 resulting expression will be evaluated at "file:line" -- but
4678 at there does not seem to be a way to detect this at
4680 scope
= default_macro_scope ();
4683 macro_for_each_in_scope (scope
->file
, scope
->line
,
4684 add_macro_name
, &datum
);
4688 /* User-defined macros are always visible. */
4689 macro_for_each (macro_user_macros
, add_macro_name
, &datum
);
4692 discard_cleanups (back_to
);
4693 return (return_val
);
4697 default_make_symbol_completion_list (const char *text
, const char *word
,
4698 enum type_code code
)
4700 return default_make_symbol_completion_list_break_on (text
, word
, "", code
);
4703 /* Return a vector of all symbols (regardless of class) which begin by
4704 matching TEXT. If the answer is no symbols, then the return value
4708 make_symbol_completion_list (const char *text
, const char *word
)
4710 return current_language
->la_make_symbol_completion_list (text
, word
,
4714 /* Like make_symbol_completion_list, but only return STRUCT_DOMAIN
4715 symbols whose type code is CODE. */
4718 make_symbol_completion_type (const char *text
, const char *word
,
4719 enum type_code code
)
4721 gdb_assert (code
== TYPE_CODE_UNION
4722 || code
== TYPE_CODE_STRUCT
4723 || code
== TYPE_CODE_CLASS
4724 || code
== TYPE_CODE_ENUM
);
4725 return current_language
->la_make_symbol_completion_list (text
, word
, code
);
4728 /* Like make_symbol_completion_list, but suitable for use as a
4729 completion function. */
4732 make_symbol_completion_list_fn (struct cmd_list_element
*ignore
,
4733 const char *text
, const char *word
)
4735 return make_symbol_completion_list (text
, word
);
4738 /* Like make_symbol_completion_list, but returns a list of symbols
4739 defined in a source file FILE. */
4742 make_file_symbol_completion_list (const char *text
, const char *word
,
4743 const char *srcfile
)
4748 struct block_iterator iter
;
4749 /* The symbol we are completing on. Points in same buffer as text. */
4750 const char *sym_text
;
4751 /* Length of sym_text. */
4754 /* Now look for the symbol we are supposed to complete on.
4755 FIXME: This should be language-specific. */
4759 const char *quote_pos
= NULL
;
4761 /* First see if this is a quoted string. */
4763 for (p
= text
; *p
!= '\0'; ++p
)
4765 if (quote_found
!= '\0')
4767 if (*p
== quote_found
)
4768 /* Found close quote. */
4770 else if (*p
== '\\' && p
[1] == quote_found
)
4771 /* A backslash followed by the quote character
4772 doesn't end the string. */
4775 else if (*p
== '\'' || *p
== '"')
4781 if (quote_found
== '\'')
4782 /* A string within single quotes can be a symbol, so complete on it. */
4783 sym_text
= quote_pos
+ 1;
4784 else if (quote_found
== '"')
4785 /* A double-quoted string is never a symbol, nor does it make sense
4786 to complete it any other way. */
4792 /* Not a quoted string. */
4793 sym_text
= language_search_unquoted_string (text
, p
);
4797 sym_text_len
= strlen (sym_text
);
4801 /* Find the symtab for SRCFILE (this loads it if it was not yet read
4803 s
= lookup_symtab (srcfile
);
4806 /* Maybe they typed the file with leading directories, while the
4807 symbol tables record only its basename. */
4808 const char *tail
= lbasename (srcfile
);
4811 s
= lookup_symtab (tail
);
4814 /* If we have no symtab for that file, return an empty list. */
4816 return (return_val
);
4818 /* Go through this symtab and check the externs and statics for
4819 symbols which match. */
4821 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4822 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4824 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4827 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4828 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4830 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4833 return (return_val
);
4836 /* A helper function for make_source_files_completion_list. It adds
4837 another file name to a list of possible completions, growing the
4838 list as necessary. */
4841 add_filename_to_list (const char *fname
, const char *text
, const char *word
,
4842 VEC (char_ptr
) **list
)
4845 size_t fnlen
= strlen (fname
);
4849 /* Return exactly fname. */
4850 new = xmalloc (fnlen
+ 5);
4851 strcpy (new, fname
);
4853 else if (word
> text
)
4855 /* Return some portion of fname. */
4856 new = xmalloc (fnlen
+ 5);
4857 strcpy (new, fname
+ (word
- text
));
4861 /* Return some of TEXT plus fname. */
4862 new = xmalloc (fnlen
+ (text
- word
) + 5);
4863 strncpy (new, word
, text
- word
);
4864 new[text
- word
] = '\0';
4865 strcat (new, fname
);
4867 VEC_safe_push (char_ptr
, *list
, new);
4871 not_interesting_fname (const char *fname
)
4873 static const char *illegal_aliens
[] = {
4874 "_globals_", /* inserted by coff_symtab_read */
4879 for (i
= 0; illegal_aliens
[i
]; i
++)
4881 if (filename_cmp (fname
, illegal_aliens
[i
]) == 0)
4887 /* An object of this type is passed as the user_data argument to
4888 map_partial_symbol_filenames. */
4889 struct add_partial_filename_data
4891 struct filename_seen_cache
*filename_seen_cache
;
4895 VEC (char_ptr
) **list
;
4898 /* A callback for map_partial_symbol_filenames. */
4901 maybe_add_partial_symtab_filename (const char *filename
, const char *fullname
,
4904 struct add_partial_filename_data
*data
= user_data
;
4906 if (not_interesting_fname (filename
))
4908 if (!filename_seen (data
->filename_seen_cache
, filename
, 1)
4909 && filename_ncmp (filename
, data
->text
, data
->text_len
) == 0)
4911 /* This file matches for a completion; add it to the
4912 current list of matches. */
4913 add_filename_to_list (filename
, data
->text
, data
->word
, data
->list
);
4917 const char *base_name
= lbasename (filename
);
4919 if (base_name
!= filename
4920 && !filename_seen (data
->filename_seen_cache
, base_name
, 1)
4921 && filename_ncmp (base_name
, data
->text
, data
->text_len
) == 0)
4922 add_filename_to_list (base_name
, data
->text
, data
->word
, data
->list
);
4926 /* Return a vector of all source files whose names begin with matching
4927 TEXT. The file names are looked up in the symbol tables of this
4928 program. If the answer is no matchess, then the return value is
4932 make_source_files_completion_list (const char *text
, const char *word
)
4935 struct objfile
*objfile
;
4936 size_t text_len
= strlen (text
);
4937 VEC (char_ptr
) *list
= NULL
;
4938 const char *base_name
;
4939 struct add_partial_filename_data datum
;
4940 struct filename_seen_cache
*filename_seen_cache
;
4941 struct cleanup
*back_to
, *cache_cleanup
;
4943 if (!have_full_symbols () && !have_partial_symbols ())
4946 back_to
= make_cleanup (do_free_completion_list
, &list
);
4948 filename_seen_cache
= create_filename_seen_cache ();
4949 cache_cleanup
= make_cleanup (delete_filename_seen_cache
,
4950 filename_seen_cache
);
4952 ALL_SYMTABS (objfile
, s
)
4954 if (not_interesting_fname (s
->filename
))
4956 if (!filename_seen (filename_seen_cache
, s
->filename
, 1)
4957 && filename_ncmp (s
->filename
, text
, text_len
) == 0)
4959 /* This file matches for a completion; add it to the current
4961 add_filename_to_list (s
->filename
, text
, word
, &list
);
4965 /* NOTE: We allow the user to type a base name when the
4966 debug info records leading directories, but not the other
4967 way around. This is what subroutines of breakpoint
4968 command do when they parse file names. */
4969 base_name
= lbasename (s
->filename
);
4970 if (base_name
!= s
->filename
4971 && !filename_seen (filename_seen_cache
, base_name
, 1)
4972 && filename_ncmp (base_name
, text
, text_len
) == 0)
4973 add_filename_to_list (base_name
, text
, word
, &list
);
4977 datum
.filename_seen_cache
= filename_seen_cache
;
4980 datum
.text_len
= text_len
;
4982 map_symbol_filenames (maybe_add_partial_symtab_filename
, &datum
,
4983 0 /*need_fullname*/);
4985 do_cleanups (cache_cleanup
);
4986 discard_cleanups (back_to
);
4993 /* Return the "main_info" object for the current program space. If
4994 the object has not yet been created, create it and fill in some
4997 static struct main_info
*
4998 get_main_info (void)
5000 struct main_info
*info
= program_space_data (current_program_space
,
5001 main_progspace_key
);
5005 /* It may seem strange to store the main name in the progspace
5006 and also in whatever objfile happens to see a main name in
5007 its debug info. The reason for this is mainly historical:
5008 gdb returned "main" as the name even if no function named
5009 "main" was defined the program; and this approach lets us
5010 keep compatibility. */
5011 info
= XCNEW (struct main_info
);
5012 info
->language_of_main
= language_unknown
;
5013 set_program_space_data (current_program_space
, main_progspace_key
,
5020 /* A cleanup to destroy a struct main_info when a progspace is
5024 main_info_cleanup (struct program_space
*pspace
, void *data
)
5026 struct main_info
*info
= data
;
5029 xfree (info
->name_of_main
);
5034 set_main_name (const char *name
, enum language lang
)
5036 struct main_info
*info
= get_main_info ();
5038 if (info
->name_of_main
!= NULL
)
5040 xfree (info
->name_of_main
);
5041 info
->name_of_main
= NULL
;
5042 info
->language_of_main
= language_unknown
;
5046 info
->name_of_main
= xstrdup (name
);
5047 info
->language_of_main
= lang
;
5051 /* Deduce the name of the main procedure, and set NAME_OF_MAIN
5055 find_main_name (void)
5057 const char *new_main_name
;
5058 struct objfile
*objfile
;
5060 /* First check the objfiles to see whether a debuginfo reader has
5061 picked up the appropriate main name. Historically the main name
5062 was found in a more or less random way; this approach instead
5063 relies on the order of objfile creation -- which still isn't
5064 guaranteed to get the correct answer, but is just probably more
5066 ALL_OBJFILES (objfile
)
5068 if (objfile
->per_bfd
->name_of_main
!= NULL
)
5070 set_main_name (objfile
->per_bfd
->name_of_main
,
5071 objfile
->per_bfd
->language_of_main
);
5076 /* Try to see if the main procedure is in Ada. */
5077 /* FIXME: brobecker/2005-03-07: Another way of doing this would
5078 be to add a new method in the language vector, and call this
5079 method for each language until one of them returns a non-empty
5080 name. This would allow us to remove this hard-coded call to
5081 an Ada function. It is not clear that this is a better approach
5082 at this point, because all methods need to be written in a way
5083 such that false positives never be returned. For instance, it is
5084 important that a method does not return a wrong name for the main
5085 procedure if the main procedure is actually written in a different
5086 language. It is easy to guaranty this with Ada, since we use a
5087 special symbol generated only when the main in Ada to find the name
5088 of the main procedure. It is difficult however to see how this can
5089 be guarantied for languages such as C, for instance. This suggests
5090 that order of call for these methods becomes important, which means
5091 a more complicated approach. */
5092 new_main_name
= ada_main_name ();
5093 if (new_main_name
!= NULL
)
5095 set_main_name (new_main_name
, language_ada
);
5099 new_main_name
= d_main_name ();
5100 if (new_main_name
!= NULL
)
5102 set_main_name (new_main_name
, language_d
);
5106 new_main_name
= go_main_name ();
5107 if (new_main_name
!= NULL
)
5109 set_main_name (new_main_name
, language_go
);
5113 new_main_name
= pascal_main_name ();
5114 if (new_main_name
!= NULL
)
5116 set_main_name (new_main_name
, language_pascal
);
5120 /* The languages above didn't identify the name of the main procedure.
5121 Fallback to "main". */
5122 set_main_name ("main", language_unknown
);
5128 struct main_info
*info
= get_main_info ();
5130 if (info
->name_of_main
== NULL
)
5133 return info
->name_of_main
;
5136 /* Return the language of the main function. If it is not known,
5137 return language_unknown. */
5140 main_language (void)
5142 struct main_info
*info
= get_main_info ();
5144 if (info
->name_of_main
== NULL
)
5147 return info
->language_of_main
;
5150 /* Handle ``executable_changed'' events for the symtab module. */
5153 symtab_observer_executable_changed (void)
5155 /* NAME_OF_MAIN may no longer be the same, so reset it for now. */
5156 set_main_name (NULL
, language_unknown
);
5159 /* Return 1 if the supplied producer string matches the ARM RealView
5160 compiler (armcc). */
5163 producer_is_realview (const char *producer
)
5165 static const char *const arm_idents
[] = {
5166 "ARM C Compiler, ADS",
5167 "Thumb C Compiler, ADS",
5168 "ARM C++ Compiler, ADS",
5169 "Thumb C++ Compiler, ADS",
5170 "ARM/Thumb C/C++ Compiler, RVCT",
5171 "ARM C/C++ Compiler, RVCT"
5175 if (producer
== NULL
)
5178 for (i
= 0; i
< ARRAY_SIZE (arm_idents
); i
++)
5179 if (strncmp (producer
, arm_idents
[i
], strlen (arm_idents
[i
])) == 0)
5187 /* The next index to hand out in response to a registration request. */
5189 static int next_aclass_value
= LOC_FINAL_VALUE
;
5191 /* The maximum number of "aclass" registrations we support. This is
5192 constant for convenience. */
5193 #define MAX_SYMBOL_IMPLS (LOC_FINAL_VALUE + 10)
5195 /* The objects representing the various "aclass" values. The elements
5196 from 0 up to LOC_FINAL_VALUE-1 represent themselves, and subsequent
5197 elements are those registered at gdb initialization time. */
5199 static struct symbol_impl symbol_impl
[MAX_SYMBOL_IMPLS
];
5201 /* The globally visible pointer. This is separate from 'symbol_impl'
5202 so that it can be const. */
5204 const struct symbol_impl
*symbol_impls
= &symbol_impl
[0];
5206 /* Make sure we saved enough room in struct symbol. */
5208 gdb_static_assert (MAX_SYMBOL_IMPLS
<= (1 << SYMBOL_ACLASS_BITS
));
5210 /* Register a computed symbol type. ACLASS must be LOC_COMPUTED. OPS
5211 is the ops vector associated with this index. This returns the new
5212 index, which should be used as the aclass_index field for symbols
5216 register_symbol_computed_impl (enum address_class aclass
,
5217 const struct symbol_computed_ops
*ops
)
5219 int result
= next_aclass_value
++;
5221 gdb_assert (aclass
== LOC_COMPUTED
);
5222 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5223 symbol_impl
[result
].aclass
= aclass
;
5224 symbol_impl
[result
].ops_computed
= ops
;
5226 /* Sanity check OPS. */
5227 gdb_assert (ops
!= NULL
);
5228 gdb_assert (ops
->tracepoint_var_ref
!= NULL
);
5229 gdb_assert (ops
->describe_location
!= NULL
);
5230 gdb_assert (ops
->read_needs_frame
!= NULL
);
5231 gdb_assert (ops
->read_variable
!= NULL
);
5236 /* Register a function with frame base type. ACLASS must be LOC_BLOCK.
5237 OPS is the ops vector associated with this index. This returns the
5238 new index, which should be used as the aclass_index field for symbols
5242 register_symbol_block_impl (enum address_class aclass
,
5243 const struct symbol_block_ops
*ops
)
5245 int result
= next_aclass_value
++;
5247 gdb_assert (aclass
== LOC_BLOCK
);
5248 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5249 symbol_impl
[result
].aclass
= aclass
;
5250 symbol_impl
[result
].ops_block
= ops
;
5252 /* Sanity check OPS. */
5253 gdb_assert (ops
!= NULL
);
5254 gdb_assert (ops
->find_frame_base_location
!= NULL
);
5259 /* Register a register symbol type. ACLASS must be LOC_REGISTER or
5260 LOC_REGPARM_ADDR. OPS is the register ops vector associated with
5261 this index. This returns the new index, which should be used as
5262 the aclass_index field for symbols of this type. */
5265 register_symbol_register_impl (enum address_class aclass
,
5266 const struct symbol_register_ops
*ops
)
5268 int result
= next_aclass_value
++;
5270 gdb_assert (aclass
== LOC_REGISTER
|| aclass
== LOC_REGPARM_ADDR
);
5271 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5272 symbol_impl
[result
].aclass
= aclass
;
5273 symbol_impl
[result
].ops_register
= ops
;
5278 /* Initialize elements of 'symbol_impl' for the constants in enum
5282 initialize_ordinary_address_classes (void)
5286 for (i
= 0; i
< LOC_FINAL_VALUE
; ++i
)
5287 symbol_impl
[i
].aclass
= i
;
5292 /* Initialize the symbol SYM. */
5295 initialize_symbol (struct symbol
*sym
)
5297 memset (sym
, 0, sizeof (*sym
));
5298 SYMBOL_SECTION (sym
) = -1;
5301 /* Allocate and initialize a new 'struct symbol' on OBJFILE's
5305 allocate_symbol (struct objfile
*objfile
)
5307 struct symbol
*result
;
5309 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct symbol
);
5310 SYMBOL_SECTION (result
) = -1;
5315 /* Allocate and initialize a new 'struct template_symbol' on OBJFILE's
5318 struct template_symbol
*
5319 allocate_template_symbol (struct objfile
*objfile
)
5321 struct template_symbol
*result
;
5323 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct template_symbol
);
5324 SYMBOL_SECTION (&result
->base
) = -1;
5332 _initialize_symtab (void)
5334 initialize_ordinary_address_classes ();
5337 = register_program_space_data_with_cleanup (NULL
, main_info_cleanup
);
5339 add_info ("variables", variables_info
, _("\
5340 All global and static variable names, or those matching REGEXP."));
5342 add_com ("whereis", class_info
, variables_info
, _("\
5343 All global and static variable names, or those matching REGEXP."));
5345 add_info ("functions", functions_info
,
5346 _("All function names, or those matching REGEXP."));
5348 /* FIXME: This command has at least the following problems:
5349 1. It prints builtin types (in a very strange and confusing fashion).
5350 2. It doesn't print right, e.g. with
5351 typedef struct foo *FOO
5352 type_print prints "FOO" when we want to make it (in this situation)
5353 print "struct foo *".
5354 I also think "ptype" or "whatis" is more likely to be useful (but if
5355 there is much disagreement "info types" can be fixed). */
5356 add_info ("types", types_info
,
5357 _("All type names, or those matching REGEXP."));
5359 add_info ("sources", sources_info
,
5360 _("Source files in the program."));
5362 add_com ("rbreak", class_breakpoint
, rbreak_command
,
5363 _("Set a breakpoint for all functions matching REGEXP."));
5367 add_com ("lf", class_info
, sources_info
,
5368 _("Source files in the program"));
5369 add_com ("lg", class_info
, variables_info
, _("\
5370 All global and static variable names, or those matching REGEXP."));
5373 add_setshow_enum_cmd ("multiple-symbols", no_class
,
5374 multiple_symbols_modes
, &multiple_symbols_mode
,
5376 Set the debugger behavior when more than one symbol are possible matches\n\
5377 in an expression."), _("\
5378 Show how the debugger handles ambiguities in expressions."), _("\
5379 Valid values are \"ask\", \"all\", \"cancel\", and the default is \"all\"."),
5380 NULL
, NULL
, &setlist
, &showlist
);
5382 add_setshow_boolean_cmd ("basenames-may-differ", class_obscure
,
5383 &basenames_may_differ
, _("\
5384 Set whether a source file may have multiple base names."), _("\
5385 Show whether a source file may have multiple base names."), _("\
5386 (A \"base name\" is the name of a file with the directory part removed.\n\
5387 Example: The base name of \"/home/user/hello.c\" is \"hello.c\".)\n\
5388 If set, GDB will canonicalize file names (e.g., expand symlinks)\n\
5389 before comparing them. Canonicalization is an expensive operation,\n\
5390 but it allows the same file be known by more than one base name.\n\
5391 If not set (the default), all source files are assumed to have just\n\
5392 one base name, and gdb will do file name comparisons more efficiently."),
5394 &setlist
, &showlist
);
5396 add_setshow_zuinteger_cmd ("symtab-create", no_class
, &symtab_create_debug
,
5397 _("Set debugging of symbol table creation."),
5398 _("Show debugging of symbol table creation."), _("\
5399 When enabled (non-zero), debugging messages are printed when building\n\
5400 symbol tables. A value of 1 (one) normally provides enough information.\n\
5401 A value greater than 1 provides more verbose information."),
5404 &setdebuglist
, &showdebuglist
);
5406 observer_attach_executable_changed (symtab_observer_executable_changed
);