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