1999-04-16 03:35:26 +02:00
|
|
|
|
/* Print values for GDB, the GNU debugger.
|
2001-03-06 09:22:02 +01:00
|
|
|
|
Copyright 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996,
|
|
|
|
|
1997, 1998, 1999, 2000, 2001
|
1999-07-07 22:19:36 +02:00
|
|
|
|
Free Software Foundation, Inc.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
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 "value.h"
|
|
|
|
|
#include "gdbcore.h"
|
|
|
|
|
#include "gdbcmd.h"
|
|
|
|
|
#include "target.h"
|
|
|
|
|
#include "obstack.h"
|
|
|
|
|
#include "language.h"
|
|
|
|
|
#include "annotate.h"
|
|
|
|
|
#include "valprint.h"
|
2001-03-07 17:09:03 +01:00
|
|
|
|
#include "floatformat.h"
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
|
|
/* Prototypes for local functions */
|
|
|
|
|
|
1999-10-19 04:47:02 +02:00
|
|
|
|
static int partial_memory_read (CORE_ADDR memaddr, char *myaddr,
|
|
|
|
|
int len, int *errnoptr);
|
|
|
|
|
|
2000-02-02 01:21:19 +01:00
|
|
|
|
static void print_hex_chars (struct ui_file *, unsigned char *,
|
|
|
|
|
unsigned int);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void show_print (char *, int);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void set_print (char *, int);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void set_radix (char *, int);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void show_radix (char *, int);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void set_input_radix (char *, int, struct cmd_list_element *);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void set_input_radix_1 (int, unsigned);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void set_output_radix (char *, int, struct cmd_list_element *);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void set_output_radix_1 (int, unsigned);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
void _initialize_valprint (void);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Maximum number of chars to print for a string pointer value or vector
|
|
|
|
|
contents, or UINT_MAX for no limit. Note that "set print elements 0"
|
|
|
|
|
stores UINT_MAX in print_max, which displays in a show command as
|
|
|
|
|
"unlimited". */
|
|
|
|
|
|
|
|
|
|
unsigned int print_max;
|
|
|
|
|
#define PRINT_MAX_DEFAULT 200 /* Start print_max off at this value. */
|
|
|
|
|
|
|
|
|
|
/* Default input and output radixes, and output format letter. */
|
|
|
|
|
|
|
|
|
|
unsigned input_radix = 10;
|
|
|
|
|
unsigned output_radix = 10;
|
|
|
|
|
int output_format = 0;
|
|
|
|
|
|
|
|
|
|
/* Print repeat counts if there are more than this many repetitions of an
|
|
|
|
|
element in an array. Referenced by the low level language dependent
|
|
|
|
|
print routines. */
|
|
|
|
|
|
|
|
|
|
unsigned int repeat_count_threshold = 10;
|
|
|
|
|
|
|
|
|
|
/* If nonzero, stops printing of char arrays at first null. */
|
|
|
|
|
|
|
|
|
|
int stop_print_at_null;
|
|
|
|
|
|
|
|
|
|
/* Controls pretty printing of structures. */
|
|
|
|
|
|
|
|
|
|
int prettyprint_structs;
|
|
|
|
|
|
|
|
|
|
/* Controls pretty printing of arrays. */
|
|
|
|
|
|
|
|
|
|
int prettyprint_arrays;
|
|
|
|
|
|
|
|
|
|
/* If nonzero, causes unions inside structures or other unions to be
|
|
|
|
|
printed. */
|
|
|
|
|
|
|
|
|
|
int unionprint; /* Controls printing of nested unions. */
|
|
|
|
|
|
|
|
|
|
/* If nonzero, causes machine addresses to be printed in certain contexts. */
|
|
|
|
|
|
|
|
|
|
int addressprint; /* Controls printing of machine addresses */
|
|
|
|
|
|
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 using TYPE).
|
|
|
|
|
|
|
|
|
|
If DEREF_REF is nonzero, then dereference references, otherwise just print
|
|
|
|
|
them like pointers.
|
|
|
|
|
|
|
|
|
|
The PRETTY parameter controls prettyprinting.
|
|
|
|
|
|
|
|
|
|
If the data are a string pointer, returns the number of string characters
|
|
|
|
|
printed.
|
|
|
|
|
|
|
|
|
|
FIXME: The data at VALADDR is in target byte order. If gdb is ever
|
|
|
|
|
enhanced to be able to debug more than the single target it was compiled
|
|
|
|
|
for (specific CPU type and thus specific target byte ordering), then
|
|
|
|
|
either the print routines are going to have to take this into account,
|
|
|
|
|
or the data is going to have to be passed into here already converted
|
|
|
|
|
to the host byte ordering, whichever is more convenient. */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
2000-07-30 03:48:28 +02:00
|
|
|
|
val_print (struct type *type, char *valaddr, int embedded_offset,
|
|
|
|
|
CORE_ADDR address, struct ui_file *stream, int format, int deref_ref,
|
|
|
|
|
int recurse, enum val_prettyprint pretty)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
struct type *real_type = check_typedef (type);
|
|
|
|
|
if (pretty == Val_pretty_default)
|
|
|
|
|
{
|
|
|
|
|
pretty = prettyprint_structs ? Val_prettyprint : Val_no_prettyprint;
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
QUIT;
|
|
|
|
|
|
|
|
|
|
/* Ensure that the type is complete and not just a stub. If the type is
|
|
|
|
|
only a stub and we can't find and substitute its complete type, then
|
|
|
|
|
print appropriate string and return. */
|
|
|
|
|
|
|
|
|
|
if (TYPE_FLAGS (real_type) & TYPE_FLAG_STUB)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, "<incomplete type>");
|
|
|
|
|
gdb_flush (stream);
|
|
|
|
|
return (0);
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return (LA_VAL_PRINT (type, valaddr, embedded_offset, address,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
stream, format, deref_ref, recurse, pretty));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Print the value VAL in C-ish syntax on stream STREAM.
|
|
|
|
|
FORMAT is a format-letter, or 0 for print in natural format of data type.
|
|
|
|
|
If the object printed is a string pointer, returns
|
|
|
|
|
the number of string bytes printed. */
|
|
|
|
|
|
|
|
|
|
int
|
2000-07-30 03:48:28 +02:00
|
|
|
|
value_print (value_ptr val, struct ui_file *stream, int format,
|
|
|
|
|
enum val_prettyprint pretty)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
if (val == 0)
|
|
|
|
|
{
|
|
|
|
|
printf_filtered ("<address of value unknown>");
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
if (VALUE_OPTIMIZED_OUT (val))
|
|
|
|
|
{
|
|
|
|
|
printf_filtered ("<value optimized out>");
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
return LA_VALUE_PRINT (val, stream, format, pretty);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Called by various <lang>_val_print routines to print
|
|
|
|
|
TYPE_CODE_INT's. TYPE is the type. VALADDR is the address of the
|
|
|
|
|
value. STREAM is where to print the value. */
|
|
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
val_print_type_code_int (struct type *type, char *valaddr,
|
|
|
|
|
struct ui_file *stream)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
if (TYPE_LENGTH (type) > sizeof (LONGEST))
|
|
|
|
|
{
|
|
|
|
|
LONGEST val;
|
|
|
|
|
|
|
|
|
|
if (TYPE_UNSIGNED (type)
|
|
|
|
|
&& extract_long_unsigned_integer (valaddr, TYPE_LENGTH (type),
|
|
|
|
|
&val))
|
|
|
|
|
{
|
|
|
|
|
print_longest (stream, 'u', 0, val);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Signed, or we couldn't turn an unsigned value into a
|
|
|
|
|
LONGEST. For signed values, one could assume two's
|
|
|
|
|
complement (a reasonable assumption, I think) and do
|
|
|
|
|
better than this. */
|
|
|
|
|
print_hex_chars (stream, (unsigned char *) valaddr,
|
|
|
|
|
TYPE_LENGTH (type));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
#ifdef PRINT_TYPELESS_INTEGER
|
|
|
|
|
PRINT_TYPELESS_INTEGER (stream, type, unpack_long (type, valaddr));
|
|
|
|
|
#else
|
|
|
|
|
print_longest (stream, TYPE_UNSIGNED (type) ? 'u' : 'd', 0,
|
|
|
|
|
unpack_long (type, valaddr));
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Print a number according to FORMAT which is one of d,u,x,o,b,h,w,g.
|
|
|
|
|
The raison d'etre of this function is to consolidate printing of
|
|
|
|
|
LONG_LONG's into this one function. Some platforms have long longs but
|
|
|
|
|
don't have a printf() that supports "ll" in the format string. We handle
|
|
|
|
|
these by seeing if the number is representable as either a signed or
|
|
|
|
|
unsigned long, depending upon what format is desired, and if not we just
|
|
|
|
|
bail out and print the number in hex.
|
|
|
|
|
|
|
|
|
|
The format chars b,h,w,g are from print_scalar_formatted(). If USE_LOCAL,
|
|
|
|
|
format it according to the current language (this should be used for most
|
|
|
|
|
integers which GDB prints, the exception is things like protocols where
|
|
|
|
|
the format of the integer is a protocol thing, not a user-visible thing).
|
1999-07-07 22:19:36 +02:00
|
|
|
|
*/
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
#if defined (CC_HAS_LONG_LONG) && !defined (PRINTF_HAS_LONG_LONG)
|
2000-02-02 01:21:19 +01:00
|
|
|
|
static void print_decimal (struct ui_file * stream, char *sign,
|
|
|
|
|
int use_local, ULONGEST val_ulong);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
print_decimal (struct ui_file *stream, char *sign, int use_local,
|
|
|
|
|
ULONGEST val_ulong)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
unsigned long temp[3];
|
|
|
|
|
int i = 0;
|
|
|
|
|
do
|
|
|
|
|
{
|
|
|
|
|
temp[i] = val_ulong % (1000 * 1000 * 1000);
|
|
|
|
|
val_ulong /= (1000 * 1000 * 1000);
|
|
|
|
|
i++;
|
|
|
|
|
}
|
|
|
|
|
while (val_ulong != 0 && i < (sizeof (temp) / sizeof (temp[0])));
|
|
|
|
|
switch (i)
|
|
|
|
|
{
|
|
|
|
|
case 1:
|
|
|
|
|
fprintf_filtered (stream, "%s%lu",
|
|
|
|
|
sign, temp[0]);
|
|
|
|
|
break;
|
|
|
|
|
case 2:
|
|
|
|
|
fprintf_filtered (stream, "%s%lu%09lu",
|
|
|
|
|
sign, temp[1], temp[0]);
|
|
|
|
|
break;
|
|
|
|
|
case 3:
|
|
|
|
|
fprintf_filtered (stream, "%s%lu%09lu%09lu",
|
|
|
|
|
sign, temp[2], temp[1], temp[0]);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
2001-02-25 05:45:12 +01:00
|
|
|
|
internal_error (__FILE__, __LINE__, "failed internal consistency check");
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
print_longest (struct ui_file *stream, int format, int use_local,
|
|
|
|
|
LONGEST val_long)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
#if defined (CC_HAS_LONG_LONG) && !defined (PRINTF_HAS_LONG_LONG)
|
|
|
|
|
if (sizeof (long) < sizeof (LONGEST))
|
|
|
|
|
{
|
|
|
|
|
switch (format)
|
|
|
|
|
{
|
|
|
|
|
case 'd':
|
|
|
|
|
{
|
|
|
|
|
/* Print a signed value, that doesn't fit in a long */
|
|
|
|
|
if ((long) val_long != val_long)
|
|
|
|
|
{
|
|
|
|
|
if (val_long < 0)
|
|
|
|
|
print_decimal (stream, "-", use_local, -val_long);
|
|
|
|
|
else
|
|
|
|
|
print_decimal (stream, "", use_local, val_long);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case 'u':
|
|
|
|
|
{
|
|
|
|
|
/* Print an unsigned value, that doesn't fit in a long */
|
|
|
|
|
if ((unsigned long) val_long != (ULONGEST) val_long)
|
|
|
|
|
{
|
|
|
|
|
print_decimal (stream, "", use_local, val_long);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case 'x':
|
|
|
|
|
case 'o':
|
|
|
|
|
case 'b':
|
|
|
|
|
case 'h':
|
|
|
|
|
case 'w':
|
|
|
|
|
case 'g':
|
|
|
|
|
/* Print as unsigned value, must fit completely in unsigned long */
|
|
|
|
|
{
|
|
|
|
|
unsigned long temp = val_long;
|
|
|
|
|
if (temp != val_long)
|
|
|
|
|
{
|
|
|
|
|
/* Urk, can't represent value in long so print in hex.
|
|
|
|
|
Do shift in two operations so that if sizeof (long)
|
|
|
|
|
== sizeof (LONGEST) we can avoid warnings from
|
|
|
|
|
picky compilers about shifts >= the size of the
|
|
|
|
|
shiftee in bits */
|
|
|
|
|
unsigned long vbot = (unsigned long) val_long;
|
|
|
|
|
LONGEST temp = (val_long >> (sizeof (long) * HOST_CHAR_BIT - 1));
|
|
|
|
|
unsigned long vtop = temp >> 1;
|
|
|
|
|
fprintf_filtered (stream, "0x%lx%08lx", vtop, vbot);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined (CC_HAS_LONG_LONG) && defined (PRINTF_HAS_LONG_LONG)
|
|
|
|
|
switch (format)
|
|
|
|
|
{
|
|
|
|
|
case 'd':
|
|
|
|
|
fprintf_filtered (stream,
|
|
|
|
|
use_local ? local_decimal_format_custom ("ll")
|
1999-07-07 22:19:36 +02:00
|
|
|
|
: "%lld",
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'u':
|
|
|
|
|
fprintf_filtered (stream, "%llu", val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'x':
|
|
|
|
|
fprintf_filtered (stream,
|
|
|
|
|
use_local ? local_hex_format_custom ("ll")
|
1999-07-07 22:19:36 +02:00
|
|
|
|
: "%llx",
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'o':
|
|
|
|
|
fprintf_filtered (stream,
|
|
|
|
|
use_local ? local_octal_format_custom ("ll")
|
1999-07-07 22:19:36 +02:00
|
|
|
|
: "%llo",
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'b':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("02ll"), val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'h':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("04ll"), val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'w':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("08ll"), val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'g':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("016ll"), val_long);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
2001-02-25 05:45:12 +01:00
|
|
|
|
internal_error (__FILE__, __LINE__, "failed internal consistency check");
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
#else /* !CC_HAS_LONG_LONG || !PRINTF_HAS_LONG_LONG */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* In the following it is important to coerce (val_long) to a long. It does
|
|
|
|
|
nothing if !LONG_LONG, but it will chop off the top half (which we know
|
|
|
|
|
we can ignore) if the host supports long longs. */
|
|
|
|
|
|
|
|
|
|
switch (format)
|
|
|
|
|
{
|
|
|
|
|
case 'd':
|
|
|
|
|
fprintf_filtered (stream,
|
|
|
|
|
use_local ? local_decimal_format_custom ("l")
|
1999-07-07 22:19:36 +02:00
|
|
|
|
: "%ld",
|
1999-04-16 03:35:26 +02:00
|
|
|
|
(long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'u':
|
|
|
|
|
fprintf_filtered (stream, "%lu", (unsigned long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'x':
|
|
|
|
|
fprintf_filtered (stream,
|
|
|
|
|
use_local ? local_hex_format_custom ("l")
|
1999-07-07 22:19:36 +02:00
|
|
|
|
: "%lx",
|
1999-04-16 03:35:26 +02:00
|
|
|
|
(unsigned long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'o':
|
|
|
|
|
fprintf_filtered (stream,
|
|
|
|
|
use_local ? local_octal_format_custom ("l")
|
1999-07-07 22:19:36 +02:00
|
|
|
|
: "%lo",
|
1999-04-16 03:35:26 +02:00
|
|
|
|
(unsigned long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'b':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("02l"),
|
|
|
|
|
(unsigned long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'h':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("04l"),
|
|
|
|
|
(unsigned long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'w':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("08l"),
|
|
|
|
|
(unsigned long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'g':
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_custom ("016l"),
|
|
|
|
|
(unsigned long) val_long);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
2001-02-25 05:45:12 +01:00
|
|
|
|
internal_error (__FILE__, __LINE__, "failed internal consistency check");
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
#endif /* CC_HAS_LONG_LONG || PRINTF_HAS_LONG_LONG */
|
|
|
|
|
}
|
|
|
|
|
|
1999-04-26 20:34:20 +02:00
|
|
|
|
#if 0
|
1999-04-16 03:35:26 +02:00
|
|
|
|
void
|
2000-11-08 06:10:18 +01:00
|
|
|
|
strcat_longest (int format, int use_local, LONGEST val_long, char *buf,
|
|
|
|
|
int buflen)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2000-11-08 06:10:18 +01:00
|
|
|
|
/* FIXME: Use buflen to avoid buffer overflow. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
#if defined (CC_HAS_LONG_LONG) && !defined (PRINTF_HAS_LONG_LONG)
|
|
|
|
|
long vtop, vbot;
|
|
|
|
|
|
|
|
|
|
vtop = val_long >> (sizeof (long) * HOST_CHAR_BIT);
|
|
|
|
|
vbot = (long) val_long;
|
|
|
|
|
|
|
|
|
|
if ((format == 'd' && (val_long < INT_MIN || val_long > INT_MAX))
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|| ((format == 'u' || format == 'x') && (unsigned long long) val_long > UINT_MAX))
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
sprintf (buf, "0x%lx%08lx", vtop, vbot);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifdef PRINTF_HAS_LONG_LONG
|
|
|
|
|
switch (format)
|
|
|
|
|
{
|
|
|
|
|
case 'd':
|
|
|
|
|
sprintf (buf,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(use_local ? local_decimal_format_custom ("ll") : "%lld"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'u':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, "%llu", val_long);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 'x':
|
|
|
|
|
sprintf (buf,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(use_local ? local_hex_format_custom ("ll") : "%llx"),
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'o':
|
|
|
|
|
sprintf (buf,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(use_local ? local_octal_format_custom ("ll") : "%llo"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
val_long);
|
|
|
|
|
break;
|
|
|
|
|
case 'b':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, local_hex_format_custom ("02ll"), val_long);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 'h':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, local_hex_format_custom ("04ll"), val_long);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 'w':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, local_hex_format_custom ("08ll"), val_long);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 'g':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, local_hex_format_custom ("016ll"), val_long);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
default:
|
2001-02-25 05:45:12 +01:00
|
|
|
|
internal_error (__FILE__, __LINE__, "failed internal consistency check");
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
#else /* !PRINTF_HAS_LONG_LONG */
|
|
|
|
|
/* In the following it is important to coerce (val_long) to a long. It does
|
|
|
|
|
nothing if !LONG_LONG, but it will chop off the top half (which we know
|
|
|
|
|
we can ignore) if the host supports long longs. */
|
|
|
|
|
|
|
|
|
|
switch (format)
|
|
|
|
|
{
|
|
|
|
|
case 'd':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, (use_local ? local_decimal_format_custom ("l") : "%ld"),
|
|
|
|
|
((long) val_long));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 'u':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, "%lu", ((unsigned long) val_long));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 'x':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, (use_local ? local_hex_format_custom ("l") : "%lx"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
((long) val_long));
|
|
|
|
|
break;
|
|
|
|
|
case 'o':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, (use_local ? local_octal_format_custom ("l") : "%lo"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
((long) val_long));
|
|
|
|
|
break;
|
|
|
|
|
case 'b':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, local_hex_format_custom ("02l"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
((long) val_long));
|
|
|
|
|
break;
|
|
|
|
|
case 'h':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, local_hex_format_custom ("04l"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
((long) val_long));
|
|
|
|
|
break;
|
|
|
|
|
case 'w':
|
1999-07-07 22:19:36 +02:00
|
|
|
|
sprintf (buf, local_hex_format_custom ("08l"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
((long) val_long));
|
|
|
|
|
break;
|
|
|
|
|
case 'g':
|
|
|
|
|
sprintf (buf, local_hex_format_custom ("016l"),
|
|
|
|
|
((long) val_long));
|
|
|
|
|
break;
|
|
|
|
|
default:
|
2001-02-25 05:45:12 +01:00
|
|
|
|
internal_error (__FILE__, __LINE__, "failed internal consistency check");
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
#endif /* !PRINTF_HAS_LONG_LONG */
|
|
|
|
|
}
|
1999-04-26 20:34:20 +02:00
|
|
|
|
#endif
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* This used to be a macro, but I don't think it is called often enough
|
|
|
|
|
to merit such treatment. */
|
|
|
|
|
/* Convert a LONGEST to an int. This is used in contexts (e.g. number of
|
|
|
|
|
arguments to a function, number in a value history, register number, etc.)
|
|
|
|
|
where the value must not be larger than can fit in an int. */
|
|
|
|
|
|
|
|
|
|
int
|
2000-07-30 03:48:28 +02:00
|
|
|
|
longest_to_int (LONGEST arg)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* Let the compiler do the work */
|
|
|
|
|
int rtnval = (int) arg;
|
|
|
|
|
|
|
|
|
|
/* Check for overflows or underflows */
|
|
|
|
|
if (sizeof (LONGEST) > sizeof (int))
|
|
|
|
|
{
|
|
|
|
|
if (rtnval != arg)
|
|
|
|
|
{
|
|
|
|
|
error ("Value out of range.");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return (rtnval);
|
|
|
|
|
}
|
|
|
|
|
|
2001-03-07 17:09:03 +01:00
|
|
|
|
/* Print a floating point value of type TYPE, pointed to in GDB by
|
|
|
|
|
VALADDR, on STREAM. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
print_floating (char *valaddr, struct type *type, struct ui_file *stream)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
DOUBLEST doub;
|
|
|
|
|
int inv;
|
2001-03-07 17:09:03 +01:00
|
|
|
|
const struct floatformat *fmt = &floatformat_unknown;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
unsigned len = TYPE_LENGTH (type);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
2001-03-07 17:09:03 +01:00
|
|
|
|
/* FIXME: kettenis/2001-01-20: The check for IEEE_FLOAT is probably
|
|
|
|
|
still necessary since GDB by default assumes that the target uses
|
|
|
|
|
the IEEE 754 representation for its floats and doubles. Of
|
|
|
|
|
course this is all crock and should be cleaned up. */
|
Bring IEEE_FLOAT under gdbarch's control.
* gdbarch.sh (IEEE_FLOAT): New entry.
* gdbarch.c, gdbarch.h: Regenerated.
* valprint.c (IEEE_FLOAT): Provide a default #definition for this.
(print_floating): Use IEEE_FLOAT as if it were an expression; use
the code specific to IEEE-format numbers whenever the value of
IEEE_FLOAT is non-zero.
* config/a29k/tm-a29k.h, config/alpha/tm-alpha.h,
config/arc/tm-arc.h, config/arm/tm-arm.h, config/fr30/tm-fr30.h,
config/h8300/tm-h8300.h, config/i386/tm-i386.h,
config/i960/tm-i960.h, config/m88k/tm-m88k.h,
config/mips/tm-mips.h, config/pa/tm-hppa.h,
config/sparc/tm-sparc.h, config/delta/tm-delta.h,
config/frv/tm-frv.h (IEEE_FLOAT): For all ports that #define
IEEE_FLOAT, make sure they give it the value (1).
2000-04-14 21:14:19 +02:00
|
|
|
|
|
2001-03-07 17:09:03 +01:00
|
|
|
|
if (len == TARGET_FLOAT_BIT / TARGET_CHAR_BIT && IEEE_FLOAT)
|
|
|
|
|
fmt = TARGET_FLOAT_FORMAT;
|
|
|
|
|
else if (len == TARGET_DOUBLE_BIT / TARGET_CHAR_BIT && IEEE_FLOAT)
|
|
|
|
|
fmt = TARGET_DOUBLE_FORMAT;
|
|
|
|
|
else if (len == TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT)
|
|
|
|
|
fmt = TARGET_LONG_DOUBLE_FORMAT;
|
Bring IEEE_FLOAT under gdbarch's control.
* gdbarch.sh (IEEE_FLOAT): New entry.
* gdbarch.c, gdbarch.h: Regenerated.
* valprint.c (IEEE_FLOAT): Provide a default #definition for this.
(print_floating): Use IEEE_FLOAT as if it were an expression; use
the code specific to IEEE-format numbers whenever the value of
IEEE_FLOAT is non-zero.
* config/a29k/tm-a29k.h, config/alpha/tm-alpha.h,
config/arc/tm-arc.h, config/arm/tm-arm.h, config/fr30/tm-fr30.h,
config/h8300/tm-h8300.h, config/i386/tm-i386.h,
config/i960/tm-i960.h, config/m88k/tm-m88k.h,
config/mips/tm-mips.h, config/pa/tm-hppa.h,
config/sparc/tm-sparc.h, config/delta/tm-delta.h,
config/frv/tm-frv.h (IEEE_FLOAT): For all ports that #define
IEEE_FLOAT, make sure they give it the value (1).
2000-04-14 21:14:19 +02:00
|
|
|
|
|
2001-03-07 17:09:03 +01:00
|
|
|
|
if (floatformat_is_nan (fmt, valaddr))
|
|
|
|
|
{
|
|
|
|
|
if (floatformat_is_negative (fmt, valaddr))
|
|
|
|
|
fprintf_filtered (stream, "-");
|
|
|
|
|
fprintf_filtered (stream, "nan(");
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_prefix ());
|
|
|
|
|
fprintf_filtered (stream, floatformat_mantissa (fmt, valaddr));
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_suffix ());
|
|
|
|
|
fprintf_filtered (stream, ")");
|
|
|
|
|
return;
|
Bring IEEE_FLOAT under gdbarch's control.
* gdbarch.sh (IEEE_FLOAT): New entry.
* gdbarch.c, gdbarch.h: Regenerated.
* valprint.c (IEEE_FLOAT): Provide a default #definition for this.
(print_floating): Use IEEE_FLOAT as if it were an expression; use
the code specific to IEEE-format numbers whenever the value of
IEEE_FLOAT is non-zero.
* config/a29k/tm-a29k.h, config/alpha/tm-alpha.h,
config/arc/tm-arc.h, config/arm/tm-arm.h, config/fr30/tm-fr30.h,
config/h8300/tm-h8300.h, config/i386/tm-i386.h,
config/i960/tm-i960.h, config/m88k/tm-m88k.h,
config/mips/tm-mips.h, config/pa/tm-hppa.h,
config/sparc/tm-sparc.h, config/delta/tm-delta.h,
config/frv/tm-frv.h (IEEE_FLOAT): For all ports that #define
IEEE_FLOAT, make sure they give it the value (1).
2000-04-14 21:14:19 +02:00
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
doub = unpack_double (type, valaddr, &inv);
|
|
|
|
|
if (inv)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, "<invalid float value>");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2001-03-07 17:09:03 +01:00
|
|
|
|
/* FIXME: kettenis/2001-01-20: The following code makes too much
|
|
|
|
|
assumptions about the host and target floating point format. */
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (len < sizeof (double))
|
1999-07-07 22:19:36 +02:00
|
|
|
|
fprintf_filtered (stream, "%.9g", (double) doub);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
else if (len == sizeof (double))
|
1999-07-07 22:19:36 +02:00
|
|
|
|
fprintf_filtered (stream, "%.17g", (double) doub);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
else
|
|
|
|
|
#ifdef PRINTF_HAS_LONG_DOUBLE
|
|
|
|
|
fprintf_filtered (stream, "%.35Lg", doub);
|
|
|
|
|
#else
|
2001-03-07 17:09:03 +01:00
|
|
|
|
/* This at least wins with values that are representable as
|
|
|
|
|
doubles. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, "%.17g", (double) doub);
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
print_binary_chars (struct ui_file *stream, unsigned char *valaddr,
|
|
|
|
|
unsigned len)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
#define BITS_IN_BYTES 8
|
|
|
|
|
|
|
|
|
|
unsigned char *p;
|
2000-02-08 05:39:02 +01:00
|
|
|
|
unsigned int i;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int b;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Declared "int" so it will be signed.
|
|
|
|
|
* This ensures that right shift will shift in zeros.
|
|
|
|
|
*/
|
1999-07-07 22:19:36 +02:00
|
|
|
|
const int mask = 0x080;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* FIXME: We should be not printing leading zeroes in most cases. */
|
|
|
|
|
|
|
|
|
|
fprintf_filtered (stream, local_binary_format_prefix ());
|
|
|
|
|
if (TARGET_BYTE_ORDER == BIG_ENDIAN)
|
|
|
|
|
{
|
|
|
|
|
for (p = valaddr;
|
|
|
|
|
p < valaddr + len;
|
|
|
|
|
p++)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
/* Every byte has 8 binary characters; peel off
|
|
|
|
|
* and print from the MSB end.
|
|
|
|
|
*/
|
|
|
|
|
for (i = 0; i < (BITS_IN_BYTES * sizeof (*p)); i++)
|
|
|
|
|
{
|
|
|
|
|
if (*p & (mask >> i))
|
|
|
|
|
b = 1;
|
|
|
|
|
else
|
|
|
|
|
b = 0;
|
|
|
|
|
|
|
|
|
|
fprintf_filtered (stream, "%1d", b);
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
for (p = valaddr + len - 1;
|
|
|
|
|
p >= valaddr;
|
|
|
|
|
p--)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
for (i = 0; i < (BITS_IN_BYTES * sizeof (*p)); i++)
|
|
|
|
|
{
|
|
|
|
|
if (*p & (mask >> i))
|
|
|
|
|
b = 1;
|
|
|
|
|
else
|
|
|
|
|
b = 0;
|
|
|
|
|
|
|
|
|
|
fprintf_filtered (stream, "%1d", b);
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
fprintf_filtered (stream, local_binary_format_suffix ());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* VALADDR points to an integer of LEN bytes.
|
|
|
|
|
* Print it in octal on stream or format it in buf.
|
|
|
|
|
*/
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
print_octal_chars (struct ui_file *stream, unsigned char *valaddr, unsigned len)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
unsigned char *p;
|
|
|
|
|
unsigned char octa1, octa2, octa3, carry;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int cycle;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* FIXME: We should be not printing leading zeroes in most cases. */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Octal is 3 bits, which doesn't fit. Yuk. So we have to track
|
|
|
|
|
* the extra bits, which cycle every three bytes:
|
|
|
|
|
*
|
|
|
|
|
* Byte side: 0 1 2 3
|
|
|
|
|
* | | | |
|
|
|
|
|
* bit number 123 456 78 | 9 012 345 6 | 78 901 234 | 567 890 12 |
|
|
|
|
|
*
|
|
|
|
|
* Octal side: 0 1 carry 3 4 carry ...
|
|
|
|
|
*
|
|
|
|
|
* Cycle number: 0 1 2
|
|
|
|
|
*
|
|
|
|
|
* But of course we are printing from the high side, so we have to
|
|
|
|
|
* figure out where in the cycle we are so that we end up with no
|
|
|
|
|
* left over bits at the end.
|
|
|
|
|
*/
|
|
|
|
|
#define BITS_IN_OCTAL 3
|
|
|
|
|
#define HIGH_ZERO 0340
|
|
|
|
|
#define LOW_ZERO 0016
|
|
|
|
|
#define CARRY_ZERO 0003
|
|
|
|
|
#define HIGH_ONE 0200
|
|
|
|
|
#define MID_ONE 0160
|
|
|
|
|
#define LOW_ONE 0016
|
|
|
|
|
#define CARRY_ONE 0001
|
|
|
|
|
#define HIGH_TWO 0300
|
|
|
|
|
#define MID_TWO 0070
|
|
|
|
|
#define LOW_TWO 0007
|
|
|
|
|
|
|
|
|
|
/* For 32 we start in cycle 2, with two bits and one bit carry;
|
|
|
|
|
* for 64 in cycle in cycle 1, with one bit and a two bit carry.
|
|
|
|
|
*/
|
|
|
|
|
cycle = (len * BITS_IN_BYTES) % BITS_IN_OCTAL;
|
|
|
|
|
carry = 0;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, local_octal_format_prefix ());
|
|
|
|
|
if (TARGET_BYTE_ORDER == BIG_ENDIAN)
|
|
|
|
|
{
|
|
|
|
|
for (p = valaddr;
|
|
|
|
|
p < valaddr + len;
|
|
|
|
|
p++)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
switch (cycle)
|
|
|
|
|
{
|
|
|
|
|
case 0:
|
|
|
|
|
/* No carry in, carry out two bits.
|
|
|
|
|
*/
|
|
|
|
|
octa1 = (HIGH_ZERO & *p) >> 5;
|
|
|
|
|
octa2 = (LOW_ZERO & *p) >> 2;
|
|
|
|
|
carry = (CARRY_ZERO & *p);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa1);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa2);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 1:
|
|
|
|
|
/* Carry in two bits, carry out one bit.
|
|
|
|
|
*/
|
|
|
|
|
octa1 = (carry << 1) | ((HIGH_ONE & *p) >> 7);
|
|
|
|
|
octa2 = (MID_ONE & *p) >> 4;
|
|
|
|
|
octa3 = (LOW_ONE & *p) >> 1;
|
|
|
|
|
carry = (CARRY_ONE & *p);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa1);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa2);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa3);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 2:
|
|
|
|
|
/* Carry in one bit, no carry out.
|
|
|
|
|
*/
|
|
|
|
|
octa1 = (carry << 2) | ((HIGH_TWO & *p) >> 6);
|
|
|
|
|
octa2 = (MID_TWO & *p) >> 3;
|
|
|
|
|
octa3 = (LOW_TWO & *p);
|
|
|
|
|
carry = 0;
|
|
|
|
|
fprintf_filtered (stream, "%o", octa1);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa2);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa3);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
error ("Internal error in octal conversion;");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
cycle++;
|
|
|
|
|
cycle = cycle % BITS_IN_OCTAL;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
for (p = valaddr + len - 1;
|
|
|
|
|
p >= valaddr;
|
|
|
|
|
p--)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
switch (cycle)
|
|
|
|
|
{
|
|
|
|
|
case 0:
|
|
|
|
|
/* Carry out, no carry in */
|
|
|
|
|
octa1 = (HIGH_ZERO & *p) >> 5;
|
|
|
|
|
octa2 = (LOW_ZERO & *p) >> 2;
|
|
|
|
|
carry = (CARRY_ZERO & *p);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa1);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa2);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 1:
|
|
|
|
|
/* Carry in, carry out */
|
|
|
|
|
octa1 = (carry << 1) | ((HIGH_ONE & *p) >> 7);
|
|
|
|
|
octa2 = (MID_ONE & *p) >> 4;
|
|
|
|
|
octa3 = (LOW_ONE & *p) >> 1;
|
|
|
|
|
carry = (CARRY_ONE & *p);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa1);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa2);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa3);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 2:
|
|
|
|
|
/* Carry in, no carry out */
|
|
|
|
|
octa1 = (carry << 2) | ((HIGH_TWO & *p) >> 6);
|
|
|
|
|
octa2 = (MID_TWO & *p) >> 3;
|
|
|
|
|
octa3 = (LOW_TWO & *p);
|
|
|
|
|
carry = 0;
|
|
|
|
|
fprintf_filtered (stream, "%o", octa1);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa2);
|
|
|
|
|
fprintf_filtered (stream, "%o", octa3);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
error ("Internal error in octal conversion;");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
cycle++;
|
|
|
|
|
cycle = cycle % BITS_IN_OCTAL;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fprintf_filtered (stream, local_octal_format_suffix ());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* VALADDR points to an integer of LEN bytes.
|
|
|
|
|
* Print it in decimal on stream or format it in buf.
|
|
|
|
|
*/
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
print_decimal_chars (struct ui_file *stream, unsigned char *valaddr,
|
|
|
|
|
unsigned len)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
#define TEN 10
|
|
|
|
|
#define TWO_TO_FOURTH 16
|
1999-07-07 22:19:36 +02:00
|
|
|
|
#define CARRY_OUT( x ) ((x) / TEN) /* extend char to int */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
#define CARRY_LEFT( x ) ((x) % TEN)
|
|
|
|
|
#define SHIFT( x ) ((x) << 4)
|
|
|
|
|
#define START_P \
|
|
|
|
|
((TARGET_BYTE_ORDER == BIG_ENDIAN) ? valaddr : valaddr + len - 1)
|
|
|
|
|
#define NOT_END_P \
|
|
|
|
|
((TARGET_BYTE_ORDER == BIG_ENDIAN) ? (p < valaddr + len) : (p >= valaddr))
|
|
|
|
|
#define NEXT_P \
|
|
|
|
|
((TARGET_BYTE_ORDER == BIG_ENDIAN) ? p++ : p-- )
|
|
|
|
|
#define LOW_NIBBLE( x ) ( (x) & 0x00F)
|
|
|
|
|
#define HIGH_NIBBLE( x ) (((x) & 0x0F0) >> 4)
|
|
|
|
|
|
|
|
|
|
unsigned char *p;
|
|
|
|
|
unsigned char *digits;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int carry;
|
|
|
|
|
int decimal_len;
|
|
|
|
|
int i, j, decimal_digits;
|
|
|
|
|
int dummy;
|
|
|
|
|
int flip;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Base-ten number is less than twice as many digits
|
|
|
|
|
* as the base 16 number, which is 2 digits per byte.
|
|
|
|
|
*/
|
|
|
|
|
decimal_len = len * 2 * 2;
|
2001-03-20 02:37:10 +01:00
|
|
|
|
digits = xmalloc (decimal_len);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
for (i = 0; i < decimal_len; i++)
|
|
|
|
|
{
|
1999-04-16 03:35:26 +02:00
|
|
|
|
digits[i] = 0;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
fprintf_filtered (stream, local_decimal_format_prefix ());
|
|
|
|
|
|
|
|
|
|
/* Ok, we have an unknown number of bytes of data to be printed in
|
|
|
|
|
* decimal.
|
|
|
|
|
*
|
|
|
|
|
* Given a hex number (in nibbles) as XYZ, we start by taking X and
|
|
|
|
|
* decemalizing it as "x1 x2" in two decimal nibbles. Then we multiply
|
|
|
|
|
* the nibbles by 16, add Y and re-decimalize. Repeat with Z.
|
|
|
|
|
*
|
|
|
|
|
* The trick is that "digits" holds a base-10 number, but sometimes
|
|
|
|
|
* the individual digits are > 10.
|
|
|
|
|
*
|
|
|
|
|
* Outer loop is per nibble (hex digit) of input, from MSD end to
|
|
|
|
|
* LSD end.
|
|
|
|
|
*/
|
1999-07-07 22:19:36 +02:00
|
|
|
|
decimal_digits = 0; /* Number of decimal digits so far */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
p = START_P;
|
|
|
|
|
flip = 0;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
while (NOT_END_P)
|
|
|
|
|
{
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/*
|
|
|
|
|
* Multiply current base-ten number by 16 in place.
|
|
|
|
|
* Each digit was between 0 and 9, now is between
|
|
|
|
|
* 0 and 144.
|
|
|
|
|
*/
|
1999-07-07 22:19:36 +02:00
|
|
|
|
for (j = 0; j < decimal_digits; j++)
|
|
|
|
|
{
|
|
|
|
|
digits[j] = SHIFT (digits[j]);
|
|
|
|
|
}
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Take the next nibble off the input and add it to what
|
|
|
|
|
* we've got in the LSB position. Bottom 'digit' is now
|
|
|
|
|
* between 0 and 159.
|
|
|
|
|
*
|
|
|
|
|
* "flip" is used to run this loop twice for each byte.
|
|
|
|
|
*/
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (flip == 0)
|
|
|
|
|
{
|
|
|
|
|
/* Take top nibble.
|
|
|
|
|
*/
|
|
|
|
|
digits[0] += HIGH_NIBBLE (*p);
|
|
|
|
|
flip = 1;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Take low nibble and bump our pointer "p".
|
|
|
|
|
*/
|
|
|
|
|
digits[0] += LOW_NIBBLE (*p);
|
|
|
|
|
NEXT_P;
|
|
|
|
|
flip = 0;
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Re-decimalize. We have to do this often enough
|
|
|
|
|
* that we don't overflow, but once per nibble is
|
|
|
|
|
* overkill. Easier this way, though. Note that the
|
|
|
|
|
* carry is often larger than 10 (e.g. max initial
|
|
|
|
|
* carry out of lowest nibble is 15, could bubble all
|
|
|
|
|
* the way up greater than 10). So we have to do
|
|
|
|
|
* the carrying beyond the last current digit.
|
|
|
|
|
*/
|
|
|
|
|
carry = 0;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
for (j = 0; j < decimal_len - 1; j++)
|
|
|
|
|
{
|
|
|
|
|
digits[j] += carry;
|
|
|
|
|
|
|
|
|
|
/* "/" won't handle an unsigned char with
|
|
|
|
|
* a value that if signed would be negative.
|
|
|
|
|
* So extend to longword int via "dummy".
|
|
|
|
|
*/
|
|
|
|
|
dummy = digits[j];
|
|
|
|
|
carry = CARRY_OUT (dummy);
|
|
|
|
|
digits[j] = CARRY_LEFT (dummy);
|
|
|
|
|
|
|
|
|
|
if (j >= decimal_digits && carry == 0)
|
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* All higher digits are 0 and we
|
|
|
|
|
* no longer have a carry.
|
|
|
|
|
*
|
|
|
|
|
* Note: "j" is 0-based, "decimal_digits" is
|
|
|
|
|
* 1-based.
|
|
|
|
|
*/
|
|
|
|
|
decimal_digits = j + 1;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Ok, now "digits" is the decimal representation, with
|
|
|
|
|
* the "decimal_digits" actual digits. Print!
|
|
|
|
|
*/
|
1999-07-07 22:19:36 +02:00
|
|
|
|
for (i = decimal_digits - 1; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, "%1d", digits[i]);
|
|
|
|
|
}
|
2000-12-15 02:01:51 +01:00
|
|
|
|
xfree (digits);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (stream, local_decimal_format_suffix ());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* VALADDR points to an integer of LEN bytes. Print it in hex on stream. */
|
|
|
|
|
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
print_hex_chars (struct ui_file *stream, unsigned char *valaddr, unsigned len)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
unsigned char *p;
|
|
|
|
|
|
|
|
|
|
/* FIXME: We should be not printing leading zeroes in most cases. */
|
|
|
|
|
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_prefix ());
|
|
|
|
|
if (TARGET_BYTE_ORDER == BIG_ENDIAN)
|
|
|
|
|
{
|
|
|
|
|
for (p = valaddr;
|
|
|
|
|
p < valaddr + len;
|
|
|
|
|
p++)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, "%02x", *p);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
for (p = valaddr + len - 1;
|
|
|
|
|
p >= valaddr;
|
|
|
|
|
p--)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, "%02x", *p);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
fprintf_filtered (stream, local_hex_format_suffix ());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Called by various <lang>_val_print routines to print elements of an
|
1999-07-07 22:19:36 +02:00
|
|
|
|
array in the form "<elem1>, <elem2>, <elem3>, ...".
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(FIXME?) Assumes array element separator is a comma, which is correct
|
|
|
|
|
for all languages currently handled.
|
|
|
|
|
(FIXME?) Some languages have a notation for repeated array elements,
|
|
|
|
|
perhaps we should try to use that notation when appropriate.
|
|
|
|
|
*/
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
val_print_array_elements (struct type *type, char *valaddr, CORE_ADDR address,
|
|
|
|
|
struct ui_file *stream, int format, int deref_ref,
|
|
|
|
|
int recurse, enum val_prettyprint pretty,
|
|
|
|
|
unsigned int i)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
unsigned int things_printed = 0;
|
|
|
|
|
unsigned len;
|
|
|
|
|
struct type *elttype;
|
|
|
|
|
unsigned eltlen;
|
|
|
|
|
/* Position of the array element we are examining to see
|
|
|
|
|
whether it is repeated. */
|
|
|
|
|
unsigned int rep1;
|
|
|
|
|
/* Number of repetitions we have detected so far. */
|
|
|
|
|
unsigned int reps;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
elttype = TYPE_TARGET_TYPE (type);
|
|
|
|
|
eltlen = TYPE_LENGTH (check_typedef (elttype));
|
|
|
|
|
len = TYPE_LENGTH (type) / eltlen;
|
|
|
|
|
|
|
|
|
|
annotate_array_section_begin (i, elttype);
|
|
|
|
|
|
|
|
|
|
for (; i < len && things_printed < print_max; i++)
|
|
|
|
|
{
|
|
|
|
|
if (i != 0)
|
|
|
|
|
{
|
|
|
|
|
if (prettyprint_arrays)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, ",\n");
|
|
|
|
|
print_spaces_filtered (2 + 2 * recurse, stream);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, ", ");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
wrap_here (n_spaces (2 + 2 * recurse));
|
|
|
|
|
|
|
|
|
|
rep1 = i + 1;
|
|
|
|
|
reps = 1;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
while ((rep1 < len) &&
|
1999-04-16 03:35:26 +02:00
|
|
|
|
!memcmp (valaddr + i * eltlen, valaddr + rep1 * eltlen, eltlen))
|
|
|
|
|
{
|
|
|
|
|
++reps;
|
|
|
|
|
++rep1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (reps > repeat_count_threshold)
|
|
|
|
|
{
|
|
|
|
|
val_print (elttype, valaddr + i * eltlen, 0, 0, stream, format,
|
|
|
|
|
deref_ref, recurse + 1, pretty);
|
|
|
|
|
annotate_elt_rep (reps);
|
|
|
|
|
fprintf_filtered (stream, " <repeats %u times>", reps);
|
|
|
|
|
annotate_elt_rep_end ();
|
|
|
|
|
|
|
|
|
|
i = rep1 - 1;
|
|
|
|
|
things_printed += repeat_count_threshold;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
val_print (elttype, valaddr + i * eltlen, 0, 0, stream, format,
|
|
|
|
|
deref_ref, recurse + 1, pretty);
|
|
|
|
|
annotate_elt ();
|
|
|
|
|
things_printed++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
annotate_array_section_end ();
|
|
|
|
|
if (i < len)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, "...");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1999-10-19 04:47:02 +02:00
|
|
|
|
/* Read LEN bytes of target memory at address MEMADDR, placing the
|
|
|
|
|
results in GDB's memory at MYADDR. Returns a count of the bytes
|
|
|
|
|
actually read, and optionally an errno value in the location
|
|
|
|
|
pointed to by ERRNOPTR if ERRNOPTR is non-null. */
|
|
|
|
|
|
|
|
|
|
/* FIXME: cagney/1999-10-14: Only used by val_print_string. Can this
|
|
|
|
|
function be eliminated. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
partial_memory_read (CORE_ADDR memaddr, char *myaddr, int len, int *errnoptr)
|
|
|
|
|
{
|
|
|
|
|
int nread; /* Number of bytes actually read. */
|
|
|
|
|
int errcode; /* Error from last read. */
|
|
|
|
|
|
|
|
|
|
/* First try a complete read. */
|
|
|
|
|
errcode = target_read_memory (memaddr, myaddr, len);
|
|
|
|
|
if (errcode == 0)
|
|
|
|
|
{
|
|
|
|
|
/* Got it all. */
|
|
|
|
|
nread = len;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Loop, reading one byte at a time until we get as much as we can. */
|
|
|
|
|
for (errcode = 0, nread = 0; len > 0 && errcode == 0; nread++, len--)
|
|
|
|
|
{
|
|
|
|
|
errcode = target_read_memory (memaddr++, myaddr++, 1);
|
|
|
|
|
}
|
|
|
|
|
/* If an error, the last read was unsuccessful, so adjust count. */
|
|
|
|
|
if (errcode != 0)
|
|
|
|
|
{
|
|
|
|
|
nread--;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (errnoptr != NULL)
|
|
|
|
|
{
|
|
|
|
|
*errnoptr = errcode;
|
|
|
|
|
}
|
|
|
|
|
return (nread);
|
|
|
|
|
}
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Print a string from the inferior, starting at ADDR and printing up to LEN
|
1999-07-07 22:19:36 +02:00
|
|
|
|
characters, of WIDTH bytes a piece, to STREAM. If LEN is -1, printing
|
|
|
|
|
stops at the first null byte, otherwise printing proceeds (including null
|
|
|
|
|
bytes) until either print_max or LEN characters have been printed,
|
|
|
|
|
whichever is smaller. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* FIXME: Use target_read_string. */
|
|
|
|
|
|
|
|
|
|
int
|
2000-07-30 03:48:28 +02:00
|
|
|
|
val_print_string (CORE_ADDR addr, int len, int width, struct ui_file *stream)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
int force_ellipsis = 0; /* Force ellipsis to be printed if nonzero. */
|
|
|
|
|
int errcode; /* Errno returned from bad reads. */
|
|
|
|
|
unsigned int fetchlimit; /* Maximum number of chars to print. */
|
|
|
|
|
unsigned int nfetch; /* Chars to fetch / chars fetched. */
|
|
|
|
|
unsigned int chunksize; /* Size of each fetch, in chars. */
|
|
|
|
|
char *buffer = NULL; /* Dynamically growable fetch buffer. */
|
|
|
|
|
char *bufptr; /* Pointer to next available byte in buffer. */
|
|
|
|
|
char *limit; /* First location past end of fetch buffer. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
struct cleanup *old_chain = NULL; /* Top of the old cleanup chain. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
int found_nul; /* Non-zero if we found the nul char */
|
|
|
|
|
|
|
|
|
|
/* First we need to figure out the limit on the number of characters we are
|
|
|
|
|
going to attempt to fetch and print. This is actually pretty simple. If
|
|
|
|
|
LEN >= zero, then the limit is the minimum of LEN and print_max. If
|
|
|
|
|
LEN is -1, then the limit is print_max. This is true regardless of
|
|
|
|
|
whether print_max is zero, UINT_MAX (unlimited), or something in between,
|
|
|
|
|
because finding the null byte (or available memory) is what actually
|
|
|
|
|
limits the fetch. */
|
|
|
|
|
|
|
|
|
|
fetchlimit = (len == -1 ? print_max : min (len, print_max));
|
|
|
|
|
|
|
|
|
|
/* Now decide how large of chunks to try to read in one operation. This
|
|
|
|
|
is also pretty simple. If LEN >= zero, then we want fetchlimit chars,
|
|
|
|
|
so we might as well read them all in one operation. If LEN is -1, we
|
|
|
|
|
are looking for a null terminator to end the fetching, so we might as
|
|
|
|
|
well read in blocks that are large enough to be efficient, but not so
|
|
|
|
|
large as to be slow if fetchlimit happens to be large. So we choose the
|
|
|
|
|
minimum of 8 and fetchlimit. We used to use 200 instead of 8 but
|
|
|
|
|
200 is way too big for remote debugging over a serial line. */
|
|
|
|
|
|
|
|
|
|
chunksize = (len == -1 ? min (8, fetchlimit) : fetchlimit);
|
|
|
|
|
|
|
|
|
|
/* Loop until we either have all the characters to print, or we encounter
|
|
|
|
|
some error, such as bumping into the end of the address space. */
|
|
|
|
|
|
|
|
|
|
found_nul = 0;
|
|
|
|
|
old_chain = make_cleanup (null_cleanup, 0);
|
|
|
|
|
|
|
|
|
|
if (len > 0)
|
|
|
|
|
{
|
|
|
|
|
buffer = (char *) xmalloc (len * width);
|
|
|
|
|
bufptr = buffer;
|
2000-12-15 02:01:51 +01:00
|
|
|
|
old_chain = make_cleanup (xfree, buffer);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-10-19 04:47:02 +02:00
|
|
|
|
nfetch = partial_memory_read (addr, bufptr, len * width, &errcode)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/ width;
|
|
|
|
|
addr += nfetch * width;
|
|
|
|
|
bufptr += nfetch * width;
|
|
|
|
|
}
|
|
|
|
|
else if (len == -1)
|
|
|
|
|
{
|
|
|
|
|
unsigned long bufsize = 0;
|
|
|
|
|
do
|
|
|
|
|
{
|
|
|
|
|
QUIT;
|
|
|
|
|
nfetch = min (chunksize, fetchlimit - bufsize);
|
|
|
|
|
|
|
|
|
|
if (buffer == NULL)
|
|
|
|
|
buffer = (char *) xmalloc (nfetch * width);
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
discard_cleanups (old_chain);
|
|
|
|
|
buffer = (char *) xrealloc (buffer, (nfetch + bufsize) * width);
|
|
|
|
|
}
|
|
|
|
|
|
2000-12-15 02:01:51 +01:00
|
|
|
|
old_chain = make_cleanup (xfree, buffer);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
bufptr = buffer + bufsize * width;
|
|
|
|
|
bufsize += nfetch;
|
|
|
|
|
|
|
|
|
|
/* Read as much as we can. */
|
1999-10-19 04:47:02 +02:00
|
|
|
|
nfetch = partial_memory_read (addr, bufptr, nfetch * width, &errcode)
|
1999-07-07 22:19:36 +02:00
|
|
|
|
/ width;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Scan this chunk for the null byte that terminates the string
|
|
|
|
|
to print. If found, we don't need to fetch any more. Note
|
|
|
|
|
that bufptr is explicitly left pointing at the next character
|
|
|
|
|
after the null byte, or at the next character after the end of
|
|
|
|
|
the buffer. */
|
|
|
|
|
|
|
|
|
|
limit = bufptr + nfetch * width;
|
|
|
|
|
while (bufptr < limit)
|
|
|
|
|
{
|
|
|
|
|
unsigned long c;
|
|
|
|
|
|
|
|
|
|
c = extract_unsigned_integer (bufptr, width);
|
|
|
|
|
addr += width;
|
|
|
|
|
bufptr += width;
|
|
|
|
|
if (c == 0)
|
|
|
|
|
{
|
|
|
|
|
/* We don't care about any error which happened after
|
|
|
|
|
the NULL terminator. */
|
|
|
|
|
errcode = 0;
|
|
|
|
|
found_nul = 1;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
while (errcode == 0 /* no error */
|
|
|
|
|
&& bufptr - buffer < fetchlimit * width /* no overrun */
|
|
|
|
|
&& !found_nul); /* haven't found nul yet */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{ /* length of string is really 0! */
|
|
|
|
|
buffer = bufptr = NULL;
|
|
|
|
|
errcode = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* bufptr and addr now point immediately beyond the last byte which we
|
|
|
|
|
consider part of the string (including a '\0' which ends the string). */
|
|
|
|
|
|
|
|
|
|
/* We now have either successfully filled the buffer to fetchlimit, or
|
|
|
|
|
terminated early due to an error or finding a null char when LEN is -1. */
|
|
|
|
|
|
|
|
|
|
if (len == -1 && !found_nul)
|
|
|
|
|
{
|
|
|
|
|
char *peekbuf;
|
|
|
|
|
|
|
|
|
|
/* We didn't find a null terminator we were looking for. Attempt
|
1999-07-07 22:19:36 +02:00
|
|
|
|
to peek at the next character. If not successful, or it is not
|
|
|
|
|
a null byte, then force ellipsis to be printed. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
peekbuf = (char *) alloca (width);
|
|
|
|
|
|
|
|
|
|
if (target_read_memory (addr, peekbuf, width) == 0
|
|
|
|
|
&& extract_unsigned_integer (peekbuf, width) != 0)
|
|
|
|
|
force_ellipsis = 1;
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
else if ((len >= 0 && errcode != 0) || (len > (bufptr - buffer) / width))
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* Getting an error when we have a requested length, or fetching less
|
1999-07-07 22:19:36 +02:00
|
|
|
|
than the number of characters actually requested, always make us
|
|
|
|
|
print ellipsis. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
force_ellipsis = 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
QUIT;
|
|
|
|
|
|
|
|
|
|
/* If we get an error before fetching anything, don't print a string.
|
|
|
|
|
But if we fetch something and then get an error, print the string
|
|
|
|
|
and then the error message. */
|
|
|
|
|
if (errcode == 0 || bufptr > buffer)
|
|
|
|
|
{
|
|
|
|
|
if (addressprint)
|
|
|
|
|
{
|
|
|
|
|
fputs_filtered (" ", stream);
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
LA_PRINT_STRING (stream, buffer, (bufptr - buffer) / width, width, force_ellipsis);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (errcode != 0)
|
|
|
|
|
{
|
|
|
|
|
if (errcode == EIO)
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, " <Address ");
|
|
|
|
|
print_address_numeric (addr, 1, stream);
|
|
|
|
|
fprintf_filtered (stream, " out of bounds>");
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
fprintf_filtered (stream, " <Error reading address ");
|
|
|
|
|
print_address_numeric (addr, 1, stream);
|
|
|
|
|
fprintf_filtered (stream, ": %s>", safe_strerror (errcode));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
gdb_flush (stream);
|
|
|
|
|
do_cleanups (old_chain);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
return ((bufptr - buffer) / width);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Validate an input or output radix setting, and make sure the user
|
|
|
|
|
knows what they really did here. Radix setting is confusing, e.g.
|
|
|
|
|
setting the input radix to "10" never changes it! */
|
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
set_input_radix (char *args, int from_tty, struct cmd_list_element *c)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
set_input_radix_1 (from_tty, *(unsigned *) c->var);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
set_input_radix_1 (int from_tty, unsigned radix)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* We don't currently disallow any input radix except 0 or 1, which don't
|
|
|
|
|
make any mathematical sense. In theory, we can deal with any input
|
|
|
|
|
radix greater than 1, even if we don't have unique digits for every
|
|
|
|
|
value from 0 to radix-1, but in practice we lose on large radix values.
|
|
|
|
|
We should either fix the lossage or restrict the radix range more.
|
|
|
|
|
(FIXME). */
|
|
|
|
|
|
|
|
|
|
if (radix < 2)
|
|
|
|
|
{
|
|
|
|
|
error ("Nonsense input radix ``decimal %u''; input radix unchanged.",
|
|
|
|
|
radix);
|
|
|
|
|
}
|
|
|
|
|
input_radix = radix;
|
|
|
|
|
if (from_tty)
|
|
|
|
|
{
|
|
|
|
|
printf_filtered ("Input radix now set to decimal %u, hex %x, octal %o.\n",
|
|
|
|
|
radix, radix, radix);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
set_output_radix (char *args, int from_tty, struct cmd_list_element *c)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
set_output_radix_1 (from_tty, *(unsigned *) c->var);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
set_output_radix_1 (int from_tty, unsigned radix)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* Validate the radix and disallow ones that we aren't prepared to
|
|
|
|
|
handle correctly, leaving the radix unchanged. */
|
|
|
|
|
switch (radix)
|
|
|
|
|
{
|
|
|
|
|
case 16:
|
1999-07-07 22:19:36 +02:00
|
|
|
|
output_format = 'x'; /* hex */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 10:
|
1999-07-07 22:19:36 +02:00
|
|
|
|
output_format = 0; /* decimal */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
case 8:
|
1999-07-07 22:19:36 +02:00
|
|
|
|
output_format = 'o'; /* octal */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
error ("Unsupported output radix ``decimal %u''; output radix unchanged.",
|
|
|
|
|
radix);
|
|
|
|
|
}
|
|
|
|
|
output_radix = radix;
|
|
|
|
|
if (from_tty)
|
|
|
|
|
{
|
|
|
|
|
printf_filtered ("Output radix now set to decimal %u, hex %x, octal %o.\n",
|
|
|
|
|
radix, radix, radix);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Set both the input and output radix at once. Try to set the output radix
|
|
|
|
|
first, since it has the most restrictive range. An radix that is valid as
|
|
|
|
|
an output radix is also valid as an input radix.
|
|
|
|
|
|
|
|
|
|
It may be useful to have an unusual input radix. If the user wishes to
|
|
|
|
|
set an input radix that is not valid as an output radix, he needs to use
|
|
|
|
|
the 'set input-radix' command. */
|
|
|
|
|
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
set_radix (char *arg, int from_tty)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
unsigned radix;
|
|
|
|
|
|
2000-10-30 16:32:51 +01:00
|
|
|
|
radix = (arg == NULL) ? 10 : parse_and_eval_long (arg);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
set_output_radix_1 (0, radix);
|
|
|
|
|
set_input_radix_1 (0, radix);
|
|
|
|
|
if (from_tty)
|
|
|
|
|
{
|
|
|
|
|
printf_filtered ("Input and output radices now set to decimal %u, hex %x, octal %o.\n",
|
|
|
|
|
radix, radix, radix);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Show both the input and output radices. */
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
/*ARGSUSED */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
show_radix (char *arg, int from_tty)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
if (from_tty)
|
|
|
|
|
{
|
|
|
|
|
if (input_radix == output_radix)
|
|
|
|
|
{
|
|
|
|
|
printf_filtered ("Input and output radices set to decimal %u, hex %x, octal %o.\n",
|
|
|
|
|
input_radix, input_radix, input_radix);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
printf_filtered ("Input radix set to decimal %u, hex %x, octal %o.\n",
|
|
|
|
|
input_radix, input_radix, input_radix);
|
|
|
|
|
printf_filtered ("Output radix set to decimal %u, hex %x, octal %o.\n",
|
|
|
|
|
output_radix, output_radix, output_radix);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
|
|
/*ARGSUSED */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
set_print (char *arg, int from_tty)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
printf_unfiltered (
|
1999-07-07 22:19:36 +02:00
|
|
|
|
"\"set print\" must be followed by the name of a print subcommand.\n");
|
1999-04-16 03:35:26 +02:00
|
|
|
|
help_list (setprintlist, "set print ", -1, gdb_stdout);
|
|
|
|
|
}
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
/*ARGSUSED */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
show_print (char *args, int from_tty)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
cmd_show_list (showprintlist, from_tty, "");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
_initialize_valprint (void)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
struct cmd_list_element *c;
|
|
|
|
|
|
|
|
|
|
add_prefix_cmd ("print", no_class, set_print,
|
|
|
|
|
"Generic command for setting how things print.",
|
|
|
|
|
&setprintlist, "set print ", 0, &setlist);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
add_alias_cmd ("p", "print", no_class, 1, &setlist);
|
|
|
|
|
/* prefer set print to set prompt */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
add_alias_cmd ("pr", "print", no_class, 1, &setlist);
|
|
|
|
|
|
|
|
|
|
add_prefix_cmd ("print", no_class, show_print,
|
|
|
|
|
"Generic command for showing print settings.",
|
|
|
|
|
&showprintlist, "show print ", 0, &showlist);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
add_alias_cmd ("p", "print", no_class, 1, &showlist);
|
|
|
|
|
add_alias_cmd ("pr", "print", no_class, 1, &showlist);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
add_show_from_set
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(add_set_cmd ("elements", no_class, var_uinteger, (char *) &print_max,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
"Set limit on string chars or array elements to print.\n\
|
|
|
|
|
\"set print elements 0\" causes there to be no limit.",
|
|
|
|
|
&setprintlist),
|
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
|
|
add_show_from_set
|
|
|
|
|
(add_set_cmd ("null-stop", no_class, var_boolean,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(char *) &stop_print_at_null,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
"Set printing of char arrays to stop at first null char.",
|
|
|
|
|
&setprintlist),
|
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
|
|
add_show_from_set
|
|
|
|
|
(add_set_cmd ("repeats", no_class, var_uinteger,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(char *) &repeat_count_threshold,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
"Set threshold for repeated print elements.\n\
|
|
|
|
|
\"set print repeats 0\" causes all elements to be individually printed.",
|
|
|
|
|
&setprintlist),
|
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
|
|
add_show_from_set
|
|
|
|
|
(add_set_cmd ("pretty", class_support, var_boolean,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(char *) &prettyprint_structs,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
"Set prettyprinting of structures.",
|
|
|
|
|
&setprintlist),
|
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
|
|
add_show_from_set
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(add_set_cmd ("union", class_support, var_boolean, (char *) &unionprint,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
"Set printing of unions interior to structures.",
|
|
|
|
|
&setprintlist),
|
|
|
|
|
&showprintlist);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
add_show_from_set
|
|
|
|
|
(add_set_cmd ("array", class_support, var_boolean,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(char *) &prettyprint_arrays,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
"Set prettyprinting of arrays.",
|
|
|
|
|
&setprintlist),
|
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
|
|
add_show_from_set
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(add_set_cmd ("address", class_support, var_boolean, (char *) &addressprint,
|
1999-04-16 03:35:26 +02:00
|
|
|
|
"Set printing of addresses.",
|
|
|
|
|
&setprintlist),
|
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
|
|
c = add_set_cmd ("input-radix", class_support, var_uinteger,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(char *) &input_radix,
|
|
|
|
|
"Set default input radix for entering numbers.",
|
|
|
|
|
&setlist);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
add_show_from_set (c, &showlist);
|
|
|
|
|
c->function.sfunc = set_input_radix;
|
|
|
|
|
|
|
|
|
|
c = add_set_cmd ("output-radix", class_support, var_uinteger,
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(char *) &output_radix,
|
|
|
|
|
"Set default output radix for printing of values.",
|
|
|
|
|
&setlist);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
add_show_from_set (c, &showlist);
|
|
|
|
|
c->function.sfunc = set_output_radix;
|
|
|
|
|
|
|
|
|
|
/* The "set radix" and "show radix" commands are special in that they are
|
|
|
|
|
like normal set and show commands but allow two normally independent
|
|
|
|
|
variables to be either set or shown with a single command. So the
|
|
|
|
|
usual add_set_cmd() and add_show_from_set() commands aren't really
|
|
|
|
|
appropriate. */
|
|
|
|
|
add_cmd ("radix", class_support, set_radix,
|
|
|
|
|
"Set default input and output number radices.\n\
|
|
|
|
|
Use 'set input-radix' or 'set output-radix' to independently set each.\n\
|
|
|
|
|
Without an argument, sets both radices back to the default value of 10.",
|
|
|
|
|
&setlist);
|
|
|
|
|
add_cmd ("radix", class_support, show_radix,
|
|
|
|
|
"Show the default input and output number radices.\n\
|
|
|
|
|
Use 'show input-radix' or 'show output-radix' to independently show each.",
|
|
|
|
|
&showlist);
|
|
|
|
|
|
|
|
|
|
/* Give people the defaults which they are used to. */
|
|
|
|
|
prettyprint_structs = 0;
|
|
|
|
|
prettyprint_arrays = 0;
|
|
|
|
|
unionprint = 1;
|
|
|
|
|
addressprint = 1;
|
|
|
|
|
print_max = PRINT_MAX_DEFAULT;
|
|
|
|
|
}
|