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