doc/ChangeLog:
[deliverable/binutils-gdb.git] / gdb / f-valprint.c
CommitLineData
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,
9b254dd1 4 2007, 2008 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 39static int there_is_a_visible_common_named (char *);
c906108c
SS
40#endif
41
a14ed312
KB
42extern void _initialize_f_valprint (void);
43static void info_common_command (char *, int);
44static void list_all_visible_commons (char *);
d9fcf2fb
JM
45static void f77_create_arrayprint_offset_tbl (struct type *,
46 struct ui_file *);
a14ed312 47static void f77_get_dynamic_length_of_aggregate (struct type *);
c906108c 48
c5aa993b 49int 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
52 for a given array. Array also holds the size of each subarray. */
53
54/* The following macro gives us the size of the nth dimension, Where
c5aa993b 55 n is 1 based. */
c906108c
SS
56
57#define F77_DIM_SIZE(n) (f77_array_offset_tbl[n][1])
58
c5aa993b 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 63int
fba45db2 64f77_get_dynamic_lowerbound (struct type *type, int *lower_bound)
c906108c 65{
206415a3 66 struct frame_info *frame;
c5aa993b
JM
67 CORE_ADDR current_frame_addr;
68 CORE_ADDR ptr_to_lower_bound;
69
c906108c
SS
70 switch (TYPE_ARRAY_LOWER_BOUND_TYPE (type))
71 {
72 case BOUND_BY_VALUE_ON_STACK:
206415a3
DJ
73 frame = deprecated_safe_get_selected_frame ();
74 current_frame_addr = get_frame_base (frame);
c5aa993b 75 if (current_frame_addr > 0)
c906108c 76 {
c5aa993b
JM
77 *lower_bound =
78 read_memory_integer (current_frame_addr +
c906108c
SS
79 TYPE_ARRAY_LOWER_BOUND_VALUE (type),
80 4);
81 }
82 else
83 {
c5aa993b
JM
84 *lower_bound = DEFAULT_LOWER_BOUND;
85 return BOUND_FETCH_ERROR;
c906108c 86 }
c5aa993b
JM
87 break;
88
c906108c
SS
89 case BOUND_SIMPLE:
90 *lower_bound = TYPE_ARRAY_LOWER_BOUND_VALUE (type);
c5aa993b
JM
91 break;
92
93 case BOUND_CANNOT_BE_DETERMINED:
8a3fe4f8 94 error (_("Lower bound may not be '*' in F77"));
c5aa993b
JM
95 break;
96
c906108c 97 case BOUND_BY_REF_ON_STACK:
206415a3
DJ
98 frame = deprecated_safe_get_selected_frame ();
99 current_frame_addr = get_frame_base (frame);
c5aa993b 100 if (current_frame_addr > 0)
c906108c 101 {
c5aa993b 102 ptr_to_lower_bound =
0d540cdf
KD
103 read_memory_typed_address (current_frame_addr +
104 TYPE_ARRAY_LOWER_BOUND_VALUE (type),
105 builtin_type_void_data_ptr);
c5aa993b 106 *lower_bound = read_memory_integer (ptr_to_lower_bound, 4);
c906108c
SS
107 }
108 else
109 {
c5aa993b
JM
110 *lower_bound = DEFAULT_LOWER_BOUND;
111 return BOUND_FETCH_ERROR;
c906108c 112 }
c5aa993b
JM
113 break;
114
115 case BOUND_BY_REF_IN_REG:
116 case BOUND_BY_VALUE_IN_REG:
117 default:
8a3fe4f8 118 error (_("??? unhandled dynamic array bound type ???"));
c5aa993b 119 break;
c906108c
SS
120 }
121 return BOUND_FETCH_OK;
122}
123
c5aa993b 124int
fba45db2 125f77_get_dynamic_upperbound (struct type *type, int *upper_bound)
c906108c 126{
206415a3 127 struct frame_info *frame;
c906108c 128 CORE_ADDR current_frame_addr = 0;
c5aa993b
JM
129 CORE_ADDR ptr_to_upper_bound;
130
c906108c
SS
131 switch (TYPE_ARRAY_UPPER_BOUND_TYPE (type))
132 {
133 case BOUND_BY_VALUE_ON_STACK:
206415a3
DJ
134 frame = deprecated_safe_get_selected_frame ();
135 current_frame_addr = get_frame_base (frame);
c5aa993b 136 if (current_frame_addr > 0)
c906108c 137 {
c5aa993b
JM
138 *upper_bound =
139 read_memory_integer (current_frame_addr +
c906108c
SS
140 TYPE_ARRAY_UPPER_BOUND_VALUE (type),
141 4);
142 }
143 else
144 {
c5aa993b
JM
145 *upper_bound = DEFAULT_UPPER_BOUND;
146 return BOUND_FETCH_ERROR;
c906108c 147 }
c5aa993b
JM
148 break;
149
c906108c
SS
150 case BOUND_SIMPLE:
151 *upper_bound = TYPE_ARRAY_UPPER_BOUND_VALUE (type);
c5aa993b
JM
152 break;
153
154 case BOUND_CANNOT_BE_DETERMINED:
c906108c 155 /* we have an assumed size array on our hands. Assume that
c5aa993b
JM
156 upper_bound == lower_bound so that we show at least
157 1 element.If the user wants to see more elements, let
158 him manually ask for 'em and we'll subscript the
159 array and show him */
c906108c 160 f77_get_dynamic_lowerbound (type, upper_bound);
c5aa993b
JM
161 break;
162
c906108c 163 case BOUND_BY_REF_ON_STACK:
206415a3
DJ
164 frame = deprecated_safe_get_selected_frame ();
165 current_frame_addr = get_frame_base (frame);
c5aa993b 166 if (current_frame_addr > 0)
c906108c 167 {
c5aa993b 168 ptr_to_upper_bound =
0d540cdf
KD
169 read_memory_typed_address (current_frame_addr +
170 TYPE_ARRAY_UPPER_BOUND_VALUE (type),
171 builtin_type_void_data_ptr);
c5aa993b 172 *upper_bound = read_memory_integer (ptr_to_upper_bound, 4);
c906108c
SS
173 }
174 else
175 {
c5aa993b 176 *upper_bound = DEFAULT_UPPER_BOUND;
c906108c
SS
177 return BOUND_FETCH_ERROR;
178 }
c5aa993b
JM
179 break;
180
181 case BOUND_BY_REF_IN_REG:
182 case BOUND_BY_VALUE_IN_REG:
183 default:
8a3fe4f8 184 error (_("??? unhandled dynamic array bound type ???"));
c5aa993b 185 break;
c906108c
SS
186 }
187 return BOUND_FETCH_OK;
188}
189
c5aa993b 190/* Obtain F77 adjustable array dimensions */
c906108c
SS
191
192static void
fba45db2 193f77_get_dynamic_length_of_aggregate (struct type *type)
c906108c
SS
194{
195 int upper_bound = -1;
c5aa993b
JM
196 int lower_bound = 1;
197 int retcode;
198
c906108c
SS
199 /* Recursively go all the way down into a possibly multi-dimensional
200 F77 array and get the bounds. For simple arrays, this is pretty
201 easy but when the bounds are dynamic, we must be very careful
202 to add up all the lengths correctly. Not doing this right
203 will lead to horrendous-looking arrays in parameter lists.
c5aa993b 204
c906108c 205 This function also works for strings which behave very
c5aa993b
JM
206 similarly to arrays. */
207
208 if (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY
209 || TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_STRING)
c906108c 210 f77_get_dynamic_length_of_aggregate (TYPE_TARGET_TYPE (type));
c5aa993b
JM
211
212 /* Recursion ends here, start setting up lengths. */
213 retcode = f77_get_dynamic_lowerbound (type, &lower_bound);
c906108c 214 if (retcode == BOUND_FETCH_ERROR)
8a3fe4f8 215 error (_("Cannot obtain valid array lower bound"));
c5aa993b
JM
216
217 retcode = f77_get_dynamic_upperbound (type, &upper_bound);
c906108c 218 if (retcode == BOUND_FETCH_ERROR)
8a3fe4f8 219 error (_("Cannot obtain valid array upper bound"));
c5aa993b
JM
220
221 /* Patch in a valid length value. */
222
c906108c
SS
223 TYPE_LENGTH (type) =
224 (upper_bound - lower_bound + 1) * TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type)));
c5aa993b 225}
c906108c
SS
226
227/* Function that sets up the array offset,size table for the array
c5aa993b 228 type "type". */
c906108c 229
c5aa993b 230static void
fba45db2 231f77_create_arrayprint_offset_tbl (struct type *type, struct ui_file *stream)
c906108c
SS
232{
233 struct type *tmp_type;
234 int eltlen;
235 int ndimen = 1;
c5aa993b
JM
236 int upper, lower, retcode;
237
238 tmp_type = type;
239
240 while ((TYPE_CODE (tmp_type) == TYPE_CODE_ARRAY))
c906108c
SS
241 {
242 if (TYPE_ARRAY_UPPER_BOUND_TYPE (tmp_type) == BOUND_CANNOT_BE_DETERMINED)
c5aa993b
JM
243 fprintf_filtered (stream, "<assumed size array> ");
244
c906108c
SS
245 retcode = f77_get_dynamic_upperbound (tmp_type, &upper);
246 if (retcode == BOUND_FETCH_ERROR)
8a3fe4f8 247 error (_("Cannot obtain dynamic upper bound"));
c5aa993b
JM
248
249 retcode = f77_get_dynamic_lowerbound (tmp_type, &lower);
c906108c 250 if (retcode == BOUND_FETCH_ERROR)
8a3fe4f8 251 error (_("Cannot obtain dynamic lower bound"));
c5aa993b 252
c906108c 253 F77_DIM_SIZE (ndimen) = upper - lower + 1;
c5aa993b 254
c906108c 255 tmp_type = TYPE_TARGET_TYPE (tmp_type);
c5aa993b 256 ndimen++;
c906108c 257 }
c5aa993b 258
c906108c
SS
259 /* Now we multiply eltlen by all the offsets, so that later we
260 can print out array elements correctly. Up till now we
261 know an offset to apply to get the item but we also
262 have to know how much to add to get to the next item */
c5aa993b 263
c906108c 264 ndimen--;
c5aa993b 265 eltlen = TYPE_LENGTH (tmp_type);
c906108c
SS
266 F77_DIM_OFFSET (ndimen) = eltlen;
267 while (--ndimen > 0)
268 {
269 eltlen *= F77_DIM_SIZE (ndimen + 1);
270 F77_DIM_OFFSET (ndimen) = eltlen;
271 }
272}
273
b3cacbee
DL
274
275
c906108c
SS
276/* Actual function which prints out F77 arrays, Valaddr == address in
277 the superior. Address == the address in the inferior. */
7b0090c3 278
c5aa993b 279static void
a2bd3dcd 280f77_print_array_1 (int nss, int ndimensions, struct type *type,
fc1a4b47 281 const gdb_byte *valaddr, CORE_ADDR address,
a2bd3dcd 282 struct ui_file *stream, int format,
b3cacbee
DL
283 int deref_ref, int recurse, enum val_prettyprint pretty,
284 int *elts)
c906108c
SS
285{
286 int i;
c5aa993b 287
c906108c
SS
288 if (nss != ndimensions)
289 {
b3cacbee 290 for (i = 0; (i < F77_DIM_SIZE (nss) && (*elts) < print_max); i++)
c906108c
SS
291 {
292 fprintf_filtered (stream, "( ");
293 f77_print_array_1 (nss + 1, ndimensions, TYPE_TARGET_TYPE (type),
c5aa993b
JM
294 valaddr + i * F77_DIM_OFFSET (nss),
295 address + i * F77_DIM_OFFSET (nss),
b3cacbee 296 stream, format, deref_ref, recurse, pretty, elts);
c906108c
SS
297 fprintf_filtered (stream, ") ");
298 }
7b0090c3 299 if (*elts >= print_max && i < F77_DIM_SIZE (nss))
b3cacbee 300 fprintf_filtered (stream, "...");
c906108c
SS
301 }
302 else
303 {
7b0090c3
DL
304 for (i = 0; i < F77_DIM_SIZE (nss) && (*elts) < print_max;
305 i++, (*elts)++)
c906108c
SS
306 {
307 val_print (TYPE_TARGET_TYPE (type),
308 valaddr + i * F77_DIM_OFFSET (ndimensions),
c5aa993b 309 0,
c906108c 310 address + i * F77_DIM_OFFSET (ndimensions),
c5aa993b 311 stream, format, deref_ref, recurse, pretty);
c906108c
SS
312
313 if (i != (F77_DIM_SIZE (nss) - 1))
c5aa993b
JM
314 fprintf_filtered (stream, ", ");
315
7b0090c3 316 if ((*elts == print_max - 1) && (i != (F77_DIM_SIZE (nss) - 1)))
c906108c
SS
317 fprintf_filtered (stream, "...");
318 }
319 }
320}
321
322/* This function gets called to print an F77 array, we set up some
323 stuff and then immediately call f77_print_array_1() */
324
c5aa993b 325static void
fc1a4b47 326f77_print_array (struct type *type, const gdb_byte *valaddr,
a2bd3dcd
AC
327 CORE_ADDR address, struct ui_file *stream,
328 int format, int deref_ref, int recurse,
fba45db2 329 enum val_prettyprint pretty)
c906108c 330{
c5aa993b 331 int ndimensions;
b3cacbee 332 int elts = 0;
c5aa993b
JM
333
334 ndimensions = calc_f77_array_dims (type);
335
c906108c 336 if (ndimensions > MAX_FORTRAN_DIMS || ndimensions < 0)
8a3fe4f8 337 error (_("Type node corrupt! F77 arrays cannot have %d subscripts (%d Max)"),
c906108c 338 ndimensions, MAX_FORTRAN_DIMS);
c5aa993b 339
c906108c
SS
340 /* Since F77 arrays are stored column-major, we set up an
341 offset table to get at the various row's elements. The
c5aa993b 342 offset table contains entries for both offset and subarray size. */
c906108c 343
c5aa993b
JM
344 f77_create_arrayprint_offset_tbl (type, stream);
345
346 f77_print_array_1 (1, ndimensions, type, valaddr, address, stream, format,
b3cacbee 347 deref_ref, recurse, pretty, &elts);
c5aa993b 348}
c906108c 349\f
c5aa993b 350
c906108c
SS
351/* Print data of type TYPE located at VALADDR (within GDB), which came from
352 the inferior at address ADDRESS, onto stdio stream STREAM according to
353 FORMAT (a letter or 0 for natural format). The data at VALADDR is in
354 target byte order.
c5aa993b 355
c906108c
SS
356 If the data are a string pointer, returns the number of string characters
357 printed.
c5aa993b 358
c906108c
SS
359 If DEREF_REF is nonzero, then dereference references, otherwise just print
360 them like pointers.
c5aa993b 361
c906108c
SS
362 The PRETTY parameter controls prettyprinting. */
363
364int
fc1a4b47 365f_val_print (struct type *type, const gdb_byte *valaddr, int embedded_offset,
fba45db2
KB
366 CORE_ADDR address, struct ui_file *stream, int format,
367 int deref_ref, int recurse, enum val_prettyprint pretty)
c906108c 368{
52f0bd74 369 unsigned int i = 0; /* Number of characters printed */
c906108c
SS
370 struct type *elttype;
371 LONGEST val;
372 CORE_ADDR addr;
2a5e440c 373 int index;
c5aa993b 374
c906108c
SS
375 CHECK_TYPEDEF (type);
376 switch (TYPE_CODE (type))
377 {
c5aa993b 378 case TYPE_CODE_STRING:
c906108c
SS
379 f77_get_dynamic_length_of_aggregate (type);
380 LA_PRINT_STRING (stream, valaddr, TYPE_LENGTH (type), 1, 0);
381 break;
c5aa993b 382
c906108c 383 case TYPE_CODE_ARRAY:
c5aa993b
JM
384 fprintf_filtered (stream, "(");
385 f77_print_array (type, valaddr, address, stream, format,
386 deref_ref, recurse, pretty);
c906108c
SS
387 fprintf_filtered (stream, ")");
388 break;
7e86466e 389
c906108c
SS
390 case TYPE_CODE_PTR:
391 if (format && format != 's')
392 {
393 print_scalar_formatted (valaddr, type, format, 0, stream);
394 break;
395 }
396 else
397 {
398 addr = unpack_pointer (type, valaddr);
399 elttype = check_typedef (TYPE_TARGET_TYPE (type));
c5aa993b 400
c906108c
SS
401 if (TYPE_CODE (elttype) == TYPE_CODE_FUNC)
402 {
403 /* Try to print what function it points to. */
404 print_address_demangle (addr, stream, demangle);
405 /* Return value is irrelevant except for string pointers. */
406 return 0;
407 }
c5aa993b 408
c906108c 409 if (addressprint && format != 's')
ed49a04f 410 fputs_filtered (paddress (addr), stream);
c5aa993b 411
c906108c
SS
412 /* For a pointer to char or unsigned char, also print the string
413 pointed to, unless pointer is null. */
414 if (TYPE_LENGTH (elttype) == 1
415 && TYPE_CODE (elttype) == TYPE_CODE_INT
416 && (format == 0 || format == 's')
417 && addr != 0)
418 i = val_print_string (addr, -1, TYPE_LENGTH (elttype), stream);
c5aa993b 419
7e86466e
RH
420 /* Return number of characters printed, including the terminating
421 '\0' if we reached the end. val_print_string takes care including
422 the terminating '\0' if necessary. */
423 return i;
424 }
425 break;
426
427 case TYPE_CODE_REF:
428 elttype = check_typedef (TYPE_TARGET_TYPE (type));
429 if (addressprint)
430 {
431 CORE_ADDR addr
432 = extract_typed_address (valaddr + embedded_offset, type);
433 fprintf_filtered (stream, "@");
ed49a04f 434 fputs_filtered (paddress (addr), stream);
7e86466e
RH
435 if (deref_ref)
436 fputs_filtered (": ", stream);
437 }
438 /* De-reference the reference. */
439 if (deref_ref)
440 {
441 if (TYPE_CODE (elttype) != TYPE_CODE_UNDEF)
442 {
443 struct value *deref_val =
444 value_at
445 (TYPE_TARGET_TYPE (type),
446 unpack_pointer (lookup_pointer_type (builtin_type_void),
00a4c844 447 valaddr + embedded_offset));
806048c6
DJ
448 common_val_print (deref_val, stream, format, deref_ref, recurse,
449 pretty);
7e86466e
RH
450 }
451 else
452 fputs_filtered ("???", stream);
c906108c
SS
453 }
454 break;
c5aa993b 455
c906108c
SS
456 case TYPE_CODE_FUNC:
457 if (format)
458 {
459 print_scalar_formatted (valaddr, type, format, 0, stream);
460 break;
461 }
462 /* FIXME, we should consider, at least for ANSI C language, eliminating
c5aa993b 463 the distinction made between FUNCs and POINTERs to FUNCs. */
c906108c
SS
464 fprintf_filtered (stream, "{");
465 type_print (type, "", stream, -1);
466 fprintf_filtered (stream, "} ");
467 /* Try to print what function it points to, and its address. */
468 print_address_demangle (address, stream, demangle);
469 break;
c5aa993b 470
c906108c
SS
471 case TYPE_CODE_INT:
472 format = format ? format : output_format;
473 if (format)
474 print_scalar_formatted (valaddr, type, format, 0, stream);
475 else
476 {
477 val_print_type_code_int (type, valaddr, stream);
478 /* C and C++ has no single byte int type, char is used instead.
479 Since we don't know whether the value is really intended to
480 be used as an integer or a character, print the character
481 equivalent as well. */
482 if (TYPE_LENGTH (type) == 1)
483 {
484 fputs_filtered (" ", stream);
485 LA_PRINT_CHAR ((unsigned char) unpack_long (type, valaddr),
486 stream);
487 }
488 }
489 break;
c5aa993b 490
4f2aea11
MK
491 case TYPE_CODE_FLAGS:
492 if (format)
493 print_scalar_formatted (valaddr, type, format, 0, stream);
494 else
495 val_print_type_code_flags (type, valaddr, stream);
496 break;
497
c906108c
SS
498 case TYPE_CODE_FLT:
499 if (format)
500 print_scalar_formatted (valaddr, type, format, 0, stream);
501 else
502 print_floating (valaddr, type, stream);
503 break;
c5aa993b 504
c906108c
SS
505 case TYPE_CODE_VOID:
506 fprintf_filtered (stream, "VOID");
507 break;
c5aa993b 508
c906108c
SS
509 case TYPE_CODE_ERROR:
510 fprintf_filtered (stream, "<error type>");
511 break;
c5aa993b 512
c906108c
SS
513 case TYPE_CODE_RANGE:
514 /* FIXME, we should not ever have to print one of these yet. */
515 fprintf_filtered (stream, "<range type>");
516 break;
c5aa993b 517
c906108c
SS
518 case TYPE_CODE_BOOL:
519 format = format ? format : output_format;
520 if (format)
521 print_scalar_formatted (valaddr, type, format, 0, stream);
522 else
523 {
c5aa993b
JM
524 val = 0;
525 switch (TYPE_LENGTH (type))
c906108c
SS
526 {
527 case 1:
528 val = unpack_long (builtin_type_f_logical_s1, valaddr);
c5aa993b
JM
529 break;
530
531 case 2:
c906108c 532 val = unpack_long (builtin_type_f_logical_s2, valaddr);
c5aa993b
JM
533 break;
534
535 case 4:
c906108c 536 val = unpack_long (builtin_type_f_logical, valaddr);
c5aa993b
JM
537 break;
538
c906108c 539 default:
8a3fe4f8 540 error (_("Logicals of length %d bytes not supported"),
c906108c 541 TYPE_LENGTH (type));
c5aa993b 542
c906108c 543 }
c5aa993b
JM
544
545 if (val == 0)
c906108c 546 fprintf_filtered (stream, ".FALSE.");
c5aa993b
JM
547 else if (val == 1)
548 fprintf_filtered (stream, ".TRUE.");
549 else
550 /* Not a legitimate logical type, print as an integer. */
551 {
552 /* Bash the type code temporarily. */
553 TYPE_CODE (type) = TYPE_CODE_INT;
554 f_val_print (type, valaddr, 0, address, stream, format,
555 deref_ref, recurse, pretty);
556 /* Restore the type code so later uses work as intended. */
557 TYPE_CODE (type) = TYPE_CODE_BOOL;
558 }
c906108c
SS
559 }
560 break;
c5aa993b 561
c906108c
SS
562 case TYPE_CODE_COMPLEX:
563 switch (TYPE_LENGTH (type))
564 {
c5aa993b
JM
565 case 8:
566 type = builtin_type_f_real;
567 break;
568 case 16:
569 type = builtin_type_f_real_s8;
570 break;
571 case 32:
572 type = builtin_type_f_real_s16;
573 break;
c906108c 574 default:
8a3fe4f8 575 error (_("Cannot print out complex*%d variables"), TYPE_LENGTH (type));
c906108c
SS
576 }
577 fputs_filtered ("(", stream);
578 print_floating (valaddr, type, stream);
579 fputs_filtered (",", stream);
9af97293 580 print_floating (valaddr + TYPE_LENGTH (type), type, stream);
c906108c
SS
581 fputs_filtered (")", stream);
582 break;
c5aa993b 583
c906108c
SS
584 case TYPE_CODE_UNDEF:
585 /* This happens (without TYPE_FLAG_STUB set) on systems which don't use
c5aa993b
JM
586 dbx xrefs (NO_DBX_XREFS in gcc) if a file has a "struct foo *bar"
587 and no complete type for struct foo in that file. */
c906108c
SS
588 fprintf_filtered (stream, "<incomplete type>");
589 break;
c5aa993b 590
2a5e440c 591 case TYPE_CODE_STRUCT:
9eec4d1e 592 case TYPE_CODE_UNION:
2a5e440c
WZ
593 /* Starting from the Fortran 90 standard, Fortran supports derived
594 types. */
9eec4d1e 595 fprintf_filtered (stream, "( ");
2a5e440c
WZ
596 for (index = 0; index < TYPE_NFIELDS (type); index++)
597 {
598 int offset = TYPE_FIELD_BITPOS (type, index) / 8;
599 f_val_print (TYPE_FIELD_TYPE (type, index), valaddr + offset,
600 embedded_offset, address, stream,
601 format, deref_ref, recurse, pretty);
602 if (index != TYPE_NFIELDS (type) - 1)
603 fputs_filtered (", ", stream);
604 }
9eec4d1e 605 fprintf_filtered (stream, " )");
2a5e440c
WZ
606 break;
607
c906108c 608 default:
8a3fe4f8 609 error (_("Invalid F77 type code %d in symbol table."), TYPE_CODE (type));
c906108c
SS
610 }
611 gdb_flush (stream);
612 return 0;
613}
614
615static void
fba45db2 616list_all_visible_commons (char *funname)
c906108c 617{
c5aa993b
JM
618 SAVED_F77_COMMON_PTR tmp;
619
c906108c 620 tmp = head_common_list;
c5aa993b 621
a3f17187 622 printf_filtered (_("All COMMON blocks visible at this level:\n\n"));
c5aa993b 623
c906108c
SS
624 while (tmp != NULL)
625 {
762f08a3 626 if (strcmp (tmp->owning_function, funname) == 0)
c5aa993b
JM
627 printf_filtered ("%s\n", tmp->name);
628
c906108c
SS
629 tmp = tmp->next;
630 }
631}
632
633/* This function is used to print out the values in a given COMMON
634 block. It will always use the most local common block of the
c5aa993b 635 given name */
c906108c 636
c5aa993b 637static void
fba45db2 638info_common_command (char *comname, int from_tty)
c906108c 639{
c5aa993b
JM
640 SAVED_F77_COMMON_PTR the_common;
641 COMMON_ENTRY_PTR entry;
c906108c 642 struct frame_info *fi;
52f0bd74 643 char *funname = 0;
c906108c 644 struct symbol *func;
c5aa993b 645
c906108c
SS
646 /* We have been told to display the contents of F77 COMMON
647 block supposedly visible in this function. Let us
648 first make sure that it is visible and if so, let
c5aa993b
JM
649 us display its contents */
650
206415a3 651 fi = get_selected_frame (_("No frame selected"));
c5aa993b 652
c906108c 653 /* The following is generally ripped off from stack.c's routine
c5aa993b
JM
654 print_frame_info() */
655
bdd78e62 656 func = find_pc_function (get_frame_pc (fi));
c906108c
SS
657 if (func)
658 {
659 /* In certain pathological cases, the symtabs give the wrong
c5aa993b
JM
660 function (when we are in the first function in a file which
661 is compiled without debugging symbols, the previous function
662 is compiled with debugging symbols, and the "foo.o" symbol
663 that is supposed to tell us where the file with debugging symbols
664 ends has been truncated by ar because it is longer than 15
665 characters).
666
667 So look in the minimal symbol tables as well, and if it comes
668 up with a larger address for the function use that instead.
669 I don't think this can ever cause any problems; there shouldn't
670 be any minimal symbols in the middle of a function.
671 FIXME: (Not necessarily true. What about text labels) */
672
7c6e0d48
MS
673 struct minimal_symbol *msymbol =
674 lookup_minimal_symbol_by_pc (get_frame_pc (fi));
c5aa993b 675
c906108c 676 if (msymbol != NULL
c5aa993b 677 && (SYMBOL_VALUE_ADDRESS (msymbol)
c906108c 678 > BLOCK_START (SYMBOL_BLOCK_VALUE (func))))
22abf04a 679 funname = DEPRECATED_SYMBOL_NAME (msymbol);
c906108c 680 else
22abf04a 681 funname = DEPRECATED_SYMBOL_NAME (func);
c906108c
SS
682 }
683 else
684 {
aa1ee363 685 struct minimal_symbol *msymbol =
bdd78e62 686 lookup_minimal_symbol_by_pc (get_frame_pc (fi));
c5aa993b 687
c906108c 688 if (msymbol != NULL)
22abf04a 689 funname = DEPRECATED_SYMBOL_NAME (msymbol);
7c6e0d48
MS
690 else /* Got no 'funname', code below will fail. */
691 error (_("No function found for frame."));
c906108c 692 }
c5aa993b 693
c906108c 694 /* If comname is NULL, we assume the user wishes to see the
c5aa993b
JM
695 which COMMON blocks are visible here and then return */
696
c906108c
SS
697 if (comname == 0)
698 {
699 list_all_visible_commons (funname);
c5aa993b 700 return;
c906108c 701 }
c5aa993b
JM
702
703 the_common = find_common_for_function (comname, funname);
704
c906108c
SS
705 if (the_common)
706 {
762f08a3 707 if (strcmp (comname, BLANK_COMMON_NAME_LOCAL) == 0)
a3f17187 708 printf_filtered (_("Contents of blank COMMON block:\n"));
c5aa993b 709 else
a3f17187 710 printf_filtered (_("Contents of F77 COMMON block '%s':\n"), comname);
c5aa993b
JM
711
712 printf_filtered ("\n");
713 entry = the_common->entries;
714
c906108c
SS
715 while (entry != NULL)
716 {
22abf04a 717 printf_filtered ("%s = ", DEPRECATED_SYMBOL_NAME (entry->symbol));
c5aa993b
JM
718 print_variable_value (entry->symbol, fi, gdb_stdout);
719 printf_filtered ("\n");
720 entry = entry->next;
c906108c
SS
721 }
722 }
c5aa993b 723 else
a3f17187 724 printf_filtered (_("Cannot locate the common block %s in function '%s'\n"),
c5aa993b 725 comname, funname);
c906108c
SS
726}
727
728/* This function is used to determine whether there is a
c5aa993b 729 F77 common block visible at the current scope called 'comname'. */
c906108c
SS
730
731#if 0
732static int
fba45db2 733there_is_a_visible_common_named (char *comname)
c906108c 734{
c5aa993b 735 SAVED_F77_COMMON_PTR the_common;
c906108c 736 struct frame_info *fi;
52f0bd74 737 char *funname = 0;
c906108c 738 struct symbol *func;
c5aa993b 739
c906108c 740 if (comname == NULL)
8a3fe4f8 741 error (_("Cannot deal with NULL common name!"));
c5aa993b 742
206415a3 743 fi = get_selected_frame (_("No frame selected"));
c5aa993b 744
c906108c 745 /* The following is generally ripped off from stack.c's routine
c5aa993b
JM
746 print_frame_info() */
747
c906108c
SS
748 func = find_pc_function (fi->pc);
749 if (func)
750 {
751 /* In certain pathological cases, the symtabs give the wrong
c5aa993b
JM
752 function (when we are in the first function in a file which
753 is compiled without debugging symbols, the previous function
754 is compiled with debugging symbols, and the "foo.o" symbol
755 that is supposed to tell us where the file with debugging symbols
756 ends has been truncated by ar because it is longer than 15
757 characters).
758
759 So look in the minimal symbol tables as well, and if it comes
760 up with a larger address for the function use that instead.
761 I don't think this can ever cause any problems; there shouldn't
762 be any minimal symbols in the middle of a function.
763 FIXME: (Not necessarily true. What about text labels) */
764
c906108c 765 struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (fi->pc);
c5aa993b 766
c906108c 767 if (msymbol != NULL
c5aa993b 768 && (SYMBOL_VALUE_ADDRESS (msymbol)
c906108c 769 > BLOCK_START (SYMBOL_BLOCK_VALUE (func))))
22abf04a 770 funname = DEPRECATED_SYMBOL_NAME (msymbol);
c906108c 771 else
22abf04a 772 funname = DEPRECATED_SYMBOL_NAME (func);
c906108c
SS
773 }
774 else
775 {
aa1ee363 776 struct minimal_symbol *msymbol =
c5aa993b
JM
777 lookup_minimal_symbol_by_pc (fi->pc);
778
c906108c 779 if (msymbol != NULL)
22abf04a 780 funname = DEPRECATED_SYMBOL_NAME (msymbol);
c906108c 781 }
c5aa993b
JM
782
783 the_common = find_common_for_function (comname, funname);
784
c906108c
SS
785 return (the_common ? 1 : 0);
786}
787#endif
788
789void
fba45db2 790_initialize_f_valprint (void)
c906108c
SS
791{
792 add_info ("common", info_common_command,
1bedd215 793 _("Print out the values contained in a Fortran COMMON block."));
c906108c 794 if (xdb_commands)
c5aa993b 795 add_com ("lc", class_info, info_common_command,
1bedd215 796 _("Print out the values contained in a Fortran COMMON block."));
c906108c 797}
This page took 0.618853 seconds and 4 git commands to generate.