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