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