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