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