1999-04-16 03:35:26 +02:00
|
|
|
|
/* Support for printing Fortran values for GDB, the GNU debugger.
|
2000-02-02 01:21:19 +01:00
|
|
|
|
Copyright 1993-1995, 2000 Free Software Foundation, Inc.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
Contributed by Motorola. Adapted from the C definitions by Farooq Butt
|
|
|
|
|
(fmbutt@engage.sps.mot.com), additionally worked over by Stan Shebs.
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
This file is part of GDB.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
|
(at your option) any later version.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with this program; if not, write to the Free Software
|
|
|
|
|
Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
|
|
Boston, MA 02111-1307, USA. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
#include "defs.h"
|
|
|
|
|
#include "gdb_string.h"
|
|
|
|
|
#include "symtab.h"
|
|
|
|
|
#include "gdbtypes.h"
|
|
|
|
|
#include "expression.h"
|
|
|
|
|
#include "value.h"
|
|
|
|
|
#include "demangle.h"
|
|
|
|
|
#include "valprint.h"
|
|
|
|
|
#include "language.h"
|
1999-07-07 22:19:36 +02:00
|
|
|
|
#include "f-lang.h"
|
1999-04-16 03:35:26 +02:00
|
|
|
|
#include "frame.h"
|
|
|
|
|
#include "gdbcore.h"
|
|
|
|
|
#include "command.h"
|
|
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
|
static int there_is_a_visible_common_named PARAMS ((char *));
|
|
|
|
|
#endif
|
|
|
|
|
|
1999-05-25 20:09:09 +02:00
|
|
|
|
extern void _initialize_f_valprint PARAMS ((void));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
static void info_common_command PARAMS ((char *, int));
|
|
|
|
|
static void list_all_visible_commons PARAMS ((char *));
|
2000-02-02 01:21:19 +01:00
|
|
|
|
static void f77_print_array (struct type *, char *, CORE_ADDR,
|
|
|
|
|
struct ui_file *, int, int, int,
|
|
|
|
|
enum val_prettyprint);
|
|
|
|
|
static void f77_print_array_1 (int, int, struct type *, char *,
|
|
|
|
|
CORE_ADDR, struct ui_file *, int, int, int,
|
|
|
|
|
enum val_prettyprint);
|
|
|
|
|
static void f77_create_arrayprint_offset_tbl (struct type *,
|
|
|
|
|
struct ui_file *);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
static void f77_get_dynamic_length_of_aggregate PARAMS ((struct type *));
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int f77_array_offset_tbl[MAX_FORTRAN_DIMS + 1][2];
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Array which holds offsets to be applied to get a row's elements
|
|
|
|
|
for a given array. Array also holds the size of each subarray. */
|
|
|
|
|
|
|
|
|
|
/* The following macro gives us the size of the nth dimension, Where
|
1999-07-07 22:19:36 +02:00
|
|
|
|
n is 1 based. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
#define F77_DIM_SIZE(n) (f77_array_offset_tbl[n][1])
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
/* The following gives us the offset for row n where n is 1-based. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
#define F77_DIM_OFFSET(n) (f77_array_offset_tbl[n][0])
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int
|
1999-04-16 03:35:26 +02:00
|
|
|
|
f77_get_dynamic_lowerbound (type, lower_bound)
|
|
|
|
|
struct type *type;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int *lower_bound;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
CORE_ADDR current_frame_addr;
|
|
|
|
|
CORE_ADDR ptr_to_lower_bound;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
switch (TYPE_ARRAY_LOWER_BOUND_TYPE (type))
|
|
|
|
|
{
|
|
|
|
|
case BOUND_BY_VALUE_ON_STACK:
|
|
|
|
|
current_frame_addr = selected_frame->frame;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (current_frame_addr > 0)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*lower_bound =
|
|
|
|
|
read_memory_integer (current_frame_addr +
|
1999-04-16 03:35:26 +02:00
|
|
|
|
TYPE_ARRAY_LOWER_BOUND_VALUE (type),
|
|
|
|
|
4);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*lower_bound = DEFAULT_LOWER_BOUND;
|
|
|
|
|
return BOUND_FETCH_ERROR;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case BOUND_SIMPLE:
|
|
|
|
|
*lower_bound = TYPE_ARRAY_LOWER_BOUND_VALUE (type);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BOUND_CANNOT_BE_DETERMINED:
|
|
|
|
|
error ("Lower bound may not be '*' in F77");
|
|
|
|
|
break;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case BOUND_BY_REF_ON_STACK:
|
|
|
|
|
current_frame_addr = selected_frame->frame;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (current_frame_addr > 0)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
ptr_to_lower_bound =
|
|
|
|
|
read_memory_integer (current_frame_addr +
|
1999-04-16 03:35:26 +02:00
|
|
|
|
TYPE_ARRAY_LOWER_BOUND_VALUE (type),
|
|
|
|
|
4);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*lower_bound = read_memory_integer (ptr_to_lower_bound, 4);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*lower_bound = DEFAULT_LOWER_BOUND;
|
|
|
|
|
return BOUND_FETCH_ERROR;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BOUND_BY_REF_IN_REG:
|
|
|
|
|
case BOUND_BY_VALUE_IN_REG:
|
|
|
|
|
default:
|
1999-04-16 03:35:26 +02:00
|
|
|
|
error ("??? unhandled dynamic array bound type ???");
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
return BOUND_FETCH_OK;
|
|
|
|
|
}
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int
|
1999-04-16 03:35:26 +02:00
|
|
|
|
f77_get_dynamic_upperbound (type, upper_bound)
|
|
|
|
|
struct type *type;
|
|
|
|
|
int *upper_bound;
|
|
|
|
|
{
|
|
|
|
|
CORE_ADDR current_frame_addr = 0;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
CORE_ADDR ptr_to_upper_bound;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
switch (TYPE_ARRAY_UPPER_BOUND_TYPE (type))
|
|
|
|
|
{
|
|
|
|
|
case BOUND_BY_VALUE_ON_STACK:
|
|
|
|
|
current_frame_addr = selected_frame->frame;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (current_frame_addr > 0)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*upper_bound =
|
|
|
|
|
read_memory_integer (current_frame_addr +
|
1999-04-16 03:35:26 +02:00
|
|
|
|
TYPE_ARRAY_UPPER_BOUND_VALUE (type),
|
|
|
|
|
4);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*upper_bound = DEFAULT_UPPER_BOUND;
|
|
|
|
|
return BOUND_FETCH_ERROR;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case BOUND_SIMPLE:
|
|
|
|
|
*upper_bound = TYPE_ARRAY_UPPER_BOUND_VALUE (type);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BOUND_CANNOT_BE_DETERMINED:
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* we have an assumed size array on our hands. Assume that
|
1999-07-07 22:19:36 +02:00
|
|
|
|
upper_bound == lower_bound so that we show at least
|
|
|
|
|
1 element.If the user wants to see more elements, let
|
|
|
|
|
him manually ask for 'em and we'll subscript the
|
|
|
|
|
array and show him */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
f77_get_dynamic_lowerbound (type, upper_bound);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case BOUND_BY_REF_ON_STACK:
|
|
|
|
|
current_frame_addr = selected_frame->frame;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (current_frame_addr > 0)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
ptr_to_upper_bound =
|
|
|
|
|
read_memory_integer (current_frame_addr +
|
1999-04-16 03:35:26 +02:00
|
|
|
|
TYPE_ARRAY_UPPER_BOUND_VALUE (type),
|
|
|
|
|
4);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*upper_bound = read_memory_integer (ptr_to_upper_bound, 4);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*upper_bound = DEFAULT_UPPER_BOUND;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return BOUND_FETCH_ERROR;
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BOUND_BY_REF_IN_REG:
|
|
|
|
|
case BOUND_BY_VALUE_IN_REG:
|
|
|
|
|
default:
|
1999-04-16 03:35:26 +02:00
|
|
|
|
error ("??? unhandled dynamic array bound type ???");
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
return BOUND_FETCH_OK;
|
|
|
|
|
}
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
/* Obtain F77 adjustable array dimensions */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
f77_get_dynamic_length_of_aggregate (type)
|
|
|
|
|
struct type *type;
|
|
|
|
|
{
|
|
|
|
|
int upper_bound = -1;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int lower_bound = 1;
|
|
|
|
|
int retcode;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Recursively go all the way down into a possibly multi-dimensional
|
|
|
|
|
F77 array and get the bounds. For simple arrays, this is pretty
|
|
|
|
|
easy but when the bounds are dynamic, we must be very careful
|
|
|
|
|
to add up all the lengths correctly. Not doing this right
|
|
|
|
|
will lead to horrendous-looking arrays in parameter lists.
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
This function also works for strings which behave very
|
1999-07-07 22:19:36 +02:00
|
|
|
|
similarly to arrays. */
|
|
|
|
|
|
|
|
|
|
if (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY
|
|
|
|
|
|| TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_STRING)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
f77_get_dynamic_length_of_aggregate (TYPE_TARGET_TYPE (type));
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
|
|
/* Recursion ends here, start setting up lengths. */
|
|
|
|
|
retcode = f77_get_dynamic_lowerbound (type, &lower_bound);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (retcode == BOUND_FETCH_ERROR)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("Cannot obtain valid array lower bound");
|
|
|
|
|
|
|
|
|
|
retcode = f77_get_dynamic_upperbound (type, &upper_bound);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (retcode == BOUND_FETCH_ERROR)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("Cannot obtain valid array upper bound");
|
|
|
|
|
|
|
|
|
|
/* Patch in a valid length value. */
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
TYPE_LENGTH (type) =
|
|
|
|
|
(upper_bound - lower_bound + 1) * TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type)));
|
1999-07-07 22:19:36 +02:00
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Function that sets up the array offset,size table for the array
|
1999-07-07 22:19:36 +02:00
|
|
|
|
type "type". */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
static void
|
1999-04-16 03:35:26 +02:00
|
|
|
|
f77_create_arrayprint_offset_tbl (type, stream)
|
|
|
|
|
struct type *type;
|
2000-02-02 01:21:19 +01:00
|
|
|
|
struct ui_file *stream;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
struct type *tmp_type;
|
|
|
|
|
int eltlen;
|
|
|
|
|
int ndimen = 1;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int upper, lower, retcode;
|
|
|
|
|
|
|
|
|
|
tmp_type = type;
|
|
|
|
|
|
|
|
|
|
while ((TYPE_CODE (tmp_type) == TYPE_CODE_ARRAY))
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
if (TYPE_ARRAY_UPPER_BOUND_TYPE (tmp_type) == BOUND_CANNOT_BE_DETERMINED)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
fprintf_filtered (stream, "<assumed size array> ");
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
retcode = f77_get_dynamic_upperbound (tmp_type, &upper);
|
|
|
|
|
if (retcode == BOUND_FETCH_ERROR)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("Cannot obtain dynamic upper bound");
|
|
|
|
|
|
|
|
|
|
retcode = f77_get_dynamic_lowerbound (tmp_type, &lower);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (retcode == BOUND_FETCH_ERROR)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("Cannot obtain dynamic lower bound");
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
F77_DIM_SIZE (ndimen) = upper - lower + 1;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
tmp_type = TYPE_TARGET_TYPE (tmp_type);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
ndimen++;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Now we multiply eltlen by all the offsets, so that later we
|
|
|
|
|
can print out array elements correctly. Up till now we
|
|
|
|
|
know an offset to apply to get the item but we also
|
|
|
|
|
have to know how much to add to get to the next item */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
ndimen--;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
eltlen = TYPE_LENGTH (tmp_type);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
F77_DIM_OFFSET (ndimen) = eltlen;
|
|
|
|
|
while (--ndimen > 0)
|
|
|
|
|
{
|
|
|
|
|
eltlen *= F77_DIM_SIZE (ndimen + 1);
|
|
|
|
|
F77_DIM_OFFSET (ndimen) = eltlen;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Actual function which prints out F77 arrays, Valaddr == address in
|
|
|
|
|
the superior. Address == the address in the inferior. */
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
static void
|
|
|
|
|
f77_print_array_1 (nss, ndimensions, type, valaddr, address,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
stream, format, deref_ref, recurse, pretty)
|
|
|
|
|
int nss;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int ndimensions;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
struct type *type;
|
|
|
|
|
char *valaddr;
|
|
|
|
|
CORE_ADDR address;
|
2000-02-02 01:21:19 +01:00
|
|
|
|
struct ui_file *stream;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
int format;
|
|
|
|
|
int deref_ref;
|
|
|
|
|
int recurse;
|
|
|
|
|
enum val_prettyprint pretty;
|
|
|
|
|
{
|
|
|
|
|
int i;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (nss != ndimensions)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
for (i = 0; i < F77_DIM_SIZE (nss); i++)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, "( ");
|
|
|
|
|
f77_print_array_1 (nss + 1, ndimensions, TYPE_TARGET_TYPE (type),
|
1999-07-07 22:19:36 +02:00
|
|
|
|
valaddr + i * F77_DIM_OFFSET (nss),
|
|
|
|
|
address + i * F77_DIM_OFFSET (nss),
|
|
|
|
|
stream, format, deref_ref, recurse, pretty);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, ") ");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
for (i = 0; (i < F77_DIM_SIZE (nss) && i < print_max); i++)
|
|
|
|
|
{
|
|
|
|
|
val_print (TYPE_TARGET_TYPE (type),
|
|
|
|
|
valaddr + i * F77_DIM_OFFSET (ndimensions),
|
1999-07-07 22:19:36 +02:00
|
|
|
|
0,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
address + i * F77_DIM_OFFSET (ndimensions),
|
1999-07-07 22:19:36 +02:00
|
|
|
|
stream, format, deref_ref, recurse, pretty);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
if (i != (F77_DIM_SIZE (nss) - 1))
|
1999-07-07 22:19:36 +02:00
|
|
|
|
fprintf_filtered (stream, ", ");
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (i == print_max - 1)
|
|
|
|
|
fprintf_filtered (stream, "...");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* This function gets called to print an F77 array, we set up some
|
|
|
|
|
stuff and then immediately call f77_print_array_1() */
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
static void
|
|
|
|
|
f77_print_array (type, valaddr, address, stream, format, deref_ref, recurse,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
pretty)
|
|
|
|
|
struct type *type;
|
|
|
|
|
char *valaddr;
|
|
|
|
|
CORE_ADDR address;
|
2000-02-02 01:21:19 +01:00
|
|
|
|
struct ui_file *stream;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
int format;
|
|
|
|
|
int deref_ref;
|
|
|
|
|
int recurse;
|
|
|
|
|
enum val_prettyprint pretty;
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int ndimensions;
|
|
|
|
|
|
|
|
|
|
ndimensions = calc_f77_array_dims (type);
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (ndimensions > MAX_FORTRAN_DIMS || ndimensions < 0)
|
|
|
|
|
error ("Type node corrupt! F77 arrays cannot have %d subscripts (%d Max)",
|
|
|
|
|
ndimensions, MAX_FORTRAN_DIMS);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Since F77 arrays are stored column-major, we set up an
|
|
|
|
|
offset table to get at the various row's elements. The
|
1999-07-07 22:19:36 +02:00
|
|
|
|
offset table contains entries for both offset and subarray size. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
f77_create_arrayprint_offset_tbl (type, stream);
|
|
|
|
|
|
|
|
|
|
f77_print_array_1 (1, ndimensions, type, valaddr, address, stream, format,
|
|
|
|
|
deref_ref, recurse, pretty);
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Print data of type TYPE located at VALADDR (within GDB), which came from
|
|
|
|
|
the inferior at address ADDRESS, onto stdio stream STREAM according to
|
|
|
|
|
FORMAT (a letter or 0 for natural format). The data at VALADDR is in
|
|
|
|
|
target byte order.
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
If the data are a string pointer, returns the number of string characters
|
|
|
|
|
printed.
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
If DEREF_REF is nonzero, then dereference references, otherwise just print
|
|
|
|
|
them like pointers.
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
The PRETTY parameter controls prettyprinting. */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
f_val_print (type, valaddr, embedded_offset, address, stream, format, deref_ref, recurse,
|
|
|
|
|
pretty)
|
|
|
|
|
struct type *type;
|
|
|
|
|
char *valaddr;
|
|
|
|
|
int embedded_offset;
|
|
|
|
|
CORE_ADDR address;
|
2000-02-02 01:21:19 +01:00
|
|
|
|
struct ui_file *stream;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
int format;
|
|
|
|
|
int deref_ref;
|
|
|
|
|
int recurse;
|
|
|
|
|
enum val_prettyprint pretty;
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
register unsigned int i = 0; /* Number of characters printed */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
struct type *elttype;
|
|
|
|
|
LONGEST val;
|
|
|
|
|
CORE_ADDR addr;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
CHECK_TYPEDEF (type);
|
|
|
|
|
switch (TYPE_CODE (type))
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
case TYPE_CODE_STRING:
|
1999-04-16 03:35:26 +02:00
|
|
|
|
f77_get_dynamic_length_of_aggregate (type);
|
|
|
|
|
LA_PRINT_STRING (stream, valaddr, TYPE_LENGTH (type), 1, 0);
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_ARRAY:
|
1999-07-07 22:19:36 +02:00
|
|
|
|
fprintf_filtered (stream, "(");
|
|
|
|
|
f77_print_array (type, valaddr, address, stream, format,
|
|
|
|
|
deref_ref, recurse, pretty);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, ")");
|
|
|
|
|
break;
|
|
|
|
|
#if 0
|
|
|
|
|
/* Array of unspecified length: treat like pointer to first elt. */
|
|
|
|
|
valaddr = (char *) &address;
|
|
|
|
|
/* FALL THROUGH */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
#endif
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_PTR:
|
|
|
|
|
if (format && format != 's')
|
|
|
|
|
{
|
|
|
|
|
print_scalar_formatted (valaddr, type, format, 0, stream);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
addr = unpack_pointer (type, valaddr);
|
|
|
|
|
elttype = check_typedef (TYPE_TARGET_TYPE (type));
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (TYPE_CODE (elttype) == TYPE_CODE_FUNC)
|
|
|
|
|
{
|
|
|
|
|
/* Try to print what function it points to. */
|
|
|
|
|
print_address_demangle (addr, stream, demangle);
|
|
|
|
|
/* Return value is irrelevant except for string pointers. */
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (addressprint && format != 's')
|
1999-09-09 02:02:17 +02:00
|
|
|
|
fprintf_filtered (stream, "0x%s", paddr_nz (addr));
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* For a pointer to char or unsigned char, also print the string
|
|
|
|
|
pointed to, unless pointer is null. */
|
|
|
|
|
if (TYPE_LENGTH (elttype) == 1
|
|
|
|
|
&& TYPE_CODE (elttype) == TYPE_CODE_INT
|
|
|
|
|
&& (format == 0 || format == 's')
|
|
|
|
|
&& addr != 0)
|
|
|
|
|
i = val_print_string (addr, -1, TYPE_LENGTH (elttype), stream);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Return number of characters printed, plus one for the
|
|
|
|
|
terminating null if we have "reached the end". */
|
|
|
|
|
return (i + (print_max && i != print_max));
|
|
|
|
|
}
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_FUNC:
|
|
|
|
|
if (format)
|
|
|
|
|
{
|
|
|
|
|
print_scalar_formatted (valaddr, type, format, 0, stream);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
/* FIXME, we should consider, at least for ANSI C language, eliminating
|
1999-07-07 22:19:36 +02:00
|
|
|
|
the distinction made between FUNCs and POINTERs to FUNCs. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, "{");
|
|
|
|
|
type_print (type, "", stream, -1);
|
|
|
|
|
fprintf_filtered (stream, "} ");
|
|
|
|
|
/* Try to print what function it points to, and its address. */
|
|
|
|
|
print_address_demangle (address, stream, demangle);
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_INT:
|
|
|
|
|
format = format ? format : output_format;
|
|
|
|
|
if (format)
|
|
|
|
|
print_scalar_formatted (valaddr, type, format, 0, stream);
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
val_print_type_code_int (type, valaddr, stream);
|
|
|
|
|
/* C and C++ has no single byte int type, char is used instead.
|
|
|
|
|
Since we don't know whether the value is really intended to
|
|
|
|
|
be used as an integer or a character, print the character
|
|
|
|
|
equivalent as well. */
|
|
|
|
|
if (TYPE_LENGTH (type) == 1)
|
|
|
|
|
{
|
|
|
|
|
fputs_filtered (" ", stream);
|
|
|
|
|
LA_PRINT_CHAR ((unsigned char) unpack_long (type, valaddr),
|
|
|
|
|
stream);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_FLT:
|
|
|
|
|
if (format)
|
|
|
|
|
print_scalar_formatted (valaddr, type, format, 0, stream);
|
|
|
|
|
else
|
|
|
|
|
print_floating (valaddr, type, stream);
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_VOID:
|
|
|
|
|
fprintf_filtered (stream, "VOID");
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_ERROR:
|
|
|
|
|
fprintf_filtered (stream, "<error type>");
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_RANGE:
|
|
|
|
|
/* FIXME, we should not ever have to print one of these yet. */
|
|
|
|
|
fprintf_filtered (stream, "<range type>");
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_BOOL:
|
|
|
|
|
format = format ? format : output_format;
|
|
|
|
|
if (format)
|
|
|
|
|
print_scalar_formatted (valaddr, type, format, 0, stream);
|
|
|
|
|
else
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
val = 0;
|
|
|
|
|
switch (TYPE_LENGTH (type))
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
case 1:
|
|
|
|
|
val = unpack_long (builtin_type_f_logical_s1, valaddr);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 2:
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val = unpack_long (builtin_type_f_logical_s2, valaddr);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 4:
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val = unpack_long (builtin_type_f_logical, valaddr);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
break;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
default:
|
|
|
|
|
error ("Logicals of length %d bytes not supported",
|
|
|
|
|
TYPE_LENGTH (type));
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
|
|
if (val == 0)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, ".FALSE.");
|
1999-07-07 22:19:36 +02:00
|
|
|
|
else if (val == 1)
|
|
|
|
|
fprintf_filtered (stream, ".TRUE.");
|
|
|
|
|
else
|
|
|
|
|
/* Not a legitimate logical type, print as an integer. */
|
|
|
|
|
{
|
|
|
|
|
/* Bash the type code temporarily. */
|
|
|
|
|
TYPE_CODE (type) = TYPE_CODE_INT;
|
|
|
|
|
f_val_print (type, valaddr, 0, address, stream, format,
|
|
|
|
|
deref_ref, recurse, pretty);
|
|
|
|
|
/* Restore the type code so later uses work as intended. */
|
|
|
|
|
TYPE_CODE (type) = TYPE_CODE_BOOL;
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_COMPLEX:
|
|
|
|
|
switch (TYPE_LENGTH (type))
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
case 8:
|
|
|
|
|
type = builtin_type_f_real;
|
|
|
|
|
break;
|
|
|
|
|
case 16:
|
|
|
|
|
type = builtin_type_f_real_s8;
|
|
|
|
|
break;
|
|
|
|
|
case 32:
|
|
|
|
|
type = builtin_type_f_real_s16;
|
|
|
|
|
break;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
default:
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("Cannot print out complex*%d variables", TYPE_LENGTH (type));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
fputs_filtered ("(", stream);
|
|
|
|
|
print_floating (valaddr, type, stream);
|
|
|
|
|
fputs_filtered (",", stream);
|
2000-05-23 17:56:33 +02:00
|
|
|
|
print_floating (valaddr + TYPE_LENGTH (type), type, stream);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fputs_filtered (")", stream);
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
case TYPE_CODE_UNDEF:
|
|
|
|
|
/* This happens (without TYPE_FLAG_STUB set) on systems which don't use
|
1999-07-07 22:19:36 +02:00
|
|
|
|
dbx xrefs (NO_DBX_XREFS in gcc) if a file has a "struct foo *bar"
|
|
|
|
|
and no complete type for struct foo in that file. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, "<incomplete type>");
|
|
|
|
|
break;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
default:
|
|
|
|
|
error ("Invalid F77 type code %d in symbol table.", TYPE_CODE (type));
|
|
|
|
|
}
|
|
|
|
|
gdb_flush (stream);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
list_all_visible_commons (funname)
|
|
|
|
|
char *funname;
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
SAVED_F77_COMMON_PTR tmp;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
tmp = head_common_list;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
printf_filtered ("All COMMON blocks visible at this level:\n\n");
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
while (tmp != NULL)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (STREQ (tmp->owning_function, funname))
|
|
|
|
|
printf_filtered ("%s\n", tmp->name);
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
tmp = tmp->next;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* This function is used to print out the values in a given COMMON
|
|
|
|
|
block. It will always use the most local common block of the
|
1999-07-07 22:19:36 +02:00
|
|
|
|
given name */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
static void
|
1999-04-16 03:35:26 +02:00
|
|
|
|
info_common_command (comname, from_tty)
|
|
|
|
|
char *comname;
|
|
|
|
|
int from_tty;
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
SAVED_F77_COMMON_PTR the_common;
|
|
|
|
|
COMMON_ENTRY_PTR entry;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
register char *funname = 0;
|
|
|
|
|
struct symbol *func;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* We have been told to display the contents of F77 COMMON
|
|
|
|
|
block supposedly visible in this function. Let us
|
|
|
|
|
first make sure that it is visible and if so, let
|
1999-07-07 22:19:36 +02:00
|
|
|
|
us display its contents */
|
|
|
|
|
|
|
|
|
|
fi = selected_frame;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (fi == NULL)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("No frame selected");
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* The following is generally ripped off from stack.c's routine
|
1999-07-07 22:19:36 +02:00
|
|
|
|
print_frame_info() */
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
func = find_pc_function (fi->pc);
|
|
|
|
|
if (func)
|
|
|
|
|
{
|
|
|
|
|
/* In certain pathological cases, the symtabs give the wrong
|
1999-07-07 22:19:36 +02:00
|
|
|
|
function (when we are in the first function in a file which
|
|
|
|
|
is compiled without debugging symbols, the previous function
|
|
|
|
|
is compiled with debugging symbols, and the "foo.o" symbol
|
|
|
|
|
that is supposed to tell us where the file with debugging symbols
|
|
|
|
|
ends has been truncated by ar because it is longer than 15
|
|
|
|
|
characters).
|
|
|
|
|
|
|
|
|
|
So look in the minimal symbol tables as well, and if it comes
|
|
|
|
|
up with a larger address for the function use that instead.
|
|
|
|
|
I don't think this can ever cause any problems; there shouldn't
|
|
|
|
|
be any minimal symbols in the middle of a function.
|
|
|
|
|
FIXME: (Not necessarily true. What about text labels) */
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (fi->pc);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (msymbol != NULL
|
1999-07-07 22:19:36 +02:00
|
|
|
|
&& (SYMBOL_VALUE_ADDRESS (msymbol)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
> BLOCK_START (SYMBOL_BLOCK_VALUE (func))))
|
|
|
|
|
funname = SYMBOL_NAME (msymbol);
|
|
|
|
|
else
|
|
|
|
|
funname = SYMBOL_NAME (func);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
register struct minimal_symbol *msymbol =
|
1999-07-07 22:19:36 +02:00
|
|
|
|
lookup_minimal_symbol_by_pc (fi->pc);
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (msymbol != NULL)
|
|
|
|
|
funname = SYMBOL_NAME (msymbol);
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* If comname is NULL, we assume the user wishes to see the
|
1999-07-07 22:19:36 +02:00
|
|
|
|
which COMMON blocks are visible here and then return */
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (comname == 0)
|
|
|
|
|
{
|
|
|
|
|
list_all_visible_commons (funname);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
return;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
|
|
the_common = find_common_for_function (comname, funname);
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (the_common)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (STREQ (comname, BLANK_COMMON_NAME_LOCAL))
|
1999-04-16 03:35:26 +02:00
|
|
|
|
printf_filtered ("Contents of blank COMMON block:\n");
|
1999-07-07 22:19:36 +02:00
|
|
|
|
else
|
|
|
|
|
printf_filtered ("Contents of F77 COMMON block '%s':\n", comname);
|
|
|
|
|
|
|
|
|
|
printf_filtered ("\n");
|
|
|
|
|
entry = the_common->entries;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
while (entry != NULL)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
printf_filtered ("%s = ", SYMBOL_NAME (entry->symbol));
|
|
|
|
|
print_variable_value (entry->symbol, fi, gdb_stdout);
|
|
|
|
|
printf_filtered ("\n");
|
|
|
|
|
entry = entry->next;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
else
|
1999-04-16 03:35:26 +02:00
|
|
|
|
printf_filtered ("Cannot locate the common block %s in function '%s'\n",
|
1999-07-07 22:19:36 +02:00
|
|
|
|
comname, funname);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* This function is used to determine whether there is a
|
1999-07-07 22:19:36 +02:00
|
|
|
|
F77 common block visible at the current scope called 'comname'. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
|
static int
|
|
|
|
|
there_is_a_visible_common_named (comname)
|
|
|
|
|
char *comname;
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
SAVED_F77_COMMON_PTR the_common;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
register char *funname = 0;
|
|
|
|
|
struct symbol *func;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (comname == NULL)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("Cannot deal with NULL common name!");
|
|
|
|
|
|
|
|
|
|
fi = selected_frame;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (fi == NULL)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
error ("No frame selected");
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* The following is generally ripped off from stack.c's routine
|
1999-07-07 22:19:36 +02:00
|
|
|
|
print_frame_info() */
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
func = find_pc_function (fi->pc);
|
|
|
|
|
if (func)
|
|
|
|
|
{
|
|
|
|
|
/* In certain pathological cases, the symtabs give the wrong
|
1999-07-07 22:19:36 +02:00
|
|
|
|
function (when we are in the first function in a file which
|
|
|
|
|
is compiled without debugging symbols, the previous function
|
|
|
|
|
is compiled with debugging symbols, and the "foo.o" symbol
|
|
|
|
|
that is supposed to tell us where the file with debugging symbols
|
|
|
|
|
ends has been truncated by ar because it is longer than 15
|
|
|
|
|
characters).
|
|
|
|
|
|
|
|
|
|
So look in the minimal symbol tables as well, and if it comes
|
|
|
|
|
up with a larger address for the function use that instead.
|
|
|
|
|
I don't think this can ever cause any problems; there shouldn't
|
|
|
|
|
be any minimal symbols in the middle of a function.
|
|
|
|
|
FIXME: (Not necessarily true. What about text labels) */
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (fi->pc);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (msymbol != NULL
|
1999-07-07 22:19:36 +02:00
|
|
|
|
&& (SYMBOL_VALUE_ADDRESS (msymbol)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
> BLOCK_START (SYMBOL_BLOCK_VALUE (func))))
|
|
|
|
|
funname = SYMBOL_NAME (msymbol);
|
|
|
|
|
else
|
|
|
|
|
funname = SYMBOL_NAME (func);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
register struct minimal_symbol *msymbol =
|
|
|
|
|
lookup_minimal_symbol_by_pc (fi->pc);
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (msymbol != NULL)
|
|
|
|
|
funname = SYMBOL_NAME (msymbol);
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
|
|
the_common = find_common_for_function (comname, funname);
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return (the_common ? 1 : 0);
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
_initialize_f_valprint ()
|
|
|
|
|
{
|
|
|
|
|
add_info ("common", info_common_command,
|
|
|
|
|
"Print out the values contained in a Fortran COMMON block.");
|
|
|
|
|
if (xdb_commands)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
add_com ("lc", class_info, info_common_command,
|
|
|
|
|
"Print out the values contained in a Fortran COMMON block.");
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|