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 | ||
1084 | if (s->addr - offset <= addr && addr < s->endaddr - offset) | |
1085 | { | |
1086 | ginfo->bfd_section = s->the_bfd_section; | |
1087 | ginfo->section = idx; | |
1088 | return; | |
1089 | } | |
1090 | } | |
1091 | } | |
c906108c SS |
1092 | } |
1093 | ||
1094 | struct symbol * | |
fba45db2 | 1095 | fixup_symbol_section (struct symbol *sym, struct objfile *objfile) |
c906108c | 1096 | { |
907fc202 UW |
1097 | CORE_ADDR addr; |
1098 | ||
c906108c SS |
1099 | if (!sym) |
1100 | return NULL; | |
1101 | ||
1102 | if (SYMBOL_BFD_SECTION (sym)) | |
1103 | return sym; | |
1104 | ||
907fc202 UW |
1105 | /* We either have an OBJFILE, or we can get at it from the sym's |
1106 | symtab. Anything else is a bug. */ | |
1107 | gdb_assert (objfile || SYMBOL_SYMTAB (sym)); | |
1108 | ||
1109 | if (objfile == NULL) | |
1110 | objfile = SYMBOL_SYMTAB (sym)->objfile; | |
1111 | ||
1112 | /* We should have an objfile by now. */ | |
1113 | gdb_assert (objfile); | |
1114 | ||
1115 | switch (SYMBOL_CLASS (sym)) | |
1116 | { | |
1117 | case LOC_STATIC: | |
1118 | case LOC_LABEL: | |
907fc202 UW |
1119 | addr = SYMBOL_VALUE_ADDRESS (sym); |
1120 | break; | |
1121 | case LOC_BLOCK: | |
1122 | addr = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
1123 | break; | |
1124 | ||
1125 | default: | |
1126 | /* Nothing else will be listed in the minsyms -- no use looking | |
1127 | it up. */ | |
1128 | return sym; | |
1129 | } | |
1130 | ||
1131 | fixup_section (&sym->ginfo, addr, objfile); | |
c906108c SS |
1132 | |
1133 | return sym; | |
1134 | } | |
1135 | ||
7a78d0ee | 1136 | struct partial_symbol * |
fba45db2 | 1137 | fixup_psymbol_section (struct partial_symbol *psym, struct objfile *objfile) |
c906108c | 1138 | { |
907fc202 UW |
1139 | CORE_ADDR addr; |
1140 | ||
c906108c SS |
1141 | if (!psym) |
1142 | return NULL; | |
1143 | ||
1144 | if (SYMBOL_BFD_SECTION (psym)) | |
1145 | return psym; | |
1146 | ||
907fc202 UW |
1147 | gdb_assert (objfile); |
1148 | ||
1149 | switch (SYMBOL_CLASS (psym)) | |
1150 | { | |
1151 | case LOC_STATIC: | |
1152 | case LOC_LABEL: | |
907fc202 UW |
1153 | case LOC_BLOCK: |
1154 | addr = SYMBOL_VALUE_ADDRESS (psym); | |
1155 | break; | |
1156 | default: | |
1157 | /* Nothing else will be listed in the minsyms -- no use looking | |
1158 | it up. */ | |
1159 | return psym; | |
1160 | } | |
1161 | ||
1162 | fixup_section (&psym->ginfo, addr, objfile); | |
c906108c SS |
1163 | |
1164 | return psym; | |
1165 | } | |
1166 | ||
1167 | /* Find the definition for a specified symbol name NAME | |
176620f1 | 1168 | in domain DOMAIN, visible from lexical block BLOCK. |
c906108c | 1169 | Returns the struct symbol pointer, or zero if no symbol is found. |
c906108c SS |
1170 | C++: if IS_A_FIELD_OF_THIS is nonzero on entry, check to see if |
1171 | NAME is a field of the current implied argument `this'. If so set | |
1172 | *IS_A_FIELD_OF_THIS to 1, otherwise set it to zero. | |
1173 | BLOCK_FOUND is set to the block in which NAME is found (in the case of | |
1174 | a field of `this', value_of_this sets BLOCK_FOUND to the proper value.) */ | |
1175 | ||
1176 | /* This function has a bunch of loops in it and it would seem to be | |
1177 | attractive to put in some QUIT's (though I'm not really sure | |
1178 | whether it can run long enough to be really important). But there | |
1179 | are a few calls for which it would appear to be bad news to quit | |
7ca9f392 AC |
1180 | out of here: find_proc_desc in alpha-tdep.c and mips-tdep.c. (Note |
1181 | that there is C++ code below which can error(), but that probably | |
1182 | doesn't affect these calls since they are looking for a known | |
1183 | variable and thus can probably assume it will never hit the C++ | |
1184 | code). */ | |
c906108c SS |
1185 | |
1186 | struct symbol * | |
53c5240f PA |
1187 | lookup_symbol_in_language (const char *name, const struct block *block, |
1188 | const domain_enum domain, enum language lang, | |
2570f2b7 | 1189 | int *is_a_field_of_this) |
c906108c | 1190 | { |
729051e6 DJ |
1191 | char *demangled_name = NULL; |
1192 | const char *modified_name = NULL; | |
3121eff0 | 1193 | const char *mangled_name = NULL; |
fba7f19c EZ |
1194 | int needtofreename = 0; |
1195 | struct symbol *returnval; | |
c906108c | 1196 | |
729051e6 DJ |
1197 | modified_name = name; |
1198 | ||
987504bb | 1199 | /* If we are using C++ or Java, demangle the name before doing a lookup, so |
729051e6 | 1200 | we can always binary search. */ |
53c5240f | 1201 | if (lang == language_cplus) |
729051e6 DJ |
1202 | { |
1203 | demangled_name = cplus_demangle (name, DMGL_ANSI | DMGL_PARAMS); | |
1204 | if (demangled_name) | |
1205 | { | |
1206 | mangled_name = name; | |
1207 | modified_name = demangled_name; | |
1208 | needtofreename = 1; | |
1209 | } | |
1210 | } | |
53c5240f | 1211 | else if (lang == language_java) |
987504bb JJ |
1212 | { |
1213 | demangled_name = cplus_demangle (name, | |
1214 | DMGL_ANSI | DMGL_PARAMS | DMGL_JAVA); | |
1215 | if (demangled_name) | |
1216 | { | |
1217 | mangled_name = name; | |
1218 | modified_name = demangled_name; | |
1219 | needtofreename = 1; | |
1220 | } | |
1221 | } | |
729051e6 | 1222 | |
63872f9d JG |
1223 | if (case_sensitivity == case_sensitive_off) |
1224 | { | |
1225 | char *copy; | |
1226 | int len, i; | |
1227 | ||
1228 | len = strlen (name); | |
1229 | copy = (char *) alloca (len + 1); | |
1230 | for (i= 0; i < len; i++) | |
1231 | copy[i] = tolower (name[i]); | |
1232 | copy[len] = 0; | |
fba7f19c | 1233 | modified_name = copy; |
63872f9d | 1234 | } |
fba7f19c | 1235 | |
3121eff0 | 1236 | returnval = lookup_symbol_aux (modified_name, mangled_name, block, |
21b556f4 | 1237 | domain, lang, is_a_field_of_this); |
fba7f19c | 1238 | if (needtofreename) |
729051e6 | 1239 | xfree (demangled_name); |
fba7f19c EZ |
1240 | |
1241 | return returnval; | |
1242 | } | |
1243 | ||
53c5240f PA |
1244 | /* Behave like lookup_symbol_in_language, but performed with the |
1245 | current language. */ | |
1246 | ||
1247 | struct symbol * | |
1248 | lookup_symbol (const char *name, const struct block *block, | |
2570f2b7 | 1249 | domain_enum domain, int *is_a_field_of_this) |
53c5240f PA |
1250 | { |
1251 | return lookup_symbol_in_language (name, block, domain, | |
1252 | current_language->la_language, | |
2570f2b7 | 1253 | is_a_field_of_this); |
53c5240f PA |
1254 | } |
1255 | ||
1256 | /* Behave like lookup_symbol except that NAME is the natural name | |
5ad1c190 DC |
1257 | of the symbol that we're looking for and, if LINKAGE_NAME is |
1258 | non-NULL, ensure that the symbol's linkage name matches as | |
1259 | well. */ | |
1260 | ||
fba7f19c | 1261 | static struct symbol * |
5ad1c190 | 1262 | lookup_symbol_aux (const char *name, const char *linkage_name, |
176620f1 | 1263 | const struct block *block, const domain_enum domain, |
21b556f4 | 1264 | enum language language, int *is_a_field_of_this) |
fba7f19c | 1265 | { |
8155455b | 1266 | struct symbol *sym; |
53c5240f | 1267 | const struct language_defn *langdef; |
406bc4de | 1268 | |
9a146a11 EZ |
1269 | /* Make sure we do something sensible with is_a_field_of_this, since |
1270 | the callers that set this parameter to some non-null value will | |
1271 | certainly use it later and expect it to be either 0 or 1. | |
1272 | If we don't set it, the contents of is_a_field_of_this are | |
1273 | undefined. */ | |
1274 | if (is_a_field_of_this != NULL) | |
1275 | *is_a_field_of_this = 0; | |
1276 | ||
e4051eeb DC |
1277 | /* Search specified block and its superiors. Don't search |
1278 | STATIC_BLOCK or GLOBAL_BLOCK. */ | |
c906108c | 1279 | |
21b556f4 | 1280 | sym = lookup_symbol_aux_local (name, linkage_name, block, domain); |
8155455b DC |
1281 | if (sym != NULL) |
1282 | return sym; | |
c906108c | 1283 | |
53c5240f PA |
1284 | /* If requested to do so by the caller and if appropriate for LANGUAGE, |
1285 | check to see if NAME is a field of `this'. */ | |
1286 | ||
1287 | langdef = language_def (language); | |
5f9a71c3 | 1288 | |
2b2d9e11 VP |
1289 | if (langdef->la_name_of_this != NULL && is_a_field_of_this != NULL |
1290 | && block != NULL) | |
c906108c | 1291 | { |
2b2d9e11 VP |
1292 | struct symbol *sym = NULL; |
1293 | /* 'this' is only defined in the function's block, so find the | |
1294 | enclosing function block. */ | |
1295 | for (; block && !BLOCK_FUNCTION (block); | |
1296 | block = BLOCK_SUPERBLOCK (block)); | |
1297 | ||
1298 | if (block && !dict_empty (BLOCK_DICT (block))) | |
1299 | sym = lookup_block_symbol (block, langdef->la_name_of_this, | |
1300 | NULL, VAR_DOMAIN); | |
1301 | if (sym) | |
c906108c | 1302 | { |
2b2d9e11 VP |
1303 | struct type *t = sym->type; |
1304 | ||
1305 | /* I'm not really sure that type of this can ever | |
1306 | be typedefed; just be safe. */ | |
1307 | CHECK_TYPEDEF (t); | |
1308 | if (TYPE_CODE (t) == TYPE_CODE_PTR | |
1309 | || TYPE_CODE (t) == TYPE_CODE_REF) | |
1310 | t = TYPE_TARGET_TYPE (t); | |
1311 | ||
1312 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT | |
1313 | && TYPE_CODE (t) != TYPE_CODE_UNION) | |
1314 | error (_("Internal error: `%s' is not an aggregate"), | |
1315 | langdef->la_name_of_this); | |
1316 | ||
1317 | if (check_field (t, name)) | |
1318 | { | |
1319 | *is_a_field_of_this = 1; | |
2b2d9e11 VP |
1320 | return NULL; |
1321 | } | |
c906108c SS |
1322 | } |
1323 | } | |
1324 | ||
53c5240f | 1325 | /* Now do whatever is appropriate for LANGUAGE to look |
5f9a71c3 | 1326 | up static and global variables. */ |
c906108c | 1327 | |
21b556f4 | 1328 | sym = langdef->la_lookup_symbol_nonlocal (name, linkage_name, block, domain); |
8155455b DC |
1329 | if (sym != NULL) |
1330 | return sym; | |
c906108c | 1331 | |
8155455b DC |
1332 | /* Now search all static file-level symbols. Not strictly correct, |
1333 | but more useful than an error. Do the symtabs first, then check | |
1334 | the psymtabs. If a psymtab indicates the existence of the | |
1335 | desired name as a file-level static, then do psymtab-to-symtab | |
c906108c SS |
1336 | conversion on the fly and return the found symbol. */ |
1337 | ||
21b556f4 | 1338 | sym = lookup_symbol_aux_symtabs (STATIC_BLOCK, name, linkage_name, domain); |
8155455b DC |
1339 | if (sym != NULL) |
1340 | return sym; | |
1341 | ||
21b556f4 | 1342 | sym = lookup_symbol_aux_psymtabs (STATIC_BLOCK, name, linkage_name, domain); |
8155455b DC |
1343 | if (sym != NULL) |
1344 | return sym; | |
c906108c | 1345 | |
8155455b | 1346 | return NULL; |
c906108c | 1347 | } |
8155455b | 1348 | |
e4051eeb | 1349 | /* Check to see if the symbol is defined in BLOCK or its superiors. |
89a9d1b1 | 1350 | Don't search STATIC_BLOCK or GLOBAL_BLOCK. */ |
8155455b DC |
1351 | |
1352 | static struct symbol * | |
5ad1c190 | 1353 | lookup_symbol_aux_local (const char *name, const char *linkage_name, |
8155455b | 1354 | const struct block *block, |
21b556f4 | 1355 | const domain_enum domain) |
8155455b DC |
1356 | { |
1357 | struct symbol *sym; | |
89a9d1b1 DC |
1358 | const struct block *static_block = block_static_block (block); |
1359 | ||
e4051eeb DC |
1360 | /* Check if either no block is specified or it's a global block. */ |
1361 | ||
89a9d1b1 DC |
1362 | if (static_block == NULL) |
1363 | return NULL; | |
e4051eeb | 1364 | |
89a9d1b1 | 1365 | while (block != static_block) |
f61e8913 | 1366 | { |
21b556f4 | 1367 | sym = lookup_symbol_aux_block (name, linkage_name, block, domain); |
f61e8913 DC |
1368 | if (sym != NULL) |
1369 | return sym; | |
1370 | block = BLOCK_SUPERBLOCK (block); | |
1371 | } | |
1372 | ||
89a9d1b1 | 1373 | /* We've reached the static block without finding a result. */ |
e4051eeb | 1374 | |
f61e8913 DC |
1375 | return NULL; |
1376 | } | |
1377 | ||
3a40aaa0 UW |
1378 | /* Look up OBJFILE to BLOCK. */ |
1379 | ||
1380 | static struct objfile * | |
1381 | lookup_objfile_from_block (const struct block *block) | |
1382 | { | |
1383 | struct objfile *obj; | |
1384 | struct symtab *s; | |
1385 | ||
1386 | if (block == NULL) | |
1387 | return NULL; | |
1388 | ||
1389 | block = block_global_block (block); | |
1390 | /* Go through SYMTABS. */ | |
1391 | ALL_SYMTABS (obj, s) | |
1392 | if (block == BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK)) | |
1393 | return obj; | |
1394 | ||
1395 | return NULL; | |
1396 | } | |
1397 | ||
6c9353d3 PA |
1398 | /* Look up a symbol in a block; if found, fixup the symbol, and set |
1399 | block_found appropriately. */ | |
f61e8913 | 1400 | |
5f9a71c3 | 1401 | struct symbol * |
5ad1c190 | 1402 | lookup_symbol_aux_block (const char *name, const char *linkage_name, |
f61e8913 | 1403 | const struct block *block, |
21b556f4 | 1404 | const domain_enum domain) |
f61e8913 DC |
1405 | { |
1406 | struct symbol *sym; | |
f61e8913 | 1407 | |
5ad1c190 | 1408 | sym = lookup_block_symbol (block, name, linkage_name, domain); |
f61e8913 | 1409 | if (sym) |
8155455b | 1410 | { |
f61e8913 | 1411 | block_found = block; |
21b556f4 | 1412 | return fixup_symbol_section (sym, NULL); |
8155455b DC |
1413 | } |
1414 | ||
1415 | return NULL; | |
1416 | } | |
1417 | ||
3a40aaa0 UW |
1418 | /* Check all global symbols in OBJFILE in symtabs and |
1419 | psymtabs. */ | |
1420 | ||
1421 | struct symbol * | |
1422 | lookup_global_symbol_from_objfile (const struct objfile *objfile, | |
1423 | const char *name, | |
1424 | const char *linkage_name, | |
21b556f4 | 1425 | const domain_enum domain) |
3a40aaa0 UW |
1426 | { |
1427 | struct symbol *sym; | |
1428 | struct blockvector *bv; | |
1429 | const struct block *block; | |
1430 | struct symtab *s; | |
1431 | struct partial_symtab *ps; | |
1432 | ||
1433 | /* Go through symtabs. */ | |
1434 | ALL_OBJFILE_SYMTABS (objfile, s) | |
1435 | { | |
1436 | bv = BLOCKVECTOR (s); | |
1437 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
1438 | sym = lookup_block_symbol (block, name, linkage_name, domain); | |
1439 | if (sym) | |
1440 | { | |
1441 | block_found = block; | |
3a40aaa0 UW |
1442 | return fixup_symbol_section (sym, (struct objfile *)objfile); |
1443 | } | |
1444 | } | |
1445 | ||
1446 | /* Now go through psymtabs. */ | |
1447 | ALL_OBJFILE_PSYMTABS (objfile, ps) | |
1448 | { | |
1449 | if (!ps->readin | |
1450 | && lookup_partial_symbol (ps, name, linkage_name, | |
1451 | 1, domain)) | |
1452 | { | |
1453 | s = PSYMTAB_TO_SYMTAB (ps); | |
1454 | bv = BLOCKVECTOR (s); | |
1455 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
1456 | sym = lookup_block_symbol (block, name, linkage_name, domain); | |
3a40aaa0 UW |
1457 | return fixup_symbol_section (sym, (struct objfile *)objfile); |
1458 | } | |
1459 | } | |
1460 | ||
56e3f43c DJ |
1461 | if (objfile->separate_debug_objfile) |
1462 | return lookup_global_symbol_from_objfile (objfile->separate_debug_objfile, | |
21b556f4 | 1463 | name, linkage_name, domain); |
56e3f43c | 1464 | |
3a40aaa0 UW |
1465 | return NULL; |
1466 | } | |
1467 | ||
8155455b DC |
1468 | /* Check to see if the symbol is defined in one of the symtabs. |
1469 | BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK, | |
1470 | depending on whether or not we want to search global symbols or | |
1471 | static symbols. */ | |
1472 | ||
1473 | static struct symbol * | |
1474 | lookup_symbol_aux_symtabs (int block_index, | |
5ad1c190 | 1475 | const char *name, const char *linkage_name, |
21b556f4 | 1476 | const domain_enum domain) |
8155455b DC |
1477 | { |
1478 | struct symbol *sym; | |
1479 | struct objfile *objfile; | |
1480 | struct blockvector *bv; | |
1481 | const struct block *block; | |
1482 | struct symtab *s; | |
1483 | ||
11309657 | 1484 | ALL_PRIMARY_SYMTABS (objfile, s) |
8155455b DC |
1485 | { |
1486 | bv = BLOCKVECTOR (s); | |
1487 | block = BLOCKVECTOR_BLOCK (bv, block_index); | |
5ad1c190 | 1488 | sym = lookup_block_symbol (block, name, linkage_name, domain); |
8155455b DC |
1489 | if (sym) |
1490 | { | |
1491 | block_found = block; | |
8155455b DC |
1492 | return fixup_symbol_section (sym, objfile); |
1493 | } | |
1494 | } | |
1495 | ||
1496 | return NULL; | |
1497 | } | |
1498 | ||
1499 | /* Check to see if the symbol is defined in one of the partial | |
1500 | symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or | |
1501 | STATIC_BLOCK, depending on whether or not we want to search global | |
1502 | symbols or static symbols. */ | |
1503 | ||
1504 | static struct symbol * | |
1505 | lookup_symbol_aux_psymtabs (int block_index, const char *name, | |
5ad1c190 | 1506 | const char *linkage_name, |
21b556f4 | 1507 | const domain_enum domain) |
8155455b DC |
1508 | { |
1509 | struct symbol *sym; | |
1510 | struct objfile *objfile; | |
1511 | struct blockvector *bv; | |
1512 | const struct block *block; | |
1513 | struct partial_symtab *ps; | |
1514 | struct symtab *s; | |
1515 | const int psymtab_index = (block_index == GLOBAL_BLOCK ? 1 : 0); | |
1516 | ||
1517 | ALL_PSYMTABS (objfile, ps) | |
1518 | { | |
1519 | if (!ps->readin | |
5ad1c190 | 1520 | && lookup_partial_symbol (ps, name, linkage_name, |
176620f1 | 1521 | psymtab_index, domain)) |
8155455b DC |
1522 | { |
1523 | s = PSYMTAB_TO_SYMTAB (ps); | |
1524 | bv = BLOCKVECTOR (s); | |
1525 | block = BLOCKVECTOR_BLOCK (bv, block_index); | |
5ad1c190 | 1526 | sym = lookup_block_symbol (block, name, linkage_name, domain); |
8155455b DC |
1527 | if (!sym) |
1528 | { | |
1529 | /* This shouldn't be necessary, but as a last resort try | |
1530 | looking in the statics even though the psymtab claimed | |
1531 | the symbol was global, or vice-versa. It's possible | |
1532 | that the psymtab gets it wrong in some cases. */ | |
1533 | ||
1534 | /* FIXME: carlton/2002-09-30: Should we really do that? | |
1535 | If that happens, isn't it likely to be a GDB error, in | |
1536 | which case we should fix the GDB error rather than | |
1537 | silently dealing with it here? So I'd vote for | |
1538 | removing the check for the symbol in the other | |
1539 | block. */ | |
1540 | block = BLOCKVECTOR_BLOCK (bv, | |
1541 | block_index == GLOBAL_BLOCK ? | |
1542 | STATIC_BLOCK : GLOBAL_BLOCK); | |
5ad1c190 | 1543 | sym = lookup_block_symbol (block, name, linkage_name, domain); |
8155455b | 1544 | if (!sym) |
8a3fe4f8 | 1545 | 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 |
1546 | block_index == GLOBAL_BLOCK ? "global" : "static", |
1547 | name, ps->filename, name, name); | |
1548 | } | |
8155455b DC |
1549 | return fixup_symbol_section (sym, objfile); |
1550 | } | |
1551 | } | |
1552 | ||
1553 | return NULL; | |
1554 | } | |
1555 | ||
5f9a71c3 DC |
1556 | /* A default version of lookup_symbol_nonlocal for use by languages |
1557 | that can't think of anything better to do. This implements the C | |
1558 | lookup rules. */ | |
1559 | ||
1560 | struct symbol * | |
1561 | basic_lookup_symbol_nonlocal (const char *name, | |
1562 | const char *linkage_name, | |
1563 | const struct block *block, | |
21b556f4 | 1564 | const domain_enum domain) |
5f9a71c3 DC |
1565 | { |
1566 | struct symbol *sym; | |
1567 | ||
1568 | /* NOTE: carlton/2003-05-19: The comments below were written when | |
1569 | this (or what turned into this) was part of lookup_symbol_aux; | |
1570 | I'm much less worried about these questions now, since these | |
1571 | decisions have turned out well, but I leave these comments here | |
1572 | for posterity. */ | |
1573 | ||
1574 | /* NOTE: carlton/2002-12-05: There is a question as to whether or | |
1575 | not it would be appropriate to search the current global block | |
1576 | here as well. (That's what this code used to do before the | |
1577 | is_a_field_of_this check was moved up.) On the one hand, it's | |
1578 | redundant with the lookup_symbol_aux_symtabs search that happens | |
1579 | next. On the other hand, if decode_line_1 is passed an argument | |
1580 | like filename:var, then the user presumably wants 'var' to be | |
1581 | searched for in filename. On the third hand, there shouldn't be | |
1582 | multiple global variables all of which are named 'var', and it's | |
1583 | not like decode_line_1 has ever restricted its search to only | |
1584 | global variables in a single filename. All in all, only | |
1585 | searching the static block here seems best: it's correct and it's | |
1586 | cleanest. */ | |
1587 | ||
1588 | /* NOTE: carlton/2002-12-05: There's also a possible performance | |
1589 | issue here: if you usually search for global symbols in the | |
1590 | current file, then it would be slightly better to search the | |
1591 | current global block before searching all the symtabs. But there | |
1592 | are other factors that have a much greater effect on performance | |
1593 | than that one, so I don't think we should worry about that for | |
1594 | now. */ | |
1595 | ||
21b556f4 | 1596 | sym = lookup_symbol_static (name, linkage_name, block, domain); |
5f9a71c3 DC |
1597 | if (sym != NULL) |
1598 | return sym; | |
1599 | ||
21b556f4 | 1600 | return lookup_symbol_global (name, linkage_name, block, domain); |
5f9a71c3 DC |
1601 | } |
1602 | ||
1603 | /* Lookup a symbol in the static block associated to BLOCK, if there | |
1604 | is one; do nothing if BLOCK is NULL or a global block. */ | |
1605 | ||
1606 | struct symbol * | |
1607 | lookup_symbol_static (const char *name, | |
1608 | const char *linkage_name, | |
1609 | const struct block *block, | |
21b556f4 | 1610 | const domain_enum domain) |
5f9a71c3 DC |
1611 | { |
1612 | const struct block *static_block = block_static_block (block); | |
1613 | ||
1614 | if (static_block != NULL) | |
21b556f4 | 1615 | return lookup_symbol_aux_block (name, linkage_name, static_block, domain); |
5f9a71c3 DC |
1616 | else |
1617 | return NULL; | |
1618 | } | |
1619 | ||
1620 | /* Lookup a symbol in all files' global blocks (searching psymtabs if | |
1621 | necessary). */ | |
1622 | ||
1623 | struct symbol * | |
1624 | lookup_symbol_global (const char *name, | |
1625 | const char *linkage_name, | |
3a40aaa0 | 1626 | const struct block *block, |
21b556f4 | 1627 | const domain_enum domain) |
5f9a71c3 | 1628 | { |
3a40aaa0 UW |
1629 | struct symbol *sym = NULL; |
1630 | struct objfile *objfile = NULL; | |
1631 | ||
1632 | /* Call library-specific lookup procedure. */ | |
1633 | objfile = lookup_objfile_from_block (block); | |
1634 | if (objfile != NULL) | |
21b556f4 | 1635 | sym = solib_global_lookup (objfile, name, linkage_name, domain); |
3a40aaa0 UW |
1636 | if (sym != NULL) |
1637 | return sym; | |
5f9a71c3 | 1638 | |
21b556f4 | 1639 | sym = lookup_symbol_aux_symtabs (GLOBAL_BLOCK, name, linkage_name, domain); |
5f9a71c3 DC |
1640 | if (sym != NULL) |
1641 | return sym; | |
1642 | ||
21b556f4 | 1643 | return lookup_symbol_aux_psymtabs (GLOBAL_BLOCK, name, linkage_name, domain); |
5f9a71c3 DC |
1644 | } |
1645 | ||
5eeb2539 AR |
1646 | int |
1647 | symbol_matches_domain (enum language symbol_language, | |
1648 | domain_enum symbol_domain, | |
1649 | domain_enum domain) | |
1650 | { | |
1651 | /* For C++ "struct foo { ... }" also defines a typedef for "foo". | |
1652 | A Java class declaration also defines a typedef for the class. | |
1653 | Similarly, any Ada type declaration implicitly defines a typedef. */ | |
1654 | if (symbol_language == language_cplus | |
1655 | || symbol_language == language_java | |
1656 | || symbol_language == language_ada) | |
1657 | { | |
1658 | if ((domain == VAR_DOMAIN || domain == STRUCT_DOMAIN) | |
1659 | && symbol_domain == STRUCT_DOMAIN) | |
1660 | return 1; | |
1661 | } | |
1662 | /* For all other languages, strict match is required. */ | |
1663 | return (symbol_domain == domain); | |
1664 | } | |
1665 | ||
3d4e8fd2 DC |
1666 | /* Look, in partial_symtab PST, for symbol whose natural name is NAME. |
1667 | If LINKAGE_NAME is non-NULL, check in addition that the symbol's | |
1668 | linkage name matches it. Check the global symbols if GLOBAL, the | |
1669 | static symbols if not */ | |
c906108c | 1670 | |
b6429628 | 1671 | struct partial_symbol * |
3d4e8fd2 DC |
1672 | lookup_partial_symbol (struct partial_symtab *pst, const char *name, |
1673 | const char *linkage_name, int global, | |
176620f1 | 1674 | domain_enum domain) |
c906108c | 1675 | { |
357e46e7 | 1676 | struct partial_symbol *temp; |
c906108c | 1677 | struct partial_symbol **start, **psym; |
38d49aff | 1678 | struct partial_symbol **top, **real_top, **bottom, **center; |
c906108c SS |
1679 | int length = (global ? pst->n_global_syms : pst->n_static_syms); |
1680 | int do_linear_search = 1; | |
357e46e7 | 1681 | |
c906108c SS |
1682 | if (length == 0) |
1683 | { | |
1684 | return (NULL); | |
1685 | } | |
c906108c SS |
1686 | start = (global ? |
1687 | pst->objfile->global_psymbols.list + pst->globals_offset : | |
c5aa993b | 1688 | pst->objfile->static_psymbols.list + pst->statics_offset); |
357e46e7 | 1689 | |
c5aa993b | 1690 | if (global) /* This means we can use a binary search. */ |
c906108c SS |
1691 | { |
1692 | do_linear_search = 0; | |
1693 | ||
1694 | /* Binary search. This search is guaranteed to end with center | |
0fe19209 DC |
1695 | pointing at the earliest partial symbol whose name might be |
1696 | correct. At that point *all* partial symbols with an | |
1697 | appropriate name will be checked against the correct | |
176620f1 | 1698 | domain. */ |
c906108c SS |
1699 | |
1700 | bottom = start; | |
1701 | top = start + length - 1; | |
38d49aff | 1702 | real_top = top; |
c906108c SS |
1703 | while (top > bottom) |
1704 | { | |
1705 | center = bottom + (top - bottom) / 2; | |
1706 | if (!(center < top)) | |
e2e0b3e5 | 1707 | internal_error (__FILE__, __LINE__, _("failed internal consistency check")); |
c906108c | 1708 | if (!do_linear_search |
357e46e7 | 1709 | && (SYMBOL_LANGUAGE (*center) == language_java)) |
c906108c SS |
1710 | { |
1711 | do_linear_search = 1; | |
1712 | } | |
4725b721 | 1713 | if (strcmp_iw_ordered (SYMBOL_SEARCH_NAME (*center), name) >= 0) |
c906108c SS |
1714 | { |
1715 | top = center; | |
1716 | } | |
1717 | else | |
1718 | { | |
1719 | bottom = center + 1; | |
1720 | } | |
1721 | } | |
1722 | if (!(top == bottom)) | |
e2e0b3e5 | 1723 | internal_error (__FILE__, __LINE__, _("failed internal consistency check")); |
357e46e7 | 1724 | |
3d4e8fd2 DC |
1725 | while (top <= real_top |
1726 | && (linkage_name != NULL | |
1727 | ? strcmp (SYMBOL_LINKAGE_NAME (*top), linkage_name) == 0 | |
4725b721 | 1728 | : SYMBOL_MATCHES_SEARCH_NAME (*top,name))) |
c906108c | 1729 | { |
5eeb2539 AR |
1730 | if (symbol_matches_domain (SYMBOL_LANGUAGE (*top), |
1731 | SYMBOL_DOMAIN (*top), domain)) | |
1732 | return (*top); | |
c5aa993b | 1733 | top++; |
c906108c SS |
1734 | } |
1735 | } | |
1736 | ||
1737 | /* Can't use a binary search or else we found during the binary search that | |
1738 | we should also do a linear search. */ | |
1739 | ||
1740 | if (do_linear_search) | |
357e46e7 | 1741 | { |
c906108c SS |
1742 | for (psym = start; psym < start + length; psym++) |
1743 | { | |
5eeb2539 AR |
1744 | if (symbol_matches_domain (SYMBOL_LANGUAGE (*psym), |
1745 | SYMBOL_DOMAIN (*psym), domain)) | |
c906108c | 1746 | { |
3d4e8fd2 DC |
1747 | if (linkage_name != NULL |
1748 | ? strcmp (SYMBOL_LINKAGE_NAME (*psym), linkage_name) == 0 | |
4725b721 | 1749 | : SYMBOL_MATCHES_SEARCH_NAME (*psym, name)) |
c906108c SS |
1750 | { |
1751 | return (*psym); | |
1752 | } | |
1753 | } | |
1754 | } | |
1755 | } | |
1756 | ||
1757 | return (NULL); | |
1758 | } | |
1759 | ||
176620f1 | 1760 | /* Look up a type named NAME in the struct_domain. The type returned |
b368761e DC |
1761 | must not be opaque -- i.e., must have at least one field |
1762 | defined. */ | |
c906108c | 1763 | |
b368761e DC |
1764 | struct type * |
1765 | lookup_transparent_type (const char *name) | |
1766 | { | |
1767 | return current_language->la_lookup_transparent_type (name); | |
1768 | } | |
c906108c | 1769 | |
b368761e DC |
1770 | /* The standard implementation of lookup_transparent_type. This code |
1771 | was modeled on lookup_symbol -- the parts not relevant to looking | |
1772 | up types were just left out. In particular it's assumed here that | |
1773 | types are available in struct_domain and only at file-static or | |
1774 | global blocks. */ | |
c906108c SS |
1775 | |
1776 | struct type * | |
b368761e | 1777 | basic_lookup_transparent_type (const char *name) |
c906108c | 1778 | { |
52f0bd74 AC |
1779 | struct symbol *sym; |
1780 | struct symtab *s = NULL; | |
1781 | struct partial_symtab *ps; | |
c906108c | 1782 | struct blockvector *bv; |
52f0bd74 AC |
1783 | struct objfile *objfile; |
1784 | struct block *block; | |
c906108c SS |
1785 | |
1786 | /* Now search all the global symbols. Do the symtab's first, then | |
1787 | check the psymtab's. If a psymtab indicates the existence | |
1788 | of the desired name as a global, then do psymtab-to-symtab | |
1789 | conversion on the fly and return the found symbol. */ | |
c5aa993b | 1790 | |
11309657 | 1791 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
1792 | { |
1793 | bv = BLOCKVECTOR (s); | |
1794 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
176620f1 | 1795 | sym = lookup_block_symbol (block, name, NULL, STRUCT_DOMAIN); |
c5aa993b JM |
1796 | if (sym && !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) |
1797 | { | |
1798 | return SYMBOL_TYPE (sym); | |
1799 | } | |
1800 | } | |
c906108c SS |
1801 | |
1802 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b | 1803 | { |
3d4e8fd2 | 1804 | if (!ps->readin && lookup_partial_symbol (ps, name, NULL, |
176620f1 | 1805 | 1, STRUCT_DOMAIN)) |
c5aa993b JM |
1806 | { |
1807 | s = PSYMTAB_TO_SYMTAB (ps); | |
1808 | bv = BLOCKVECTOR (s); | |
1809 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
176620f1 | 1810 | sym = lookup_block_symbol (block, name, NULL, STRUCT_DOMAIN); |
c5aa993b JM |
1811 | if (!sym) |
1812 | { | |
1813 | /* This shouldn't be necessary, but as a last resort | |
1814 | * try looking in the statics even though the psymtab | |
1815 | * claimed the symbol was global. It's possible that | |
1816 | * the psymtab gets it wrong in some cases. | |
1817 | */ | |
1818 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
176620f1 | 1819 | sym = lookup_block_symbol (block, name, NULL, STRUCT_DOMAIN); |
c5aa993b | 1820 | if (!sym) |
8a3fe4f8 | 1821 | error (_("Internal: global symbol `%s' found in %s psymtab but not in symtab.\n\ |
c906108c | 1822 | %s may be an inlined function, or may be a template function\n\ |
8a3fe4f8 | 1823 | (if a template, try specifying an instantiation: %s<type>)."), |
c5aa993b JM |
1824 | name, ps->filename, name, name); |
1825 | } | |
1826 | if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) | |
1827 | return SYMBOL_TYPE (sym); | |
1828 | } | |
1829 | } | |
c906108c SS |
1830 | |
1831 | /* Now search the static file-level symbols. | |
1832 | Not strictly correct, but more useful than an error. | |
1833 | Do the symtab's first, then | |
1834 | check the psymtab's. If a psymtab indicates the existence | |
1835 | of the desired name as a file-level static, then do psymtab-to-symtab | |
1836 | conversion on the fly and return the found symbol. | |
1837 | */ | |
1838 | ||
11309657 | 1839 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
1840 | { |
1841 | bv = BLOCKVECTOR (s); | |
1842 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
176620f1 | 1843 | sym = lookup_block_symbol (block, name, NULL, STRUCT_DOMAIN); |
c5aa993b JM |
1844 | if (sym && !TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) |
1845 | { | |
1846 | return SYMBOL_TYPE (sym); | |
1847 | } | |
1848 | } | |
c906108c SS |
1849 | |
1850 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b | 1851 | { |
176620f1 | 1852 | if (!ps->readin && lookup_partial_symbol (ps, name, NULL, 0, STRUCT_DOMAIN)) |
c5aa993b JM |
1853 | { |
1854 | s = PSYMTAB_TO_SYMTAB (ps); | |
1855 | bv = BLOCKVECTOR (s); | |
1856 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
176620f1 | 1857 | sym = lookup_block_symbol (block, name, NULL, STRUCT_DOMAIN); |
c5aa993b JM |
1858 | if (!sym) |
1859 | { | |
1860 | /* This shouldn't be necessary, but as a last resort | |
1861 | * try looking in the globals even though the psymtab | |
1862 | * claimed the symbol was static. It's possible that | |
1863 | * the psymtab gets it wrong in some cases. | |
1864 | */ | |
1865 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
176620f1 | 1866 | sym = lookup_block_symbol (block, name, NULL, STRUCT_DOMAIN); |
c5aa993b | 1867 | if (!sym) |
8a3fe4f8 | 1868 | error (_("Internal: static symbol `%s' found in %s psymtab but not in symtab.\n\ |
c906108c | 1869 | %s may be an inlined function, or may be a template function\n\ |
8a3fe4f8 | 1870 | (if a template, try specifying an instantiation: %s<type>)."), |
c5aa993b JM |
1871 | name, ps->filename, name, name); |
1872 | } | |
1873 | if (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))) | |
1874 | return SYMBOL_TYPE (sym); | |
1875 | } | |
1876 | } | |
c906108c SS |
1877 | return (struct type *) 0; |
1878 | } | |
1879 | ||
1880 | ||
1881 | /* Find the psymtab containing main(). */ | |
1882 | /* FIXME: What about languages without main() or specially linked | |
1883 | executables that have no main() ? */ | |
1884 | ||
1885 | struct partial_symtab * | |
fba45db2 | 1886 | find_main_psymtab (void) |
c906108c | 1887 | { |
52f0bd74 AC |
1888 | struct partial_symtab *pst; |
1889 | struct objfile *objfile; | |
c906108c SS |
1890 | |
1891 | ALL_PSYMTABS (objfile, pst) | |
c5aa993b | 1892 | { |
176620f1 | 1893 | if (lookup_partial_symbol (pst, main_name (), NULL, 1, VAR_DOMAIN)) |
c5aa993b JM |
1894 | { |
1895 | return (pst); | |
1896 | } | |
1897 | } | |
c906108c SS |
1898 | return (NULL); |
1899 | } | |
1900 | ||
176620f1 | 1901 | /* Search BLOCK for symbol NAME in DOMAIN. |
c906108c SS |
1902 | |
1903 | Note that if NAME is the demangled form of a C++ symbol, we will fail | |
1904 | to find a match during the binary search of the non-encoded names, but | |
1905 | for now we don't worry about the slight inefficiency of looking for | |
1906 | a match we'll never find, since it will go pretty quick. Once the | |
1907 | binary search terminates, we drop through and do a straight linear | |
1bae87b9 AF |
1908 | search on the symbols. Each symbol which is marked as being a ObjC/C++ |
1909 | symbol (language_cplus or language_objc set) has both the encoded and | |
1910 | non-encoded names tested for a match. | |
3121eff0 | 1911 | |
5ad1c190 | 1912 | If LINKAGE_NAME is non-NULL, verify that any symbol we find has this |
3121eff0 DJ |
1913 | particular mangled name. |
1914 | */ | |
c906108c SS |
1915 | |
1916 | struct symbol * | |
aa1ee363 | 1917 | lookup_block_symbol (const struct block *block, const char *name, |
5ad1c190 | 1918 | const char *linkage_name, |
176620f1 | 1919 | const domain_enum domain) |
c906108c | 1920 | { |
de4f826b DC |
1921 | struct dict_iterator iter; |
1922 | struct symbol *sym; | |
c906108c | 1923 | |
de4f826b | 1924 | if (!BLOCK_FUNCTION (block)) |
261397f8 | 1925 | { |
de4f826b DC |
1926 | for (sym = dict_iter_name_first (BLOCK_DICT (block), name, &iter); |
1927 | sym != NULL; | |
1928 | sym = dict_iter_name_next (name, &iter)) | |
261397f8 | 1929 | { |
5eeb2539 AR |
1930 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
1931 | SYMBOL_DOMAIN (sym), domain) | |
de4f826b DC |
1932 | && (linkage_name != NULL |
1933 | ? strcmp (SYMBOL_LINKAGE_NAME (sym), linkage_name) == 0 : 1)) | |
261397f8 DJ |
1934 | return sym; |
1935 | } | |
1936 | return NULL; | |
1937 | } | |
526e70c0 | 1938 | else |
c906108c | 1939 | { |
526e70c0 DC |
1940 | /* Note that parameter symbols do not always show up last in the |
1941 | list; this loop makes sure to take anything else other than | |
1942 | parameter symbols first; it only uses parameter symbols as a | |
1943 | last resort. Note that this only takes up extra computation | |
1944 | time on a match. */ | |
de4f826b DC |
1945 | |
1946 | struct symbol *sym_found = NULL; | |
1947 | ||
1948 | for (sym = dict_iter_name_first (BLOCK_DICT (block), name, &iter); | |
1949 | sym != NULL; | |
1950 | sym = dict_iter_name_next (name, &iter)) | |
c906108c | 1951 | { |
5eeb2539 AR |
1952 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
1953 | SYMBOL_DOMAIN (sym), domain) | |
de4f826b DC |
1954 | && (linkage_name != NULL |
1955 | ? strcmp (SYMBOL_LINKAGE_NAME (sym), linkage_name) == 0 : 1)) | |
c906108c | 1956 | { |
c906108c | 1957 | sym_found = sym; |
2a2d4dc3 | 1958 | if (!SYMBOL_IS_ARGUMENT (sym)) |
c906108c SS |
1959 | { |
1960 | break; | |
1961 | } | |
1962 | } | |
c906108c | 1963 | } |
de4f826b | 1964 | return (sym_found); /* Will be NULL if not found. */ |
c906108c | 1965 | } |
c906108c SS |
1966 | } |
1967 | ||
c906108c SS |
1968 | /* Find the symtab associated with PC and SECTION. Look through the |
1969 | psymtabs and read in another symtab if necessary. */ | |
1970 | ||
1971 | struct symtab * | |
fba45db2 | 1972 | find_pc_sect_symtab (CORE_ADDR pc, asection *section) |
c906108c | 1973 | { |
52f0bd74 | 1974 | struct block *b; |
c906108c | 1975 | struct blockvector *bv; |
52f0bd74 AC |
1976 | struct symtab *s = NULL; |
1977 | struct symtab *best_s = NULL; | |
1978 | struct partial_symtab *ps; | |
1979 | struct objfile *objfile; | |
c906108c | 1980 | CORE_ADDR distance = 0; |
8a48e967 DJ |
1981 | struct minimal_symbol *msymbol; |
1982 | ||
1983 | /* If we know that this is not a text address, return failure. This is | |
1984 | necessary because we loop based on the block's high and low code | |
1985 | addresses, which do not include the data ranges, and because | |
1986 | we call find_pc_sect_psymtab which has a similar restriction based | |
1987 | on the partial_symtab's texthigh and textlow. */ | |
1988 | msymbol = lookup_minimal_symbol_by_pc_section (pc, section); | |
1989 | if (msymbol | |
1990 | && (msymbol->type == mst_data | |
1991 | || msymbol->type == mst_bss | |
1992 | || msymbol->type == mst_abs | |
1993 | || msymbol->type == mst_file_data | |
1994 | || msymbol->type == mst_file_bss)) | |
1995 | return NULL; | |
c906108c SS |
1996 | |
1997 | /* Search all symtabs for the one whose file contains our address, and which | |
1998 | is the smallest of all the ones containing the address. This is designed | |
1999 | to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000 | |
2000 | and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from | |
2001 | 0x1000-0x4000, but for address 0x2345 we want to return symtab b. | |
2002 | ||
2003 | This happens for native ecoff format, where code from included files | |
2004 | gets its own symtab. The symtab for the included file should have | |
2005 | been read in already via the dependency mechanism. | |
2006 | It might be swifter to create several symtabs with the same name | |
2007 | like xcoff does (I'm not sure). | |
2008 | ||
2009 | It also happens for objfiles that have their functions reordered. | |
2010 | For these, the symtab we are looking for is not necessarily read in. */ | |
2011 | ||
11309657 | 2012 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
2013 | { |
2014 | bv = BLOCKVECTOR (s); | |
2015 | b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
c906108c | 2016 | |
c5aa993b | 2017 | if (BLOCK_START (b) <= pc |
c5aa993b | 2018 | && BLOCK_END (b) > pc |
c5aa993b JM |
2019 | && (distance == 0 |
2020 | || BLOCK_END (b) - BLOCK_START (b) < distance)) | |
2021 | { | |
2022 | /* For an objfile that has its functions reordered, | |
2023 | find_pc_psymtab will find the proper partial symbol table | |
2024 | and we simply return its corresponding symtab. */ | |
2025 | /* In order to better support objfiles that contain both | |
2026 | stabs and coff debugging info, we continue on if a psymtab | |
2027 | can't be found. */ | |
2028 | if ((objfile->flags & OBJF_REORDERED) && objfile->psymtabs) | |
2029 | { | |
2030 | ps = find_pc_sect_psymtab (pc, section); | |
2031 | if (ps) | |
2032 | return PSYMTAB_TO_SYMTAB (ps); | |
2033 | } | |
2034 | if (section != 0) | |
2035 | { | |
de4f826b | 2036 | struct dict_iterator iter; |
261397f8 | 2037 | struct symbol *sym = NULL; |
c906108c | 2038 | |
de4f826b | 2039 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 2040 | { |
261397f8 | 2041 | fixup_symbol_section (sym, objfile); |
94277a38 | 2042 | if (matching_bfd_sections (SYMBOL_BFD_SECTION (sym), section)) |
c5aa993b JM |
2043 | break; |
2044 | } | |
de4f826b | 2045 | if (sym == NULL) |
c5aa993b JM |
2046 | continue; /* no symbol in this symtab matches section */ |
2047 | } | |
2048 | distance = BLOCK_END (b) - BLOCK_START (b); | |
2049 | best_s = s; | |
2050 | } | |
2051 | } | |
c906108c SS |
2052 | |
2053 | if (best_s != NULL) | |
c5aa993b | 2054 | return (best_s); |
c906108c SS |
2055 | |
2056 | s = NULL; | |
2057 | ps = find_pc_sect_psymtab (pc, section); | |
2058 | if (ps) | |
2059 | { | |
2060 | if (ps->readin) | |
2061 | /* Might want to error() here (in case symtab is corrupt and | |
2062 | will cause a core dump), but maybe we can successfully | |
2063 | continue, so let's not. */ | |
8a3fe4f8 AC |
2064 | warning (_("\ |
2065 | (Internal error: pc 0x%s in read in psymtab, but not in symtab.)\n"), | |
d730266b | 2066 | paddr_nz (pc)); |
c906108c SS |
2067 | s = PSYMTAB_TO_SYMTAB (ps); |
2068 | } | |
2069 | return (s); | |
2070 | } | |
2071 | ||
2072 | /* Find the symtab associated with PC. Look through the psymtabs and | |
2073 | read in another symtab if necessary. Backward compatibility, no section */ | |
2074 | ||
2075 | struct symtab * | |
fba45db2 | 2076 | find_pc_symtab (CORE_ADDR pc) |
c906108c SS |
2077 | { |
2078 | return find_pc_sect_symtab (pc, find_pc_mapped_section (pc)); | |
2079 | } | |
c906108c | 2080 | \f |
c5aa993b | 2081 | |
7e73cedf | 2082 | /* Find the source file and line number for a given PC value and SECTION. |
c906108c SS |
2083 | Return a structure containing a symtab pointer, a line number, |
2084 | and a pc range for the entire source line. | |
2085 | The value's .pc field is NOT the specified pc. | |
2086 | NOTCURRENT nonzero means, if specified pc is on a line boundary, | |
2087 | use the line that ends there. Otherwise, in that case, the line | |
2088 | that begins there is used. */ | |
2089 | ||
2090 | /* The big complication here is that a line may start in one file, and end just | |
2091 | before the start of another file. This usually occurs when you #include | |
2092 | code in the middle of a subroutine. To properly find the end of a line's PC | |
2093 | range, we must search all symtabs associated with this compilation unit, and | |
2094 | find the one whose first PC is closer than that of the next line in this | |
2095 | symtab. */ | |
2096 | ||
2097 | /* If it's worth the effort, we could be using a binary search. */ | |
2098 | ||
2099 | struct symtab_and_line | |
198beae2 | 2100 | find_pc_sect_line (CORE_ADDR pc, struct bfd_section *section, int notcurrent) |
c906108c SS |
2101 | { |
2102 | struct symtab *s; | |
52f0bd74 AC |
2103 | struct linetable *l; |
2104 | int len; | |
2105 | int i; | |
2106 | struct linetable_entry *item; | |
c906108c SS |
2107 | struct symtab_and_line val; |
2108 | struct blockvector *bv; | |
2109 | struct minimal_symbol *msymbol; | |
2110 | struct minimal_symbol *mfunsym; | |
2111 | ||
2112 | /* Info on best line seen so far, and where it starts, and its file. */ | |
2113 | ||
2114 | struct linetable_entry *best = NULL; | |
2115 | CORE_ADDR best_end = 0; | |
2116 | struct symtab *best_symtab = 0; | |
2117 | ||
2118 | /* Store here the first line number | |
2119 | of a file which contains the line at the smallest pc after PC. | |
2120 | If we don't find a line whose range contains PC, | |
2121 | we will use a line one less than this, | |
2122 | with a range from the start of that file to the first line's pc. */ | |
2123 | struct linetable_entry *alt = NULL; | |
2124 | struct symtab *alt_symtab = 0; | |
2125 | ||
2126 | /* Info on best line seen in this file. */ | |
2127 | ||
2128 | struct linetable_entry *prev; | |
2129 | ||
2130 | /* If this pc is not from the current frame, | |
2131 | it is the address of the end of a call instruction. | |
2132 | Quite likely that is the start of the following statement. | |
2133 | But what we want is the statement containing the instruction. | |
2134 | Fudge the pc to make sure we get that. */ | |
2135 | ||
fe39c653 | 2136 | init_sal (&val); /* initialize to zeroes */ |
c906108c | 2137 | |
b77b1eb7 JB |
2138 | /* It's tempting to assume that, if we can't find debugging info for |
2139 | any function enclosing PC, that we shouldn't search for line | |
2140 | number info, either. However, GAS can emit line number info for | |
2141 | assembly files --- very helpful when debugging hand-written | |
2142 | assembly code. In such a case, we'd have no debug info for the | |
2143 | function, but we would have line info. */ | |
648f4f79 | 2144 | |
c906108c SS |
2145 | if (notcurrent) |
2146 | pc -= 1; | |
2147 | ||
c5aa993b | 2148 | /* elz: added this because this function returned the wrong |
c906108c SS |
2149 | information if the pc belongs to a stub (import/export) |
2150 | to call a shlib function. This stub would be anywhere between | |
2151 | two functions in the target, and the line info was erroneously | |
2152 | taken to be the one of the line before the pc. | |
c5aa993b | 2153 | */ |
c906108c | 2154 | /* RT: Further explanation: |
c5aa993b | 2155 | |
c906108c SS |
2156 | * We have stubs (trampolines) inserted between procedures. |
2157 | * | |
2158 | * Example: "shr1" exists in a shared library, and a "shr1" stub also | |
2159 | * exists in the main image. | |
2160 | * | |
2161 | * In the minimal symbol table, we have a bunch of symbols | |
2162 | * sorted by start address. The stubs are marked as "trampoline", | |
2163 | * the others appear as text. E.g.: | |
2164 | * | |
2165 | * Minimal symbol table for main image | |
2166 | * main: code for main (text symbol) | |
2167 | * shr1: stub (trampoline symbol) | |
2168 | * foo: code for foo (text symbol) | |
2169 | * ... | |
2170 | * Minimal symbol table for "shr1" image: | |
2171 | * ... | |
2172 | * shr1: code for shr1 (text symbol) | |
2173 | * ... | |
2174 | * | |
2175 | * So the code below is trying to detect if we are in the stub | |
2176 | * ("shr1" stub), and if so, find the real code ("shr1" trampoline), | |
2177 | * and if found, do the symbolization from the real-code address | |
2178 | * rather than the stub address. | |
2179 | * | |
2180 | * Assumptions being made about the minimal symbol table: | |
2181 | * 1. lookup_minimal_symbol_by_pc() will return a trampoline only | |
2182 | * if we're really in the trampoline. If we're beyond it (say | |
2183 | * we're in "foo" in the above example), it'll have a closer | |
2184 | * symbol (the "foo" text symbol for example) and will not | |
2185 | * return the trampoline. | |
2186 | * 2. lookup_minimal_symbol_text() will find a real text symbol | |
2187 | * corresponding to the trampoline, and whose address will | |
2188 | * be different than the trampoline address. I put in a sanity | |
2189 | * check for the address being the same, to avoid an | |
2190 | * infinite recursion. | |
2191 | */ | |
c5aa993b JM |
2192 | msymbol = lookup_minimal_symbol_by_pc (pc); |
2193 | if (msymbol != NULL) | |
c906108c | 2194 | if (MSYMBOL_TYPE (msymbol) == mst_solib_trampoline) |
c5aa993b | 2195 | { |
2335f48e | 2196 | mfunsym = lookup_minimal_symbol_text (SYMBOL_LINKAGE_NAME (msymbol), |
5520a790 | 2197 | NULL); |
c5aa993b JM |
2198 | if (mfunsym == NULL) |
2199 | /* I eliminated this warning since it is coming out | |
2200 | * in the following situation: | |
2201 | * gdb shmain // test program with shared libraries | |
2202 | * (gdb) break shr1 // function in shared lib | |
2203 | * Warning: In stub for ... | |
2204 | * In the above situation, the shared lib is not loaded yet, | |
2205 | * so of course we can't find the real func/line info, | |
2206 | * but the "break" still works, and the warning is annoying. | |
2207 | * So I commented out the warning. RT */ | |
2335f48e | 2208 | /* warning ("In stub for %s; unable to find real function/line info", SYMBOL_LINKAGE_NAME (msymbol)) */ ; |
c5aa993b | 2209 | /* fall through */ |
82cf6c60 | 2210 | else if (SYMBOL_VALUE_ADDRESS (mfunsym) == SYMBOL_VALUE_ADDRESS (msymbol)) |
c5aa993b JM |
2211 | /* Avoid infinite recursion */ |
2212 | /* See above comment about why warning is commented out */ | |
2335f48e | 2213 | /* warning ("In stub for %s; unable to find real function/line info", SYMBOL_LINKAGE_NAME (msymbol)) */ ; |
c5aa993b JM |
2214 | /* fall through */ |
2215 | else | |
82cf6c60 | 2216 | return find_pc_line (SYMBOL_VALUE_ADDRESS (mfunsym), 0); |
c5aa993b | 2217 | } |
c906108c SS |
2218 | |
2219 | ||
2220 | s = find_pc_sect_symtab (pc, section); | |
2221 | if (!s) | |
2222 | { | |
2223 | /* if no symbol information, return previous pc */ | |
2224 | if (notcurrent) | |
2225 | pc++; | |
2226 | val.pc = pc; | |
2227 | return val; | |
2228 | } | |
2229 | ||
2230 | bv = BLOCKVECTOR (s); | |
2231 | ||
2232 | /* Look at all the symtabs that share this blockvector. | |
2233 | They all have the same apriori range, that we found was right; | |
2234 | but they have different line tables. */ | |
2235 | ||
2236 | for (; s && BLOCKVECTOR (s) == bv; s = s->next) | |
2237 | { | |
2238 | /* Find the best line in this symtab. */ | |
2239 | l = LINETABLE (s); | |
2240 | if (!l) | |
c5aa993b | 2241 | continue; |
c906108c SS |
2242 | len = l->nitems; |
2243 | if (len <= 0) | |
2244 | { | |
2245 | /* I think len can be zero if the symtab lacks line numbers | |
2246 | (e.g. gcc -g1). (Either that or the LINETABLE is NULL; | |
2247 | I'm not sure which, and maybe it depends on the symbol | |
2248 | reader). */ | |
2249 | continue; | |
2250 | } | |
2251 | ||
2252 | prev = NULL; | |
2253 | item = l->item; /* Get first line info */ | |
2254 | ||
2255 | /* Is this file's first line closer than the first lines of other files? | |
c5aa993b | 2256 | If so, record this file, and its first line, as best alternate. */ |
c906108c SS |
2257 | if (item->pc > pc && (!alt || item->pc < alt->pc)) |
2258 | { | |
2259 | alt = item; | |
2260 | alt_symtab = s; | |
2261 | } | |
2262 | ||
2263 | for (i = 0; i < len; i++, item++) | |
2264 | { | |
2265 | /* Leave prev pointing to the linetable entry for the last line | |
2266 | that started at or before PC. */ | |
2267 | if (item->pc > pc) | |
2268 | break; | |
2269 | ||
2270 | prev = item; | |
2271 | } | |
2272 | ||
2273 | /* At this point, prev points at the line whose start addr is <= pc, and | |
c5aa993b JM |
2274 | item points at the next line. If we ran off the end of the linetable |
2275 | (pc >= start of the last line), then prev == item. If pc < start of | |
2276 | the first line, prev will not be set. */ | |
c906108c SS |
2277 | |
2278 | /* Is this file's best line closer than the best in the other files? | |
083ae935 DJ |
2279 | If so, record this file, and its best line, as best so far. Don't |
2280 | save prev if it represents the end of a function (i.e. line number | |
2281 | 0) instead of a real line. */ | |
c906108c | 2282 | |
083ae935 | 2283 | if (prev && prev->line && (!best || prev->pc > best->pc)) |
c906108c SS |
2284 | { |
2285 | best = prev; | |
2286 | best_symtab = s; | |
25d53da1 KB |
2287 | |
2288 | /* Discard BEST_END if it's before the PC of the current BEST. */ | |
2289 | if (best_end <= best->pc) | |
2290 | best_end = 0; | |
c906108c | 2291 | } |
25d53da1 KB |
2292 | |
2293 | /* If another line (denoted by ITEM) is in the linetable and its | |
2294 | PC is after BEST's PC, but before the current BEST_END, then | |
2295 | use ITEM's PC as the new best_end. */ | |
2296 | if (best && i < len && item->pc > best->pc | |
2297 | && (best_end == 0 || best_end > item->pc)) | |
2298 | best_end = item->pc; | |
c906108c SS |
2299 | } |
2300 | ||
2301 | if (!best_symtab) | |
2302 | { | |
e86e87f7 DJ |
2303 | /* If we didn't find any line number info, just return zeros. |
2304 | We used to return alt->line - 1 here, but that could be | |
2305 | anywhere; if we don't have line number info for this PC, | |
2306 | don't make some up. */ | |
2307 | val.pc = pc; | |
c906108c | 2308 | } |
e8717518 FF |
2309 | else if (best->line == 0) |
2310 | { | |
2311 | /* If our best fit is in a range of PC's for which no line | |
2312 | number info is available (line number is zero) then we didn't | |
2313 | find any valid line information. */ | |
2314 | val.pc = pc; | |
2315 | } | |
c906108c SS |
2316 | else |
2317 | { | |
2318 | val.symtab = best_symtab; | |
2319 | val.line = best->line; | |
2320 | val.pc = best->pc; | |
2321 | if (best_end && (!alt || best_end < alt->pc)) | |
2322 | val.end = best_end; | |
2323 | else if (alt) | |
2324 | val.end = alt->pc; | |
2325 | else | |
2326 | val.end = BLOCK_END (BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK)); | |
2327 | } | |
2328 | val.section = section; | |
2329 | return val; | |
2330 | } | |
2331 | ||
2332 | /* Backward compatibility (no section) */ | |
2333 | ||
2334 | struct symtab_and_line | |
fba45db2 | 2335 | find_pc_line (CORE_ADDR pc, int notcurrent) |
c906108c | 2336 | { |
c5aa993b | 2337 | asection *section; |
c906108c SS |
2338 | |
2339 | section = find_pc_overlay (pc); | |
2340 | if (pc_in_unmapped_range (pc, section)) | |
2341 | pc = overlay_mapped_address (pc, section); | |
2342 | return find_pc_sect_line (pc, section, notcurrent); | |
2343 | } | |
c906108c | 2344 | \f |
c906108c SS |
2345 | /* Find line number LINE in any symtab whose name is the same as |
2346 | SYMTAB. | |
2347 | ||
2348 | If found, return the symtab that contains the linetable in which it was | |
2349 | found, set *INDEX to the index in the linetable of the best entry | |
2350 | found, and set *EXACT_MATCH nonzero if the value returned is an | |
2351 | exact match. | |
2352 | ||
2353 | If not found, return NULL. */ | |
2354 | ||
50641945 | 2355 | struct symtab * |
fba45db2 | 2356 | find_line_symtab (struct symtab *symtab, int line, int *index, int *exact_match) |
c906108c SS |
2357 | { |
2358 | int exact; | |
2359 | ||
2360 | /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE | |
2361 | so far seen. */ | |
2362 | ||
2363 | int best_index; | |
2364 | struct linetable *best_linetable; | |
2365 | struct symtab *best_symtab; | |
2366 | ||
2367 | /* First try looking it up in the given symtab. */ | |
2368 | best_linetable = LINETABLE (symtab); | |
2369 | best_symtab = symtab; | |
2370 | best_index = find_line_common (best_linetable, line, &exact); | |
2371 | if (best_index < 0 || !exact) | |
2372 | { | |
2373 | /* Didn't find an exact match. So we better keep looking for | |
c5aa993b JM |
2374 | another symtab with the same name. In the case of xcoff, |
2375 | multiple csects for one source file (produced by IBM's FORTRAN | |
2376 | compiler) produce multiple symtabs (this is unavoidable | |
2377 | assuming csects can be at arbitrary places in memory and that | |
2378 | the GLOBAL_BLOCK of a symtab has a begin and end address). */ | |
c906108c SS |
2379 | |
2380 | /* BEST is the smallest linenumber > LINE so far seen, | |
c5aa993b JM |
2381 | or 0 if none has been seen so far. |
2382 | BEST_INDEX and BEST_LINETABLE identify the item for it. */ | |
c906108c SS |
2383 | int best; |
2384 | ||
2385 | struct objfile *objfile; | |
2386 | struct symtab *s; | |
51432cca | 2387 | struct partial_symtab *p; |
c906108c SS |
2388 | |
2389 | if (best_index >= 0) | |
2390 | best = best_linetable->item[best_index].line; | |
2391 | else | |
2392 | best = 0; | |
2393 | ||
51432cca CES |
2394 | ALL_PSYMTABS (objfile, p) |
2395 | { | |
2396 | if (strcmp (symtab->filename, p->filename) != 0) | |
2397 | continue; | |
2398 | PSYMTAB_TO_SYMTAB (p); | |
2399 | } | |
2400 | ||
c906108c | 2401 | ALL_SYMTABS (objfile, s) |
c5aa993b JM |
2402 | { |
2403 | struct linetable *l; | |
2404 | int ind; | |
c906108c | 2405 | |
6314a349 | 2406 | if (strcmp (symtab->filename, s->filename) != 0) |
c5aa993b JM |
2407 | continue; |
2408 | l = LINETABLE (s); | |
2409 | ind = find_line_common (l, line, &exact); | |
2410 | if (ind >= 0) | |
2411 | { | |
2412 | if (exact) | |
2413 | { | |
2414 | best_index = ind; | |
2415 | best_linetable = l; | |
2416 | best_symtab = s; | |
2417 | goto done; | |
2418 | } | |
2419 | if (best == 0 || l->item[ind].line < best) | |
2420 | { | |
2421 | best = l->item[ind].line; | |
2422 | best_index = ind; | |
2423 | best_linetable = l; | |
2424 | best_symtab = s; | |
2425 | } | |
2426 | } | |
2427 | } | |
c906108c | 2428 | } |
c5aa993b | 2429 | done: |
c906108c SS |
2430 | if (best_index < 0) |
2431 | return NULL; | |
2432 | ||
2433 | if (index) | |
2434 | *index = best_index; | |
2435 | if (exact_match) | |
2436 | *exact_match = exact; | |
2437 | ||
2438 | return best_symtab; | |
2439 | } | |
2440 | \f | |
2441 | /* Set the PC value for a given source file and line number and return true. | |
2442 | Returns zero for invalid line number (and sets the PC to 0). | |
2443 | The source file is specified with a struct symtab. */ | |
2444 | ||
2445 | int | |
fba45db2 | 2446 | find_line_pc (struct symtab *symtab, int line, CORE_ADDR *pc) |
c906108c SS |
2447 | { |
2448 | struct linetable *l; | |
2449 | int ind; | |
2450 | ||
2451 | *pc = 0; | |
2452 | if (symtab == 0) | |
2453 | return 0; | |
2454 | ||
2455 | symtab = find_line_symtab (symtab, line, &ind, NULL); | |
2456 | if (symtab != NULL) | |
2457 | { | |
2458 | l = LINETABLE (symtab); | |
2459 | *pc = l->item[ind].pc; | |
2460 | return 1; | |
2461 | } | |
2462 | else | |
2463 | return 0; | |
2464 | } | |
2465 | ||
2466 | /* Find the range of pc values in a line. | |
2467 | Store the starting pc of the line into *STARTPTR | |
2468 | and the ending pc (start of next line) into *ENDPTR. | |
2469 | Returns 1 to indicate success. | |
2470 | Returns 0 if could not find the specified line. */ | |
2471 | ||
2472 | int | |
fba45db2 KB |
2473 | find_line_pc_range (struct symtab_and_line sal, CORE_ADDR *startptr, |
2474 | CORE_ADDR *endptr) | |
c906108c SS |
2475 | { |
2476 | CORE_ADDR startaddr; | |
2477 | struct symtab_and_line found_sal; | |
2478 | ||
2479 | startaddr = sal.pc; | |
c5aa993b | 2480 | if (startaddr == 0 && !find_line_pc (sal.symtab, sal.line, &startaddr)) |
c906108c SS |
2481 | return 0; |
2482 | ||
2483 | /* This whole function is based on address. For example, if line 10 has | |
2484 | two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then | |
2485 | "info line *0x123" should say the line goes from 0x100 to 0x200 | |
2486 | and "info line *0x355" should say the line goes from 0x300 to 0x400. | |
2487 | This also insures that we never give a range like "starts at 0x134 | |
2488 | and ends at 0x12c". */ | |
2489 | ||
2490 | found_sal = find_pc_sect_line (startaddr, sal.section, 0); | |
2491 | if (found_sal.line != sal.line) | |
2492 | { | |
2493 | /* The specified line (sal) has zero bytes. */ | |
2494 | *startptr = found_sal.pc; | |
2495 | *endptr = found_sal.pc; | |
2496 | } | |
2497 | else | |
2498 | { | |
2499 | *startptr = found_sal.pc; | |
2500 | *endptr = found_sal.end; | |
2501 | } | |
2502 | return 1; | |
2503 | } | |
2504 | ||
2505 | /* Given a line table and a line number, return the index into the line | |
2506 | table for the pc of the nearest line whose number is >= the specified one. | |
2507 | Return -1 if none is found. The value is >= 0 if it is an index. | |
2508 | ||
2509 | Set *EXACT_MATCH nonzero if the value returned is an exact match. */ | |
2510 | ||
2511 | static int | |
aa1ee363 | 2512 | find_line_common (struct linetable *l, int lineno, |
fba45db2 | 2513 | int *exact_match) |
c906108c | 2514 | { |
52f0bd74 AC |
2515 | int i; |
2516 | int len; | |
c906108c SS |
2517 | |
2518 | /* BEST is the smallest linenumber > LINENO so far seen, | |
2519 | or 0 if none has been seen so far. | |
2520 | BEST_INDEX identifies the item for it. */ | |
2521 | ||
2522 | int best_index = -1; | |
2523 | int best = 0; | |
2524 | ||
b7589f7d DJ |
2525 | *exact_match = 0; |
2526 | ||
c906108c SS |
2527 | if (lineno <= 0) |
2528 | return -1; | |
2529 | if (l == 0) | |
2530 | return -1; | |
2531 | ||
2532 | len = l->nitems; | |
2533 | for (i = 0; i < len; i++) | |
2534 | { | |
aa1ee363 | 2535 | struct linetable_entry *item = &(l->item[i]); |
c906108c SS |
2536 | |
2537 | if (item->line == lineno) | |
2538 | { | |
2539 | /* Return the first (lowest address) entry which matches. */ | |
2540 | *exact_match = 1; | |
2541 | return i; | |
2542 | } | |
2543 | ||
2544 | if (item->line > lineno && (best == 0 || item->line < best)) | |
2545 | { | |
2546 | best = item->line; | |
2547 | best_index = i; | |
2548 | } | |
2549 | } | |
2550 | ||
2551 | /* If we got here, we didn't get an exact match. */ | |
c906108c SS |
2552 | return best_index; |
2553 | } | |
2554 | ||
2555 | int | |
fba45db2 | 2556 | find_pc_line_pc_range (CORE_ADDR pc, CORE_ADDR *startptr, CORE_ADDR *endptr) |
c906108c SS |
2557 | { |
2558 | struct symtab_and_line sal; | |
2559 | sal = find_pc_line (pc, 0); | |
2560 | *startptr = sal.pc; | |
2561 | *endptr = sal.end; | |
2562 | return sal.symtab != 0; | |
2563 | } | |
2564 | ||
bccdca4a UW |
2565 | /* Given a function start address PC and SECTION, find the first |
2566 | address after the function prologue. */ | |
2567 | CORE_ADDR | |
2568 | find_function_start_pc (struct gdbarch *gdbarch, | |
2569 | CORE_ADDR pc, asection *section) | |
2570 | { | |
2571 | /* If the function is in an unmapped overlay, use its unmapped LMA address, | |
2572 | so that gdbarch_skip_prologue has something unique to work on. */ | |
2573 | if (section_is_overlay (section) && !section_is_mapped (section)) | |
2574 | pc = overlay_unmapped_address (pc, section); | |
2575 | ||
2576 | pc += gdbarch_deprecated_function_start_offset (gdbarch); | |
2577 | pc = gdbarch_skip_prologue (gdbarch, pc); | |
2578 | ||
2579 | /* For overlays, map pc back into its mapped VMA range. */ | |
2580 | pc = overlay_mapped_address (pc, section); | |
2581 | ||
2582 | return pc; | |
2583 | } | |
2584 | ||
c906108c SS |
2585 | /* Given a function symbol SYM, find the symtab and line for the start |
2586 | of the function. | |
2587 | If the argument FUNFIRSTLINE is nonzero, we want the first line | |
2588 | of real code inside the function. */ | |
2589 | ||
50641945 | 2590 | struct symtab_and_line |
fba45db2 | 2591 | find_function_start_sal (struct symbol *sym, int funfirstline) |
c906108c | 2592 | { |
bccdca4a UW |
2593 | struct block *block = SYMBOL_BLOCK_VALUE (sym); |
2594 | struct objfile *objfile = lookup_objfile_from_block (block); | |
2595 | struct gdbarch *gdbarch = get_objfile_arch (objfile); | |
2596 | ||
c906108c SS |
2597 | CORE_ADDR pc; |
2598 | struct symtab_and_line sal; | |
2599 | ||
bccdca4a UW |
2600 | pc = BLOCK_START (block); |
2601 | fixup_symbol_section (sym, objfile); | |
c906108c | 2602 | if (funfirstline) |
bccdca4a UW |
2603 | { |
2604 | /* Skip "first line" of function (which is actually its prologue). */ | |
2605 | pc = find_function_start_pc (gdbarch, pc, SYMBOL_BFD_SECTION (sym)); | |
c906108c SS |
2606 | } |
2607 | sal = find_pc_sect_line (pc, SYMBOL_BFD_SECTION (sym), 0); | |
2608 | ||
a433963d | 2609 | /* Check if gdbarch_skip_prologue left us in mid-line, and the next |
c906108c SS |
2610 | line is still part of the same function. */ |
2611 | if (sal.pc != pc | |
bccdca4a UW |
2612 | && BLOCK_START (block) <= sal.end |
2613 | && sal.end < BLOCK_END (block)) | |
c906108c SS |
2614 | { |
2615 | /* First pc of next line */ | |
2616 | pc = sal.end; | |
2617 | /* Recalculate the line number (might not be N+1). */ | |
2618 | sal = find_pc_sect_line (pc, SYMBOL_BFD_SECTION (sym), 0); | |
2619 | } | |
4309257c PM |
2620 | |
2621 | /* On targets with executable formats that don't have a concept of | |
2622 | constructors (ELF with .init has, PE doesn't), gcc emits a call | |
2623 | to `__main' in `main' between the prologue and before user | |
2624 | code. */ | |
2625 | if (funfirstline | |
2626 | && gdbarch_skip_main_prologue_p (current_gdbarch) | |
2627 | && SYMBOL_LINKAGE_NAME (sym) | |
2628 | && strcmp (SYMBOL_LINKAGE_NAME (sym), "main") == 0) | |
2629 | { | |
2630 | pc = gdbarch_skip_main_prologue (current_gdbarch, pc); | |
2631 | /* Recalculate the line number (might not be N+1). */ | |
2632 | sal = find_pc_sect_line (pc, SYMBOL_BFD_SECTION (sym), 0); | |
2633 | } | |
2634 | ||
c906108c | 2635 | sal.pc = pc; |
c906108c SS |
2636 | |
2637 | return sal; | |
2638 | } | |
50641945 | 2639 | |
c906108c SS |
2640 | /* If P is of the form "operator[ \t]+..." where `...' is |
2641 | some legitimate operator text, return a pointer to the | |
2642 | beginning of the substring of the operator text. | |
2643 | Otherwise, return "". */ | |
2644 | char * | |
fba45db2 | 2645 | operator_chars (char *p, char **end) |
c906108c SS |
2646 | { |
2647 | *end = ""; | |
2648 | if (strncmp (p, "operator", 8)) | |
2649 | return *end; | |
2650 | p += 8; | |
2651 | ||
2652 | /* Don't get faked out by `operator' being part of a longer | |
2653 | identifier. */ | |
c5aa993b | 2654 | if (isalpha (*p) || *p == '_' || *p == '$' || *p == '\0') |
c906108c SS |
2655 | return *end; |
2656 | ||
2657 | /* Allow some whitespace between `operator' and the operator symbol. */ | |
2658 | while (*p == ' ' || *p == '\t') | |
2659 | p++; | |
2660 | ||
2661 | /* Recognize 'operator TYPENAME'. */ | |
2662 | ||
c5aa993b | 2663 | if (isalpha (*p) || *p == '_' || *p == '$') |
c906108c | 2664 | { |
aa1ee363 | 2665 | char *q = p + 1; |
c5aa993b | 2666 | while (isalnum (*q) || *q == '_' || *q == '$') |
c906108c SS |
2667 | q++; |
2668 | *end = q; | |
2669 | return p; | |
2670 | } | |
2671 | ||
53e8ad3d MS |
2672 | while (*p) |
2673 | switch (*p) | |
2674 | { | |
2675 | case '\\': /* regexp quoting */ | |
2676 | if (p[1] == '*') | |
2677 | { | |
2678 | if (p[2] == '=') /* 'operator\*=' */ | |
2679 | *end = p + 3; | |
2680 | else /* 'operator\*' */ | |
2681 | *end = p + 2; | |
2682 | return p; | |
2683 | } | |
2684 | else if (p[1] == '[') | |
2685 | { | |
2686 | if (p[2] == ']') | |
8a3fe4f8 | 2687 | error (_("mismatched quoting on brackets, try 'operator\\[\\]'")); |
53e8ad3d MS |
2688 | else if (p[2] == '\\' && p[3] == ']') |
2689 | { | |
2690 | *end = p + 4; /* 'operator\[\]' */ | |
2691 | return p; | |
2692 | } | |
2693 | else | |
8a3fe4f8 | 2694 | error (_("nothing is allowed between '[' and ']'")); |
53e8ad3d MS |
2695 | } |
2696 | else | |
2697 | { | |
2698 | /* Gratuitous qoute: skip it and move on. */ | |
2699 | p++; | |
2700 | continue; | |
2701 | } | |
2702 | break; | |
2703 | case '!': | |
2704 | case '=': | |
2705 | case '*': | |
2706 | case '/': | |
2707 | case '%': | |
2708 | case '^': | |
2709 | if (p[1] == '=') | |
2710 | *end = p + 2; | |
2711 | else | |
2712 | *end = p + 1; | |
2713 | return p; | |
2714 | case '<': | |
2715 | case '>': | |
2716 | case '+': | |
2717 | case '-': | |
2718 | case '&': | |
2719 | case '|': | |
2720 | if (p[0] == '-' && p[1] == '>') | |
2721 | { | |
2722 | /* Struct pointer member operator 'operator->'. */ | |
2723 | if (p[2] == '*') | |
2724 | { | |
2725 | *end = p + 3; /* 'operator->*' */ | |
2726 | return p; | |
2727 | } | |
2728 | else if (p[2] == '\\') | |
2729 | { | |
2730 | *end = p + 4; /* Hopefully 'operator->\*' */ | |
2731 | return p; | |
2732 | } | |
2733 | else | |
2734 | { | |
2735 | *end = p + 2; /* 'operator->' */ | |
2736 | return p; | |
2737 | } | |
2738 | } | |
2739 | if (p[1] == '=' || p[1] == p[0]) | |
2740 | *end = p + 2; | |
2741 | else | |
2742 | *end = p + 1; | |
2743 | return p; | |
2744 | case '~': | |
2745 | case ',': | |
c5aa993b | 2746 | *end = p + 1; |
53e8ad3d MS |
2747 | return p; |
2748 | case '(': | |
2749 | if (p[1] != ')') | |
8a3fe4f8 | 2750 | error (_("`operator ()' must be specified without whitespace in `()'")); |
c5aa993b | 2751 | *end = p + 2; |
53e8ad3d MS |
2752 | return p; |
2753 | case '?': | |
2754 | if (p[1] != ':') | |
8a3fe4f8 | 2755 | error (_("`operator ?:' must be specified without whitespace in `?:'")); |
53e8ad3d MS |
2756 | *end = p + 2; |
2757 | return p; | |
2758 | case '[': | |
2759 | if (p[1] != ']') | |
8a3fe4f8 | 2760 | error (_("`operator []' must be specified without whitespace in `[]'")); |
53e8ad3d MS |
2761 | *end = p + 2; |
2762 | return p; | |
2763 | default: | |
8a3fe4f8 | 2764 | error (_("`operator %s' not supported"), p); |
53e8ad3d MS |
2765 | break; |
2766 | } | |
2767 | ||
c906108c SS |
2768 | *end = ""; |
2769 | return *end; | |
2770 | } | |
c906108c | 2771 | \f |
c5aa993b | 2772 | |
c94fdfd0 EZ |
2773 | /* If FILE is not already in the table of files, return zero; |
2774 | otherwise return non-zero. Optionally add FILE to the table if ADD | |
2775 | is non-zero. If *FIRST is non-zero, forget the old table | |
2776 | contents. */ | |
2777 | static int | |
2778 | filename_seen (const char *file, int add, int *first) | |
c906108c | 2779 | { |
c94fdfd0 EZ |
2780 | /* Table of files seen so far. */ |
2781 | static const char **tab = NULL; | |
c906108c SS |
2782 | /* Allocated size of tab in elements. |
2783 | Start with one 256-byte block (when using GNU malloc.c). | |
2784 | 24 is the malloc overhead when range checking is in effect. */ | |
2785 | static int tab_alloc_size = (256 - 24) / sizeof (char *); | |
2786 | /* Current size of tab in elements. */ | |
2787 | static int tab_cur_size; | |
c94fdfd0 | 2788 | const char **p; |
c906108c SS |
2789 | |
2790 | if (*first) | |
2791 | { | |
2792 | if (tab == NULL) | |
c94fdfd0 | 2793 | tab = (const char **) xmalloc (tab_alloc_size * sizeof (*tab)); |
c906108c SS |
2794 | tab_cur_size = 0; |
2795 | } | |
2796 | ||
c94fdfd0 | 2797 | /* Is FILE in tab? */ |
c906108c | 2798 | for (p = tab; p < tab + tab_cur_size; p++) |
c94fdfd0 EZ |
2799 | if (strcmp (*p, file) == 0) |
2800 | return 1; | |
2801 | ||
2802 | /* No; maybe add it to tab. */ | |
2803 | if (add) | |
c906108c | 2804 | { |
c94fdfd0 EZ |
2805 | if (tab_cur_size == tab_alloc_size) |
2806 | { | |
2807 | tab_alloc_size *= 2; | |
2808 | tab = (const char **) xrealloc ((char *) tab, | |
2809 | tab_alloc_size * sizeof (*tab)); | |
2810 | } | |
2811 | tab[tab_cur_size++] = file; | |
c906108c | 2812 | } |
c906108c | 2813 | |
c94fdfd0 EZ |
2814 | return 0; |
2815 | } | |
2816 | ||
2817 | /* Slave routine for sources_info. Force line breaks at ,'s. | |
2818 | NAME is the name to print and *FIRST is nonzero if this is the first | |
2819 | name printed. Set *FIRST to zero. */ | |
2820 | static void | |
d092d1a2 | 2821 | output_source_filename (const char *name, int *first) |
c94fdfd0 EZ |
2822 | { |
2823 | /* Since a single source file can result in several partial symbol | |
2824 | tables, we need to avoid printing it more than once. Note: if | |
2825 | some of the psymtabs are read in and some are not, it gets | |
2826 | printed both under "Source files for which symbols have been | |
2827 | read" and "Source files for which symbols will be read in on | |
2828 | demand". I consider this a reasonable way to deal with the | |
2829 | situation. I'm not sure whether this can also happen for | |
2830 | symtabs; it doesn't hurt to check. */ | |
2831 | ||
2832 | /* Was NAME already seen? */ | |
2833 | if (filename_seen (name, 1, first)) | |
2834 | { | |
2835 | /* Yes; don't print it again. */ | |
2836 | return; | |
2837 | } | |
2838 | /* No; print it and reset *FIRST. */ | |
c906108c SS |
2839 | if (*first) |
2840 | { | |
2841 | *first = 0; | |
2842 | } | |
2843 | else | |
2844 | { | |
2845 | printf_filtered (", "); | |
2846 | } | |
2847 | ||
2848 | wrap_here (""); | |
2849 | fputs_filtered (name, gdb_stdout); | |
c5aa993b | 2850 | } |
c906108c SS |
2851 | |
2852 | static void | |
fba45db2 | 2853 | sources_info (char *ignore, int from_tty) |
c906108c | 2854 | { |
52f0bd74 AC |
2855 | struct symtab *s; |
2856 | struct partial_symtab *ps; | |
2857 | struct objfile *objfile; | |
c906108c | 2858 | int first; |
c5aa993b | 2859 | |
c906108c SS |
2860 | if (!have_full_symbols () && !have_partial_symbols ()) |
2861 | { | |
8a3fe4f8 | 2862 | error (_("No symbol table is loaded. Use the \"file\" command.")); |
c906108c | 2863 | } |
c5aa993b | 2864 | |
c906108c SS |
2865 | printf_filtered ("Source files for which symbols have been read in:\n\n"); |
2866 | ||
2867 | first = 1; | |
2868 | ALL_SYMTABS (objfile, s) | |
c5aa993b | 2869 | { |
d092d1a2 DJ |
2870 | const char *fullname = symtab_to_fullname (s); |
2871 | output_source_filename (fullname ? fullname : s->filename, &first); | |
c5aa993b | 2872 | } |
c906108c | 2873 | printf_filtered ("\n\n"); |
c5aa993b | 2874 | |
c906108c SS |
2875 | printf_filtered ("Source files for which symbols will be read in on demand:\n\n"); |
2876 | ||
2877 | first = 1; | |
2878 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
2879 | { |
2880 | if (!ps->readin) | |
2881 | { | |
d092d1a2 DJ |
2882 | const char *fullname = psymtab_to_fullname (ps); |
2883 | output_source_filename (fullname ? fullname : ps->filename, &first); | |
c5aa993b JM |
2884 | } |
2885 | } | |
c906108c SS |
2886 | printf_filtered ("\n"); |
2887 | } | |
2888 | ||
2889 | static int | |
fd118b61 | 2890 | file_matches (char *file, char *files[], int nfiles) |
c906108c SS |
2891 | { |
2892 | int i; | |
2893 | ||
2894 | if (file != NULL && nfiles != 0) | |
2895 | { | |
2896 | for (i = 0; i < nfiles; i++) | |
c5aa993b | 2897 | { |
31889e00 | 2898 | if (strcmp (files[i], lbasename (file)) == 0) |
c5aa993b JM |
2899 | return 1; |
2900 | } | |
c906108c SS |
2901 | } |
2902 | else if (nfiles == 0) | |
2903 | return 1; | |
2904 | return 0; | |
2905 | } | |
2906 | ||
2907 | /* Free any memory associated with a search. */ | |
2908 | void | |
fba45db2 | 2909 | free_search_symbols (struct symbol_search *symbols) |
c906108c SS |
2910 | { |
2911 | struct symbol_search *p; | |
2912 | struct symbol_search *next; | |
2913 | ||
2914 | for (p = symbols; p != NULL; p = next) | |
2915 | { | |
2916 | next = p->next; | |
b8c9b27d | 2917 | xfree (p); |
c906108c SS |
2918 | } |
2919 | } | |
2920 | ||
5bd98722 AC |
2921 | static void |
2922 | do_free_search_symbols_cleanup (void *symbols) | |
2923 | { | |
2924 | free_search_symbols (symbols); | |
2925 | } | |
2926 | ||
2927 | struct cleanup * | |
2928 | make_cleanup_free_search_symbols (struct symbol_search *symbols) | |
2929 | { | |
2930 | return make_cleanup (do_free_search_symbols_cleanup, symbols); | |
2931 | } | |
2932 | ||
434d2d4f DJ |
2933 | /* Helper function for sort_search_symbols and qsort. Can only |
2934 | sort symbols, not minimal symbols. */ | |
2935 | static int | |
2936 | compare_search_syms (const void *sa, const void *sb) | |
2937 | { | |
2938 | struct symbol_search **sym_a = (struct symbol_search **) sa; | |
2939 | struct symbol_search **sym_b = (struct symbol_search **) sb; | |
2940 | ||
de5ad195 DC |
2941 | return strcmp (SYMBOL_PRINT_NAME ((*sym_a)->symbol), |
2942 | SYMBOL_PRINT_NAME ((*sym_b)->symbol)); | |
434d2d4f DJ |
2943 | } |
2944 | ||
2945 | /* Sort the ``nfound'' symbols in the list after prevtail. Leave | |
2946 | prevtail where it is, but update its next pointer to point to | |
2947 | the first of the sorted symbols. */ | |
2948 | static struct symbol_search * | |
2949 | sort_search_symbols (struct symbol_search *prevtail, int nfound) | |
2950 | { | |
2951 | struct symbol_search **symbols, *symp, *old_next; | |
2952 | int i; | |
2953 | ||
2954 | symbols = (struct symbol_search **) xmalloc (sizeof (struct symbol_search *) | |
2955 | * nfound); | |
2956 | symp = prevtail->next; | |
2957 | for (i = 0; i < nfound; i++) | |
2958 | { | |
2959 | symbols[i] = symp; | |
2960 | symp = symp->next; | |
2961 | } | |
2962 | /* Generally NULL. */ | |
2963 | old_next = symp; | |
2964 | ||
2965 | qsort (symbols, nfound, sizeof (struct symbol_search *), | |
2966 | compare_search_syms); | |
2967 | ||
2968 | symp = prevtail; | |
2969 | for (i = 0; i < nfound; i++) | |
2970 | { | |
2971 | symp->next = symbols[i]; | |
2972 | symp = symp->next; | |
2973 | } | |
2974 | symp->next = old_next; | |
2975 | ||
8ed32cc0 | 2976 | xfree (symbols); |
434d2d4f DJ |
2977 | return symp; |
2978 | } | |
5bd98722 | 2979 | |
c906108c SS |
2980 | /* Search the symbol table for matches to the regular expression REGEXP, |
2981 | returning the results in *MATCHES. | |
2982 | ||
2983 | Only symbols of KIND are searched: | |
176620f1 EZ |
2984 | FUNCTIONS_DOMAIN - search all functions |
2985 | TYPES_DOMAIN - search all type names | |
2986 | METHODS_DOMAIN - search all methods NOT IMPLEMENTED | |
2987 | VARIABLES_DOMAIN - search all symbols, excluding functions, type names, | |
c5aa993b | 2988 | and constants (enums) |
c906108c SS |
2989 | |
2990 | free_search_symbols should be called when *MATCHES is no longer needed. | |
434d2d4f DJ |
2991 | |
2992 | The results are sorted locally; each symtab's global and static blocks are | |
2993 | separately alphabetized. | |
c5aa993b | 2994 | */ |
c906108c | 2995 | void |
176620f1 | 2996 | search_symbols (char *regexp, domain_enum kind, int nfiles, char *files[], |
fd118b61 | 2997 | struct symbol_search **matches) |
c906108c | 2998 | { |
52f0bd74 AC |
2999 | struct symtab *s; |
3000 | struct partial_symtab *ps; | |
3001 | struct blockvector *bv; | |
52f0bd74 AC |
3002 | struct block *b; |
3003 | int i = 0; | |
de4f826b | 3004 | struct dict_iterator iter; |
52f0bd74 | 3005 | struct symbol *sym; |
c906108c SS |
3006 | struct partial_symbol **psym; |
3007 | struct objfile *objfile; | |
3008 | struct minimal_symbol *msymbol; | |
3009 | char *val; | |
3010 | int found_misc = 0; | |
3011 | static enum minimal_symbol_type types[] | |
c5aa993b JM |
3012 | = |
3013 | {mst_data, mst_text, mst_abs, mst_unknown}; | |
c906108c | 3014 | static enum minimal_symbol_type types2[] |
c5aa993b JM |
3015 | = |
3016 | {mst_bss, mst_file_text, mst_abs, mst_unknown}; | |
c906108c | 3017 | static enum minimal_symbol_type types3[] |
c5aa993b JM |
3018 | = |
3019 | {mst_file_data, mst_solib_trampoline, mst_abs, mst_unknown}; | |
c906108c | 3020 | static enum minimal_symbol_type types4[] |
c5aa993b JM |
3021 | = |
3022 | {mst_file_bss, mst_text, mst_abs, mst_unknown}; | |
c906108c SS |
3023 | enum minimal_symbol_type ourtype; |
3024 | enum minimal_symbol_type ourtype2; | |
3025 | enum minimal_symbol_type ourtype3; | |
3026 | enum minimal_symbol_type ourtype4; | |
3027 | struct symbol_search *sr; | |
3028 | struct symbol_search *psr; | |
3029 | struct symbol_search *tail; | |
3030 | struct cleanup *old_chain = NULL; | |
3031 | ||
176620f1 | 3032 | if (kind < VARIABLES_DOMAIN) |
8a3fe4f8 | 3033 | error (_("must search on specific domain")); |
c906108c | 3034 | |
176620f1 EZ |
3035 | ourtype = types[(int) (kind - VARIABLES_DOMAIN)]; |
3036 | ourtype2 = types2[(int) (kind - VARIABLES_DOMAIN)]; | |
3037 | ourtype3 = types3[(int) (kind - VARIABLES_DOMAIN)]; | |
3038 | ourtype4 = types4[(int) (kind - VARIABLES_DOMAIN)]; | |
c906108c SS |
3039 | |
3040 | sr = *matches = NULL; | |
3041 | tail = NULL; | |
3042 | ||
3043 | if (regexp != NULL) | |
3044 | { | |
3045 | /* Make sure spacing is right for C++ operators. | |
3046 | This is just a courtesy to make the matching less sensitive | |
3047 | to how many spaces the user leaves between 'operator' | |
3048 | and <TYPENAME> or <OPERATOR>. */ | |
3049 | char *opend; | |
3050 | char *opname = operator_chars (regexp, &opend); | |
3051 | if (*opname) | |
c5aa993b JM |
3052 | { |
3053 | int fix = -1; /* -1 means ok; otherwise number of spaces needed. */ | |
3054 | if (isalpha (*opname) || *opname == '_' || *opname == '$') | |
3055 | { | |
3056 | /* There should 1 space between 'operator' and 'TYPENAME'. */ | |
3057 | if (opname[-1] != ' ' || opname[-2] == ' ') | |
3058 | fix = 1; | |
3059 | } | |
3060 | else | |
3061 | { | |
3062 | /* There should 0 spaces between 'operator' and 'OPERATOR'. */ | |
3063 | if (opname[-1] == ' ') | |
3064 | fix = 0; | |
3065 | } | |
3066 | /* If wrong number of spaces, fix it. */ | |
3067 | if (fix >= 0) | |
3068 | { | |
045f55a6 | 3069 | char *tmp = (char *) alloca (8 + fix + strlen (opname) + 1); |
c5aa993b JM |
3070 | sprintf (tmp, "operator%.*s%s", fix, " ", opname); |
3071 | regexp = tmp; | |
3072 | } | |
3073 | } | |
3074 | ||
c906108c | 3075 | if (0 != (val = re_comp (regexp))) |
8a3fe4f8 | 3076 | error (_("Invalid regexp (%s): %s"), val, regexp); |
c906108c SS |
3077 | } |
3078 | ||
3079 | /* Search through the partial symtabs *first* for all symbols | |
3080 | matching the regexp. That way we don't have to reproduce all of | |
3081 | the machinery below. */ | |
3082 | ||
3083 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
3084 | { |
3085 | struct partial_symbol **bound, **gbound, **sbound; | |
3086 | int keep_going = 1; | |
3087 | ||
3088 | if (ps->readin) | |
3089 | continue; | |
3090 | ||
3091 | gbound = objfile->global_psymbols.list + ps->globals_offset + ps->n_global_syms; | |
3092 | sbound = objfile->static_psymbols.list + ps->statics_offset + ps->n_static_syms; | |
3093 | bound = gbound; | |
3094 | ||
3095 | /* Go through all of the symbols stored in a partial | |
3096 | symtab in one loop. */ | |
3097 | psym = objfile->global_psymbols.list + ps->globals_offset; | |
3098 | while (keep_going) | |
3099 | { | |
3100 | if (psym >= bound) | |
3101 | { | |
3102 | if (bound == gbound && ps->n_static_syms != 0) | |
3103 | { | |
3104 | psym = objfile->static_psymbols.list + ps->statics_offset; | |
3105 | bound = sbound; | |
3106 | } | |
3107 | else | |
3108 | keep_going = 0; | |
3109 | continue; | |
3110 | } | |
3111 | else | |
3112 | { | |
3113 | QUIT; | |
3114 | ||
3115 | /* If it would match (logic taken from loop below) | |
cb1df416 DJ |
3116 | load the file and go on to the next one. We check the |
3117 | filename here, but that's a bit bogus: we don't know | |
3118 | what file it really comes from until we have full | |
3119 | symtabs. The symbol might be in a header file included by | |
3120 | this psymtab. This only affects Insight. */ | |
c5aa993b | 3121 | if (file_matches (ps->filename, files, nfiles) |
25120b0d DC |
3122 | && ((regexp == NULL |
3123 | || re_exec (SYMBOL_NATURAL_NAME (*psym)) != 0) | |
176620f1 | 3124 | && ((kind == VARIABLES_DOMAIN && SYMBOL_CLASS (*psym) != LOC_TYPEDEF |
c5aa993b | 3125 | && SYMBOL_CLASS (*psym) != LOC_BLOCK) |
176620f1 EZ |
3126 | || (kind == FUNCTIONS_DOMAIN && SYMBOL_CLASS (*psym) == LOC_BLOCK) |
3127 | || (kind == TYPES_DOMAIN && SYMBOL_CLASS (*psym) == LOC_TYPEDEF) | |
3128 | || (kind == METHODS_DOMAIN && SYMBOL_CLASS (*psym) == LOC_BLOCK)))) | |
c5aa993b JM |
3129 | { |
3130 | PSYMTAB_TO_SYMTAB (ps); | |
3131 | keep_going = 0; | |
3132 | } | |
3133 | } | |
3134 | psym++; | |
3135 | } | |
3136 | } | |
c906108c SS |
3137 | |
3138 | /* Here, we search through the minimal symbol tables for functions | |
3139 | and variables that match, and force their symbols to be read. | |
3140 | This is in particular necessary for demangled variable names, | |
3141 | which are no longer put into the partial symbol tables. | |
3142 | The symbol will then be found during the scan of symtabs below. | |
3143 | ||
3144 | For functions, find_pc_symtab should succeed if we have debug info | |
3145 | for the function, for variables we have to call lookup_symbol | |
3146 | to determine if the variable has debug info. | |
3147 | If the lookup fails, set found_misc so that we will rescan to print | |
3148 | any matching symbols without debug info. | |
c5aa993b | 3149 | */ |
c906108c | 3150 | |
176620f1 | 3151 | if (nfiles == 0 && (kind == VARIABLES_DOMAIN || kind == FUNCTIONS_DOMAIN)) |
c906108c SS |
3152 | { |
3153 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b JM |
3154 | { |
3155 | if (MSYMBOL_TYPE (msymbol) == ourtype || | |
3156 | MSYMBOL_TYPE (msymbol) == ourtype2 || | |
3157 | MSYMBOL_TYPE (msymbol) == ourtype3 || | |
3158 | MSYMBOL_TYPE (msymbol) == ourtype4) | |
3159 | { | |
25120b0d DC |
3160 | if (regexp == NULL |
3161 | || re_exec (SYMBOL_NATURAL_NAME (msymbol)) != 0) | |
c5aa993b JM |
3162 | { |
3163 | if (0 == find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol))) | |
3164 | { | |
b1262a02 DC |
3165 | /* FIXME: carlton/2003-02-04: Given that the |
3166 | semantics of lookup_symbol keeps on changing | |
3167 | slightly, it would be a nice idea if we had a | |
3168 | function lookup_symbol_minsym that found the | |
3169 | symbol associated to a given minimal symbol (if | |
3170 | any). */ | |
176620f1 | 3171 | if (kind == FUNCTIONS_DOMAIN |
2335f48e | 3172 | || lookup_symbol (SYMBOL_LINKAGE_NAME (msymbol), |
b1262a02 | 3173 | (struct block *) NULL, |
2570f2b7 | 3174 | VAR_DOMAIN, 0) |
53c5240f | 3175 | == NULL) |
b1262a02 | 3176 | found_misc = 1; |
c5aa993b JM |
3177 | } |
3178 | } | |
3179 | } | |
3180 | } | |
c906108c SS |
3181 | } |
3182 | ||
11309657 | 3183 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
3184 | { |
3185 | bv = BLOCKVECTOR (s); | |
c5aa993b JM |
3186 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) |
3187 | { | |
434d2d4f DJ |
3188 | struct symbol_search *prevtail = tail; |
3189 | int nfound = 0; | |
c5aa993b | 3190 | b = BLOCKVECTOR_BLOCK (bv, i); |
de4f826b | 3191 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 3192 | { |
cb1df416 | 3193 | struct symtab *real_symtab = SYMBOL_SYMTAB (sym); |
c5aa993b | 3194 | QUIT; |
cb1df416 DJ |
3195 | |
3196 | if (file_matches (real_symtab->filename, files, nfiles) | |
25120b0d DC |
3197 | && ((regexp == NULL |
3198 | || re_exec (SYMBOL_NATURAL_NAME (sym)) != 0) | |
176620f1 | 3199 | && ((kind == VARIABLES_DOMAIN && SYMBOL_CLASS (sym) != LOC_TYPEDEF |
c5aa993b JM |
3200 | && SYMBOL_CLASS (sym) != LOC_BLOCK |
3201 | && SYMBOL_CLASS (sym) != LOC_CONST) | |
176620f1 EZ |
3202 | || (kind == FUNCTIONS_DOMAIN && SYMBOL_CLASS (sym) == LOC_BLOCK) |
3203 | || (kind == TYPES_DOMAIN && SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
3204 | || (kind == METHODS_DOMAIN && SYMBOL_CLASS (sym) == LOC_BLOCK)))) | |
c5aa993b JM |
3205 | { |
3206 | /* match */ | |
3207 | psr = (struct symbol_search *) xmalloc (sizeof (struct symbol_search)); | |
3208 | psr->block = i; | |
cb1df416 | 3209 | psr->symtab = real_symtab; |
c5aa993b JM |
3210 | psr->symbol = sym; |
3211 | psr->msymbol = NULL; | |
3212 | psr->next = NULL; | |
3213 | if (tail == NULL) | |
434d2d4f | 3214 | sr = psr; |
c5aa993b JM |
3215 | else |
3216 | tail->next = psr; | |
3217 | tail = psr; | |
434d2d4f DJ |
3218 | nfound ++; |
3219 | } | |
3220 | } | |
3221 | if (nfound > 0) | |
3222 | { | |
3223 | if (prevtail == NULL) | |
3224 | { | |
3225 | struct symbol_search dummy; | |
3226 | ||
3227 | dummy.next = sr; | |
3228 | tail = sort_search_symbols (&dummy, nfound); | |
3229 | sr = dummy.next; | |
3230 | ||
3231 | old_chain = make_cleanup_free_search_symbols (sr); | |
c5aa993b | 3232 | } |
434d2d4f DJ |
3233 | else |
3234 | tail = sort_search_symbols (prevtail, nfound); | |
c5aa993b JM |
3235 | } |
3236 | } | |
c5aa993b | 3237 | } |
c906108c SS |
3238 | |
3239 | /* If there are no eyes, avoid all contact. I mean, if there are | |
3240 | no debug symbols, then print directly from the msymbol_vector. */ | |
3241 | ||
176620f1 | 3242 | if (found_misc || kind != FUNCTIONS_DOMAIN) |
c906108c SS |
3243 | { |
3244 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b JM |
3245 | { |
3246 | if (MSYMBOL_TYPE (msymbol) == ourtype || | |
3247 | MSYMBOL_TYPE (msymbol) == ourtype2 || | |
3248 | MSYMBOL_TYPE (msymbol) == ourtype3 || | |
3249 | MSYMBOL_TYPE (msymbol) == ourtype4) | |
3250 | { | |
25120b0d DC |
3251 | if (regexp == NULL |
3252 | || re_exec (SYMBOL_NATURAL_NAME (msymbol)) != 0) | |
c5aa993b JM |
3253 | { |
3254 | /* Functions: Look up by address. */ | |
176620f1 | 3255 | if (kind != FUNCTIONS_DOMAIN || |
c5aa993b JM |
3256 | (0 == find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol)))) |
3257 | { | |
3258 | /* Variables/Absolutes: Look up by name */ | |
2335f48e | 3259 | if (lookup_symbol (SYMBOL_LINKAGE_NAME (msymbol), |
2570f2b7 UW |
3260 | (struct block *) NULL, VAR_DOMAIN, 0) |
3261 | == NULL) | |
c5aa993b JM |
3262 | { |
3263 | /* match */ | |
3264 | psr = (struct symbol_search *) xmalloc (sizeof (struct symbol_search)); | |
3265 | psr->block = i; | |
3266 | psr->msymbol = msymbol; | |
3267 | psr->symtab = NULL; | |
3268 | psr->symbol = NULL; | |
3269 | psr->next = NULL; | |
3270 | if (tail == NULL) | |
3271 | { | |
3272 | sr = psr; | |
5bd98722 | 3273 | old_chain = make_cleanup_free_search_symbols (sr); |
c5aa993b JM |
3274 | } |
3275 | else | |
3276 | tail->next = psr; | |
3277 | tail = psr; | |
3278 | } | |
3279 | } | |
3280 | } | |
3281 | } | |
3282 | } | |
c906108c SS |
3283 | } |
3284 | ||
3285 | *matches = sr; | |
3286 | if (sr != NULL) | |
3287 | discard_cleanups (old_chain); | |
3288 | } | |
3289 | ||
3290 | /* Helper function for symtab_symbol_info, this function uses | |
3291 | the data returned from search_symbols() to print information | |
3292 | regarding the match to gdb_stdout. | |
c5aa993b | 3293 | */ |
c906108c | 3294 | static void |
176620f1 | 3295 | print_symbol_info (domain_enum kind, struct symtab *s, struct symbol *sym, |
fba45db2 | 3296 | int block, char *last) |
c906108c SS |
3297 | { |
3298 | if (last == NULL || strcmp (last, s->filename) != 0) | |
3299 | { | |
3300 | fputs_filtered ("\nFile ", gdb_stdout); | |
3301 | fputs_filtered (s->filename, gdb_stdout); | |
3302 | fputs_filtered (":\n", gdb_stdout); | |
3303 | } | |
3304 | ||
176620f1 | 3305 | if (kind != TYPES_DOMAIN && block == STATIC_BLOCK) |
c906108c | 3306 | printf_filtered ("static "); |
c5aa993b | 3307 | |
c906108c | 3308 | /* Typedef that is not a C++ class */ |
176620f1 EZ |
3309 | if (kind == TYPES_DOMAIN |
3310 | && SYMBOL_DOMAIN (sym) != STRUCT_DOMAIN) | |
a5238fbc | 3311 | typedef_print (SYMBOL_TYPE (sym), sym, gdb_stdout); |
c906108c | 3312 | /* variable, func, or typedef-that-is-c++-class */ |
176620f1 EZ |
3313 | else if (kind < TYPES_DOMAIN || |
3314 | (kind == TYPES_DOMAIN && | |
3315 | SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN)) | |
c906108c SS |
3316 | { |
3317 | type_print (SYMBOL_TYPE (sym), | |
c5aa993b | 3318 | (SYMBOL_CLASS (sym) == LOC_TYPEDEF |
de5ad195 | 3319 | ? "" : SYMBOL_PRINT_NAME (sym)), |
c5aa993b | 3320 | gdb_stdout, 0); |
c906108c SS |
3321 | |
3322 | printf_filtered (";\n"); | |
3323 | } | |
c906108c SS |
3324 | } |
3325 | ||
3326 | /* This help function for symtab_symbol_info() prints information | |
3327 | for non-debugging symbols to gdb_stdout. | |
c5aa993b | 3328 | */ |
c906108c | 3329 | static void |
fba45db2 | 3330 | print_msymbol_info (struct minimal_symbol *msymbol) |
c906108c | 3331 | { |
3ac4495a MS |
3332 | char *tmp; |
3333 | ||
17a912b6 | 3334 | if (gdbarch_addr_bit (current_gdbarch) <= 32) |
bb599908 PH |
3335 | tmp = hex_string_custom (SYMBOL_VALUE_ADDRESS (msymbol) |
3336 | & (CORE_ADDR) 0xffffffff, | |
3337 | 8); | |
3ac4495a | 3338 | else |
bb599908 PH |
3339 | tmp = hex_string_custom (SYMBOL_VALUE_ADDRESS (msymbol), |
3340 | 16); | |
3ac4495a | 3341 | printf_filtered ("%s %s\n", |
de5ad195 | 3342 | tmp, SYMBOL_PRINT_NAME (msymbol)); |
c906108c SS |
3343 | } |
3344 | ||
3345 | /* This is the guts of the commands "info functions", "info types", and | |
3346 | "info variables". It calls search_symbols to find all matches and then | |
3347 | print_[m]symbol_info to print out some useful information about the | |
3348 | matches. | |
c5aa993b | 3349 | */ |
c906108c | 3350 | static void |
176620f1 | 3351 | symtab_symbol_info (char *regexp, domain_enum kind, int from_tty) |
c906108c SS |
3352 | { |
3353 | static char *classnames[] | |
c5aa993b JM |
3354 | = |
3355 | {"variable", "function", "type", "method"}; | |
c906108c SS |
3356 | struct symbol_search *symbols; |
3357 | struct symbol_search *p; | |
3358 | struct cleanup *old_chain; | |
3359 | char *last_filename = NULL; | |
3360 | int first = 1; | |
3361 | ||
3362 | /* must make sure that if we're interrupted, symbols gets freed */ | |
3363 | search_symbols (regexp, kind, 0, (char **) NULL, &symbols); | |
5bd98722 | 3364 | old_chain = make_cleanup_free_search_symbols (symbols); |
c906108c SS |
3365 | |
3366 | printf_filtered (regexp | |
c5aa993b JM |
3367 | ? "All %ss matching regular expression \"%s\":\n" |
3368 | : "All defined %ss:\n", | |
176620f1 | 3369 | classnames[(int) (kind - VARIABLES_DOMAIN)], regexp); |
c906108c SS |
3370 | |
3371 | for (p = symbols; p != NULL; p = p->next) | |
3372 | { | |
3373 | QUIT; | |
3374 | ||
3375 | if (p->msymbol != NULL) | |
c5aa993b JM |
3376 | { |
3377 | if (first) | |
3378 | { | |
3379 | printf_filtered ("\nNon-debugging symbols:\n"); | |
3380 | first = 0; | |
3381 | } | |
3382 | print_msymbol_info (p->msymbol); | |
3383 | } | |
c906108c | 3384 | else |
c5aa993b JM |
3385 | { |
3386 | print_symbol_info (kind, | |
3387 | p->symtab, | |
3388 | p->symbol, | |
3389 | p->block, | |
3390 | last_filename); | |
3391 | last_filename = p->symtab->filename; | |
3392 | } | |
c906108c SS |
3393 | } |
3394 | ||
3395 | do_cleanups (old_chain); | |
3396 | } | |
3397 | ||
3398 | static void | |
fba45db2 | 3399 | variables_info (char *regexp, int from_tty) |
c906108c | 3400 | { |
176620f1 | 3401 | symtab_symbol_info (regexp, VARIABLES_DOMAIN, from_tty); |
c906108c SS |
3402 | } |
3403 | ||
3404 | static void | |
fba45db2 | 3405 | functions_info (char *regexp, int from_tty) |
c906108c | 3406 | { |
176620f1 | 3407 | symtab_symbol_info (regexp, FUNCTIONS_DOMAIN, from_tty); |
c906108c SS |
3408 | } |
3409 | ||
357e46e7 | 3410 | |
c906108c | 3411 | static void |
fba45db2 | 3412 | types_info (char *regexp, int from_tty) |
c906108c | 3413 | { |
176620f1 | 3414 | symtab_symbol_info (regexp, TYPES_DOMAIN, from_tty); |
c906108c SS |
3415 | } |
3416 | ||
c906108c | 3417 | /* Breakpoint all functions matching regular expression. */ |
8926118c | 3418 | |
8b93c638 | 3419 | void |
fba45db2 | 3420 | rbreak_command_wrapper (char *regexp, int from_tty) |
8b93c638 JM |
3421 | { |
3422 | rbreak_command (regexp, from_tty); | |
3423 | } | |
8926118c | 3424 | |
c906108c | 3425 | static void |
fba45db2 | 3426 | rbreak_command (char *regexp, int from_tty) |
c906108c SS |
3427 | { |
3428 | struct symbol_search *ss; | |
3429 | struct symbol_search *p; | |
3430 | struct cleanup *old_chain; | |
3431 | ||
176620f1 | 3432 | search_symbols (regexp, FUNCTIONS_DOMAIN, 0, (char **) NULL, &ss); |
5bd98722 | 3433 | old_chain = make_cleanup_free_search_symbols (ss); |
c906108c SS |
3434 | |
3435 | for (p = ss; p != NULL; p = p->next) | |
3436 | { | |
3437 | if (p->msymbol == NULL) | |
c5aa993b | 3438 | { |
2335f48e DC |
3439 | char *string = alloca (strlen (p->symtab->filename) |
3440 | + strlen (SYMBOL_LINKAGE_NAME (p->symbol)) | |
3441 | + 4); | |
c5aa993b JM |
3442 | strcpy (string, p->symtab->filename); |
3443 | strcat (string, ":'"); | |
2335f48e | 3444 | strcat (string, SYMBOL_LINKAGE_NAME (p->symbol)); |
c5aa993b JM |
3445 | strcat (string, "'"); |
3446 | break_command (string, from_tty); | |
176620f1 | 3447 | print_symbol_info (FUNCTIONS_DOMAIN, |
c5aa993b JM |
3448 | p->symtab, |
3449 | p->symbol, | |
3450 | p->block, | |
3451 | p->symtab->filename); | |
3452 | } | |
c906108c | 3453 | else |
c5aa993b | 3454 | { |
6214f497 DJ |
3455 | char *string = alloca (strlen (SYMBOL_LINKAGE_NAME (p->msymbol)) |
3456 | + 3); | |
3457 | strcpy (string, "'"); | |
3458 | strcat (string, SYMBOL_LINKAGE_NAME (p->msymbol)); | |
3459 | strcat (string, "'"); | |
3460 | ||
3461 | break_command (string, from_tty); | |
c5aa993b | 3462 | printf_filtered ("<function, no debug info> %s;\n", |
de5ad195 | 3463 | SYMBOL_PRINT_NAME (p->msymbol)); |
c5aa993b | 3464 | } |
c906108c SS |
3465 | } |
3466 | ||
3467 | do_cleanups (old_chain); | |
3468 | } | |
c906108c | 3469 | \f |
c5aa993b | 3470 | |
c906108c SS |
3471 | /* Helper routine for make_symbol_completion_list. */ |
3472 | ||
3473 | static int return_val_size; | |
3474 | static int return_val_index; | |
3475 | static char **return_val; | |
3476 | ||
3477 | #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \ | |
c906108c | 3478 | completion_list_add_name \ |
2335f48e | 3479 | (SYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word)) |
c906108c SS |
3480 | |
3481 | /* Test to see if the symbol specified by SYMNAME (which is already | |
c5aa993b JM |
3482 | demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN |
3483 | characters. If so, add it to the current completion list. */ | |
c906108c SS |
3484 | |
3485 | static void | |
fba45db2 KB |
3486 | completion_list_add_name (char *symname, char *sym_text, int sym_text_len, |
3487 | char *text, char *word) | |
c906108c SS |
3488 | { |
3489 | int newsize; | |
3490 | int i; | |
3491 | ||
3492 | /* clip symbols that cannot match */ | |
3493 | ||
3494 | if (strncmp (symname, sym_text, sym_text_len) != 0) | |
3495 | { | |
3496 | return; | |
3497 | } | |
3498 | ||
c906108c SS |
3499 | /* We have a match for a completion, so add SYMNAME to the current list |
3500 | of matches. Note that the name is moved to freshly malloc'd space. */ | |
3501 | ||
3502 | { | |
3503 | char *new; | |
3504 | if (word == sym_text) | |
3505 | { | |
3506 | new = xmalloc (strlen (symname) + 5); | |
3507 | strcpy (new, symname); | |
3508 | } | |
3509 | else if (word > sym_text) | |
3510 | { | |
3511 | /* Return some portion of symname. */ | |
3512 | new = xmalloc (strlen (symname) + 5); | |
3513 | strcpy (new, symname + (word - sym_text)); | |
3514 | } | |
3515 | else | |
3516 | { | |
3517 | /* Return some of SYM_TEXT plus symname. */ | |
3518 | new = xmalloc (strlen (symname) + (sym_text - word) + 5); | |
3519 | strncpy (new, word, sym_text - word); | |
3520 | new[sym_text - word] = '\0'; | |
3521 | strcat (new, symname); | |
3522 | } | |
3523 | ||
c906108c SS |
3524 | if (return_val_index + 3 > return_val_size) |
3525 | { | |
3526 | newsize = (return_val_size *= 2) * sizeof (char *); | |
3527 | return_val = (char **) xrealloc ((char *) return_val, newsize); | |
3528 | } | |
3529 | return_val[return_val_index++] = new; | |
3530 | return_val[return_val_index] = NULL; | |
3531 | } | |
3532 | } | |
3533 | ||
69636828 AF |
3534 | /* ObjC: In case we are completing on a selector, look as the msymbol |
3535 | again and feed all the selectors into the mill. */ | |
3536 | ||
3537 | static void | |
3538 | completion_list_objc_symbol (struct minimal_symbol *msymbol, char *sym_text, | |
3539 | int sym_text_len, char *text, char *word) | |
3540 | { | |
3541 | static char *tmp = NULL; | |
3542 | static unsigned int tmplen = 0; | |
3543 | ||
3544 | char *method, *category, *selector; | |
3545 | char *tmp2 = NULL; | |
3546 | ||
3547 | method = SYMBOL_NATURAL_NAME (msymbol); | |
3548 | ||
3549 | /* Is it a method? */ | |
3550 | if ((method[0] != '-') && (method[0] != '+')) | |
3551 | return; | |
3552 | ||
3553 | if (sym_text[0] == '[') | |
3554 | /* Complete on shortened method method. */ | |
3555 | completion_list_add_name (method + 1, sym_text, sym_text_len, text, word); | |
3556 | ||
3557 | while ((strlen (method) + 1) >= tmplen) | |
3558 | { | |
3559 | if (tmplen == 0) | |
3560 | tmplen = 1024; | |
3561 | else | |
3562 | tmplen *= 2; | |
3563 | tmp = xrealloc (tmp, tmplen); | |
3564 | } | |
3565 | selector = strchr (method, ' '); | |
3566 | if (selector != NULL) | |
3567 | selector++; | |
3568 | ||
3569 | category = strchr (method, '('); | |
3570 | ||
3571 | if ((category != NULL) && (selector != NULL)) | |
3572 | { | |
3573 | memcpy (tmp, method, (category - method)); | |
3574 | tmp[category - method] = ' '; | |
3575 | memcpy (tmp + (category - method) + 1, selector, strlen (selector) + 1); | |
3576 | completion_list_add_name (tmp, sym_text, sym_text_len, text, word); | |
3577 | if (sym_text[0] == '[') | |
3578 | completion_list_add_name (tmp + 1, sym_text, sym_text_len, text, word); | |
3579 | } | |
3580 | ||
3581 | if (selector != NULL) | |
3582 | { | |
3583 | /* Complete on selector only. */ | |
3584 | strcpy (tmp, selector); | |
3585 | tmp2 = strchr (tmp, ']'); | |
3586 | if (tmp2 != NULL) | |
3587 | *tmp2 = '\0'; | |
3588 | ||
3589 | completion_list_add_name (tmp, sym_text, sym_text_len, text, word); | |
3590 | } | |
3591 | } | |
3592 | ||
3593 | /* Break the non-quoted text based on the characters which are in | |
3594 | symbols. FIXME: This should probably be language-specific. */ | |
3595 | ||
3596 | static char * | |
3597 | language_search_unquoted_string (char *text, char *p) | |
3598 | { | |
3599 | for (; p > text; --p) | |
3600 | { | |
3601 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0') | |
3602 | continue; | |
3603 | else | |
3604 | { | |
3605 | if ((current_language->la_language == language_objc)) | |
3606 | { | |
3607 | if (p[-1] == ':') /* might be part of a method name */ | |
3608 | continue; | |
3609 | else if (p[-1] == '[' && (p[-2] == '-' || p[-2] == '+')) | |
3610 | p -= 2; /* beginning of a method name */ | |
3611 | else if (p[-1] == ' ' || p[-1] == '(' || p[-1] == ')') | |
3612 | { /* might be part of a method name */ | |
3613 | char *t = p; | |
3614 | ||
3615 | /* Seeing a ' ' or a '(' is not conclusive evidence | |
3616 | that we are in the middle of a method name. However, | |
3617 | finding "-[" or "+[" should be pretty un-ambiguous. | |
3618 | Unfortunately we have to find it now to decide. */ | |
3619 | ||
3620 | while (t > text) | |
3621 | if (isalnum (t[-1]) || t[-1] == '_' || | |
3622 | t[-1] == ' ' || t[-1] == ':' || | |
3623 | t[-1] == '(' || t[-1] == ')') | |
3624 | --t; | |
3625 | else | |
3626 | break; | |
3627 | ||
3628 | if (t[-1] == '[' && (t[-2] == '-' || t[-2] == '+')) | |
3629 | p = t - 2; /* method name detected */ | |
3630 | /* else we leave with p unchanged */ | |
3631 | } | |
3632 | } | |
3633 | break; | |
3634 | } | |
3635 | } | |
3636 | return p; | |
3637 | } | |
3638 | ||
c906108c | 3639 | char ** |
41d27058 | 3640 | default_make_symbol_completion_list (char *text, char *word) |
c906108c | 3641 | { |
41d27058 JB |
3642 | /* Problem: All of the symbols have to be copied because readline |
3643 | frees them. I'm not going to worry about this; hopefully there | |
3644 | won't be that many. */ | |
3645 | ||
de4f826b DC |
3646 | struct symbol *sym; |
3647 | struct symtab *s; | |
3648 | struct partial_symtab *ps; | |
3649 | struct minimal_symbol *msymbol; | |
3650 | struct objfile *objfile; | |
3651 | struct block *b, *surrounding_static_block = 0; | |
3652 | struct dict_iterator iter; | |
3653 | int j; | |
c906108c SS |
3654 | struct partial_symbol **psym; |
3655 | /* The symbol we are completing on. Points in same buffer as text. */ | |
3656 | char *sym_text; | |
3657 | /* Length of sym_text. */ | |
3658 | int sym_text_len; | |
3659 | ||
41d27058 | 3660 | /* Now look for the symbol we are supposed to complete on. */ |
c906108c SS |
3661 | { |
3662 | char *p; | |
3663 | char quote_found; | |
3664 | char *quote_pos = NULL; | |
3665 | ||
3666 | /* First see if this is a quoted string. */ | |
3667 | quote_found = '\0'; | |
3668 | for (p = text; *p != '\0'; ++p) | |
3669 | { | |
3670 | if (quote_found != '\0') | |
3671 | { | |
3672 | if (*p == quote_found) | |
3673 | /* Found close quote. */ | |
3674 | quote_found = '\0'; | |
3675 | else if (*p == '\\' && p[1] == quote_found) | |
3676 | /* A backslash followed by the quote character | |
c5aa993b | 3677 | doesn't end the string. */ |
c906108c SS |
3678 | ++p; |
3679 | } | |
3680 | else if (*p == '\'' || *p == '"') | |
3681 | { | |
3682 | quote_found = *p; | |
3683 | quote_pos = p; | |
3684 | } | |
3685 | } | |
3686 | if (quote_found == '\'') | |
3687 | /* A string within single quotes can be a symbol, so complete on it. */ | |
3688 | sym_text = quote_pos + 1; | |
3689 | else if (quote_found == '"') | |
3690 | /* A double-quoted string is never a symbol, nor does it make sense | |
c5aa993b | 3691 | to complete it any other way. */ |
c94fdfd0 EZ |
3692 | { |
3693 | return_val = (char **) xmalloc (sizeof (char *)); | |
3694 | return_val[0] = NULL; | |
3695 | return return_val; | |
3696 | } | |
c906108c SS |
3697 | else |
3698 | { | |
3699 | /* It is not a quoted string. Break it based on the characters | |
3700 | which are in symbols. */ | |
3701 | while (p > text) | |
3702 | { | |
3703 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0') | |
3704 | --p; | |
3705 | else | |
3706 | break; | |
3707 | } | |
3708 | sym_text = p; | |
3709 | } | |
3710 | } | |
3711 | ||
3712 | sym_text_len = strlen (sym_text); | |
3713 | ||
3714 | return_val_size = 100; | |
3715 | return_val_index = 0; | |
3716 | return_val = (char **) xmalloc ((return_val_size + 1) * sizeof (char *)); | |
3717 | return_val[0] = NULL; | |
3718 | ||
3719 | /* Look through the partial symtabs for all symbols which begin | |
3720 | by matching SYM_TEXT. Add each one that you find to the list. */ | |
3721 | ||
3722 | ALL_PSYMTABS (objfile, ps) | |
c5aa993b JM |
3723 | { |
3724 | /* If the psymtab's been read in we'll get it when we search | |
3725 | through the blockvector. */ | |
3726 | if (ps->readin) | |
3727 | continue; | |
3728 | ||
3729 | for (psym = objfile->global_psymbols.list + ps->globals_offset; | |
3730 | psym < (objfile->global_psymbols.list + ps->globals_offset | |
3731 | + ps->n_global_syms); | |
3732 | psym++) | |
3733 | { | |
3734 | /* If interrupted, then quit. */ | |
3735 | QUIT; | |
3736 | COMPLETION_LIST_ADD_SYMBOL (*psym, sym_text, sym_text_len, text, word); | |
3737 | } | |
3738 | ||
3739 | for (psym = objfile->static_psymbols.list + ps->statics_offset; | |
3740 | psym < (objfile->static_psymbols.list + ps->statics_offset | |
3741 | + ps->n_static_syms); | |
3742 | psym++) | |
3743 | { | |
3744 | QUIT; | |
3745 | COMPLETION_LIST_ADD_SYMBOL (*psym, sym_text, sym_text_len, text, word); | |
3746 | } | |
3747 | } | |
c906108c SS |
3748 | |
3749 | /* At this point scan through the misc symbol vectors and add each | |
3750 | symbol you find to the list. Eventually we want to ignore | |
3751 | anything that isn't a text symbol (everything else will be | |
3752 | handled by the psymtab code above). */ | |
3753 | ||
3754 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b JM |
3755 | { |
3756 | QUIT; | |
3757 | COMPLETION_LIST_ADD_SYMBOL (msymbol, sym_text, sym_text_len, text, word); | |
69636828 AF |
3758 | |
3759 | completion_list_objc_symbol (msymbol, sym_text, sym_text_len, text, word); | |
c5aa993b | 3760 | } |
c906108c SS |
3761 | |
3762 | /* Search upwards from currently selected frame (so that we can | |
3763 | complete on local vars. */ | |
3764 | ||
ae767bfb | 3765 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) |
c906108c SS |
3766 | { |
3767 | if (!BLOCK_SUPERBLOCK (b)) | |
3768 | { | |
c5aa993b | 3769 | surrounding_static_block = b; /* For elmin of dups */ |
c906108c | 3770 | } |
c5aa993b | 3771 | |
c906108c | 3772 | /* Also catch fields of types defined in this places which match our |
c5aa993b | 3773 | text string. Only complete on types visible from current context. */ |
c906108c | 3774 | |
de4f826b | 3775 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c906108c | 3776 | { |
69636828 | 3777 | QUIT; |
c906108c SS |
3778 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3779 | if (SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
3780 | { | |
3781 | struct type *t = SYMBOL_TYPE (sym); | |
3782 | enum type_code c = TYPE_CODE (t); | |
3783 | ||
3784 | if (c == TYPE_CODE_UNION || c == TYPE_CODE_STRUCT) | |
3785 | { | |
3786 | for (j = TYPE_N_BASECLASSES (t); j < TYPE_NFIELDS (t); j++) | |
3787 | { | |
3788 | if (TYPE_FIELD_NAME (t, j)) | |
3789 | { | |
3790 | completion_list_add_name (TYPE_FIELD_NAME (t, j), | |
c5aa993b | 3791 | sym_text, sym_text_len, text, word); |
c906108c SS |
3792 | } |
3793 | } | |
3794 | } | |
3795 | } | |
3796 | } | |
3797 | } | |
3798 | ||
3799 | /* Go through the symtabs and check the externs and statics for | |
3800 | symbols which match. */ | |
3801 | ||
11309657 | 3802 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
3803 | { |
3804 | QUIT; | |
3805 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
de4f826b | 3806 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 3807 | { |
c5aa993b JM |
3808 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3809 | } | |
3810 | } | |
c906108c | 3811 | |
11309657 | 3812 | ALL_PRIMARY_SYMTABS (objfile, s) |
c5aa993b JM |
3813 | { |
3814 | QUIT; | |
3815 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
3816 | /* Don't do this block twice. */ | |
3817 | if (b == surrounding_static_block) | |
3818 | continue; | |
de4f826b | 3819 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 3820 | { |
c5aa993b JM |
3821 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3822 | } | |
3823 | } | |
c906108c SS |
3824 | |
3825 | return (return_val); | |
3826 | } | |
3827 | ||
41d27058 JB |
3828 | /* Return a NULL terminated array of all symbols (regardless of class) |
3829 | which begin by matching TEXT. If the answer is no symbols, then | |
3830 | the return value is an array which contains only a NULL pointer. */ | |
3831 | ||
3832 | char ** | |
3833 | make_symbol_completion_list (char *text, char *word) | |
3834 | { | |
3835 | return current_language->la_make_symbol_completion_list (text, word); | |
3836 | } | |
3837 | ||
c94fdfd0 EZ |
3838 | /* Like make_symbol_completion_list, but returns a list of symbols |
3839 | defined in a source file FILE. */ | |
3840 | ||
3841 | char ** | |
3842 | make_file_symbol_completion_list (char *text, char *word, char *srcfile) | |
3843 | { | |
52f0bd74 AC |
3844 | struct symbol *sym; |
3845 | struct symtab *s; | |
3846 | struct block *b; | |
de4f826b | 3847 | struct dict_iterator iter; |
c94fdfd0 EZ |
3848 | /* The symbol we are completing on. Points in same buffer as text. */ |
3849 | char *sym_text; | |
3850 | /* Length of sym_text. */ | |
3851 | int sym_text_len; | |
3852 | ||
3853 | /* Now look for the symbol we are supposed to complete on. | |
3854 | FIXME: This should be language-specific. */ | |
3855 | { | |
3856 | char *p; | |
3857 | char quote_found; | |
3858 | char *quote_pos = NULL; | |
3859 | ||
3860 | /* First see if this is a quoted string. */ | |
3861 | quote_found = '\0'; | |
3862 | for (p = text; *p != '\0'; ++p) | |
3863 | { | |
3864 | if (quote_found != '\0') | |
3865 | { | |
3866 | if (*p == quote_found) | |
3867 | /* Found close quote. */ | |
3868 | quote_found = '\0'; | |
3869 | else if (*p == '\\' && p[1] == quote_found) | |
3870 | /* A backslash followed by the quote character | |
3871 | doesn't end the string. */ | |
3872 | ++p; | |
3873 | } | |
3874 | else if (*p == '\'' || *p == '"') | |
3875 | { | |
3876 | quote_found = *p; | |
3877 | quote_pos = p; | |
3878 | } | |
3879 | } | |
3880 | if (quote_found == '\'') | |
3881 | /* A string within single quotes can be a symbol, so complete on it. */ | |
3882 | sym_text = quote_pos + 1; | |
3883 | else if (quote_found == '"') | |
3884 | /* A double-quoted string is never a symbol, nor does it make sense | |
3885 | to complete it any other way. */ | |
3886 | { | |
3887 | return_val = (char **) xmalloc (sizeof (char *)); | |
3888 | return_val[0] = NULL; | |
3889 | return return_val; | |
3890 | } | |
3891 | else | |
3892 | { | |
69636828 AF |
3893 | /* Not a quoted string. */ |
3894 | sym_text = language_search_unquoted_string (text, p); | |
c94fdfd0 EZ |
3895 | } |
3896 | } | |
3897 | ||
3898 | sym_text_len = strlen (sym_text); | |
3899 | ||
3900 | return_val_size = 10; | |
3901 | return_val_index = 0; | |
3902 | return_val = (char **) xmalloc ((return_val_size + 1) * sizeof (char *)); | |
3903 | return_val[0] = NULL; | |
3904 | ||
3905 | /* Find the symtab for SRCFILE (this loads it if it was not yet read | |
3906 | in). */ | |
3907 | s = lookup_symtab (srcfile); | |
3908 | if (s == NULL) | |
3909 | { | |
3910 | /* Maybe they typed the file with leading directories, while the | |
3911 | symbol tables record only its basename. */ | |
31889e00 | 3912 | const char *tail = lbasename (srcfile); |
c94fdfd0 EZ |
3913 | |
3914 | if (tail > srcfile) | |
3915 | s = lookup_symtab (tail); | |
3916 | } | |
3917 | ||
3918 | /* If we have no symtab for that file, return an empty list. */ | |
3919 | if (s == NULL) | |
3920 | return (return_val); | |
3921 | ||
3922 | /* Go through this symtab and check the externs and statics for | |
3923 | symbols which match. */ | |
3924 | ||
3925 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
de4f826b | 3926 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c94fdfd0 | 3927 | { |
c94fdfd0 EZ |
3928 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3929 | } | |
3930 | ||
3931 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
de4f826b | 3932 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c94fdfd0 | 3933 | { |
c94fdfd0 EZ |
3934 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
3935 | } | |
3936 | ||
3937 | return (return_val); | |
3938 | } | |
3939 | ||
3940 | /* A helper function for make_source_files_completion_list. It adds | |
3941 | another file name to a list of possible completions, growing the | |
3942 | list as necessary. */ | |
3943 | ||
3944 | static void | |
3945 | add_filename_to_list (const char *fname, char *text, char *word, | |
3946 | char ***list, int *list_used, int *list_alloced) | |
3947 | { | |
3948 | char *new; | |
3949 | size_t fnlen = strlen (fname); | |
3950 | ||
3951 | if (*list_used + 1 >= *list_alloced) | |
3952 | { | |
3953 | *list_alloced *= 2; | |
3954 | *list = (char **) xrealloc ((char *) *list, | |
3955 | *list_alloced * sizeof (char *)); | |
3956 | } | |
3957 | ||
3958 | if (word == text) | |
3959 | { | |
3960 | /* Return exactly fname. */ | |
3961 | new = xmalloc (fnlen + 5); | |
3962 | strcpy (new, fname); | |
3963 | } | |
3964 | else if (word > text) | |
3965 | { | |
3966 | /* Return some portion of fname. */ | |
3967 | new = xmalloc (fnlen + 5); | |
3968 | strcpy (new, fname + (word - text)); | |
3969 | } | |
3970 | else | |
3971 | { | |
3972 | /* Return some of TEXT plus fname. */ | |
3973 | new = xmalloc (fnlen + (text - word) + 5); | |
3974 | strncpy (new, word, text - word); | |
3975 | new[text - word] = '\0'; | |
3976 | strcat (new, fname); | |
3977 | } | |
3978 | (*list)[*list_used] = new; | |
3979 | (*list)[++*list_used] = NULL; | |
3980 | } | |
3981 | ||
3982 | static int | |
3983 | not_interesting_fname (const char *fname) | |
3984 | { | |
3985 | static const char *illegal_aliens[] = { | |
3986 | "_globals_", /* inserted by coff_symtab_read */ | |
3987 | NULL | |
3988 | }; | |
3989 | int i; | |
3990 | ||
3991 | for (i = 0; illegal_aliens[i]; i++) | |
3992 | { | |
3993 | if (strcmp (fname, illegal_aliens[i]) == 0) | |
3994 | return 1; | |
3995 | } | |
3996 | return 0; | |
3997 | } | |
3998 | ||
3999 | /* Return a NULL terminated array of all source files whose names | |
4000 | begin with matching TEXT. The file names are looked up in the | |
4001 | symbol tables of this program. If the answer is no matchess, then | |
4002 | the return value is an array which contains only a NULL pointer. */ | |
4003 | ||
4004 | char ** | |
4005 | make_source_files_completion_list (char *text, char *word) | |
4006 | { | |
52f0bd74 AC |
4007 | struct symtab *s; |
4008 | struct partial_symtab *ps; | |
4009 | struct objfile *objfile; | |
c94fdfd0 EZ |
4010 | int first = 1; |
4011 | int list_alloced = 1; | |
4012 | int list_used = 0; | |
4013 | size_t text_len = strlen (text); | |
4014 | char **list = (char **) xmalloc (list_alloced * sizeof (char *)); | |
31889e00 | 4015 | const char *base_name; |
c94fdfd0 EZ |
4016 | |
4017 | list[0] = NULL; | |
4018 | ||
4019 | if (!have_full_symbols () && !have_partial_symbols ()) | |
4020 | return list; | |
4021 | ||
4022 | ALL_SYMTABS (objfile, s) | |
4023 | { | |
4024 | if (not_interesting_fname (s->filename)) | |
4025 | continue; | |
4026 | if (!filename_seen (s->filename, 1, &first) | |
4027 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
4028 | && strncasecmp (s->filename, text, text_len) == 0 | |
4029 | #else | |
4030 | && strncmp (s->filename, text, text_len) == 0 | |
4031 | #endif | |
4032 | ) | |
4033 | { | |
4034 | /* This file matches for a completion; add it to the current | |
4035 | list of matches. */ | |
4036 | add_filename_to_list (s->filename, text, word, | |
4037 | &list, &list_used, &list_alloced); | |
4038 | } | |
4039 | else | |
4040 | { | |
4041 | /* NOTE: We allow the user to type a base name when the | |
4042 | debug info records leading directories, but not the other | |
4043 | way around. This is what subroutines of breakpoint | |
4044 | command do when they parse file names. */ | |
31889e00 | 4045 | base_name = lbasename (s->filename); |
c94fdfd0 EZ |
4046 | if (base_name != s->filename |
4047 | && !filename_seen (base_name, 1, &first) | |
4048 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
4049 | && strncasecmp (base_name, text, text_len) == 0 | |
4050 | #else | |
4051 | && strncmp (base_name, text, text_len) == 0 | |
4052 | #endif | |
4053 | ) | |
4054 | add_filename_to_list (base_name, text, word, | |
4055 | &list, &list_used, &list_alloced); | |
4056 | } | |
4057 | } | |
4058 | ||
4059 | ALL_PSYMTABS (objfile, ps) | |
4060 | { | |
4061 | if (not_interesting_fname (ps->filename)) | |
4062 | continue; | |
4063 | if (!ps->readin) | |
4064 | { | |
4065 | if (!filename_seen (ps->filename, 1, &first) | |
4066 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
4067 | && strncasecmp (ps->filename, text, text_len) == 0 | |
4068 | #else | |
4069 | && strncmp (ps->filename, text, text_len) == 0 | |
4070 | #endif | |
4071 | ) | |
4072 | { | |
4073 | /* This file matches for a completion; add it to the | |
4074 | current list of matches. */ | |
4075 | add_filename_to_list (ps->filename, text, word, | |
4076 | &list, &list_used, &list_alloced); | |
4077 | ||
4078 | } | |
4079 | else | |
4080 | { | |
31889e00 | 4081 | base_name = lbasename (ps->filename); |
c94fdfd0 EZ |
4082 | if (base_name != ps->filename |
4083 | && !filename_seen (base_name, 1, &first) | |
4084 | #if HAVE_DOS_BASED_FILE_SYSTEM | |
4085 | && strncasecmp (base_name, text, text_len) == 0 | |
4086 | #else | |
4087 | && strncmp (base_name, text, text_len) == 0 | |
4088 | #endif | |
4089 | ) | |
4090 | add_filename_to_list (base_name, text, word, | |
4091 | &list, &list_used, &list_alloced); | |
4092 | } | |
4093 | } | |
4094 | } | |
4095 | ||
4096 | return list; | |
4097 | } | |
4098 | ||
c906108c SS |
4099 | /* Determine if PC is in the prologue of a function. The prologue is the area |
4100 | between the first instruction of a function, and the first executable line. | |
4101 | Returns 1 if PC *might* be in prologue, 0 if definately *not* in prologue. | |
4102 | ||
4103 | If non-zero, func_start is where we think the prologue starts, possibly | |
4104 | by previous examination of symbol table information. | |
4105 | */ | |
4106 | ||
4107 | int | |
fba45db2 | 4108 | in_prologue (CORE_ADDR pc, CORE_ADDR func_start) |
c906108c SS |
4109 | { |
4110 | struct symtab_and_line sal; | |
4111 | CORE_ADDR func_addr, func_end; | |
4112 | ||
54cf9c03 EZ |
4113 | /* We have several sources of information we can consult to figure |
4114 | this out. | |
4115 | - Compilers usually emit line number info that marks the prologue | |
4116 | as its own "source line". So the ending address of that "line" | |
4117 | is the end of the prologue. If available, this is the most | |
4118 | reliable method. | |
4119 | - The minimal symbols and partial symbols, which can usually tell | |
4120 | us the starting and ending addresses of a function. | |
4121 | - If we know the function's start address, we can call the | |
a433963d | 4122 | architecture-defined gdbarch_skip_prologue function to analyze the |
54cf9c03 EZ |
4123 | instruction stream and guess where the prologue ends. |
4124 | - Our `func_start' argument; if non-zero, this is the caller's | |
4125 | best guess as to the function's entry point. At the time of | |
4126 | this writing, handle_inferior_event doesn't get this right, so | |
4127 | it should be our last resort. */ | |
4128 | ||
4129 | /* Consult the partial symbol table, to find which function | |
4130 | the PC is in. */ | |
4131 | if (! find_pc_partial_function (pc, NULL, &func_addr, &func_end)) | |
4132 | { | |
4133 | CORE_ADDR prologue_end; | |
c906108c | 4134 | |
54cf9c03 EZ |
4135 | /* We don't even have minsym information, so fall back to using |
4136 | func_start, if given. */ | |
4137 | if (! func_start) | |
4138 | return 1; /* We *might* be in a prologue. */ | |
c906108c | 4139 | |
a433963d | 4140 | prologue_end = gdbarch_skip_prologue (current_gdbarch, func_start); |
c906108c | 4141 | |
54cf9c03 EZ |
4142 | return func_start <= pc && pc < prologue_end; |
4143 | } | |
c906108c | 4144 | |
54cf9c03 EZ |
4145 | /* If we have line number information for the function, that's |
4146 | usually pretty reliable. */ | |
4147 | sal = find_pc_line (func_addr, 0); | |
c906108c | 4148 | |
54cf9c03 EZ |
4149 | /* Now sal describes the source line at the function's entry point, |
4150 | which (by convention) is the prologue. The end of that "line", | |
4151 | sal.end, is the end of the prologue. | |
4152 | ||
4153 | Note that, for functions whose source code is all on a single | |
4154 | line, the line number information doesn't always end up this way. | |
4155 | So we must verify that our purported end-of-prologue address is | |
4156 | *within* the function, not at its start or end. */ | |
4157 | if (sal.line == 0 | |
4158 | || sal.end <= func_addr | |
4159 | || func_end <= sal.end) | |
4160 | { | |
4161 | /* We don't have any good line number info, so use the minsym | |
4162 | information, together with the architecture-specific prologue | |
4163 | scanning code. */ | |
a433963d UW |
4164 | CORE_ADDR prologue_end = gdbarch_skip_prologue |
4165 | (current_gdbarch, func_addr); | |
c906108c | 4166 | |
54cf9c03 EZ |
4167 | return func_addr <= pc && pc < prologue_end; |
4168 | } | |
c906108c | 4169 | |
54cf9c03 EZ |
4170 | /* We have line number info, and it looks good. */ |
4171 | return func_addr <= pc && pc < sal.end; | |
c906108c SS |
4172 | } |
4173 | ||
634aa483 AC |
4174 | /* Given PC at the function's start address, attempt to find the |
4175 | prologue end using SAL information. Return zero if the skip fails. | |
4176 | ||
4177 | A non-optimized prologue traditionally has one SAL for the function | |
4178 | and a second for the function body. A single line function has | |
4179 | them both pointing at the same line. | |
4180 | ||
4181 | An optimized prologue is similar but the prologue may contain | |
4182 | instructions (SALs) from the instruction body. Need to skip those | |
4183 | while not getting into the function body. | |
4184 | ||
4185 | The functions end point and an increasing SAL line are used as | |
4186 | indicators of the prologue's endpoint. | |
4187 | ||
4188 | This code is based on the function refine_prologue_limit (versions | |
4189 | found in both ia64 and ppc). */ | |
4190 | ||
4191 | CORE_ADDR | |
4192 | skip_prologue_using_sal (CORE_ADDR func_addr) | |
4193 | { | |
4194 | struct symtab_and_line prologue_sal; | |
4195 | CORE_ADDR start_pc; | |
4196 | CORE_ADDR end_pc; | |
4197 | ||
4198 | /* Get an initial range for the function. */ | |
4199 | find_pc_partial_function (func_addr, NULL, &start_pc, &end_pc); | |
cbf3b44a | 4200 | start_pc += gdbarch_deprecated_function_start_offset (current_gdbarch); |
634aa483 AC |
4201 | |
4202 | prologue_sal = find_pc_line (start_pc, 0); | |
4203 | if (prologue_sal.line != 0) | |
4204 | { | |
576c2025 FF |
4205 | /* If there is only one sal that covers the entire function, |
4206 | then it is probably a single line function, like | |
4207 | "foo(){}". */ | |
91934273 | 4208 | if (prologue_sal.end >= end_pc) |
4e463ff5 | 4209 | return 0; |
634aa483 AC |
4210 | while (prologue_sal.end < end_pc) |
4211 | { | |
4212 | struct symtab_and_line sal; | |
4213 | ||
4214 | sal = find_pc_line (prologue_sal.end, 0); | |
4215 | if (sal.line == 0) | |
4216 | break; | |
4217 | /* Assume that a consecutive SAL for the same (or larger) | |
4218 | line mark the prologue -> body transition. */ | |
4219 | if (sal.line >= prologue_sal.line) | |
4220 | break; | |
4221 | /* The case in which compiler's optimizer/scheduler has | |
4222 | moved instructions into the prologue. We look ahead in | |
4223 | the function looking for address ranges whose | |
4224 | corresponding line number is less the first one that we | |
4225 | found for the function. This is more conservative then | |
4226 | refine_prologue_limit which scans a large number of SALs | |
4227 | looking for any in the prologue */ | |
4228 | prologue_sal = sal; | |
4229 | } | |
4230 | } | |
4231 | return prologue_sal.end; | |
4232 | } | |
c906108c | 4233 | \f |
50641945 FN |
4234 | struct symtabs_and_lines |
4235 | decode_line_spec (char *string, int funfirstline) | |
4236 | { | |
4237 | struct symtabs_and_lines sals; | |
0378c332 FN |
4238 | struct symtab_and_line cursal; |
4239 | ||
50641945 | 4240 | if (string == 0) |
8a3fe4f8 | 4241 | error (_("Empty line specification.")); |
0378c332 FN |
4242 | |
4243 | /* We use whatever is set as the current source line. We do not try | |
4244 | and get a default or it will recursively call us! */ | |
4245 | cursal = get_current_source_symtab_and_line (); | |
4246 | ||
50641945 | 4247 | sals = decode_line_1 (&string, funfirstline, |
0378c332 | 4248 | cursal.symtab, cursal.line, |
bffe1ece | 4249 | (char ***) NULL, NULL); |
0378c332 | 4250 | |
50641945 | 4251 | if (*string) |
8a3fe4f8 | 4252 | error (_("Junk at end of line specification: %s"), string); |
50641945 FN |
4253 | return sals; |
4254 | } | |
c5aa993b | 4255 | |
51cc5b07 AC |
4256 | /* Track MAIN */ |
4257 | static char *name_of_main; | |
4258 | ||
4259 | void | |
4260 | set_main_name (const char *name) | |
4261 | { | |
4262 | if (name_of_main != NULL) | |
4263 | { | |
4264 | xfree (name_of_main); | |
4265 | name_of_main = NULL; | |
4266 | } | |
4267 | if (name != NULL) | |
4268 | { | |
4269 | name_of_main = xstrdup (name); | |
4270 | } | |
4271 | } | |
4272 | ||
ea53e89f JB |
4273 | /* Deduce the name of the main procedure, and set NAME_OF_MAIN |
4274 | accordingly. */ | |
4275 | ||
4276 | static void | |
4277 | find_main_name (void) | |
4278 | { | |
cd6c7346 | 4279 | const char *new_main_name; |
ea53e89f JB |
4280 | |
4281 | /* Try to see if the main procedure is in Ada. */ | |
4282 | /* FIXME: brobecker/2005-03-07: Another way of doing this would | |
4283 | be to add a new method in the language vector, and call this | |
4284 | method for each language until one of them returns a non-empty | |
4285 | name. This would allow us to remove this hard-coded call to | |
4286 | an Ada function. It is not clear that this is a better approach | |
4287 | at this point, because all methods need to be written in a way | |
4288 | such that false positives never be returned. For instance, it is | |
4289 | important that a method does not return a wrong name for the main | |
4290 | procedure if the main procedure is actually written in a different | |
4291 | language. It is easy to guaranty this with Ada, since we use a | |
4292 | special symbol generated only when the main in Ada to find the name | |
4293 | of the main procedure. It is difficult however to see how this can | |
4294 | be guarantied for languages such as C, for instance. This suggests | |
4295 | that order of call for these methods becomes important, which means | |
4296 | a more complicated approach. */ | |
4297 | new_main_name = ada_main_name (); | |
4298 | if (new_main_name != NULL) | |
4299 | { | |
4300 | set_main_name (new_main_name); | |
4301 | return; | |
4302 | } | |
4303 | ||
cd6c7346 PM |
4304 | new_main_name = pascal_main_name (); |
4305 | if (new_main_name != NULL) | |
4306 | { | |
4307 | set_main_name (new_main_name); | |
4308 | return; | |
4309 | } | |
4310 | ||
ea53e89f JB |
4311 | /* The languages above didn't identify the name of the main procedure. |
4312 | Fallback to "main". */ | |
4313 | set_main_name ("main"); | |
4314 | } | |
4315 | ||
51cc5b07 AC |
4316 | char * |
4317 | main_name (void) | |
4318 | { | |
ea53e89f JB |
4319 | if (name_of_main == NULL) |
4320 | find_main_name (); | |
4321 | ||
4322 | return name_of_main; | |
51cc5b07 AC |
4323 | } |
4324 | ||
ea53e89f JB |
4325 | /* Handle ``executable_changed'' events for the symtab module. */ |
4326 | ||
4327 | static void | |
781b42b0 | 4328 | symtab_observer_executable_changed (void) |
ea53e89f JB |
4329 | { |
4330 | /* NAME_OF_MAIN may no longer be the same, so reset it for now. */ | |
4331 | set_main_name (NULL); | |
4332 | } | |
51cc5b07 | 4333 | |
ed0616c6 VP |
4334 | /* Helper to expand_line_sal below. Appends new sal to SAL, |
4335 | initializing it from SYMTAB, LINENO and PC. */ | |
4336 | static void | |
4337 | append_expanded_sal (struct symtabs_and_lines *sal, | |
4338 | struct symtab *symtab, | |
4339 | int lineno, CORE_ADDR pc) | |
4340 | { | |
4341 | CORE_ADDR func_addr, func_end; | |
4342 | ||
4343 | sal->sals = xrealloc (sal->sals, | |
4344 | sizeof (sal->sals[0]) | |
4345 | * (sal->nelts + 1)); | |
4346 | init_sal (sal->sals + sal->nelts); | |
4347 | sal->sals[sal->nelts].symtab = symtab; | |
4348 | sal->sals[sal->nelts].section = NULL; | |
4349 | sal->sals[sal->nelts].end = 0; | |
4350 | sal->sals[sal->nelts].line = lineno; | |
4351 | sal->sals[sal->nelts].pc = pc; | |
4352 | ++sal->nelts; | |
4353 | } | |
4354 | ||
4355 | /* Compute a set of all sals in | |
4356 | the entire program that correspond to same file | |
4357 | and line as SAL and return those. If there | |
4358 | are several sals that belong to the same block, | |
4359 | only one sal for the block is included in results. */ | |
4360 | ||
4361 | struct symtabs_and_lines | |
4362 | expand_line_sal (struct symtab_and_line sal) | |
4363 | { | |
4364 | struct symtabs_and_lines ret, this_line; | |
4365 | int i, j; | |
4366 | struct objfile *objfile; | |
4367 | struct partial_symtab *psymtab; | |
4368 | struct symtab *symtab; | |
4369 | int lineno; | |
4370 | int deleted = 0; | |
4371 | struct block **blocks = NULL; | |
4372 | int *filter; | |
4373 | ||
4374 | ret.nelts = 0; | |
4375 | ret.sals = NULL; | |
4376 | ||
4377 | if (sal.symtab == NULL || sal.line == 0 || sal.pc != 0) | |
4378 | { | |
4379 | ret.sals = xmalloc (sizeof (struct symtab_and_line)); | |
4380 | ret.sals[0] = sal; | |
4381 | ret.nelts = 1; | |
4382 | return ret; | |
4383 | } | |
4384 | else | |
4385 | { | |
4386 | struct linetable_entry *best_item = 0; | |
4387 | struct symtab *best_symtab = 0; | |
4388 | int exact = 0; | |
4389 | ||
4390 | lineno = sal.line; | |
4391 | ||
4392 | /* We meed to find all symtabs for a file which name | |
4393 | is described by sal. We cannot just directly | |
4394 | iterate over symtabs, since a symtab might not be | |
4395 | yet created. We also cannot iterate over psymtabs, | |
4396 | calling PSYMTAB_TO_SYMTAB and working on that symtab, | |
4397 | since PSYMTAB_TO_SYMTAB will return NULL for psymtab | |
4398 | corresponding to an included file. Therefore, we do | |
4399 | first pass over psymtabs, reading in those with | |
4400 | the right name. Then, we iterate over symtabs, knowing | |
4401 | that all symtabs we're interested in are loaded. */ | |
4402 | ||
4403 | ALL_PSYMTABS (objfile, psymtab) | |
4404 | { | |
4405 | if (strcmp (sal.symtab->filename, | |
4406 | psymtab->filename) == 0) | |
4407 | PSYMTAB_TO_SYMTAB (psymtab); | |
4408 | } | |
4409 | ||
4410 | ||
4411 | /* For each symtab, we add all pcs to ret.sals. I'm actually | |
4412 | not sure what to do if we have exact match in one symtab, | |
4413 | and non-exact match on another symtab. | |
4414 | */ | |
4415 | ALL_SYMTABS (objfile, symtab) | |
4416 | { | |
4417 | if (strcmp (sal.symtab->filename, | |
4418 | symtab->filename) == 0) | |
4419 | { | |
4420 | struct linetable *l; | |
4421 | int len; | |
4422 | l = LINETABLE (symtab); | |
4423 | if (!l) | |
4424 | continue; | |
4425 | len = l->nitems; | |
4426 | ||
4427 | for (j = 0; j < len; j++) | |
4428 | { | |
4429 | struct linetable_entry *item = &(l->item[j]); | |
4430 | ||
4431 | if (item->line == lineno) | |
4432 | { | |
4433 | exact = 1; | |
4434 | append_expanded_sal (&ret, symtab, lineno, item->pc); | |
4435 | } | |
4436 | else if (!exact && item->line > lineno | |
4437 | && (best_item == NULL || item->line < best_item->line)) | |
4438 | ||
4439 | { | |
4440 | best_item = item; | |
4441 | best_symtab = symtab; | |
4442 | } | |
4443 | } | |
4444 | } | |
4445 | } | |
4446 | if (!exact && best_item) | |
4447 | append_expanded_sal (&ret, best_symtab, lineno, best_item->pc); | |
4448 | } | |
4449 | ||
4450 | /* For optimized code, compiler can scatter one source line accross | |
4451 | disjoint ranges of PC values, even when no duplicate functions | |
4452 | or inline functions are involved. For example, 'for (;;)' inside | |
4453 | non-template non-inline non-ctor-or-dtor function can result | |
4454 | in two PC ranges. In this case, we don't want to set breakpoint | |
4455 | on first PC of each range. To filter such cases, we use containing | |
4456 | blocks -- for each PC found above we see if there are other PCs | |
4457 | that are in the same block. If yes, the other PCs are filtered out. */ | |
4458 | ||
db009c8a JB |
4459 | filter = alloca (ret.nelts * sizeof (int)); |
4460 | blocks = alloca (ret.nelts * sizeof (struct block *)); | |
ed0616c6 VP |
4461 | for (i = 0; i < ret.nelts; ++i) |
4462 | { | |
4463 | filter[i] = 1; | |
4464 | blocks[i] = block_for_pc (ret.sals[i].pc); | |
4465 | } | |
4466 | ||
4467 | for (i = 0; i < ret.nelts; ++i) | |
4468 | if (blocks[i] != NULL) | |
4469 | for (j = i+1; j < ret.nelts; ++j) | |
4470 | if (blocks[j] == blocks[i]) | |
4471 | { | |
4472 | filter[j] = 0; | |
4473 | ++deleted; | |
4474 | break; | |
4475 | } | |
4476 | ||
4477 | { | |
4478 | struct symtab_and_line *final = | |
4479 | xmalloc (sizeof (struct symtab_and_line) * (ret.nelts-deleted)); | |
4480 | ||
4481 | for (i = 0, j = 0; i < ret.nelts; ++i) | |
4482 | if (filter[i]) | |
4483 | final[j++] = ret.sals[i]; | |
4484 | ||
4485 | ret.nelts -= deleted; | |
4486 | xfree (ret.sals); | |
4487 | ret.sals = final; | |
4488 | } | |
4489 | ||
4490 | return ret; | |
4491 | } | |
4492 | ||
4493 | ||
c906108c | 4494 | void |
fba45db2 | 4495 | _initialize_symtab (void) |
c906108c | 4496 | { |
1bedd215 AC |
4497 | add_info ("variables", variables_info, _("\ |
4498 | All global and static variable names, or those matching REGEXP.")); | |
c906108c | 4499 | if (dbx_commands) |
1bedd215 AC |
4500 | add_com ("whereis", class_info, variables_info, _("\ |
4501 | All global and static variable names, or those matching REGEXP.")); | |
c906108c SS |
4502 | |
4503 | add_info ("functions", functions_info, | |
1bedd215 | 4504 | _("All function names, or those matching REGEXP.")); |
c906108c | 4505 | |
357e46e7 | 4506 | |
c906108c SS |
4507 | /* FIXME: This command has at least the following problems: |
4508 | 1. It prints builtin types (in a very strange and confusing fashion). | |
4509 | 2. It doesn't print right, e.g. with | |
c5aa993b JM |
4510 | typedef struct foo *FOO |
4511 | type_print prints "FOO" when we want to make it (in this situation) | |
4512 | print "struct foo *". | |
c906108c SS |
4513 | I also think "ptype" or "whatis" is more likely to be useful (but if |
4514 | there is much disagreement "info types" can be fixed). */ | |
4515 | add_info ("types", types_info, | |
1bedd215 | 4516 | _("All type names, or those matching REGEXP.")); |
c906108c | 4517 | |
c906108c | 4518 | add_info ("sources", sources_info, |
1bedd215 | 4519 | _("Source files in the program.")); |
c906108c SS |
4520 | |
4521 | add_com ("rbreak", class_breakpoint, rbreak_command, | |
1bedd215 | 4522 | _("Set a breakpoint for all functions matching REGEXP.")); |
c906108c SS |
4523 | |
4524 | if (xdb_commands) | |
4525 | { | |
1bedd215 AC |
4526 | add_com ("lf", class_info, sources_info, |
4527 | _("Source files in the program")); | |
4528 | add_com ("lg", class_info, variables_info, _("\ | |
4529 | All global and static variable names, or those matching REGEXP.")); | |
c906108c SS |
4530 | } |
4531 | ||
717d2f5a JB |
4532 | add_setshow_enum_cmd ("multiple-symbols", no_class, |
4533 | multiple_symbols_modes, &multiple_symbols_mode, | |
4534 | _("\ | |
4535 | Set the debugger behavior when more than one symbol are possible matches\n\ | |
4536 | in an expression."), _("\ | |
4537 | Show how the debugger handles ambiguities in expressions."), _("\ | |
4538 | Valid values are \"ask\", \"all\", \"cancel\", and the default is \"all\"."), | |
4539 | NULL, NULL, &setlist, &showlist); | |
4540 | ||
c906108c SS |
4541 | /* Initialize the one built-in type that isn't language dependent... */ |
4542 | builtin_type_error = init_type (TYPE_CODE_ERROR, 0, 0, | |
4543 | "<unknown type>", (struct objfile *) NULL); | |
ea53e89f JB |
4544 | |
4545 | observer_attach_executable_changed (symtab_observer_executable_changed); | |
c906108c | 4546 | } |