| 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 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 2 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, write to the Free Software |
| 23 | Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 24 | Boston, MA 02110-1301, USA. */ |
| 25 | |
| 26 | #include "defs.h" |
| 27 | #include "gdb_string.h" |
| 28 | #include "symtab.h" |
| 29 | #include "gdbtypes.h" |
| 30 | #include "expression.h" |
| 31 | #include "parser-defs.h" |
| 32 | #include "language.h" |
| 33 | #include "f-lang.h" |
| 34 | #include "valprint.h" |
| 35 | #include "value.h" |
| 36 | |
| 37 | /* The built-in types of F77. FIXME: integer*4 is missing, plain |
| 38 | logical is missing (builtin_type_logical is logical*4). */ |
| 39 | |
| 40 | struct type *builtin_type_f_character; |
| 41 | struct type *builtin_type_f_logical; |
| 42 | struct type *builtin_type_f_logical_s1; |
| 43 | struct type *builtin_type_f_logical_s2; |
| 44 | struct type *builtin_type_f_integer; |
| 45 | struct type *builtin_type_f_integer_s2; |
| 46 | struct type *builtin_type_f_real; |
| 47 | struct type *builtin_type_f_real_s8; |
| 48 | struct type *builtin_type_f_real_s16; |
| 49 | struct type *builtin_type_f_complex_s8; |
| 50 | struct type *builtin_type_f_complex_s16; |
| 51 | struct type *builtin_type_f_complex_s32; |
| 52 | struct type *builtin_type_f_void; |
| 53 | |
| 54 | /* Following is dubious stuff that had been in the xcoff reader. */ |
| 55 | |
| 56 | struct saved_fcn |
| 57 | { |
| 58 | long line_offset; /* Line offset for function */ |
| 59 | struct saved_fcn *next; |
| 60 | }; |
| 61 | |
| 62 | |
| 63 | struct saved_bf_symnum |
| 64 | { |
| 65 | long symnum_fcn; /* Symnum of function (i.e. .function directive) */ |
| 66 | long symnum_bf; /* Symnum of .bf for this function */ |
| 67 | struct saved_bf_symnum *next; |
| 68 | }; |
| 69 | |
| 70 | typedef struct saved_fcn SAVED_FUNCTION, *SAVED_FUNCTION_PTR; |
| 71 | typedef struct saved_bf_symnum SAVED_BF, *SAVED_BF_PTR; |
| 72 | |
| 73 | /* Local functions */ |
| 74 | |
| 75 | extern void _initialize_f_language (void); |
| 76 | #if 0 |
| 77 | static void clear_function_list (void); |
| 78 | static long get_bf_for_fcn (long); |
| 79 | static void clear_bf_list (void); |
| 80 | static void patch_all_commons_by_name (char *, CORE_ADDR, int); |
| 81 | static SAVED_F77_COMMON_PTR find_first_common_named (char *); |
| 82 | static void add_common_entry (struct symbol *); |
| 83 | static void add_common_block (char *, CORE_ADDR, int, char *); |
| 84 | static SAVED_FUNCTION *allocate_saved_function_node (void); |
| 85 | static SAVED_BF_PTR allocate_saved_bf_node (void); |
| 86 | static COMMON_ENTRY_PTR allocate_common_entry_node (void); |
| 87 | static SAVED_F77_COMMON_PTR allocate_saved_f77_common_node (void); |
| 88 | static void patch_common_entries (SAVED_F77_COMMON_PTR, CORE_ADDR, int); |
| 89 | #endif |
| 90 | |
| 91 | static struct type *f_create_fundamental_type (struct objfile *, int); |
| 92 | static void f_printchar (int c, struct ui_file * stream); |
| 93 | static void f_emit_char (int c, struct ui_file * stream, int quoter); |
| 94 | |
| 95 | /* Print the character C on STREAM as part of the contents of a literal |
| 96 | string whose delimiter is QUOTER. Note that that format for printing |
| 97 | characters and strings is language specific. |
| 98 | FIXME: This is a copy of the same function from c-exp.y. It should |
| 99 | be replaced with a true F77 version. */ |
| 100 | |
| 101 | static void |
| 102 | f_emit_char (int c, struct ui_file *stream, int quoter) |
| 103 | { |
| 104 | c &= 0xFF; /* Avoid sign bit follies */ |
| 105 | |
| 106 | if (PRINT_LITERAL_FORM (c)) |
| 107 | { |
| 108 | if (c == '\\' || c == quoter) |
| 109 | fputs_filtered ("\\", stream); |
| 110 | fprintf_filtered (stream, "%c", c); |
| 111 | } |
| 112 | else |
| 113 | { |
| 114 | switch (c) |
| 115 | { |
| 116 | case '\n': |
| 117 | fputs_filtered ("\\n", stream); |
| 118 | break; |
| 119 | case '\b': |
| 120 | fputs_filtered ("\\b", stream); |
| 121 | break; |
| 122 | case '\t': |
| 123 | fputs_filtered ("\\t", stream); |
| 124 | break; |
| 125 | case '\f': |
| 126 | fputs_filtered ("\\f", stream); |
| 127 | break; |
| 128 | case '\r': |
| 129 | fputs_filtered ("\\r", stream); |
| 130 | break; |
| 131 | case '\033': |
| 132 | fputs_filtered ("\\e", stream); |
| 133 | break; |
| 134 | case '\007': |
| 135 | fputs_filtered ("\\a", stream); |
| 136 | break; |
| 137 | default: |
| 138 | fprintf_filtered (stream, "\\%.3o", (unsigned int) c); |
| 139 | break; |
| 140 | } |
| 141 | } |
| 142 | } |
| 143 | |
| 144 | /* FIXME: This is a copy of the same function from c-exp.y. It should |
| 145 | be replaced with a true F77version. */ |
| 146 | |
| 147 | static void |
| 148 | f_printchar (int c, struct ui_file *stream) |
| 149 | { |
| 150 | fputs_filtered ("'", stream); |
| 151 | LA_EMIT_CHAR (c, stream, '\''); |
| 152 | fputs_filtered ("'", stream); |
| 153 | } |
| 154 | |
| 155 | /* Print the character string STRING, printing at most LENGTH characters. |
| 156 | Printing stops early if the number hits print_max; repeat counts |
| 157 | are printed as appropriate. Print ellipses at the end if we |
| 158 | had to stop before printing LENGTH characters, or if FORCE_ELLIPSES. |
| 159 | FIXME: This is a copy of the same function from c-exp.y. It should |
| 160 | be replaced with a true F77 version. */ |
| 161 | |
| 162 | static void |
| 163 | f_printstr (struct ui_file *stream, const gdb_byte *string, |
| 164 | unsigned int length, int width, int force_ellipses) |
| 165 | { |
| 166 | unsigned int i; |
| 167 | unsigned int things_printed = 0; |
| 168 | int in_quotes = 0; |
| 169 | int need_comma = 0; |
| 170 | |
| 171 | if (length == 0) |
| 172 | { |
| 173 | fputs_filtered ("''", gdb_stdout); |
| 174 | return; |
| 175 | } |
| 176 | |
| 177 | for (i = 0; i < length && things_printed < print_max; ++i) |
| 178 | { |
| 179 | /* Position of the character we are examining |
| 180 | to see whether it is repeated. */ |
| 181 | unsigned int rep1; |
| 182 | /* Number of repetitions we have detected so far. */ |
| 183 | unsigned int reps; |
| 184 | |
| 185 | QUIT; |
| 186 | |
| 187 | if (need_comma) |
| 188 | { |
| 189 | fputs_filtered (", ", stream); |
| 190 | need_comma = 0; |
| 191 | } |
| 192 | |
| 193 | rep1 = i + 1; |
| 194 | reps = 1; |
| 195 | while (rep1 < length && string[rep1] == string[i]) |
| 196 | { |
| 197 | ++rep1; |
| 198 | ++reps; |
| 199 | } |
| 200 | |
| 201 | if (reps > repeat_count_threshold) |
| 202 | { |
| 203 | if (in_quotes) |
| 204 | { |
| 205 | if (inspect_it) |
| 206 | fputs_filtered ("\\', ", stream); |
| 207 | else |
| 208 | fputs_filtered ("', ", stream); |
| 209 | in_quotes = 0; |
| 210 | } |
| 211 | f_printchar (string[i], stream); |
| 212 | fprintf_filtered (stream, " <repeats %u times>", reps); |
| 213 | i = rep1 - 1; |
| 214 | things_printed += repeat_count_threshold; |
| 215 | need_comma = 1; |
| 216 | } |
| 217 | else |
| 218 | { |
| 219 | if (!in_quotes) |
| 220 | { |
| 221 | if (inspect_it) |
| 222 | fputs_filtered ("\\'", stream); |
| 223 | else |
| 224 | fputs_filtered ("'", stream); |
| 225 | in_quotes = 1; |
| 226 | } |
| 227 | LA_EMIT_CHAR (string[i], stream, '"'); |
| 228 | ++things_printed; |
| 229 | } |
| 230 | } |
| 231 | |
| 232 | /* Terminate the quotes if necessary. */ |
| 233 | if (in_quotes) |
| 234 | { |
| 235 | if (inspect_it) |
| 236 | fputs_filtered ("\\'", stream); |
| 237 | else |
| 238 | fputs_filtered ("'", stream); |
| 239 | } |
| 240 | |
| 241 | if (force_ellipses || i < length) |
| 242 | fputs_filtered ("...", stream); |
| 243 | } |
| 244 | |
| 245 | /* FIXME: This is a copy of c_create_fundamental_type(), before |
| 246 | all the non-C types were stripped from it. Needs to be fixed |
| 247 | by an experienced F77 programmer. */ |
| 248 | |
| 249 | static struct type * |
| 250 | f_create_fundamental_type (struct objfile *objfile, int typeid) |
| 251 | { |
| 252 | struct type *type = NULL; |
| 253 | |
| 254 | switch (typeid) |
| 255 | { |
| 256 | case FT_VOID: |
| 257 | type = init_type (TYPE_CODE_VOID, |
| 258 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 259 | 0, "VOID", objfile); |
| 260 | break; |
| 261 | case FT_BOOLEAN: |
| 262 | type = init_type (TYPE_CODE_BOOL, |
| 263 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 264 | TYPE_FLAG_UNSIGNED, "boolean", objfile); |
| 265 | break; |
| 266 | case FT_STRING: |
| 267 | type = init_type (TYPE_CODE_STRING, |
| 268 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 269 | 0, "string", objfile); |
| 270 | break; |
| 271 | case FT_CHAR: |
| 272 | type = init_type (TYPE_CODE_INT, |
| 273 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 274 | 0, "character", objfile); |
| 275 | break; |
| 276 | case FT_SIGNED_CHAR: |
| 277 | type = init_type (TYPE_CODE_INT, |
| 278 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 279 | 0, "integer*1", objfile); |
| 280 | break; |
| 281 | case FT_UNSIGNED_CHAR: |
| 282 | type = init_type (TYPE_CODE_BOOL, |
| 283 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 284 | TYPE_FLAG_UNSIGNED, "logical*1", objfile); |
| 285 | break; |
| 286 | case FT_SHORT: |
| 287 | type = init_type (TYPE_CODE_INT, |
| 288 | TARGET_SHORT_BIT / TARGET_CHAR_BIT, |
| 289 | 0, "integer*2", objfile); |
| 290 | break; |
| 291 | case FT_SIGNED_SHORT: |
| 292 | type = init_type (TYPE_CODE_INT, |
| 293 | TARGET_SHORT_BIT / TARGET_CHAR_BIT, |
| 294 | 0, "short", objfile); /* FIXME-fnf */ |
| 295 | break; |
| 296 | case FT_UNSIGNED_SHORT: |
| 297 | type = init_type (TYPE_CODE_BOOL, |
| 298 | TARGET_SHORT_BIT / TARGET_CHAR_BIT, |
| 299 | TYPE_FLAG_UNSIGNED, "logical*2", objfile); |
| 300 | break; |
| 301 | case FT_INTEGER: |
| 302 | type = init_type (TYPE_CODE_INT, |
| 303 | TARGET_INT_BIT / TARGET_CHAR_BIT, |
| 304 | 0, "integer*4", objfile); |
| 305 | break; |
| 306 | case FT_SIGNED_INTEGER: |
| 307 | type = init_type (TYPE_CODE_INT, |
| 308 | TARGET_INT_BIT / TARGET_CHAR_BIT, |
| 309 | 0, "integer", objfile); /* FIXME -fnf */ |
| 310 | break; |
| 311 | case FT_UNSIGNED_INTEGER: |
| 312 | type = init_type (TYPE_CODE_BOOL, |
| 313 | TARGET_INT_BIT / TARGET_CHAR_BIT, |
| 314 | TYPE_FLAG_UNSIGNED, "logical*4", objfile); |
| 315 | break; |
| 316 | case FT_FIXED_DECIMAL: |
| 317 | type = init_type (TYPE_CODE_INT, |
| 318 | TARGET_INT_BIT / TARGET_CHAR_BIT, |
| 319 | 0, "fixed decimal", objfile); |
| 320 | break; |
| 321 | case FT_LONG: |
| 322 | type = init_type (TYPE_CODE_INT, |
| 323 | TARGET_LONG_BIT / TARGET_CHAR_BIT, |
| 324 | 0, "long", objfile); |
| 325 | break; |
| 326 | case FT_SIGNED_LONG: |
| 327 | type = init_type (TYPE_CODE_INT, |
| 328 | TARGET_LONG_BIT / TARGET_CHAR_BIT, |
| 329 | 0, "long", objfile); /* FIXME -fnf */ |
| 330 | break; |
| 331 | case FT_UNSIGNED_LONG: |
| 332 | type = init_type (TYPE_CODE_INT, |
| 333 | TARGET_LONG_BIT / TARGET_CHAR_BIT, |
| 334 | TYPE_FLAG_UNSIGNED, "unsigned long", objfile); |
| 335 | break; |
| 336 | case FT_LONG_LONG: |
| 337 | type = init_type (TYPE_CODE_INT, |
| 338 | TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT, |
| 339 | 0, "long long", objfile); |
| 340 | break; |
| 341 | case FT_SIGNED_LONG_LONG: |
| 342 | type = init_type (TYPE_CODE_INT, |
| 343 | TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT, |
| 344 | 0, "signed long long", objfile); |
| 345 | break; |
| 346 | case FT_UNSIGNED_LONG_LONG: |
| 347 | type = init_type (TYPE_CODE_INT, |
| 348 | TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT, |
| 349 | TYPE_FLAG_UNSIGNED, "unsigned long long", objfile); |
| 350 | break; |
| 351 | case FT_FLOAT: |
| 352 | type = init_type (TYPE_CODE_FLT, |
| 353 | TARGET_FLOAT_BIT / TARGET_CHAR_BIT, |
| 354 | 0, "real", objfile); |
| 355 | break; |
| 356 | case FT_DBL_PREC_FLOAT: |
| 357 | type = init_type (TYPE_CODE_FLT, |
| 358 | TARGET_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 359 | 0, "real*8", objfile); |
| 360 | break; |
| 361 | case FT_FLOAT_DECIMAL: |
| 362 | type = init_type (TYPE_CODE_FLT, |
| 363 | TARGET_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 364 | 0, "floating decimal", objfile); |
| 365 | break; |
| 366 | case FT_EXT_PREC_FLOAT: |
| 367 | type = init_type (TYPE_CODE_FLT, |
| 368 | TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 369 | 0, "real*16", objfile); |
| 370 | break; |
| 371 | case FT_COMPLEX: |
| 372 | type = init_type (TYPE_CODE_COMPLEX, |
| 373 | 2 * TARGET_FLOAT_BIT / TARGET_CHAR_BIT, |
| 374 | 0, "complex*8", objfile); |
| 375 | TYPE_TARGET_TYPE (type) = builtin_type_f_real; |
| 376 | break; |
| 377 | case FT_DBL_PREC_COMPLEX: |
| 378 | type = init_type (TYPE_CODE_COMPLEX, |
| 379 | 2 * TARGET_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 380 | 0, "complex*16", objfile); |
| 381 | TYPE_TARGET_TYPE (type) = builtin_type_f_real_s8; |
| 382 | break; |
| 383 | case FT_EXT_PREC_COMPLEX: |
| 384 | type = init_type (TYPE_CODE_COMPLEX, |
| 385 | 2 * TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 386 | 0, "complex*32", objfile); |
| 387 | TYPE_TARGET_TYPE (type) = builtin_type_f_real_s16; |
| 388 | break; |
| 389 | default: |
| 390 | /* FIXME: For now, if we are asked to produce a type not in this |
| 391 | language, create the equivalent of a C integer type with the |
| 392 | name "<?type?>". When all the dust settles from the type |
| 393 | reconstruction work, this should probably become an error. */ |
| 394 | type = init_type (TYPE_CODE_INT, |
| 395 | TARGET_INT_BIT / TARGET_CHAR_BIT, |
| 396 | 0, "<?type?>", objfile); |
| 397 | warning (_("internal error: no F77 fundamental type %d"), typeid); |
| 398 | break; |
| 399 | } |
| 400 | return (type); |
| 401 | } |
| 402 | \f |
| 403 | |
| 404 | /* Table of operators and their precedences for printing expressions. */ |
| 405 | |
| 406 | static const struct op_print f_op_print_tab[] = |
| 407 | { |
| 408 | {"+", BINOP_ADD, PREC_ADD, 0}, |
| 409 | {"+", UNOP_PLUS, PREC_PREFIX, 0}, |
| 410 | {"-", BINOP_SUB, PREC_ADD, 0}, |
| 411 | {"-", UNOP_NEG, PREC_PREFIX, 0}, |
| 412 | {"*", BINOP_MUL, PREC_MUL, 0}, |
| 413 | {"/", BINOP_DIV, PREC_MUL, 0}, |
| 414 | {"DIV", BINOP_INTDIV, PREC_MUL, 0}, |
| 415 | {"MOD", BINOP_REM, PREC_MUL, 0}, |
| 416 | {"=", BINOP_ASSIGN, PREC_ASSIGN, 1}, |
| 417 | {".OR.", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0}, |
| 418 | {".AND.", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0}, |
| 419 | {".NOT.", UNOP_LOGICAL_NOT, PREC_PREFIX, 0}, |
| 420 | {".EQ.", BINOP_EQUAL, PREC_EQUAL, 0}, |
| 421 | {".NE.", BINOP_NOTEQUAL, PREC_EQUAL, 0}, |
| 422 | {".LE.", BINOP_LEQ, PREC_ORDER, 0}, |
| 423 | {".GE.", BINOP_GEQ, PREC_ORDER, 0}, |
| 424 | {".GT.", BINOP_GTR, PREC_ORDER, 0}, |
| 425 | {".LT.", BINOP_LESS, PREC_ORDER, 0}, |
| 426 | {"**", UNOP_IND, PREC_PREFIX, 0}, |
| 427 | {"@", BINOP_REPEAT, PREC_REPEAT, 0}, |
| 428 | {NULL, 0, 0, 0} |
| 429 | }; |
| 430 | \f |
| 431 | struct type **const (f_builtin_types[]) = |
| 432 | { |
| 433 | &builtin_type_f_character, |
| 434 | &builtin_type_f_logical, |
| 435 | &builtin_type_f_logical_s1, |
| 436 | &builtin_type_f_logical_s2, |
| 437 | &builtin_type_f_integer, |
| 438 | &builtin_type_f_integer_s2, |
| 439 | &builtin_type_f_real, |
| 440 | &builtin_type_f_real_s8, |
| 441 | &builtin_type_f_real_s16, |
| 442 | &builtin_type_f_complex_s8, |
| 443 | &builtin_type_f_complex_s16, |
| 444 | #if 0 |
| 445 | &builtin_type_f_complex_s32, |
| 446 | #endif |
| 447 | &builtin_type_f_void, |
| 448 | 0 |
| 449 | }; |
| 450 | |
| 451 | /* This is declared in c-lang.h but it is silly to import that file for what |
| 452 | is already just a hack. */ |
| 453 | extern int c_value_print (struct value *, struct ui_file *, int, |
| 454 | enum val_prettyprint); |
| 455 | |
| 456 | const struct language_defn f_language_defn = |
| 457 | { |
| 458 | "fortran", |
| 459 | language_fortran, |
| 460 | f_builtin_types, |
| 461 | range_check_on, |
| 462 | type_check_on, |
| 463 | case_sensitive_off, |
| 464 | array_column_major, |
| 465 | &exp_descriptor_standard, |
| 466 | f_parse, /* parser */ |
| 467 | f_error, /* parser error function */ |
| 468 | null_post_parser, |
| 469 | f_printchar, /* Print character constant */ |
| 470 | f_printstr, /* function to print string constant */ |
| 471 | f_emit_char, /* Function to print a single character */ |
| 472 | f_create_fundamental_type, /* Create fundamental type in this language */ |
| 473 | f_print_type, /* Print a type using appropriate syntax */ |
| 474 | f_val_print, /* Print a value using appropriate syntax */ |
| 475 | c_value_print, /* FIXME */ |
| 476 | NULL, /* Language specific skip_trampoline */ |
| 477 | value_of_this, /* value_of_this */ |
| 478 | basic_lookup_symbol_nonlocal, /* lookup_symbol_nonlocal */ |
| 479 | basic_lookup_transparent_type,/* lookup_transparent_type */ |
| 480 | NULL, /* Language specific symbol demangler */ |
| 481 | NULL, /* Language specific class_name_from_physname */ |
| 482 | f_op_print_tab, /* expression operators for printing */ |
| 483 | 0, /* arrays are first-class (not c-style) */ |
| 484 | 1, /* String lower bound */ |
| 485 | &builtin_type_f_character, /* Type of string elements */ |
| 486 | default_word_break_characters, |
| 487 | NULL, /* FIXME: la_language_arch_info. */ |
| 488 | default_print_array_index, |
| 489 | LANG_MAGIC |
| 490 | }; |
| 491 | |
| 492 | static void |
| 493 | build_fortran_types (void) |
| 494 | { |
| 495 | builtin_type_f_void = |
| 496 | init_type (TYPE_CODE_VOID, 1, |
| 497 | 0, |
| 498 | "VOID", (struct objfile *) NULL); |
| 499 | |
| 500 | builtin_type_f_character = |
| 501 | init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 502 | 0, |
| 503 | "character", (struct objfile *) NULL); |
| 504 | |
| 505 | builtin_type_f_logical_s1 = |
| 506 | init_type (TYPE_CODE_BOOL, TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 507 | TYPE_FLAG_UNSIGNED, |
| 508 | "logical*1", (struct objfile *) NULL); |
| 509 | |
| 510 | builtin_type_f_integer_s2 = |
| 511 | init_type (TYPE_CODE_INT, TARGET_SHORT_BIT / TARGET_CHAR_BIT, |
| 512 | 0, |
| 513 | "integer*2", (struct objfile *) NULL); |
| 514 | |
| 515 | builtin_type_f_logical_s2 = |
| 516 | init_type (TYPE_CODE_BOOL, TARGET_SHORT_BIT / TARGET_CHAR_BIT, |
| 517 | TYPE_FLAG_UNSIGNED, |
| 518 | "logical*2", (struct objfile *) NULL); |
| 519 | |
| 520 | builtin_type_f_integer = |
| 521 | init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT, |
| 522 | 0, |
| 523 | "integer", (struct objfile *) NULL); |
| 524 | |
| 525 | builtin_type_f_logical = |
| 526 | init_type (TYPE_CODE_BOOL, TARGET_INT_BIT / TARGET_CHAR_BIT, |
| 527 | TYPE_FLAG_UNSIGNED, |
| 528 | "logical*4", (struct objfile *) NULL); |
| 529 | |
| 530 | builtin_type_f_real = |
| 531 | init_type (TYPE_CODE_FLT, TARGET_FLOAT_BIT / TARGET_CHAR_BIT, |
| 532 | 0, |
| 533 | "real", (struct objfile *) NULL); |
| 534 | |
| 535 | builtin_type_f_real_s8 = |
| 536 | init_type (TYPE_CODE_FLT, TARGET_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 537 | 0, |
| 538 | "real*8", (struct objfile *) NULL); |
| 539 | |
| 540 | builtin_type_f_real_s16 = |
| 541 | init_type (TYPE_CODE_FLT, TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 542 | 0, |
| 543 | "real*16", (struct objfile *) NULL); |
| 544 | |
| 545 | builtin_type_f_complex_s8 = |
| 546 | init_type (TYPE_CODE_COMPLEX, 2 * TARGET_FLOAT_BIT / TARGET_CHAR_BIT, |
| 547 | 0, |
| 548 | "complex*8", (struct objfile *) NULL); |
| 549 | TYPE_TARGET_TYPE (builtin_type_f_complex_s8) = builtin_type_f_real; |
| 550 | |
| 551 | builtin_type_f_complex_s16 = |
| 552 | init_type (TYPE_CODE_COMPLEX, 2 * TARGET_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 553 | 0, |
| 554 | "complex*16", (struct objfile *) NULL); |
| 555 | TYPE_TARGET_TYPE (builtin_type_f_complex_s16) = builtin_type_f_real_s8; |
| 556 | |
| 557 | /* We have a new size == 4 double floats for the |
| 558 | complex*32 data type */ |
| 559 | |
| 560 | builtin_type_f_complex_s32 = |
| 561 | init_type (TYPE_CODE_COMPLEX, 2 * TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT, |
| 562 | 0, |
| 563 | "complex*32", (struct objfile *) NULL); |
| 564 | TYPE_TARGET_TYPE (builtin_type_f_complex_s32) = builtin_type_f_real_s16; |
| 565 | } |
| 566 | |
| 567 | void |
| 568 | _initialize_f_language (void) |
| 569 | { |
| 570 | build_fortran_types (); |
| 571 | |
| 572 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_character); |
| 573 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_logical); |
| 574 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_logical_s1); |
| 575 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_logical_s2); |
| 576 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_integer); |
| 577 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_integer_s2); |
| 578 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_real); |
| 579 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_real_s8); |
| 580 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_real_s16); |
| 581 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_complex_s8); |
| 582 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_complex_s16); |
| 583 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_complex_s32); |
| 584 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_f_void); |
| 585 | DEPRECATED_REGISTER_GDBARCH_SWAP (builtin_type_string); |
| 586 | deprecated_register_gdbarch_swap (NULL, 0, build_fortran_types); |
| 587 | |
| 588 | builtin_type_string = |
| 589 | init_type (TYPE_CODE_STRING, TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
| 590 | 0, |
| 591 | "character string", (struct objfile *) NULL); |
| 592 | |
| 593 | add_language (&f_language_defn); |
| 594 | } |
| 595 | |
| 596 | #if 0 |
| 597 | static SAVED_BF_PTR |
| 598 | allocate_saved_bf_node (void) |
| 599 | { |
| 600 | SAVED_BF_PTR new; |
| 601 | |
| 602 | new = (SAVED_BF_PTR) xmalloc (sizeof (SAVED_BF)); |
| 603 | return (new); |
| 604 | } |
| 605 | |
| 606 | static SAVED_FUNCTION * |
| 607 | allocate_saved_function_node (void) |
| 608 | { |
| 609 | SAVED_FUNCTION *new; |
| 610 | |
| 611 | new = (SAVED_FUNCTION *) xmalloc (sizeof (SAVED_FUNCTION)); |
| 612 | return (new); |
| 613 | } |
| 614 | |
| 615 | static SAVED_F77_COMMON_PTR |
| 616 | allocate_saved_f77_common_node (void) |
| 617 | { |
| 618 | SAVED_F77_COMMON_PTR new; |
| 619 | |
| 620 | new = (SAVED_F77_COMMON_PTR) xmalloc (sizeof (SAVED_F77_COMMON)); |
| 621 | return (new); |
| 622 | } |
| 623 | |
| 624 | static COMMON_ENTRY_PTR |
| 625 | allocate_common_entry_node (void) |
| 626 | { |
| 627 | COMMON_ENTRY_PTR new; |
| 628 | |
| 629 | new = (COMMON_ENTRY_PTR) xmalloc (sizeof (COMMON_ENTRY)); |
| 630 | return (new); |
| 631 | } |
| 632 | #endif |
| 633 | |
| 634 | SAVED_F77_COMMON_PTR head_common_list = NULL; /* Ptr to 1st saved COMMON */ |
| 635 | SAVED_F77_COMMON_PTR tail_common_list = NULL; /* Ptr to last saved COMMON */ |
| 636 | SAVED_F77_COMMON_PTR current_common = NULL; /* Ptr to current COMMON */ |
| 637 | |
| 638 | #if 0 |
| 639 | static SAVED_BF_PTR saved_bf_list = NULL; /* Ptr to (.bf,function) |
| 640 | list */ |
| 641 | static SAVED_BF_PTR saved_bf_list_end = NULL; /* Ptr to above list's end */ |
| 642 | static SAVED_BF_PTR current_head_bf_list = NULL; /* Current head of above list |
| 643 | */ |
| 644 | |
| 645 | static SAVED_BF_PTR tmp_bf_ptr; /* Generic temporary for use |
| 646 | in macros */ |
| 647 | |
| 648 | /* The following function simply enters a given common block onto |
| 649 | the global common block chain */ |
| 650 | |
| 651 | static void |
| 652 | add_common_block (char *name, CORE_ADDR offset, int secnum, char *func_stab) |
| 653 | { |
| 654 | SAVED_F77_COMMON_PTR tmp; |
| 655 | char *c, *local_copy_func_stab; |
| 656 | |
| 657 | /* If the COMMON block we are trying to add has a blank |
| 658 | name (i.e. "#BLNK_COM") then we set it to __BLANK |
| 659 | because the darn "#" character makes GDB's input |
| 660 | parser have fits. */ |
| 661 | |
| 662 | |
| 663 | if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0 |
| 664 | || strcmp (name, BLANK_COMMON_NAME_MF77) == 0) |
| 665 | { |
| 666 | |
| 667 | xfree (name); |
| 668 | name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1); |
| 669 | strcpy (name, BLANK_COMMON_NAME_LOCAL); |
| 670 | } |
| 671 | |
| 672 | tmp = allocate_saved_f77_common_node (); |
| 673 | |
| 674 | local_copy_func_stab = xmalloc (strlen (func_stab) + 1); |
| 675 | strcpy (local_copy_func_stab, func_stab); |
| 676 | |
| 677 | tmp->name = xmalloc (strlen (name) + 1); |
| 678 | |
| 679 | /* local_copy_func_stab is a stabstring, let us first extract the |
| 680 | function name from the stab by NULLing out the ':' character. */ |
| 681 | |
| 682 | |
| 683 | c = NULL; |
| 684 | c = strchr (local_copy_func_stab, ':'); |
| 685 | |
| 686 | if (c) |
| 687 | *c = '\0'; |
| 688 | else |
| 689 | error (_("Malformed function STAB found in add_common_block()")); |
| 690 | |
| 691 | |
| 692 | tmp->owning_function = xmalloc (strlen (local_copy_func_stab) + 1); |
| 693 | |
| 694 | strcpy (tmp->owning_function, local_copy_func_stab); |
| 695 | |
| 696 | strcpy (tmp->name, name); |
| 697 | tmp->offset = offset; |
| 698 | tmp->next = NULL; |
| 699 | tmp->entries = NULL; |
| 700 | tmp->secnum = secnum; |
| 701 | |
| 702 | current_common = tmp; |
| 703 | |
| 704 | if (head_common_list == NULL) |
| 705 | { |
| 706 | head_common_list = tail_common_list = tmp; |
| 707 | } |
| 708 | else |
| 709 | { |
| 710 | tail_common_list->next = tmp; |
| 711 | tail_common_list = tmp; |
| 712 | } |
| 713 | } |
| 714 | #endif |
| 715 | |
| 716 | /* The following function simply enters a given common entry onto |
| 717 | the "current_common" block that has been saved away. */ |
| 718 | |
| 719 | #if 0 |
| 720 | static void |
| 721 | add_common_entry (struct symbol *entry_sym_ptr) |
| 722 | { |
| 723 | COMMON_ENTRY_PTR tmp; |
| 724 | |
| 725 | |
| 726 | |
| 727 | /* The order of this list is important, since |
| 728 | we expect the entries to appear in decl. |
| 729 | order when we later issue "info common" calls */ |
| 730 | |
| 731 | tmp = allocate_common_entry_node (); |
| 732 | |
| 733 | tmp->next = NULL; |
| 734 | tmp->symbol = entry_sym_ptr; |
| 735 | |
| 736 | if (current_common == NULL) |
| 737 | error (_("Attempt to add COMMON entry with no block open!")); |
| 738 | else |
| 739 | { |
| 740 | if (current_common->entries == NULL) |
| 741 | { |
| 742 | current_common->entries = tmp; |
| 743 | current_common->end_of_entries = tmp; |
| 744 | } |
| 745 | else |
| 746 | { |
| 747 | current_common->end_of_entries->next = tmp; |
| 748 | current_common->end_of_entries = tmp; |
| 749 | } |
| 750 | } |
| 751 | } |
| 752 | #endif |
| 753 | |
| 754 | /* This routine finds the first encountred COMMON block named "name" */ |
| 755 | |
| 756 | #if 0 |
| 757 | static SAVED_F77_COMMON_PTR |
| 758 | find_first_common_named (char *name) |
| 759 | { |
| 760 | |
| 761 | SAVED_F77_COMMON_PTR tmp; |
| 762 | |
| 763 | tmp = head_common_list; |
| 764 | |
| 765 | while (tmp != NULL) |
| 766 | { |
| 767 | if (strcmp (tmp->name, name) == 0) |
| 768 | return (tmp); |
| 769 | else |
| 770 | tmp = tmp->next; |
| 771 | } |
| 772 | return (NULL); |
| 773 | } |
| 774 | #endif |
| 775 | |
| 776 | /* This routine finds the first encountred COMMON block named "name" |
| 777 | that belongs to function funcname */ |
| 778 | |
| 779 | SAVED_F77_COMMON_PTR |
| 780 | find_common_for_function (char *name, char *funcname) |
| 781 | { |
| 782 | |
| 783 | SAVED_F77_COMMON_PTR tmp; |
| 784 | |
| 785 | tmp = head_common_list; |
| 786 | |
| 787 | while (tmp != NULL) |
| 788 | { |
| 789 | if (DEPRECATED_STREQ (tmp->name, name) |
| 790 | && DEPRECATED_STREQ (tmp->owning_function, funcname)) |
| 791 | return (tmp); |
| 792 | else |
| 793 | tmp = tmp->next; |
| 794 | } |
| 795 | return (NULL); |
| 796 | } |
| 797 | |
| 798 | |
| 799 | #if 0 |
| 800 | |
| 801 | /* The following function is called to patch up the offsets |
| 802 | for the statics contained in the COMMON block named |
| 803 | "name." */ |
| 804 | |
| 805 | static void |
| 806 | patch_common_entries (SAVED_F77_COMMON_PTR blk, CORE_ADDR offset, int secnum) |
| 807 | { |
| 808 | COMMON_ENTRY_PTR entry; |
| 809 | |
| 810 | blk->offset = offset; /* Keep this around for future use. */ |
| 811 | |
| 812 | entry = blk->entries; |
| 813 | |
| 814 | while (entry != NULL) |
| 815 | { |
| 816 | SYMBOL_VALUE (entry->symbol) += offset; |
| 817 | SYMBOL_SECTION (entry->symbol) = secnum; |
| 818 | |
| 819 | entry = entry->next; |
| 820 | } |
| 821 | blk->secnum = secnum; |
| 822 | } |
| 823 | |
| 824 | /* Patch all commons named "name" that need patching.Since COMMON |
| 825 | blocks occur with relative infrequency, we simply do a linear scan on |
| 826 | the name. Eventually, the best way to do this will be a |
| 827 | hashed-lookup. Secnum is the section number for the .bss section |
| 828 | (which is where common data lives). */ |
| 829 | |
| 830 | static void |
| 831 | patch_all_commons_by_name (char *name, CORE_ADDR offset, int secnum) |
| 832 | { |
| 833 | |
| 834 | SAVED_F77_COMMON_PTR tmp; |
| 835 | |
| 836 | /* For blank common blocks, change the canonical reprsentation |
| 837 | of a blank name */ |
| 838 | |
| 839 | if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0 |
| 840 | || strcmp (name, BLANK_COMMON_NAME_MF77) == 0) |
| 841 | { |
| 842 | xfree (name); |
| 843 | name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1); |
| 844 | strcpy (name, BLANK_COMMON_NAME_LOCAL); |
| 845 | } |
| 846 | |
| 847 | tmp = head_common_list; |
| 848 | |
| 849 | while (tmp != NULL) |
| 850 | { |
| 851 | if (COMMON_NEEDS_PATCHING (tmp)) |
| 852 | if (strcmp (tmp->name, name) == 0) |
| 853 | patch_common_entries (tmp, offset, secnum); |
| 854 | |
| 855 | tmp = tmp->next; |
| 856 | } |
| 857 | } |
| 858 | #endif |
| 859 | |
| 860 | /* This macro adds the symbol-number for the start of the function |
| 861 | (the symbol number of the .bf) referenced by symnum_fcn to a |
| 862 | list. This list, in reality should be a FIFO queue but since |
| 863 | #line pragmas sometimes cause line ranges to get messed up |
| 864 | we simply create a linear list. This list can then be searched |
| 865 | first by a queueing algorithm and upon failure fall back to |
| 866 | a linear scan. */ |
| 867 | |
| 868 | #if 0 |
| 869 | #define ADD_BF_SYMNUM(bf_sym,fcn_sym) \ |
| 870 | \ |
| 871 | if (saved_bf_list == NULL) \ |
| 872 | { \ |
| 873 | tmp_bf_ptr = allocate_saved_bf_node(); \ |
| 874 | \ |
| 875 | tmp_bf_ptr->symnum_bf = (bf_sym); \ |
| 876 | tmp_bf_ptr->symnum_fcn = (fcn_sym); \ |
| 877 | tmp_bf_ptr->next = NULL; \ |
| 878 | \ |
| 879 | current_head_bf_list = saved_bf_list = tmp_bf_ptr; \ |
| 880 | saved_bf_list_end = tmp_bf_ptr; \ |
| 881 | } \ |
| 882 | else \ |
| 883 | { \ |
| 884 | tmp_bf_ptr = allocate_saved_bf_node(); \ |
| 885 | \ |
| 886 | tmp_bf_ptr->symnum_bf = (bf_sym); \ |
| 887 | tmp_bf_ptr->symnum_fcn = (fcn_sym); \ |
| 888 | tmp_bf_ptr->next = NULL; \ |
| 889 | \ |
| 890 | saved_bf_list_end->next = tmp_bf_ptr; \ |
| 891 | saved_bf_list_end = tmp_bf_ptr; \ |
| 892 | } |
| 893 | #endif |
| 894 | |
| 895 | /* This function frees the entire (.bf,function) list */ |
| 896 | |
| 897 | #if 0 |
| 898 | static void |
| 899 | clear_bf_list (void) |
| 900 | { |
| 901 | |
| 902 | SAVED_BF_PTR tmp = saved_bf_list; |
| 903 | SAVED_BF_PTR next = NULL; |
| 904 | |
| 905 | while (tmp != NULL) |
| 906 | { |
| 907 | next = tmp->next; |
| 908 | xfree (tmp); |
| 909 | tmp = next; |
| 910 | } |
| 911 | saved_bf_list = NULL; |
| 912 | } |
| 913 | #endif |
| 914 | |
| 915 | int global_remote_debug; |
| 916 | |
| 917 | #if 0 |
| 918 | |
| 919 | static long |
| 920 | get_bf_for_fcn (long the_function) |
| 921 | { |
| 922 | SAVED_BF_PTR tmp; |
| 923 | int nprobes = 0; |
| 924 | |
| 925 | /* First use a simple queuing algorithm (i.e. look and see if the |
| 926 | item at the head of the queue is the one you want) */ |
| 927 | |
| 928 | if (saved_bf_list == NULL) |
| 929 | internal_error (__FILE__, __LINE__, |
| 930 | _("cannot get .bf node off empty list")); |
| 931 | |
| 932 | if (current_head_bf_list != NULL) |
| 933 | if (current_head_bf_list->symnum_fcn == the_function) |
| 934 | { |
| 935 | if (global_remote_debug) |
| 936 | fprintf_unfiltered (gdb_stderr, "*"); |
| 937 | |
| 938 | tmp = current_head_bf_list; |
| 939 | current_head_bf_list = current_head_bf_list->next; |
| 940 | return (tmp->symnum_bf); |
| 941 | } |
| 942 | |
| 943 | /* If the above did not work (probably because #line directives were |
| 944 | used in the sourcefile and they messed up our internal tables) we now do |
| 945 | the ugly linear scan */ |
| 946 | |
| 947 | if (global_remote_debug) |
| 948 | fprintf_unfiltered (gdb_stderr, "\ndefaulting to linear scan\n"); |
| 949 | |
| 950 | nprobes = 0; |
| 951 | tmp = saved_bf_list; |
| 952 | while (tmp != NULL) |
| 953 | { |
| 954 | nprobes++; |
| 955 | if (tmp->symnum_fcn == the_function) |
| 956 | { |
| 957 | if (global_remote_debug) |
| 958 | fprintf_unfiltered (gdb_stderr, "Found in %d probes\n", nprobes); |
| 959 | current_head_bf_list = tmp->next; |
| 960 | return (tmp->symnum_bf); |
| 961 | } |
| 962 | tmp = tmp->next; |
| 963 | } |
| 964 | |
| 965 | return (-1); |
| 966 | } |
| 967 | |
| 968 | static SAVED_FUNCTION_PTR saved_function_list = NULL; |
| 969 | static SAVED_FUNCTION_PTR saved_function_list_end = NULL; |
| 970 | |
| 971 | static void |
| 972 | clear_function_list (void) |
| 973 | { |
| 974 | SAVED_FUNCTION_PTR tmp = saved_function_list; |
| 975 | SAVED_FUNCTION_PTR next = NULL; |
| 976 | |
| 977 | while (tmp != NULL) |
| 978 | { |
| 979 | next = tmp->next; |
| 980 | xfree (tmp); |
| 981 | tmp = next; |
| 982 | } |
| 983 | |
| 984 | saved_function_list = NULL; |
| 985 | } |
| 986 | #endif |