| 1 | /* Fortran language support routines for GDB, the GNU debugger. |
| 2 | |
| 3 | Copyright (C) 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, 2002, 2003, |
| 4 | 2004, 2005, 2007, 2008 Free Software Foundation, Inc. |
| 5 | |
| 6 | Contributed by Motorola. Adapted from the C parser by Farooq Butt |
| 7 | (fmbutt@engage.sps.mot.com). |
| 8 | |
| 9 | This file is part of GDB. |
| 10 | |
| 11 | This program is free software; you can redistribute it and/or modify |
| 12 | it under the terms of the GNU General Public License as published by |
| 13 | the Free Software Foundation; either version 3 of the License, or |
| 14 | (at your option) any later version. |
| 15 | |
| 16 | This program is distributed in the hope that it will be useful, |
| 17 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 18 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 19 | GNU General Public License for more details. |
| 20 | |
| 21 | You should have received a copy of the GNU General Public License |
| 22 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
| 23 | |
| 24 | #include "defs.h" |
| 25 | #include "gdb_string.h" |
| 26 | #include "symtab.h" |
| 27 | #include "gdbtypes.h" |
| 28 | #include "expression.h" |
| 29 | #include "parser-defs.h" |
| 30 | #include "language.h" |
| 31 | #include "f-lang.h" |
| 32 | #include "valprint.h" |
| 33 | #include "value.h" |
| 34 | |
| 35 | |
| 36 | /* Following is dubious stuff that had been in the xcoff reader. */ |
| 37 | |
| 38 | struct saved_fcn |
| 39 | { |
| 40 | long line_offset; /* Line offset for function */ |
| 41 | struct saved_fcn *next; |
| 42 | }; |
| 43 | |
| 44 | |
| 45 | struct saved_bf_symnum |
| 46 | { |
| 47 | long symnum_fcn; /* Symnum of function (i.e. .function directive) */ |
| 48 | long symnum_bf; /* Symnum of .bf for this function */ |
| 49 | struct saved_bf_symnum *next; |
| 50 | }; |
| 51 | |
| 52 | typedef struct saved_fcn SAVED_FUNCTION, *SAVED_FUNCTION_PTR; |
| 53 | typedef struct saved_bf_symnum SAVED_BF, *SAVED_BF_PTR; |
| 54 | |
| 55 | /* Local functions */ |
| 56 | |
| 57 | extern void _initialize_f_language (void); |
| 58 | #if 0 |
| 59 | static void clear_function_list (void); |
| 60 | static long get_bf_for_fcn (long); |
| 61 | static void clear_bf_list (void); |
| 62 | static void patch_all_commons_by_name (char *, CORE_ADDR, int); |
| 63 | static SAVED_F77_COMMON_PTR find_first_common_named (char *); |
| 64 | static void add_common_entry (struct symbol *); |
| 65 | static void add_common_block (char *, CORE_ADDR, int, char *); |
| 66 | static SAVED_FUNCTION *allocate_saved_function_node (void); |
| 67 | static SAVED_BF_PTR allocate_saved_bf_node (void); |
| 68 | static COMMON_ENTRY_PTR allocate_common_entry_node (void); |
| 69 | static SAVED_F77_COMMON_PTR allocate_saved_f77_common_node (void); |
| 70 | static void patch_common_entries (SAVED_F77_COMMON_PTR, CORE_ADDR, int); |
| 71 | #endif |
| 72 | |
| 73 | static void f_printchar (int c, struct ui_file * stream); |
| 74 | static void f_emit_char (int c, struct ui_file * stream, int quoter); |
| 75 | |
| 76 | /* Print the character C on STREAM as part of the contents of a literal |
| 77 | string whose delimiter is QUOTER. Note that that format for printing |
| 78 | characters and strings is language specific. |
| 79 | FIXME: This is a copy of the same function from c-exp.y. It should |
| 80 | be replaced with a true F77 version. */ |
| 81 | |
| 82 | static void |
| 83 | f_emit_char (int c, struct ui_file *stream, int quoter) |
| 84 | { |
| 85 | c &= 0xFF; /* Avoid sign bit follies */ |
| 86 | |
| 87 | if (PRINT_LITERAL_FORM (c)) |
| 88 | { |
| 89 | if (c == '\\' || c == quoter) |
| 90 | fputs_filtered ("\\", stream); |
| 91 | fprintf_filtered (stream, "%c", c); |
| 92 | } |
| 93 | else |
| 94 | { |
| 95 | switch (c) |
| 96 | { |
| 97 | case '\n': |
| 98 | fputs_filtered ("\\n", stream); |
| 99 | break; |
| 100 | case '\b': |
| 101 | fputs_filtered ("\\b", stream); |
| 102 | break; |
| 103 | case '\t': |
| 104 | fputs_filtered ("\\t", stream); |
| 105 | break; |
| 106 | case '\f': |
| 107 | fputs_filtered ("\\f", stream); |
| 108 | break; |
| 109 | case '\r': |
| 110 | fputs_filtered ("\\r", stream); |
| 111 | break; |
| 112 | case '\033': |
| 113 | fputs_filtered ("\\e", stream); |
| 114 | break; |
| 115 | case '\007': |
| 116 | fputs_filtered ("\\a", stream); |
| 117 | break; |
| 118 | default: |
| 119 | fprintf_filtered (stream, "\\%.3o", (unsigned int) c); |
| 120 | break; |
| 121 | } |
| 122 | } |
| 123 | } |
| 124 | |
| 125 | /* FIXME: This is a copy of the same function from c-exp.y. It should |
| 126 | be replaced with a true F77version. */ |
| 127 | |
| 128 | static void |
| 129 | f_printchar (int c, struct ui_file *stream) |
| 130 | { |
| 131 | fputs_filtered ("'", stream); |
| 132 | LA_EMIT_CHAR (c, stream, '\''); |
| 133 | fputs_filtered ("'", stream); |
| 134 | } |
| 135 | |
| 136 | /* Print the character string STRING, printing at most LENGTH characters. |
| 137 | Printing stops early if the number hits print_max; repeat counts |
| 138 | are printed as appropriate. Print ellipses at the end if we |
| 139 | had to stop before printing LENGTH characters, or if FORCE_ELLIPSES. |
| 140 | FIXME: This is a copy of the same function from c-exp.y. It should |
| 141 | be replaced with a true F77 version. */ |
| 142 | |
| 143 | static void |
| 144 | f_printstr (struct ui_file *stream, const gdb_byte *string, |
| 145 | unsigned int length, int width, int force_ellipses) |
| 146 | { |
| 147 | unsigned int i; |
| 148 | unsigned int things_printed = 0; |
| 149 | int in_quotes = 0; |
| 150 | int need_comma = 0; |
| 151 | |
| 152 | if (length == 0) |
| 153 | { |
| 154 | fputs_filtered ("''", gdb_stdout); |
| 155 | return; |
| 156 | } |
| 157 | |
| 158 | for (i = 0; i < length && things_printed < print_max; ++i) |
| 159 | { |
| 160 | /* Position of the character we are examining |
| 161 | to see whether it is repeated. */ |
| 162 | unsigned int rep1; |
| 163 | /* Number of repetitions we have detected so far. */ |
| 164 | unsigned int reps; |
| 165 | |
| 166 | QUIT; |
| 167 | |
| 168 | if (need_comma) |
| 169 | { |
| 170 | fputs_filtered (", ", stream); |
| 171 | need_comma = 0; |
| 172 | } |
| 173 | |
| 174 | rep1 = i + 1; |
| 175 | reps = 1; |
| 176 | while (rep1 < length && string[rep1] == string[i]) |
| 177 | { |
| 178 | ++rep1; |
| 179 | ++reps; |
| 180 | } |
| 181 | |
| 182 | if (reps > repeat_count_threshold) |
| 183 | { |
| 184 | if (in_quotes) |
| 185 | { |
| 186 | if (inspect_it) |
| 187 | fputs_filtered ("\\', ", stream); |
| 188 | else |
| 189 | fputs_filtered ("', ", stream); |
| 190 | in_quotes = 0; |
| 191 | } |
| 192 | f_printchar (string[i], stream); |
| 193 | fprintf_filtered (stream, " <repeats %u times>", reps); |
| 194 | i = rep1 - 1; |
| 195 | things_printed += repeat_count_threshold; |
| 196 | need_comma = 1; |
| 197 | } |
| 198 | else |
| 199 | { |
| 200 | if (!in_quotes) |
| 201 | { |
| 202 | if (inspect_it) |
| 203 | fputs_filtered ("\\'", stream); |
| 204 | else |
| 205 | fputs_filtered ("'", stream); |
| 206 | in_quotes = 1; |
| 207 | } |
| 208 | LA_EMIT_CHAR (string[i], stream, '"'); |
| 209 | ++things_printed; |
| 210 | } |
| 211 | } |
| 212 | |
| 213 | /* Terminate the quotes if necessary. */ |
| 214 | if (in_quotes) |
| 215 | { |
| 216 | if (inspect_it) |
| 217 | fputs_filtered ("\\'", stream); |
| 218 | else |
| 219 | fputs_filtered ("'", stream); |
| 220 | } |
| 221 | |
| 222 | if (force_ellipses || i < length) |
| 223 | fputs_filtered ("...", stream); |
| 224 | } |
| 225 | \f |
| 226 | |
| 227 | /* Table of operators and their precedences for printing expressions. */ |
| 228 | |
| 229 | static const struct op_print f_op_print_tab[] = |
| 230 | { |
| 231 | {"+", BINOP_ADD, PREC_ADD, 0}, |
| 232 | {"+", UNOP_PLUS, PREC_PREFIX, 0}, |
| 233 | {"-", BINOP_SUB, PREC_ADD, 0}, |
| 234 | {"-", UNOP_NEG, PREC_PREFIX, 0}, |
| 235 | {"*", BINOP_MUL, PREC_MUL, 0}, |
| 236 | {"/", BINOP_DIV, PREC_MUL, 0}, |
| 237 | {"DIV", BINOP_INTDIV, PREC_MUL, 0}, |
| 238 | {"MOD", BINOP_REM, PREC_MUL, 0}, |
| 239 | {"=", BINOP_ASSIGN, PREC_ASSIGN, 1}, |
| 240 | {".OR.", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0}, |
| 241 | {".AND.", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0}, |
| 242 | {".NOT.", UNOP_LOGICAL_NOT, PREC_PREFIX, 0}, |
| 243 | {".EQ.", BINOP_EQUAL, PREC_EQUAL, 0}, |
| 244 | {".NE.", BINOP_NOTEQUAL, PREC_EQUAL, 0}, |
| 245 | {".LE.", BINOP_LEQ, PREC_ORDER, 0}, |
| 246 | {".GE.", BINOP_GEQ, PREC_ORDER, 0}, |
| 247 | {".GT.", BINOP_GTR, PREC_ORDER, 0}, |
| 248 | {".LT.", BINOP_LESS, PREC_ORDER, 0}, |
| 249 | {"**", UNOP_IND, PREC_PREFIX, 0}, |
| 250 | {"@", BINOP_REPEAT, PREC_REPEAT, 0}, |
| 251 | {NULL, 0, 0, 0} |
| 252 | }; |
| 253 | \f |
| 254 | enum f_primitive_types { |
| 255 | f_primitive_type_character, |
| 256 | f_primitive_type_logical, |
| 257 | f_primitive_type_logical_s1, |
| 258 | f_primitive_type_logical_s2, |
| 259 | f_primitive_type_integer, |
| 260 | f_primitive_type_integer_s2, |
| 261 | f_primitive_type_real, |
| 262 | f_primitive_type_real_s8, |
| 263 | f_primitive_type_real_s16, |
| 264 | f_primitive_type_complex_s8, |
| 265 | f_primitive_type_complex_s16, |
| 266 | f_primitive_type_void, |
| 267 | nr_f_primitive_types |
| 268 | }; |
| 269 | |
| 270 | static void |
| 271 | f_language_arch_info (struct gdbarch *gdbarch, |
| 272 | struct language_arch_info *lai) |
| 273 | { |
| 274 | const struct builtin_f_type *builtin = builtin_f_type (gdbarch); |
| 275 | |
| 276 | lai->string_char_type = builtin->builtin_character; |
| 277 | lai->primitive_type_vector |
| 278 | = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_f_primitive_types + 1, |
| 279 | struct type *); |
| 280 | |
| 281 | lai->primitive_type_vector [f_primitive_type_character] |
| 282 | = builtin->builtin_character; |
| 283 | lai->primitive_type_vector [f_primitive_type_logical] |
| 284 | = builtin->builtin_logical; |
| 285 | lai->primitive_type_vector [f_primitive_type_logical_s1] |
| 286 | = builtin->builtin_logical_s1; |
| 287 | lai->primitive_type_vector [f_primitive_type_logical_s2] |
| 288 | = builtin->builtin_logical_s2; |
| 289 | lai->primitive_type_vector [f_primitive_type_real] |
| 290 | = builtin->builtin_real; |
| 291 | lai->primitive_type_vector [f_primitive_type_real_s8] |
| 292 | = builtin->builtin_real_s8; |
| 293 | lai->primitive_type_vector [f_primitive_type_real_s16] |
| 294 | = builtin->builtin_real_s16; |
| 295 | lai->primitive_type_vector [f_primitive_type_complex_s8] |
| 296 | = builtin->builtin_complex_s8; |
| 297 | lai->primitive_type_vector [f_primitive_type_complex_s16] |
| 298 | = builtin->builtin_complex_s16; |
| 299 | lai->primitive_type_vector [f_primitive_type_void] |
| 300 | = builtin->builtin_void; |
| 301 | } |
| 302 | |
| 303 | /* This is declared in c-lang.h but it is silly to import that file for what |
| 304 | is already just a hack. */ |
| 305 | extern int c_value_print (struct value *, struct ui_file *, int, |
| 306 | enum val_prettyprint); |
| 307 | |
| 308 | const struct language_defn f_language_defn = |
| 309 | { |
| 310 | "fortran", |
| 311 | language_fortran, |
| 312 | range_check_on, |
| 313 | type_check_on, |
| 314 | case_sensitive_off, |
| 315 | array_column_major, |
| 316 | &exp_descriptor_standard, |
| 317 | f_parse, /* parser */ |
| 318 | f_error, /* parser error function */ |
| 319 | null_post_parser, |
| 320 | f_printchar, /* Print character constant */ |
| 321 | f_printstr, /* function to print string constant */ |
| 322 | f_emit_char, /* Function to print a single character */ |
| 323 | f_print_type, /* Print a type using appropriate syntax */ |
| 324 | f_val_print, /* Print a value using appropriate syntax */ |
| 325 | c_value_print, /* FIXME */ |
| 326 | NULL, /* Language specific skip_trampoline */ |
| 327 | value_of_this, /* value_of_this */ |
| 328 | basic_lookup_symbol_nonlocal, /* lookup_symbol_nonlocal */ |
| 329 | basic_lookup_transparent_type,/* lookup_transparent_type */ |
| 330 | NULL, /* Language specific symbol demangler */ |
| 331 | NULL, /* Language specific class_name_from_physname */ |
| 332 | f_op_print_tab, /* expression operators for printing */ |
| 333 | 0, /* arrays are first-class (not c-style) */ |
| 334 | 1, /* String lower bound */ |
| 335 | default_word_break_characters, |
| 336 | f_language_arch_info, |
| 337 | default_print_array_index, |
| 338 | default_pass_by_reference, |
| 339 | LANG_MAGIC |
| 340 | }; |
| 341 | |
| 342 | static void * |
| 343 | build_fortran_types (struct gdbarch *gdbarch) |
| 344 | { |
| 345 | struct builtin_f_type *builtin_f_type |
| 346 | = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct builtin_f_type); |
| 347 | |
| 348 | builtin_f_type->builtin_void = |
| 349 | init_type (TYPE_CODE_VOID, 1, |
| 350 | 0, |
| 351 | "VOID", (struct objfile *) NULL); |
| 352 | |
| 353 | builtin_f_type->builtin_character = |
| 354 | init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 355 | 0, |
| 356 | "character", (struct objfile *) NULL); |
| 357 | |
| 358 | builtin_f_type->builtin_logical_s1 = |
| 359 | init_type (TYPE_CODE_BOOL, TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 360 | TYPE_FLAG_UNSIGNED, |
| 361 | "logical*1", (struct objfile *) NULL); |
| 362 | |
| 363 | builtin_f_type->builtin_integer_s2 = |
| 364 | init_type (TYPE_CODE_INT, |
| 365 | gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT, |
| 366 | 0, "integer*2", (struct objfile *) NULL); |
| 367 | |
| 368 | builtin_f_type->builtin_logical_s2 = |
| 369 | init_type (TYPE_CODE_BOOL, |
| 370 | gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT, |
| 371 | TYPE_FLAG_UNSIGNED, "logical*2", (struct objfile *) NULL); |
| 372 | |
| 373 | builtin_f_type->builtin_integer = |
| 374 | init_type (TYPE_CODE_INT, |
| 375 | gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT, |
| 376 | 0, "integer", (struct objfile *) NULL); |
| 377 | |
| 378 | builtin_f_type->builtin_logical = |
| 379 | init_type (TYPE_CODE_BOOL, |
| 380 | gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT, |
| 381 | TYPE_FLAG_UNSIGNED, "logical*4", (struct objfile *) NULL); |
| 382 | |
| 383 | builtin_f_type->builtin_real = |
| 384 | init_type (TYPE_CODE_FLT, |
| 385 | gdbarch_float_bit (gdbarch) / TARGET_CHAR_BIT, |
| 386 | 0, |
| 387 | "real", (struct objfile *) NULL); |
| 388 | |
| 389 | builtin_f_type->builtin_real_s8 = |
| 390 | init_type (TYPE_CODE_FLT, |
| 391 | gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT, |
| 392 | 0, |
| 393 | "real*8", (struct objfile *) NULL); |
| 394 | |
| 395 | builtin_f_type->builtin_real_s16 = |
| 396 | init_type (TYPE_CODE_FLT, |
| 397 | gdbarch_long_double_bit (gdbarch) / TARGET_CHAR_BIT, |
| 398 | 0, |
| 399 | "real*16", (struct objfile *) NULL); |
| 400 | |
| 401 | builtin_f_type->builtin_complex_s8 = |
| 402 | init_type (TYPE_CODE_COMPLEX, |
| 403 | 2 * gdbarch_float_bit (gdbarch) / TARGET_CHAR_BIT, |
| 404 | 0, |
| 405 | "complex*8", (struct objfile *) NULL); |
| 406 | TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s8) |
| 407 | = builtin_f_type->builtin_real; |
| 408 | |
| 409 | builtin_f_type->builtin_complex_s16 = |
| 410 | init_type (TYPE_CODE_COMPLEX, |
| 411 | 2 * gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT, |
| 412 | 0, |
| 413 | "complex*16", (struct objfile *) NULL); |
| 414 | TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s16) |
| 415 | = builtin_f_type->builtin_real_s8; |
| 416 | |
| 417 | /* We have a new size == 4 double floats for the |
| 418 | complex*32 data type */ |
| 419 | |
| 420 | builtin_f_type->builtin_complex_s32 = |
| 421 | init_type (TYPE_CODE_COMPLEX, |
| 422 | 2 * gdbarch_long_double_bit (gdbarch) / TARGET_CHAR_BIT, |
| 423 | 0, |
| 424 | "complex*32", (struct objfile *) NULL); |
| 425 | TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s32) |
| 426 | = builtin_f_type->builtin_real_s16; |
| 427 | |
| 428 | return builtin_f_type; |
| 429 | } |
| 430 | |
| 431 | static struct gdbarch_data *f_type_data; |
| 432 | |
| 433 | const struct builtin_f_type * |
| 434 | builtin_f_type (struct gdbarch *gdbarch) |
| 435 | { |
| 436 | return gdbarch_data (gdbarch, f_type_data); |
| 437 | } |
| 438 | |
| 439 | void |
| 440 | _initialize_f_language (void) |
| 441 | { |
| 442 | f_type_data = gdbarch_data_register_post_init (build_fortran_types); |
| 443 | |
| 444 | add_language (&f_language_defn); |
| 445 | } |
| 446 | |
| 447 | #if 0 |
| 448 | static SAVED_BF_PTR |
| 449 | allocate_saved_bf_node (void) |
| 450 | { |
| 451 | SAVED_BF_PTR new; |
| 452 | |
| 453 | new = (SAVED_BF_PTR) xmalloc (sizeof (SAVED_BF)); |
| 454 | return (new); |
| 455 | } |
| 456 | |
| 457 | static SAVED_FUNCTION * |
| 458 | allocate_saved_function_node (void) |
| 459 | { |
| 460 | SAVED_FUNCTION *new; |
| 461 | |
| 462 | new = (SAVED_FUNCTION *) xmalloc (sizeof (SAVED_FUNCTION)); |
| 463 | return (new); |
| 464 | } |
| 465 | |
| 466 | static SAVED_F77_COMMON_PTR |
| 467 | allocate_saved_f77_common_node (void) |
| 468 | { |
| 469 | SAVED_F77_COMMON_PTR new; |
| 470 | |
| 471 | new = (SAVED_F77_COMMON_PTR) xmalloc (sizeof (SAVED_F77_COMMON)); |
| 472 | return (new); |
| 473 | } |
| 474 | |
| 475 | static COMMON_ENTRY_PTR |
| 476 | allocate_common_entry_node (void) |
| 477 | { |
| 478 | COMMON_ENTRY_PTR new; |
| 479 | |
| 480 | new = (COMMON_ENTRY_PTR) xmalloc (sizeof (COMMON_ENTRY)); |
| 481 | return (new); |
| 482 | } |
| 483 | #endif |
| 484 | |
| 485 | SAVED_F77_COMMON_PTR head_common_list = NULL; /* Ptr to 1st saved COMMON */ |
| 486 | SAVED_F77_COMMON_PTR tail_common_list = NULL; /* Ptr to last saved COMMON */ |
| 487 | SAVED_F77_COMMON_PTR current_common = NULL; /* Ptr to current COMMON */ |
| 488 | |
| 489 | #if 0 |
| 490 | static SAVED_BF_PTR saved_bf_list = NULL; /* Ptr to (.bf,function) |
| 491 | list */ |
| 492 | static SAVED_BF_PTR saved_bf_list_end = NULL; /* Ptr to above list's end */ |
| 493 | static SAVED_BF_PTR current_head_bf_list = NULL; /* Current head of above list |
| 494 | */ |
| 495 | |
| 496 | static SAVED_BF_PTR tmp_bf_ptr; /* Generic temporary for use |
| 497 | in macros */ |
| 498 | |
| 499 | /* The following function simply enters a given common block onto |
| 500 | the global common block chain */ |
| 501 | |
| 502 | static void |
| 503 | add_common_block (char *name, CORE_ADDR offset, int secnum, char *func_stab) |
| 504 | { |
| 505 | SAVED_F77_COMMON_PTR tmp; |
| 506 | char *c, *local_copy_func_stab; |
| 507 | |
| 508 | /* If the COMMON block we are trying to add has a blank |
| 509 | name (i.e. "#BLNK_COM") then we set it to __BLANK |
| 510 | because the darn "#" character makes GDB's input |
| 511 | parser have fits. */ |
| 512 | |
| 513 | |
| 514 | if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0 |
| 515 | || strcmp (name, BLANK_COMMON_NAME_MF77) == 0) |
| 516 | { |
| 517 | |
| 518 | xfree (name); |
| 519 | name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1); |
| 520 | strcpy (name, BLANK_COMMON_NAME_LOCAL); |
| 521 | } |
| 522 | |
| 523 | tmp = allocate_saved_f77_common_node (); |
| 524 | |
| 525 | local_copy_func_stab = xmalloc (strlen (func_stab) + 1); |
| 526 | strcpy (local_copy_func_stab, func_stab); |
| 527 | |
| 528 | tmp->name = xmalloc (strlen (name) + 1); |
| 529 | |
| 530 | /* local_copy_func_stab is a stabstring, let us first extract the |
| 531 | function name from the stab by NULLing out the ':' character. */ |
| 532 | |
| 533 | |
| 534 | c = NULL; |
| 535 | c = strchr (local_copy_func_stab, ':'); |
| 536 | |
| 537 | if (c) |
| 538 | *c = '\0'; |
| 539 | else |
| 540 | error (_("Malformed function STAB found in add_common_block()")); |
| 541 | |
| 542 | |
| 543 | tmp->owning_function = xmalloc (strlen (local_copy_func_stab) + 1); |
| 544 | |
| 545 | strcpy (tmp->owning_function, local_copy_func_stab); |
| 546 | |
| 547 | strcpy (tmp->name, name); |
| 548 | tmp->offset = offset; |
| 549 | tmp->next = NULL; |
| 550 | tmp->entries = NULL; |
| 551 | tmp->secnum = secnum; |
| 552 | |
| 553 | current_common = tmp; |
| 554 | |
| 555 | if (head_common_list == NULL) |
| 556 | { |
| 557 | head_common_list = tail_common_list = tmp; |
| 558 | } |
| 559 | else |
| 560 | { |
| 561 | tail_common_list->next = tmp; |
| 562 | tail_common_list = tmp; |
| 563 | } |
| 564 | } |
| 565 | #endif |
| 566 | |
| 567 | /* The following function simply enters a given common entry onto |
| 568 | the "current_common" block that has been saved away. */ |
| 569 | |
| 570 | #if 0 |
| 571 | static void |
| 572 | add_common_entry (struct symbol *entry_sym_ptr) |
| 573 | { |
| 574 | COMMON_ENTRY_PTR tmp; |
| 575 | |
| 576 | |
| 577 | |
| 578 | /* The order of this list is important, since |
| 579 | we expect the entries to appear in decl. |
| 580 | order when we later issue "info common" calls */ |
| 581 | |
| 582 | tmp = allocate_common_entry_node (); |
| 583 | |
| 584 | tmp->next = NULL; |
| 585 | tmp->symbol = entry_sym_ptr; |
| 586 | |
| 587 | if (current_common == NULL) |
| 588 | error (_("Attempt to add COMMON entry with no block open!")); |
| 589 | else |
| 590 | { |
| 591 | if (current_common->entries == NULL) |
| 592 | { |
| 593 | current_common->entries = tmp; |
| 594 | current_common->end_of_entries = tmp; |
| 595 | } |
| 596 | else |
| 597 | { |
| 598 | current_common->end_of_entries->next = tmp; |
| 599 | current_common->end_of_entries = tmp; |
| 600 | } |
| 601 | } |
| 602 | } |
| 603 | #endif |
| 604 | |
| 605 | /* This routine finds the first encountred COMMON block named "name" */ |
| 606 | |
| 607 | #if 0 |
| 608 | static SAVED_F77_COMMON_PTR |
| 609 | find_first_common_named (char *name) |
| 610 | { |
| 611 | |
| 612 | SAVED_F77_COMMON_PTR tmp; |
| 613 | |
| 614 | tmp = head_common_list; |
| 615 | |
| 616 | while (tmp != NULL) |
| 617 | { |
| 618 | if (strcmp (tmp->name, name) == 0) |
| 619 | return (tmp); |
| 620 | else |
| 621 | tmp = tmp->next; |
| 622 | } |
| 623 | return (NULL); |
| 624 | } |
| 625 | #endif |
| 626 | |
| 627 | /* This routine finds the first encountred COMMON block named "name" |
| 628 | that belongs to function funcname */ |
| 629 | |
| 630 | SAVED_F77_COMMON_PTR |
| 631 | find_common_for_function (char *name, char *funcname) |
| 632 | { |
| 633 | |
| 634 | SAVED_F77_COMMON_PTR tmp; |
| 635 | |
| 636 | tmp = head_common_list; |
| 637 | |
| 638 | while (tmp != NULL) |
| 639 | { |
| 640 | if (strcmp (tmp->name, name) == 0 |
| 641 | && strcmp (tmp->owning_function, funcname) == 0) |
| 642 | return (tmp); |
| 643 | else |
| 644 | tmp = tmp->next; |
| 645 | } |
| 646 | return (NULL); |
| 647 | } |
| 648 | |
| 649 | |
| 650 | #if 0 |
| 651 | |
| 652 | /* The following function is called to patch up the offsets |
| 653 | for the statics contained in the COMMON block named |
| 654 | "name." */ |
| 655 | |
| 656 | static void |
| 657 | patch_common_entries (SAVED_F77_COMMON_PTR blk, CORE_ADDR offset, int secnum) |
| 658 | { |
| 659 | COMMON_ENTRY_PTR entry; |
| 660 | |
| 661 | blk->offset = offset; /* Keep this around for future use. */ |
| 662 | |
| 663 | entry = blk->entries; |
| 664 | |
| 665 | while (entry != NULL) |
| 666 | { |
| 667 | SYMBOL_VALUE (entry->symbol) += offset; |
| 668 | SYMBOL_SECTION (entry->symbol) = secnum; |
| 669 | |
| 670 | entry = entry->next; |
| 671 | } |
| 672 | blk->secnum = secnum; |
| 673 | } |
| 674 | |
| 675 | /* Patch all commons named "name" that need patching.Since COMMON |
| 676 | blocks occur with relative infrequency, we simply do a linear scan on |
| 677 | the name. Eventually, the best way to do this will be a |
| 678 | hashed-lookup. Secnum is the section number for the .bss section |
| 679 | (which is where common data lives). */ |
| 680 | |
| 681 | static void |
| 682 | patch_all_commons_by_name (char *name, CORE_ADDR offset, int secnum) |
| 683 | { |
| 684 | |
| 685 | SAVED_F77_COMMON_PTR tmp; |
| 686 | |
| 687 | /* For blank common blocks, change the canonical reprsentation |
| 688 | of a blank name */ |
| 689 | |
| 690 | if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0 |
| 691 | || strcmp (name, BLANK_COMMON_NAME_MF77) == 0) |
| 692 | { |
| 693 | xfree (name); |
| 694 | name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1); |
| 695 | strcpy (name, BLANK_COMMON_NAME_LOCAL); |
| 696 | } |
| 697 | |
| 698 | tmp = head_common_list; |
| 699 | |
| 700 | while (tmp != NULL) |
| 701 | { |
| 702 | if (COMMON_NEEDS_PATCHING (tmp)) |
| 703 | if (strcmp (tmp->name, name) == 0) |
| 704 | patch_common_entries (tmp, offset, secnum); |
| 705 | |
| 706 | tmp = tmp->next; |
| 707 | } |
| 708 | } |
| 709 | #endif |
| 710 | |
| 711 | /* This macro adds the symbol-number for the start of the function |
| 712 | (the symbol number of the .bf) referenced by symnum_fcn to a |
| 713 | list. This list, in reality should be a FIFO queue but since |
| 714 | #line pragmas sometimes cause line ranges to get messed up |
| 715 | we simply create a linear list. This list can then be searched |
| 716 | first by a queueing algorithm and upon failure fall back to |
| 717 | a linear scan. */ |
| 718 | |
| 719 | #if 0 |
| 720 | #define ADD_BF_SYMNUM(bf_sym,fcn_sym) \ |
| 721 | \ |
| 722 | if (saved_bf_list == NULL) \ |
| 723 | { \ |
| 724 | tmp_bf_ptr = allocate_saved_bf_node(); \ |
| 725 | \ |
| 726 | tmp_bf_ptr->symnum_bf = (bf_sym); \ |
| 727 | tmp_bf_ptr->symnum_fcn = (fcn_sym); \ |
| 728 | tmp_bf_ptr->next = NULL; \ |
| 729 | \ |
| 730 | current_head_bf_list = saved_bf_list = tmp_bf_ptr; \ |
| 731 | saved_bf_list_end = tmp_bf_ptr; \ |
| 732 | } \ |
| 733 | else \ |
| 734 | { \ |
| 735 | tmp_bf_ptr = allocate_saved_bf_node(); \ |
| 736 | \ |
| 737 | tmp_bf_ptr->symnum_bf = (bf_sym); \ |
| 738 | tmp_bf_ptr->symnum_fcn = (fcn_sym); \ |
| 739 | tmp_bf_ptr->next = NULL; \ |
| 740 | \ |
| 741 | saved_bf_list_end->next = tmp_bf_ptr; \ |
| 742 | saved_bf_list_end = tmp_bf_ptr; \ |
| 743 | } |
| 744 | #endif |
| 745 | |
| 746 | /* This function frees the entire (.bf,function) list */ |
| 747 | |
| 748 | #if 0 |
| 749 | static void |
| 750 | clear_bf_list (void) |
| 751 | { |
| 752 | |
| 753 | SAVED_BF_PTR tmp = saved_bf_list; |
| 754 | SAVED_BF_PTR next = NULL; |
| 755 | |
| 756 | while (tmp != NULL) |
| 757 | { |
| 758 | next = tmp->next; |
| 759 | xfree (tmp); |
| 760 | tmp = next; |
| 761 | } |
| 762 | saved_bf_list = NULL; |
| 763 | } |
| 764 | #endif |
| 765 | |
| 766 | int global_remote_debug; |
| 767 | |
| 768 | #if 0 |
| 769 | |
| 770 | static long |
| 771 | get_bf_for_fcn (long the_function) |
| 772 | { |
| 773 | SAVED_BF_PTR tmp; |
| 774 | int nprobes = 0; |
| 775 | |
| 776 | /* First use a simple queuing algorithm (i.e. look and see if the |
| 777 | item at the head of the queue is the one you want) */ |
| 778 | |
| 779 | if (saved_bf_list == NULL) |
| 780 | internal_error (__FILE__, __LINE__, |
| 781 | _("cannot get .bf node off empty list")); |
| 782 | |
| 783 | if (current_head_bf_list != NULL) |
| 784 | if (current_head_bf_list->symnum_fcn == the_function) |
| 785 | { |
| 786 | if (global_remote_debug) |
| 787 | fprintf_unfiltered (gdb_stderr, "*"); |
| 788 | |
| 789 | tmp = current_head_bf_list; |
| 790 | current_head_bf_list = current_head_bf_list->next; |
| 791 | return (tmp->symnum_bf); |
| 792 | } |
| 793 | |
| 794 | /* If the above did not work (probably because #line directives were |
| 795 | used in the sourcefile and they messed up our internal tables) we now do |
| 796 | the ugly linear scan */ |
| 797 | |
| 798 | if (global_remote_debug) |
| 799 | fprintf_unfiltered (gdb_stderr, "\ndefaulting to linear scan\n"); |
| 800 | |
| 801 | nprobes = 0; |
| 802 | tmp = saved_bf_list; |
| 803 | while (tmp != NULL) |
| 804 | { |
| 805 | nprobes++; |
| 806 | if (tmp->symnum_fcn == the_function) |
| 807 | { |
| 808 | if (global_remote_debug) |
| 809 | fprintf_unfiltered (gdb_stderr, "Found in %d probes\n", nprobes); |
| 810 | current_head_bf_list = tmp->next; |
| 811 | return (tmp->symnum_bf); |
| 812 | } |
| 813 | tmp = tmp->next; |
| 814 | } |
| 815 | |
| 816 | return (-1); |
| 817 | } |
| 818 | |
| 819 | static SAVED_FUNCTION_PTR saved_function_list = NULL; |
| 820 | static SAVED_FUNCTION_PTR saved_function_list_end = NULL; |
| 821 | |
| 822 | static void |
| 823 | clear_function_list (void) |
| 824 | { |
| 825 | SAVED_FUNCTION_PTR tmp = saved_function_list; |
| 826 | SAVED_FUNCTION_PTR next = NULL; |
| 827 | |
| 828 | while (tmp != NULL) |
| 829 | { |
| 830 | next = tmp->next; |
| 831 | xfree (tmp); |
| 832 | tmp = next; |
| 833 | } |
| 834 | |
| 835 | saved_function_list = NULL; |
| 836 | } |
| 837 | #endif |