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