Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Support for printing Fortran values for GDB, the GNU debugger. |
a2bd3dcd | 2 | |
6aba47ca | 3 | Copyright (C) 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2003, 2005, 2006, |
7b6bb8da | 4 | 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc. |
a2bd3dcd | 5 | |
c906108c SS |
6 | Contributed by Motorola. Adapted from the C definitions by Farooq Butt |
7 | (fmbutt@engage.sps.mot.com), additionally worked over by Stan Shebs. | |
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 "value.h" | |
c906108c SS |
30 | #include "valprint.h" |
31 | #include "language.h" | |
c5aa993b | 32 | #include "f-lang.h" |
c906108c SS |
33 | #include "frame.h" |
34 | #include "gdbcore.h" | |
35 | #include "command.h" | |
fe898f56 | 36 | #include "block.h" |
c906108c SS |
37 | |
38 | #if 0 | |
a14ed312 | 39 | static int there_is_a_visible_common_named (char *); |
c906108c SS |
40 | #endif |
41 | ||
a14ed312 KB |
42 | extern void _initialize_f_valprint (void); |
43 | static void info_common_command (char *, int); | |
44 | static void list_all_visible_commons (char *); | |
d9fcf2fb JM |
45 | static void f77_create_arrayprint_offset_tbl (struct type *, |
46 | struct ui_file *); | |
a14ed312 | 47 | static void f77_get_dynamic_length_of_aggregate (struct type *); |
c906108c | 48 | |
c5aa993b | 49 | int f77_array_offset_tbl[MAX_FORTRAN_DIMS + 1][2]; |
c906108c SS |
50 | |
51 | /* Array which holds offsets to be applied to get a row's elements | |
0963b4bd | 52 | for a given array. Array also holds the size of each subarray. */ |
c906108c SS |
53 | |
54 | /* The following macro gives us the size of the nth dimension, Where | |
0963b4bd | 55 | n is 1 based. */ |
c906108c SS |
56 | |
57 | #define F77_DIM_SIZE(n) (f77_array_offset_tbl[n][1]) | |
58 | ||
0963b4bd | 59 | /* The following gives us the offset for row n where n is 1-based. */ |
c906108c SS |
60 | |
61 | #define F77_DIM_OFFSET(n) (f77_array_offset_tbl[n][0]) | |
62 | ||
c5aa993b | 63 | int |
d78df370 | 64 | f77_get_lowerbound (struct type *type) |
c906108c | 65 | { |
d78df370 JK |
66 | if (TYPE_ARRAY_LOWER_BOUND_IS_UNDEFINED (type)) |
67 | error (_("Lower bound may not be '*' in F77")); | |
c5aa993b | 68 | |
d78df370 | 69 | return TYPE_ARRAY_LOWER_BOUND_VALUE (type); |
c906108c SS |
70 | } |
71 | ||
c5aa993b | 72 | int |
d78df370 | 73 | f77_get_upperbound (struct type *type) |
c906108c | 74 | { |
d78df370 | 75 | if (TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type)) |
c906108c | 76 | { |
d78df370 JK |
77 | /* We have an assumed size array on our hands. Assume that |
78 | upper_bound == lower_bound so that we show at least 1 element. | |
79 | If the user wants to see more elements, let him manually ask for 'em | |
80 | and we'll subscript the array and show him. */ | |
81 | ||
82 | return f77_get_lowerbound (type); | |
c906108c | 83 | } |
d78df370 JK |
84 | |
85 | return TYPE_ARRAY_UPPER_BOUND_VALUE (type); | |
c906108c SS |
86 | } |
87 | ||
0963b4bd | 88 | /* Obtain F77 adjustable array dimensions. */ |
c906108c SS |
89 | |
90 | static void | |
fba45db2 | 91 | f77_get_dynamic_length_of_aggregate (struct type *type) |
c906108c SS |
92 | { |
93 | int upper_bound = -1; | |
c5aa993b | 94 | int lower_bound = 1; |
c5aa993b | 95 | |
c906108c SS |
96 | /* Recursively go all the way down into a possibly multi-dimensional |
97 | F77 array and get the bounds. For simple arrays, this is pretty | |
98 | easy but when the bounds are dynamic, we must be very careful | |
99 | to add up all the lengths correctly. Not doing this right | |
100 | will lead to horrendous-looking arrays in parameter lists. | |
c5aa993b | 101 | |
c906108c | 102 | This function also works for strings which behave very |
c5aa993b JM |
103 | similarly to arrays. */ |
104 | ||
105 | if (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY | |
106 | || TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_STRING) | |
c906108c | 107 | f77_get_dynamic_length_of_aggregate (TYPE_TARGET_TYPE (type)); |
c5aa993b JM |
108 | |
109 | /* Recursion ends here, start setting up lengths. */ | |
d78df370 JK |
110 | lower_bound = f77_get_lowerbound (type); |
111 | upper_bound = f77_get_upperbound (type); | |
c5aa993b | 112 | |
0963b4bd | 113 | /* Patch in a valid length value. */ |
c5aa993b | 114 | |
c906108c | 115 | TYPE_LENGTH (type) = |
3e43a32a MS |
116 | (upper_bound - lower_bound + 1) |
117 | * TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type))); | |
c5aa993b | 118 | } |
c906108c SS |
119 | |
120 | /* Function that sets up the array offset,size table for the array | |
c5aa993b | 121 | type "type". */ |
c906108c | 122 | |
c5aa993b | 123 | static void |
fba45db2 | 124 | f77_create_arrayprint_offset_tbl (struct type *type, struct ui_file *stream) |
c906108c SS |
125 | { |
126 | struct type *tmp_type; | |
127 | int eltlen; | |
128 | int ndimen = 1; | |
9216103f | 129 | int upper, lower; |
c5aa993b JM |
130 | |
131 | tmp_type = type; | |
132 | ||
133 | while ((TYPE_CODE (tmp_type) == TYPE_CODE_ARRAY)) | |
c906108c | 134 | { |
d78df370 JK |
135 | upper = f77_get_upperbound (tmp_type); |
136 | lower = f77_get_lowerbound (tmp_type); | |
c5aa993b | 137 | |
c906108c | 138 | F77_DIM_SIZE (ndimen) = upper - lower + 1; |
c5aa993b | 139 | |
c906108c | 140 | tmp_type = TYPE_TARGET_TYPE (tmp_type); |
c5aa993b | 141 | ndimen++; |
c906108c | 142 | } |
c5aa993b | 143 | |
c906108c SS |
144 | /* Now we multiply eltlen by all the offsets, so that later we |
145 | can print out array elements correctly. Up till now we | |
146 | know an offset to apply to get the item but we also | |
0963b4bd | 147 | have to know how much to add to get to the next item. */ |
c5aa993b | 148 | |
c906108c | 149 | ndimen--; |
c5aa993b | 150 | eltlen = TYPE_LENGTH (tmp_type); |
c906108c SS |
151 | F77_DIM_OFFSET (ndimen) = eltlen; |
152 | while (--ndimen > 0) | |
153 | { | |
154 | eltlen *= F77_DIM_SIZE (ndimen + 1); | |
155 | F77_DIM_OFFSET (ndimen) = eltlen; | |
156 | } | |
157 | } | |
158 | ||
b3cacbee DL |
159 | |
160 | ||
c906108c SS |
161 | /* Actual function which prints out F77 arrays, Valaddr == address in |
162 | the superior. Address == the address in the inferior. */ | |
7b0090c3 | 163 | |
c5aa993b | 164 | static void |
a2bd3dcd | 165 | f77_print_array_1 (int nss, int ndimensions, struct type *type, |
fc1a4b47 | 166 | const gdb_byte *valaddr, CORE_ADDR address, |
79a45b7d | 167 | struct ui_file *stream, int recurse, |
0e03807e | 168 | const struct value *val, |
79a45b7d | 169 | const struct value_print_options *options, |
b3cacbee | 170 | int *elts) |
c906108c SS |
171 | { |
172 | int i; | |
c5aa993b | 173 | |
c906108c SS |
174 | if (nss != ndimensions) |
175 | { | |
3e43a32a MS |
176 | for (i = 0; |
177 | (i < F77_DIM_SIZE (nss) && (*elts) < options->print_max); | |
178 | i++) | |
c906108c SS |
179 | { |
180 | fprintf_filtered (stream, "( "); | |
181 | f77_print_array_1 (nss + 1, ndimensions, TYPE_TARGET_TYPE (type), | |
c5aa993b JM |
182 | valaddr + i * F77_DIM_OFFSET (nss), |
183 | address + i * F77_DIM_OFFSET (nss), | |
0e03807e | 184 | stream, recurse, val, options, elts); |
c906108c SS |
185 | fprintf_filtered (stream, ") "); |
186 | } | |
79a45b7d | 187 | if (*elts >= options->print_max && i < F77_DIM_SIZE (nss)) |
b3cacbee | 188 | fprintf_filtered (stream, "..."); |
c906108c SS |
189 | } |
190 | else | |
191 | { | |
79a45b7d | 192 | for (i = 0; i < F77_DIM_SIZE (nss) && (*elts) < options->print_max; |
7b0090c3 | 193 | i++, (*elts)++) |
c906108c SS |
194 | { |
195 | val_print (TYPE_TARGET_TYPE (type), | |
196 | valaddr + i * F77_DIM_OFFSET (ndimensions), | |
c5aa993b | 197 | 0, |
c906108c | 198 | address + i * F77_DIM_OFFSET (ndimensions), |
0e03807e | 199 | stream, recurse, val, options, current_language); |
c906108c SS |
200 | |
201 | if (i != (F77_DIM_SIZE (nss) - 1)) | |
c5aa993b JM |
202 | fprintf_filtered (stream, ", "); |
203 | ||
79a45b7d TT |
204 | if ((*elts == options->print_max - 1) |
205 | && (i != (F77_DIM_SIZE (nss) - 1))) | |
c906108c SS |
206 | fprintf_filtered (stream, "..."); |
207 | } | |
208 | } | |
209 | } | |
210 | ||
211 | /* This function gets called to print an F77 array, we set up some | |
0963b4bd | 212 | stuff and then immediately call f77_print_array_1(). */ |
c906108c | 213 | |
c5aa993b | 214 | static void |
fc1a4b47 | 215 | f77_print_array (struct type *type, const gdb_byte *valaddr, |
a2bd3dcd | 216 | CORE_ADDR address, struct ui_file *stream, |
0e03807e TT |
217 | int recurse, |
218 | const struct value *val, | |
219 | const struct value_print_options *options) | |
c906108c | 220 | { |
c5aa993b | 221 | int ndimensions; |
b3cacbee | 222 | int elts = 0; |
c5aa993b JM |
223 | |
224 | ndimensions = calc_f77_array_dims (type); | |
225 | ||
c906108c | 226 | if (ndimensions > MAX_FORTRAN_DIMS || ndimensions < 0) |
3e43a32a MS |
227 | error (_("\ |
228 | Type node corrupt! F77 arrays cannot have %d subscripts (%d Max)"), | |
c906108c | 229 | ndimensions, MAX_FORTRAN_DIMS); |
c5aa993b | 230 | |
c906108c | 231 | /* Since F77 arrays are stored column-major, we set up an |
0963b4bd MS |
232 | offset table to get at the various row's elements. The |
233 | offset table contains entries for both offset and subarray size. */ | |
c906108c | 234 | |
c5aa993b JM |
235 | f77_create_arrayprint_offset_tbl (type, stream); |
236 | ||
79a45b7d | 237 | f77_print_array_1 (1, ndimensions, type, valaddr, address, stream, |
0e03807e | 238 | recurse, val, options, &elts); |
c5aa993b | 239 | } |
c906108c | 240 | \f |
c5aa993b | 241 | |
c906108c SS |
242 | /* Print data of type TYPE located at VALADDR (within GDB), which came from |
243 | the inferior at address ADDRESS, onto stdio stream STREAM according to | |
79a45b7d | 244 | OPTIONS. The data at VALADDR is in target byte order. |
c5aa993b | 245 | |
c906108c | 246 | If the data are a string pointer, returns the number of string characters |
79a45b7d | 247 | printed. */ |
c906108c SS |
248 | |
249 | int | |
fc1a4b47 | 250 | f_val_print (struct type *type, const gdb_byte *valaddr, int embedded_offset, |
79a45b7d | 251 | CORE_ADDR address, struct ui_file *stream, int recurse, |
0e03807e | 252 | const struct value *original_value, |
79a45b7d | 253 | const struct value_print_options *options) |
c906108c | 254 | { |
50810684 | 255 | struct gdbarch *gdbarch = get_type_arch (type); |
e17a4113 | 256 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); |
0963b4bd | 257 | unsigned int i = 0; /* Number of characters printed. */ |
c906108c SS |
258 | struct type *elttype; |
259 | LONGEST val; | |
260 | CORE_ADDR addr; | |
2a5e440c | 261 | int index; |
c5aa993b | 262 | |
c906108c SS |
263 | CHECK_TYPEDEF (type); |
264 | switch (TYPE_CODE (type)) | |
265 | { | |
c5aa993b | 266 | case TYPE_CODE_STRING: |
c906108c | 267 | f77_get_dynamic_length_of_aggregate (type); |
50810684 | 268 | LA_PRINT_STRING (stream, builtin_type (gdbarch)->builtin_char, |
be759fcf | 269 | valaddr, TYPE_LENGTH (type), NULL, 0, options); |
c906108c | 270 | break; |
c5aa993b | 271 | |
c906108c | 272 | case TYPE_CODE_ARRAY: |
c5aa993b | 273 | fprintf_filtered (stream, "("); |
3e43a32a MS |
274 | f77_print_array (type, valaddr, address, stream, |
275 | recurse, original_value, options); | |
c906108c SS |
276 | fprintf_filtered (stream, ")"); |
277 | break; | |
7e86466e | 278 | |
c906108c | 279 | case TYPE_CODE_PTR: |
79a45b7d | 280 | if (options->format && options->format != 's') |
c906108c | 281 | { |
79a45b7d | 282 | print_scalar_formatted (valaddr, type, options, 0, stream); |
c906108c SS |
283 | break; |
284 | } | |
285 | else | |
286 | { | |
287 | addr = unpack_pointer (type, valaddr); | |
288 | elttype = check_typedef (TYPE_TARGET_TYPE (type)); | |
c5aa993b | 289 | |
c906108c SS |
290 | if (TYPE_CODE (elttype) == TYPE_CODE_FUNC) |
291 | { | |
292 | /* Try to print what function it points to. */ | |
5af949e3 | 293 | print_address_demangle (gdbarch, addr, stream, demangle); |
c906108c SS |
294 | /* Return value is irrelevant except for string pointers. */ |
295 | return 0; | |
296 | } | |
c5aa993b | 297 | |
79a45b7d | 298 | if (options->addressprint && options->format != 's') |
5af949e3 | 299 | fputs_filtered (paddress (gdbarch, addr), stream); |
c5aa993b | 300 | |
c906108c SS |
301 | /* For a pointer to char or unsigned char, also print the string |
302 | pointed to, unless pointer is null. */ | |
303 | if (TYPE_LENGTH (elttype) == 1 | |
304 | && TYPE_CODE (elttype) == TYPE_CODE_INT | |
79a45b7d | 305 | && (options->format == 0 || options->format == 's') |
c906108c | 306 | && addr != 0) |
09ca9e2e TT |
307 | i = val_print_string (TYPE_TARGET_TYPE (type), NULL, addr, -1, |
308 | stream, options); | |
c5aa993b | 309 | |
7e86466e RH |
310 | /* Return number of characters printed, including the terminating |
311 | '\0' if we reached the end. val_print_string takes care including | |
312 | the terminating '\0' if necessary. */ | |
313 | return i; | |
314 | } | |
315 | break; | |
316 | ||
317 | case TYPE_CODE_REF: | |
318 | elttype = check_typedef (TYPE_TARGET_TYPE (type)); | |
79a45b7d | 319 | if (options->addressprint) |
7e86466e RH |
320 | { |
321 | CORE_ADDR addr | |
322 | = extract_typed_address (valaddr + embedded_offset, type); | |
bb9bcb69 | 323 | |
7e86466e | 324 | fprintf_filtered (stream, "@"); |
5af949e3 | 325 | fputs_filtered (paddress (gdbarch, addr), stream); |
79a45b7d | 326 | if (options->deref_ref) |
7e86466e RH |
327 | fputs_filtered (": ", stream); |
328 | } | |
329 | /* De-reference the reference. */ | |
79a45b7d | 330 | if (options->deref_ref) |
7e86466e RH |
331 | { |
332 | if (TYPE_CODE (elttype) != TYPE_CODE_UNDEF) | |
333 | { | |
334 | struct value *deref_val = | |
bb9bcb69 MS |
335 | value_at |
336 | (TYPE_TARGET_TYPE (type), | |
337 | unpack_pointer (type, valaddr + embedded_offset)); | |
338 | ||
79a45b7d TT |
339 | common_val_print (deref_val, stream, recurse, |
340 | options, current_language); | |
7e86466e RH |
341 | } |
342 | else | |
343 | fputs_filtered ("???", stream); | |
c906108c SS |
344 | } |
345 | break; | |
c5aa993b | 346 | |
c906108c | 347 | case TYPE_CODE_FUNC: |
79a45b7d | 348 | if (options->format) |
c906108c | 349 | { |
79a45b7d | 350 | print_scalar_formatted (valaddr, type, options, 0, stream); |
c906108c SS |
351 | break; |
352 | } | |
353 | /* FIXME, we should consider, at least for ANSI C language, eliminating | |
c5aa993b | 354 | the distinction made between FUNCs and POINTERs to FUNCs. */ |
c906108c SS |
355 | fprintf_filtered (stream, "{"); |
356 | type_print (type, "", stream, -1); | |
357 | fprintf_filtered (stream, "} "); | |
358 | /* Try to print what function it points to, and its address. */ | |
5af949e3 | 359 | print_address_demangle (gdbarch, address, stream, demangle); |
c906108c | 360 | break; |
c5aa993b | 361 | |
c906108c | 362 | case TYPE_CODE_INT: |
79a45b7d TT |
363 | if (options->format || options->output_format) |
364 | { | |
365 | struct value_print_options opts = *options; | |
bb9bcb69 | 366 | |
79a45b7d TT |
367 | opts.format = (options->format ? options->format |
368 | : options->output_format); | |
369 | print_scalar_formatted (valaddr, type, &opts, 0, stream); | |
370 | } | |
c906108c SS |
371 | else |
372 | { | |
373 | val_print_type_code_int (type, valaddr, stream); | |
374 | /* C and C++ has no single byte int type, char is used instead. | |
375 | Since we don't know whether the value is really intended to | |
376 | be used as an integer or a character, print the character | |
0963b4bd | 377 | equivalent as well. */ |
c906108c SS |
378 | if (TYPE_LENGTH (type) == 1) |
379 | { | |
380 | fputs_filtered (" ", stream); | |
381 | LA_PRINT_CHAR ((unsigned char) unpack_long (type, valaddr), | |
6c7a06a3 | 382 | type, stream); |
c906108c SS |
383 | } |
384 | } | |
385 | break; | |
c5aa993b | 386 | |
4f2aea11 | 387 | case TYPE_CODE_FLAGS: |
79a45b7d TT |
388 | if (options->format) |
389 | print_scalar_formatted (valaddr, type, options, 0, stream); | |
4f2aea11 MK |
390 | else |
391 | val_print_type_code_flags (type, valaddr, stream); | |
392 | break; | |
393 | ||
c906108c | 394 | case TYPE_CODE_FLT: |
79a45b7d TT |
395 | if (options->format) |
396 | print_scalar_formatted (valaddr, type, options, 0, stream); | |
c906108c SS |
397 | else |
398 | print_floating (valaddr, type, stream); | |
399 | break; | |
c5aa993b | 400 | |
c906108c SS |
401 | case TYPE_CODE_VOID: |
402 | fprintf_filtered (stream, "VOID"); | |
403 | break; | |
c5aa993b | 404 | |
c906108c | 405 | case TYPE_CODE_ERROR: |
b00fdb78 | 406 | fprintf_filtered (stream, "%s", TYPE_ERROR_NAME (type)); |
c906108c | 407 | break; |
c5aa993b | 408 | |
c906108c SS |
409 | case TYPE_CODE_RANGE: |
410 | /* FIXME, we should not ever have to print one of these yet. */ | |
411 | fprintf_filtered (stream, "<range type>"); | |
412 | break; | |
c5aa993b | 413 | |
c906108c | 414 | case TYPE_CODE_BOOL: |
79a45b7d TT |
415 | if (options->format || options->output_format) |
416 | { | |
417 | struct value_print_options opts = *options; | |
bb9bcb69 | 418 | |
79a45b7d TT |
419 | opts.format = (options->format ? options->format |
420 | : options->output_format); | |
421 | print_scalar_formatted (valaddr, type, &opts, 0, stream); | |
422 | } | |
c906108c SS |
423 | else |
424 | { | |
e17a4113 UW |
425 | val = extract_unsigned_integer (valaddr, |
426 | TYPE_LENGTH (type), byte_order); | |
c5aa993b | 427 | if (val == 0) |
c906108c | 428 | fprintf_filtered (stream, ".FALSE."); |
c5aa993b JM |
429 | else if (val == 1) |
430 | fprintf_filtered (stream, ".TRUE."); | |
431 | else | |
432 | /* Not a legitimate logical type, print as an integer. */ | |
433 | { | |
434 | /* Bash the type code temporarily. */ | |
435 | TYPE_CODE (type) = TYPE_CODE_INT; | |
0e03807e TT |
436 | val_print (type, valaddr, 0, address, stream, recurse, |
437 | original_value, options, current_language); | |
0963b4bd | 438 | /* Restore the type code so later uses work as intended. */ |
c5aa993b JM |
439 | TYPE_CODE (type) = TYPE_CODE_BOOL; |
440 | } | |
c906108c SS |
441 | } |
442 | break; | |
c5aa993b | 443 | |
c906108c | 444 | case TYPE_CODE_COMPLEX: |
b806fb9a | 445 | type = TYPE_TARGET_TYPE (type); |
c906108c SS |
446 | fputs_filtered ("(", stream); |
447 | print_floating (valaddr, type, stream); | |
448 | fputs_filtered (",", stream); | |
9af97293 | 449 | print_floating (valaddr + TYPE_LENGTH (type), type, stream); |
c906108c SS |
450 | fputs_filtered (")", stream); |
451 | break; | |
c5aa993b | 452 | |
c906108c SS |
453 | case TYPE_CODE_UNDEF: |
454 | /* This happens (without TYPE_FLAG_STUB set) on systems which don't use | |
c5aa993b JM |
455 | dbx xrefs (NO_DBX_XREFS in gcc) if a file has a "struct foo *bar" |
456 | and no complete type for struct foo in that file. */ | |
c906108c SS |
457 | fprintf_filtered (stream, "<incomplete type>"); |
458 | break; | |
c5aa993b | 459 | |
2a5e440c | 460 | case TYPE_CODE_STRUCT: |
9eec4d1e | 461 | case TYPE_CODE_UNION: |
2a5e440c WZ |
462 | /* Starting from the Fortran 90 standard, Fortran supports derived |
463 | types. */ | |
9eec4d1e | 464 | fprintf_filtered (stream, "( "); |
2a5e440c WZ |
465 | for (index = 0; index < TYPE_NFIELDS (type); index++) |
466 | { | |
467 | int offset = TYPE_FIELD_BITPOS (type, index) / 8; | |
bb9bcb69 | 468 | |
0e03807e TT |
469 | val_print (TYPE_FIELD_TYPE (type, index), valaddr + offset, |
470 | embedded_offset, address, stream, recurse + 1, | |
471 | original_value, options, current_language); | |
2a5e440c WZ |
472 | if (index != TYPE_NFIELDS (type) - 1) |
473 | fputs_filtered (", ", stream); | |
474 | } | |
9eec4d1e | 475 | fprintf_filtered (stream, " )"); |
2a5e440c WZ |
476 | break; |
477 | ||
c906108c | 478 | default: |
8a3fe4f8 | 479 | error (_("Invalid F77 type code %d in symbol table."), TYPE_CODE (type)); |
c906108c SS |
480 | } |
481 | gdb_flush (stream); | |
482 | return 0; | |
483 | } | |
484 | ||
485 | static void | |
fba45db2 | 486 | list_all_visible_commons (char *funname) |
c906108c | 487 | { |
c5aa993b JM |
488 | SAVED_F77_COMMON_PTR tmp; |
489 | ||
c906108c | 490 | tmp = head_common_list; |
c5aa993b | 491 | |
a3f17187 | 492 | printf_filtered (_("All COMMON blocks visible at this level:\n\n")); |
c5aa993b | 493 | |
c906108c SS |
494 | while (tmp != NULL) |
495 | { | |
762f08a3 | 496 | if (strcmp (tmp->owning_function, funname) == 0) |
c5aa993b JM |
497 | printf_filtered ("%s\n", tmp->name); |
498 | ||
c906108c SS |
499 | tmp = tmp->next; |
500 | } | |
501 | } | |
502 | ||
503 | /* This function is used to print out the values in a given COMMON | |
0963b4bd MS |
504 | block. It will always use the most local common block of the |
505 | given name. */ | |
c906108c | 506 | |
c5aa993b | 507 | static void |
fba45db2 | 508 | info_common_command (char *comname, int from_tty) |
c906108c | 509 | { |
c5aa993b JM |
510 | SAVED_F77_COMMON_PTR the_common; |
511 | COMMON_ENTRY_PTR entry; | |
c906108c | 512 | struct frame_info *fi; |
52f0bd74 | 513 | char *funname = 0; |
c906108c | 514 | struct symbol *func; |
c5aa993b | 515 | |
c906108c SS |
516 | /* We have been told to display the contents of F77 COMMON |
517 | block supposedly visible in this function. Let us | |
518 | first make sure that it is visible and if so, let | |
0963b4bd | 519 | us display its contents. */ |
c5aa993b | 520 | |
206415a3 | 521 | fi = get_selected_frame (_("No frame selected")); |
c5aa993b | 522 | |
c906108c | 523 | /* The following is generally ripped off from stack.c's routine |
0963b4bd | 524 | print_frame_info(). */ |
c5aa993b | 525 | |
bdd78e62 | 526 | func = find_pc_function (get_frame_pc (fi)); |
c906108c SS |
527 | if (func) |
528 | { | |
529 | /* In certain pathological cases, the symtabs give the wrong | |
c5aa993b JM |
530 | function (when we are in the first function in a file which |
531 | is compiled without debugging symbols, the previous function | |
532 | is compiled with debugging symbols, and the "foo.o" symbol | |
533 | that is supposed to tell us where the file with debugging symbols | |
534 | ends has been truncated by ar because it is longer than 15 | |
535 | characters). | |
536 | ||
537 | So look in the minimal symbol tables as well, and if it comes | |
538 | up with a larger address for the function use that instead. | |
539 | I don't think this can ever cause any problems; there shouldn't | |
540 | be any minimal symbols in the middle of a function. | |
0963b4bd | 541 | FIXME: (Not necessarily true. What about text labels?) */ |
c5aa993b | 542 | |
7c6e0d48 MS |
543 | struct minimal_symbol *msymbol = |
544 | lookup_minimal_symbol_by_pc (get_frame_pc (fi)); | |
c5aa993b | 545 | |
c906108c | 546 | if (msymbol != NULL |
c5aa993b | 547 | && (SYMBOL_VALUE_ADDRESS (msymbol) |
c906108c | 548 | > BLOCK_START (SYMBOL_BLOCK_VALUE (func)))) |
3567439c | 549 | funname = SYMBOL_LINKAGE_NAME (msymbol); |
c906108c | 550 | else |
3567439c | 551 | funname = SYMBOL_LINKAGE_NAME (func); |
c906108c SS |
552 | } |
553 | else | |
554 | { | |
aa1ee363 | 555 | struct minimal_symbol *msymbol = |
bb9bcb69 | 556 | lookup_minimal_symbol_by_pc (get_frame_pc (fi)); |
c5aa993b | 557 | |
c906108c | 558 | if (msymbol != NULL) |
3567439c | 559 | funname = SYMBOL_LINKAGE_NAME (msymbol); |
7c6e0d48 MS |
560 | else /* Got no 'funname', code below will fail. */ |
561 | error (_("No function found for frame.")); | |
c906108c | 562 | } |
c5aa993b | 563 | |
c906108c | 564 | /* If comname is NULL, we assume the user wishes to see the |
0963b4bd | 565 | which COMMON blocks are visible here and then return. */ |
c5aa993b | 566 | |
c906108c SS |
567 | if (comname == 0) |
568 | { | |
569 | list_all_visible_commons (funname); | |
c5aa993b | 570 | return; |
c906108c | 571 | } |
c5aa993b JM |
572 | |
573 | the_common = find_common_for_function (comname, funname); | |
574 | ||
c906108c SS |
575 | if (the_common) |
576 | { | |
762f08a3 | 577 | if (strcmp (comname, BLANK_COMMON_NAME_LOCAL) == 0) |
a3f17187 | 578 | printf_filtered (_("Contents of blank COMMON block:\n")); |
c5aa993b | 579 | else |
a3f17187 | 580 | printf_filtered (_("Contents of F77 COMMON block '%s':\n"), comname); |
c5aa993b JM |
581 | |
582 | printf_filtered ("\n"); | |
583 | entry = the_common->entries; | |
584 | ||
c906108c SS |
585 | while (entry != NULL) |
586 | { | |
aad95b57 | 587 | print_variable_and_value (NULL, entry->symbol, fi, gdb_stdout, 0); |
c5aa993b | 588 | entry = entry->next; |
c906108c SS |
589 | } |
590 | } | |
c5aa993b | 591 | else |
a3f17187 | 592 | printf_filtered (_("Cannot locate the common block %s in function '%s'\n"), |
c5aa993b | 593 | comname, funname); |
c906108c SS |
594 | } |
595 | ||
596 | /* This function is used to determine whether there is a | |
0963b4bd | 597 | F77 common block visible at the current scope called 'comname'. */ |
c906108c SS |
598 | |
599 | #if 0 | |
600 | static int | |
fba45db2 | 601 | there_is_a_visible_common_named (char *comname) |
c906108c | 602 | { |
c5aa993b | 603 | SAVED_F77_COMMON_PTR the_common; |
c906108c | 604 | struct frame_info *fi; |
52f0bd74 | 605 | char *funname = 0; |
c906108c | 606 | struct symbol *func; |
c5aa993b | 607 | |
c906108c | 608 | if (comname == NULL) |
8a3fe4f8 | 609 | error (_("Cannot deal with NULL common name!")); |
c5aa993b | 610 | |
206415a3 | 611 | fi = get_selected_frame (_("No frame selected")); |
c5aa993b | 612 | |
c906108c | 613 | /* The following is generally ripped off from stack.c's routine |
0963b4bd | 614 | print_frame_info(). */ |
c5aa993b | 615 | |
c906108c SS |
616 | func = find_pc_function (fi->pc); |
617 | if (func) | |
618 | { | |
619 | /* In certain pathological cases, the symtabs give the wrong | |
c5aa993b JM |
620 | function (when we are in the first function in a file which |
621 | is compiled without debugging symbols, the previous function | |
622 | is compiled with debugging symbols, and the "foo.o" symbol | |
623 | that is supposed to tell us where the file with debugging symbols | |
624 | ends has been truncated by ar because it is longer than 15 | |
625 | characters). | |
626 | ||
627 | So look in the minimal symbol tables as well, and if it comes | |
628 | up with a larger address for the function use that instead. | |
629 | I don't think this can ever cause any problems; there shouldn't | |
630 | be any minimal symbols in the middle of a function. | |
0963b4bd | 631 | FIXME: (Not necessarily true. What about text labels?) */ |
c5aa993b | 632 | |
c906108c | 633 | struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (fi->pc); |
c5aa993b | 634 | |
c906108c | 635 | if (msymbol != NULL |
c5aa993b | 636 | && (SYMBOL_VALUE_ADDRESS (msymbol) |
c906108c | 637 | > BLOCK_START (SYMBOL_BLOCK_VALUE (func)))) |
3567439c | 638 | funname = SYMBOL_LINKAGE_NAME (msymbol); |
c906108c | 639 | else |
3567439c | 640 | funname = SYMBOL_LINKAGE_NAME (func); |
c906108c SS |
641 | } |
642 | else | |
643 | { | |
aa1ee363 | 644 | struct minimal_symbol *msymbol = |
bb9bcb69 | 645 | lookup_minimal_symbol_by_pc (fi->pc); |
c5aa993b | 646 | |
c906108c | 647 | if (msymbol != NULL) |
3567439c | 648 | funname = SYMBOL_LINKAGE_NAME (msymbol); |
c906108c | 649 | } |
c5aa993b JM |
650 | |
651 | the_common = find_common_for_function (comname, funname); | |
652 | ||
c906108c SS |
653 | return (the_common ? 1 : 0); |
654 | } | |
655 | #endif | |
656 | ||
657 | void | |
fba45db2 | 658 | _initialize_f_valprint (void) |
c906108c SS |
659 | { |
660 | add_info ("common", info_common_command, | |
1bedd215 | 661 | _("Print out the values contained in a Fortran COMMON block.")); |
c906108c | 662 | if (xdb_commands) |
c5aa993b | 663 | add_com ("lc", class_info, info_common_command, |
1bedd215 | 664 | _("Print out the values contained in a Fortran COMMON block.")); |
c906108c | 665 | } |