Commit | Line | Data |
---|---|---|
bd5635a1 | 1 | /* Symbol table lookup for the GNU debugger, GDB. |
35a25840 SG |
2 | Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992 |
3 | Free Software Foundation, Inc. | |
bd5635a1 RP |
4 | |
5 | This file is part of GDB. | |
6 | ||
997a978c | 7 | This program is free software; you can redistribute it and/or modify |
bd5635a1 | 8 | it under the terms of the GNU General Public License as published by |
997a978c JG |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. | |
bd5635a1 | 11 | |
997a978c | 12 | This program is distributed in the hope that it will be useful, |
bd5635a1 RP |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
997a978c JG |
18 | along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
bd5635a1 | 20 | |
bd5635a1 RP |
21 | #include "defs.h" |
22 | #include "symtab.h" | |
cba0d141 | 23 | #include "gdbtypes.h" |
bd5635a1 RP |
24 | #include "gdbcore.h" |
25 | #include "frame.h" | |
26 | #include "target.h" | |
27 | #include "value.h" | |
28 | #include "symfile.h" | |
35a25840 | 29 | #include "objfiles.h" |
bd5635a1 | 30 | #include "gdbcmd.h" |
35a25840 | 31 | #include "call-cmds.h" |
5594d534 | 32 | #include "regex.h" |
cba0d141 | 33 | #include "expression.h" |
997a978c | 34 | #include "language.h" |
f70be3e4 | 35 | #include "demangle.h" |
bd5635a1 RP |
36 | |
37 | #include <obstack.h> | |
38 | #include <assert.h> | |
39 | ||
40 | #include <sys/types.h> | |
41 | #include <fcntl.h> | |
42 | #include <string.h> | |
43 | #include <sys/stat.h> | |
2cd99985 | 44 | #include <ctype.h> |
bd5635a1 | 45 | |
cba0d141 | 46 | /* Prototypes for local functions */ |
bd5635a1 | 47 | |
2cd99985 | 48 | extern int |
2e4964ad | 49 | find_methods PARAMS ((struct type *, char *, struct symbol **)); |
cba0d141 JG |
50 | |
51 | static void | |
f1ed4330 | 52 | completion_list_add_name PARAMS ((char *, char *, int, char *, char *)); |
cba0d141 | 53 | |
6f87ec4a PS |
54 | static void |
55 | build_canonical_line_spec PARAMS ((struct symtab_and_line *, char *, char ***)); | |
56 | ||
cba0d141 | 57 | static struct symtabs_and_lines |
6f87ec4a | 58 | decode_line_2 PARAMS ((struct symbol *[], int, int, char ***)); |
cba0d141 JG |
59 | |
60 | static void | |
35a25840 | 61 | rbreak_command PARAMS ((char *, int)); |
cba0d141 JG |
62 | |
63 | static void | |
35a25840 | 64 | types_info PARAMS ((char *, int)); |
cba0d141 JG |
65 | |
66 | static void | |
35a25840 | 67 | functions_info PARAMS ((char *, int)); |
cba0d141 JG |
68 | |
69 | static void | |
35a25840 | 70 | variables_info PARAMS ((char *, int)); |
cba0d141 JG |
71 | |
72 | static void | |
35a25840 | 73 | sources_info PARAMS ((char *, int)); |
cba0d141 JG |
74 | |
75 | static void | |
35a25840 | 76 | list_symbols PARAMS ((char *, int, int)); |
cba0d141 JG |
77 | |
78 | static void | |
79 | output_source_filename PARAMS ((char *, int *)); | |
80 | ||
81 | static char * | |
82 | operator_chars PARAMS ((char *, char **)); | |
83 | ||
018ab14f | 84 | static int find_line_common PARAMS ((struct linetable *, int, int *)); |
cba0d141 JG |
85 | |
86 | static struct partial_symbol * | |
87 | lookup_partial_symbol PARAMS ((struct partial_symtab *, const char *, | |
88 | int, enum namespace)); | |
89 | ||
cba0d141 JG |
90 | static struct symtab * |
91 | lookup_symtab_1 PARAMS ((char *)); | |
92 | ||
93 | /* */ | |
bd5635a1 | 94 | |
997a978c | 95 | /* The single non-language-specific builtin type */ |
bd5635a1 RP |
96 | struct type *builtin_type_error; |
97 | ||
98 | /* Block in which the most recently searched-for symbol was found. | |
99 | Might be better to make this a parameter to lookup_symbol and | |
100 | value_of_this. */ | |
cba0d141 JG |
101 | |
102 | const struct block *block_found; | |
bd5635a1 RP |
103 | |
104 | char no_symtab_msg[] = "No symbol table is loaded. Use the \"file\" command."; | |
105 | ||
f70be3e4 JG |
106 | /* While the C++ support is still in flux, issue a possibly helpful hint on |
107 | using the new command completion feature on single quoted demangled C++ | |
108 | symbols. Remove when loose ends are cleaned up. FIXME -fnf */ | |
109 | ||
110 | void | |
111 | cplusplus_hint (name) | |
112 | char *name; | |
113 | { | |
114 | printf ("Hint: try '%s<TAB> or '%s<ESC-?>\n", name, name); | |
115 | printf ("(Note leading single quote.)\n"); | |
116 | } | |
117 | ||
bd5635a1 RP |
118 | /* Check for a symtab of a specific name; first in symtabs, then in |
119 | psymtabs. *If* there is no '/' in the name, a match after a '/' | |
120 | in the symtab filename will also work. */ | |
121 | ||
122 | static struct symtab * | |
123 | lookup_symtab_1 (name) | |
124 | char *name; | |
125 | { | |
126 | register struct symtab *s; | |
127 | register struct partial_symtab *ps; | |
35a25840 | 128 | register char *slash; |
cba0d141 | 129 | register struct objfile *objfile; |
bd5635a1 | 130 | |
784fd92b | 131 | got_symtab: |
35a25840 | 132 | |
784fd92b SG |
133 | /* First, search for an exact match */ |
134 | ||
135 | ALL_SYMTABS (objfile, s) | |
2e4964ad | 136 | if (STREQ (name, s->filename)) |
784fd92b | 137 | return s; |
35a25840 SG |
138 | |
139 | slash = strchr (name, '/'); | |
784fd92b SG |
140 | |
141 | /* Now, search for a matching tail (only if name doesn't have any dirs) */ | |
35a25840 | 142 | |
bd5635a1 | 143 | if (!slash) |
784fd92b SG |
144 | ALL_SYMTABS (objfile, s) |
145 | { | |
146 | char *p = s -> filename; | |
147 | char *tail = strrchr (p, '/'); | |
148 | ||
149 | if (tail) | |
150 | p = tail + 1; | |
151 | ||
2e4964ad | 152 | if (STREQ (p, name)) |
784fd92b SG |
153 | return s; |
154 | } | |
155 | ||
156 | /* Same search rules as above apply here, but now we look thru the | |
157 | psymtabs. */ | |
158 | ||
159 | ALL_PSYMTABS (objfile, ps) | |
2e4964ad | 160 | if (STREQ (name, ps -> filename)) |
784fd92b SG |
161 | goto got_psymtab; |
162 | ||
163 | if (!slash) | |
164 | ALL_PSYMTABS (objfile, ps) | |
165 | { | |
166 | char *p = ps -> filename; | |
167 | char *tail = strrchr (p, '/'); | |
168 | ||
169 | if (tail) | |
170 | p = tail + 1; | |
171 | ||
2e4964ad | 172 | if (STREQ (p, name)) |
784fd92b SG |
173 | goto got_psymtab; |
174 | } | |
bd5635a1 | 175 | |
cba0d141 | 176 | return (NULL); |
784fd92b SG |
177 | |
178 | got_psymtab: | |
179 | ||
180 | if (ps -> readin) | |
35fcebce PB |
181 | error ("Internal: readin %s pst for `%s' found when no symtab found.", |
182 | ps -> filename, name); | |
784fd92b SG |
183 | |
184 | s = PSYMTAB_TO_SYMTAB (ps); | |
185 | ||
186 | if (s) | |
187 | return s; | |
188 | ||
189 | /* At this point, we have located the psymtab for this file, but | |
190 | the conversion to a symtab has failed. This usually happens | |
191 | when we are looking up an include file. In this case, | |
192 | PSYMTAB_TO_SYMTAB doesn't return a symtab, even though one has | |
193 | been created. So, we need to run through the symtabs again in | |
194 | order to find the file. | |
195 | XXX - This is a crock, and should be fixed inside of the the | |
196 | symbol parsing routines. */ | |
197 | goto got_symtab; | |
bd5635a1 RP |
198 | } |
199 | ||
200 | /* Lookup the symbol table of a source file named NAME. Try a couple | |
201 | of variations if the first lookup doesn't work. */ | |
202 | ||
203 | struct symtab * | |
204 | lookup_symtab (name) | |
205 | char *name; | |
206 | { | |
207 | register struct symtab *s; | |
208 | register char *copy; | |
209 | ||
210 | s = lookup_symtab_1 (name); | |
211 | if (s) return s; | |
212 | ||
213 | /* If name not found as specified, see if adding ".c" helps. */ | |
214 | ||
215 | copy = (char *) alloca (strlen (name) + 3); | |
216 | strcpy (copy, name); | |
217 | strcat (copy, ".c"); | |
218 | s = lookup_symtab_1 (copy); | |
219 | if (s) return s; | |
220 | ||
221 | /* We didn't find anything; die. */ | |
222 | return 0; | |
223 | } | |
224 | ||
225 | /* Lookup the partial symbol table of a source file named NAME. This | |
226 | only returns true on an exact match (ie. this semantics are | |
227 | different from lookup_symtab. */ | |
228 | ||
229 | struct partial_symtab * | |
230 | lookup_partial_symtab (name) | |
231 | char *name; | |
232 | { | |
cba0d141 JG |
233 | register struct partial_symtab *pst; |
234 | register struct objfile *objfile; | |
bd5635a1 | 235 | |
35a25840 | 236 | ALL_PSYMTABS (objfile, pst) |
bd5635a1 | 237 | { |
2e4964ad | 238 | if (STREQ (name, pst -> filename)) |
bd5635a1 | 239 | { |
35a25840 | 240 | return (pst); |
bd5635a1 | 241 | } |
35a25840 | 242 | } |
cba0d141 | 243 | return (NULL); |
bd5635a1 | 244 | } |
cba0d141 | 245 | \f |
0b28c260 JK |
246 | /* Demangle a GDB method stub type. |
247 | Note that this function is g++ specific. */ | |
248 | ||
bd5635a1 | 249 | char * |
bcccec8c | 250 | gdb_mangle_name (type, i, j) |
bd5635a1 | 251 | struct type *type; |
bcccec8c | 252 | int i, j; |
bd5635a1 | 253 | { |
bcccec8c PB |
254 | int mangled_name_len; |
255 | char *mangled_name; | |
256 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i); | |
257 | struct fn_field *method = &f[j]; | |
258 | char *field_name = TYPE_FN_FIELDLIST_NAME (type, i); | |
8050a57b | 259 | char *physname = TYPE_FN_FIELD_PHYSNAME (f, j); |
35fcebce | 260 | char *newname = type_name_no_tag (type); |
018ab14f | 261 | int is_constructor = newname != NULL && STREQ (field_name, newname); |
ca6a826d | 262 | int is_destructor = is_constructor && DESTRUCTOR_PREFIX_P (physname); |
bcccec8c | 263 | /* Need a new type prefix. */ |
bcccec8c PB |
264 | char *const_prefix = method->is_const ? "C" : ""; |
265 | char *volatile_prefix = method->is_volatile ? "V" : ""; | |
bcccec8c | 266 | char buf[20]; |
35fcebce | 267 | #ifndef GCC_MANGLE_BUG |
018ab14f | 268 | int len = newname == NULL ? 0 : strlen (newname); |
35fcebce PB |
269 | |
270 | if (is_destructor) | |
271 | { | |
272 | mangled_name = (char*) xmalloc(strlen(physname)+1); | |
273 | strcpy(mangled_name, physname); | |
274 | return mangled_name; | |
275 | } | |
276 | ||
277 | sprintf (buf, "__%s%s%d", const_prefix, volatile_prefix, len); | |
278 | mangled_name_len = ((is_constructor ? 0 : strlen (field_name)) | |
279 | + strlen (buf) + len | |
280 | + strlen (physname) | |
281 | + 1); | |
282 | ||
283 | /* Only needed for GNU-mangled names. ANSI-mangled names | |
284 | work with the normal mechanisms. */ | |
285 | if (OPNAME_PREFIX_P (field_name)) | |
286 | { | |
287 | char *opname = cplus_mangle_opname (field_name + 3, 0); | |
288 | if (opname == NULL) | |
289 | error ("No mangling for \"%s\"", field_name); | |
290 | mangled_name_len += strlen (opname); | |
291 | mangled_name = (char *)xmalloc (mangled_name_len); | |
292 | ||
293 | strncpy (mangled_name, field_name, 3); | |
294 | mangled_name[3] = '\0'; | |
295 | strcat (mangled_name, opname); | |
296 | } | |
297 | else | |
298 | { | |
299 | mangled_name = (char *)xmalloc (mangled_name_len); | |
300 | if (is_constructor) | |
301 | mangled_name[0] = '\0'; | |
302 | else | |
303 | strcpy (mangled_name, field_name); | |
304 | } | |
305 | strcat (mangled_name, buf); | |
018ab14f PS |
306 | /* If the class doesn't have a name, i.e. newname NULL, then we just |
307 | mangle it using 0 for the length of the class. Thus it gets mangled | |
308 | as something starting with `::' rather than `classname::'. */ | |
309 | if (newname != NULL) | |
310 | strcat (mangled_name, newname); | |
35fcebce PB |
311 | #else |
312 | char *opname; | |
bcccec8c | 313 | |
8050a57b FF |
314 | if (is_constructor) |
315 | { | |
316 | buf[0] = '\0'; | |
317 | } | |
318 | else | |
319 | { | |
320 | sprintf (buf, "__%s%s", const_prefix, volatile_prefix); | |
321 | } | |
322 | ||
7c4f3f4a | 323 | mangled_name_len = ((is_constructor ? 0 : strlen (field_name)) |
8050a57b | 324 | + strlen (buf) + strlen (physname) + 1); |
bcccec8c | 325 | |
7d9884b9 JG |
326 | /* Only needed for GNU-mangled names. ANSI-mangled names |
327 | work with the normal mechanisms. */ | |
bcccec8c PB |
328 | if (OPNAME_PREFIX_P (field_name)) |
329 | { | |
8050a57b | 330 | opname = cplus_mangle_opname (field_name + 3, 0); |
bcccec8c | 331 | if (opname == NULL) |
8050a57b FF |
332 | { |
333 | error ("No mangling for \"%s\"", field_name); | |
334 | } | |
bcccec8c | 335 | mangled_name_len += strlen (opname); |
8050a57b | 336 | mangled_name = (char *) xmalloc (mangled_name_len); |
bcccec8c PB |
337 | |
338 | strncpy (mangled_name, field_name, 3); | |
8050a57b | 339 | strcpy (mangled_name + 3, opname); |
bcccec8c PB |
340 | } |
341 | else | |
bd5635a1 | 342 | { |
8050a57b | 343 | mangled_name = (char *) xmalloc (mangled_name_len); |
7c4f3f4a | 344 | if (is_constructor) |
8050a57b FF |
345 | { |
346 | mangled_name[0] = '\0'; | |
347 | } | |
7c4f3f4a | 348 | else |
8050a57b FF |
349 | { |
350 | strcpy (mangled_name, field_name); | |
351 | } | |
bd5635a1 | 352 | } |
bcccec8c | 353 | strcat (mangled_name, buf); |
bcccec8c | 354 | |
35fcebce PB |
355 | #endif |
356 | strcat (mangled_name, physname); | |
8050a57b | 357 | return (mangled_name); |
bd5635a1 RP |
358 | } |
359 | ||
cba0d141 JG |
360 | \f |
361 | /* Find which partial symtab on contains PC. Return 0 if none. */ | |
f1d77e90 | 362 | |
cba0d141 JG |
363 | struct partial_symtab * |
364 | find_pc_psymtab (pc) | |
365 | register CORE_ADDR pc; | |
d96b54ea | 366 | { |
cba0d141 JG |
367 | register struct partial_symtab *pst; |
368 | register struct objfile *objfile; | |
d96b54ea | 369 | |
35a25840 | 370 | ALL_PSYMTABS (objfile, pst) |
bd5635a1 | 371 | { |
c1878f87 SG |
372 | if (pc >= pst->textlow && pc < pst->texthigh) |
373 | return (pst); | |
bd5635a1 | 374 | } |
cba0d141 | 375 | return (NULL); |
bd5635a1 RP |
376 | } |
377 | ||
378 | /* Find which partial symbol within a psymtab contains PC. Return 0 | |
379 | if none. Check all psymtabs if PSYMTAB is 0. */ | |
380 | struct partial_symbol * | |
381 | find_pc_psymbol (psymtab, pc) | |
382 | struct partial_symtab *psymtab; | |
383 | CORE_ADDR pc; | |
384 | { | |
385 | struct partial_symbol *best, *p; | |
386 | CORE_ADDR best_pc; | |
387 | ||
388 | if (!psymtab) | |
389 | psymtab = find_pc_psymtab (pc); | |
390 | if (!psymtab) | |
391 | return 0; | |
392 | ||
393 | best_pc = psymtab->textlow - 1; | |
394 | ||
cba0d141 JG |
395 | for (p = psymtab->objfile->static_psymbols.list + psymtab->statics_offset; |
396 | (p - (psymtab->objfile->static_psymbols.list + psymtab->statics_offset) | |
bd5635a1 RP |
397 | < psymtab->n_static_syms); |
398 | p++) | |
399 | if (SYMBOL_NAMESPACE (p) == VAR_NAMESPACE | |
400 | && SYMBOL_CLASS (p) == LOC_BLOCK | |
401 | && pc >= SYMBOL_VALUE_ADDRESS (p) | |
402 | && SYMBOL_VALUE_ADDRESS (p) > best_pc) | |
403 | { | |
404 | best_pc = SYMBOL_VALUE_ADDRESS (p); | |
405 | best = p; | |
406 | } | |
407 | if (best_pc == psymtab->textlow - 1) | |
408 | return 0; | |
409 | return best; | |
410 | } | |
411 | ||
412 | \f | |
413 | /* Find the definition for a specified symbol name NAME | |
414 | in namespace NAMESPACE, visible from lexical block BLOCK. | |
415 | Returns the struct symbol pointer, or zero if no symbol is found. | |
416 | If SYMTAB is non-NULL, store the symbol table in which the | |
417 | symbol was found there, or NULL if not found. | |
418 | C++: if IS_A_FIELD_OF_THIS is nonzero on entry, check to see if | |
419 | NAME is a field of the current implied argument `this'. If so set | |
420 | *IS_A_FIELD_OF_THIS to 1, otherwise set it to zero. | |
421 | BLOCK_FOUND is set to the block in which NAME is found (in the case of | |
422 | a field of `this', value_of_this sets BLOCK_FOUND to the proper value.) */ | |
423 | ||
424 | struct symbol * | |
425 | lookup_symbol (name, block, namespace, is_a_field_of_this, symtab) | |
cba0d141 JG |
426 | const char *name; |
427 | register const struct block *block; | |
428 | const enum namespace namespace; | |
bd5635a1 RP |
429 | int *is_a_field_of_this; |
430 | struct symtab **symtab; | |
431 | { | |
432 | register struct symbol *sym; | |
433 | register struct symtab *s; | |
434 | register struct partial_symtab *ps; | |
435 | struct blockvector *bv; | |
cba0d141 JG |
436 | register struct objfile *objfile; |
437 | register struct block *b; | |
cba0d141 | 438 | register struct minimal_symbol *msymbol; |
f70be3e4 JG |
439 | char *temp; |
440 | extern char *gdb_completer_word_break_characters; | |
441 | ||
bd5635a1 RP |
442 | /* Search specified block and its superiors. */ |
443 | ||
444 | while (block != 0) | |
445 | { | |
446 | sym = lookup_block_symbol (block, name, namespace); | |
447 | if (sym) | |
448 | { | |
449 | block_found = block; | |
450 | if (symtab != NULL) | |
451 | { | |
452 | /* Search the list of symtabs for one which contains the | |
453 | address of the start of this block. */ | |
35a25840 | 454 | ALL_SYMTABS (objfile, s) |
bd5635a1 | 455 | { |
35a25840 SG |
456 | bv = BLOCKVECTOR (s); |
457 | b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
458 | if (BLOCK_START (b) <= BLOCK_START (block) | |
459 | && BLOCK_END (b) > BLOCK_START (block)) | |
460 | goto found; | |
bd5635a1 | 461 | } |
35a25840 | 462 | found: |
bd5635a1 RP |
463 | *symtab = s; |
464 | } | |
465 | ||
cba0d141 | 466 | return (sym); |
bd5635a1 RP |
467 | } |
468 | block = BLOCK_SUPERBLOCK (block); | |
469 | } | |
470 | ||
0b28c260 JK |
471 | /* FIXME: this code is never executed--block is always NULL at this |
472 | point. What is it trying to do, anyway? We already should have | |
473 | checked the STATIC_BLOCK above (it is the superblock of top-level | |
474 | blocks). Why is VAR_NAMESPACE special-cased? */ | |
2e4964ad | 475 | /* Don't need to mess with the psymtabs; if we have a block, |
b039ac3a JK |
476 | that file is read in. If we don't, then we deal later with |
477 | all the psymtab stuff that needs checking. */ | |
478 | if (namespace == VAR_NAMESPACE && block != NULL) | |
479 | { | |
480 | struct block *b; | |
481 | /* Find the right symtab. */ | |
35a25840 | 482 | ALL_SYMTABS (objfile, s) |
b039ac3a | 483 | { |
35a25840 SG |
484 | bv = BLOCKVECTOR (s); |
485 | b = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
486 | if (BLOCK_START (b) <= BLOCK_START (block) | |
487 | && BLOCK_END (b) > BLOCK_START (block)) | |
b039ac3a | 488 | { |
2e4964ad | 489 | sym = lookup_block_symbol (b, name, VAR_NAMESPACE); |
35a25840 | 490 | if (sym) |
b039ac3a | 491 | { |
35a25840 SG |
492 | block_found = b; |
493 | if (symtab != NULL) | |
494 | *symtab = s; | |
495 | return sym; | |
b039ac3a JK |
496 | } |
497 | } | |
498 | } | |
499 | } | |
500 | ||
501 | ||
bd5635a1 RP |
502 | /* C++: If requested to do so by the caller, |
503 | check to see if NAME is a field of `this'. */ | |
504 | if (is_a_field_of_this) | |
505 | { | |
506 | struct value *v = value_of_this (0); | |
507 | ||
508 | *is_a_field_of_this = 0; | |
509 | if (v && check_field (v, name)) | |
510 | { | |
511 | *is_a_field_of_this = 1; | |
512 | if (symtab != NULL) | |
513 | *symtab = NULL; | |
514 | return 0; | |
515 | } | |
516 | } | |
517 | ||
518 | /* Now search all global blocks. Do the symtab's first, then | |
519 | check the psymtab's */ | |
cba0d141 | 520 | |
35a25840 | 521 | ALL_SYMTABS (objfile, s) |
bd5635a1 | 522 | { |
35a25840 SG |
523 | bv = BLOCKVECTOR (s); |
524 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
525 | sym = lookup_block_symbol (block, name, namespace); | |
526 | if (sym) | |
bd5635a1 | 527 | { |
35a25840 SG |
528 | block_found = block; |
529 | if (symtab != NULL) | |
530 | *symtab = s; | |
531 | return sym; | |
bd5635a1 RP |
532 | } |
533 | } | |
534 | ||
535 | /* Check for the possibility of the symbol being a global function | |
cba0d141 | 536 | that is stored in one of the minimal symbol tables. Eventually, all |
bd5635a1 RP |
537 | global symbols might be resolved in this way. */ |
538 | ||
539 | if (namespace == VAR_NAMESPACE) | |
540 | { | |
cba0d141 | 541 | msymbol = lookup_minimal_symbol (name, (struct objfile *) NULL); |
f70be3e4 | 542 | if (msymbol != NULL) |
bd5635a1 | 543 | { |
2e4964ad | 544 | s = find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol)); |
318bf84f | 545 | /* If S is NULL, there are no debug symbols for this file. |
997a978c | 546 | Skip this stuff and check for matching static symbols below. */ |
318bf84f | 547 | if (s != NULL) |
bd5635a1 RP |
548 | { |
549 | bv = BLOCKVECTOR (s); | |
3ba6a043 | 550 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); |
2e4964ad FF |
551 | sym = lookup_block_symbol (block, SYMBOL_NAME (msymbol), |
552 | namespace); | |
318bf84f | 553 | /* We kept static functions in minimal symbol table as well as |
818de002 | 554 | in static scope. We want to find them in the symbol table. */ |
818de002 PB |
555 | if (!sym) { |
556 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
2e4964ad | 557 | sym = lookup_block_symbol (block, SYMBOL_NAME (msymbol), |
318bf84f | 558 | namespace); |
818de002 | 559 | } |
818de002 | 560 | |
cba0d141 | 561 | /* sym == 0 if symbol was found in the minimal symbol table |
bd5635a1 | 562 | but not in the symtab. |
cba0d141 | 563 | Return 0 to use the msymbol definition of "foo_". |
bd5635a1 RP |
564 | |
565 | This happens for Fortran "foo_" symbols, | |
566 | which are "foo" in the symtab. | |
567 | ||
568 | This can also happen if "asm" is used to make a | |
569 | regular symbol but not a debugging symbol, e.g. | |
570 | asm(".globl _main"); | |
571 | asm("_main:"); | |
572 | */ | |
573 | ||
574 | if (symtab != NULL) | |
575 | *symtab = s; | |
576 | return sym; | |
577 | } | |
578 | } | |
579 | } | |
580 | ||
35a25840 | 581 | ALL_PSYMTABS (objfile, ps) |
cba0d141 | 582 | { |
35a25840 | 583 | if (!ps->readin && lookup_partial_symbol (ps, name, 1, namespace)) |
cba0d141 | 584 | { |
35a25840 SG |
585 | s = PSYMTAB_TO_SYMTAB(ps); |
586 | bv = BLOCKVECTOR (s); | |
587 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
588 | sym = lookup_block_symbol (block, name, namespace); | |
589 | if (!sym) | |
35fcebce | 590 | error ("Internal: global symbol `%s' found in %s psymtab but not in symtab", name, ps->filename); |
35a25840 SG |
591 | if (symtab != NULL) |
592 | *symtab = s; | |
593 | return sym; | |
cba0d141 JG |
594 | } |
595 | } | |
bd5635a1 RP |
596 | |
597 | /* Now search all per-file blocks. | |
598 | Not strictly correct, but more useful than an error. | |
599 | Do the symtabs first, then check the psymtabs */ | |
600 | ||
35a25840 | 601 | ALL_SYMTABS (objfile, s) |
bd5635a1 | 602 | { |
35a25840 SG |
603 | bv = BLOCKVECTOR (s); |
604 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
605 | sym = lookup_block_symbol (block, name, namespace); | |
606 | if (sym) | |
bd5635a1 | 607 | { |
35a25840 SG |
608 | block_found = block; |
609 | if (symtab != NULL) | |
610 | *symtab = s; | |
611 | return sym; | |
612 | } | |
613 | } | |
614 | ||
615 | ALL_PSYMTABS (objfile, ps) | |
616 | { | |
617 | if (!ps->readin && lookup_partial_symbol (ps, name, 0, namespace)) | |
618 | { | |
619 | s = PSYMTAB_TO_SYMTAB(ps); | |
cba0d141 JG |
620 | bv = BLOCKVECTOR (s); |
621 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
622 | sym = lookup_block_symbol (block, name, namespace); | |
35a25840 | 623 | if (!sym) |
35fcebce | 624 | error ("Internal: static symbol `%s' found in %s psymtab but not in symtab", name, ps->filename); |
35a25840 SG |
625 | if (symtab != NULL) |
626 | *symtab = s; | |
627 | return sym; | |
628 | } | |
629 | } | |
630 | ||
631 | /* Now search all per-file blocks for static mangled symbols. | |
632 | Do the symtabs first, then check the psymtabs. */ | |
633 | ||
634 | if (namespace == VAR_NAMESPACE) | |
635 | { | |
636 | ALL_SYMTABS (objfile, s) | |
637 | { | |
638 | bv = BLOCKVECTOR (s); | |
639 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
2e4964ad | 640 | sym = lookup_block_symbol (block, name, VAR_NAMESPACE); |
cba0d141 JG |
641 | if (sym) |
642 | { | |
643 | block_found = block; | |
644 | if (symtab != NULL) | |
645 | *symtab = s; | |
646 | return sym; | |
647 | } | |
bd5635a1 | 648 | } |
bd5635a1 | 649 | |
35a25840 | 650 | ALL_PSYMTABS (objfile, ps) |
cba0d141 | 651 | { |
2e4964ad | 652 | if (!ps->readin && lookup_partial_symbol (ps, name, 0, VAR_NAMESPACE)) |
cba0d141 JG |
653 | { |
654 | s = PSYMTAB_TO_SYMTAB(ps); | |
655 | bv = BLOCKVECTOR (s); | |
656 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
2e4964ad | 657 | sym = lookup_block_symbol (block, name, VAR_NAMESPACE); |
cba0d141 | 658 | if (!sym) |
35fcebce | 659 | error ("Internal: mangled static symbol `%s' found in %s psymtab but not in symtab", name, ps->filename); |
cba0d141 JG |
660 | if (symtab != NULL) |
661 | *symtab = s; | |
662 | return sym; | |
663 | } | |
664 | } | |
665 | } | |
bd5635a1 RP |
666 | |
667 | if (symtab != NULL) | |
668 | *symtab = NULL; | |
669 | return 0; | |
670 | } | |
671 | ||
672 | /* Look, in partial_symtab PST, for symbol NAME. Check the global | |
673 | symbols if GLOBAL, the static symbols if not */ | |
674 | ||
675 | static struct partial_symbol * | |
676 | lookup_partial_symbol (pst, name, global, namespace) | |
677 | struct partial_symtab *pst; | |
cba0d141 | 678 | const char *name; |
bd5635a1 RP |
679 | int global; |
680 | enum namespace namespace; | |
681 | { | |
682 | struct partial_symbol *start, *psym; | |
2e4964ad | 683 | struct partial_symbol *top, *bottom, *center; |
bd5635a1 | 684 | int length = (global ? pst->n_global_syms : pst->n_static_syms); |
2e4964ad | 685 | int do_linear_search = 1; |
bd5635a1 | 686 | |
2e4964ad FF |
687 | if (length == 0) |
688 | { | |
689 | return (NULL); | |
690 | } | |
bd5635a1 RP |
691 | |
692 | start = (global ? | |
cba0d141 JG |
693 | pst->objfile->global_psymbols.list + pst->globals_offset : |
694 | pst->objfile->static_psymbols.list + pst->statics_offset ); | |
bd5635a1 | 695 | |
2e4964ad | 696 | if (global) /* This means we can use a binary search. */ |
bd5635a1 | 697 | { |
2e4964ad | 698 | do_linear_search = 0; |
bd5635a1 RP |
699 | |
700 | /* Binary search. This search is guaranteed to end with center | |
701 | pointing at the earliest partial symbol with the correct | |
702 | name. At that point *all* partial symbols with that name | |
703 | will be checked against the correct namespace. */ | |
2e4964ad | 704 | |
bd5635a1 RP |
705 | bottom = start; |
706 | top = start + length - 1; | |
707 | while (top > bottom) | |
708 | { | |
709 | center = bottom + (top - bottom) / 2; | |
bd5635a1 | 710 | assert (center < top); |
2e4964ad FF |
711 | if (!do_linear_search && SYMBOL_LANGUAGE (center) == language_cplus) |
712 | { | |
713 | do_linear_search = 1; | |
714 | } | |
715 | if (STRCMP (SYMBOL_NAME (center), name) >= 0) | |
716 | { | |
717 | top = center; | |
718 | } | |
bd5635a1 | 719 | else |
2e4964ad FF |
720 | { |
721 | bottom = center + 1; | |
722 | } | |
bd5635a1 RP |
723 | } |
724 | assert (top == bottom); | |
2e4964ad | 725 | while (STREQ (SYMBOL_NAME (top), name)) |
bd5635a1 RP |
726 | { |
727 | if (SYMBOL_NAMESPACE (top) == namespace) | |
2e4964ad FF |
728 | { |
729 | return top; | |
730 | } | |
bd5635a1 RP |
731 | top ++; |
732 | } | |
733 | } | |
2e4964ad FF |
734 | |
735 | /* Can't use a binary search or else we found during the binary search that | |
736 | we should also do a linear search. */ | |
737 | ||
738 | if (do_linear_search) | |
bd5635a1 | 739 | { |
bd5635a1 | 740 | for (psym = start; psym < start + length; psym++) |
2e4964ad FF |
741 | { |
742 | if (namespace == SYMBOL_NAMESPACE (psym)) | |
743 | { | |
744 | if (SYMBOL_MATCHES_NAME (psym, name)) | |
745 | { | |
746 | return (psym); | |
747 | } | |
748 | } | |
749 | } | |
bd5635a1 RP |
750 | } |
751 | ||
2e4964ad | 752 | return (NULL); |
bd5635a1 RP |
753 | } |
754 | ||
0e2a896c | 755 | /* Find the psymtab containing main(). */ |
c1878f87 SG |
756 | /* FIXME: What about languages without main() or specially linked |
757 | executables that have no main() ? */ | |
0e2a896c PB |
758 | |
759 | struct partial_symtab * | |
760 | find_main_psymtab () | |
761 | { | |
762 | register struct partial_symtab *pst; | |
cba0d141 JG |
763 | register struct objfile *objfile; |
764 | ||
35a25840 | 765 | ALL_PSYMTABS (objfile, pst) |
cba0d141 | 766 | { |
35a25840 | 767 | if (lookup_partial_symbol (pst, "main", 1, VAR_NAMESPACE)) |
cba0d141 | 768 | { |
35a25840 | 769 | return (pst); |
cba0d141 JG |
770 | } |
771 | } | |
772 | return (NULL); | |
0e2a896c PB |
773 | } |
774 | ||
2e4964ad FF |
775 | /* Search BLOCK for symbol NAME in NAMESPACE. |
776 | ||
777 | Note that if NAME is the demangled form of a C++ symbol, we will fail | |
778 | to find a match during the binary search of the non-encoded names, but | |
779 | for now we don't worry about the slight inefficiency of looking for | |
780 | a match we'll never find, since it will go pretty quick. Once the | |
781 | binary search terminates, we drop through and do a straight linear | |
782 | search on the symbols. Each symbol which is marked as being a C++ | |
783 | symbol (language_cplus set) has both the encoded and non-encoded names | |
784 | tested for a match. */ | |
bd5635a1 RP |
785 | |
786 | struct symbol * | |
787 | lookup_block_symbol (block, name, namespace) | |
cba0d141 JG |
788 | register const struct block *block; |
789 | const char *name; | |
790 | const enum namespace namespace; | |
bd5635a1 RP |
791 | { |
792 | register int bot, top, inc; | |
2e4964ad FF |
793 | register struct symbol *sym; |
794 | register struct symbol *sym_found = NULL; | |
795 | register int do_linear_search = 1; | |
bd5635a1 RP |
796 | |
797 | /* If the blocks's symbols were sorted, start with a binary search. */ | |
798 | ||
799 | if (BLOCK_SHOULD_SORT (block)) | |
800 | { | |
2e4964ad FF |
801 | /* Reset the linear search flag so if the binary search fails, we |
802 | won't do the linear search once unless we find some reason to | |
803 | do so, such as finding a C++ symbol during the binary search. | |
804 | Note that for C++ modules, ALL the symbols in a block should | |
805 | end up marked as C++ symbols. */ | |
806 | ||
807 | do_linear_search = 0; | |
808 | top = BLOCK_NSYMS (block); | |
809 | bot = 0; | |
810 | ||
811 | /* Advance BOT to not far before the first symbol whose name is NAME. */ | |
bd5635a1 RP |
812 | |
813 | while (1) | |
814 | { | |
815 | inc = (top - bot + 1); | |
816 | /* No need to keep binary searching for the last few bits worth. */ | |
817 | if (inc < 4) | |
2e4964ad FF |
818 | { |
819 | break; | |
820 | } | |
bd5635a1 RP |
821 | inc = (inc >> 1) + bot; |
822 | sym = BLOCK_SYM (block, inc); | |
2e4964ad FF |
823 | if (!do_linear_search && SYMBOL_LANGUAGE (sym) == language_cplus) |
824 | { | |
825 | do_linear_search = 1; | |
826 | } | |
bd5635a1 | 827 | if (SYMBOL_NAME (sym)[0] < name[0]) |
2e4964ad FF |
828 | { |
829 | bot = inc; | |
830 | } | |
bd5635a1 | 831 | else if (SYMBOL_NAME (sym)[0] > name[0]) |
2e4964ad FF |
832 | { |
833 | top = inc; | |
834 | } | |
835 | else if (STRCMP (SYMBOL_NAME (sym), name) < 0) | |
836 | { | |
837 | bot = inc; | |
838 | } | |
bd5635a1 | 839 | else |
2e4964ad FF |
840 | { |
841 | top = inc; | |
842 | } | |
bd5635a1 RP |
843 | } |
844 | ||
f1ed4330 JK |
845 | /* Now scan forward until we run out of symbols, find one whose |
846 | name is greater than NAME, or find one we want. If there is | |
847 | more than one symbol with the right name and namespace, we | |
848 | return the first one; I believe it is now impossible for us | |
849 | to encounter two symbols with the same name and namespace | |
850 | here, because blocks containing argument symbols are no | |
851 | longer sorted. */ | |
bd5635a1 RP |
852 | |
853 | top = BLOCK_NSYMS (block); | |
854 | while (bot < top) | |
855 | { | |
856 | sym = BLOCK_SYM (block, bot); | |
857 | inc = SYMBOL_NAME (sym)[0] - name[0]; | |
858 | if (inc == 0) | |
2e4964ad FF |
859 | { |
860 | inc = STRCMP (SYMBOL_NAME (sym), name); | |
861 | } | |
bd5635a1 | 862 | if (inc == 0 && SYMBOL_NAMESPACE (sym) == namespace) |
2e4964ad FF |
863 | { |
864 | return (sym); | |
865 | } | |
bd5635a1 | 866 | if (inc > 0) |
2e4964ad FF |
867 | { |
868 | break; | |
869 | } | |
bd5635a1 RP |
870 | bot++; |
871 | } | |
bd5635a1 RP |
872 | } |
873 | ||
2e4964ad FF |
874 | /* Here if block isn't sorted, or we fail to find a match during the |
875 | binary search above. If during the binary search above, we find a | |
876 | symbol which is a C++ symbol, then we have re-enabled the linear | |
877 | search flag which was reset when starting the binary search. | |
878 | ||
879 | This loop is equivalent to the loop above, but hacked greatly for speed. | |
bd5635a1 RP |
880 | |
881 | Note that parameter symbols do not always show up last in the | |
882 | list; this loop makes sure to take anything else other than | |
883 | parameter symbols first; it only uses parameter symbols as a | |
884 | last resort. Note that this only takes up extra computation | |
885 | time on a match. */ | |
886 | ||
2e4964ad | 887 | if (do_linear_search) |
bd5635a1 | 888 | { |
2e4964ad FF |
889 | top = BLOCK_NSYMS (block); |
890 | bot = 0; | |
891 | while (bot < top) | |
bd5635a1 | 892 | { |
2e4964ad FF |
893 | sym = BLOCK_SYM (block, bot); |
894 | if (SYMBOL_NAMESPACE (sym) == namespace && | |
895 | SYMBOL_MATCHES_NAME (sym, name)) | |
896 | { | |
897 | sym_found = sym; | |
898 | if (SYMBOL_CLASS (sym) != LOC_ARG && | |
899 | SYMBOL_CLASS (sym) != LOC_LOCAL_ARG && | |
900 | SYMBOL_CLASS (sym) != LOC_REF_ARG && | |
f1ed4330 | 901 | SYMBOL_CLASS (sym) != LOC_REGPARM && |
a1c8d76e JK |
902 | SYMBOL_CLASS (sym) != LOC_REGPARM_ADDR && |
903 | SYMBOL_CLASS (sym) != LOC_BASEREG_ARG) | |
2e4964ad FF |
904 | { |
905 | break; | |
906 | } | |
907 | } | |
908 | bot++; | |
bd5635a1 | 909 | } |
bd5635a1 | 910 | } |
2e4964ad | 911 | return (sym_found); /* Will be NULL if not found. */ |
bd5635a1 | 912 | } |
2e4964ad | 913 | |
bd5635a1 RP |
914 | \f |
915 | /* Return the symbol for the function which contains a specified | |
916 | lexical block, described by a struct block BL. */ | |
917 | ||
918 | struct symbol * | |
919 | block_function (bl) | |
920 | struct block *bl; | |
921 | { | |
922 | while (BLOCK_FUNCTION (bl) == 0 && BLOCK_SUPERBLOCK (bl) != 0) | |
923 | bl = BLOCK_SUPERBLOCK (bl); | |
924 | ||
925 | return BLOCK_FUNCTION (bl); | |
926 | } | |
927 | ||
c1878f87 SG |
928 | /* Find the symtab associated with PC. Look through the psymtabs and read in |
929 | another symtab if necessary. */ | |
bd5635a1 RP |
930 | |
931 | struct symtab * | |
932 | find_pc_symtab (pc) | |
933 | register CORE_ADDR pc; | |
934 | { | |
935 | register struct block *b; | |
936 | struct blockvector *bv; | |
45a655b0 | 937 | register struct symtab *s = NULL; |
ca6a826d | 938 | register struct symtab *best_s = NULL; |
bd5635a1 | 939 | register struct partial_symtab *ps; |
cba0d141 | 940 | register struct objfile *objfile; |
018ab14f | 941 | int distance = 0; |
bd5635a1 | 942 | |
018ab14f PS |
943 | /* Search all symtabs for the one whose file contains our address, and which |
944 | is the smallest of all the ones containing the address. This is designed | |
945 | to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000 | |
946 | and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from | |
947 | 0x1000-0x4000, but for address 0x2345 we want to return symtab b. | |
948 | This is said to happen for the mips; it might be swifter to create | |
949 | several symtabs with the same name like xcoff does (I'm not sure). */ | |
bd5635a1 | 950 | |
35a25840 | 951 | ALL_SYMTABS (objfile, s) |
bd5635a1 | 952 | { |
35a25840 SG |
953 | bv = BLOCKVECTOR (s); |
954 | b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
955 | if (BLOCK_START (b) <= pc | |
ca6a826d PS |
956 | && BLOCK_END (b) > pc |
957 | && (distance == 0 | |
958 | || BLOCK_END (b) - BLOCK_START (b) < distance)) | |
959 | { | |
960 | distance = BLOCK_END (b) - BLOCK_START (b); | |
961 | best_s = s; | |
962 | } | |
bd5635a1 RP |
963 | } |
964 | ||
ca6a826d PS |
965 | if (best_s != NULL) |
966 | return(best_s); | |
967 | ||
45a655b0 | 968 | s = NULL; |
c1878f87 SG |
969 | ps = find_pc_psymtab (pc); |
970 | if (ps) | |
bd5635a1 | 971 | { |
c1878f87 | 972 | if (ps->readin) |
ac82e9a5 JK |
973 | /* Might want to error() here (in case symtab is corrupt and |
974 | will cause a core dump), but maybe we can successfully | |
975 | continue, so let's not. */ | |
976 | warning ("\ | |
977 | (Internal error: pc 0x%x in read in psymtab, but not in symtab.)\n", pc); | |
c1878f87 | 978 | s = PSYMTAB_TO_SYMTAB (ps); |
bd5635a1 | 979 | } |
45a655b0 | 980 | return (s); |
bd5635a1 RP |
981 | } |
982 | ||
983 | /* Find the source file and line number for a given PC value. | |
984 | Return a structure containing a symtab pointer, a line number, | |
985 | and a pc range for the entire source line. | |
986 | The value's .pc field is NOT the specified pc. | |
987 | NOTCURRENT nonzero means, if specified pc is on a line boundary, | |
988 | use the line that ends there. Otherwise, in that case, the line | |
989 | that begins there is used. */ | |
990 | ||
b638ca91 SG |
991 | /* The big complication here is that a line may start in one file, and end just |
992 | before the start of another file. This usually occurs when you #include | |
993 | code in the middle of a subroutine. To properly find the end of a line's PC | |
994 | range, we must search all symtabs associated with this compilation unit, and | |
995 | find the one whose first PC is closer than that of the next line in this | |
996 | symtab. | |
f77ad505 FF |
997 | |
998 | FIXME: We used to complain here about zero length or negative length line | |
999 | tables, but there are two problems with this: (1) some symtabs may not have | |
1000 | any line numbers due to gcc -g1 compilation, and (2) this function is called | |
1001 | during single stepping, when we don't own the terminal and thus can't | |
1002 | produce any output. One solution might be to implement a mechanism whereby | |
1003 | complaints can be queued until we regain control of the terminal. -fnf | |
b638ca91 SG |
1004 | */ |
1005 | ||
bd5635a1 RP |
1006 | struct symtab_and_line |
1007 | find_pc_line (pc, notcurrent) | |
1008 | CORE_ADDR pc; | |
1009 | int notcurrent; | |
1010 | { | |
1011 | struct symtab *s; | |
1012 | register struct linetable *l; | |
1013 | register int len; | |
1014 | register int i; | |
b638ca91 | 1015 | register struct linetable_entry *item; |
bd5635a1 RP |
1016 | struct symtab_and_line val; |
1017 | struct blockvector *bv; | |
1018 | ||
1019 | /* Info on best line seen so far, and where it starts, and its file. */ | |
1020 | ||
b638ca91 | 1021 | struct linetable_entry *best = NULL; |
bd5635a1 RP |
1022 | CORE_ADDR best_end = 0; |
1023 | struct symtab *best_symtab = 0; | |
1024 | ||
1025 | /* Store here the first line number | |
1026 | of a file which contains the line at the smallest pc after PC. | |
1027 | If we don't find a line whose range contains PC, | |
1028 | we will use a line one less than this, | |
1029 | with a range from the start of that file to the first line's pc. */ | |
b638ca91 | 1030 | struct linetable_entry *alt = NULL; |
bd5635a1 RP |
1031 | struct symtab *alt_symtab = 0; |
1032 | ||
1033 | /* Info on best line seen in this file. */ | |
1034 | ||
b638ca91 | 1035 | struct linetable_entry *prev; |
bd5635a1 RP |
1036 | |
1037 | /* If this pc is not from the current frame, | |
1038 | it is the address of the end of a call instruction. | |
1039 | Quite likely that is the start of the following statement. | |
1040 | But what we want is the statement containing the instruction. | |
1041 | Fudge the pc to make sure we get that. */ | |
1042 | ||
1043 | if (notcurrent) pc -= 1; | |
1044 | ||
1045 | s = find_pc_symtab (pc); | |
c1878f87 | 1046 | if (!s) |
bd5635a1 RP |
1047 | { |
1048 | val.symtab = 0; | |
1049 | val.line = 0; | |
1050 | val.pc = pc; | |
1051 | val.end = 0; | |
1052 | return val; | |
1053 | } | |
1054 | ||
1055 | bv = BLOCKVECTOR (s); | |
1056 | ||
1057 | /* Look at all the symtabs that share this blockvector. | |
1058 | They all have the same apriori range, that we found was right; | |
1059 | but they have different line tables. */ | |
1060 | ||
1061 | for (; s && BLOCKVECTOR (s) == bv; s = s->next) | |
1062 | { | |
1063 | /* Find the best line in this symtab. */ | |
1064 | l = LINETABLE (s); | |
4137c5fc JG |
1065 | if (!l) |
1066 | continue; | |
bd5635a1 | 1067 | len = l->nitems; |
f77ad505 | 1068 | if (len <= 0) /* See FIXME above. */ |
c1878f87 | 1069 | { |
c1878f87 SG |
1070 | continue; |
1071 | } | |
1072 | ||
b638ca91 SG |
1073 | prev = NULL; |
1074 | item = l->item; /* Get first line info */ | |
c1878f87 SG |
1075 | |
1076 | /* Is this file's first line closer than the first lines of other files? | |
1077 | If so, record this file, and its first line, as best alternate. */ | |
b638ca91 | 1078 | if (item->pc > pc && (!alt || item->pc < alt->pc)) |
c1878f87 SG |
1079 | { |
1080 | alt = item; | |
1081 | alt_symtab = s; | |
1082 | } | |
1083 | ||
b638ca91 | 1084 | for (i = 0; i < len; i++, item++) |
bd5635a1 | 1085 | { |
bd5635a1 | 1086 | /* Return the last line that did not start after PC. */ |
b638ca91 | 1087 | if (item->pc > pc) |
bd5635a1 | 1088 | break; |
c1878f87 SG |
1089 | |
1090 | prev = item; | |
bd5635a1 RP |
1091 | } |
1092 | ||
c1878f87 SG |
1093 | /* At this point, prev points at the line whose start addr is <= pc, and |
1094 | item points at the next line. If we ran off the end of the linetable | |
1095 | (pc >= start of the last line), then prev == item. If pc < start of | |
1096 | the first line, prev will not be set. */ | |
1097 | ||
bd5635a1 RP |
1098 | /* Is this file's best line closer than the best in the other files? |
1099 | If so, record this file, and its best line, as best so far. */ | |
c1878f87 | 1100 | |
b638ca91 | 1101 | if (prev && (!best || prev->pc > best->pc)) |
bd5635a1 | 1102 | { |
c1878f87 | 1103 | best = prev; |
bd5635a1 | 1104 | best_symtab = s; |
cba0d141 JG |
1105 | /* If another line is in the linetable, and its PC is closer |
1106 | than the best_end we currently have, take it as best_end. */ | |
b638ca91 SG |
1107 | if (i < len && (best_end == 0 || best_end > item->pc)) |
1108 | best_end = item->pc; | |
bd5635a1 RP |
1109 | } |
1110 | } | |
c1878f87 SG |
1111 | |
1112 | if (!best_symtab) | |
bd5635a1 | 1113 | { |
c1878f87 SG |
1114 | if (!alt_symtab) |
1115 | { /* If we didn't find any line # info, just | |
1116 | return zeros. */ | |
1117 | val.symtab = 0; | |
1118 | val.line = 0; | |
1119 | val.pc = pc; | |
1120 | val.end = 0; | |
1121 | } | |
1122 | else | |
1123 | { | |
1124 | val.symtab = alt_symtab; | |
b638ca91 | 1125 | val.line = alt->line - 1; |
c1878f87 | 1126 | val.pc = BLOCK_END (BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK)); |
b638ca91 | 1127 | val.end = alt->pc; |
c1878f87 | 1128 | } |
bd5635a1 RP |
1129 | } |
1130 | else | |
1131 | { | |
1132 | val.symtab = best_symtab; | |
b638ca91 SG |
1133 | val.line = best->line; |
1134 | val.pc = best->pc; | |
1135 | if (best_end && (!alt || best_end < alt->pc)) | |
cba0d141 | 1136 | val.end = best_end; |
a8a69e63 | 1137 | else if (alt) |
b638ca91 | 1138 | val.end = alt->pc; |
cba0d141 JG |
1139 | else |
1140 | val.end = BLOCK_END (BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK)); | |
bd5635a1 RP |
1141 | } |
1142 | return val; | |
1143 | } | |
1144 | \f | |
018ab14f PS |
1145 | static int find_line_symtab PARAMS ((struct symtab *, int, struct linetable **, |
1146 | int *, int *)); | |
1147 | ||
1148 | /* Find line number LINE in any symtab whose name is the same as | |
1149 | SYMTAB. | |
1150 | ||
1151 | If found, return 1, set *LINETABLE to the linetable in which it was | |
1152 | found, set *INDEX to the index in the linetable of the best entry | |
1153 | found, and set *EXACT_MATCH nonzero if the value returned is an | |
1154 | exact match. | |
1155 | ||
1156 | If not found, return 0. */ | |
1157 | ||
1158 | static int | |
1159 | find_line_symtab (symtab, line, linetable, index, exact_match) | |
1160 | struct symtab *symtab; | |
1161 | int line; | |
1162 | struct linetable **linetable; | |
1163 | int *index; | |
1164 | int *exact_match; | |
1165 | { | |
1166 | int exact; | |
1167 | ||
1168 | /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE | |
1169 | so far seen. */ | |
1170 | ||
1171 | int best_index; | |
1172 | struct linetable *best_linetable; | |
1173 | ||
1174 | /* First try looking it up in the given symtab. */ | |
1175 | best_linetable = LINETABLE (symtab); | |
1176 | best_index = find_line_common (best_linetable, line, &exact); | |
1177 | if (best_index < 0 || !exact) | |
1178 | { | |
1179 | /* Didn't find an exact match. So we better keep looking for | |
1180 | another symtab with the same name. In the case of xcoff, | |
1181 | multiple csects for one source file (produced by IBM's FORTRAN | |
1182 | compiler) produce multiple symtabs (this is unavoidable | |
1183 | assuming csects can be at arbitrary places in memory and that | |
1184 | the GLOBAL_BLOCK of a symtab has a begin and end address). */ | |
1185 | ||
1186 | /* BEST is the smallest linenumber > LINE so far seen, | |
1187 | or 0 if none has been seen so far. | |
1188 | BEST_INDEX and BEST_LINETABLE identify the item for it. */ | |
1189 | int best; | |
1190 | ||
1191 | struct objfile *objfile; | |
1192 | struct symtab *s; | |
1193 | ||
1194 | if (best_index >= 0) | |
1195 | best = best_linetable->item[best_index].line; | |
1196 | else | |
1197 | best = 0; | |
1198 | ||
1199 | ALL_SYMTABS (objfile, s) | |
1200 | { | |
1201 | struct linetable *l; | |
1202 | int ind; | |
1203 | ||
1204 | if (!STREQ (symtab->filename, s->filename)) | |
1205 | continue; | |
1206 | l = LINETABLE (s); | |
1207 | ind = find_line_common (l, line, &exact); | |
1208 | if (ind >= 0) | |
1209 | { | |
1210 | if (exact) | |
1211 | { | |
1212 | best_index = ind; | |
1213 | best_linetable = l; | |
1214 | goto done; | |
1215 | } | |
1216 | if (best == 0 || l->item[ind].line < best) | |
1217 | { | |
1218 | best = l->item[ind].line; | |
1219 | best_index = ind; | |
1220 | best_linetable = l; | |
1221 | } | |
1222 | } | |
1223 | } | |
1224 | } | |
1225 | done: | |
1226 | if (best_index < 0) | |
1227 | return 0; | |
1228 | ||
1229 | if (index) | |
1230 | *index = best_index; | |
1231 | if (linetable) | |
1232 | *linetable = best_linetable; | |
1233 | if (exact_match) | |
1234 | *exact_match = exact; | |
1235 | return 1; | |
1236 | } | |
1237 | \f | |
bd5635a1 RP |
1238 | /* Find the PC value for a given source file and line number. |
1239 | Returns zero for invalid line number. | |
1240 | The source file is specified with a struct symtab. */ | |
1241 | ||
1242 | CORE_ADDR | |
1243 | find_line_pc (symtab, line) | |
1244 | struct symtab *symtab; | |
1245 | int line; | |
1246 | { | |
018ab14f PS |
1247 | struct linetable *l; |
1248 | int ind; | |
bd5635a1 RP |
1249 | |
1250 | if (symtab == 0) | |
1251 | return 0; | |
018ab14f PS |
1252 | if (find_line_symtab (symtab, line, &l, &ind, NULL)) |
1253 | return l->item[ind].pc; | |
1254 | else | |
1255 | return 0; | |
bd5635a1 RP |
1256 | } |
1257 | ||
1258 | /* Find the range of pc values in a line. | |
1259 | Store the starting pc of the line into *STARTPTR | |
1260 | and the ending pc (start of next line) into *ENDPTR. | |
1261 | Returns 1 to indicate success. | |
1262 | Returns 0 if could not find the specified line. */ | |
1263 | ||
1264 | int | |
1265 | find_line_pc_range (symtab, thisline, startptr, endptr) | |
1266 | struct symtab *symtab; | |
1267 | int thisline; | |
1268 | CORE_ADDR *startptr, *endptr; | |
1269 | { | |
018ab14f PS |
1270 | struct linetable *l; |
1271 | int ind; | |
bd5635a1 RP |
1272 | int exact_match; /* did we get an exact linenumber match */ |
1273 | ||
1274 | if (symtab == 0) | |
1275 | return 0; | |
1276 | ||
018ab14f | 1277 | if (find_line_symtab (symtab, thisline, &l, &ind, &exact_match)) |
bd5635a1 RP |
1278 | { |
1279 | *startptr = l->item[ind].pc; | |
1280 | /* If we have not seen an entry for the specified line, | |
1281 | assume that means the specified line has zero bytes. */ | |
1282 | if (!exact_match || ind == l->nitems-1) | |
1283 | *endptr = *startptr; | |
1284 | else | |
1285 | /* Perhaps the following entry is for the following line. | |
1286 | It's worth a try. */ | |
1287 | if (ind+1 < l->nitems | |
1288 | && l->item[ind+1].line == thisline + 1) | |
1289 | *endptr = l->item[ind+1].pc; | |
1290 | else | |
1291 | *endptr = find_line_pc (symtab, thisline+1); | |
1292 | return 1; | |
1293 | } | |
1294 | ||
1295 | return 0; | |
1296 | } | |
1297 | ||
1298 | /* Given a line table and a line number, return the index into the line | |
1299 | table for the pc of the nearest line whose number is >= the specified one. | |
b203fc18 | 1300 | Return -1 if none is found. The value is >= 0 if it is an index. |
bd5635a1 RP |
1301 | |
1302 | Set *EXACT_MATCH nonzero if the value returned is an exact match. */ | |
1303 | ||
1304 | static int | |
1305 | find_line_common (l, lineno, exact_match) | |
1306 | register struct linetable *l; | |
1307 | register int lineno; | |
1308 | int *exact_match; | |
1309 | { | |
1310 | register int i; | |
1311 | register int len; | |
1312 | ||
1313 | /* BEST is the smallest linenumber > LINENO so far seen, | |
1314 | or 0 if none has been seen so far. | |
1315 | BEST_INDEX identifies the item for it. */ | |
1316 | ||
b203fc18 | 1317 | int best_index = -1; |
bd5635a1 RP |
1318 | int best = 0; |
1319 | ||
1320 | if (lineno <= 0) | |
b203fc18 | 1321 | return -1; |
4137c5fc JG |
1322 | if (l == 0) |
1323 | return -1; | |
bd5635a1 RP |
1324 | |
1325 | len = l->nitems; | |
1326 | for (i = 0; i < len; i++) | |
1327 | { | |
1328 | register struct linetable_entry *item = &(l->item[i]); | |
1329 | ||
1330 | if (item->line == lineno) | |
1331 | { | |
1332 | *exact_match = 1; | |
1333 | return i; | |
1334 | } | |
1335 | ||
1336 | if (item->line > lineno && (best == 0 || item->line < best)) | |
1337 | { | |
1338 | best = item->line; | |
1339 | best_index = i; | |
1340 | } | |
1341 | } | |
1342 | ||
1343 | /* If we got here, we didn't get an exact match. */ | |
1344 | ||
1345 | *exact_match = 0; | |
1346 | return best_index; | |
1347 | } | |
1348 | ||
1349 | int | |
1350 | find_pc_line_pc_range (pc, startptr, endptr) | |
1351 | CORE_ADDR pc; | |
1352 | CORE_ADDR *startptr, *endptr; | |
1353 | { | |
1354 | struct symtab_and_line sal; | |
1355 | sal = find_pc_line (pc, 0); | |
1356 | *startptr = sal.pc; | |
1357 | *endptr = sal.end; | |
1358 | return sal.symtab != 0; | |
1359 | } | |
1360 | \f | |
d96b54ea JK |
1361 | /* If P is of the form "operator[ \t]+..." where `...' is |
1362 | some legitimate operator text, return a pointer to the | |
1363 | beginning of the substring of the operator text. | |
1364 | Otherwise, return "". */ | |
1365 | static char * | |
1366 | operator_chars (p, end) | |
1367 | char *p; | |
1368 | char **end; | |
1369 | { | |
1370 | *end = ""; | |
1371 | if (strncmp (p, "operator", 8)) | |
1372 | return *end; | |
1373 | p += 8; | |
1374 | ||
1375 | /* Don't get faked out by `operator' being part of a longer | |
1376 | identifier. */ | |
2cd99985 | 1377 | if (isalpha(*p) || *p == '_' || *p == '$' || *p == '\0') |
d96b54ea JK |
1378 | return *end; |
1379 | ||
1380 | /* Allow some whitespace between `operator' and the operator symbol. */ | |
1381 | while (*p == ' ' || *p == '\t') | |
1382 | p++; | |
1383 | ||
2cd99985 PB |
1384 | /* Recognize 'operator TYPENAME'. */ |
1385 | ||
1386 | if (isalpha(*p) || *p == '_' || *p == '$') | |
1387 | { | |
1388 | register char *q = p+1; | |
1389 | while (isalnum(*q) || *q == '_' || *q == '$') | |
1390 | q++; | |
1391 | *end = q; | |
1392 | return p; | |
1393 | } | |
1394 | ||
d96b54ea JK |
1395 | switch (*p) |
1396 | { | |
1397 | case '!': | |
1398 | case '=': | |
1399 | case '*': | |
1400 | case '/': | |
1401 | case '%': | |
1402 | case '^': | |
1403 | if (p[1] == '=') | |
1404 | *end = p+2; | |
1405 | else | |
1406 | *end = p+1; | |
1407 | return p; | |
1408 | case '<': | |
1409 | case '>': | |
1410 | case '+': | |
1411 | case '-': | |
1412 | case '&': | |
1413 | case '|': | |
1414 | if (p[1] == '=' || p[1] == p[0]) | |
1415 | *end = p+2; | |
1416 | else | |
1417 | *end = p+1; | |
1418 | return p; | |
1419 | case '~': | |
1420 | case ',': | |
1421 | *end = p+1; | |
1422 | return p; | |
1423 | case '(': | |
1424 | if (p[1] != ')') | |
1425 | error ("`operator ()' must be specified without whitespace in `()'"); | |
1426 | *end = p+2; | |
1427 | return p; | |
1428 | case '?': | |
1429 | if (p[1] != ':') | |
1430 | error ("`operator ?:' must be specified without whitespace in `?:'"); | |
1431 | *end = p+2; | |
1432 | return p; | |
1433 | case '[': | |
1434 | if (p[1] != ']') | |
1435 | error ("`operator []' must be specified without whitespace in `[]'"); | |
1436 | *end = p+2; | |
1437 | return p; | |
1438 | default: | |
1439 | error ("`operator %s' not supported", p); | |
1440 | break; | |
1441 | } | |
1442 | *end = ""; | |
1443 | return *end; | |
1444 | } | |
1445 | ||
bd5635a1 RP |
1446 | /* Recursive helper function for decode_line_1. |
1447 | * Look for methods named NAME in type T. | |
1448 | * Return number of matches. | |
2e4964ad | 1449 | * Put matches in SYM_ARR (which better be big enough!). |
bd5635a1 RP |
1450 | * These allocations seem to define "big enough": |
1451 | * sym_arr = (struct symbol **) alloca(TYPE_NFN_FIELDS_TOTAL (t) * sizeof(struct symbol*)); | |
0b28c260 | 1452 | * Note that this function is g++ specific. |
bd5635a1 RP |
1453 | */ |
1454 | ||
2cd99985 | 1455 | int |
2e4964ad | 1456 | find_methods (t, name, sym_arr) |
bd5635a1 RP |
1457 | struct type *t; |
1458 | char *name; | |
bd5635a1 RP |
1459 | struct symbol **sym_arr; |
1460 | { | |
1461 | int i1 = 0; | |
1462 | int ibase; | |
1463 | struct symbol *sym_class; | |
1464 | char *class_name = type_name_no_tag (t); | |
1465 | /* Ignore this class if it doesn't have a name. | |
1466 | This prevents core dumps, but is just a workaround | |
1467 | because we might not find the function in | |
1468 | certain cases, such as | |
1469 | struct D {virtual int f();} | |
1470 | struct C : D {virtual int g();} | |
1471 | (in this case g++ 1.35.1- does not put out a name | |
1472 | for D as such, it defines type 19 (for example) in | |
1473 | the same stab as C, and then does a | |
1474 | .stabs "D:T19" and a .stabs "D:t19". | |
1475 | Thus | |
1476 | "break C::f" should not be looking for field f in | |
1477 | the class named D, | |
1478 | but just for the field f in the baseclasses of C | |
1479 | (no matter what their names). | |
1480 | ||
1481 | However, I don't know how to replace the code below | |
1482 | that depends on knowing the name of D. */ | |
1483 | if (class_name | |
1484 | && (sym_class = lookup_symbol (class_name, | |
1485 | (struct block *)NULL, | |
1486 | STRUCT_NAMESPACE, | |
1487 | (int *)NULL, | |
1488 | (struct symtab **)NULL))) | |
1489 | { | |
1490 | int method_counter; | |
1491 | t = SYMBOL_TYPE (sym_class); | |
1492 | for (method_counter = TYPE_NFN_FIELDS (t) - 1; | |
1493 | method_counter >= 0; | |
1494 | --method_counter) | |
1495 | { | |
1496 | int field_counter; | |
1497 | struct fn_field *f = TYPE_FN_FIELDLIST1 (t, method_counter); | |
1498 | ||
1499 | char *method_name = TYPE_FN_FIELDLIST_NAME (t, method_counter); | |
2e4964ad | 1500 | if (STREQ (name, method_name)) |
bd5635a1 RP |
1501 | /* Find all the fields with that name. */ |
1502 | for (field_counter = TYPE_FN_FIELDLIST_LENGTH (t, method_counter) - 1; | |
1503 | field_counter >= 0; | |
1504 | --field_counter) | |
1505 | { | |
1506 | char *phys_name; | |
7e258d18 | 1507 | if (TYPE_FN_FIELD_STUB (f, field_counter)) |
bd5635a1 RP |
1508 | check_stub_method (t, method_counter, field_counter); |
1509 | phys_name = TYPE_FN_FIELD_PHYSNAME (f, field_counter); | |
ca6a826d PS |
1510 | /* Destructor is handled by caller, dont add it to the list */ |
1511 | if (DESTRUCTOR_PREFIX_P (phys_name)) | |
1512 | continue; | |
bd5635a1 RP |
1513 | sym_arr[i1] = lookup_symbol (phys_name, |
1514 | SYMBOL_BLOCK_VALUE (sym_class), | |
1515 | VAR_NAMESPACE, | |
1516 | (int *) NULL, | |
1517 | (struct symtab **) NULL); | |
1518 | if (sym_arr[i1]) i1++; | |
2cd99985 PB |
1519 | else |
1520 | { | |
1521 | fputs_filtered("(Cannot find method ", stdout); | |
5e81259d FF |
1522 | fprintf_symbol_filtered (stdout, phys_name, |
1523 | language_cplus, DMGL_PARAMS); | |
2cd99985 PB |
1524 | fputs_filtered(" - possibly inlined.)\n", stdout); |
1525 | } | |
bd5635a1 RP |
1526 | } |
1527 | } | |
1528 | } | |
1529 | /* Only search baseclasses if there is no match yet, | |
1530 | * since names in derived classes override those in baseclasses. | |
1531 | */ | |
1532 | if (i1) | |
1533 | return i1; | |
1534 | for (ibase = 0; ibase < TYPE_N_BASECLASSES (t); ibase++) | |
1535 | i1 += find_methods(TYPE_BASECLASS(t, ibase), name, | |
2e4964ad | 1536 | sym_arr + i1); |
bd5635a1 RP |
1537 | return i1; |
1538 | } | |
1539 | ||
6f87ec4a PS |
1540 | /* Helper function for decode_line_1. |
1541 | Build a canonical line spec in CANONICAL if it is non-NULL and if | |
1542 | the SAL has a symtab. | |
1543 | If SYMNAME is non-NULL the canonical line spec is `filename:symname'. | |
1544 | If SYMNAME is NULL the line number from SAL is used and the canonical | |
1545 | line spec is `filename:linenum'. */ | |
1546 | ||
1547 | static void | |
1548 | build_canonical_line_spec (sal, symname, canonical) | |
1549 | struct symtab_and_line *sal; | |
1550 | char *symname; | |
1551 | char ***canonical; | |
1552 | { | |
1553 | char **canonical_arr; | |
1554 | char *canonical_name; | |
1555 | char *filename; | |
1556 | struct symtab *s = sal->symtab; | |
1557 | ||
1558 | if (s == (struct symtab *)NULL | |
1559 | || s->filename == (char *)NULL | |
1560 | || canonical == (char ***)NULL) | |
1561 | return; | |
1562 | ||
1563 | canonical_arr = (char **) xmalloc (sizeof (char *)); | |
1564 | *canonical = canonical_arr; | |
1565 | ||
1566 | filename = s->filename; | |
1567 | if (symname != NULL) | |
1568 | { | |
1569 | canonical_name = xmalloc (strlen (filename) + strlen (symname) + 2); | |
1570 | sprintf (canonical_name, "%s:%s", filename, symname); | |
1571 | } | |
1572 | else | |
1573 | { | |
1574 | canonical_name = xmalloc (strlen (filename) + 30); | |
1575 | sprintf (canonical_name, "%s:%d", filename, sal->line); | |
1576 | } | |
1577 | canonical_arr[0] = canonical_name; | |
1578 | } | |
1579 | ||
bd5635a1 RP |
1580 | /* Parse a string that specifies a line number. |
1581 | Pass the address of a char * variable; that variable will be | |
1582 | advanced over the characters actually parsed. | |
1583 | ||
1584 | The string can be: | |
1585 | ||
1586 | LINENUM -- that line number in current file. PC returned is 0. | |
1587 | FILE:LINENUM -- that line in that file. PC returned is 0. | |
1588 | FUNCTION -- line number of openbrace of that function. | |
1589 | PC returned is the start of the function. | |
1590 | VARIABLE -- line number of definition of that variable. | |
1591 | PC returned is 0. | |
1592 | FILE:FUNCTION -- likewise, but prefer functions in that file. | |
1593 | *EXPR -- line in which address EXPR appears. | |
1594 | ||
cba0d141 | 1595 | FUNCTION may be an undebuggable function found in minimal symbol table. |
bd5635a1 RP |
1596 | |
1597 | If the argument FUNFIRSTLINE is nonzero, we want the first line | |
1598 | of real code inside a function when a function is specified. | |
1599 | ||
1600 | DEFAULT_SYMTAB specifies the file to use if none is specified. | |
1601 | It defaults to current_source_symtab. | |
1602 | DEFAULT_LINE specifies the line number to use for relative | |
1603 | line numbers (that start with signs). Defaults to current_source_line. | |
6f87ec4a PS |
1604 | If CANONICAL is non-NULL, store an array of strings containing the canonical |
1605 | line specs there if necessary. Currently overloaded member functions and | |
1606 | line numbers or static functions without a filename yield a canonical | |
1607 | line spec. The array and the line spec strings are allocated on the heap, | |
1608 | it is the callers responsibility to free them. | |
bd5635a1 RP |
1609 | |
1610 | Note that it is possible to return zero for the symtab | |
1611 | if no file is validly specified. Callers must check that. | |
1612 | Also, the line number returned may be invalid. */ | |
1613 | ||
1614 | struct symtabs_and_lines | |
6f87ec4a | 1615 | decode_line_1 (argptr, funfirstline, default_symtab, default_line, canonical) |
bd5635a1 RP |
1616 | char **argptr; |
1617 | int funfirstline; | |
1618 | struct symtab *default_symtab; | |
1619 | int default_line; | |
6f87ec4a | 1620 | char ***canonical; |
bd5635a1 | 1621 | { |
bd5635a1 | 1622 | struct symtabs_and_lines values; |
c1878f87 SG |
1623 | #ifdef HPPA_COMPILER_BUG |
1624 | /* FIXME: The native HP 9000/700 compiler has a bug which appears | |
1625 | when optimizing this file with target i960-vxworks. I haven't | |
1626 | been able to construct a simple test case. The problem is that | |
1627 | in the second call to SKIP_PROLOGUE below, the compiler somehow | |
1628 | does not realize that the statement val = find_pc_line (...) will | |
1629 | change the values of the fields of val. It extracts the elements | |
1630 | into registers at the top of the block, and does not update the | |
1631 | registers after the call to find_pc_line. You can check this by | |
1632 | inserting a printf at the end of find_pc_line to show what values | |
1633 | it is returning for val.pc and val.end and another printf after | |
1634 | the call to see what values the function actually got (remember, | |
1635 | this is compiling with cc -O, with this patch removed). You can | |
1636 | also examine the assembly listing: search for the second call to | |
1637 | skip_prologue; the LDO statement before the next call to | |
1638 | find_pc_line loads the address of the structure which | |
1639 | find_pc_line will return; if there is a LDW just before the LDO, | |
1640 | which fetches an element of the structure, then the compiler | |
1641 | still has the bug. | |
1642 | ||
1643 | Setting val to volatile avoids the problem. We must undef | |
1644 | volatile, because the HPPA native compiler does not define | |
1645 | __STDC__, although it does understand volatile, and so volatile | |
1646 | will have been defined away in defs.h. */ | |
1647 | #undef volatile | |
1648 | volatile struct symtab_and_line val; | |
1649 | #define volatile /*nothing*/ | |
1650 | #else | |
bd5635a1 | 1651 | struct symtab_and_line val; |
c1878f87 | 1652 | #endif |
bd5635a1 | 1653 | register char *p, *p1; |
d96b54ea | 1654 | char *q, *q1; |
bd5635a1 RP |
1655 | register struct symtab *s; |
1656 | ||
1657 | register struct symbol *sym; | |
1658 | /* The symtab that SYM was found in. */ | |
1659 | struct symtab *sym_symtab; | |
1660 | ||
1661 | register CORE_ADDR pc; | |
cba0d141 | 1662 | register struct minimal_symbol *msymbol; |
bd5635a1 RP |
1663 | char *copy; |
1664 | struct symbol *sym_class; | |
1665 | int i1; | |
8050a57b | 1666 | int is_quoted; |
bd5635a1 RP |
1667 | struct symbol **sym_arr; |
1668 | struct type *t; | |
f70be3e4 JG |
1669 | char *saved_arg = *argptr; |
1670 | extern char *gdb_completer_quote_characters; | |
bd5635a1 RP |
1671 | |
1672 | /* Defaults have defaults. */ | |
1673 | ||
1674 | if (default_symtab == 0) | |
1675 | { | |
1676 | default_symtab = current_source_symtab; | |
1677 | default_line = current_source_line; | |
1678 | } | |
1679 | ||
8050a57b | 1680 | /* See if arg is *PC */ |
bd5635a1 | 1681 | |
8050a57b | 1682 | if (**argptr == '*') |
f70be3e4 JG |
1683 | { |
1684 | if (**argptr == '*') | |
1685 | { | |
1686 | (*argptr)++; | |
1687 | } | |
bd5635a1 RP |
1688 | pc = parse_and_eval_address_1 (argptr); |
1689 | values.sals = (struct symtab_and_line *) | |
1690 | xmalloc (sizeof (struct symtab_and_line)); | |
1691 | values.nelts = 1; | |
1692 | values.sals[0] = find_pc_line (pc, 0); | |
1693 | values.sals[0].pc = pc; | |
6f87ec4a | 1694 | build_canonical_line_spec (values.sals, NULL, canonical); |
bd5635a1 RP |
1695 | return values; |
1696 | } | |
1697 | ||
1698 | /* Maybe arg is FILE : LINENUM or FILE : FUNCTION */ | |
1699 | ||
8050a57b FF |
1700 | s = NULL; |
1701 | is_quoted = (strchr (gdb_completer_quote_characters, **argptr) != NULL); | |
bd5635a1 RP |
1702 | |
1703 | for (p = *argptr; *p; p++) | |
1704 | { | |
1705 | if (p[0] == ':' || p[0] == ' ' || p[0] == '\t') | |
1706 | break; | |
1707 | } | |
1708 | while (p[0] == ' ' || p[0] == '\t') p++; | |
1709 | ||
8050a57b | 1710 | if ((p[0] == ':') && !is_quoted) |
bd5635a1 RP |
1711 | { |
1712 | ||
1713 | /* C++ */ | |
1714 | if (p[1] ==':') | |
1715 | { | |
1716 | /* Extract the class name. */ | |
1717 | p1 = p; | |
1718 | while (p != *argptr && p[-1] == ' ') --p; | |
1719 | copy = (char *) alloca (p - *argptr + 1); | |
4ed3a9ea | 1720 | memcpy (copy, *argptr, p - *argptr); |
bd5635a1 RP |
1721 | copy[p - *argptr] = 0; |
1722 | ||
1723 | /* Discard the class name from the arg. */ | |
1724 | p = p1 + 2; | |
1725 | while (*p == ' ' || *p == '\t') p++; | |
1726 | *argptr = p; | |
1727 | ||
1728 | sym_class = lookup_symbol (copy, 0, STRUCT_NAMESPACE, 0, | |
1729 | (struct symtab **)NULL); | |
1730 | ||
1731 | if (sym_class && | |
f1d77e90 | 1732 | ( TYPE_CODE (SYMBOL_TYPE (sym_class)) == TYPE_CODE_STRUCT |
bd5635a1 RP |
1733 | || TYPE_CODE (SYMBOL_TYPE (sym_class)) == TYPE_CODE_UNION)) |
1734 | { | |
1735 | /* Arg token is not digits => try it as a function name | |
1736 | Find the next token (everything up to end or next whitespace). */ | |
1737 | p = *argptr; | |
1738 | while (*p && *p != ' ' && *p != '\t' && *p != ',' && *p !=':') p++; | |
d96b54ea | 1739 | q = operator_chars (*argptr, &q1); |
aec4cb91 | 1740 | |
d96b54ea JK |
1741 | if (q1 - q) |
1742 | { | |
2cd99985 PB |
1743 | char *opname; |
1744 | char *tmp = alloca (q1 - q + 1); | |
1745 | memcpy (tmp, q, q1 - q); | |
1746 | tmp[q1 - q] = '\0'; | |
8050a57b | 1747 | opname = cplus_mangle_opname (tmp, DMGL_ANSI); |
2cd99985 | 1748 | if (opname == NULL) |
f70be3e4 JG |
1749 | { |
1750 | warning ("no mangling for \"%s\"", tmp); | |
1751 | cplusplus_hint (saved_arg); | |
f1ed4330 | 1752 | return_to_top_level (RETURN_ERROR); |
f70be3e4 | 1753 | } |
2cd99985 PB |
1754 | copy = (char*) alloca (3 + strlen(opname)); |
1755 | sprintf (copy, "__%s", opname); | |
d96b54ea JK |
1756 | p = q1; |
1757 | } | |
1758 | else | |
1759 | { | |
2cd99985 | 1760 | copy = (char *) alloca (p - *argptr + 1 + (q1 - q)); |
4ed3a9ea | 1761 | memcpy (copy, *argptr, p - *argptr); |
d96b54ea JK |
1762 | copy[p - *argptr] = '\0'; |
1763 | } | |
bd5635a1 RP |
1764 | |
1765 | /* no line number may be specified */ | |
1766 | while (*p == ' ' || *p == '\t') p++; | |
1767 | *argptr = p; | |
1768 | ||
1769 | sym = 0; | |
1770 | i1 = 0; /* counter for the symbol array */ | |
1771 | t = SYMBOL_TYPE (sym_class); | |
1772 | sym_arr = (struct symbol **) alloca(TYPE_NFN_FIELDS_TOTAL (t) * sizeof(struct symbol*)); | |
bd5635a1 | 1773 | |
018ab14f PS |
1774 | /* Cfront objects don't have fieldlists. */ |
1775 | if (destructor_name_p (copy, t) && TYPE_FN_FIELDLISTS (t) != NULL) | |
bd5635a1 RP |
1776 | { |
1777 | /* destructors are a special case. */ | |
1778 | struct fn_field *f = TYPE_FN_FIELDLIST1 (t, 0); | |
1779 | int len = TYPE_FN_FIELDLIST_LENGTH (t, 0) - 1; | |
ca6a826d PS |
1780 | /* gcc 1.x puts destructor in last field, |
1781 | gcc 2.x puts destructor in first field. */ | |
bd5635a1 | 1782 | char *phys_name = TYPE_FN_FIELD_PHYSNAME (f, len); |
ca6a826d PS |
1783 | if (!DESTRUCTOR_PREFIX_P (phys_name)) |
1784 | { | |
1785 | phys_name = TYPE_FN_FIELD_PHYSNAME (f, 0); | |
1786 | if (!DESTRUCTOR_PREFIX_P (phys_name)) | |
1787 | phys_name = ""; | |
1788 | } | |
bd5635a1 RP |
1789 | sym_arr[i1] = |
1790 | lookup_symbol (phys_name, SYMBOL_BLOCK_VALUE (sym_class), | |
1791 | VAR_NAMESPACE, 0, (struct symtab **)NULL); | |
1792 | if (sym_arr[i1]) i1++; | |
1793 | } | |
1794 | else | |
2e4964ad | 1795 | i1 = find_methods (t, copy, sym_arr); |
bd5635a1 RP |
1796 | if (i1 == 1) |
1797 | { | |
1798 | /* There is exactly one field with that name. */ | |
1799 | sym = sym_arr[0]; | |
1800 | ||
1801 | if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK) | |
1802 | { | |
1803 | /* Arg is the name of a function */ | |
1804 | pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)) + FUNCTION_START_OFFSET; | |
1805 | if (funfirstline) | |
1806 | SKIP_PROLOGUE (pc); | |
1807 | values.sals = (struct symtab_and_line *)xmalloc (sizeof (struct symtab_and_line)); | |
1808 | values.nelts = 1; | |
1809 | values.sals[0] = find_pc_line (pc, 0); | |
1810 | values.sals[0].pc = (values.sals[0].end && values.sals[0].pc != pc) ? values.sals[0].end : pc; | |
1811 | } | |
1812 | else | |
1813 | { | |
1814 | values.nelts = 0; | |
1815 | } | |
1816 | return values; | |
1817 | } | |
1818 | if (i1 > 0) | |
1819 | { | |
1820 | /* There is more than one field with that name | |
1821 | (overloaded). Ask the user which one to use. */ | |
6f87ec4a | 1822 | return decode_line_2 (sym_arr, i1, funfirstline, canonical); |
bd5635a1 RP |
1823 | } |
1824 | else | |
d96b54ea JK |
1825 | { |
1826 | char *tmp; | |
1827 | ||
1828 | if (OPNAME_PREFIX_P (copy)) | |
1829 | { | |
1830 | tmp = (char *)alloca (strlen (copy+3) + 9); | |
1831 | strcpy (tmp, "operator "); | |
1832 | strcat (tmp, copy+3); | |
1833 | } | |
1834 | else | |
1835 | tmp = copy; | |
0e2a896c | 1836 | if (tmp[0] == '~') |
f70be3e4 | 1837 | warning ("the class `%s' does not have destructor defined", |
2e4964ad | 1838 | SYMBOL_SOURCE_NAME(sym_class)); |
0e2a896c | 1839 | else |
f70be3e4 | 1840 | warning ("the class %s does not have any method named %s", |
2e4964ad | 1841 | SYMBOL_SOURCE_NAME(sym_class), tmp); |
f70be3e4 | 1842 | cplusplus_hint (saved_arg); |
f1ed4330 | 1843 | return_to_top_level (RETURN_ERROR); |
d96b54ea | 1844 | } |
bd5635a1 RP |
1845 | } |
1846 | else | |
f70be3e4 JG |
1847 | { |
1848 | /* The quotes are important if copy is empty. */ | |
1849 | warning ("can't find class, struct, or union named \"%s\"", | |
1850 | copy); | |
1851 | cplusplus_hint (saved_arg); | |
f1ed4330 | 1852 | return_to_top_level (RETURN_ERROR); |
f70be3e4 | 1853 | } |
bd5635a1 RP |
1854 | } |
1855 | /* end of C++ */ | |
1856 | ||
1857 | ||
1858 | /* Extract the file name. */ | |
1859 | p1 = p; | |
1860 | while (p != *argptr && p[-1] == ' ') --p; | |
58050209 | 1861 | copy = (char *) alloca (p - *argptr + 1); |
4ed3a9ea | 1862 | memcpy (copy, *argptr, p - *argptr); |
58050209 | 1863 | copy[p - *argptr] = 0; |
bd5635a1 RP |
1864 | |
1865 | /* Find that file's data. */ | |
1866 | s = lookup_symtab (copy); | |
1867 | if (s == 0) | |
1868 | { | |
cba0d141 | 1869 | if (!have_full_symbols () && !have_partial_symbols ()) |
bd5635a1 RP |
1870 | error (no_symtab_msg); |
1871 | error ("No source file named %s.", copy); | |
1872 | } | |
1873 | ||
1874 | /* Discard the file name from the arg. */ | |
1875 | p = p1 + 1; | |
1876 | while (*p == ' ' || *p == '\t') p++; | |
1877 | *argptr = p; | |
1878 | } | |
1879 | ||
1880 | /* S is specified file's symtab, or 0 if no file specified. | |
1881 | arg no longer contains the file name. */ | |
1882 | ||
1883 | /* Check whether arg is all digits (and sign) */ | |
1884 | ||
1885 | p = *argptr; | |
1886 | if (*p == '-' || *p == '+') p++; | |
1887 | while (*p >= '0' && *p <= '9') | |
1888 | p++; | |
1889 | ||
1890 | if (p != *argptr && (*p == 0 || *p == ' ' || *p == '\t' || *p == ',')) | |
1891 | { | |
1892 | /* We found a token consisting of all digits -- at least one digit. */ | |
1893 | enum sign {none, plus, minus} sign = none; | |
1894 | ||
6f87ec4a PS |
1895 | /* We might need a canonical line spec if no file was specified. */ |
1896 | int need_canonical = (s == 0) ? 1 : 0; | |
1897 | ||
bd5635a1 RP |
1898 | /* This is where we need to make sure that we have good defaults. |
1899 | We must guarantee that this section of code is never executed | |
1900 | when we are called with just a function name, since | |
1901 | select_source_symtab calls us with such an argument */ | |
1902 | ||
1903 | if (s == 0 && default_symtab == 0) | |
1904 | { | |
bd5635a1 RP |
1905 | select_source_symtab (0); |
1906 | default_symtab = current_source_symtab; | |
1907 | default_line = current_source_line; | |
1908 | } | |
1909 | ||
1910 | if (**argptr == '+') | |
1911 | sign = plus, (*argptr)++; | |
1912 | else if (**argptr == '-') | |
1913 | sign = minus, (*argptr)++; | |
1914 | val.line = atoi (*argptr); | |
1915 | switch (sign) | |
1916 | { | |
1917 | case plus: | |
1918 | if (p == *argptr) | |
1919 | val.line = 5; | |
1920 | if (s == 0) | |
1921 | val.line = default_line + val.line; | |
1922 | break; | |
1923 | case minus: | |
1924 | if (p == *argptr) | |
1925 | val.line = 15; | |
1926 | if (s == 0) | |
1927 | val.line = default_line - val.line; | |
1928 | else | |
1929 | val.line = 1; | |
1930 | break; | |
1931 | case none: | |
1932 | break; /* No need to adjust val.line. */ | |
1933 | } | |
1934 | ||
1935 | while (*p == ' ' || *p == '\t') p++; | |
1936 | *argptr = p; | |
1937 | if (s == 0) | |
1938 | s = default_symtab; | |
1939 | val.symtab = s; | |
1940 | val.pc = 0; | |
1941 | values.sals = (struct symtab_and_line *)xmalloc (sizeof (struct symtab_and_line)); | |
1942 | values.sals[0] = val; | |
1943 | values.nelts = 1; | |
6f87ec4a PS |
1944 | if (need_canonical) |
1945 | build_canonical_line_spec (values.sals, NULL, canonical); | |
bd5635a1 RP |
1946 | return values; |
1947 | } | |
1948 | ||
1949 | /* Arg token is not digits => try it as a variable name | |
1950 | Find the next token (everything up to end or next whitespace). */ | |
2cd99985 | 1951 | |
f70be3e4 | 1952 | p = skip_quoted (*argptr); |
018ab14f PS |
1953 | if (is_quoted && p[-1] != '\'') |
1954 | error ("Unmatched single quote."); | |
bd5635a1 | 1955 | copy = (char *) alloca (p - *argptr + 1); |
4ed3a9ea | 1956 | memcpy (copy, *argptr, p - *argptr); |
f70be3e4 JG |
1957 | copy[p - *argptr] = '\0'; |
1958 | if ((copy[0] == copy [p - *argptr - 1]) | |
1959 | && strchr (gdb_completer_quote_characters, copy[0]) != NULL) | |
1960 | { | |
1961 | char *temp; | |
1962 | copy [p - *argptr - 1] = '\0'; | |
1963 | copy++; | |
f70be3e4 | 1964 | } |
bd5635a1 RP |
1965 | while (*p == ' ' || *p == '\t') p++; |
1966 | *argptr = p; | |
1967 | ||
1968 | /* Look up that token as a variable. | |
1969 | If file specified, use that file's per-file block to start with. */ | |
1970 | ||
1971 | sym = lookup_symbol (copy, | |
3ba6a043 | 1972 | (s ? BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK) |
bd5635a1 RP |
1973 | : get_selected_block ()), |
1974 | VAR_NAMESPACE, 0, &sym_symtab); | |
1975 | ||
1976 | if (sym != NULL) | |
1977 | { | |
1978 | if (SYMBOL_CLASS (sym) == LOC_BLOCK) | |
1979 | { | |
1980 | /* Arg is the name of a function */ | |
1981 | pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)) + FUNCTION_START_OFFSET; | |
1982 | if (funfirstline) | |
1983 | SKIP_PROLOGUE (pc); | |
1984 | val = find_pc_line (pc, 0); | |
1985 | #ifdef PROLOGUE_FIRSTLINE_OVERLAP | |
1986 | /* Convex: no need to suppress code on first line, if any */ | |
1987 | val.pc = pc; | |
1988 | #else | |
f1ed4330 JK |
1989 | /* Check if SKIP_PROLOGUE left us in mid-line, and the next |
1990 | line is still part of the same function. */ | |
1991 | if (val.pc != pc | |
1992 | && BLOCK_START (SYMBOL_BLOCK_VALUE (sym)) <= val.end | |
1993 | && val.end < BLOCK_END (SYMBOL_BLOCK_VALUE (sym))) | |
1994 | { | |
1995 | /* First pc of next line */ | |
1996 | pc = val.end; | |
1997 | /* Recalculate the line number (might not be N+1). */ | |
1998 | val = find_pc_line (pc, 0); | |
1999 | } | |
7b2a87ca | 2000 | val.pc = pc; |
bd5635a1 RP |
2001 | #endif |
2002 | values.sals = (struct symtab_and_line *)xmalloc (sizeof (struct symtab_and_line)); | |
2003 | values.sals[0] = val; | |
2004 | values.nelts = 1; | |
2005 | ||
2006 | /* I think this is always the same as the line that | |
2007 | we calculate above, but the general principle is | |
2008 | "trust the symbols more than stuff like | |
2009 | SKIP_PROLOGUE". */ | |
2010 | if (SYMBOL_LINE (sym) != 0) | |
2011 | values.sals[0].line = SYMBOL_LINE (sym); | |
6f87ec4a PS |
2012 | |
2013 | /* We might need a canonical line spec if it is a static function. */ | |
2014 | if (s == 0) | |
2015 | { | |
2016 | struct blockvector *bv = BLOCKVECTOR (sym_symtab); | |
2017 | struct block *b = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
2018 | if (lookup_block_symbol (b, copy, VAR_NAMESPACE) != NULL) | |
2019 | build_canonical_line_spec (values.sals, copy, canonical); | |
2020 | } | |
bd5635a1 RP |
2021 | return values; |
2022 | } | |
2023 | else if (SYMBOL_LINE (sym) != 0) | |
2024 | { | |
2025 | /* We know its line number. */ | |
2026 | values.sals = (struct symtab_and_line *) | |
2027 | xmalloc (sizeof (struct symtab_and_line)); | |
2028 | values.nelts = 1; | |
4ed3a9ea | 2029 | memset (&values.sals[0], 0, sizeof (values.sals[0])); |
bd5635a1 RP |
2030 | values.sals[0].symtab = sym_symtab; |
2031 | values.sals[0].line = SYMBOL_LINE (sym); | |
2032 | return values; | |
2033 | } | |
2034 | else | |
2035 | /* This can happen if it is compiled with a compiler which doesn't | |
2036 | put out line numbers for variables. */ | |
f1ed4330 JK |
2037 | /* FIXME: Shouldn't we just set .line and .symtab to zero and |
2038 | return? For example, "info line foo" could print the address. */ | |
bd5635a1 RP |
2039 | error ("Line number not known for symbol \"%s\"", copy); |
2040 | } | |
2041 | ||
cba0d141 JG |
2042 | msymbol = lookup_minimal_symbol (copy, (struct objfile *) NULL); |
2043 | if (msymbol != NULL) | |
bd5635a1 RP |
2044 | { |
2045 | val.symtab = 0; | |
2046 | val.line = 0; | |
2e4964ad | 2047 | val.pc = SYMBOL_VALUE_ADDRESS (msymbol) + FUNCTION_START_OFFSET; |
bd5635a1 RP |
2048 | if (funfirstline) |
2049 | SKIP_PROLOGUE (val.pc); | |
2050 | values.sals = (struct symtab_and_line *)xmalloc (sizeof (struct symtab_and_line)); | |
2051 | values.sals[0] = val; | |
2052 | values.nelts = 1; | |
2053 | return values; | |
2054 | } | |
2055 | ||
cba0d141 JG |
2056 | if (!have_full_symbols () && |
2057 | !have_partial_symbols () && !have_minimal_symbols ()) | |
997a978c JG |
2058 | error (no_symtab_msg); |
2059 | ||
f70be3e4 | 2060 | error ("Function \"%s\" not defined.", copy); |
bd5635a1 RP |
2061 | return values; /* for lint */ |
2062 | } | |
2063 | ||
2064 | struct symtabs_and_lines | |
2065 | decode_line_spec (string, funfirstline) | |
2066 | char *string; | |
2067 | int funfirstline; | |
2068 | { | |
2069 | struct symtabs_and_lines sals; | |
2070 | if (string == 0) | |
2071 | error ("Empty line specification."); | |
2072 | sals = decode_line_1 (&string, funfirstline, | |
6f87ec4a PS |
2073 | current_source_symtab, current_source_line, |
2074 | (char ***)NULL); | |
bd5635a1 RP |
2075 | if (*string) |
2076 | error ("Junk at end of line specification: %s", string); | |
2077 | return sals; | |
2078 | } | |
2079 | ||
6f87ec4a PS |
2080 | /* Given a list of NELTS symbols in SYM_ARR, return a list of lines to |
2081 | operate on (ask user if necessary). | |
2082 | If CANONICAL is non-NULL return a corresponding array of mangled names | |
2083 | as canonical line specs there. */ | |
2e4964ad | 2084 | |
cba0d141 | 2085 | static struct symtabs_and_lines |
6f87ec4a | 2086 | decode_line_2 (sym_arr, nelts, funfirstline, canonical) |
bd5635a1 RP |
2087 | struct symbol *sym_arr[]; |
2088 | int nelts; | |
2089 | int funfirstline; | |
6f87ec4a | 2090 | char ***canonical; |
bd5635a1 | 2091 | { |
bd5635a1 RP |
2092 | struct symtabs_and_lines values, return_values; |
2093 | register CORE_ADDR pc; | |
cba0d141 | 2094 | char *args, *arg1; |
bd5635a1 RP |
2095 | int i; |
2096 | char *prompt; | |
2e4964ad | 2097 | char *symname; |
6f87ec4a PS |
2098 | struct cleanup *old_chain; |
2099 | char **canonical_arr = (char **)NULL; | |
bd5635a1 RP |
2100 | |
2101 | values.sals = (struct symtab_and_line *) alloca (nelts * sizeof(struct symtab_and_line)); | |
2102 | return_values.sals = (struct symtab_and_line *) xmalloc (nelts * sizeof(struct symtab_and_line)); | |
6f87ec4a PS |
2103 | old_chain = make_cleanup (free, return_values.sals); |
2104 | ||
2105 | if (canonical) | |
2106 | { | |
2107 | canonical_arr = (char **) xmalloc (nelts * sizeof (char *)); | |
2108 | make_cleanup (free, canonical_arr); | |
2109 | memset (canonical_arr, 0, nelts * sizeof (char *)); | |
2110 | *canonical = canonical_arr; | |
2111 | } | |
bd5635a1 RP |
2112 | |
2113 | i = 0; | |
2114 | printf("[0] cancel\n[1] all\n"); | |
2115 | while (i < nelts) | |
2116 | { | |
2117 | if (sym_arr[i] && SYMBOL_CLASS (sym_arr[i]) == LOC_BLOCK) | |
2118 | { | |
2119 | /* Arg is the name of a function */ | |
2120 | pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym_arr[i])) | |
2121 | + FUNCTION_START_OFFSET; | |
2122 | if (funfirstline) | |
2123 | SKIP_PROLOGUE (pc); | |
2124 | values.sals[i] = find_pc_line (pc, 0); | |
2125 | values.sals[i].pc = (values.sals[i].end && values.sals[i].pc != pc) ? | |
2126 | values.sals[i].end : pc; | |
2e4964ad | 2127 | printf("[%d] %s at %s:%d\n", (i+2), SYMBOL_SOURCE_NAME (sym_arr[i]), |
8050a57b | 2128 | values.sals[i].symtab->filename, values.sals[i].line); |
bd5635a1 RP |
2129 | } |
2130 | else printf ("?HERE\n"); | |
2131 | i++; | |
2132 | } | |
2133 | ||
2134 | if ((prompt = getenv ("PS2")) == NULL) | |
2135 | { | |
2136 | prompt = ">"; | |
2137 | } | |
2138 | printf("%s ",prompt); | |
2139 | fflush(stdout); | |
2140 | ||
cba0d141 | 2141 | args = command_line_input ((char *) NULL, 0); |
bd5635a1 | 2142 | |
6f87ec4a | 2143 | if (args == 0 || *args == 0) |
bd5635a1 RP |
2144 | error_no_arg ("one or more choice numbers"); |
2145 | ||
2146 | i = 0; | |
2147 | while (*args) | |
2148 | { | |
2149 | int num; | |
2150 | ||
2151 | arg1 = args; | |
2152 | while (*arg1 >= '0' && *arg1 <= '9') arg1++; | |
2153 | if (*arg1 && *arg1 != ' ' && *arg1 != '\t') | |
2154 | error ("Arguments must be choice numbers."); | |
2155 | ||
2156 | num = atoi (args); | |
2157 | ||
2158 | if (num == 0) | |
2159 | error ("cancelled"); | |
2160 | else if (num == 1) | |
2161 | { | |
6f87ec4a PS |
2162 | if (canonical_arr) |
2163 | { | |
2164 | for (i = 0; i < nelts; i++) | |
2165 | { | |
2166 | if (canonical_arr[i] == NULL) | |
2167 | { | |
2168 | symname = SYMBOL_NAME (sym_arr[i]); | |
2169 | canonical_arr[i] = savestring (symname, strlen (symname)); | |
2170 | } | |
2171 | } | |
2172 | } | |
4ed3a9ea FF |
2173 | memcpy (return_values.sals, values.sals, |
2174 | (nelts * sizeof(struct symtab_and_line))); | |
bd5635a1 | 2175 | return_values.nelts = nelts; |
6f87ec4a | 2176 | discard_cleanups (old_chain); |
bd5635a1 RP |
2177 | return return_values; |
2178 | } | |
2179 | ||
2180 | if (num > nelts + 2) | |
2181 | { | |
2182 | printf ("No choice number %d.\n", num); | |
2183 | } | |
2184 | else | |
2185 | { | |
2186 | num -= 2; | |
2187 | if (values.sals[num].pc) | |
2188 | { | |
6f87ec4a PS |
2189 | if (canonical_arr) |
2190 | { | |
2191 | symname = SYMBOL_NAME (sym_arr[num]); | |
2192 | make_cleanup (free, symname); | |
2193 | canonical_arr[i] = savestring (symname, strlen (symname)); | |
2194 | } | |
bd5635a1 RP |
2195 | return_values.sals[i++] = values.sals[num]; |
2196 | values.sals[num].pc = 0; | |
2197 | } | |
2198 | else | |
2199 | { | |
2200 | printf ("duplicate request for %d ignored.\n", num); | |
2201 | } | |
2202 | } | |
2203 | ||
2204 | args = arg1; | |
2205 | while (*args == ' ' || *args == '\t') args++; | |
2206 | } | |
2207 | return_values.nelts = i; | |
6f87ec4a | 2208 | discard_cleanups (old_chain); |
bd5635a1 RP |
2209 | return return_values; |
2210 | } | |
2211 | ||
bd5635a1 RP |
2212 | \f |
2213 | /* Slave routine for sources_info. Force line breaks at ,'s. | |
2214 | NAME is the name to print and *FIRST is nonzero if this is the first | |
2215 | name printed. Set *FIRST to zero. */ | |
2216 | static void | |
2217 | output_source_filename (name, first) | |
2218 | char *name; | |
2219 | int *first; | |
2220 | { | |
bd5635a1 RP |
2221 | /* Table of files printed so far. Since a single source file can |
2222 | result in several partial symbol tables, we need to avoid printing | |
2223 | it more than once. Note: if some of the psymtabs are read in and | |
2224 | some are not, it gets printed both under "Source files for which | |
2225 | symbols have been read" and "Source files for which symbols will | |
2226 | be read in on demand". I consider this a reasonable way to deal | |
2227 | with the situation. I'm not sure whether this can also happen for | |
2228 | symtabs; it doesn't hurt to check. */ | |
2229 | static char **tab = NULL; | |
2230 | /* Allocated size of tab in elements. | |
2231 | Start with one 256-byte block (when using GNU malloc.c). | |
2232 | 24 is the malloc overhead when range checking is in effect. */ | |
2233 | static int tab_alloc_size = (256 - 24) / sizeof (char *); | |
2234 | /* Current size of tab in elements. */ | |
2235 | static int tab_cur_size; | |
2236 | ||
2237 | char **p; | |
2238 | ||
2239 | if (*first) | |
2240 | { | |
2241 | if (tab == NULL) | |
2242 | tab = (char **) xmalloc (tab_alloc_size * sizeof (*tab)); | |
2243 | tab_cur_size = 0; | |
2244 | } | |
2245 | ||
2246 | /* Is NAME in tab? */ | |
2247 | for (p = tab; p < tab + tab_cur_size; p++) | |
2e4964ad | 2248 | if (STREQ (*p, name)) |
bd5635a1 RP |
2249 | /* Yes; don't print it again. */ |
2250 | return; | |
2251 | /* No; add it to tab. */ | |
2252 | if (tab_cur_size == tab_alloc_size) | |
2253 | { | |
2254 | tab_alloc_size *= 2; | |
cba0d141 | 2255 | tab = (char **) xrealloc ((char *) tab, tab_alloc_size * sizeof (*tab)); |
bd5635a1 RP |
2256 | } |
2257 | tab[tab_cur_size++] = name; | |
2258 | ||
2259 | if (*first) | |
2260 | { | |
bd5635a1 RP |
2261 | *first = 0; |
2262 | } | |
2263 | else | |
2264 | { | |
f70be3e4 | 2265 | printf_filtered (", "); |
bd5635a1 RP |
2266 | } |
2267 | ||
f70be3e4 | 2268 | wrap_here (""); |
bd5635a1 | 2269 | fputs_filtered (name, stdout); |
bd5635a1 RP |
2270 | } |
2271 | ||
2272 | static void | |
35a25840 SG |
2273 | sources_info (ignore, from_tty) |
2274 | char *ignore; | |
2275 | int from_tty; | |
bd5635a1 RP |
2276 | { |
2277 | register struct symtab *s; | |
2278 | register struct partial_symtab *ps; | |
cba0d141 | 2279 | register struct objfile *objfile; |
bd5635a1 RP |
2280 | int first; |
2281 | ||
cba0d141 | 2282 | if (!have_full_symbols () && !have_partial_symbols ()) |
bd5635a1 | 2283 | { |
3053b9f2 | 2284 | error (no_symtab_msg); |
bd5635a1 RP |
2285 | } |
2286 | ||
2287 | printf_filtered ("Source files for which symbols have been read in:\n\n"); | |
2288 | ||
2289 | first = 1; | |
35a25840 | 2290 | ALL_SYMTABS (objfile, s) |
cba0d141 | 2291 | { |
35a25840 | 2292 | output_source_filename (s -> filename, &first); |
cba0d141 | 2293 | } |
bd5635a1 RP |
2294 | printf_filtered ("\n\n"); |
2295 | ||
2296 | printf_filtered ("Source files for which symbols will be read in on demand:\n\n"); | |
2297 | ||
2298 | first = 1; | |
35a25840 | 2299 | ALL_PSYMTABS (objfile, ps) |
cba0d141 | 2300 | { |
35a25840 | 2301 | if (!ps->readin) |
cba0d141 | 2302 | { |
35a25840 | 2303 | output_source_filename (ps -> filename, &first); |
cba0d141 JG |
2304 | } |
2305 | } | |
bd5635a1 RP |
2306 | printf_filtered ("\n"); |
2307 | } | |
2308 | ||
2e4964ad | 2309 | /* List all symbols (if REGEXP is NULL) or all symbols matching REGEXP. |
3a16d640 JG |
2310 | If CLASS is zero, list all symbols except functions, type names, and |
2311 | constants (enums). | |
bd5635a1 RP |
2312 | If CLASS is 1, list only functions. |
2313 | If CLASS is 2, list only type names. | |
997a978c | 2314 | If CLASS is 3, list only method names. |
bd5635a1 RP |
2315 | |
2316 | BPT is non-zero if we should set a breakpoint at the functions | |
2317 | we find. */ | |
2318 | ||
2319 | static void | |
2320 | list_symbols (regexp, class, bpt) | |
2321 | char *regexp; | |
2322 | int class; | |
2323 | int bpt; | |
2324 | { | |
2325 | register struct symtab *s; | |
2326 | register struct partial_symtab *ps; | |
2327 | register struct blockvector *bv; | |
2328 | struct blockvector *prev_bv = 0; | |
2329 | register struct block *b; | |
2330 | register int i, j; | |
2331 | register struct symbol *sym; | |
2332 | struct partial_symbol *psym; | |
cba0d141 JG |
2333 | struct objfile *objfile; |
2334 | struct minimal_symbol *msymbol; | |
35a25840 | 2335 | char *val; |
bd5635a1 RP |
2336 | static char *classnames[] |
2337 | = {"variable", "function", "type", "method"}; | |
2338 | int found_in_file = 0; | |
997a978c | 2339 | int found_misc = 0; |
cba0d141 JG |
2340 | static enum minimal_symbol_type types[] |
2341 | = {mst_data, mst_text, mst_abs, mst_unknown}; | |
2342 | static enum minimal_symbol_type types2[] | |
2343 | = {mst_bss, mst_text, mst_abs, mst_unknown}; | |
2344 | enum minimal_symbol_type ourtype = types[class]; | |
2345 | enum minimal_symbol_type ourtype2 = types2[class]; | |
bd5635a1 | 2346 | |
2e4964ad | 2347 | if (regexp != NULL) |
2cd99985 PB |
2348 | { |
2349 | /* Make sure spacing is right for C++ operators. | |
2350 | This is just a courtesy to make the matching less sensitive | |
2351 | to how many spaces the user leaves between 'operator' | |
2352 | and <TYPENAME> or <OPERATOR>. */ | |
2353 | char *opend; | |
2354 | char *opname = operator_chars (regexp, &opend); | |
2355 | if (*opname) | |
2356 | { | |
2357 | int fix = -1; /* -1 means ok; otherwise number of spaces needed. */ | |
2358 | if (isalpha(*opname) || *opname == '_' || *opname == '$') | |
2359 | { | |
2360 | /* There should 1 space between 'operator' and 'TYPENAME'. */ | |
2361 | if (opname[-1] != ' ' || opname[-2] == ' ') | |
2362 | fix = 1; | |
2363 | } | |
2364 | else | |
2365 | { | |
2366 | /* There should 0 spaces between 'operator' and 'OPERATOR'. */ | |
2367 | if (opname[-1] == ' ') | |
2368 | fix = 0; | |
2369 | } | |
2370 | /* If wrong number of spaces, fix it. */ | |
2371 | if (fix >= 0) | |
2372 | { | |
2373 | char *tmp = (char*) alloca(opend-opname+10); | |
2374 | sprintf(tmp, "operator%.*s%s", fix, " ", opname); | |
2375 | regexp = tmp; | |
2376 | } | |
2377 | } | |
2378 | ||
2379 | if (0 != (val = re_comp (regexp))) | |
2380 | error ("Invalid regexp (%s): %s", val, regexp); | |
2381 | } | |
bd5635a1 | 2382 | |
cba0d141 | 2383 | /* Search through the partial symtabs *first* for all symbols |
bd5635a1 RP |
2384 | matching the regexp. That way we don't have to reproduce all of |
2385 | the machinery below. */ | |
bd5635a1 | 2386 | |
35a25840 | 2387 | ALL_PSYMTABS (objfile, ps) |
cba0d141 | 2388 | { |
35a25840 SG |
2389 | struct partial_symbol *bound, *gbound, *sbound; |
2390 | int keep_going = 1; | |
2391 | ||
2392 | if (ps->readin) continue; | |
2393 | ||
2394 | gbound = objfile->global_psymbols.list + ps->globals_offset + ps->n_global_syms; | |
2395 | sbound = objfile->static_psymbols.list + ps->statics_offset + ps->n_static_syms; | |
2396 | bound = gbound; | |
2397 | ||
2398 | /* Go through all of the symbols stored in a partial | |
2399 | symtab in one loop. */ | |
2400 | psym = objfile->global_psymbols.list + ps->globals_offset; | |
2401 | while (keep_going) | |
bd5635a1 | 2402 | { |
35a25840 | 2403 | if (psym >= bound) |
bd5635a1 | 2404 | { |
35a25840 | 2405 | if (bound == gbound && ps->n_static_syms != 0) |
bd5635a1 | 2406 | { |
35a25840 SG |
2407 | psym = objfile->static_psymbols.list + ps->statics_offset; |
2408 | bound = sbound; | |
bd5635a1 RP |
2409 | } |
2410 | else | |
35a25840 SG |
2411 | keep_going = 0; |
2412 | continue; | |
2413 | } | |
2414 | else | |
2415 | { | |
2416 | QUIT; | |
2417 | ||
2418 | /* If it would match (logic taken from loop below) | |
2419 | load the file and go on to the next one */ | |
2e4964ad | 2420 | if ((regexp == NULL || SYMBOL_MATCHES_REGEXP (psym)) |
35a25840 SG |
2421 | && ((class == 0 && SYMBOL_CLASS (psym) != LOC_TYPEDEF |
2422 | && SYMBOL_CLASS (psym) != LOC_BLOCK) | |
2423 | || (class == 1 && SYMBOL_CLASS (psym) == LOC_BLOCK) | |
2424 | || (class == 2 && SYMBOL_CLASS (psym) == LOC_TYPEDEF) | |
2425 | || (class == 3 && SYMBOL_CLASS (psym) == LOC_BLOCK))) | |
bd5635a1 | 2426 | { |
4ed3a9ea | 2427 | PSYMTAB_TO_SYMTAB(ps); |
35a25840 | 2428 | keep_going = 0; |
bd5635a1 RP |
2429 | } |
2430 | } | |
35a25840 | 2431 | psym++; |
bd5635a1 RP |
2432 | } |
2433 | } | |
2434 | ||
cba0d141 | 2435 | /* Here, we search through the minimal symbol tables for functions that |
bd5635a1 RP |
2436 | match, and call find_pc_symtab on them to force their symbols to |
2437 | be read. The symbol will then be found during the scan of symtabs | |
997a978c JG |
2438 | below. If find_pc_symtab fails, set found_misc so that we will |
2439 | rescan to print any matching symbols without debug info. */ | |
2440 | ||
cba0d141 JG |
2441 | if (class == 1) |
2442 | { | |
35a25840 | 2443 | ALL_MSYMBOLS (objfile, msymbol) |
cba0d141 | 2444 | { |
2e4964ad FF |
2445 | if (MSYMBOL_TYPE (msymbol) == ourtype || |
2446 | MSYMBOL_TYPE (msymbol) == ourtype2) | |
cba0d141 | 2447 | { |
2e4964ad | 2448 | if (regexp == NULL || SYMBOL_MATCHES_REGEXP (msymbol)) |
cba0d141 | 2449 | { |
2e4964ad | 2450 | if (0 == find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol))) |
cba0d141 | 2451 | { |
35a25840 | 2452 | found_misc = 1; |
cba0d141 JG |
2453 | } |
2454 | } | |
2455 | } | |
2456 | } | |
bd5635a1 RP |
2457 | } |
2458 | ||
2459 | /* Printout here so as to get after the "Reading in symbols" | |
2460 | messages which will be generated above. */ | |
2461 | if (!bpt) | |
2462 | printf_filtered (regexp | |
2463 | ? "All %ss matching regular expression \"%s\":\n" | |
2464 | : "All defined %ss:\n", | |
2465 | classnames[class], | |
2466 | regexp); | |
2467 | ||
35a25840 | 2468 | ALL_SYMTABS (objfile, s) |
bd5635a1 | 2469 | { |
35a25840 SG |
2470 | found_in_file = 0; |
2471 | bv = BLOCKVECTOR (s); | |
2472 | /* Often many files share a blockvector. | |
2473 | Scan each blockvector only once so that | |
2474 | we don't get every symbol many times. | |
2475 | It happens that the first symtab in the list | |
2476 | for any given blockvector is the main file. */ | |
2477 | if (bv != prev_bv) | |
2478 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) | |
2479 | { | |
2480 | b = BLOCKVECTOR_BLOCK (bv, i); | |
2481 | /* Skip the sort if this block is always sorted. */ | |
2482 | if (!BLOCK_SHOULD_SORT (b)) | |
2483 | sort_block_syms (b); | |
2484 | for (j = 0; j < BLOCK_NSYMS (b); j++) | |
bd5635a1 | 2485 | { |
35a25840 SG |
2486 | QUIT; |
2487 | sym = BLOCK_SYM (b, j); | |
2e4964ad | 2488 | if ((regexp == NULL || SYMBOL_MATCHES_REGEXP (sym)) |
35a25840 | 2489 | && ((class == 0 && SYMBOL_CLASS (sym) != LOC_TYPEDEF |
3a16d640 JG |
2490 | && SYMBOL_CLASS (sym) != LOC_BLOCK |
2491 | && SYMBOL_CLASS (sym) != LOC_CONST) | |
35a25840 SG |
2492 | || (class == 1 && SYMBOL_CLASS (sym) == LOC_BLOCK) |
2493 | || (class == 2 && SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
2494 | || (class == 3 && SYMBOL_CLASS (sym) == LOC_BLOCK))) | |
bd5635a1 | 2495 | { |
35a25840 | 2496 | if (bpt) |
bd5635a1 | 2497 | { |
35a25840 SG |
2498 | /* Set a breakpoint here, if it's a function */ |
2499 | if (class == 1) | |
ca6a826d PS |
2500 | { |
2501 | /* There may be more than one function with the | |
2502 | same name but in different files. In order to | |
2503 | set breakpoints on all of them, we must give | |
2504 | both the file name and the function name to | |
2505 | break_command. */ | |
2506 | char *string = | |
2507 | (char *) alloca (strlen (s->filename) | |
2508 | + strlen (SYMBOL_NAME(sym)) | |
2509 | + 2); | |
2510 | strcpy (string, s->filename); | |
2511 | strcat (string, ":"); | |
2512 | strcat (string, SYMBOL_NAME(sym)); | |
2513 | break_command (string, 0); | |
2514 | } | |
35a25840 SG |
2515 | } |
2516 | else if (!found_in_file) | |
2517 | { | |
2518 | fputs_filtered ("\nFile ", stdout); | |
2519 | fputs_filtered (s->filename, stdout); | |
2520 | fputs_filtered (":\n", stdout); | |
2521 | } | |
2522 | found_in_file = 1; | |
2523 | ||
2524 | if (class != 2 && i == STATIC_BLOCK) | |
2525 | printf_filtered ("static "); | |
2526 | ||
2527 | /* Typedef that is not a C++ class */ | |
2528 | if (class == 2 | |
2529 | && SYMBOL_NAMESPACE (sym) != STRUCT_NAMESPACE) | |
a8a69e63 | 2530 | c_typedef_print (SYMBOL_TYPE(sym), sym, stdout); |
35a25840 SG |
2531 | /* variable, func, or typedef-that-is-c++-class */ |
2532 | else if (class < 2 || | |
2533 | (class == 2 && | |
2534 | SYMBOL_NAMESPACE(sym) == STRUCT_NAMESPACE)) | |
2535 | { | |
2536 | type_print (SYMBOL_TYPE (sym), | |
2537 | (SYMBOL_CLASS (sym) == LOC_TYPEDEF | |
2e4964ad | 2538 | ? "" : SYMBOL_SOURCE_NAME (sym)), |
35a25840 | 2539 | stdout, 0); |
cba0d141 | 2540 | |
35a25840 SG |
2541 | printf_filtered (";\n"); |
2542 | } | |
2543 | else | |
2544 | { | |
a8a69e63 | 2545 | # if 0 /* FIXME, why is this zapped out? */ |
35a25840 | 2546 | char buf[1024]; |
a8a69e63 FF |
2547 | c_type_print_base (TYPE_FN_FIELD_TYPE(t, i), |
2548 | stdout, 0, 0); | |
2549 | c_type_print_varspec_prefix (TYPE_FN_FIELD_TYPE(t, i), | |
2550 | stdout, 0); | |
35a25840 | 2551 | sprintf (buf, " %s::", type_name_no_tag (t)); |
a8a69e63 FF |
2552 | cp_type_print_method_args (TYPE_FN_FIELD_ARGS (t, i), |
2553 | buf, name, stdout); | |
bd5635a1 RP |
2554 | # endif |
2555 | } | |
2556 | } | |
2557 | } | |
35a25840 SG |
2558 | } |
2559 | prev_bv = bv; | |
bd5635a1 | 2560 | } |
997a978c | 2561 | |
997a978c | 2562 | /* If there are no eyes, avoid all contact. I mean, if there are |
cba0d141 JG |
2563 | no debug symbols, then print directly from the msymbol_vector. */ |
2564 | ||
2565 | if (found_misc || class != 1) | |
2566 | { | |
2567 | found_in_file = 0; | |
35a25840 | 2568 | ALL_MSYMBOLS (objfile, msymbol) |
cba0d141 | 2569 | { |
2e4964ad FF |
2570 | if (MSYMBOL_TYPE (msymbol) == ourtype || |
2571 | MSYMBOL_TYPE (msymbol) == ourtype2) | |
cba0d141 | 2572 | { |
2e4964ad | 2573 | if (regexp == NULL || SYMBOL_MATCHES_REGEXP (msymbol)) |
cba0d141 | 2574 | { |
35a25840 | 2575 | /* Functions: Look up by address. */ |
f70be3e4 | 2576 | if (class != 1 || |
2e4964ad | 2577 | (0 == find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol)))) |
cba0d141 | 2578 | { |
35a25840 | 2579 | /* Variables/Absolutes: Look up by name */ |
2e4964ad FF |
2580 | if (lookup_symbol (SYMBOL_NAME (msymbol), |
2581 | (struct block *) NULL, VAR_NAMESPACE, | |
2582 | 0, (struct symtab **) NULL) == NULL) | |
cba0d141 | 2583 | { |
35a25840 | 2584 | if (!found_in_file) |
cba0d141 | 2585 | { |
35a25840 SG |
2586 | printf_filtered ("\nNon-debugging symbols:\n"); |
2587 | found_in_file = 1; | |
cba0d141 | 2588 | } |
35a25840 | 2589 | printf_filtered (" %08x %s\n", |
2e4964ad FF |
2590 | SYMBOL_VALUE_ADDRESS (msymbol), |
2591 | SYMBOL_SOURCE_NAME (msymbol)); | |
cba0d141 JG |
2592 | } |
2593 | } | |
2594 | } | |
2595 | } | |
997a978c | 2596 | } |
997a978c | 2597 | } |
bd5635a1 RP |
2598 | } |
2599 | ||
2600 | static void | |
35a25840 | 2601 | variables_info (regexp, from_tty) |
bd5635a1 | 2602 | char *regexp; |
35a25840 | 2603 | int from_tty; |
bd5635a1 RP |
2604 | { |
2605 | list_symbols (regexp, 0, 0); | |
2606 | } | |
2607 | ||
2608 | static void | |
35a25840 | 2609 | functions_info (regexp, from_tty) |
bd5635a1 | 2610 | char *regexp; |
35a25840 | 2611 | int from_tty; |
bd5635a1 RP |
2612 | { |
2613 | list_symbols (regexp, 1, 0); | |
2614 | } | |
2615 | ||
bd5635a1 | 2616 | static void |
35a25840 | 2617 | types_info (regexp, from_tty) |
bd5635a1 | 2618 | char *regexp; |
35a25840 | 2619 | int from_tty; |
bd5635a1 RP |
2620 | { |
2621 | list_symbols (regexp, 2, 0); | |
2622 | } | |
bd5635a1 RP |
2623 | |
2624 | #if 0 | |
2625 | /* Tiemann says: "info methods was never implemented." */ | |
2626 | static void | |
2627 | methods_info (regexp) | |
2628 | char *regexp; | |
2629 | { | |
2630 | list_symbols (regexp, 3, 0); | |
2631 | } | |
2632 | #endif /* 0 */ | |
2633 | ||
2634 | /* Breakpoint all functions matching regular expression. */ | |
2635 | static void | |
35a25840 | 2636 | rbreak_command (regexp, from_tty) |
bd5635a1 | 2637 | char *regexp; |
35a25840 | 2638 | int from_tty; |
bd5635a1 RP |
2639 | { |
2640 | list_symbols (regexp, 1, 1); | |
2641 | } | |
2642 | \f | |
bd5635a1 RP |
2643 | |
2644 | /* Return Nonzero if block a is lexically nested within block b, | |
2645 | or if a and b have the same pc range. | |
2646 | Return zero otherwise. */ | |
2647 | int | |
2648 | contained_in (a, b) | |
2649 | struct block *a, *b; | |
2650 | { | |
2651 | if (!a || !b) | |
2652 | return 0; | |
2653 | return BLOCK_START (a) >= BLOCK_START (b) | |
2654 | && BLOCK_END (a) <= BLOCK_END (b); | |
2655 | } | |
2656 | ||
2657 | \f | |
2658 | /* Helper routine for make_symbol_completion_list. */ | |
2659 | ||
f70be3e4 JG |
2660 | static int return_val_size; |
2661 | static int return_val_index; | |
2662 | static char **return_val; | |
2663 | ||
f1ed4330 | 2664 | #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \ |
2e4964ad | 2665 | do { \ |
f1ed4330 JK |
2666 | completion_list_add_name (SYMBOL_NAME (symbol), (sym_text), (len), \ |
2667 | (text), (word)); \ | |
2668 | if (SYMBOL_DEMANGLED_NAME (symbol) != NULL) \ | |
2669 | completion_list_add_name \ | |
2670 | (SYMBOL_DEMANGLED_NAME (symbol), (sym_text), (len), (text), (word)); \ | |
2e4964ad FF |
2671 | } while (0) |
2672 | ||
2673 | /* Test to see if the symbol specified by SYMNAME (which is already | |
f1ed4330 | 2674 | demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN |
2e4964ad | 2675 | characters. If so, add it to the current completion list. */ |
bd5635a1 | 2676 | |
cba0d141 | 2677 | static void |
f1ed4330 | 2678 | completion_list_add_name (symname, sym_text, sym_text_len, text, word) |
bd5635a1 | 2679 | char *symname; |
f1ed4330 JK |
2680 | char *sym_text; |
2681 | int sym_text_len; | |
f70be3e4 | 2682 | char *text; |
f1ed4330 | 2683 | char *word; |
bd5635a1 | 2684 | { |
f70be3e4 | 2685 | int newsize; |
8005788c RP |
2686 | int i; |
2687 | ||
2688 | /* clip symbols that cannot match */ | |
2689 | ||
f1ed4330 | 2690 | if (strncmp (symname, sym_text, sym_text_len) != 0) |
2e4964ad | 2691 | { |
8005788c RP |
2692 | return; |
2693 | } | |
f70be3e4 | 2694 | |
2e4964ad FF |
2695 | /* Clip any symbol names that we've already considered. (This is a |
2696 | time optimization) */ | |
8005788c | 2697 | |
2e4964ad FF |
2698 | for (i = 0; i < return_val_index; ++i) |
2699 | { | |
2700 | if (STREQ (symname, return_val[i])) | |
2701 | { | |
2702 | return; | |
2703 | } | |
f70be3e4 | 2704 | } |
2e4964ad FF |
2705 | |
2706 | /* We have a match for a completion, so add SYMNAME to the current list | |
2707 | of matches. Note that the name is moved to freshly malloc'd space. */ | |
f70be3e4 | 2708 | |
f1ed4330 JK |
2709 | { |
2710 | char *new; | |
2711 | if (word == sym_text) | |
2712 | { | |
2713 | new = xmalloc (strlen (symname) + 5); | |
2714 | strcpy (new, symname); | |
2715 | } | |
2716 | else if (word > sym_text) | |
2717 | { | |
2718 | /* Return some portion of symname. */ | |
2719 | new = xmalloc (strlen (symname) + 5); | |
2720 | strcpy (new, symname + (word - sym_text)); | |
2721 | } | |
2722 | else | |
2723 | { | |
2724 | /* Return some of SYM_TEXT plus symname. */ | |
2725 | new = xmalloc (strlen (symname) + (sym_text - word) + 5); | |
2726 | strncpy (new, word, sym_text - word); | |
2727 | new[sym_text - word] = '\0'; | |
2728 | strcat (new, symname); | |
2729 | } | |
2730 | ||
2731 | if (return_val_index + 3 > return_val_size) | |
2732 | { | |
2733 | newsize = (return_val_size *= 2) * sizeof (char *); | |
2734 | return_val = (char **) xrealloc ((char *) return_val, newsize); | |
2735 | } | |
2736 | return_val[return_val_index++] = new; | |
2737 | return_val[return_val_index] = NULL; | |
2738 | } | |
bd5635a1 RP |
2739 | } |
2740 | ||
2741 | /* Return a NULL terminated array of all symbols (regardless of class) which | |
2742 | begin by matching TEXT. If the answer is no symbols, then the return value | |
2743 | is an array which contains only a NULL pointer. | |
2744 | ||
f70be3e4 JG |
2745 | Problem: All of the symbols have to be copied because readline frees them. |
2746 | I'm not going to worry about this; hopefully there won't be that many. */ | |
bd5635a1 RP |
2747 | |
2748 | char ** | |
f1ed4330 JK |
2749 | make_symbol_completion_list (text, word) |
2750 | char *text; | |
2751 | char *word; | |
bd5635a1 | 2752 | { |
f70be3e4 | 2753 | register struct symbol *sym; |
bd5635a1 RP |
2754 | register struct symtab *s; |
2755 | register struct partial_symtab *ps; | |
cba0d141 JG |
2756 | register struct minimal_symbol *msymbol; |
2757 | register struct objfile *objfile; | |
bd5635a1 | 2758 | register struct block *b, *surrounding_static_block = 0; |
bd5635a1 RP |
2759 | register int i, j; |
2760 | struct partial_symbol *psym; | |
f1ed4330 JK |
2761 | /* The symbol we are completing on. Points in same buffer as text. */ |
2762 | char *sym_text; | |
2763 | /* Length of sym_text. */ | |
2764 | int sym_text_len; | |
2765 | ||
2766 | /* Now look for the symbol we are supposed to complete on. | |
2767 | FIXME: This should be language-specific. */ | |
2768 | { | |
2769 | char *p; | |
2770 | char quote_found; | |
2771 | char *quote_pos; | |
2772 | ||
2773 | /* First see if this is a quoted string. */ | |
2774 | quote_found = '\0'; | |
2775 | for (p = text; *p != '\0'; ++p) | |
2776 | { | |
2777 | if (quote_found != '\0') | |
2778 | { | |
2779 | if (*p == quote_found) | |
2780 | /* Found close quote. */ | |
2781 | quote_found = '\0'; | |
2782 | else if (*p == '\\' && p[1] == quote_found) | |
2783 | /* A backslash followed by the quote character | |
2784 | doesn't end the string. */ | |
2785 | ++p; | |
2786 | } | |
2787 | else if (*p == '\'' || *p == '"') | |
2788 | { | |
2789 | quote_found = *p; | |
2790 | quote_pos = p; | |
2791 | } | |
2792 | } | |
2793 | if (quote_found == '\'') | |
2794 | /* A string within single quotes can be a symbol, so complete on it. */ | |
2795 | sym_text = quote_pos + 1; | |
2796 | else if (quote_found == '"') | |
2797 | /* A double-quoted string is never a symbol, nor does it make sense | |
2798 | to complete it any other way. */ | |
2799 | return NULL; | |
2800 | else | |
2801 | { | |
2802 | /* It is not a quoted string. Break it based on the characters | |
2803 | which are in symbols. */ | |
2804 | while (p > text) | |
2805 | { | |
2806 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0') | |
2807 | --p; | |
2808 | else | |
2809 | break; | |
2810 | } | |
2811 | sym_text = p; | |
2812 | } | |
2813 | } | |
2814 | ||
2815 | sym_text_len = strlen (sym_text); | |
bd5635a1 | 2816 | |
bd5635a1 RP |
2817 | return_val_size = 100; |
2818 | return_val_index = 0; | |
f70be3e4 JG |
2819 | return_val = (char **) xmalloc ((return_val_size + 1) * sizeof (char *)); |
2820 | return_val[0] = NULL; | |
bd5635a1 RP |
2821 | |
2822 | /* Look through the partial symtabs for all symbols which begin | |
f1ed4330 | 2823 | by matching SYM_TEXT. Add each one that you find to the list. */ |
bd5635a1 | 2824 | |
35a25840 | 2825 | ALL_PSYMTABS (objfile, ps) |
bd5635a1 | 2826 | { |
35a25840 SG |
2827 | /* If the psymtab's been read in we'll get it when we search |
2828 | through the blockvector. */ | |
2829 | if (ps->readin) continue; | |
2830 | ||
2831 | for (psym = objfile->global_psymbols.list + ps->globals_offset; | |
2832 | psym < (objfile->global_psymbols.list + ps->globals_offset | |
2833 | + ps->n_global_syms); | |
2834 | psym++) | |
bd5635a1 | 2835 | { |
f70be3e4 JG |
2836 | /* If interrupted, then quit. */ |
2837 | QUIT; | |
f1ed4330 | 2838 | COMPLETION_LIST_ADD_SYMBOL (psym, sym_text, sym_text_len, text, word); |
35a25840 SG |
2839 | } |
2840 | ||
2841 | for (psym = objfile->static_psymbols.list + ps->statics_offset; | |
2842 | psym < (objfile->static_psymbols.list + ps->statics_offset | |
2843 | + ps->n_static_syms); | |
2844 | psym++) | |
2845 | { | |
2846 | QUIT; | |
f1ed4330 | 2847 | COMPLETION_LIST_ADD_SYMBOL (psym, sym_text, sym_text_len, text, word); |
bd5635a1 RP |
2848 | } |
2849 | } | |
2850 | ||
cba0d141 | 2851 | /* At this point scan through the misc symbol vectors and add each |
bd5635a1 RP |
2852 | symbol you find to the list. Eventually we want to ignore |
2853 | anything that isn't a text symbol (everything else will be | |
2854 | handled by the psymtab code above). */ | |
2855 | ||
35a25840 | 2856 | ALL_MSYMBOLS (objfile, msymbol) |
cba0d141 | 2857 | { |
f70be3e4 | 2858 | QUIT; |
f1ed4330 | 2859 | COMPLETION_LIST_ADD_SYMBOL (msymbol, sym_text, sym_text_len, text, word); |
cba0d141 | 2860 | } |
bd5635a1 RP |
2861 | |
2862 | /* Search upwards from currently selected frame (so that we can | |
2863 | complete on local vars. */ | |
f70be3e4 JG |
2864 | |
2865 | for (b = get_selected_block (); b != NULL; b = BLOCK_SUPERBLOCK (b)) | |
2866 | { | |
2867 | if (!BLOCK_SUPERBLOCK (b)) | |
2868 | { | |
2869 | surrounding_static_block = b; /* For elmin of dups */ | |
2870 | } | |
2871 | ||
2872 | /* Also catch fields of types defined in this places which match our | |
2873 | text string. Only complete on types visible from current context. */ | |
2874 | ||
2875 | for (i = 0; i < BLOCK_NSYMS (b); i++) | |
2876 | { | |
2877 | sym = BLOCK_SYM (b, i); | |
f1ed4330 | 2878 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
f70be3e4 JG |
2879 | if (SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
2880 | { | |
2881 | struct type *t = SYMBOL_TYPE (sym); | |
2882 | enum type_code c = TYPE_CODE (t); | |
2883 | ||
2884 | if (c == TYPE_CODE_UNION || c == TYPE_CODE_STRUCT) | |
2885 | { | |
2886 | for (j = TYPE_N_BASECLASSES (t); j < TYPE_NFIELDS (t); j++) | |
2887 | { | |
2888 | if (TYPE_FIELD_NAME (t, j)) | |
2889 | { | |
2e4964ad | 2890 | completion_list_add_name (TYPE_FIELD_NAME (t, j), |
f1ed4330 | 2891 | sym_text, sym_text_len, text, word); |
f70be3e4 JG |
2892 | } |
2893 | } | |
2894 | } | |
2895 | } | |
2896 | } | |
2897 | } | |
2898 | ||
2899 | /* Go through the symtabs and check the externs and statics for | |
2900 | symbols which match. */ | |
2901 | ||
2902 | ALL_SYMTABS (objfile, s) | |
2903 | { | |
2904 | QUIT; | |
2905 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
2906 | for (i = 0; i < BLOCK_NSYMS (b); i++) | |
2907 | { | |
2908 | sym = BLOCK_SYM (b, i); | |
f1ed4330 | 2909 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
f70be3e4 JG |
2910 | } |
2911 | } | |
2912 | ||
2913 | ALL_SYMTABS (objfile, s) | |
2914 | { | |
2915 | QUIT; | |
2916 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
2917 | /* Don't do this block twice. */ | |
2918 | if (b == surrounding_static_block) continue; | |
2919 | for (i = 0; i < BLOCK_NSYMS (b); i++) | |
2920 | { | |
2921 | sym = BLOCK_SYM (b, i); | |
f1ed4330 | 2922 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
f70be3e4 JG |
2923 | } |
2924 | } | |
2925 | ||
2926 | return (return_val); | |
2927 | } | |
2928 | ||
bd5635a1 | 2929 | \f |
997a978c JG |
2930 | #if 0 |
2931 | /* Add the type of the symbol sym to the type of the current | |
2932 | function whose block we are in (assumed). The type of | |
2933 | this current function is contained in *TYPE. | |
2934 | ||
2935 | This basically works as follows: When we find a function | |
2936 | symbol (N_FUNC with a 'f' or 'F' in the symbol name), we record | |
2937 | a pointer to its type in the global in_function_type. Every | |
2938 | time we come across a parameter symbol ('p' in its name), then | |
2939 | this procedure adds the name and type of that parameter | |
2940 | to the function type pointed to by *TYPE. (Which should correspond | |
2941 | to in_function_type if it was called correctly). | |
2942 | ||
2943 | Note that since we are modifying a type, the result of | |
51b57ded | 2944 | lookup_function_type() should be memcpy()ed before calling |
997a978c JG |
2945 | this. When not in strict typing mode, the expression |
2946 | evaluator can choose to ignore this. | |
2947 | ||
2948 | Assumption: All of a function's parameter symbols will | |
2949 | appear before another function symbol is found. The parameters | |
2950 | appear in the same order in the argument list as they do in the | |
2951 | symbol table. */ | |
2952 | ||
2953 | void | |
2954 | add_param_to_type (type,sym) | |
2955 | struct type **type; | |
2956 | struct symbol *sym; | |
2957 | { | |
2958 | int num = ++(TYPE_NFIELDS(*type)); | |
2959 | ||
2960 | if(TYPE_NFIELDS(*type)-1) | |
cba0d141 JG |
2961 | TYPE_FIELDS(*type) = (struct field *) |
2962 | (*current_objfile->xrealloc) ((char *)(TYPE_FIELDS(*type)), | |
2963 | num*sizeof(struct field)); | |
997a978c | 2964 | else |
cba0d141 JG |
2965 | TYPE_FIELDS(*type) = (struct field *) |
2966 | (*current_objfile->xmalloc) (num*sizeof(struct field)); | |
997a978c JG |
2967 | |
2968 | TYPE_FIELD_BITPOS(*type,num-1) = num-1; | |
2969 | TYPE_FIELD_BITSIZE(*type,num-1) = 0; | |
2970 | TYPE_FIELD_TYPE(*type,num-1) = SYMBOL_TYPE(sym); | |
2971 | TYPE_FIELD_NAME(*type,num-1) = SYMBOL_NAME(sym); | |
2972 | } | |
2973 | #endif | |
2974 | \f | |
bd5635a1 RP |
2975 | void |
2976 | _initialize_symtab () | |
2977 | { | |
2978 | add_info ("variables", variables_info, | |
2979 | "All global and static variable names, or those matching REGEXP."); | |
2980 | add_info ("functions", functions_info, | |
2981 | "All function names, or those matching REGEXP."); | |
3ba6a043 JG |
2982 | |
2983 | /* FIXME: This command has at least the following problems: | |
bd5635a1 RP |
2984 | 1. It prints builtin types (in a very strange and confusing fashion). |
2985 | 2. It doesn't print right, e.g. with | |
2986 | typedef struct foo *FOO | |
2987 | type_print prints "FOO" when we want to make it (in this situation) | |
2988 | print "struct foo *". | |
2989 | I also think "ptype" or "whatis" is more likely to be useful (but if | |
2990 | there is much disagreement "info types" can be fixed). */ | |
2991 | add_info ("types", types_info, | |
a0a6174a | 2992 | "All type names, or those matching REGEXP."); |
3ba6a043 | 2993 | |
bd5635a1 RP |
2994 | #if 0 |
2995 | add_info ("methods", methods_info, | |
2996 | "All method names, or those matching REGEXP::REGEXP.\n\ | |
50e0dc41 | 2997 | If the class qualifier is omitted, it is assumed to be the current scope.\n\ |
cba0d141 | 2998 | If the first REGEXP is omitted, then all methods matching the second REGEXP\n\ |
bd5635a1 RP |
2999 | are listed."); |
3000 | #endif | |
3001 | add_info ("sources", sources_info, | |
3002 | "Source files in the program."); | |
3003 | ||
3004 | add_com ("rbreak", no_class, rbreak_command, | |
3005 | "Set a breakpoint for all functions matching REGEXP."); | |
3006 | ||
997a978c | 3007 | /* Initialize the one built-in type that isn't language dependent... */ |
cba0d141 JG |
3008 | builtin_type_error = init_type (TYPE_CODE_ERROR, 0, 0, |
3009 | "<unknown type>", (struct objfile *) NULL); | |
bd5635a1 | 3010 | } |