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