gdb/f-lang.c

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