Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Fortran language support routines for GDB, the GNU debugger. |
ce27fb25 | 2 | |
6aba47ca | 3 | Copyright (C) 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, 2002, 2003, |
9b254dd1 | 4 | 2004, 2005, 2007, 2008 Free Software Foundation, Inc. |
ce27fb25 | 5 | |
c906108c SS |
6 | Contributed by Motorola. Adapted from the C parser by Farooq Butt |
7 | (fmbutt@engage.sps.mot.com). | |
8 | ||
c5aa993b | 9 | This file is part of GDB. |
c906108c | 10 | |
c5aa993b JM |
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 | |
a9762ec7 | 13 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 14 | (at your option) any later version. |
c906108c | 15 | |
c5aa993b JM |
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. | |
c906108c | 20 | |
c5aa993b | 21 | You should have received a copy of the GNU General Public License |
a9762ec7 | 22 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
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" | |
745b8ca0 | 32 | #include "valprint.h" |
5f9a71c3 | 33 | #include "value.h" |
c906108c | 34 | |
c906108c SS |
35 | |
36 | /* Following is dubious stuff that had been in the xcoff reader. */ | |
37 | ||
38 | struct saved_fcn | |
c5aa993b JM |
39 | { |
40 | long line_offset; /* Line offset for function */ | |
41 | struct saved_fcn *next; | |
42 | }; | |
c906108c SS |
43 | |
44 | ||
c5aa993b JM |
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 | }; | |
c906108c | 51 | |
c5aa993b JM |
52 | typedef struct saved_fcn SAVED_FUNCTION, *SAVED_FUNCTION_PTR; |
53 | typedef struct saved_bf_symnum SAVED_BF, *SAVED_BF_PTR; | |
c906108c SS |
54 | |
55 | /* Local functions */ | |
56 | ||
a14ed312 | 57 | extern void _initialize_f_language (void); |
c906108c | 58 | #if 0 |
a14ed312 KB |
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); | |
c906108c SS |
71 | #endif |
72 | ||
d9fcf2fb JM |
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); | |
c906108c SS |
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 | |
f86f5ca3 | 83 | f_emit_char (int c, struct ui_file *stream, int quoter) |
c906108c SS |
84 | { |
85 | c &= 0xFF; /* Avoid sign bit follies */ | |
c5aa993b | 86 | |
c906108c SS |
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 | |
fba45db2 | 129 | f_printchar (int c, struct ui_file *stream) |
c906108c SS |
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 | |
fc1a4b47 | 144 | f_printstr (struct ui_file *stream, const gdb_byte *string, |
ce27fb25 | 145 | unsigned int length, int width, int force_ellipses) |
c906108c | 146 | { |
f86f5ca3 | 147 | unsigned int i; |
c906108c SS |
148 | unsigned int things_printed = 0; |
149 | int in_quotes = 0; | |
150 | int need_comma = 0; | |
c5aa993b | 151 | |
c906108c SS |
152 | if (length == 0) |
153 | { | |
154 | fputs_filtered ("''", gdb_stdout); | |
155 | return; | |
156 | } | |
c5aa993b | 157 | |
c906108c SS |
158 | for (i = 0; i < length && things_printed < print_max; ++i) |
159 | { | |
160 | /* Position of the character we are examining | |
c5aa993b | 161 | to see whether it is repeated. */ |
c906108c SS |
162 | unsigned int rep1; |
163 | /* Number of repetitions we have detected so far. */ | |
164 | unsigned int reps; | |
c5aa993b | 165 | |
c906108c | 166 | QUIT; |
c5aa993b | 167 | |
c906108c SS |
168 | if (need_comma) |
169 | { | |
170 | fputs_filtered (", ", stream); | |
171 | need_comma = 0; | |
172 | } | |
c5aa993b | 173 | |
c906108c SS |
174 | rep1 = i + 1; |
175 | reps = 1; | |
176 | while (rep1 < length && string[rep1] == string[i]) | |
177 | { | |
178 | ++rep1; | |
179 | ++reps; | |
180 | } | |
c5aa993b | 181 | |
c906108c SS |
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 | } | |
c5aa993b | 212 | |
c906108c SS |
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 | } | |
c5aa993b | 221 | |
c906108c SS |
222 | if (force_ellipses || i < length) |
223 | fputs_filtered ("...", stream); | |
224 | } | |
c906108c | 225 | \f |
c5aa993b | 226 | |
c906108c SS |
227 | /* Table of operators and their precedences for printing expressions. */ |
228 | ||
c5aa993b JM |
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} | |
c906108c SS |
252 | }; |
253 | \f | |
cad351d1 UW |
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 | |
c906108c SS |
268 | }; |
269 | ||
cad351d1 UW |
270 | static void |
271 | f_language_arch_info (struct gdbarch *gdbarch, | |
272 | struct language_arch_info *lai) | |
273 | { | |
54ef06c7 UW |
274 | const struct builtin_f_type *builtin = builtin_f_type (gdbarch); |
275 | ||
276 | lai->string_char_type = builtin->builtin_character; | |
cad351d1 UW |
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] | |
54ef06c7 | 282 | = builtin->builtin_character; |
cad351d1 | 283 | lai->primitive_type_vector [f_primitive_type_logical] |
54ef06c7 | 284 | = builtin->builtin_logical; |
cad351d1 | 285 | lai->primitive_type_vector [f_primitive_type_logical_s1] |
54ef06c7 | 286 | = builtin->builtin_logical_s1; |
cad351d1 | 287 | lai->primitive_type_vector [f_primitive_type_logical_s2] |
54ef06c7 | 288 | = builtin->builtin_logical_s2; |
cad351d1 | 289 | lai->primitive_type_vector [f_primitive_type_real] |
54ef06c7 | 290 | = builtin->builtin_real; |
cad351d1 | 291 | lai->primitive_type_vector [f_primitive_type_real_s8] |
54ef06c7 | 292 | = builtin->builtin_real_s8; |
cad351d1 | 293 | lai->primitive_type_vector [f_primitive_type_real_s16] |
54ef06c7 | 294 | = builtin->builtin_real_s16; |
cad351d1 | 295 | lai->primitive_type_vector [f_primitive_type_complex_s8] |
54ef06c7 | 296 | = builtin->builtin_complex_s8; |
cad351d1 | 297 | lai->primitive_type_vector [f_primitive_type_complex_s16] |
54ef06c7 | 298 | = builtin->builtin_complex_s16; |
cad351d1 | 299 | lai->primitive_type_vector [f_primitive_type_void] |
54ef06c7 | 300 | = builtin->builtin_void; |
fbb06eb1 UW |
301 | |
302 | lai->bool_type_symbol = "logical"; | |
303 | lai->bool_type_default = builtin->builtin_logical_s2; | |
cad351d1 UW |
304 | } |
305 | ||
c906108c SS |
306 | /* This is declared in c-lang.h but it is silly to import that file for what |
307 | is already just a hack. */ | |
d9fcf2fb JM |
308 | extern int c_value_print (struct value *, struct ui_file *, int, |
309 | enum val_prettyprint); | |
c906108c | 310 | |
c5aa993b JM |
311 | const struct language_defn f_language_defn = |
312 | { | |
c906108c SS |
313 | "fortran", |
314 | language_fortran, | |
c906108c SS |
315 | range_check_on, |
316 | type_check_on, | |
63872f9d | 317 | case_sensitive_off, |
7ca2d3a3 | 318 | array_column_major, |
5f9769d1 | 319 | &exp_descriptor_standard, |
c906108c SS |
320 | f_parse, /* parser */ |
321 | f_error, /* parser error function */ | |
e85c3284 | 322 | null_post_parser, |
c906108c SS |
323 | f_printchar, /* Print character constant */ |
324 | f_printstr, /* function to print string constant */ | |
325 | f_emit_char, /* Function to print a single character */ | |
c5aa993b | 326 | f_print_type, /* Print a type using appropriate syntax */ |
5c6ce71d | 327 | default_print_typedef, /* Print a typedef using appropriate syntax */ |
c906108c | 328 | f_val_print, /* Print a value using appropriate syntax */ |
c5aa993b | 329 | c_value_print, /* FIXME */ |
f636b87d | 330 | NULL, /* Language specific skip_trampoline */ |
2b2d9e11 | 331 | NULL, /* name_of_this */ |
5f9a71c3 | 332 | basic_lookup_symbol_nonlocal, /* lookup_symbol_nonlocal */ |
b368761e | 333 | basic_lookup_transparent_type,/* lookup_transparent_type */ |
9a3d7dfd | 334 | NULL, /* Language specific symbol demangler */ |
31c27f77 | 335 | NULL, /* Language specific class_name_from_physname */ |
c906108c SS |
336 | f_op_print_tab, /* expression operators for printing */ |
337 | 0, /* arrays are first-class (not c-style) */ | |
338 | 1, /* String lower bound */ | |
6084f43a | 339 | default_word_break_characters, |
41d27058 | 340 | default_make_symbol_completion_list, |
cad351d1 | 341 | f_language_arch_info, |
e79af960 | 342 | default_print_array_index, |
41f1b697 | 343 | default_pass_by_reference, |
c906108c | 344 | LANG_MAGIC |
c5aa993b | 345 | }; |
c906108c | 346 | |
54ef06c7 UW |
347 | static void * |
348 | build_fortran_types (struct gdbarch *gdbarch) | |
c906108c | 349 | { |
54ef06c7 UW |
350 | struct builtin_f_type *builtin_f_type |
351 | = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct builtin_f_type); | |
352 | ||
353 | builtin_f_type->builtin_void = | |
c906108c SS |
354 | init_type (TYPE_CODE_VOID, 1, |
355 | 0, | |
356 | "VOID", (struct objfile *) NULL); | |
c5aa993b | 357 | |
54ef06c7 | 358 | builtin_f_type->builtin_character = |
c906108c SS |
359 | init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
360 | 0, | |
361 | "character", (struct objfile *) NULL); | |
c5aa993b | 362 | |
54ef06c7 | 363 | builtin_f_type->builtin_logical_s1 = |
c906108c SS |
364 | init_type (TYPE_CODE_BOOL, TARGET_CHAR_BIT / TARGET_CHAR_BIT, |
365 | TYPE_FLAG_UNSIGNED, | |
366 | "logical*1", (struct objfile *) NULL); | |
c5aa993b | 367 | |
54ef06c7 | 368 | builtin_f_type->builtin_integer_s2 = |
9a76efb6 | 369 | init_type (TYPE_CODE_INT, |
bb09620c | 370 | gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT, |
9a76efb6 | 371 | 0, "integer*2", (struct objfile *) NULL); |
c5aa993b | 372 | |
54ef06c7 | 373 | builtin_f_type->builtin_logical_s2 = |
9a76efb6 | 374 | init_type (TYPE_CODE_BOOL, |
bb09620c | 375 | gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT, |
9a76efb6 | 376 | TYPE_FLAG_UNSIGNED, "logical*2", (struct objfile *) NULL); |
c5aa993b | 377 | |
54ef06c7 | 378 | builtin_f_type->builtin_integer = |
9a76efb6 | 379 | init_type (TYPE_CODE_INT, |
bb09620c | 380 | gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT, |
9a76efb6 | 381 | 0, "integer", (struct objfile *) NULL); |
c5aa993b | 382 | |
54ef06c7 | 383 | builtin_f_type->builtin_logical = |
9a76efb6 | 384 | init_type (TYPE_CODE_BOOL, |
bb09620c | 385 | gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT, |
9a76efb6 | 386 | TYPE_FLAG_UNSIGNED, "logical*4", (struct objfile *) NULL); |
c5aa993b | 387 | |
54ef06c7 | 388 | builtin_f_type->builtin_real = |
ea06eb3d | 389 | init_type (TYPE_CODE_FLT, |
bb09620c | 390 | gdbarch_float_bit (gdbarch) / TARGET_CHAR_BIT, |
c906108c SS |
391 | 0, |
392 | "real", (struct objfile *) NULL); | |
c5aa993b | 393 | |
54ef06c7 | 394 | builtin_f_type->builtin_real_s8 = |
ea06eb3d | 395 | init_type (TYPE_CODE_FLT, |
bb09620c | 396 | gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT, |
c906108c SS |
397 | 0, |
398 | "real*8", (struct objfile *) NULL); | |
c5aa993b | 399 | |
54ef06c7 | 400 | builtin_f_type->builtin_real_s16 = |
ea06eb3d | 401 | init_type (TYPE_CODE_FLT, |
bb09620c | 402 | gdbarch_long_double_bit (gdbarch) / TARGET_CHAR_BIT, |
c906108c SS |
403 | 0, |
404 | "real*16", (struct objfile *) NULL); | |
c5aa993b | 405 | |
54ef06c7 | 406 | builtin_f_type->builtin_complex_s8 = |
ea06eb3d | 407 | init_type (TYPE_CODE_COMPLEX, |
bb09620c | 408 | 2 * gdbarch_float_bit (gdbarch) / TARGET_CHAR_BIT, |
c906108c SS |
409 | 0, |
410 | "complex*8", (struct objfile *) NULL); | |
54ef06c7 UW |
411 | TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s8) |
412 | = builtin_f_type->builtin_real; | |
c5aa993b | 413 | |
54ef06c7 | 414 | builtin_f_type->builtin_complex_s16 = |
ea06eb3d | 415 | init_type (TYPE_CODE_COMPLEX, |
bb09620c | 416 | 2 * gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT, |
c906108c SS |
417 | 0, |
418 | "complex*16", (struct objfile *) NULL); | |
54ef06c7 UW |
419 | TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s16) |
420 | = builtin_f_type->builtin_real_s8; | |
c5aa993b | 421 | |
c906108c SS |
422 | /* We have a new size == 4 double floats for the |
423 | complex*32 data type */ | |
c5aa993b | 424 | |
54ef06c7 | 425 | builtin_f_type->builtin_complex_s32 = |
ea06eb3d | 426 | init_type (TYPE_CODE_COMPLEX, |
bb09620c | 427 | 2 * gdbarch_long_double_bit (gdbarch) / TARGET_CHAR_BIT, |
c906108c SS |
428 | 0, |
429 | "complex*32", (struct objfile *) NULL); | |
54ef06c7 UW |
430 | TYPE_TARGET_TYPE (builtin_f_type->builtin_complex_s32) |
431 | = builtin_f_type->builtin_real_s16; | |
432 | ||
433 | return builtin_f_type; | |
434 | } | |
435 | ||
436 | static struct gdbarch_data *f_type_data; | |
437 | ||
438 | const struct builtin_f_type * | |
439 | builtin_f_type (struct gdbarch *gdbarch) | |
440 | { | |
441 | return gdbarch_data (gdbarch, f_type_data); | |
4e845cd3 MS |
442 | } |
443 | ||
444 | void | |
445 | _initialize_f_language (void) | |
446 | { | |
54ef06c7 | 447 | f_type_data = gdbarch_data_register_post_init (build_fortran_types); |
c906108c | 448 | |
c906108c SS |
449 | add_language (&f_language_defn); |
450 | } | |
451 | ||
452 | #if 0 | |
453 | static SAVED_BF_PTR | |
fba45db2 | 454 | allocate_saved_bf_node (void) |
c906108c SS |
455 | { |
456 | SAVED_BF_PTR new; | |
c5aa993b | 457 | |
c906108c | 458 | new = (SAVED_BF_PTR) xmalloc (sizeof (SAVED_BF)); |
c5aa993b | 459 | return (new); |
c906108c SS |
460 | } |
461 | ||
462 | static SAVED_FUNCTION * | |
fba45db2 | 463 | allocate_saved_function_node (void) |
c906108c SS |
464 | { |
465 | SAVED_FUNCTION *new; | |
c5aa993b | 466 | |
c906108c | 467 | new = (SAVED_FUNCTION *) xmalloc (sizeof (SAVED_FUNCTION)); |
c5aa993b | 468 | return (new); |
c906108c SS |
469 | } |
470 | ||
c5aa993b | 471 | static SAVED_F77_COMMON_PTR |
fba45db2 | 472 | allocate_saved_f77_common_node (void) |
c906108c SS |
473 | { |
474 | SAVED_F77_COMMON_PTR new; | |
c5aa993b | 475 | |
c906108c | 476 | new = (SAVED_F77_COMMON_PTR) xmalloc (sizeof (SAVED_F77_COMMON)); |
c5aa993b | 477 | return (new); |
c906108c SS |
478 | } |
479 | ||
c5aa993b | 480 | static COMMON_ENTRY_PTR |
fba45db2 | 481 | allocate_common_entry_node (void) |
c906108c SS |
482 | { |
483 | COMMON_ENTRY_PTR new; | |
c5aa993b | 484 | |
c906108c | 485 | new = (COMMON_ENTRY_PTR) xmalloc (sizeof (COMMON_ENTRY)); |
c5aa993b | 486 | return (new); |
c906108c SS |
487 | } |
488 | #endif | |
489 | ||
c5aa993b JM |
490 | SAVED_F77_COMMON_PTR head_common_list = NULL; /* Ptr to 1st saved COMMON */ |
491 | SAVED_F77_COMMON_PTR tail_common_list = NULL; /* Ptr to last saved COMMON */ | |
492 | SAVED_F77_COMMON_PTR current_common = NULL; /* Ptr to current COMMON */ | |
c906108c SS |
493 | |
494 | #if 0 | |
c5aa993b JM |
495 | static SAVED_BF_PTR saved_bf_list = NULL; /* Ptr to (.bf,function) |
496 | list */ | |
497 | static SAVED_BF_PTR saved_bf_list_end = NULL; /* Ptr to above list's end */ | |
498 | static SAVED_BF_PTR current_head_bf_list = NULL; /* Current head of above list | |
499 | */ | |
c906108c | 500 | |
c5aa993b JM |
501 | static SAVED_BF_PTR tmp_bf_ptr; /* Generic temporary for use |
502 | in macros */ | |
c906108c SS |
503 | |
504 | /* The following function simply enters a given common block onto | |
505 | the global common block chain */ | |
506 | ||
507 | static void | |
fba45db2 | 508 | add_common_block (char *name, CORE_ADDR offset, int secnum, char *func_stab) |
c906108c SS |
509 | { |
510 | SAVED_F77_COMMON_PTR tmp; | |
c5aa993b JM |
511 | char *c, *local_copy_func_stab; |
512 | ||
c906108c SS |
513 | /* If the COMMON block we are trying to add has a blank |
514 | name (i.e. "#BLNK_COM") then we set it to __BLANK | |
515 | because the darn "#" character makes GDB's input | |
c5aa993b JM |
516 | parser have fits. */ |
517 | ||
518 | ||
6314a349 AC |
519 | if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0 |
520 | || strcmp (name, BLANK_COMMON_NAME_MF77) == 0) | |
c906108c | 521 | { |
c5aa993b | 522 | |
b8c9b27d | 523 | xfree (name); |
c5aa993b JM |
524 | name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1); |
525 | strcpy (name, BLANK_COMMON_NAME_LOCAL); | |
c906108c | 526 | } |
c5aa993b JM |
527 | |
528 | tmp = allocate_saved_f77_common_node (); | |
529 | ||
530 | local_copy_func_stab = xmalloc (strlen (func_stab) + 1); | |
531 | strcpy (local_copy_func_stab, func_stab); | |
532 | ||
533 | tmp->name = xmalloc (strlen (name) + 1); | |
534 | ||
c906108c | 535 | /* local_copy_func_stab is a stabstring, let us first extract the |
c5aa993b JM |
536 | function name from the stab by NULLing out the ':' character. */ |
537 | ||
538 | ||
539 | c = NULL; | |
540 | c = strchr (local_copy_func_stab, ':'); | |
541 | ||
c906108c SS |
542 | if (c) |
543 | *c = '\0'; | |
544 | else | |
8a3fe4f8 | 545 | error (_("Malformed function STAB found in add_common_block()")); |
c5aa993b JM |
546 | |
547 | ||
548 | tmp->owning_function = xmalloc (strlen (local_copy_func_stab) + 1); | |
549 | ||
550 | strcpy (tmp->owning_function, local_copy_func_stab); | |
551 | ||
552 | strcpy (tmp->name, name); | |
553 | tmp->offset = offset; | |
c906108c SS |
554 | tmp->next = NULL; |
555 | tmp->entries = NULL; | |
c5aa993b JM |
556 | tmp->secnum = secnum; |
557 | ||
c906108c | 558 | current_common = tmp; |
c5aa993b | 559 | |
c906108c SS |
560 | if (head_common_list == NULL) |
561 | { | |
562 | head_common_list = tail_common_list = tmp; | |
563 | } | |
564 | else | |
565 | { | |
c5aa993b | 566 | tail_common_list->next = tmp; |
c906108c SS |
567 | tail_common_list = tmp; |
568 | } | |
569 | } | |
570 | #endif | |
571 | ||
572 | /* The following function simply enters a given common entry onto | |
c5aa993b | 573 | the "current_common" block that has been saved away. */ |
c906108c SS |
574 | |
575 | #if 0 | |
576 | static void | |
fba45db2 | 577 | add_common_entry (struct symbol *entry_sym_ptr) |
c906108c SS |
578 | { |
579 | COMMON_ENTRY_PTR tmp; | |
c5aa993b JM |
580 | |
581 | ||
582 | ||
c906108c SS |
583 | /* The order of this list is important, since |
584 | we expect the entries to appear in decl. | |
c5aa993b JM |
585 | order when we later issue "info common" calls */ |
586 | ||
587 | tmp = allocate_common_entry_node (); | |
588 | ||
c906108c SS |
589 | tmp->next = NULL; |
590 | tmp->symbol = entry_sym_ptr; | |
c5aa993b | 591 | |
c906108c | 592 | if (current_common == NULL) |
8a3fe4f8 | 593 | error (_("Attempt to add COMMON entry with no block open!")); |
c5aa993b | 594 | else |
c906108c SS |
595 | { |
596 | if (current_common->entries == NULL) | |
597 | { | |
598 | current_common->entries = tmp; | |
c5aa993b | 599 | current_common->end_of_entries = tmp; |
c906108c SS |
600 | } |
601 | else | |
602 | { | |
c5aa993b JM |
603 | current_common->end_of_entries->next = tmp; |
604 | current_common->end_of_entries = tmp; | |
c906108c SS |
605 | } |
606 | } | |
607 | } | |
608 | #endif | |
609 | ||
c5aa993b | 610 | /* This routine finds the first encountred COMMON block named "name" */ |
c906108c SS |
611 | |
612 | #if 0 | |
613 | static SAVED_F77_COMMON_PTR | |
fba45db2 | 614 | find_first_common_named (char *name) |
c906108c | 615 | { |
c5aa993b | 616 | |
c906108c | 617 | SAVED_F77_COMMON_PTR tmp; |
c5aa993b | 618 | |
c906108c | 619 | tmp = head_common_list; |
c5aa993b | 620 | |
c906108c SS |
621 | while (tmp != NULL) |
622 | { | |
6314a349 | 623 | if (strcmp (tmp->name, name) == 0) |
c5aa993b | 624 | return (tmp); |
c906108c SS |
625 | else |
626 | tmp = tmp->next; | |
627 | } | |
c5aa993b | 628 | return (NULL); |
c906108c SS |
629 | } |
630 | #endif | |
631 | ||
632 | /* This routine finds the first encountred COMMON block named "name" | |
c5aa993b | 633 | that belongs to function funcname */ |
c906108c | 634 | |
c5aa993b | 635 | SAVED_F77_COMMON_PTR |
fba45db2 | 636 | find_common_for_function (char *name, char *funcname) |
c906108c | 637 | { |
c5aa993b | 638 | |
c906108c | 639 | SAVED_F77_COMMON_PTR tmp; |
c5aa993b | 640 | |
c906108c | 641 | tmp = head_common_list; |
c5aa993b | 642 | |
c906108c SS |
643 | while (tmp != NULL) |
644 | { | |
7ecb6532 MD |
645 | if (strcmp (tmp->name, name) == 0 |
646 | && strcmp (tmp->owning_function, funcname) == 0) | |
c5aa993b | 647 | return (tmp); |
c906108c SS |
648 | else |
649 | tmp = tmp->next; | |
650 | } | |
c5aa993b | 651 | return (NULL); |
c906108c SS |
652 | } |
653 | ||
654 | ||
655 | #if 0 | |
656 | ||
657 | /* The following function is called to patch up the offsets | |
658 | for the statics contained in the COMMON block named | |
c5aa993b | 659 | "name." */ |
c906108c SS |
660 | |
661 | static void | |
fba45db2 | 662 | patch_common_entries (SAVED_F77_COMMON_PTR blk, CORE_ADDR offset, int secnum) |
c906108c SS |
663 | { |
664 | COMMON_ENTRY_PTR entry; | |
c5aa993b JM |
665 | |
666 | blk->offset = offset; /* Keep this around for future use. */ | |
667 | ||
c906108c | 668 | entry = blk->entries; |
c5aa993b | 669 | |
c906108c SS |
670 | while (entry != NULL) |
671 | { | |
c5aa993b | 672 | SYMBOL_VALUE (entry->symbol) += offset; |
c906108c | 673 | SYMBOL_SECTION (entry->symbol) = secnum; |
c5aa993b | 674 | |
c906108c SS |
675 | entry = entry->next; |
676 | } | |
c5aa993b | 677 | blk->secnum = secnum; |
c906108c SS |
678 | } |
679 | ||
680 | /* Patch all commons named "name" that need patching.Since COMMON | |
681 | blocks occur with relative infrequency, we simply do a linear scan on | |
682 | the name. Eventually, the best way to do this will be a | |
683 | hashed-lookup. Secnum is the section number for the .bss section | |
684 | (which is where common data lives). */ | |
685 | ||
686 | static void | |
fba45db2 | 687 | patch_all_commons_by_name (char *name, CORE_ADDR offset, int secnum) |
c906108c | 688 | { |
c5aa993b | 689 | |
c906108c | 690 | SAVED_F77_COMMON_PTR tmp; |
c5aa993b | 691 | |
c906108c SS |
692 | /* For blank common blocks, change the canonical reprsentation |
693 | of a blank name */ | |
c5aa993b | 694 | |
6314a349 AC |
695 | if (strcmp (name, BLANK_COMMON_NAME_ORIGINAL) == 0 |
696 | || strcmp (name, BLANK_COMMON_NAME_MF77) == 0) | |
c906108c | 697 | { |
b8c9b27d | 698 | xfree (name); |
c5aa993b JM |
699 | name = alloca (strlen (BLANK_COMMON_NAME_LOCAL) + 1); |
700 | strcpy (name, BLANK_COMMON_NAME_LOCAL); | |
c906108c | 701 | } |
c5aa993b | 702 | |
c906108c | 703 | tmp = head_common_list; |
c5aa993b | 704 | |
c906108c SS |
705 | while (tmp != NULL) |
706 | { | |
c5aa993b | 707 | if (COMMON_NEEDS_PATCHING (tmp)) |
6314a349 | 708 | if (strcmp (tmp->name, name) == 0) |
c5aa993b JM |
709 | patch_common_entries (tmp, offset, secnum); |
710 | ||
c906108c | 711 | tmp = tmp->next; |
c5aa993b | 712 | } |
c906108c SS |
713 | } |
714 | #endif | |
715 | ||
716 | /* This macro adds the symbol-number for the start of the function | |
717 | (the symbol number of the .bf) referenced by symnum_fcn to a | |
718 | list. This list, in reality should be a FIFO queue but since | |
719 | #line pragmas sometimes cause line ranges to get messed up | |
720 | we simply create a linear list. This list can then be searched | |
721 | first by a queueing algorithm and upon failure fall back to | |
c5aa993b | 722 | a linear scan. */ |
c906108c SS |
723 | |
724 | #if 0 | |
725 | #define ADD_BF_SYMNUM(bf_sym,fcn_sym) \ | |
726 | \ | |
727 | if (saved_bf_list == NULL) \ | |
728 | { \ | |
729 | tmp_bf_ptr = allocate_saved_bf_node(); \ | |
730 | \ | |
731 | tmp_bf_ptr->symnum_bf = (bf_sym); \ | |
732 | tmp_bf_ptr->symnum_fcn = (fcn_sym); \ | |
733 | tmp_bf_ptr->next = NULL; \ | |
734 | \ | |
735 | current_head_bf_list = saved_bf_list = tmp_bf_ptr; \ | |
736 | saved_bf_list_end = tmp_bf_ptr; \ | |
737 | } \ | |
738 | else \ | |
739 | { \ | |
740 | tmp_bf_ptr = allocate_saved_bf_node(); \ | |
741 | \ | |
742 | tmp_bf_ptr->symnum_bf = (bf_sym); \ | |
743 | tmp_bf_ptr->symnum_fcn = (fcn_sym); \ | |
744 | tmp_bf_ptr->next = NULL; \ | |
745 | \ | |
746 | saved_bf_list_end->next = tmp_bf_ptr; \ | |
747 | saved_bf_list_end = tmp_bf_ptr; \ | |
c5aa993b | 748 | } |
c906108c SS |
749 | #endif |
750 | ||
c5aa993b | 751 | /* This function frees the entire (.bf,function) list */ |
c906108c SS |
752 | |
753 | #if 0 | |
c5aa993b | 754 | static void |
fba45db2 | 755 | clear_bf_list (void) |
c906108c | 756 | { |
c5aa993b | 757 | |
c906108c | 758 | SAVED_BF_PTR tmp = saved_bf_list; |
c5aa993b JM |
759 | SAVED_BF_PTR next = NULL; |
760 | ||
c906108c SS |
761 | while (tmp != NULL) |
762 | { | |
763 | next = tmp->next; | |
b8c9b27d | 764 | xfree (tmp); |
c5aa993b | 765 | tmp = next; |
c906108c SS |
766 | } |
767 | saved_bf_list = NULL; | |
768 | } | |
769 | #endif | |
770 | ||
771 | int global_remote_debug; | |
772 | ||
773 | #if 0 | |
774 | ||
775 | static long | |
fba45db2 | 776 | get_bf_for_fcn (long the_function) |
c906108c SS |
777 | { |
778 | SAVED_BF_PTR tmp; | |
779 | int nprobes = 0; | |
c5aa993b | 780 | |
c906108c SS |
781 | /* First use a simple queuing algorithm (i.e. look and see if the |
782 | item at the head of the queue is the one you want) */ | |
c5aa993b | 783 | |
c906108c | 784 | if (saved_bf_list == NULL) |
8e65ff28 | 785 | internal_error (__FILE__, __LINE__, |
e2e0b3e5 | 786 | _("cannot get .bf node off empty list")); |
c5aa993b JM |
787 | |
788 | if (current_head_bf_list != NULL) | |
c906108c SS |
789 | if (current_head_bf_list->symnum_fcn == the_function) |
790 | { | |
c5aa993b | 791 | if (global_remote_debug) |
dac8068e | 792 | fprintf_unfiltered (gdb_stderr, "*"); |
c906108c | 793 | |
c5aa993b | 794 | tmp = current_head_bf_list; |
c906108c | 795 | current_head_bf_list = current_head_bf_list->next; |
c5aa993b | 796 | return (tmp->symnum_bf); |
c906108c | 797 | } |
c5aa993b | 798 | |
c906108c SS |
799 | /* If the above did not work (probably because #line directives were |
800 | used in the sourcefile and they messed up our internal tables) we now do | |
801 | the ugly linear scan */ | |
c5aa993b JM |
802 | |
803 | if (global_remote_debug) | |
dac8068e | 804 | fprintf_unfiltered (gdb_stderr, "\ndefaulting to linear scan\n"); |
c5aa993b JM |
805 | |
806 | nprobes = 0; | |
c906108c SS |
807 | tmp = saved_bf_list; |
808 | while (tmp != NULL) | |
809 | { | |
c5aa993b | 810 | nprobes++; |
c906108c | 811 | if (tmp->symnum_fcn == the_function) |
c5aa993b | 812 | { |
c906108c | 813 | if (global_remote_debug) |
dac8068e | 814 | fprintf_unfiltered (gdb_stderr, "Found in %d probes\n", nprobes); |
c906108c | 815 | current_head_bf_list = tmp->next; |
c5aa993b JM |
816 | return (tmp->symnum_bf); |
817 | } | |
818 | tmp = tmp->next; | |
c906108c | 819 | } |
c5aa993b JM |
820 | |
821 | return (-1); | |
c906108c SS |
822 | } |
823 | ||
c5aa993b JM |
824 | static SAVED_FUNCTION_PTR saved_function_list = NULL; |
825 | static SAVED_FUNCTION_PTR saved_function_list_end = NULL; | |
c906108c SS |
826 | |
827 | static void | |
fba45db2 | 828 | clear_function_list (void) |
c906108c SS |
829 | { |
830 | SAVED_FUNCTION_PTR tmp = saved_function_list; | |
c5aa993b JM |
831 | SAVED_FUNCTION_PTR next = NULL; |
832 | ||
c906108c SS |
833 | while (tmp != NULL) |
834 | { | |
835 | next = tmp->next; | |
b8c9b27d | 836 | xfree (tmp); |
c906108c SS |
837 | tmp = next; |
838 | } | |
c5aa993b | 839 | |
c906108c SS |
840 | saved_function_list = NULL; |
841 | } | |
842 | #endif |