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