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