1 /* Symbol table lookup for the GNU debugger, GDB.
3 Copyright (C) 1986-2013 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>
53 #include "gdb_string.h"
57 #include "cp-support.h"
59 #include "gdb_assert.h"
62 #include "macroscope.h"
65 #include "parser-defs.h"
67 /* Prototypes for local functions */
69 static void rbreak_command (char *, int);
71 static void types_info (char *, int);
73 static void functions_info (char *, int);
75 static void variables_info (char *, int);
77 static void sources_info (char *, int);
79 static int find_line_common (struct linetable
*, int, int *, int);
81 static struct symbol
*lookup_symbol_aux (const char *name
,
82 const struct block
*block
,
83 const domain_enum domain
,
84 enum language language
,
85 struct field_of_this_result
*is_a_field_of_this
);
88 struct symbol
*lookup_symbol_aux_local (const char *name
,
89 const struct block
*block
,
90 const domain_enum domain
,
91 enum language language
);
94 struct symbol
*lookup_symbol_aux_symtabs (int block_index
,
96 const domain_enum domain
);
99 struct symbol
*lookup_symbol_aux_quick (struct objfile
*objfile
,
102 const domain_enum domain
);
104 void _initialize_symtab (void);
108 /* When non-zero, print debugging messages related to symtab creation. */
109 int symtab_create_debug
= 0;
111 /* Non-zero if a file may be known by two different basenames.
112 This is the uncommon case, and significantly slows down gdb.
113 Default set to "off" to not slow down the common case. */
114 int basenames_may_differ
= 0;
116 /* Allow the user to configure the debugger behavior with respect
117 to multiple-choice menus when more than one symbol matches during
120 const char multiple_symbols_ask
[] = "ask";
121 const char multiple_symbols_all
[] = "all";
122 const char multiple_symbols_cancel
[] = "cancel";
123 static const char *const multiple_symbols_modes
[] =
125 multiple_symbols_ask
,
126 multiple_symbols_all
,
127 multiple_symbols_cancel
,
130 static const char *multiple_symbols_mode
= multiple_symbols_all
;
132 /* Read-only accessor to AUTO_SELECT_MODE. */
135 multiple_symbols_select_mode (void)
137 return multiple_symbols_mode
;
140 /* Block in which the most recently searched-for symbol was found.
141 Might be better to make this a parameter to lookup_symbol and
144 const struct block
*block_found
;
146 /* Return the name of a domain_enum. */
149 domain_name (domain_enum e
)
153 case UNDEF_DOMAIN
: return "UNDEF_DOMAIN";
154 case VAR_DOMAIN
: return "VAR_DOMAIN";
155 case STRUCT_DOMAIN
: return "STRUCT_DOMAIN";
156 case LABEL_DOMAIN
: return "LABEL_DOMAIN";
157 case COMMON_BLOCK_DOMAIN
: return "COMMON_BLOCK_DOMAIN";
158 default: gdb_assert_not_reached ("bad domain_enum");
162 /* Return the name of a search_domain . */
165 search_domain_name (enum search_domain e
)
169 case VARIABLES_DOMAIN
: return "VARIABLES_DOMAIN";
170 case FUNCTIONS_DOMAIN
: return "FUNCTIONS_DOMAIN";
171 case TYPES_DOMAIN
: return "TYPES_DOMAIN";
172 case ALL_DOMAIN
: return "ALL_DOMAIN";
173 default: gdb_assert_not_reached ("bad search_domain");
177 /* See whether FILENAME matches SEARCH_NAME using the rule that we
178 advertise to the user. (The manual's description of linespecs
179 describes what we advertise). Returns true if they match, false
183 compare_filenames_for_search (const char *filename
, const char *search_name
)
185 int len
= strlen (filename
);
186 size_t search_len
= strlen (search_name
);
188 if (len
< search_len
)
191 /* The tail of FILENAME must match. */
192 if (FILENAME_CMP (filename
+ len
- search_len
, search_name
) != 0)
195 /* Either the names must completely match, or the character
196 preceding the trailing SEARCH_NAME segment of FILENAME must be a
199 The check !IS_ABSOLUTE_PATH ensures SEARCH_NAME "/dir/file.c"
200 cannot match FILENAME "/path//dir/file.c" - as user has requested
201 absolute path. The sama applies for "c:\file.c" possibly
202 incorrectly hypothetically matching "d:\dir\c:\file.c".
204 The HAS_DRIVE_SPEC purpose is to make FILENAME "c:file.c"
205 compatible with SEARCH_NAME "file.c". In such case a compiler had
206 to put the "c:file.c" name into debug info. Such compatibility
207 works only on GDB built for DOS host. */
208 return (len
== search_len
209 || (!IS_ABSOLUTE_PATH (search_name
)
210 && IS_DIR_SEPARATOR (filename
[len
- search_len
- 1]))
211 || (HAS_DRIVE_SPEC (filename
)
212 && STRIP_DRIVE_SPEC (filename
) == &filename
[len
- search_len
]));
215 /* Check for a symtab of a specific name by searching some symtabs.
216 This is a helper function for callbacks of iterate_over_symtabs.
218 If NAME is not absolute, then REAL_PATH is NULL
219 If NAME is absolute, then REAL_PATH is the gdb_realpath form of NAME.
221 The return value, NAME, REAL_PATH, CALLBACK, and DATA
222 are identical to the `map_symtabs_matching_filename' method of
223 quick_symbol_functions.
225 FIRST and AFTER_LAST indicate the range of symtabs to search.
226 AFTER_LAST is one past the last symtab to search; NULL means to
227 search until the end of the list. */
230 iterate_over_some_symtabs (const char *name
,
231 const char *real_path
,
232 int (*callback
) (struct symtab
*symtab
,
235 struct symtab
*first
,
236 struct symtab
*after_last
)
238 struct symtab
*s
= NULL
;
239 const char* base_name
= lbasename (name
);
241 for (s
= first
; s
!= NULL
&& s
!= after_last
; s
= s
->next
)
243 if (compare_filenames_for_search (s
->filename
, name
))
245 if (callback (s
, data
))
250 /* Before we invoke realpath, which can get expensive when many
251 files are involved, do a quick comparison of the basenames. */
252 if (! basenames_may_differ
253 && FILENAME_CMP (base_name
, lbasename (s
->filename
)) != 0)
256 if (compare_filenames_for_search (symtab_to_fullname (s
), name
))
258 if (callback (s
, data
))
263 /* If the user gave us an absolute path, try to find the file in
264 this symtab and use its absolute path. */
265 if (real_path
!= NULL
)
267 const char *fullname
= symtab_to_fullname (s
);
269 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
270 gdb_assert (IS_ABSOLUTE_PATH (name
));
271 if (FILENAME_CMP (real_path
, fullname
) == 0)
273 if (callback (s
, data
))
283 /* Check for a symtab of a specific name; first in symtabs, then in
284 psymtabs. *If* there is no '/' in the name, a match after a '/'
285 in the symtab filename will also work.
287 Calls CALLBACK with each symtab that is found and with the supplied
288 DATA. If CALLBACK returns true, the search stops. */
291 iterate_over_symtabs (const char *name
,
292 int (*callback
) (struct symtab
*symtab
,
296 struct objfile
*objfile
;
297 char *real_path
= NULL
;
298 struct cleanup
*cleanups
= make_cleanup (null_cleanup
, NULL
);
300 /* Here we are interested in canonicalizing an absolute path, not
301 absolutizing a relative path. */
302 if (IS_ABSOLUTE_PATH (name
))
304 real_path
= gdb_realpath (name
);
305 make_cleanup (xfree
, real_path
);
306 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
309 ALL_OBJFILES (objfile
)
311 if (iterate_over_some_symtabs (name
, real_path
, callback
, data
,
312 objfile
->symtabs
, NULL
))
314 do_cleanups (cleanups
);
319 /* Same search rules as above apply here, but now we look thru the
322 ALL_OBJFILES (objfile
)
325 && objfile
->sf
->qf
->map_symtabs_matching_filename (objfile
,
331 do_cleanups (cleanups
);
336 do_cleanups (cleanups
);
339 /* The callback function used by lookup_symtab. */
342 lookup_symtab_callback (struct symtab
*symtab
, void *data
)
344 struct symtab
**result_ptr
= data
;
346 *result_ptr
= symtab
;
350 /* A wrapper for iterate_over_symtabs that returns the first matching
354 lookup_symtab (const char *name
)
356 struct symtab
*result
= NULL
;
358 iterate_over_symtabs (name
, lookup_symtab_callback
, &result
);
363 /* Mangle a GDB method stub type. This actually reassembles the pieces of the
364 full method name, which consist of the class name (from T), the unadorned
365 method name from METHOD_ID, and the signature for the specific overload,
366 specified by SIGNATURE_ID. Note that this function is g++ specific. */
369 gdb_mangle_name (struct type
*type
, int method_id
, int signature_id
)
371 int mangled_name_len
;
373 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, method_id
);
374 struct fn_field
*method
= &f
[signature_id
];
375 const char *field_name
= TYPE_FN_FIELDLIST_NAME (type
, method_id
);
376 const char *physname
= TYPE_FN_FIELD_PHYSNAME (f
, signature_id
);
377 const char *newname
= type_name_no_tag (type
);
379 /* Does the form of physname indicate that it is the full mangled name
380 of a constructor (not just the args)? */
381 int is_full_physname_constructor
;
384 int is_destructor
= is_destructor_name (physname
);
385 /* Need a new type prefix. */
386 char *const_prefix
= method
->is_const
? "C" : "";
387 char *volatile_prefix
= method
->is_volatile
? "V" : "";
389 int len
= (newname
== NULL
? 0 : strlen (newname
));
391 /* Nothing to do if physname already contains a fully mangled v3 abi name
392 or an operator name. */
393 if ((physname
[0] == '_' && physname
[1] == 'Z')
394 || is_operator_name (field_name
))
395 return xstrdup (physname
);
397 is_full_physname_constructor
= is_constructor_name (physname
);
399 is_constructor
= is_full_physname_constructor
400 || (newname
&& strcmp (field_name
, newname
) == 0);
403 is_destructor
= (strncmp (physname
, "__dt", 4) == 0);
405 if (is_destructor
|| is_full_physname_constructor
)
407 mangled_name
= (char *) xmalloc (strlen (physname
) + 1);
408 strcpy (mangled_name
, physname
);
414 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
416 else if (physname
[0] == 't' || physname
[0] == 'Q')
418 /* The physname for template and qualified methods already includes
420 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
426 xsnprintf (buf
, sizeof (buf
), "__%s%s%d", const_prefix
,
427 volatile_prefix
, len
);
429 mangled_name_len
= ((is_constructor
? 0 : strlen (field_name
))
430 + strlen (buf
) + len
+ strlen (physname
) + 1);
432 mangled_name
= (char *) xmalloc (mangled_name_len
);
434 mangled_name
[0] = '\0';
436 strcpy (mangled_name
, field_name
);
438 strcat (mangled_name
, buf
);
439 /* If the class doesn't have a name, i.e. newname NULL, then we just
440 mangle it using 0 for the length of the class. Thus it gets mangled
441 as something starting with `::' rather than `classname::'. */
443 strcat (mangled_name
, newname
);
445 strcat (mangled_name
, physname
);
446 return (mangled_name
);
449 /* Initialize the cplus_specific structure. 'cplus_specific' should
450 only be allocated for use with cplus symbols. */
453 symbol_init_cplus_specific (struct general_symbol_info
*gsymbol
,
454 struct obstack
*obstack
)
456 /* A language_specific structure should not have been previously
458 gdb_assert (gsymbol
->language_specific
.cplus_specific
== NULL
);
459 gdb_assert (obstack
!= NULL
);
461 gsymbol
->language_specific
.cplus_specific
=
462 OBSTACK_ZALLOC (obstack
, struct cplus_specific
);
465 /* Set the demangled name of GSYMBOL to NAME. NAME must be already
466 correctly allocated. For C++ symbols a cplus_specific struct is
467 allocated so OBJFILE must not be NULL. If this is a non C++ symbol
468 OBJFILE can be NULL. */
471 symbol_set_demangled_name (struct general_symbol_info
*gsymbol
,
473 struct obstack
*obstack
)
475 if (gsymbol
->language
== language_cplus
)
477 if (gsymbol
->language_specific
.cplus_specific
== NULL
)
478 symbol_init_cplus_specific (gsymbol
, obstack
);
480 gsymbol
->language_specific
.cplus_specific
->demangled_name
= name
;
482 else if (gsymbol
->language
== language_ada
)
486 gsymbol
->ada_mangled
= 0;
487 gsymbol
->language_specific
.obstack
= obstack
;
491 gsymbol
->ada_mangled
= 1;
492 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
496 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
499 /* Return the demangled name of GSYMBOL. */
502 symbol_get_demangled_name (const struct general_symbol_info
*gsymbol
)
504 if (gsymbol
->language
== language_cplus
)
506 if (gsymbol
->language_specific
.cplus_specific
!= NULL
)
507 return gsymbol
->language_specific
.cplus_specific
->demangled_name
;
511 else if (gsymbol
->language
== language_ada
)
513 if (!gsymbol
->ada_mangled
)
518 return gsymbol
->language_specific
.mangled_lang
.demangled_name
;
522 /* Initialize the language dependent portion of a symbol
523 depending upon the language for the symbol. */
526 symbol_set_language (struct general_symbol_info
*gsymbol
,
527 enum language language
,
528 struct obstack
*obstack
)
530 gsymbol
->language
= language
;
531 if (gsymbol
->language
== language_d
532 || gsymbol
->language
== language_go
533 || gsymbol
->language
== language_java
534 || gsymbol
->language
== language_objc
535 || gsymbol
->language
== language_fortran
)
537 symbol_set_demangled_name (gsymbol
, NULL
, obstack
);
539 else if (gsymbol
->language
== language_ada
)
541 gdb_assert (gsymbol
->ada_mangled
== 0);
542 gsymbol
->language_specific
.obstack
= obstack
;
544 else if (gsymbol
->language
== language_cplus
)
545 gsymbol
->language_specific
.cplus_specific
= NULL
;
548 memset (&gsymbol
->language_specific
, 0,
549 sizeof (gsymbol
->language_specific
));
553 /* Functions to initialize a symbol's mangled name. */
555 /* Objects of this type are stored in the demangled name hash table. */
556 struct demangled_name_entry
562 /* Hash function for the demangled name hash. */
565 hash_demangled_name_entry (const void *data
)
567 const struct demangled_name_entry
*e
= data
;
569 return htab_hash_string (e
->mangled
);
572 /* Equality function for the demangled name hash. */
575 eq_demangled_name_entry (const void *a
, const void *b
)
577 const struct demangled_name_entry
*da
= a
;
578 const struct demangled_name_entry
*db
= b
;
580 return strcmp (da
->mangled
, db
->mangled
) == 0;
583 /* Create the hash table used for demangled names. Each hash entry is
584 a pair of strings; one for the mangled name and one for the demangled
585 name. The entry is hashed via just the mangled name. */
588 create_demangled_names_hash (struct objfile
*objfile
)
590 /* Choose 256 as the starting size of the hash table, somewhat arbitrarily.
591 The hash table code will round this up to the next prime number.
592 Choosing a much larger table size wastes memory, and saves only about
593 1% in symbol reading. */
595 objfile
->per_bfd
->demangled_names_hash
= htab_create_alloc
596 (256, hash_demangled_name_entry
, eq_demangled_name_entry
,
597 NULL
, xcalloc
, xfree
);
600 /* Try to determine the demangled name for a symbol, based on the
601 language of that symbol. If the language is set to language_auto,
602 it will attempt to find any demangling algorithm that works and
603 then set the language appropriately. The returned name is allocated
604 by the demangler and should be xfree'd. */
607 symbol_find_demangled_name (struct general_symbol_info
*gsymbol
,
610 char *demangled
= NULL
;
612 if (gsymbol
->language
== language_unknown
)
613 gsymbol
->language
= language_auto
;
615 if (gsymbol
->language
== language_objc
616 || gsymbol
->language
== language_auto
)
619 objc_demangle (mangled
, 0);
620 if (demangled
!= NULL
)
622 gsymbol
->language
= language_objc
;
626 if (gsymbol
->language
== language_cplus
627 || gsymbol
->language
== language_auto
)
630 gdb_demangle (mangled
, DMGL_PARAMS
| DMGL_ANSI
);
631 if (demangled
!= NULL
)
633 gsymbol
->language
= language_cplus
;
637 if (gsymbol
->language
== language_java
)
640 gdb_demangle (mangled
,
641 DMGL_PARAMS
| DMGL_ANSI
| DMGL_JAVA
);
642 if (demangled
!= NULL
)
644 gsymbol
->language
= language_java
;
648 if (gsymbol
->language
== language_d
649 || gsymbol
->language
== language_auto
)
651 demangled
= d_demangle(mangled
, 0);
652 if (demangled
!= NULL
)
654 gsymbol
->language
= language_d
;
658 /* FIXME(dje): Continually adding languages here is clumsy.
659 Better to just call la_demangle if !auto, and if auto then call
660 a utility routine that tries successive languages in turn and reports
661 which one it finds. I realize the la_demangle options may be different
662 for different languages but there's already a FIXME for that. */
663 if (gsymbol
->language
== language_go
664 || gsymbol
->language
== language_auto
)
666 demangled
= go_demangle (mangled
, 0);
667 if (demangled
!= NULL
)
669 gsymbol
->language
= language_go
;
674 /* We could support `gsymbol->language == language_fortran' here to provide
675 module namespaces also for inferiors with only minimal symbol table (ELF
676 symbols). Just the mangling standard is not standardized across compilers
677 and there is no DW_AT_producer available for inferiors with only the ELF
678 symbols to check the mangling kind. */
682 /* Set both the mangled and demangled (if any) names for GSYMBOL based
683 on LINKAGE_NAME and LEN. Ordinarily, NAME is copied onto the
684 objfile's obstack; but if COPY_NAME is 0 and if NAME is
685 NUL-terminated, then this function assumes that NAME is already
686 correctly saved (either permanently or with a lifetime tied to the
687 objfile), and it will not be copied.
689 The hash table corresponding to OBJFILE is used, and the memory
690 comes from the per-BFD storage_obstack. LINKAGE_NAME is copied,
691 so the pointer can be discarded after calling this function. */
693 /* We have to be careful when dealing with Java names: when we run
694 into a Java minimal symbol, we don't know it's a Java symbol, so it
695 gets demangled as a C++ name. This is unfortunate, but there's not
696 much we can do about it: but when demangling partial symbols and
697 regular symbols, we'd better not reuse the wrong demangled name.
698 (See PR gdb/1039.) We solve this by putting a distinctive prefix
699 on Java names when storing them in the hash table. */
701 /* FIXME: carlton/2003-03-13: This is an unfortunate situation. I
702 don't mind the Java prefix so much: different languages have
703 different demangling requirements, so it's only natural that we
704 need to keep language data around in our demangling cache. But
705 it's not good that the minimal symbol has the wrong demangled name.
706 Unfortunately, I can't think of any easy solution to that
709 #define JAVA_PREFIX "##JAVA$$"
710 #define JAVA_PREFIX_LEN 8
713 symbol_set_names (struct general_symbol_info
*gsymbol
,
714 const char *linkage_name
, int len
, int copy_name
,
715 struct objfile
*objfile
)
717 struct demangled_name_entry
**slot
;
718 /* A 0-terminated copy of the linkage name. */
719 const char *linkage_name_copy
;
720 /* A copy of the linkage name that might have a special Java prefix
721 added to it, for use when looking names up in the hash table. */
722 const char *lookup_name
;
723 /* The length of lookup_name. */
725 struct demangled_name_entry entry
;
726 struct objfile_per_bfd_storage
*per_bfd
= objfile
->per_bfd
;
728 if (gsymbol
->language
== language_ada
)
730 /* In Ada, we do the symbol lookups using the mangled name, so
731 we can save some space by not storing the demangled name.
733 As a side note, we have also observed some overlap between
734 the C++ mangling and Ada mangling, similarly to what has
735 been observed with Java. Because we don't store the demangled
736 name with the symbol, we don't need to use the same trick
739 gsymbol
->name
= linkage_name
;
742 char *name
= obstack_alloc (&per_bfd
->storage_obstack
, len
+ 1);
744 memcpy (name
, linkage_name
, len
);
746 gsymbol
->name
= name
;
748 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
753 if (per_bfd
->demangled_names_hash
== NULL
)
754 create_demangled_names_hash (objfile
);
756 /* The stabs reader generally provides names that are not
757 NUL-terminated; most of the other readers don't do this, so we
758 can just use the given copy, unless we're in the Java case. */
759 if (gsymbol
->language
== language_java
)
763 lookup_len
= len
+ JAVA_PREFIX_LEN
;
764 alloc_name
= alloca (lookup_len
+ 1);
765 memcpy (alloc_name
, JAVA_PREFIX
, JAVA_PREFIX_LEN
);
766 memcpy (alloc_name
+ JAVA_PREFIX_LEN
, linkage_name
, len
);
767 alloc_name
[lookup_len
] = '\0';
769 lookup_name
= alloc_name
;
770 linkage_name_copy
= alloc_name
+ JAVA_PREFIX_LEN
;
772 else if (linkage_name
[len
] != '\0')
777 alloc_name
= alloca (lookup_len
+ 1);
778 memcpy (alloc_name
, linkage_name
, len
);
779 alloc_name
[lookup_len
] = '\0';
781 lookup_name
= alloc_name
;
782 linkage_name_copy
= alloc_name
;
787 lookup_name
= linkage_name
;
788 linkage_name_copy
= linkage_name
;
791 entry
.mangled
= lookup_name
;
792 slot
= ((struct demangled_name_entry
**)
793 htab_find_slot (per_bfd
->demangled_names_hash
,
796 /* If this name is not in the hash table, add it. */
798 /* A C version of the symbol may have already snuck into the table.
799 This happens to, e.g., main.init (__go_init_main). Cope. */
800 || (gsymbol
->language
== language_go
801 && (*slot
)->demangled
[0] == '\0'))
803 char *demangled_name
= symbol_find_demangled_name (gsymbol
,
805 int demangled_len
= demangled_name
? strlen (demangled_name
) : 0;
807 /* Suppose we have demangled_name==NULL, copy_name==0, and
808 lookup_name==linkage_name. In this case, we already have the
809 mangled name saved, and we don't have a demangled name. So,
810 you might think we could save a little space by not recording
811 this in the hash table at all.
813 It turns out that it is actually important to still save such
814 an entry in the hash table, because storing this name gives
815 us better bcache hit rates for partial symbols. */
816 if (!copy_name
&& lookup_name
== linkage_name
)
818 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
819 offsetof (struct demangled_name_entry
,
821 + demangled_len
+ 1);
822 (*slot
)->mangled
= lookup_name
;
828 /* If we must copy the mangled name, put it directly after
829 the demangled name so we can have a single
831 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
832 offsetof (struct demangled_name_entry
,
834 + lookup_len
+ demangled_len
+ 2);
835 mangled_ptr
= &((*slot
)->demangled
[demangled_len
+ 1]);
836 strcpy (mangled_ptr
, lookup_name
);
837 (*slot
)->mangled
= mangled_ptr
;
840 if (demangled_name
!= NULL
)
842 strcpy ((*slot
)->demangled
, demangled_name
);
843 xfree (demangled_name
);
846 (*slot
)->demangled
[0] = '\0';
849 gsymbol
->name
= (*slot
)->mangled
+ lookup_len
- len
;
850 if ((*slot
)->demangled
[0] != '\0')
851 symbol_set_demangled_name (gsymbol
, (*slot
)->demangled
,
852 &per_bfd
->storage_obstack
);
854 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
857 /* Return the source code name of a symbol. In languages where
858 demangling is necessary, this is the demangled name. */
861 symbol_natural_name (const struct general_symbol_info
*gsymbol
)
863 switch (gsymbol
->language
)
870 case language_fortran
:
871 if (symbol_get_demangled_name (gsymbol
) != NULL
)
872 return symbol_get_demangled_name (gsymbol
);
875 return ada_decode_symbol (gsymbol
);
879 return gsymbol
->name
;
882 /* Return the demangled name for a symbol based on the language for
883 that symbol. If no demangled name exists, return NULL. */
886 symbol_demangled_name (const struct general_symbol_info
*gsymbol
)
888 const char *dem_name
= NULL
;
890 switch (gsymbol
->language
)
897 case language_fortran
:
898 dem_name
= symbol_get_demangled_name (gsymbol
);
901 dem_name
= ada_decode_symbol (gsymbol
);
909 /* Return the search name of a symbol---generally the demangled or
910 linkage name of the symbol, depending on how it will be searched for.
911 If there is no distinct demangled name, then returns the same value
912 (same pointer) as SYMBOL_LINKAGE_NAME. */
915 symbol_search_name (const struct general_symbol_info
*gsymbol
)
917 if (gsymbol
->language
== language_ada
)
918 return gsymbol
->name
;
920 return symbol_natural_name (gsymbol
);
923 /* Initialize the structure fields to zero values. */
926 init_sal (struct symtab_and_line
*sal
)
934 sal
->explicit_pc
= 0;
935 sal
->explicit_line
= 0;
940 /* Return 1 if the two sections are the same, or if they could
941 plausibly be copies of each other, one in an original object
942 file and another in a separated debug file. */
945 matching_obj_sections (struct obj_section
*obj_first
,
946 struct obj_section
*obj_second
)
948 asection
*first
= obj_first
? obj_first
->the_bfd_section
: NULL
;
949 asection
*second
= obj_second
? obj_second
->the_bfd_section
: NULL
;
952 /* If they're the same section, then they match. */
956 /* If either is NULL, give up. */
957 if (first
== NULL
|| second
== NULL
)
960 /* This doesn't apply to absolute symbols. */
961 if (first
->owner
== NULL
|| second
->owner
== NULL
)
964 /* If they're in the same object file, they must be different sections. */
965 if (first
->owner
== second
->owner
)
968 /* Check whether the two sections are potentially corresponding. They must
969 have the same size, address, and name. We can't compare section indexes,
970 which would be more reliable, because some sections may have been
972 if (bfd_get_section_size (first
) != bfd_get_section_size (second
))
975 /* In-memory addresses may start at a different offset, relativize them. */
976 if (bfd_get_section_vma (first
->owner
, first
)
977 - bfd_get_start_address (first
->owner
)
978 != bfd_get_section_vma (second
->owner
, second
)
979 - bfd_get_start_address (second
->owner
))
982 if (bfd_get_section_name (first
->owner
, first
) == NULL
983 || bfd_get_section_name (second
->owner
, second
) == NULL
984 || strcmp (bfd_get_section_name (first
->owner
, first
),
985 bfd_get_section_name (second
->owner
, second
)) != 0)
988 /* Otherwise check that they are in corresponding objfiles. */
991 if (obj
->obfd
== first
->owner
)
993 gdb_assert (obj
!= NULL
);
995 if (obj
->separate_debug_objfile
!= NULL
996 && obj
->separate_debug_objfile
->obfd
== second
->owner
)
998 if (obj
->separate_debug_objfile_backlink
!= NULL
999 && obj
->separate_debug_objfile_backlink
->obfd
== second
->owner
)
1006 find_pc_sect_symtab_via_partial (CORE_ADDR pc
, struct obj_section
*section
)
1008 struct objfile
*objfile
;
1009 struct minimal_symbol
*msymbol
;
1011 /* If we know that this is not a text address, return failure. This is
1012 necessary because we loop based on texthigh and textlow, which do
1013 not include the data ranges. */
1014 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
).minsym
;
1016 && (MSYMBOL_TYPE (msymbol
) == mst_data
1017 || MSYMBOL_TYPE (msymbol
) == mst_bss
1018 || MSYMBOL_TYPE (msymbol
) == mst_abs
1019 || MSYMBOL_TYPE (msymbol
) == mst_file_data
1020 || MSYMBOL_TYPE (msymbol
) == mst_file_bss
))
1023 ALL_OBJFILES (objfile
)
1025 struct symtab
*result
= NULL
;
1028 result
= objfile
->sf
->qf
->find_pc_sect_symtab (objfile
, msymbol
,
1037 /* Debug symbols usually don't have section information. We need to dig that
1038 out of the minimal symbols and stash that in the debug symbol. */
1041 fixup_section (struct general_symbol_info
*ginfo
,
1042 CORE_ADDR addr
, struct objfile
*objfile
)
1044 struct minimal_symbol
*msym
;
1046 /* First, check whether a minimal symbol with the same name exists
1047 and points to the same address. The address check is required
1048 e.g. on PowerPC64, where the minimal symbol for a function will
1049 point to the function descriptor, while the debug symbol will
1050 point to the actual function code. */
1051 msym
= lookup_minimal_symbol_by_pc_name (addr
, ginfo
->name
, objfile
);
1053 ginfo
->section
= SYMBOL_SECTION (msym
);
1056 /* Static, function-local variables do appear in the linker
1057 (minimal) symbols, but are frequently given names that won't
1058 be found via lookup_minimal_symbol(). E.g., it has been
1059 observed in frv-uclinux (ELF) executables that a static,
1060 function-local variable named "foo" might appear in the
1061 linker symbols as "foo.6" or "foo.3". Thus, there is no
1062 point in attempting to extend the lookup-by-name mechanism to
1063 handle this case due to the fact that there can be multiple
1066 So, instead, search the section table when lookup by name has
1067 failed. The ``addr'' and ``endaddr'' fields may have already
1068 been relocated. If so, the relocation offset (i.e. the
1069 ANOFFSET value) needs to be subtracted from these values when
1070 performing the comparison. We unconditionally subtract it,
1071 because, when no relocation has been performed, the ANOFFSET
1072 value will simply be zero.
1074 The address of the symbol whose section we're fixing up HAS
1075 NOT BEEN adjusted (relocated) yet. It can't have been since
1076 the section isn't yet known and knowing the section is
1077 necessary in order to add the correct relocation value. In
1078 other words, we wouldn't even be in this function (attempting
1079 to compute the section) if it were already known.
1081 Note that it is possible to search the minimal symbols
1082 (subtracting the relocation value if necessary) to find the
1083 matching minimal symbol, but this is overkill and much less
1084 efficient. It is not necessary to find the matching minimal
1085 symbol, only its section.
1087 Note that this technique (of doing a section table search)
1088 can fail when unrelocated section addresses overlap. For
1089 this reason, we still attempt a lookup by name prior to doing
1090 a search of the section table. */
1092 struct obj_section
*s
;
1095 ALL_OBJFILE_OSECTIONS (objfile
, s
)
1097 int idx
= s
- objfile
->sections
;
1098 CORE_ADDR offset
= ANOFFSET (objfile
->section_offsets
, idx
);
1103 if (obj_section_addr (s
) - offset
<= addr
1104 && addr
< obj_section_endaddr (s
) - offset
)
1106 ginfo
->section
= idx
;
1111 /* If we didn't find the section, assume it is in the first
1112 section. If there is no allocated section, then it hardly
1113 matters what we pick, so just pick zero. */
1117 ginfo
->section
= fallback
;
1122 fixup_symbol_section (struct symbol
*sym
, struct objfile
*objfile
)
1129 /* We either have an OBJFILE, or we can get at it from the sym's
1130 symtab. Anything else is a bug. */
1131 gdb_assert (objfile
|| SYMBOL_SYMTAB (sym
));
1133 if (objfile
== NULL
)
1134 objfile
= SYMBOL_SYMTAB (sym
)->objfile
;
1136 if (SYMBOL_OBJ_SECTION (objfile
, sym
))
1139 /* We should have an objfile by now. */
1140 gdb_assert (objfile
);
1142 switch (SYMBOL_CLASS (sym
))
1146 addr
= SYMBOL_VALUE_ADDRESS (sym
);
1149 addr
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
1153 /* Nothing else will be listed in the minsyms -- no use looking
1158 fixup_section (&sym
->ginfo
, addr
, objfile
);
1163 /* Compute the demangled form of NAME as used by the various symbol
1164 lookup functions. The result is stored in *RESULT_NAME. Returns a
1165 cleanup which can be used to clean up the result.
1167 For Ada, this function just sets *RESULT_NAME to NAME, unmodified.
1168 Normally, Ada symbol lookups are performed using the encoded name
1169 rather than the demangled name, and so it might seem to make sense
1170 for this function to return an encoded version of NAME.
1171 Unfortunately, we cannot do this, because this function is used in
1172 circumstances where it is not appropriate to try to encode NAME.
1173 For instance, when displaying the frame info, we demangle the name
1174 of each parameter, and then perform a symbol lookup inside our
1175 function using that demangled name. In Ada, certain functions
1176 have internally-generated parameters whose name contain uppercase
1177 characters. Encoding those name would result in those uppercase
1178 characters to become lowercase, and thus cause the symbol lookup
1182 demangle_for_lookup (const char *name
, enum language lang
,
1183 const char **result_name
)
1185 char *demangled_name
= NULL
;
1186 const char *modified_name
= NULL
;
1187 struct cleanup
*cleanup
= make_cleanup (null_cleanup
, 0);
1189 modified_name
= name
;
1191 /* If we are using C++, D, Go, or Java, demangle the name before doing a
1192 lookup, so we can always binary search. */
1193 if (lang
== language_cplus
)
1195 demangled_name
= gdb_demangle (name
, DMGL_ANSI
| DMGL_PARAMS
);
1198 modified_name
= demangled_name
;
1199 make_cleanup (xfree
, demangled_name
);
1203 /* If we were given a non-mangled name, canonicalize it
1204 according to the language (so far only for C++). */
1205 demangled_name
= cp_canonicalize_string (name
);
1208 modified_name
= demangled_name
;
1209 make_cleanup (xfree
, demangled_name
);
1213 else if (lang
== language_java
)
1215 demangled_name
= gdb_demangle (name
,
1216 DMGL_ANSI
| DMGL_PARAMS
| DMGL_JAVA
);
1219 modified_name
= demangled_name
;
1220 make_cleanup (xfree
, demangled_name
);
1223 else if (lang
== language_d
)
1225 demangled_name
= d_demangle (name
, 0);
1228 modified_name
= demangled_name
;
1229 make_cleanup (xfree
, demangled_name
);
1232 else if (lang
== language_go
)
1234 demangled_name
= go_demangle (name
, 0);
1237 modified_name
= demangled_name
;
1238 make_cleanup (xfree
, demangled_name
);
1242 *result_name
= modified_name
;
1246 /* Find the definition for a specified symbol name NAME
1247 in domain DOMAIN, visible from lexical block BLOCK.
1248 Returns the struct symbol pointer, or zero if no symbol is found.
1249 C++: if IS_A_FIELD_OF_THIS is nonzero on entry, check to see if
1250 NAME is a field of the current implied argument `this'. If so set
1251 *IS_A_FIELD_OF_THIS to 1, otherwise set it to zero.
1252 BLOCK_FOUND is set to the block in which NAME is found (in the case of
1253 a field of `this', value_of_this sets BLOCK_FOUND to the proper value.) */
1255 /* This function (or rather its subordinates) have a bunch of loops and
1256 it would seem to be attractive to put in some QUIT's (though I'm not really
1257 sure whether it can run long enough to be really important). But there
1258 are a few calls for which it would appear to be bad news to quit
1259 out of here: e.g., find_proc_desc in alpha-mdebug-tdep.c. (Note
1260 that there is C++ code below which can error(), but that probably
1261 doesn't affect these calls since they are looking for a known
1262 variable and thus can probably assume it will never hit the C++
1266 lookup_symbol_in_language (const char *name
, const struct block
*block
,
1267 const domain_enum domain
, enum language lang
,
1268 struct field_of_this_result
*is_a_field_of_this
)
1270 const char *modified_name
;
1271 struct symbol
*returnval
;
1272 struct cleanup
*cleanup
= demangle_for_lookup (name
, lang
, &modified_name
);
1274 returnval
= lookup_symbol_aux (modified_name
, block
, domain
, lang
,
1275 is_a_field_of_this
);
1276 do_cleanups (cleanup
);
1281 /* Behave like lookup_symbol_in_language, but performed with the
1282 current language. */
1285 lookup_symbol (const char *name
, const struct block
*block
,
1287 struct field_of_this_result
*is_a_field_of_this
)
1289 return lookup_symbol_in_language (name
, block
, domain
,
1290 current_language
->la_language
,
1291 is_a_field_of_this
);
1294 /* Look up the `this' symbol for LANG in BLOCK. Return the symbol if
1295 found, or NULL if not found. */
1298 lookup_language_this (const struct language_defn
*lang
,
1299 const struct block
*block
)
1301 if (lang
->la_name_of_this
== NULL
|| block
== NULL
)
1308 sym
= lookup_block_symbol (block
, lang
->la_name_of_this
, VAR_DOMAIN
);
1311 block_found
= block
;
1314 if (BLOCK_FUNCTION (block
))
1316 block
= BLOCK_SUPERBLOCK (block
);
1322 /* Given TYPE, a structure/union,
1323 return 1 if the component named NAME from the ultimate target
1324 structure/union is defined, otherwise, return 0. */
1327 check_field (struct type
*type
, const char *name
,
1328 struct field_of_this_result
*is_a_field_of_this
)
1332 /* The type may be a stub. */
1333 CHECK_TYPEDEF (type
);
1335 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
1337 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1339 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1341 is_a_field_of_this
->type
= type
;
1342 is_a_field_of_this
->field
= &TYPE_FIELD (type
, i
);
1347 /* C++: If it was not found as a data field, then try to return it
1348 as a pointer to a method. */
1350 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
1352 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
1354 is_a_field_of_this
->type
= type
;
1355 is_a_field_of_this
->fn_field
= &TYPE_FN_FIELDLIST (type
, i
);
1360 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1361 if (check_field (TYPE_BASECLASS (type
, i
), name
, is_a_field_of_this
))
1367 /* Behave like lookup_symbol except that NAME is the natural name
1368 (e.g., demangled name) of the symbol that we're looking for. */
1370 static struct symbol
*
1371 lookup_symbol_aux (const char *name
, const struct block
*block
,
1372 const domain_enum domain
, enum language language
,
1373 struct field_of_this_result
*is_a_field_of_this
)
1376 const struct language_defn
*langdef
;
1378 /* Make sure we do something sensible with is_a_field_of_this, since
1379 the callers that set this parameter to some non-null value will
1380 certainly use it later. If we don't set it, the contents of
1381 is_a_field_of_this are undefined. */
1382 if (is_a_field_of_this
!= NULL
)
1383 memset (is_a_field_of_this
, 0, sizeof (*is_a_field_of_this
));
1385 /* Search specified block and its superiors. Don't search
1386 STATIC_BLOCK or GLOBAL_BLOCK. */
1388 sym
= lookup_symbol_aux_local (name
, block
, domain
, language
);
1392 /* If requested to do so by the caller and if appropriate for LANGUAGE,
1393 check to see if NAME is a field of `this'. */
1395 langdef
= language_def (language
);
1397 /* Don't do this check if we are searching for a struct. It will
1398 not be found by check_field, but will be found by other
1400 if (is_a_field_of_this
!= NULL
&& domain
!= STRUCT_DOMAIN
)
1402 struct symbol
*sym
= lookup_language_this (langdef
, block
);
1406 struct type
*t
= sym
->type
;
1408 /* I'm not really sure that type of this can ever
1409 be typedefed; just be safe. */
1411 if (TYPE_CODE (t
) == TYPE_CODE_PTR
1412 || TYPE_CODE (t
) == TYPE_CODE_REF
)
1413 t
= TYPE_TARGET_TYPE (t
);
1415 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1416 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1417 error (_("Internal error: `%s' is not an aggregate"),
1418 langdef
->la_name_of_this
);
1420 if (check_field (t
, name
, is_a_field_of_this
))
1425 /* Now do whatever is appropriate for LANGUAGE to look
1426 up static and global variables. */
1428 sym
= langdef
->la_lookup_symbol_nonlocal (name
, block
, domain
);
1432 /* Now search all static file-level symbols. Not strictly correct,
1433 but more useful than an error. */
1435 return lookup_static_symbol_aux (name
, domain
);
1438 /* Search all static file-level symbols for NAME from DOMAIN. Do the symtabs
1439 first, then check the psymtabs. If a psymtab indicates the existence of the
1440 desired name as a file-level static, then do psymtab-to-symtab conversion on
1441 the fly and return the found symbol. */
1444 lookup_static_symbol_aux (const char *name
, const domain_enum domain
)
1446 struct objfile
*objfile
;
1449 sym
= lookup_symbol_aux_symtabs (STATIC_BLOCK
, name
, domain
);
1453 ALL_OBJFILES (objfile
)
1455 sym
= lookup_symbol_aux_quick (objfile
, STATIC_BLOCK
, name
, domain
);
1463 /* Check to see if the symbol is defined in BLOCK or its superiors.
1464 Don't search STATIC_BLOCK or GLOBAL_BLOCK. */
1466 static struct symbol
*
1467 lookup_symbol_aux_local (const char *name
, const struct block
*block
,
1468 const domain_enum domain
,
1469 enum language language
)
1472 const struct block
*static_block
= block_static_block (block
);
1473 const char *scope
= block_scope (block
);
1475 /* Check if either no block is specified or it's a global block. */
1477 if (static_block
== NULL
)
1480 while (block
!= static_block
)
1482 sym
= lookup_symbol_aux_block (name
, block
, domain
);
1486 if (language
== language_cplus
|| language
== language_fortran
)
1488 sym
= cp_lookup_symbol_imports_or_template (scope
, name
, block
,
1494 if (BLOCK_FUNCTION (block
) != NULL
&& block_inlined_p (block
))
1496 block
= BLOCK_SUPERBLOCK (block
);
1499 /* We've reached the edge of the function without finding a result. */
1504 /* Look up OBJFILE to BLOCK. */
1507 lookup_objfile_from_block (const struct block
*block
)
1509 struct objfile
*obj
;
1515 block
= block_global_block (block
);
1516 /* Go through SYMTABS. */
1517 ALL_SYMTABS (obj
, s
)
1518 if (block
== BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
))
1520 if (obj
->separate_debug_objfile_backlink
)
1521 obj
= obj
->separate_debug_objfile_backlink
;
1529 /* Look up a symbol in a block; if found, fixup the symbol, and set
1530 block_found appropriately. */
1533 lookup_symbol_aux_block (const char *name
, const struct block
*block
,
1534 const domain_enum domain
)
1538 sym
= lookup_block_symbol (block
, name
, domain
);
1541 block_found
= block
;
1542 return fixup_symbol_section (sym
, NULL
);
1548 /* Check all global symbols in OBJFILE in symtabs and
1552 lookup_global_symbol_from_objfile (const struct objfile
*main_objfile
,
1554 const domain_enum domain
)
1556 const struct objfile
*objfile
;
1558 struct blockvector
*bv
;
1559 const struct block
*block
;
1562 for (objfile
= main_objfile
;
1564 objfile
= objfile_separate_debug_iterate (main_objfile
, objfile
))
1566 /* Go through symtabs. */
1567 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1569 bv
= BLOCKVECTOR (s
);
1570 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1571 sym
= lookup_block_symbol (block
, name
, domain
);
1574 block_found
= block
;
1575 return fixup_symbol_section (sym
, (struct objfile
*)objfile
);
1579 sym
= lookup_symbol_aux_quick ((struct objfile
*) objfile
, GLOBAL_BLOCK
,
1588 /* Check to see if the symbol is defined in one of the OBJFILE's
1589 symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK,
1590 depending on whether or not we want to search global symbols or
1593 static struct symbol
*
1594 lookup_symbol_aux_objfile (struct objfile
*objfile
, int block_index
,
1595 const char *name
, const domain_enum domain
)
1597 struct symbol
*sym
= NULL
;
1598 struct blockvector
*bv
;
1599 const struct block
*block
;
1602 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1604 bv
= BLOCKVECTOR (s
);
1605 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1606 sym
= lookup_block_symbol (block
, name
, domain
);
1609 block_found
= block
;
1610 return fixup_symbol_section (sym
, objfile
);
1617 /* Same as lookup_symbol_aux_objfile, except that it searches all
1618 objfiles. Return the first match found. */
1620 static struct symbol
*
1621 lookup_symbol_aux_symtabs (int block_index
, const char *name
,
1622 const domain_enum domain
)
1625 struct objfile
*objfile
;
1627 ALL_OBJFILES (objfile
)
1629 sym
= lookup_symbol_aux_objfile (objfile
, block_index
, name
, domain
);
1637 /* Wrapper around lookup_symbol_aux_objfile for search_symbols.
1638 Look up LINKAGE_NAME in DOMAIN in the global and static blocks of OBJFILE
1639 and all related objfiles. */
1641 static struct symbol
*
1642 lookup_symbol_in_objfile_from_linkage_name (struct objfile
*objfile
,
1643 const char *linkage_name
,
1646 enum language lang
= current_language
->la_language
;
1647 const char *modified_name
;
1648 struct cleanup
*cleanup
= demangle_for_lookup (linkage_name
, lang
,
1650 struct objfile
*main_objfile
, *cur_objfile
;
1652 if (objfile
->separate_debug_objfile_backlink
)
1653 main_objfile
= objfile
->separate_debug_objfile_backlink
;
1655 main_objfile
= objfile
;
1657 for (cur_objfile
= main_objfile
;
1659 cur_objfile
= objfile_separate_debug_iterate (main_objfile
, cur_objfile
))
1663 sym
= lookup_symbol_aux_objfile (cur_objfile
, GLOBAL_BLOCK
,
1664 modified_name
, domain
);
1666 sym
= lookup_symbol_aux_objfile (cur_objfile
, STATIC_BLOCK
,
1667 modified_name
, domain
);
1670 do_cleanups (cleanup
);
1675 do_cleanups (cleanup
);
1679 /* A helper function that throws an exception when a symbol was found
1680 in a psymtab but not in a symtab. */
1682 static void ATTRIBUTE_NORETURN
1683 error_in_psymtab_expansion (int kind
, const char *name
, struct symtab
*symtab
)
1686 Internal: %s symbol `%s' found in %s psymtab but not in symtab.\n\
1687 %s may be an inlined function, or may be a template function\n \
1688 (if a template, try specifying an instantiation: %s<type>)."),
1689 kind
== GLOBAL_BLOCK
? "global" : "static",
1690 name
, symtab_to_filename_for_display (symtab
), name
, name
);
1693 /* A helper function for lookup_symbol_aux that interfaces with the
1694 "quick" symbol table functions. */
1696 static struct symbol
*
1697 lookup_symbol_aux_quick (struct objfile
*objfile
, int kind
,
1698 const char *name
, const domain_enum domain
)
1700 struct symtab
*symtab
;
1701 struct blockvector
*bv
;
1702 const struct block
*block
;
1707 symtab
= objfile
->sf
->qf
->lookup_symbol (objfile
, kind
, name
, domain
);
1711 bv
= BLOCKVECTOR (symtab
);
1712 block
= BLOCKVECTOR_BLOCK (bv
, kind
);
1713 sym
= lookup_block_symbol (block
, name
, domain
);
1715 error_in_psymtab_expansion (kind
, name
, symtab
);
1716 return fixup_symbol_section (sym
, objfile
);
1719 /* A default version of lookup_symbol_nonlocal for use by languages
1720 that can't think of anything better to do. This implements the C
1724 basic_lookup_symbol_nonlocal (const char *name
,
1725 const struct block
*block
,
1726 const domain_enum domain
)
1730 /* NOTE: carlton/2003-05-19: The comments below were written when
1731 this (or what turned into this) was part of lookup_symbol_aux;
1732 I'm much less worried about these questions now, since these
1733 decisions have turned out well, but I leave these comments here
1736 /* NOTE: carlton/2002-12-05: There is a question as to whether or
1737 not it would be appropriate to search the current global block
1738 here as well. (That's what this code used to do before the
1739 is_a_field_of_this check was moved up.) On the one hand, it's
1740 redundant with the lookup_symbol_aux_symtabs search that happens
1741 next. On the other hand, if decode_line_1 is passed an argument
1742 like filename:var, then the user presumably wants 'var' to be
1743 searched for in filename. On the third hand, there shouldn't be
1744 multiple global variables all of which are named 'var', and it's
1745 not like decode_line_1 has ever restricted its search to only
1746 global variables in a single filename. All in all, only
1747 searching the static block here seems best: it's correct and it's
1750 /* NOTE: carlton/2002-12-05: There's also a possible performance
1751 issue here: if you usually search for global symbols in the
1752 current file, then it would be slightly better to search the
1753 current global block before searching all the symtabs. But there
1754 are other factors that have a much greater effect on performance
1755 than that one, so I don't think we should worry about that for
1758 sym
= lookup_symbol_static (name
, block
, domain
);
1762 return lookup_symbol_global (name
, block
, domain
);
1765 /* Lookup a symbol in the static block associated to BLOCK, if there
1766 is one; do nothing if BLOCK is NULL or a global block. */
1769 lookup_symbol_static (const char *name
,
1770 const struct block
*block
,
1771 const domain_enum domain
)
1773 const struct block
*static_block
= block_static_block (block
);
1775 if (static_block
!= NULL
)
1776 return lookup_symbol_aux_block (name
, static_block
, domain
);
1781 /* Private data to be used with lookup_symbol_global_iterator_cb. */
1783 struct global_sym_lookup_data
1785 /* The name of the symbol we are searching for. */
1788 /* The domain to use for our search. */
1791 /* The field where the callback should store the symbol if found.
1792 It should be initialized to NULL before the search is started. */
1793 struct symbol
*result
;
1796 /* A callback function for gdbarch_iterate_over_objfiles_in_search_order.
1797 It searches by name for a symbol in the GLOBAL_BLOCK of the given
1798 OBJFILE. The arguments for the search are passed via CB_DATA,
1799 which in reality is a pointer to struct global_sym_lookup_data. */
1802 lookup_symbol_global_iterator_cb (struct objfile
*objfile
,
1805 struct global_sym_lookup_data
*data
=
1806 (struct global_sym_lookup_data
*) cb_data
;
1808 gdb_assert (data
->result
== NULL
);
1810 data
->result
= lookup_symbol_aux_objfile (objfile
, GLOBAL_BLOCK
,
1811 data
->name
, data
->domain
);
1812 if (data
->result
== NULL
)
1813 data
->result
= lookup_symbol_aux_quick (objfile
, GLOBAL_BLOCK
,
1814 data
->name
, data
->domain
);
1816 /* If we found a match, tell the iterator to stop. Otherwise,
1818 return (data
->result
!= NULL
);
1821 /* Lookup a symbol in all files' global blocks (searching psymtabs if
1825 lookup_symbol_global (const char *name
,
1826 const struct block
*block
,
1827 const domain_enum domain
)
1829 struct symbol
*sym
= NULL
;
1830 struct objfile
*objfile
= NULL
;
1831 struct global_sym_lookup_data lookup_data
;
1833 /* Call library-specific lookup procedure. */
1834 objfile
= lookup_objfile_from_block (block
);
1835 if (objfile
!= NULL
)
1836 sym
= solib_global_lookup (objfile
, name
, domain
);
1840 memset (&lookup_data
, 0, sizeof (lookup_data
));
1841 lookup_data
.name
= name
;
1842 lookup_data
.domain
= domain
;
1843 gdbarch_iterate_over_objfiles_in_search_order
1844 (objfile
!= NULL
? get_objfile_arch (objfile
) : target_gdbarch (),
1845 lookup_symbol_global_iterator_cb
, &lookup_data
, objfile
);
1847 return lookup_data
.result
;
1851 symbol_matches_domain (enum language symbol_language
,
1852 domain_enum symbol_domain
,
1855 /* For C++ "struct foo { ... }" also defines a typedef for "foo".
1856 A Java class declaration also defines a typedef for the class.
1857 Similarly, any Ada type declaration implicitly defines a typedef. */
1858 if (symbol_language
== language_cplus
1859 || symbol_language
== language_d
1860 || symbol_language
== language_java
1861 || symbol_language
== language_ada
)
1863 if ((domain
== VAR_DOMAIN
|| domain
== STRUCT_DOMAIN
)
1864 && symbol_domain
== STRUCT_DOMAIN
)
1867 /* For all other languages, strict match is required. */
1868 return (symbol_domain
== domain
);
1871 /* Look up a type named NAME in the struct_domain. The type returned
1872 must not be opaque -- i.e., must have at least one field
1876 lookup_transparent_type (const char *name
)
1878 return current_language
->la_lookup_transparent_type (name
);
1881 /* A helper for basic_lookup_transparent_type that interfaces with the
1882 "quick" symbol table functions. */
1884 static struct type
*
1885 basic_lookup_transparent_type_quick (struct objfile
*objfile
, int kind
,
1888 struct symtab
*symtab
;
1889 struct blockvector
*bv
;
1890 struct block
*block
;
1895 symtab
= objfile
->sf
->qf
->lookup_symbol (objfile
, kind
, name
, STRUCT_DOMAIN
);
1899 bv
= BLOCKVECTOR (symtab
);
1900 block
= BLOCKVECTOR_BLOCK (bv
, kind
);
1901 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
1903 error_in_psymtab_expansion (kind
, name
, symtab
);
1905 if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1906 return SYMBOL_TYPE (sym
);
1911 /* The standard implementation of lookup_transparent_type. This code
1912 was modeled on lookup_symbol -- the parts not relevant to looking
1913 up types were just left out. In particular it's assumed here that
1914 types are available in struct_domain and only at file-static or
1918 basic_lookup_transparent_type (const char *name
)
1921 struct symtab
*s
= NULL
;
1922 struct blockvector
*bv
;
1923 struct objfile
*objfile
;
1924 struct block
*block
;
1927 /* Now search all the global symbols. Do the symtab's first, then
1928 check the psymtab's. If a psymtab indicates the existence
1929 of the desired name as a global, then do psymtab-to-symtab
1930 conversion on the fly and return the found symbol. */
1932 ALL_OBJFILES (objfile
)
1934 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1936 bv
= BLOCKVECTOR (s
);
1937 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1938 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
1939 if (sym
&& !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1941 return SYMBOL_TYPE (sym
);
1946 ALL_OBJFILES (objfile
)
1948 t
= basic_lookup_transparent_type_quick (objfile
, GLOBAL_BLOCK
, name
);
1953 /* Now search the static file-level symbols.
1954 Not strictly correct, but more useful than an error.
1955 Do the symtab's first, then
1956 check the psymtab's. If a psymtab indicates the existence
1957 of the desired name as a file-level static, then do psymtab-to-symtab
1958 conversion on the fly and return the found symbol. */
1960 ALL_OBJFILES (objfile
)
1962 ALL_OBJFILE_PRIMARY_SYMTABS (objfile
, s
)
1964 bv
= BLOCKVECTOR (s
);
1965 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
1966 sym
= lookup_block_symbol (block
, name
, STRUCT_DOMAIN
);
1967 if (sym
&& !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1969 return SYMBOL_TYPE (sym
);
1974 ALL_OBJFILES (objfile
)
1976 t
= basic_lookup_transparent_type_quick (objfile
, STATIC_BLOCK
, name
);
1981 return (struct type
*) 0;
1984 /* Search BLOCK for symbol NAME in DOMAIN.
1986 Note that if NAME is the demangled form of a C++ symbol, we will fail
1987 to find a match during the binary search of the non-encoded names, but
1988 for now we don't worry about the slight inefficiency of looking for
1989 a match we'll never find, since it will go pretty quick. Once the
1990 binary search terminates, we drop through and do a straight linear
1991 search on the symbols. Each symbol which is marked as being a ObjC/C++
1992 symbol (language_cplus or language_objc set) has both the encoded and
1993 non-encoded names tested for a match. */
1996 lookup_block_symbol (const struct block
*block
, const char *name
,
1997 const domain_enum domain
)
1999 struct block_iterator iter
;
2002 if (!BLOCK_FUNCTION (block
))
2004 for (sym
= block_iter_name_first (block
, name
, &iter
);
2006 sym
= block_iter_name_next (name
, &iter
))
2008 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2009 SYMBOL_DOMAIN (sym
), domain
))
2016 /* Note that parameter symbols do not always show up last in the
2017 list; this loop makes sure to take anything else other than
2018 parameter symbols first; it only uses parameter symbols as a
2019 last resort. Note that this only takes up extra computation
2022 struct symbol
*sym_found
= NULL
;
2024 for (sym
= block_iter_name_first (block
, name
, &iter
);
2026 sym
= block_iter_name_next (name
, &iter
))
2028 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2029 SYMBOL_DOMAIN (sym
), domain
))
2032 if (!SYMBOL_IS_ARGUMENT (sym
))
2038 return (sym_found
); /* Will be NULL if not found. */
2042 /* Iterate over the symbols named NAME, matching DOMAIN, in BLOCK.
2044 For each symbol that matches, CALLBACK is called. The symbol and
2045 DATA are passed to the callback.
2047 If CALLBACK returns zero, the iteration ends. Otherwise, the
2048 search continues. */
2051 iterate_over_symbols (const struct block
*block
, const char *name
,
2052 const domain_enum domain
,
2053 symbol_found_callback_ftype
*callback
,
2056 struct block_iterator iter
;
2059 for (sym
= block_iter_name_first (block
, name
, &iter
);
2061 sym
= block_iter_name_next (name
, &iter
))
2063 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2064 SYMBOL_DOMAIN (sym
), domain
))
2066 if (!callback (sym
, data
))
2072 /* Find the symtab associated with PC and SECTION. Look through the
2073 psymtabs and read in another symtab if necessary. */
2076 find_pc_sect_symtab (CORE_ADDR pc
, struct obj_section
*section
)
2079 struct blockvector
*bv
;
2080 struct symtab
*s
= NULL
;
2081 struct symtab
*best_s
= NULL
;
2082 struct objfile
*objfile
;
2083 CORE_ADDR distance
= 0;
2084 struct minimal_symbol
*msymbol
;
2086 /* If we know that this is not a text address, return failure. This is
2087 necessary because we loop based on the block's high and low code
2088 addresses, which do not include the data ranges, and because
2089 we call find_pc_sect_psymtab which has a similar restriction based
2090 on the partial_symtab's texthigh and textlow. */
2091 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
).minsym
;
2093 && (MSYMBOL_TYPE (msymbol
) == mst_data
2094 || MSYMBOL_TYPE (msymbol
) == mst_bss
2095 || MSYMBOL_TYPE (msymbol
) == mst_abs
2096 || MSYMBOL_TYPE (msymbol
) == mst_file_data
2097 || MSYMBOL_TYPE (msymbol
) == mst_file_bss
))
2100 /* Search all symtabs for the one whose file contains our address, and which
2101 is the smallest of all the ones containing the address. This is designed
2102 to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000
2103 and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from
2104 0x1000-0x4000, but for address 0x2345 we want to return symtab b.
2106 This happens for native ecoff format, where code from included files
2107 gets its own symtab. The symtab for the included file should have
2108 been read in already via the dependency mechanism.
2109 It might be swifter to create several symtabs with the same name
2110 like xcoff does (I'm not sure).
2112 It also happens for objfiles that have their functions reordered.
2113 For these, the symtab we are looking for is not necessarily read in. */
2115 ALL_PRIMARY_SYMTABS (objfile
, s
)
2117 bv
= BLOCKVECTOR (s
);
2118 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
2120 if (BLOCK_START (b
) <= pc
2121 && BLOCK_END (b
) > pc
2123 || BLOCK_END (b
) - BLOCK_START (b
) < distance
))
2125 /* For an objfile that has its functions reordered,
2126 find_pc_psymtab will find the proper partial symbol table
2127 and we simply return its corresponding symtab. */
2128 /* In order to better support objfiles that contain both
2129 stabs and coff debugging info, we continue on if a psymtab
2131 if ((objfile
->flags
& OBJF_REORDERED
) && objfile
->sf
)
2133 struct symtab
*result
;
2136 = objfile
->sf
->qf
->find_pc_sect_symtab (objfile
,
2145 struct block_iterator iter
;
2146 struct symbol
*sym
= NULL
;
2148 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
2150 fixup_symbol_section (sym
, objfile
);
2151 if (matching_obj_sections (SYMBOL_OBJ_SECTION (objfile
, sym
),
2156 continue; /* No symbol in this symtab matches
2159 distance
= BLOCK_END (b
) - BLOCK_START (b
);
2167 /* Not found in symtabs, search the "quick" symtabs (e.g. psymtabs). */
2169 ALL_OBJFILES (objfile
)
2171 struct symtab
*result
;
2175 result
= objfile
->sf
->qf
->find_pc_sect_symtab (objfile
,
2186 /* Find the symtab associated with PC. Look through the psymtabs and read
2187 in another symtab if necessary. Backward compatibility, no section. */
2190 find_pc_symtab (CORE_ADDR pc
)
2192 return find_pc_sect_symtab (pc
, find_pc_mapped_section (pc
));
2196 /* Find the source file and line number for a given PC value and SECTION.
2197 Return a structure containing a symtab pointer, a line number,
2198 and a pc range for the entire source line.
2199 The value's .pc field is NOT the specified pc.
2200 NOTCURRENT nonzero means, if specified pc is on a line boundary,
2201 use the line that ends there. Otherwise, in that case, the line
2202 that begins there is used. */
2204 /* The big complication here is that a line may start in one file, and end just
2205 before the start of another file. This usually occurs when you #include
2206 code in the middle of a subroutine. To properly find the end of a line's PC
2207 range, we must search all symtabs associated with this compilation unit, and
2208 find the one whose first PC is closer than that of the next line in this
2211 /* If it's worth the effort, we could be using a binary search. */
2213 struct symtab_and_line
2214 find_pc_sect_line (CORE_ADDR pc
, struct obj_section
*section
, int notcurrent
)
2217 struct linetable
*l
;
2220 struct linetable_entry
*item
;
2221 struct symtab_and_line val
;
2222 struct blockvector
*bv
;
2223 struct bound_minimal_symbol msymbol
;
2224 struct minimal_symbol
*mfunsym
;
2225 struct objfile
*objfile
;
2227 /* Info on best line seen so far, and where it starts, and its file. */
2229 struct linetable_entry
*best
= NULL
;
2230 CORE_ADDR best_end
= 0;
2231 struct symtab
*best_symtab
= 0;
2233 /* Store here the first line number
2234 of a file which contains the line at the smallest pc after PC.
2235 If we don't find a line whose range contains PC,
2236 we will use a line one less than this,
2237 with a range from the start of that file to the first line's pc. */
2238 struct linetable_entry
*alt
= NULL
;
2240 /* Info on best line seen in this file. */
2242 struct linetable_entry
*prev
;
2244 /* If this pc is not from the current frame,
2245 it is the address of the end of a call instruction.
2246 Quite likely that is the start of the following statement.
2247 But what we want is the statement containing the instruction.
2248 Fudge the pc to make sure we get that. */
2250 init_sal (&val
); /* initialize to zeroes */
2252 val
.pspace
= current_program_space
;
2254 /* It's tempting to assume that, if we can't find debugging info for
2255 any function enclosing PC, that we shouldn't search for line
2256 number info, either. However, GAS can emit line number info for
2257 assembly files --- very helpful when debugging hand-written
2258 assembly code. In such a case, we'd have no debug info for the
2259 function, but we would have line info. */
2264 /* elz: added this because this function returned the wrong
2265 information if the pc belongs to a stub (import/export)
2266 to call a shlib function. This stub would be anywhere between
2267 two functions in the target, and the line info was erroneously
2268 taken to be the one of the line before the pc. */
2270 /* RT: Further explanation:
2272 * We have stubs (trampolines) inserted between procedures.
2274 * Example: "shr1" exists in a shared library, and a "shr1" stub also
2275 * exists in the main image.
2277 * In the minimal symbol table, we have a bunch of symbols
2278 * sorted by start address. The stubs are marked as "trampoline",
2279 * the others appear as text. E.g.:
2281 * Minimal symbol table for main image
2282 * main: code for main (text symbol)
2283 * shr1: stub (trampoline symbol)
2284 * foo: code for foo (text symbol)
2286 * Minimal symbol table for "shr1" image:
2288 * shr1: code for shr1 (text symbol)
2291 * So the code below is trying to detect if we are in the stub
2292 * ("shr1" stub), and if so, find the real code ("shr1" trampoline),
2293 * and if found, do the symbolization from the real-code address
2294 * rather than the stub address.
2296 * Assumptions being made about the minimal symbol table:
2297 * 1. lookup_minimal_symbol_by_pc() will return a trampoline only
2298 * if we're really in the trampoline.s If we're beyond it (say
2299 * we're in "foo" in the above example), it'll have a closer
2300 * symbol (the "foo" text symbol for example) and will not
2301 * return the trampoline.
2302 * 2. lookup_minimal_symbol_text() will find a real text symbol
2303 * corresponding to the trampoline, and whose address will
2304 * be different than the trampoline address. I put in a sanity
2305 * check for the address being the same, to avoid an
2306 * infinite recursion.
2308 msymbol
= lookup_minimal_symbol_by_pc (pc
);
2309 if (msymbol
.minsym
!= NULL
)
2310 if (MSYMBOL_TYPE (msymbol
.minsym
) == mst_solib_trampoline
)
2313 = lookup_minimal_symbol_text (SYMBOL_LINKAGE_NAME (msymbol
.minsym
),
2315 if (mfunsym
== NULL
)
2316 /* I eliminated this warning since it is coming out
2317 * in the following situation:
2318 * gdb shmain // test program with shared libraries
2319 * (gdb) break shr1 // function in shared lib
2320 * Warning: In stub for ...
2321 * In the above situation, the shared lib is not loaded yet,
2322 * so of course we can't find the real func/line info,
2323 * but the "break" still works, and the warning is annoying.
2324 * So I commented out the warning. RT */
2325 /* warning ("In stub for %s; unable to find real function/line info",
2326 SYMBOL_LINKAGE_NAME (msymbol)); */
2329 else if (SYMBOL_VALUE_ADDRESS (mfunsym
)
2330 == SYMBOL_VALUE_ADDRESS (msymbol
.minsym
))
2331 /* Avoid infinite recursion */
2332 /* See above comment about why warning is commented out. */
2333 /* warning ("In stub for %s; unable to find real function/line info",
2334 SYMBOL_LINKAGE_NAME (msymbol)); */
2338 return find_pc_line (SYMBOL_VALUE_ADDRESS (mfunsym
), 0);
2342 s
= find_pc_sect_symtab (pc
, section
);
2345 /* If no symbol information, return previous pc. */
2352 bv
= BLOCKVECTOR (s
);
2353 objfile
= s
->objfile
;
2355 /* Look at all the symtabs that share this blockvector.
2356 They all have the same apriori range, that we found was right;
2357 but they have different line tables. */
2359 ALL_OBJFILE_SYMTABS (objfile
, s
)
2361 if (BLOCKVECTOR (s
) != bv
)
2364 /* Find the best line in this symtab. */
2371 /* I think len can be zero if the symtab lacks line numbers
2372 (e.g. gcc -g1). (Either that or the LINETABLE is NULL;
2373 I'm not sure which, and maybe it depends on the symbol
2379 item
= l
->item
; /* Get first line info. */
2381 /* Is this file's first line closer than the first lines of other files?
2382 If so, record this file, and its first line, as best alternate. */
2383 if (item
->pc
> pc
&& (!alt
|| item
->pc
< alt
->pc
))
2386 for (i
= 0; i
< len
; i
++, item
++)
2388 /* Leave prev pointing to the linetable entry for the last line
2389 that started at or before PC. */
2396 /* At this point, prev points at the line whose start addr is <= pc, and
2397 item points at the next line. If we ran off the end of the linetable
2398 (pc >= start of the last line), then prev == item. If pc < start of
2399 the first line, prev will not be set. */
2401 /* Is this file's best line closer than the best in the other files?
2402 If so, record this file, and its best line, as best so far. Don't
2403 save prev if it represents the end of a function (i.e. line number
2404 0) instead of a real line. */
2406 if (prev
&& prev
->line
&& (!best
|| prev
->pc
> best
->pc
))
2411 /* Discard BEST_END if it's before the PC of the current BEST. */
2412 if (best_end
<= best
->pc
)
2416 /* If another line (denoted by ITEM) is in the linetable and its
2417 PC is after BEST's PC, but before the current BEST_END, then
2418 use ITEM's PC as the new best_end. */
2419 if (best
&& i
< len
&& item
->pc
> best
->pc
2420 && (best_end
== 0 || best_end
> item
->pc
))
2421 best_end
= item
->pc
;
2426 /* If we didn't find any line number info, just return zeros.
2427 We used to return alt->line - 1 here, but that could be
2428 anywhere; if we don't have line number info for this PC,
2429 don't make some up. */
2432 else if (best
->line
== 0)
2434 /* If our best fit is in a range of PC's for which no line
2435 number info is available (line number is zero) then we didn't
2436 find any valid line information. */
2441 val
.symtab
= best_symtab
;
2442 val
.line
= best
->line
;
2444 if (best_end
&& (!alt
|| best_end
< alt
->pc
))
2449 val
.end
= BLOCK_END (BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
));
2451 val
.section
= section
;
2455 /* Backward compatibility (no section). */
2457 struct symtab_and_line
2458 find_pc_line (CORE_ADDR pc
, int notcurrent
)
2460 struct obj_section
*section
;
2462 section
= find_pc_overlay (pc
);
2463 if (pc_in_unmapped_range (pc
, section
))
2464 pc
= overlay_mapped_address (pc
, section
);
2465 return find_pc_sect_line (pc
, section
, notcurrent
);
2468 /* Find line number LINE in any symtab whose name is the same as
2471 If found, return the symtab that contains the linetable in which it was
2472 found, set *INDEX to the index in the linetable of the best entry
2473 found, and set *EXACT_MATCH nonzero if the value returned is an
2476 If not found, return NULL. */
2479 find_line_symtab (struct symtab
*symtab
, int line
,
2480 int *index
, int *exact_match
)
2482 int exact
= 0; /* Initialized here to avoid a compiler warning. */
2484 /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE
2488 struct linetable
*best_linetable
;
2489 struct symtab
*best_symtab
;
2491 /* First try looking it up in the given symtab. */
2492 best_linetable
= LINETABLE (symtab
);
2493 best_symtab
= symtab
;
2494 best_index
= find_line_common (best_linetable
, line
, &exact
, 0);
2495 if (best_index
< 0 || !exact
)
2497 /* Didn't find an exact match. So we better keep looking for
2498 another symtab with the same name. In the case of xcoff,
2499 multiple csects for one source file (produced by IBM's FORTRAN
2500 compiler) produce multiple symtabs (this is unavoidable
2501 assuming csects can be at arbitrary places in memory and that
2502 the GLOBAL_BLOCK of a symtab has a begin and end address). */
2504 /* BEST is the smallest linenumber > LINE so far seen,
2505 or 0 if none has been seen so far.
2506 BEST_INDEX and BEST_LINETABLE identify the item for it. */
2509 struct objfile
*objfile
;
2512 if (best_index
>= 0)
2513 best
= best_linetable
->item
[best_index
].line
;
2517 ALL_OBJFILES (objfile
)
2520 objfile
->sf
->qf
->expand_symtabs_with_fullname (objfile
,
2521 symtab_to_fullname (symtab
));
2524 ALL_SYMTABS (objfile
, s
)
2526 struct linetable
*l
;
2529 if (FILENAME_CMP (symtab
->filename
, s
->filename
) != 0)
2531 if (FILENAME_CMP (symtab_to_fullname (symtab
),
2532 symtab_to_fullname (s
)) != 0)
2535 ind
= find_line_common (l
, line
, &exact
, 0);
2545 if (best
== 0 || l
->item
[ind
].line
< best
)
2547 best
= l
->item
[ind
].line
;
2560 *index
= best_index
;
2562 *exact_match
= exact
;
2567 /* Given SYMTAB, returns all the PCs function in the symtab that
2568 exactly match LINE. Returns NULL if there are no exact matches,
2569 but updates BEST_ITEM in this case. */
2572 find_pcs_for_symtab_line (struct symtab
*symtab
, int line
,
2573 struct linetable_entry
**best_item
)
2576 VEC (CORE_ADDR
) *result
= NULL
;
2578 /* First, collect all the PCs that are at this line. */
2584 idx
= find_line_common (LINETABLE (symtab
), line
, &was_exact
, start
);
2590 struct linetable_entry
*item
= &LINETABLE (symtab
)->item
[idx
];
2592 if (*best_item
== NULL
|| item
->line
< (*best_item
)->line
)
2598 VEC_safe_push (CORE_ADDR
, result
, LINETABLE (symtab
)->item
[idx
].pc
);
2606 /* Set the PC value for a given source file and line number and return true.
2607 Returns zero for invalid line number (and sets the PC to 0).
2608 The source file is specified with a struct symtab. */
2611 find_line_pc (struct symtab
*symtab
, int line
, CORE_ADDR
*pc
)
2613 struct linetable
*l
;
2620 symtab
= find_line_symtab (symtab
, line
, &ind
, NULL
);
2623 l
= LINETABLE (symtab
);
2624 *pc
= l
->item
[ind
].pc
;
2631 /* Find the range of pc values in a line.
2632 Store the starting pc of the line into *STARTPTR
2633 and the ending pc (start of next line) into *ENDPTR.
2634 Returns 1 to indicate success.
2635 Returns 0 if could not find the specified line. */
2638 find_line_pc_range (struct symtab_and_line sal
, CORE_ADDR
*startptr
,
2641 CORE_ADDR startaddr
;
2642 struct symtab_and_line found_sal
;
2645 if (startaddr
== 0 && !find_line_pc (sal
.symtab
, sal
.line
, &startaddr
))
2648 /* This whole function is based on address. For example, if line 10 has
2649 two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then
2650 "info line *0x123" should say the line goes from 0x100 to 0x200
2651 and "info line *0x355" should say the line goes from 0x300 to 0x400.
2652 This also insures that we never give a range like "starts at 0x134
2653 and ends at 0x12c". */
2655 found_sal
= find_pc_sect_line (startaddr
, sal
.section
, 0);
2656 if (found_sal
.line
!= sal
.line
)
2658 /* The specified line (sal) has zero bytes. */
2659 *startptr
= found_sal
.pc
;
2660 *endptr
= found_sal
.pc
;
2664 *startptr
= found_sal
.pc
;
2665 *endptr
= found_sal
.end
;
2670 /* Given a line table and a line number, return the index into the line
2671 table for the pc of the nearest line whose number is >= the specified one.
2672 Return -1 if none is found. The value is >= 0 if it is an index.
2673 START is the index at which to start searching the line table.
2675 Set *EXACT_MATCH nonzero if the value returned is an exact match. */
2678 find_line_common (struct linetable
*l
, int lineno
,
2679 int *exact_match
, int start
)
2684 /* BEST is the smallest linenumber > LINENO so far seen,
2685 or 0 if none has been seen so far.
2686 BEST_INDEX identifies the item for it. */
2688 int best_index
= -1;
2699 for (i
= start
; i
< len
; i
++)
2701 struct linetable_entry
*item
= &(l
->item
[i
]);
2703 if (item
->line
== lineno
)
2705 /* Return the first (lowest address) entry which matches. */
2710 if (item
->line
> lineno
&& (best
== 0 || item
->line
< best
))
2717 /* If we got here, we didn't get an exact match. */
2722 find_pc_line_pc_range (CORE_ADDR pc
, CORE_ADDR
*startptr
, CORE_ADDR
*endptr
)
2724 struct symtab_and_line sal
;
2726 sal
= find_pc_line (pc
, 0);
2729 return sal
.symtab
!= 0;
2732 /* Given a function start address FUNC_ADDR and SYMTAB, find the first
2733 address for that function that has an entry in SYMTAB's line info
2734 table. If such an entry cannot be found, return FUNC_ADDR
2738 skip_prologue_using_lineinfo (CORE_ADDR func_addr
, struct symtab
*symtab
)
2740 CORE_ADDR func_start
, func_end
;
2741 struct linetable
*l
;
2744 /* Give up if this symbol has no lineinfo table. */
2745 l
= LINETABLE (symtab
);
2749 /* Get the range for the function's PC values, or give up if we
2750 cannot, for some reason. */
2751 if (!find_pc_partial_function (func_addr
, NULL
, &func_start
, &func_end
))
2754 /* Linetable entries are ordered by PC values, see the commentary in
2755 symtab.h where `struct linetable' is defined. Thus, the first
2756 entry whose PC is in the range [FUNC_START..FUNC_END[ is the
2757 address we are looking for. */
2758 for (i
= 0; i
< l
->nitems
; i
++)
2760 struct linetable_entry
*item
= &(l
->item
[i
]);
2762 /* Don't use line numbers of zero, they mark special entries in
2763 the table. See the commentary on symtab.h before the
2764 definition of struct linetable. */
2765 if (item
->line
> 0 && func_start
<= item
->pc
&& item
->pc
< func_end
)
2772 /* Given a function symbol SYM, find the symtab and line for the start
2774 If the argument FUNFIRSTLINE is nonzero, we want the first line
2775 of real code inside the function. */
2777 struct symtab_and_line
2778 find_function_start_sal (struct symbol
*sym
, int funfirstline
)
2780 struct symtab_and_line sal
;
2782 fixup_symbol_section (sym
, NULL
);
2783 sal
= find_pc_sect_line (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)),
2784 SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
), 0);
2786 /* We always should have a line for the function start address.
2787 If we don't, something is odd. Create a plain SAL refering
2788 just the PC and hope that skip_prologue_sal (if requested)
2789 can find a line number for after the prologue. */
2790 if (sal
.pc
< BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)))
2793 sal
.pspace
= current_program_space
;
2794 sal
.pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2795 sal
.section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2799 skip_prologue_sal (&sal
);
2804 /* Adjust SAL to the first instruction past the function prologue.
2805 If the PC was explicitly specified, the SAL is not changed.
2806 If the line number was explicitly specified, at most the SAL's PC
2807 is updated. If SAL is already past the prologue, then do nothing. */
2810 skip_prologue_sal (struct symtab_and_line
*sal
)
2813 struct symtab_and_line start_sal
;
2814 struct cleanup
*old_chain
;
2815 CORE_ADDR pc
, saved_pc
;
2816 struct obj_section
*section
;
2818 struct objfile
*objfile
;
2819 struct gdbarch
*gdbarch
;
2820 struct block
*b
, *function_block
;
2821 int force_skip
, skip
;
2823 /* Do not change the SAL if PC was specified explicitly. */
2824 if (sal
->explicit_pc
)
2827 old_chain
= save_current_space_and_thread ();
2828 switch_to_program_space_and_thread (sal
->pspace
);
2830 sym
= find_pc_sect_function (sal
->pc
, sal
->section
);
2833 fixup_symbol_section (sym
, NULL
);
2835 pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2836 section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2837 name
= SYMBOL_LINKAGE_NAME (sym
);
2838 objfile
= SYMBOL_SYMTAB (sym
)->objfile
;
2842 struct bound_minimal_symbol msymbol
2843 = lookup_minimal_symbol_by_pc_section (sal
->pc
, sal
->section
);
2845 if (msymbol
.minsym
== NULL
)
2847 do_cleanups (old_chain
);
2851 objfile
= msymbol
.objfile
;
2852 pc
= SYMBOL_VALUE_ADDRESS (msymbol
.minsym
);
2853 section
= SYMBOL_OBJ_SECTION (objfile
, msymbol
.minsym
);
2854 name
= SYMBOL_LINKAGE_NAME (msymbol
.minsym
);
2857 gdbarch
= get_objfile_arch (objfile
);
2859 /* Process the prologue in two passes. In the first pass try to skip the
2860 prologue (SKIP is true) and verify there is a real need for it (indicated
2861 by FORCE_SKIP). If no such reason was found run a second pass where the
2862 prologue is not skipped (SKIP is false). */
2867 /* Be conservative - allow direct PC (without skipping prologue) only if we
2868 have proven the CU (Compilation Unit) supports it. sal->SYMTAB does not
2869 have to be set by the caller so we use SYM instead. */
2870 if (sym
&& SYMBOL_SYMTAB (sym
)->locations_valid
)
2878 /* If the function is in an unmapped overlay, use its unmapped LMA address,
2879 so that gdbarch_skip_prologue has something unique to work on. */
2880 if (section_is_overlay (section
) && !section_is_mapped (section
))
2881 pc
= overlay_unmapped_address (pc
, section
);
2883 /* Skip "first line" of function (which is actually its prologue). */
2884 pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
2886 pc
= gdbarch_skip_prologue (gdbarch
, pc
);
2888 /* For overlays, map pc back into its mapped VMA range. */
2889 pc
= overlay_mapped_address (pc
, section
);
2891 /* Calculate line number. */
2892 start_sal
= find_pc_sect_line (pc
, section
, 0);
2894 /* Check if gdbarch_skip_prologue left us in mid-line, and the next
2895 line is still part of the same function. */
2896 if (skip
&& start_sal
.pc
!= pc
2897 && (sym
? (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)) <= start_sal
.end
2898 && start_sal
.end
< BLOCK_END (SYMBOL_BLOCK_VALUE (sym
)))
2899 : (lookup_minimal_symbol_by_pc_section (start_sal
.end
, section
).minsym
2900 == lookup_minimal_symbol_by_pc_section (pc
, section
).minsym
)))
2902 /* First pc of next line */
2904 /* Recalculate the line number (might not be N+1). */
2905 start_sal
= find_pc_sect_line (pc
, section
, 0);
2908 /* On targets with executable formats that don't have a concept of
2909 constructors (ELF with .init has, PE doesn't), gcc emits a call
2910 to `__main' in `main' between the prologue and before user
2912 if (gdbarch_skip_main_prologue_p (gdbarch
)
2913 && name
&& strcmp_iw (name
, "main") == 0)
2915 pc
= gdbarch_skip_main_prologue (gdbarch
, pc
);
2916 /* Recalculate the line number (might not be N+1). */
2917 start_sal
= find_pc_sect_line (pc
, section
, 0);
2921 while (!force_skip
&& skip
--);
2923 /* If we still don't have a valid source line, try to find the first
2924 PC in the lineinfo table that belongs to the same function. This
2925 happens with COFF debug info, which does not seem to have an
2926 entry in lineinfo table for the code after the prologue which has
2927 no direct relation to source. For example, this was found to be
2928 the case with the DJGPP target using "gcc -gcoff" when the
2929 compiler inserted code after the prologue to make sure the stack
2931 if (!force_skip
&& sym
&& start_sal
.symtab
== NULL
)
2933 pc
= skip_prologue_using_lineinfo (pc
, SYMBOL_SYMTAB (sym
));
2934 /* Recalculate the line number. */
2935 start_sal
= find_pc_sect_line (pc
, section
, 0);
2938 do_cleanups (old_chain
);
2940 /* If we're already past the prologue, leave SAL unchanged. Otherwise
2941 forward SAL to the end of the prologue. */
2946 sal
->section
= section
;
2948 /* Unless the explicit_line flag was set, update the SAL line
2949 and symtab to correspond to the modified PC location. */
2950 if (sal
->explicit_line
)
2953 sal
->symtab
= start_sal
.symtab
;
2954 sal
->line
= start_sal
.line
;
2955 sal
->end
= start_sal
.end
;
2957 /* Check if we are now inside an inlined function. If we can,
2958 use the call site of the function instead. */
2959 b
= block_for_pc_sect (sal
->pc
, sal
->section
);
2960 function_block
= NULL
;
2963 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
2965 else if (BLOCK_FUNCTION (b
) != NULL
)
2967 b
= BLOCK_SUPERBLOCK (b
);
2969 if (function_block
!= NULL
2970 && SYMBOL_LINE (BLOCK_FUNCTION (function_block
)) != 0)
2972 sal
->line
= SYMBOL_LINE (BLOCK_FUNCTION (function_block
));
2973 sal
->symtab
= SYMBOL_SYMTAB (BLOCK_FUNCTION (function_block
));
2977 /* If P is of the form "operator[ \t]+..." where `...' is
2978 some legitimate operator text, return a pointer to the
2979 beginning of the substring of the operator text.
2980 Otherwise, return "". */
2983 operator_chars (char *p
, char **end
)
2986 if (strncmp (p
, "operator", 8))
2990 /* Don't get faked out by `operator' being part of a longer
2992 if (isalpha (*p
) || *p
== '_' || *p
== '$' || *p
== '\0')
2995 /* Allow some whitespace between `operator' and the operator symbol. */
2996 while (*p
== ' ' || *p
== '\t')
2999 /* Recognize 'operator TYPENAME'. */
3001 if (isalpha (*p
) || *p
== '_' || *p
== '$')
3005 while (isalnum (*q
) || *q
== '_' || *q
== '$')
3014 case '\\': /* regexp quoting */
3017 if (p
[2] == '=') /* 'operator\*=' */
3019 else /* 'operator\*' */
3023 else if (p
[1] == '[')
3026 error (_("mismatched quoting on brackets, "
3027 "try 'operator\\[\\]'"));
3028 else if (p
[2] == '\\' && p
[3] == ']')
3030 *end
= p
+ 4; /* 'operator\[\]' */
3034 error (_("nothing is allowed between '[' and ']'"));
3038 /* Gratuitous qoute: skip it and move on. */
3060 if (p
[0] == '-' && p
[1] == '>')
3062 /* Struct pointer member operator 'operator->'. */
3065 *end
= p
+ 3; /* 'operator->*' */
3068 else if (p
[2] == '\\')
3070 *end
= p
+ 4; /* Hopefully 'operator->\*' */
3075 *end
= p
+ 2; /* 'operator->' */
3079 if (p
[1] == '=' || p
[1] == p
[0])
3090 error (_("`operator ()' must be specified "
3091 "without whitespace in `()'"));
3096 error (_("`operator ?:' must be specified "
3097 "without whitespace in `?:'"));
3102 error (_("`operator []' must be specified "
3103 "without whitespace in `[]'"));
3107 error (_("`operator %s' not supported"), p
);
3116 /* Cache to watch for file names already seen by filename_seen. */
3118 struct filename_seen_cache
3120 /* Table of files seen so far. */
3122 /* Initial size of the table. It automagically grows from here. */
3123 #define INITIAL_FILENAME_SEEN_CACHE_SIZE 100
3126 /* filename_seen_cache constructor. */
3128 static struct filename_seen_cache
*
3129 create_filename_seen_cache (void)
3131 struct filename_seen_cache
*cache
;
3133 cache
= XNEW (struct filename_seen_cache
);
3134 cache
->tab
= htab_create_alloc (INITIAL_FILENAME_SEEN_CACHE_SIZE
,
3135 filename_hash
, filename_eq
,
3136 NULL
, xcalloc
, xfree
);
3141 /* Empty the cache, but do not delete it. */
3144 clear_filename_seen_cache (struct filename_seen_cache
*cache
)
3146 htab_empty (cache
->tab
);
3149 /* filename_seen_cache destructor.
3150 This takes a void * argument as it is generally used as a cleanup. */
3153 delete_filename_seen_cache (void *ptr
)
3155 struct filename_seen_cache
*cache
= ptr
;
3157 htab_delete (cache
->tab
);
3161 /* If FILE is not already in the table of files in CACHE, return zero;
3162 otherwise return non-zero. Optionally add FILE to the table if ADD
3165 NOTE: We don't manage space for FILE, we assume FILE lives as long
3166 as the caller needs. */
3169 filename_seen (struct filename_seen_cache
*cache
, const char *file
, int add
)
3173 /* Is FILE in tab? */
3174 slot
= htab_find_slot (cache
->tab
, file
, add
? INSERT
: NO_INSERT
);
3178 /* No; maybe add it to tab. */
3180 *slot
= (char *) file
;
3185 /* Data structure to maintain printing state for output_source_filename. */
3187 struct output_source_filename_data
3189 /* Cache of what we've seen so far. */
3190 struct filename_seen_cache
*filename_seen_cache
;
3192 /* Flag of whether we're printing the first one. */
3196 /* Slave routine for sources_info. Force line breaks at ,'s.
3197 NAME is the name to print.
3198 DATA contains the state for printing and watching for duplicates. */
3201 output_source_filename (const char *name
,
3202 struct output_source_filename_data
*data
)
3204 /* Since a single source file can result in several partial symbol
3205 tables, we need to avoid printing it more than once. Note: if
3206 some of the psymtabs are read in and some are not, it gets
3207 printed both under "Source files for which symbols have been
3208 read" and "Source files for which symbols will be read in on
3209 demand". I consider this a reasonable way to deal with the
3210 situation. I'm not sure whether this can also happen for
3211 symtabs; it doesn't hurt to check. */
3213 /* Was NAME already seen? */
3214 if (filename_seen (data
->filename_seen_cache
, name
, 1))
3216 /* Yes; don't print it again. */
3220 /* No; print it and reset *FIRST. */
3222 printf_filtered (", ");
3226 fputs_filtered (name
, gdb_stdout
);
3229 /* A callback for map_partial_symbol_filenames. */
3232 output_partial_symbol_filename (const char *filename
, const char *fullname
,
3235 output_source_filename (fullname
? fullname
: filename
, data
);
3239 sources_info (char *ignore
, int from_tty
)
3242 struct objfile
*objfile
;
3243 struct output_source_filename_data data
;
3244 struct cleanup
*cleanups
;
3246 if (!have_full_symbols () && !have_partial_symbols ())
3248 error (_("No symbol table is loaded. Use the \"file\" command."));
3251 data
.filename_seen_cache
= create_filename_seen_cache ();
3252 cleanups
= make_cleanup (delete_filename_seen_cache
,
3253 data
.filename_seen_cache
);
3255 printf_filtered ("Source files for which symbols have been read in:\n\n");
3258 ALL_SYMTABS (objfile
, s
)
3260 const char *fullname
= symtab_to_fullname (s
);
3262 output_source_filename (fullname
, &data
);
3264 printf_filtered ("\n\n");
3266 printf_filtered ("Source files for which symbols "
3267 "will be read in on demand:\n\n");
3269 clear_filename_seen_cache (data
.filename_seen_cache
);
3271 map_partial_symbol_filenames (output_partial_symbol_filename
, &data
,
3272 1 /*need_fullname*/);
3273 printf_filtered ("\n");
3275 do_cleanups (cleanups
);
3278 /* Compare FILE against all the NFILES entries of FILES. If BASENAMES is
3279 non-zero compare only lbasename of FILES. */
3282 file_matches (const char *file
, char *files
[], int nfiles
, int basenames
)
3286 if (file
!= NULL
&& nfiles
!= 0)
3288 for (i
= 0; i
< nfiles
; i
++)
3290 if (compare_filenames_for_search (file
, (basenames
3291 ? lbasename (files
[i
])
3296 else if (nfiles
== 0)
3301 /* Free any memory associated with a search. */
3304 free_search_symbols (struct symbol_search
*symbols
)
3306 struct symbol_search
*p
;
3307 struct symbol_search
*next
;
3309 for (p
= symbols
; p
!= NULL
; p
= next
)
3317 do_free_search_symbols_cleanup (void *symbolsp
)
3319 struct symbol_search
*symbols
= *(struct symbol_search
**) symbolsp
;
3321 free_search_symbols (symbols
);
3325 make_cleanup_free_search_symbols (struct symbol_search
**symbolsp
)
3327 return make_cleanup (do_free_search_symbols_cleanup
, symbolsp
);
3330 /* Helper function for sort_search_symbols_remove_dups and qsort. Can only
3331 sort symbols, not minimal symbols. */
3334 compare_search_syms (const void *sa
, const void *sb
)
3336 struct symbol_search
*sym_a
= *(struct symbol_search
**) sa
;
3337 struct symbol_search
*sym_b
= *(struct symbol_search
**) sb
;
3340 c
= FILENAME_CMP (sym_a
->symtab
->filename
, sym_b
->symtab
->filename
);
3344 if (sym_a
->block
!= sym_b
->block
)
3345 return sym_a
->block
- sym_b
->block
;
3347 return strcmp (SYMBOL_PRINT_NAME (sym_a
->symbol
),
3348 SYMBOL_PRINT_NAME (sym_b
->symbol
));
3351 /* Sort the NFOUND symbols in list FOUND and remove duplicates.
3352 The duplicates are freed, and the new list is returned in
3353 *NEW_HEAD, *NEW_TAIL. */
3356 sort_search_symbols_remove_dups (struct symbol_search
*found
, int nfound
,
3357 struct symbol_search
**new_head
,
3358 struct symbol_search
**new_tail
)
3360 struct symbol_search
**symbols
, *symp
, *old_next
;
3363 gdb_assert (found
!= NULL
&& nfound
> 0);
3365 /* Build an array out of the list so we can easily sort them. */
3366 symbols
= (struct symbol_search
**) xmalloc (sizeof (struct symbol_search
*)
3369 for (i
= 0; i
< nfound
; i
++)
3371 gdb_assert (symp
!= NULL
);
3372 gdb_assert (symp
->block
>= 0 && symp
->block
<= 1);
3376 gdb_assert (symp
== NULL
);
3378 qsort (symbols
, nfound
, sizeof (struct symbol_search
*),
3379 compare_search_syms
);
3381 /* Collapse out the dups. */
3382 for (i
= 1, j
= 1; i
< nfound
; ++i
)
3384 if (compare_search_syms (&symbols
[j
- 1], &symbols
[i
]) != 0)
3385 symbols
[j
++] = symbols
[i
];
3390 symbols
[j
- 1]->next
= NULL
;
3392 /* Rebuild the linked list. */
3393 for (i
= 0; i
< nunique
- 1; i
++)
3394 symbols
[i
]->next
= symbols
[i
+ 1];
3395 symbols
[nunique
- 1]->next
= NULL
;
3397 *new_head
= symbols
[0];
3398 *new_tail
= symbols
[nunique
- 1];
3402 /* An object of this type is passed as the user_data to the
3403 expand_symtabs_matching method. */
3404 struct search_symbols_data
3409 /* It is true if PREG contains valid data, false otherwise. */
3410 unsigned preg_p
: 1;
3414 /* A callback for expand_symtabs_matching. */
3417 search_symbols_file_matches (const char *filename
, void *user_data
,
3420 struct search_symbols_data
*data
= user_data
;
3422 return file_matches (filename
, data
->files
, data
->nfiles
, basenames
);
3425 /* A callback for expand_symtabs_matching. */
3428 search_symbols_name_matches (const char *symname
, void *user_data
)
3430 struct search_symbols_data
*data
= user_data
;
3432 return !data
->preg_p
|| regexec (&data
->preg
, symname
, 0, NULL
, 0) == 0;
3435 /* Search the symbol table for matches to the regular expression REGEXP,
3436 returning the results in *MATCHES.
3438 Only symbols of KIND are searched:
3439 VARIABLES_DOMAIN - search all symbols, excluding functions, type names,
3440 and constants (enums)
3441 FUNCTIONS_DOMAIN - search all functions
3442 TYPES_DOMAIN - search all type names
3443 ALL_DOMAIN - an internal error for this function
3445 free_search_symbols should be called when *MATCHES is no longer needed.
3447 Within each file the results are sorted locally; each symtab's global and
3448 static blocks are separately alphabetized.
3449 Duplicate entries are removed. */
3452 search_symbols (char *regexp
, enum search_domain kind
,
3453 int nfiles
, char *files
[],
3454 struct symbol_search
**matches
)
3457 struct blockvector
*bv
;
3460 struct block_iterator iter
;
3462 struct objfile
*objfile
;
3463 struct minimal_symbol
*msymbol
;
3465 static const enum minimal_symbol_type types
[]
3466 = {mst_data
, mst_text
, mst_abs
};
3467 static const enum minimal_symbol_type types2
[]
3468 = {mst_bss
, mst_file_text
, mst_abs
};
3469 static const enum minimal_symbol_type types3
[]
3470 = {mst_file_data
, mst_solib_trampoline
, mst_abs
};
3471 static const enum minimal_symbol_type types4
[]
3472 = {mst_file_bss
, mst_text_gnu_ifunc
, mst_abs
};
3473 enum minimal_symbol_type ourtype
;
3474 enum minimal_symbol_type ourtype2
;
3475 enum minimal_symbol_type ourtype3
;
3476 enum minimal_symbol_type ourtype4
;
3477 struct symbol_search
*found
;
3478 struct symbol_search
*tail
;
3479 struct search_symbols_data datum
;
3482 /* OLD_CHAIN .. RETVAL_CHAIN is always freed, RETVAL_CHAIN .. current
3483 CLEANUP_CHAIN is freed only in the case of an error. */
3484 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
3485 struct cleanup
*retval_chain
;
3487 gdb_assert (kind
<= TYPES_DOMAIN
);
3489 ourtype
= types
[kind
];
3490 ourtype2
= types2
[kind
];
3491 ourtype3
= types3
[kind
];
3492 ourtype4
= types4
[kind
];
3499 /* Make sure spacing is right for C++ operators.
3500 This is just a courtesy to make the matching less sensitive
3501 to how many spaces the user leaves between 'operator'
3502 and <TYPENAME> or <OPERATOR>. */
3504 char *opname
= operator_chars (regexp
, &opend
);
3509 int fix
= -1; /* -1 means ok; otherwise number of
3512 if (isalpha (*opname
) || *opname
== '_' || *opname
== '$')
3514 /* There should 1 space between 'operator' and 'TYPENAME'. */
3515 if (opname
[-1] != ' ' || opname
[-2] == ' ')
3520 /* There should 0 spaces between 'operator' and 'OPERATOR'. */
3521 if (opname
[-1] == ' ')
3524 /* If wrong number of spaces, fix it. */
3527 char *tmp
= (char *) alloca (8 + fix
+ strlen (opname
) + 1);
3529 sprintf (tmp
, "operator%.*s%s", fix
, " ", opname
);
3534 errcode
= regcomp (&datum
.preg
, regexp
,
3535 REG_NOSUB
| (case_sensitivity
== case_sensitive_off
3539 char *err
= get_regcomp_error (errcode
, &datum
.preg
);
3541 make_cleanup (xfree
, err
);
3542 error (_("Invalid regexp (%s): %s"), err
, regexp
);
3545 make_regfree_cleanup (&datum
.preg
);
3548 /* Search through the partial symtabs *first* for all symbols
3549 matching the regexp. That way we don't have to reproduce all of
3550 the machinery below. */
3552 datum
.nfiles
= nfiles
;
3553 datum
.files
= files
;
3554 ALL_OBJFILES (objfile
)
3557 objfile
->sf
->qf
->expand_symtabs_matching (objfile
,
3560 : search_symbols_file_matches
),
3561 search_symbols_name_matches
,
3566 /* Here, we search through the minimal symbol tables for functions
3567 and variables that match, and force their symbols to be read.
3568 This is in particular necessary for demangled variable names,
3569 which are no longer put into the partial symbol tables.
3570 The symbol will then be found during the scan of symtabs below.
3572 For functions, find_pc_symtab should succeed if we have debug info
3573 for the function, for variables we have to call
3574 lookup_symbol_in_objfile_from_linkage_name to determine if the variable
3576 If the lookup fails, set found_misc so that we will rescan to print
3577 any matching symbols without debug info.
3578 We only search the objfile the msymbol came from, we no longer search
3579 all objfiles. In large programs (1000s of shared libs) searching all
3580 objfiles is not worth the pain. */
3582 if (nfiles
== 0 && (kind
== VARIABLES_DOMAIN
|| kind
== FUNCTIONS_DOMAIN
))
3584 ALL_MSYMBOLS (objfile
, msymbol
)
3588 if (msymbol
->created_by_gdb
)
3591 if (MSYMBOL_TYPE (msymbol
) == ourtype
3592 || MSYMBOL_TYPE (msymbol
) == ourtype2
3593 || MSYMBOL_TYPE (msymbol
) == ourtype3
3594 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3597 || regexec (&datum
.preg
, SYMBOL_NATURAL_NAME (msymbol
), 0,
3600 /* Note: An important side-effect of these lookup functions
3601 is to expand the symbol table if msymbol is found, for the
3602 benefit of the next loop on ALL_PRIMARY_SYMTABS. */
3603 if (kind
== FUNCTIONS_DOMAIN
3604 ? find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
)) == NULL
3605 : (lookup_symbol_in_objfile_from_linkage_name
3606 (objfile
, SYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3617 retval_chain
= make_cleanup_free_search_symbols (&found
);
3619 ALL_PRIMARY_SYMTABS (objfile
, s
)
3621 bv
= BLOCKVECTOR (s
);
3622 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
3624 b
= BLOCKVECTOR_BLOCK (bv
, i
);
3625 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
3627 struct symtab
*real_symtab
= SYMBOL_SYMTAB (sym
);
3631 /* Check first sole REAL_SYMTAB->FILENAME. It does not need to be
3632 a substring of symtab_to_fullname as it may contain "./" etc. */
3633 if ((file_matches (real_symtab
->filename
, files
, nfiles
, 0)
3634 || ((basenames_may_differ
3635 || file_matches (lbasename (real_symtab
->filename
),
3637 && file_matches (symtab_to_fullname (real_symtab
),
3640 || regexec (&datum
.preg
, SYMBOL_NATURAL_NAME (sym
), 0,
3642 && ((kind
== VARIABLES_DOMAIN
3643 && SYMBOL_CLASS (sym
) != LOC_TYPEDEF
3644 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
3645 && SYMBOL_CLASS (sym
) != LOC_BLOCK
3646 /* LOC_CONST can be used for more than just enums,
3647 e.g., c++ static const members.
3648 We only want to skip enums here. */
3649 && !(SYMBOL_CLASS (sym
) == LOC_CONST
3650 && TYPE_CODE (SYMBOL_TYPE (sym
))
3652 || (kind
== FUNCTIONS_DOMAIN
3653 && SYMBOL_CLASS (sym
) == LOC_BLOCK
)
3654 || (kind
== TYPES_DOMAIN
3655 && SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))))
3658 struct symbol_search
*psr
= (struct symbol_search
*)
3659 xmalloc (sizeof (struct symbol_search
));
3661 psr
->symtab
= real_symtab
;
3663 memset (&psr
->msymbol
, 0, sizeof (psr
->msymbol
));
3678 sort_search_symbols_remove_dups (found
, nfound
, &found
, &tail
);
3679 /* Note: nfound is no longer useful beyond this point. */
3682 /* If there are no eyes, avoid all contact. I mean, if there are
3683 no debug symbols, then print directly from the msymbol_vector. */
3685 if (found_misc
|| (nfiles
== 0 && kind
!= FUNCTIONS_DOMAIN
))
3687 ALL_MSYMBOLS (objfile
, msymbol
)
3691 if (msymbol
->created_by_gdb
)
3694 if (MSYMBOL_TYPE (msymbol
) == ourtype
3695 || MSYMBOL_TYPE (msymbol
) == ourtype2
3696 || MSYMBOL_TYPE (msymbol
) == ourtype3
3697 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3700 || regexec (&datum
.preg
, SYMBOL_NATURAL_NAME (msymbol
), 0,
3703 /* For functions we can do a quick check of whether the
3704 symbol might be found via find_pc_symtab. */
3705 if (kind
!= FUNCTIONS_DOMAIN
3706 || find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
)) == NULL
)
3708 if (lookup_symbol_in_objfile_from_linkage_name
3709 (objfile
, SYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3713 struct symbol_search
*psr
= (struct symbol_search
*)
3714 xmalloc (sizeof (struct symbol_search
));
3716 psr
->msymbol
.minsym
= msymbol
;
3717 psr
->msymbol
.objfile
= objfile
;
3733 discard_cleanups (retval_chain
);
3734 do_cleanups (old_chain
);
3738 /* Helper function for symtab_symbol_info, this function uses
3739 the data returned from search_symbols() to print information
3740 regarding the match to gdb_stdout. */
3743 print_symbol_info (enum search_domain kind
,
3744 struct symtab
*s
, struct symbol
*sym
,
3745 int block
, const char *last
)
3747 const char *s_filename
= symtab_to_filename_for_display (s
);
3749 if (last
== NULL
|| filename_cmp (last
, s_filename
) != 0)
3751 fputs_filtered ("\nFile ", gdb_stdout
);
3752 fputs_filtered (s_filename
, gdb_stdout
);
3753 fputs_filtered (":\n", gdb_stdout
);
3756 if (kind
!= TYPES_DOMAIN
&& block
== STATIC_BLOCK
)
3757 printf_filtered ("static ");
3759 /* Typedef that is not a C++ class. */
3760 if (kind
== TYPES_DOMAIN
3761 && SYMBOL_DOMAIN (sym
) != STRUCT_DOMAIN
)
3762 typedef_print (SYMBOL_TYPE (sym
), sym
, gdb_stdout
);
3763 /* variable, func, or typedef-that-is-c++-class. */
3764 else if (kind
< TYPES_DOMAIN
3765 || (kind
== TYPES_DOMAIN
3766 && SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
))
3768 type_print (SYMBOL_TYPE (sym
),
3769 (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
3770 ? "" : SYMBOL_PRINT_NAME (sym
)),
3773 printf_filtered (";\n");
3777 /* This help function for symtab_symbol_info() prints information
3778 for non-debugging symbols to gdb_stdout. */
3781 print_msymbol_info (struct bound_minimal_symbol msymbol
)
3783 struct gdbarch
*gdbarch
= get_objfile_arch (msymbol
.objfile
);
3786 if (gdbarch_addr_bit (gdbarch
) <= 32)
3787 tmp
= hex_string_custom (SYMBOL_VALUE_ADDRESS (msymbol
.minsym
)
3788 & (CORE_ADDR
) 0xffffffff,
3791 tmp
= hex_string_custom (SYMBOL_VALUE_ADDRESS (msymbol
.minsym
),
3793 printf_filtered ("%s %s\n",
3794 tmp
, SYMBOL_PRINT_NAME (msymbol
.minsym
));
3797 /* This is the guts of the commands "info functions", "info types", and
3798 "info variables". It calls search_symbols to find all matches and then
3799 print_[m]symbol_info to print out some useful information about the
3803 symtab_symbol_info (char *regexp
, enum search_domain kind
, int from_tty
)
3805 static const char * const classnames
[] =
3806 {"variable", "function", "type"};
3807 struct symbol_search
*symbols
;
3808 struct symbol_search
*p
;
3809 struct cleanup
*old_chain
;
3810 const char *last_filename
= NULL
;
3813 gdb_assert (kind
<= TYPES_DOMAIN
);
3815 /* Must make sure that if we're interrupted, symbols gets freed. */
3816 search_symbols (regexp
, kind
, 0, (char **) NULL
, &symbols
);
3817 old_chain
= make_cleanup_free_search_symbols (&symbols
);
3820 printf_filtered (_("All %ss matching regular expression \"%s\":\n"),
3821 classnames
[kind
], regexp
);
3823 printf_filtered (_("All defined %ss:\n"), classnames
[kind
]);
3825 for (p
= symbols
; p
!= NULL
; p
= p
->next
)
3829 if (p
->msymbol
.minsym
!= NULL
)
3833 printf_filtered (_("\nNon-debugging symbols:\n"));
3836 print_msymbol_info (p
->msymbol
);
3840 print_symbol_info (kind
,
3845 last_filename
= symtab_to_filename_for_display (p
->symtab
);
3849 do_cleanups (old_chain
);
3853 variables_info (char *regexp
, int from_tty
)
3855 symtab_symbol_info (regexp
, VARIABLES_DOMAIN
, from_tty
);
3859 functions_info (char *regexp
, int from_tty
)
3861 symtab_symbol_info (regexp
, FUNCTIONS_DOMAIN
, from_tty
);
3866 types_info (char *regexp
, int from_tty
)
3868 symtab_symbol_info (regexp
, TYPES_DOMAIN
, from_tty
);
3871 /* Breakpoint all functions matching regular expression. */
3874 rbreak_command_wrapper (char *regexp
, int from_tty
)
3876 rbreak_command (regexp
, from_tty
);
3879 /* A cleanup function that calls end_rbreak_breakpoints. */
3882 do_end_rbreak_breakpoints (void *ignore
)
3884 end_rbreak_breakpoints ();
3888 rbreak_command (char *regexp
, int from_tty
)
3890 struct symbol_search
*ss
;
3891 struct symbol_search
*p
;
3892 struct cleanup
*old_chain
;
3893 char *string
= NULL
;
3895 char **files
= NULL
, *file_name
;
3900 char *colon
= strchr (regexp
, ':');
3902 if (colon
&& *(colon
+ 1) != ':')
3906 colon_index
= colon
- regexp
;
3907 file_name
= alloca (colon_index
+ 1);
3908 memcpy (file_name
, regexp
, colon_index
);
3909 file_name
[colon_index
--] = 0;
3910 while (isspace (file_name
[colon_index
]))
3911 file_name
[colon_index
--] = 0;
3914 regexp
= skip_spaces (colon
+ 1);
3918 search_symbols (regexp
, FUNCTIONS_DOMAIN
, nfiles
, files
, &ss
);
3919 old_chain
= make_cleanup_free_search_symbols (&ss
);
3920 make_cleanup (free_current_contents
, &string
);
3922 start_rbreak_breakpoints ();
3923 make_cleanup (do_end_rbreak_breakpoints
, NULL
);
3924 for (p
= ss
; p
!= NULL
; p
= p
->next
)
3926 if (p
->msymbol
.minsym
== NULL
)
3928 const char *fullname
= symtab_to_fullname (p
->symtab
);
3930 int newlen
= (strlen (fullname
)
3931 + strlen (SYMBOL_LINKAGE_NAME (p
->symbol
))
3936 string
= xrealloc (string
, newlen
);
3939 strcpy (string
, fullname
);
3940 strcat (string
, ":'");
3941 strcat (string
, SYMBOL_LINKAGE_NAME (p
->symbol
));
3942 strcat (string
, "'");
3943 break_command (string
, from_tty
);
3944 print_symbol_info (FUNCTIONS_DOMAIN
,
3948 symtab_to_filename_for_display (p
->symtab
));
3952 int newlen
= (strlen (SYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
)) + 3);
3956 string
= xrealloc (string
, newlen
);
3959 strcpy (string
, "'");
3960 strcat (string
, SYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
));
3961 strcat (string
, "'");
3963 break_command (string
, from_tty
);
3964 printf_filtered ("<function, no debug info> %s;\n",
3965 SYMBOL_PRINT_NAME (p
->msymbol
.minsym
));
3969 do_cleanups (old_chain
);
3973 /* Evaluate if NAME matches SYM_TEXT and SYM_TEXT_LEN.
3975 Either sym_text[sym_text_len] != '(' and then we search for any
3976 symbol starting with SYM_TEXT text.
3978 Otherwise sym_text[sym_text_len] == '(' and then we require symbol name to
3979 be terminated at that point. Partial symbol tables do not have parameters
3983 compare_symbol_name (const char *name
, const char *sym_text
, int sym_text_len
)
3985 int (*ncmp
) (const char *, const char *, size_t);
3987 ncmp
= (case_sensitivity
== case_sensitive_on
? strncmp
: strncasecmp
);
3989 if (ncmp (name
, sym_text
, sym_text_len
) != 0)
3992 if (sym_text
[sym_text_len
] == '(')
3994 /* User searches for `name(someth...'. Require NAME to be terminated.
3995 Normally psymtabs and gdbindex have no parameter types so '\0' will be
3996 present but accept even parameters presence. In this case this
3997 function is in fact strcmp_iw but whitespace skipping is not supported
3998 for tab completion. */
4000 if (name
[sym_text_len
] != '\0' && name
[sym_text_len
] != '(')
4007 /* Free any memory associated with a completion list. */
4010 free_completion_list (VEC (char_ptr
) **list_ptr
)
4015 for (i
= 0; VEC_iterate (char_ptr
, *list_ptr
, i
, p
); ++i
)
4017 VEC_free (char_ptr
, *list_ptr
);
4020 /* Callback for make_cleanup. */
4023 do_free_completion_list (void *list
)
4025 free_completion_list (list
);
4028 /* Helper routine for make_symbol_completion_list. */
4030 static VEC (char_ptr
) *return_val
;
4032 #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \
4033 completion_list_add_name \
4034 (SYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word))
4036 /* Test to see if the symbol specified by SYMNAME (which is already
4037 demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN
4038 characters. If so, add it to the current completion list. */
4041 completion_list_add_name (const char *symname
,
4042 const char *sym_text
, int sym_text_len
,
4043 const char *text
, const char *word
)
4045 /* Clip symbols that cannot match. */
4046 if (!compare_symbol_name (symname
, sym_text
, sym_text_len
))
4049 /* We have a match for a completion, so add SYMNAME to the current list
4050 of matches. Note that the name is moved to freshly malloc'd space. */
4055 if (word
== sym_text
)
4057 new = xmalloc (strlen (symname
) + 5);
4058 strcpy (new, symname
);
4060 else if (word
> sym_text
)
4062 /* Return some portion of symname. */
4063 new = xmalloc (strlen (symname
) + 5);
4064 strcpy (new, symname
+ (word
- sym_text
));
4068 /* Return some of SYM_TEXT plus symname. */
4069 new = xmalloc (strlen (symname
) + (sym_text
- word
) + 5);
4070 strncpy (new, word
, sym_text
- word
);
4071 new[sym_text
- word
] = '\0';
4072 strcat (new, symname
);
4075 VEC_safe_push (char_ptr
, return_val
, new);
4079 /* ObjC: In case we are completing on a selector, look as the msymbol
4080 again and feed all the selectors into the mill. */
4083 completion_list_objc_symbol (struct minimal_symbol
*msymbol
,
4084 const char *sym_text
, int sym_text_len
,
4085 const char *text
, const char *word
)
4087 static char *tmp
= NULL
;
4088 static unsigned int tmplen
= 0;
4090 const char *method
, *category
, *selector
;
4093 method
= SYMBOL_NATURAL_NAME (msymbol
);
4095 /* Is it a method? */
4096 if ((method
[0] != '-') && (method
[0] != '+'))
4099 if (sym_text
[0] == '[')
4100 /* Complete on shortened method method. */
4101 completion_list_add_name (method
+ 1, sym_text
, sym_text_len
, text
, word
);
4103 while ((strlen (method
) + 1) >= tmplen
)
4109 tmp
= xrealloc (tmp
, tmplen
);
4111 selector
= strchr (method
, ' ');
4112 if (selector
!= NULL
)
4115 category
= strchr (method
, '(');
4117 if ((category
!= NULL
) && (selector
!= NULL
))
4119 memcpy (tmp
, method
, (category
- method
));
4120 tmp
[category
- method
] = ' ';
4121 memcpy (tmp
+ (category
- method
) + 1, selector
, strlen (selector
) + 1);
4122 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4123 if (sym_text
[0] == '[')
4124 completion_list_add_name (tmp
+ 1, sym_text
, sym_text_len
, text
, word
);
4127 if (selector
!= NULL
)
4129 /* Complete on selector only. */
4130 strcpy (tmp
, selector
);
4131 tmp2
= strchr (tmp
, ']');
4135 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4139 /* Break the non-quoted text based on the characters which are in
4140 symbols. FIXME: This should probably be language-specific. */
4143 language_search_unquoted_string (const char *text
, const char *p
)
4145 for (; p
> text
; --p
)
4147 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0')
4151 if ((current_language
->la_language
== language_objc
))
4153 if (p
[-1] == ':') /* Might be part of a method name. */
4155 else if (p
[-1] == '[' && (p
[-2] == '-' || p
[-2] == '+'))
4156 p
-= 2; /* Beginning of a method name. */
4157 else if (p
[-1] == ' ' || p
[-1] == '(' || p
[-1] == ')')
4158 { /* Might be part of a method name. */
4161 /* Seeing a ' ' or a '(' is not conclusive evidence
4162 that we are in the middle of a method name. However,
4163 finding "-[" or "+[" should be pretty un-ambiguous.
4164 Unfortunately we have to find it now to decide. */
4167 if (isalnum (t
[-1]) || t
[-1] == '_' ||
4168 t
[-1] == ' ' || t
[-1] == ':' ||
4169 t
[-1] == '(' || t
[-1] == ')')
4174 if (t
[-1] == '[' && (t
[-2] == '-' || t
[-2] == '+'))
4175 p
= t
- 2; /* Method name detected. */
4176 /* Else we leave with p unchanged. */
4186 completion_list_add_fields (struct symbol
*sym
, const char *sym_text
,
4187 int sym_text_len
, const char *text
,
4190 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4192 struct type
*t
= SYMBOL_TYPE (sym
);
4193 enum type_code c
= TYPE_CODE (t
);
4196 if (c
== TYPE_CODE_UNION
|| c
== TYPE_CODE_STRUCT
)
4197 for (j
= TYPE_N_BASECLASSES (t
); j
< TYPE_NFIELDS (t
); j
++)
4198 if (TYPE_FIELD_NAME (t
, j
))
4199 completion_list_add_name (TYPE_FIELD_NAME (t
, j
),
4200 sym_text
, sym_text_len
, text
, word
);
4204 /* Type of the user_data argument passed to add_macro_name or
4205 expand_partial_symbol_name. The contents are simply whatever is
4206 needed by completion_list_add_name. */
4207 struct add_name_data
4209 const char *sym_text
;
4215 /* A callback used with macro_for_each and macro_for_each_in_scope.
4216 This adds a macro's name to the current completion list. */
4219 add_macro_name (const char *name
, const struct macro_definition
*ignore
,
4220 struct macro_source_file
*ignore2
, int ignore3
,
4223 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4225 completion_list_add_name ((char *) name
,
4226 datum
->sym_text
, datum
->sym_text_len
,
4227 datum
->text
, datum
->word
);
4230 /* A callback for expand_partial_symbol_names. */
4233 expand_partial_symbol_name (const char *name
, void *user_data
)
4235 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4237 return compare_symbol_name (name
, datum
->sym_text
, datum
->sym_text_len
);
4241 default_make_symbol_completion_list_break_on (const char *text
,
4243 const char *break_on
,
4244 enum type_code code
)
4246 /* Problem: All of the symbols have to be copied because readline
4247 frees them. I'm not going to worry about this; hopefully there
4248 won't be that many. */
4252 struct minimal_symbol
*msymbol
;
4253 struct objfile
*objfile
;
4255 const struct block
*surrounding_static_block
, *surrounding_global_block
;
4256 struct block_iterator iter
;
4257 /* The symbol we are completing on. Points in same buffer as text. */
4258 const char *sym_text
;
4259 /* Length of sym_text. */
4261 struct add_name_data datum
;
4262 struct cleanup
*back_to
;
4264 /* Now look for the symbol we are supposed to complete on. */
4268 const char *quote_pos
= NULL
;
4270 /* First see if this is a quoted string. */
4272 for (p
= text
; *p
!= '\0'; ++p
)
4274 if (quote_found
!= '\0')
4276 if (*p
== quote_found
)
4277 /* Found close quote. */
4279 else if (*p
== '\\' && p
[1] == quote_found
)
4280 /* A backslash followed by the quote character
4281 doesn't end the string. */
4284 else if (*p
== '\'' || *p
== '"')
4290 if (quote_found
== '\'')
4291 /* A string within single quotes can be a symbol, so complete on it. */
4292 sym_text
= quote_pos
+ 1;
4293 else if (quote_found
== '"')
4294 /* A double-quoted string is never a symbol, nor does it make sense
4295 to complete it any other way. */
4301 /* It is not a quoted string. Break it based on the characters
4302 which are in symbols. */
4305 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0'
4306 || p
[-1] == ':' || strchr (break_on
, p
[-1]) != NULL
)
4315 sym_text_len
= strlen (sym_text
);
4317 /* Prepare SYM_TEXT_LEN for compare_symbol_name. */
4319 if (current_language
->la_language
== language_cplus
4320 || current_language
->la_language
== language_java
4321 || current_language
->la_language
== language_fortran
)
4323 /* These languages may have parameters entered by user but they are never
4324 present in the partial symbol tables. */
4326 const char *cs
= memchr (sym_text
, '(', sym_text_len
);
4329 sym_text_len
= cs
- sym_text
;
4331 gdb_assert (sym_text
[sym_text_len
] == '\0' || sym_text
[sym_text_len
] == '(');
4334 back_to
= make_cleanup (do_free_completion_list
, &return_val
);
4336 datum
.sym_text
= sym_text
;
4337 datum
.sym_text_len
= sym_text_len
;
4341 /* Look through the partial symtabs for all symbols which begin
4342 by matching SYM_TEXT. Expand all CUs that you find to the list.
4343 The real names will get added by COMPLETION_LIST_ADD_SYMBOL below. */
4344 expand_partial_symbol_names (expand_partial_symbol_name
, &datum
);
4346 /* At this point scan through the misc symbol vectors and add each
4347 symbol you find to the list. Eventually we want to ignore
4348 anything that isn't a text symbol (everything else will be
4349 handled by the psymtab code above). */
4351 if (code
== TYPE_CODE_UNDEF
)
4353 ALL_MSYMBOLS (objfile
, msymbol
)
4356 COMPLETION_LIST_ADD_SYMBOL (msymbol
, sym_text
, sym_text_len
, text
,
4359 completion_list_objc_symbol (msymbol
, sym_text
, sym_text_len
, text
,
4364 /* Search upwards from currently selected frame (so that we can
4365 complete on local vars). Also catch fields of types defined in
4366 this places which match our text string. Only complete on types
4367 visible from current context. */
4369 b
= get_selected_block (0);
4370 surrounding_static_block
= block_static_block (b
);
4371 surrounding_global_block
= block_global_block (b
);
4372 if (surrounding_static_block
!= NULL
)
4373 while (b
!= surrounding_static_block
)
4377 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4379 if (code
== TYPE_CODE_UNDEF
)
4381 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4383 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
,
4386 else if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4387 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
)
4388 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4392 /* Stop when we encounter an enclosing function. Do not stop for
4393 non-inlined functions - the locals of the enclosing function
4394 are in scope for a nested function. */
4395 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
4397 b
= BLOCK_SUPERBLOCK (b
);
4400 /* Add fields from the file's types; symbols will be added below. */
4402 if (code
== TYPE_CODE_UNDEF
)
4404 if (surrounding_static_block
!= NULL
)
4405 ALL_BLOCK_SYMBOLS (surrounding_static_block
, iter
, sym
)
4406 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4408 if (surrounding_global_block
!= NULL
)
4409 ALL_BLOCK_SYMBOLS (surrounding_global_block
, iter
, sym
)
4410 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4413 /* Go through the symtabs and check the externs and statics for
4414 symbols which match. */
4416 ALL_PRIMARY_SYMTABS (objfile
, s
)
4419 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4420 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4422 if (code
== TYPE_CODE_UNDEF
4423 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4424 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4425 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4429 ALL_PRIMARY_SYMTABS (objfile
, s
)
4432 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4433 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4435 if (code
== TYPE_CODE_UNDEF
4436 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4437 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4438 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4442 /* Skip macros if we are completing a struct tag -- arguable but
4443 usually what is expected. */
4444 if (current_language
->la_macro_expansion
== macro_expansion_c
4445 && code
== TYPE_CODE_UNDEF
)
4447 struct macro_scope
*scope
;
4449 /* Add any macros visible in the default scope. Note that this
4450 may yield the occasional wrong result, because an expression
4451 might be evaluated in a scope other than the default. For
4452 example, if the user types "break file:line if <TAB>", the
4453 resulting expression will be evaluated at "file:line" -- but
4454 at there does not seem to be a way to detect this at
4456 scope
= default_macro_scope ();
4459 macro_for_each_in_scope (scope
->file
, scope
->line
,
4460 add_macro_name
, &datum
);
4464 /* User-defined macros are always visible. */
4465 macro_for_each (macro_user_macros
, add_macro_name
, &datum
);
4468 discard_cleanups (back_to
);
4469 return (return_val
);
4473 default_make_symbol_completion_list (const char *text
, const char *word
,
4474 enum type_code code
)
4476 return default_make_symbol_completion_list_break_on (text
, word
, "", code
);
4479 /* Return a vector of all symbols (regardless of class) which begin by
4480 matching TEXT. If the answer is no symbols, then the return value
4484 make_symbol_completion_list (const char *text
, const char *word
)
4486 return current_language
->la_make_symbol_completion_list (text
, word
,
4490 /* Like make_symbol_completion_list, but only return STRUCT_DOMAIN
4491 symbols whose type code is CODE. */
4494 make_symbol_completion_type (const char *text
, const char *word
,
4495 enum type_code code
)
4497 gdb_assert (code
== TYPE_CODE_UNION
4498 || code
== TYPE_CODE_STRUCT
4499 || code
== TYPE_CODE_CLASS
4500 || code
== TYPE_CODE_ENUM
);
4501 return current_language
->la_make_symbol_completion_list (text
, word
, code
);
4504 /* Like make_symbol_completion_list, but suitable for use as a
4505 completion function. */
4508 make_symbol_completion_list_fn (struct cmd_list_element
*ignore
,
4509 const char *text
, const char *word
)
4511 return make_symbol_completion_list (text
, word
);
4514 /* Like make_symbol_completion_list, but returns a list of symbols
4515 defined in a source file FILE. */
4518 make_file_symbol_completion_list (const char *text
, const char *word
,
4519 const char *srcfile
)
4524 struct block_iterator iter
;
4525 /* The symbol we are completing on. Points in same buffer as text. */
4526 const char *sym_text
;
4527 /* Length of sym_text. */
4530 /* Now look for the symbol we are supposed to complete on.
4531 FIXME: This should be language-specific. */
4535 const char *quote_pos
= NULL
;
4537 /* First see if this is a quoted string. */
4539 for (p
= text
; *p
!= '\0'; ++p
)
4541 if (quote_found
!= '\0')
4543 if (*p
== quote_found
)
4544 /* Found close quote. */
4546 else if (*p
== '\\' && p
[1] == quote_found
)
4547 /* A backslash followed by the quote character
4548 doesn't end the string. */
4551 else if (*p
== '\'' || *p
== '"')
4557 if (quote_found
== '\'')
4558 /* A string within single quotes can be a symbol, so complete on it. */
4559 sym_text
= quote_pos
+ 1;
4560 else if (quote_found
== '"')
4561 /* A double-quoted string is never a symbol, nor does it make sense
4562 to complete it any other way. */
4568 /* Not a quoted string. */
4569 sym_text
= language_search_unquoted_string (text
, p
);
4573 sym_text_len
= strlen (sym_text
);
4577 /* Find the symtab for SRCFILE (this loads it if it was not yet read
4579 s
= lookup_symtab (srcfile
);
4582 /* Maybe they typed the file with leading directories, while the
4583 symbol tables record only its basename. */
4584 const char *tail
= lbasename (srcfile
);
4587 s
= lookup_symtab (tail
);
4590 /* If we have no symtab for that file, return an empty list. */
4592 return (return_val
);
4594 /* Go through this symtab and check the externs and statics for
4595 symbols which match. */
4597 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4598 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4600 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4603 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4604 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4606 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4609 return (return_val
);
4612 /* A helper function for make_source_files_completion_list. It adds
4613 another file name to a list of possible completions, growing the
4614 list as necessary. */
4617 add_filename_to_list (const char *fname
, const char *text
, const char *word
,
4618 VEC (char_ptr
) **list
)
4621 size_t fnlen
= strlen (fname
);
4625 /* Return exactly fname. */
4626 new = xmalloc (fnlen
+ 5);
4627 strcpy (new, fname
);
4629 else if (word
> text
)
4631 /* Return some portion of fname. */
4632 new = xmalloc (fnlen
+ 5);
4633 strcpy (new, fname
+ (word
- text
));
4637 /* Return some of TEXT plus fname. */
4638 new = xmalloc (fnlen
+ (text
- word
) + 5);
4639 strncpy (new, word
, text
- word
);
4640 new[text
- word
] = '\0';
4641 strcat (new, fname
);
4643 VEC_safe_push (char_ptr
, *list
, new);
4647 not_interesting_fname (const char *fname
)
4649 static const char *illegal_aliens
[] = {
4650 "_globals_", /* inserted by coff_symtab_read */
4655 for (i
= 0; illegal_aliens
[i
]; i
++)
4657 if (filename_cmp (fname
, illegal_aliens
[i
]) == 0)
4663 /* An object of this type is passed as the user_data argument to
4664 map_partial_symbol_filenames. */
4665 struct add_partial_filename_data
4667 struct filename_seen_cache
*filename_seen_cache
;
4671 VEC (char_ptr
) **list
;
4674 /* A callback for map_partial_symbol_filenames. */
4677 maybe_add_partial_symtab_filename (const char *filename
, const char *fullname
,
4680 struct add_partial_filename_data
*data
= user_data
;
4682 if (not_interesting_fname (filename
))
4684 if (!filename_seen (data
->filename_seen_cache
, filename
, 1)
4685 && filename_ncmp (filename
, data
->text
, data
->text_len
) == 0)
4687 /* This file matches for a completion; add it to the
4688 current list of matches. */
4689 add_filename_to_list (filename
, data
->text
, data
->word
, data
->list
);
4693 const char *base_name
= lbasename (filename
);
4695 if (base_name
!= filename
4696 && !filename_seen (data
->filename_seen_cache
, base_name
, 1)
4697 && filename_ncmp (base_name
, data
->text
, data
->text_len
) == 0)
4698 add_filename_to_list (base_name
, data
->text
, data
->word
, data
->list
);
4702 /* Return a vector of all source files whose names begin with matching
4703 TEXT. The file names are looked up in the symbol tables of this
4704 program. If the answer is no matchess, then the return value is
4708 make_source_files_completion_list (const char *text
, const char *word
)
4711 struct objfile
*objfile
;
4712 size_t text_len
= strlen (text
);
4713 VEC (char_ptr
) *list
= NULL
;
4714 const char *base_name
;
4715 struct add_partial_filename_data datum
;
4716 struct filename_seen_cache
*filename_seen_cache
;
4717 struct cleanup
*back_to
, *cache_cleanup
;
4719 if (!have_full_symbols () && !have_partial_symbols ())
4722 back_to
= make_cleanup (do_free_completion_list
, &list
);
4724 filename_seen_cache
= create_filename_seen_cache ();
4725 cache_cleanup
= make_cleanup (delete_filename_seen_cache
,
4726 filename_seen_cache
);
4728 ALL_SYMTABS (objfile
, s
)
4730 if (not_interesting_fname (s
->filename
))
4732 if (!filename_seen (filename_seen_cache
, s
->filename
, 1)
4733 && filename_ncmp (s
->filename
, text
, text_len
) == 0)
4735 /* This file matches for a completion; add it to the current
4737 add_filename_to_list (s
->filename
, text
, word
, &list
);
4741 /* NOTE: We allow the user to type a base name when the
4742 debug info records leading directories, but not the other
4743 way around. This is what subroutines of breakpoint
4744 command do when they parse file names. */
4745 base_name
= lbasename (s
->filename
);
4746 if (base_name
!= s
->filename
4747 && !filename_seen (filename_seen_cache
, base_name
, 1)
4748 && filename_ncmp (base_name
, text
, text_len
) == 0)
4749 add_filename_to_list (base_name
, text
, word
, &list
);
4753 datum
.filename_seen_cache
= filename_seen_cache
;
4756 datum
.text_len
= text_len
;
4758 map_partial_symbol_filenames (maybe_add_partial_symtab_filename
, &datum
,
4759 0 /*need_fullname*/);
4761 do_cleanups (cache_cleanup
);
4762 discard_cleanups (back_to
);
4767 /* Determine if PC is in the prologue of a function. The prologue is the area
4768 between the first instruction of a function, and the first executable line.
4769 Returns 1 if PC *might* be in prologue, 0 if definately *not* in prologue.
4771 If non-zero, func_start is where we think the prologue starts, possibly
4772 by previous examination of symbol table information. */
4775 in_prologue (struct gdbarch
*gdbarch
, CORE_ADDR pc
, CORE_ADDR func_start
)
4777 struct symtab_and_line sal
;
4778 CORE_ADDR func_addr
, func_end
;
4780 /* We have several sources of information we can consult to figure
4782 - Compilers usually emit line number info that marks the prologue
4783 as its own "source line". So the ending address of that "line"
4784 is the end of the prologue. If available, this is the most
4786 - The minimal symbols and partial symbols, which can usually tell
4787 us the starting and ending addresses of a function.
4788 - If we know the function's start address, we can call the
4789 architecture-defined gdbarch_skip_prologue function to analyze the
4790 instruction stream and guess where the prologue ends.
4791 - Our `func_start' argument; if non-zero, this is the caller's
4792 best guess as to the function's entry point. At the time of
4793 this writing, handle_inferior_event doesn't get this right, so
4794 it should be our last resort. */
4796 /* Consult the partial symbol table, to find which function
4798 if (! find_pc_partial_function (pc
, NULL
, &func_addr
, &func_end
))
4800 CORE_ADDR prologue_end
;
4802 /* We don't even have minsym information, so fall back to using
4803 func_start, if given. */
4805 return 1; /* We *might* be in a prologue. */
4807 prologue_end
= gdbarch_skip_prologue (gdbarch
, func_start
);
4809 return func_start
<= pc
&& pc
< prologue_end
;
4812 /* If we have line number information for the function, that's
4813 usually pretty reliable. */
4814 sal
= find_pc_line (func_addr
, 0);
4816 /* Now sal describes the source line at the function's entry point,
4817 which (by convention) is the prologue. The end of that "line",
4818 sal.end, is the end of the prologue.
4820 Note that, for functions whose source code is all on a single
4821 line, the line number information doesn't always end up this way.
4822 So we must verify that our purported end-of-prologue address is
4823 *within* the function, not at its start or end. */
4825 || sal
.end
<= func_addr
4826 || func_end
<= sal
.end
)
4828 /* We don't have any good line number info, so use the minsym
4829 information, together with the architecture-specific prologue
4831 CORE_ADDR prologue_end
= gdbarch_skip_prologue (gdbarch
, func_addr
);
4833 return func_addr
<= pc
&& pc
< prologue_end
;
4836 /* We have line number info, and it looks good. */
4837 return func_addr
<= pc
&& pc
< sal
.end
;
4840 /* Given PC at the function's start address, attempt to find the
4841 prologue end using SAL information. Return zero if the skip fails.
4843 A non-optimized prologue traditionally has one SAL for the function
4844 and a second for the function body. A single line function has
4845 them both pointing at the same line.
4847 An optimized prologue is similar but the prologue may contain
4848 instructions (SALs) from the instruction body. Need to skip those
4849 while not getting into the function body.
4851 The functions end point and an increasing SAL line are used as
4852 indicators of the prologue's endpoint.
4854 This code is based on the function refine_prologue_limit
4858 skip_prologue_using_sal (struct gdbarch
*gdbarch
, CORE_ADDR func_addr
)
4860 struct symtab_and_line prologue_sal
;
4865 /* Get an initial range for the function. */
4866 find_pc_partial_function (func_addr
, NULL
, &start_pc
, &end_pc
);
4867 start_pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
4869 prologue_sal
= find_pc_line (start_pc
, 0);
4870 if (prologue_sal
.line
!= 0)
4872 /* For languages other than assembly, treat two consecutive line
4873 entries at the same address as a zero-instruction prologue.
4874 The GNU assembler emits separate line notes for each instruction
4875 in a multi-instruction macro, but compilers generally will not
4877 if (prologue_sal
.symtab
->language
!= language_asm
)
4879 struct linetable
*linetable
= LINETABLE (prologue_sal
.symtab
);
4882 /* Skip any earlier lines, and any end-of-sequence marker
4883 from a previous function. */
4884 while (linetable
->item
[idx
].pc
!= prologue_sal
.pc
4885 || linetable
->item
[idx
].line
== 0)
4888 if (idx
+1 < linetable
->nitems
4889 && linetable
->item
[idx
+1].line
!= 0
4890 && linetable
->item
[idx
+1].pc
== start_pc
)
4894 /* If there is only one sal that covers the entire function,
4895 then it is probably a single line function, like
4897 if (prologue_sal
.end
>= end_pc
)
4900 while (prologue_sal
.end
< end_pc
)
4902 struct symtab_and_line sal
;
4904 sal
= find_pc_line (prologue_sal
.end
, 0);
4907 /* Assume that a consecutive SAL for the same (or larger)
4908 line mark the prologue -> body transition. */
4909 if (sal
.line
>= prologue_sal
.line
)
4911 /* Likewise if we are in a different symtab altogether
4912 (e.g. within a file included via #include). */
4913 if (sal
.symtab
!= prologue_sal
.symtab
)
4916 /* The line number is smaller. Check that it's from the
4917 same function, not something inlined. If it's inlined,
4918 then there is no point comparing the line numbers. */
4919 bl
= block_for_pc (prologue_sal
.end
);
4922 if (block_inlined_p (bl
))
4924 if (BLOCK_FUNCTION (bl
))
4929 bl
= BLOCK_SUPERBLOCK (bl
);
4934 /* The case in which compiler's optimizer/scheduler has
4935 moved instructions into the prologue. We look ahead in
4936 the function looking for address ranges whose
4937 corresponding line number is less the first one that we
4938 found for the function. This is more conservative then
4939 refine_prologue_limit which scans a large number of SALs
4940 looking for any in the prologue. */
4945 if (prologue_sal
.end
< end_pc
)
4946 /* Return the end of this line, or zero if we could not find a
4948 return prologue_sal
.end
;
4950 /* Don't return END_PC, which is past the end of the function. */
4951 return prologue_sal
.pc
;
4955 static char *name_of_main
;
4956 enum language language_of_main
= language_unknown
;
4959 set_main_name (const char *name
)
4961 if (name_of_main
!= NULL
)
4963 xfree (name_of_main
);
4964 name_of_main
= NULL
;
4965 language_of_main
= language_unknown
;
4969 name_of_main
= xstrdup (name
);
4970 language_of_main
= language_unknown
;
4974 /* Deduce the name of the main procedure, and set NAME_OF_MAIN
4978 find_main_name (void)
4980 const char *new_main_name
;
4982 /* Try to see if the main procedure is in Ada. */
4983 /* FIXME: brobecker/2005-03-07: Another way of doing this would
4984 be to add a new method in the language vector, and call this
4985 method for each language until one of them returns a non-empty
4986 name. This would allow us to remove this hard-coded call to
4987 an Ada function. It is not clear that this is a better approach
4988 at this point, because all methods need to be written in a way
4989 such that false positives never be returned. For instance, it is
4990 important that a method does not return a wrong name for the main
4991 procedure if the main procedure is actually written in a different
4992 language. It is easy to guaranty this with Ada, since we use a
4993 special symbol generated only when the main in Ada to find the name
4994 of the main procedure. It is difficult however to see how this can
4995 be guarantied for languages such as C, for instance. This suggests
4996 that order of call for these methods becomes important, which means
4997 a more complicated approach. */
4998 new_main_name
= ada_main_name ();
4999 if (new_main_name
!= NULL
)
5001 set_main_name (new_main_name
);
5005 new_main_name
= go_main_name ();
5006 if (new_main_name
!= NULL
)
5008 set_main_name (new_main_name
);
5012 new_main_name
= pascal_main_name ();
5013 if (new_main_name
!= NULL
)
5015 set_main_name (new_main_name
);
5019 /* The languages above didn't identify the name of the main procedure.
5020 Fallback to "main". */
5021 set_main_name ("main");
5027 if (name_of_main
== NULL
)
5030 return name_of_main
;
5033 /* Handle ``executable_changed'' events for the symtab module. */
5036 symtab_observer_executable_changed (void)
5038 /* NAME_OF_MAIN may no longer be the same, so reset it for now. */
5039 set_main_name (NULL
);
5042 /* Return 1 if the supplied producer string matches the ARM RealView
5043 compiler (armcc). */
5046 producer_is_realview (const char *producer
)
5048 static const char *const arm_idents
[] = {
5049 "ARM C Compiler, ADS",
5050 "Thumb C Compiler, ADS",
5051 "ARM C++ Compiler, ADS",
5052 "Thumb C++ Compiler, ADS",
5053 "ARM/Thumb C/C++ Compiler, RVCT",
5054 "ARM C/C++ Compiler, RVCT"
5058 if (producer
== NULL
)
5061 for (i
= 0; i
< ARRAY_SIZE (arm_idents
); i
++)
5062 if (strncmp (producer
, arm_idents
[i
], strlen (arm_idents
[i
])) == 0)
5070 /* The next index to hand out in response to a registration request. */
5072 static int next_aclass_value
= LOC_FINAL_VALUE
;
5074 /* The maximum number of "aclass" registrations we support. This is
5075 constant for convenience. */
5076 #define MAX_SYMBOL_IMPLS (LOC_FINAL_VALUE + 10)
5078 /* The objects representing the various "aclass" values. The elements
5079 from 0 up to LOC_FINAL_VALUE-1 represent themselves, and subsequent
5080 elements are those registered at gdb initialization time. */
5082 static struct symbol_impl symbol_impl
[MAX_SYMBOL_IMPLS
];
5084 /* The globally visible pointer. This is separate from 'symbol_impl'
5085 so that it can be const. */
5087 const struct symbol_impl
*symbol_impls
= &symbol_impl
[0];
5089 /* Make sure we saved enough room in struct symbol. */
5091 gdb_static_assert (MAX_SYMBOL_IMPLS
<= (1 << SYMBOL_ACLASS_BITS
));
5093 /* Register a computed symbol type. ACLASS must be LOC_COMPUTED. OPS
5094 is the ops vector associated with this index. This returns the new
5095 index, which should be used as the aclass_index field for symbols
5099 register_symbol_computed_impl (enum address_class aclass
,
5100 const struct symbol_computed_ops
*ops
)
5102 int result
= next_aclass_value
++;
5104 gdb_assert (aclass
== LOC_COMPUTED
);
5105 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5106 symbol_impl
[result
].aclass
= aclass
;
5107 symbol_impl
[result
].ops_computed
= ops
;
5109 /* Sanity check OPS. */
5110 gdb_assert (ops
!= NULL
);
5111 gdb_assert (ops
->tracepoint_var_ref
!= NULL
);
5112 gdb_assert (ops
->describe_location
!= NULL
);
5113 gdb_assert (ops
->read_needs_frame
!= NULL
);
5114 gdb_assert (ops
->read_variable
!= NULL
);
5119 /* Register a function with frame base type. ACLASS must be LOC_BLOCK.
5120 OPS is the ops vector associated with this index. This returns the
5121 new index, which should be used as the aclass_index field for symbols
5125 register_symbol_block_impl (enum address_class aclass
,
5126 const struct symbol_block_ops
*ops
)
5128 int result
= next_aclass_value
++;
5130 gdb_assert (aclass
== LOC_BLOCK
);
5131 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5132 symbol_impl
[result
].aclass
= aclass
;
5133 symbol_impl
[result
].ops_block
= ops
;
5135 /* Sanity check OPS. */
5136 gdb_assert (ops
!= NULL
);
5137 gdb_assert (ops
->find_frame_base_location
!= NULL
);
5142 /* Register a register symbol type. ACLASS must be LOC_REGISTER or
5143 LOC_REGPARM_ADDR. OPS is the register ops vector associated with
5144 this index. This returns the new index, which should be used as
5145 the aclass_index field for symbols of this type. */
5148 register_symbol_register_impl (enum address_class aclass
,
5149 const struct symbol_register_ops
*ops
)
5151 int result
= next_aclass_value
++;
5153 gdb_assert (aclass
== LOC_REGISTER
|| aclass
== LOC_REGPARM_ADDR
);
5154 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5155 symbol_impl
[result
].aclass
= aclass
;
5156 symbol_impl
[result
].ops_register
= ops
;
5161 /* Initialize elements of 'symbol_impl' for the constants in enum
5165 initialize_ordinary_address_classes (void)
5169 for (i
= 0; i
< LOC_FINAL_VALUE
; ++i
)
5170 symbol_impl
[i
].aclass
= i
;
5175 /* Initialize the symbol SYM. */
5178 initialize_symbol (struct symbol
*sym
)
5180 memset (sym
, 0, sizeof (*sym
));
5181 SYMBOL_SECTION (sym
) = -1;
5184 /* Allocate and initialize a new 'struct symbol' on OBJFILE's
5188 allocate_symbol (struct objfile
*objfile
)
5190 struct symbol
*result
;
5192 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct symbol
);
5193 SYMBOL_SECTION (result
) = -1;
5198 /* Allocate and initialize a new 'struct template_symbol' on OBJFILE's
5201 struct template_symbol
*
5202 allocate_template_symbol (struct objfile
*objfile
)
5204 struct template_symbol
*result
;
5206 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct template_symbol
);
5207 SYMBOL_SECTION (&result
->base
) = -1;
5215 _initialize_symtab (void)
5217 initialize_ordinary_address_classes ();
5219 add_info ("variables", variables_info
, _("\
5220 All global and static variable names, or those matching REGEXP."));
5222 add_com ("whereis", class_info
, variables_info
, _("\
5223 All global and static variable names, or those matching REGEXP."));
5225 add_info ("functions", functions_info
,
5226 _("All function names, or those matching REGEXP."));
5228 /* FIXME: This command has at least the following problems:
5229 1. It prints builtin types (in a very strange and confusing fashion).
5230 2. It doesn't print right, e.g. with
5231 typedef struct foo *FOO
5232 type_print prints "FOO" when we want to make it (in this situation)
5233 print "struct foo *".
5234 I also think "ptype" or "whatis" is more likely to be useful (but if
5235 there is much disagreement "info types" can be fixed). */
5236 add_info ("types", types_info
,
5237 _("All type names, or those matching REGEXP."));
5239 add_info ("sources", sources_info
,
5240 _("Source files in the program."));
5242 add_com ("rbreak", class_breakpoint
, rbreak_command
,
5243 _("Set a breakpoint for all functions matching REGEXP."));
5247 add_com ("lf", class_info
, sources_info
,
5248 _("Source files in the program"));
5249 add_com ("lg", class_info
, variables_info
, _("\
5250 All global and static variable names, or those matching REGEXP."));
5253 add_setshow_enum_cmd ("multiple-symbols", no_class
,
5254 multiple_symbols_modes
, &multiple_symbols_mode
,
5256 Set the debugger behavior when more than one symbol are possible matches\n\
5257 in an expression."), _("\
5258 Show how the debugger handles ambiguities in expressions."), _("\
5259 Valid values are \"ask\", \"all\", \"cancel\", and the default is \"all\"."),
5260 NULL
, NULL
, &setlist
, &showlist
);
5262 add_setshow_boolean_cmd ("basenames-may-differ", class_obscure
,
5263 &basenames_may_differ
, _("\
5264 Set whether a source file may have multiple base names."), _("\
5265 Show whether a source file may have multiple base names."), _("\
5266 (A \"base name\" is the name of a file with the directory part removed.\n\
5267 Example: The base name of \"/home/user/hello.c\" is \"hello.c\".)\n\
5268 If set, GDB will canonicalize file names (e.g., expand symlinks)\n\
5269 before comparing them. Canonicalization is an expensive operation,\n\
5270 but it allows the same file be known by more than one base name.\n\
5271 If not set (the default), all source files are assumed to have just\n\
5272 one base name, and gdb will do file name comparisons more efficiently."),
5274 &setlist
, &showlist
);
5276 add_setshow_boolean_cmd ("symtab-create", no_class
, &symtab_create_debug
,
5277 _("Set debugging of symbol table creation."),
5278 _("Show debugging of symbol table creation."), _("\
5279 When enabled, debugging messages are printed when building symbol tables."),
5282 &setdebuglist
, &showdebuglist
);
5284 observer_attach_executable_changed (symtab_observer_executable_changed
);