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