1 /* Symbol table lookup for the GNU debugger, GDB.
3 Copyright (C) 1986-2014 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
30 #include "gdb_regex.h"
31 #include "expression.h"
36 #include "filenames.h" /* for FILENAME_CMP */
37 #include "objc-lang.h"
43 #include "cli/cli-utils.h"
47 #include "gdb_obstack.h"
49 #include "dictionary.h"
51 #include <sys/types.h>
56 #include "cp-support.h"
60 #include "macroscope.h"
62 #include "parser-defs.h"
64 /* Forward declarations for local functions. */
66 static void rbreak_command (char *, int);
68 static int find_line_common (struct linetable
*, int, int *, int);
70 static struct symbol
*lookup_symbol_aux (const char *name
,
71 const struct block
*block
,
72 const domain_enum domain
,
73 enum language language
,
74 struct field_of_this_result
*);
77 struct symbol
*lookup_local_symbol (const char *name
,
78 const struct block
*block
,
79 const domain_enum domain
,
80 enum language language
);
83 struct symbol
*lookup_symbol_via_quick_fns (struct objfile
*objfile
,
86 const domain_enum domain
);
88 extern initialize_file_ftype _initialize_symtab
;
90 /* Program space key for finding name and language of "main". */
92 static const struct program_space_data
*main_progspace_key
;
94 /* Type of the data stored on the program space. */
102 /* Language of "main". */
104 enum language language_of_main
;
107 /* When non-zero, print debugging messages related to symtab creation. */
108 unsigned int symtab_create_debug
= 0;
110 /* Non-zero if a file may be known by two different basenames.
111 This is the uncommon case, and significantly slows down gdb.
112 Default set to "off" to not slow down the common case. */
113 int basenames_may_differ
= 0;
115 /* Allow the user to configure the debugger behavior with respect
116 to multiple-choice menus when more than one symbol matches during
119 const char multiple_symbols_ask
[] = "ask";
120 const char multiple_symbols_all
[] = "all";
121 const char multiple_symbols_cancel
[] = "cancel";
122 static const char *const multiple_symbols_modes
[] =
124 multiple_symbols_ask
,
125 multiple_symbols_all
,
126 multiple_symbols_cancel
,
129 static const char *multiple_symbols_mode
= multiple_symbols_all
;
131 /* Read-only accessor to AUTO_SELECT_MODE. */
134 multiple_symbols_select_mode (void)
136 return multiple_symbols_mode
;
139 /* Block in which the most recently searched-for symbol was found.
140 Might be better to make this a parameter to lookup_symbol and
143 const struct block
*block_found
;
145 /* Return the name of a domain_enum. */
148 domain_name (domain_enum e
)
152 case UNDEF_DOMAIN
: return "UNDEF_DOMAIN";
153 case VAR_DOMAIN
: return "VAR_DOMAIN";
154 case STRUCT_DOMAIN
: return "STRUCT_DOMAIN";
155 case LABEL_DOMAIN
: return "LABEL_DOMAIN";
156 case COMMON_BLOCK_DOMAIN
: return "COMMON_BLOCK_DOMAIN";
157 default: gdb_assert_not_reached ("bad domain_enum");
161 /* Return the name of a search_domain . */
164 search_domain_name (enum search_domain e
)
168 case VARIABLES_DOMAIN
: return "VARIABLES_DOMAIN";
169 case FUNCTIONS_DOMAIN
: return "FUNCTIONS_DOMAIN";
170 case TYPES_DOMAIN
: return "TYPES_DOMAIN";
171 case ALL_DOMAIN
: return "ALL_DOMAIN";
172 default: gdb_assert_not_reached ("bad search_domain");
179 compunit_primary_filetab (const struct compunit_symtab
*cust
)
181 gdb_assert (COMPUNIT_FILETABS (cust
) != NULL
);
183 /* The primary file symtab is the first one in the list. */
184 return COMPUNIT_FILETABS (cust
);
190 compunit_language (const struct compunit_symtab
*cust
)
192 struct symtab
*symtab
= compunit_primary_filetab (cust
);
194 /* The language of the compunit symtab is the language of its primary
196 return SYMTAB_LANGUAGE (symtab
);
199 /* See whether FILENAME matches SEARCH_NAME using the rule that we
200 advertise to the user. (The manual's description of linespecs
201 describes what we advertise). Returns true if they match, false
205 compare_filenames_for_search (const char *filename
, const char *search_name
)
207 int len
= strlen (filename
);
208 size_t search_len
= strlen (search_name
);
210 if (len
< search_len
)
213 /* The tail of FILENAME must match. */
214 if (FILENAME_CMP (filename
+ len
- search_len
, search_name
) != 0)
217 /* Either the names must completely match, or the character
218 preceding the trailing SEARCH_NAME segment of FILENAME must be a
221 The check !IS_ABSOLUTE_PATH ensures SEARCH_NAME "/dir/file.c"
222 cannot match FILENAME "/path//dir/file.c" - as user has requested
223 absolute path. The sama applies for "c:\file.c" possibly
224 incorrectly hypothetically matching "d:\dir\c:\file.c".
226 The HAS_DRIVE_SPEC purpose is to make FILENAME "c:file.c"
227 compatible with SEARCH_NAME "file.c". In such case a compiler had
228 to put the "c:file.c" name into debug info. Such compatibility
229 works only on GDB built for DOS host. */
230 return (len
== search_len
231 || (!IS_ABSOLUTE_PATH (search_name
)
232 && IS_DIR_SEPARATOR (filename
[len
- search_len
- 1]))
233 || (HAS_DRIVE_SPEC (filename
)
234 && STRIP_DRIVE_SPEC (filename
) == &filename
[len
- search_len
]));
237 /* Check for a symtab of a specific name by searching some symtabs.
238 This is a helper function for callbacks of iterate_over_symtabs.
240 If NAME is not absolute, then REAL_PATH is NULL
241 If NAME is absolute, then REAL_PATH is the gdb_realpath form of NAME.
243 The return value, NAME, REAL_PATH, CALLBACK, and DATA
244 are identical to the `map_symtabs_matching_filename' method of
245 quick_symbol_functions.
247 FIRST and AFTER_LAST indicate the range of compunit symtabs to search.
248 Each symtab within the specified compunit symtab is also searched.
249 AFTER_LAST is one past the last compunit symtab to search; NULL means to
250 search until the end of the list. */
253 iterate_over_some_symtabs (const char *name
,
254 const char *real_path
,
255 int (*callback
) (struct symtab
*symtab
,
258 struct compunit_symtab
*first
,
259 struct compunit_symtab
*after_last
)
261 struct compunit_symtab
*cust
;
263 const char* base_name
= lbasename (name
);
265 for (cust
= first
; cust
!= NULL
&& cust
!= after_last
; cust
= cust
->next
)
267 ALL_COMPUNIT_FILETABS (cust
, s
)
269 if (compare_filenames_for_search (s
->filename
, name
))
271 if (callback (s
, data
))
276 /* Before we invoke realpath, which can get expensive when many
277 files are involved, do a quick comparison of the basenames. */
278 if (! basenames_may_differ
279 && FILENAME_CMP (base_name
, lbasename (s
->filename
)) != 0)
282 if (compare_filenames_for_search (symtab_to_fullname (s
), name
))
284 if (callback (s
, data
))
289 /* If the user gave us an absolute path, try to find the file in
290 this symtab and use its absolute path. */
291 if (real_path
!= NULL
)
293 const char *fullname
= symtab_to_fullname (s
);
295 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
296 gdb_assert (IS_ABSOLUTE_PATH (name
));
297 if (FILENAME_CMP (real_path
, fullname
) == 0)
299 if (callback (s
, data
))
310 /* Check for a symtab of a specific name; first in symtabs, then in
311 psymtabs. *If* there is no '/' in the name, a match after a '/'
312 in the symtab filename will also work.
314 Calls CALLBACK with each symtab that is found and with the supplied
315 DATA. If CALLBACK returns true, the search stops. */
318 iterate_over_symtabs (const char *name
,
319 int (*callback
) (struct symtab
*symtab
,
323 struct objfile
*objfile
;
324 char *real_path
= NULL
;
325 struct cleanup
*cleanups
= make_cleanup (null_cleanup
, NULL
);
327 /* Here we are interested in canonicalizing an absolute path, not
328 absolutizing a relative path. */
329 if (IS_ABSOLUTE_PATH (name
))
331 real_path
= gdb_realpath (name
);
332 make_cleanup (xfree
, real_path
);
333 gdb_assert (IS_ABSOLUTE_PATH (real_path
));
336 ALL_OBJFILES (objfile
)
338 if (iterate_over_some_symtabs (name
, real_path
, callback
, data
,
339 objfile
->compunit_symtabs
, NULL
))
341 do_cleanups (cleanups
);
346 /* Same search rules as above apply here, but now we look thru the
349 ALL_OBJFILES (objfile
)
352 && objfile
->sf
->qf
->map_symtabs_matching_filename (objfile
,
358 do_cleanups (cleanups
);
363 do_cleanups (cleanups
);
366 /* The callback function used by lookup_symtab. */
369 lookup_symtab_callback (struct symtab
*symtab
, void *data
)
371 struct symtab
**result_ptr
= data
;
373 *result_ptr
= symtab
;
377 /* A wrapper for iterate_over_symtabs that returns the first matching
381 lookup_symtab (const char *name
)
383 struct symtab
*result
= NULL
;
385 iterate_over_symtabs (name
, lookup_symtab_callback
, &result
);
390 /* Mangle a GDB method stub type. This actually reassembles the pieces of the
391 full method name, which consist of the class name (from T), the unadorned
392 method name from METHOD_ID, and the signature for the specific overload,
393 specified by SIGNATURE_ID. Note that this function is g++ specific. */
396 gdb_mangle_name (struct type
*type
, int method_id
, int signature_id
)
398 int mangled_name_len
;
400 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, method_id
);
401 struct fn_field
*method
= &f
[signature_id
];
402 const char *field_name
= TYPE_FN_FIELDLIST_NAME (type
, method_id
);
403 const char *physname
= TYPE_FN_FIELD_PHYSNAME (f
, signature_id
);
404 const char *newname
= type_name_no_tag (type
);
406 /* Does the form of physname indicate that it is the full mangled name
407 of a constructor (not just the args)? */
408 int is_full_physname_constructor
;
411 int is_destructor
= is_destructor_name (physname
);
412 /* Need a new type prefix. */
413 char *const_prefix
= method
->is_const
? "C" : "";
414 char *volatile_prefix
= method
->is_volatile
? "V" : "";
416 int len
= (newname
== NULL
? 0 : strlen (newname
));
418 /* Nothing to do if physname already contains a fully mangled v3 abi name
419 or an operator name. */
420 if ((physname
[0] == '_' && physname
[1] == 'Z')
421 || is_operator_name (field_name
))
422 return xstrdup (physname
);
424 is_full_physname_constructor
= is_constructor_name (physname
);
426 is_constructor
= is_full_physname_constructor
427 || (newname
&& strcmp (field_name
, newname
) == 0);
430 is_destructor
= (strncmp (physname
, "__dt", 4) == 0);
432 if (is_destructor
|| is_full_physname_constructor
)
434 mangled_name
= (char *) xmalloc (strlen (physname
) + 1);
435 strcpy (mangled_name
, physname
);
441 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
443 else if (physname
[0] == 't' || physname
[0] == 'Q')
445 /* The physname for template and qualified methods already includes
447 xsnprintf (buf
, sizeof (buf
), "__%s%s", const_prefix
, volatile_prefix
);
453 xsnprintf (buf
, sizeof (buf
), "__%s%s%d", const_prefix
,
454 volatile_prefix
, len
);
456 mangled_name_len
= ((is_constructor
? 0 : strlen (field_name
))
457 + strlen (buf
) + len
+ strlen (physname
) + 1);
459 mangled_name
= (char *) xmalloc (mangled_name_len
);
461 mangled_name
[0] = '\0';
463 strcpy (mangled_name
, field_name
);
465 strcat (mangled_name
, buf
);
466 /* If the class doesn't have a name, i.e. newname NULL, then we just
467 mangle it using 0 for the length of the class. Thus it gets mangled
468 as something starting with `::' rather than `classname::'. */
470 strcat (mangled_name
, newname
);
472 strcat (mangled_name
, physname
);
473 return (mangled_name
);
476 /* Set the demangled name of GSYMBOL to NAME. NAME must be already
477 correctly allocated. */
480 symbol_set_demangled_name (struct general_symbol_info
*gsymbol
,
482 struct obstack
*obstack
)
484 if (gsymbol
->language
== language_ada
)
488 gsymbol
->ada_mangled
= 0;
489 gsymbol
->language_specific
.obstack
= obstack
;
493 gsymbol
->ada_mangled
= 1;
494 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
498 gsymbol
->language_specific
.mangled_lang
.demangled_name
= name
;
501 /* Return the demangled name of GSYMBOL. */
504 symbol_get_demangled_name (const struct general_symbol_info
*gsymbol
)
506 if (gsymbol
->language
== language_ada
)
508 if (!gsymbol
->ada_mangled
)
513 return gsymbol
->language_specific
.mangled_lang
.demangled_name
;
517 /* Initialize the language dependent portion of a symbol
518 depending upon the language for the symbol. */
521 symbol_set_language (struct general_symbol_info
*gsymbol
,
522 enum language language
,
523 struct obstack
*obstack
)
525 gsymbol
->language
= language
;
526 if (gsymbol
->language
== language_cplus
527 || gsymbol
->language
== language_d
528 || gsymbol
->language
== language_go
529 || gsymbol
->language
== language_java
530 || gsymbol
->language
== language_objc
531 || gsymbol
->language
== language_fortran
)
533 symbol_set_demangled_name (gsymbol
, NULL
, obstack
);
535 else if (gsymbol
->language
== language_ada
)
537 gdb_assert (gsymbol
->ada_mangled
== 0);
538 gsymbol
->language_specific
.obstack
= obstack
;
542 memset (&gsymbol
->language_specific
, 0,
543 sizeof (gsymbol
->language_specific
));
547 /* Functions to initialize a symbol's mangled name. */
549 /* Objects of this type are stored in the demangled name hash table. */
550 struct demangled_name_entry
556 /* Hash function for the demangled name hash. */
559 hash_demangled_name_entry (const void *data
)
561 const struct demangled_name_entry
*e
= data
;
563 return htab_hash_string (e
->mangled
);
566 /* Equality function for the demangled name hash. */
569 eq_demangled_name_entry (const void *a
, const void *b
)
571 const struct demangled_name_entry
*da
= a
;
572 const struct demangled_name_entry
*db
= b
;
574 return strcmp (da
->mangled
, db
->mangled
) == 0;
577 /* Create the hash table used for demangled names. Each hash entry is
578 a pair of strings; one for the mangled name and one for the demangled
579 name. The entry is hashed via just the mangled name. */
582 create_demangled_names_hash (struct objfile
*objfile
)
584 /* Choose 256 as the starting size of the hash table, somewhat arbitrarily.
585 The hash table code will round this up to the next prime number.
586 Choosing a much larger table size wastes memory, and saves only about
587 1% in symbol reading. */
589 objfile
->per_bfd
->demangled_names_hash
= htab_create_alloc
590 (256, hash_demangled_name_entry
, eq_demangled_name_entry
,
591 NULL
, xcalloc
, xfree
);
594 /* Try to determine the demangled name for a symbol, based on the
595 language of that symbol. If the language is set to language_auto,
596 it will attempt to find any demangling algorithm that works and
597 then set the language appropriately. The returned name is allocated
598 by the demangler and should be xfree'd. */
601 symbol_find_demangled_name (struct general_symbol_info
*gsymbol
,
604 char *demangled
= NULL
;
606 if (gsymbol
->language
== language_unknown
)
607 gsymbol
->language
= language_auto
;
609 if (gsymbol
->language
== language_objc
610 || gsymbol
->language
== language_auto
)
613 objc_demangle (mangled
, 0);
614 if (demangled
!= NULL
)
616 gsymbol
->language
= language_objc
;
620 if (gsymbol
->language
== language_cplus
621 || gsymbol
->language
== language_auto
)
624 gdb_demangle (mangled
, DMGL_PARAMS
| DMGL_ANSI
);
625 if (demangled
!= NULL
)
627 gsymbol
->language
= language_cplus
;
631 if (gsymbol
->language
== language_java
)
634 gdb_demangle (mangled
,
635 DMGL_PARAMS
| DMGL_ANSI
| DMGL_JAVA
);
636 if (demangled
!= NULL
)
638 gsymbol
->language
= language_java
;
642 if (gsymbol
->language
== language_d
643 || gsymbol
->language
== language_auto
)
645 demangled
= d_demangle(mangled
, 0);
646 if (demangled
!= NULL
)
648 gsymbol
->language
= language_d
;
652 /* FIXME(dje): Continually adding languages here is clumsy.
653 Better to just call la_demangle if !auto, and if auto then call
654 a utility routine that tries successive languages in turn and reports
655 which one it finds. I realize the la_demangle options may be different
656 for different languages but there's already a FIXME for that. */
657 if (gsymbol
->language
== language_go
658 || gsymbol
->language
== language_auto
)
660 demangled
= go_demangle (mangled
, 0);
661 if (demangled
!= NULL
)
663 gsymbol
->language
= language_go
;
668 /* We could support `gsymbol->language == language_fortran' here to provide
669 module namespaces also for inferiors with only minimal symbol table (ELF
670 symbols). Just the mangling standard is not standardized across compilers
671 and there is no DW_AT_producer available for inferiors with only the ELF
672 symbols to check the mangling kind. */
674 /* Check for Ada symbols last. See comment below explaining why. */
676 if (gsymbol
->language
== language_auto
)
678 const char *demangled
= ada_decode (mangled
);
680 if (demangled
!= mangled
&& demangled
!= NULL
&& demangled
[0] != '<')
682 /* Set the gsymbol language to Ada, but still return NULL.
683 Two reasons for that:
685 1. For Ada, we prefer computing the symbol's decoded name
686 on the fly rather than pre-compute it, in order to save
687 memory (Ada projects are typically very large).
689 2. There are some areas in the definition of the GNAT
690 encoding where, with a bit of bad luck, we might be able
691 to decode a non-Ada symbol, generating an incorrect
692 demangled name (Eg: names ending with "TB" for instance
693 are identified as task bodies and so stripped from
694 the decoded name returned).
696 Returning NULL, here, helps us get a little bit of
697 the best of both worlds. Because we're last, we should
698 not affect any of the other languages that were able to
699 demangle the symbol before us; we get to correctly tag
700 Ada symbols as such; and even if we incorrectly tagged
701 a non-Ada symbol, which should be rare, any routing
702 through the Ada language should be transparent (Ada
703 tries to behave much like C/C++ with non-Ada symbols). */
704 gsymbol
->language
= language_ada
;
712 /* Set both the mangled and demangled (if any) names for GSYMBOL based
713 on LINKAGE_NAME and LEN. Ordinarily, NAME is copied onto the
714 objfile's obstack; but if COPY_NAME is 0 and if NAME is
715 NUL-terminated, then this function assumes that NAME is already
716 correctly saved (either permanently or with a lifetime tied to the
717 objfile), and it will not be copied.
719 The hash table corresponding to OBJFILE is used, and the memory
720 comes from the per-BFD storage_obstack. LINKAGE_NAME is copied,
721 so the pointer can be discarded after calling this function. */
723 /* We have to be careful when dealing with Java names: when we run
724 into a Java minimal symbol, we don't know it's a Java symbol, so it
725 gets demangled as a C++ name. This is unfortunate, but there's not
726 much we can do about it: but when demangling partial symbols and
727 regular symbols, we'd better not reuse the wrong demangled name.
728 (See PR gdb/1039.) We solve this by putting a distinctive prefix
729 on Java names when storing them in the hash table. */
731 /* FIXME: carlton/2003-03-13: This is an unfortunate situation. I
732 don't mind the Java prefix so much: different languages have
733 different demangling requirements, so it's only natural that we
734 need to keep language data around in our demangling cache. But
735 it's not good that the minimal symbol has the wrong demangled name.
736 Unfortunately, I can't think of any easy solution to that
739 #define JAVA_PREFIX "##JAVA$$"
740 #define JAVA_PREFIX_LEN 8
743 symbol_set_names (struct general_symbol_info
*gsymbol
,
744 const char *linkage_name
, int len
, int copy_name
,
745 struct objfile
*objfile
)
747 struct demangled_name_entry
**slot
;
748 /* A 0-terminated copy of the linkage name. */
749 const char *linkage_name_copy
;
750 /* A copy of the linkage name that might have a special Java prefix
751 added to it, for use when looking names up in the hash table. */
752 const char *lookup_name
;
753 /* The length of lookup_name. */
755 struct demangled_name_entry entry
;
756 struct objfile_per_bfd_storage
*per_bfd
= objfile
->per_bfd
;
758 if (gsymbol
->language
== language_ada
)
760 /* In Ada, we do the symbol lookups using the mangled name, so
761 we can save some space by not storing the demangled name.
763 As a side note, we have also observed some overlap between
764 the C++ mangling and Ada mangling, similarly to what has
765 been observed with Java. Because we don't store the demangled
766 name with the symbol, we don't need to use the same trick
769 gsymbol
->name
= linkage_name
;
772 char *name
= obstack_alloc (&per_bfd
->storage_obstack
, len
+ 1);
774 memcpy (name
, linkage_name
, len
);
776 gsymbol
->name
= name
;
778 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
783 if (per_bfd
->demangled_names_hash
== NULL
)
784 create_demangled_names_hash (objfile
);
786 /* The stabs reader generally provides names that are not
787 NUL-terminated; most of the other readers don't do this, so we
788 can just use the given copy, unless we're in the Java case. */
789 if (gsymbol
->language
== language_java
)
793 lookup_len
= len
+ JAVA_PREFIX_LEN
;
794 alloc_name
= alloca (lookup_len
+ 1);
795 memcpy (alloc_name
, JAVA_PREFIX
, JAVA_PREFIX_LEN
);
796 memcpy (alloc_name
+ JAVA_PREFIX_LEN
, linkage_name
, len
);
797 alloc_name
[lookup_len
] = '\0';
799 lookup_name
= alloc_name
;
800 linkage_name_copy
= alloc_name
+ JAVA_PREFIX_LEN
;
802 else if (linkage_name
[len
] != '\0')
807 alloc_name
= alloca (lookup_len
+ 1);
808 memcpy (alloc_name
, linkage_name
, len
);
809 alloc_name
[lookup_len
] = '\0';
811 lookup_name
= alloc_name
;
812 linkage_name_copy
= alloc_name
;
817 lookup_name
= linkage_name
;
818 linkage_name_copy
= linkage_name
;
821 entry
.mangled
= lookup_name
;
822 slot
= ((struct demangled_name_entry
**)
823 htab_find_slot (per_bfd
->demangled_names_hash
,
826 /* If this name is not in the hash table, add it. */
828 /* A C version of the symbol may have already snuck into the table.
829 This happens to, e.g., main.init (__go_init_main). Cope. */
830 || (gsymbol
->language
== language_go
831 && (*slot
)->demangled
[0] == '\0'))
833 char *demangled_name
= symbol_find_demangled_name (gsymbol
,
835 int demangled_len
= demangled_name
? strlen (demangled_name
) : 0;
837 /* Suppose we have demangled_name==NULL, copy_name==0, and
838 lookup_name==linkage_name. In this case, we already have the
839 mangled name saved, and we don't have a demangled name. So,
840 you might think we could save a little space by not recording
841 this in the hash table at all.
843 It turns out that it is actually important to still save such
844 an entry in the hash table, because storing this name gives
845 us better bcache hit rates for partial symbols. */
846 if (!copy_name
&& lookup_name
== linkage_name
)
848 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
849 offsetof (struct demangled_name_entry
,
851 + demangled_len
+ 1);
852 (*slot
)->mangled
= lookup_name
;
858 /* If we must copy the mangled name, put it directly after
859 the demangled name so we can have a single
861 *slot
= obstack_alloc (&per_bfd
->storage_obstack
,
862 offsetof (struct demangled_name_entry
,
864 + lookup_len
+ demangled_len
+ 2);
865 mangled_ptr
= &((*slot
)->demangled
[demangled_len
+ 1]);
866 strcpy (mangled_ptr
, lookup_name
);
867 (*slot
)->mangled
= mangled_ptr
;
870 if (demangled_name
!= NULL
)
872 strcpy ((*slot
)->demangled
, demangled_name
);
873 xfree (demangled_name
);
876 (*slot
)->demangled
[0] = '\0';
879 gsymbol
->name
= (*slot
)->mangled
+ lookup_len
- len
;
880 if ((*slot
)->demangled
[0] != '\0')
881 symbol_set_demangled_name (gsymbol
, (*slot
)->demangled
,
882 &per_bfd
->storage_obstack
);
884 symbol_set_demangled_name (gsymbol
, NULL
, &per_bfd
->storage_obstack
);
887 /* Return the source code name of a symbol. In languages where
888 demangling is necessary, this is the demangled name. */
891 symbol_natural_name (const struct general_symbol_info
*gsymbol
)
893 switch (gsymbol
->language
)
900 case language_fortran
:
901 if (symbol_get_demangled_name (gsymbol
) != NULL
)
902 return symbol_get_demangled_name (gsymbol
);
905 return ada_decode_symbol (gsymbol
);
909 return gsymbol
->name
;
912 /* Return the demangled name for a symbol based on the language for
913 that symbol. If no demangled name exists, return NULL. */
916 symbol_demangled_name (const struct general_symbol_info
*gsymbol
)
918 const char *dem_name
= NULL
;
920 switch (gsymbol
->language
)
927 case language_fortran
:
928 dem_name
= symbol_get_demangled_name (gsymbol
);
931 dem_name
= ada_decode_symbol (gsymbol
);
939 /* Return the search name of a symbol---generally the demangled or
940 linkage name of the symbol, depending on how it will be searched for.
941 If there is no distinct demangled name, then returns the same value
942 (same pointer) as SYMBOL_LINKAGE_NAME. */
945 symbol_search_name (const struct general_symbol_info
*gsymbol
)
947 if (gsymbol
->language
== language_ada
)
948 return gsymbol
->name
;
950 return symbol_natural_name (gsymbol
);
953 /* Initialize the structure fields to zero values. */
956 init_sal (struct symtab_and_line
*sal
)
958 memset (sal
, 0, sizeof (*sal
));
962 /* Return 1 if the two sections are the same, or if they could
963 plausibly be copies of each other, one in an original object
964 file and another in a separated debug file. */
967 matching_obj_sections (struct obj_section
*obj_first
,
968 struct obj_section
*obj_second
)
970 asection
*first
= obj_first
? obj_first
->the_bfd_section
: NULL
;
971 asection
*second
= obj_second
? obj_second
->the_bfd_section
: NULL
;
974 /* If they're the same section, then they match. */
978 /* If either is NULL, give up. */
979 if (first
== NULL
|| second
== NULL
)
982 /* This doesn't apply to absolute symbols. */
983 if (first
->owner
== NULL
|| second
->owner
== NULL
)
986 /* If they're in the same object file, they must be different sections. */
987 if (first
->owner
== second
->owner
)
990 /* Check whether the two sections are potentially corresponding. They must
991 have the same size, address, and name. We can't compare section indexes,
992 which would be more reliable, because some sections may have been
994 if (bfd_get_section_size (first
) != bfd_get_section_size (second
))
997 /* In-memory addresses may start at a different offset, relativize them. */
998 if (bfd_get_section_vma (first
->owner
, first
)
999 - bfd_get_start_address (first
->owner
)
1000 != bfd_get_section_vma (second
->owner
, second
)
1001 - bfd_get_start_address (second
->owner
))
1004 if (bfd_get_section_name (first
->owner
, first
) == NULL
1005 || bfd_get_section_name (second
->owner
, second
) == NULL
1006 || strcmp (bfd_get_section_name (first
->owner
, first
),
1007 bfd_get_section_name (second
->owner
, second
)) != 0)
1010 /* Otherwise check that they are in corresponding objfiles. */
1013 if (obj
->obfd
== first
->owner
)
1015 gdb_assert (obj
!= NULL
);
1017 if (obj
->separate_debug_objfile
!= NULL
1018 && obj
->separate_debug_objfile
->obfd
== second
->owner
)
1020 if (obj
->separate_debug_objfile_backlink
!= NULL
1021 && obj
->separate_debug_objfile_backlink
->obfd
== second
->owner
)
1030 expand_symtab_containing_pc (CORE_ADDR pc
, struct obj_section
*section
)
1032 struct objfile
*objfile
;
1033 struct bound_minimal_symbol msymbol
;
1035 /* If we know that this is not a text address, return failure. This is
1036 necessary because we loop based on texthigh and textlow, which do
1037 not include the data ranges. */
1038 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
);
1040 && (MSYMBOL_TYPE (msymbol
.minsym
) == mst_data
1041 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_bss
1042 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_abs
1043 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_data
1044 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_bss
))
1047 ALL_OBJFILES (objfile
)
1049 struct compunit_symtab
*cust
= NULL
;
1052 cust
= objfile
->sf
->qf
->find_pc_sect_compunit_symtab (objfile
, msymbol
,
1059 /* Debug symbols usually don't have section information. We need to dig that
1060 out of the minimal symbols and stash that in the debug symbol. */
1063 fixup_section (struct general_symbol_info
*ginfo
,
1064 CORE_ADDR addr
, struct objfile
*objfile
)
1066 struct minimal_symbol
*msym
;
1068 /* First, check whether a minimal symbol with the same name exists
1069 and points to the same address. The address check is required
1070 e.g. on PowerPC64, where the minimal symbol for a function will
1071 point to the function descriptor, while the debug symbol will
1072 point to the actual function code. */
1073 msym
= lookup_minimal_symbol_by_pc_name (addr
, ginfo
->name
, objfile
);
1075 ginfo
->section
= MSYMBOL_SECTION (msym
);
1078 /* Static, function-local variables do appear in the linker
1079 (minimal) symbols, but are frequently given names that won't
1080 be found via lookup_minimal_symbol(). E.g., it has been
1081 observed in frv-uclinux (ELF) executables that a static,
1082 function-local variable named "foo" might appear in the
1083 linker symbols as "foo.6" or "foo.3". Thus, there is no
1084 point in attempting to extend the lookup-by-name mechanism to
1085 handle this case due to the fact that there can be multiple
1088 So, instead, search the section table when lookup by name has
1089 failed. The ``addr'' and ``endaddr'' fields may have already
1090 been relocated. If so, the relocation offset (i.e. the
1091 ANOFFSET value) needs to be subtracted from these values when
1092 performing the comparison. We unconditionally subtract it,
1093 because, when no relocation has been performed, the ANOFFSET
1094 value will simply be zero.
1096 The address of the symbol whose section we're fixing up HAS
1097 NOT BEEN adjusted (relocated) yet. It can't have been since
1098 the section isn't yet known and knowing the section is
1099 necessary in order to add the correct relocation value. In
1100 other words, we wouldn't even be in this function (attempting
1101 to compute the section) if it were already known.
1103 Note that it is possible to search the minimal symbols
1104 (subtracting the relocation value if necessary) to find the
1105 matching minimal symbol, but this is overkill and much less
1106 efficient. It is not necessary to find the matching minimal
1107 symbol, only its section.
1109 Note that this technique (of doing a section table search)
1110 can fail when unrelocated section addresses overlap. For
1111 this reason, we still attempt a lookup by name prior to doing
1112 a search of the section table. */
1114 struct obj_section
*s
;
1117 ALL_OBJFILE_OSECTIONS (objfile
, s
)
1119 int idx
= s
- objfile
->sections
;
1120 CORE_ADDR offset
= ANOFFSET (objfile
->section_offsets
, idx
);
1125 if (obj_section_addr (s
) - offset
<= addr
1126 && addr
< obj_section_endaddr (s
) - offset
)
1128 ginfo
->section
= idx
;
1133 /* If we didn't find the section, assume it is in the first
1134 section. If there is no allocated section, then it hardly
1135 matters what we pick, so just pick zero. */
1139 ginfo
->section
= fallback
;
1144 fixup_symbol_section (struct symbol
*sym
, struct objfile
*objfile
)
1151 /* We either have an OBJFILE, or we can get at it from the sym's
1152 symtab. Anything else is a bug. */
1153 gdb_assert (objfile
|| SYMBOL_SYMTAB (sym
));
1155 if (objfile
== NULL
)
1156 objfile
= SYMBOL_OBJFILE (sym
);
1158 if (SYMBOL_OBJ_SECTION (objfile
, sym
))
1161 /* We should have an objfile by now. */
1162 gdb_assert (objfile
);
1164 switch (SYMBOL_CLASS (sym
))
1168 addr
= SYMBOL_VALUE_ADDRESS (sym
);
1171 addr
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
1175 /* Nothing else will be listed in the minsyms -- no use looking
1180 fixup_section (&sym
->ginfo
, addr
, objfile
);
1185 /* Compute the demangled form of NAME as used by the various symbol
1186 lookup functions. The result is stored in *RESULT_NAME. Returns a
1187 cleanup which can be used to clean up the result.
1189 For Ada, this function just sets *RESULT_NAME to NAME, unmodified.
1190 Normally, Ada symbol lookups are performed using the encoded name
1191 rather than the demangled name, and so it might seem to make sense
1192 for this function to return an encoded version of NAME.
1193 Unfortunately, we cannot do this, because this function is used in
1194 circumstances where it is not appropriate to try to encode NAME.
1195 For instance, when displaying the frame info, we demangle the name
1196 of each parameter, and then perform a symbol lookup inside our
1197 function using that demangled name. In Ada, certain functions
1198 have internally-generated parameters whose name contain uppercase
1199 characters. Encoding those name would result in those uppercase
1200 characters to become lowercase, and thus cause the symbol lookup
1204 demangle_for_lookup (const char *name
, enum language lang
,
1205 const char **result_name
)
1207 char *demangled_name
= NULL
;
1208 const char *modified_name
= NULL
;
1209 struct cleanup
*cleanup
= make_cleanup (null_cleanup
, 0);
1211 modified_name
= name
;
1213 /* If we are using C++, D, Go, or Java, demangle the name before doing a
1214 lookup, so we can always binary search. */
1215 if (lang
== language_cplus
)
1217 demangled_name
= gdb_demangle (name
, DMGL_ANSI
| DMGL_PARAMS
);
1220 modified_name
= demangled_name
;
1221 make_cleanup (xfree
, demangled_name
);
1225 /* If we were given a non-mangled name, canonicalize it
1226 according to the language (so far only for C++). */
1227 demangled_name
= cp_canonicalize_string (name
);
1230 modified_name
= demangled_name
;
1231 make_cleanup (xfree
, demangled_name
);
1235 else if (lang
== language_java
)
1237 demangled_name
= gdb_demangle (name
,
1238 DMGL_ANSI
| DMGL_PARAMS
| DMGL_JAVA
);
1241 modified_name
= demangled_name
;
1242 make_cleanup (xfree
, demangled_name
);
1245 else if (lang
== language_d
)
1247 demangled_name
= d_demangle (name
, 0);
1250 modified_name
= demangled_name
;
1251 make_cleanup (xfree
, demangled_name
);
1254 else if (lang
== language_go
)
1256 demangled_name
= go_demangle (name
, 0);
1259 modified_name
= demangled_name
;
1260 make_cleanup (xfree
, demangled_name
);
1264 *result_name
= modified_name
;
1270 This function (or rather its subordinates) have a bunch of loops and
1271 it would seem to be attractive to put in some QUIT's (though I'm not really
1272 sure whether it can run long enough to be really important). But there
1273 are a few calls for which it would appear to be bad news to quit
1274 out of here: e.g., find_proc_desc in alpha-mdebug-tdep.c. (Note
1275 that there is C++ code below which can error(), but that probably
1276 doesn't affect these calls since they are looking for a known
1277 variable and thus can probably assume it will never hit the C++
1281 lookup_symbol_in_language (const char *name
, const struct block
*block
,
1282 const domain_enum domain
, enum language lang
,
1283 struct field_of_this_result
*is_a_field_of_this
)
1285 const char *modified_name
;
1286 struct symbol
*returnval
;
1287 struct cleanup
*cleanup
= demangle_for_lookup (name
, lang
, &modified_name
);
1289 returnval
= lookup_symbol_aux (modified_name
, block
, domain
, lang
,
1290 is_a_field_of_this
);
1291 do_cleanups (cleanup
);
1299 lookup_symbol (const char *name
, const struct block
*block
,
1301 struct field_of_this_result
*is_a_field_of_this
)
1303 return lookup_symbol_in_language (name
, block
, domain
,
1304 current_language
->la_language
,
1305 is_a_field_of_this
);
1311 lookup_language_this (const struct language_defn
*lang
,
1312 const struct block
*block
)
1314 if (lang
->la_name_of_this
== NULL
|| block
== NULL
)
1321 sym
= block_lookup_symbol (block
, lang
->la_name_of_this
, VAR_DOMAIN
);
1324 block_found
= block
;
1327 if (BLOCK_FUNCTION (block
))
1329 block
= BLOCK_SUPERBLOCK (block
);
1335 /* Given TYPE, a structure/union,
1336 return 1 if the component named NAME from the ultimate target
1337 structure/union is defined, otherwise, return 0. */
1340 check_field (struct type
*type
, const char *name
,
1341 struct field_of_this_result
*is_a_field_of_this
)
1345 /* The type may be a stub. */
1346 CHECK_TYPEDEF (type
);
1348 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
1350 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1352 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1354 is_a_field_of_this
->type
= type
;
1355 is_a_field_of_this
->field
= &TYPE_FIELD (type
, i
);
1360 /* C++: If it was not found as a data field, then try to return it
1361 as a pointer to a method. */
1363 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
1365 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
1367 is_a_field_of_this
->type
= type
;
1368 is_a_field_of_this
->fn_field
= &TYPE_FN_FIELDLIST (type
, i
);
1373 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1374 if (check_field (TYPE_BASECLASS (type
, i
), name
, is_a_field_of_this
))
1380 /* Behave like lookup_symbol except that NAME is the natural name
1381 (e.g., demangled name) of the symbol that we're looking for. */
1383 static struct symbol
*
1384 lookup_symbol_aux (const char *name
, const struct block
*block
,
1385 const domain_enum domain
, enum language language
,
1386 struct field_of_this_result
*is_a_field_of_this
)
1389 const struct language_defn
*langdef
;
1391 /* Make sure we do something sensible with is_a_field_of_this, since
1392 the callers that set this parameter to some non-null value will
1393 certainly use it later. If we don't set it, the contents of
1394 is_a_field_of_this are undefined. */
1395 if (is_a_field_of_this
!= NULL
)
1396 memset (is_a_field_of_this
, 0, sizeof (*is_a_field_of_this
));
1398 /* Search specified block and its superiors. Don't search
1399 STATIC_BLOCK or GLOBAL_BLOCK. */
1401 sym
= lookup_local_symbol (name
, block
, domain
, language
);
1405 /* If requested to do so by the caller and if appropriate for LANGUAGE,
1406 check to see if NAME is a field of `this'. */
1408 langdef
= language_def (language
);
1410 /* Don't do this check if we are searching for a struct. It will
1411 not be found by check_field, but will be found by other
1413 if (is_a_field_of_this
!= NULL
&& domain
!= STRUCT_DOMAIN
)
1415 struct symbol
*sym
= lookup_language_this (langdef
, block
);
1419 struct type
*t
= sym
->type
;
1421 /* I'm not really sure that type of this can ever
1422 be typedefed; just be safe. */
1424 if (TYPE_CODE (t
) == TYPE_CODE_PTR
1425 || TYPE_CODE (t
) == TYPE_CODE_REF
)
1426 t
= TYPE_TARGET_TYPE (t
);
1428 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1429 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1430 error (_("Internal error: `%s' is not an aggregate"),
1431 langdef
->la_name_of_this
);
1433 if (check_field (t
, name
, is_a_field_of_this
))
1438 /* Now do whatever is appropriate for LANGUAGE to look
1439 up static and global variables. */
1441 sym
= langdef
->la_lookup_symbol_nonlocal (name
, block
, domain
);
1445 /* Now search all static file-level symbols. Not strictly correct,
1446 but more useful than an error. */
1448 return lookup_static_symbol (name
, domain
);
1451 /* Check to see if the symbol is defined in BLOCK or its superiors.
1452 Don't search STATIC_BLOCK or GLOBAL_BLOCK. */
1454 static struct symbol
*
1455 lookup_local_symbol (const char *name
, const struct block
*block
,
1456 const domain_enum domain
,
1457 enum language language
)
1460 const struct block
*static_block
= block_static_block (block
);
1461 const char *scope
= block_scope (block
);
1463 /* Check if either no block is specified or it's a global block. */
1465 if (static_block
== NULL
)
1468 while (block
!= static_block
)
1470 sym
= lookup_symbol_in_block (name
, block
, domain
);
1474 if (language
== language_cplus
|| language
== language_fortran
)
1476 sym
= cp_lookup_symbol_imports_or_template (scope
, name
, block
,
1482 if (BLOCK_FUNCTION (block
) != NULL
&& block_inlined_p (block
))
1484 block
= BLOCK_SUPERBLOCK (block
);
1487 /* We've reached the end of the function without finding a result. */
1495 lookup_objfile_from_block (const struct block
*block
)
1497 struct objfile
*obj
;
1498 struct compunit_symtab
*cust
;
1503 block
= block_global_block (block
);
1504 /* Look through all blockvectors. */
1505 ALL_COMPUNITS (obj
, cust
)
1506 if (block
== BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cust
),
1509 if (obj
->separate_debug_objfile_backlink
)
1510 obj
= obj
->separate_debug_objfile_backlink
;
1521 lookup_symbol_in_block (const char *name
, const struct block
*block
,
1522 const domain_enum domain
)
1526 sym
= block_lookup_symbol (block
, name
, domain
);
1529 block_found
= block
;
1530 return fixup_symbol_section (sym
, NULL
);
1539 lookup_global_symbol_from_objfile (const struct objfile
*main_objfile
,
1541 const domain_enum domain
)
1543 const struct objfile
*objfile
;
1545 for (objfile
= main_objfile
;
1547 objfile
= objfile_separate_debug_iterate (main_objfile
, objfile
))
1549 struct compunit_symtab
*cust
;
1552 /* Go through symtabs. */
1553 ALL_OBJFILE_COMPUNITS (objfile
, cust
)
1555 const struct blockvector
*bv
;
1556 const struct block
*block
;
1558 bv
= COMPUNIT_BLOCKVECTOR (cust
);
1559 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1560 sym
= block_lookup_symbol (block
, name
, domain
);
1563 block_found
= block
;
1564 return fixup_symbol_section (sym
, (struct objfile
*)objfile
);
1568 sym
= lookup_symbol_via_quick_fns ((struct objfile
*) objfile
,
1569 GLOBAL_BLOCK
, name
, domain
);
1577 /* Check to see if the symbol is defined in one of the OBJFILE's
1578 symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK,
1579 depending on whether or not we want to search global symbols or
1582 static struct symbol
*
1583 lookup_symbol_in_objfile_symtabs (struct objfile
*objfile
, int block_index
,
1584 const char *name
, const domain_enum domain
)
1586 struct compunit_symtab
*cust
;
1588 ALL_OBJFILE_COMPUNITS (objfile
, cust
)
1590 const struct blockvector
*bv
;
1591 const struct block
*block
;
1594 bv
= COMPUNIT_BLOCKVECTOR (cust
);
1595 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1596 sym
= block_lookup_symbol (block
, name
, domain
);
1599 block_found
= block
;
1600 return fixup_symbol_section (sym
, objfile
);
1607 /* Wrapper around lookup_symbol_in_objfile_symtabs for search_symbols.
1608 Look up LINKAGE_NAME in DOMAIN in the global and static blocks of OBJFILE
1609 and all associated separate debug objfiles.
1611 Normally we only look in OBJFILE, and not any separate debug objfiles
1612 because the outer loop will cause them to be searched too. This case is
1613 different. Here we're called from search_symbols where it will only
1614 call us for the the objfile that contains a matching minsym. */
1616 static struct symbol
*
1617 lookup_symbol_in_objfile_from_linkage_name (struct objfile
*objfile
,
1618 const char *linkage_name
,
1621 enum language lang
= current_language
->la_language
;
1622 const char *modified_name
;
1623 struct cleanup
*cleanup
= demangle_for_lookup (linkage_name
, lang
,
1625 struct objfile
*main_objfile
, *cur_objfile
;
1627 if (objfile
->separate_debug_objfile_backlink
)
1628 main_objfile
= objfile
->separate_debug_objfile_backlink
;
1630 main_objfile
= objfile
;
1632 for (cur_objfile
= main_objfile
;
1634 cur_objfile
= objfile_separate_debug_iterate (main_objfile
, cur_objfile
))
1638 sym
= lookup_symbol_in_objfile_symtabs (cur_objfile
, GLOBAL_BLOCK
,
1639 modified_name
, domain
);
1641 sym
= lookup_symbol_in_objfile_symtabs (cur_objfile
, STATIC_BLOCK
,
1642 modified_name
, domain
);
1645 do_cleanups (cleanup
);
1650 do_cleanups (cleanup
);
1654 /* A helper function that throws an exception when a symbol was found
1655 in a psymtab but not in a symtab. */
1657 static void ATTRIBUTE_NORETURN
1658 error_in_psymtab_expansion (int block_index
, const char *name
,
1659 struct compunit_symtab
*cust
)
1662 Internal: %s symbol `%s' found in %s psymtab but not in symtab.\n\
1663 %s may be an inlined function, or may be a template function\n \
1664 (if a template, try specifying an instantiation: %s<type>)."),
1665 block_index
== GLOBAL_BLOCK
? "global" : "static",
1667 symtab_to_filename_for_display (compunit_primary_filetab (cust
)),
1671 /* A helper function for various lookup routines that interfaces with
1672 the "quick" symbol table functions. */
1674 static struct symbol
*
1675 lookup_symbol_via_quick_fns (struct objfile
*objfile
, int block_index
,
1676 const char *name
, const domain_enum domain
)
1678 struct compunit_symtab
*cust
;
1679 const struct blockvector
*bv
;
1680 const struct block
*block
;
1685 cust
= objfile
->sf
->qf
->lookup_symbol (objfile
, block_index
, name
, domain
);
1689 bv
= COMPUNIT_BLOCKVECTOR (cust
);
1690 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1691 sym
= block_lookup_symbol (block
, name
, domain
);
1693 error_in_psymtab_expansion (block_index
, name
, cust
);
1694 block_found
= block
;
1695 return fixup_symbol_section (sym
, objfile
);
1701 basic_lookup_symbol_nonlocal (const char *name
,
1702 const struct block
*block
,
1703 const domain_enum domain
)
1707 /* NOTE: carlton/2003-05-19: The comments below were written when
1708 this (or what turned into this) was part of lookup_symbol_aux;
1709 I'm much less worried about these questions now, since these
1710 decisions have turned out well, but I leave these comments here
1713 /* NOTE: carlton/2002-12-05: There is a question as to whether or
1714 not it would be appropriate to search the current global block
1715 here as well. (That's what this code used to do before the
1716 is_a_field_of_this check was moved up.) On the one hand, it's
1717 redundant with the lookup in all objfiles search that happens
1718 next. On the other hand, if decode_line_1 is passed an argument
1719 like filename:var, then the user presumably wants 'var' to be
1720 searched for in filename. On the third hand, there shouldn't be
1721 multiple global variables all of which are named 'var', and it's
1722 not like decode_line_1 has ever restricted its search to only
1723 global variables in a single filename. All in all, only
1724 searching the static block here seems best: it's correct and it's
1727 /* NOTE: carlton/2002-12-05: There's also a possible performance
1728 issue here: if you usually search for global symbols in the
1729 current file, then it would be slightly better to search the
1730 current global block before searching all the symtabs. But there
1731 are other factors that have a much greater effect on performance
1732 than that one, so I don't think we should worry about that for
1735 /* NOTE: dje/2014-10-26: The lookup in all objfiles search could skip
1736 the current objfile. Searching the current objfile first is useful
1737 for both matching user expectations as well as performance. */
1739 sym
= lookup_symbol_in_static_block (name
, block
, domain
);
1743 return lookup_global_symbol (name
, block
, domain
);
1749 lookup_symbol_in_static_block (const char *name
,
1750 const struct block
*block
,
1751 const domain_enum domain
)
1753 const struct block
*static_block
= block_static_block (block
);
1755 if (static_block
!= NULL
)
1756 return lookup_symbol_in_block (name
, static_block
, domain
);
1761 /* Perform the standard symbol lookup of NAME in OBJFILE:
1762 1) First search expanded symtabs, and if not found
1763 2) Search the "quick" symtabs (partial or .gdb_index).
1764 BLOCK_INDEX is one of GLOBAL_BLOCK or STATIC_BLOCK. */
1766 static struct symbol
*
1767 lookup_symbol_in_objfile (struct objfile
*objfile
, int block_index
,
1768 const char *name
, const domain_enum domain
)
1770 struct symbol
*result
;
1772 result
= lookup_symbol_in_objfile_symtabs (objfile
, block_index
,
1776 result
= lookup_symbol_via_quick_fns (objfile
, block_index
,
1786 lookup_static_symbol (const char *name
, const domain_enum domain
)
1788 struct objfile
*objfile
;
1789 struct symbol
*result
;
1791 ALL_OBJFILES (objfile
)
1793 result
= lookup_symbol_in_objfile (objfile
, STATIC_BLOCK
, name
, domain
);
1801 /* Private data to be used with lookup_symbol_global_iterator_cb. */
1803 struct global_sym_lookup_data
1805 /* The name of the symbol we are searching for. */
1808 /* The domain to use for our search. */
1811 /* The field where the callback should store the symbol if found.
1812 It should be initialized to NULL before the search is started. */
1813 struct symbol
*result
;
1816 /* A callback function for gdbarch_iterate_over_objfiles_in_search_order.
1817 It searches by name for a symbol in the GLOBAL_BLOCK of the given
1818 OBJFILE. The arguments for the search are passed via CB_DATA,
1819 which in reality is a pointer to struct global_sym_lookup_data. */
1822 lookup_symbol_global_iterator_cb (struct objfile
*objfile
,
1825 struct global_sym_lookup_data
*data
=
1826 (struct global_sym_lookup_data
*) cb_data
;
1828 gdb_assert (data
->result
== NULL
);
1830 data
->result
= lookup_symbol_in_objfile (objfile
, GLOBAL_BLOCK
,
1831 data
->name
, data
->domain
);
1833 /* If we found a match, tell the iterator to stop. Otherwise,
1835 return (data
->result
!= NULL
);
1841 lookup_global_symbol (const char *name
,
1842 const struct block
*block
,
1843 const domain_enum domain
)
1845 struct symbol
*sym
= NULL
;
1846 struct objfile
*objfile
= NULL
;
1847 struct global_sym_lookup_data lookup_data
;
1849 /* Call library-specific lookup procedure. */
1850 objfile
= lookup_objfile_from_block (block
);
1851 if (objfile
!= NULL
)
1852 sym
= solib_global_lookup (objfile
, name
, domain
);
1856 memset (&lookup_data
, 0, sizeof (lookup_data
));
1857 lookup_data
.name
= name
;
1858 lookup_data
.domain
= domain
;
1859 gdbarch_iterate_over_objfiles_in_search_order
1860 (objfile
!= NULL
? get_objfile_arch (objfile
) : target_gdbarch (),
1861 lookup_symbol_global_iterator_cb
, &lookup_data
, objfile
);
1863 return lookup_data
.result
;
1867 symbol_matches_domain (enum language symbol_language
,
1868 domain_enum symbol_domain
,
1871 /* For C++ "struct foo { ... }" also defines a typedef for "foo".
1872 A Java class declaration also defines a typedef for the class.
1873 Similarly, any Ada type declaration implicitly defines a typedef. */
1874 if (symbol_language
== language_cplus
1875 || symbol_language
== language_d
1876 || symbol_language
== language_java
1877 || symbol_language
== language_ada
)
1879 if ((domain
== VAR_DOMAIN
|| domain
== STRUCT_DOMAIN
)
1880 && symbol_domain
== STRUCT_DOMAIN
)
1883 /* For all other languages, strict match is required. */
1884 return (symbol_domain
== domain
);
1890 lookup_transparent_type (const char *name
)
1892 return current_language
->la_lookup_transparent_type (name
);
1895 /* A helper for basic_lookup_transparent_type that interfaces with the
1896 "quick" symbol table functions. */
1898 static struct type
*
1899 basic_lookup_transparent_type_quick (struct objfile
*objfile
, int block_index
,
1902 struct compunit_symtab
*cust
;
1903 const struct blockvector
*bv
;
1904 struct block
*block
;
1909 cust
= objfile
->sf
->qf
->lookup_symbol (objfile
, block_index
, name
,
1914 bv
= COMPUNIT_BLOCKVECTOR (cust
);
1915 block
= BLOCKVECTOR_BLOCK (bv
, block_index
);
1916 sym
= block_lookup_symbol (block
, name
, STRUCT_DOMAIN
);
1918 error_in_psymtab_expansion (block_index
, name
, cust
);
1920 if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1921 return SYMBOL_TYPE (sym
);
1926 /* The standard implementation of lookup_transparent_type. This code
1927 was modeled on lookup_symbol -- the parts not relevant to looking
1928 up types were just left out. In particular it's assumed here that
1929 types are available in STRUCT_DOMAIN and only in file-static or
1933 basic_lookup_transparent_type (const char *name
)
1936 struct compunit_symtab
*cust
;
1937 const struct blockvector
*bv
;
1938 struct objfile
*objfile
;
1939 struct block
*block
;
1942 /* Now search all the global symbols. Do the symtab's first, then
1943 check the psymtab's. If a psymtab indicates the existence
1944 of the desired name as a global, then do psymtab-to-symtab
1945 conversion on the fly and return the found symbol. */
1947 ALL_OBJFILES (objfile
)
1949 ALL_OBJFILE_COMPUNITS (objfile
, cust
)
1951 bv
= COMPUNIT_BLOCKVECTOR (cust
);
1952 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
1953 sym
= block_lookup_symbol (block
, name
, STRUCT_DOMAIN
);
1954 if (sym
&& !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1956 return SYMBOL_TYPE (sym
);
1961 ALL_OBJFILES (objfile
)
1963 t
= basic_lookup_transparent_type_quick (objfile
, GLOBAL_BLOCK
, name
);
1968 /* Now search the static file-level symbols.
1969 Not strictly correct, but more useful than an error.
1970 Do the symtab's first, then
1971 check the psymtab's. If a psymtab indicates the existence
1972 of the desired name as a file-level static, then do psymtab-to-symtab
1973 conversion on the fly and return the found symbol. */
1975 ALL_OBJFILES (objfile
)
1977 ALL_OBJFILE_COMPUNITS (objfile
, cust
)
1979 bv
= COMPUNIT_BLOCKVECTOR (cust
);
1980 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
1981 sym
= block_lookup_symbol (block
, name
, STRUCT_DOMAIN
);
1982 if (sym
&& !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym
)))
1984 return SYMBOL_TYPE (sym
);
1989 ALL_OBJFILES (objfile
)
1991 t
= basic_lookup_transparent_type_quick (objfile
, STATIC_BLOCK
, name
);
1996 return (struct type
*) 0;
1999 /* Iterate over the symbols named NAME, matching DOMAIN, in BLOCK.
2001 For each symbol that matches, CALLBACK is called. The symbol and
2002 DATA are passed to the callback.
2004 If CALLBACK returns zero, the iteration ends. Otherwise, the
2005 search continues. */
2008 iterate_over_symbols (const struct block
*block
, const char *name
,
2009 const domain_enum domain
,
2010 symbol_found_callback_ftype
*callback
,
2013 struct block_iterator iter
;
2016 ALL_BLOCK_SYMBOLS_WITH_NAME (block
, name
, iter
, sym
)
2018 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
2019 SYMBOL_DOMAIN (sym
), domain
))
2021 if (!callback (sym
, data
))
2027 /* Find the compunit symtab associated with PC and SECTION.
2028 This will read in debug info as necessary. */
2030 struct compunit_symtab
*
2031 find_pc_sect_compunit_symtab (CORE_ADDR pc
, struct obj_section
*section
)
2033 struct compunit_symtab
*cust
;
2034 struct compunit_symtab
*best_cust
= NULL
;
2035 struct objfile
*objfile
;
2036 CORE_ADDR distance
= 0;
2037 struct bound_minimal_symbol msymbol
;
2039 /* If we know that this is not a text address, return failure. This is
2040 necessary because we loop based on the block's high and low code
2041 addresses, which do not include the data ranges, and because
2042 we call find_pc_sect_psymtab which has a similar restriction based
2043 on the partial_symtab's texthigh and textlow. */
2044 msymbol
= lookup_minimal_symbol_by_pc_section (pc
, section
);
2046 && (MSYMBOL_TYPE (msymbol
.minsym
) == mst_data
2047 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_bss
2048 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_abs
2049 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_data
2050 || MSYMBOL_TYPE (msymbol
.minsym
) == mst_file_bss
))
2053 /* Search all symtabs for the one whose file contains our address, and which
2054 is the smallest of all the ones containing the address. This is designed
2055 to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000
2056 and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from
2057 0x1000-0x4000, but for address 0x2345 we want to return symtab b.
2059 This happens for native ecoff format, where code from included files
2060 gets its own symtab. The symtab for the included file should have
2061 been read in already via the dependency mechanism.
2062 It might be swifter to create several symtabs with the same name
2063 like xcoff does (I'm not sure).
2065 It also happens for objfiles that have their functions reordered.
2066 For these, the symtab we are looking for is not necessarily read in. */
2068 ALL_COMPUNITS (objfile
, cust
)
2071 const struct blockvector
*bv
;
2073 bv
= COMPUNIT_BLOCKVECTOR (cust
);
2074 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
2076 if (BLOCK_START (b
) <= pc
2077 && BLOCK_END (b
) > pc
2079 || BLOCK_END (b
) - BLOCK_START (b
) < distance
))
2081 /* For an objfile that has its functions reordered,
2082 find_pc_psymtab will find the proper partial symbol table
2083 and we simply return its corresponding symtab. */
2084 /* In order to better support objfiles that contain both
2085 stabs and coff debugging info, we continue on if a psymtab
2087 if ((objfile
->flags
& OBJF_REORDERED
) && objfile
->sf
)
2089 struct compunit_symtab
*result
;
2092 = objfile
->sf
->qf
->find_pc_sect_compunit_symtab (objfile
,
2101 struct block_iterator iter
;
2102 struct symbol
*sym
= NULL
;
2104 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
2106 fixup_symbol_section (sym
, objfile
);
2107 if (matching_obj_sections (SYMBOL_OBJ_SECTION (objfile
, sym
),
2112 continue; /* No symbol in this symtab matches
2115 distance
= BLOCK_END (b
) - BLOCK_START (b
);
2120 if (best_cust
!= NULL
)
2123 /* Not found in symtabs, search the "quick" symtabs (e.g. psymtabs). */
2125 ALL_OBJFILES (objfile
)
2127 struct compunit_symtab
*result
;
2131 result
= objfile
->sf
->qf
->find_pc_sect_compunit_symtab (objfile
,
2142 /* Find the compunit symtab associated with PC.
2143 This will read in debug info as necessary.
2144 Backward compatibility, no section. */
2146 struct compunit_symtab
*
2147 find_pc_compunit_symtab (CORE_ADDR pc
)
2149 return find_pc_sect_compunit_symtab (pc
, find_pc_mapped_section (pc
));
2153 /* Find the source file and line number for a given PC value and SECTION.
2154 Return a structure containing a symtab pointer, a line number,
2155 and a pc range for the entire source line.
2156 The value's .pc field is NOT the specified pc.
2157 NOTCURRENT nonzero means, if specified pc is on a line boundary,
2158 use the line that ends there. Otherwise, in that case, the line
2159 that begins there is used. */
2161 /* The big complication here is that a line may start in one file, and end just
2162 before the start of another file. This usually occurs when you #include
2163 code in the middle of a subroutine. To properly find the end of a line's PC
2164 range, we must search all symtabs associated with this compilation unit, and
2165 find the one whose first PC is closer than that of the next line in this
2168 /* If it's worth the effort, we could be using a binary search. */
2170 struct symtab_and_line
2171 find_pc_sect_line (CORE_ADDR pc
, struct obj_section
*section
, int notcurrent
)
2173 struct compunit_symtab
*cust
;
2174 struct symtab
*iter_s
;
2175 struct linetable
*l
;
2178 struct linetable_entry
*item
;
2179 struct symtab_and_line val
;
2180 const struct blockvector
*bv
;
2181 struct bound_minimal_symbol msymbol
;
2183 /* Info on best line seen so far, and where it starts, and its file. */
2185 struct linetable_entry
*best
= NULL
;
2186 CORE_ADDR best_end
= 0;
2187 struct symtab
*best_symtab
= 0;
2189 /* Store here the first line number
2190 of a file which contains the line at the smallest pc after PC.
2191 If we don't find a line whose range contains PC,
2192 we will use a line one less than this,
2193 with a range from the start of that file to the first line's pc. */
2194 struct linetable_entry
*alt
= NULL
;
2196 /* Info on best line seen in this file. */
2198 struct linetable_entry
*prev
;
2200 /* If this pc is not from the current frame,
2201 it is the address of the end of a call instruction.
2202 Quite likely that is the start of the following statement.
2203 But what we want is the statement containing the instruction.
2204 Fudge the pc to make sure we get that. */
2206 init_sal (&val
); /* initialize to zeroes */
2208 val
.pspace
= current_program_space
;
2210 /* It's tempting to assume that, if we can't find debugging info for
2211 any function enclosing PC, that we shouldn't search for line
2212 number info, either. However, GAS can emit line number info for
2213 assembly files --- very helpful when debugging hand-written
2214 assembly code. In such a case, we'd have no debug info for the
2215 function, but we would have line info. */
2220 /* elz: added this because this function returned the wrong
2221 information if the pc belongs to a stub (import/export)
2222 to call a shlib function. This stub would be anywhere between
2223 two functions in the target, and the line info was erroneously
2224 taken to be the one of the line before the pc. */
2226 /* RT: Further explanation:
2228 * We have stubs (trampolines) inserted between procedures.
2230 * Example: "shr1" exists in a shared library, and a "shr1" stub also
2231 * exists in the main image.
2233 * In the minimal symbol table, we have a bunch of symbols
2234 * sorted by start address. The stubs are marked as "trampoline",
2235 * the others appear as text. E.g.:
2237 * Minimal symbol table for main image
2238 * main: code for main (text symbol)
2239 * shr1: stub (trampoline symbol)
2240 * foo: code for foo (text symbol)
2242 * Minimal symbol table for "shr1" image:
2244 * shr1: code for shr1 (text symbol)
2247 * So the code below is trying to detect if we are in the stub
2248 * ("shr1" stub), and if so, find the real code ("shr1" trampoline),
2249 * and if found, do the symbolization from the real-code address
2250 * rather than the stub address.
2252 * Assumptions being made about the minimal symbol table:
2253 * 1. lookup_minimal_symbol_by_pc() will return a trampoline only
2254 * if we're really in the trampoline.s If we're beyond it (say
2255 * we're in "foo" in the above example), it'll have a closer
2256 * symbol (the "foo" text symbol for example) and will not
2257 * return the trampoline.
2258 * 2. lookup_minimal_symbol_text() will find a real text symbol
2259 * corresponding to the trampoline, and whose address will
2260 * be different than the trampoline address. I put in a sanity
2261 * check for the address being the same, to avoid an
2262 * infinite recursion.
2264 msymbol
= lookup_minimal_symbol_by_pc (pc
);
2265 if (msymbol
.minsym
!= NULL
)
2266 if (MSYMBOL_TYPE (msymbol
.minsym
) == mst_solib_trampoline
)
2268 struct bound_minimal_symbol mfunsym
2269 = lookup_minimal_symbol_text (MSYMBOL_LINKAGE_NAME (msymbol
.minsym
),
2272 if (mfunsym
.minsym
== NULL
)
2273 /* I eliminated this warning since it is coming out
2274 * in the following situation:
2275 * gdb shmain // test program with shared libraries
2276 * (gdb) break shr1 // function in shared lib
2277 * Warning: In stub for ...
2278 * In the above situation, the shared lib is not loaded yet,
2279 * so of course we can't find the real func/line info,
2280 * but the "break" still works, and the warning is annoying.
2281 * So I commented out the warning. RT */
2282 /* warning ("In stub for %s; unable to find real function/line info",
2283 SYMBOL_LINKAGE_NAME (msymbol)); */
2286 else if (BMSYMBOL_VALUE_ADDRESS (mfunsym
)
2287 == BMSYMBOL_VALUE_ADDRESS (msymbol
))
2288 /* Avoid infinite recursion */
2289 /* See above comment about why warning is commented out. */
2290 /* warning ("In stub for %s; unable to find real function/line info",
2291 SYMBOL_LINKAGE_NAME (msymbol)); */
2295 return find_pc_line (BMSYMBOL_VALUE_ADDRESS (mfunsym
), 0);
2299 cust
= find_pc_sect_compunit_symtab (pc
, section
);
2302 /* If no symbol information, return previous pc. */
2309 bv
= COMPUNIT_BLOCKVECTOR (cust
);
2311 /* Look at all the symtabs that share this blockvector.
2312 They all have the same apriori range, that we found was right;
2313 but they have different line tables. */
2315 ALL_COMPUNIT_FILETABS (cust
, iter_s
)
2317 /* Find the best line in this symtab. */
2318 l
= SYMTAB_LINETABLE (iter_s
);
2324 /* I think len can be zero if the symtab lacks line numbers
2325 (e.g. gcc -g1). (Either that or the LINETABLE is NULL;
2326 I'm not sure which, and maybe it depends on the symbol
2332 item
= l
->item
; /* Get first line info. */
2334 /* Is this file's first line closer than the first lines of other files?
2335 If so, record this file, and its first line, as best alternate. */
2336 if (item
->pc
> pc
&& (!alt
|| item
->pc
< alt
->pc
))
2339 for (i
= 0; i
< len
; i
++, item
++)
2341 /* Leave prev pointing to the linetable entry for the last line
2342 that started at or before PC. */
2349 /* At this point, prev points at the line whose start addr is <= pc, and
2350 item points at the next line. If we ran off the end of the linetable
2351 (pc >= start of the last line), then prev == item. If pc < start of
2352 the first line, prev will not be set. */
2354 /* Is this file's best line closer than the best in the other files?
2355 If so, record this file, and its best line, as best so far. Don't
2356 save prev if it represents the end of a function (i.e. line number
2357 0) instead of a real line. */
2359 if (prev
&& prev
->line
&& (!best
|| prev
->pc
> best
->pc
))
2362 best_symtab
= iter_s
;
2364 /* Discard BEST_END if it's before the PC of the current BEST. */
2365 if (best_end
<= best
->pc
)
2369 /* If another line (denoted by ITEM) is in the linetable and its
2370 PC is after BEST's PC, but before the current BEST_END, then
2371 use ITEM's PC as the new best_end. */
2372 if (best
&& i
< len
&& item
->pc
> best
->pc
2373 && (best_end
== 0 || best_end
> item
->pc
))
2374 best_end
= item
->pc
;
2379 /* If we didn't find any line number info, just return zeros.
2380 We used to return alt->line - 1 here, but that could be
2381 anywhere; if we don't have line number info for this PC,
2382 don't make some up. */
2385 else if (best
->line
== 0)
2387 /* If our best fit is in a range of PC's for which no line
2388 number info is available (line number is zero) then we didn't
2389 find any valid line information. */
2394 val
.symtab
= best_symtab
;
2395 val
.line
= best
->line
;
2397 if (best_end
&& (!alt
|| best_end
< alt
->pc
))
2402 val
.end
= BLOCK_END (BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
));
2404 val
.section
= section
;
2408 /* Backward compatibility (no section). */
2410 struct symtab_and_line
2411 find_pc_line (CORE_ADDR pc
, int notcurrent
)
2413 struct obj_section
*section
;
2415 section
= find_pc_overlay (pc
);
2416 if (pc_in_unmapped_range (pc
, section
))
2417 pc
= overlay_mapped_address (pc
, section
);
2418 return find_pc_sect_line (pc
, section
, notcurrent
);
2424 find_pc_line_symtab (CORE_ADDR pc
)
2426 struct symtab_and_line sal
;
2428 /* This always passes zero for NOTCURRENT to find_pc_line.
2429 There are currently no callers that ever pass non-zero. */
2430 sal
= find_pc_line (pc
, 0);
2434 /* Find line number LINE in any symtab whose name is the same as
2437 If found, return the symtab that contains the linetable in which it was
2438 found, set *INDEX to the index in the linetable of the best entry
2439 found, and set *EXACT_MATCH nonzero if the value returned is an
2442 If not found, return NULL. */
2445 find_line_symtab (struct symtab
*symtab
, int line
,
2446 int *index
, int *exact_match
)
2448 int exact
= 0; /* Initialized here to avoid a compiler warning. */
2450 /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE
2454 struct linetable
*best_linetable
;
2455 struct symtab
*best_symtab
;
2457 /* First try looking it up in the given symtab. */
2458 best_linetable
= SYMTAB_LINETABLE (symtab
);
2459 best_symtab
= symtab
;
2460 best_index
= find_line_common (best_linetable
, line
, &exact
, 0);
2461 if (best_index
< 0 || !exact
)
2463 /* Didn't find an exact match. So we better keep looking for
2464 another symtab with the same name. In the case of xcoff,
2465 multiple csects for one source file (produced by IBM's FORTRAN
2466 compiler) produce multiple symtabs (this is unavoidable
2467 assuming csects can be at arbitrary places in memory and that
2468 the GLOBAL_BLOCK of a symtab has a begin and end address). */
2470 /* BEST is the smallest linenumber > LINE so far seen,
2471 or 0 if none has been seen so far.
2472 BEST_INDEX and BEST_LINETABLE identify the item for it. */
2475 struct objfile
*objfile
;
2476 struct compunit_symtab
*cu
;
2479 if (best_index
>= 0)
2480 best
= best_linetable
->item
[best_index
].line
;
2484 ALL_OBJFILES (objfile
)
2487 objfile
->sf
->qf
->expand_symtabs_with_fullname (objfile
,
2488 symtab_to_fullname (symtab
));
2491 ALL_FILETABS (objfile
, cu
, s
)
2493 struct linetable
*l
;
2496 if (FILENAME_CMP (symtab
->filename
, s
->filename
) != 0)
2498 if (FILENAME_CMP (symtab_to_fullname (symtab
),
2499 symtab_to_fullname (s
)) != 0)
2501 l
= SYMTAB_LINETABLE (s
);
2502 ind
= find_line_common (l
, line
, &exact
, 0);
2512 if (best
== 0 || l
->item
[ind
].line
< best
)
2514 best
= l
->item
[ind
].line
;
2527 *index
= best_index
;
2529 *exact_match
= exact
;
2534 /* Given SYMTAB, returns all the PCs function in the symtab that
2535 exactly match LINE. Returns NULL if there are no exact matches,
2536 but updates BEST_ITEM in this case. */
2539 find_pcs_for_symtab_line (struct symtab
*symtab
, int line
,
2540 struct linetable_entry
**best_item
)
2543 VEC (CORE_ADDR
) *result
= NULL
;
2545 /* First, collect all the PCs that are at this line. */
2551 idx
= find_line_common (SYMTAB_LINETABLE (symtab
), line
, &was_exact
,
2558 struct linetable_entry
*item
= &SYMTAB_LINETABLE (symtab
)->item
[idx
];
2560 if (*best_item
== NULL
|| item
->line
< (*best_item
)->line
)
2566 VEC_safe_push (CORE_ADDR
, result
,
2567 SYMTAB_LINETABLE (symtab
)->item
[idx
].pc
);
2575 /* Set the PC value for a given source file and line number and return true.
2576 Returns zero for invalid line number (and sets the PC to 0).
2577 The source file is specified with a struct symtab. */
2580 find_line_pc (struct symtab
*symtab
, int line
, CORE_ADDR
*pc
)
2582 struct linetable
*l
;
2589 symtab
= find_line_symtab (symtab
, line
, &ind
, NULL
);
2592 l
= SYMTAB_LINETABLE (symtab
);
2593 *pc
= l
->item
[ind
].pc
;
2600 /* Find the range of pc values in a line.
2601 Store the starting pc of the line into *STARTPTR
2602 and the ending pc (start of next line) into *ENDPTR.
2603 Returns 1 to indicate success.
2604 Returns 0 if could not find the specified line. */
2607 find_line_pc_range (struct symtab_and_line sal
, CORE_ADDR
*startptr
,
2610 CORE_ADDR startaddr
;
2611 struct symtab_and_line found_sal
;
2614 if (startaddr
== 0 && !find_line_pc (sal
.symtab
, sal
.line
, &startaddr
))
2617 /* This whole function is based on address. For example, if line 10 has
2618 two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then
2619 "info line *0x123" should say the line goes from 0x100 to 0x200
2620 and "info line *0x355" should say the line goes from 0x300 to 0x400.
2621 This also insures that we never give a range like "starts at 0x134
2622 and ends at 0x12c". */
2624 found_sal
= find_pc_sect_line (startaddr
, sal
.section
, 0);
2625 if (found_sal
.line
!= sal
.line
)
2627 /* The specified line (sal) has zero bytes. */
2628 *startptr
= found_sal
.pc
;
2629 *endptr
= found_sal
.pc
;
2633 *startptr
= found_sal
.pc
;
2634 *endptr
= found_sal
.end
;
2639 /* Given a line table and a line number, return the index into the line
2640 table for the pc of the nearest line whose number is >= the specified one.
2641 Return -1 if none is found. The value is >= 0 if it is an index.
2642 START is the index at which to start searching the line table.
2644 Set *EXACT_MATCH nonzero if the value returned is an exact match. */
2647 find_line_common (struct linetable
*l
, int lineno
,
2648 int *exact_match
, int start
)
2653 /* BEST is the smallest linenumber > LINENO so far seen,
2654 or 0 if none has been seen so far.
2655 BEST_INDEX identifies the item for it. */
2657 int best_index
= -1;
2668 for (i
= start
; i
< len
; i
++)
2670 struct linetable_entry
*item
= &(l
->item
[i
]);
2672 if (item
->line
== lineno
)
2674 /* Return the first (lowest address) entry which matches. */
2679 if (item
->line
> lineno
&& (best
== 0 || item
->line
< best
))
2686 /* If we got here, we didn't get an exact match. */
2691 find_pc_line_pc_range (CORE_ADDR pc
, CORE_ADDR
*startptr
, CORE_ADDR
*endptr
)
2693 struct symtab_and_line sal
;
2695 sal
= find_pc_line (pc
, 0);
2698 return sal
.symtab
!= 0;
2701 /* Given a function symbol SYM, find the symtab and line for the start
2703 If the argument FUNFIRSTLINE is nonzero, we want the first line
2704 of real code inside the function. */
2706 struct symtab_and_line
2707 find_function_start_sal (struct symbol
*sym
, int funfirstline
)
2709 struct symtab_and_line sal
;
2711 fixup_symbol_section (sym
, NULL
);
2712 sal
= find_pc_sect_line (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)),
2713 SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
), 0);
2715 /* We always should have a line for the function start address.
2716 If we don't, something is odd. Create a plain SAL refering
2717 just the PC and hope that skip_prologue_sal (if requested)
2718 can find a line number for after the prologue. */
2719 if (sal
.pc
< BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)))
2722 sal
.pspace
= current_program_space
;
2723 sal
.pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2724 sal
.section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2728 skip_prologue_sal (&sal
);
2733 /* Given a function start address FUNC_ADDR and SYMTAB, find the first
2734 address for that function that has an entry in SYMTAB's line info
2735 table. If such an entry cannot be found, return FUNC_ADDR
2739 skip_prologue_using_lineinfo (CORE_ADDR func_addr
, struct symtab
*symtab
)
2741 CORE_ADDR func_start
, func_end
;
2742 struct linetable
*l
;
2745 /* Give up if this symbol has no lineinfo table. */
2746 l
= SYMTAB_LINETABLE (symtab
);
2750 /* Get the range for the function's PC values, or give up if we
2751 cannot, for some reason. */
2752 if (!find_pc_partial_function (func_addr
, NULL
, &func_start
, &func_end
))
2755 /* Linetable entries are ordered by PC values, see the commentary in
2756 symtab.h where `struct linetable' is defined. Thus, the first
2757 entry whose PC is in the range [FUNC_START..FUNC_END[ is the
2758 address we are looking for. */
2759 for (i
= 0; i
< l
->nitems
; i
++)
2761 struct linetable_entry
*item
= &(l
->item
[i
]);
2763 /* Don't use line numbers of zero, they mark special entries in
2764 the table. See the commentary on symtab.h before the
2765 definition of struct linetable. */
2766 if (item
->line
> 0 && func_start
<= item
->pc
&& item
->pc
< func_end
)
2773 /* Adjust SAL to the first instruction past the function prologue.
2774 If the PC was explicitly specified, the SAL is not changed.
2775 If the line number was explicitly specified, at most the SAL's PC
2776 is updated. If SAL is already past the prologue, then do nothing. */
2779 skip_prologue_sal (struct symtab_and_line
*sal
)
2782 struct symtab_and_line start_sal
;
2783 struct cleanup
*old_chain
;
2784 CORE_ADDR pc
, saved_pc
;
2785 struct obj_section
*section
;
2787 struct objfile
*objfile
;
2788 struct gdbarch
*gdbarch
;
2789 const struct block
*b
, *function_block
;
2790 int force_skip
, skip
;
2792 /* Do not change the SAL if PC was specified explicitly. */
2793 if (sal
->explicit_pc
)
2796 old_chain
= save_current_space_and_thread ();
2797 switch_to_program_space_and_thread (sal
->pspace
);
2799 sym
= find_pc_sect_function (sal
->pc
, sal
->section
);
2802 fixup_symbol_section (sym
, NULL
);
2804 pc
= BLOCK_START (SYMBOL_BLOCK_VALUE (sym
));
2805 section
= SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym
), sym
);
2806 name
= SYMBOL_LINKAGE_NAME (sym
);
2807 objfile
= SYMBOL_OBJFILE (sym
);
2811 struct bound_minimal_symbol msymbol
2812 = lookup_minimal_symbol_by_pc_section (sal
->pc
, sal
->section
);
2814 if (msymbol
.minsym
== NULL
)
2816 do_cleanups (old_chain
);
2820 objfile
= msymbol
.objfile
;
2821 pc
= BMSYMBOL_VALUE_ADDRESS (msymbol
);
2822 section
= MSYMBOL_OBJ_SECTION (objfile
, msymbol
.minsym
);
2823 name
= MSYMBOL_LINKAGE_NAME (msymbol
.minsym
);
2826 gdbarch
= get_objfile_arch (objfile
);
2828 /* Process the prologue in two passes. In the first pass try to skip the
2829 prologue (SKIP is true) and verify there is a real need for it (indicated
2830 by FORCE_SKIP). If no such reason was found run a second pass where the
2831 prologue is not skipped (SKIP is false). */
2836 /* Be conservative - allow direct PC (without skipping prologue) only if we
2837 have proven the CU (Compilation Unit) supports it. sal->SYMTAB does not
2838 have to be set by the caller so we use SYM instead. */
2839 if (sym
&& COMPUNIT_LOCATIONS_VALID (SYMTAB_COMPUNIT (SYMBOL_SYMTAB (sym
))))
2847 /* If the function is in an unmapped overlay, use its unmapped LMA address,
2848 so that gdbarch_skip_prologue has something unique to work on. */
2849 if (section_is_overlay (section
) && !section_is_mapped (section
))
2850 pc
= overlay_unmapped_address (pc
, section
);
2852 /* Skip "first line" of function (which is actually its prologue). */
2853 pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
2854 if (gdbarch_skip_entrypoint_p (gdbarch
))
2855 pc
= gdbarch_skip_entrypoint (gdbarch
, pc
);
2857 pc
= gdbarch_skip_prologue (gdbarch
, pc
);
2859 /* For overlays, map pc back into its mapped VMA range. */
2860 pc
= overlay_mapped_address (pc
, section
);
2862 /* Calculate line number. */
2863 start_sal
= find_pc_sect_line (pc
, section
, 0);
2865 /* Check if gdbarch_skip_prologue left us in mid-line, and the next
2866 line is still part of the same function. */
2867 if (skip
&& start_sal
.pc
!= pc
2868 && (sym
? (BLOCK_START (SYMBOL_BLOCK_VALUE (sym
)) <= start_sal
.end
2869 && start_sal
.end
< BLOCK_END (SYMBOL_BLOCK_VALUE (sym
)))
2870 : (lookup_minimal_symbol_by_pc_section (start_sal
.end
, section
).minsym
2871 == lookup_minimal_symbol_by_pc_section (pc
, section
).minsym
)))
2873 /* First pc of next line */
2875 /* Recalculate the line number (might not be N+1). */
2876 start_sal
= find_pc_sect_line (pc
, section
, 0);
2879 /* On targets with executable formats that don't have a concept of
2880 constructors (ELF with .init has, PE doesn't), gcc emits a call
2881 to `__main' in `main' between the prologue and before user
2883 if (gdbarch_skip_main_prologue_p (gdbarch
)
2884 && name
&& strcmp_iw (name
, "main") == 0)
2886 pc
= gdbarch_skip_main_prologue (gdbarch
, pc
);
2887 /* Recalculate the line number (might not be N+1). */
2888 start_sal
= find_pc_sect_line (pc
, section
, 0);
2892 while (!force_skip
&& skip
--);
2894 /* If we still don't have a valid source line, try to find the first
2895 PC in the lineinfo table that belongs to the same function. This
2896 happens with COFF debug info, which does not seem to have an
2897 entry in lineinfo table for the code after the prologue which has
2898 no direct relation to source. For example, this was found to be
2899 the case with the DJGPP target using "gcc -gcoff" when the
2900 compiler inserted code after the prologue to make sure the stack
2902 if (!force_skip
&& sym
&& start_sal
.symtab
== NULL
)
2904 pc
= skip_prologue_using_lineinfo (pc
, SYMBOL_SYMTAB (sym
));
2905 /* Recalculate the line number. */
2906 start_sal
= find_pc_sect_line (pc
, section
, 0);
2909 do_cleanups (old_chain
);
2911 /* If we're already past the prologue, leave SAL unchanged. Otherwise
2912 forward SAL to the end of the prologue. */
2917 sal
->section
= section
;
2919 /* Unless the explicit_line flag was set, update the SAL line
2920 and symtab to correspond to the modified PC location. */
2921 if (sal
->explicit_line
)
2924 sal
->symtab
= start_sal
.symtab
;
2925 sal
->line
= start_sal
.line
;
2926 sal
->end
= start_sal
.end
;
2928 /* Check if we are now inside an inlined function. If we can,
2929 use the call site of the function instead. */
2930 b
= block_for_pc_sect (sal
->pc
, sal
->section
);
2931 function_block
= NULL
;
2934 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
2936 else if (BLOCK_FUNCTION (b
) != NULL
)
2938 b
= BLOCK_SUPERBLOCK (b
);
2940 if (function_block
!= NULL
2941 && SYMBOL_LINE (BLOCK_FUNCTION (function_block
)) != 0)
2943 sal
->line
= SYMBOL_LINE (BLOCK_FUNCTION (function_block
));
2944 sal
->symtab
= SYMBOL_SYMTAB (BLOCK_FUNCTION (function_block
));
2948 /* Given PC at the function's start address, attempt to find the
2949 prologue end using SAL information. Return zero if the skip fails.
2951 A non-optimized prologue traditionally has one SAL for the function
2952 and a second for the function body. A single line function has
2953 them both pointing at the same line.
2955 An optimized prologue is similar but the prologue may contain
2956 instructions (SALs) from the instruction body. Need to skip those
2957 while not getting into the function body.
2959 The functions end point and an increasing SAL line are used as
2960 indicators of the prologue's endpoint.
2962 This code is based on the function refine_prologue_limit
2966 skip_prologue_using_sal (struct gdbarch
*gdbarch
, CORE_ADDR func_addr
)
2968 struct symtab_and_line prologue_sal
;
2971 const struct block
*bl
;
2973 /* Get an initial range for the function. */
2974 find_pc_partial_function (func_addr
, NULL
, &start_pc
, &end_pc
);
2975 start_pc
+= gdbarch_deprecated_function_start_offset (gdbarch
);
2977 prologue_sal
= find_pc_line (start_pc
, 0);
2978 if (prologue_sal
.line
!= 0)
2980 /* For languages other than assembly, treat two consecutive line
2981 entries at the same address as a zero-instruction prologue.
2982 The GNU assembler emits separate line notes for each instruction
2983 in a multi-instruction macro, but compilers generally will not
2985 if (prologue_sal
.symtab
->language
!= language_asm
)
2987 struct linetable
*linetable
= SYMTAB_LINETABLE (prologue_sal
.symtab
);
2990 /* Skip any earlier lines, and any end-of-sequence marker
2991 from a previous function. */
2992 while (linetable
->item
[idx
].pc
!= prologue_sal
.pc
2993 || linetable
->item
[idx
].line
== 0)
2996 if (idx
+1 < linetable
->nitems
2997 && linetable
->item
[idx
+1].line
!= 0
2998 && linetable
->item
[idx
+1].pc
== start_pc
)
3002 /* If there is only one sal that covers the entire function,
3003 then it is probably a single line function, like
3005 if (prologue_sal
.end
>= end_pc
)
3008 while (prologue_sal
.end
< end_pc
)
3010 struct symtab_and_line sal
;
3012 sal
= find_pc_line (prologue_sal
.end
, 0);
3015 /* Assume that a consecutive SAL for the same (or larger)
3016 line mark the prologue -> body transition. */
3017 if (sal
.line
>= prologue_sal
.line
)
3019 /* Likewise if we are in a different symtab altogether
3020 (e.g. within a file included via #include). */
3021 if (sal
.symtab
!= prologue_sal
.symtab
)
3024 /* The line number is smaller. Check that it's from the
3025 same function, not something inlined. If it's inlined,
3026 then there is no point comparing the line numbers. */
3027 bl
= block_for_pc (prologue_sal
.end
);
3030 if (block_inlined_p (bl
))
3032 if (BLOCK_FUNCTION (bl
))
3037 bl
= BLOCK_SUPERBLOCK (bl
);
3042 /* The case in which compiler's optimizer/scheduler has
3043 moved instructions into the prologue. We look ahead in
3044 the function looking for address ranges whose
3045 corresponding line number is less the first one that we
3046 found for the function. This is more conservative then
3047 refine_prologue_limit which scans a large number of SALs
3048 looking for any in the prologue. */
3053 if (prologue_sal
.end
< end_pc
)
3054 /* Return the end of this line, or zero if we could not find a
3056 return prologue_sal
.end
;
3058 /* Don't return END_PC, which is past the end of the function. */
3059 return prologue_sal
.pc
;
3062 /* If P is of the form "operator[ \t]+..." where `...' is
3063 some legitimate operator text, return a pointer to the
3064 beginning of the substring of the operator text.
3065 Otherwise, return "". */
3068 operator_chars (const char *p
, const char **end
)
3071 if (strncmp (p
, "operator", 8))
3075 /* Don't get faked out by `operator' being part of a longer
3077 if (isalpha (*p
) || *p
== '_' || *p
== '$' || *p
== '\0')
3080 /* Allow some whitespace between `operator' and the operator symbol. */
3081 while (*p
== ' ' || *p
== '\t')
3084 /* Recognize 'operator TYPENAME'. */
3086 if (isalpha (*p
) || *p
== '_' || *p
== '$')
3088 const char *q
= p
+ 1;
3090 while (isalnum (*q
) || *q
== '_' || *q
== '$')
3099 case '\\': /* regexp quoting */
3102 if (p
[2] == '=') /* 'operator\*=' */
3104 else /* 'operator\*' */
3108 else if (p
[1] == '[')
3111 error (_("mismatched quoting on brackets, "
3112 "try 'operator\\[\\]'"));
3113 else if (p
[2] == '\\' && p
[3] == ']')
3115 *end
= p
+ 4; /* 'operator\[\]' */
3119 error (_("nothing is allowed between '[' and ']'"));
3123 /* Gratuitous qoute: skip it and move on. */
3145 if (p
[0] == '-' && p
[1] == '>')
3147 /* Struct pointer member operator 'operator->'. */
3150 *end
= p
+ 3; /* 'operator->*' */
3153 else if (p
[2] == '\\')
3155 *end
= p
+ 4; /* Hopefully 'operator->\*' */
3160 *end
= p
+ 2; /* 'operator->' */
3164 if (p
[1] == '=' || p
[1] == p
[0])
3175 error (_("`operator ()' must be specified "
3176 "without whitespace in `()'"));
3181 error (_("`operator ?:' must be specified "
3182 "without whitespace in `?:'"));
3187 error (_("`operator []' must be specified "
3188 "without whitespace in `[]'"));
3192 error (_("`operator %s' not supported"), p
);
3201 /* Cache to watch for file names already seen by filename_seen. */
3203 struct filename_seen_cache
3205 /* Table of files seen so far. */
3207 /* Initial size of the table. It automagically grows from here. */
3208 #define INITIAL_FILENAME_SEEN_CACHE_SIZE 100
3211 /* filename_seen_cache constructor. */
3213 static struct filename_seen_cache
*
3214 create_filename_seen_cache (void)
3216 struct filename_seen_cache
*cache
;
3218 cache
= XNEW (struct filename_seen_cache
);
3219 cache
->tab
= htab_create_alloc (INITIAL_FILENAME_SEEN_CACHE_SIZE
,
3220 filename_hash
, filename_eq
,
3221 NULL
, xcalloc
, xfree
);
3226 /* Empty the cache, but do not delete it. */
3229 clear_filename_seen_cache (struct filename_seen_cache
*cache
)
3231 htab_empty (cache
->tab
);
3234 /* filename_seen_cache destructor.
3235 This takes a void * argument as it is generally used as a cleanup. */
3238 delete_filename_seen_cache (void *ptr
)
3240 struct filename_seen_cache
*cache
= ptr
;
3242 htab_delete (cache
->tab
);
3246 /* If FILE is not already in the table of files in CACHE, return zero;
3247 otherwise return non-zero. Optionally add FILE to the table if ADD
3250 NOTE: We don't manage space for FILE, we assume FILE lives as long
3251 as the caller needs. */
3254 filename_seen (struct filename_seen_cache
*cache
, const char *file
, int add
)
3258 /* Is FILE in tab? */
3259 slot
= htab_find_slot (cache
->tab
, file
, add
? INSERT
: NO_INSERT
);
3263 /* No; maybe add it to tab. */
3265 *slot
= (char *) file
;
3270 /* Data structure to maintain printing state for output_source_filename. */
3272 struct output_source_filename_data
3274 /* Cache of what we've seen so far. */
3275 struct filename_seen_cache
*filename_seen_cache
;
3277 /* Flag of whether we're printing the first one. */
3281 /* Slave routine for sources_info. Force line breaks at ,'s.
3282 NAME is the name to print.
3283 DATA contains the state for printing and watching for duplicates. */
3286 output_source_filename (const char *name
,
3287 struct output_source_filename_data
*data
)
3289 /* Since a single source file can result in several partial symbol
3290 tables, we need to avoid printing it more than once. Note: if
3291 some of the psymtabs are read in and some are not, it gets
3292 printed both under "Source files for which symbols have been
3293 read" and "Source files for which symbols will be read in on
3294 demand". I consider this a reasonable way to deal with the
3295 situation. I'm not sure whether this can also happen for
3296 symtabs; it doesn't hurt to check. */
3298 /* Was NAME already seen? */
3299 if (filename_seen (data
->filename_seen_cache
, name
, 1))
3301 /* Yes; don't print it again. */
3305 /* No; print it and reset *FIRST. */
3307 printf_filtered (", ");
3311 fputs_filtered (name
, gdb_stdout
);
3314 /* A callback for map_partial_symbol_filenames. */
3317 output_partial_symbol_filename (const char *filename
, const char *fullname
,
3320 output_source_filename (fullname
? fullname
: filename
, data
);
3324 sources_info (char *ignore
, int from_tty
)
3326 struct compunit_symtab
*cu
;
3328 struct objfile
*objfile
;
3329 struct output_source_filename_data data
;
3330 struct cleanup
*cleanups
;
3332 if (!have_full_symbols () && !have_partial_symbols ())
3334 error (_("No symbol table is loaded. Use the \"file\" command."));
3337 data
.filename_seen_cache
= create_filename_seen_cache ();
3338 cleanups
= make_cleanup (delete_filename_seen_cache
,
3339 data
.filename_seen_cache
);
3341 printf_filtered ("Source files for which symbols have been read in:\n\n");
3344 ALL_FILETABS (objfile
, cu
, s
)
3346 const char *fullname
= symtab_to_fullname (s
);
3348 output_source_filename (fullname
, &data
);
3350 printf_filtered ("\n\n");
3352 printf_filtered ("Source files for which symbols "
3353 "will be read in on demand:\n\n");
3355 clear_filename_seen_cache (data
.filename_seen_cache
);
3357 map_symbol_filenames (output_partial_symbol_filename
, &data
,
3358 1 /*need_fullname*/);
3359 printf_filtered ("\n");
3361 do_cleanups (cleanups
);
3364 /* Compare FILE against all the NFILES entries of FILES. If BASENAMES is
3365 non-zero compare only lbasename of FILES. */
3368 file_matches (const char *file
, const char *files
[], int nfiles
, int basenames
)
3372 if (file
!= NULL
&& nfiles
!= 0)
3374 for (i
= 0; i
< nfiles
; i
++)
3376 if (compare_filenames_for_search (file
, (basenames
3377 ? lbasename (files
[i
])
3382 else if (nfiles
== 0)
3387 /* Free any memory associated with a search. */
3390 free_search_symbols (struct symbol_search
*symbols
)
3392 struct symbol_search
*p
;
3393 struct symbol_search
*next
;
3395 for (p
= symbols
; p
!= NULL
; p
= next
)
3403 do_free_search_symbols_cleanup (void *symbolsp
)
3405 struct symbol_search
*symbols
= *(struct symbol_search
**) symbolsp
;
3407 free_search_symbols (symbols
);
3411 make_cleanup_free_search_symbols (struct symbol_search
**symbolsp
)
3413 return make_cleanup (do_free_search_symbols_cleanup
, symbolsp
);
3416 /* Helper function for sort_search_symbols_remove_dups and qsort. Can only
3417 sort symbols, not minimal symbols. */
3420 compare_search_syms (const void *sa
, const void *sb
)
3422 struct symbol_search
*sym_a
= *(struct symbol_search
**) sa
;
3423 struct symbol_search
*sym_b
= *(struct symbol_search
**) sb
;
3426 c
= FILENAME_CMP (sym_a
->symtab
->filename
, sym_b
->symtab
->filename
);
3430 if (sym_a
->block
!= sym_b
->block
)
3431 return sym_a
->block
- sym_b
->block
;
3433 return strcmp (SYMBOL_PRINT_NAME (sym_a
->symbol
),
3434 SYMBOL_PRINT_NAME (sym_b
->symbol
));
3437 /* Sort the NFOUND symbols in list FOUND and remove duplicates.
3438 The duplicates are freed, and the new list is returned in
3439 *NEW_HEAD, *NEW_TAIL. */
3442 sort_search_symbols_remove_dups (struct symbol_search
*found
, int nfound
,
3443 struct symbol_search
**new_head
,
3444 struct symbol_search
**new_tail
)
3446 struct symbol_search
**symbols
, *symp
, *old_next
;
3449 gdb_assert (found
!= NULL
&& nfound
> 0);
3451 /* Build an array out of the list so we can easily sort them. */
3452 symbols
= (struct symbol_search
**) xmalloc (sizeof (struct symbol_search
*)
3455 for (i
= 0; i
< nfound
; i
++)
3457 gdb_assert (symp
!= NULL
);
3458 gdb_assert (symp
->block
>= 0 && symp
->block
<= 1);
3462 gdb_assert (symp
== NULL
);
3464 qsort (symbols
, nfound
, sizeof (struct symbol_search
*),
3465 compare_search_syms
);
3467 /* Collapse out the dups. */
3468 for (i
= 1, j
= 1; i
< nfound
; ++i
)
3470 if (compare_search_syms (&symbols
[j
- 1], &symbols
[i
]) != 0)
3471 symbols
[j
++] = symbols
[i
];
3476 symbols
[j
- 1]->next
= NULL
;
3478 /* Rebuild the linked list. */
3479 for (i
= 0; i
< nunique
- 1; i
++)
3480 symbols
[i
]->next
= symbols
[i
+ 1];
3481 symbols
[nunique
- 1]->next
= NULL
;
3483 *new_head
= symbols
[0];
3484 *new_tail
= symbols
[nunique
- 1];
3488 /* An object of this type is passed as the user_data to the
3489 expand_symtabs_matching method. */
3490 struct search_symbols_data
3495 /* It is true if PREG contains valid data, false otherwise. */
3496 unsigned preg_p
: 1;
3500 /* A callback for expand_symtabs_matching. */
3503 search_symbols_file_matches (const char *filename
, void *user_data
,
3506 struct search_symbols_data
*data
= user_data
;
3508 return file_matches (filename
, data
->files
, data
->nfiles
, basenames
);
3511 /* A callback for expand_symtabs_matching. */
3514 search_symbols_name_matches (const char *symname
, void *user_data
)
3516 struct search_symbols_data
*data
= user_data
;
3518 return !data
->preg_p
|| regexec (&data
->preg
, symname
, 0, NULL
, 0) == 0;
3521 /* Search the symbol table for matches to the regular expression REGEXP,
3522 returning the results in *MATCHES.
3524 Only symbols of KIND are searched:
3525 VARIABLES_DOMAIN - search all symbols, excluding functions, type names,
3526 and constants (enums)
3527 FUNCTIONS_DOMAIN - search all functions
3528 TYPES_DOMAIN - search all type names
3529 ALL_DOMAIN - an internal error for this function
3531 free_search_symbols should be called when *MATCHES is no longer needed.
3533 Within each file the results are sorted locally; each symtab's global and
3534 static blocks are separately alphabetized.
3535 Duplicate entries are removed. */
3538 search_symbols (const char *regexp
, enum search_domain kind
,
3539 int nfiles
, const char *files
[],
3540 struct symbol_search
**matches
)
3542 struct compunit_symtab
*cust
;
3543 const struct blockvector
*bv
;
3546 struct block_iterator iter
;
3548 struct objfile
*objfile
;
3549 struct minimal_symbol
*msymbol
;
3551 static const enum minimal_symbol_type types
[]
3552 = {mst_data
, mst_text
, mst_abs
};
3553 static const enum minimal_symbol_type types2
[]
3554 = {mst_bss
, mst_file_text
, mst_abs
};
3555 static const enum minimal_symbol_type types3
[]
3556 = {mst_file_data
, mst_solib_trampoline
, mst_abs
};
3557 static const enum minimal_symbol_type types4
[]
3558 = {mst_file_bss
, mst_text_gnu_ifunc
, mst_abs
};
3559 enum minimal_symbol_type ourtype
;
3560 enum minimal_symbol_type ourtype2
;
3561 enum minimal_symbol_type ourtype3
;
3562 enum minimal_symbol_type ourtype4
;
3563 struct symbol_search
*found
;
3564 struct symbol_search
*tail
;
3565 struct search_symbols_data datum
;
3568 /* OLD_CHAIN .. RETVAL_CHAIN is always freed, RETVAL_CHAIN .. current
3569 CLEANUP_CHAIN is freed only in the case of an error. */
3570 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
3571 struct cleanup
*retval_chain
;
3573 gdb_assert (kind
<= TYPES_DOMAIN
);
3575 ourtype
= types
[kind
];
3576 ourtype2
= types2
[kind
];
3577 ourtype3
= types3
[kind
];
3578 ourtype4
= types4
[kind
];
3585 /* Make sure spacing is right for C++ operators.
3586 This is just a courtesy to make the matching less sensitive
3587 to how many spaces the user leaves between 'operator'
3588 and <TYPENAME> or <OPERATOR>. */
3590 const char *opname
= operator_chars (regexp
, &opend
);
3595 int fix
= -1; /* -1 means ok; otherwise number of
3598 if (isalpha (*opname
) || *opname
== '_' || *opname
== '$')
3600 /* There should 1 space between 'operator' and 'TYPENAME'. */
3601 if (opname
[-1] != ' ' || opname
[-2] == ' ')
3606 /* There should 0 spaces between 'operator' and 'OPERATOR'. */
3607 if (opname
[-1] == ' ')
3610 /* If wrong number of spaces, fix it. */
3613 char *tmp
= (char *) alloca (8 + fix
+ strlen (opname
) + 1);
3615 sprintf (tmp
, "operator%.*s%s", fix
, " ", opname
);
3620 errcode
= regcomp (&datum
.preg
, regexp
,
3621 REG_NOSUB
| (case_sensitivity
== case_sensitive_off
3625 char *err
= get_regcomp_error (errcode
, &datum
.preg
);
3627 make_cleanup (xfree
, err
);
3628 error (_("Invalid regexp (%s): %s"), err
, regexp
);
3631 make_regfree_cleanup (&datum
.preg
);
3634 /* Search through the partial symtabs *first* for all symbols
3635 matching the regexp. That way we don't have to reproduce all of
3636 the machinery below. */
3638 datum
.nfiles
= nfiles
;
3639 datum
.files
= files
;
3640 expand_symtabs_matching ((nfiles
== 0
3642 : search_symbols_file_matches
),
3643 search_symbols_name_matches
,
3646 /* Here, we search through the minimal symbol tables for functions
3647 and variables that match, and force their symbols to be read.
3648 This is in particular necessary for demangled variable names,
3649 which are no longer put into the partial symbol tables.
3650 The symbol will then be found during the scan of symtabs below.
3652 For functions, find_pc_symtab should succeed if we have debug info
3653 for the function, for variables we have to call
3654 lookup_symbol_in_objfile_from_linkage_name to determine if the variable
3656 If the lookup fails, set found_misc so that we will rescan to print
3657 any matching symbols without debug info.
3658 We only search the objfile the msymbol came from, we no longer search
3659 all objfiles. In large programs (1000s of shared libs) searching all
3660 objfiles is not worth the pain. */
3662 if (nfiles
== 0 && (kind
== VARIABLES_DOMAIN
|| kind
== FUNCTIONS_DOMAIN
))
3664 ALL_MSYMBOLS (objfile
, msymbol
)
3668 if (msymbol
->created_by_gdb
)
3671 if (MSYMBOL_TYPE (msymbol
) == ourtype
3672 || MSYMBOL_TYPE (msymbol
) == ourtype2
3673 || MSYMBOL_TYPE (msymbol
) == ourtype3
3674 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3677 || regexec (&datum
.preg
, MSYMBOL_NATURAL_NAME (msymbol
), 0,
3680 /* Note: An important side-effect of these lookup functions
3681 is to expand the symbol table if msymbol is found, for the
3682 benefit of the next loop on ALL_COMPUNITS. */
3683 if (kind
== FUNCTIONS_DOMAIN
3684 ? (find_pc_compunit_symtab
3685 (MSYMBOL_VALUE_ADDRESS (objfile
, msymbol
)) == NULL
)
3686 : (lookup_symbol_in_objfile_from_linkage_name
3687 (objfile
, MSYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3698 retval_chain
= make_cleanup_free_search_symbols (&found
);
3700 ALL_COMPUNITS (objfile
, cust
)
3702 bv
= COMPUNIT_BLOCKVECTOR (cust
);
3703 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
3705 b
= BLOCKVECTOR_BLOCK (bv
, i
);
3706 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
3708 struct symtab
*real_symtab
= SYMBOL_SYMTAB (sym
);
3712 /* Check first sole REAL_SYMTAB->FILENAME. It does not need to be
3713 a substring of symtab_to_fullname as it may contain "./" etc. */
3714 if ((file_matches (real_symtab
->filename
, files
, nfiles
, 0)
3715 || ((basenames_may_differ
3716 || file_matches (lbasename (real_symtab
->filename
),
3718 && file_matches (symtab_to_fullname (real_symtab
),
3721 || regexec (&datum
.preg
, SYMBOL_NATURAL_NAME (sym
), 0,
3723 && ((kind
== VARIABLES_DOMAIN
3724 && SYMBOL_CLASS (sym
) != LOC_TYPEDEF
3725 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
3726 && SYMBOL_CLASS (sym
) != LOC_BLOCK
3727 /* LOC_CONST can be used for more than just enums,
3728 e.g., c++ static const members.
3729 We only want to skip enums here. */
3730 && !(SYMBOL_CLASS (sym
) == LOC_CONST
3731 && (TYPE_CODE (SYMBOL_TYPE (sym
))
3732 == TYPE_CODE_ENUM
)))
3733 || (kind
== FUNCTIONS_DOMAIN
3734 && SYMBOL_CLASS (sym
) == LOC_BLOCK
)
3735 || (kind
== TYPES_DOMAIN
3736 && SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))))
3739 struct symbol_search
*psr
= (struct symbol_search
*)
3740 xmalloc (sizeof (struct symbol_search
));
3742 psr
->symtab
= real_symtab
;
3744 memset (&psr
->msymbol
, 0, sizeof (psr
->msymbol
));
3759 sort_search_symbols_remove_dups (found
, nfound
, &found
, &tail
);
3760 /* Note: nfound is no longer useful beyond this point. */
3763 /* If there are no eyes, avoid all contact. I mean, if there are
3764 no debug symbols, then add matching minsyms. */
3766 if (found_misc
|| (nfiles
== 0 && kind
!= FUNCTIONS_DOMAIN
))
3768 ALL_MSYMBOLS (objfile
, msymbol
)
3772 if (msymbol
->created_by_gdb
)
3775 if (MSYMBOL_TYPE (msymbol
) == ourtype
3776 || MSYMBOL_TYPE (msymbol
) == ourtype2
3777 || MSYMBOL_TYPE (msymbol
) == ourtype3
3778 || MSYMBOL_TYPE (msymbol
) == ourtype4
)
3781 || regexec (&datum
.preg
, MSYMBOL_NATURAL_NAME (msymbol
), 0,
3784 /* For functions we can do a quick check of whether the
3785 symbol might be found via find_pc_symtab. */
3786 if (kind
!= FUNCTIONS_DOMAIN
3787 || (find_pc_compunit_symtab
3788 (MSYMBOL_VALUE_ADDRESS (objfile
, msymbol
)) == NULL
))
3790 if (lookup_symbol_in_objfile_from_linkage_name
3791 (objfile
, MSYMBOL_LINKAGE_NAME (msymbol
), VAR_DOMAIN
)
3795 struct symbol_search
*psr
= (struct symbol_search
*)
3796 xmalloc (sizeof (struct symbol_search
));
3798 psr
->msymbol
.minsym
= msymbol
;
3799 psr
->msymbol
.objfile
= objfile
;
3815 discard_cleanups (retval_chain
);
3816 do_cleanups (old_chain
);
3820 /* Helper function for symtab_symbol_info, this function uses
3821 the data returned from search_symbols() to print information
3822 regarding the match to gdb_stdout. */
3825 print_symbol_info (enum search_domain kind
,
3826 struct symtab
*s
, struct symbol
*sym
,
3827 int block
, const char *last
)
3829 const char *s_filename
= symtab_to_filename_for_display (s
);
3831 if (last
== NULL
|| filename_cmp (last
, s_filename
) != 0)
3833 fputs_filtered ("\nFile ", gdb_stdout
);
3834 fputs_filtered (s_filename
, gdb_stdout
);
3835 fputs_filtered (":\n", gdb_stdout
);
3838 if (kind
!= TYPES_DOMAIN
&& block
== STATIC_BLOCK
)
3839 printf_filtered ("static ");
3841 /* Typedef that is not a C++ class. */
3842 if (kind
== TYPES_DOMAIN
3843 && SYMBOL_DOMAIN (sym
) != STRUCT_DOMAIN
)
3844 typedef_print (SYMBOL_TYPE (sym
), sym
, gdb_stdout
);
3845 /* variable, func, or typedef-that-is-c++-class. */
3846 else if (kind
< TYPES_DOMAIN
3847 || (kind
== TYPES_DOMAIN
3848 && SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
))
3850 type_print (SYMBOL_TYPE (sym
),
3851 (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
3852 ? "" : SYMBOL_PRINT_NAME (sym
)),
3855 printf_filtered (";\n");
3859 /* This help function for symtab_symbol_info() prints information
3860 for non-debugging symbols to gdb_stdout. */
3863 print_msymbol_info (struct bound_minimal_symbol msymbol
)
3865 struct gdbarch
*gdbarch
= get_objfile_arch (msymbol
.objfile
);
3868 if (gdbarch_addr_bit (gdbarch
) <= 32)
3869 tmp
= hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol
)
3870 & (CORE_ADDR
) 0xffffffff,
3873 tmp
= hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol
),
3875 printf_filtered ("%s %s\n",
3876 tmp
, MSYMBOL_PRINT_NAME (msymbol
.minsym
));
3879 /* This is the guts of the commands "info functions", "info types", and
3880 "info variables". It calls search_symbols to find all matches and then
3881 print_[m]symbol_info to print out some useful information about the
3885 symtab_symbol_info (char *regexp
, enum search_domain kind
, int from_tty
)
3887 static const char * const classnames
[] =
3888 {"variable", "function", "type"};
3889 struct symbol_search
*symbols
;
3890 struct symbol_search
*p
;
3891 struct cleanup
*old_chain
;
3892 const char *last_filename
= NULL
;
3895 gdb_assert (kind
<= TYPES_DOMAIN
);
3897 /* Must make sure that if we're interrupted, symbols gets freed. */
3898 search_symbols (regexp
, kind
, 0, NULL
, &symbols
);
3899 old_chain
= make_cleanup_free_search_symbols (&symbols
);
3902 printf_filtered (_("All %ss matching regular expression \"%s\":\n"),
3903 classnames
[kind
], regexp
);
3905 printf_filtered (_("All defined %ss:\n"), classnames
[kind
]);
3907 for (p
= symbols
; p
!= NULL
; p
= p
->next
)
3911 if (p
->msymbol
.minsym
!= NULL
)
3915 printf_filtered (_("\nNon-debugging symbols:\n"));
3918 print_msymbol_info (p
->msymbol
);
3922 print_symbol_info (kind
,
3927 last_filename
= symtab_to_filename_for_display (p
->symtab
);
3931 do_cleanups (old_chain
);
3935 variables_info (char *regexp
, int from_tty
)
3937 symtab_symbol_info (regexp
, VARIABLES_DOMAIN
, from_tty
);
3941 functions_info (char *regexp
, int from_tty
)
3943 symtab_symbol_info (regexp
, FUNCTIONS_DOMAIN
, from_tty
);
3948 types_info (char *regexp
, int from_tty
)
3950 symtab_symbol_info (regexp
, TYPES_DOMAIN
, from_tty
);
3953 /* Breakpoint all functions matching regular expression. */
3956 rbreak_command_wrapper (char *regexp
, int from_tty
)
3958 rbreak_command (regexp
, from_tty
);
3961 /* A cleanup function that calls end_rbreak_breakpoints. */
3964 do_end_rbreak_breakpoints (void *ignore
)
3966 end_rbreak_breakpoints ();
3970 rbreak_command (char *regexp
, int from_tty
)
3972 struct symbol_search
*ss
;
3973 struct symbol_search
*p
;
3974 struct cleanup
*old_chain
;
3975 char *string
= NULL
;
3977 const char **files
= NULL
;
3978 const char *file_name
;
3983 char *colon
= strchr (regexp
, ':');
3985 if (colon
&& *(colon
+ 1) != ':')
3990 colon_index
= colon
- regexp
;
3991 local_name
= alloca (colon_index
+ 1);
3992 memcpy (local_name
, regexp
, colon_index
);
3993 local_name
[colon_index
--] = 0;
3994 while (isspace (local_name
[colon_index
]))
3995 local_name
[colon_index
--] = 0;
3996 file_name
= local_name
;
3999 regexp
= skip_spaces (colon
+ 1);
4003 search_symbols (regexp
, FUNCTIONS_DOMAIN
, nfiles
, files
, &ss
);
4004 old_chain
= make_cleanup_free_search_symbols (&ss
);
4005 make_cleanup (free_current_contents
, &string
);
4007 start_rbreak_breakpoints ();
4008 make_cleanup (do_end_rbreak_breakpoints
, NULL
);
4009 for (p
= ss
; p
!= NULL
; p
= p
->next
)
4011 if (p
->msymbol
.minsym
== NULL
)
4013 const char *fullname
= symtab_to_fullname (p
->symtab
);
4015 int newlen
= (strlen (fullname
)
4016 + strlen (SYMBOL_LINKAGE_NAME (p
->symbol
))
4021 string
= xrealloc (string
, newlen
);
4024 strcpy (string
, fullname
);
4025 strcat (string
, ":'");
4026 strcat (string
, SYMBOL_LINKAGE_NAME (p
->symbol
));
4027 strcat (string
, "'");
4028 break_command (string
, from_tty
);
4029 print_symbol_info (FUNCTIONS_DOMAIN
,
4033 symtab_to_filename_for_display (p
->symtab
));
4037 int newlen
= (strlen (MSYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
)) + 3);
4041 string
= xrealloc (string
, newlen
);
4044 strcpy (string
, "'");
4045 strcat (string
, MSYMBOL_LINKAGE_NAME (p
->msymbol
.minsym
));
4046 strcat (string
, "'");
4048 break_command (string
, from_tty
);
4049 printf_filtered ("<function, no debug info> %s;\n",
4050 MSYMBOL_PRINT_NAME (p
->msymbol
.minsym
));
4054 do_cleanups (old_chain
);
4058 /* Evaluate if NAME matches SYM_TEXT and SYM_TEXT_LEN.
4060 Either sym_text[sym_text_len] != '(' and then we search for any
4061 symbol starting with SYM_TEXT text.
4063 Otherwise sym_text[sym_text_len] == '(' and then we require symbol name to
4064 be terminated at that point. Partial symbol tables do not have parameters
4068 compare_symbol_name (const char *name
, const char *sym_text
, int sym_text_len
)
4070 int (*ncmp
) (const char *, const char *, size_t);
4072 ncmp
= (case_sensitivity
== case_sensitive_on
? strncmp
: strncasecmp
);
4074 if (ncmp (name
, sym_text
, sym_text_len
) != 0)
4077 if (sym_text
[sym_text_len
] == '(')
4079 /* User searches for `name(someth...'. Require NAME to be terminated.
4080 Normally psymtabs and gdbindex have no parameter types so '\0' will be
4081 present but accept even parameters presence. In this case this
4082 function is in fact strcmp_iw but whitespace skipping is not supported
4083 for tab completion. */
4085 if (name
[sym_text_len
] != '\0' && name
[sym_text_len
] != '(')
4092 /* Free any memory associated with a completion list. */
4095 free_completion_list (VEC (char_ptr
) **list_ptr
)
4100 for (i
= 0; VEC_iterate (char_ptr
, *list_ptr
, i
, p
); ++i
)
4102 VEC_free (char_ptr
, *list_ptr
);
4105 /* Callback for make_cleanup. */
4108 do_free_completion_list (void *list
)
4110 free_completion_list (list
);
4113 /* Helper routine for make_symbol_completion_list. */
4115 static VEC (char_ptr
) *return_val
;
4117 #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \
4118 completion_list_add_name \
4119 (SYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word))
4121 #define MCOMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \
4122 completion_list_add_name \
4123 (MSYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word))
4125 /* Test to see if the symbol specified by SYMNAME (which is already
4126 demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN
4127 characters. If so, add it to the current completion list. */
4130 completion_list_add_name (const char *symname
,
4131 const char *sym_text
, int sym_text_len
,
4132 const char *text
, const char *word
)
4134 /* Clip symbols that cannot match. */
4135 if (!compare_symbol_name (symname
, sym_text
, sym_text_len
))
4138 /* We have a match for a completion, so add SYMNAME to the current list
4139 of matches. Note that the name is moved to freshly malloc'd space. */
4144 if (word
== sym_text
)
4146 new = xmalloc (strlen (symname
) + 5);
4147 strcpy (new, symname
);
4149 else if (word
> sym_text
)
4151 /* Return some portion of symname. */
4152 new = xmalloc (strlen (symname
) + 5);
4153 strcpy (new, symname
+ (word
- sym_text
));
4157 /* Return some of SYM_TEXT plus symname. */
4158 new = xmalloc (strlen (symname
) + (sym_text
- word
) + 5);
4159 strncpy (new, word
, sym_text
- word
);
4160 new[sym_text
- word
] = '\0';
4161 strcat (new, symname
);
4164 VEC_safe_push (char_ptr
, return_val
, new);
4168 /* ObjC: In case we are completing on a selector, look as the msymbol
4169 again and feed all the selectors into the mill. */
4172 completion_list_objc_symbol (struct minimal_symbol
*msymbol
,
4173 const char *sym_text
, int sym_text_len
,
4174 const char *text
, const char *word
)
4176 static char *tmp
= NULL
;
4177 static unsigned int tmplen
= 0;
4179 const char *method
, *category
, *selector
;
4182 method
= MSYMBOL_NATURAL_NAME (msymbol
);
4184 /* Is it a method? */
4185 if ((method
[0] != '-') && (method
[0] != '+'))
4188 if (sym_text
[0] == '[')
4189 /* Complete on shortened method method. */
4190 completion_list_add_name (method
+ 1, sym_text
, sym_text_len
, text
, word
);
4192 while ((strlen (method
) + 1) >= tmplen
)
4198 tmp
= xrealloc (tmp
, tmplen
);
4200 selector
= strchr (method
, ' ');
4201 if (selector
!= NULL
)
4204 category
= strchr (method
, '(');
4206 if ((category
!= NULL
) && (selector
!= NULL
))
4208 memcpy (tmp
, method
, (category
- method
));
4209 tmp
[category
- method
] = ' ';
4210 memcpy (tmp
+ (category
- method
) + 1, selector
, strlen (selector
) + 1);
4211 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4212 if (sym_text
[0] == '[')
4213 completion_list_add_name (tmp
+ 1, sym_text
, sym_text_len
, text
, word
);
4216 if (selector
!= NULL
)
4218 /* Complete on selector only. */
4219 strcpy (tmp
, selector
);
4220 tmp2
= strchr (tmp
, ']');
4224 completion_list_add_name (tmp
, sym_text
, sym_text_len
, text
, word
);
4228 /* Break the non-quoted text based on the characters which are in
4229 symbols. FIXME: This should probably be language-specific. */
4232 language_search_unquoted_string (const char *text
, const char *p
)
4234 for (; p
> text
; --p
)
4236 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0')
4240 if ((current_language
->la_language
== language_objc
))
4242 if (p
[-1] == ':') /* Might be part of a method name. */
4244 else if (p
[-1] == '[' && (p
[-2] == '-' || p
[-2] == '+'))
4245 p
-= 2; /* Beginning of a method name. */
4246 else if (p
[-1] == ' ' || p
[-1] == '(' || p
[-1] == ')')
4247 { /* Might be part of a method name. */
4250 /* Seeing a ' ' or a '(' is not conclusive evidence
4251 that we are in the middle of a method name. However,
4252 finding "-[" or "+[" should be pretty un-ambiguous.
4253 Unfortunately we have to find it now to decide. */
4256 if (isalnum (t
[-1]) || t
[-1] == '_' ||
4257 t
[-1] == ' ' || t
[-1] == ':' ||
4258 t
[-1] == '(' || t
[-1] == ')')
4263 if (t
[-1] == '[' && (t
[-2] == '-' || t
[-2] == '+'))
4264 p
= t
- 2; /* Method name detected. */
4265 /* Else we leave with p unchanged. */
4275 completion_list_add_fields (struct symbol
*sym
, const char *sym_text
,
4276 int sym_text_len
, const char *text
,
4279 if (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4281 struct type
*t
= SYMBOL_TYPE (sym
);
4282 enum type_code c
= TYPE_CODE (t
);
4285 if (c
== TYPE_CODE_UNION
|| c
== TYPE_CODE_STRUCT
)
4286 for (j
= TYPE_N_BASECLASSES (t
); j
< TYPE_NFIELDS (t
); j
++)
4287 if (TYPE_FIELD_NAME (t
, j
))
4288 completion_list_add_name (TYPE_FIELD_NAME (t
, j
),
4289 sym_text
, sym_text_len
, text
, word
);
4293 /* Type of the user_data argument passed to add_macro_name or
4294 symbol_completion_matcher. The contents are simply whatever is
4295 needed by completion_list_add_name. */
4296 struct add_name_data
4298 const char *sym_text
;
4304 /* A callback used with macro_for_each and macro_for_each_in_scope.
4305 This adds a macro's name to the current completion list. */
4308 add_macro_name (const char *name
, const struct macro_definition
*ignore
,
4309 struct macro_source_file
*ignore2
, int ignore3
,
4312 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4314 completion_list_add_name (name
,
4315 datum
->sym_text
, datum
->sym_text_len
,
4316 datum
->text
, datum
->word
);
4319 /* A callback for expand_symtabs_matching. */
4322 symbol_completion_matcher (const char *name
, void *user_data
)
4324 struct add_name_data
*datum
= (struct add_name_data
*) user_data
;
4326 return compare_symbol_name (name
, datum
->sym_text
, datum
->sym_text_len
);
4330 default_make_symbol_completion_list_break_on (const char *text
,
4332 const char *break_on
,
4333 enum type_code code
)
4335 /* Problem: All of the symbols have to be copied because readline
4336 frees them. I'm not going to worry about this; hopefully there
4337 won't be that many. */
4340 struct compunit_symtab
*cust
;
4341 struct minimal_symbol
*msymbol
;
4342 struct objfile
*objfile
;
4343 const struct block
*b
;
4344 const struct block
*surrounding_static_block
, *surrounding_global_block
;
4345 struct block_iterator iter
;
4346 /* The symbol we are completing on. Points in same buffer as text. */
4347 const char *sym_text
;
4348 /* Length of sym_text. */
4350 struct add_name_data datum
;
4351 struct cleanup
*back_to
;
4353 /* Now look for the symbol we are supposed to complete on. */
4357 const char *quote_pos
= NULL
;
4359 /* First see if this is a quoted string. */
4361 for (p
= text
; *p
!= '\0'; ++p
)
4363 if (quote_found
!= '\0')
4365 if (*p
== quote_found
)
4366 /* Found close quote. */
4368 else if (*p
== '\\' && p
[1] == quote_found
)
4369 /* A backslash followed by the quote character
4370 doesn't end the string. */
4373 else if (*p
== '\'' || *p
== '"')
4379 if (quote_found
== '\'')
4380 /* A string within single quotes can be a symbol, so complete on it. */
4381 sym_text
= quote_pos
+ 1;
4382 else if (quote_found
== '"')
4383 /* A double-quoted string is never a symbol, nor does it make sense
4384 to complete it any other way. */
4390 /* It is not a quoted string. Break it based on the characters
4391 which are in symbols. */
4394 if (isalnum (p
[-1]) || p
[-1] == '_' || p
[-1] == '\0'
4395 || p
[-1] == ':' || strchr (break_on
, p
[-1]) != NULL
)
4404 sym_text_len
= strlen (sym_text
);
4406 /* Prepare SYM_TEXT_LEN for compare_symbol_name. */
4408 if (current_language
->la_language
== language_cplus
4409 || current_language
->la_language
== language_java
4410 || current_language
->la_language
== language_fortran
)
4412 /* These languages may have parameters entered by user but they are never
4413 present in the partial symbol tables. */
4415 const char *cs
= memchr (sym_text
, '(', sym_text_len
);
4418 sym_text_len
= cs
- sym_text
;
4420 gdb_assert (sym_text
[sym_text_len
] == '\0' || sym_text
[sym_text_len
] == '(');
4423 back_to
= make_cleanup (do_free_completion_list
, &return_val
);
4425 datum
.sym_text
= sym_text
;
4426 datum
.sym_text_len
= sym_text_len
;
4430 /* Look through the partial symtabs for all symbols which begin
4431 by matching SYM_TEXT. Expand all CUs that you find to the list.
4432 The real names will get added by COMPLETION_LIST_ADD_SYMBOL below. */
4433 expand_symtabs_matching (NULL
, symbol_completion_matcher
, ALL_DOMAIN
,
4436 /* At this point scan through the misc symbol vectors and add each
4437 symbol you find to the list. Eventually we want to ignore
4438 anything that isn't a text symbol (everything else will be
4439 handled by the psymtab code above). */
4441 if (code
== TYPE_CODE_UNDEF
)
4443 ALL_MSYMBOLS (objfile
, msymbol
)
4446 MCOMPLETION_LIST_ADD_SYMBOL (msymbol
, sym_text
, sym_text_len
, text
,
4449 completion_list_objc_symbol (msymbol
, sym_text
, sym_text_len
, text
,
4454 /* Search upwards from currently selected frame (so that we can
4455 complete on local vars). Also catch fields of types defined in
4456 this places which match our text string. Only complete on types
4457 visible from current context. */
4459 b
= get_selected_block (0);
4460 surrounding_static_block
= block_static_block (b
);
4461 surrounding_global_block
= block_global_block (b
);
4462 if (surrounding_static_block
!= NULL
)
4463 while (b
!= surrounding_static_block
)
4467 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4469 if (code
== TYPE_CODE_UNDEF
)
4471 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4473 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
,
4476 else if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4477 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
)
4478 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
,
4482 /* Stop when we encounter an enclosing function. Do not stop for
4483 non-inlined functions - the locals of the enclosing function
4484 are in scope for a nested function. */
4485 if (BLOCK_FUNCTION (b
) != NULL
&& block_inlined_p (b
))
4487 b
= BLOCK_SUPERBLOCK (b
);
4490 /* Add fields from the file's types; symbols will be added below. */
4492 if (code
== TYPE_CODE_UNDEF
)
4494 if (surrounding_static_block
!= NULL
)
4495 ALL_BLOCK_SYMBOLS (surrounding_static_block
, iter
, sym
)
4496 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4498 if (surrounding_global_block
!= NULL
)
4499 ALL_BLOCK_SYMBOLS (surrounding_global_block
, iter
, sym
)
4500 completion_list_add_fields (sym
, sym_text
, sym_text_len
, text
, word
);
4503 /* Go through the symtabs and check the externs and statics for
4504 symbols which match. */
4506 ALL_COMPUNITS (objfile
, cust
)
4509 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cust
), GLOBAL_BLOCK
);
4510 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4512 if (code
== TYPE_CODE_UNDEF
4513 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4514 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4515 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4519 ALL_COMPUNITS (objfile
, cust
)
4522 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cust
), STATIC_BLOCK
);
4523 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4525 if (code
== TYPE_CODE_UNDEF
4526 || (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
4527 && TYPE_CODE (SYMBOL_TYPE (sym
)) == code
))
4528 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4532 /* Skip macros if we are completing a struct tag -- arguable but
4533 usually what is expected. */
4534 if (current_language
->la_macro_expansion
== macro_expansion_c
4535 && code
== TYPE_CODE_UNDEF
)
4537 struct macro_scope
*scope
;
4539 /* Add any macros visible in the default scope. Note that this
4540 may yield the occasional wrong result, because an expression
4541 might be evaluated in a scope other than the default. For
4542 example, if the user types "break file:line if <TAB>", the
4543 resulting expression will be evaluated at "file:line" -- but
4544 at there does not seem to be a way to detect this at
4546 scope
= default_macro_scope ();
4549 macro_for_each_in_scope (scope
->file
, scope
->line
,
4550 add_macro_name
, &datum
);
4554 /* User-defined macros are always visible. */
4555 macro_for_each (macro_user_macros
, add_macro_name
, &datum
);
4558 discard_cleanups (back_to
);
4559 return (return_val
);
4563 default_make_symbol_completion_list (const char *text
, const char *word
,
4564 enum type_code code
)
4566 return default_make_symbol_completion_list_break_on (text
, word
, "", code
);
4569 /* Return a vector of all symbols (regardless of class) which begin by
4570 matching TEXT. If the answer is no symbols, then the return value
4574 make_symbol_completion_list (const char *text
, const char *word
)
4576 return current_language
->la_make_symbol_completion_list (text
, word
,
4580 /* Like make_symbol_completion_list, but only return STRUCT_DOMAIN
4581 symbols whose type code is CODE. */
4584 make_symbol_completion_type (const char *text
, const char *word
,
4585 enum type_code code
)
4587 gdb_assert (code
== TYPE_CODE_UNION
4588 || code
== TYPE_CODE_STRUCT
4589 || code
== TYPE_CODE_ENUM
);
4590 return current_language
->la_make_symbol_completion_list (text
, word
, code
);
4593 /* Like make_symbol_completion_list, but suitable for use as a
4594 completion function. */
4597 make_symbol_completion_list_fn (struct cmd_list_element
*ignore
,
4598 const char *text
, const char *word
)
4600 return make_symbol_completion_list (text
, word
);
4603 /* Like make_symbol_completion_list, but returns a list of symbols
4604 defined in a source file FILE. */
4607 make_file_symbol_completion_list (const char *text
, const char *word
,
4608 const char *srcfile
)
4613 struct block_iterator iter
;
4614 /* The symbol we are completing on. Points in same buffer as text. */
4615 const char *sym_text
;
4616 /* Length of sym_text. */
4619 /* Now look for the symbol we are supposed to complete on.
4620 FIXME: This should be language-specific. */
4624 const char *quote_pos
= NULL
;
4626 /* First see if this is a quoted string. */
4628 for (p
= text
; *p
!= '\0'; ++p
)
4630 if (quote_found
!= '\0')
4632 if (*p
== quote_found
)
4633 /* Found close quote. */
4635 else if (*p
== '\\' && p
[1] == quote_found
)
4636 /* A backslash followed by the quote character
4637 doesn't end the string. */
4640 else if (*p
== '\'' || *p
== '"')
4646 if (quote_found
== '\'')
4647 /* A string within single quotes can be a symbol, so complete on it. */
4648 sym_text
= quote_pos
+ 1;
4649 else if (quote_found
== '"')
4650 /* A double-quoted string is never a symbol, nor does it make sense
4651 to complete it any other way. */
4657 /* Not a quoted string. */
4658 sym_text
= language_search_unquoted_string (text
, p
);
4662 sym_text_len
= strlen (sym_text
);
4666 /* Find the symtab for SRCFILE (this loads it if it was not yet read
4668 s
= lookup_symtab (srcfile
);
4671 /* Maybe they typed the file with leading directories, while the
4672 symbol tables record only its basename. */
4673 const char *tail
= lbasename (srcfile
);
4676 s
= lookup_symtab (tail
);
4679 /* If we have no symtab for that file, return an empty list. */
4681 return (return_val
);
4683 /* Go through this symtab and check the externs and statics for
4684 symbols which match. */
4686 b
= BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4687 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4689 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4692 b
= BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (s
), STATIC_BLOCK
);
4693 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4695 COMPLETION_LIST_ADD_SYMBOL (sym
, sym_text
, sym_text_len
, text
, word
);
4698 return (return_val
);
4701 /* A helper function for make_source_files_completion_list. It adds
4702 another file name to a list of possible completions, growing the
4703 list as necessary. */
4706 add_filename_to_list (const char *fname
, const char *text
, const char *word
,
4707 VEC (char_ptr
) **list
)
4710 size_t fnlen
= strlen (fname
);
4714 /* Return exactly fname. */
4715 new = xmalloc (fnlen
+ 5);
4716 strcpy (new, fname
);
4718 else if (word
> text
)
4720 /* Return some portion of fname. */
4721 new = xmalloc (fnlen
+ 5);
4722 strcpy (new, fname
+ (word
- text
));
4726 /* Return some of TEXT plus fname. */
4727 new = xmalloc (fnlen
+ (text
- word
) + 5);
4728 strncpy (new, word
, text
- word
);
4729 new[text
- word
] = '\0';
4730 strcat (new, fname
);
4732 VEC_safe_push (char_ptr
, *list
, new);
4736 not_interesting_fname (const char *fname
)
4738 static const char *illegal_aliens
[] = {
4739 "_globals_", /* inserted by coff_symtab_read */
4744 for (i
= 0; illegal_aliens
[i
]; i
++)
4746 if (filename_cmp (fname
, illegal_aliens
[i
]) == 0)
4752 /* An object of this type is passed as the user_data argument to
4753 map_partial_symbol_filenames. */
4754 struct add_partial_filename_data
4756 struct filename_seen_cache
*filename_seen_cache
;
4760 VEC (char_ptr
) **list
;
4763 /* A callback for map_partial_symbol_filenames. */
4766 maybe_add_partial_symtab_filename (const char *filename
, const char *fullname
,
4769 struct add_partial_filename_data
*data
= user_data
;
4771 if (not_interesting_fname (filename
))
4773 if (!filename_seen (data
->filename_seen_cache
, filename
, 1)
4774 && filename_ncmp (filename
, data
->text
, data
->text_len
) == 0)
4776 /* This file matches for a completion; add it to the
4777 current list of matches. */
4778 add_filename_to_list (filename
, data
->text
, data
->word
, data
->list
);
4782 const char *base_name
= lbasename (filename
);
4784 if (base_name
!= filename
4785 && !filename_seen (data
->filename_seen_cache
, base_name
, 1)
4786 && filename_ncmp (base_name
, data
->text
, data
->text_len
) == 0)
4787 add_filename_to_list (base_name
, data
->text
, data
->word
, data
->list
);
4791 /* Return a vector of all source files whose names begin with matching
4792 TEXT. The file names are looked up in the symbol tables of this
4793 program. If the answer is no matchess, then the return value is
4797 make_source_files_completion_list (const char *text
, const char *word
)
4799 struct compunit_symtab
*cu
;
4801 struct objfile
*objfile
;
4802 size_t text_len
= strlen (text
);
4803 VEC (char_ptr
) *list
= NULL
;
4804 const char *base_name
;
4805 struct add_partial_filename_data datum
;
4806 struct filename_seen_cache
*filename_seen_cache
;
4807 struct cleanup
*back_to
, *cache_cleanup
;
4809 if (!have_full_symbols () && !have_partial_symbols ())
4812 back_to
= make_cleanup (do_free_completion_list
, &list
);
4814 filename_seen_cache
= create_filename_seen_cache ();
4815 cache_cleanup
= make_cleanup (delete_filename_seen_cache
,
4816 filename_seen_cache
);
4818 ALL_FILETABS (objfile
, cu
, s
)
4820 if (not_interesting_fname (s
->filename
))
4822 if (!filename_seen (filename_seen_cache
, s
->filename
, 1)
4823 && filename_ncmp (s
->filename
, text
, text_len
) == 0)
4825 /* This file matches for a completion; add it to the current
4827 add_filename_to_list (s
->filename
, text
, word
, &list
);
4831 /* NOTE: We allow the user to type a base name when the
4832 debug info records leading directories, but not the other
4833 way around. This is what subroutines of breakpoint
4834 command do when they parse file names. */
4835 base_name
= lbasename (s
->filename
);
4836 if (base_name
!= s
->filename
4837 && !filename_seen (filename_seen_cache
, base_name
, 1)
4838 && filename_ncmp (base_name
, text
, text_len
) == 0)
4839 add_filename_to_list (base_name
, text
, word
, &list
);
4843 datum
.filename_seen_cache
= filename_seen_cache
;
4846 datum
.text_len
= text_len
;
4848 map_symbol_filenames (maybe_add_partial_symtab_filename
, &datum
,
4849 0 /*need_fullname*/);
4851 do_cleanups (cache_cleanup
);
4852 discard_cleanups (back_to
);
4859 /* Return the "main_info" object for the current program space. If
4860 the object has not yet been created, create it and fill in some
4863 static struct main_info
*
4864 get_main_info (void)
4866 struct main_info
*info
= program_space_data (current_program_space
,
4867 main_progspace_key
);
4871 /* It may seem strange to store the main name in the progspace
4872 and also in whatever objfile happens to see a main name in
4873 its debug info. The reason for this is mainly historical:
4874 gdb returned "main" as the name even if no function named
4875 "main" was defined the program; and this approach lets us
4876 keep compatibility. */
4877 info
= XCNEW (struct main_info
);
4878 info
->language_of_main
= language_unknown
;
4879 set_program_space_data (current_program_space
, main_progspace_key
,
4886 /* A cleanup to destroy a struct main_info when a progspace is
4890 main_info_cleanup (struct program_space
*pspace
, void *data
)
4892 struct main_info
*info
= data
;
4895 xfree (info
->name_of_main
);
4900 set_main_name (const char *name
, enum language lang
)
4902 struct main_info
*info
= get_main_info ();
4904 if (info
->name_of_main
!= NULL
)
4906 xfree (info
->name_of_main
);
4907 info
->name_of_main
= NULL
;
4908 info
->language_of_main
= language_unknown
;
4912 info
->name_of_main
= xstrdup (name
);
4913 info
->language_of_main
= lang
;
4917 /* Deduce the name of the main procedure, and set NAME_OF_MAIN
4921 find_main_name (void)
4923 const char *new_main_name
;
4924 struct objfile
*objfile
;
4926 /* First check the objfiles to see whether a debuginfo reader has
4927 picked up the appropriate main name. Historically the main name
4928 was found in a more or less random way; this approach instead
4929 relies on the order of objfile creation -- which still isn't
4930 guaranteed to get the correct answer, but is just probably more
4932 ALL_OBJFILES (objfile
)
4934 if (objfile
->per_bfd
->name_of_main
!= NULL
)
4936 set_main_name (objfile
->per_bfd
->name_of_main
,
4937 objfile
->per_bfd
->language_of_main
);
4942 /* Try to see if the main procedure is in Ada. */
4943 /* FIXME: brobecker/2005-03-07: Another way of doing this would
4944 be to add a new method in the language vector, and call this
4945 method for each language until one of them returns a non-empty
4946 name. This would allow us to remove this hard-coded call to
4947 an Ada function. It is not clear that this is a better approach
4948 at this point, because all methods need to be written in a way
4949 such that false positives never be returned. For instance, it is
4950 important that a method does not return a wrong name for the main
4951 procedure if the main procedure is actually written in a different
4952 language. It is easy to guaranty this with Ada, since we use a
4953 special symbol generated only when the main in Ada to find the name
4954 of the main procedure. It is difficult however to see how this can
4955 be guarantied for languages such as C, for instance. This suggests
4956 that order of call for these methods becomes important, which means
4957 a more complicated approach. */
4958 new_main_name
= ada_main_name ();
4959 if (new_main_name
!= NULL
)
4961 set_main_name (new_main_name
, language_ada
);
4965 new_main_name
= d_main_name ();
4966 if (new_main_name
!= NULL
)
4968 set_main_name (new_main_name
, language_d
);
4972 new_main_name
= go_main_name ();
4973 if (new_main_name
!= NULL
)
4975 set_main_name (new_main_name
, language_go
);
4979 new_main_name
= pascal_main_name ();
4980 if (new_main_name
!= NULL
)
4982 set_main_name (new_main_name
, language_pascal
);
4986 /* The languages above didn't identify the name of the main procedure.
4987 Fallback to "main". */
4988 set_main_name ("main", language_unknown
);
4994 struct main_info
*info
= get_main_info ();
4996 if (info
->name_of_main
== NULL
)
4999 return info
->name_of_main
;
5002 /* Return the language of the main function. If it is not known,
5003 return language_unknown. */
5006 main_language (void)
5008 struct main_info
*info
= get_main_info ();
5010 if (info
->name_of_main
== NULL
)
5013 return info
->language_of_main
;
5016 /* Handle ``executable_changed'' events for the symtab module. */
5019 symtab_observer_executable_changed (void)
5021 /* NAME_OF_MAIN may no longer be the same, so reset it for now. */
5022 set_main_name (NULL
, language_unknown
);
5025 /* Return 1 if the supplied producer string matches the ARM RealView
5026 compiler (armcc). */
5029 producer_is_realview (const char *producer
)
5031 static const char *const arm_idents
[] = {
5032 "ARM C Compiler, ADS",
5033 "Thumb C Compiler, ADS",
5034 "ARM C++ Compiler, ADS",
5035 "Thumb C++ Compiler, ADS",
5036 "ARM/Thumb C/C++ Compiler, RVCT",
5037 "ARM C/C++ Compiler, RVCT"
5041 if (producer
== NULL
)
5044 for (i
= 0; i
< ARRAY_SIZE (arm_idents
); i
++)
5045 if (strncmp (producer
, arm_idents
[i
], strlen (arm_idents
[i
])) == 0)
5053 /* The next index to hand out in response to a registration request. */
5055 static int next_aclass_value
= LOC_FINAL_VALUE
;
5057 /* The maximum number of "aclass" registrations we support. This is
5058 constant for convenience. */
5059 #define MAX_SYMBOL_IMPLS (LOC_FINAL_VALUE + 10)
5061 /* The objects representing the various "aclass" values. The elements
5062 from 0 up to LOC_FINAL_VALUE-1 represent themselves, and subsequent
5063 elements are those registered at gdb initialization time. */
5065 static struct symbol_impl symbol_impl
[MAX_SYMBOL_IMPLS
];
5067 /* The globally visible pointer. This is separate from 'symbol_impl'
5068 so that it can be const. */
5070 const struct symbol_impl
*symbol_impls
= &symbol_impl
[0];
5072 /* Make sure we saved enough room in struct symbol. */
5074 gdb_static_assert (MAX_SYMBOL_IMPLS
<= (1 << SYMBOL_ACLASS_BITS
));
5076 /* Register a computed symbol type. ACLASS must be LOC_COMPUTED. OPS
5077 is the ops vector associated with this index. This returns the new
5078 index, which should be used as the aclass_index field for symbols
5082 register_symbol_computed_impl (enum address_class aclass
,
5083 const struct symbol_computed_ops
*ops
)
5085 int result
= next_aclass_value
++;
5087 gdb_assert (aclass
== LOC_COMPUTED
);
5088 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5089 symbol_impl
[result
].aclass
= aclass
;
5090 symbol_impl
[result
].ops_computed
= ops
;
5092 /* Sanity check OPS. */
5093 gdb_assert (ops
!= NULL
);
5094 gdb_assert (ops
->tracepoint_var_ref
!= NULL
);
5095 gdb_assert (ops
->describe_location
!= NULL
);
5096 gdb_assert (ops
->read_needs_frame
!= NULL
);
5097 gdb_assert (ops
->read_variable
!= NULL
);
5102 /* Register a function with frame base type. ACLASS must be LOC_BLOCK.
5103 OPS is the ops vector associated with this index. This returns the
5104 new index, which should be used as the aclass_index field for symbols
5108 register_symbol_block_impl (enum address_class aclass
,
5109 const struct symbol_block_ops
*ops
)
5111 int result
= next_aclass_value
++;
5113 gdb_assert (aclass
== LOC_BLOCK
);
5114 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5115 symbol_impl
[result
].aclass
= aclass
;
5116 symbol_impl
[result
].ops_block
= ops
;
5118 /* Sanity check OPS. */
5119 gdb_assert (ops
!= NULL
);
5120 gdb_assert (ops
->find_frame_base_location
!= NULL
);
5125 /* Register a register symbol type. ACLASS must be LOC_REGISTER or
5126 LOC_REGPARM_ADDR. OPS is the register ops vector associated with
5127 this index. This returns the new index, which should be used as
5128 the aclass_index field for symbols of this type. */
5131 register_symbol_register_impl (enum address_class aclass
,
5132 const struct symbol_register_ops
*ops
)
5134 int result
= next_aclass_value
++;
5136 gdb_assert (aclass
== LOC_REGISTER
|| aclass
== LOC_REGPARM_ADDR
);
5137 gdb_assert (result
< MAX_SYMBOL_IMPLS
);
5138 symbol_impl
[result
].aclass
= aclass
;
5139 symbol_impl
[result
].ops_register
= ops
;
5144 /* Initialize elements of 'symbol_impl' for the constants in enum
5148 initialize_ordinary_address_classes (void)
5152 for (i
= 0; i
< LOC_FINAL_VALUE
; ++i
)
5153 symbol_impl
[i
].aclass
= i
;
5158 /* Initialize the symbol SYM. */
5161 initialize_symbol (struct symbol
*sym
)
5163 memset (sym
, 0, sizeof (*sym
));
5164 SYMBOL_SECTION (sym
) = -1;
5167 /* Allocate and initialize a new 'struct symbol' on OBJFILE's
5171 allocate_symbol (struct objfile
*objfile
)
5173 struct symbol
*result
;
5175 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct symbol
);
5176 SYMBOL_SECTION (result
) = -1;
5181 /* Allocate and initialize a new 'struct template_symbol' on OBJFILE's
5184 struct template_symbol
*
5185 allocate_template_symbol (struct objfile
*objfile
)
5187 struct template_symbol
*result
;
5189 result
= OBSTACK_ZALLOC (&objfile
->objfile_obstack
, struct template_symbol
);
5190 SYMBOL_SECTION (&result
->base
) = -1;
5198 _initialize_symtab (void)
5200 initialize_ordinary_address_classes ();
5203 = register_program_space_data_with_cleanup (NULL
, main_info_cleanup
);
5205 add_info ("variables", variables_info
, _("\
5206 All global and static variable names, or those matching REGEXP."));
5208 add_com ("whereis", class_info
, variables_info
, _("\
5209 All global and static variable names, or those matching REGEXP."));
5211 add_info ("functions", functions_info
,
5212 _("All function names, or those matching REGEXP."));
5214 /* FIXME: This command has at least the following problems:
5215 1. It prints builtin types (in a very strange and confusing fashion).
5216 2. It doesn't print right, e.g. with
5217 typedef struct foo *FOO
5218 type_print prints "FOO" when we want to make it (in this situation)
5219 print "struct foo *".
5220 I also think "ptype" or "whatis" is more likely to be useful (but if
5221 there is much disagreement "info types" can be fixed). */
5222 add_info ("types", types_info
,
5223 _("All type names, or those matching REGEXP."));
5225 add_info ("sources", sources_info
,
5226 _("Source files in the program."));
5228 add_com ("rbreak", class_breakpoint
, rbreak_command
,
5229 _("Set a breakpoint for all functions matching REGEXP."));
5233 add_com ("lf", class_info
, sources_info
,
5234 _("Source files in the program"));
5235 add_com ("lg", class_info
, variables_info
, _("\
5236 All global and static variable names, or those matching REGEXP."));
5239 add_setshow_enum_cmd ("multiple-symbols", no_class
,
5240 multiple_symbols_modes
, &multiple_symbols_mode
,
5242 Set the debugger behavior when more than one symbol are possible matches\n\
5243 in an expression."), _("\
5244 Show how the debugger handles ambiguities in expressions."), _("\
5245 Valid values are \"ask\", \"all\", \"cancel\", and the default is \"all\"."),
5246 NULL
, NULL
, &setlist
, &showlist
);
5248 add_setshow_boolean_cmd ("basenames-may-differ", class_obscure
,
5249 &basenames_may_differ
, _("\
5250 Set whether a source file may have multiple base names."), _("\
5251 Show whether a source file may have multiple base names."), _("\
5252 (A \"base name\" is the name of a file with the directory part removed.\n\
5253 Example: The base name of \"/home/user/hello.c\" is \"hello.c\".)\n\
5254 If set, GDB will canonicalize file names (e.g., expand symlinks)\n\
5255 before comparing them. Canonicalization is an expensive operation,\n\
5256 but it allows the same file be known by more than one base name.\n\
5257 If not set (the default), all source files are assumed to have just\n\
5258 one base name, and gdb will do file name comparisons more efficiently."),
5260 &setlist
, &showlist
);
5262 add_setshow_zuinteger_cmd ("symtab-create", no_class
, &symtab_create_debug
,
5263 _("Set debugging of symbol table creation."),
5264 _("Show debugging of symbol table creation."), _("\
5265 When enabled (non-zero), debugging messages are printed when building\n\
5266 symbol tables. A value of 1 (one) normally provides enough information.\n\
5267 A value greater than 1 provides more verbose information."),
5270 &setdebuglist
, &showdebuglist
);
5272 observer_attach_executable_changed (symtab_observer_executable_changed
);