home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Education Sampler 1992 [NeXTSTEP]
/
Education_1992_Sampler.iso
/
NeXT
/
GnuSource
/
cc-61.0.1
/
cc
/
cplus-ptree.c
< prev
next >
Wrap
C/C++ Source or Header
|
1991-06-03
|
4KB
|
127 lines
/* Prints out tree in human readable form - GNU C++ compiler
Copyright (C) 1990 Free Software Foundation, Inc.
Hacked by Michael Tiemann (tiemann@cygnus.com)
This file is part of GNU CC.
GNU CC 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, or (at your option)
any later version.
GNU CC 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.
You should have received a copy of the GNU General Public License
along with GNU CC; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "config.h"
#include "tree.h"
#include "cplus-tree.h"
#include <stdio.h>
void
print_lang_decl (file, node, indent)
FILE *file;
tree node;
int indent;
{
if (TREE_CODE (node) == TEMPLATE_DECL)
{
indent_to (file, indent + 3);
fprintf (file, " template-info %x", DECL_LANG_SPECIFIC (node));
return;
}
if (!DECL_LANG_SPECIFIC (node))
return;
indent_to (file, indent + 3);
if (DECL_ORIGINAL_NAME (node))
fprintf (file, " original-name %x", DECL_ORIGINAL_NAME (node));
if (DECL_MAIN_VARIANT (node))
fprintf (file, " decl-main-variant %x", DECL_MAIN_VARIANT (node));
if (DECL_PENDING_INLINE_INFO (node))
fprintf (file, " pending-inline-info %x", DECL_PENDING_INLINE_INFO (node));
}
void
print_lang_type (file, node, indent)
FILE *file;
register tree node;
int indent;
{
if (! (TREE_CODE (node) == RECORD_TYPE
|| TREE_CODE (node) == UNION_TYPE))
return;
indent_to (file, indent + 3);
if (TYPE_NEEDS_CONSTRUCTOR (node))
fputs ( "needs-constructor", file);
if (TYPE_NEEDS_DESTRUCTOR (node))
fputs (" needs-destructor", file);
if (TYPE_HAS_CONVERSION (node))
fputs (" has-type-conversion", file);
if (TYPE_HAS_INT_CONVERSION (node))
fputs (" has-int-conversion", file);
if (TYPE_HAS_REAL_CONVERSION (node))
fputs (" has-float-conversion", file);
if (TYPE_HAS_INIT_REF (node))
fputs (" X(X&)", file);
if (TREE_GETS_NEW (node))
fputs (" gets-new", file);
if (TREE_GETS_DELETE (node))
fputs (" gets-delete", file);
if (TYPE_HAS_ASSIGNMENT (node))
fputs (" has=", file);
if (TYPE_GETS_ASSIGNMENT (node))
fputs (" gets=", file);
if (TYPE_HAS_ASSIGN_REF (node))
fputs (" this=(X&)", file);
if (TYPE_GETS_ASSIGN_REF (node))
fputs (" gets=(X&)", file);
if (TYPE_HAS_WRAPPER (node))
fputs (" wrapper", file);
if (TYPE_OVERLOADS_METHOD_CALL_EXPR (node))
fputs (" op->()", file);
if (TYPE_GETS_INIT_AGGR (node))
fputs (" gets X(X, ...)", file);
if (TYPE_OVERLOADS_CALL_EXPR (node))
fputs (" op()", file);
if (TYPE_OVERLOADS_ARRAY_REF (node))
fputs (" op[]", file);
if (TYPE_USES_MULTIPLE_INHERITANCE (node))
fputs (" uses-multiple-inheritance", file);
if (TREE_CODE (node) == RECORD_TYPE)
{
fprintf (file, " n_parents %d n_ancestors %d",
CLASSTYPE_N_BASECLASSES (node),
CLASSTYPE_N_SUPERCLASSES (node));
print_node (file, "member-functions", CLASSTYPE_METHOD_VEC (node),
indent + 4);
print_node (file, "baselinks",
TYPE_BASETYPES (node) ? CLASSTYPE_BASELINK_VEC (node) : NULL_TREE,
indent + 4);
print_node (file, "offset", CLASSTYPE_OFFSET (node), indent + 4);
}
}
void
print_lang_identifier (file, node, indent)
FILE *file;
tree node;
int indent;
{
print_node (file, "global", IDENTIFIER_GLOBAL_VALUE (node), indent + 4);
print_node (file, "class", IDENTIFIER_CLASS_VALUE (node), indent + 4);
print_node (file, "local", IDENTIFIER_LOCAL_VALUE (node), indent + 4);
print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
print_node (file, "template", IDENTIFIER_TEMPLATE (node), indent + 4);
print_node (file, "implicit", IDENTIFIER_IMPLICIT_DECL (node), indent + 4);
print_node (file, "error locus", IDENTIFIER_ERROR_LOCUS (node), indent + 4);
}