Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Symbol table lookup for the GNU debugger, GDB. |
8926118c AC |
2 | |
3 | Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, | |
083ae935 DJ |
4 | 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 |
5 | 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 | |
11 | the Free Software Foundation; either version 2 of the License, or | |
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 JM |
19 | You should have received a copy of the GNU General Public License |
20 | along with this program; if not, write to the Free Software | |
21 | Foundation, Inc., 59 Temple Place - Suite 330, | |
22 | Boston, MA 02111-1307, USA. */ | |
c906108c SS |
23 | |
24 | #include "defs.h" | |
25 | #include "symtab.h" | |
26 | #include "gdbtypes.h" | |
27 | #include "gdbcore.h" | |
28 | #include "frame.h" | |
29 | #include "target.h" | |
30 | #include "value.h" | |
31 | #include "symfile.h" | |
32 | #include "objfiles.h" | |
33 | #include "gdbcmd.h" | |
34 | #include "call-cmds.h" | |
88987551 | 35 | #include "gdb_regex.h" |
c906108c SS |
36 | #include "expression.h" |
37 | #include "language.h" | |
38 | #include "demangle.h" | |
39 | #include "inferior.h" | |
c5f0f3d0 | 40 | #include "linespec.h" |
0378c332 | 41 | #include "source.h" |
a7fdf62f | 42 | #include "filenames.h" /* for FILENAME_CMP */ |
c906108c | 43 | |
2de7ced7 DJ |
44 | #include "hashtab.h" |
45 | ||
04ea0df1 | 46 | #include "gdb_obstack.h" |
c906108c SS |
47 | |
48 | #include <sys/types.h> | |
49 | #include <fcntl.h> | |
50 | #include "gdb_string.h" | |
51 | #include "gdb_stat.h" | |
52 | #include <ctype.h> | |
015a42b4 | 53 | #include "cp-abi.h" |
c906108c | 54 | |
c906108c SS |
55 | /* Prototypes for local functions */ |
56 | ||
a14ed312 | 57 | static void completion_list_add_name (char *, char *, int, char *, char *); |
c906108c | 58 | |
a14ed312 | 59 | static void rbreak_command (char *, int); |
c906108c | 60 | |
a14ed312 | 61 | static void types_info (char *, int); |
c906108c | 62 | |
a14ed312 | 63 | static void functions_info (char *, int); |
c906108c | 64 | |
a14ed312 | 65 | static void variables_info (char *, int); |
c906108c | 66 | |
a14ed312 | 67 | static void sources_info (char *, int); |
c906108c | 68 | |
a14ed312 | 69 | static void output_source_filename (char *, int *); |
c906108c | 70 | |
a14ed312 | 71 | static int find_line_common (struct linetable *, int, int *); |
c906108c | 72 | |
50641945 FN |
73 | /* This one is used by linespec.c */ |
74 | ||
75 | char *operator_chars (char *p, char **end); | |
76 | ||
b37bcaa8 KB |
77 | static struct partial_symbol *lookup_partial_symbol (struct partial_symtab *, |
78 | const char *, int, | |
79 | namespace_enum); | |
c906108c | 80 | |
3121eff0 DJ |
81 | static struct symbol *lookup_symbol_aux (const char *name, |
82 | const char *mangled_name, | |
83 | const struct block *block, | |
84 | const namespace_enum namespace, | |
85 | int *is_a_field_of_this, | |
86 | struct symtab **symtab); | |
fba7f19c | 87 | |
e4051eeb DC |
88 | static |
89 | struct symbol *lookup_symbol_aux_local (const char *name, | |
90 | const char *mangled_name, | |
91 | const struct block *block, | |
92 | const namespace_enum namespace, | |
93 | struct symtab **symtab, | |
94 | const struct block **static_block); | |
8155455b | 95 | |
f61e8913 DC |
96 | static |
97 | struct symbol *lookup_symbol_aux_block (const char *name, | |
98 | const char *mangled_name, | |
99 | const struct block *block, | |
100 | const namespace_enum namespace, | |
101 | struct symtab **symtab); | |
102 | ||
8155455b DC |
103 | static |
104 | struct symbol *lookup_symbol_aux_symtabs (int block_index, | |
105 | const char *name, | |
106 | const char *mangled_name, | |
107 | const namespace_enum namespace, | |
108 | struct symtab **symtab); | |
109 | ||
110 | static | |
111 | struct symbol *lookup_symbol_aux_psymtabs (int block_index, | |
112 | const char *name, | |
113 | const char *mangled_name, | |
114 | const namespace_enum namespace, | |
115 | struct symtab **symtab); | |
fba7f19c | 116 | |
406bc4de DC |
117 | static |
118 | struct symbol *lookup_symbol_aux_minsyms (const char *name, | |
119 | const char *mangled_name, | |
120 | const namespace_enum namespace, | |
121 | int *is_a_field_of_this, | |
e45febe2 | 122 | struct symtab **symtab); |
406bc4de | 123 | |
a14ed312 | 124 | static struct symbol *find_active_alias (struct symbol *sym, CORE_ADDR addr); |
c906108c SS |
125 | |
126 | /* This flag is used in hppa-tdep.c, and set in hp-symtab-read.c */ | |
127 | /* Signals the presence of objects compiled by HP compilers */ | |
128 | int hp_som_som_object_present = 0; | |
129 | ||
a14ed312 | 130 | static void fixup_section (struct general_symbol_info *, struct objfile *); |
c906108c | 131 | |
a14ed312 | 132 | static int file_matches (char *, char **, int); |
c906108c | 133 | |
a14ed312 KB |
134 | static void print_symbol_info (namespace_enum, |
135 | struct symtab *, struct symbol *, int, char *); | |
c906108c | 136 | |
a14ed312 | 137 | static void print_msymbol_info (struct minimal_symbol *); |
c906108c | 138 | |
a14ed312 | 139 | static void symtab_symbol_info (char *, namespace_enum, int); |
c906108c | 140 | |
a14ed312 | 141 | static void overload_list_add_symbol (struct symbol *sym, char *oload_name); |
392a587b | 142 | |
a14ed312 | 143 | void _initialize_symtab (void); |
c906108c SS |
144 | |
145 | /* */ | |
146 | ||
147 | /* The single non-language-specific builtin type */ | |
148 | struct type *builtin_type_error; | |
149 | ||
150 | /* Block in which the most recently searched-for symbol was found. | |
151 | Might be better to make this a parameter to lookup_symbol and | |
152 | value_of_this. */ | |
153 | ||
154 | const struct block *block_found; | |
155 | ||
c906108c SS |
156 | /* Check for a symtab of a specific name; first in symtabs, then in |
157 | psymtabs. *If* there is no '/' in the name, a match after a '/' | |
158 | in the symtab filename will also work. */ | |
159 | ||
1b15f1fa TT |
160 | struct symtab * |
161 | lookup_symtab (const char *name) | |
c906108c SS |
162 | { |
163 | register struct symtab *s; | |
164 | register struct partial_symtab *ps; | |
c906108c | 165 | register struct objfile *objfile; |
58d370e0 | 166 | char *real_path = NULL; |
f079a2e5 | 167 | char *full_path = NULL; |
58d370e0 TT |
168 | |
169 | /* Here we are interested in canonicalizing an absolute path, not | |
170 | absolutizing a relative path. */ | |
171 | if (IS_ABSOLUTE_PATH (name)) | |
f079a2e5 JB |
172 | { |
173 | full_path = xfullpath (name); | |
174 | make_cleanup (xfree, full_path); | |
175 | real_path = gdb_realpath (name); | |
176 | make_cleanup (xfree, real_path); | |
177 | } | |
c906108c | 178 | |
c5aa993b | 179 | got_symtab: |
c906108c SS |
180 | |
181 | /* First, search for an exact match */ | |
182 | ||
183 | ALL_SYMTABS (objfile, s) | |
58d370e0 | 184 | { |
a7fdf62f | 185 | if (FILENAME_CMP (name, s->filename) == 0) |
58d370e0 | 186 | { |
58d370e0 TT |
187 | return s; |
188 | } | |
f079a2e5 | 189 | |
58d370e0 TT |
190 | /* If the user gave us an absolute path, try to find the file in |
191 | this symtab and use its absolute path. */ | |
f079a2e5 JB |
192 | |
193 | if (full_path != NULL) | |
194 | { | |
195 | const char *fp = symtab_to_filename (s); | |
196 | if (FILENAME_CMP (full_path, fp) == 0) | |
197 | { | |
198 | return s; | |
199 | } | |
200 | } | |
201 | ||
58d370e0 TT |
202 | if (real_path != NULL) |
203 | { | |
25f1b008 | 204 | char *rp = gdb_realpath (symtab_to_filename (s)); |
f079a2e5 | 205 | make_cleanup (xfree, rp); |
58d370e0 TT |
206 | if (FILENAME_CMP (real_path, rp) == 0) |
207 | { | |
58d370e0 TT |
208 | return s; |
209 | } | |
210 | } | |
211 | } | |
212 | ||
c906108c SS |
213 | /* Now, search for a matching tail (only if name doesn't have any dirs) */ |
214 | ||
caadab2c | 215 | if (lbasename (name) == name) |
c906108c | 216 | ALL_SYMTABS (objfile, s) |
c5aa993b | 217 | { |
31889e00 | 218 | if (FILENAME_CMP (lbasename (s->filename), name) == 0) |
c5aa993b JM |
219 | return s; |
220 | } | |
c906108c SS |
221 | |
222 | /* Same search rules as above apply here, but now we look thru the | |
223 | psymtabs. */ | |
224 | ||
225 | ps = lookup_partial_symtab (name); | |
226 | if (!ps) | |
227 | return (NULL); | |
228 | ||
c5aa993b | 229 | if (ps->readin) |
c906108c | 230 | error ("Internal: readin %s pst for `%s' found when no symtab found.", |
c5aa993b | 231 | ps->filename, name); |
c906108c SS |
232 | |
233 | s = PSYMTAB_TO_SYMTAB (ps); | |
234 | ||
235 | if (s) | |
236 | return s; | |
237 | ||
238 | /* At this point, we have located the psymtab for this file, but | |
239 | the conversion to a symtab has failed. This usually happens | |
240 | when we are looking up an include file. In this case, | |
241 | PSYMTAB_TO_SYMTAB doesn't return a symtab, even though one has | |
242 | been created. So, we need to run through the symtabs again in | |
243 | order to find the file. | |
244 | XXX - This is a crock, and should be fixed inside of the the | |
245 | symbol parsing routines. */ | |
246 | goto got_symtab; | |
247 | } | |
248 | ||
c906108c SS |
249 | /* Lookup the partial symbol table of a source file named NAME. |
250 | *If* there is no '/' in the name, a match after a '/' | |
251 | in the psymtab filename will also work. */ | |
252 | ||
253 | struct partial_symtab * | |
1f8cc6db | 254 | lookup_partial_symtab (const char *name) |
c906108c SS |
255 | { |
256 | register struct partial_symtab *pst; | |
257 | register struct objfile *objfile; | |
f079a2e5 | 258 | char *full_path = NULL; |
58d370e0 TT |
259 | char *real_path = NULL; |
260 | ||
261 | /* Here we are interested in canonicalizing an absolute path, not | |
262 | absolutizing a relative path. */ | |
263 | if (IS_ABSOLUTE_PATH (name)) | |
f079a2e5 JB |
264 | { |
265 | full_path = xfullpath (name); | |
266 | make_cleanup (xfree, full_path); | |
267 | real_path = gdb_realpath (name); | |
268 | make_cleanup (xfree, real_path); | |
269 | } | |
c5aa993b | 270 | |
c906108c | 271 | ALL_PSYMTABS (objfile, pst) |
c5aa993b | 272 | { |
a7fdf62f | 273 | if (FILENAME_CMP (name, pst->filename) == 0) |
c5aa993b JM |
274 | { |
275 | return (pst); | |
276 | } | |
f079a2e5 | 277 | |
58d370e0 TT |
278 | /* If the user gave us an absolute path, try to find the file in |
279 | this symtab and use its absolute path. */ | |
f079a2e5 | 280 | if (full_path != NULL) |
58d370e0 TT |
281 | { |
282 | if (pst->fullname == NULL) | |
283 | source_full_path_of (pst->filename, &pst->fullname); | |
284 | if (pst->fullname != NULL | |
f079a2e5 | 285 | && FILENAME_CMP (full_path, pst->fullname) == 0) |
58d370e0 | 286 | { |
58d370e0 TT |
287 | return pst; |
288 | } | |
289 | } | |
c906108c | 290 | |
f079a2e5 JB |
291 | if (real_path != NULL) |
292 | { | |
293 | char *rp = NULL; | |
294 | if (pst->fullname == NULL) | |
295 | source_full_path_of (pst->filename, &pst->fullname); | |
296 | if (pst->fullname != NULL) | |
297 | { | |
298 | rp = gdb_realpath (pst->fullname); | |
299 | make_cleanup (xfree, rp); | |
300 | } | |
301 | if (rp != NULL && FILENAME_CMP (real_path, rp) == 0) | |
302 | { | |
303 | return pst; | |
304 | } | |
305 | } | |
306 | } | |
58d370e0 | 307 | |
c906108c SS |
308 | /* Now, search for a matching tail (only if name doesn't have any dirs) */ |
309 | ||
caadab2c | 310 | if (lbasename (name) == name) |
c906108c | 311 | ALL_PSYMTABS (objfile, pst) |
c5aa993b | 312 | { |
31889e00 | 313 | if (FILENAME_CMP (lbasename (pst->filename), name) == 0) |
c5aa993b JM |
314 | return (pst); |
315 | } | |
c906108c SS |
316 | |
317 | return (NULL); | |
318 | } | |
319 | \f | |
320 | /* Mangle a GDB method stub type. This actually reassembles the pieces of the | |
321 | full method name, which consist of the class name (from T), the unadorned | |
322 | method name from METHOD_ID, and the signature for the specific overload, | |
323 | specified by SIGNATURE_ID. Note that this function is g++ specific. */ | |
324 | ||
325 | char * | |
fba45db2 | 326 | gdb_mangle_name (struct type *type, int method_id, int signature_id) |
c906108c SS |
327 | { |
328 | int mangled_name_len; | |
329 | char *mangled_name; | |
330 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, method_id); | |
331 | struct fn_field *method = &f[signature_id]; | |
332 | char *field_name = TYPE_FN_FIELDLIST_NAME (type, method_id); | |
333 | char *physname = TYPE_FN_FIELD_PHYSNAME (f, signature_id); | |
334 | char *newname = type_name_no_tag (type); | |
335 | ||
336 | /* Does the form of physname indicate that it is the full mangled name | |
337 | of a constructor (not just the args)? */ | |
338 | int is_full_physname_constructor; | |
339 | ||
340 | int is_constructor; | |
015a42b4 | 341 | int is_destructor = is_destructor_name (physname); |
c906108c SS |
342 | /* Need a new type prefix. */ |
343 | char *const_prefix = method->is_const ? "C" : ""; | |
344 | char *volatile_prefix = method->is_volatile ? "V" : ""; | |
345 | char buf[20]; | |
346 | int len = (newname == NULL ? 0 : strlen (newname)); | |
347 | ||
43630227 PS |
348 | /* Nothing to do if physname already contains a fully mangled v3 abi name |
349 | or an operator name. */ | |
350 | if ((physname[0] == '_' && physname[1] == 'Z') | |
351 | || is_operator_name (field_name)) | |
235d1e03 EZ |
352 | return xstrdup (physname); |
353 | ||
015a42b4 | 354 | is_full_physname_constructor = is_constructor_name (physname); |
c906108c SS |
355 | |
356 | is_constructor = | |
c5aa993b | 357 | is_full_physname_constructor || (newname && STREQ (field_name, newname)); |
c906108c SS |
358 | |
359 | if (!is_destructor) | |
c5aa993b | 360 | is_destructor = (strncmp (physname, "__dt", 4) == 0); |
c906108c SS |
361 | |
362 | if (is_destructor || is_full_physname_constructor) | |
363 | { | |
c5aa993b JM |
364 | mangled_name = (char *) xmalloc (strlen (physname) + 1); |
365 | strcpy (mangled_name, physname); | |
c906108c SS |
366 | return mangled_name; |
367 | } | |
368 | ||
369 | if (len == 0) | |
370 | { | |
371 | sprintf (buf, "__%s%s", const_prefix, volatile_prefix); | |
372 | } | |
373 | else if (physname[0] == 't' || physname[0] == 'Q') | |
374 | { | |
375 | /* The physname for template and qualified methods already includes | |
c5aa993b | 376 | the class name. */ |
c906108c SS |
377 | sprintf (buf, "__%s%s", const_prefix, volatile_prefix); |
378 | newname = NULL; | |
379 | len = 0; | |
380 | } | |
381 | else | |
382 | { | |
383 | sprintf (buf, "__%s%s%d", const_prefix, volatile_prefix, len); | |
384 | } | |
385 | mangled_name_len = ((is_constructor ? 0 : strlen (field_name)) | |
235d1e03 | 386 | + strlen (buf) + len + strlen (physname) + 1); |
c906108c | 387 | |
c906108c | 388 | { |
c5aa993b | 389 | mangled_name = (char *) xmalloc (mangled_name_len); |
c906108c SS |
390 | if (is_constructor) |
391 | mangled_name[0] = '\0'; | |
392 | else | |
393 | strcpy (mangled_name, field_name); | |
394 | } | |
395 | strcat (mangled_name, buf); | |
396 | /* If the class doesn't have a name, i.e. newname NULL, then we just | |
397 | mangle it using 0 for the length of the class. Thus it gets mangled | |
c5aa993b | 398 | as something starting with `::' rather than `classname::'. */ |
c906108c SS |
399 | if (newname != NULL) |
400 | strcat (mangled_name, newname); | |
401 | ||
402 | strcat (mangled_name, physname); | |
403 | return (mangled_name); | |
404 | } | |
12af6855 JB |
405 | |
406 | \f | |
89aad1f9 EZ |
407 | /* Initialize the language dependent portion of a symbol |
408 | depending upon the language for the symbol. */ | |
409 | void | |
410 | symbol_init_language_specific (struct general_symbol_info *gsymbol, | |
411 | enum language language) | |
412 | { | |
413 | gsymbol->language = language; | |
414 | if (gsymbol->language == language_cplus | |
415 | || gsymbol->language == language_java) | |
416 | { | |
417 | gsymbol->language_specific.cplus_specific.demangled_name = NULL; | |
418 | } | |
419 | else if (gsymbol->language == language_objc) | |
420 | { | |
421 | gsymbol->language_specific.objc_specific.demangled_name = NULL; | |
422 | } | |
89aad1f9 EZ |
423 | else |
424 | { | |
425 | memset (&gsymbol->language_specific, 0, | |
426 | sizeof (gsymbol->language_specific)); | |
427 | } | |
428 | } | |
429 | ||
2de7ced7 DJ |
430 | /* Functions to initialize a symbol's mangled name. */ |
431 | ||
432 | /* Create the hash table used for demangled names. Each hash entry is | |
433 | a pair of strings; one for the mangled name and one for the demangled | |
434 | name. The entry is hashed via just the mangled name. */ | |
435 | ||
436 | static void | |
437 | create_demangled_names_hash (struct objfile *objfile) | |
438 | { | |
439 | /* Choose 256 as the starting size of the hash table, somewhat arbitrarily. | |
440 | The hash table code will round this up to the next prime number. | |
441 | Choosing a much larger table size wastes memory, and saves only about | |
442 | 1% in symbol reading. */ | |
443 | ||
444 | objfile->demangled_names_hash = htab_create_alloc_ex | |
445 | (256, htab_hash_string, (int (*) (const void *, const void *)) streq, | |
446 | NULL, objfile->md, xmcalloc, xmfree); | |
447 | } | |
12af6855 | 448 | |
2de7ced7 | 449 | /* Try to determine the demangled name for a symbol, based on the |
12af6855 JB |
450 | language of that symbol. If the language is set to language_auto, |
451 | it will attempt to find any demangling algorithm that works and | |
2de7ced7 DJ |
452 | then set the language appropriately. The returned name is allocated |
453 | by the demangler and should be xfree'd. */ | |
12af6855 | 454 | |
2de7ced7 DJ |
455 | static char * |
456 | symbol_find_demangled_name (struct general_symbol_info *gsymbol, | |
457 | const char *mangled) | |
12af6855 | 458 | { |
12af6855 JB |
459 | char *demangled = NULL; |
460 | ||
461 | if (gsymbol->language == language_unknown) | |
462 | gsymbol->language = language_auto; | |
463 | if (gsymbol->language == language_cplus | |
464 | || gsymbol->language == language_auto) | |
465 | { | |
466 | demangled = | |
2de7ced7 | 467 | cplus_demangle (mangled, DMGL_PARAMS | DMGL_ANSI); |
12af6855 | 468 | if (demangled != NULL) |
2de7ced7 DJ |
469 | { |
470 | gsymbol->language = language_cplus; | |
471 | return demangled; | |
472 | } | |
12af6855 JB |
473 | } |
474 | if (gsymbol->language == language_java) | |
475 | { | |
476 | demangled = | |
2de7ced7 | 477 | cplus_demangle (mangled, |
12af6855 JB |
478 | DMGL_PARAMS | DMGL_ANSI | DMGL_JAVA); |
479 | if (demangled != NULL) | |
2de7ced7 DJ |
480 | { |
481 | gsymbol->language = language_java; | |
482 | return demangled; | |
483 | } | |
484 | } | |
485 | return NULL; | |
486 | } | |
487 | ||
488 | /* Set both the mangled and demangled (if any) names for GSYMBOL based on | |
489 | NAME and LEN. The hash table corresponding to OBJFILE is used, and the | |
490 | memory comes from that objfile's symbol_obstack. NAME is copied, so the | |
491 | pointer can be discarded after calling this function. */ | |
492 | ||
493 | void | |
494 | symbol_set_names (struct general_symbol_info *gsymbol, | |
495 | const char *name, int len, struct objfile *objfile) | |
496 | { | |
497 | char **slot; | |
498 | const char *tmpname; | |
499 | ||
500 | if (objfile->demangled_names_hash == NULL) | |
501 | create_demangled_names_hash (objfile); | |
502 | ||
503 | /* The stabs reader generally provides names that are not NULL-terminated; | |
504 | most of the other readers don't do this, so we can just use the given | |
505 | copy. */ | |
506 | if (name[len] != 0) | |
507 | { | |
508 | char *alloc_name = alloca (len + 1); | |
509 | memcpy (alloc_name, name, len); | |
510 | alloc_name[len] = 0; | |
511 | tmpname = alloc_name; | |
512 | } | |
513 | else | |
514 | tmpname = name; | |
515 | ||
516 | slot = (char **) htab_find_slot (objfile->demangled_names_hash, tmpname, INSERT); | |
517 | ||
518 | /* If this name is not in the hash table, add it. */ | |
519 | if (*slot == NULL) | |
520 | { | |
521 | char *demangled_name = symbol_find_demangled_name (gsymbol, tmpname); | |
522 | int demangled_len = demangled_name ? strlen (demangled_name) : 0; | |
523 | ||
524 | /* If there is a demangled name, place it right after the mangled name. | |
525 | Otherwise, just place a second zero byte after the end of the mangled | |
526 | name. */ | |
527 | *slot = obstack_alloc (&objfile->symbol_obstack, | |
528 | len + demangled_len + 2); | |
529 | memcpy (*slot, tmpname, len + 1); | |
530 | if (demangled_name) | |
531 | { | |
532 | memcpy (*slot + len + 1, demangled_name, demangled_len + 1); | |
533 | xfree (demangled_name); | |
534 | } | |
535 | else | |
536 | (*slot)[len + 1] = 0; | |
537 | } | |
538 | ||
539 | gsymbol->name = *slot; | |
540 | if ((*slot)[len + 1]) | |
541 | gsymbol->language_specific.cplus_specific.demangled_name | |
542 | = &(*slot)[len + 1]; | |
543 | else | |
544 | gsymbol->language_specific.cplus_specific.demangled_name = NULL; | |
545 | } | |
546 | ||
547 | /* Initialize the demangled name of GSYMBOL if possible. Any required space | |
548 | to store the name is obtained from the specified obstack. The function | |
549 | symbol_set_names, above, should be used instead where possible for more | |
550 | efficient memory usage. */ | |
551 | ||
552 | void | |
553 | symbol_init_demangled_name (struct general_symbol_info *gsymbol, | |
554 | struct obstack *obstack) | |
555 | { | |
556 | char *mangled = gsymbol->name; | |
557 | char *demangled = NULL; | |
558 | ||
559 | demangled = symbol_find_demangled_name (gsymbol, mangled); | |
560 | if (gsymbol->language == language_cplus | |
561 | || gsymbol->language == language_java) | |
562 | { | |
563 | if (demangled) | |
564 | { | |
565 | gsymbol->language_specific.cplus_specific.demangled_name | |
566 | = obsavestring (demangled, strlen (demangled), obstack); | |
567 | xfree (demangled); | |
568 | } | |
12af6855 | 569 | else |
2de7ced7 DJ |
570 | gsymbol->language_specific.cplus_specific.demangled_name = NULL; |
571 | } | |
572 | else | |
573 | { | |
574 | /* Unknown language; just clean up quietly. */ | |
575 | if (demangled) | |
576 | xfree (demangled); | |
12af6855 | 577 | } |
12af6855 JB |
578 | } |
579 | ||
9cc0d196 EZ |
580 | /* Return the demangled name for a symbol based on the language for |
581 | that symbol. If no demangled name exists, return NULL. */ | |
582 | char * | |
583 | symbol_demangled_name (struct general_symbol_info *gsymbol) | |
584 | { | |
585 | if (gsymbol->language == language_cplus | |
586 | || gsymbol->language == language_java) | |
587 | return gsymbol->language_specific.cplus_specific.demangled_name; | |
12af6855 | 588 | |
9cc0d196 EZ |
589 | else if (gsymbol->language == language_objc) |
590 | return gsymbol->language_specific.objc_specific.demangled_name; | |
591 | ||
592 | else | |
593 | return NULL; | |
9cc0d196 | 594 | } |
fe39c653 EZ |
595 | |
596 | /* Initialize the structure fields to zero values. */ | |
597 | void | |
598 | init_sal (struct symtab_and_line *sal) | |
599 | { | |
600 | sal->symtab = 0; | |
601 | sal->section = 0; | |
602 | sal->line = 0; | |
603 | sal->pc = 0; | |
604 | sal->end = 0; | |
605 | } | |
c906108c SS |
606 | \f |
607 | ||
c5aa993b | 608 | |
c906108c SS |
609 | /* Find which partial symtab on contains PC and SECTION. Return 0 if none. */ |
610 | ||
611 | struct partial_symtab * | |
fba45db2 | 612 | find_pc_sect_psymtab (CORE_ADDR pc, asection *section) |
c906108c SS |
613 | { |
614 | register struct partial_symtab *pst; | |
615 | register struct objfile *objfile; | |
8a48e967 DJ |
616 | struct minimal_symbol *msymbol; |
617 | ||
618 | /* If we know that this is not a text address, return failure. This is | |
619 | necessary because we loop based on texthigh and textlow, which do | |
620 | not include the data ranges. */ | |
621 | msymbol = lookup_minimal_symbol_by_pc_section (pc, section); | |
622 | if (msymbol | |
623 | && (msymbol->type == mst_data | |
624 | || msymbol->type == mst_bss | |
625 | || msymbol->type == mst_abs | |
626 | || msymbol->type == mst_file_data | |
627 | || msymbol->type == mst_file_bss)) | |
628 | return NULL; | |
c906108c SS |
629 | |
630 | ALL_PSYMTABS (objfile, pst) | |
c5aa993b | 631 | { |
c5aa993b | 632 | if (pc >= pst->textlow && pc < pst->texthigh) |
c5aa993b | 633 | { |
c5aa993b JM |
634 | struct partial_symtab *tpst; |
635 | ||
636 | /* An objfile that has its functions reordered might have | |
637 | many partial symbol tables containing the PC, but | |
638 | we want the partial symbol table that contains the | |
639 | function containing the PC. */ | |
640 | if (!(objfile->flags & OBJF_REORDERED) && | |
641 | section == 0) /* can't validate section this way */ | |
642 | return (pst); | |
643 | ||
c5aa993b JM |
644 | if (msymbol == NULL) |
645 | return (pst); | |
646 | ||
647 | for (tpst = pst; tpst != NULL; tpst = tpst->next) | |
648 | { | |
c5aa993b | 649 | if (pc >= tpst->textlow && pc < tpst->texthigh) |
c5aa993b JM |
650 | { |
651 | struct partial_symbol *p; | |
c906108c | 652 | |
c5aa993b JM |
653 | p = find_pc_sect_psymbol (tpst, pc, section); |
654 | if (p != NULL | |
655 | && SYMBOL_VALUE_ADDRESS (p) | |
656 | == SYMBOL_VALUE_ADDRESS (msymbol)) | |
657 | return (tpst); | |
658 | } | |
659 | } | |
660 | return (pst); | |
661 | } | |
662 | } | |
c906108c SS |
663 | return (NULL); |
664 | } | |
665 | ||
666 | /* Find which partial symtab contains PC. Return 0 if none. | |
667 | Backward compatibility, no section */ | |
668 | ||
669 | struct partial_symtab * | |
fba45db2 | 670 | find_pc_psymtab (CORE_ADDR pc) |
c906108c SS |
671 | { |
672 | return find_pc_sect_psymtab (pc, find_pc_mapped_section (pc)); | |
673 | } | |
674 | ||
675 | /* Find which partial symbol within a psymtab matches PC and SECTION. | |
676 | Return 0 if none. Check all psymtabs if PSYMTAB is 0. */ | |
677 | ||
678 | struct partial_symbol * | |
fba45db2 KB |
679 | find_pc_sect_psymbol (struct partial_symtab *psymtab, CORE_ADDR pc, |
680 | asection *section) | |
c906108c SS |
681 | { |
682 | struct partial_symbol *best = NULL, *p, **pp; | |
683 | CORE_ADDR best_pc; | |
c5aa993b | 684 | |
c906108c SS |
685 | if (!psymtab) |
686 | psymtab = find_pc_sect_psymtab (pc, section); | |
687 | if (!psymtab) | |
688 | return 0; | |
689 | ||
690 | /* Cope with programs that start at address 0 */ | |
691 | best_pc = (psymtab->textlow != 0) ? psymtab->textlow - 1 : 0; | |
692 | ||
693 | /* Search the global symbols as well as the static symbols, so that | |
694 | find_pc_partial_function doesn't use a minimal symbol and thus | |
695 | cache a bad endaddr. */ | |
696 | for (pp = psymtab->objfile->global_psymbols.list + psymtab->globals_offset; | |
c5aa993b JM |
697 | (pp - (psymtab->objfile->global_psymbols.list + psymtab->globals_offset) |
698 | < psymtab->n_global_syms); | |
c906108c SS |
699 | pp++) |
700 | { | |
701 | p = *pp; | |
702 | if (SYMBOL_NAMESPACE (p) == VAR_NAMESPACE | |
703 | && SYMBOL_CLASS (p) == LOC_BLOCK | |
704 | && pc >= SYMBOL_VALUE_ADDRESS (p) | |
705 | && (SYMBOL_VALUE_ADDRESS (p) > best_pc | |
706 | || (psymtab->textlow == 0 | |
707 | && best_pc == 0 && SYMBOL_VALUE_ADDRESS (p) == 0))) | |
708 | { | |
c5aa993b | 709 | if (section) /* match on a specific section */ |
c906108c SS |
710 | { |
711 | fixup_psymbol_section (p, psymtab->objfile); | |
712 | if (SYMBOL_BFD_SECTION (p) != section) | |
713 | continue; | |
714 | } | |
715 | best_pc = SYMBOL_VALUE_ADDRESS (p); | |
716 | best = p; | |
717 | } | |
718 | } | |
719 | ||
720 | for (pp = psymtab->objfile->static_psymbols.list + psymtab->statics_offset; | |
c5aa993b JM |
721 | (pp - (psymtab->objfile->static_psymbols.list + psymtab->statics_offset) |
722 | < psymtab->n_static_syms); | |
c906108c SS |
723 | pp++) |
724 | { | |
725 | p = *pp; | |
726 | if (SYMBOL_NAMESPACE (p) == VAR_NAMESPACE | |
727 | && SYMBOL_CLASS (p) == LOC_BLOCK | |
728 | && pc >= SYMBOL_VALUE_ADDRESS (p) | |
729 | && (SYMBOL_VALUE_ADDRESS (p) > best_pc | |
c5aa993b | 730 | || (psymtab->textlow == 0 |
c906108c SS |
731 | && best_pc == 0 && SYMBOL_VALUE_ADDRESS (p) == 0))) |
732 | { | |
c5aa993b | 733 | if (section) /* match on a specific section */ |
c906108c SS |
734 | { |
735 | fixup_psymbol_section (p, psymtab->objfile); | |
736 | if (SYMBOL_BFD_SECTION (p) != section) | |
737 | continue; | |
738 | } | |
739 | best_pc = SYMBOL_VALUE_ADDRESS (p); | |
740 | best = p; | |
741 | } | |
742 | } | |
743 | ||
744 | return best; | |
745 | } | |
746 | ||
747 | /* Find which partial symbol within a psymtab matches PC. Return 0 if none. | |
748 | Check all psymtabs if PSYMTAB is 0. Backwards compatibility, no section. */ | |
749 | ||
750 | struct partial_symbol * | |
fba45db2 | 751 | find_pc_psymbol (struct partial_symtab *psymtab, CORE_ADDR pc) |
c906108c SS |
752 | { |
753 | return find_pc_sect_psymbol (psymtab, pc, find_pc_mapped_section (pc)); | |
754 | } | |
755 | \f | |
756 | /* Debug symbols usually don't have section information. We need to dig that | |
757 | out of the minimal symbols and stash that in the debug symbol. */ | |
758 | ||
759 | static void | |
fba45db2 | 760 | fixup_section (struct general_symbol_info *ginfo, struct objfile *objfile) |
c906108c SS |
761 | { |
762 | struct minimal_symbol *msym; | |
763 | msym = lookup_minimal_symbol (ginfo->name, NULL, objfile); | |
764 | ||
765 | if (msym) | |
7a78d0ee KB |
766 | { |
767 | ginfo->bfd_section = SYMBOL_BFD_SECTION (msym); | |
768 | ginfo->section = SYMBOL_SECTION (msym); | |
769 | } | |
c906108c SS |
770 | } |
771 | ||
772 | struct symbol * | |
fba45db2 | 773 | fixup_symbol_section (struct symbol *sym, struct objfile *objfile) |
c906108c SS |
774 | { |
775 | if (!sym) | |
776 | return NULL; | |
777 | ||
778 | if (SYMBOL_BFD_SECTION (sym)) | |
779 | return sym; | |
780 | ||
781 | fixup_section (&sym->ginfo, objfile); | |
782 | ||
783 | return sym; | |
784 | } | |
785 | ||
7a78d0ee | 786 | struct partial_symbol * |
fba45db2 | 787 | fixup_psymbol_section (struct partial_symbol *psym, struct objfile *objfile) |
c906108c SS |
788 | { |
789 | if (!psym) | |
790 | return NULL; | |
791 | ||
792 | if (SYMBOL_BFD_SECTION (psym)) | |
793 | return psym; | |
794 | ||
795 | fixup_section (&psym->ginfo, objfile); | |
796 | ||
797 | return psym; | |
798 | } | |
799 | ||
800 | /* Find the definition for a specified symbol name NAME | |
801 | in namespace NAMESPACE, visible from lexical block BLOCK. | |
802 | Returns the struct symbol pointer, or zero if no symbol is found. | |
803 | If SYMTAB is non-NULL, store the symbol table in which the | |
804 | symbol was found there, or NULL if not found. | |
805 | C++: if IS_A_FIELD_OF_THIS is nonzero on entry, check to see if | |
806 | NAME is a field of the current implied argument `this'. If so set | |
807 | *IS_A_FIELD_OF_THIS to 1, otherwise set it to zero. | |
808 | BLOCK_FOUND is set to the block in which NAME is found (in the case of | |
809 | a field of `this', value_of_this sets BLOCK_FOUND to the proper value.) */ | |
810 | ||
811 | /* This function has a bunch of loops in it and it would seem to be | |
812 | attractive to put in some QUIT's (though I'm not really sure | |
813 | whether it can run long enough to be really important). But there | |
814 | are a few calls for which it would appear to be bad news to quit | |
7ca9f392 AC |
815 | out of here: find_proc_desc in alpha-tdep.c and mips-tdep.c. (Note |
816 | that there is C++ code below which can error(), but that probably | |
817 | doesn't affect these calls since they are looking for a known | |
818 | variable and thus can probably assume it will never hit the C++ | |
819 | code). */ | |
c906108c SS |
820 | |
821 | struct symbol * | |
fba7f19c | 822 | lookup_symbol (const char *name, const struct block *block, |
fba45db2 KB |
823 | const namespace_enum namespace, int *is_a_field_of_this, |
824 | struct symtab **symtab) | |
c906108c | 825 | { |
729051e6 DJ |
826 | char *demangled_name = NULL; |
827 | const char *modified_name = NULL; | |
3121eff0 | 828 | const char *mangled_name = NULL; |
fba7f19c EZ |
829 | int needtofreename = 0; |
830 | struct symbol *returnval; | |
c906108c | 831 | |
729051e6 DJ |
832 | modified_name = name; |
833 | ||
834 | /* If we are using C++ language, demangle the name before doing a lookup, so | |
835 | we can always binary search. */ | |
836 | if (current_language->la_language == language_cplus) | |
837 | { | |
838 | demangled_name = cplus_demangle (name, DMGL_ANSI | DMGL_PARAMS); | |
839 | if (demangled_name) | |
840 | { | |
841 | mangled_name = name; | |
842 | modified_name = demangled_name; | |
843 | needtofreename = 1; | |
844 | } | |
845 | } | |
846 | ||
63872f9d JG |
847 | if (case_sensitivity == case_sensitive_off) |
848 | { | |
849 | char *copy; | |
850 | int len, i; | |
851 | ||
852 | len = strlen (name); | |
853 | copy = (char *) alloca (len + 1); | |
854 | for (i= 0; i < len; i++) | |
855 | copy[i] = tolower (name[i]); | |
856 | copy[len] = 0; | |
fba7f19c | 857 | modified_name = copy; |
63872f9d | 858 | } |
fba7f19c | 859 | |
3121eff0 DJ |
860 | returnval = lookup_symbol_aux (modified_name, mangled_name, block, |
861 | namespace, is_a_field_of_this, symtab); | |
fba7f19c | 862 | if (needtofreename) |
729051e6 | 863 | xfree (demangled_name); |
fba7f19c EZ |
864 | |
865 | return returnval; | |
866 | } | |
867 | ||
868 | static struct symbol * | |
3121eff0 DJ |
869 | lookup_symbol_aux (const char *name, const char *mangled_name, |
870 | const struct block *block, const namespace_enum namespace, | |
871 | int *is_a_field_of_this, struct symtab **symtab) | |
fba7f19c | 872 | { |
8155455b | 873 | struct symbol *sym; |
e4051eeb | 874 | const struct block *static_block; |
406bc4de | 875 | |
e4051eeb DC |
876 | /* Search specified block and its superiors. Don't search |
877 | STATIC_BLOCK or GLOBAL_BLOCK. */ | |
c906108c | 878 | |
8155455b | 879 | sym = lookup_symbol_aux_local (name, mangled_name, block, namespace, |
e4051eeb | 880 | symtab, &static_block); |
8155455b DC |
881 | if (sym != NULL) |
882 | return sym; | |
c906108c | 883 | |
8155455b DC |
884 | #if 0 |
885 | /* NOTE: carlton/2002-11-05: At the time that this code was | |
886 | #ifdeffed out, the value of 'block' was always NULL at this | |
887 | point, hence the bemused comments below. */ | |
c906108c SS |
888 | |
889 | /* FIXME: this code is never executed--block is always NULL at this | |
890 | point. What is it trying to do, anyway? We already should have | |
891 | checked the STATIC_BLOCK above (it is the superblock of top-level | |
892 | blocks). Why is VAR_NAMESPACE special-cased? */ | |
893 | /* Don't need to mess with the psymtabs; if we have a block, | |
894 | that file is read in. If we don't, then we deal later with | |
895 | all the psymtab stuff that needs checking. */ | |
896 | /* Note (RT): The following never-executed code looks unnecessary to me also. | |
897 | * If we change the code to use the original (passed-in) | |
898 | * value of 'block', we could cause it to execute, but then what | |
899 | * would it do? The STATIC_BLOCK of the symtab containing the passed-in | |
900 | * 'block' was already searched by the above code. And the STATIC_BLOCK's | |
901 | * of *other* symtabs (those files not containing 'block' lexically) | |
902 | * should not contain 'block' address-wise. So we wouldn't expect this | |
903 | * code to find any 'sym''s that were not found above. I vote for | |
904 | * deleting the following paragraph of code. | |
905 | */ | |
906 | if (namespace == VAR_NAMESPACE && block != NULL) | |
907 | { | |
908 | struct block *b; | |
909 | /* Find the right symtab. */ | |
910 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
911 | { |
912 | bv = BLOCKVECTOR (s); | |
913 | b = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
914 | if (BLOCK_START (b) <= BLOCK_START (block) | |
915 | && BLOCK_END (b) > BLOCK_START (block)) | |
916 | { | |
3121eff0 | 917 | sym = lookup_block_symbol (b, name, mangled_name, VAR_NAMESPACE); |
c5aa993b JM |
918 | if (sym) |
919 | { | |
920 | block_found = b; | |
921 | if (symtab != NULL) | |
922 | *symtab = s; | |
923 | return fixup_symbol_section (sym, objfile); | |
924 | } | |
925 | } | |
926 | } | |
c906108c | 927 | } |
8155455b | 928 | #endif /* 0 */ |
c906108c SS |
929 | |
930 | /* C++: If requested to do so by the caller, | |
931 | check to see if NAME is a field of `this'. */ | |
932 | if (is_a_field_of_this) | |
933 | { | |
934 | struct value *v = value_of_this (0); | |
c5aa993b | 935 | |
c906108c SS |
936 | *is_a_field_of_this = 0; |
937 | if (v && check_field (v, name)) | |
938 | { | |
939 | *is_a_field_of_this = 1; | |
940 | if (symtab != NULL) | |
941 | *symtab = NULL; | |
942 | return NULL; | |
943 | } | |
944 | } | |
945 | ||
e4051eeb DC |
946 | /* If there's a static block to search, search it next. */ |
947 | ||
948 | /* NOTE: carlton/2002-12-05: There is a question as to whether or | |
949 | not it would be appropriate to search the current global block | |
950 | here as well. (That's what this code used to do before the | |
951 | is_a_field_of_this check was moved up.) On the one hand, it's | |
952 | redundant with the lookup_symbol_aux_symtabs search that happens | |
953 | next. On the other hand, if decode_line_1 is passed an argument | |
954 | like filename:var, then the user presumably wants 'var' to be | |
955 | searched for in filename. On the third hand, there shouldn't be | |
956 | multiple global variables all of which are named 'var', and it's | |
957 | not like decode_line_1 has ever restricted its search to only | |
958 | global variables in a single filename. All in all, only | |
959 | searching the static block here seems best: it's correct and it's | |
960 | cleanest. */ | |
961 | ||
962 | /* NOTE: carlton/2002-12-05: There's also a possible performance | |
963 | issue here: if you usually search for global symbols in the | |
964 | current file, then it would be slightly better to search the | |
965 | current global block before searching all the symtabs. But there | |
966 | are other factors that have a much greater effect on performance | |
967 | than that one, so I don't think we should worry about that for | |
968 | now. */ | |
969 | ||
970 | if (static_block != NULL) | |
971 | { | |
972 | sym = lookup_symbol_aux_block (name, mangled_name, static_block, | |
973 | namespace, symtab); | |
974 | if (sym != NULL) | |
975 | return sym; | |
976 | } | |
977 | ||
c906108c SS |
978 | /* Now search all global blocks. Do the symtab's first, then |
979 | check the psymtab's. If a psymtab indicates the existence | |
980 | of the desired name as a global, then do psymtab-to-symtab | |
981 | conversion on the fly and return the found symbol. */ | |
c5aa993b | 982 | |
8155455b DC |
983 | sym = lookup_symbol_aux_symtabs (GLOBAL_BLOCK, name, mangled_name, |
984 | namespace, symtab); | |
985 | if (sym != NULL) | |
986 | return sym; | |
c906108c SS |
987 | |
988 | #ifndef HPUXHPPA | |
989 | ||
990 | /* Check for the possibility of the symbol being a function or | |
991 | a mangled variable that is stored in one of the minimal symbol tables. | |
992 | Eventually, all global symbols might be resolved in this way. */ | |
c5aa993b | 993 | |
406bc4de DC |
994 | sym = lookup_symbol_aux_minsyms (name, mangled_name, |
995 | namespace, is_a_field_of_this, | |
e45febe2 | 996 | symtab); |
406bc4de | 997 | |
e45febe2 | 998 | if (sym != NULL) |
406bc4de | 999 | return sym; |
c5aa993b | 1000 | |
c906108c SS |
1001 | #endif |
1002 | ||
8155455b DC |
1003 | sym = lookup_symbol_aux_psymtabs (GLOBAL_BLOCK, name, mangled_name, |
1004 | namespace, symtab); | |
1005 | if (sym != NULL) | |
1006 | return sym; | |
c906108c | 1007 | |
8155455b DC |
1008 | /* Now search all static file-level symbols. Not strictly correct, |
1009 | but more useful than an error. Do the symtabs first, then check | |
1010 | the psymtabs. If a psymtab indicates the existence of the | |
1011 | desired name as a file-level static, then do psymtab-to-symtab | |
c906108c SS |
1012 | conversion on the fly and return the found symbol. */ |
1013 | ||
8155455b DC |
1014 | sym = lookup_symbol_aux_symtabs (STATIC_BLOCK, name, mangled_name, |
1015 | namespace, symtab); | |
1016 | if (sym != NULL) | |
1017 | return sym; | |
1018 | ||
1019 | sym = lookup_symbol_aux_psymtabs (STATIC_BLOCK, name, mangled_name, | |
1020 | namespace, symtab); | |
1021 | if (sym != NULL) | |
1022 | return sym; | |
c906108c SS |
1023 | |
1024 | #ifdef HPUXHPPA | |
1025 | ||
1026 | /* Check for the possibility of the symbol being a function or | |
1027 | a global variable that is stored in one of the minimal symbol tables. | |
1028 | The "minimal symbol table" is built from linker-supplied info. | |
1029 | ||
1030 | RT: I moved this check to last, after the complete search of | |
1031 | the global (p)symtab's and static (p)symtab's. For HP-generated | |
1032 | symbol tables, this check was causing a premature exit from | |
1033 | lookup_symbol with NULL return, and thus messing up symbol lookups | |
1034 | of things like "c::f". It seems to me a check of the minimal | |
1035 | symbol table ought to be a last resort in any case. I'm vaguely | |
1036 | worried about the comment below which talks about FORTRAN routines "foo_" | |
1037 | though... is it saying we need to do the "minsym" check before | |
1038 | the static check in this case? | |
1039 | */ | |
c5aa993b | 1040 | |
c906108c | 1041 | |
406bc4de DC |
1042 | sym = lookup_symbol_aux_minsyms (name, mangled_name, |
1043 | namespace, is_a_field_of_this, | |
e45febe2 | 1044 | symtab); |
406bc4de | 1045 | |
e45febe2 | 1046 | if (sym != NULL) |
406bc4de | 1047 | return sym; |
c906108c SS |
1048 | |
1049 | #endif | |
1050 | ||
1051 | if (symtab != NULL) | |
1052 | *symtab = NULL; | |
8155455b | 1053 | return NULL; |
c906108c | 1054 | } |
8155455b | 1055 | |
e4051eeb DC |
1056 | /* Check to see if the symbol is defined in BLOCK or its superiors. |
1057 | Don't search STATIC_BLOCK or GLOBAL_BLOCK. If we don't find a | |
1058 | match, store the address of STATIC_BLOCK in static_block. */ | |
8155455b DC |
1059 | |
1060 | static struct symbol * | |
1061 | lookup_symbol_aux_local (const char *name, const char *mangled_name, | |
1062 | const struct block *block, | |
1063 | const namespace_enum namespace, | |
e4051eeb DC |
1064 | struct symtab **symtab, |
1065 | const struct block **static_block) | |
8155455b DC |
1066 | { |
1067 | struct symbol *sym; | |
f61e8913 | 1068 | |
e4051eeb DC |
1069 | /* Check if either no block is specified or it's a global block. */ |
1070 | ||
1071 | if (block == NULL || BLOCK_SUPERBLOCK (block) == NULL) | |
1072 | { | |
1073 | *static_block = NULL; | |
1074 | return NULL; | |
1075 | } | |
1076 | ||
1077 | while (BLOCK_SUPERBLOCK (BLOCK_SUPERBLOCK (block)) != NULL) | |
f61e8913 DC |
1078 | { |
1079 | sym = lookup_symbol_aux_block (name, mangled_name, block, namespace, | |
1080 | symtab); | |
1081 | if (sym != NULL) | |
1082 | return sym; | |
1083 | block = BLOCK_SUPERBLOCK (block); | |
1084 | } | |
1085 | ||
e4051eeb DC |
1086 | /* We've reached the static block. */ |
1087 | ||
1088 | *static_block = block; | |
f61e8913 DC |
1089 | return NULL; |
1090 | } | |
1091 | ||
1092 | /* Look up a symbol in a block; if found, locate its symtab, fixup the | |
1093 | symbol, and set block_found appropriately. */ | |
1094 | ||
1095 | static struct symbol * | |
1096 | lookup_symbol_aux_block (const char *name, const char *mangled_name, | |
1097 | const struct block *block, | |
1098 | const namespace_enum namespace, | |
1099 | struct symtab **symtab) | |
1100 | { | |
1101 | struct symbol *sym; | |
8155455b DC |
1102 | struct objfile *objfile = NULL; |
1103 | struct blockvector *bv; | |
1104 | struct block *b; | |
1105 | struct symtab *s = NULL; | |
f61e8913 DC |
1106 | |
1107 | sym = lookup_block_symbol (block, name, mangled_name, namespace); | |
1108 | if (sym) | |
8155455b | 1109 | { |
f61e8913 DC |
1110 | block_found = block; |
1111 | if (symtab != NULL) | |
8155455b | 1112 | { |
f61e8913 DC |
1113 | /* Search the list of symtabs for one which contains the |
1114 | address of the start of this block. */ | |
1115 | ALL_SYMTABS (objfile, s) | |
8155455b | 1116 | { |
f61e8913 DC |
1117 | bv = BLOCKVECTOR (s); |
1118 | b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
1119 | if (BLOCK_START (b) <= BLOCK_START (block) | |
1120 | && BLOCK_END (b) > BLOCK_START (block)) | |
1121 | goto found; | |
8155455b | 1122 | } |
f61e8913 DC |
1123 | found: |
1124 | *symtab = s; | |
8155455b | 1125 | } |
f61e8913 DC |
1126 | |
1127 | return fixup_symbol_section (sym, objfile); | |
8155455b DC |
1128 | } |
1129 | ||
1130 | return NULL; | |
1131 | } | |
1132 | ||
1133 | /* Check to see if the symbol is defined in one of the symtabs. | |
1134 | BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK, | |
1135 | depending on whether or not we want to search global symbols or | |
1136 | static symbols. */ | |
1137 | ||
1138 | static struct symbol * | |
1139 | lookup_symbol_aux_symtabs (int block_index, | |
1140 | const char *name, const char *mangled_name, | |
1141 | const namespace_enum namespace, | |
1142 | struct symtab **symtab) | |
1143 | { | |
1144 | struct symbol *sym; | |
1145 | struct objfile *objfile; | |
1146 | struct blockvector *bv; | |
1147 | const struct block *block; | |
1148 | struct symtab *s; | |
1149 | ||
1150 | ALL_SYMTABS (objfile, s) | |
1151 | { | |
1152 | bv = BLOCKVECTOR (s); | |
1153 | block = BLOCKVECTOR_BLOCK (bv, block_index); | |
1154 | sym = lookup_block_symbol (block, name, mangled_name, namespace); | |
1155 | if (sym) | |
1156 | { | |
1157 | block_found = block; | |
1158 | if (symtab != NULL) | |
1159 | *symtab = s; | |
1160 | return fixup_symbol_section (sym, objfile); | |
1161 | } | |
1162 | } | |
1163 | ||
1164 | return NULL; | |
1165 | } | |
1166 | ||
1167 | /* Check to see if the symbol is defined in one of the partial | |
1168 | symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or | |
1169 | STATIC_BLOCK, depending on whether or not we want to search global | |
1170 | symbols or static symbols. */ | |
1171 | ||
1172 | static struct symbol * | |
1173 | lookup_symbol_aux_psymtabs (int block_index, const char *name, | |
1174 | const char *mangled_name, | |
1175 | const namespace_enum namespace, | |
1176 | struct symtab **symtab) | |
1177 | { | |
1178 | struct symbol *sym; | |
1179 | struct objfile *objfile; | |
1180 | struct blockvector *bv; | |
1181 | const struct block *block; | |
1182 | struct partial_symtab *ps; | |
1183 | struct symtab *s; | |
1184 | const int psymtab_index = (block_index == GLOBAL_BLOCK ? 1 : 0); | |
1185 | ||
1186 | ALL_PSYMTABS (objfile, ps) | |
1187 | { | |
1188 | if (!ps->readin | |
1189 | && lookup_partial_symbol (ps, name, psymtab_index, namespace)) | |
1190 | { | |
1191 | s = PSYMTAB_TO_SYMTAB (ps); | |
1192 | bv = BLOCKVECTOR (s); | |
1193 | block = BLOCKVECTOR_BLOCK (bv, block_index); | |
1194 | sym = lookup_block_symbol (block, name, mangled_name, namespace); | |
1195 | if (!sym) | |
1196 | { | |
1197 | /* This shouldn't be necessary, but as a last resort try | |
1198 | looking in the statics even though the psymtab claimed | |
1199 | the symbol was global, or vice-versa. It's possible | |
1200 | that the psymtab gets it wrong in some cases. */ | |
1201 | ||
1202 | /* FIXME: carlton/2002-09-30: Should we really do that? | |
1203 | If that happens, isn't it likely to be a GDB error, in | |
1204 | which case we should fix the GDB error rather than | |
1205 | silently dealing with it here? So I'd vote for | |
1206 | removing the check for the symbol in the other | |
1207 | block. */ | |
1208 | block = BLOCKVECTOR_BLOCK (bv, | |
1209 | block_index == GLOBAL_BLOCK ? | |
1210 | STATIC_BLOCK : GLOBAL_BLOCK); | |
1211 | sym = lookup_block_symbol (block, name, mangled_name, namespace); | |
1212 | if (!sym) | |
1213 | error ("Internal: %s symbol `%s' found in %s psymtab but not in symtab.\n%s may be an inlined function, or may be a template function\n(if a template, try specifying an instantiation: %s<type>).", | |
1214 | block_index == GLOBAL_BLOCK ? "global" : "static", | |
1215 | name, ps->filename, name, name); | |
1216 | } | |
1217 | if (symtab != NULL) | |
1218 | *symtab = s; | |
1219 | return fixup_symbol_section (sym, objfile); | |
1220 | } | |
1221 | } | |
1222 | ||
1223 | return NULL; | |
1224 | } | |
1225 | ||
406bc4de DC |
1226 | /* Check for the possibility of the symbol being a function or a |
1227 | mangled variable that is stored in one of the minimal symbol | |
1228 | tables. Eventually, all global symbols might be resolved in this | |
1229 | way. */ | |
1230 | ||
e45febe2 DC |
1231 | /* NOTE: carlton/2002-12-05: At one point, this function was part of |
1232 | lookup_symbol_aux, and what are now 'return' statements within | |
1233 | lookup_symbol_aux_minsyms returned from lookup_symbol_aux, even if | |
1234 | sym was NULL. As far as I can tell, this was basically accidental; | |
1235 | it didn't happen every time that msymbol was non-NULL, but only if | |
1236 | some additional conditions held as well, and it caused problems | |
1237 | with HP-generated symbol tables. */ | |
1238 | ||
406bc4de DC |
1239 | static struct symbol * |
1240 | lookup_symbol_aux_minsyms (const char *name, | |
1241 | const char *mangled_name, | |
1242 | const namespace_enum namespace, | |
1243 | int *is_a_field_of_this, | |
e45febe2 | 1244 | struct symtab **symtab) |
406bc4de DC |
1245 | { |
1246 | struct symbol *sym; | |
1247 | struct blockvector *bv; | |
1248 | const struct block *block; | |
1249 | struct minimal_symbol *msymbol; | |
1250 | struct symtab *s; | |
1251 | ||
1252 | if (namespace == VAR_NAMESPACE) | |
1253 | { | |
1254 | msymbol = lookup_minimal_symbol (name, NULL, NULL); | |
1255 | ||
1256 | if (msymbol != NULL) | |
1257 | { | |
1258 | /* OK, we found a minimal symbol in spite of not finding any | |
1259 | symbol. There are various possible explanations for | |
1260 | this. One possibility is the symbol exists in code not | |
1261 | compiled -g. Another possibility is that the 'psymtab' | |
1262 | isn't doing its job. A third possibility, related to #2, | |
1263 | is that we were confused by name-mangling. For instance, | |
1264 | maybe the psymtab isn't doing its job because it only | |
1265 | know about demangled names, but we were given a mangled | |
1266 | name... */ | |
1267 | ||
1268 | /* We first use the address in the msymbol to try to locate | |
1269 | the appropriate symtab. Note that find_pc_sect_symtab() | |
1270 | has a side-effect of doing psymtab-to-symtab expansion, | |
1271 | for the found symtab. */ | |
1272 | s = find_pc_sect_symtab (SYMBOL_VALUE_ADDRESS (msymbol), | |
1273 | SYMBOL_BFD_SECTION (msymbol)); | |
1274 | if (s != NULL) | |
1275 | { | |
1276 | /* This is a function which has a symtab for its address. */ | |
1277 | bv = BLOCKVECTOR (s); | |
1278 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
1279 | ||
1280 | /* This call used to pass `SYMBOL_NAME (msymbol)' as the | |
1281 | `name' argument to lookup_block_symbol. But the name | |
1282 | of a minimal symbol is always mangled, so that seems | |
1283 | to be clearly the wrong thing to pass as the | |
1284 | unmangled name. */ | |
1285 | sym = | |
1286 | lookup_block_symbol (block, name, mangled_name, namespace); | |
1287 | /* We kept static functions in minimal symbol table as well as | |
1288 | in static scope. We want to find them in the symbol table. */ | |
1289 | if (!sym) | |
1290 | { | |
1291 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
1292 | sym = lookup_block_symbol (block, name, | |
1293 | mangled_name, namespace); | |
1294 | } | |
1295 | ||
1296 | /* NOTE: carlton/2002-12-04: The following comment was | |
1297 | taken from a time when two versions of this function | |
1298 | were part of the body of lookup_symbol_aux: this | |
1299 | comment was taken from the version of the function | |
1300 | that was #ifdef HPUXHPPA, and the comment was right | |
1301 | before the 'return NULL' part of lookup_symbol_aux. | |
1302 | (Hence the "Fall through and return 0" comment.) | |
1303 | Elena did some digging into the situation for | |
1304 | Fortran, and she reports: | |
1305 | ||
1306 | "I asked around (thanks to Jeff Knaggs), and I think | |
1307 | the story for Fortran goes like this: | |
1308 | ||
1309 | "Apparently, in older Fortrans, '_' was not part of | |
1310 | the user namespace. g77 attached a final '_' to | |
1311 | procedure names as the exported symbols for linkage | |
1312 | (foo_) , but the symbols went in the debug info just | |
1313 | like 'foo'. The rationale behind this is not | |
1314 | completely clear, and maybe it was done to other | |
1315 | symbols as well, not just procedures." */ | |
1316 | ||
1317 | /* If we get here with sym == 0, the symbol was | |
1318 | found in the minimal symbol table | |
1319 | but not in the symtab. | |
1320 | Fall through and return 0 to use the msymbol | |
1321 | definition of "foo_". | |
1322 | (Note that outer code generally follows up a call | |
1323 | to this routine with a call to lookup_minimal_symbol(), | |
1324 | so a 0 return means we'll just flow into that other routine). | |
1325 | ||
1326 | This happens for Fortran "foo_" symbols, | |
1327 | which are "foo" in the symtab. | |
1328 | ||
1329 | This can also happen if "asm" is used to make a | |
1330 | regular symbol but not a debugging symbol, e.g. | |
1331 | asm(".globl _main"); | |
1332 | asm("_main:"); | |
1333 | */ | |
1334 | ||
1335 | if (symtab != NULL && sym != NULL) | |
1336 | *symtab = s; | |
406bc4de DC |
1337 | return fixup_symbol_section (sym, s->objfile); |
1338 | } | |
1339 | else if (MSYMBOL_TYPE (msymbol) != mst_text | |
1340 | && MSYMBOL_TYPE (msymbol) != mst_file_text | |
1341 | && !STREQ (name, SYMBOL_NAME (msymbol))) | |
1342 | { | |
1343 | /* This is a mangled variable, look it up by its | |
1344 | mangled name. */ | |
406bc4de DC |
1345 | return lookup_symbol_aux (SYMBOL_NAME (msymbol), mangled_name, |
1346 | NULL, namespace, is_a_field_of_this, | |
1347 | symtab); | |
1348 | } | |
1349 | } | |
1350 | } | |
1351 | ||
1352 | return NULL; | |
1353 | } | |
1354 | ||
c906108c SS |
1355 | /* Look, in partial_symtab PST, for symbol NAME. Check the global |
1356 | symbols if GLOBAL, the static symbols if not */ | |
1357 | ||
1358 | static struct partial_symbol * | |
fba45db2 KB |
1359 | lookup_partial_symbol (struct partial_symtab *pst, const char *name, int global, |
1360 | namespace_enum namespace) | |
c906108c | 1361 | { |
357e46e7 | 1362 | struct partial_symbol *temp; |
c906108c | 1363 | struct partial_symbol **start, **psym; |
38d49aff | 1364 | struct partial_symbol **top, **real_top, **bottom, **center; |
c906108c SS |
1365 | int length = (global ? pst->n_global_syms : pst->n_static_syms); |
1366 | int do_linear_search = 1; | |
357e46e7 | 1367 | |
c906108c SS |
1368 | if (length == 0) |
1369 | { | |
1370 | return (NULL); | |
1371 | } | |
c906108c SS |
1372 | start = (global ? |
1373 | pst->objfile->global_psymbols.list + pst->globals_offset : | |
c5aa993b | 1374 | pst->objfile->static_psymbols.list + pst->statics_offset); |
357e46e7 | 1375 | |
c5aa993b | 1376 | if (global) /* This means we can use a binary search. */ |
c906108c SS |
1377 | { |
1378 | do_linear_search = 0; | |
1379 | ||
1380 | /* Binary search. This search is guaranteed to end with center | |
1381 | pointing at the earliest partial symbol with the correct | |
c5aa993b JM |
1382 | name. At that point *all* partial symbols with that name |
1383 | will be checked against the correct namespace. */ | |
c906108c SS |
1384 | |
1385 | bottom = start; | |
1386 | top = start + length - 1; | |
38d49aff | 1387 | real_top = top; |
c906108c SS |
1388 | while (top > bottom) |
1389 | { | |
1390 | center = bottom + (top - bottom) / 2; | |
1391 | if (!(center < top)) | |
e1e9e218 | 1392 | internal_error (__FILE__, __LINE__, "failed internal consistency check"); |
c906108c | 1393 | if (!do_linear_search |
357e46e7 | 1394 | && (SYMBOL_LANGUAGE (*center) == language_java)) |
c906108c SS |
1395 | { |
1396 | do_linear_search = 1; | |
1397 | } | |
494b7ec9 | 1398 | if (strcmp (SYMBOL_SOURCE_NAME (*center), name) >= 0) |
c906108c SS |
1399 | { |
1400 | top = center; | |
1401 | } | |
1402 | else | |
1403 | { | |
1404 | bottom = center + 1; | |
1405 | } | |
1406 | } | |
1407 | if (!(top == bottom)) | |
e1e9e218 | 1408 | internal_error (__FILE__, __LINE__, "failed internal consistency check"); |
357e46e7 DB |
1409 | |
1410 | /* djb - 2000-06-03 - Use SYMBOL_MATCHES_NAME, not a strcmp, so | |
1411 | we don't have to force a linear search on C++. Probably holds true | |
1412 | for JAVA as well, no way to check.*/ | |
38d49aff | 1413 | while (top <= real_top && SYMBOL_MATCHES_NAME (*top,name)) |
c906108c SS |
1414 | { |
1415 | if (SYMBOL_NAMESPACE (*top) == namespace) | |
1416 | { | |
357e46e7 | 1417 | return (*top); |
c906108c | 1418 | } |
c5aa993b | 1419 | top++; |
c906108c SS |
1420 | } |
1421 | } | |
1422 | ||
1423 | /* Can't use a binary search or else we found during the binary search that | |
1424 | we should also do a linear search. */ | |
1425 | ||
1426 | if (do_linear_search) | |
357e46e7 | 1427 | { |
c906108c SS |
1428 | for (psym = start; psym < start + length; psym++) |
1429 | { | |
1430 | if (namespace == SYMBOL_NAMESPACE (*psym)) | |
1431 | { | |
1432 | if (SYMBOL_MATCHES_NAME (*psym, name)) | |
1433 | { | |
1434 | return (*psym); | |
1435 | } | |
1436 | } | |
1437 | } | |
1438 | } | |
1439 | ||
1440 | return (NULL); | |
1441 | } | |
1442 | ||
1443 | /* Look up a type named NAME in the struct_namespace. The type returned | |
1444 | must not be opaque -- i.e., must have at least one field defined | |
1445 | ||
1446 | This code was modelled on lookup_symbol -- the parts not relevant to looking | |
1447 | up types were just left out. In particular it's assumed here that types | |
1448 | are available in struct_namespace and only at file-static or global blocks. */ | |
1449 | ||
1450 | ||
1451 | struct type * | |
fba45db2 | 1452 | lookup_transparent_type (const char *name) |
c906108c SS |
1453 | { |
1454 | register struct symbol *sym; | |
1455 | register struct symtab *s = NULL; | |
1456 | register struct partial_symtab *ps; | |
1457 | struct blockvector *bv; | |
1458 | register struct objfile *objfile; | |
1459 | register struct block *block; | |
c906108c SS |
1460 | |
1461 | /* Now search all the global symbols. Do the symtab's first, then | |
1462 | check the psymtab's. If a psymtab indicates the existence | |
1463 | of the desired name as a global, then do psymtab-to-symtab | |
1464 | conversion on the fly and return the found symbol. */ | |
c5aa993b | 1465 | |
c906108c | 1466 | ALL_SYMTABS (objfile, s) |
c5aa993b JM |
1467 | { |
1468 | bv = BLOCKVECTOR (s); | |
1469 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
3121eff0 | 1470 | sym = lookup_block_symbol (block, name, NULL, STRUCT_NAMESPACE); |
c5aa993b JM |
1471 | if (sym && !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) |
1472 | { | |
1473 | return SYMBOL_TYPE (sym); | |
1474 | } | |
1475 | } | |
c906108c SS |
1476 | |
1477 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
1478 | { |
1479 | if (!ps->readin && lookup_partial_symbol (ps, name, 1, STRUCT_NAMESPACE)) | |
1480 | { | |
1481 | s = PSYMTAB_TO_SYMTAB (ps); | |
1482 | bv = BLOCKVECTOR (s); | |
1483 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
3121eff0 | 1484 | sym = lookup_block_symbol (block, name, NULL, STRUCT_NAMESPACE); |
c5aa993b JM |
1485 | if (!sym) |
1486 | { | |
1487 | /* This shouldn't be necessary, but as a last resort | |
1488 | * try looking in the statics even though the psymtab | |
1489 | * claimed the symbol was global. It's possible that | |
1490 | * the psymtab gets it wrong in some cases. | |
1491 | */ | |
1492 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
3121eff0 | 1493 | sym = lookup_block_symbol (block, name, NULL, STRUCT_NAMESPACE); |
c5aa993b JM |
1494 | if (!sym) |
1495 | error ("Internal: global symbol `%s' found in %s psymtab but not in symtab.\n\ | |
c906108c SS |
1496 | %s may be an inlined function, or may be a template function\n\ |
1497 | (if a template, try specifying an instantiation: %s<type>).", | |
c5aa993b JM |
1498 | name, ps->filename, name, name); |
1499 | } | |
1500 | if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) | |
1501 | return SYMBOL_TYPE (sym); | |
1502 | } | |
1503 | } | |
c906108c SS |
1504 | |
1505 | /* Now search the static file-level symbols. | |
1506 | Not strictly correct, but more useful than an error. | |
1507 | Do the symtab's first, then | |
1508 | check the psymtab's. If a psymtab indicates the existence | |
1509 | of the desired name as a file-level static, then do psymtab-to-symtab | |
1510 | conversion on the fly and return the found symbol. | |
1511 | */ | |
1512 | ||
1513 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
1514 | { |
1515 | bv = BLOCKVECTOR (s); | |
1516 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
3121eff0 | 1517 | sym = lookup_block_symbol (block, name, NULL, STRUCT_NAMESPACE); |
c5aa993b JM |
1518 | if (sym && !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) |
1519 | { | |
1520 | return SYMBOL_TYPE (sym); | |
1521 | } | |
1522 | } | |
c906108c SS |
1523 | |
1524 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
1525 | { |
1526 | if (!ps->readin && lookup_partial_symbol (ps, name, 0, STRUCT_NAMESPACE)) | |
1527 | { | |
1528 | s = PSYMTAB_TO_SYMTAB (ps); | |
1529 | bv = BLOCKVECTOR (s); | |
1530 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
3121eff0 | 1531 | sym = lookup_block_symbol (block, name, NULL, STRUCT_NAMESPACE); |
c5aa993b JM |
1532 | if (!sym) |
1533 | { | |
1534 | /* This shouldn't be necessary, but as a last resort | |
1535 | * try looking in the globals even though the psymtab | |
1536 | * claimed the symbol was static. It's possible that | |
1537 | * the psymtab gets it wrong in some cases. | |
1538 | */ | |
1539 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
3121eff0 | 1540 | sym = lookup_block_symbol (block, name, NULL, STRUCT_NAMESPACE); |
c5aa993b JM |
1541 | if (!sym) |
1542 | error ("Internal: static symbol `%s' found in %s psymtab but not in symtab.\n\ | |
c906108c SS |
1543 | %s may be an inlined function, or may be a template function\n\ |
1544 | (if a template, try specifying an instantiation: %s<type>).", | |
c5aa993b JM |
1545 | name, ps->filename, name, name); |
1546 | } | |
1547 | if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) | |
1548 | return SYMBOL_TYPE (sym); | |
1549 | } | |
1550 | } | |
c906108c SS |
1551 | return (struct type *) 0; |
1552 | } | |
1553 | ||
1554 | ||
1555 | /* Find the psymtab containing main(). */ | |
1556 | /* FIXME: What about languages without main() or specially linked | |
1557 | executables that have no main() ? */ | |
1558 | ||
1559 | struct partial_symtab * | |
fba45db2 | 1560 | find_main_psymtab (void) |
c906108c SS |
1561 | { |
1562 | register struct partial_symtab *pst; | |
1563 | register struct objfile *objfile; | |
1564 | ||
1565 | ALL_PSYMTABS (objfile, pst) | |
c5aa993b | 1566 | { |
51cc5b07 | 1567 | if (lookup_partial_symbol (pst, main_name (), 1, VAR_NAMESPACE)) |
c5aa993b JM |
1568 | { |
1569 | return (pst); | |
1570 | } | |
1571 | } | |
c906108c SS |
1572 | return (NULL); |
1573 | } | |
1574 | ||
1575 | /* Search BLOCK for symbol NAME in NAMESPACE. | |
1576 | ||
1577 | Note that if NAME is the demangled form of a C++ symbol, we will fail | |
1578 | to find a match during the binary search of the non-encoded names, but | |
1579 | for now we don't worry about the slight inefficiency of looking for | |
1580 | a match we'll never find, since it will go pretty quick. Once the | |
1581 | binary search terminates, we drop through and do a straight linear | |
1582 | search on the symbols. Each symbol which is marked as being a C++ | |
1583 | symbol (language_cplus set) has both the encoded and non-encoded names | |
3121eff0 DJ |
1584 | tested for a match. |
1585 | ||
1586 | If MANGLED_NAME is non-NULL, verify that any symbol we find has this | |
1587 | particular mangled name. | |
1588 | */ | |
c906108c SS |
1589 | |
1590 | struct symbol * | |
fba45db2 | 1591 | lookup_block_symbol (register const struct block *block, const char *name, |
3121eff0 | 1592 | const char *mangled_name, |
fba45db2 | 1593 | const namespace_enum namespace) |
c906108c SS |
1594 | { |
1595 | register int bot, top, inc; | |
1596 | register struct symbol *sym; | |
1597 | register struct symbol *sym_found = NULL; | |
1598 | register int do_linear_search = 1; | |
1599 | ||
261397f8 DJ |
1600 | if (BLOCK_HASHTABLE (block)) |
1601 | { | |
1602 | unsigned int hash_index; | |
1603 | hash_index = msymbol_hash_iw (name); | |
1604 | hash_index = hash_index % BLOCK_BUCKETS (block); | |
1605 | for (sym = BLOCK_BUCKET (block, hash_index); sym; sym = sym->hash_next) | |
1606 | { | |
1607 | if (SYMBOL_NAMESPACE (sym) == namespace | |
1608 | && (mangled_name | |
1609 | ? strcmp (SYMBOL_NAME (sym), mangled_name) == 0 | |
1610 | : SYMBOL_MATCHES_NAME (sym, name))) | |
1611 | return sym; | |
1612 | } | |
1613 | return NULL; | |
1614 | } | |
1615 | ||
c906108c SS |
1616 | /* If the blocks's symbols were sorted, start with a binary search. */ |
1617 | ||
1618 | if (BLOCK_SHOULD_SORT (block)) | |
1619 | { | |
1620 | /* Reset the linear search flag so if the binary search fails, we | |
c5aa993b | 1621 | won't do the linear search once unless we find some reason to |
fba7f19c | 1622 | do so */ |
c906108c SS |
1623 | |
1624 | do_linear_search = 0; | |
1625 | top = BLOCK_NSYMS (block); | |
1626 | bot = 0; | |
1627 | ||
1628 | /* Advance BOT to not far before the first symbol whose name is NAME. */ | |
1629 | ||
1630 | while (1) | |
1631 | { | |
1632 | inc = (top - bot + 1); | |
1633 | /* No need to keep binary searching for the last few bits worth. */ | |
1634 | if (inc < 4) | |
1635 | { | |
1636 | break; | |
1637 | } | |
1638 | inc = (inc >> 1) + bot; | |
1639 | sym = BLOCK_SYM (block, inc); | |
fba7f19c | 1640 | if (!do_linear_search && (SYMBOL_LANGUAGE (sym) == language_java)) |
c906108c SS |
1641 | { |
1642 | do_linear_search = 1; | |
1643 | } | |
fba7f19c | 1644 | if (SYMBOL_SOURCE_NAME (sym)[0] < name[0]) |
c906108c SS |
1645 | { |
1646 | bot = inc; | |
1647 | } | |
fba7f19c | 1648 | else if (SYMBOL_SOURCE_NAME (sym)[0] > name[0]) |
c906108c SS |
1649 | { |
1650 | top = inc; | |
1651 | } | |
494b7ec9 | 1652 | else if (strcmp (SYMBOL_SOURCE_NAME (sym), name) < 0) |
c906108c SS |
1653 | { |
1654 | bot = inc; | |
1655 | } | |
1656 | else | |
1657 | { | |
1658 | top = inc; | |
1659 | } | |
1660 | } | |
1661 | ||
1662 | /* Now scan forward until we run out of symbols, find one whose | |
c5aa993b JM |
1663 | name is greater than NAME, or find one we want. If there is |
1664 | more than one symbol with the right name and namespace, we | |
1665 | return the first one; I believe it is now impossible for us | |
1666 | to encounter two symbols with the same name and namespace | |
1667 | here, because blocks containing argument symbols are no | |
3121eff0 DJ |
1668 | longer sorted. The exception is for C++, where multiple functions |
1669 | (cloned constructors / destructors, in particular) can have | |
1670 | the same demangled name. So if we have a particular | |
1671 | mangled name to match, try to do so. */ | |
c906108c SS |
1672 | |
1673 | top = BLOCK_NSYMS (block); | |
1674 | while (bot < top) | |
1675 | { | |
1676 | sym = BLOCK_SYM (block, bot); | |
3121eff0 DJ |
1677 | if (SYMBOL_NAMESPACE (sym) == namespace |
1678 | && (mangled_name | |
1679 | ? strcmp (SYMBOL_NAME (sym), mangled_name) == 0 | |
1680 | : SYMBOL_MATCHES_NAME (sym, name))) | |
c9049fc9 MC |
1681 | { |
1682 | return sym; | |
1683 | } | |
1ba7c32c JM |
1684 | if (SYMBOL_SOURCE_NAME (sym)[0] > name[0]) |
1685 | { | |
1686 | break; | |
1687 | } | |
c906108c SS |
1688 | bot++; |
1689 | } | |
1690 | } | |
1691 | ||
1692 | /* Here if block isn't sorted, or we fail to find a match during the | |
1693 | binary search above. If during the binary search above, we find a | |
8cc1c882 | 1694 | symbol which is a Java symbol, then we have re-enabled the linear |
c906108c SS |
1695 | search flag which was reset when starting the binary search. |
1696 | ||
1697 | This loop is equivalent to the loop above, but hacked greatly for speed. | |
1698 | ||
1699 | Note that parameter symbols do not always show up last in the | |
1700 | list; this loop makes sure to take anything else other than | |
1701 | parameter symbols first; it only uses parameter symbols as a | |
1702 | last resort. Note that this only takes up extra computation | |
1703 | time on a match. */ | |
1704 | ||
1705 | if (do_linear_search) | |
1706 | { | |
1707 | top = BLOCK_NSYMS (block); | |
1708 | bot = 0; | |
1709 | while (bot < top) | |
1710 | { | |
1711 | sym = BLOCK_SYM (block, bot); | |
3121eff0 DJ |
1712 | if (SYMBOL_NAMESPACE (sym) == namespace |
1713 | && (mangled_name | |
1714 | ? strcmp (SYMBOL_NAME (sym), mangled_name) == 0 | |
1715 | : SYMBOL_MATCHES_NAME (sym, name))) | |
c906108c SS |
1716 | { |
1717 | /* If SYM has aliases, then use any alias that is active | |
c5aa993b JM |
1718 | at the current PC. If no alias is active at the current |
1719 | PC, then use the main symbol. | |
c906108c | 1720 | |
c5aa993b | 1721 | ?!? Is checking the current pc correct? Is this routine |
a0b3c4fd JM |
1722 | ever called to look up a symbol from another context? |
1723 | ||
1724 | FIXME: No, it's not correct. If someone sets a | |
1725 | conditional breakpoint at an address, then the | |
1726 | breakpoint's `struct expression' should refer to the | |
1727 | `struct symbol' appropriate for the breakpoint's | |
1728 | address, which may not be the PC. | |
1729 | ||
1730 | Even if it were never called from another context, | |
1731 | it's totally bizarre for lookup_symbol's behavior to | |
1732 | depend on the value of the inferior's current PC. We | |
1733 | should pass in the appropriate PC as well as the | |
1734 | block. The interface to lookup_symbol should change | |
1735 | to require the caller to provide a PC. */ | |
1736 | ||
c5aa993b JM |
1737 | if (SYMBOL_ALIASES (sym)) |
1738 | sym = find_active_alias (sym, read_pc ()); | |
c906108c SS |
1739 | |
1740 | sym_found = sym; | |
1741 | if (SYMBOL_CLASS (sym) != LOC_ARG && | |
1742 | SYMBOL_CLASS (sym) != LOC_LOCAL_ARG && | |
1743 | SYMBOL_CLASS (sym) != LOC_REF_ARG && | |
1744 | SYMBOL_CLASS (sym) != LOC_REGPARM && | |
1745 | SYMBOL_CLASS (sym) != LOC_REGPARM_ADDR && | |
1746 | SYMBOL_CLASS (sym) != LOC_BASEREG_ARG) | |
1747 | { | |
1748 | break; | |
1749 | } | |
1750 | } | |
1751 | bot++; | |
1752 | } | |
1753 | } | |
1754 | return (sym_found); /* Will be NULL if not found. */ | |
1755 | } | |
1756 | ||
1757 | /* Given a main symbol SYM and ADDR, search through the alias | |
1758 | list to determine if an alias is active at ADDR and return | |
1759 | the active alias. | |
1760 | ||
1761 | If no alias is active, then return SYM. */ | |
1762 | ||
1763 | static struct symbol * | |
fba45db2 | 1764 | find_active_alias (struct symbol *sym, CORE_ADDR addr) |
c906108c SS |
1765 | { |
1766 | struct range_list *r; | |
1767 | struct alias_list *aliases; | |
1768 | ||
1769 | /* If we have aliases, check them first. */ | |
1770 | aliases = SYMBOL_ALIASES (sym); | |
1771 | ||
1772 | while (aliases) | |
1773 | { | |
1774 | if (!SYMBOL_RANGES (aliases->sym)) | |
c5aa993b | 1775 | return aliases->sym; |
c906108c SS |
1776 | for (r = SYMBOL_RANGES (aliases->sym); r; r = r->next) |
1777 | { | |
1778 | if (r->start <= addr && r->end > addr) | |
1779 | return aliases->sym; | |
1780 | } | |
1781 | aliases = aliases->next; | |
1782 | } | |
1783 | ||
1784 | /* Nothing found, return the main symbol. */ | |
1785 | return sym; | |
1786 | } | |
c906108c | 1787 | \f |
c5aa993b | 1788 | |
c906108c SS |
1789 | /* Return the symbol for the function which contains a specified |
1790 | lexical block, described by a struct block BL. */ | |
1791 | ||
1792 | struct symbol * | |
fba45db2 | 1793 | block_function (struct block *bl) |
c906108c SS |
1794 | { |
1795 | while (BLOCK_FUNCTION (bl) == 0 && BLOCK_SUPERBLOCK (bl) != 0) | |
1796 | bl = BLOCK_SUPERBLOCK (bl); | |
1797 | ||
1798 | return BLOCK_FUNCTION (bl); | |
1799 | } | |
1800 | ||
1801 | /* Find the symtab associated with PC and SECTION. Look through the | |
1802 | psymtabs and read in another symtab if necessary. */ | |
1803 | ||
1804 | struct symtab * | |
fba45db2 | 1805 | find_pc_sect_symtab (CORE_ADDR pc, asection *section) |
c906108c SS |
1806 | { |
1807 | register struct block *b; | |
1808 | struct blockvector *bv; | |
1809 | register struct symtab *s = NULL; | |
1810 | register struct symtab *best_s = NULL; | |
1811 | register struct partial_symtab *ps; | |
1812 | register struct objfile *objfile; | |
1813 | CORE_ADDR distance = 0; | |
8a48e967 DJ |
1814 | struct minimal_symbol *msymbol; |
1815 | ||
1816 | /* If we know that this is not a text address, return failure. This is | |
1817 | necessary because we loop based on the block's high and low code | |
1818 | addresses, which do not include the data ranges, and because | |
1819 | we call find_pc_sect_psymtab which has a similar restriction based | |
1820 | on the partial_symtab's texthigh and textlow. */ | |
1821 | msymbol = lookup_minimal_symbol_by_pc_section (pc, section); | |
1822 | if (msymbol | |
1823 | && (msymbol->type == mst_data | |
1824 | || msymbol->type == mst_bss | |
1825 | || msymbol->type == mst_abs | |
1826 | || msymbol->type == mst_file_data | |
1827 | || msymbol->type == mst_file_bss)) | |
1828 | return NULL; | |
c906108c SS |
1829 | |
1830 | /* Search all symtabs for the one whose file contains our address, and which | |
1831 | is the smallest of all the ones containing the address. This is designed | |
1832 | to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000 | |
1833 | and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from | |
1834 | 0x1000-0x4000, but for address 0x2345 we want to return symtab b. | |
1835 | ||
1836 | This happens for native ecoff format, where code from included files | |
1837 | gets its own symtab. The symtab for the included file should have | |
1838 | been read in already via the dependency mechanism. | |
1839 | It might be swifter to create several symtabs with the same name | |
1840 | like xcoff does (I'm not sure). | |
1841 | ||
1842 | It also happens for objfiles that have their functions reordered. | |
1843 | For these, the symtab we are looking for is not necessarily read in. */ | |
1844 | ||
1845 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
1846 | { |
1847 | bv = BLOCKVECTOR (s); | |
1848 | b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
c906108c | 1849 | |
c5aa993b | 1850 | if (BLOCK_START (b) <= pc |
c5aa993b | 1851 | && BLOCK_END (b) > pc |
c5aa993b JM |
1852 | && (distance == 0 |
1853 | || BLOCK_END (b) - BLOCK_START (b) < distance)) | |
1854 | { | |
1855 | /* For an objfile that has its functions reordered, | |
1856 | find_pc_psymtab will find the proper partial symbol table | |
1857 | and we simply return its corresponding symtab. */ | |
1858 | /* In order to better support objfiles that contain both | |
1859 | stabs and coff debugging info, we continue on if a psymtab | |
1860 | can't be found. */ | |
1861 | if ((objfile->flags & OBJF_REORDERED) && objfile->psymtabs) | |
1862 | { | |
1863 | ps = find_pc_sect_psymtab (pc, section); | |
1864 | if (ps) | |
1865 | return PSYMTAB_TO_SYMTAB (ps); | |
1866 | } | |
1867 | if (section != 0) | |
1868 | { | |
1869 | int i; | |
261397f8 | 1870 | struct symbol *sym = NULL; |
c906108c | 1871 | |
261397f8 | 1872 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c5aa993b | 1873 | { |
261397f8 DJ |
1874 | fixup_symbol_section (sym, objfile); |
1875 | if (section == SYMBOL_BFD_SECTION (sym)) | |
c5aa993b JM |
1876 | break; |
1877 | } | |
261397f8 | 1878 | if ((i >= BLOCK_BUCKETS (b)) && (sym == NULL)) |
c5aa993b JM |
1879 | continue; /* no symbol in this symtab matches section */ |
1880 | } | |
1881 | distance = BLOCK_END (b) - BLOCK_START (b); | |
1882 | best_s = s; | |
1883 | } | |
1884 | } | |
c906108c SS |
1885 | |
1886 | if (best_s != NULL) | |
c5aa993b | 1887 | return (best_s); |
c906108c SS |
1888 | |
1889 | s = NULL; | |
1890 | ps = find_pc_sect_psymtab (pc, section); | |
1891 | if (ps) | |
1892 | { | |
1893 | if (ps->readin) | |
1894 | /* Might want to error() here (in case symtab is corrupt and | |
1895 | will cause a core dump), but maybe we can successfully | |
1896 | continue, so let's not. */ | |
c906108c | 1897 | warning ("\ |
d730266b AC |
1898 | (Internal error: pc 0x%s in read in psymtab, but not in symtab.)\n", |
1899 | paddr_nz (pc)); | |
c906108c SS |
1900 | s = PSYMTAB_TO_SYMTAB (ps); |
1901 | } | |
1902 | return (s); | |
1903 | } | |
1904 | ||
1905 | /* Find the symtab associated with PC. Look through the psymtabs and | |
1906 | read in another symtab if necessary. Backward compatibility, no section */ | |
1907 | ||
1908 | struct symtab * | |
fba45db2 | 1909 | find_pc_symtab (CORE_ADDR pc) |
c906108c SS |
1910 | { |
1911 | return find_pc_sect_symtab (pc, find_pc_mapped_section (pc)); | |
1912 | } | |
c906108c | 1913 | \f |
c5aa993b | 1914 | |
7e73cedf | 1915 | /* Find the source file and line number for a given PC value and SECTION. |
c906108c SS |
1916 | Return a structure containing a symtab pointer, a line number, |
1917 | and a pc range for the entire source line. | |
1918 | The value's .pc field is NOT the specified pc. | |
1919 | NOTCURRENT nonzero means, if specified pc is on a line boundary, | |
1920 | use the line that ends there. Otherwise, in that case, the line | |
1921 | that begins there is used. */ | |
1922 | ||
1923 | /* The big complication here is that a line may start in one file, and end just | |
1924 | before the start of another file. This usually occurs when you #include | |
1925 | code in the middle of a subroutine. To properly find the end of a line's PC | |
1926 | range, we must search all symtabs associated with this compilation unit, and | |
1927 | find the one whose first PC is closer than that of the next line in this | |
1928 | symtab. */ | |
1929 | ||
1930 | /* If it's worth the effort, we could be using a binary search. */ | |
1931 | ||
1932 | struct symtab_and_line | |
fba45db2 | 1933 | find_pc_sect_line (CORE_ADDR pc, struct sec *section, int notcurrent) |
c906108c SS |
1934 | { |
1935 | struct symtab *s; | |
1936 | register struct linetable *l; | |
1937 | register int len; | |
1938 | register int i; | |
1939 | register struct linetable_entry *item; | |
1940 | struct symtab_and_line val; | |
1941 | struct blockvector *bv; | |
1942 | struct minimal_symbol *msymbol; | |
1943 | struct minimal_symbol *mfunsym; | |
1944 | ||
1945 | /* Info on best line seen so far, and where it starts, and its file. */ | |
1946 | ||
1947 | struct linetable_entry *best = NULL; | |
1948 | CORE_ADDR best_end = 0; | |
1949 | struct symtab *best_symtab = 0; | |
1950 | ||
1951 | /* Store here the first line number | |
1952 | of a file which contains the line at the smallest pc after PC. | |
1953 | If we don't find a line whose range contains PC, | |
1954 | we will use a line one less than this, | |
1955 | with a range from the start of that file to the first line's pc. */ | |
1956 | struct linetable_entry *alt = NULL; | |
1957 | struct symtab *alt_symtab = 0; | |
1958 | ||
1959 | /* Info on best line seen in this file. */ | |
1960 | ||
1961 | struct linetable_entry *prev; | |
1962 | ||
1963 | /* If this pc is not from the current frame, | |
1964 | it is the address of the end of a call instruction. | |
1965 | Quite likely that is the start of the following statement. | |
1966 | But what we want is the statement containing the instruction. | |
1967 | Fudge the pc to make sure we get that. */ | |
1968 | ||
fe39c653 | 1969 | init_sal (&val); /* initialize to zeroes */ |
c906108c | 1970 | |
b77b1eb7 JB |
1971 | /* It's tempting to assume that, if we can't find debugging info for |
1972 | any function enclosing PC, that we shouldn't search for line | |
1973 | number info, either. However, GAS can emit line number info for | |
1974 | assembly files --- very helpful when debugging hand-written | |
1975 | assembly code. In such a case, we'd have no debug info for the | |
1976 | function, but we would have line info. */ | |
648f4f79 | 1977 | |
c906108c SS |
1978 | if (notcurrent) |
1979 | pc -= 1; | |
1980 | ||
c5aa993b | 1981 | /* elz: added this because this function returned the wrong |
c906108c SS |
1982 | information if the pc belongs to a stub (import/export) |
1983 | to call a shlib function. This stub would be anywhere between | |
1984 | two functions in the target, and the line info was erroneously | |
1985 | taken to be the one of the line before the pc. | |
c5aa993b | 1986 | */ |
c906108c | 1987 | /* RT: Further explanation: |
c5aa993b | 1988 | |
c906108c SS |
1989 | * We have stubs (trampolines) inserted between procedures. |
1990 | * | |
1991 | * Example: "shr1" exists in a shared library, and a "shr1" stub also | |
1992 | * exists in the main image. | |
1993 | * | |
1994 | * In the minimal symbol table, we have a bunch of symbols | |
1995 | * sorted by start address. The stubs are marked as "trampoline", | |
1996 | * the others appear as text. E.g.: | |
1997 | * | |
1998 | * Minimal symbol table for main image | |
1999 | * main: code for main (text symbol) | |
2000 | * shr1: stub (trampoline symbol) | |
2001 | * foo: code for foo (text symbol) | |
2002 | * ... | |
2003 | * Minimal symbol table for "shr1" image: | |
2004 | * ... | |
2005 | * shr1: code for shr1 (text symbol) | |
2006 | * ... | |
2007 | * | |
2008 | * So the code below is trying to detect if we are in the stub | |
2009 | * ("shr1" stub), and if so, find the real code ("shr1" trampoline), | |
2010 | * and if found, do the symbolization from the real-code address | |
2011 | * rather than the stub address. | |
2012 | * | |
2013 | * Assumptions being made about the minimal symbol table: | |
2014 | * 1. lookup_minimal_symbol_by_pc() will return a trampoline only | |
2015 | * if we're really in the trampoline. If we're beyond it (say | |
2016 | * we're in "foo" in the above example), it'll have a closer | |
2017 | * symbol (the "foo" text symbol for example) and will not | |
2018 | * return the trampoline. | |
2019 | * 2. lookup_minimal_symbol_text() will find a real text symbol | |
2020 | * corresponding to the trampoline, and whose address will | |
2021 | * be different than the trampoline address. I put in a sanity | |
2022 | * check for the address being the same, to avoid an | |
2023 | * infinite recursion. | |
2024 | */ | |
c5aa993b JM |
2025 | msymbol = lookup_minimal_symbol_by_pc (pc); |
2026 | if (msymbol != NULL) | |
c906108c | 2027 | if (MSYMBOL_TYPE (msymbol) == mst_solib_trampoline) |
c5aa993b JM |
2028 | { |
2029 | mfunsym = lookup_minimal_symbol_text (SYMBOL_NAME (msymbol), NULL, NULL); | |
2030 | if (mfunsym == NULL) | |
2031 | /* I eliminated this warning since it is coming out | |
2032 | * in the following situation: | |
2033 | * gdb shmain // test program with shared libraries | |
2034 | * (gdb) break shr1 // function in shared lib | |
2035 | * Warning: In stub for ... | |
2036 | * In the above situation, the shared lib is not loaded yet, | |
2037 | * so of course we can't find the real func/line info, | |
2038 | * but the "break" still works, and the warning is annoying. | |
2039 | * So I commented out the warning. RT */ | |
2040 | /* warning ("In stub for %s; unable to find real function/line info", SYMBOL_NAME(msymbol)) */ ; | |
2041 | /* fall through */ | |
2042 | else if (SYMBOL_VALUE (mfunsym) == SYMBOL_VALUE (msymbol)) | |
2043 | /* Avoid infinite recursion */ | |
2044 | /* See above comment about why warning is commented out */ | |
2045 | /* warning ("In stub for %s; unable to find real function/line info", SYMBOL_NAME(msymbol)) */ ; | |
2046 | /* fall through */ | |
2047 | else | |
2048 | return find_pc_line (SYMBOL_VALUE (mfunsym), 0); | |
2049 | } | |
c906108c SS |
2050 | |
2051 | ||
2052 | s = find_pc_sect_symtab (pc, section); | |
2053 | if (!s) | |
2054 | { | |
2055 | /* if no symbol information, return previous pc */ | |
2056 | if (notcurrent) | |
2057 | pc++; | |
2058 | val.pc = pc; | |
2059 | return val; | |
2060 | } | |
2061 | ||
2062 | bv = BLOCKVECTOR (s); | |
2063 | ||
2064 | /* Look at all the symtabs that share this blockvector. | |
2065 | They all have the same apriori range, that we found was right; | |
2066 | but they have different line tables. */ | |
2067 | ||
2068 | for (; s && BLOCKVECTOR (s) == bv; s = s->next) | |
2069 | { | |
2070 | /* Find the best line in this symtab. */ | |
2071 | l = LINETABLE (s); | |
2072 | if (!l) | |
c5aa993b | 2073 | continue; |
c906108c SS |
2074 | len = l->nitems; |
2075 | if (len <= 0) | |
2076 | { | |
2077 | /* I think len can be zero if the symtab lacks line numbers | |
2078 | (e.g. gcc -g1). (Either that or the LINETABLE is NULL; | |
2079 | I'm not sure which, and maybe it depends on the symbol | |
2080 | reader). */ | |
2081 | continue; | |
2082 | } | |
2083 | ||
2084 | prev = NULL; | |
2085 | item = l->item; /* Get first line info */ | |
2086 | ||
2087 | /* Is this file's first line closer than the first lines of other files? | |
c5aa993b | 2088 | If so, record this file, and its first line, as best alternate. */ |
c906108c SS |
2089 | if (item->pc > pc && (!alt || item->pc < alt->pc)) |
2090 | { | |
2091 | alt = item; | |
2092 | alt_symtab = s; | |
2093 | } | |
2094 | ||
2095 | for (i = 0; i < len; i++, item++) | |
2096 | { | |
2097 | /* Leave prev pointing to the linetable entry for the last line | |
2098 | that started at or before PC. */ | |
2099 | if (item->pc > pc) | |
2100 | break; | |
2101 | ||
2102 | prev = item; | |
2103 | } | |
2104 | ||
2105 | /* At this point, prev points at the line whose start addr is <= pc, and | |
c5aa993b JM |
2106 | item points at the next line. If we ran off the end of the linetable |
2107 | (pc >= start of the last line), then prev == item. If pc < start of | |
2108 | the first line, prev will not be set. */ | |
c906108c SS |
2109 | |
2110 | /* Is this file's best line closer than the best in the other files? | |
083ae935 DJ |
2111 | If so, record this file, and its best line, as best so far. Don't |
2112 | save prev if it represents the end of a function (i.e. line number | |
2113 | 0) instead of a real line. */ | |
c906108c | 2114 | |
083ae935 | 2115 | if (prev && prev->line && (!best || prev->pc > best->pc)) |
c906108c SS |
2116 | { |
2117 | best = prev; | |
2118 | best_symtab = s; | |
25d53da1 KB |
2119 | |
2120 | /* Discard BEST_END if it's before the PC of the current BEST. */ | |
2121 | if (best_end <= best->pc) | |
2122 | best_end = 0; | |
c906108c | 2123 | } |
25d53da1 KB |
2124 | |
2125 | /* If another line (denoted by ITEM) is in the linetable and its | |
2126 | PC is after BEST's PC, but before the current BEST_END, then | |
2127 | use ITEM's PC as the new best_end. */ | |
2128 | if (best && i < len && item->pc > best->pc | |
2129 | && (best_end == 0 || best_end > item->pc)) | |
2130 | best_end = item->pc; | |
c906108c SS |
2131 | } |
2132 | ||
2133 | if (!best_symtab) | |
2134 | { | |
2135 | if (!alt_symtab) | |
2136 | { /* If we didn't find any line # info, just | |
2137 | return zeros. */ | |
2138 | val.pc = pc; | |
2139 | } | |
2140 | else | |
2141 | { | |
2142 | val.symtab = alt_symtab; | |
2143 | val.line = alt->line - 1; | |
2144 | ||
2145 | /* Don't return line 0, that means that we didn't find the line. */ | |
c5aa993b JM |
2146 | if (val.line == 0) |
2147 | ++val.line; | |
c906108c SS |
2148 | |
2149 | val.pc = BLOCK_END (BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK)); | |
2150 | val.end = alt->pc; | |
2151 | } | |
2152 | } | |
e8717518 FF |
2153 | else if (best->line == 0) |
2154 | { | |
2155 | /* If our best fit is in a range of PC's for which no line | |
2156 | number info is available (line number is zero) then we didn't | |
2157 | find any valid line information. */ | |
2158 | val.pc = pc; | |
2159 | } | |
c906108c SS |
2160 | else |
2161 | { | |
2162 | val.symtab = best_symtab; | |
2163 | val.line = best->line; | |
2164 | val.pc = best->pc; | |
2165 | if (best_end && (!alt || best_end < alt->pc)) | |
2166 | val.end = best_end; | |
2167 | else if (alt) | |
2168 | val.end = alt->pc; | |
2169 | else | |
2170 | val.end = BLOCK_END (BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK)); | |
2171 | } | |
2172 | val.section = section; | |
2173 | return val; | |
2174 | } | |
2175 | ||
2176 | /* Backward compatibility (no section) */ | |
2177 | ||
2178 | struct symtab_and_line | |
fba45db2 | 2179 | find_pc_line (CORE_ADDR pc, int notcurrent) |
c906108c | 2180 | { |
c5aa993b | 2181 | asection *section; |
c906108c SS |
2182 | |
2183 | section = find_pc_overlay (pc); | |
2184 | if (pc_in_unmapped_range (pc, section)) | |
2185 | pc = overlay_mapped_address (pc, section); | |
2186 | return find_pc_sect_line (pc, section, notcurrent); | |
2187 | } | |
c906108c | 2188 | \f |
c906108c SS |
2189 | /* Find line number LINE in any symtab whose name is the same as |
2190 | SYMTAB. | |
2191 | ||
2192 | If found, return the symtab that contains the linetable in which it was | |
2193 | found, set *INDEX to the index in the linetable of the best entry | |
2194 | found, and set *EXACT_MATCH nonzero if the value returned is an | |
2195 | exact match. | |
2196 | ||
2197 | If not found, return NULL. */ | |
2198 | ||
50641945 | 2199 | struct symtab * |
fba45db2 | 2200 | find_line_symtab (struct symtab *symtab, int line, int *index, int *exact_match) |
c906108c SS |
2201 | { |
2202 | int exact; | |
2203 | ||
2204 | /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE | |
2205 | so far seen. */ | |
2206 | ||
2207 | int best_index; | |
2208 | struct linetable *best_linetable; | |
2209 | struct symtab *best_symtab; | |
2210 | ||
2211 | /* First try looking it up in the given symtab. */ | |
2212 | best_linetable = LINETABLE (symtab); | |
2213 | best_symtab = symtab; | |
2214 | best_index = find_line_common (best_linetable, line, &exact); | |
2215 | if (best_index < 0 || !exact) | |
2216 | { | |
2217 | /* Didn't find an exact match. So we better keep looking for | |
c5aa993b JM |
2218 | another symtab with the same name. In the case of xcoff, |
2219 | multiple csects for one source file (produced by IBM's FORTRAN | |
2220 | compiler) produce multiple symtabs (this is unavoidable | |
2221 | assuming csects can be at arbitrary places in memory and that | |
2222 | the GLOBAL_BLOCK of a symtab has a begin and end address). */ | |
c906108c SS |
2223 | |
2224 | /* BEST is the smallest linenumber > LINE so far seen, | |
c5aa993b JM |
2225 | or 0 if none has been seen so far. |
2226 | BEST_INDEX and BEST_LINETABLE identify the item for it. */ | |
c906108c SS |
2227 | int best; |
2228 | ||
2229 | struct objfile *objfile; | |
2230 | struct symtab *s; | |
2231 | ||
2232 | if (best_index >= 0) | |
2233 | best = best_linetable->item[best_index].line; | |
2234 | else | |
2235 | best = 0; | |
2236 | ||
2237 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
2238 | { |
2239 | struct linetable *l; | |
2240 | int ind; | |
c906108c | 2241 | |
c5aa993b JM |
2242 | if (!STREQ (symtab->filename, s->filename)) |
2243 | continue; | |
2244 | l = LINETABLE (s); | |
2245 | ind = find_line_common (l, line, &exact); | |
2246 | if (ind >= 0) | |
2247 | { | |
2248 | if (exact) | |
2249 | { | |
2250 | best_index = ind; | |
2251 | best_linetable = l; | |
2252 | best_symtab = s; | |
2253 | goto done; | |
2254 | } | |
2255 | if (best == 0 || l->item[ind].line < best) | |
2256 | { | |
2257 | best = l->item[ind].line; | |
2258 | best_index = ind; | |
2259 | best_linetable = l; | |
2260 | best_symtab = s; | |
2261 | } | |
2262 | } | |
2263 | } | |
c906108c | 2264 | } |
c5aa993b | 2265 | done: |
c906108c SS |
2266 | if (best_index < 0) |
2267 | return NULL; | |
2268 | ||
2269 | if (index) | |
2270 | *index = best_index; | |
2271 | if (exact_match) | |
2272 | *exact_match = exact; | |
2273 | ||
2274 | return best_symtab; | |
2275 | } | |
2276 | \f | |
2277 | /* Set the PC value for a given source file and line number and return true. | |
2278 | Returns zero for invalid line number (and sets the PC to 0). | |
2279 | The source file is specified with a struct symtab. */ | |
2280 | ||
2281 | int | |
fba45db2 | 2282 | find_line_pc (struct symtab *symtab, int line, CORE_ADDR *pc) |
c906108c SS |
2283 | { |
2284 | struct linetable *l; | |
2285 | int ind; | |
2286 | ||
2287 | *pc = 0; | |
2288 | if (symtab == 0) | |
2289 | return 0; | |
2290 | ||
2291 | symtab = find_line_symtab (symtab, line, &ind, NULL); | |
2292 | if (symtab != NULL) | |
2293 | { | |
2294 | l = LINETABLE (symtab); | |
2295 | *pc = l->item[ind].pc; | |
2296 | return 1; | |
2297 | } | |
2298 | else | |
2299 | return 0; | |
2300 | } | |
2301 | ||
2302 | /* Find the range of pc values in a line. | |
2303 | Store the starting pc of the line into *STARTPTR | |
2304 | and the ending pc (start of next line) into *ENDPTR. | |
2305 | Returns 1 to indicate success. | |
2306 | Returns 0 if could not find the specified line. */ | |
2307 | ||
2308 | int | |
fba45db2 KB |
2309 | find_line_pc_range (struct symtab_and_line sal, CORE_ADDR *startptr, |
2310 | CORE_ADDR *endptr) | |
c906108c SS |
2311 | { |
2312 | CORE_ADDR startaddr; | |
2313 | struct symtab_and_line found_sal; | |
2314 | ||
2315 | startaddr = sal.pc; | |
c5aa993b | 2316 | if (startaddr == 0 && !find_line_pc (sal.symtab, sal.line, &startaddr)) |
c906108c SS |
2317 | return 0; |
2318 | ||
2319 | /* This whole function is based on address. For example, if line 10 has | |
2320 | two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then | |
2321 | "info line *0x123" should say the line goes from 0x100 to 0x200 | |
2322 | and "info line *0x355" should say the line goes from 0x300 to 0x400. | |
2323 | This also insures that we never give a range like "starts at 0x134 | |
2324 | and ends at 0x12c". */ | |
2325 | ||
2326 | found_sal = find_pc_sect_line (startaddr, sal.section, 0); | |
2327 | if (found_sal.line != sal.line) | |
2328 | { | |
2329 | /* The specified line (sal) has zero bytes. */ | |
2330 | *startptr = found_sal.pc; | |
2331 | *endptr = found_sal.pc; | |
2332 | } | |
2333 | else | |
2334 | { | |
2335 | *startptr = found_sal.pc; | |
2336 | *endptr = found_sal.end; | |
2337 | } | |
2338 | return 1; | |
2339 | } | |
2340 | ||
2341 | /* Given a line table and a line number, return the index into the line | |
2342 | table for the pc of the nearest line whose number is >= the specified one. | |
2343 | Return -1 if none is found. The value is >= 0 if it is an index. | |
2344 | ||
2345 | Set *EXACT_MATCH nonzero if the value returned is an exact match. */ | |
2346 | ||
2347 | static int | |
fba45db2 KB |
2348 | find_line_common (register struct linetable *l, register int lineno, |
2349 | int *exact_match) | |
c906108c SS |
2350 | { |
2351 | register int i; | |
2352 | register int len; | |
2353 | ||
2354 | /* BEST is the smallest linenumber > LINENO so far seen, | |
2355 | or 0 if none has been seen so far. | |
2356 | BEST_INDEX identifies the item for it. */ | |
2357 | ||
2358 | int best_index = -1; | |
2359 | int best = 0; | |
2360 | ||
2361 | if (lineno <= 0) | |
2362 | return -1; | |
2363 | if (l == 0) | |
2364 | return -1; | |
2365 | ||
2366 | len = l->nitems; | |
2367 | for (i = 0; i < len; i++) | |
2368 | { | |
2369 | register struct linetable_entry *item = &(l->item[i]); | |
2370 | ||
2371 | if (item->line == lineno) | |
2372 | { | |
2373 | /* Return the first (lowest address) entry which matches. */ | |
2374 | *exact_match = 1; | |
2375 | return i; | |
2376 | } | |
2377 | ||
2378 | if (item->line > lineno && (best == 0 || item->line < best)) | |
2379 | { | |
2380 | best = item->line; | |
2381 | best_index = i; | |
2382 | } | |
2383 | } | |
2384 | ||
2385 | /* If we got here, we didn't get an exact match. */ | |
2386 | ||
2387 | *exact_match = 0; | |
2388 | return best_index; | |
2389 | } | |
2390 | ||
2391 | int | |
fba45db2 | 2392 | find_pc_line_pc_range (CORE_ADDR pc, CORE_ADDR *startptr, CORE_ADDR *endptr) |
c906108c SS |
2393 | { |
2394 | struct symtab_and_line sal; | |
2395 | sal = find_pc_line (pc, 0); | |
2396 | *startptr = sal.pc; | |
2397 | *endptr = sal.end; | |
2398 | return sal.symtab != 0; | |
2399 | } | |
2400 | ||
2401 | /* Given a function symbol SYM, find the symtab and line for the start | |
2402 | of the function. | |
2403 | If the argument FUNFIRSTLINE is nonzero, we want the first line | |
2404 | of real code inside the function. */ | |
2405 | ||
50641945 | 2406 | struct symtab_and_line |
fba45db2 | 2407 | find_function_start_sal (struct symbol *sym, int funfirstline) |
c906108c SS |
2408 | { |
2409 | CORE_ADDR pc; | |
2410 | struct symtab_and_line sal; | |
2411 | ||
2412 | pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
2413 | fixup_symbol_section (sym, NULL); | |
2414 | if (funfirstline) | |
c5aa993b | 2415 | { /* skip "first line" of function (which is actually its prologue) */ |
c906108c SS |
2416 | asection *section = SYMBOL_BFD_SECTION (sym); |
2417 | /* If function is in an unmapped overlay, use its unmapped LMA | |
c5aa993b | 2418 | address, so that SKIP_PROLOGUE has something unique to work on */ |
c906108c SS |
2419 | if (section_is_overlay (section) && |
2420 | !section_is_mapped (section)) | |
2421 | pc = overlay_unmapped_address (pc, section); | |
2422 | ||
2423 | pc += FUNCTION_START_OFFSET; | |
b83266a0 | 2424 | pc = SKIP_PROLOGUE (pc); |
c906108c SS |
2425 | |
2426 | /* For overlays, map pc back into its mapped VMA range */ | |
2427 | pc = overlay_mapped_address (pc, section); | |
2428 | } | |
2429 | sal = find_pc_sect_line (pc, SYMBOL_BFD_SECTION (sym), 0); | |
2430 | ||
2431 | #ifdef PROLOGUE_FIRSTLINE_OVERLAP | |
2432 | /* Convex: no need to suppress code on first line, if any */ | |
2433 | sal.pc = pc; | |
2434 | #else | |
2435 | /* Check if SKIP_PROLOGUE left us in mid-line, and the next | |
2436 | line is still part of the same function. */ | |
2437 | if (sal.pc != pc | |
2438 | && BLOCK_START (SYMBOL_BLOCK_VALUE (sym)) <= sal.end | |
2439 | && sal.end < BLOCK_END (SYMBOL_BLOCK_VALUE (sym))) | |
2440 | { | |
2441 | /* First pc of next line */ | |
2442 | pc = sal.end; | |
2443 | /* Recalculate the line number (might not be N+1). */ | |
2444 | sal = find_pc_sect_line (pc, SYMBOL_BFD_SECTION (sym), 0); | |
2445 | } | |
2446 | sal.pc = pc; | |
2447 | #endif | |
2448 | ||
2449 | return sal; | |
2450 | } | |
50641945 | 2451 | |
c906108c SS |
2452 | /* If P is of the form "operator[ \t]+..." where `...' is |
2453 | some legitimate operator text, return a pointer to the | |
2454 | beginning of the substring of the operator text. | |
2455 | Otherwise, return "". */ | |
2456 | char * | |
fba45db2 | 2457 | operator_chars (char *p, char **end) |
c906108c SS |
2458 | { |
2459 | *end = ""; | |
2460 | if (strncmp (p, "operator", 8)) | |
2461 | return *end; | |
2462 | p += 8; | |
2463 | ||
2464 | /* Don't get faked out by `operator' being part of a longer | |
2465 | identifier. */ | |
c5aa993b | 2466 | if (isalpha (*p) || *p == '_' || *p == '$' || *p == '\0') |
c906108c SS |
2467 | return *end; |
2468 | ||
2469 | /* Allow some whitespace between `operator' and the operator symbol. */ | |
2470 | while (*p == ' ' || *p == '\t') | |
2471 | p++; | |
2472 | ||
2473 | /* Recognize 'operator TYPENAME'. */ | |
2474 | ||
c5aa993b | 2475 | if (isalpha (*p) || *p == '_' || *p == '$') |
c906108c | 2476 | { |
c5aa993b JM |
2477 | register char *q = p + 1; |
2478 | while (isalnum (*q) || *q == '_' || *q == '$') | |
c906108c SS |
2479 | q++; |
2480 | *end = q; | |
2481 | return p; | |
2482 | } | |
2483 | ||
53e8ad3d MS |
2484 | while (*p) |
2485 | switch (*p) | |
2486 | { | |
2487 | case '\\': /* regexp quoting */ | |
2488 | if (p[1] == '*') | |
2489 | { | |
2490 | if (p[2] == '=') /* 'operator\*=' */ | |
2491 | *end = p + 3; | |
2492 | else /* 'operator\*' */ | |
2493 | *end = p + 2; | |
2494 | return p; | |
2495 | } | |
2496 | else if (p[1] == '[') | |
2497 | { | |
2498 | if (p[2] == ']') | |
2499 | error ("mismatched quoting on brackets, try 'operator\\[\\]'"); | |
2500 | else if (p[2] == '\\' && p[3] == ']') | |
2501 | { | |
2502 | *end = p + 4; /* 'operator\[\]' */ | |
2503 | return p; | |
2504 | } | |
2505 | else | |
2506 | error ("nothing is allowed between '[' and ']'"); | |
2507 | } | |
2508 | else | |
2509 | { | |
2510 | /* Gratuitous qoute: skip it and move on. */ | |
2511 | p++; | |
2512 | continue; | |
2513 | } | |
2514 | break; | |
2515 | case '!': | |
2516 | case '=': | |
2517 | case '*': | |
2518 | case '/': | |
2519 | case '%': | |
2520 | case '^': | |
2521 | if (p[1] == '=') | |
2522 | *end = p + 2; | |
2523 | else | |
2524 | *end = p + 1; | |
2525 | return p; | |
2526 | case '<': | |
2527 | case '>': | |
2528 | case '+': | |
2529 | case '-': | |
2530 | case '&': | |
2531 | case '|': | |
2532 | if (p[0] == '-' && p[1] == '>') | |
2533 | { | |
2534 | /* Struct pointer member operator 'operator->'. */ | |
2535 | if (p[2] == '*') | |
2536 | { | |
2537 | *end = p + 3; /* 'operator->*' */ | |
2538 | return p; | |
2539 | } | |
2540 | else if (p[2] == '\\') | |
2541 | { | |
2542 | *end = p + 4; /* Hopefully 'operator->\*' */ | |
2543 | return p; | |
2544 | } | |
2545 | else | |
2546 | { | |
2547 | *end = p + 2; /* 'operator->' */ | |
2548 | return p; | |
2549 | } | |
2550 | } | |
2551 | if (p[1] == '=' || p[1] == p[0]) | |
2552 | *end = p + 2; | |
2553 | else | |
2554 | *end = p + 1; | |
2555 | return p; | |
2556 | case '~': | |
2557 | case ',': | |
c5aa993b | 2558 | *end = p + 1; |
53e8ad3d MS |
2559 | return p; |
2560 | case '(': | |
2561 | if (p[1] != ')') | |
2562 | error ("`operator ()' must be specified without whitespace in `()'"); | |
c5aa993b | 2563 | *end = p + 2; |
53e8ad3d MS |
2564 | return p; |
2565 | case '?': | |
2566 | if (p[1] != ':') | |
2567 | error ("`operator ?:' must be specified without whitespace in `?:'"); | |
2568 | *end = p + 2; | |
2569 | return p; | |
2570 | case '[': | |
2571 | if (p[1] != ']') | |
2572 | error ("`operator []' must be specified without whitespace in `[]'"); | |
2573 | *end = p + 2; | |
2574 | return p; | |
2575 | default: | |
2576 | error ("`operator %s' not supported", p); | |
2577 | break; | |
2578 | } | |
2579 | ||
c906108c SS |
2580 | *end = ""; |
2581 | return *end; | |
2582 | } | |
c906108c | 2583 | \f |
c5aa993b | 2584 | |
c94fdfd0 EZ |
2585 | /* If FILE is not already in the table of files, return zero; |
2586 | otherwise return non-zero. Optionally add FILE to the table if ADD | |
2587 | is non-zero. If *FIRST is non-zero, forget the old table | |
2588 | contents. */ | |
2589 | static int | |
2590 | filename_seen (const char *file, int add, int *first) | |
c906108c | 2591 | { |
c94fdfd0 EZ |
2592 | /* Table of files seen so far. */ |
2593 | static const char **tab = NULL; | |
c906108c SS |
2594 | /* Allocated size of tab in elements. |
2595 | Start with one 256-byte block (when using GNU malloc.c). | |
2596 | 24 is the malloc overhead when range checking is in effect. */ | |
2597 | static int tab_alloc_size = (256 - 24) / sizeof (char *); | |
2598 | /* Current size of tab in elements. */ | |
2599 | static int tab_cur_size; | |
c94fdfd0 | 2600 | const char **p; |
c906108c SS |
2601 | |
2602 | if (*first) | |
2603 | { | |
2604 | if (tab == NULL) | |
c94fdfd0 | 2605 | tab = (const char **) xmalloc (tab_alloc_size * sizeof (*tab)); |
c906108c SS |
2606 | tab_cur_size = 0; |
2607 | } | |
2608 | ||
c94fdfd0 | 2609 | /* Is FILE in tab? */ |
c906108c | 2610 | for (p = tab; p < tab + tab_cur_size; p++) |
c94fdfd0 EZ |
2611 | if (strcmp (*p, file) == 0) |
2612 | return 1; | |
2613 | ||
2614 | /* No; maybe add it to tab. */ | |
2615 | if (add) | |
c906108c | 2616 | { |
c94fdfd0 EZ |
2617 | if (tab_cur_size == tab_alloc_size) |
2618 | { | |
2619 | tab_alloc_size *= 2; | |
2620 | tab = (const char **) xrealloc ((char *) tab, | |
2621 | tab_alloc_size * sizeof (*tab)); | |
2622 | } | |
2623 | tab[tab_cur_size++] = file; | |
c906108c | 2624 | } |
c906108c | 2625 | |
c94fdfd0 EZ |
2626 | return 0; |
2627 | } | |
2628 | ||
2629 | /* Slave routine for sources_info. Force line breaks at ,'s. | |
2630 | NAME is the name to print and *FIRST is nonzero if this is the first | |
2631 | name printed. Set *FIRST to zero. */ | |
2632 | static void | |
2633 | output_source_filename (char *name, int *first) | |
2634 | { | |
2635 | /* Since a single source file can result in several partial symbol | |
2636 | tables, we need to avoid printing it more than once. Note: if | |
2637 | some of the psymtabs are read in and some are not, it gets | |
2638 | printed both under "Source files for which symbols have been | |
2639 | read" and "Source files for which symbols will be read in on | |
2640 | demand". I consider this a reasonable way to deal with the | |
2641 | situation. I'm not sure whether this can also happen for | |
2642 | symtabs; it doesn't hurt to check. */ | |
2643 | ||
2644 | /* Was NAME already seen? */ | |
2645 | if (filename_seen (name, 1, first)) | |
2646 | { | |
2647 | /* Yes; don't print it again. */ | |
2648 | return; | |
2649 | } | |
2650 | /* No; print it and reset *FIRST. */ | |
c906108c SS |
2651 | if (*first) |
2652 | { | |
2653 | *first = 0; | |
2654 | } | |
2655 | else | |
2656 | { | |
2657 | printf_filtered (", "); | |
2658 | } | |
2659 | ||
2660 | wrap_here (""); | |
2661 | fputs_filtered (name, gdb_stdout); | |
c5aa993b | 2662 | } |
c906108c SS |
2663 | |
2664 | static void | |
fba45db2 | 2665 | sources_info (char *ignore, int from_tty) |
c906108c SS |
2666 | { |
2667 | register struct symtab *s; | |
2668 | register struct partial_symtab *ps; | |
2669 | register struct objfile *objfile; | |
2670 | int first; | |
c5aa993b | 2671 | |
c906108c SS |
2672 | if (!have_full_symbols () && !have_partial_symbols ()) |
2673 | { | |
e85428fc | 2674 | error ("No symbol table is loaded. Use the \"file\" command."); |
c906108c | 2675 | } |
c5aa993b | 2676 | |
c906108c SS |
2677 | printf_filtered ("Source files for which symbols have been read in:\n\n"); |
2678 | ||
2679 | first = 1; | |
2680 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
2681 | { |
2682 | output_source_filename (s->filename, &first); | |
2683 | } | |
c906108c | 2684 | printf_filtered ("\n\n"); |
c5aa993b | 2685 | |
c906108c SS |
2686 | printf_filtered ("Source files for which symbols will be read in on demand:\n\n"); |
2687 | ||
2688 | first = 1; | |
2689 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
2690 | { |
2691 | if (!ps->readin) | |
2692 | { | |
2693 | output_source_filename (ps->filename, &first); | |
2694 | } | |
2695 | } | |
c906108c SS |
2696 | printf_filtered ("\n"); |
2697 | } | |
2698 | ||
2699 | static int | |
fd118b61 | 2700 | file_matches (char *file, char *files[], int nfiles) |
c906108c SS |
2701 | { |
2702 | int i; | |
2703 | ||
2704 | if (file != NULL && nfiles != 0) | |
2705 | { | |
2706 | for (i = 0; i < nfiles; i++) | |
c5aa993b | 2707 | { |
31889e00 | 2708 | if (strcmp (files[i], lbasename (file)) == 0) |
c5aa993b JM |
2709 | return 1; |
2710 | } | |
c906108c SS |
2711 | } |
2712 | else if (nfiles == 0) | |
2713 | return 1; | |
2714 | return 0; | |
2715 | } | |
2716 | ||
2717 | /* Free any memory associated with a search. */ | |
2718 | void | |
fba45db2 | 2719 | free_search_symbols (struct symbol_search *symbols) |
c906108c SS |
2720 | { |
2721 | struct symbol_search *p; | |
2722 | struct symbol_search *next; | |
2723 | ||
2724 | for (p = symbols; p != NULL; p = next) | |
2725 | { | |
2726 | next = p->next; | |
b8c9b27d | 2727 | xfree (p); |
c906108c SS |
2728 | } |
2729 | } | |
2730 | ||
5bd98722 AC |
2731 | static void |
2732 | do_free_search_symbols_cleanup (void *symbols) | |
2733 | { | |
2734 | free_search_symbols (symbols); | |
2735 | } | |
2736 | ||
2737 | struct cleanup * | |
2738 | make_cleanup_free_search_symbols (struct symbol_search *symbols) | |
2739 | { | |
2740 | return make_cleanup (do_free_search_symbols_cleanup, symbols); | |
2741 | } | |
2742 | ||
434d2d4f DJ |
2743 | /* Helper function for sort_search_symbols and qsort. Can only |
2744 | sort symbols, not minimal symbols. */ | |
2745 | static int | |
2746 | compare_search_syms (const void *sa, const void *sb) | |
2747 | { | |
2748 | struct symbol_search **sym_a = (struct symbol_search **) sa; | |
2749 | struct symbol_search **sym_b = (struct symbol_search **) sb; | |
2750 | ||
2751 | return strcmp (SYMBOL_SOURCE_NAME ((*sym_a)->symbol), | |
2752 | SYMBOL_SOURCE_NAME ((*sym_b)->symbol)); | |
2753 | } | |
2754 | ||
2755 | /* Sort the ``nfound'' symbols in the list after prevtail. Leave | |
2756 | prevtail where it is, but update its next pointer to point to | |
2757 | the first of the sorted symbols. */ | |
2758 | static struct symbol_search * | |
2759 | sort_search_symbols (struct symbol_search *prevtail, int nfound) | |
2760 | { | |
2761 | struct symbol_search **symbols, *symp, *old_next; | |
2762 | int i; | |
2763 | ||
2764 | symbols = (struct symbol_search **) xmalloc (sizeof (struct symbol_search *) | |
2765 | * nfound); | |
2766 | symp = prevtail->next; | |
2767 | for (i = 0; i < nfound; i++) | |
2768 | { | |
2769 | symbols[i] = symp; | |
2770 | symp = symp->next; | |
2771 | } | |
2772 | /* Generally NULL. */ | |
2773 | old_next = symp; | |
2774 | ||
2775 | qsort (symbols, nfound, sizeof (struct symbol_search *), | |
2776 | compare_search_syms); | |
2777 | ||
2778 | symp = prevtail; | |
2779 | for (i = 0; i < nfound; i++) | |
2780 | { | |
2781 | symp->next = symbols[i]; | |
2782 | symp = symp->next; | |
2783 | } | |
2784 | symp->next = old_next; | |
2785 | ||
8ed32cc0 | 2786 | xfree (symbols); |
434d2d4f DJ |
2787 | return symp; |
2788 | } | |
5bd98722 | 2789 | |
c906108c SS |
2790 | /* Search the symbol table for matches to the regular expression REGEXP, |
2791 | returning the results in *MATCHES. | |
2792 | ||
2793 | Only symbols of KIND are searched: | |
c5aa993b JM |
2794 | FUNCTIONS_NAMESPACE - search all functions |
2795 | TYPES_NAMESPACE - search all type names | |
2796 | METHODS_NAMESPACE - search all methods NOT IMPLEMENTED | |
2797 | VARIABLES_NAMESPACE - search all symbols, excluding functions, type names, | |
2798 | and constants (enums) | |
c906108c SS |
2799 | |
2800 | free_search_symbols should be called when *MATCHES is no longer needed. | |
434d2d4f DJ |
2801 | |
2802 | The results are sorted locally; each symtab's global and static blocks are | |
2803 | separately alphabetized. | |
c5aa993b | 2804 | */ |
c906108c | 2805 | void |
fd118b61 KB |
2806 | search_symbols (char *regexp, namespace_enum kind, int nfiles, char *files[], |
2807 | struct symbol_search **matches) | |
c906108c SS |
2808 | { |
2809 | register struct symtab *s; | |
2810 | register struct partial_symtab *ps; | |
2811 | register struct blockvector *bv; | |
2812 | struct blockvector *prev_bv = 0; | |
2813 | register struct block *b; | |
2814 | register int i = 0; | |
2815 | register int j; | |
2816 | register struct symbol *sym; | |
2817 | struct partial_symbol **psym; | |
2818 | struct objfile *objfile; | |
2819 | struct minimal_symbol *msymbol; | |
2820 | char *val; | |
2821 | int found_misc = 0; | |
2822 | static enum minimal_symbol_type types[] | |
c5aa993b JM |
2823 | = |
2824 | {mst_data, mst_text, mst_abs, mst_unknown}; | |
c906108c | 2825 | static enum minimal_symbol_type types2[] |
c5aa993b JM |
2826 | = |
2827 | {mst_bss, mst_file_text, mst_abs, mst_unknown}; | |
c906108c | 2828 | static enum minimal_symbol_type types3[] |
c5aa993b JM |
2829 | = |
2830 | {mst_file_data, mst_solib_trampoline, mst_abs, mst_unknown}; | |
c906108c | 2831 | static enum minimal_symbol_type types4[] |
c5aa993b JM |
2832 | = |
2833 | {mst_file_bss, mst_text, mst_abs, mst_unknown}; | |
c906108c SS |
2834 | enum minimal_symbol_type ourtype; |
2835 | enum minimal_symbol_type ourtype2; | |
2836 | enum minimal_symbol_type ourtype3; | |
2837 | enum minimal_symbol_type ourtype4; | |
2838 | struct symbol_search *sr; | |
2839 | struct symbol_search *psr; | |
2840 | struct symbol_search *tail; | |
2841 | struct cleanup *old_chain = NULL; | |
2842 | ||
993f3aa5 | 2843 | if (kind < VARIABLES_NAMESPACE) |
c906108c SS |
2844 | error ("must search on specific namespace"); |
2845 | ||
52204a0b DT |
2846 | ourtype = types[(int) (kind - VARIABLES_NAMESPACE)]; |
2847 | ourtype2 = types2[(int) (kind - VARIABLES_NAMESPACE)]; | |
2848 | ourtype3 = types3[(int) (kind - VARIABLES_NAMESPACE)]; | |
2849 | ourtype4 = types4[(int) (kind - VARIABLES_NAMESPACE)]; | |
c906108c SS |
2850 | |
2851 | sr = *matches = NULL; | |
2852 | tail = NULL; | |
2853 | ||
2854 | if (regexp != NULL) | |
2855 | { | |
2856 | /* Make sure spacing is right for C++ operators. | |
2857 | This is just a courtesy to make the matching less sensitive | |
2858 | to how many spaces the user leaves between 'operator' | |
2859 | and <TYPENAME> or <OPERATOR>. */ | |
2860 | char *opend; | |
2861 | char *opname = operator_chars (regexp, &opend); | |
2862 | if (*opname) | |
c5aa993b JM |
2863 | { |
2864 | int fix = -1; /* -1 means ok; otherwise number of spaces needed. */ | |
2865 | if (isalpha (*opname) || *opname == '_' || *opname == '$') | |
2866 | { | |
2867 | /* There should 1 space between 'operator' and 'TYPENAME'. */ | |
2868 | if (opname[-1] != ' ' || opname[-2] == ' ') | |
2869 | fix = 1; | |
2870 | } | |
2871 | else | |
2872 | { | |
2873 | /* There should 0 spaces between 'operator' and 'OPERATOR'. */ | |
2874 | if (opname[-1] == ' ') | |
2875 | fix = 0; | |
2876 | } | |
2877 | /* If wrong number of spaces, fix it. */ | |
2878 | if (fix >= 0) | |
2879 | { | |
045f55a6 | 2880 | char *tmp = (char *) alloca (8 + fix + strlen (opname) + 1); |
c5aa993b JM |
2881 | sprintf (tmp, "operator%.*s%s", fix, " ", opname); |
2882 | regexp = tmp; | |
2883 | } | |
2884 | } | |
2885 | ||
c906108c | 2886 | if (0 != (val = re_comp (regexp))) |
c5aa993b | 2887 | error ("Invalid regexp (%s): %s", val, regexp); |
c906108c SS |
2888 | } |
2889 | ||
2890 | /* Search through the partial symtabs *first* for all symbols | |
2891 | matching the regexp. That way we don't have to reproduce all of | |
2892 | the machinery below. */ | |
2893 | ||
2894 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
2895 | { |
2896 | struct partial_symbol **bound, **gbound, **sbound; | |
2897 | int keep_going = 1; | |
2898 | ||
2899 | if (ps->readin) | |
2900 | continue; | |
2901 | ||
2902 | gbound = objfile->global_psymbols.list + ps->globals_offset + ps->n_global_syms; | |
2903 | sbound = objfile->static_psymbols.list + ps->statics_offset + ps->n_static_syms; | |
2904 | bound = gbound; | |
2905 | ||
2906 | /* Go through all of the symbols stored in a partial | |
2907 | symtab in one loop. */ | |
2908 | psym = objfile->global_psymbols.list + ps->globals_offset; | |
2909 | while (keep_going) | |
2910 | { | |
2911 | if (psym >= bound) | |
2912 | { | |
2913 | if (bound == gbound && ps->n_static_syms != 0) | |
2914 | { | |
2915 | psym = objfile->static_psymbols.list + ps->statics_offset; | |
2916 | bound = sbound; | |
2917 | } | |
2918 | else | |
2919 | keep_going = 0; | |
2920 | continue; | |
2921 | } | |
2922 | else | |
2923 | { | |
2924 | QUIT; | |
2925 | ||
2926 | /* If it would match (logic taken from loop below) | |
2927 | load the file and go on to the next one */ | |
2928 | if (file_matches (ps->filename, files, nfiles) | |
2929 | && ((regexp == NULL || SYMBOL_MATCHES_REGEXP (*psym)) | |
2930 | && ((kind == VARIABLES_NAMESPACE && SYMBOL_CLASS (*psym) != LOC_TYPEDEF | |
2931 | && SYMBOL_CLASS (*psym) != LOC_BLOCK) | |
2932 | || (kind == FUNCTIONS_NAMESPACE && SYMBOL_CLASS (*psym) == LOC_BLOCK) | |
2933 | || (kind == TYPES_NAMESPACE && SYMBOL_CLASS (*psym) == LOC_TYPEDEF) | |
2934 | || (kind == METHODS_NAMESPACE && SYMBOL_CLASS (*psym) == LOC_BLOCK)))) | |
2935 | { | |
2936 | PSYMTAB_TO_SYMTAB (ps); | |
2937 | keep_going = 0; | |
2938 | } | |
2939 | } | |
2940 | psym++; | |
2941 | } | |
2942 | } | |
c906108c SS |
2943 | |
2944 | /* Here, we search through the minimal symbol tables for functions | |
2945 | and variables that match, and force their symbols to be read. | |
2946 | This is in particular necessary for demangled variable names, | |
2947 | which are no longer put into the partial symbol tables. | |
2948 | The symbol will then be found during the scan of symtabs below. | |
2949 | ||
2950 | For functions, find_pc_symtab should succeed if we have debug info | |
2951 | for the function, for variables we have to call lookup_symbol | |
2952 | to determine if the variable has debug info. | |
2953 | If the lookup fails, set found_misc so that we will rescan to print | |
2954 | any matching symbols without debug info. | |
c5aa993b | 2955 | */ |
c906108c SS |
2956 | |
2957 | if (nfiles == 0 && (kind == VARIABLES_NAMESPACE || kind == FUNCTIONS_NAMESPACE)) | |
2958 | { | |
2959 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b JM |
2960 | { |
2961 | if (MSYMBOL_TYPE (msymbol) == ourtype || | |
2962 | MSYMBOL_TYPE (msymbol) == ourtype2 || | |
2963 | MSYMBOL_TYPE (msymbol) == ourtype3 || | |
2964 | MSYMBOL_TYPE (msymbol) == ourtype4) | |
2965 | { | |
2966 | if (regexp == NULL || SYMBOL_MATCHES_REGEXP (msymbol)) | |
2967 | { | |
2968 | if (0 == find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol))) | |
2969 | { | |
e45febe2 DC |
2970 | if (kind == FUNCTIONS_NAMESPACE) |
2971 | { | |
2972 | found_misc = 1; | |
2973 | } | |
2974 | else | |
2975 | { | |
2976 | struct symbol *sym; | |
2977 | ||
2978 | if (SYMBOL_DEMANGLED_NAME (msymbol) != NULL) | |
2979 | sym | |
2980 | = lookup_symbol_aux_minsyms (SYMBOL_DEMANGLED_NAME | |
2981 | (msymbol), | |
2982 | SYMBOL_NAME (msymbol), | |
2983 | VAR_NAMESPACE, | |
2984 | NULL, NULL); | |
2985 | else | |
2986 | sym | |
2987 | = lookup_symbol_aux_minsyms (SYMBOL_NAME (msymbol), | |
2988 | NULL, | |
2989 | VAR_NAMESPACE, | |
2990 | NULL, NULL); | |
2991 | ||
2992 | if (sym == NULL) | |
2993 | found_misc = 1; | |
2994 | } | |
c5aa993b JM |
2995 | } |
2996 | } | |
2997 | } | |
2998 | } | |
c906108c SS |
2999 | } |
3000 | ||
3001 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
3002 | { |
3003 | bv = BLOCKVECTOR (s); | |
3004 | /* Often many files share a blockvector. | |
3005 | Scan each blockvector only once so that | |
3006 | we don't get every symbol many times. | |
3007 | It happens that the first symtab in the list | |
3008 | for any given blockvector is the main file. */ | |
3009 | if (bv != prev_bv) | |
3010 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) | |
3011 | { | |
434d2d4f DJ |
3012 | struct symbol_search *prevtail = tail; |
3013 | int nfound = 0; | |
c5aa993b | 3014 | b = BLOCKVECTOR_BLOCK (bv, i); |
261397f8 | 3015 | ALL_BLOCK_SYMBOLS (b, j, sym) |
c5aa993b JM |
3016 | { |
3017 | QUIT; | |
c5aa993b JM |
3018 | if (file_matches (s->filename, files, nfiles) |
3019 | && ((regexp == NULL || SYMBOL_MATCHES_REGEXP (sym)) | |
3020 | && ((kind == VARIABLES_NAMESPACE && SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
3021 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
3022 | && SYMBOL_CLASS (sym) != LOC_CONST) | |
3023 | || (kind == FUNCTIONS_NAMESPACE && SYMBOL_CLASS (sym) == LOC_BLOCK) | |
3024 | || (kind == TYPES_NAMESPACE && SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
3025 | || (kind == METHODS_NAMESPACE && SYMBOL_CLASS (sym) == LOC_BLOCK)))) | |
3026 | { | |
3027 | /* match */ | |
3028 | psr = (struct symbol_search *) xmalloc (sizeof (struct symbol_search)); | |
3029 | psr->block = i; | |
3030 | psr->symtab = s; | |
3031 | psr->symbol = sym; | |
3032 | psr->msymbol = NULL; | |
3033 | psr->next = NULL; | |
3034 | if (tail == NULL) | |
434d2d4f | 3035 | sr = psr; |
c5aa993b JM |
3036 | else |
3037 | tail->next = psr; | |
3038 | tail = psr; | |
434d2d4f DJ |
3039 | nfound ++; |
3040 | } | |
3041 | } | |
3042 | if (nfound > 0) | |
3043 | { | |
3044 | if (prevtail == NULL) | |
3045 | { | |
3046 | struct symbol_search dummy; | |
3047 | ||
3048 | dummy.next = sr; | |
3049 | tail = sort_search_symbols (&dummy, nfound); | |
3050 | sr = dummy.next; | |
3051 | ||
3052 | old_chain = make_cleanup_free_search_symbols (sr); | |
c5aa993b | 3053 | } |
434d2d4f DJ |
3054 | else |
3055 | tail = sort_search_symbols (prevtail, nfound); | |
c5aa993b JM |
3056 | } |
3057 | } | |
3058 | prev_bv = bv; | |
3059 | } | |
c906108c SS |
3060 | |
3061 | /* If there are no eyes, avoid all contact. I mean, if there are | |
3062 | no debug symbols, then print directly from the msymbol_vector. */ | |
3063 | ||
3064 | if (found_misc || kind != FUNCTIONS_NAMESPACE) | |
3065 | { | |
3066 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b JM |
3067 | { |
3068 | if (MSYMBOL_TYPE (msymbol) == ourtype || | |
3069 | MSYMBOL_TYPE (msymbol) == ourtype2 || | |
3070 | MSYMBOL_TYPE (msymbol) == ourtype3 || | |
3071 | MSYMBOL_TYPE (msymbol) == ourtype4) | |
3072 | { | |
3073 | if (regexp == NULL || SYMBOL_MATCHES_REGEXP (msymbol)) | |
3074 | { | |
3075 | /* Functions: Look up by address. */ | |
3076 | if (kind != FUNCTIONS_NAMESPACE || | |
3077 | (0 == find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol)))) | |
3078 | { | |
3079 | /* Variables/Absolutes: Look up by name */ | |
3080 | if (lookup_symbol (SYMBOL_NAME (msymbol), | |
3081 | (struct block *) NULL, VAR_NAMESPACE, | |
3082 | 0, (struct symtab **) NULL) == NULL) | |
3083 | { | |
3084 | /* match */ | |
3085 | psr = (struct symbol_search *) xmalloc (sizeof (struct symbol_search)); | |
3086 | psr->block = i; | |
3087 | psr->msymbol = msymbol; | |
3088 | psr->symtab = NULL; | |
3089 | psr->symbol = NULL; | |
3090 | psr->next = NULL; | |
3091 | if (tail == NULL) | |
3092 | { | |
3093 | sr = psr; | |
5bd98722 | 3094 | old_chain = make_cleanup_free_search_symbols (sr); |
c5aa993b JM |
3095 | } |
3096 | else | |
3097 | tail->next = psr; | |
3098 | tail = psr; | |
3099 | } | |
3100 | } | |
3101 | } | |
3102 | } | |
3103 | } | |
c906108c SS |
3104 | } |
3105 | ||
3106 | *matches = sr; | |
3107 | if (sr != NULL) | |
3108 | discard_cleanups (old_chain); | |
3109 | } | |
3110 | ||
3111 | /* Helper function for symtab_symbol_info, this function uses | |
3112 | the data returned from search_symbols() to print information | |
3113 | regarding the match to gdb_stdout. | |
c5aa993b | 3114 | */ |
c906108c | 3115 | static void |
fba45db2 KB |
3116 | print_symbol_info (namespace_enum kind, struct symtab *s, struct symbol *sym, |
3117 | int block, char *last) | |
c906108c SS |
3118 | { |
3119 | if (last == NULL || strcmp (last, s->filename) != 0) | |
3120 | { | |
3121 | fputs_filtered ("\nFile ", gdb_stdout); | |
3122 | fputs_filtered (s->filename, gdb_stdout); | |
3123 | fputs_filtered (":\n", gdb_stdout); | |
3124 | } | |
3125 | ||
3126 | if (kind != TYPES_NAMESPACE && block == STATIC_BLOCK) | |
3127 | printf_filtered ("static "); | |
c5aa993b | 3128 | |
c906108c SS |
3129 | /* Typedef that is not a C++ class */ |
3130 | if (kind == TYPES_NAMESPACE | |
3131 | && SYMBOL_NAMESPACE (sym) != STRUCT_NAMESPACE) | |
a5238fbc | 3132 | typedef_print (SYMBOL_TYPE (sym), sym, gdb_stdout); |
c906108c | 3133 | /* variable, func, or typedef-that-is-c++-class */ |
c5aa993b JM |
3134 | else if (kind < TYPES_NAMESPACE || |
3135 | (kind == TYPES_NAMESPACE && | |
3136 | SYMBOL_NAMESPACE (sym) == STRUCT_NAMESPACE)) | |
c906108c SS |
3137 | { |
3138 | type_print (SYMBOL_TYPE (sym), | |
c5aa993b JM |
3139 | (SYMBOL_CLASS (sym) == LOC_TYPEDEF |
3140 | ? "" : SYMBOL_SOURCE_NAME (sym)), | |
3141 | gdb_stdout, 0); | |
c906108c SS |
3142 | |
3143 | printf_filtered (";\n"); | |
3144 | } | |
c906108c SS |
3145 | } |
3146 | ||
3147 | /* This help function for symtab_symbol_info() prints information | |
3148 | for non-debugging symbols to gdb_stdout. | |
c5aa993b | 3149 | */ |
c906108c | 3150 | static void |
fba45db2 | 3151 | print_msymbol_info (struct minimal_symbol *msymbol) |
c906108c | 3152 | { |
3ac4495a MS |
3153 | char *tmp; |
3154 | ||
3155 | if (TARGET_ADDR_BIT <= 32) | |
14a5e767 AC |
3156 | tmp = local_hex_string_custom (SYMBOL_VALUE_ADDRESS (msymbol) |
3157 | & (CORE_ADDR) 0xffffffff, | |
3158 | "08l"); | |
3ac4495a | 3159 | else |
14a5e767 AC |
3160 | tmp = local_hex_string_custom (SYMBOL_VALUE_ADDRESS (msymbol), |
3161 | "016l"); | |
3ac4495a MS |
3162 | printf_filtered ("%s %s\n", |
3163 | tmp, SYMBOL_SOURCE_NAME (msymbol)); | |
c906108c SS |
3164 | } |
3165 | ||
3166 | /* This is the guts of the commands "info functions", "info types", and | |
3167 | "info variables". It calls search_symbols to find all matches and then | |
3168 | print_[m]symbol_info to print out some useful information about the | |
3169 | matches. | |
c5aa993b | 3170 | */ |
c906108c | 3171 | static void |
fba45db2 | 3172 | symtab_symbol_info (char *regexp, namespace_enum kind, int from_tty) |
c906108c SS |
3173 | { |
3174 | static char *classnames[] | |
c5aa993b JM |
3175 | = |
3176 | {"variable", "function", "type", "method"}; | |
c906108c SS |
3177 | struct symbol_search *symbols; |
3178 | struct symbol_search *p; | |
3179 | struct cleanup *old_chain; | |
3180 | char *last_filename = NULL; | |
3181 | int first = 1; | |
3182 | ||
3183 | /* must make sure that if we're interrupted, symbols gets freed */ | |
3184 | search_symbols (regexp, kind, 0, (char **) NULL, &symbols); | |
5bd98722 | 3185 | old_chain = make_cleanup_free_search_symbols (symbols); |
c906108c SS |
3186 | |
3187 | printf_filtered (regexp | |
c5aa993b JM |
3188 | ? "All %ss matching regular expression \"%s\":\n" |
3189 | : "All defined %ss:\n", | |
52204a0b | 3190 | classnames[(int) (kind - VARIABLES_NAMESPACE)], regexp); |
c906108c SS |
3191 | |
3192 | for (p = symbols; p != NULL; p = p->next) | |
3193 | { | |
3194 | QUIT; | |
3195 | ||
3196 | if (p->msymbol != NULL) | |
c5aa993b JM |
3197 | { |
3198 | if (first) | |
3199 | { | |
3200 | printf_filtered ("\nNon-debugging symbols:\n"); | |
3201 | first = 0; | |
3202 | } | |
3203 | print_msymbol_info (p->msymbol); | |
3204 | } | |
c906108c | 3205 | else |
c5aa993b JM |
3206 | { |
3207 | print_symbol_info (kind, | |
3208 | p->symtab, | |
3209 | p->symbol, | |
3210 | p->block, | |
3211 | last_filename); | |
3212 | last_filename = p->symtab->filename; | |
3213 | } | |
c906108c SS |
3214 | } |
3215 | ||
3216 | do_cleanups (old_chain); | |
3217 | } | |
3218 | ||
3219 | static void | |
fba45db2 | 3220 | variables_info (char *regexp, int from_tty) |
c906108c SS |
3221 | { |
3222 | symtab_symbol_info (regexp, VARIABLES_NAMESPACE, from_tty); | |
3223 | } | |
3224 | ||
3225 | static void | |
fba45db2 | 3226 | functions_info (char *regexp, int from_tty) |
c906108c SS |
3227 | { |
3228 | symtab_symbol_info (regexp, FUNCTIONS_NAMESPACE, from_tty); | |
3229 | } | |
3230 | ||
357e46e7 | 3231 | |
c906108c | 3232 | static void |
fba45db2 | 3233 | types_info (char *regexp, int from_tty) |
c906108c SS |
3234 | { |
3235 | symtab_symbol_info (regexp, TYPES_NAMESPACE, from_tty); | |
3236 | } | |
3237 | ||
c906108c | 3238 | /* Breakpoint all functions matching regular expression. */ |
8926118c | 3239 | |
8b93c638 | 3240 | void |
fba45db2 | 3241 | rbreak_command_wrapper (char *regexp, int from_tty) |
8b93c638 JM |
3242 | { |
3243 | rbreak_command (regexp, from_tty); | |
3244 | } | |
8926118c | 3245 | |
c906108c | 3246 | static void |
fba45db2 | 3247 | rbreak_command (char *regexp, int from_tty) |
c906108c SS |
3248 | { |
3249 | struct symbol_search *ss; | |
3250 | struct symbol_search *p; | |
3251 | struct cleanup *old_chain; | |
3252 | ||
3253 | search_symbols (regexp, FUNCTIONS_NAMESPACE, 0, (char **) NULL, &ss); | |
5bd98722 | 3254 | old_chain = make_cleanup_free_search_symbols (ss); |
c906108c SS |
3255 | |
3256 | for (p = ss; p != NULL; p = p->next) | |
3257 | { | |
3258 | if (p->msymbol == NULL) | |
c5aa993b JM |
3259 | { |
3260 | char *string = (char *) alloca (strlen (p->symtab->filename) | |
3261 | + strlen (SYMBOL_NAME (p->symbol)) | |
3262 | + 4); | |
3263 | strcpy (string, p->symtab->filename); | |
3264 | strcat (string, ":'"); | |
3265 | strcat (string, SYMBOL_NAME (p->symbol)); | |
3266 | strcat (string, "'"); | |
3267 | break_command (string, from_tty); | |
3268 | print_symbol_info (FUNCTIONS_NAMESPACE, | |
3269 | p->symtab, | |
3270 | p->symbol, | |
3271 | p->block, | |
3272 | p->symtab->filename); | |
3273 | } | |
c906108c | 3274 | else |
c5aa993b JM |
3275 | { |
3276 | break_command (SYMBOL_NAME (p->msymbol), from_tty); | |
3277 | printf_filtered ("<function, no debug info> %s;\n", | |
3278 | SYMBOL_SOURCE_NAME (p->msymbol)); | |
3279 | } | |
c906108c SS |
3280 | } |
3281 | ||
3282 | do_cleanups (old_chain); | |
3283 | } | |
c906108c | 3284 | \f |
c5aa993b | 3285 | |
c906108c SS |
3286 | /* Return Nonzero if block a is lexically nested within block b, |
3287 | or if a and b have the same pc range. | |
3288 | Return zero otherwise. */ | |
3289 | int | |
fba45db2 | 3290 | contained_in (struct block *a, struct block *b) |
c906108c SS |
3291 | { |
3292 | if (!a || !b) | |
3293 | return 0; | |
3294 | return BLOCK_START (a) >= BLOCK_START (b) | |
c5aa993b | 3295 | && BLOCK_END (a) <= BLOCK_END (b); |
c906108c | 3296 | } |
c906108c | 3297 | \f |
c5aa993b | 3298 | |
c906108c SS |
3299 | /* Helper routine for make_symbol_completion_list. */ |
3300 | ||
3301 | static int return_val_size; | |
3302 | static int return_val_index; | |
3303 | static char **return_val; | |
3304 | ||
3305 | #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \ | |
3306 | do { \ | |
3307 | if (SYMBOL_DEMANGLED_NAME (symbol) != NULL) \ | |
3308 | /* Put only the mangled name on the list. */ \ | |
3309 | /* Advantage: "b foo<TAB>" completes to "b foo(int, int)" */ \ | |
3310 | /* Disadvantage: "b foo__i<TAB>" doesn't complete. */ \ | |
3311 | completion_list_add_name \ | |
3312 | (SYMBOL_DEMANGLED_NAME (symbol), (sym_text), (len), (text), (word)); \ | |
3313 | else \ | |
3314 | completion_list_add_name \ | |
3315 | (SYMBOL_NAME (symbol), (sym_text), (len), (text), (word)); \ | |
3316 | } while (0) | |
3317 | ||
3318 | /* Test to see if the symbol specified by SYMNAME (which is already | |
c5aa993b JM |
3319 | demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN |
3320 | characters. If so, add it to the current completion list. */ | |
c906108c SS |
3321 | |
3322 | static void | |
fba45db2 KB |
3323 | completion_list_add_name (char *symname, char *sym_text, int sym_text_len, |
3324 | char *text, char *word) | |
c906108c SS |
3325 | { |
3326 | int newsize; | |
3327 | int i; | |
3328 | ||
3329 | /* clip symbols that cannot match */ | |
3330 | ||
3331 | if (strncmp (symname, sym_text, sym_text_len) != 0) | |
3332 | { | |
3333 | return; | |
3334 | } | |
3335 | ||
c906108c SS |
3336 | /* We have a match for a completion, so add SYMNAME to the current list |
3337 | of matches. Note that the name is moved to freshly malloc'd space. */ | |
3338 | ||
3339 | { | |
3340 | char *new; | |
3341 | if (word == sym_text) | |
3342 | { | |
3343 | new = xmalloc (strlen (symname) + 5); | |
3344 | strcpy (new, symname); | |
3345 | } | |
3346 | else if (word > sym_text) | |
3347 | { | |
3348 | /* Return some portion of symname. */ | |
3349 | new = xmalloc (strlen (symname) + 5); | |
3350 | strcpy (new, symname + (word - sym_text)); | |
3351 | } | |
3352 | else | |
3353 | { | |
3354 | /* Return some of SYM_TEXT plus symname. */ | |
3355 | new = xmalloc (strlen (symname) + (sym_text - word) + 5); | |
3356 | strncpy (new, word, sym_text - word); | |
3357 | new[sym_text - word] = '\0'; | |
3358 | strcat (new, symname); | |
3359 | } | |
3360 | ||
c906108c SS |
3361 | if (return_val_index + 3 > return_val_size) |
3362 | { | |
3363 | newsize = (return_val_size *= 2) * sizeof (char *); | |
3364 | return_val = (char **) xrealloc ((char *) return_val, newsize); | |
3365 | } | |
3366 | return_val[return_val_index++] = new; | |
3367 | return_val[return_val_index] = NULL; | |
3368 | } | |
3369 | } | |
3370 | ||
c94fdfd0 EZ |
3371 | /* Return a NULL terminated array of all symbols (regardless of class) |
3372 | which begin by matching TEXT. If the answer is no symbols, then | |
3373 | the return value is an array which contains only a NULL pointer. | |
c906108c SS |
3374 | |
3375 | Problem: All of the symbols have to be copied because readline frees them. | |
3376 | I'm not going to worry about this; hopefully there won't be that many. */ | |
3377 | ||
3378 | char ** | |
fba45db2 | 3379 | make_symbol_completion_list (char *text, char *word) |
c906108c SS |
3380 | { |
3381 | register struct symbol *sym; | |
3382 | register struct symtab *s; | |
3383 | register struct partial_symtab *ps; | |
3384 | register struct minimal_symbol *msymbol; | |
3385 | register struct objfile *objfile; | |
3386 | register struct block *b, *surrounding_static_block = 0; | |
3387 | register int i, j; | |
3388 | struct partial_symbol **psym; | |
3389 | /* The symbol we are completing on. Points in same buffer as text. */ | |
3390 | char *sym_text; | |
3391 | /* Length of sym_text. */ | |
3392 | int sym_text_len; | |
3393 | ||
3394 | /* Now look for the symbol we are supposed to complete on. | |
3395 | FIXME: This should be language-specific. */ | |
3396 | { | |
3397 | char *p; | |
3398 | char quote_found; | |
3399 | char *quote_pos = NULL; | |
3400 | ||
3401 | /* First see if this is a quoted string. */ | |
3402 | quote_found = '\0'; | |
3403 | for (p = text; *p != '\0'; ++p) | |
3404 | { | |
3405 | if (quote_found != '\0') | |
3406 | { | |
3407 | if (*p == quote_found) | |
3408 | /* Found close quote. */ | |
3409 | quote_found = '\0'; | |
3410 | else if (*p == '\\' && p[1] == quote_found) | |
3411 | /* A backslash followed by the quote character | |
c5aa993b | 3412 | doesn't end the string. */ |
c906108c SS |
3413 | ++p; |
3414 | } | |
3415 | else if (*p == '\'' || *p == '"') | |
3416 | { | |
3417 | quote_found = *p; | |
3418 | quote_pos = p; | |
3419 | } | |
3420 | } | |
3421 | if (quote_found == '\'') | |
3422 | /* A string within single quotes can be a symbol, so complete on it. */ | |
3423 | sym_text = quote_pos + 1; | |
3424 | else if (quote_found == '"') | |
3425 | /* A double-quoted string is never a symbol, nor does it make sense | |
c5aa993b | 3426 | to complete it any other way. */ |
c94fdfd0 EZ |
3427 | { |
3428 | return_val = (char **) xmalloc (sizeof (char *)); | |
3429 | return_val[0] = NULL; | |
3430 | return return_val; | |
3431 | } | |
c906108c SS |
3432 | else |
3433 | { | |
3434 | /* It is not a quoted string. Break it based on the characters | |
3435 | which are in symbols. */ | |
3436 | while (p > text) | |
3437 | { | |
3438 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0') | |
3439 | --p; | |
3440 | else | |
3441 | break; | |
3442 | } | |
3443 | sym_text = p; | |
3444 | } | |
3445 | } | |
3446 | ||
3447 | sym_text_len = strlen (sym_text); | |
3448 | ||
3449 | return_val_size = 100; | |
3450 | return_val_index = 0; | |
3451 | return_val = (char **) xmalloc ((return_val_size + 1) * sizeof (char *)); | |
3452 | return_val[0] = NULL; | |
3453 | ||
3454 | /* Look through the partial symtabs for all symbols which begin | |
3455 | by matching SYM_TEXT. Add each one that you find to the list. */ | |
3456 | ||
3457 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
3458 | { |
3459 | /* If the psymtab's been read in we'll get it when we search | |
3460 | through the blockvector. */ | |
3461 | if (ps->readin) | |
3462 | continue; | |
3463 | ||
3464 | for (psym = objfile->global_psymbols.list + ps->globals_offset; | |
3465 | psym < (objfile->global_psymbols.list + ps->globals_offset | |
3466 | + ps->n_global_syms); | |
3467 | psym++) | |
3468 | { | |
3469 | /* If interrupted, then quit. */ | |
3470 | QUIT; | |
3471 | COMPLETION_LIST_ADD_SYMBOL (*psym, sym_text, sym_text_len, text, word); | |
3472 | } | |
3473 | ||
3474 | for (psym = objfile->static_psymbols.list + ps->statics_offset; | |
3475 | psym < (objfile->static_psymbols.list + ps->statics_offset | |
3476 | + ps->n_static_syms); | |
3477 | psym++) | |
3478 | { | |
3479 | QUIT; | |
3480 | COMPLETION_LIST_ADD_SYMBOL (*psym, sym_text, sym_text_len, text, word); | |
3481 | } | |
3482 | } | |
c906108c SS |
3483 | |
3484 | /* At this point scan through the misc symbol vectors and add each | |
3485 | symbol you find to the list. Eventually we want to ignore | |
3486 | anything that isn't a text symbol (everything else will be | |
3487 | handled by the psymtab code above). */ | |
3488 | ||
3489 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b JM |
3490 | { |
3491 | QUIT; | |
3492 | COMPLETION_LIST_ADD_SYMBOL (msymbol, sym_text, sym_text_len, text, word); | |
3493 | } | |
c906108c SS |
3494 | |
3495 | /* Search upwards from currently selected frame (so that we can | |
3496 | complete on local vars. */ | |
3497 | ||
ae767bfb | 3498 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) |
c906108c SS |
3499 | { |
3500 | if (!BLOCK_SUPERBLOCK (b)) | |
3501 | { | |
c5aa993b | 3502 | surrounding_static_block = b; /* For elmin of dups */ |
c906108c | 3503 | } |
c5aa993b | 3504 | |
c906108c | 3505 | /* Also catch fields of types defined in this places which match our |
c5aa993b | 3506 | text string. Only complete on types visible from current context. */ |
c906108c | 3507 | |
e88c90f2 | 3508 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c906108c | 3509 | { |
c906108c SS |
3510 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3511 | if (SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
3512 | { | |
3513 | struct type *t = SYMBOL_TYPE (sym); | |
3514 | enum type_code c = TYPE_CODE (t); | |
3515 | ||
3516 | if (c == TYPE_CODE_UNION || c == TYPE_CODE_STRUCT) | |
3517 | { | |
3518 | for (j = TYPE_N_BASECLASSES (t); j < TYPE_NFIELDS (t); j++) | |
3519 | { | |
3520 | if (TYPE_FIELD_NAME (t, j)) | |
3521 | { | |
3522 | completion_list_add_name (TYPE_FIELD_NAME (t, j), | |
c5aa993b | 3523 | sym_text, sym_text_len, text, word); |
c906108c SS |
3524 | } |
3525 | } | |
3526 | } | |
3527 | } | |
3528 | } | |
3529 | } | |
3530 | ||
3531 | /* Go through the symtabs and check the externs and statics for | |
3532 | symbols which match. */ | |
3533 | ||
3534 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
3535 | { |
3536 | QUIT; | |
3537 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
e88c90f2 | 3538 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c5aa993b | 3539 | { |
c5aa993b JM |
3540 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3541 | } | |
3542 | } | |
c906108c SS |
3543 | |
3544 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
3545 | { |
3546 | QUIT; | |
3547 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
3548 | /* Don't do this block twice. */ | |
3549 | if (b == surrounding_static_block) | |
3550 | continue; | |
e88c90f2 | 3551 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c5aa993b | 3552 | { |
c5aa993b JM |
3553 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3554 | } | |
3555 | } | |
c906108c SS |
3556 | |
3557 | return (return_val); | |
3558 | } | |
3559 | ||
c94fdfd0 EZ |
3560 | /* Like make_symbol_completion_list, but returns a list of symbols |
3561 | defined in a source file FILE. */ | |
3562 | ||
3563 | char ** | |
3564 | make_file_symbol_completion_list (char *text, char *word, char *srcfile) | |
3565 | { | |
3566 | register struct symbol *sym; | |
3567 | register struct symtab *s; | |
3568 | register struct block *b; | |
3569 | register int i; | |
3570 | /* The symbol we are completing on. Points in same buffer as text. */ | |
3571 | char *sym_text; | |
3572 | /* Length of sym_text. */ | |
3573 | int sym_text_len; | |
3574 | ||
3575 | /* Now look for the symbol we are supposed to complete on. | |
3576 | FIXME: This should be language-specific. */ | |
3577 | { | |
3578 | char *p; | |
3579 | char quote_found; | |
3580 | char *quote_pos = NULL; | |
3581 | ||
3582 | /* First see if this is a quoted string. */ | |
3583 | quote_found = '\0'; | |
3584 | for (p = text; *p != '\0'; ++p) | |
3585 | { | |
3586 | if (quote_found != '\0') | |
3587 | { | |
3588 | if (*p == quote_found) | |
3589 | /* Found close quote. */ | |
3590 | quote_found = '\0'; | |
3591 | else if (*p == '\\' && p[1] == quote_found) | |
3592 | /* A backslash followed by the quote character | |
3593 | doesn't end the string. */ | |
3594 | ++p; | |
3595 | } | |
3596 | else if (*p == '\'' || *p == '"') | |
3597 | { | |
3598 | quote_found = *p; | |
3599 | quote_pos = p; | |
3600 | } | |
3601 | } | |
3602 | if (quote_found == '\'') | |
3603 | /* A string within single quotes can be a symbol, so complete on it. */ | |
3604 | sym_text = quote_pos + 1; | |
3605 | else if (quote_found == '"') | |
3606 | /* A double-quoted string is never a symbol, nor does it make sense | |
3607 | to complete it any other way. */ | |
3608 | { | |
3609 | return_val = (char **) xmalloc (sizeof (char *)); | |
3610 | return_val[0] = NULL; | |
3611 | return return_val; | |
3612 | } | |
3613 | else | |
3614 | { | |
3615 | /* It is not a quoted string. Break it based on the characters | |
3616 | which are in symbols. */ | |
3617 | while (p > text) | |
3618 | { | |
3619 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0') | |
3620 | --p; | |
3621 | else | |
3622 | break; | |
3623 | } | |
3624 | sym_text = p; | |
3625 | } | |
3626 | } | |
3627 | ||
3628 | sym_text_len = strlen (sym_text); | |
3629 | ||
3630 | return_val_size = 10; | |
3631 | return_val_index = 0; | |
3632 | return_val = (char **) xmalloc ((return_val_size + 1) * sizeof (char *)); | |
3633 | return_val[0] = NULL; | |
3634 | ||
3635 | /* Find the symtab for SRCFILE (this loads it if it was not yet read | |
3636 | in). */ | |
3637 | s = lookup_symtab (srcfile); | |
3638 | if (s == NULL) | |
3639 | { | |
3640 | /* Maybe they typed the file with leading directories, while the | |
3641 | symbol tables record only its basename. */ | |
31889e00 | 3642 | const char *tail = lbasename (srcfile); |
c94fdfd0 EZ |
3643 | |
3644 | if (tail > srcfile) | |
3645 | s = lookup_symtab (tail); | |
3646 | } | |
3647 | ||
3648 | /* If we have no symtab for that file, return an empty list. */ | |
3649 | if (s == NULL) | |
3650 | return (return_val); | |
3651 | ||
3652 | /* Go through this symtab and check the externs and statics for | |
3653 | symbols which match. */ | |
3654 | ||
3655 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
e88c90f2 | 3656 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c94fdfd0 | 3657 | { |
c94fdfd0 EZ |
3658 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3659 | } | |
3660 | ||
3661 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
e88c90f2 | 3662 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c94fdfd0 | 3663 | { |
c94fdfd0 EZ |
3664 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3665 | } | |
3666 | ||
3667 | return (return_val); | |
3668 | } | |
3669 | ||
3670 | /* A helper function for make_source_files_completion_list. It adds | |
3671 | another file name to a list of possible completions, growing the | |
3672 | list as necessary. */ | |
3673 | ||
3674 | static void | |
3675 | add_filename_to_list (const char *fname, char *text, char *word, | |
3676 | char ***list, int *list_used, int *list_alloced) | |
3677 | { | |
3678 | char *new; | |
3679 | size_t fnlen = strlen (fname); | |
3680 | ||
3681 | if (*list_used + 1 >= *list_alloced) | |
3682 | { | |
3683 | *list_alloced *= 2; | |
3684 | *list = (char **) xrealloc ((char *) *list, | |
3685 | *list_alloced * sizeof (char *)); | |
3686 | } | |
3687 | ||
3688 | if (word == text) | |
3689 | { | |
3690 | /* Return exactly fname. */ | |
3691 | new = xmalloc (fnlen + 5); | |
3692 | strcpy (new, fname); | |
3693 | } | |
3694 | else if (word > text) | |
3695 | { | |
3696 | /* Return some portion of fname. */ | |
3697 | new = xmalloc (fnlen + 5); | |
3698 | strcpy (new, fname + (word - text)); | |
3699 | } | |
3700 | else | |
3701 | { | |
3702 | /* Return some of TEXT plus fname. */ | |
3703 | new = xmalloc (fnlen + (text - word) + 5); | |
3704 | strncpy (new, word, text - word); | |
3705 | new[text - word] = '\0'; | |
3706 | strcat (new, fname); | |
3707 | } | |
3708 | (*list)[*list_used] = new; | |
3709 | (*list)[++*list_used] = NULL; | |
3710 | } | |
3711 | ||
3712 | static int | |
3713 | not_interesting_fname (const char *fname) | |
3714 | { | |
3715 | static const char *illegal_aliens[] = { | |
3716 | "_globals_", /* inserted by coff_symtab_read */ | |
3717 | NULL | |
3718 | }; | |
3719 | int i; | |
3720 | ||
3721 | for (i = 0; illegal_aliens[i]; i++) | |
3722 | { | |
3723 | if (strcmp (fname, illegal_aliens[i]) == 0) | |
3724 | return 1; | |
3725 | } | |
3726 | return 0; | |
3727 | } | |
3728 | ||
3729 | /* Return a NULL terminated array of all source files whose names | |
3730 | begin with matching TEXT. The file names are looked up in the | |
3731 | symbol tables of this program. If the answer is no matchess, then | |
3732 | the return value is an array which contains only a NULL pointer. */ | |
3733 | ||
3734 | char ** | |
3735 | make_source_files_completion_list (char *text, char *word) | |
3736 | { | |
3737 | register struct symtab *s; | |
3738 | register struct partial_symtab *ps; | |
3739 | register struct objfile *objfile; | |
3740 | int first = 1; | |
3741 | int list_alloced = 1; | |
3742 | int list_used = 0; | |
3743 | size_t text_len = strlen (text); | |
3744 | char **list = (char **) xmalloc (list_alloced * sizeof (char *)); | |
31889e00 | 3745 | const char *base_name; |
c94fdfd0 EZ |
3746 | |
3747 | list[0] = NULL; | |
3748 | ||
3749 | if (!have_full_symbols () && !have_partial_symbols ()) | |
3750 | return list; | |
3751 | ||
3752 | ALL_SYMTABS (objfile, s) | |
3753 | { | |
3754 | if (not_interesting_fname (s->filename)) | |
3755 | continue; | |
3756 | if (!filename_seen (s->filename, 1, &first) | |
3757 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
3758 | && strncasecmp (s->filename, text, text_len) == 0 | |
3759 | #else | |
3760 | && strncmp (s->filename, text, text_len) == 0 | |
3761 | #endif | |
3762 | ) | |
3763 | { | |
3764 | /* This file matches for a completion; add it to the current | |
3765 | list of matches. */ | |
3766 | add_filename_to_list (s->filename, text, word, | |
3767 | &list, &list_used, &list_alloced); | |
3768 | } | |
3769 | else | |
3770 | { | |
3771 | /* NOTE: We allow the user to type a base name when the | |
3772 | debug info records leading directories, but not the other | |
3773 | way around. This is what subroutines of breakpoint | |
3774 | command do when they parse file names. */ | |
31889e00 | 3775 | base_name = lbasename (s->filename); |
c94fdfd0 EZ |
3776 | if (base_name != s->filename |
3777 | && !filename_seen (base_name, 1, &first) | |
3778 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
3779 | && strncasecmp (base_name, text, text_len) == 0 | |
3780 | #else | |
3781 | && strncmp (base_name, text, text_len) == 0 | |
3782 | #endif | |
3783 | ) | |
3784 | add_filename_to_list (base_name, text, word, | |
3785 | &list, &list_used, &list_alloced); | |
3786 | } | |
3787 | } | |
3788 | ||
3789 | ALL_PSYMTABS (objfile, ps) | |
3790 | { | |
3791 | if (not_interesting_fname (ps->filename)) | |
3792 | continue; | |
3793 | if (!ps->readin) | |
3794 | { | |
3795 | if (!filename_seen (ps->filename, 1, &first) | |
3796 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
3797 | && strncasecmp (ps->filename, text, text_len) == 0 | |
3798 | #else | |
3799 | && strncmp (ps->filename, text, text_len) == 0 | |
3800 | #endif | |
3801 | ) | |
3802 | { | |
3803 | /* This file matches for a completion; add it to the | |
3804 | current list of matches. */ | |
3805 | add_filename_to_list (ps->filename, text, word, | |
3806 | &list, &list_used, &list_alloced); | |
3807 | ||
3808 | } | |
3809 | else | |
3810 | { | |
31889e00 | 3811 | base_name = lbasename (ps->filename); |
c94fdfd0 EZ |
3812 | if (base_name != ps->filename |
3813 | && !filename_seen (base_name, 1, &first) | |
3814 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
3815 | && strncasecmp (base_name, text, text_len) == 0 | |
3816 | #else | |
3817 | && strncmp (base_name, text, text_len) == 0 | |
3818 | #endif | |
3819 | ) | |
3820 | add_filename_to_list (base_name, text, word, | |
3821 | &list, &list_used, &list_alloced); | |
3822 | } | |
3823 | } | |
3824 | } | |
3825 | ||
3826 | return list; | |
3827 | } | |
3828 | ||
c906108c SS |
3829 | /* Determine if PC is in the prologue of a function. The prologue is the area |
3830 | between the first instruction of a function, and the first executable line. | |
3831 | Returns 1 if PC *might* be in prologue, 0 if definately *not* in prologue. | |
3832 | ||
3833 | If non-zero, func_start is where we think the prologue starts, possibly | |
3834 | by previous examination of symbol table information. | |
3835 | */ | |
3836 | ||
3837 | int | |
fba45db2 | 3838 | in_prologue (CORE_ADDR pc, CORE_ADDR func_start) |
c906108c SS |
3839 | { |
3840 | struct symtab_and_line sal; | |
3841 | CORE_ADDR func_addr, func_end; | |
3842 | ||
54cf9c03 EZ |
3843 | /* We have several sources of information we can consult to figure |
3844 | this out. | |
3845 | - Compilers usually emit line number info that marks the prologue | |
3846 | as its own "source line". So the ending address of that "line" | |
3847 | is the end of the prologue. If available, this is the most | |
3848 | reliable method. | |
3849 | - The minimal symbols and partial symbols, which can usually tell | |
3850 | us the starting and ending addresses of a function. | |
3851 | - If we know the function's start address, we can call the | |
3852 | architecture-defined SKIP_PROLOGUE function to analyze the | |
3853 | instruction stream and guess where the prologue ends. | |
3854 | - Our `func_start' argument; if non-zero, this is the caller's | |
3855 | best guess as to the function's entry point. At the time of | |
3856 | this writing, handle_inferior_event doesn't get this right, so | |
3857 | it should be our last resort. */ | |
3858 | ||
3859 | /* Consult the partial symbol table, to find which function | |
3860 | the PC is in. */ | |
3861 | if (! find_pc_partial_function (pc, NULL, &func_addr, &func_end)) | |
3862 | { | |
3863 | CORE_ADDR prologue_end; | |
c906108c | 3864 | |
54cf9c03 EZ |
3865 | /* We don't even have minsym information, so fall back to using |
3866 | func_start, if given. */ | |
3867 | if (! func_start) | |
3868 | return 1; /* We *might* be in a prologue. */ | |
c906108c | 3869 | |
54cf9c03 | 3870 | prologue_end = SKIP_PROLOGUE (func_start); |
c906108c | 3871 | |
54cf9c03 EZ |
3872 | return func_start <= pc && pc < prologue_end; |
3873 | } | |
c906108c | 3874 | |
54cf9c03 EZ |
3875 | /* If we have line number information for the function, that's |
3876 | usually pretty reliable. */ | |
3877 | sal = find_pc_line (func_addr, 0); | |
c906108c | 3878 | |
54cf9c03 EZ |
3879 | /* Now sal describes the source line at the function's entry point, |
3880 | which (by convention) is the prologue. The end of that "line", | |
3881 | sal.end, is the end of the prologue. | |
3882 | ||
3883 | Note that, for functions whose source code is all on a single | |
3884 | line, the line number information doesn't always end up this way. | |
3885 | So we must verify that our purported end-of-prologue address is | |
3886 | *within* the function, not at its start or end. */ | |
3887 | if (sal.line == 0 | |
3888 | || sal.end <= func_addr | |
3889 | || func_end <= sal.end) | |
3890 | { | |
3891 | /* We don't have any good line number info, so use the minsym | |
3892 | information, together with the architecture-specific prologue | |
3893 | scanning code. */ | |
3894 | CORE_ADDR prologue_end = SKIP_PROLOGUE (func_addr); | |
c906108c | 3895 | |
54cf9c03 EZ |
3896 | return func_addr <= pc && pc < prologue_end; |
3897 | } | |
c906108c | 3898 | |
54cf9c03 EZ |
3899 | /* We have line number info, and it looks good. */ |
3900 | return func_addr <= pc && pc < sal.end; | |
c906108c SS |
3901 | } |
3902 | ||
3903 | ||
3904 | /* Begin overload resolution functions */ | |
228c6d41 DJ |
3905 | |
3906 | static char * | |
3907 | remove_params (const char *demangled_name) | |
3908 | { | |
3909 | const char *argp; | |
3910 | char *new_name; | |
3911 | int depth; | |
3912 | ||
3913 | if (demangled_name == NULL) | |
3914 | return NULL; | |
3915 | ||
3916 | /* First find the end of the arg list. */ | |
3917 | argp = strrchr (demangled_name, ')'); | |
3918 | if (argp == NULL) | |
3919 | return NULL; | |
3920 | ||
3921 | /* Back up to the beginning. */ | |
3922 | depth = 1; | |
3923 | ||
3924 | while (argp-- > demangled_name) | |
3925 | { | |
3926 | if (*argp == ')') | |
3927 | depth ++; | |
3928 | else if (*argp == '(') | |
3929 | { | |
3930 | depth --; | |
3931 | ||
3932 | if (depth == 0) | |
3933 | break; | |
3934 | } | |
3935 | } | |
3936 | if (depth != 0) | |
3937 | internal_error (__FILE__, __LINE__, | |
3938 | "bad demangled name %s\n", demangled_name); | |
3939 | while (argp[-1] == ' ' && argp > demangled_name) | |
3940 | argp --; | |
3941 | ||
3942 | new_name = xmalloc (argp - demangled_name + 1); | |
3943 | memcpy (new_name, demangled_name, argp - demangled_name); | |
3944 | new_name[argp - demangled_name] = '\0'; | |
3945 | return new_name; | |
3946 | } | |
3947 | ||
c906108c SS |
3948 | /* Helper routine for make_symbol_completion_list. */ |
3949 | ||
3950 | static int sym_return_val_size; | |
3951 | static int sym_return_val_index; | |
3952 | static struct symbol **sym_return_val; | |
3953 | ||
3954 | /* Test to see if the symbol specified by SYMNAME (which is already | |
c5aa993b JM |
3955 | demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN |
3956 | characters. If so, add it to the current completion list. */ | |
c906108c SS |
3957 | |
3958 | static void | |
fba45db2 | 3959 | overload_list_add_symbol (struct symbol *sym, char *oload_name) |
c906108c SS |
3960 | { |
3961 | int newsize; | |
3962 | int i; | |
228c6d41 DJ |
3963 | char *sym_name; |
3964 | ||
3965 | /* If there is no type information, we can't do anything, so skip */ | |
3966 | if (SYMBOL_TYPE (sym) == NULL) | |
3967 | return; | |
3968 | ||
3969 | /* skip any symbols that we've already considered. */ | |
3970 | for (i = 0; i < sym_return_val_index; ++i) | |
3971 | if (!strcmp (SYMBOL_NAME (sym), SYMBOL_NAME (sym_return_val[i]))) | |
3972 | return; | |
c906108c SS |
3973 | |
3974 | /* Get the demangled name without parameters */ | |
228c6d41 | 3975 | sym_name = remove_params (SYMBOL_DEMANGLED_NAME (sym)); |
c906108c | 3976 | if (!sym_name) |
228c6d41 | 3977 | return; |
c906108c SS |
3978 | |
3979 | /* skip symbols that cannot match */ | |
3980 | if (strcmp (sym_name, oload_name) != 0) | |
917317f4 | 3981 | { |
b8c9b27d | 3982 | xfree (sym_name); |
917317f4 JM |
3983 | return; |
3984 | } | |
c906108c | 3985 | |
228c6d41 | 3986 | xfree (sym_name); |
c906108c SS |
3987 | |
3988 | /* We have a match for an overload instance, so add SYM to the current list | |
3989 | * of overload instances */ | |
3990 | if (sym_return_val_index + 3 > sym_return_val_size) | |
3991 | { | |
3992 | newsize = (sym_return_val_size *= 2) * sizeof (struct symbol *); | |
3993 | sym_return_val = (struct symbol **) xrealloc ((char *) sym_return_val, newsize); | |
3994 | } | |
3995 | sym_return_val[sym_return_val_index++] = sym; | |
3996 | sym_return_val[sym_return_val_index] = NULL; | |
c906108c SS |
3997 | } |
3998 | ||
3999 | /* Return a null-terminated list of pointers to function symbols that | |
4000 | * match name of the supplied symbol FSYM. | |
4001 | * This is used in finding all overloaded instances of a function name. | |
4002 | * This has been modified from make_symbol_completion_list. */ | |
4003 | ||
4004 | ||
4005 | struct symbol ** | |
fba45db2 | 4006 | make_symbol_overload_list (struct symbol *fsym) |
c906108c SS |
4007 | { |
4008 | register struct symbol *sym; | |
4009 | register struct symtab *s; | |
4010 | register struct partial_symtab *ps; | |
c906108c SS |
4011 | register struct objfile *objfile; |
4012 | register struct block *b, *surrounding_static_block = 0; | |
d4f3574e | 4013 | register int i; |
c906108c SS |
4014 | /* The name we are completing on. */ |
4015 | char *oload_name = NULL; | |
4016 | /* Length of name. */ | |
4017 | int oload_name_len = 0; | |
4018 | ||
228c6d41 | 4019 | /* Look for the symbol we are supposed to complete on. */ |
c906108c | 4020 | |
228c6d41 | 4021 | oload_name = remove_params (SYMBOL_DEMANGLED_NAME (fsym)); |
c906108c SS |
4022 | if (!oload_name) |
4023 | { | |
228c6d41 DJ |
4024 | sym_return_val_size = 1; |
4025 | sym_return_val = (struct symbol **) xmalloc (2 * sizeof (struct symbol *)); | |
4026 | sym_return_val[0] = fsym; | |
4027 | sym_return_val[1] = NULL; | |
4028 | ||
4029 | return sym_return_val; | |
c906108c SS |
4030 | } |
4031 | oload_name_len = strlen (oload_name); | |
4032 | ||
4033 | sym_return_val_size = 100; | |
4034 | sym_return_val_index = 0; | |
4035 | sym_return_val = (struct symbol **) xmalloc ((sym_return_val_size + 1) * sizeof (struct symbol *)); | |
4036 | sym_return_val[0] = NULL; | |
4037 | ||
4038 | /* Look through the partial symtabs for all symbols which begin | |
917317f4 | 4039 | by matching OLOAD_NAME. Make sure we read that symbol table in. */ |
c906108c SS |
4040 | |
4041 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b | 4042 | { |
d4f3574e SS |
4043 | struct partial_symbol **psym; |
4044 | ||
c5aa993b JM |
4045 | /* If the psymtab's been read in we'll get it when we search |
4046 | through the blockvector. */ | |
4047 | if (ps->readin) | |
4048 | continue; | |
4049 | ||
4050 | for (psym = objfile->global_psymbols.list + ps->globals_offset; | |
4051 | psym < (objfile->global_psymbols.list + ps->globals_offset | |
4052 | + ps->n_global_syms); | |
4053 | psym++) | |
4054 | { | |
4055 | /* If interrupted, then quit. */ | |
4056 | QUIT; | |
917317f4 JM |
4057 | /* This will cause the symbol table to be read if it has not yet been */ |
4058 | s = PSYMTAB_TO_SYMTAB (ps); | |
c5aa993b JM |
4059 | } |
4060 | ||
4061 | for (psym = objfile->static_psymbols.list + ps->statics_offset; | |
4062 | psym < (objfile->static_psymbols.list + ps->statics_offset | |
4063 | + ps->n_static_syms); | |
4064 | psym++) | |
4065 | { | |
4066 | QUIT; | |
917317f4 JM |
4067 | /* This will cause the symbol table to be read if it has not yet been */ |
4068 | s = PSYMTAB_TO_SYMTAB (ps); | |
c5aa993b JM |
4069 | } |
4070 | } | |
c906108c | 4071 | |
c906108c SS |
4072 | /* Search upwards from currently selected frame (so that we can |
4073 | complete on local vars. */ | |
4074 | ||
ae767bfb | 4075 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) |
c906108c SS |
4076 | { |
4077 | if (!BLOCK_SUPERBLOCK (b)) | |
4078 | { | |
c5aa993b | 4079 | surrounding_static_block = b; /* For elimination of dups */ |
c906108c | 4080 | } |
c5aa993b | 4081 | |
c906108c | 4082 | /* Also catch fields of types defined in this places which match our |
c5aa993b | 4083 | text string. Only complete on types visible from current context. */ |
c906108c | 4084 | |
e88c90f2 | 4085 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c906108c | 4086 | { |
c906108c SS |
4087 | overload_list_add_symbol (sym, oload_name); |
4088 | } | |
4089 | } | |
4090 | ||
4091 | /* Go through the symtabs and check the externs and statics for | |
4092 | symbols which match. */ | |
4093 | ||
4094 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
4095 | { |
4096 | QUIT; | |
4097 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
e88c90f2 | 4098 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c5aa993b | 4099 | { |
c5aa993b JM |
4100 | overload_list_add_symbol (sym, oload_name); |
4101 | } | |
4102 | } | |
c906108c SS |
4103 | |
4104 | ALL_SYMTABS (objfile, s) | |
c5aa993b JM |
4105 | { |
4106 | QUIT; | |
4107 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
4108 | /* Don't do this block twice. */ | |
4109 | if (b == surrounding_static_block) | |
4110 | continue; | |
e88c90f2 | 4111 | ALL_BLOCK_SYMBOLS (b, i, sym) |
c5aa993b | 4112 | { |
c5aa993b JM |
4113 | overload_list_add_symbol (sym, oload_name); |
4114 | } | |
4115 | } | |
c906108c | 4116 | |
b8c9b27d | 4117 | xfree (oload_name); |
c906108c SS |
4118 | |
4119 | return (sym_return_val); | |
4120 | } | |
4121 | ||
4122 | /* End of overload resolution functions */ | |
c906108c | 4123 | \f |
50641945 FN |
4124 | struct symtabs_and_lines |
4125 | decode_line_spec (char *string, int funfirstline) | |
4126 | { | |
4127 | struct symtabs_and_lines sals; | |
0378c332 FN |
4128 | struct symtab_and_line cursal; |
4129 | ||
50641945 FN |
4130 | if (string == 0) |
4131 | error ("Empty line specification."); | |
0378c332 FN |
4132 | |
4133 | /* We use whatever is set as the current source line. We do not try | |
4134 | and get a default or it will recursively call us! */ | |
4135 | cursal = get_current_source_symtab_and_line (); | |
4136 | ||
50641945 | 4137 | sals = decode_line_1 (&string, funfirstline, |
0378c332 | 4138 | cursal.symtab, cursal.line, |
50641945 | 4139 | (char ***) NULL); |
0378c332 | 4140 | |
50641945 FN |
4141 | if (*string) |
4142 | error ("Junk at end of line specification: %s", string); | |
4143 | return sals; | |
4144 | } | |
c5aa993b | 4145 | |
51cc5b07 AC |
4146 | /* Track MAIN */ |
4147 | static char *name_of_main; | |
4148 | ||
4149 | void | |
4150 | set_main_name (const char *name) | |
4151 | { | |
4152 | if (name_of_main != NULL) | |
4153 | { | |
4154 | xfree (name_of_main); | |
4155 | name_of_main = NULL; | |
4156 | } | |
4157 | if (name != NULL) | |
4158 | { | |
4159 | name_of_main = xstrdup (name); | |
4160 | } | |
4161 | } | |
4162 | ||
4163 | char * | |
4164 | main_name (void) | |
4165 | { | |
4166 | if (name_of_main != NULL) | |
4167 | return name_of_main; | |
4168 | else | |
4169 | return "main"; | |
4170 | } | |
4171 | ||
4172 | ||
c906108c | 4173 | void |
fba45db2 | 4174 | _initialize_symtab (void) |
c906108c SS |
4175 | { |
4176 | add_info ("variables", variables_info, | |
c5aa993b | 4177 | "All global and static variable names, or those matching REGEXP."); |
c906108c | 4178 | if (dbx_commands) |
c5aa993b JM |
4179 | add_com ("whereis", class_info, variables_info, |
4180 | "All global and static variable names, or those matching REGEXP."); | |
c906108c SS |
4181 | |
4182 | add_info ("functions", functions_info, | |
4183 | "All function names, or those matching REGEXP."); | |
4184 | ||
357e46e7 | 4185 | |
c906108c SS |
4186 | /* FIXME: This command has at least the following problems: |
4187 | 1. It prints builtin types (in a very strange and confusing fashion). | |
4188 | 2. It doesn't print right, e.g. with | |
c5aa993b JM |
4189 | typedef struct foo *FOO |
4190 | type_print prints "FOO" when we want to make it (in this situation) | |
4191 | print "struct foo *". | |
c906108c SS |
4192 | I also think "ptype" or "whatis" is more likely to be useful (but if |
4193 | there is much disagreement "info types" can be fixed). */ | |
4194 | add_info ("types", types_info, | |
4195 | "All type names, or those matching REGEXP."); | |
4196 | ||
c906108c SS |
4197 | add_info ("sources", sources_info, |
4198 | "Source files in the program."); | |
4199 | ||
4200 | add_com ("rbreak", class_breakpoint, rbreak_command, | |
c5aa993b | 4201 | "Set a breakpoint for all functions matching REGEXP."); |
c906108c SS |
4202 | |
4203 | if (xdb_commands) | |
4204 | { | |
4205 | add_com ("lf", class_info, sources_info, "Source files in the program"); | |
4206 | add_com ("lg", class_info, variables_info, | |
c5aa993b | 4207 | "All global and static variable names, or those matching REGEXP."); |
c906108c SS |
4208 | } |
4209 | ||
4210 | /* Initialize the one built-in type that isn't language dependent... */ | |
4211 | builtin_type_error = init_type (TYPE_CODE_ERROR, 0, 0, | |
4212 | "<unknown type>", (struct objfile *) NULL); | |
4213 | } |