Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Symbol table lookup for the GNU debugger, GDB. |
8926118c | 2 | |
ecd75fc8 | 3 | Copyright (C) 1986-2014 Free Software Foundation, Inc. |
c906108c | 4 | |
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
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 | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 10 | (at your option) any later version. |
c906108c | 11 | |
c5aa993b JM |
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. | |
c906108c | 16 | |
c5aa993b | 17 | You should have received a copy of the GNU General Public License |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | #include "defs.h" | |
21 | #include "symtab.h" | |
22 | #include "gdbtypes.h" | |
23 | #include "gdbcore.h" | |
24 | #include "frame.h" | |
25 | #include "target.h" | |
26 | #include "value.h" | |
27 | #include "symfile.h" | |
28 | #include "objfiles.h" | |
29 | #include "gdbcmd.h" | |
88987551 | 30 | #include "gdb_regex.h" |
c906108c SS |
31 | #include "expression.h" |
32 | #include "language.h" | |
33 | #include "demangle.h" | |
34 | #include "inferior.h" | |
0378c332 | 35 | #include "source.h" |
a7fdf62f | 36 | #include "filenames.h" /* for FILENAME_CMP */ |
1bae87b9 | 37 | #include "objc-lang.h" |
6aecb9c2 | 38 | #include "d-lang.h" |
1f8173e6 | 39 | #include "ada-lang.h" |
a766d390 | 40 | #include "go-lang.h" |
cd6c7346 | 41 | #include "p-lang.h" |
ff013f42 | 42 | #include "addrmap.h" |
529480d0 | 43 | #include "cli/cli-utils.h" |
c906108c | 44 | |
2de7ced7 DJ |
45 | #include "hashtab.h" |
46 | ||
04ea0df1 | 47 | #include "gdb_obstack.h" |
fe898f56 | 48 | #include "block.h" |
de4f826b | 49 | #include "dictionary.h" |
c906108c SS |
50 | |
51 | #include <sys/types.h> | |
52 | #include <fcntl.h> | |
53ce3c39 | 53 | #include <sys/stat.h> |
c906108c | 54 | #include <ctype.h> |
015a42b4 | 55 | #include "cp-abi.h" |
71c25dea | 56 | #include "cp-support.h" |
ea53e89f | 57 | #include "observer.h" |
3a40aaa0 | 58 | #include "solist.h" |
9a044a89 TT |
59 | #include "macrotab.h" |
60 | #include "macroscope.h" | |
c906108c | 61 | |
270140bd | 62 | #include "parser-defs.h" |
ccefe4c4 | 63 | |
ff6c39cf | 64 | /* Forward declarations for local functions. */ |
c906108c | 65 | |
a14ed312 | 66 | static void rbreak_command (char *, int); |
c906108c | 67 | |
f8eba3c6 | 68 | static int find_line_common (struct linetable *, int, int *, int); |
c906108c | 69 | |
3121eff0 | 70 | static struct symbol *lookup_symbol_aux (const char *name, |
3121eff0 | 71 | const struct block *block, |
176620f1 | 72 | const domain_enum domain, |
53c5240f | 73 | enum language language, |
cf901d3b | 74 | struct field_of_this_result *); |
fba7f19c | 75 | |
e4051eeb | 76 | static |
74016e12 DE |
77 | struct symbol *lookup_local_symbol (const char *name, |
78 | const struct block *block, | |
79 | const domain_enum domain, | |
80 | enum language language); | |
8155455b DC |
81 | |
82 | static | |
74016e12 DE |
83 | struct symbol *lookup_symbol_in_all_objfiles (int block_index, |
84 | const char *name, | |
85 | const domain_enum domain); | |
8155455b DC |
86 | |
87 | static | |
74016e12 DE |
88 | struct symbol *lookup_symbol_via_quick_fns (struct objfile *objfile, |
89 | int block_index, | |
90 | const char *name, | |
91 | const domain_enum domain); | |
c906108c | 92 | |
ff6c39cf | 93 | extern initialize_file_ftype _initialize_symtab; |
c906108c | 94 | |
32ac0d11 TT |
95 | /* Program space key for finding name and language of "main". */ |
96 | ||
97 | static const struct program_space_data *main_progspace_key; | |
98 | ||
99 | /* Type of the data stored on the program space. */ | |
100 | ||
101 | struct main_info | |
102 | { | |
103 | /* Name of "main". */ | |
104 | ||
105 | char *name_of_main; | |
106 | ||
107 | /* Language of "main". */ | |
108 | ||
109 | enum language language_of_main; | |
110 | }; | |
111 | ||
45cfd468 | 112 | /* When non-zero, print debugging messages related to symtab creation. */ |
db0fec5c | 113 | unsigned int symtab_create_debug = 0; |
45cfd468 | 114 | |
c011a4f4 DE |
115 | /* Non-zero if a file may be known by two different basenames. |
116 | This is the uncommon case, and significantly slows down gdb. | |
117 | Default set to "off" to not slow down the common case. */ | |
118 | int basenames_may_differ = 0; | |
119 | ||
717d2f5a JB |
120 | /* Allow the user to configure the debugger behavior with respect |
121 | to multiple-choice menus when more than one symbol matches during | |
122 | a symbol lookup. */ | |
123 | ||
7fc830e2 MK |
124 | const char multiple_symbols_ask[] = "ask"; |
125 | const char multiple_symbols_all[] = "all"; | |
126 | const char multiple_symbols_cancel[] = "cancel"; | |
40478521 | 127 | static const char *const multiple_symbols_modes[] = |
717d2f5a JB |
128 | { |
129 | multiple_symbols_ask, | |
130 | multiple_symbols_all, | |
131 | multiple_symbols_cancel, | |
132 | NULL | |
133 | }; | |
134 | static const char *multiple_symbols_mode = multiple_symbols_all; | |
135 | ||
136 | /* Read-only accessor to AUTO_SELECT_MODE. */ | |
137 | ||
138 | const char * | |
139 | multiple_symbols_select_mode (void) | |
140 | { | |
141 | return multiple_symbols_mode; | |
142 | } | |
143 | ||
c906108c | 144 | /* Block in which the most recently searched-for symbol was found. |
9af17804 | 145 | Might be better to make this a parameter to lookup_symbol and |
c378eb4e | 146 | value_of_this. */ |
c906108c SS |
147 | |
148 | const struct block *block_found; | |
149 | ||
20c681d1 DE |
150 | /* Return the name of a domain_enum. */ |
151 | ||
152 | const char * | |
153 | domain_name (domain_enum e) | |
154 | { | |
155 | switch (e) | |
156 | { | |
157 | case UNDEF_DOMAIN: return "UNDEF_DOMAIN"; | |
158 | case VAR_DOMAIN: return "VAR_DOMAIN"; | |
159 | case STRUCT_DOMAIN: return "STRUCT_DOMAIN"; | |
160 | case LABEL_DOMAIN: return "LABEL_DOMAIN"; | |
161 | case COMMON_BLOCK_DOMAIN: return "COMMON_BLOCK_DOMAIN"; | |
162 | default: gdb_assert_not_reached ("bad domain_enum"); | |
163 | } | |
164 | } | |
165 | ||
166 | /* Return the name of a search_domain . */ | |
167 | ||
168 | const char * | |
169 | search_domain_name (enum search_domain e) | |
170 | { | |
171 | switch (e) | |
172 | { | |
173 | case VARIABLES_DOMAIN: return "VARIABLES_DOMAIN"; | |
174 | case FUNCTIONS_DOMAIN: return "FUNCTIONS_DOMAIN"; | |
175 | case TYPES_DOMAIN: return "TYPES_DOMAIN"; | |
176 | case ALL_DOMAIN: return "ALL_DOMAIN"; | |
177 | default: gdb_assert_not_reached ("bad search_domain"); | |
178 | } | |
179 | } | |
180 | ||
db0fec5c DE |
181 | /* Set the primary field in SYMTAB. */ |
182 | ||
183 | void | |
184 | set_symtab_primary (struct symtab *symtab, int primary) | |
185 | { | |
186 | symtab->primary = primary; | |
187 | ||
188 | if (symtab_create_debug && primary) | |
189 | { | |
190 | fprintf_unfiltered (gdb_stdlog, | |
191 | "Created primary symtab %s for %s.\n", | |
192 | host_address_to_string (symtab), | |
193 | symtab_to_filename_for_display (symtab)); | |
194 | } | |
195 | } | |
196 | ||
4aac40c8 TT |
197 | /* See whether FILENAME matches SEARCH_NAME using the rule that we |
198 | advertise to the user. (The manual's description of linespecs | |
af529f8f JK |
199 | describes what we advertise). Returns true if they match, false |
200 | otherwise. */ | |
4aac40c8 TT |
201 | |
202 | int | |
b57a636e | 203 | compare_filenames_for_search (const char *filename, const char *search_name) |
4aac40c8 TT |
204 | { |
205 | int len = strlen (filename); | |
b57a636e | 206 | size_t search_len = strlen (search_name); |
4aac40c8 TT |
207 | |
208 | if (len < search_len) | |
209 | return 0; | |
210 | ||
211 | /* The tail of FILENAME must match. */ | |
212 | if (FILENAME_CMP (filename + len - search_len, search_name) != 0) | |
213 | return 0; | |
214 | ||
215 | /* Either the names must completely match, or the character | |
216 | preceding the trailing SEARCH_NAME segment of FILENAME must be a | |
d84fca2c JK |
217 | directory separator. |
218 | ||
af529f8f JK |
219 | The check !IS_ABSOLUTE_PATH ensures SEARCH_NAME "/dir/file.c" |
220 | cannot match FILENAME "/path//dir/file.c" - as user has requested | |
221 | absolute path. The sama applies for "c:\file.c" possibly | |
222 | incorrectly hypothetically matching "d:\dir\c:\file.c". | |
223 | ||
d84fca2c JK |
224 | The HAS_DRIVE_SPEC purpose is to make FILENAME "c:file.c" |
225 | compatible with SEARCH_NAME "file.c". In such case a compiler had | |
226 | to put the "c:file.c" name into debug info. Such compatibility | |
227 | works only on GDB built for DOS host. */ | |
4aac40c8 | 228 | return (len == search_len |
af529f8f JK |
229 | || (!IS_ABSOLUTE_PATH (search_name) |
230 | && IS_DIR_SEPARATOR (filename[len - search_len - 1])) | |
4aac40c8 TT |
231 | || (HAS_DRIVE_SPEC (filename) |
232 | && STRIP_DRIVE_SPEC (filename) == &filename[len - search_len])); | |
233 | } | |
234 | ||
f8eba3c6 TT |
235 | /* Check for a symtab of a specific name by searching some symtabs. |
236 | This is a helper function for callbacks of iterate_over_symtabs. | |
c906108c | 237 | |
b2d23133 DE |
238 | If NAME is not absolute, then REAL_PATH is NULL |
239 | If NAME is absolute, then REAL_PATH is the gdb_realpath form of NAME. | |
240 | ||
f5b95b50 | 241 | The return value, NAME, REAL_PATH, CALLBACK, and DATA |
f8eba3c6 TT |
242 | are identical to the `map_symtabs_matching_filename' method of |
243 | quick_symbol_functions. | |
244 | ||
245 | FIRST and AFTER_LAST indicate the range of symtabs to search. | |
246 | AFTER_LAST is one past the last symtab to search; NULL means to | |
247 | search until the end of the list. */ | |
248 | ||
249 | int | |
250 | iterate_over_some_symtabs (const char *name, | |
f8eba3c6 TT |
251 | const char *real_path, |
252 | int (*callback) (struct symtab *symtab, | |
253 | void *data), | |
254 | void *data, | |
255 | struct symtab *first, | |
256 | struct symtab *after_last) | |
c906108c | 257 | { |
ccefe4c4 | 258 | struct symtab *s = NULL; |
c011a4f4 | 259 | const char* base_name = lbasename (name); |
1f84b619 | 260 | |
f8eba3c6 | 261 | for (s = first; s != NULL && s != after_last; s = s->next) |
f079a2e5 | 262 | { |
af529f8f | 263 | if (compare_filenames_for_search (s->filename, name)) |
4aac40c8 TT |
264 | { |
265 | if (callback (s, data)) | |
266 | return 1; | |
288e77a7 | 267 | continue; |
4aac40c8 TT |
268 | } |
269 | ||
a94e8645 DE |
270 | /* Before we invoke realpath, which can get expensive when many |
271 | files are involved, do a quick comparison of the basenames. */ | |
272 | if (! basenames_may_differ | |
273 | && FILENAME_CMP (base_name, lbasename (s->filename)) != 0) | |
288e77a7 | 274 | continue; |
a94e8645 DE |
275 | |
276 | if (compare_filenames_for_search (symtab_to_fullname (s), name)) | |
277 | { | |
278 | if (callback (s, data)) | |
279 | return 1; | |
280 | continue; | |
281 | } | |
282 | ||
283 | /* If the user gave us an absolute path, try to find the file in | |
284 | this symtab and use its absolute path. */ | |
a94e8645 DE |
285 | if (real_path != NULL) |
286 | { | |
287 | const char *fullname = symtab_to_fullname (s); | |
288 | ||
289 | gdb_assert (IS_ABSOLUTE_PATH (real_path)); | |
290 | gdb_assert (IS_ABSOLUTE_PATH (name)); | |
291 | if (FILENAME_CMP (real_path, fullname) == 0) | |
292 | { | |
293 | if (callback (s, data)) | |
294 | return 1; | |
295 | continue; | |
296 | } | |
297 | } | |
f8eba3c6 | 298 | } |
58d370e0 | 299 | |
f8eba3c6 TT |
300 | return 0; |
301 | } | |
302 | ||
303 | /* Check for a symtab of a specific name; first in symtabs, then in | |
304 | psymtabs. *If* there is no '/' in the name, a match after a '/' | |
305 | in the symtab filename will also work. | |
306 | ||
307 | Calls CALLBACK with each symtab that is found and with the supplied | |
308 | DATA. If CALLBACK returns true, the search stops. */ | |
309 | ||
310 | void | |
311 | iterate_over_symtabs (const char *name, | |
312 | int (*callback) (struct symtab *symtab, | |
313 | void *data), | |
314 | void *data) | |
315 | { | |
f8eba3c6 TT |
316 | struct objfile *objfile; |
317 | char *real_path = NULL; | |
f8eba3c6 TT |
318 | struct cleanup *cleanups = make_cleanup (null_cleanup, NULL); |
319 | ||
320 | /* Here we are interested in canonicalizing an absolute path, not | |
321 | absolutizing a relative path. */ | |
322 | if (IS_ABSOLUTE_PATH (name)) | |
323 | { | |
f8eba3c6 TT |
324 | real_path = gdb_realpath (name); |
325 | make_cleanup (xfree, real_path); | |
af529f8f | 326 | gdb_assert (IS_ABSOLUTE_PATH (real_path)); |
f8eba3c6 TT |
327 | } |
328 | ||
329 | ALL_OBJFILES (objfile) | |
330 | { | |
f5b95b50 | 331 | if (iterate_over_some_symtabs (name, real_path, callback, data, |
f8eba3c6 TT |
332 | objfile->symtabs, NULL)) |
333 | { | |
334 | do_cleanups (cleanups); | |
335 | return; | |
336 | } | |
337 | } | |
338 | ||
c906108c SS |
339 | /* Same search rules as above apply here, but now we look thru the |
340 | psymtabs. */ | |
341 | ||
ccefe4c4 TT |
342 | ALL_OBJFILES (objfile) |
343 | { | |
344 | if (objfile->sf | |
f8eba3c6 TT |
345 | && objfile->sf->qf->map_symtabs_matching_filename (objfile, |
346 | name, | |
f8eba3c6 TT |
347 | real_path, |
348 | callback, | |
349 | data)) | |
ccefe4c4 | 350 | { |
f8eba3c6 TT |
351 | do_cleanups (cleanups); |
352 | return; | |
ccefe4c4 TT |
353 | } |
354 | } | |
c906108c | 355 | |
f8eba3c6 TT |
356 | do_cleanups (cleanups); |
357 | } | |
358 | ||
359 | /* The callback function used by lookup_symtab. */ | |
360 | ||
361 | static int | |
362 | lookup_symtab_callback (struct symtab *symtab, void *data) | |
363 | { | |
364 | struct symtab **result_ptr = data; | |
c906108c | 365 | |
f8eba3c6 TT |
366 | *result_ptr = symtab; |
367 | return 1; | |
c906108c | 368 | } |
f8eba3c6 TT |
369 | |
370 | /* A wrapper for iterate_over_symtabs that returns the first matching | |
371 | symtab, or NULL. */ | |
372 | ||
373 | struct symtab * | |
374 | lookup_symtab (const char *name) | |
375 | { | |
376 | struct symtab *result = NULL; | |
377 | ||
378 | iterate_over_symtabs (name, lookup_symtab_callback, &result); | |
379 | return result; | |
380 | } | |
381 | ||
c906108c SS |
382 | \f |
383 | /* Mangle a GDB method stub type. This actually reassembles the pieces of the | |
384 | full method name, which consist of the class name (from T), the unadorned | |
385 | method name from METHOD_ID, and the signature for the specific overload, | |
c378eb4e | 386 | specified by SIGNATURE_ID. Note that this function is g++ specific. */ |
c906108c SS |
387 | |
388 | char * | |
fba45db2 | 389 | gdb_mangle_name (struct type *type, int method_id, int signature_id) |
c906108c SS |
390 | { |
391 | int mangled_name_len; | |
392 | char *mangled_name; | |
393 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, method_id); | |
394 | struct fn_field *method = &f[signature_id]; | |
0d5cff50 | 395 | const char *field_name = TYPE_FN_FIELDLIST_NAME (type, method_id); |
1d06ead6 | 396 | const char *physname = TYPE_FN_FIELD_PHYSNAME (f, signature_id); |
0d5cff50 | 397 | const char *newname = type_name_no_tag (type); |
c906108c SS |
398 | |
399 | /* Does the form of physname indicate that it is the full mangled name | |
400 | of a constructor (not just the args)? */ | |
401 | int is_full_physname_constructor; | |
402 | ||
403 | int is_constructor; | |
015a42b4 | 404 | int is_destructor = is_destructor_name (physname); |
c906108c SS |
405 | /* Need a new type prefix. */ |
406 | char *const_prefix = method->is_const ? "C" : ""; | |
407 | char *volatile_prefix = method->is_volatile ? "V" : ""; | |
408 | char buf[20]; | |
409 | int len = (newname == NULL ? 0 : strlen (newname)); | |
410 | ||
43630227 PS |
411 | /* Nothing to do if physname already contains a fully mangled v3 abi name |
412 | or an operator name. */ | |
413 | if ((physname[0] == '_' && physname[1] == 'Z') | |
414 | || is_operator_name (field_name)) | |
235d1e03 EZ |
415 | return xstrdup (physname); |
416 | ||
015a42b4 | 417 | is_full_physname_constructor = is_constructor_name (physname); |
c906108c | 418 | |
3e43a32a MS |
419 | is_constructor = is_full_physname_constructor |
420 | || (newname && strcmp (field_name, newname) == 0); | |
c906108c SS |
421 | |
422 | if (!is_destructor) | |
c5aa993b | 423 | is_destructor = (strncmp (physname, "__dt", 4) == 0); |
c906108c SS |
424 | |
425 | if (is_destructor || is_full_physname_constructor) | |
426 | { | |
c5aa993b JM |
427 | mangled_name = (char *) xmalloc (strlen (physname) + 1); |
428 | strcpy (mangled_name, physname); | |
c906108c SS |
429 | return mangled_name; |
430 | } | |
431 | ||
432 | if (len == 0) | |
433 | { | |
8c042590 | 434 | xsnprintf (buf, sizeof (buf), "__%s%s", const_prefix, volatile_prefix); |
c906108c SS |
435 | } |
436 | else if (physname[0] == 't' || physname[0] == 'Q') | |
437 | { | |
438 | /* The physname for template and qualified methods already includes | |
c5aa993b | 439 | the class name. */ |
8c042590 | 440 | xsnprintf (buf, sizeof (buf), "__%s%s", const_prefix, volatile_prefix); |
c906108c SS |
441 | newname = NULL; |
442 | len = 0; | |
443 | } | |
444 | else | |
445 | { | |
8c042590 PM |
446 | xsnprintf (buf, sizeof (buf), "__%s%s%d", const_prefix, |
447 | volatile_prefix, len); | |
c906108c SS |
448 | } |
449 | mangled_name_len = ((is_constructor ? 0 : strlen (field_name)) | |
235d1e03 | 450 | + strlen (buf) + len + strlen (physname) + 1); |
c906108c | 451 | |
433759f7 MS |
452 | mangled_name = (char *) xmalloc (mangled_name_len); |
453 | if (is_constructor) | |
454 | mangled_name[0] = '\0'; | |
455 | else | |
456 | strcpy (mangled_name, field_name); | |
457 | ||
c906108c SS |
458 | strcat (mangled_name, buf); |
459 | /* If the class doesn't have a name, i.e. newname NULL, then we just | |
460 | mangle it using 0 for the length of the class. Thus it gets mangled | |
c378eb4e | 461 | as something starting with `::' rather than `classname::'. */ |
c906108c SS |
462 | if (newname != NULL) |
463 | strcat (mangled_name, newname); | |
464 | ||
465 | strcat (mangled_name, physname); | |
466 | return (mangled_name); | |
467 | } | |
12af6855 | 468 | |
29df156d SW |
469 | /* Initialize the cplus_specific structure. 'cplus_specific' should |
470 | only be allocated for use with cplus symbols. */ | |
471 | ||
472 | static void | |
473 | symbol_init_cplus_specific (struct general_symbol_info *gsymbol, | |
ccde22c0 | 474 | struct obstack *obstack) |
29df156d SW |
475 | { |
476 | /* A language_specific structure should not have been previously | |
477 | initialized. */ | |
478 | gdb_assert (gsymbol->language_specific.cplus_specific == NULL); | |
ccde22c0 | 479 | gdb_assert (obstack != NULL); |
29df156d SW |
480 | |
481 | gsymbol->language_specific.cplus_specific = | |
ccde22c0 | 482 | OBSTACK_ZALLOC (obstack, struct cplus_specific); |
29df156d SW |
483 | } |
484 | ||
b250c185 | 485 | /* Set the demangled name of GSYMBOL to NAME. NAME must be already |
29df156d | 486 | correctly allocated. For C++ symbols a cplus_specific struct is |
c378eb4e | 487 | allocated so OBJFILE must not be NULL. If this is a non C++ symbol |
29df156d | 488 | OBJFILE can be NULL. */ |
eca864fe | 489 | |
b250c185 SW |
490 | void |
491 | symbol_set_demangled_name (struct general_symbol_info *gsymbol, | |
cfc594ee | 492 | const char *name, |
ccde22c0 | 493 | struct obstack *obstack) |
b250c185 | 494 | { |
29df156d SW |
495 | if (gsymbol->language == language_cplus) |
496 | { | |
497 | if (gsymbol->language_specific.cplus_specific == NULL) | |
ccde22c0 | 498 | symbol_init_cplus_specific (gsymbol, obstack); |
29df156d SW |
499 | |
500 | gsymbol->language_specific.cplus_specific->demangled_name = name; | |
501 | } | |
f85f34ed TT |
502 | else if (gsymbol->language == language_ada) |
503 | { | |
504 | if (name == NULL) | |
505 | { | |
506 | gsymbol->ada_mangled = 0; | |
507 | gsymbol->language_specific.obstack = obstack; | |
508 | } | |
509 | else | |
510 | { | |
511 | gsymbol->ada_mangled = 1; | |
512 | gsymbol->language_specific.mangled_lang.demangled_name = name; | |
513 | } | |
514 | } | |
29df156d SW |
515 | else |
516 | gsymbol->language_specific.mangled_lang.demangled_name = name; | |
b250c185 SW |
517 | } |
518 | ||
519 | /* Return the demangled name of GSYMBOL. */ | |
eca864fe | 520 | |
0d5cff50 | 521 | const char * |
b250c185 SW |
522 | symbol_get_demangled_name (const struct general_symbol_info *gsymbol) |
523 | { | |
29df156d SW |
524 | if (gsymbol->language == language_cplus) |
525 | { | |
45c58896 SW |
526 | if (gsymbol->language_specific.cplus_specific != NULL) |
527 | return gsymbol->language_specific.cplus_specific->demangled_name; | |
528 | else | |
529 | return NULL; | |
29df156d | 530 | } |
f85f34ed TT |
531 | else if (gsymbol->language == language_ada) |
532 | { | |
533 | if (!gsymbol->ada_mangled) | |
534 | return NULL; | |
535 | /* Fall through. */ | |
536 | } | |
537 | ||
538 | return gsymbol->language_specific.mangled_lang.demangled_name; | |
b250c185 SW |
539 | } |
540 | ||
12af6855 | 541 | \f |
89aad1f9 | 542 | /* Initialize the language dependent portion of a symbol |
c378eb4e | 543 | depending upon the language for the symbol. */ |
eca864fe | 544 | |
89aad1f9 | 545 | void |
33e5013e | 546 | symbol_set_language (struct general_symbol_info *gsymbol, |
f85f34ed TT |
547 | enum language language, |
548 | struct obstack *obstack) | |
89aad1f9 EZ |
549 | { |
550 | gsymbol->language = language; | |
33e5013e | 551 | if (gsymbol->language == language_d |
a766d390 | 552 | || gsymbol->language == language_go |
5784d15e | 553 | || gsymbol->language == language_java |
f55ee35c JK |
554 | || gsymbol->language == language_objc |
555 | || gsymbol->language == language_fortran) | |
89aad1f9 | 556 | { |
f85f34ed TT |
557 | symbol_set_demangled_name (gsymbol, NULL, obstack); |
558 | } | |
559 | else if (gsymbol->language == language_ada) | |
560 | { | |
561 | gdb_assert (gsymbol->ada_mangled == 0); | |
562 | gsymbol->language_specific.obstack = obstack; | |
89aad1f9 | 563 | } |
29df156d SW |
564 | else if (gsymbol->language == language_cplus) |
565 | gsymbol->language_specific.cplus_specific = NULL; | |
89aad1f9 EZ |
566 | else |
567 | { | |
568 | memset (&gsymbol->language_specific, 0, | |
569 | sizeof (gsymbol->language_specific)); | |
570 | } | |
571 | } | |
572 | ||
2de7ced7 DJ |
573 | /* Functions to initialize a symbol's mangled name. */ |
574 | ||
04a679b8 TT |
575 | /* Objects of this type are stored in the demangled name hash table. */ |
576 | struct demangled_name_entry | |
577 | { | |
9d2ceabe | 578 | const char *mangled; |
04a679b8 TT |
579 | char demangled[1]; |
580 | }; | |
581 | ||
582 | /* Hash function for the demangled name hash. */ | |
eca864fe | 583 | |
04a679b8 TT |
584 | static hashval_t |
585 | hash_demangled_name_entry (const void *data) | |
586 | { | |
587 | const struct demangled_name_entry *e = data; | |
433759f7 | 588 | |
04a679b8 TT |
589 | return htab_hash_string (e->mangled); |
590 | } | |
591 | ||
592 | /* Equality function for the demangled name hash. */ | |
eca864fe | 593 | |
04a679b8 TT |
594 | static int |
595 | eq_demangled_name_entry (const void *a, const void *b) | |
596 | { | |
597 | const struct demangled_name_entry *da = a; | |
598 | const struct demangled_name_entry *db = b; | |
433759f7 | 599 | |
04a679b8 TT |
600 | return strcmp (da->mangled, db->mangled) == 0; |
601 | } | |
602 | ||
2de7ced7 DJ |
603 | /* Create the hash table used for demangled names. Each hash entry is |
604 | a pair of strings; one for the mangled name and one for the demangled | |
605 | name. The entry is hashed via just the mangled name. */ | |
606 | ||
607 | static void | |
608 | create_demangled_names_hash (struct objfile *objfile) | |
609 | { | |
610 | /* Choose 256 as the starting size of the hash table, somewhat arbitrarily. | |
9af17804 | 611 | The hash table code will round this up to the next prime number. |
2de7ced7 DJ |
612 | Choosing a much larger table size wastes memory, and saves only about |
613 | 1% in symbol reading. */ | |
614 | ||
84a1243b | 615 | objfile->per_bfd->demangled_names_hash = htab_create_alloc |
04a679b8 | 616 | (256, hash_demangled_name_entry, eq_demangled_name_entry, |
aa2ee5f6 | 617 | NULL, xcalloc, xfree); |
2de7ced7 | 618 | } |
12af6855 | 619 | |
2de7ced7 | 620 | /* Try to determine the demangled name for a symbol, based on the |
12af6855 JB |
621 | language of that symbol. If the language is set to language_auto, |
622 | it will attempt to find any demangling algorithm that works and | |
2de7ced7 DJ |
623 | then set the language appropriately. The returned name is allocated |
624 | by the demangler and should be xfree'd. */ | |
12af6855 | 625 | |
2de7ced7 DJ |
626 | static char * |
627 | symbol_find_demangled_name (struct general_symbol_info *gsymbol, | |
628 | const char *mangled) | |
12af6855 | 629 | { |
12af6855 JB |
630 | char *demangled = NULL; |
631 | ||
632 | if (gsymbol->language == language_unknown) | |
633 | gsymbol->language = language_auto; | |
1bae87b9 AF |
634 | |
635 | if (gsymbol->language == language_objc | |
636 | || gsymbol->language == language_auto) | |
637 | { | |
638 | demangled = | |
639 | objc_demangle (mangled, 0); | |
640 | if (demangled != NULL) | |
641 | { | |
642 | gsymbol->language = language_objc; | |
643 | return demangled; | |
644 | } | |
645 | } | |
12af6855 JB |
646 | if (gsymbol->language == language_cplus |
647 | || gsymbol->language == language_auto) | |
648 | { | |
649 | demangled = | |
8de20a37 | 650 | gdb_demangle (mangled, DMGL_PARAMS | DMGL_ANSI); |
12af6855 | 651 | if (demangled != NULL) |
2de7ced7 DJ |
652 | { |
653 | gsymbol->language = language_cplus; | |
654 | return demangled; | |
655 | } | |
12af6855 JB |
656 | } |
657 | if (gsymbol->language == language_java) | |
658 | { | |
659 | demangled = | |
8de20a37 TT |
660 | gdb_demangle (mangled, |
661 | DMGL_PARAMS | DMGL_ANSI | DMGL_JAVA); | |
12af6855 | 662 | if (demangled != NULL) |
2de7ced7 DJ |
663 | { |
664 | gsymbol->language = language_java; | |
665 | return demangled; | |
666 | } | |
667 | } | |
6aecb9c2 JB |
668 | if (gsymbol->language == language_d |
669 | || gsymbol->language == language_auto) | |
670 | { | |
671 | demangled = d_demangle(mangled, 0); | |
672 | if (demangled != NULL) | |
673 | { | |
674 | gsymbol->language = language_d; | |
675 | return demangled; | |
676 | } | |
677 | } | |
a766d390 DE |
678 | /* FIXME(dje): Continually adding languages here is clumsy. |
679 | Better to just call la_demangle if !auto, and if auto then call | |
680 | a utility routine that tries successive languages in turn and reports | |
681 | which one it finds. I realize the la_demangle options may be different | |
682 | for different languages but there's already a FIXME for that. */ | |
683 | if (gsymbol->language == language_go | |
684 | || gsymbol->language == language_auto) | |
685 | { | |
686 | demangled = go_demangle (mangled, 0); | |
687 | if (demangled != NULL) | |
688 | { | |
689 | gsymbol->language = language_go; | |
690 | return demangled; | |
691 | } | |
692 | } | |
693 | ||
f55ee35c JK |
694 | /* We could support `gsymbol->language == language_fortran' here to provide |
695 | module namespaces also for inferiors with only minimal symbol table (ELF | |
696 | symbols). Just the mangling standard is not standardized across compilers | |
697 | and there is no DW_AT_producer available for inferiors with only the ELF | |
698 | symbols to check the mangling kind. */ | |
036e93df JB |
699 | |
700 | /* Check for Ada symbols last. See comment below explaining why. */ | |
701 | ||
702 | if (gsymbol->language == language_auto) | |
703 | { | |
704 | const char *demangled = ada_decode (mangled); | |
705 | ||
706 | if (demangled != mangled && demangled != NULL && demangled[0] != '<') | |
707 | { | |
708 | /* Set the gsymbol language to Ada, but still return NULL. | |
709 | Two reasons for that: | |
710 | ||
711 | 1. For Ada, we prefer computing the symbol's decoded name | |
712 | on the fly rather than pre-compute it, in order to save | |
713 | memory (Ada projects are typically very large). | |
714 | ||
715 | 2. There are some areas in the definition of the GNAT | |
716 | encoding where, with a bit of bad luck, we might be able | |
717 | to decode a non-Ada symbol, generating an incorrect | |
718 | demangled name (Eg: names ending with "TB" for instance | |
719 | are identified as task bodies and so stripped from | |
720 | the decoded name returned). | |
721 | ||
722 | Returning NULL, here, helps us get a little bit of | |
723 | the best of both worlds. Because we're last, we should | |
724 | not affect any of the other languages that were able to | |
725 | demangle the symbol before us; we get to correctly tag | |
726 | Ada symbols as such; and even if we incorrectly tagged | |
727 | a non-Ada symbol, which should be rare, any routing | |
728 | through the Ada language should be transparent (Ada | |
729 | tries to behave much like C/C++ with non-Ada symbols). */ | |
730 | gsymbol->language = language_ada; | |
731 | return NULL; | |
732 | } | |
733 | } | |
734 | ||
2de7ced7 DJ |
735 | return NULL; |
736 | } | |
737 | ||
980cae7a | 738 | /* Set both the mangled and demangled (if any) names for GSYMBOL based |
04a679b8 TT |
739 | on LINKAGE_NAME and LEN. Ordinarily, NAME is copied onto the |
740 | objfile's obstack; but if COPY_NAME is 0 and if NAME is | |
741 | NUL-terminated, then this function assumes that NAME is already | |
742 | correctly saved (either permanently or with a lifetime tied to the | |
743 | objfile), and it will not be copied. | |
744 | ||
745 | The hash table corresponding to OBJFILE is used, and the memory | |
84a1243b | 746 | comes from the per-BFD storage_obstack. LINKAGE_NAME is copied, |
04a679b8 | 747 | so the pointer can be discarded after calling this function. */ |
2de7ced7 | 748 | |
d2a52b27 DC |
749 | /* We have to be careful when dealing with Java names: when we run |
750 | into a Java minimal symbol, we don't know it's a Java symbol, so it | |
751 | gets demangled as a C++ name. This is unfortunate, but there's not | |
752 | much we can do about it: but when demangling partial symbols and | |
753 | regular symbols, we'd better not reuse the wrong demangled name. | |
754 | (See PR gdb/1039.) We solve this by putting a distinctive prefix | |
755 | on Java names when storing them in the hash table. */ | |
756 | ||
757 | /* FIXME: carlton/2003-03-13: This is an unfortunate situation. I | |
758 | don't mind the Java prefix so much: different languages have | |
759 | different demangling requirements, so it's only natural that we | |
760 | need to keep language data around in our demangling cache. But | |
761 | it's not good that the minimal symbol has the wrong demangled name. | |
762 | Unfortunately, I can't think of any easy solution to that | |
763 | problem. */ | |
764 | ||
765 | #define JAVA_PREFIX "##JAVA$$" | |
766 | #define JAVA_PREFIX_LEN 8 | |
767 | ||
2de7ced7 DJ |
768 | void |
769 | symbol_set_names (struct general_symbol_info *gsymbol, | |
04a679b8 TT |
770 | const char *linkage_name, int len, int copy_name, |
771 | struct objfile *objfile) | |
2de7ced7 | 772 | { |
04a679b8 | 773 | struct demangled_name_entry **slot; |
980cae7a DC |
774 | /* A 0-terminated copy of the linkage name. */ |
775 | const char *linkage_name_copy; | |
d2a52b27 DC |
776 | /* A copy of the linkage name that might have a special Java prefix |
777 | added to it, for use when looking names up in the hash table. */ | |
778 | const char *lookup_name; | |
779 | /* The length of lookup_name. */ | |
780 | int lookup_len; | |
04a679b8 | 781 | struct demangled_name_entry entry; |
84a1243b | 782 | struct objfile_per_bfd_storage *per_bfd = objfile->per_bfd; |
2de7ced7 | 783 | |
b06ead72 JB |
784 | if (gsymbol->language == language_ada) |
785 | { | |
786 | /* In Ada, we do the symbol lookups using the mangled name, so | |
787 | we can save some space by not storing the demangled name. | |
788 | ||
789 | As a side note, we have also observed some overlap between | |
790 | the C++ mangling and Ada mangling, similarly to what has | |
791 | been observed with Java. Because we don't store the demangled | |
792 | name with the symbol, we don't need to use the same trick | |
793 | as Java. */ | |
04a679b8 | 794 | if (!copy_name) |
0d5cff50 | 795 | gsymbol->name = linkage_name; |
04a679b8 TT |
796 | else |
797 | { | |
84a1243b | 798 | char *name = obstack_alloc (&per_bfd->storage_obstack, len + 1); |
0d5cff50 DE |
799 | |
800 | memcpy (name, linkage_name, len); | |
801 | name[len] = '\0'; | |
802 | gsymbol->name = name; | |
04a679b8 | 803 | } |
84a1243b | 804 | symbol_set_demangled_name (gsymbol, NULL, &per_bfd->storage_obstack); |
b06ead72 JB |
805 | |
806 | return; | |
807 | } | |
808 | ||
84a1243b | 809 | if (per_bfd->demangled_names_hash == NULL) |
04a679b8 TT |
810 | create_demangled_names_hash (objfile); |
811 | ||
980cae7a DC |
812 | /* The stabs reader generally provides names that are not |
813 | NUL-terminated; most of the other readers don't do this, so we | |
d2a52b27 DC |
814 | can just use the given copy, unless we're in the Java case. */ |
815 | if (gsymbol->language == language_java) | |
816 | { | |
817 | char *alloc_name; | |
d2a52b27 | 818 | |
433759f7 | 819 | lookup_len = len + JAVA_PREFIX_LEN; |
d2a52b27 DC |
820 | alloc_name = alloca (lookup_len + 1); |
821 | memcpy (alloc_name, JAVA_PREFIX, JAVA_PREFIX_LEN); | |
822 | memcpy (alloc_name + JAVA_PREFIX_LEN, linkage_name, len); | |
823 | alloc_name[lookup_len] = '\0'; | |
824 | ||
825 | lookup_name = alloc_name; | |
826 | linkage_name_copy = alloc_name + JAVA_PREFIX_LEN; | |
827 | } | |
828 | else if (linkage_name[len] != '\0') | |
2de7ced7 | 829 | { |
980cae7a DC |
830 | char *alloc_name; |
831 | ||
433759f7 | 832 | lookup_len = len; |
d2a52b27 | 833 | alloc_name = alloca (lookup_len + 1); |
980cae7a | 834 | memcpy (alloc_name, linkage_name, len); |
d2a52b27 | 835 | alloc_name[lookup_len] = '\0'; |
980cae7a | 836 | |
d2a52b27 | 837 | lookup_name = alloc_name; |
980cae7a | 838 | linkage_name_copy = alloc_name; |
2de7ced7 DJ |
839 | } |
840 | else | |
980cae7a | 841 | { |
d2a52b27 DC |
842 | lookup_len = len; |
843 | lookup_name = linkage_name; | |
980cae7a DC |
844 | linkage_name_copy = linkage_name; |
845 | } | |
2de7ced7 | 846 | |
9d2ceabe | 847 | entry.mangled = lookup_name; |
04a679b8 | 848 | slot = ((struct demangled_name_entry **) |
84a1243b | 849 | htab_find_slot (per_bfd->demangled_names_hash, |
04a679b8 | 850 | &entry, INSERT)); |
2de7ced7 DJ |
851 | |
852 | /* If this name is not in the hash table, add it. */ | |
a766d390 DE |
853 | if (*slot == NULL |
854 | /* A C version of the symbol may have already snuck into the table. | |
855 | This happens to, e.g., main.init (__go_init_main). Cope. */ | |
856 | || (gsymbol->language == language_go | |
857 | && (*slot)->demangled[0] == '\0')) | |
2de7ced7 | 858 | { |
980cae7a DC |
859 | char *demangled_name = symbol_find_demangled_name (gsymbol, |
860 | linkage_name_copy); | |
2de7ced7 DJ |
861 | int demangled_len = demangled_name ? strlen (demangled_name) : 0; |
862 | ||
04a679b8 TT |
863 | /* Suppose we have demangled_name==NULL, copy_name==0, and |
864 | lookup_name==linkage_name. In this case, we already have the | |
865 | mangled name saved, and we don't have a demangled name. So, | |
866 | you might think we could save a little space by not recording | |
867 | this in the hash table at all. | |
868 | ||
869 | It turns out that it is actually important to still save such | |
870 | an entry in the hash table, because storing this name gives | |
705b5767 | 871 | us better bcache hit rates for partial symbols. */ |
04a679b8 TT |
872 | if (!copy_name && lookup_name == linkage_name) |
873 | { | |
84a1243b | 874 | *slot = obstack_alloc (&per_bfd->storage_obstack, |
04a679b8 TT |
875 | offsetof (struct demangled_name_entry, |
876 | demangled) | |
877 | + demangled_len + 1); | |
9d2ceabe | 878 | (*slot)->mangled = lookup_name; |
04a679b8 TT |
879 | } |
880 | else | |
881 | { | |
9d2ceabe TT |
882 | char *mangled_ptr; |
883 | ||
04a679b8 TT |
884 | /* If we must copy the mangled name, put it directly after |
885 | the demangled name so we can have a single | |
886 | allocation. */ | |
84a1243b | 887 | *slot = obstack_alloc (&per_bfd->storage_obstack, |
04a679b8 TT |
888 | offsetof (struct demangled_name_entry, |
889 | demangled) | |
890 | + lookup_len + demangled_len + 2); | |
9d2ceabe TT |
891 | mangled_ptr = &((*slot)->demangled[demangled_len + 1]); |
892 | strcpy (mangled_ptr, lookup_name); | |
893 | (*slot)->mangled = mangled_ptr; | |
04a679b8 TT |
894 | } |
895 | ||
980cae7a | 896 | if (demangled_name != NULL) |
2de7ced7 | 897 | { |
04a679b8 | 898 | strcpy ((*slot)->demangled, demangled_name); |
2de7ced7 DJ |
899 | xfree (demangled_name); |
900 | } | |
901 | else | |
04a679b8 | 902 | (*slot)->demangled[0] = '\0'; |
2de7ced7 DJ |
903 | } |
904 | ||
72dcaf82 | 905 | gsymbol->name = (*slot)->mangled + lookup_len - len; |
04a679b8 | 906 | if ((*slot)->demangled[0] != '\0') |
ccde22c0 | 907 | symbol_set_demangled_name (gsymbol, (*slot)->demangled, |
84a1243b | 908 | &per_bfd->storage_obstack); |
2de7ced7 | 909 | else |
84a1243b | 910 | symbol_set_demangled_name (gsymbol, NULL, &per_bfd->storage_obstack); |
2de7ced7 DJ |
911 | } |
912 | ||
22abf04a DC |
913 | /* Return the source code name of a symbol. In languages where |
914 | demangling is necessary, this is the demangled name. */ | |
915 | ||
0d5cff50 | 916 | const char * |
22abf04a DC |
917 | symbol_natural_name (const struct general_symbol_info *gsymbol) |
918 | { | |
9af17804 | 919 | switch (gsymbol->language) |
22abf04a | 920 | { |
1f8173e6 | 921 | case language_cplus: |
6aecb9c2 | 922 | case language_d: |
a766d390 | 923 | case language_go: |
1f8173e6 PH |
924 | case language_java: |
925 | case language_objc: | |
f55ee35c | 926 | case language_fortran: |
b250c185 SW |
927 | if (symbol_get_demangled_name (gsymbol) != NULL) |
928 | return symbol_get_demangled_name (gsymbol); | |
1f8173e6 PH |
929 | break; |
930 | case language_ada: | |
f85f34ed | 931 | return ada_decode_symbol (gsymbol); |
1f8173e6 PH |
932 | default: |
933 | break; | |
22abf04a | 934 | } |
1f8173e6 | 935 | return gsymbol->name; |
22abf04a DC |
936 | } |
937 | ||
9cc0d196 | 938 | /* Return the demangled name for a symbol based on the language for |
c378eb4e | 939 | that symbol. If no demangled name exists, return NULL. */ |
eca864fe | 940 | |
0d5cff50 | 941 | const char * |
df8a16a1 | 942 | symbol_demangled_name (const struct general_symbol_info *gsymbol) |
9cc0d196 | 943 | { |
c6e5ee5e SDJ |
944 | const char *dem_name = NULL; |
945 | ||
9af17804 | 946 | switch (gsymbol->language) |
1f8173e6 PH |
947 | { |
948 | case language_cplus: | |
6aecb9c2 | 949 | case language_d: |
a766d390 | 950 | case language_go: |
1f8173e6 PH |
951 | case language_java: |
952 | case language_objc: | |
f55ee35c | 953 | case language_fortran: |
c6e5ee5e | 954 | dem_name = symbol_get_demangled_name (gsymbol); |
1f8173e6 PH |
955 | break; |
956 | case language_ada: | |
f85f34ed | 957 | dem_name = ada_decode_symbol (gsymbol); |
1f8173e6 PH |
958 | break; |
959 | default: | |
960 | break; | |
961 | } | |
c6e5ee5e | 962 | return dem_name; |
9cc0d196 | 963 | } |
fe39c653 | 964 | |
4725b721 PH |
965 | /* Return the search name of a symbol---generally the demangled or |
966 | linkage name of the symbol, depending on how it will be searched for. | |
9af17804 | 967 | If there is no distinct demangled name, then returns the same value |
c378eb4e | 968 | (same pointer) as SYMBOL_LINKAGE_NAME. */ |
eca864fe | 969 | |
0d5cff50 | 970 | const char * |
fc062ac6 JB |
971 | symbol_search_name (const struct general_symbol_info *gsymbol) |
972 | { | |
1f8173e6 PH |
973 | if (gsymbol->language == language_ada) |
974 | return gsymbol->name; | |
975 | else | |
976 | return symbol_natural_name (gsymbol); | |
4725b721 PH |
977 | } |
978 | ||
fe39c653 | 979 | /* Initialize the structure fields to zero values. */ |
eca864fe | 980 | |
fe39c653 EZ |
981 | void |
982 | init_sal (struct symtab_and_line *sal) | |
983 | { | |
729662a5 | 984 | memset (sal, 0, sizeof (*sal)); |
fe39c653 | 985 | } |
c906108c SS |
986 | \f |
987 | ||
94277a38 DJ |
988 | /* Return 1 if the two sections are the same, or if they could |
989 | plausibly be copies of each other, one in an original object | |
990 | file and another in a separated debug file. */ | |
991 | ||
992 | int | |
714835d5 UW |
993 | matching_obj_sections (struct obj_section *obj_first, |
994 | struct obj_section *obj_second) | |
94277a38 | 995 | { |
714835d5 UW |
996 | asection *first = obj_first? obj_first->the_bfd_section : NULL; |
997 | asection *second = obj_second? obj_second->the_bfd_section : NULL; | |
94277a38 DJ |
998 | struct objfile *obj; |
999 | ||
1000 | /* If they're the same section, then they match. */ | |
1001 | if (first == second) | |
1002 | return 1; | |
1003 | ||
1004 | /* If either is NULL, give up. */ | |
1005 | if (first == NULL || second == NULL) | |
1006 | return 0; | |
1007 | ||
1008 | /* This doesn't apply to absolute symbols. */ | |
1009 | if (first->owner == NULL || second->owner == NULL) | |
1010 | return 0; | |
1011 | ||
1012 | /* If they're in the same object file, they must be different sections. */ | |
1013 | if (first->owner == second->owner) | |
1014 | return 0; | |
1015 | ||
1016 | /* Check whether the two sections are potentially corresponding. They must | |
1017 | have the same size, address, and name. We can't compare section indexes, | |
1018 | which would be more reliable, because some sections may have been | |
1019 | stripped. */ | |
1020 | if (bfd_get_section_size (first) != bfd_get_section_size (second)) | |
1021 | return 0; | |
1022 | ||
818f79f6 | 1023 | /* In-memory addresses may start at a different offset, relativize them. */ |
94277a38 | 1024 | if (bfd_get_section_vma (first->owner, first) |
818f79f6 DJ |
1025 | - bfd_get_start_address (first->owner) |
1026 | != bfd_get_section_vma (second->owner, second) | |
1027 | - bfd_get_start_address (second->owner)) | |
94277a38 DJ |
1028 | return 0; |
1029 | ||
1030 | if (bfd_get_section_name (first->owner, first) == NULL | |
1031 | || bfd_get_section_name (second->owner, second) == NULL | |
1032 | || strcmp (bfd_get_section_name (first->owner, first), | |
1033 | bfd_get_section_name (second->owner, second)) != 0) | |
1034 | return 0; | |
1035 | ||
1036 | /* Otherwise check that they are in corresponding objfiles. */ | |
1037 | ||
1038 | ALL_OBJFILES (obj) | |
1039 | if (obj->obfd == first->owner) | |
1040 | break; | |
1041 | gdb_assert (obj != NULL); | |
1042 | ||
1043 | if (obj->separate_debug_objfile != NULL | |
1044 | && obj->separate_debug_objfile->obfd == second->owner) | |
1045 | return 1; | |
1046 | if (obj->separate_debug_objfile_backlink != NULL | |
1047 | && obj->separate_debug_objfile_backlink->obfd == second->owner) | |
1048 | return 1; | |
1049 | ||
1050 | return 0; | |
1051 | } | |
c5aa993b | 1052 | |
ccefe4c4 TT |
1053 | struct symtab * |
1054 | find_pc_sect_symtab_via_partial (CORE_ADDR pc, struct obj_section *section) | |
c906108c | 1055 | { |
52f0bd74 | 1056 | struct objfile *objfile; |
77e371c0 | 1057 | struct bound_minimal_symbol msymbol; |
8a48e967 DJ |
1058 | |
1059 | /* If we know that this is not a text address, return failure. This is | |
1060 | necessary because we loop based on texthigh and textlow, which do | |
1061 | not include the data ranges. */ | |
77e371c0 TT |
1062 | msymbol = lookup_minimal_symbol_by_pc_section (pc, section); |
1063 | if (msymbol.minsym | |
1064 | && (MSYMBOL_TYPE (msymbol.minsym) == mst_data | |
1065 | || MSYMBOL_TYPE (msymbol.minsym) == mst_bss | |
1066 | || MSYMBOL_TYPE (msymbol.minsym) == mst_abs | |
1067 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_data | |
1068 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_bss)) | |
8a48e967 | 1069 | return NULL; |
c906108c | 1070 | |
ff013f42 | 1071 | ALL_OBJFILES (objfile) |
ccefe4c4 TT |
1072 | { |
1073 | struct symtab *result = NULL; | |
433759f7 | 1074 | |
ccefe4c4 TT |
1075 | if (objfile->sf) |
1076 | result = objfile->sf->qf->find_pc_sect_symtab (objfile, msymbol, | |
1077 | pc, section, 0); | |
1078 | if (result) | |
1079 | return result; | |
1080 | } | |
ff013f42 JK |
1081 | |
1082 | return NULL; | |
c906108c | 1083 | } |
c906108c SS |
1084 | \f |
1085 | /* Debug symbols usually don't have section information. We need to dig that | |
1086 | out of the minimal symbols and stash that in the debug symbol. */ | |
1087 | ||
ccefe4c4 | 1088 | void |
907fc202 UW |
1089 | fixup_section (struct general_symbol_info *ginfo, |
1090 | CORE_ADDR addr, struct objfile *objfile) | |
c906108c SS |
1091 | { |
1092 | struct minimal_symbol *msym; | |
c906108c | 1093 | |
bccdca4a UW |
1094 | /* First, check whether a minimal symbol with the same name exists |
1095 | and points to the same address. The address check is required | |
1096 | e.g. on PowerPC64, where the minimal symbol for a function will | |
1097 | point to the function descriptor, while the debug symbol will | |
1098 | point to the actual function code. */ | |
907fc202 UW |
1099 | msym = lookup_minimal_symbol_by_pc_name (addr, ginfo->name, objfile); |
1100 | if (msym) | |
efd66ac6 | 1101 | ginfo->section = MSYMBOL_SECTION (msym); |
907fc202 | 1102 | else |
19e2d14b KB |
1103 | { |
1104 | /* Static, function-local variables do appear in the linker | |
1105 | (minimal) symbols, but are frequently given names that won't | |
1106 | be found via lookup_minimal_symbol(). E.g., it has been | |
1107 | observed in frv-uclinux (ELF) executables that a static, | |
1108 | function-local variable named "foo" might appear in the | |
1109 | linker symbols as "foo.6" or "foo.3". Thus, there is no | |
1110 | point in attempting to extend the lookup-by-name mechanism to | |
1111 | handle this case due to the fact that there can be multiple | |
1112 | names. | |
9af17804 | 1113 | |
19e2d14b KB |
1114 | So, instead, search the section table when lookup by name has |
1115 | failed. The ``addr'' and ``endaddr'' fields may have already | |
1116 | been relocated. If so, the relocation offset (i.e. the | |
1117 | ANOFFSET value) needs to be subtracted from these values when | |
1118 | performing the comparison. We unconditionally subtract it, | |
1119 | because, when no relocation has been performed, the ANOFFSET | |
1120 | value will simply be zero. | |
9af17804 | 1121 | |
19e2d14b KB |
1122 | The address of the symbol whose section we're fixing up HAS |
1123 | NOT BEEN adjusted (relocated) yet. It can't have been since | |
1124 | the section isn't yet known and knowing the section is | |
1125 | necessary in order to add the correct relocation value. In | |
1126 | other words, we wouldn't even be in this function (attempting | |
1127 | to compute the section) if it were already known. | |
1128 | ||
1129 | Note that it is possible to search the minimal symbols | |
1130 | (subtracting the relocation value if necessary) to find the | |
1131 | matching minimal symbol, but this is overkill and much less | |
1132 | efficient. It is not necessary to find the matching minimal | |
9af17804 DE |
1133 | symbol, only its section. |
1134 | ||
19e2d14b KB |
1135 | Note that this technique (of doing a section table search) |
1136 | can fail when unrelocated section addresses overlap. For | |
1137 | this reason, we still attempt a lookup by name prior to doing | |
1138 | a search of the section table. */ | |
9af17804 | 1139 | |
19e2d14b | 1140 | struct obj_section *s; |
e27d198c | 1141 | int fallback = -1; |
433759f7 | 1142 | |
19e2d14b KB |
1143 | ALL_OBJFILE_OSECTIONS (objfile, s) |
1144 | { | |
65cf3563 | 1145 | int idx = s - objfile->sections; |
19e2d14b KB |
1146 | CORE_ADDR offset = ANOFFSET (objfile->section_offsets, idx); |
1147 | ||
e27d198c TT |
1148 | if (fallback == -1) |
1149 | fallback = idx; | |
1150 | ||
f1f6aadf PA |
1151 | if (obj_section_addr (s) - offset <= addr |
1152 | && addr < obj_section_endaddr (s) - offset) | |
19e2d14b | 1153 | { |
19e2d14b KB |
1154 | ginfo->section = idx; |
1155 | return; | |
1156 | } | |
1157 | } | |
e27d198c TT |
1158 | |
1159 | /* If we didn't find the section, assume it is in the first | |
1160 | section. If there is no allocated section, then it hardly | |
1161 | matters what we pick, so just pick zero. */ | |
1162 | if (fallback == -1) | |
1163 | ginfo->section = 0; | |
1164 | else | |
1165 | ginfo->section = fallback; | |
19e2d14b | 1166 | } |
c906108c SS |
1167 | } |
1168 | ||
1169 | struct symbol * | |
fba45db2 | 1170 | fixup_symbol_section (struct symbol *sym, struct objfile *objfile) |
c906108c | 1171 | { |
907fc202 UW |
1172 | CORE_ADDR addr; |
1173 | ||
c906108c SS |
1174 | if (!sym) |
1175 | return NULL; | |
1176 | ||
907fc202 UW |
1177 | /* We either have an OBJFILE, or we can get at it from the sym's |
1178 | symtab. Anything else is a bug. */ | |
1179 | gdb_assert (objfile || SYMBOL_SYMTAB (sym)); | |
1180 | ||
1181 | if (objfile == NULL) | |
1182 | objfile = SYMBOL_SYMTAB (sym)->objfile; | |
1183 | ||
e27d198c TT |
1184 | if (SYMBOL_OBJ_SECTION (objfile, sym)) |
1185 | return sym; | |
1186 | ||
907fc202 UW |
1187 | /* We should have an objfile by now. */ |
1188 | gdb_assert (objfile); | |
1189 | ||
1190 | switch (SYMBOL_CLASS (sym)) | |
1191 | { | |
1192 | case LOC_STATIC: | |
1193 | case LOC_LABEL: | |
907fc202 UW |
1194 | addr = SYMBOL_VALUE_ADDRESS (sym); |
1195 | break; | |
1196 | case LOC_BLOCK: | |
1197 | addr = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
1198 | break; | |
1199 | ||
1200 | default: | |
1201 | /* Nothing else will be listed in the minsyms -- no use looking | |
1202 | it up. */ | |
1203 | return sym; | |
1204 | } | |
1205 | ||
1206 | fixup_section (&sym->ginfo, addr, objfile); | |
c906108c SS |
1207 | |
1208 | return sym; | |
1209 | } | |
1210 | ||
f8eba3c6 TT |
1211 | /* Compute the demangled form of NAME as used by the various symbol |
1212 | lookup functions. The result is stored in *RESULT_NAME. Returns a | |
1213 | cleanup which can be used to clean up the result. | |
1214 | ||
1215 | For Ada, this function just sets *RESULT_NAME to NAME, unmodified. | |
1216 | Normally, Ada symbol lookups are performed using the encoded name | |
1217 | rather than the demangled name, and so it might seem to make sense | |
1218 | for this function to return an encoded version of NAME. | |
1219 | Unfortunately, we cannot do this, because this function is used in | |
1220 | circumstances where it is not appropriate to try to encode NAME. | |
1221 | For instance, when displaying the frame info, we demangle the name | |
1222 | of each parameter, and then perform a symbol lookup inside our | |
1223 | function using that demangled name. In Ada, certain functions | |
1224 | have internally-generated parameters whose name contain uppercase | |
1225 | characters. Encoding those name would result in those uppercase | |
1226 | characters to become lowercase, and thus cause the symbol lookup | |
1227 | to fail. */ | |
c906108c | 1228 | |
f8eba3c6 TT |
1229 | struct cleanup * |
1230 | demangle_for_lookup (const char *name, enum language lang, | |
1231 | const char **result_name) | |
c906108c | 1232 | { |
729051e6 DJ |
1233 | char *demangled_name = NULL; |
1234 | const char *modified_name = NULL; | |
9ee6bb93 | 1235 | struct cleanup *cleanup = make_cleanup (null_cleanup, 0); |
c906108c | 1236 | |
729051e6 DJ |
1237 | modified_name = name; |
1238 | ||
a766d390 | 1239 | /* If we are using C++, D, Go, or Java, demangle the name before doing a |
c378eb4e | 1240 | lookup, so we can always binary search. */ |
53c5240f | 1241 | if (lang == language_cplus) |
729051e6 | 1242 | { |
8de20a37 | 1243 | demangled_name = gdb_demangle (name, DMGL_ANSI | DMGL_PARAMS); |
729051e6 DJ |
1244 | if (demangled_name) |
1245 | { | |
729051e6 | 1246 | modified_name = demangled_name; |
9ee6bb93 | 1247 | make_cleanup (xfree, demangled_name); |
729051e6 | 1248 | } |
71c25dea TT |
1249 | else |
1250 | { | |
1251 | /* If we were given a non-mangled name, canonicalize it | |
1252 | according to the language (so far only for C++). */ | |
1253 | demangled_name = cp_canonicalize_string (name); | |
1254 | if (demangled_name) | |
1255 | { | |
1256 | modified_name = demangled_name; | |
1257 | make_cleanup (xfree, demangled_name); | |
1258 | } | |
1259 | } | |
729051e6 | 1260 | } |
53c5240f | 1261 | else if (lang == language_java) |
987504bb | 1262 | { |
8de20a37 TT |
1263 | demangled_name = gdb_demangle (name, |
1264 | DMGL_ANSI | DMGL_PARAMS | DMGL_JAVA); | |
987504bb JJ |
1265 | if (demangled_name) |
1266 | { | |
987504bb | 1267 | modified_name = demangled_name; |
9ee6bb93 | 1268 | make_cleanup (xfree, demangled_name); |
987504bb JJ |
1269 | } |
1270 | } | |
6aecb9c2 JB |
1271 | else if (lang == language_d) |
1272 | { | |
1273 | demangled_name = d_demangle (name, 0); | |
1274 | if (demangled_name) | |
1275 | { | |
1276 | modified_name = demangled_name; | |
1277 | make_cleanup (xfree, demangled_name); | |
1278 | } | |
1279 | } | |
a766d390 DE |
1280 | else if (lang == language_go) |
1281 | { | |
1282 | demangled_name = go_demangle (name, 0); | |
1283 | if (demangled_name) | |
1284 | { | |
1285 | modified_name = demangled_name; | |
1286 | make_cleanup (xfree, demangled_name); | |
1287 | } | |
1288 | } | |
729051e6 | 1289 | |
f8eba3c6 TT |
1290 | *result_name = modified_name; |
1291 | return cleanup; | |
1292 | } | |
1293 | ||
cf901d3b | 1294 | /* See symtab.h. |
f8eba3c6 | 1295 | |
cf901d3b | 1296 | This function (or rather its subordinates) have a bunch of loops and |
7e082072 DE |
1297 | it would seem to be attractive to put in some QUIT's (though I'm not really |
1298 | sure whether it can run long enough to be really important). But there | |
f8eba3c6 | 1299 | are a few calls for which it would appear to be bad news to quit |
7e082072 | 1300 | out of here: e.g., find_proc_desc in alpha-mdebug-tdep.c. (Note |
f8eba3c6 TT |
1301 | that there is C++ code below which can error(), but that probably |
1302 | doesn't affect these calls since they are looking for a known | |
1303 | variable and thus can probably assume it will never hit the C++ | |
1304 | code). */ | |
1305 | ||
1306 | struct symbol * | |
1307 | lookup_symbol_in_language (const char *name, const struct block *block, | |
1308 | const domain_enum domain, enum language lang, | |
1993b719 | 1309 | struct field_of_this_result *is_a_field_of_this) |
f8eba3c6 TT |
1310 | { |
1311 | const char *modified_name; | |
1312 | struct symbol *returnval; | |
1313 | struct cleanup *cleanup = demangle_for_lookup (name, lang, &modified_name); | |
1314 | ||
94af9270 | 1315 | returnval = lookup_symbol_aux (modified_name, block, domain, lang, |
774b6a14 | 1316 | is_a_field_of_this); |
9ee6bb93 | 1317 | do_cleanups (cleanup); |
fba7f19c | 1318 | |
9af17804 | 1319 | return returnval; |
fba7f19c EZ |
1320 | } |
1321 | ||
cf901d3b | 1322 | /* See symtab.h. */ |
53c5240f PA |
1323 | |
1324 | struct symbol * | |
1325 | lookup_symbol (const char *name, const struct block *block, | |
1993b719 TT |
1326 | domain_enum domain, |
1327 | struct field_of_this_result *is_a_field_of_this) | |
53c5240f PA |
1328 | { |
1329 | return lookup_symbol_in_language (name, block, domain, | |
1330 | current_language->la_language, | |
2570f2b7 | 1331 | is_a_field_of_this); |
53c5240f PA |
1332 | } |
1333 | ||
cf901d3b | 1334 | /* See symtab.h. */ |
66a17cb6 TT |
1335 | |
1336 | struct symbol * | |
1337 | lookup_language_this (const struct language_defn *lang, | |
1338 | const struct block *block) | |
1339 | { | |
1340 | if (lang->la_name_of_this == NULL || block == NULL) | |
1341 | return NULL; | |
1342 | ||
03de6823 | 1343 | while (block) |
66a17cb6 TT |
1344 | { |
1345 | struct symbol *sym; | |
1346 | ||
16b2eaa1 | 1347 | sym = block_lookup_symbol (block, lang->la_name_of_this, VAR_DOMAIN); |
66a17cb6 | 1348 | if (sym != NULL) |
f149aabd TT |
1349 | { |
1350 | block_found = block; | |
1351 | return sym; | |
1352 | } | |
66a17cb6 | 1353 | if (BLOCK_FUNCTION (block)) |
03de6823 | 1354 | break; |
66a17cb6 TT |
1355 | block = BLOCK_SUPERBLOCK (block); |
1356 | } | |
03de6823 TT |
1357 | |
1358 | return NULL; | |
66a17cb6 TT |
1359 | } |
1360 | ||
2dc3df72 TT |
1361 | /* Given TYPE, a structure/union, |
1362 | return 1 if the component named NAME from the ultimate target | |
1363 | structure/union is defined, otherwise, return 0. */ | |
1364 | ||
1365 | static int | |
1993b719 TT |
1366 | check_field (struct type *type, const char *name, |
1367 | struct field_of_this_result *is_a_field_of_this) | |
2dc3df72 TT |
1368 | { |
1369 | int i; | |
1370 | ||
1371 | /* The type may be a stub. */ | |
1372 | CHECK_TYPEDEF (type); | |
1373 | ||
1374 | for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--) | |
1375 | { | |
1376 | const char *t_field_name = TYPE_FIELD_NAME (type, i); | |
1377 | ||
1378 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) | |
1993b719 TT |
1379 | { |
1380 | is_a_field_of_this->type = type; | |
1381 | is_a_field_of_this->field = &TYPE_FIELD (type, i); | |
1382 | return 1; | |
1383 | } | |
2dc3df72 TT |
1384 | } |
1385 | ||
1386 | /* C++: If it was not found as a data field, then try to return it | |
1387 | as a pointer to a method. */ | |
1388 | ||
1389 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i) | |
1390 | { | |
1391 | if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0) | |
1993b719 TT |
1392 | { |
1393 | is_a_field_of_this->type = type; | |
1394 | is_a_field_of_this->fn_field = &TYPE_FN_FIELDLIST (type, i); | |
1395 | return 1; | |
1396 | } | |
2dc3df72 TT |
1397 | } |
1398 | ||
1399 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
1993b719 | 1400 | if (check_field (TYPE_BASECLASS (type, i), name, is_a_field_of_this)) |
2dc3df72 TT |
1401 | return 1; |
1402 | ||
1403 | return 0; | |
1404 | } | |
1405 | ||
53c5240f | 1406 | /* Behave like lookup_symbol except that NAME is the natural name |
7e082072 | 1407 | (e.g., demangled name) of the symbol that we're looking for. */ |
5ad1c190 | 1408 | |
fba7f19c | 1409 | static struct symbol * |
94af9270 KS |
1410 | lookup_symbol_aux (const char *name, const struct block *block, |
1411 | const domain_enum domain, enum language language, | |
1993b719 | 1412 | struct field_of_this_result *is_a_field_of_this) |
fba7f19c | 1413 | { |
8155455b | 1414 | struct symbol *sym; |
53c5240f | 1415 | const struct language_defn *langdef; |
406bc4de | 1416 | |
9a146a11 EZ |
1417 | /* Make sure we do something sensible with is_a_field_of_this, since |
1418 | the callers that set this parameter to some non-null value will | |
1993b719 TT |
1419 | certainly use it later. If we don't set it, the contents of |
1420 | is_a_field_of_this are undefined. */ | |
9a146a11 | 1421 | if (is_a_field_of_this != NULL) |
1993b719 | 1422 | memset (is_a_field_of_this, 0, sizeof (*is_a_field_of_this)); |
9a146a11 | 1423 | |
e4051eeb DC |
1424 | /* Search specified block and its superiors. Don't search |
1425 | STATIC_BLOCK or GLOBAL_BLOCK. */ | |
c906108c | 1426 | |
74016e12 | 1427 | sym = lookup_local_symbol (name, block, domain, language); |
8155455b DC |
1428 | if (sym != NULL) |
1429 | return sym; | |
c906108c | 1430 | |
53c5240f | 1431 | /* If requested to do so by the caller and if appropriate for LANGUAGE, |
13387711 | 1432 | check to see if NAME is a field of `this'. */ |
53c5240f PA |
1433 | |
1434 | langdef = language_def (language); | |
5f9a71c3 | 1435 | |
6592e36f TT |
1436 | /* Don't do this check if we are searching for a struct. It will |
1437 | not be found by check_field, but will be found by other | |
1438 | means. */ | |
1439 | if (is_a_field_of_this != NULL && domain != STRUCT_DOMAIN) | |
c906108c | 1440 | { |
66a17cb6 | 1441 | struct symbol *sym = lookup_language_this (langdef, block); |
2b2d9e11 | 1442 | |
2b2d9e11 | 1443 | if (sym) |
c906108c | 1444 | { |
2b2d9e11 | 1445 | struct type *t = sym->type; |
9af17804 | 1446 | |
2b2d9e11 VP |
1447 | /* I'm not really sure that type of this can ever |
1448 | be typedefed; just be safe. */ | |
1449 | CHECK_TYPEDEF (t); | |
1450 | if (TYPE_CODE (t) == TYPE_CODE_PTR | |
1451 | || TYPE_CODE (t) == TYPE_CODE_REF) | |
1452 | t = TYPE_TARGET_TYPE (t); | |
9af17804 | 1453 | |
2b2d9e11 VP |
1454 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
1455 | && TYPE_CODE (t) != TYPE_CODE_UNION) | |
9af17804 | 1456 | error (_("Internal error: `%s' is not an aggregate"), |
2b2d9e11 | 1457 | langdef->la_name_of_this); |
9af17804 | 1458 | |
1993b719 TT |
1459 | if (check_field (t, name, is_a_field_of_this)) |
1460 | return NULL; | |
c906108c SS |
1461 | } |
1462 | } | |
1463 | ||
53c5240f | 1464 | /* Now do whatever is appropriate for LANGUAGE to look |
774b6a14 | 1465 | up static and global variables. */ |
c906108c | 1466 | |
774b6a14 TT |
1467 | sym = langdef->la_lookup_symbol_nonlocal (name, block, domain); |
1468 | if (sym != NULL) | |
1469 | return sym; | |
c906108c | 1470 | |
774b6a14 TT |
1471 | /* Now search all static file-level symbols. Not strictly correct, |
1472 | but more useful than an error. */ | |
41f62f39 | 1473 | |
24d864bb | 1474 | return lookup_static_symbol (name, domain); |
41f62f39 JK |
1475 | } |
1476 | ||
cf901d3b | 1477 | /* See symtab.h. */ |
41f62f39 JK |
1478 | |
1479 | struct symbol * | |
24d864bb | 1480 | lookup_static_symbol (const char *name, const domain_enum domain) |
41f62f39 JK |
1481 | { |
1482 | struct objfile *objfile; | |
1483 | struct symbol *sym; | |
c906108c | 1484 | |
74016e12 | 1485 | sym = lookup_symbol_in_all_objfiles (STATIC_BLOCK, name, domain); |
8155455b DC |
1486 | if (sym != NULL) |
1487 | return sym; | |
9af17804 | 1488 | |
ccefe4c4 TT |
1489 | ALL_OBJFILES (objfile) |
1490 | { | |
74016e12 | 1491 | sym = lookup_symbol_via_quick_fns (objfile, STATIC_BLOCK, name, domain); |
ccefe4c4 TT |
1492 | if (sym != NULL) |
1493 | return sym; | |
1494 | } | |
c906108c | 1495 | |
8155455b | 1496 | return NULL; |
c906108c | 1497 | } |
8155455b | 1498 | |
e4051eeb | 1499 | /* Check to see if the symbol is defined in BLOCK or its superiors. |
89a9d1b1 | 1500 | Don't search STATIC_BLOCK or GLOBAL_BLOCK. */ |
8155455b DC |
1501 | |
1502 | static struct symbol * | |
74016e12 DE |
1503 | lookup_local_symbol (const char *name, const struct block *block, |
1504 | const domain_enum domain, | |
1505 | enum language language) | |
8155455b DC |
1506 | { |
1507 | struct symbol *sym; | |
89a9d1b1 | 1508 | const struct block *static_block = block_static_block (block); |
13387711 SW |
1509 | const char *scope = block_scope (block); |
1510 | ||
e4051eeb DC |
1511 | /* Check if either no block is specified or it's a global block. */ |
1512 | ||
89a9d1b1 DC |
1513 | if (static_block == NULL) |
1514 | return NULL; | |
e4051eeb | 1515 | |
89a9d1b1 | 1516 | while (block != static_block) |
f61e8913 | 1517 | { |
d1a2d36d | 1518 | sym = lookup_symbol_in_block (name, block, domain); |
f61e8913 DC |
1519 | if (sym != NULL) |
1520 | return sym; | |
edb3359d | 1521 | |
f55ee35c | 1522 | if (language == language_cplus || language == language_fortran) |
13387711 | 1523 | { |
34eaf542 TT |
1524 | sym = cp_lookup_symbol_imports_or_template (scope, name, block, |
1525 | domain); | |
13387711 SW |
1526 | if (sym != NULL) |
1527 | return sym; | |
1528 | } | |
1529 | ||
edb3359d DJ |
1530 | if (BLOCK_FUNCTION (block) != NULL && block_inlined_p (block)) |
1531 | break; | |
f61e8913 DC |
1532 | block = BLOCK_SUPERBLOCK (block); |
1533 | } | |
1534 | ||
3aee438b | 1535 | /* We've reached the end of the function without finding a result. */ |
e4051eeb | 1536 | |
f61e8913 DC |
1537 | return NULL; |
1538 | } | |
1539 | ||
cf901d3b | 1540 | /* See symtab.h. */ |
3a40aaa0 | 1541 | |
c0201579 | 1542 | struct objfile * |
3a40aaa0 UW |
1543 | lookup_objfile_from_block (const struct block *block) |
1544 | { | |
1545 | struct objfile *obj; | |
1546 | struct symtab *s; | |
1547 | ||
1548 | if (block == NULL) | |
1549 | return NULL; | |
1550 | ||
1551 | block = block_global_block (block); | |
2dd2cd1c DE |
1552 | /* Go through SYMTABS. |
1553 | Non-primary symtabs share the block vector with their primary symtabs | |
1554 | so we use ALL_PRIMARY_SYMTABS here instead of ALL_SYMTABS. */ | |
1555 | ALL_PRIMARY_SYMTABS (obj, s) | |
3a40aaa0 | 1556 | if (block == BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK)) |
61f0d762 JK |
1557 | { |
1558 | if (obj->separate_debug_objfile_backlink) | |
1559 | obj = obj->separate_debug_objfile_backlink; | |
1560 | ||
1561 | return obj; | |
1562 | } | |
3a40aaa0 UW |
1563 | |
1564 | return NULL; | |
1565 | } | |
1566 | ||
cf901d3b | 1567 | /* See symtab.h. */ |
f61e8913 | 1568 | |
5f9a71c3 | 1569 | struct symbol * |
d1a2d36d DE |
1570 | lookup_symbol_in_block (const char *name, const struct block *block, |
1571 | const domain_enum domain) | |
f61e8913 DC |
1572 | { |
1573 | struct symbol *sym; | |
f61e8913 | 1574 | |
16b2eaa1 | 1575 | sym = block_lookup_symbol (block, name, domain); |
f61e8913 | 1576 | if (sym) |
8155455b | 1577 | { |
f61e8913 | 1578 | block_found = block; |
21b556f4 | 1579 | return fixup_symbol_section (sym, NULL); |
8155455b DC |
1580 | } |
1581 | ||
1582 | return NULL; | |
1583 | } | |
1584 | ||
cf901d3b | 1585 | /* See symtab.h. */ |
3a40aaa0 UW |
1586 | |
1587 | struct symbol * | |
15d123c9 | 1588 | lookup_global_symbol_from_objfile (const struct objfile *main_objfile, |
3a40aaa0 | 1589 | const char *name, |
21b556f4 | 1590 | const domain_enum domain) |
3a40aaa0 | 1591 | { |
15d123c9 | 1592 | const struct objfile *objfile; |
3a40aaa0 | 1593 | struct symbol *sym; |
346d1dfe | 1594 | const struct blockvector *bv; |
3a40aaa0 UW |
1595 | const struct block *block; |
1596 | struct symtab *s; | |
3a40aaa0 | 1597 | |
15d123c9 TG |
1598 | for (objfile = main_objfile; |
1599 | objfile; | |
1600 | objfile = objfile_separate_debug_iterate (main_objfile, objfile)) | |
1601 | { | |
1602 | /* Go through symtabs. */ | |
78e5175a DE |
1603 | ALL_OBJFILE_PRIMARY_SYMTABS (objfile, s) |
1604 | { | |
1605 | bv = BLOCKVECTOR (s); | |
1606 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
16b2eaa1 | 1607 | sym = block_lookup_symbol (block, name, domain); |
78e5175a DE |
1608 | if (sym) |
1609 | { | |
1610 | block_found = block; | |
1611 | return fixup_symbol_section (sym, (struct objfile *)objfile); | |
1612 | } | |
1613 | } | |
15d123c9 | 1614 | |
74016e12 DE |
1615 | sym = lookup_symbol_via_quick_fns ((struct objfile *) objfile, |
1616 | GLOBAL_BLOCK, name, domain); | |
ccefe4c4 TT |
1617 | if (sym) |
1618 | return sym; | |
15d123c9 | 1619 | } |
56e3f43c | 1620 | |
3a40aaa0 UW |
1621 | return NULL; |
1622 | } | |
1623 | ||
19630284 JB |
1624 | /* Check to see if the symbol is defined in one of the OBJFILE's |
1625 | symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK, | |
8155455b DC |
1626 | depending on whether or not we want to search global symbols or |
1627 | static symbols. */ | |
1628 | ||
19630284 | 1629 | static struct symbol * |
74016e12 DE |
1630 | lookup_symbol_in_objfile_symtabs (struct objfile *objfile, int block_index, |
1631 | const char *name, const domain_enum domain) | |
19630284 JB |
1632 | { |
1633 | struct symbol *sym = NULL; | |
346d1dfe | 1634 | const struct blockvector *bv; |
19630284 JB |
1635 | const struct block *block; |
1636 | struct symtab *s; | |
1637 | ||
a743abeb DE |
1638 | ALL_OBJFILE_PRIMARY_SYMTABS (objfile, s) |
1639 | { | |
1640 | bv = BLOCKVECTOR (s); | |
1641 | block = BLOCKVECTOR_BLOCK (bv, block_index); | |
16b2eaa1 | 1642 | sym = block_lookup_symbol (block, name, domain); |
a743abeb DE |
1643 | if (sym) |
1644 | { | |
1645 | block_found = block; | |
1646 | return fixup_symbol_section (sym, objfile); | |
1647 | } | |
1648 | } | |
19630284 JB |
1649 | |
1650 | return NULL; | |
1651 | } | |
1652 | ||
74016e12 DE |
1653 | /* Wrapper around lookup_symbol_in_objfile_symtabs to search all objfiles. |
1654 | Returns the first match found. */ | |
19630284 | 1655 | |
8155455b | 1656 | static struct symbol * |
74016e12 DE |
1657 | lookup_symbol_in_all_objfiles (int block_index, const char *name, |
1658 | const domain_enum domain) | |
8155455b | 1659 | { |
67ff19f7 JB |
1660 | struct symbol *sym; |
1661 | struct objfile *objfile; | |
8155455b | 1662 | |
67ff19f7 JB |
1663 | ALL_OBJFILES (objfile) |
1664 | { | |
74016e12 DE |
1665 | sym = lookup_symbol_in_objfile_symtabs (objfile, block_index, name, |
1666 | domain); | |
19630284 JB |
1667 | if (sym) |
1668 | return sym; | |
8155455b DC |
1669 | } |
1670 | ||
1671 | return NULL; | |
1672 | } | |
1673 | ||
74016e12 | 1674 | /* Wrapper around lookup_symbol_in_objfile_symtabs for search_symbols. |
422d65e7 DE |
1675 | Look up LINKAGE_NAME in DOMAIN in the global and static blocks of OBJFILE |
1676 | and all related objfiles. */ | |
1677 | ||
1678 | static struct symbol * | |
1679 | lookup_symbol_in_objfile_from_linkage_name (struct objfile *objfile, | |
1680 | const char *linkage_name, | |
1681 | domain_enum domain) | |
1682 | { | |
1683 | enum language lang = current_language->la_language; | |
1684 | const char *modified_name; | |
1685 | struct cleanup *cleanup = demangle_for_lookup (linkage_name, lang, | |
1686 | &modified_name); | |
1687 | struct objfile *main_objfile, *cur_objfile; | |
1688 | ||
1689 | if (objfile->separate_debug_objfile_backlink) | |
1690 | main_objfile = objfile->separate_debug_objfile_backlink; | |
1691 | else | |
1692 | main_objfile = objfile; | |
1693 | ||
1694 | for (cur_objfile = main_objfile; | |
1695 | cur_objfile; | |
1696 | cur_objfile = objfile_separate_debug_iterate (main_objfile, cur_objfile)) | |
1697 | { | |
1698 | struct symbol *sym; | |
1699 | ||
74016e12 DE |
1700 | sym = lookup_symbol_in_objfile_symtabs (cur_objfile, GLOBAL_BLOCK, |
1701 | modified_name, domain); | |
422d65e7 | 1702 | if (sym == NULL) |
74016e12 DE |
1703 | sym = lookup_symbol_in_objfile_symtabs (cur_objfile, STATIC_BLOCK, |
1704 | modified_name, domain); | |
422d65e7 DE |
1705 | if (sym != NULL) |
1706 | { | |
1707 | do_cleanups (cleanup); | |
1708 | return sym; | |
1709 | } | |
1710 | } | |
1711 | ||
1712 | do_cleanups (cleanup); | |
1713 | return NULL; | |
1714 | } | |
1715 | ||
08c23b0d TT |
1716 | /* A helper function that throws an exception when a symbol was found |
1717 | in a psymtab but not in a symtab. */ | |
1718 | ||
1719 | static void ATTRIBUTE_NORETURN | |
f88cb4b6 DE |
1720 | error_in_psymtab_expansion (int block_index, const char *name, |
1721 | struct symtab *symtab) | |
08c23b0d TT |
1722 | { |
1723 | error (_("\ | |
1724 | Internal: %s symbol `%s' found in %s psymtab but not in symtab.\n\ | |
1725 | %s may be an inlined function, or may be a template function\n \ | |
1726 | (if a template, try specifying an instantiation: %s<type>)."), | |
f88cb4b6 | 1727 | block_index == GLOBAL_BLOCK ? "global" : "static", |
08c23b0d TT |
1728 | name, symtab_to_filename_for_display (symtab), name, name); |
1729 | } | |
1730 | ||
74016e12 DE |
1731 | /* A helper function for various lookup routines that interfaces with |
1732 | the "quick" symbol table functions. */ | |
8155455b DC |
1733 | |
1734 | static struct symbol * | |
74016e12 DE |
1735 | lookup_symbol_via_quick_fns (struct objfile *objfile, int block_index, |
1736 | const char *name, const domain_enum domain) | |
8155455b | 1737 | { |
ccefe4c4 | 1738 | struct symtab *symtab; |
346d1dfe | 1739 | const struct blockvector *bv; |
8155455b | 1740 | const struct block *block; |
ccefe4c4 | 1741 | struct symbol *sym; |
8155455b | 1742 | |
ccefe4c4 TT |
1743 | if (!objfile->sf) |
1744 | return NULL; | |
f88cb4b6 | 1745 | symtab = objfile->sf->qf->lookup_symbol (objfile, block_index, name, domain); |
ccefe4c4 TT |
1746 | if (!symtab) |
1747 | return NULL; | |
8155455b | 1748 | |
ccefe4c4 | 1749 | bv = BLOCKVECTOR (symtab); |
f88cb4b6 | 1750 | block = BLOCKVECTOR_BLOCK (bv, block_index); |
16b2eaa1 | 1751 | sym = block_lookup_symbol (block, name, domain); |
ccefe4c4 | 1752 | if (!sym) |
f88cb4b6 | 1753 | error_in_psymtab_expansion (block_index, name, symtab); |
ec201f0c | 1754 | block_found = block; |
ccefe4c4 | 1755 | return fixup_symbol_section (sym, objfile); |
8155455b DC |
1756 | } |
1757 | ||
cf901d3b | 1758 | /* See symtab.h. */ |
5f9a71c3 DC |
1759 | |
1760 | struct symbol * | |
1761 | basic_lookup_symbol_nonlocal (const char *name, | |
5f9a71c3 | 1762 | const struct block *block, |
21b556f4 | 1763 | const domain_enum domain) |
5f9a71c3 DC |
1764 | { |
1765 | struct symbol *sym; | |
1766 | ||
1767 | /* NOTE: carlton/2003-05-19: The comments below were written when | |
1768 | this (or what turned into this) was part of lookup_symbol_aux; | |
1769 | I'm much less worried about these questions now, since these | |
1770 | decisions have turned out well, but I leave these comments here | |
1771 | for posterity. */ | |
1772 | ||
1773 | /* NOTE: carlton/2002-12-05: There is a question as to whether or | |
1774 | not it would be appropriate to search the current global block | |
1775 | here as well. (That's what this code used to do before the | |
1776 | is_a_field_of_this check was moved up.) On the one hand, it's | |
74016e12 | 1777 | redundant with the lookup_symbol_in_all_objfiles search that happens |
5f9a71c3 DC |
1778 | next. On the other hand, if decode_line_1 is passed an argument |
1779 | like filename:var, then the user presumably wants 'var' to be | |
1780 | searched for in filename. On the third hand, there shouldn't be | |
1781 | multiple global variables all of which are named 'var', and it's | |
1782 | not like decode_line_1 has ever restricted its search to only | |
1783 | global variables in a single filename. All in all, only | |
1784 | searching the static block here seems best: it's correct and it's | |
1785 | cleanest. */ | |
1786 | ||
1787 | /* NOTE: carlton/2002-12-05: There's also a possible performance | |
1788 | issue here: if you usually search for global symbols in the | |
1789 | current file, then it would be slightly better to search the | |
1790 | current global block before searching all the symtabs. But there | |
1791 | are other factors that have a much greater effect on performance | |
1792 | than that one, so I don't think we should worry about that for | |
1793 | now. */ | |
1794 | ||
d9060ba6 DE |
1795 | /* NOTE: dje/2014-10-26: The lookup in all objfiles search could skip |
1796 | the current objfile. Searching the current objfile first is useful | |
1797 | for both matching user expectations as well as performance. */ | |
1798 | ||
24d864bb | 1799 | sym = lookup_symbol_in_static_block (name, block, domain); |
5f9a71c3 DC |
1800 | if (sym != NULL) |
1801 | return sym; | |
1802 | ||
08724ab7 | 1803 | return lookup_global_symbol (name, block, domain); |
5f9a71c3 DC |
1804 | } |
1805 | ||
cf901d3b | 1806 | /* See symtab.h. */ |
5f9a71c3 DC |
1807 | |
1808 | struct symbol * | |
24d864bb DE |
1809 | lookup_symbol_in_static_block (const char *name, |
1810 | const struct block *block, | |
1811 | const domain_enum domain) | |
5f9a71c3 DC |
1812 | { |
1813 | const struct block *static_block = block_static_block (block); | |
1814 | ||
1815 | if (static_block != NULL) | |
d1a2d36d | 1816 | return lookup_symbol_in_block (name, static_block, domain); |
5f9a71c3 DC |
1817 | else |
1818 | return NULL; | |
1819 | } | |
1820 | ||
19630284 JB |
1821 | /* Private data to be used with lookup_symbol_global_iterator_cb. */ |
1822 | ||
1823 | struct global_sym_lookup_data | |
1824 | { | |
1825 | /* The name of the symbol we are searching for. */ | |
1826 | const char *name; | |
1827 | ||
1828 | /* The domain to use for our search. */ | |
1829 | domain_enum domain; | |
1830 | ||
1831 | /* The field where the callback should store the symbol if found. | |
1832 | It should be initialized to NULL before the search is started. */ | |
1833 | struct symbol *result; | |
1834 | }; | |
1835 | ||
1836 | /* A callback function for gdbarch_iterate_over_objfiles_in_search_order. | |
1837 | It searches by name for a symbol in the GLOBAL_BLOCK of the given | |
1838 | OBJFILE. The arguments for the search are passed via CB_DATA, | |
1839 | which in reality is a pointer to struct global_sym_lookup_data. */ | |
1840 | ||
1841 | static int | |
1842 | lookup_symbol_global_iterator_cb (struct objfile *objfile, | |
1843 | void *cb_data) | |
1844 | { | |
1845 | struct global_sym_lookup_data *data = | |
1846 | (struct global_sym_lookup_data *) cb_data; | |
1847 | ||
1848 | gdb_assert (data->result == NULL); | |
1849 | ||
74016e12 DE |
1850 | data->result = lookup_symbol_in_objfile_symtabs (objfile, GLOBAL_BLOCK, |
1851 | data->name, data->domain); | |
19630284 | 1852 | if (data->result == NULL) |
74016e12 DE |
1853 | data->result = lookup_symbol_via_quick_fns (objfile, GLOBAL_BLOCK, |
1854 | data->name, data->domain); | |
19630284 JB |
1855 | |
1856 | /* If we found a match, tell the iterator to stop. Otherwise, | |
1857 | keep going. */ | |
1858 | return (data->result != NULL); | |
1859 | } | |
1860 | ||
cf901d3b | 1861 | /* See symtab.h. */ |
5f9a71c3 DC |
1862 | |
1863 | struct symbol * | |
08724ab7 | 1864 | lookup_global_symbol (const char *name, |
3a40aaa0 | 1865 | const struct block *block, |
21b556f4 | 1866 | const domain_enum domain) |
5f9a71c3 | 1867 | { |
3a40aaa0 UW |
1868 | struct symbol *sym = NULL; |
1869 | struct objfile *objfile = NULL; | |
19630284 | 1870 | struct global_sym_lookup_data lookup_data; |
3a40aaa0 UW |
1871 | |
1872 | /* Call library-specific lookup procedure. */ | |
67ff19f7 JB |
1873 | objfile = lookup_objfile_from_block (block); |
1874 | if (objfile != NULL) | |
1875 | sym = solib_global_lookup (objfile, name, domain); | |
3a40aaa0 UW |
1876 | if (sym != NULL) |
1877 | return sym; | |
5f9a71c3 | 1878 | |
19630284 JB |
1879 | memset (&lookup_data, 0, sizeof (lookup_data)); |
1880 | lookup_data.name = name; | |
1881 | lookup_data.domain = domain; | |
1882 | gdbarch_iterate_over_objfiles_in_search_order | |
f5656ead | 1883 | (objfile != NULL ? get_objfile_arch (objfile) : target_gdbarch (), |
19630284 | 1884 | lookup_symbol_global_iterator_cb, &lookup_data, objfile); |
5f9a71c3 | 1885 | |
19630284 | 1886 | return lookup_data.result; |
5f9a71c3 DC |
1887 | } |
1888 | ||
4186eb54 KS |
1889 | int |
1890 | symbol_matches_domain (enum language symbol_language, | |
1891 | domain_enum symbol_domain, | |
1892 | domain_enum domain) | |
1893 | { | |
1894 | /* For C++ "struct foo { ... }" also defines a typedef for "foo". | |
1895 | A Java class declaration also defines a typedef for the class. | |
1896 | Similarly, any Ada type declaration implicitly defines a typedef. */ | |
1897 | if (symbol_language == language_cplus | |
1898 | || symbol_language == language_d | |
1899 | || symbol_language == language_java | |
1900 | || symbol_language == language_ada) | |
1901 | { | |
1902 | if ((domain == VAR_DOMAIN || domain == STRUCT_DOMAIN) | |
1903 | && symbol_domain == STRUCT_DOMAIN) | |
1904 | return 1; | |
1905 | } | |
1906 | /* For all other languages, strict match is required. */ | |
1907 | return (symbol_domain == domain); | |
1908 | } | |
1909 | ||
cf901d3b | 1910 | /* See symtab.h. */ |
c906108c | 1911 | |
ccefe4c4 TT |
1912 | struct type * |
1913 | lookup_transparent_type (const char *name) | |
c906108c | 1914 | { |
ccefe4c4 TT |
1915 | return current_language->la_lookup_transparent_type (name); |
1916 | } | |
9af17804 | 1917 | |
ccefe4c4 TT |
1918 | /* A helper for basic_lookup_transparent_type that interfaces with the |
1919 | "quick" symbol table functions. */ | |
357e46e7 | 1920 | |
ccefe4c4 | 1921 | static struct type * |
f88cb4b6 | 1922 | basic_lookup_transparent_type_quick (struct objfile *objfile, int block_index, |
ccefe4c4 TT |
1923 | const char *name) |
1924 | { | |
1925 | struct symtab *symtab; | |
346d1dfe | 1926 | const struct blockvector *bv; |
ccefe4c4 TT |
1927 | struct block *block; |
1928 | struct symbol *sym; | |
c906108c | 1929 | |
ccefe4c4 TT |
1930 | if (!objfile->sf) |
1931 | return NULL; | |
f88cb4b6 DE |
1932 | symtab = objfile->sf->qf->lookup_symbol (objfile, block_index, name, |
1933 | STRUCT_DOMAIN); | |
ccefe4c4 TT |
1934 | if (!symtab) |
1935 | return NULL; | |
c906108c | 1936 | |
ccefe4c4 | 1937 | bv = BLOCKVECTOR (symtab); |
f88cb4b6 | 1938 | block = BLOCKVECTOR_BLOCK (bv, block_index); |
16b2eaa1 | 1939 | sym = block_lookup_symbol (block, name, STRUCT_DOMAIN); |
ccefe4c4 | 1940 | if (!sym) |
f88cb4b6 | 1941 | error_in_psymtab_expansion (block_index, name, symtab); |
08c23b0d | 1942 | |
ccefe4c4 TT |
1943 | if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) |
1944 | return SYMBOL_TYPE (sym); | |
c906108c | 1945 | |
ccefe4c4 | 1946 | return NULL; |
b368761e | 1947 | } |
c906108c | 1948 | |
b368761e DC |
1949 | /* The standard implementation of lookup_transparent_type. This code |
1950 | was modeled on lookup_symbol -- the parts not relevant to looking | |
1951 | up types were just left out. In particular it's assumed here that | |
cf901d3b | 1952 | types are available in STRUCT_DOMAIN and only in file-static or |
b368761e | 1953 | global blocks. */ |
c906108c SS |
1954 | |
1955 | struct type * | |
b368761e | 1956 | basic_lookup_transparent_type (const char *name) |
c906108c | 1957 | { |
52f0bd74 AC |
1958 | struct symbol *sym; |
1959 | struct symtab *s = NULL; | |
346d1dfe | 1960 | const struct blockvector *bv; |
52f0bd74 AC |
1961 | struct objfile *objfile; |
1962 | struct block *block; | |
ccefe4c4 | 1963 | struct type *t; |
c906108c SS |
1964 | |
1965 | /* Now search all the global symbols. Do the symtab's first, then | |
c378eb4e | 1966 | check the psymtab's. If a psymtab indicates the existence |
c906108c SS |
1967 | of the desired name as a global, then do psymtab-to-symtab |
1968 | conversion on the fly and return the found symbol. */ | |
c5aa993b | 1969 | |
58b6ab13 | 1970 | ALL_OBJFILES (objfile) |
c5aa993b | 1971 | { |
d790cf0a DE |
1972 | ALL_OBJFILE_PRIMARY_SYMTABS (objfile, s) |
1973 | { | |
1974 | bv = BLOCKVECTOR (s); | |
1975 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
16b2eaa1 | 1976 | sym = block_lookup_symbol (block, name, STRUCT_DOMAIN); |
d790cf0a DE |
1977 | if (sym && !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) |
1978 | { | |
1979 | return SYMBOL_TYPE (sym); | |
1980 | } | |
1981 | } | |
c5aa993b | 1982 | } |
c906108c | 1983 | |
ccefe4c4 | 1984 | ALL_OBJFILES (objfile) |
c5aa993b | 1985 | { |
ccefe4c4 TT |
1986 | t = basic_lookup_transparent_type_quick (objfile, GLOBAL_BLOCK, name); |
1987 | if (t) | |
1988 | return t; | |
c5aa993b | 1989 | } |
c906108c SS |
1990 | |
1991 | /* Now search the static file-level symbols. | |
1992 | Not strictly correct, but more useful than an error. | |
1993 | Do the symtab's first, then | |
c378eb4e | 1994 | check the psymtab's. If a psymtab indicates the existence |
c906108c | 1995 | of the desired name as a file-level static, then do psymtab-to-symtab |
c378eb4e | 1996 | conversion on the fly and return the found symbol. */ |
c906108c | 1997 | |
54ec275a | 1998 | ALL_OBJFILES (objfile) |
c5aa993b | 1999 | { |
78e5175a | 2000 | ALL_OBJFILE_PRIMARY_SYMTABS (objfile, s) |
c5aa993b | 2001 | { |
54ec275a KS |
2002 | bv = BLOCKVECTOR (s); |
2003 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
16b2eaa1 | 2004 | sym = block_lookup_symbol (block, name, STRUCT_DOMAIN); |
54ec275a KS |
2005 | if (sym && !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) |
2006 | { | |
2007 | return SYMBOL_TYPE (sym); | |
2008 | } | |
c5aa993b JM |
2009 | } |
2010 | } | |
c906108c | 2011 | |
ccefe4c4 | 2012 | ALL_OBJFILES (objfile) |
c5aa993b | 2013 | { |
ccefe4c4 TT |
2014 | t = basic_lookup_transparent_type_quick (objfile, STATIC_BLOCK, name); |
2015 | if (t) | |
2016 | return t; | |
c5aa993b | 2017 | } |
ccefe4c4 | 2018 | |
c906108c SS |
2019 | return (struct type *) 0; |
2020 | } | |
2021 | ||
4eeaa230 | 2022 | /* Iterate over the symbols named NAME, matching DOMAIN, in BLOCK. |
f8eba3c6 TT |
2023 | |
2024 | For each symbol that matches, CALLBACK is called. The symbol and | |
2025 | DATA are passed to the callback. | |
2026 | ||
2027 | If CALLBACK returns zero, the iteration ends. Otherwise, the | |
4eeaa230 | 2028 | search continues. */ |
f8eba3c6 TT |
2029 | |
2030 | void | |
2031 | iterate_over_symbols (const struct block *block, const char *name, | |
2032 | const domain_enum domain, | |
8e704927 | 2033 | symbol_found_callback_ftype *callback, |
f8eba3c6 TT |
2034 | void *data) |
2035 | { | |
4eeaa230 DE |
2036 | struct block_iterator iter; |
2037 | struct symbol *sym; | |
f8eba3c6 | 2038 | |
358d6ab3 | 2039 | ALL_BLOCK_SYMBOLS_WITH_NAME (block, name, iter, sym) |
4eeaa230 | 2040 | { |
4186eb54 KS |
2041 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
2042 | SYMBOL_DOMAIN (sym), domain)) | |
f8eba3c6 | 2043 | { |
4eeaa230 DE |
2044 | if (!callback (sym, data)) |
2045 | return; | |
f8eba3c6 | 2046 | } |
f8eba3c6 TT |
2047 | } |
2048 | } | |
2049 | ||
c906108c | 2050 | /* Find the symtab associated with PC and SECTION. Look through the |
c378eb4e | 2051 | psymtabs and read in another symtab if necessary. */ |
c906108c SS |
2052 | |
2053 | struct symtab * | |
714835d5 | 2054 | find_pc_sect_symtab (CORE_ADDR pc, struct obj_section *section) |
c906108c | 2055 | { |
52f0bd74 | 2056 | struct block *b; |
346d1dfe | 2057 | const struct blockvector *bv; |
52f0bd74 AC |
2058 | struct symtab *s = NULL; |
2059 | struct symtab *best_s = NULL; | |
52f0bd74 | 2060 | struct objfile *objfile; |
c906108c | 2061 | CORE_ADDR distance = 0; |
77e371c0 | 2062 | struct bound_minimal_symbol msymbol; |
8a48e967 DJ |
2063 | |
2064 | /* If we know that this is not a text address, return failure. This is | |
2065 | necessary because we loop based on the block's high and low code | |
2066 | addresses, which do not include the data ranges, and because | |
2067 | we call find_pc_sect_psymtab which has a similar restriction based | |
2068 | on the partial_symtab's texthigh and textlow. */ | |
77e371c0 TT |
2069 | msymbol = lookup_minimal_symbol_by_pc_section (pc, section); |
2070 | if (msymbol.minsym | |
2071 | && (MSYMBOL_TYPE (msymbol.minsym) == mst_data | |
2072 | || MSYMBOL_TYPE (msymbol.minsym) == mst_bss | |
2073 | || MSYMBOL_TYPE (msymbol.minsym) == mst_abs | |
2074 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_data | |
2075 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_bss)) | |
8a48e967 | 2076 | return NULL; |
c906108c SS |
2077 | |
2078 | /* Search all symtabs for the one whose file contains our address, and which | |
2079 | is the smallest of all the ones containing the address. This is designed | |
2080 | to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000 | |
2081 | and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from | |
2082 | 0x1000-0x4000, but for address 0x2345 we want to return symtab b. | |
2083 | ||
2084 | This happens for native ecoff format, where code from included files | |
c378eb4e | 2085 | gets its own symtab. The symtab for the included file should have |
c906108c SS |
2086 | been read in already via the dependency mechanism. |
2087 | It might be swifter to create several symtabs with the same name | |
2088 | like xcoff does (I'm not sure). | |
2089 | ||
2090 | It also happens for objfiles that have their functions reordered. | |
2091 | For these, the symtab we are looking for is not necessarily read in. */ | |
2092 | ||
11309657 | 2093 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
2094 | { |
2095 | bv = BLOCKVECTOR (s); | |
2096 | b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
c906108c | 2097 | |
c5aa993b | 2098 | if (BLOCK_START (b) <= pc |
c5aa993b | 2099 | && BLOCK_END (b) > pc |
c5aa993b JM |
2100 | && (distance == 0 |
2101 | || BLOCK_END (b) - BLOCK_START (b) < distance)) | |
2102 | { | |
2103 | /* For an objfile that has its functions reordered, | |
2104 | find_pc_psymtab will find the proper partial symbol table | |
2105 | and we simply return its corresponding symtab. */ | |
2106 | /* In order to better support objfiles that contain both | |
2107 | stabs and coff debugging info, we continue on if a psymtab | |
c378eb4e | 2108 | can't be found. */ |
ccefe4c4 | 2109 | if ((objfile->flags & OBJF_REORDERED) && objfile->sf) |
c5aa993b | 2110 | { |
ccefe4c4 | 2111 | struct symtab *result; |
433759f7 | 2112 | |
ccefe4c4 TT |
2113 | result |
2114 | = objfile->sf->qf->find_pc_sect_symtab (objfile, | |
2115 | msymbol, | |
2116 | pc, section, | |
2117 | 0); | |
2118 | if (result) | |
2119 | return result; | |
c5aa993b JM |
2120 | } |
2121 | if (section != 0) | |
2122 | { | |
8157b174 | 2123 | struct block_iterator iter; |
261397f8 | 2124 | struct symbol *sym = NULL; |
c906108c | 2125 | |
de4f826b | 2126 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 2127 | { |
261397f8 | 2128 | fixup_symbol_section (sym, objfile); |
e27d198c TT |
2129 | if (matching_obj_sections (SYMBOL_OBJ_SECTION (objfile, sym), |
2130 | section)) | |
c5aa993b JM |
2131 | break; |
2132 | } | |
de4f826b | 2133 | if (sym == NULL) |
c378eb4e MS |
2134 | continue; /* No symbol in this symtab matches |
2135 | section. */ | |
c5aa993b JM |
2136 | } |
2137 | distance = BLOCK_END (b) - BLOCK_START (b); | |
2138 | best_s = s; | |
2139 | } | |
2140 | } | |
c906108c SS |
2141 | |
2142 | if (best_s != NULL) | |
c5aa993b | 2143 | return (best_s); |
c906108c | 2144 | |
072cabfe DE |
2145 | /* Not found in symtabs, search the "quick" symtabs (e.g. psymtabs). */ |
2146 | ||
ccefe4c4 TT |
2147 | ALL_OBJFILES (objfile) |
2148 | { | |
2149 | struct symtab *result; | |
433759f7 | 2150 | |
ccefe4c4 TT |
2151 | if (!objfile->sf) |
2152 | continue; | |
2153 | result = objfile->sf->qf->find_pc_sect_symtab (objfile, | |
2154 | msymbol, | |
2155 | pc, section, | |
2156 | 1); | |
2157 | if (result) | |
2158 | return result; | |
2159 | } | |
2160 | ||
2161 | return NULL; | |
c906108c SS |
2162 | } |
2163 | ||
c378eb4e MS |
2164 | /* Find the symtab associated with PC. Look through the psymtabs and read |
2165 | in another symtab if necessary. Backward compatibility, no section. */ | |
c906108c SS |
2166 | |
2167 | struct symtab * | |
fba45db2 | 2168 | find_pc_symtab (CORE_ADDR pc) |
c906108c SS |
2169 | { |
2170 | return find_pc_sect_symtab (pc, find_pc_mapped_section (pc)); | |
2171 | } | |
c906108c | 2172 | \f |
c5aa993b | 2173 | |
7e73cedf | 2174 | /* Find the source file and line number for a given PC value and SECTION. |
c906108c SS |
2175 | Return a structure containing a symtab pointer, a line number, |
2176 | and a pc range for the entire source line. | |
2177 | The value's .pc field is NOT the specified pc. | |
2178 | NOTCURRENT nonzero means, if specified pc is on a line boundary, | |
2179 | use the line that ends there. Otherwise, in that case, the line | |
2180 | that begins there is used. */ | |
2181 | ||
2182 | /* The big complication here is that a line may start in one file, and end just | |
2183 | before the start of another file. This usually occurs when you #include | |
2184 | code in the middle of a subroutine. To properly find the end of a line's PC | |
2185 | range, we must search all symtabs associated with this compilation unit, and | |
2186 | find the one whose first PC is closer than that of the next line in this | |
2187 | symtab. */ | |
2188 | ||
2189 | /* If it's worth the effort, we could be using a binary search. */ | |
2190 | ||
2191 | struct symtab_and_line | |
714835d5 | 2192 | find_pc_sect_line (CORE_ADDR pc, struct obj_section *section, int notcurrent) |
c906108c SS |
2193 | { |
2194 | struct symtab *s; | |
52f0bd74 AC |
2195 | struct linetable *l; |
2196 | int len; | |
2197 | int i; | |
2198 | struct linetable_entry *item; | |
c906108c | 2199 | struct symtab_and_line val; |
346d1dfe | 2200 | const struct blockvector *bv; |
7cbd4a93 | 2201 | struct bound_minimal_symbol msymbol; |
93b55aa1 | 2202 | struct objfile *objfile; |
c906108c SS |
2203 | |
2204 | /* Info on best line seen so far, and where it starts, and its file. */ | |
2205 | ||
2206 | struct linetable_entry *best = NULL; | |
2207 | CORE_ADDR best_end = 0; | |
2208 | struct symtab *best_symtab = 0; | |
2209 | ||
2210 | /* Store here the first line number | |
2211 | of a file which contains the line at the smallest pc after PC. | |
2212 | If we don't find a line whose range contains PC, | |
2213 | we will use a line one less than this, | |
2214 | with a range from the start of that file to the first line's pc. */ | |
2215 | struct linetable_entry *alt = NULL; | |
c906108c SS |
2216 | |
2217 | /* Info on best line seen in this file. */ | |
2218 | ||
2219 | struct linetable_entry *prev; | |
2220 | ||
2221 | /* If this pc is not from the current frame, | |
2222 | it is the address of the end of a call instruction. | |
2223 | Quite likely that is the start of the following statement. | |
2224 | But what we want is the statement containing the instruction. | |
2225 | Fudge the pc to make sure we get that. */ | |
2226 | ||
fe39c653 | 2227 | init_sal (&val); /* initialize to zeroes */ |
c906108c | 2228 | |
6c95b8df PA |
2229 | val.pspace = current_program_space; |
2230 | ||
b77b1eb7 JB |
2231 | /* It's tempting to assume that, if we can't find debugging info for |
2232 | any function enclosing PC, that we shouldn't search for line | |
2233 | number info, either. However, GAS can emit line number info for | |
2234 | assembly files --- very helpful when debugging hand-written | |
2235 | assembly code. In such a case, we'd have no debug info for the | |
2236 | function, but we would have line info. */ | |
648f4f79 | 2237 | |
c906108c SS |
2238 | if (notcurrent) |
2239 | pc -= 1; | |
2240 | ||
c5aa993b | 2241 | /* elz: added this because this function returned the wrong |
c906108c | 2242 | information if the pc belongs to a stub (import/export) |
c378eb4e | 2243 | to call a shlib function. This stub would be anywhere between |
9af17804 | 2244 | two functions in the target, and the line info was erroneously |
c378eb4e MS |
2245 | taken to be the one of the line before the pc. */ |
2246 | ||
c906108c | 2247 | /* RT: Further explanation: |
c5aa993b | 2248 | |
c906108c SS |
2249 | * We have stubs (trampolines) inserted between procedures. |
2250 | * | |
2251 | * Example: "shr1" exists in a shared library, and a "shr1" stub also | |
2252 | * exists in the main image. | |
2253 | * | |
2254 | * In the minimal symbol table, we have a bunch of symbols | |
c378eb4e | 2255 | * sorted by start address. The stubs are marked as "trampoline", |
c906108c SS |
2256 | * the others appear as text. E.g.: |
2257 | * | |
9af17804 | 2258 | * Minimal symbol table for main image |
c906108c SS |
2259 | * main: code for main (text symbol) |
2260 | * shr1: stub (trampoline symbol) | |
2261 | * foo: code for foo (text symbol) | |
2262 | * ... | |
2263 | * Minimal symbol table for "shr1" image: | |
2264 | * ... | |
2265 | * shr1: code for shr1 (text symbol) | |
2266 | * ... | |
2267 | * | |
2268 | * So the code below is trying to detect if we are in the stub | |
2269 | * ("shr1" stub), and if so, find the real code ("shr1" trampoline), | |
2270 | * and if found, do the symbolization from the real-code address | |
2271 | * rather than the stub address. | |
2272 | * | |
2273 | * Assumptions being made about the minimal symbol table: | |
2274 | * 1. lookup_minimal_symbol_by_pc() will return a trampoline only | |
c378eb4e | 2275 | * if we're really in the trampoline.s If we're beyond it (say |
9af17804 | 2276 | * we're in "foo" in the above example), it'll have a closer |
c906108c SS |
2277 | * symbol (the "foo" text symbol for example) and will not |
2278 | * return the trampoline. | |
2279 | * 2. lookup_minimal_symbol_text() will find a real text symbol | |
2280 | * corresponding to the trampoline, and whose address will | |
c378eb4e | 2281 | * be different than the trampoline address. I put in a sanity |
c906108c SS |
2282 | * check for the address being the same, to avoid an |
2283 | * infinite recursion. | |
2284 | */ | |
c5aa993b | 2285 | msymbol = lookup_minimal_symbol_by_pc (pc); |
7cbd4a93 TT |
2286 | if (msymbol.minsym != NULL) |
2287 | if (MSYMBOL_TYPE (msymbol.minsym) == mst_solib_trampoline) | |
c5aa993b | 2288 | { |
77e371c0 | 2289 | struct bound_minimal_symbol mfunsym |
efd66ac6 | 2290 | = lookup_minimal_symbol_text (MSYMBOL_LINKAGE_NAME (msymbol.minsym), |
77e371c0 TT |
2291 | NULL); |
2292 | ||
2293 | if (mfunsym.minsym == NULL) | |
c5aa993b JM |
2294 | /* I eliminated this warning since it is coming out |
2295 | * in the following situation: | |
2296 | * gdb shmain // test program with shared libraries | |
2297 | * (gdb) break shr1 // function in shared lib | |
2298 | * Warning: In stub for ... | |
9af17804 | 2299 | * In the above situation, the shared lib is not loaded yet, |
c5aa993b JM |
2300 | * so of course we can't find the real func/line info, |
2301 | * but the "break" still works, and the warning is annoying. | |
c378eb4e | 2302 | * So I commented out the warning. RT */ |
3e43a32a | 2303 | /* warning ("In stub for %s; unable to find real function/line info", |
c378eb4e MS |
2304 | SYMBOL_LINKAGE_NAME (msymbol)); */ |
2305 | ; | |
c5aa993b | 2306 | /* fall through */ |
77e371c0 TT |
2307 | else if (BMSYMBOL_VALUE_ADDRESS (mfunsym) |
2308 | == BMSYMBOL_VALUE_ADDRESS (msymbol)) | |
c5aa993b | 2309 | /* Avoid infinite recursion */ |
c378eb4e | 2310 | /* See above comment about why warning is commented out. */ |
3e43a32a | 2311 | /* warning ("In stub for %s; unable to find real function/line info", |
c378eb4e MS |
2312 | SYMBOL_LINKAGE_NAME (msymbol)); */ |
2313 | ; | |
c5aa993b JM |
2314 | /* fall through */ |
2315 | else | |
77e371c0 | 2316 | return find_pc_line (BMSYMBOL_VALUE_ADDRESS (mfunsym), 0); |
c5aa993b | 2317 | } |
c906108c SS |
2318 | |
2319 | ||
2320 | s = find_pc_sect_symtab (pc, section); | |
2321 | if (!s) | |
2322 | { | |
c378eb4e | 2323 | /* If no symbol information, return previous pc. */ |
c906108c SS |
2324 | if (notcurrent) |
2325 | pc++; | |
2326 | val.pc = pc; | |
2327 | return val; | |
2328 | } | |
2329 | ||
2330 | bv = BLOCKVECTOR (s); | |
93b55aa1 | 2331 | objfile = s->objfile; |
c906108c SS |
2332 | |
2333 | /* Look at all the symtabs that share this blockvector. | |
2334 | They all have the same apriori range, that we found was right; | |
2335 | but they have different line tables. */ | |
2336 | ||
93b55aa1 | 2337 | ALL_OBJFILE_SYMTABS (objfile, s) |
c906108c | 2338 | { |
93b55aa1 JK |
2339 | if (BLOCKVECTOR (s) != bv) |
2340 | continue; | |
2341 | ||
c906108c SS |
2342 | /* Find the best line in this symtab. */ |
2343 | l = LINETABLE (s); | |
2344 | if (!l) | |
c5aa993b | 2345 | continue; |
c906108c SS |
2346 | len = l->nitems; |
2347 | if (len <= 0) | |
2348 | { | |
2349 | /* I think len can be zero if the symtab lacks line numbers | |
2350 | (e.g. gcc -g1). (Either that or the LINETABLE is NULL; | |
2351 | I'm not sure which, and maybe it depends on the symbol | |
2352 | reader). */ | |
2353 | continue; | |
2354 | } | |
2355 | ||
2356 | prev = NULL; | |
c378eb4e | 2357 | item = l->item; /* Get first line info. */ |
c906108c SS |
2358 | |
2359 | /* Is this file's first line closer than the first lines of other files? | |
c5aa993b | 2360 | If so, record this file, and its first line, as best alternate. */ |
c906108c | 2361 | if (item->pc > pc && (!alt || item->pc < alt->pc)) |
c656bca5 | 2362 | alt = item; |
c906108c SS |
2363 | |
2364 | for (i = 0; i < len; i++, item++) | |
2365 | { | |
2366 | /* Leave prev pointing to the linetable entry for the last line | |
2367 | that started at or before PC. */ | |
2368 | if (item->pc > pc) | |
2369 | break; | |
2370 | ||
2371 | prev = item; | |
2372 | } | |
2373 | ||
2374 | /* At this point, prev points at the line whose start addr is <= pc, and | |
c5aa993b JM |
2375 | item points at the next line. If we ran off the end of the linetable |
2376 | (pc >= start of the last line), then prev == item. If pc < start of | |
2377 | the first line, prev will not be set. */ | |
c906108c SS |
2378 | |
2379 | /* Is this file's best line closer than the best in the other files? | |
083ae935 DJ |
2380 | If so, record this file, and its best line, as best so far. Don't |
2381 | save prev if it represents the end of a function (i.e. line number | |
2382 | 0) instead of a real line. */ | |
c906108c | 2383 | |
083ae935 | 2384 | if (prev && prev->line && (!best || prev->pc > best->pc)) |
c906108c SS |
2385 | { |
2386 | best = prev; | |
2387 | best_symtab = s; | |
25d53da1 KB |
2388 | |
2389 | /* Discard BEST_END if it's before the PC of the current BEST. */ | |
2390 | if (best_end <= best->pc) | |
2391 | best_end = 0; | |
c906108c | 2392 | } |
25d53da1 KB |
2393 | |
2394 | /* If another line (denoted by ITEM) is in the linetable and its | |
2395 | PC is after BEST's PC, but before the current BEST_END, then | |
2396 | use ITEM's PC as the new best_end. */ | |
2397 | if (best && i < len && item->pc > best->pc | |
2398 | && (best_end == 0 || best_end > item->pc)) | |
2399 | best_end = item->pc; | |
c906108c SS |
2400 | } |
2401 | ||
2402 | if (!best_symtab) | |
2403 | { | |
e86e87f7 DJ |
2404 | /* If we didn't find any line number info, just return zeros. |
2405 | We used to return alt->line - 1 here, but that could be | |
2406 | anywhere; if we don't have line number info for this PC, | |
2407 | don't make some up. */ | |
2408 | val.pc = pc; | |
c906108c | 2409 | } |
e8717518 FF |
2410 | else if (best->line == 0) |
2411 | { | |
2412 | /* If our best fit is in a range of PC's for which no line | |
2413 | number info is available (line number is zero) then we didn't | |
c378eb4e | 2414 | find any valid line information. */ |
e8717518 FF |
2415 | val.pc = pc; |
2416 | } | |
c906108c SS |
2417 | else |
2418 | { | |
2419 | val.symtab = best_symtab; | |
2420 | val.line = best->line; | |
2421 | val.pc = best->pc; | |
2422 | if (best_end && (!alt || best_end < alt->pc)) | |
2423 | val.end = best_end; | |
2424 | else if (alt) | |
2425 | val.end = alt->pc; | |
2426 | else | |
2427 | val.end = BLOCK_END (BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK)); | |
2428 | } | |
2429 | val.section = section; | |
2430 | return val; | |
2431 | } | |
2432 | ||
c378eb4e | 2433 | /* Backward compatibility (no section). */ |
c906108c SS |
2434 | |
2435 | struct symtab_and_line | |
fba45db2 | 2436 | find_pc_line (CORE_ADDR pc, int notcurrent) |
c906108c | 2437 | { |
714835d5 | 2438 | struct obj_section *section; |
c906108c SS |
2439 | |
2440 | section = find_pc_overlay (pc); | |
2441 | if (pc_in_unmapped_range (pc, section)) | |
2442 | pc = overlay_mapped_address (pc, section); | |
2443 | return find_pc_sect_line (pc, section, notcurrent); | |
2444 | } | |
c906108c | 2445 | \f |
c906108c SS |
2446 | /* Find line number LINE in any symtab whose name is the same as |
2447 | SYMTAB. | |
2448 | ||
2449 | If found, return the symtab that contains the linetable in which it was | |
2450 | found, set *INDEX to the index in the linetable of the best entry | |
2451 | found, and set *EXACT_MATCH nonzero if the value returned is an | |
2452 | exact match. | |
2453 | ||
2454 | If not found, return NULL. */ | |
2455 | ||
50641945 | 2456 | struct symtab * |
433759f7 MS |
2457 | find_line_symtab (struct symtab *symtab, int line, |
2458 | int *index, int *exact_match) | |
c906108c | 2459 | { |
6f43c46f | 2460 | int exact = 0; /* Initialized here to avoid a compiler warning. */ |
c906108c SS |
2461 | |
2462 | /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE | |
2463 | so far seen. */ | |
2464 | ||
2465 | int best_index; | |
2466 | struct linetable *best_linetable; | |
2467 | struct symtab *best_symtab; | |
2468 | ||
2469 | /* First try looking it up in the given symtab. */ | |
2470 | best_linetable = LINETABLE (symtab); | |
2471 | best_symtab = symtab; | |
f8eba3c6 | 2472 | best_index = find_line_common (best_linetable, line, &exact, 0); |
c906108c SS |
2473 | if (best_index < 0 || !exact) |
2474 | { | |
2475 | /* Didn't find an exact match. So we better keep looking for | |
c5aa993b JM |
2476 | another symtab with the same name. In the case of xcoff, |
2477 | multiple csects for one source file (produced by IBM's FORTRAN | |
2478 | compiler) produce multiple symtabs (this is unavoidable | |
2479 | assuming csects can be at arbitrary places in memory and that | |
2480 | the GLOBAL_BLOCK of a symtab has a begin and end address). */ | |
c906108c SS |
2481 | |
2482 | /* BEST is the smallest linenumber > LINE so far seen, | |
c5aa993b JM |
2483 | or 0 if none has been seen so far. |
2484 | BEST_INDEX and BEST_LINETABLE identify the item for it. */ | |
c906108c SS |
2485 | int best; |
2486 | ||
2487 | struct objfile *objfile; | |
2488 | struct symtab *s; | |
2489 | ||
2490 | if (best_index >= 0) | |
2491 | best = best_linetable->item[best_index].line; | |
2492 | else | |
2493 | best = 0; | |
2494 | ||
ccefe4c4 | 2495 | ALL_OBJFILES (objfile) |
51432cca | 2496 | { |
ccefe4c4 | 2497 | if (objfile->sf) |
652a8996 | 2498 | objfile->sf->qf->expand_symtabs_with_fullname (objfile, |
05cba821 | 2499 | symtab_to_fullname (symtab)); |
51432cca CES |
2500 | } |
2501 | ||
c906108c | 2502 | ALL_SYMTABS (objfile, s) |
c5aa993b JM |
2503 | { |
2504 | struct linetable *l; | |
2505 | int ind; | |
c906108c | 2506 | |
3ffc00b8 | 2507 | if (FILENAME_CMP (symtab->filename, s->filename) != 0) |
c5aa993b | 2508 | continue; |
d180bcbd JK |
2509 | if (FILENAME_CMP (symtab_to_fullname (symtab), |
2510 | symtab_to_fullname (s)) != 0) | |
3ffc00b8 | 2511 | continue; |
c5aa993b | 2512 | l = LINETABLE (s); |
f8eba3c6 | 2513 | ind = find_line_common (l, line, &exact, 0); |
c5aa993b JM |
2514 | if (ind >= 0) |
2515 | { | |
2516 | if (exact) | |
2517 | { | |
2518 | best_index = ind; | |
2519 | best_linetable = l; | |
2520 | best_symtab = s; | |
2521 | goto done; | |
2522 | } | |
2523 | if (best == 0 || l->item[ind].line < best) | |
2524 | { | |
2525 | best = l->item[ind].line; | |
2526 | best_index = ind; | |
2527 | best_linetable = l; | |
2528 | best_symtab = s; | |
2529 | } | |
2530 | } | |
2531 | } | |
c906108c | 2532 | } |
c5aa993b | 2533 | done: |
c906108c SS |
2534 | if (best_index < 0) |
2535 | return NULL; | |
2536 | ||
2537 | if (index) | |
2538 | *index = best_index; | |
2539 | if (exact_match) | |
2540 | *exact_match = exact; | |
2541 | ||
2542 | return best_symtab; | |
2543 | } | |
f8eba3c6 TT |
2544 | |
2545 | /* Given SYMTAB, returns all the PCs function in the symtab that | |
2546 | exactly match LINE. Returns NULL if there are no exact matches, | |
2547 | but updates BEST_ITEM in this case. */ | |
2548 | ||
2549 | VEC (CORE_ADDR) * | |
2550 | find_pcs_for_symtab_line (struct symtab *symtab, int line, | |
2551 | struct linetable_entry **best_item) | |
2552 | { | |
c656bca5 | 2553 | int start = 0; |
f8eba3c6 TT |
2554 | VEC (CORE_ADDR) *result = NULL; |
2555 | ||
2556 | /* First, collect all the PCs that are at this line. */ | |
2557 | while (1) | |
2558 | { | |
2559 | int was_exact; | |
2560 | int idx; | |
2561 | ||
2562 | idx = find_line_common (LINETABLE (symtab), line, &was_exact, start); | |
2563 | if (idx < 0) | |
2564 | break; | |
2565 | ||
2566 | if (!was_exact) | |
2567 | { | |
2568 | struct linetable_entry *item = &LINETABLE (symtab)->item[idx]; | |
2569 | ||
2570 | if (*best_item == NULL || item->line < (*best_item)->line) | |
2571 | *best_item = item; | |
2572 | ||
2573 | break; | |
2574 | } | |
2575 | ||
2576 | VEC_safe_push (CORE_ADDR, result, LINETABLE (symtab)->item[idx].pc); | |
2577 | start = idx + 1; | |
2578 | } | |
2579 | ||
2580 | return result; | |
2581 | } | |
2582 | ||
c906108c SS |
2583 | \f |
2584 | /* Set the PC value for a given source file and line number and return true. | |
2585 | Returns zero for invalid line number (and sets the PC to 0). | |
2586 | The source file is specified with a struct symtab. */ | |
2587 | ||
2588 | int | |
fba45db2 | 2589 | find_line_pc (struct symtab *symtab, int line, CORE_ADDR *pc) |
c906108c SS |
2590 | { |
2591 | struct linetable *l; | |
2592 | int ind; | |
2593 | ||
2594 | *pc = 0; | |
2595 | if (symtab == 0) | |
2596 | return 0; | |
2597 | ||
2598 | symtab = find_line_symtab (symtab, line, &ind, NULL); | |
2599 | if (symtab != NULL) | |
2600 | { | |
2601 | l = LINETABLE (symtab); | |
2602 | *pc = l->item[ind].pc; | |
2603 | return 1; | |
2604 | } | |
2605 | else | |
2606 | return 0; | |
2607 | } | |
2608 | ||
2609 | /* Find the range of pc values in a line. | |
2610 | Store the starting pc of the line into *STARTPTR | |
2611 | and the ending pc (start of next line) into *ENDPTR. | |
2612 | Returns 1 to indicate success. | |
2613 | Returns 0 if could not find the specified line. */ | |
2614 | ||
2615 | int | |
fba45db2 KB |
2616 | find_line_pc_range (struct symtab_and_line sal, CORE_ADDR *startptr, |
2617 | CORE_ADDR *endptr) | |
c906108c SS |
2618 | { |
2619 | CORE_ADDR startaddr; | |
2620 | struct symtab_and_line found_sal; | |
2621 | ||
2622 | startaddr = sal.pc; | |
c5aa993b | 2623 | if (startaddr == 0 && !find_line_pc (sal.symtab, sal.line, &startaddr)) |
c906108c SS |
2624 | return 0; |
2625 | ||
2626 | /* This whole function is based on address. For example, if line 10 has | |
2627 | two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then | |
2628 | "info line *0x123" should say the line goes from 0x100 to 0x200 | |
2629 | and "info line *0x355" should say the line goes from 0x300 to 0x400. | |
2630 | This also insures that we never give a range like "starts at 0x134 | |
2631 | and ends at 0x12c". */ | |
2632 | ||
2633 | found_sal = find_pc_sect_line (startaddr, sal.section, 0); | |
2634 | if (found_sal.line != sal.line) | |
2635 | { | |
2636 | /* The specified line (sal) has zero bytes. */ | |
2637 | *startptr = found_sal.pc; | |
2638 | *endptr = found_sal.pc; | |
2639 | } | |
2640 | else | |
2641 | { | |
2642 | *startptr = found_sal.pc; | |
2643 | *endptr = found_sal.end; | |
2644 | } | |
2645 | return 1; | |
2646 | } | |
2647 | ||
2648 | /* Given a line table and a line number, return the index into the line | |
2649 | table for the pc of the nearest line whose number is >= the specified one. | |
2650 | Return -1 if none is found. The value is >= 0 if it is an index. | |
f8eba3c6 | 2651 | START is the index at which to start searching the line table. |
c906108c SS |
2652 | |
2653 | Set *EXACT_MATCH nonzero if the value returned is an exact match. */ | |
2654 | ||
2655 | static int | |
aa1ee363 | 2656 | find_line_common (struct linetable *l, int lineno, |
f8eba3c6 | 2657 | int *exact_match, int start) |
c906108c | 2658 | { |
52f0bd74 AC |
2659 | int i; |
2660 | int len; | |
c906108c SS |
2661 | |
2662 | /* BEST is the smallest linenumber > LINENO so far seen, | |
2663 | or 0 if none has been seen so far. | |
2664 | BEST_INDEX identifies the item for it. */ | |
2665 | ||
2666 | int best_index = -1; | |
2667 | int best = 0; | |
2668 | ||
b7589f7d DJ |
2669 | *exact_match = 0; |
2670 | ||
c906108c SS |
2671 | if (lineno <= 0) |
2672 | return -1; | |
2673 | if (l == 0) | |
2674 | return -1; | |
2675 | ||
2676 | len = l->nitems; | |
f8eba3c6 | 2677 | for (i = start; i < len; i++) |
c906108c | 2678 | { |
aa1ee363 | 2679 | struct linetable_entry *item = &(l->item[i]); |
c906108c SS |
2680 | |
2681 | if (item->line == lineno) | |
2682 | { | |
2683 | /* Return the first (lowest address) entry which matches. */ | |
2684 | *exact_match = 1; | |
2685 | return i; | |
2686 | } | |
2687 | ||
2688 | if (item->line > lineno && (best == 0 || item->line < best)) | |
2689 | { | |
2690 | best = item->line; | |
2691 | best_index = i; | |
2692 | } | |
2693 | } | |
2694 | ||
2695 | /* If we got here, we didn't get an exact match. */ | |
c906108c SS |
2696 | return best_index; |
2697 | } | |
2698 | ||
2699 | int | |
fba45db2 | 2700 | find_pc_line_pc_range (CORE_ADDR pc, CORE_ADDR *startptr, CORE_ADDR *endptr) |
c906108c SS |
2701 | { |
2702 | struct symtab_and_line sal; | |
433759f7 | 2703 | |
c906108c SS |
2704 | sal = find_pc_line (pc, 0); |
2705 | *startptr = sal.pc; | |
2706 | *endptr = sal.end; | |
2707 | return sal.symtab != 0; | |
2708 | } | |
2709 | ||
aab2f208 DE |
2710 | /* Given a function symbol SYM, find the symtab and line for the start |
2711 | of the function. | |
2712 | If the argument FUNFIRSTLINE is nonzero, we want the first line | |
2713 | of real code inside the function. */ | |
2714 | ||
2715 | struct symtab_and_line | |
2716 | find_function_start_sal (struct symbol *sym, int funfirstline) | |
2717 | { | |
2718 | struct symtab_and_line sal; | |
2719 | ||
2720 | fixup_symbol_section (sym, NULL); | |
2721 | sal = find_pc_sect_line (BLOCK_START (SYMBOL_BLOCK_VALUE (sym)), | |
2722 | SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym), sym), 0); | |
2723 | ||
2724 | /* We always should have a line for the function start address. | |
2725 | If we don't, something is odd. Create a plain SAL refering | |
2726 | just the PC and hope that skip_prologue_sal (if requested) | |
2727 | can find a line number for after the prologue. */ | |
2728 | if (sal.pc < BLOCK_START (SYMBOL_BLOCK_VALUE (sym))) | |
2729 | { | |
2730 | init_sal (&sal); | |
2731 | sal.pspace = current_program_space; | |
2732 | sal.pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
2733 | sal.section = SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym), sym); | |
2734 | } | |
2735 | ||
2736 | if (funfirstline) | |
2737 | skip_prologue_sal (&sal); | |
2738 | ||
2739 | return sal; | |
2740 | } | |
2741 | ||
8c7a1ee8 EZ |
2742 | /* Given a function start address FUNC_ADDR and SYMTAB, find the first |
2743 | address for that function that has an entry in SYMTAB's line info | |
2744 | table. If such an entry cannot be found, return FUNC_ADDR | |
2745 | unaltered. */ | |
eca864fe | 2746 | |
70221824 | 2747 | static CORE_ADDR |
8c7a1ee8 EZ |
2748 | skip_prologue_using_lineinfo (CORE_ADDR func_addr, struct symtab *symtab) |
2749 | { | |
2750 | CORE_ADDR func_start, func_end; | |
2751 | struct linetable *l; | |
952a6d41 | 2752 | int i; |
8c7a1ee8 EZ |
2753 | |
2754 | /* Give up if this symbol has no lineinfo table. */ | |
2755 | l = LINETABLE (symtab); | |
2756 | if (l == NULL) | |
2757 | return func_addr; | |
2758 | ||
2759 | /* Get the range for the function's PC values, or give up if we | |
2760 | cannot, for some reason. */ | |
2761 | if (!find_pc_partial_function (func_addr, NULL, &func_start, &func_end)) | |
2762 | return func_addr; | |
2763 | ||
2764 | /* Linetable entries are ordered by PC values, see the commentary in | |
2765 | symtab.h where `struct linetable' is defined. Thus, the first | |
2766 | entry whose PC is in the range [FUNC_START..FUNC_END[ is the | |
2767 | address we are looking for. */ | |
2768 | for (i = 0; i < l->nitems; i++) | |
2769 | { | |
2770 | struct linetable_entry *item = &(l->item[i]); | |
2771 | ||
2772 | /* Don't use line numbers of zero, they mark special entries in | |
2773 | the table. See the commentary on symtab.h before the | |
2774 | definition of struct linetable. */ | |
2775 | if (item->line > 0 && func_start <= item->pc && item->pc < func_end) | |
2776 | return item->pc; | |
2777 | } | |
2778 | ||
2779 | return func_addr; | |
2780 | } | |
2781 | ||
059acae7 UW |
2782 | /* Adjust SAL to the first instruction past the function prologue. |
2783 | If the PC was explicitly specified, the SAL is not changed. | |
2784 | If the line number was explicitly specified, at most the SAL's PC | |
2785 | is updated. If SAL is already past the prologue, then do nothing. */ | |
eca864fe | 2786 | |
059acae7 UW |
2787 | void |
2788 | skip_prologue_sal (struct symtab_and_line *sal) | |
2789 | { | |
2790 | struct symbol *sym; | |
2791 | struct symtab_and_line start_sal; | |
2792 | struct cleanup *old_chain; | |
8be455d7 | 2793 | CORE_ADDR pc, saved_pc; |
059acae7 UW |
2794 | struct obj_section *section; |
2795 | const char *name; | |
2796 | struct objfile *objfile; | |
2797 | struct gdbarch *gdbarch; | |
3977b71f | 2798 | const struct block *b, *function_block; |
8be455d7 | 2799 | int force_skip, skip; |
c906108c | 2800 | |
a4b411d6 | 2801 | /* Do not change the SAL if PC was specified explicitly. */ |
059acae7 UW |
2802 | if (sal->explicit_pc) |
2803 | return; | |
6c95b8df PA |
2804 | |
2805 | old_chain = save_current_space_and_thread (); | |
059acae7 | 2806 | switch_to_program_space_and_thread (sal->pspace); |
6c95b8df | 2807 | |
059acae7 UW |
2808 | sym = find_pc_sect_function (sal->pc, sal->section); |
2809 | if (sym != NULL) | |
bccdca4a | 2810 | { |
059acae7 UW |
2811 | fixup_symbol_section (sym, NULL); |
2812 | ||
2813 | pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
e27d198c | 2814 | section = SYMBOL_OBJ_SECTION (SYMBOL_OBJFILE (sym), sym); |
059acae7 UW |
2815 | name = SYMBOL_LINKAGE_NAME (sym); |
2816 | objfile = SYMBOL_SYMTAB (sym)->objfile; | |
c906108c | 2817 | } |
059acae7 UW |
2818 | else |
2819 | { | |
7c7b6655 TT |
2820 | struct bound_minimal_symbol msymbol |
2821 | = lookup_minimal_symbol_by_pc_section (sal->pc, sal->section); | |
433759f7 | 2822 | |
7c7b6655 | 2823 | if (msymbol.minsym == NULL) |
059acae7 UW |
2824 | { |
2825 | do_cleanups (old_chain); | |
2826 | return; | |
2827 | } | |
2828 | ||
7c7b6655 | 2829 | objfile = msymbol.objfile; |
77e371c0 | 2830 | pc = BMSYMBOL_VALUE_ADDRESS (msymbol); |
efd66ac6 TT |
2831 | section = MSYMBOL_OBJ_SECTION (objfile, msymbol.minsym); |
2832 | name = MSYMBOL_LINKAGE_NAME (msymbol.minsym); | |
059acae7 UW |
2833 | } |
2834 | ||
2835 | gdbarch = get_objfile_arch (objfile); | |
2836 | ||
8be455d7 JK |
2837 | /* Process the prologue in two passes. In the first pass try to skip the |
2838 | prologue (SKIP is true) and verify there is a real need for it (indicated | |
2839 | by FORCE_SKIP). If no such reason was found run a second pass where the | |
2840 | prologue is not skipped (SKIP is false). */ | |
059acae7 | 2841 | |
8be455d7 JK |
2842 | skip = 1; |
2843 | force_skip = 1; | |
059acae7 | 2844 | |
8be455d7 JK |
2845 | /* Be conservative - allow direct PC (without skipping prologue) only if we |
2846 | have proven the CU (Compilation Unit) supports it. sal->SYMTAB does not | |
2847 | have to be set by the caller so we use SYM instead. */ | |
2848 | if (sym && SYMBOL_SYMTAB (sym)->locations_valid) | |
2849 | force_skip = 0; | |
059acae7 | 2850 | |
8be455d7 JK |
2851 | saved_pc = pc; |
2852 | do | |
c906108c | 2853 | { |
8be455d7 | 2854 | pc = saved_pc; |
4309257c | 2855 | |
8be455d7 JK |
2856 | /* If the function is in an unmapped overlay, use its unmapped LMA address, |
2857 | so that gdbarch_skip_prologue has something unique to work on. */ | |
2858 | if (section_is_overlay (section) && !section_is_mapped (section)) | |
2859 | pc = overlay_unmapped_address (pc, section); | |
2860 | ||
2861 | /* Skip "first line" of function (which is actually its prologue). */ | |
2862 | pc += gdbarch_deprecated_function_start_offset (gdbarch); | |
591a12a1 UW |
2863 | if (gdbarch_skip_entrypoint_p (gdbarch)) |
2864 | pc = gdbarch_skip_entrypoint (gdbarch, pc); | |
8be455d7 JK |
2865 | if (skip) |
2866 | pc = gdbarch_skip_prologue (gdbarch, pc); | |
2867 | ||
2868 | /* For overlays, map pc back into its mapped VMA range. */ | |
2869 | pc = overlay_mapped_address (pc, section); | |
2870 | ||
2871 | /* Calculate line number. */ | |
059acae7 | 2872 | start_sal = find_pc_sect_line (pc, section, 0); |
8be455d7 JK |
2873 | |
2874 | /* Check if gdbarch_skip_prologue left us in mid-line, and the next | |
2875 | line is still part of the same function. */ | |
2876 | if (skip && start_sal.pc != pc | |
b1d96efd JK |
2877 | && (sym ? (BLOCK_START (SYMBOL_BLOCK_VALUE (sym)) <= start_sal.end |
2878 | && start_sal.end < BLOCK_END (SYMBOL_BLOCK_VALUE (sym))) | |
7cbd4a93 TT |
2879 | : (lookup_minimal_symbol_by_pc_section (start_sal.end, section).minsym |
2880 | == lookup_minimal_symbol_by_pc_section (pc, section).minsym))) | |
8be455d7 JK |
2881 | { |
2882 | /* First pc of next line */ | |
2883 | pc = start_sal.end; | |
2884 | /* Recalculate the line number (might not be N+1). */ | |
2885 | start_sal = find_pc_sect_line (pc, section, 0); | |
2886 | } | |
2887 | ||
2888 | /* On targets with executable formats that don't have a concept of | |
2889 | constructors (ELF with .init has, PE doesn't), gcc emits a call | |
2890 | to `__main' in `main' between the prologue and before user | |
2891 | code. */ | |
2892 | if (gdbarch_skip_main_prologue_p (gdbarch) | |
7ccffd7c | 2893 | && name && strcmp_iw (name, "main") == 0) |
8be455d7 JK |
2894 | { |
2895 | pc = gdbarch_skip_main_prologue (gdbarch, pc); | |
2896 | /* Recalculate the line number (might not be N+1). */ | |
2897 | start_sal = find_pc_sect_line (pc, section, 0); | |
2898 | force_skip = 1; | |
2899 | } | |
4309257c | 2900 | } |
8be455d7 | 2901 | while (!force_skip && skip--); |
4309257c | 2902 | |
8c7a1ee8 EZ |
2903 | /* If we still don't have a valid source line, try to find the first |
2904 | PC in the lineinfo table that belongs to the same function. This | |
2905 | happens with COFF debug info, which does not seem to have an | |
2906 | entry in lineinfo table for the code after the prologue which has | |
2907 | no direct relation to source. For example, this was found to be | |
2908 | the case with the DJGPP target using "gcc -gcoff" when the | |
2909 | compiler inserted code after the prologue to make sure the stack | |
2910 | is aligned. */ | |
8be455d7 | 2911 | if (!force_skip && sym && start_sal.symtab == NULL) |
8c7a1ee8 EZ |
2912 | { |
2913 | pc = skip_prologue_using_lineinfo (pc, SYMBOL_SYMTAB (sym)); | |
2914 | /* Recalculate the line number. */ | |
059acae7 | 2915 | start_sal = find_pc_sect_line (pc, section, 0); |
8c7a1ee8 EZ |
2916 | } |
2917 | ||
059acae7 UW |
2918 | do_cleanups (old_chain); |
2919 | ||
2920 | /* If we're already past the prologue, leave SAL unchanged. Otherwise | |
2921 | forward SAL to the end of the prologue. */ | |
2922 | if (sal->pc >= pc) | |
2923 | return; | |
2924 | ||
2925 | sal->pc = pc; | |
2926 | sal->section = section; | |
2927 | ||
2928 | /* Unless the explicit_line flag was set, update the SAL line | |
2929 | and symtab to correspond to the modified PC location. */ | |
2930 | if (sal->explicit_line) | |
2931 | return; | |
2932 | ||
2933 | sal->symtab = start_sal.symtab; | |
2934 | sal->line = start_sal.line; | |
2935 | sal->end = start_sal.end; | |
c906108c | 2936 | |
edb3359d DJ |
2937 | /* Check if we are now inside an inlined function. If we can, |
2938 | use the call site of the function instead. */ | |
059acae7 | 2939 | b = block_for_pc_sect (sal->pc, sal->section); |
edb3359d DJ |
2940 | function_block = NULL; |
2941 | while (b != NULL) | |
2942 | { | |
2943 | if (BLOCK_FUNCTION (b) != NULL && block_inlined_p (b)) | |
2944 | function_block = b; | |
2945 | else if (BLOCK_FUNCTION (b) != NULL) | |
2946 | break; | |
2947 | b = BLOCK_SUPERBLOCK (b); | |
2948 | } | |
2949 | if (function_block != NULL | |
2950 | && SYMBOL_LINE (BLOCK_FUNCTION (function_block)) != 0) | |
2951 | { | |
059acae7 UW |
2952 | sal->line = SYMBOL_LINE (BLOCK_FUNCTION (function_block)); |
2953 | sal->symtab = SYMBOL_SYMTAB (BLOCK_FUNCTION (function_block)); | |
edb3359d | 2954 | } |
c906108c | 2955 | } |
50641945 | 2956 | |
f1f58506 DE |
2957 | /* Determine if PC is in the prologue of a function. The prologue is the area |
2958 | between the first instruction of a function, and the first executable line. | |
2959 | Returns 1 if PC *might* be in prologue, 0 if definately *not* in prologue. | |
2960 | ||
2961 | If non-zero, func_start is where we think the prologue starts, possibly | |
2962 | by previous examination of symbol table information. */ | |
2963 | ||
2964 | int | |
2965 | in_prologue (struct gdbarch *gdbarch, CORE_ADDR pc, CORE_ADDR func_start) | |
2966 | { | |
2967 | struct symtab_and_line sal; | |
2968 | CORE_ADDR func_addr, func_end; | |
2969 | ||
2970 | /* We have several sources of information we can consult to figure | |
2971 | this out. | |
2972 | - Compilers usually emit line number info that marks the prologue | |
2973 | as its own "source line". So the ending address of that "line" | |
2974 | is the end of the prologue. If available, this is the most | |
2975 | reliable method. | |
2976 | - The minimal symbols and partial symbols, which can usually tell | |
2977 | us the starting and ending addresses of a function. | |
2978 | - If we know the function's start address, we can call the | |
2979 | architecture-defined gdbarch_skip_prologue function to analyze the | |
2980 | instruction stream and guess where the prologue ends. | |
2981 | - Our `func_start' argument; if non-zero, this is the caller's | |
2982 | best guess as to the function's entry point. At the time of | |
2983 | this writing, handle_inferior_event doesn't get this right, so | |
2984 | it should be our last resort. */ | |
2985 | ||
2986 | /* Consult the partial symbol table, to find which function | |
2987 | the PC is in. */ | |
2988 | if (! find_pc_partial_function (pc, NULL, &func_addr, &func_end)) | |
2989 | { | |
2990 | CORE_ADDR prologue_end; | |
2991 | ||
2992 | /* We don't even have minsym information, so fall back to using | |
2993 | func_start, if given. */ | |
2994 | if (! func_start) | |
2995 | return 1; /* We *might* be in a prologue. */ | |
2996 | ||
2997 | prologue_end = gdbarch_skip_prologue (gdbarch, func_start); | |
2998 | ||
2999 | return func_start <= pc && pc < prologue_end; | |
3000 | } | |
3001 | ||
3002 | /* If we have line number information for the function, that's | |
3003 | usually pretty reliable. */ | |
3004 | sal = find_pc_line (func_addr, 0); | |
3005 | ||
3006 | /* Now sal describes the source line at the function's entry point, | |
3007 | which (by convention) is the prologue. The end of that "line", | |
3008 | sal.end, is the end of the prologue. | |
3009 | ||
3010 | Note that, for functions whose source code is all on a single | |
3011 | line, the line number information doesn't always end up this way. | |
3012 | So we must verify that our purported end-of-prologue address is | |
3013 | *within* the function, not at its start or end. */ | |
3014 | if (sal.line == 0 | |
3015 | || sal.end <= func_addr | |
3016 | || func_end <= sal.end) | |
3017 | { | |
3018 | /* We don't have any good line number info, so use the minsym | |
3019 | information, together with the architecture-specific prologue | |
3020 | scanning code. */ | |
3021 | CORE_ADDR prologue_end = gdbarch_skip_prologue (gdbarch, func_addr); | |
3022 | ||
3023 | return func_addr <= pc && pc < prologue_end; | |
3024 | } | |
3025 | ||
3026 | /* We have line number info, and it looks good. */ | |
3027 | return func_addr <= pc && pc < sal.end; | |
3028 | } | |
3029 | ||
3030 | /* Given PC at the function's start address, attempt to find the | |
3031 | prologue end using SAL information. Return zero if the skip fails. | |
3032 | ||
3033 | A non-optimized prologue traditionally has one SAL for the function | |
3034 | and a second for the function body. A single line function has | |
3035 | them both pointing at the same line. | |
3036 | ||
3037 | An optimized prologue is similar but the prologue may contain | |
3038 | instructions (SALs) from the instruction body. Need to skip those | |
3039 | while not getting into the function body. | |
3040 | ||
3041 | The functions end point and an increasing SAL line are used as | |
3042 | indicators of the prologue's endpoint. | |
3043 | ||
3044 | This code is based on the function refine_prologue_limit | |
3045 | (found in ia64). */ | |
3046 | ||
3047 | CORE_ADDR | |
3048 | skip_prologue_using_sal (struct gdbarch *gdbarch, CORE_ADDR func_addr) | |
3049 | { | |
3050 | struct symtab_and_line prologue_sal; | |
3051 | CORE_ADDR start_pc; | |
3052 | CORE_ADDR end_pc; | |
3053 | const struct block *bl; | |
3054 | ||
3055 | /* Get an initial range for the function. */ | |
3056 | find_pc_partial_function (func_addr, NULL, &start_pc, &end_pc); | |
3057 | start_pc += gdbarch_deprecated_function_start_offset (gdbarch); | |
3058 | ||
3059 | prologue_sal = find_pc_line (start_pc, 0); | |
3060 | if (prologue_sal.line != 0) | |
3061 | { | |
3062 | /* For languages other than assembly, treat two consecutive line | |
3063 | entries at the same address as a zero-instruction prologue. | |
3064 | The GNU assembler emits separate line notes for each instruction | |
3065 | in a multi-instruction macro, but compilers generally will not | |
3066 | do this. */ | |
3067 | if (prologue_sal.symtab->language != language_asm) | |
3068 | { | |
3069 | struct linetable *linetable = LINETABLE (prologue_sal.symtab); | |
3070 | int idx = 0; | |
3071 | ||
3072 | /* Skip any earlier lines, and any end-of-sequence marker | |
3073 | from a previous function. */ | |
3074 | while (linetable->item[idx].pc != prologue_sal.pc | |
3075 | || linetable->item[idx].line == 0) | |
3076 | idx++; | |
3077 | ||
3078 | if (idx+1 < linetable->nitems | |
3079 | && linetable->item[idx+1].line != 0 | |
3080 | && linetable->item[idx+1].pc == start_pc) | |
3081 | return start_pc; | |
3082 | } | |
3083 | ||
3084 | /* If there is only one sal that covers the entire function, | |
3085 | then it is probably a single line function, like | |
3086 | "foo(){}". */ | |
3087 | if (prologue_sal.end >= end_pc) | |
3088 | return 0; | |
3089 | ||
3090 | while (prologue_sal.end < end_pc) | |
3091 | { | |
3092 | struct symtab_and_line sal; | |
3093 | ||
3094 | sal = find_pc_line (prologue_sal.end, 0); | |
3095 | if (sal.line == 0) | |
3096 | break; | |
3097 | /* Assume that a consecutive SAL for the same (or larger) | |
3098 | line mark the prologue -> body transition. */ | |
3099 | if (sal.line >= prologue_sal.line) | |
3100 | break; | |
3101 | /* Likewise if we are in a different symtab altogether | |
3102 | (e.g. within a file included via #include). */ | |
3103 | if (sal.symtab != prologue_sal.symtab) | |
3104 | break; | |
3105 | ||
3106 | /* The line number is smaller. Check that it's from the | |
3107 | same function, not something inlined. If it's inlined, | |
3108 | then there is no point comparing the line numbers. */ | |
3109 | bl = block_for_pc (prologue_sal.end); | |
3110 | while (bl) | |
3111 | { | |
3112 | if (block_inlined_p (bl)) | |
3113 | break; | |
3114 | if (BLOCK_FUNCTION (bl)) | |
3115 | { | |
3116 | bl = NULL; | |
3117 | break; | |
3118 | } | |
3119 | bl = BLOCK_SUPERBLOCK (bl); | |
3120 | } | |
3121 | if (bl != NULL) | |
3122 | break; | |
3123 | ||
3124 | /* The case in which compiler's optimizer/scheduler has | |
3125 | moved instructions into the prologue. We look ahead in | |
3126 | the function looking for address ranges whose | |
3127 | corresponding line number is less the first one that we | |
3128 | found for the function. This is more conservative then | |
3129 | refine_prologue_limit which scans a large number of SALs | |
3130 | looking for any in the prologue. */ | |
3131 | prologue_sal = sal; | |
3132 | } | |
3133 | } | |
3134 | ||
3135 | if (prologue_sal.end < end_pc) | |
3136 | /* Return the end of this line, or zero if we could not find a | |
3137 | line. */ | |
3138 | return prologue_sal.end; | |
3139 | else | |
3140 | /* Don't return END_PC, which is past the end of the function. */ | |
3141 | return prologue_sal.pc; | |
3142 | } | |
3143 | \f | |
c906108c SS |
3144 | /* If P is of the form "operator[ \t]+..." where `...' is |
3145 | some legitimate operator text, return a pointer to the | |
3146 | beginning of the substring of the operator text. | |
3147 | Otherwise, return "". */ | |
eca864fe | 3148 | |
96142726 TT |
3149 | static const char * |
3150 | operator_chars (const char *p, const char **end) | |
c906108c SS |
3151 | { |
3152 | *end = ""; | |
3153 | if (strncmp (p, "operator", 8)) | |
3154 | return *end; | |
3155 | p += 8; | |
3156 | ||
3157 | /* Don't get faked out by `operator' being part of a longer | |
3158 | identifier. */ | |
c5aa993b | 3159 | if (isalpha (*p) || *p == '_' || *p == '$' || *p == '\0') |
c906108c SS |
3160 | return *end; |
3161 | ||
3162 | /* Allow some whitespace between `operator' and the operator symbol. */ | |
3163 | while (*p == ' ' || *p == '\t') | |
3164 | p++; | |
3165 | ||
c378eb4e | 3166 | /* Recognize 'operator TYPENAME'. */ |
c906108c | 3167 | |
c5aa993b | 3168 | if (isalpha (*p) || *p == '_' || *p == '$') |
c906108c | 3169 | { |
96142726 | 3170 | const char *q = p + 1; |
433759f7 | 3171 | |
c5aa993b | 3172 | while (isalnum (*q) || *q == '_' || *q == '$') |
c906108c SS |
3173 | q++; |
3174 | *end = q; | |
3175 | return p; | |
3176 | } | |
3177 | ||
53e8ad3d MS |
3178 | while (*p) |
3179 | switch (*p) | |
3180 | { | |
3181 | case '\\': /* regexp quoting */ | |
3182 | if (p[1] == '*') | |
3183 | { | |
3e43a32a | 3184 | if (p[2] == '=') /* 'operator\*=' */ |
53e8ad3d MS |
3185 | *end = p + 3; |
3186 | else /* 'operator\*' */ | |
3187 | *end = p + 2; | |
3188 | return p; | |
3189 | } | |
3190 | else if (p[1] == '[') | |
3191 | { | |
3192 | if (p[2] == ']') | |
3e43a32a MS |
3193 | error (_("mismatched quoting on brackets, " |
3194 | "try 'operator\\[\\]'")); | |
53e8ad3d MS |
3195 | else if (p[2] == '\\' && p[3] == ']') |
3196 | { | |
3197 | *end = p + 4; /* 'operator\[\]' */ | |
3198 | return p; | |
3199 | } | |
3200 | else | |
8a3fe4f8 | 3201 | error (_("nothing is allowed between '[' and ']'")); |
53e8ad3d | 3202 | } |
9af17804 | 3203 | else |
53e8ad3d | 3204 | { |
c378eb4e | 3205 | /* Gratuitous qoute: skip it and move on. */ |
53e8ad3d MS |
3206 | p++; |
3207 | continue; | |
3208 | } | |
3209 | break; | |
3210 | case '!': | |
3211 | case '=': | |
3212 | case '*': | |
3213 | case '/': | |
3214 | case '%': | |
3215 | case '^': | |
3216 | if (p[1] == '=') | |
3217 | *end = p + 2; | |
3218 | else | |
3219 | *end = p + 1; | |
3220 | return p; | |
3221 | case '<': | |
3222 | case '>': | |
3223 | case '+': | |
3224 | case '-': | |
3225 | case '&': | |
3226 | case '|': | |
3227 | if (p[0] == '-' && p[1] == '>') | |
3228 | { | |
c378eb4e | 3229 | /* Struct pointer member operator 'operator->'. */ |
53e8ad3d MS |
3230 | if (p[2] == '*') |
3231 | { | |
3232 | *end = p + 3; /* 'operator->*' */ | |
3233 | return p; | |
3234 | } | |
3235 | else if (p[2] == '\\') | |
3236 | { | |
3237 | *end = p + 4; /* Hopefully 'operator->\*' */ | |
3238 | return p; | |
3239 | } | |
3240 | else | |
3241 | { | |
3242 | *end = p + 2; /* 'operator->' */ | |
3243 | return p; | |
3244 | } | |
3245 | } | |
3246 | if (p[1] == '=' || p[1] == p[0]) | |
3247 | *end = p + 2; | |
3248 | else | |
3249 | *end = p + 1; | |
3250 | return p; | |
3251 | case '~': | |
3252 | case ',': | |
c5aa993b | 3253 | *end = p + 1; |
53e8ad3d MS |
3254 | return p; |
3255 | case '(': | |
3256 | if (p[1] != ')') | |
3e43a32a MS |
3257 | error (_("`operator ()' must be specified " |
3258 | "without whitespace in `()'")); | |
c5aa993b | 3259 | *end = p + 2; |
53e8ad3d MS |
3260 | return p; |
3261 | case '?': | |
3262 | if (p[1] != ':') | |
3e43a32a MS |
3263 | error (_("`operator ?:' must be specified " |
3264 | "without whitespace in `?:'")); | |
53e8ad3d MS |
3265 | *end = p + 2; |
3266 | return p; | |
3267 | case '[': | |
3268 | if (p[1] != ']') | |
3e43a32a MS |
3269 | error (_("`operator []' must be specified " |
3270 | "without whitespace in `[]'")); | |
53e8ad3d MS |
3271 | *end = p + 2; |
3272 | return p; | |
3273 | default: | |
8a3fe4f8 | 3274 | error (_("`operator %s' not supported"), p); |
53e8ad3d MS |
3275 | break; |
3276 | } | |
3277 | ||
c906108c SS |
3278 | *end = ""; |
3279 | return *end; | |
3280 | } | |
c906108c | 3281 | \f |
c5aa993b | 3282 | |
9fdc877b DE |
3283 | /* Cache to watch for file names already seen by filename_seen. */ |
3284 | ||
3285 | struct filename_seen_cache | |
3286 | { | |
3287 | /* Table of files seen so far. */ | |
2908cac6 DE |
3288 | htab_t tab; |
3289 | /* Initial size of the table. It automagically grows from here. */ | |
9fdc877b | 3290 | #define INITIAL_FILENAME_SEEN_CACHE_SIZE 100 |
9fdc877b DE |
3291 | }; |
3292 | ||
3293 | /* filename_seen_cache constructor. */ | |
3294 | ||
3295 | static struct filename_seen_cache * | |
3296 | create_filename_seen_cache (void) | |
3297 | { | |
3298 | struct filename_seen_cache *cache; | |
3299 | ||
3300 | cache = XNEW (struct filename_seen_cache); | |
2908cac6 DE |
3301 | cache->tab = htab_create_alloc (INITIAL_FILENAME_SEEN_CACHE_SIZE, |
3302 | filename_hash, filename_eq, | |
3303 | NULL, xcalloc, xfree); | |
9fdc877b DE |
3304 | |
3305 | return cache; | |
3306 | } | |
3307 | ||
3308 | /* Empty the cache, but do not delete it. */ | |
3309 | ||
3310 | static void | |
2908cac6 | 3311 | clear_filename_seen_cache (struct filename_seen_cache *cache) |
9fdc877b | 3312 | { |
2908cac6 | 3313 | htab_empty (cache->tab); |
9fdc877b DE |
3314 | } |
3315 | ||
3316 | /* filename_seen_cache destructor. | |
3317 | This takes a void * argument as it is generally used as a cleanup. */ | |
3318 | ||
3319 | static void | |
3320 | delete_filename_seen_cache (void *ptr) | |
3321 | { | |
3322 | struct filename_seen_cache *cache = ptr; | |
3323 | ||
2908cac6 | 3324 | htab_delete (cache->tab); |
9fdc877b DE |
3325 | xfree (cache); |
3326 | } | |
3327 | ||
a2b6eff5 | 3328 | /* If FILE is not already in the table of files in CACHE, return zero; |
c94fdfd0 | 3329 | otherwise return non-zero. Optionally add FILE to the table if ADD |
2908cac6 DE |
3330 | is non-zero. |
3331 | ||
3332 | NOTE: We don't manage space for FILE, we assume FILE lives as long | |
3333 | as the caller needs. */ | |
eca864fe | 3334 | |
c94fdfd0 | 3335 | static int |
9fdc877b | 3336 | filename_seen (struct filename_seen_cache *cache, const char *file, int add) |
c906108c | 3337 | { |
2908cac6 | 3338 | void **slot; |
c906108c | 3339 | |
c94fdfd0 | 3340 | /* Is FILE in tab? */ |
2908cac6 DE |
3341 | slot = htab_find_slot (cache->tab, file, add ? INSERT : NO_INSERT); |
3342 | if (*slot != NULL) | |
3343 | return 1; | |
c94fdfd0 EZ |
3344 | |
3345 | /* No; maybe add it to tab. */ | |
3346 | if (add) | |
2908cac6 | 3347 | *slot = (char *) file; |
c906108c | 3348 | |
c94fdfd0 EZ |
3349 | return 0; |
3350 | } | |
3351 | ||
9fdc877b DE |
3352 | /* Data structure to maintain printing state for output_source_filename. */ |
3353 | ||
3354 | struct output_source_filename_data | |
3355 | { | |
3356 | /* Cache of what we've seen so far. */ | |
3357 | struct filename_seen_cache *filename_seen_cache; | |
3358 | ||
3359 | /* Flag of whether we're printing the first one. */ | |
3360 | int first; | |
3361 | }; | |
3362 | ||
c94fdfd0 | 3363 | /* Slave routine for sources_info. Force line breaks at ,'s. |
9fdc877b DE |
3364 | NAME is the name to print. |
3365 | DATA contains the state for printing and watching for duplicates. */ | |
eca864fe | 3366 | |
c94fdfd0 | 3367 | static void |
9fdc877b DE |
3368 | output_source_filename (const char *name, |
3369 | struct output_source_filename_data *data) | |
c94fdfd0 EZ |
3370 | { |
3371 | /* Since a single source file can result in several partial symbol | |
3372 | tables, we need to avoid printing it more than once. Note: if | |
3373 | some of the psymtabs are read in and some are not, it gets | |
3374 | printed both under "Source files for which symbols have been | |
3375 | read" and "Source files for which symbols will be read in on | |
3376 | demand". I consider this a reasonable way to deal with the | |
3377 | situation. I'm not sure whether this can also happen for | |
3378 | symtabs; it doesn't hurt to check. */ | |
3379 | ||
3380 | /* Was NAME already seen? */ | |
9fdc877b | 3381 | if (filename_seen (data->filename_seen_cache, name, 1)) |
c94fdfd0 EZ |
3382 | { |
3383 | /* Yes; don't print it again. */ | |
3384 | return; | |
3385 | } | |
9fdc877b | 3386 | |
c94fdfd0 | 3387 | /* No; print it and reset *FIRST. */ |
9fdc877b DE |
3388 | if (! data->first) |
3389 | printf_filtered (", "); | |
3390 | data->first = 0; | |
c906108c SS |
3391 | |
3392 | wrap_here (""); | |
3393 | fputs_filtered (name, gdb_stdout); | |
c5aa993b | 3394 | } |
c906108c | 3395 | |
ccefe4c4 | 3396 | /* A callback for map_partial_symbol_filenames. */ |
eca864fe | 3397 | |
ccefe4c4 | 3398 | static void |
533a737e | 3399 | output_partial_symbol_filename (const char *filename, const char *fullname, |
ccefe4c4 TT |
3400 | void *data) |
3401 | { | |
3402 | output_source_filename (fullname ? fullname : filename, data); | |
3403 | } | |
3404 | ||
c906108c | 3405 | static void |
fba45db2 | 3406 | sources_info (char *ignore, int from_tty) |
c906108c | 3407 | { |
52f0bd74 | 3408 | struct symtab *s; |
52f0bd74 | 3409 | struct objfile *objfile; |
9fdc877b DE |
3410 | struct output_source_filename_data data; |
3411 | struct cleanup *cleanups; | |
c5aa993b | 3412 | |
c906108c SS |
3413 | if (!have_full_symbols () && !have_partial_symbols ()) |
3414 | { | |
8a3fe4f8 | 3415 | error (_("No symbol table is loaded. Use the \"file\" command.")); |
c906108c | 3416 | } |
c5aa993b | 3417 | |
9fdc877b DE |
3418 | data.filename_seen_cache = create_filename_seen_cache (); |
3419 | cleanups = make_cleanup (delete_filename_seen_cache, | |
3420 | data.filename_seen_cache); | |
3421 | ||
c906108c SS |
3422 | printf_filtered ("Source files for which symbols have been read in:\n\n"); |
3423 | ||
9fdc877b | 3424 | data.first = 1; |
c906108c | 3425 | ALL_SYMTABS (objfile, s) |
c5aa993b | 3426 | { |
d092d1a2 | 3427 | const char *fullname = symtab_to_fullname (s); |
433759f7 | 3428 | |
f35a17b5 | 3429 | output_source_filename (fullname, &data); |
c5aa993b | 3430 | } |
c906108c | 3431 | printf_filtered ("\n\n"); |
c5aa993b | 3432 | |
3e43a32a MS |
3433 | printf_filtered ("Source files for which symbols " |
3434 | "will be read in on demand:\n\n"); | |
c906108c | 3435 | |
9fdc877b DE |
3436 | clear_filename_seen_cache (data.filename_seen_cache); |
3437 | data.first = 1; | |
bb4142cf DE |
3438 | map_symbol_filenames (output_partial_symbol_filename, &data, |
3439 | 1 /*need_fullname*/); | |
c906108c | 3440 | printf_filtered ("\n"); |
9fdc877b DE |
3441 | |
3442 | do_cleanups (cleanups); | |
c906108c SS |
3443 | } |
3444 | ||
fbd9ab74 JK |
3445 | /* Compare FILE against all the NFILES entries of FILES. If BASENAMES is |
3446 | non-zero compare only lbasename of FILES. */ | |
3447 | ||
c906108c | 3448 | static int |
96142726 | 3449 | file_matches (const char *file, const char *files[], int nfiles, int basenames) |
c906108c SS |
3450 | { |
3451 | int i; | |
3452 | ||
3453 | if (file != NULL && nfiles != 0) | |
3454 | { | |
3455 | for (i = 0; i < nfiles; i++) | |
c5aa993b | 3456 | { |
fbd9ab74 JK |
3457 | if (compare_filenames_for_search (file, (basenames |
3458 | ? lbasename (files[i]) | |
3459 | : files[i]))) | |
c5aa993b JM |
3460 | return 1; |
3461 | } | |
c906108c SS |
3462 | } |
3463 | else if (nfiles == 0) | |
3464 | return 1; | |
3465 | return 0; | |
3466 | } | |
3467 | ||
c378eb4e | 3468 | /* Free any memory associated with a search. */ |
eca864fe | 3469 | |
c906108c | 3470 | void |
fba45db2 | 3471 | free_search_symbols (struct symbol_search *symbols) |
c906108c SS |
3472 | { |
3473 | struct symbol_search *p; | |
3474 | struct symbol_search *next; | |
3475 | ||
3476 | for (p = symbols; p != NULL; p = next) | |
3477 | { | |
3478 | next = p->next; | |
b8c9b27d | 3479 | xfree (p); |
c906108c SS |
3480 | } |
3481 | } | |
3482 | ||
5bd98722 | 3483 | static void |
b52109bc | 3484 | do_free_search_symbols_cleanup (void *symbolsp) |
5bd98722 | 3485 | { |
b52109bc DE |
3486 | struct symbol_search *symbols = *(struct symbol_search **) symbolsp; |
3487 | ||
5bd98722 AC |
3488 | free_search_symbols (symbols); |
3489 | } | |
3490 | ||
3491 | struct cleanup * | |
b52109bc | 3492 | make_cleanup_free_search_symbols (struct symbol_search **symbolsp) |
5bd98722 | 3493 | { |
b52109bc | 3494 | return make_cleanup (do_free_search_symbols_cleanup, symbolsp); |
5bd98722 AC |
3495 | } |
3496 | ||
b52109bc | 3497 | /* Helper function for sort_search_symbols_remove_dups and qsort. Can only |
434d2d4f | 3498 | sort symbols, not minimal symbols. */ |
eca864fe | 3499 | |
434d2d4f DJ |
3500 | static int |
3501 | compare_search_syms (const void *sa, const void *sb) | |
3502 | { | |
b52109bc DE |
3503 | struct symbol_search *sym_a = *(struct symbol_search **) sa; |
3504 | struct symbol_search *sym_b = *(struct symbol_search **) sb; | |
3505 | int c; | |
3506 | ||
042a84d9 | 3507 | c = FILENAME_CMP (sym_a->symtab->filename, sym_b->symtab->filename); |
b52109bc DE |
3508 | if (c != 0) |
3509 | return c; | |
434d2d4f | 3510 | |
b52109bc DE |
3511 | if (sym_a->block != sym_b->block) |
3512 | return sym_a->block - sym_b->block; | |
3513 | ||
3514 | return strcmp (SYMBOL_PRINT_NAME (sym_a->symbol), | |
3515 | SYMBOL_PRINT_NAME (sym_b->symbol)); | |
434d2d4f DJ |
3516 | } |
3517 | ||
b52109bc DE |
3518 | /* Sort the NFOUND symbols in list FOUND and remove duplicates. |
3519 | The duplicates are freed, and the new list is returned in | |
3520 | *NEW_HEAD, *NEW_TAIL. */ | |
3521 | ||
3522 | static void | |
3523 | sort_search_symbols_remove_dups (struct symbol_search *found, int nfound, | |
3524 | struct symbol_search **new_head, | |
3525 | struct symbol_search **new_tail) | |
434d2d4f DJ |
3526 | { |
3527 | struct symbol_search **symbols, *symp, *old_next; | |
b52109bc | 3528 | int i, j, nunique; |
434d2d4f | 3529 | |
b52109bc DE |
3530 | gdb_assert (found != NULL && nfound > 0); |
3531 | ||
3532 | /* Build an array out of the list so we can easily sort them. */ | |
434d2d4f DJ |
3533 | symbols = (struct symbol_search **) xmalloc (sizeof (struct symbol_search *) |
3534 | * nfound); | |
b52109bc | 3535 | symp = found; |
434d2d4f DJ |
3536 | for (i = 0; i < nfound; i++) |
3537 | { | |
b52109bc DE |
3538 | gdb_assert (symp != NULL); |
3539 | gdb_assert (symp->block >= 0 && symp->block <= 1); | |
434d2d4f DJ |
3540 | symbols[i] = symp; |
3541 | symp = symp->next; | |
3542 | } | |
b52109bc | 3543 | gdb_assert (symp == NULL); |
434d2d4f DJ |
3544 | |
3545 | qsort (symbols, nfound, sizeof (struct symbol_search *), | |
3546 | compare_search_syms); | |
3547 | ||
b52109bc DE |
3548 | /* Collapse out the dups. */ |
3549 | for (i = 1, j = 1; i < nfound; ++i) | |
434d2d4f | 3550 | { |
6b9780fb | 3551 | if (compare_search_syms (&symbols[j - 1], &symbols[i]) != 0) |
b52109bc DE |
3552 | symbols[j++] = symbols[i]; |
3553 | else | |
3554 | xfree (symbols[i]); | |
434d2d4f | 3555 | } |
b52109bc DE |
3556 | nunique = j; |
3557 | symbols[j - 1]->next = NULL; | |
3558 | ||
3559 | /* Rebuild the linked list. */ | |
3560 | for (i = 0; i < nunique - 1; i++) | |
3561 | symbols[i]->next = symbols[i + 1]; | |
3562 | symbols[nunique - 1]->next = NULL; | |
434d2d4f | 3563 | |
b52109bc DE |
3564 | *new_head = symbols[0]; |
3565 | *new_tail = symbols[nunique - 1]; | |
8ed32cc0 | 3566 | xfree (symbols); |
434d2d4f | 3567 | } |
5bd98722 | 3568 | |
ccefe4c4 TT |
3569 | /* An object of this type is passed as the user_data to the |
3570 | expand_symtabs_matching method. */ | |
3571 | struct search_symbols_data | |
3572 | { | |
3573 | int nfiles; | |
96142726 | 3574 | const char **files; |
681bf369 JK |
3575 | |
3576 | /* It is true if PREG contains valid data, false otherwise. */ | |
3577 | unsigned preg_p : 1; | |
3578 | regex_t preg; | |
ccefe4c4 TT |
3579 | }; |
3580 | ||
3581 | /* A callback for expand_symtabs_matching. */ | |
eca864fe | 3582 | |
ccefe4c4 | 3583 | static int |
fbd9ab74 JK |
3584 | search_symbols_file_matches (const char *filename, void *user_data, |
3585 | int basenames) | |
ccefe4c4 TT |
3586 | { |
3587 | struct search_symbols_data *data = user_data; | |
433759f7 | 3588 | |
fbd9ab74 | 3589 | return file_matches (filename, data->files, data->nfiles, basenames); |
ccefe4c4 TT |
3590 | } |
3591 | ||
3592 | /* A callback for expand_symtabs_matching. */ | |
eca864fe | 3593 | |
ccefe4c4 | 3594 | static int |
e078317b | 3595 | search_symbols_name_matches (const char *symname, void *user_data) |
ccefe4c4 TT |
3596 | { |
3597 | struct search_symbols_data *data = user_data; | |
433759f7 | 3598 | |
681bf369 | 3599 | return !data->preg_p || regexec (&data->preg, symname, 0, NULL, 0) == 0; |
ccefe4c4 TT |
3600 | } |
3601 | ||
c906108c SS |
3602 | /* Search the symbol table for matches to the regular expression REGEXP, |
3603 | returning the results in *MATCHES. | |
3604 | ||
3605 | Only symbols of KIND are searched: | |
e8930875 JK |
3606 | VARIABLES_DOMAIN - search all symbols, excluding functions, type names, |
3607 | and constants (enums) | |
176620f1 EZ |
3608 | FUNCTIONS_DOMAIN - search all functions |
3609 | TYPES_DOMAIN - search all type names | |
7b08b9eb | 3610 | ALL_DOMAIN - an internal error for this function |
c906108c SS |
3611 | |
3612 | free_search_symbols should be called when *MATCHES is no longer needed. | |
434d2d4f | 3613 | |
b52109bc DE |
3614 | Within each file the results are sorted locally; each symtab's global and |
3615 | static blocks are separately alphabetized. | |
3616 | Duplicate entries are removed. */ | |
c378eb4e | 3617 | |
c906108c | 3618 | void |
96142726 TT |
3619 | search_symbols (const char *regexp, enum search_domain kind, |
3620 | int nfiles, const char *files[], | |
fd118b61 | 3621 | struct symbol_search **matches) |
c906108c | 3622 | { |
52f0bd74 | 3623 | struct symtab *s; |
346d1dfe | 3624 | const struct blockvector *bv; |
52f0bd74 AC |
3625 | struct block *b; |
3626 | int i = 0; | |
8157b174 | 3627 | struct block_iterator iter; |
52f0bd74 | 3628 | struct symbol *sym; |
c906108c SS |
3629 | struct objfile *objfile; |
3630 | struct minimal_symbol *msymbol; | |
c906108c | 3631 | int found_misc = 0; |
bc043ef3 | 3632 | static const enum minimal_symbol_type types[] |
e8930875 | 3633 | = {mst_data, mst_text, mst_abs}; |
bc043ef3 | 3634 | static const enum minimal_symbol_type types2[] |
e8930875 | 3635 | = {mst_bss, mst_file_text, mst_abs}; |
bc043ef3 | 3636 | static const enum minimal_symbol_type types3[] |
e8930875 | 3637 | = {mst_file_data, mst_solib_trampoline, mst_abs}; |
bc043ef3 | 3638 | static const enum minimal_symbol_type types4[] |
e8930875 | 3639 | = {mst_file_bss, mst_text_gnu_ifunc, mst_abs}; |
c906108c SS |
3640 | enum minimal_symbol_type ourtype; |
3641 | enum minimal_symbol_type ourtype2; | |
3642 | enum minimal_symbol_type ourtype3; | |
3643 | enum minimal_symbol_type ourtype4; | |
b52109bc | 3644 | struct symbol_search *found; |
c906108c | 3645 | struct symbol_search *tail; |
ccefe4c4 | 3646 | struct search_symbols_data datum; |
b52109bc | 3647 | int nfound; |
c906108c | 3648 | |
681bf369 JK |
3649 | /* OLD_CHAIN .. RETVAL_CHAIN is always freed, RETVAL_CHAIN .. current |
3650 | CLEANUP_CHAIN is freed only in the case of an error. */ | |
3651 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); | |
3652 | struct cleanup *retval_chain; | |
3653 | ||
e8930875 JK |
3654 | gdb_assert (kind <= TYPES_DOMAIN); |
3655 | ||
8903c50d TT |
3656 | ourtype = types[kind]; |
3657 | ourtype2 = types2[kind]; | |
3658 | ourtype3 = types3[kind]; | |
3659 | ourtype4 = types4[kind]; | |
c906108c | 3660 | |
b52109bc | 3661 | *matches = NULL; |
681bf369 | 3662 | datum.preg_p = 0; |
c906108c SS |
3663 | |
3664 | if (regexp != NULL) | |
3665 | { | |
3666 | /* Make sure spacing is right for C++ operators. | |
3667 | This is just a courtesy to make the matching less sensitive | |
3668 | to how many spaces the user leaves between 'operator' | |
c378eb4e | 3669 | and <TYPENAME> or <OPERATOR>. */ |
96142726 TT |
3670 | const char *opend; |
3671 | const char *opname = operator_chars (regexp, &opend); | |
681bf369 | 3672 | int errcode; |
433759f7 | 3673 | |
c906108c | 3674 | if (*opname) |
c5aa993b | 3675 | { |
3e43a32a MS |
3676 | int fix = -1; /* -1 means ok; otherwise number of |
3677 | spaces needed. */ | |
433759f7 | 3678 | |
c5aa993b JM |
3679 | if (isalpha (*opname) || *opname == '_' || *opname == '$') |
3680 | { | |
c378eb4e | 3681 | /* There should 1 space between 'operator' and 'TYPENAME'. */ |
c5aa993b JM |
3682 | if (opname[-1] != ' ' || opname[-2] == ' ') |
3683 | fix = 1; | |
3684 | } | |
3685 | else | |
3686 | { | |
c378eb4e | 3687 | /* There should 0 spaces between 'operator' and 'OPERATOR'. */ |
c5aa993b JM |
3688 | if (opname[-1] == ' ') |
3689 | fix = 0; | |
3690 | } | |
c378eb4e | 3691 | /* If wrong number of spaces, fix it. */ |
c5aa993b JM |
3692 | if (fix >= 0) |
3693 | { | |
045f55a6 | 3694 | char *tmp = (char *) alloca (8 + fix + strlen (opname) + 1); |
433759f7 | 3695 | |
c5aa993b JM |
3696 | sprintf (tmp, "operator%.*s%s", fix, " ", opname); |
3697 | regexp = tmp; | |
3698 | } | |
3699 | } | |
3700 | ||
559a7a62 JK |
3701 | errcode = regcomp (&datum.preg, regexp, |
3702 | REG_NOSUB | (case_sensitivity == case_sensitive_off | |
3703 | ? REG_ICASE : 0)); | |
681bf369 JK |
3704 | if (errcode != 0) |
3705 | { | |
3706 | char *err = get_regcomp_error (errcode, &datum.preg); | |
3707 | ||
3708 | make_cleanup (xfree, err); | |
3709 | error (_("Invalid regexp (%s): %s"), err, regexp); | |
3710 | } | |
3711 | datum.preg_p = 1; | |
3712 | make_regfree_cleanup (&datum.preg); | |
c906108c SS |
3713 | } |
3714 | ||
3715 | /* Search through the partial symtabs *first* for all symbols | |
3716 | matching the regexp. That way we don't have to reproduce all of | |
c378eb4e | 3717 | the machinery below. */ |
c906108c | 3718 | |
ccefe4c4 TT |
3719 | datum.nfiles = nfiles; |
3720 | datum.files = files; | |
bb4142cf DE |
3721 | expand_symtabs_matching ((nfiles == 0 |
3722 | ? NULL | |
3723 | : search_symbols_file_matches), | |
3724 | search_symbols_name_matches, | |
3725 | kind, &datum); | |
c906108c SS |
3726 | |
3727 | /* Here, we search through the minimal symbol tables for functions | |
3728 | and variables that match, and force their symbols to be read. | |
3729 | This is in particular necessary for demangled variable names, | |
3730 | which are no longer put into the partial symbol tables. | |
3731 | The symbol will then be found during the scan of symtabs below. | |
3732 | ||
3733 | For functions, find_pc_symtab should succeed if we have debug info | |
422d65e7 DE |
3734 | for the function, for variables we have to call |
3735 | lookup_symbol_in_objfile_from_linkage_name to determine if the variable | |
3736 | has debug info. | |
c906108c | 3737 | If the lookup fails, set found_misc so that we will rescan to print |
422d65e7 DE |
3738 | any matching symbols without debug info. |
3739 | We only search the objfile the msymbol came from, we no longer search | |
3740 | all objfiles. In large programs (1000s of shared libs) searching all | |
3741 | objfiles is not worth the pain. */ | |
c906108c | 3742 | |
176620f1 | 3743 | if (nfiles == 0 && (kind == VARIABLES_DOMAIN || kind == FUNCTIONS_DOMAIN)) |
c906108c SS |
3744 | { |
3745 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b | 3746 | { |
89295b4d PP |
3747 | QUIT; |
3748 | ||
422d65e7 DE |
3749 | if (msymbol->created_by_gdb) |
3750 | continue; | |
3751 | ||
d50bd42b DE |
3752 | if (MSYMBOL_TYPE (msymbol) == ourtype |
3753 | || MSYMBOL_TYPE (msymbol) == ourtype2 | |
3754 | || MSYMBOL_TYPE (msymbol) == ourtype3 | |
3755 | || MSYMBOL_TYPE (msymbol) == ourtype4) | |
c5aa993b | 3756 | { |
681bf369 | 3757 | if (!datum.preg_p |
efd66ac6 | 3758 | || regexec (&datum.preg, MSYMBOL_NATURAL_NAME (msymbol), 0, |
681bf369 | 3759 | NULL, 0) == 0) |
c5aa993b | 3760 | { |
422d65e7 DE |
3761 | /* Note: An important side-effect of these lookup functions |
3762 | is to expand the symbol table if msymbol is found, for the | |
3763 | benefit of the next loop on ALL_PRIMARY_SYMTABS. */ | |
3764 | if (kind == FUNCTIONS_DOMAIN | |
77e371c0 TT |
3765 | ? find_pc_symtab (MSYMBOL_VALUE_ADDRESS (objfile, |
3766 | msymbol)) == NULL | |
422d65e7 | 3767 | : (lookup_symbol_in_objfile_from_linkage_name |
efd66ac6 | 3768 | (objfile, MSYMBOL_LINKAGE_NAME (msymbol), VAR_DOMAIN) |
422d65e7 DE |
3769 | == NULL)) |
3770 | found_misc = 1; | |
c5aa993b JM |
3771 | } |
3772 | } | |
3773 | } | |
c906108c SS |
3774 | } |
3775 | ||
b52109bc DE |
3776 | found = NULL; |
3777 | tail = NULL; | |
3778 | nfound = 0; | |
3779 | retval_chain = make_cleanup_free_search_symbols (&found); | |
3780 | ||
11309657 | 3781 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
3782 | { |
3783 | bv = BLOCKVECTOR (s); | |
d50bd42b DE |
3784 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) |
3785 | { | |
d50bd42b DE |
3786 | b = BLOCKVECTOR_BLOCK (bv, i); |
3787 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
3788 | { | |
3789 | struct symtab *real_symtab = SYMBOL_SYMTAB (sym); | |
3790 | ||
3791 | QUIT; | |
3792 | ||
fbd9ab74 JK |
3793 | /* Check first sole REAL_SYMTAB->FILENAME. It does not need to be |
3794 | a substring of symtab_to_fullname as it may contain "./" etc. */ | |
3795 | if ((file_matches (real_symtab->filename, files, nfiles, 0) | |
3796 | || ((basenames_may_differ | |
3797 | || file_matches (lbasename (real_symtab->filename), | |
3798 | files, nfiles, 1)) | |
3799 | && file_matches (symtab_to_fullname (real_symtab), | |
3800 | files, nfiles, 0))) | |
d50bd42b DE |
3801 | && ((!datum.preg_p |
3802 | || regexec (&datum.preg, SYMBOL_NATURAL_NAME (sym), 0, | |
3803 | NULL, 0) == 0) | |
3804 | && ((kind == VARIABLES_DOMAIN | |
3805 | && SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
3806 | && SYMBOL_CLASS (sym) != LOC_UNRESOLVED | |
3807 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
3808 | /* LOC_CONST can be used for more than just enums, | |
3809 | e.g., c++ static const members. | |
3810 | We only want to skip enums here. */ | |
3811 | && !(SYMBOL_CLASS (sym) == LOC_CONST | |
3812 | && TYPE_CODE (SYMBOL_TYPE (sym)) | |
3813 | == TYPE_CODE_ENUM)) | |
3814 | || (kind == FUNCTIONS_DOMAIN | |
3815 | && SYMBOL_CLASS (sym) == LOC_BLOCK) | |
3816 | || (kind == TYPES_DOMAIN | |
3817 | && SYMBOL_CLASS (sym) == LOC_TYPEDEF)))) | |
3818 | { | |
3819 | /* match */ | |
b52109bc | 3820 | struct symbol_search *psr = (struct symbol_search *) |
d50bd42b DE |
3821 | xmalloc (sizeof (struct symbol_search)); |
3822 | psr->block = i; | |
3823 | psr->symtab = real_symtab; | |
3824 | psr->symbol = sym; | |
7c7b6655 | 3825 | memset (&psr->msymbol, 0, sizeof (psr->msymbol)); |
d50bd42b DE |
3826 | psr->next = NULL; |
3827 | if (tail == NULL) | |
b52109bc | 3828 | found = psr; |
d50bd42b DE |
3829 | else |
3830 | tail->next = psr; | |
3831 | tail = psr; | |
3832 | nfound ++; | |
3833 | } | |
3834 | } | |
d50bd42b | 3835 | } |
c5aa993b | 3836 | } |
c906108c | 3837 | |
b52109bc DE |
3838 | if (found != NULL) |
3839 | { | |
3840 | sort_search_symbols_remove_dups (found, nfound, &found, &tail); | |
3841 | /* Note: nfound is no longer useful beyond this point. */ | |
3842 | } | |
3843 | ||
c906108c SS |
3844 | /* If there are no eyes, avoid all contact. I mean, if there are |
3845 | no debug symbols, then print directly from the msymbol_vector. */ | |
3846 | ||
422d65e7 | 3847 | if (found_misc || (nfiles == 0 && kind != FUNCTIONS_DOMAIN)) |
c906108c SS |
3848 | { |
3849 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b | 3850 | { |
89295b4d PP |
3851 | QUIT; |
3852 | ||
422d65e7 DE |
3853 | if (msymbol->created_by_gdb) |
3854 | continue; | |
3855 | ||
d50bd42b DE |
3856 | if (MSYMBOL_TYPE (msymbol) == ourtype |
3857 | || MSYMBOL_TYPE (msymbol) == ourtype2 | |
3858 | || MSYMBOL_TYPE (msymbol) == ourtype3 | |
3859 | || MSYMBOL_TYPE (msymbol) == ourtype4) | |
c5aa993b | 3860 | { |
681bf369 | 3861 | if (!datum.preg_p |
efd66ac6 | 3862 | || regexec (&datum.preg, MSYMBOL_NATURAL_NAME (msymbol), 0, |
681bf369 | 3863 | NULL, 0) == 0) |
c5aa993b | 3864 | { |
422d65e7 DE |
3865 | /* For functions we can do a quick check of whether the |
3866 | symbol might be found via find_pc_symtab. */ | |
3867 | if (kind != FUNCTIONS_DOMAIN | |
77e371c0 TT |
3868 | || find_pc_symtab (MSYMBOL_VALUE_ADDRESS (objfile, |
3869 | msymbol)) == NULL) | |
c5aa993b | 3870 | { |
422d65e7 | 3871 | if (lookup_symbol_in_objfile_from_linkage_name |
efd66ac6 | 3872 | (objfile, MSYMBOL_LINKAGE_NAME (msymbol), VAR_DOMAIN) |
422d65e7 | 3873 | == NULL) |
c5aa993b JM |
3874 | { |
3875 | /* match */ | |
b52109bc | 3876 | struct symbol_search *psr = (struct symbol_search *) |
3e43a32a | 3877 | xmalloc (sizeof (struct symbol_search)); |
c5aa993b | 3878 | psr->block = i; |
7c7b6655 TT |
3879 | psr->msymbol.minsym = msymbol; |
3880 | psr->msymbol.objfile = objfile; | |
c5aa993b JM |
3881 | psr->symtab = NULL; |
3882 | psr->symbol = NULL; | |
3883 | psr->next = NULL; | |
3884 | if (tail == NULL) | |
b52109bc | 3885 | found = psr; |
c5aa993b JM |
3886 | else |
3887 | tail->next = psr; | |
3888 | tail = psr; | |
3889 | } | |
3890 | } | |
3891 | } | |
3892 | } | |
3893 | } | |
c906108c SS |
3894 | } |
3895 | ||
681bf369 JK |
3896 | discard_cleanups (retval_chain); |
3897 | do_cleanups (old_chain); | |
b52109bc | 3898 | *matches = found; |
c906108c SS |
3899 | } |
3900 | ||
3901 | /* Helper function for symtab_symbol_info, this function uses | |
3902 | the data returned from search_symbols() to print information | |
c378eb4e MS |
3903 | regarding the match to gdb_stdout. */ |
3904 | ||
c906108c | 3905 | static void |
8903c50d TT |
3906 | print_symbol_info (enum search_domain kind, |
3907 | struct symtab *s, struct symbol *sym, | |
05cba821 | 3908 | int block, const char *last) |
c906108c | 3909 | { |
05cba821 JK |
3910 | const char *s_filename = symtab_to_filename_for_display (s); |
3911 | ||
3912 | if (last == NULL || filename_cmp (last, s_filename) != 0) | |
c906108c SS |
3913 | { |
3914 | fputs_filtered ("\nFile ", gdb_stdout); | |
05cba821 | 3915 | fputs_filtered (s_filename, gdb_stdout); |
c906108c SS |
3916 | fputs_filtered (":\n", gdb_stdout); |
3917 | } | |
3918 | ||
176620f1 | 3919 | if (kind != TYPES_DOMAIN && block == STATIC_BLOCK) |
c906108c | 3920 | printf_filtered ("static "); |
c5aa993b | 3921 | |
c378eb4e | 3922 | /* Typedef that is not a C++ class. */ |
176620f1 EZ |
3923 | if (kind == TYPES_DOMAIN |
3924 | && SYMBOL_DOMAIN (sym) != STRUCT_DOMAIN) | |
a5238fbc | 3925 | typedef_print (SYMBOL_TYPE (sym), sym, gdb_stdout); |
c378eb4e | 3926 | /* variable, func, or typedef-that-is-c++-class. */ |
d50bd42b DE |
3927 | else if (kind < TYPES_DOMAIN |
3928 | || (kind == TYPES_DOMAIN | |
3929 | && SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN)) | |
c906108c SS |
3930 | { |
3931 | type_print (SYMBOL_TYPE (sym), | |
c5aa993b | 3932 | (SYMBOL_CLASS (sym) == LOC_TYPEDEF |
de5ad195 | 3933 | ? "" : SYMBOL_PRINT_NAME (sym)), |
c5aa993b | 3934 | gdb_stdout, 0); |
c906108c SS |
3935 | |
3936 | printf_filtered (";\n"); | |
3937 | } | |
c906108c SS |
3938 | } |
3939 | ||
3940 | /* This help function for symtab_symbol_info() prints information | |
c378eb4e MS |
3941 | for non-debugging symbols to gdb_stdout. */ |
3942 | ||
c906108c | 3943 | static void |
7c7b6655 | 3944 | print_msymbol_info (struct bound_minimal_symbol msymbol) |
c906108c | 3945 | { |
7c7b6655 | 3946 | struct gdbarch *gdbarch = get_objfile_arch (msymbol.objfile); |
3ac4495a MS |
3947 | char *tmp; |
3948 | ||
d80b854b | 3949 | if (gdbarch_addr_bit (gdbarch) <= 32) |
77e371c0 | 3950 | tmp = hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol) |
bb599908 PH |
3951 | & (CORE_ADDR) 0xffffffff, |
3952 | 8); | |
3ac4495a | 3953 | else |
77e371c0 | 3954 | tmp = hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol), |
bb599908 | 3955 | 16); |
3ac4495a | 3956 | printf_filtered ("%s %s\n", |
efd66ac6 | 3957 | tmp, MSYMBOL_PRINT_NAME (msymbol.minsym)); |
c906108c SS |
3958 | } |
3959 | ||
3960 | /* This is the guts of the commands "info functions", "info types", and | |
c378eb4e | 3961 | "info variables". It calls search_symbols to find all matches and then |
c906108c | 3962 | print_[m]symbol_info to print out some useful information about the |
c378eb4e MS |
3963 | matches. */ |
3964 | ||
c906108c | 3965 | static void |
8903c50d | 3966 | symtab_symbol_info (char *regexp, enum search_domain kind, int from_tty) |
c906108c | 3967 | { |
bc043ef3 | 3968 | static const char * const classnames[] = |
e8930875 | 3969 | {"variable", "function", "type"}; |
c906108c SS |
3970 | struct symbol_search *symbols; |
3971 | struct symbol_search *p; | |
3972 | struct cleanup *old_chain; | |
05cba821 | 3973 | const char *last_filename = NULL; |
c906108c SS |
3974 | int first = 1; |
3975 | ||
e8930875 JK |
3976 | gdb_assert (kind <= TYPES_DOMAIN); |
3977 | ||
c378eb4e | 3978 | /* Must make sure that if we're interrupted, symbols gets freed. */ |
96142726 | 3979 | search_symbols (regexp, kind, 0, NULL, &symbols); |
b52109bc | 3980 | old_chain = make_cleanup_free_search_symbols (&symbols); |
c906108c | 3981 | |
ca242aad YQ |
3982 | if (regexp != NULL) |
3983 | printf_filtered (_("All %ss matching regular expression \"%s\":\n"), | |
3984 | classnames[kind], regexp); | |
3985 | else | |
3986 | printf_filtered (_("All defined %ss:\n"), classnames[kind]); | |
c906108c SS |
3987 | |
3988 | for (p = symbols; p != NULL; p = p->next) | |
3989 | { | |
3990 | QUIT; | |
3991 | ||
7c7b6655 | 3992 | if (p->msymbol.minsym != NULL) |
c5aa993b JM |
3993 | { |
3994 | if (first) | |
3995 | { | |
ca242aad | 3996 | printf_filtered (_("\nNon-debugging symbols:\n")); |
c5aa993b JM |
3997 | first = 0; |
3998 | } | |
3999 | print_msymbol_info (p->msymbol); | |
4000 | } | |
c906108c | 4001 | else |
c5aa993b JM |
4002 | { |
4003 | print_symbol_info (kind, | |
4004 | p->symtab, | |
4005 | p->symbol, | |
4006 | p->block, | |
4007 | last_filename); | |
05cba821 | 4008 | last_filename = symtab_to_filename_for_display (p->symtab); |
c5aa993b | 4009 | } |
c906108c SS |
4010 | } |
4011 | ||
4012 | do_cleanups (old_chain); | |
4013 | } | |
4014 | ||
4015 | static void | |
fba45db2 | 4016 | variables_info (char *regexp, int from_tty) |
c906108c | 4017 | { |
176620f1 | 4018 | symtab_symbol_info (regexp, VARIABLES_DOMAIN, from_tty); |
c906108c SS |
4019 | } |
4020 | ||
4021 | static void | |
fba45db2 | 4022 | functions_info (char *regexp, int from_tty) |
c906108c | 4023 | { |
176620f1 | 4024 | symtab_symbol_info (regexp, FUNCTIONS_DOMAIN, from_tty); |
c906108c SS |
4025 | } |
4026 | ||
357e46e7 | 4027 | |
c906108c | 4028 | static void |
fba45db2 | 4029 | types_info (char *regexp, int from_tty) |
c906108c | 4030 | { |
176620f1 | 4031 | symtab_symbol_info (regexp, TYPES_DOMAIN, from_tty); |
c906108c SS |
4032 | } |
4033 | ||
c378eb4e | 4034 | /* Breakpoint all functions matching regular expression. */ |
8926118c | 4035 | |
8b93c638 | 4036 | void |
fba45db2 | 4037 | rbreak_command_wrapper (char *regexp, int from_tty) |
8b93c638 JM |
4038 | { |
4039 | rbreak_command (regexp, from_tty); | |
4040 | } | |
8926118c | 4041 | |
95a42b64 TT |
4042 | /* A cleanup function that calls end_rbreak_breakpoints. */ |
4043 | ||
4044 | static void | |
4045 | do_end_rbreak_breakpoints (void *ignore) | |
4046 | { | |
4047 | end_rbreak_breakpoints (); | |
4048 | } | |
4049 | ||
c906108c | 4050 | static void |
fba45db2 | 4051 | rbreak_command (char *regexp, int from_tty) |
c906108c SS |
4052 | { |
4053 | struct symbol_search *ss; | |
4054 | struct symbol_search *p; | |
4055 | struct cleanup *old_chain; | |
95a42b64 TT |
4056 | char *string = NULL; |
4057 | int len = 0; | |
96142726 TT |
4058 | const char **files = NULL; |
4059 | const char *file_name; | |
8bd10a10 | 4060 | int nfiles = 0; |
c906108c | 4061 | |
8bd10a10 CM |
4062 | if (regexp) |
4063 | { | |
4064 | char *colon = strchr (regexp, ':'); | |
433759f7 | 4065 | |
8bd10a10 CM |
4066 | if (colon && *(colon + 1) != ':') |
4067 | { | |
4068 | int colon_index; | |
96142726 | 4069 | char *local_name; |
8bd10a10 CM |
4070 | |
4071 | colon_index = colon - regexp; | |
96142726 TT |
4072 | local_name = alloca (colon_index + 1); |
4073 | memcpy (local_name, regexp, colon_index); | |
4074 | local_name[colon_index--] = 0; | |
4075 | while (isspace (local_name[colon_index])) | |
4076 | local_name[colon_index--] = 0; | |
4077 | file_name = local_name; | |
8bd10a10 CM |
4078 | files = &file_name; |
4079 | nfiles = 1; | |
529480d0 | 4080 | regexp = skip_spaces (colon + 1); |
8bd10a10 CM |
4081 | } |
4082 | } | |
4083 | ||
4084 | search_symbols (regexp, FUNCTIONS_DOMAIN, nfiles, files, &ss); | |
b52109bc | 4085 | old_chain = make_cleanup_free_search_symbols (&ss); |
95a42b64 | 4086 | make_cleanup (free_current_contents, &string); |
c906108c | 4087 | |
95a42b64 TT |
4088 | start_rbreak_breakpoints (); |
4089 | make_cleanup (do_end_rbreak_breakpoints, NULL); | |
c906108c SS |
4090 | for (p = ss; p != NULL; p = p->next) |
4091 | { | |
7c7b6655 | 4092 | if (p->msymbol.minsym == NULL) |
c5aa993b | 4093 | { |
05cba821 JK |
4094 | const char *fullname = symtab_to_fullname (p->symtab); |
4095 | ||
4096 | int newlen = (strlen (fullname) | |
95a42b64 TT |
4097 | + strlen (SYMBOL_LINKAGE_NAME (p->symbol)) |
4098 | + 4); | |
433759f7 | 4099 | |
95a42b64 TT |
4100 | if (newlen > len) |
4101 | { | |
4102 | string = xrealloc (string, newlen); | |
4103 | len = newlen; | |
4104 | } | |
05cba821 | 4105 | strcpy (string, fullname); |
c5aa993b | 4106 | strcat (string, ":'"); |
2335f48e | 4107 | strcat (string, SYMBOL_LINKAGE_NAME (p->symbol)); |
c5aa993b JM |
4108 | strcat (string, "'"); |
4109 | break_command (string, from_tty); | |
176620f1 | 4110 | print_symbol_info (FUNCTIONS_DOMAIN, |
c5aa993b JM |
4111 | p->symtab, |
4112 | p->symbol, | |
4113 | p->block, | |
05cba821 | 4114 | symtab_to_filename_for_display (p->symtab)); |
c5aa993b | 4115 | } |
c906108c | 4116 | else |
c5aa993b | 4117 | { |
efd66ac6 | 4118 | int newlen = (strlen (MSYMBOL_LINKAGE_NAME (p->msymbol.minsym)) + 3); |
433759f7 | 4119 | |
95a42b64 TT |
4120 | if (newlen > len) |
4121 | { | |
4122 | string = xrealloc (string, newlen); | |
4123 | len = newlen; | |
4124 | } | |
6214f497 | 4125 | strcpy (string, "'"); |
efd66ac6 | 4126 | strcat (string, MSYMBOL_LINKAGE_NAME (p->msymbol.minsym)); |
6214f497 DJ |
4127 | strcat (string, "'"); |
4128 | ||
4129 | break_command (string, from_tty); | |
c5aa993b | 4130 | printf_filtered ("<function, no debug info> %s;\n", |
efd66ac6 | 4131 | MSYMBOL_PRINT_NAME (p->msymbol.minsym)); |
c5aa993b | 4132 | } |
c906108c SS |
4133 | } |
4134 | ||
4135 | do_cleanups (old_chain); | |
4136 | } | |
c906108c | 4137 | \f |
c5aa993b | 4138 | |
1976171a JK |
4139 | /* Evaluate if NAME matches SYM_TEXT and SYM_TEXT_LEN. |
4140 | ||
4141 | Either sym_text[sym_text_len] != '(' and then we search for any | |
4142 | symbol starting with SYM_TEXT text. | |
4143 | ||
4144 | Otherwise sym_text[sym_text_len] == '(' and then we require symbol name to | |
4145 | be terminated at that point. Partial symbol tables do not have parameters | |
4146 | information. */ | |
4147 | ||
4148 | static int | |
4149 | compare_symbol_name (const char *name, const char *sym_text, int sym_text_len) | |
4150 | { | |
4151 | int (*ncmp) (const char *, const char *, size_t); | |
4152 | ||
4153 | ncmp = (case_sensitivity == case_sensitive_on ? strncmp : strncasecmp); | |
4154 | ||
4155 | if (ncmp (name, sym_text, sym_text_len) != 0) | |
4156 | return 0; | |
4157 | ||
4158 | if (sym_text[sym_text_len] == '(') | |
4159 | { | |
4160 | /* User searches for `name(someth...'. Require NAME to be terminated. | |
4161 | Normally psymtabs and gdbindex have no parameter types so '\0' will be | |
4162 | present but accept even parameters presence. In this case this | |
4163 | function is in fact strcmp_iw but whitespace skipping is not supported | |
4164 | for tab completion. */ | |
4165 | ||
4166 | if (name[sym_text_len] != '\0' && name[sym_text_len] != '(') | |
4167 | return 0; | |
4168 | } | |
4169 | ||
4170 | return 1; | |
4171 | } | |
4172 | ||
821296b7 SA |
4173 | /* Free any memory associated with a completion list. */ |
4174 | ||
4175 | static void | |
49c4e619 | 4176 | free_completion_list (VEC (char_ptr) **list_ptr) |
821296b7 | 4177 | { |
49c4e619 TT |
4178 | int i; |
4179 | char *p; | |
821296b7 | 4180 | |
49c4e619 TT |
4181 | for (i = 0; VEC_iterate (char_ptr, *list_ptr, i, p); ++i) |
4182 | xfree (p); | |
4183 | VEC_free (char_ptr, *list_ptr); | |
821296b7 SA |
4184 | } |
4185 | ||
4186 | /* Callback for make_cleanup. */ | |
4187 | ||
4188 | static void | |
4189 | do_free_completion_list (void *list) | |
4190 | { | |
4191 | free_completion_list (list); | |
4192 | } | |
4193 | ||
c906108c SS |
4194 | /* Helper routine for make_symbol_completion_list. */ |
4195 | ||
49c4e619 | 4196 | static VEC (char_ptr) *return_val; |
c906108c SS |
4197 | |
4198 | #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \ | |
c906108c | 4199 | completion_list_add_name \ |
2335f48e | 4200 | (SYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word)) |
c906108c | 4201 | |
efd66ac6 TT |
4202 | #define MCOMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \ |
4203 | completion_list_add_name \ | |
4204 | (MSYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word)) | |
4205 | ||
c906108c | 4206 | /* Test to see if the symbol specified by SYMNAME (which is already |
c5aa993b | 4207 | demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN |
c378eb4e | 4208 | characters. If so, add it to the current completion list. */ |
c906108c SS |
4209 | |
4210 | static void | |
0d5cff50 DE |
4211 | completion_list_add_name (const char *symname, |
4212 | const char *sym_text, int sym_text_len, | |
4213 | const char *text, const char *word) | |
c906108c | 4214 | { |
c378eb4e | 4215 | /* Clip symbols that cannot match. */ |
1976171a JK |
4216 | if (!compare_symbol_name (symname, sym_text, sym_text_len)) |
4217 | return; | |
c906108c | 4218 | |
c906108c | 4219 | /* We have a match for a completion, so add SYMNAME to the current list |
c378eb4e | 4220 | of matches. Note that the name is moved to freshly malloc'd space. */ |
c906108c SS |
4221 | |
4222 | { | |
4223 | char *new; | |
433759f7 | 4224 | |
c906108c SS |
4225 | if (word == sym_text) |
4226 | { | |
4227 | new = xmalloc (strlen (symname) + 5); | |
4228 | strcpy (new, symname); | |
4229 | } | |
4230 | else if (word > sym_text) | |
4231 | { | |
4232 | /* Return some portion of symname. */ | |
4233 | new = xmalloc (strlen (symname) + 5); | |
4234 | strcpy (new, symname + (word - sym_text)); | |
4235 | } | |
4236 | else | |
4237 | { | |
4238 | /* Return some of SYM_TEXT plus symname. */ | |
4239 | new = xmalloc (strlen (symname) + (sym_text - word) + 5); | |
4240 | strncpy (new, word, sym_text - word); | |
4241 | new[sym_text - word] = '\0'; | |
4242 | strcat (new, symname); | |
4243 | } | |
4244 | ||
49c4e619 | 4245 | VEC_safe_push (char_ptr, return_val, new); |
c906108c SS |
4246 | } |
4247 | } | |
4248 | ||
69636828 AF |
4249 | /* ObjC: In case we are completing on a selector, look as the msymbol |
4250 | again and feed all the selectors into the mill. */ | |
4251 | ||
4252 | static void | |
0d5cff50 DE |
4253 | completion_list_objc_symbol (struct minimal_symbol *msymbol, |
4254 | const char *sym_text, int sym_text_len, | |
4255 | const char *text, const char *word) | |
69636828 AF |
4256 | { |
4257 | static char *tmp = NULL; | |
4258 | static unsigned int tmplen = 0; | |
9af17804 | 4259 | |
0d5cff50 | 4260 | const char *method, *category, *selector; |
69636828 | 4261 | char *tmp2 = NULL; |
9af17804 | 4262 | |
efd66ac6 | 4263 | method = MSYMBOL_NATURAL_NAME (msymbol); |
69636828 AF |
4264 | |
4265 | /* Is it a method? */ | |
4266 | if ((method[0] != '-') && (method[0] != '+')) | |
4267 | return; | |
4268 | ||
4269 | if (sym_text[0] == '[') | |
4270 | /* Complete on shortened method method. */ | |
4271 | completion_list_add_name (method + 1, sym_text, sym_text_len, text, word); | |
9af17804 | 4272 | |
69636828 AF |
4273 | while ((strlen (method) + 1) >= tmplen) |
4274 | { | |
4275 | if (tmplen == 0) | |
4276 | tmplen = 1024; | |
4277 | else | |
4278 | tmplen *= 2; | |
4279 | tmp = xrealloc (tmp, tmplen); | |
4280 | } | |
4281 | selector = strchr (method, ' '); | |
4282 | if (selector != NULL) | |
4283 | selector++; | |
9af17804 | 4284 | |
69636828 | 4285 | category = strchr (method, '('); |
9af17804 | 4286 | |
69636828 AF |
4287 | if ((category != NULL) && (selector != NULL)) |
4288 | { | |
4289 | memcpy (tmp, method, (category - method)); | |
4290 | tmp[category - method] = ' '; | |
4291 | memcpy (tmp + (category - method) + 1, selector, strlen (selector) + 1); | |
4292 | completion_list_add_name (tmp, sym_text, sym_text_len, text, word); | |
4293 | if (sym_text[0] == '[') | |
4294 | completion_list_add_name (tmp + 1, sym_text, sym_text_len, text, word); | |
4295 | } | |
9af17804 | 4296 | |
69636828 AF |
4297 | if (selector != NULL) |
4298 | { | |
4299 | /* Complete on selector only. */ | |
4300 | strcpy (tmp, selector); | |
4301 | tmp2 = strchr (tmp, ']'); | |
4302 | if (tmp2 != NULL) | |
4303 | *tmp2 = '\0'; | |
9af17804 | 4304 | |
69636828 AF |
4305 | completion_list_add_name (tmp, sym_text, sym_text_len, text, word); |
4306 | } | |
4307 | } | |
4308 | ||
4309 | /* Break the non-quoted text based on the characters which are in | |
c378eb4e | 4310 | symbols. FIXME: This should probably be language-specific. */ |
69636828 | 4311 | |
6f937416 PA |
4312 | static const char * |
4313 | language_search_unquoted_string (const char *text, const char *p) | |
69636828 AF |
4314 | { |
4315 | for (; p > text; --p) | |
4316 | { | |
4317 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0') | |
4318 | continue; | |
4319 | else | |
4320 | { | |
4321 | if ((current_language->la_language == language_objc)) | |
4322 | { | |
c378eb4e | 4323 | if (p[-1] == ':') /* Might be part of a method name. */ |
69636828 AF |
4324 | continue; |
4325 | else if (p[-1] == '[' && (p[-2] == '-' || p[-2] == '+')) | |
c378eb4e | 4326 | p -= 2; /* Beginning of a method name. */ |
69636828 | 4327 | else if (p[-1] == ' ' || p[-1] == '(' || p[-1] == ')') |
c378eb4e | 4328 | { /* Might be part of a method name. */ |
6f937416 | 4329 | const char *t = p; |
69636828 AF |
4330 | |
4331 | /* Seeing a ' ' or a '(' is not conclusive evidence | |
4332 | that we are in the middle of a method name. However, | |
4333 | finding "-[" or "+[" should be pretty un-ambiguous. | |
4334 | Unfortunately we have to find it now to decide. */ | |
4335 | ||
4336 | while (t > text) | |
4337 | if (isalnum (t[-1]) || t[-1] == '_' || | |
4338 | t[-1] == ' ' || t[-1] == ':' || | |
4339 | t[-1] == '(' || t[-1] == ')') | |
4340 | --t; | |
4341 | else | |
4342 | break; | |
4343 | ||
4344 | if (t[-1] == '[' && (t[-2] == '-' || t[-2] == '+')) | |
c378eb4e MS |
4345 | p = t - 2; /* Method name detected. */ |
4346 | /* Else we leave with p unchanged. */ | |
69636828 AF |
4347 | } |
4348 | } | |
4349 | break; | |
4350 | } | |
4351 | } | |
4352 | return p; | |
4353 | } | |
4354 | ||
edb3359d | 4355 | static void |
6f937416 PA |
4356 | completion_list_add_fields (struct symbol *sym, const char *sym_text, |
4357 | int sym_text_len, const char *text, | |
4358 | const char *word) | |
edb3359d DJ |
4359 | { |
4360 | if (SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
4361 | { | |
4362 | struct type *t = SYMBOL_TYPE (sym); | |
4363 | enum type_code c = TYPE_CODE (t); | |
4364 | int j; | |
4365 | ||
4366 | if (c == TYPE_CODE_UNION || c == TYPE_CODE_STRUCT) | |
4367 | for (j = TYPE_N_BASECLASSES (t); j < TYPE_NFIELDS (t); j++) | |
4368 | if (TYPE_FIELD_NAME (t, j)) | |
4369 | completion_list_add_name (TYPE_FIELD_NAME (t, j), | |
4370 | sym_text, sym_text_len, text, word); | |
4371 | } | |
4372 | } | |
4373 | ||
ccefe4c4 | 4374 | /* Type of the user_data argument passed to add_macro_name or |
bb4142cf | 4375 | symbol_completion_matcher. The contents are simply whatever is |
ccefe4c4 TT |
4376 | needed by completion_list_add_name. */ |
4377 | struct add_name_data | |
9a044a89 | 4378 | { |
6f937416 | 4379 | const char *sym_text; |
9a044a89 | 4380 | int sym_text_len; |
6f937416 PA |
4381 | const char *text; |
4382 | const char *word; | |
9a044a89 TT |
4383 | }; |
4384 | ||
4385 | /* A callback used with macro_for_each and macro_for_each_in_scope. | |
4386 | This adds a macro's name to the current completion list. */ | |
eca864fe | 4387 | |
9a044a89 TT |
4388 | static void |
4389 | add_macro_name (const char *name, const struct macro_definition *ignore, | |
9b158ba0 | 4390 | struct macro_source_file *ignore2, int ignore3, |
9a044a89 TT |
4391 | void *user_data) |
4392 | { | |
ccefe4c4 | 4393 | struct add_name_data *datum = (struct add_name_data *) user_data; |
433759f7 | 4394 | |
ac1a991b | 4395 | completion_list_add_name (name, |
ccefe4c4 TT |
4396 | datum->sym_text, datum->sym_text_len, |
4397 | datum->text, datum->word); | |
4398 | } | |
4399 | ||
bb4142cf | 4400 | /* A callback for expand_symtabs_matching. */ |
eca864fe | 4401 | |
7b08b9eb | 4402 | static int |
bb4142cf | 4403 | symbol_completion_matcher (const char *name, void *user_data) |
ccefe4c4 TT |
4404 | { |
4405 | struct add_name_data *datum = (struct add_name_data *) user_data; | |
165195f4 | 4406 | |
1976171a | 4407 | return compare_symbol_name (name, datum->sym_text, datum->sym_text_len); |
9a044a89 TT |
4408 | } |
4409 | ||
49c4e619 | 4410 | VEC (char_ptr) * |
6f937416 PA |
4411 | default_make_symbol_completion_list_break_on (const char *text, |
4412 | const char *word, | |
2f68a895 TT |
4413 | const char *break_on, |
4414 | enum type_code code) | |
c906108c | 4415 | { |
41d27058 JB |
4416 | /* Problem: All of the symbols have to be copied because readline |
4417 | frees them. I'm not going to worry about this; hopefully there | |
4418 | won't be that many. */ | |
4419 | ||
de4f826b DC |
4420 | struct symbol *sym; |
4421 | struct symtab *s; | |
de4f826b DC |
4422 | struct minimal_symbol *msymbol; |
4423 | struct objfile *objfile; | |
3977b71f | 4424 | const struct block *b; |
edb3359d | 4425 | const struct block *surrounding_static_block, *surrounding_global_block; |
8157b174 | 4426 | struct block_iterator iter; |
c906108c | 4427 | /* The symbol we are completing on. Points in same buffer as text. */ |
6f937416 | 4428 | const char *sym_text; |
c906108c SS |
4429 | /* Length of sym_text. */ |
4430 | int sym_text_len; | |
ccefe4c4 | 4431 | struct add_name_data datum; |
821296b7 | 4432 | struct cleanup *back_to; |
c906108c | 4433 | |
41d27058 | 4434 | /* Now look for the symbol we are supposed to complete on. */ |
c906108c | 4435 | { |
6f937416 | 4436 | const char *p; |
c906108c | 4437 | char quote_found; |
6f937416 | 4438 | const char *quote_pos = NULL; |
c906108c SS |
4439 | |
4440 | /* First see if this is a quoted string. */ | |
4441 | quote_found = '\0'; | |
4442 | for (p = text; *p != '\0'; ++p) | |
4443 | { | |
4444 | if (quote_found != '\0') | |
4445 | { | |
4446 | if (*p == quote_found) | |
4447 | /* Found close quote. */ | |
4448 | quote_found = '\0'; | |
4449 | else if (*p == '\\' && p[1] == quote_found) | |
4450 | /* A backslash followed by the quote character | |
c5aa993b | 4451 | doesn't end the string. */ |
c906108c SS |
4452 | ++p; |
4453 | } | |
4454 | else if (*p == '\'' || *p == '"') | |
4455 | { | |
4456 | quote_found = *p; | |
4457 | quote_pos = p; | |
4458 | } | |
4459 | } | |
4460 | if (quote_found == '\'') | |
4461 | /* A string within single quotes can be a symbol, so complete on it. */ | |
4462 | sym_text = quote_pos + 1; | |
4463 | else if (quote_found == '"') | |
4464 | /* A double-quoted string is never a symbol, nor does it make sense | |
c5aa993b | 4465 | to complete it any other way. */ |
c94fdfd0 | 4466 | { |
49c4e619 | 4467 | return NULL; |
c94fdfd0 | 4468 | } |
c906108c SS |
4469 | else |
4470 | { | |
4471 | /* It is not a quoted string. Break it based on the characters | |
4472 | which are in symbols. */ | |
4473 | while (p > text) | |
4474 | { | |
95699ff0 | 4475 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0' |
f55ee35c | 4476 | || p[-1] == ':' || strchr (break_on, p[-1]) != NULL) |
c906108c SS |
4477 | --p; |
4478 | else | |
4479 | break; | |
4480 | } | |
4481 | sym_text = p; | |
4482 | } | |
4483 | } | |
4484 | ||
4485 | sym_text_len = strlen (sym_text); | |
4486 | ||
1976171a JK |
4487 | /* Prepare SYM_TEXT_LEN for compare_symbol_name. */ |
4488 | ||
4489 | if (current_language->la_language == language_cplus | |
4490 | || current_language->la_language == language_java | |
4491 | || current_language->la_language == language_fortran) | |
4492 | { | |
4493 | /* These languages may have parameters entered by user but they are never | |
4494 | present in the partial symbol tables. */ | |
4495 | ||
4496 | const char *cs = memchr (sym_text, '(', sym_text_len); | |
4497 | ||
4498 | if (cs) | |
4499 | sym_text_len = cs - sym_text; | |
4500 | } | |
4501 | gdb_assert (sym_text[sym_text_len] == '\0' || sym_text[sym_text_len] == '('); | |
4502 | ||
49c4e619 | 4503 | return_val = NULL; |
821296b7 | 4504 | back_to = make_cleanup (do_free_completion_list, &return_val); |
c906108c | 4505 | |
ccefe4c4 TT |
4506 | datum.sym_text = sym_text; |
4507 | datum.sym_text_len = sym_text_len; | |
4508 | datum.text = text; | |
4509 | datum.word = word; | |
4510 | ||
c906108c | 4511 | /* Look through the partial symtabs for all symbols which begin |
7b08b9eb JK |
4512 | by matching SYM_TEXT. Expand all CUs that you find to the list. |
4513 | The real names will get added by COMPLETION_LIST_ADD_SYMBOL below. */ | |
bb4142cf DE |
4514 | expand_symtabs_matching (NULL, symbol_completion_matcher, ALL_DOMAIN, |
4515 | &datum); | |
c906108c SS |
4516 | |
4517 | /* At this point scan through the misc symbol vectors and add each | |
4518 | symbol you find to the list. Eventually we want to ignore | |
4519 | anything that isn't a text symbol (everything else will be | |
4520 | handled by the psymtab code above). */ | |
4521 | ||
2f68a895 TT |
4522 | if (code == TYPE_CODE_UNDEF) |
4523 | { | |
4524 | ALL_MSYMBOLS (objfile, msymbol) | |
4525 | { | |
4526 | QUIT; | |
efd66ac6 TT |
4527 | MCOMPLETION_LIST_ADD_SYMBOL (msymbol, sym_text, sym_text_len, text, |
4528 | word); | |
9af17804 | 4529 | |
2f68a895 TT |
4530 | completion_list_objc_symbol (msymbol, sym_text, sym_text_len, text, |
4531 | word); | |
4532 | } | |
4533 | } | |
c906108c SS |
4534 | |
4535 | /* Search upwards from currently selected frame (so that we can | |
edb3359d DJ |
4536 | complete on local vars). Also catch fields of types defined in |
4537 | this places which match our text string. Only complete on types | |
c378eb4e | 4538 | visible from current context. */ |
edb3359d DJ |
4539 | |
4540 | b = get_selected_block (0); | |
4541 | surrounding_static_block = block_static_block (b); | |
4542 | surrounding_global_block = block_global_block (b); | |
4543 | if (surrounding_static_block != NULL) | |
4544 | while (b != surrounding_static_block) | |
4545 | { | |
4546 | QUIT; | |
c906108c | 4547 | |
edb3359d DJ |
4548 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
4549 | { | |
2f68a895 TT |
4550 | if (code == TYPE_CODE_UNDEF) |
4551 | { | |
4552 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, | |
4553 | word); | |
4554 | completion_list_add_fields (sym, sym_text, sym_text_len, text, | |
4555 | word); | |
4556 | } | |
4557 | else if (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN | |
4558 | && TYPE_CODE (SYMBOL_TYPE (sym)) == code) | |
4559 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, | |
4560 | word); | |
edb3359d | 4561 | } |
c5aa993b | 4562 | |
edb3359d DJ |
4563 | /* Stop when we encounter an enclosing function. Do not stop for |
4564 | non-inlined functions - the locals of the enclosing function | |
4565 | are in scope for a nested function. */ | |
4566 | if (BLOCK_FUNCTION (b) != NULL && block_inlined_p (b)) | |
4567 | break; | |
4568 | b = BLOCK_SUPERBLOCK (b); | |
4569 | } | |
c906108c | 4570 | |
edb3359d | 4571 | /* Add fields from the file's types; symbols will be added below. */ |
c906108c | 4572 | |
2f68a895 TT |
4573 | if (code == TYPE_CODE_UNDEF) |
4574 | { | |
4575 | if (surrounding_static_block != NULL) | |
4576 | ALL_BLOCK_SYMBOLS (surrounding_static_block, iter, sym) | |
4577 | completion_list_add_fields (sym, sym_text, sym_text_len, text, word); | |
edb3359d | 4578 | |
2f68a895 TT |
4579 | if (surrounding_global_block != NULL) |
4580 | ALL_BLOCK_SYMBOLS (surrounding_global_block, iter, sym) | |
4581 | completion_list_add_fields (sym, sym_text, sym_text_len, text, word); | |
4582 | } | |
c906108c SS |
4583 | |
4584 | /* Go through the symtabs and check the externs and statics for | |
4585 | symbols which match. */ | |
4586 | ||
11309657 | 4587 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
4588 | { |
4589 | QUIT; | |
4590 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
de4f826b | 4591 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 4592 | { |
2f68a895 TT |
4593 | if (code == TYPE_CODE_UNDEF |
4594 | || (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN | |
4595 | && TYPE_CODE (SYMBOL_TYPE (sym)) == code)) | |
4596 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); | |
c5aa993b JM |
4597 | } |
4598 | } | |
c906108c | 4599 | |
11309657 | 4600 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
4601 | { |
4602 | QUIT; | |
4603 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
de4f826b | 4604 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 4605 | { |
2f68a895 TT |
4606 | if (code == TYPE_CODE_UNDEF |
4607 | || (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN | |
4608 | && TYPE_CODE (SYMBOL_TYPE (sym)) == code)) | |
4609 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); | |
c5aa993b JM |
4610 | } |
4611 | } | |
c906108c | 4612 | |
2f68a895 TT |
4613 | /* Skip macros if we are completing a struct tag -- arguable but |
4614 | usually what is expected. */ | |
4615 | if (current_language->la_macro_expansion == macro_expansion_c | |
4616 | && code == TYPE_CODE_UNDEF) | |
9a044a89 TT |
4617 | { |
4618 | struct macro_scope *scope; | |
9a044a89 TT |
4619 | |
4620 | /* Add any macros visible in the default scope. Note that this | |
4621 | may yield the occasional wrong result, because an expression | |
4622 | might be evaluated in a scope other than the default. For | |
4623 | example, if the user types "break file:line if <TAB>", the | |
4624 | resulting expression will be evaluated at "file:line" -- but | |
4625 | at there does not seem to be a way to detect this at | |
4626 | completion time. */ | |
4627 | scope = default_macro_scope (); | |
4628 | if (scope) | |
4629 | { | |
4630 | macro_for_each_in_scope (scope->file, scope->line, | |
4631 | add_macro_name, &datum); | |
4632 | xfree (scope); | |
4633 | } | |
4634 | ||
4635 | /* User-defined macros are always visible. */ | |
4636 | macro_for_each (macro_user_macros, add_macro_name, &datum); | |
4637 | } | |
4638 | ||
821296b7 | 4639 | discard_cleanups (back_to); |
c906108c SS |
4640 | return (return_val); |
4641 | } | |
4642 | ||
49c4e619 | 4643 | VEC (char_ptr) * |
6f937416 | 4644 | default_make_symbol_completion_list (const char *text, const char *word, |
2f68a895 | 4645 | enum type_code code) |
f55ee35c | 4646 | { |
2f68a895 | 4647 | return default_make_symbol_completion_list_break_on (text, word, "", code); |
f55ee35c JK |
4648 | } |
4649 | ||
49c4e619 TT |
4650 | /* Return a vector of all symbols (regardless of class) which begin by |
4651 | matching TEXT. If the answer is no symbols, then the return value | |
4652 | is NULL. */ | |
41d27058 | 4653 | |
49c4e619 | 4654 | VEC (char_ptr) * |
6f937416 | 4655 | make_symbol_completion_list (const char *text, const char *word) |
41d27058 | 4656 | { |
2f68a895 TT |
4657 | return current_language->la_make_symbol_completion_list (text, word, |
4658 | TYPE_CODE_UNDEF); | |
4659 | } | |
4660 | ||
4661 | /* Like make_symbol_completion_list, but only return STRUCT_DOMAIN | |
4662 | symbols whose type code is CODE. */ | |
4663 | ||
4664 | VEC (char_ptr) * | |
6f937416 PA |
4665 | make_symbol_completion_type (const char *text, const char *word, |
4666 | enum type_code code) | |
2f68a895 TT |
4667 | { |
4668 | gdb_assert (code == TYPE_CODE_UNION | |
4669 | || code == TYPE_CODE_STRUCT | |
2f68a895 TT |
4670 | || code == TYPE_CODE_ENUM); |
4671 | return current_language->la_make_symbol_completion_list (text, word, code); | |
41d27058 JB |
4672 | } |
4673 | ||
d8906c6f TJB |
4674 | /* Like make_symbol_completion_list, but suitable for use as a |
4675 | completion function. */ | |
4676 | ||
49c4e619 | 4677 | VEC (char_ptr) * |
d8906c6f | 4678 | make_symbol_completion_list_fn (struct cmd_list_element *ignore, |
6f937416 | 4679 | const char *text, const char *word) |
d8906c6f TJB |
4680 | { |
4681 | return make_symbol_completion_list (text, word); | |
4682 | } | |
4683 | ||
c94fdfd0 EZ |
4684 | /* Like make_symbol_completion_list, but returns a list of symbols |
4685 | defined in a source file FILE. */ | |
4686 | ||
49c4e619 | 4687 | VEC (char_ptr) * |
6f937416 PA |
4688 | make_file_symbol_completion_list (const char *text, const char *word, |
4689 | const char *srcfile) | |
c94fdfd0 | 4690 | { |
52f0bd74 AC |
4691 | struct symbol *sym; |
4692 | struct symtab *s; | |
4693 | struct block *b; | |
8157b174 | 4694 | struct block_iterator iter; |
c94fdfd0 | 4695 | /* The symbol we are completing on. Points in same buffer as text. */ |
6f937416 | 4696 | const char *sym_text; |
c94fdfd0 EZ |
4697 | /* Length of sym_text. */ |
4698 | int sym_text_len; | |
4699 | ||
4700 | /* Now look for the symbol we are supposed to complete on. | |
4701 | FIXME: This should be language-specific. */ | |
4702 | { | |
6f937416 | 4703 | const char *p; |
c94fdfd0 | 4704 | char quote_found; |
6f937416 | 4705 | const char *quote_pos = NULL; |
c94fdfd0 EZ |
4706 | |
4707 | /* First see if this is a quoted string. */ | |
4708 | quote_found = '\0'; | |
4709 | for (p = text; *p != '\0'; ++p) | |
4710 | { | |
4711 | if (quote_found != '\0') | |
4712 | { | |
4713 | if (*p == quote_found) | |
4714 | /* Found close quote. */ | |
4715 | quote_found = '\0'; | |
4716 | else if (*p == '\\' && p[1] == quote_found) | |
4717 | /* A backslash followed by the quote character | |
4718 | doesn't end the string. */ | |
4719 | ++p; | |
4720 | } | |
4721 | else if (*p == '\'' || *p == '"') | |
4722 | { | |
4723 | quote_found = *p; | |
4724 | quote_pos = p; | |
4725 | } | |
4726 | } | |
4727 | if (quote_found == '\'') | |
4728 | /* A string within single quotes can be a symbol, so complete on it. */ | |
4729 | sym_text = quote_pos + 1; | |
4730 | else if (quote_found == '"') | |
4731 | /* A double-quoted string is never a symbol, nor does it make sense | |
4732 | to complete it any other way. */ | |
4733 | { | |
49c4e619 | 4734 | return NULL; |
c94fdfd0 EZ |
4735 | } |
4736 | else | |
4737 | { | |
69636828 AF |
4738 | /* Not a quoted string. */ |
4739 | sym_text = language_search_unquoted_string (text, p); | |
c94fdfd0 EZ |
4740 | } |
4741 | } | |
4742 | ||
4743 | sym_text_len = strlen (sym_text); | |
4744 | ||
49c4e619 | 4745 | return_val = NULL; |
c94fdfd0 EZ |
4746 | |
4747 | /* Find the symtab for SRCFILE (this loads it if it was not yet read | |
4748 | in). */ | |
4749 | s = lookup_symtab (srcfile); | |
4750 | if (s == NULL) | |
4751 | { | |
4752 | /* Maybe they typed the file with leading directories, while the | |
4753 | symbol tables record only its basename. */ | |
31889e00 | 4754 | const char *tail = lbasename (srcfile); |
c94fdfd0 EZ |
4755 | |
4756 | if (tail > srcfile) | |
4757 | s = lookup_symtab (tail); | |
4758 | } | |
4759 | ||
4760 | /* If we have no symtab for that file, return an empty list. */ | |
4761 | if (s == NULL) | |
4762 | return (return_val); | |
4763 | ||
4764 | /* Go through this symtab and check the externs and statics for | |
4765 | symbols which match. */ | |
4766 | ||
4767 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
de4f826b | 4768 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c94fdfd0 | 4769 | { |
c94fdfd0 EZ |
4770 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
4771 | } | |
4772 | ||
4773 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
de4f826b | 4774 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c94fdfd0 | 4775 | { |
c94fdfd0 EZ |
4776 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
4777 | } | |
4778 | ||
4779 | return (return_val); | |
4780 | } | |
4781 | ||
4782 | /* A helper function for make_source_files_completion_list. It adds | |
4783 | another file name to a list of possible completions, growing the | |
4784 | list as necessary. */ | |
4785 | ||
4786 | static void | |
6f937416 | 4787 | add_filename_to_list (const char *fname, const char *text, const char *word, |
49c4e619 | 4788 | VEC (char_ptr) **list) |
c94fdfd0 EZ |
4789 | { |
4790 | char *new; | |
4791 | size_t fnlen = strlen (fname); | |
4792 | ||
c94fdfd0 EZ |
4793 | if (word == text) |
4794 | { | |
4795 | /* Return exactly fname. */ | |
4796 | new = xmalloc (fnlen + 5); | |
4797 | strcpy (new, fname); | |
4798 | } | |
4799 | else if (word > text) | |
4800 | { | |
4801 | /* Return some portion of fname. */ | |
4802 | new = xmalloc (fnlen + 5); | |
4803 | strcpy (new, fname + (word - text)); | |
4804 | } | |
4805 | else | |
4806 | { | |
4807 | /* Return some of TEXT plus fname. */ | |
4808 | new = xmalloc (fnlen + (text - word) + 5); | |
4809 | strncpy (new, word, text - word); | |
4810 | new[text - word] = '\0'; | |
4811 | strcat (new, fname); | |
4812 | } | |
49c4e619 | 4813 | VEC_safe_push (char_ptr, *list, new); |
c94fdfd0 EZ |
4814 | } |
4815 | ||
4816 | static int | |
4817 | not_interesting_fname (const char *fname) | |
4818 | { | |
4819 | static const char *illegal_aliens[] = { | |
4820 | "_globals_", /* inserted by coff_symtab_read */ | |
4821 | NULL | |
4822 | }; | |
4823 | int i; | |
4824 | ||
4825 | for (i = 0; illegal_aliens[i]; i++) | |
4826 | { | |
0ba1096a | 4827 | if (filename_cmp (fname, illegal_aliens[i]) == 0) |
c94fdfd0 EZ |
4828 | return 1; |
4829 | } | |
4830 | return 0; | |
4831 | } | |
4832 | ||
ccefe4c4 TT |
4833 | /* An object of this type is passed as the user_data argument to |
4834 | map_partial_symbol_filenames. */ | |
4835 | struct add_partial_filename_data | |
4836 | { | |
9fdc877b | 4837 | struct filename_seen_cache *filename_seen_cache; |
6f937416 PA |
4838 | const char *text; |
4839 | const char *word; | |
ccefe4c4 | 4840 | int text_len; |
49c4e619 | 4841 | VEC (char_ptr) **list; |
ccefe4c4 TT |
4842 | }; |
4843 | ||
4844 | /* A callback for map_partial_symbol_filenames. */ | |
eca864fe | 4845 | |
ccefe4c4 | 4846 | static void |
2837d59e | 4847 | maybe_add_partial_symtab_filename (const char *filename, const char *fullname, |
ccefe4c4 TT |
4848 | void *user_data) |
4849 | { | |
4850 | struct add_partial_filename_data *data = user_data; | |
4851 | ||
4852 | if (not_interesting_fname (filename)) | |
4853 | return; | |
9fdc877b | 4854 | if (!filename_seen (data->filename_seen_cache, filename, 1) |
0ba1096a | 4855 | && filename_ncmp (filename, data->text, data->text_len) == 0) |
ccefe4c4 TT |
4856 | { |
4857 | /* This file matches for a completion; add it to the | |
4858 | current list of matches. */ | |
49c4e619 | 4859 | add_filename_to_list (filename, data->text, data->word, data->list); |
ccefe4c4 TT |
4860 | } |
4861 | else | |
4862 | { | |
4863 | const char *base_name = lbasename (filename); | |
433759f7 | 4864 | |
ccefe4c4 | 4865 | if (base_name != filename |
9fdc877b | 4866 | && !filename_seen (data->filename_seen_cache, base_name, 1) |
0ba1096a | 4867 | && filename_ncmp (base_name, data->text, data->text_len) == 0) |
49c4e619 | 4868 | add_filename_to_list (base_name, data->text, data->word, data->list); |
ccefe4c4 TT |
4869 | } |
4870 | } | |
4871 | ||
49c4e619 TT |
4872 | /* Return a vector of all source files whose names begin with matching |
4873 | TEXT. The file names are looked up in the symbol tables of this | |
4874 | program. If the answer is no matchess, then the return value is | |
4875 | NULL. */ | |
c94fdfd0 | 4876 | |
49c4e619 | 4877 | VEC (char_ptr) * |
6f937416 | 4878 | make_source_files_completion_list (const char *text, const char *word) |
c94fdfd0 | 4879 | { |
52f0bd74 | 4880 | struct symtab *s; |
52f0bd74 | 4881 | struct objfile *objfile; |
c94fdfd0 | 4882 | size_t text_len = strlen (text); |
49c4e619 | 4883 | VEC (char_ptr) *list = NULL; |
31889e00 | 4884 | const char *base_name; |
ccefe4c4 | 4885 | struct add_partial_filename_data datum; |
9fdc877b DE |
4886 | struct filename_seen_cache *filename_seen_cache; |
4887 | struct cleanup *back_to, *cache_cleanup; | |
c94fdfd0 | 4888 | |
c94fdfd0 EZ |
4889 | if (!have_full_symbols () && !have_partial_symbols ()) |
4890 | return list; | |
4891 | ||
821296b7 SA |
4892 | back_to = make_cleanup (do_free_completion_list, &list); |
4893 | ||
9fdc877b DE |
4894 | filename_seen_cache = create_filename_seen_cache (); |
4895 | cache_cleanup = make_cleanup (delete_filename_seen_cache, | |
4896 | filename_seen_cache); | |
4897 | ||
c94fdfd0 EZ |
4898 | ALL_SYMTABS (objfile, s) |
4899 | { | |
4900 | if (not_interesting_fname (s->filename)) | |
4901 | continue; | |
9fdc877b | 4902 | if (!filename_seen (filename_seen_cache, s->filename, 1) |
0ba1096a | 4903 | && filename_ncmp (s->filename, text, text_len) == 0) |
c94fdfd0 EZ |
4904 | { |
4905 | /* This file matches for a completion; add it to the current | |
4906 | list of matches. */ | |
49c4e619 | 4907 | add_filename_to_list (s->filename, text, word, &list); |
c94fdfd0 EZ |
4908 | } |
4909 | else | |
4910 | { | |
4911 | /* NOTE: We allow the user to type a base name when the | |
4912 | debug info records leading directories, but not the other | |
4913 | way around. This is what subroutines of breakpoint | |
4914 | command do when they parse file names. */ | |
31889e00 | 4915 | base_name = lbasename (s->filename); |
c94fdfd0 | 4916 | if (base_name != s->filename |
9fdc877b | 4917 | && !filename_seen (filename_seen_cache, base_name, 1) |
0ba1096a | 4918 | && filename_ncmp (base_name, text, text_len) == 0) |
49c4e619 | 4919 | add_filename_to_list (base_name, text, word, &list); |
c94fdfd0 EZ |
4920 | } |
4921 | } | |
4922 | ||
9fdc877b | 4923 | datum.filename_seen_cache = filename_seen_cache; |
ccefe4c4 TT |
4924 | datum.text = text; |
4925 | datum.word = word; | |
4926 | datum.text_len = text_len; | |
4927 | datum.list = &list; | |
bb4142cf DE |
4928 | map_symbol_filenames (maybe_add_partial_symtab_filename, &datum, |
4929 | 0 /*need_fullname*/); | |
9fdc877b DE |
4930 | |
4931 | do_cleanups (cache_cleanup); | |
821296b7 | 4932 | discard_cleanups (back_to); |
c94fdfd0 EZ |
4933 | |
4934 | return list; | |
4935 | } | |
c906108c | 4936 | \f |
51cc5b07 | 4937 | /* Track MAIN */ |
32ac0d11 TT |
4938 | |
4939 | /* Return the "main_info" object for the current program space. If | |
4940 | the object has not yet been created, create it and fill in some | |
4941 | default values. */ | |
4942 | ||
4943 | static struct main_info * | |
4944 | get_main_info (void) | |
4945 | { | |
4946 | struct main_info *info = program_space_data (current_program_space, | |
4947 | main_progspace_key); | |
4948 | ||
4949 | if (info == NULL) | |
4950 | { | |
3d548a53 TT |
4951 | /* It may seem strange to store the main name in the progspace |
4952 | and also in whatever objfile happens to see a main name in | |
4953 | its debug info. The reason for this is mainly historical: | |
4954 | gdb returned "main" as the name even if no function named | |
4955 | "main" was defined the program; and this approach lets us | |
4956 | keep compatibility. */ | |
32ac0d11 TT |
4957 | info = XCNEW (struct main_info); |
4958 | info->language_of_main = language_unknown; | |
4959 | set_program_space_data (current_program_space, main_progspace_key, | |
4960 | info); | |
4961 | } | |
4962 | ||
4963 | return info; | |
4964 | } | |
4965 | ||
4966 | /* A cleanup to destroy a struct main_info when a progspace is | |
4967 | destroyed. */ | |
4968 | ||
4969 | static void | |
4970 | main_info_cleanup (struct program_space *pspace, void *data) | |
4971 | { | |
4972 | struct main_info *info = data; | |
4973 | ||
4974 | if (info != NULL) | |
4975 | xfree (info->name_of_main); | |
4976 | xfree (info); | |
4977 | } | |
51cc5b07 | 4978 | |
3d548a53 | 4979 | static void |
9e6c82ad | 4980 | set_main_name (const char *name, enum language lang) |
51cc5b07 | 4981 | { |
32ac0d11 TT |
4982 | struct main_info *info = get_main_info (); |
4983 | ||
4984 | if (info->name_of_main != NULL) | |
51cc5b07 | 4985 | { |
32ac0d11 TT |
4986 | xfree (info->name_of_main); |
4987 | info->name_of_main = NULL; | |
4988 | info->language_of_main = language_unknown; | |
51cc5b07 AC |
4989 | } |
4990 | if (name != NULL) | |
4991 | { | |
32ac0d11 TT |
4992 | info->name_of_main = xstrdup (name); |
4993 | info->language_of_main = lang; | |
51cc5b07 AC |
4994 | } |
4995 | } | |
4996 | ||
ea53e89f JB |
4997 | /* Deduce the name of the main procedure, and set NAME_OF_MAIN |
4998 | accordingly. */ | |
4999 | ||
5000 | static void | |
5001 | find_main_name (void) | |
5002 | { | |
cd6c7346 | 5003 | const char *new_main_name; |
3d548a53 TT |
5004 | struct objfile *objfile; |
5005 | ||
5006 | /* First check the objfiles to see whether a debuginfo reader has | |
5007 | picked up the appropriate main name. Historically the main name | |
5008 | was found in a more or less random way; this approach instead | |
5009 | relies on the order of objfile creation -- which still isn't | |
5010 | guaranteed to get the correct answer, but is just probably more | |
5011 | accurate. */ | |
5012 | ALL_OBJFILES (objfile) | |
5013 | { | |
5014 | if (objfile->per_bfd->name_of_main != NULL) | |
5015 | { | |
5016 | set_main_name (objfile->per_bfd->name_of_main, | |
5017 | objfile->per_bfd->language_of_main); | |
5018 | return; | |
5019 | } | |
5020 | } | |
ea53e89f JB |
5021 | |
5022 | /* Try to see if the main procedure is in Ada. */ | |
5023 | /* FIXME: brobecker/2005-03-07: Another way of doing this would | |
5024 | be to add a new method in the language vector, and call this | |
5025 | method for each language until one of them returns a non-empty | |
5026 | name. This would allow us to remove this hard-coded call to | |
5027 | an Ada function. It is not clear that this is a better approach | |
5028 | at this point, because all methods need to be written in a way | |
c378eb4e | 5029 | such that false positives never be returned. For instance, it is |
ea53e89f JB |
5030 | important that a method does not return a wrong name for the main |
5031 | procedure if the main procedure is actually written in a different | |
5032 | language. It is easy to guaranty this with Ada, since we use a | |
5033 | special symbol generated only when the main in Ada to find the name | |
c378eb4e | 5034 | of the main procedure. It is difficult however to see how this can |
ea53e89f JB |
5035 | be guarantied for languages such as C, for instance. This suggests |
5036 | that order of call for these methods becomes important, which means | |
5037 | a more complicated approach. */ | |
5038 | new_main_name = ada_main_name (); | |
5039 | if (new_main_name != NULL) | |
9af17804 | 5040 | { |
9e6c82ad | 5041 | set_main_name (new_main_name, language_ada); |
ea53e89f JB |
5042 | return; |
5043 | } | |
5044 | ||
63778547 IB |
5045 | new_main_name = d_main_name (); |
5046 | if (new_main_name != NULL) | |
5047 | { | |
5048 | set_main_name (new_main_name, language_d); | |
5049 | return; | |
5050 | } | |
5051 | ||
a766d390 DE |
5052 | new_main_name = go_main_name (); |
5053 | if (new_main_name != NULL) | |
5054 | { | |
9e6c82ad | 5055 | set_main_name (new_main_name, language_go); |
a766d390 DE |
5056 | return; |
5057 | } | |
5058 | ||
cd6c7346 PM |
5059 | new_main_name = pascal_main_name (); |
5060 | if (new_main_name != NULL) | |
9af17804 | 5061 | { |
9e6c82ad | 5062 | set_main_name (new_main_name, language_pascal); |
cd6c7346 PM |
5063 | return; |
5064 | } | |
5065 | ||
ea53e89f JB |
5066 | /* The languages above didn't identify the name of the main procedure. |
5067 | Fallback to "main". */ | |
9e6c82ad | 5068 | set_main_name ("main", language_unknown); |
ea53e89f JB |
5069 | } |
5070 | ||
51cc5b07 AC |
5071 | char * |
5072 | main_name (void) | |
5073 | { | |
32ac0d11 TT |
5074 | struct main_info *info = get_main_info (); |
5075 | ||
5076 | if (info->name_of_main == NULL) | |
ea53e89f JB |
5077 | find_main_name (); |
5078 | ||
32ac0d11 | 5079 | return info->name_of_main; |
51cc5b07 AC |
5080 | } |
5081 | ||
9e6c82ad TT |
5082 | /* Return the language of the main function. If it is not known, |
5083 | return language_unknown. */ | |
5084 | ||
5085 | enum language | |
5086 | main_language (void) | |
5087 | { | |
32ac0d11 TT |
5088 | struct main_info *info = get_main_info (); |
5089 | ||
5090 | if (info->name_of_main == NULL) | |
5091 | find_main_name (); | |
5092 | ||
5093 | return info->language_of_main; | |
9e6c82ad TT |
5094 | } |
5095 | ||
ea53e89f JB |
5096 | /* Handle ``executable_changed'' events for the symtab module. */ |
5097 | ||
5098 | static void | |
781b42b0 | 5099 | symtab_observer_executable_changed (void) |
ea53e89f JB |
5100 | { |
5101 | /* NAME_OF_MAIN may no longer be the same, so reset it for now. */ | |
9e6c82ad | 5102 | set_main_name (NULL, language_unknown); |
ea53e89f | 5103 | } |
51cc5b07 | 5104 | |
a6c727b2 DJ |
5105 | /* Return 1 if the supplied producer string matches the ARM RealView |
5106 | compiler (armcc). */ | |
5107 | ||
5108 | int | |
5109 | producer_is_realview (const char *producer) | |
5110 | { | |
5111 | static const char *const arm_idents[] = { | |
5112 | "ARM C Compiler, ADS", | |
5113 | "Thumb C Compiler, ADS", | |
5114 | "ARM C++ Compiler, ADS", | |
5115 | "Thumb C++ Compiler, ADS", | |
5116 | "ARM/Thumb C/C++ Compiler, RVCT", | |
5117 | "ARM C/C++ Compiler, RVCT" | |
5118 | }; | |
5119 | int i; | |
5120 | ||
5121 | if (producer == NULL) | |
5122 | return 0; | |
5123 | ||
5124 | for (i = 0; i < ARRAY_SIZE (arm_idents); i++) | |
5125 | if (strncmp (producer, arm_idents[i], strlen (arm_idents[i])) == 0) | |
5126 | return 1; | |
5127 | ||
5128 | return 0; | |
5129 | } | |
ed0616c6 | 5130 | |
f1e6e072 TT |
5131 | \f |
5132 | ||
5133 | /* The next index to hand out in response to a registration request. */ | |
5134 | ||
5135 | static int next_aclass_value = LOC_FINAL_VALUE; | |
5136 | ||
5137 | /* The maximum number of "aclass" registrations we support. This is | |
5138 | constant for convenience. */ | |
5139 | #define MAX_SYMBOL_IMPLS (LOC_FINAL_VALUE + 10) | |
5140 | ||
5141 | /* The objects representing the various "aclass" values. The elements | |
5142 | from 0 up to LOC_FINAL_VALUE-1 represent themselves, and subsequent | |
5143 | elements are those registered at gdb initialization time. */ | |
5144 | ||
5145 | static struct symbol_impl symbol_impl[MAX_SYMBOL_IMPLS]; | |
5146 | ||
5147 | /* The globally visible pointer. This is separate from 'symbol_impl' | |
5148 | so that it can be const. */ | |
5149 | ||
5150 | const struct symbol_impl *symbol_impls = &symbol_impl[0]; | |
5151 | ||
5152 | /* Make sure we saved enough room in struct symbol. */ | |
5153 | ||
5154 | gdb_static_assert (MAX_SYMBOL_IMPLS <= (1 << SYMBOL_ACLASS_BITS)); | |
5155 | ||
5156 | /* Register a computed symbol type. ACLASS must be LOC_COMPUTED. OPS | |
5157 | is the ops vector associated with this index. This returns the new | |
5158 | index, which should be used as the aclass_index field for symbols | |
5159 | of this type. */ | |
5160 | ||
5161 | int | |
5162 | register_symbol_computed_impl (enum address_class aclass, | |
5163 | const struct symbol_computed_ops *ops) | |
5164 | { | |
5165 | int result = next_aclass_value++; | |
5166 | ||
5167 | gdb_assert (aclass == LOC_COMPUTED); | |
5168 | gdb_assert (result < MAX_SYMBOL_IMPLS); | |
5169 | symbol_impl[result].aclass = aclass; | |
5170 | symbol_impl[result].ops_computed = ops; | |
5171 | ||
24d6c2a0 TT |
5172 | /* Sanity check OPS. */ |
5173 | gdb_assert (ops != NULL); | |
5174 | gdb_assert (ops->tracepoint_var_ref != NULL); | |
5175 | gdb_assert (ops->describe_location != NULL); | |
5176 | gdb_assert (ops->read_needs_frame != NULL); | |
5177 | gdb_assert (ops->read_variable != NULL); | |
5178 | ||
f1e6e072 TT |
5179 | return result; |
5180 | } | |
5181 | ||
5182 | /* Register a function with frame base type. ACLASS must be LOC_BLOCK. | |
5183 | OPS is the ops vector associated with this index. This returns the | |
5184 | new index, which should be used as the aclass_index field for symbols | |
5185 | of this type. */ | |
5186 | ||
5187 | int | |
5188 | register_symbol_block_impl (enum address_class aclass, | |
5189 | const struct symbol_block_ops *ops) | |
5190 | { | |
5191 | int result = next_aclass_value++; | |
5192 | ||
5193 | gdb_assert (aclass == LOC_BLOCK); | |
5194 | gdb_assert (result < MAX_SYMBOL_IMPLS); | |
5195 | symbol_impl[result].aclass = aclass; | |
5196 | symbol_impl[result].ops_block = ops; | |
5197 | ||
5198 | /* Sanity check OPS. */ | |
5199 | gdb_assert (ops != NULL); | |
5200 | gdb_assert (ops->find_frame_base_location != NULL); | |
5201 | ||
5202 | return result; | |
5203 | } | |
5204 | ||
5205 | /* Register a register symbol type. ACLASS must be LOC_REGISTER or | |
5206 | LOC_REGPARM_ADDR. OPS is the register ops vector associated with | |
5207 | this index. This returns the new index, which should be used as | |
5208 | the aclass_index field for symbols of this type. */ | |
5209 | ||
5210 | int | |
5211 | register_symbol_register_impl (enum address_class aclass, | |
5212 | const struct symbol_register_ops *ops) | |
5213 | { | |
5214 | int result = next_aclass_value++; | |
5215 | ||
5216 | gdb_assert (aclass == LOC_REGISTER || aclass == LOC_REGPARM_ADDR); | |
5217 | gdb_assert (result < MAX_SYMBOL_IMPLS); | |
5218 | symbol_impl[result].aclass = aclass; | |
5219 | symbol_impl[result].ops_register = ops; | |
5220 | ||
5221 | return result; | |
5222 | } | |
5223 | ||
5224 | /* Initialize elements of 'symbol_impl' for the constants in enum | |
5225 | address_class. */ | |
5226 | ||
5227 | static void | |
5228 | initialize_ordinary_address_classes (void) | |
5229 | { | |
5230 | int i; | |
5231 | ||
5232 | for (i = 0; i < LOC_FINAL_VALUE; ++i) | |
5233 | symbol_impl[i].aclass = i; | |
5234 | } | |
5235 | ||
5236 | \f | |
5237 | ||
e623cf5d TT |
5238 | /* Initialize the symbol SYM. */ |
5239 | ||
5240 | void | |
5241 | initialize_symbol (struct symbol *sym) | |
5242 | { | |
5243 | memset (sym, 0, sizeof (*sym)); | |
e27d198c | 5244 | SYMBOL_SECTION (sym) = -1; |
e623cf5d TT |
5245 | } |
5246 | ||
5247 | /* Allocate and initialize a new 'struct symbol' on OBJFILE's | |
5248 | obstack. */ | |
5249 | ||
5250 | struct symbol * | |
5251 | allocate_symbol (struct objfile *objfile) | |
5252 | { | |
5253 | struct symbol *result; | |
5254 | ||
5255 | result = OBSTACK_ZALLOC (&objfile->objfile_obstack, struct symbol); | |
e27d198c | 5256 | SYMBOL_SECTION (result) = -1; |
e623cf5d TT |
5257 | |
5258 | return result; | |
5259 | } | |
5260 | ||
5261 | /* Allocate and initialize a new 'struct template_symbol' on OBJFILE's | |
5262 | obstack. */ | |
5263 | ||
5264 | struct template_symbol * | |
5265 | allocate_template_symbol (struct objfile *objfile) | |
5266 | { | |
5267 | struct template_symbol *result; | |
5268 | ||
5269 | result = OBSTACK_ZALLOC (&objfile->objfile_obstack, struct template_symbol); | |
e27d198c | 5270 | SYMBOL_SECTION (&result->base) = -1; |
e623cf5d TT |
5271 | |
5272 | return result; | |
5273 | } | |
5274 | ||
5275 | \f | |
5276 | ||
c906108c | 5277 | void |
fba45db2 | 5278 | _initialize_symtab (void) |
c906108c | 5279 | { |
f1e6e072 TT |
5280 | initialize_ordinary_address_classes (); |
5281 | ||
32ac0d11 TT |
5282 | main_progspace_key |
5283 | = register_program_space_data_with_cleanup (NULL, main_info_cleanup); | |
5284 | ||
1bedd215 AC |
5285 | add_info ("variables", variables_info, _("\ |
5286 | All global and static variable names, or those matching REGEXP.")); | |
c906108c | 5287 | if (dbx_commands) |
1bedd215 AC |
5288 | add_com ("whereis", class_info, variables_info, _("\ |
5289 | All global and static variable names, or those matching REGEXP.")); | |
c906108c SS |
5290 | |
5291 | add_info ("functions", functions_info, | |
1bedd215 | 5292 | _("All function names, or those matching REGEXP.")); |
c906108c SS |
5293 | |
5294 | /* FIXME: This command has at least the following problems: | |
5295 | 1. It prints builtin types (in a very strange and confusing fashion). | |
5296 | 2. It doesn't print right, e.g. with | |
c5aa993b JM |
5297 | typedef struct foo *FOO |
5298 | type_print prints "FOO" when we want to make it (in this situation) | |
5299 | print "struct foo *". | |
c906108c SS |
5300 | I also think "ptype" or "whatis" is more likely to be useful (but if |
5301 | there is much disagreement "info types" can be fixed). */ | |
5302 | add_info ("types", types_info, | |
1bedd215 | 5303 | _("All type names, or those matching REGEXP.")); |
c906108c | 5304 | |
c906108c | 5305 | add_info ("sources", sources_info, |
1bedd215 | 5306 | _("Source files in the program.")); |
c906108c SS |
5307 | |
5308 | add_com ("rbreak", class_breakpoint, rbreak_command, | |
1bedd215 | 5309 | _("Set a breakpoint for all functions matching REGEXP.")); |
c906108c SS |
5310 | |
5311 | if (xdb_commands) | |
5312 | { | |
1bedd215 AC |
5313 | add_com ("lf", class_info, sources_info, |
5314 | _("Source files in the program")); | |
5315 | add_com ("lg", class_info, variables_info, _("\ | |
5316 | All global and static variable names, or those matching REGEXP.")); | |
c906108c SS |
5317 | } |
5318 | ||
717d2f5a JB |
5319 | add_setshow_enum_cmd ("multiple-symbols", no_class, |
5320 | multiple_symbols_modes, &multiple_symbols_mode, | |
5321 | _("\ | |
5322 | Set the debugger behavior when more than one symbol are possible matches\n\ | |
5323 | in an expression."), _("\ | |
5324 | Show how the debugger handles ambiguities in expressions."), _("\ | |
5325 | Valid values are \"ask\", \"all\", \"cancel\", and the default is \"all\"."), | |
5326 | NULL, NULL, &setlist, &showlist); | |
5327 | ||
c011a4f4 DE |
5328 | add_setshow_boolean_cmd ("basenames-may-differ", class_obscure, |
5329 | &basenames_may_differ, _("\ | |
5330 | Set whether a source file may have multiple base names."), _("\ | |
5331 | Show whether a source file may have multiple base names."), _("\ | |
5332 | (A \"base name\" is the name of a file with the directory part removed.\n\ | |
5333 | Example: The base name of \"/home/user/hello.c\" is \"hello.c\".)\n\ | |
5334 | If set, GDB will canonicalize file names (e.g., expand symlinks)\n\ | |
5335 | before comparing them. Canonicalization is an expensive operation,\n\ | |
5336 | but it allows the same file be known by more than one base name.\n\ | |
5337 | If not set (the default), all source files are assumed to have just\n\ | |
5338 | one base name, and gdb will do file name comparisons more efficiently."), | |
5339 | NULL, NULL, | |
5340 | &setlist, &showlist); | |
5341 | ||
db0fec5c DE |
5342 | add_setshow_zuinteger_cmd ("symtab-create", no_class, &symtab_create_debug, |
5343 | _("Set debugging of symbol table creation."), | |
5344 | _("Show debugging of symbol table creation."), _("\ | |
5345 | When enabled (non-zero), debugging messages are printed when building\n\ | |
5346 | symbol tables. A value of 1 (one) normally provides enough information.\n\ | |
5347 | A value greater than 1 provides more verbose information."), | |
5348 | NULL, | |
5349 | NULL, | |
5350 | &setdebuglist, &showdebuglist); | |
45cfd468 | 5351 | |
ea53e89f | 5352 | observer_attach_executable_changed (symtab_observer_executable_changed); |
c906108c | 5353 | } |