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