1999-04-16 03:35:26 +02:00
|
|
|
/* Support for printing C++ values for GDB, the GNU debugger.
|
2001-03-06 09:22:02 +01:00
|
|
|
Copyright 1986, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
|
2002-03-16 21:53:14 +01:00
|
|
|
2000, 2001, 2002
|
1999-04-16 03:35:26 +02:00
|
|
|
Free Software Foundation, Inc.
|
|
|
|
|
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"
|
2002-07-29 Andrew Cagney <ac131313@redhat.com>
* gdb_obstack.h: New file.
* symtab.h: Include "gdb_obstack.h" instead of "obstack.h".
(obstack_chunk_alloc, obstack_chunk_free): Delete macros.
* objfiles.h: Include "gdb_obstack.h".
* Makefile.in (gdb_obstack_h): Define.
(symtab_h): Add $(gdb_obstack_h).
(objfiles_h): Add $(gdb_obstack_h).
* objfiles.c: Include "gdb_obstack.h" instead of "obstack.h".
* macrotab.c, cp-valprint.c, dbxread.c: Ditto.
* ch-typeprint.c, ch-valprint.c, dstread.c: Ditto.
* macroexp.c, p-typeprint.c, stabsread.c: Ditto.
* symtab.c, f-typeprint.c, mdebugread.c: Ditto.
* p-valprint.c, symmisc.c, typeprint.c: Ditto.
* symfile.c, coffread.c, c-typeprint.c: Ditto.
* buildsym.c, bcache.c, ada-typeprint.c: Ditto.
* Makefile.in (bcache.o): Update dependencies.
(buildsym.o, c-typeprint.o, ch-typeprint.o): Ditto.
(ch-valprint.o, coffread.o, cp-valprint.o): Ditto.
(dbxread.o, dstread.o, f-typeprint.o): Ditto.
(objfiles.o, p-typeprint.o, p-valprint.o): Ditto.
(stabsread.o, symfile.o, symmisc.o): Ditto.
(symtab.o, typeprint.o, macroexp.o): Ditto.
(macrotab.o, mdebugread.o): Ditto.
(f_lang_h, coff_sym_h, coff_symconst_h): Define.
(coff_ecoff_h, aout_aout64_h): Define.
(aout_stabs_gnu_h, libaout_h): Define.
2002-07-30 00:55:26 +02:00
|
|
|
#include "gdb_obstack.h"
|
1999-04-16 03:35:26 +02:00
|
|
|
#include "symtab.h"
|
|
|
|
#include "gdbtypes.h"
|
|
|
|
#include "expression.h"
|
|
|
|
#include "value.h"
|
|
|
|
#include "command.h"
|
|
|
|
#include "gdbcmd.h"
|
|
|
|
#include "demangle.h"
|
|
|
|
#include "annotate.h"
|
|
|
|
#include "gdb_string.h"
|
|
|
|
#include "c-lang.h"
|
|
|
|
#include "target.h"
|
2001-12-07 23:13:19 +01:00
|
|
|
#include "cp-abi.h"
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
/* Indication of presence of HP-compiled object files */
|
|
|
|
extern int hp_som_som_object_present; /* defined in symtab.c */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
|
|
int vtblprint; /* Controls printing of vtbl's */
|
|
|
|
int objectprint; /* Controls looking up an object's derived type
|
|
|
|
using what we find in its vtables. */
|
1999-07-07 22:19:36 +02:00
|
|
|
int static_field_print; /* Controls printing of static fields. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
static struct obstack dont_print_vb_obstack;
|
|
|
|
static struct obstack dont_print_statmem_obstack;
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
extern void _initialize_cp_valprint (void);
|
1999-05-25 20:09:09 +02:00
|
|
|
|
2001-11-10 21:44:38 +01:00
|
|
|
static void cp_print_static_field (struct type *, struct value *,
|
2000-02-02 01:21:19 +01:00
|
|
|
struct ui_file *, int, int,
|
|
|
|
enum val_prettyprint);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2000-02-02 01:21:19 +01:00
|
|
|
static void cp_print_value (struct type *, struct type *, char *, int,
|
|
|
|
CORE_ADDR, struct ui_file *, int, int,
|
|
|
|
enum val_prettyprint, struct type **);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2000-02-02 01:21:19 +01:00
|
|
|
static void cp_print_hpacc_virtual_table_entries (struct type *, int *,
|
2001-11-10 21:44:38 +01:00
|
|
|
struct value *,
|
2000-02-02 01:21:19 +01:00
|
|
|
struct ui_file *, int,
|
|
|
|
int,
|
|
|
|
enum val_prettyprint);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
|
|
void
|
2001-03-22 01:58:00 +01:00
|
|
|
cp_print_class_method (char *valaddr,
|
|
|
|
struct type *type,
|
|
|
|
struct ui_file *stream)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
struct type *domain;
|
|
|
|
struct fn_field *f = NULL;
|
|
|
|
int j = 0;
|
|
|
|
int len2;
|
|
|
|
int offset;
|
|
|
|
char *kind = "";
|
|
|
|
CORE_ADDR addr;
|
|
|
|
struct symbol *sym;
|
|
|
|
unsigned len;
|
|
|
|
unsigned int i;
|
|
|
|
struct type *target_type = check_typedef (TYPE_TARGET_TYPE (type));
|
|
|
|
|
|
|
|
domain = TYPE_DOMAIN_TYPE (target_type);
|
1999-07-07 22:19:36 +02:00
|
|
|
if (domain == (struct type *) NULL)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
fprintf_filtered (stream, "<unknown>");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
addr = unpack_pointer (lookup_pointer_type (builtin_type_void), valaddr);
|
|
|
|
if (METHOD_PTR_IS_VIRTUAL (addr))
|
|
|
|
{
|
|
|
|
offset = METHOD_PTR_TO_VOFFSET (addr);
|
|
|
|
len = TYPE_NFN_FIELDS (domain);
|
|
|
|
for (i = 0; i < len; i++)
|
|
|
|
{
|
|
|
|
f = TYPE_FN_FIELDLIST1 (domain, i);
|
|
|
|
len2 = TYPE_FN_FIELDLIST_LENGTH (domain, i);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
2002-09-14 04:09:39 +02:00
|
|
|
check_stub_method_group (domain, i);
|
1999-04-16 03:35:26 +02:00
|
|
|
for (j = 0; j < len2; j++)
|
|
|
|
{
|
|
|
|
if (TYPE_FN_FIELD_VOFFSET (f, j) == offset)
|
|
|
|
{
|
|
|
|
kind = "virtual ";
|
|
|
|
goto common;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
sym = find_pc_function (addr);
|
|
|
|
if (sym == 0)
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
/* 1997-08-01 Currently unsupported with HP aCC */
|
|
|
|
if (hp_som_som_object_present)
|
|
|
|
{
|
|
|
|
fputs_filtered ("?? <not supported with HP aCC>", stream);
|
|
|
|
return;
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
error ("invalid pointer to member function");
|
|
|
|
}
|
|
|
|
len = TYPE_NFN_FIELDS (domain);
|
|
|
|
for (i = 0; i < len; i++)
|
|
|
|
{
|
|
|
|
f = TYPE_FN_FIELDLIST1 (domain, i);
|
|
|
|
len2 = TYPE_FN_FIELDLIST_LENGTH (domain, i);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
2002-09-17 00:02:46 +02:00
|
|
|
check_stub_method_group (domain, i);
|
1999-04-16 03:35:26 +02:00
|
|
|
for (j = 0; j < len2; j++)
|
|
|
|
{
|
|
|
|
if (STREQ (SYMBOL_NAME (sym), TYPE_FN_FIELD_PHYSNAME (f, j)))
|
2002-09-14 04:09:39 +02:00
|
|
|
goto common;
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2001-03-22 01:58:00 +01:00
|
|
|
common:
|
1999-04-16 03:35:26 +02:00
|
|
|
if (i < len)
|
|
|
|
{
|
|
|
|
char *demangled_name;
|
|
|
|
|
|
|
|
fprintf_filtered (stream, "&");
|
|
|
|
fprintf_filtered (stream, kind);
|
|
|
|
demangled_name = cplus_demangle (TYPE_FN_FIELD_PHYSNAME (f, j),
|
|
|
|
DMGL_ANSI | DMGL_PARAMS);
|
|
|
|
if (demangled_name == NULL)
|
|
|
|
fprintf_filtered (stream, "<badly mangled name %s>",
|
|
|
|
TYPE_FN_FIELD_PHYSNAME (f, j));
|
|
|
|
else
|
|
|
|
{
|
|
|
|
fputs_filtered (demangled_name, stream);
|
2000-12-15 02:01:51 +01:00
|
|
|
xfree (demangled_name);
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
fprintf_filtered (stream, "(");
|
|
|
|
type_print (type, "", stream, -1);
|
|
|
|
fprintf_filtered (stream, ") %d", (int) addr >> 3);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This was what it was for gcc 2.4.5 and earlier. */
|
|
|
|
static const char vtbl_ptr_name_old[] =
|
2001-03-22 01:58:00 +01:00
|
|
|
{
|
|
|
|
CPLUS_MARKER, 'v', 't', 'b', 'l', '_', 'p', 't', 'r', '_',
|
|
|
|
't', 'y', 'p', 'e', 0
|
|
|
|
};
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
/* It was changed to this after 2.4.5. */
|
2001-03-22 01:58:00 +01:00
|
|
|
const char vtbl_ptr_name[] = "__vtbl_ptr_type";
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
/* HP aCC uses different names */
|
2001-03-22 01:58:00 +01:00
|
|
|
const char hpacc_vtbl_ptr_name[] = "__vfp";
|
|
|
|
const char hpacc_vtbl_ptr_type_name[] = "__vftyp";
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
|
|
/* Return truth value for assertion that TYPE is of the type
|
|
|
|
"pointer to virtual function". */
|
|
|
|
|
|
|
|
int
|
2000-07-30 03:48:28 +02:00
|
|
|
cp_is_vtbl_ptr_type (struct type *type)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
char *typename = type_name_no_tag (type);
|
|
|
|
|
|
|
|
return (typename != NULL
|
|
|
|
&& (STREQ (typename, vtbl_ptr_name)
|
|
|
|
|| STREQ (typename, vtbl_ptr_name_old)));
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Return truth value for the assertion that TYPE is of the type
|
|
|
|
"pointer to virtual function table". */
|
|
|
|
|
|
|
|
int
|
2000-07-30 03:48:28 +02:00
|
|
|
cp_is_vtbl_member (struct type *type)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2002-03-16 21:53:14 +01:00
|
|
|
/* With older versions of g++, the vtbl field pointed to an array
|
|
|
|
of structures. Nowadays it points directly to the structure. */
|
1999-04-16 03:35:26 +02:00
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
|
|
|
{
|
|
|
|
type = TYPE_TARGET_TYPE (type);
|
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
|
|
|
{
|
|
|
|
type = TYPE_TARGET_TYPE (type);
|
1999-07-07 22:19:36 +02:00
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT /* if not using thunks */
|
|
|
|
|| TYPE_CODE (type) == TYPE_CODE_PTR) /* if using thunks */
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
/* Virtual functions tables are full of pointers
|
1999-07-07 22:19:36 +02:00
|
|
|
to virtual functions. */
|
1999-04-16 03:35:26 +02:00
|
|
|
return cp_is_vtbl_ptr_type (type);
|
|
|
|
}
|
|
|
|
}
|
2002-03-16 21:53:14 +01:00
|
|
|
else if (TYPE_CODE (type) == TYPE_CODE_STRUCT) /* if not using thunks */
|
|
|
|
{
|
|
|
|
return cp_is_vtbl_ptr_type (type);
|
|
|
|
}
|
|
|
|
else if (TYPE_CODE (type) == TYPE_CODE_PTR) /* if using thunks */
|
|
|
|
{
|
|
|
|
/* The type name of the thunk pointer is NULL when using dwarf2.
|
|
|
|
We could test for a pointer to a function, but there is
|
|
|
|
no type info for the virtual table either, so it wont help. */
|
|
|
|
return cp_is_vtbl_ptr_type (type);
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Mutually recursive subroutines of cp_print_value and c_val_print to
|
|
|
|
print out a structure's fields: cp_print_value_fields and cp_print_value.
|
1999-07-07 22:19:36 +02:00
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
TYPE, VALADDR, ADDRESS, STREAM, RECURSE, and PRETTY have the
|
|
|
|
same meanings as in cp_print_value and c_val_print.
|
|
|
|
|
|
|
|
2nd argument REAL_TYPE is used to carry over the type of the derived
|
|
|
|
class across the recursion to base classes.
|
|
|
|
|
|
|
|
DONT_PRINT is an array of baseclass types that we
|
|
|
|
should not print, or zero if called from top level. */
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
cp_print_value_fields (struct type *type, struct type *real_type, char *valaddr,
|
|
|
|
int offset, CORE_ADDR address, struct ui_file *stream,
|
|
|
|
int format, int recurse, enum val_prettyprint pretty,
|
|
|
|
struct type **dont_print_vb, int dont_print_statmem)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
int i, len, n_baseclasses;
|
|
|
|
struct obstack tmp_obstack;
|
|
|
|
char *last_dont_print = obstack_next_free (&dont_print_statmem_obstack);
|
|
|
|
int fields_seen = 0;
|
|
|
|
|
|
|
|
CHECK_TYPEDEF (type);
|
|
|
|
|
|
|
|
fprintf_filtered (stream, "{");
|
|
|
|
len = TYPE_NFIELDS (type);
|
|
|
|
n_baseclasses = TYPE_N_BASECLASSES (type);
|
|
|
|
|
|
|
|
/* First, print out baseclasses such that we don't print
|
|
|
|
duplicates of virtual baseclasses. */
|
|
|
|
|
|
|
|
if (n_baseclasses > 0)
|
|
|
|
cp_print_value (type, real_type, valaddr, offset, address, stream,
|
1999-07-07 22:19:36 +02:00
|
|
|
format, recurse + 1, pretty, dont_print_vb);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
/* Second, print out data fields */
|
|
|
|
|
|
|
|
/* If there are no data fields, or if the only field is the
|
1999-07-07 22:19:36 +02:00
|
|
|
* vtbl pointer, skip this part */
|
2001-03-22 01:58:00 +01:00
|
|
|
if ((len == n_baseclasses)
|
|
|
|
|| ((len - n_baseclasses == 1)
|
|
|
|
&& TYPE_HAS_VTABLE (type)
|
|
|
|
&& STREQN (TYPE_FIELD_NAME (type, n_baseclasses),
|
|
|
|
hpacc_vtbl_ptr_name, 5))
|
|
|
|
|| !len)
|
1999-04-16 03:35:26 +02:00
|
|
|
fprintf_filtered (stream, "<No data fields>");
|
|
|
|
else
|
|
|
|
{
|
|
|
|
extern int inspect_it;
|
|
|
|
|
|
|
|
if (dont_print_statmem == 0)
|
|
|
|
{
|
|
|
|
/* If we're at top level, carve out a completely fresh
|
|
|
|
chunk of the obstack and use that until this particular
|
|
|
|
invocation returns. */
|
|
|
|
tmp_obstack = dont_print_statmem_obstack;
|
|
|
|
obstack_finish (&dont_print_statmem_obstack);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = n_baseclasses; i < len; i++)
|
|
|
|
{
|
|
|
|
/* If requested, skip printing of static fields. */
|
|
|
|
if (!static_field_print && TYPE_FIELD_STATIC (type, i))
|
|
|
|
continue;
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
/* If a vtable pointer appears, we'll print it out later */
|
2001-03-22 01:58:00 +01:00
|
|
|
if (TYPE_HAS_VTABLE (type)
|
|
|
|
&& STREQN (TYPE_FIELD_NAME (type, i), hpacc_vtbl_ptr_name, 5))
|
1999-07-07 22:19:36 +02:00
|
|
|
continue;
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
if (fields_seen)
|
|
|
|
fprintf_filtered (stream, ", ");
|
|
|
|
else if (n_baseclasses > 0)
|
|
|
|
{
|
|
|
|
if (pretty)
|
|
|
|
{
|
|
|
|
fprintf_filtered (stream, "\n");
|
|
|
|
print_spaces_filtered (2 + 2 * recurse, stream);
|
|
|
|
fputs_filtered ("members of ", stream);
|
|
|
|
fputs_filtered (type_name_no_tag (type), stream);
|
|
|
|
fputs_filtered (": ", stream);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fields_seen = 1;
|
|
|
|
|
|
|
|
if (pretty)
|
|
|
|
{
|
|
|
|
fprintf_filtered (stream, "\n");
|
|
|
|
print_spaces_filtered (2 + 2 * recurse, stream);
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
else
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
wrap_here (n_spaces (2 + 2 * recurse));
|
|
|
|
}
|
|
|
|
if (inspect_it)
|
|
|
|
{
|
|
|
|
if (TYPE_CODE (TYPE_FIELD_TYPE (type, i)) == TYPE_CODE_PTR)
|
|
|
|
fputs_filtered ("\"( ptr \"", stream);
|
|
|
|
else
|
|
|
|
fputs_filtered ("\"( nodef \"", stream);
|
|
|
|
if (TYPE_FIELD_STATIC (type, i))
|
|
|
|
fputs_filtered ("static ", stream);
|
|
|
|
fprintf_symbol_filtered (stream, TYPE_FIELD_NAME (type, i),
|
|
|
|
language_cplus,
|
|
|
|
DMGL_PARAMS | DMGL_ANSI);
|
|
|
|
fputs_filtered ("\" \"", stream);
|
|
|
|
fprintf_symbol_filtered (stream, TYPE_FIELD_NAME (type, i),
|
|
|
|
language_cplus,
|
|
|
|
DMGL_PARAMS | DMGL_ANSI);
|
|
|
|
fputs_filtered ("\") \"", stream);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
annotate_field_begin (TYPE_FIELD_TYPE (type, i));
|
|
|
|
|
|
|
|
if (TYPE_FIELD_STATIC (type, i))
|
|
|
|
fputs_filtered ("static ", stream);
|
|
|
|
fprintf_symbol_filtered (stream, TYPE_FIELD_NAME (type, i),
|
|
|
|
language_cplus,
|
|
|
|
DMGL_PARAMS | DMGL_ANSI);
|
|
|
|
annotate_field_name_end ();
|
|
|
|
/* do not print leading '=' in case of anonymous unions */
|
|
|
|
if (strcmp (TYPE_FIELD_NAME (type, i), ""))
|
|
|
|
fputs_filtered (" = ", stream);
|
|
|
|
annotate_field_value ();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!TYPE_FIELD_STATIC (type, i) && TYPE_FIELD_PACKED (type, i))
|
|
|
|
{
|
2001-11-10 21:44:38 +01:00
|
|
|
struct value *v;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
/* Bitfields require special handling, especially due to byte
|
1999-07-07 22:19:36 +02:00
|
|
|
order problems. */
|
1999-04-16 03:35:26 +02:00
|
|
|
if (TYPE_FIELD_IGNORE (type, i))
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
fputs_filtered ("<optimized out or zero length>", stream);
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2001-03-22 01:58:00 +01:00
|
|
|
v = value_from_longest
|
|
|
|
(TYPE_FIELD_TYPE (type, i),
|
|
|
|
unpack_field_as_long (type, valaddr + offset, i));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2001-03-22 01:58:00 +01:00
|
|
|
val_print (TYPE_FIELD_TYPE (type, i), VALUE_CONTENTS (v),
|
|
|
|
0, 0, stream, format, 0, recurse + 1, pretty);
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (TYPE_FIELD_IGNORE (type, i))
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
fputs_filtered ("<optimized out or zero length>", stream);
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
else if (TYPE_FIELD_STATIC (type, i))
|
|
|
|
{
|
2001-11-10 21:44:38 +01:00
|
|
|
struct value *v = value_static_field (type, i);
|
1999-04-16 03:35:26 +02:00
|
|
|
if (v == NULL)
|
|
|
|
fputs_filtered ("<optimized out>", stream);
|
|
|
|
else
|
|
|
|
cp_print_static_field (TYPE_FIELD_TYPE (type, i), v,
|
|
|
|
stream, format, recurse + 1,
|
|
|
|
pretty);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
val_print (TYPE_FIELD_TYPE (type, i),
|
2001-03-22 01:58:00 +01:00
|
|
|
valaddr, offset + TYPE_FIELD_BITPOS (type, i) / 8,
|
1999-07-07 22:19:36 +02:00
|
|
|
address + TYPE_FIELD_BITPOS (type, i) / 8,
|
|
|
|
stream, format, 0, recurse + 1, pretty);
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
annotate_field_end ();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (dont_print_statmem == 0)
|
|
|
|
{
|
|
|
|
/* Free the space used to deal with the printing
|
|
|
|
of the members from top level. */
|
|
|
|
obstack_free (&dont_print_statmem_obstack, last_dont_print);
|
|
|
|
dont_print_statmem_obstack = tmp_obstack;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pretty)
|
|
|
|
{
|
|
|
|
fprintf_filtered (stream, "\n");
|
|
|
|
print_spaces_filtered (2 * recurse, stream);
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
} /* if there are data fields */
|
|
|
|
/* Now print out the virtual table pointer if there is one */
|
2001-03-22 01:58:00 +01:00
|
|
|
if (TYPE_HAS_VTABLE (type)
|
|
|
|
&& STREQN (TYPE_FIELD_NAME (type, n_baseclasses),
|
|
|
|
hpacc_vtbl_ptr_name,
|
|
|
|
5))
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2001-11-10 21:44:38 +01:00
|
|
|
struct value *v;
|
1999-07-07 22:19:36 +02:00
|
|
|
/* First get the virtual table pointer and print it out */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
#if 0
|
|
|
|
fputs_filtered ("__vfp = ", stream);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
fputs_filtered (", Virtual table at ", stream);
|
|
|
|
|
|
|
|
/* pai: FIXME 32x64 problem? */
|
|
|
|
/* Not sure what the best notation is in the case where there is no
|
|
|
|
baseclass name. */
|
* gdbarch.sh (POINTER_TO_ADDRESS, ADDRESS_TO_POINTER): Two new
functions which architectures can redefine, defaulting to
generic_pointer_to_address and generic_address_to_pointer.
* findvar.c (extract_typed_address, store_typed_address,
generic_pointer_to_address, generic_address_to_pointer): New
functions.
(POINTER_TO_ADDRESS, ADDRESS_TO_POINTER): Provide default
definitions.
(extract_address, store_address): Doc fixes.
* values.c (value_as_pointer): Doc fix.
(value_from_pointer): New function.
* defs.h (extract_typed_address, store_typed_address): New
declarations.
* inferior.h (generic_address_to_pointer,
generic_pointer_to_address): New declarations.
* value.h (value_from_pointer): New declaration.
* ax-gdb.c (const_var_ref): Use value_from_pointer, not
value_from_longest.
* blockframe.c (generic_push_dummy_frame): Use read_pc and
read_sp, not read_register.
* c-valprint.c (c_val_print): Use extract_typed_address instead of
extract_address to extract vtable entries and references.
* cp-valprint.c (cp_print_value_fields): Use value_from_pointer
instead of value_from_longest to extract the vtable's address.
* eval.c (evaluate_subexp_standard): Use value_from_pointer
instead of value_from_longest to compute `this', and for doing
pointer-to-member dereferencing.
* findvar.c (read_register): Use extract_unsigned_integer, not
extract_address.
(read_var_value): Use store_typed_address instead of store_address
for building label values.
(locate_var_value): Use value_from_pointer instead of
value_from_longest.
* hppa-tdep.c (find_stub_with_shl_get): Use value_from_pointer,
instead of value_from_longest, to build arguments to __d_shl_get.
* printcmd.c (set_next_address): Use value_from_pointer, not
value_from_longest.
(x_command): Use value_from_pointer, not value_from_longest.
* tracepoint.c (set_traceframe_context): Use value_from_pointer,
not value_from_longest.
* valarith.c (value_add, value_sub): Use value_from_pointer, not
value_from_longest.
* valops.c (find_function_in_inferior, value_coerce_array,
value_coerce_function, value_addr, hand_function_call): Same.
* value.h (COERCE_REF): Use unpack_pointer, not unpack_long.
* values.c (unpack_long): Use extract_typed_address to produce
addresses from pointers and references, not extract_address.
(value_from_longest): Use store_typed_address instead of
store_address to produce pointer and reference values.
2000-04-14 20:43:41 +02:00
|
|
|
v = value_from_pointer (lookup_pointer_type (builtin_type_unsigned_long),
|
1999-07-07 22:19:36 +02:00
|
|
|
*(unsigned long *) (valaddr + offset));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
val_print (VALUE_TYPE (v), VALUE_CONTENTS (v), 0, 0,
|
1999-07-07 22:19:36 +02:00
|
|
|
stream, format, 0, recurse + 1, pretty);
|
1999-04-16 03:35:26 +02:00
|
|
|
fields_seen = 1;
|
|
|
|
|
|
|
|
if (vtblprint)
|
1999-07-07 22:19:36 +02:00
|
|
|
{
|
|
|
|
/* Print out function pointers in vtable. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
/* FIXME: then-clause is for non-RRBC layout of virtual
|
|
|
|
* table. The RRBC case in the else-clause is yet to be
|
|
|
|
* implemented. The if (1) below should be changed to a
|
|
|
|
* test for whether the executable we have was compiled
|
|
|
|
* with a version of HP aCC that doesn't have RRBC
|
|
|
|
* support. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
if (1)
|
|
|
|
{
|
2001-03-22 01:58:00 +01:00
|
|
|
/* no RRBC support; function pointers embedded directly
|
|
|
|
in vtable */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
int vfuncs = count_virtual_fns (real_type);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
fputs_filtered (" {", stream);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
/* FIXME : doesn't work at present */
|
1999-04-16 03:35:26 +02:00
|
|
|
#if 0
|
2001-03-22 01:58:00 +01:00
|
|
|
fprintf_filtered (stream, "%d entr%s: ", vfuncs,
|
|
|
|
vfuncs == 1 ? "y" : "ies");
|
1999-04-16 03:35:26 +02:00
|
|
|
#else
|
1999-07-07 22:19:36 +02:00
|
|
|
fputs_filtered ("not implemented", stream);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
/* recursive function that prints all virtual function entries */
|
1999-04-16 03:35:26 +02:00
|
|
|
#if 0
|
2001-03-22 01:58:00 +01:00
|
|
|
cp_print_hpacc_virtual_table_entries (real_type, &vfuncs, v,
|
|
|
|
stream, format, recurse,
|
|
|
|
pretty);
|
1999-04-16 03:35:26 +02:00
|
|
|
#endif
|
1999-07-07 22:19:36 +02:00
|
|
|
fputs_filtered ("}", stream);
|
|
|
|
} /* non-RRBC case */
|
|
|
|
else
|
|
|
|
{
|
2000-09-02 01:43:26 +02:00
|
|
|
/* FIXME -- see comments above */
|
1999-07-07 22:19:36 +02:00
|
|
|
/* RRBC support present; function pointers are found
|
|
|
|
* by indirection through the class segment entries. */
|
|
|
|
|
|
|
|
|
|
|
|
} /* RRBC case */
|
|
|
|
} /* if vtblprint */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
if (pretty)
|
|
|
|
{
|
|
|
|
fprintf_filtered (stream, "\n");
|
|
|
|
print_spaces_filtered (2 * recurse, stream);
|
|
|
|
}
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
} /* if vtable exists */
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
fprintf_filtered (stream, "}");
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Special val_print routine to avoid printing multiple copies of virtual
|
|
|
|
baseclasses. */
|
|
|
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
cp_print_value (struct type *type, struct type *real_type, char *valaddr,
|
|
|
|
int offset, CORE_ADDR address, struct ui_file *stream,
|
|
|
|
int format, int recurse, enum val_prettyprint pretty,
|
|
|
|
struct type **dont_print_vb)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
struct obstack tmp_obstack;
|
|
|
|
struct type **last_dont_print
|
2001-03-22 01:58:00 +01:00
|
|
|
= (struct type **) obstack_next_free (&dont_print_vb_obstack);
|
1999-04-16 03:35:26 +02:00
|
|
|
int i, n_baseclasses = TYPE_N_BASECLASSES (type);
|
2001-12-07 23:13:19 +01:00
|
|
|
int thisoffset;
|
|
|
|
struct type *thistype;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
if (dont_print_vb == 0)
|
|
|
|
{
|
|
|
|
/* If we're at top level, carve out a completely fresh
|
1999-07-07 22:19:36 +02:00
|
|
|
chunk of the obstack and use that until this particular
|
|
|
|
invocation returns. */
|
1999-04-16 03:35:26 +02:00
|
|
|
tmp_obstack = dont_print_vb_obstack;
|
|
|
|
/* Bump up the high-water mark. Now alpha is omega. */
|
|
|
|
obstack_finish (&dont_print_vb_obstack);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < n_baseclasses; i++)
|
|
|
|
{
|
|
|
|
int boffset;
|
|
|
|
int skip;
|
|
|
|
struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
|
|
|
|
char *basename = TYPE_NAME (baseclass);
|
|
|
|
char *base_valaddr;
|
|
|
|
|
|
|
|
if (BASETYPE_VIA_VIRTUAL (type, i))
|
|
|
|
{
|
|
|
|
struct type **first_dont_print
|
2001-03-22 01:58:00 +01:00
|
|
|
= (struct type **) obstack_base (&dont_print_vb_obstack);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
int j = (struct type **) obstack_next_free (&dont_print_vb_obstack)
|
2001-03-22 01:58:00 +01:00
|
|
|
- first_dont_print;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
while (--j >= 0)
|
|
|
|
if (baseclass == first_dont_print[j])
|
|
|
|
goto flush_it;
|
|
|
|
|
|
|
|
obstack_ptr_grow (&dont_print_vb_obstack, baseclass);
|
|
|
|
}
|
|
|
|
|
2001-12-07 23:13:19 +01:00
|
|
|
thisoffset = offset;
|
|
|
|
thistype = real_type;
|
1999-04-16 03:35:26 +02:00
|
|
|
if (TYPE_HAS_VTABLE (type) && BASETYPE_VIA_VIRTUAL (type, i))
|
1999-07-07 22:19:36 +02:00
|
|
|
{
|
|
|
|
/* Assume HP/Taligent runtime convention */
|
|
|
|
find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
|
|
|
|
valaddr, offset, &boffset, &skip);
|
|
|
|
if (skip >= 0)
|
2001-03-22 01:58:00 +01:00
|
|
|
error ("Virtual base class offset not found from vtable while"
|
|
|
|
" printing");
|
1999-07-07 22:19:36 +02:00
|
|
|
base_valaddr = valaddr;
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
else
|
1999-07-07 22:19:36 +02:00
|
|
|
{
|
2001-03-22 01:58:00 +01:00
|
|
|
boffset = baseclass_offset (type, i,
|
|
|
|
valaddr + offset,
|
|
|
|
address + offset);
|
1999-07-07 22:19:36 +02:00
|
|
|
skip = ((boffset == -1) || (boffset + offset) < 0) ? 1 : -1;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
if (BASETYPE_VIA_VIRTUAL (type, i))
|
|
|
|
{
|
2001-03-22 01:58:00 +01:00
|
|
|
/* The virtual base class pointer might have been
|
|
|
|
clobbered by the user program. Make sure that it
|
|
|
|
still points to a valid memory location. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2001-03-22 01:58:00 +01:00
|
|
|
if (boffset != -1
|
|
|
|
&& ((boffset + offset) < 0
|
|
|
|
|| (boffset + offset) >= TYPE_LENGTH (type)))
|
1999-07-07 22:19:36 +02:00
|
|
|
{
|
2002-01-08 03:09:31 +01:00
|
|
|
/* FIXME (alloca): unsafe if baseclass is really really large. */
|
1999-07-07 22:19:36 +02:00
|
|
|
base_valaddr = (char *) alloca (TYPE_LENGTH (baseclass));
|
2001-12-07 23:13:19 +01:00
|
|
|
if (target_read_memory (address + offset + boffset, base_valaddr,
|
1999-07-07 22:19:36 +02:00
|
|
|
TYPE_LENGTH (baseclass)) != 0)
|
|
|
|
skip = 1;
|
2001-12-07 23:13:19 +01:00
|
|
|
thisoffset = 0;
|
|
|
|
boffset = 0;
|
|
|
|
thistype = baseclass;
|
1999-07-07 22:19:36 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
base_valaddr = valaddr;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
base_valaddr = valaddr;
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* now do the printing */
|
|
|
|
if (pretty)
|
|
|
|
{
|
|
|
|
fprintf_filtered (stream, "\n");
|
|
|
|
print_spaces_filtered (2 * recurse, stream);
|
|
|
|
}
|
|
|
|
fputs_filtered ("<", stream);
|
|
|
|
/* Not sure what the best notation is in the case where there is no
|
1999-07-07 22:19:36 +02:00
|
|
|
baseclass name. */
|
1999-04-16 03:35:26 +02:00
|
|
|
fputs_filtered (basename ? basename : "", stream);
|
|
|
|
fputs_filtered ("> = ", stream);
|
|
|
|
|
|
|
|
|
|
|
|
if (skip >= 1)
|
|
|
|
fprintf_filtered (stream, "<invalid address>");
|
|
|
|
else
|
2001-12-07 23:13:19 +01:00
|
|
|
cp_print_value_fields (baseclass, thistype, base_valaddr,
|
|
|
|
thisoffset + boffset, address, stream, format,
|
2001-03-22 01:58:00 +01:00
|
|
|
recurse, pretty,
|
|
|
|
((struct type **)
|
|
|
|
obstack_base (&dont_print_vb_obstack)),
|
1999-04-16 03:35:26 +02:00
|
|
|
0);
|
|
|
|
fputs_filtered (", ", stream);
|
|
|
|
|
|
|
|
flush_it:
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (dont_print_vb == 0)
|
|
|
|
{
|
|
|
|
/* Free the space used to deal with the printing
|
1999-07-07 22:19:36 +02:00
|
|
|
of this type from top level. */
|
1999-04-16 03:35:26 +02:00
|
|
|
obstack_free (&dont_print_vb_obstack, last_dont_print);
|
|
|
|
/* Reset watermark so that we can continue protecting
|
1999-07-07 22:19:36 +02:00
|
|
|
ourselves from whatever we were protecting ourselves. */
|
1999-04-16 03:35:26 +02:00
|
|
|
dont_print_vb_obstack = tmp_obstack;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Print value of a static member.
|
|
|
|
To avoid infinite recursion when printing a class that contains
|
|
|
|
a static instance of the class, we keep the addresses of all printed
|
|
|
|
static member classes in an obstack and refuse to print them more
|
|
|
|
than once.
|
|
|
|
|
|
|
|
VAL contains the value to print, TYPE, STREAM, RECURSE, and PRETTY
|
|
|
|
have the same meanings as in c_val_print. */
|
|
|
|
|
|
|
|
static void
|
2001-03-22 01:58:00 +01:00
|
|
|
cp_print_static_field (struct type *type,
|
2001-11-10 21:44:38 +01:00
|
|
|
struct value *val,
|
2001-03-22 01:58:00 +01:00
|
|
|
struct ui_file *stream,
|
|
|
|
int format,
|
|
|
|
int recurse,
|
|
|
|
enum val_prettyprint pretty)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
|
|
|
{
|
|
|
|
CORE_ADDR *first_dont_print;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
first_dont_print
|
1999-07-07 22:19:36 +02:00
|
|
|
= (CORE_ADDR *) obstack_base (&dont_print_statmem_obstack);
|
|
|
|
i = (CORE_ADDR *) obstack_next_free (&dont_print_statmem_obstack)
|
1999-04-16 03:35:26 +02:00
|
|
|
- first_dont_print;
|
|
|
|
|
|
|
|
while (--i >= 0)
|
|
|
|
{
|
|
|
|
if (VALUE_ADDRESS (val) == first_dont_print[i])
|
|
|
|
{
|
2001-03-22 01:58:00 +01:00
|
|
|
fputs_filtered ("<same as static member of an already"
|
|
|
|
" seen type>",
|
1999-04-16 03:35:26 +02:00
|
|
|
stream);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
obstack_grow (&dont_print_statmem_obstack, (char *) &VALUE_ADDRESS (val),
|
|
|
|
sizeof (CORE_ADDR));
|
|
|
|
|
|
|
|
CHECK_TYPEDEF (type);
|
2001-03-22 01:58:00 +01:00
|
|
|
cp_print_value_fields (type, type, VALUE_CONTENTS_ALL (val),
|
|
|
|
VALUE_EMBEDDED_OFFSET (val), VALUE_ADDRESS (val),
|
1999-04-16 03:35:26 +02:00
|
|
|
stream, format, recurse, pretty, NULL, 1);
|
|
|
|
return;
|
|
|
|
}
|
2001-03-22 01:58:00 +01:00
|
|
|
val_print (type, VALUE_CONTENTS_ALL (val),
|
|
|
|
VALUE_EMBEDDED_OFFSET (val), VALUE_ADDRESS (val),
|
1999-04-16 03:35:26 +02:00
|
|
|
stream, format, 0, recurse, pretty);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
cp_print_class_member (char *valaddr, struct type *domain,
|
|
|
|
struct ui_file *stream, char *prefix)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
/* VAL is a byte offset into the structure type DOMAIN.
|
|
|
|
Find the name of the field for that offset and
|
|
|
|
print it. */
|
|
|
|
int extra = 0;
|
|
|
|
int bits = 0;
|
|
|
|
register unsigned int i;
|
|
|
|
unsigned len = TYPE_NFIELDS (domain);
|
|
|
|
|
|
|
|
/* @@ Make VAL into bit offset */
|
|
|
|
|
|
|
|
/* Note: HP aCC generates offsets that are the real byte offsets added
|
|
|
|
to a constant bias 0x20000000 (1 << 29). This constant bias gets
|
|
|
|
shifted out in the code below -- joyous happenstance! */
|
|
|
|
|
|
|
|
/* Note: HP cfront uses a constant bias of 1; if we support this
|
1999-07-07 22:19:36 +02:00
|
|
|
compiler ever, we will have to adjust the computation below */
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
LONGEST val = unpack_long (builtin_type_int, valaddr) << 3;
|
|
|
|
for (i = TYPE_N_BASECLASSES (domain); i < len; i++)
|
|
|
|
{
|
|
|
|
int bitpos = TYPE_FIELD_BITPOS (domain, i);
|
|
|
|
QUIT;
|
|
|
|
if (val == bitpos)
|
|
|
|
break;
|
|
|
|
if (val < bitpos && i != 0)
|
|
|
|
{
|
|
|
|
/* Somehow pointing into a field. */
|
|
|
|
i -= 1;
|
|
|
|
extra = (val - TYPE_FIELD_BITPOS (domain, i));
|
|
|
|
if (extra & 0x7)
|
|
|
|
bits = 1;
|
|
|
|
else
|
|
|
|
extra >>= 3;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (i < len)
|
|
|
|
{
|
|
|
|
char *name;
|
|
|
|
fprintf_filtered (stream, prefix);
|
|
|
|
name = type_name_no_tag (domain);
|
|
|
|
if (name)
|
1999-07-07 22:19:36 +02:00
|
|
|
fputs_filtered (name, stream);
|
1999-04-16 03:35:26 +02:00
|
|
|
else
|
|
|
|
c_type_print_base (domain, stream, 0, 0);
|
|
|
|
fprintf_filtered (stream, "::");
|
|
|
|
fputs_filtered (TYPE_FIELD_NAME (domain, i), stream);
|
|
|
|
if (extra)
|
|
|
|
fprintf_filtered (stream, " + %d bytes", extra);
|
|
|
|
if (bits)
|
|
|
|
fprintf_filtered (stream, " (offset in bits)");
|
|
|
|
}
|
|
|
|
else
|
1999-09-09 02:02:17 +02:00
|
|
|
fprintf_filtered (stream, "%ld", (long) (val >> 3));
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* This function prints out virtual table entries for a class; it
|
|
|
|
* recurses on the base classes to find all virtual functions
|
|
|
|
* available in a class.
|
|
|
|
*
|
|
|
|
* pai/1997-05-21 Note: As the name suggests, it's currently
|
|
|
|
* implemented for HP aCC runtime only. g++ objects are handled
|
|
|
|
* differently and I have made no attempt to fold that logic in
|
|
|
|
* here. The runtime layout is different for the two cases. Also,
|
|
|
|
* this currently has only the code for non-RRBC layouts generated by
|
|
|
|
* the HP aCC compiler; RRBC code is stubbed out and will have to be
|
|
|
|
* added later. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
cp_print_hpacc_virtual_table_entries (struct type *type, int *vfuncs,
|
2001-11-10 21:44:38 +01:00
|
|
|
struct value *v, struct ui_file *stream,
|
2000-07-30 03:48:28 +02:00
|
|
|
int format, int recurse,
|
|
|
|
enum val_prettyprint pretty)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
int fn, oi;
|
|
|
|
|
|
|
|
/* pai: FIXME this function doesn't work. It should handle a given
|
|
|
|
* virtual function only once (latest redefinition in class hierarchy)
|
|
|
|
*/
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
/* Recursion on other classes that can share the same vtable */
|
|
|
|
struct type *pbc = primary_base_class (type);
|
1999-04-16 03:35:26 +02:00
|
|
|
if (pbc)
|
2001-03-22 01:58:00 +01:00
|
|
|
cp_print_hpacc_virtual_table_entries (pbc, vfuncs, v, stream, format,
|
|
|
|
recurse, pretty);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
/* Now deal with vfuncs declared in this class */
|
|
|
|
for (fn = 0; fn < TYPE_NFN_FIELDS (type); fn++)
|
|
|
|
for (oi = 0; oi < TYPE_FN_FIELDLIST_LENGTH (type, fn); oi++)
|
|
|
|
if (TYPE_FN_FIELD_VIRTUAL_P (TYPE_FN_FIELDLIST1 (type, fn), oi))
|
1999-07-07 22:19:36 +02:00
|
|
|
{
|
|
|
|
char *vf_name;
|
2001-03-22 01:58:00 +01:00
|
|
|
const char *field_physname;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
/* virtual function offset */
|
2001-03-22 01:58:00 +01:00
|
|
|
int vx = (TYPE_FN_FIELD_VOFFSET (TYPE_FN_FIELDLIST1 (type, fn), oi)
|
|
|
|
- 1);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
/* Get the address of the vfunction entry */
|
2001-11-10 21:44:38 +01:00
|
|
|
struct value *vf = value_copy (v);
|
1999-07-07 22:19:36 +02:00
|
|
|
if (VALUE_LAZY (vf))
|
|
|
|
(void) value_fetch_lazy (vf);
|
2001-03-22 01:58:00 +01:00
|
|
|
/* adjust by offset */
|
|
|
|
vf->aligner.contents[0] += 4 * (HP_ACC_VFUNC_START + vx);
|
1999-07-07 22:19:36 +02:00
|
|
|
vf = value_ind (vf); /* get the entry */
|
|
|
|
VALUE_TYPE (vf) = VALUE_TYPE (v); /* make it a pointer */
|
|
|
|
|
|
|
|
/* print out the entry */
|
|
|
|
val_print (VALUE_TYPE (vf), VALUE_CONTENTS (vf), 0, 0,
|
|
|
|
stream, format, 0, recurse + 1, pretty);
|
2001-03-22 01:58:00 +01:00
|
|
|
field_physname
|
|
|
|
= TYPE_FN_FIELD_PHYSNAME (TYPE_FN_FIELDLIST1 (type, fn), oi);
|
|
|
|
/* pai: (temp) FIXME Maybe this should be DMGL_ANSI */
|
|
|
|
vf_name = cplus_demangle (field_physname, DMGL_ARM);
|
1999-07-07 22:19:36 +02:00
|
|
|
fprintf_filtered (stream, " %s", vf_name);
|
|
|
|
if (--(*vfuncs) > 0)
|
|
|
|
fputs_filtered (", ", stream);
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
_initialize_cp_valprint (void)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
add_show_from_set
|
|
|
|
(add_set_cmd ("static-members", class_support, var_boolean,
|
1999-07-07 22:19:36 +02:00
|
|
|
(char *) &static_field_print,
|
1999-04-16 03:35:26 +02:00
|
|
|
"Set printing of C++ static members.",
|
|
|
|
&setprintlist),
|
|
|
|
&showprintlist);
|
|
|
|
/* Turn on printing of static fields. */
|
|
|
|
static_field_print = 1;
|
|
|
|
|
|
|
|
add_show_from_set
|
1999-07-07 22:19:36 +02:00
|
|
|
(add_set_cmd ("vtbl", class_support, var_boolean, (char *) &vtblprint,
|
1999-04-16 03:35:26 +02:00
|
|
|
"Set printing of C++ virtual function tables.",
|
|
|
|
&setprintlist),
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
add_show_from_set
|
1999-07-07 22:19:36 +02:00
|
|
|
(add_set_cmd ("object", class_support, var_boolean, (char *) &objectprint,
|
|
|
|
"Set printing of object's derived type based on vtable info.",
|
1999-04-16 03:35:26 +02:00
|
|
|
&setprintlist),
|
|
|
|
&showprintlist);
|
|
|
|
|
|
|
|
/* Give people the defaults which they are used to. */
|
|
|
|
objectprint = 0;
|
|
|
|
vtblprint = 0;
|
|
|
|
obstack_begin (&dont_print_vb_obstack, 32 * sizeof (struct type *));
|
|
|
|
obstack_specify_allocation (&dont_print_statmem_obstack,
|
|
|
|
32 * sizeof (CORE_ADDR), sizeof (CORE_ADDR),
|
2000-12-15 02:01:51 +01:00
|
|
|
xmalloc, xfree);
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|