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