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