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