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