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