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