* language.h (struct language_arch_info): New members
[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 &exp_descriptor_standard,
320 f_parse, /* parser */
321 f_error, /* parser error function */
322 null_post_parser,
323 f_printchar, /* Print character constant */
324 f_printstr, /* function to print string constant */
325 f_emit_char, /* Function to print a single character */
326 f_print_type, /* Print a type using appropriate syntax */
327 f_val_print, /* Print a value using appropriate syntax */
328 c_value_print, /* FIXME */
329 NULL, /* Language specific skip_trampoline */
330 NULL, /* name_of_this */
331 basic_lookup_symbol_nonlocal, /* lookup_symbol_nonlocal */
332 basic_lookup_transparent_type,/* lookup_transparent_type */
333 NULL, /* Language specific symbol demangler */
334 NULL, /* Language specific class_name_from_physname */
335 f_op_print_tab, /* expression operators for printing */
336 0, /* arrays are first-class (not c-style) */
337 1, /* String lower bound */
338 default_word_break_characters,
339 default_make_symbol_completion_list,
340 f_language_arch_info,
341 default_print_array_index,
342 default_pass_by_reference,
343 LANG_MAGIC
344 };
345
346 static void *
347 build_fortran_types (struct gdbarch *gdbarch)
348 {
349 struct builtin_f_type *builtin_f_type
350 = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct builtin_f_type);
351
352 builtin_f_type->builtin_void =
353 init_type (TYPE_CODE_VOID, 1,
354 0,
355 "VOID", (struct objfile *) NULL);
356
357 builtin_f_type->builtin_character =
358 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
359 0,
360 "character", (struct objfile *) NULL);
361
362 builtin_f_type->builtin_logical_s1 =
363 init_type (TYPE_CODE_BOOL, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
364 TYPE_FLAG_UNSIGNED,
365 "logical*1", (struct objfile *) NULL);
366
367 builtin_f_type->builtin_integer_s2 =
368 init_type (TYPE_CODE_INT,
369 gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT,
370 0, "integer*2", (struct objfile *) NULL);
371
372 builtin_f_type->builtin_logical_s2 =
373 init_type (TYPE_CODE_BOOL,
374 gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT,
375 TYPE_FLAG_UNSIGNED, "logical*2", (struct objfile *) NULL);
376
377 builtin_f_type->builtin_integer =
378 init_type (TYPE_CODE_INT,
379 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
380 0, "integer", (struct objfile *) NULL);
381
382 builtin_f_type->builtin_logical =
383 init_type (TYPE_CODE_BOOL,
384 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
385 TYPE_FLAG_UNSIGNED, "logical*4", (struct objfile *) NULL);
386
387 builtin_f_type->builtin_real =
388 init_type (TYPE_CODE_FLT,
389 gdbarch_float_bit (gdbarch) / TARGET_CHAR_BIT,
390 0,
391 "real", (struct objfile *) NULL);
392
393 builtin_f_type->builtin_real_s8 =
394 init_type (TYPE_CODE_FLT,
395 gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
396 0,
397 "real*8", (struct objfile *) NULL);
398
399 builtin_f_type->builtin_real_s16 =
400 init_type (TYPE_CODE_FLT,
401 gdbarch_long_double_bit (gdbarch) / TARGET_CHAR_BIT,
402 0,
403 "real*16", (struct objfile *) NULL);
404
405 builtin_f_type->builtin_complex_s8 =
406 init_type (TYPE_CODE_COMPLEX,
407 2 * gdbarch_float_bit (gdbarch) / TARGET_CHAR_BIT,
408 0,
409 "complex*8", (struct objfile *) NULL);
410 TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s8)
411 = builtin_f_type->builtin_real;
412
413 builtin_f_type->builtin_complex_s16 =
414 init_type (TYPE_CODE_COMPLEX,
415 2 * gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
416 0,
417 "complex*16", (struct objfile *) NULL);
418 TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s16)
419 = builtin_f_type->builtin_real_s8;
420
421 /* We have a new size == 4 double floats for the
422 complex*32 data type */
423
424 builtin_f_type->builtin_complex_s32 =
425 init_type (TYPE_CODE_COMPLEX,
426 2 * gdbarch_long_double_bit (gdbarch) / TARGET_CHAR_BIT,
427 0,
428 "complex*32", (struct objfile *) NULL);
429 TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s32)
430 = builtin_f_type->builtin_real_s16;
431
432 return builtin_f_type;
433 }
434
435 static struct gdbarch_data *f_type_data;
436
437 const struct builtin_f_type *
438 builtin_f_type (struct gdbarch *gdbarch)
439 {
440 return gdbarch_data (gdbarch, f_type_data);
441 }
442
443 void
444 _initialize_f_language (void)
445 {
446 f_type_data = gdbarch_data_register_post_init (build_fortran_types);
447
448 add_language (&f_language_defn);
449 }
450
451 #if 0
452 static SAVED_BF_PTR
453 allocate_saved_bf_node (void)
454 {
455 SAVED_BF_PTR new;
456
457 new = (SAVED_BF_PTR) xmalloc (sizeof (SAVED_BF));
458 return (new);
459 }
460
461 static SAVED_FUNCTION *
462 allocate_saved_function_node (void)
463 {
464 SAVED_FUNCTION *new;
465
466 new = (SAVED_FUNCTION *) xmalloc (sizeof (SAVED_FUNCTION));
467 return (new);
468 }
469
470 static SAVED_F77_COMMON_PTR
471 allocate_saved_f77_common_node (void)
472 {
473 SAVED_F77_COMMON_PTR new;
474
475 new = (SAVED_F77_COMMON_PTR) xmalloc (sizeof (SAVED_F77_COMMON));
476 return (new);
477 }
478
479 static COMMON_ENTRY_PTR
480 allocate_common_entry_node (void)
481 {
482 COMMON_ENTRY_PTR new;
483
484 new = (COMMON_ENTRY_PTR) xmalloc (sizeof (COMMON_ENTRY));
485 return (new);
486 }
487 #endif
488
489 SAVED_F77_COMMON_PTR head_common_list = NULL; /* Ptr to 1st saved COMMON */
490 SAVED_F77_COMMON_PTR tail_common_list = NULL; /* Ptr to last saved COMMON */
491 SAVED_F77_COMMON_PTR current_common = NULL; /* Ptr to current COMMON */
492
493 #if 0
494 static SAVED_BF_PTR saved_bf_list = NULL; /* Ptr to (.bf,function)
495 list */
496 static SAVED_BF_PTR saved_bf_list_end = NULL; /* Ptr to above list's end */
497 static SAVED_BF_PTR current_head_bf_list = NULL; /* Current head of above list
498 */
499
500 static SAVED_BF_PTR tmp_bf_ptr; /* Generic temporary for use
501 in macros */
502
503 /* The following function simply enters a given common block onto
504 the global common block chain */
505
506 static void
507 add_common_block (char *name, CORE_ADDR offset, int secnum, char *func_stab)
508 {
509 SAVED_F77_COMMON_PTR tmp;
510 char *c, *local_copy_func_stab;
511
512 /* If the COMMON block we are trying to add has a blank
513 name (i.e. "#BLNK_COM") then we set it to __BLANK
514 because the darn "#" character makes GDB's input
515 parser have fits. */
516
517
518 if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0
519 || strcmp (name, BLANK_COMMON_NAME_MF77) == 0)
520 {
521
522 xfree (name);
523 name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1);
524 strcpy (name, BLANK_COMMON_NAME_LOCAL);
525 }
526
527 tmp = allocate_saved_f77_common_node ();
528
529 local_copy_func_stab = xmalloc (strlen (func_stab) + 1);
530 strcpy (local_copy_func_stab, func_stab);
531
532 tmp->name = xmalloc (strlen (name) + 1);
533
534 /* local_copy_func_stab is a stabstring, let us first extract the
535 function name from the stab by NULLing out the ':' character. */
536
537
538 c = NULL;
539 c = strchr (local_copy_func_stab, ':');
540
541 if (c)
542 *c = '\0';
543 else
544 error (_("Malformed function STAB found in add_common_block()"));
545
546
547 tmp->owning_function = xmalloc (strlen (local_copy_func_stab) + 1);
548
549 strcpy (tmp->owning_function, local_copy_func_stab);
550
551 strcpy (tmp->name, name);
552 tmp->offset = offset;
553 tmp->next = NULL;
554 tmp->entries = NULL;
555 tmp->secnum = secnum;
556
557 current_common = tmp;
558
559 if (head_common_list == NULL)
560 {
561 head_common_list = tail_common_list = tmp;
562 }
563 else
564 {
565 tail_common_list->next = tmp;
566 tail_common_list = tmp;
567 }
568 }
569 #endif
570
571 /* The following function simply enters a given common entry onto
572 the "current_common" block that has been saved away. */
573
574 #if 0
575 static void
576 add_common_entry (struct symbol *entry_sym_ptr)
577 {
578 COMMON_ENTRY_PTR tmp;
579
580
581
582 /* The order of this list is important, since
583 we expect the entries to appear in decl.
584 order when we later issue "info common" calls */
585
586 tmp = allocate_common_entry_node ();
587
588 tmp->next = NULL;
589 tmp->symbol = entry_sym_ptr;
590
591 if (current_common == NULL)
592 error (_("Attempt to add COMMON entry with no block open!"));
593 else
594 {
595 if (current_common->entries == NULL)
596 {
597 current_common->entries = tmp;
598 current_common->end_of_entries = tmp;
599 }
600 else
601 {
602 current_common->end_of_entries->next = tmp;
603 current_common->end_of_entries = tmp;
604 }
605 }
606 }
607 #endif
608
609 /* This routine finds the first encountred COMMON block named "name" */
610
611 #if 0
612 static SAVED_F77_COMMON_PTR
613 find_first_common_named (char *name)
614 {
615
616 SAVED_F77_COMMON_PTR tmp;
617
618 tmp = head_common_list;
619
620 while (tmp != NULL)
621 {
622 if (strcmp (tmp->name, name) == 0)
623 return (tmp);
624 else
625 tmp = tmp->next;
626 }
627 return (NULL);
628 }
629 #endif
630
631 /* This routine finds the first encountred COMMON block named "name"
632 that belongs to function funcname */
633
634 SAVED_F77_COMMON_PTR
635 find_common_for_function (char *name, char *funcname)
636 {
637
638 SAVED_F77_COMMON_PTR tmp;
639
640 tmp = head_common_list;
641
642 while (tmp != NULL)
643 {
644 if (strcmp (tmp->name, name) == 0
645 && strcmp (tmp->owning_function, funcname) == 0)
646 return (tmp);
647 else
648 tmp = tmp->next;
649 }
650 return (NULL);
651 }
652
653
654 #if 0
655
656 /* The following function is called to patch up the offsets
657 for the statics contained in the COMMON block named
658 "name." */
659
660 static void
661 patch_common_entries (SAVED_F77_COMMON_PTR blk, CORE_ADDR offset, int secnum)
662 {
663 COMMON_ENTRY_PTR entry;
664
665 blk->offset = offset; /* Keep this around for future use. */
666
667 entry = blk->entries;
668
669 while (entry != NULL)
670 {
671 SYMBOL_VALUE (entry->symbol) += offset;
672 SYMBOL_SECTION (entry->symbol) = secnum;
673
674 entry = entry->next;
675 }
676 blk->secnum = secnum;
677 }
678
679 /* Patch all commons named "name" that need patching.Since COMMON
680 blocks occur with relative infrequency, we simply do a linear scan on
681 the name. Eventually, the best way to do this will be a
682 hashed-lookup. Secnum is the section number for the .bss section
683 (which is where common data lives). */
684
685 static void
686 patch_all_commons_by_name (char *name, CORE_ADDR offset, int secnum)
687 {
688
689 SAVED_F77_COMMON_PTR tmp;
690
691 /* For blank common blocks, change the canonical reprsentation
692 of a blank name */
693
694 if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0
695 || strcmp (name, BLANK_COMMON_NAME_MF77) == 0)
696 {
697 xfree (name);
698 name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1);
699 strcpy (name, BLANK_COMMON_NAME_LOCAL);
700 }
701
702 tmp = head_common_list;
703
704 while (tmp != NULL)
705 {
706 if (COMMON_NEEDS_PATCHING (tmp))
707 if (strcmp (tmp->name, name) == 0)
708 patch_common_entries (tmp, offset, secnum);
709
710 tmp = tmp->next;
711 }
712 }
713 #endif
714
715 /* This macro adds the symbol-number for the start of the function
716 (the symbol number of the .bf) referenced by symnum_fcn to a
717 list. This list, in reality should be a FIFO queue but since
718 #line pragmas sometimes cause line ranges to get messed up
719 we simply create a linear list. This list can then be searched
720 first by a queueing algorithm and upon failure fall back to
721 a linear scan. */
722
723 #if 0
724 #define ADD_BF_SYMNUM(bf_sym,fcn_sym) \
725 \
726 if (saved_bf_list == NULL) \
727 { \
728 tmp_bf_ptr = allocate_saved_bf_node(); \
729 \
730 tmp_bf_ptr->symnum_bf = (bf_sym); \
731 tmp_bf_ptr->symnum_fcn = (fcn_sym); \
732 tmp_bf_ptr->next = NULL; \
733 \
734 current_head_bf_list = saved_bf_list = tmp_bf_ptr; \
735 saved_bf_list_end = tmp_bf_ptr; \
736 } \
737 else \
738 { \
739 tmp_bf_ptr = allocate_saved_bf_node(); \
740 \
741 tmp_bf_ptr->symnum_bf = (bf_sym); \
742 tmp_bf_ptr->symnum_fcn = (fcn_sym); \
743 tmp_bf_ptr->next = NULL; \
744 \
745 saved_bf_list_end->next = tmp_bf_ptr; \
746 saved_bf_list_end = tmp_bf_ptr; \
747 }
748 #endif
749
750 /* This function frees the entire (.bf,function) list */
751
752 #if 0
753 static void
754 clear_bf_list (void)
755 {
756
757 SAVED_BF_PTR tmp = saved_bf_list;
758 SAVED_BF_PTR next = NULL;
759
760 while (tmp != NULL)
761 {
762 next = tmp->next;
763 xfree (tmp);
764 tmp = next;
765 }
766 saved_bf_list = NULL;
767 }
768 #endif
769
770 int global_remote_debug;
771
772 #if 0
773
774 static long
775 get_bf_for_fcn (long the_function)
776 {
777 SAVED_BF_PTR tmp;
778 int nprobes = 0;
779
780 /* First use a simple queuing algorithm (i.e. look and see if the
781 item at the head of the queue is the one you want) */
782
783 if (saved_bf_list == NULL)
784 internal_error (__FILE__, __LINE__,
785 _("cannot get .bf node off empty list"));
786
787 if (current_head_bf_list != NULL)
788 if (current_head_bf_list->symnum_fcn == the_function)
789 {
790 if (global_remote_debug)
791 fprintf_unfiltered (gdb_stderr, "*");
792
793 tmp = current_head_bf_list;
794 current_head_bf_list = current_head_bf_list->next;
795 return (tmp->symnum_bf);
796 }
797
798 /* If the above did not work (probably because #line directives were
799 used in the sourcefile and they messed up our internal tables) we now do
800 the ugly linear scan */
801
802 if (global_remote_debug)
803 fprintf_unfiltered (gdb_stderr, "\ndefaulting to linear scan\n");
804
805 nprobes = 0;
806 tmp = saved_bf_list;
807 while (tmp != NULL)
808 {
809 nprobes++;
810 if (tmp->symnum_fcn == the_function)
811 {
812 if (global_remote_debug)
813 fprintf_unfiltered (gdb_stderr, "Found in %d probes\n", nprobes);
814 current_head_bf_list = tmp->next;
815 return (tmp->symnum_bf);
816 }
817 tmp = tmp->next;
818 }
819
820 return (-1);
821 }
822
823 static SAVED_FUNCTION_PTR saved_function_list = NULL;
824 static SAVED_FUNCTION_PTR saved_function_list_end = NULL;
825
826 static void
827 clear_function_list (void)
828 {
829 SAVED_FUNCTION_PTR tmp = saved_function_list;
830 SAVED_FUNCTION_PTR next = NULL;
831
832 while (tmp != NULL)
833 {
834 next = tmp->next;
835 xfree (tmp);
836 tmp = next;
837 }
838
839 saved_function_list = NULL;
840 }
841 #endif
This page took 0.068975 seconds and 4 git commands to generate.