/* Prints out tree in human readable form - GNU C-compiler
- Copyright (C) 1990, 1991 Free Software Foundation, Inc.
+ Copyright (C) 1990, 91, 93, 94, 95, 1996 Free Software Foundation, Inc.
This file is part of GNU CC.
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. */
+the Free Software Foundation, 59 Temple Place - Suite 330,
+Boston, MA 02111-1307, USA. */
#include "config.h"
tree node;
{
char *object = (char *) oballoc (0);
+
table = (struct bucket **) oballoc (HASH_SIZE * sizeof (struct bucket *));
- bzero (table, HASH_SIZE * sizeof (struct bucket *));
+ bzero ((char *) table, HASH_SIZE * sizeof (struct bucket *));
print_node (stderr, "", node, 0);
table = 0;
obfree (object);
if (indent > 0)
fprintf (file, " ");
fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
- fprintf (file, HOST_PTR_PRINTF, node);
+ fprintf (file, HOST_PTR_PRINTF, (HOST_WIDE_INT) node);
if (class == 'd')
{
/* We might as well always print the value of an integer. */
if (TREE_CODE (node) == INTEGER_CST)
{
+ if (TREE_CONSTANT_OVERFLOW (node))
+ fprintf (file, " overflow");
+
+ fprintf (file, " ");
if (TREE_INT_CST_HIGH (node) == 0)
- fprintf (file, " %1u", TREE_INT_CST_LOW (node));
+ fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
else if (TREE_INT_CST_HIGH (node) == -1
&& TREE_INT_CST_LOW (node) != 0)
- fprintf (file, " -%1u", -TREE_INT_CST_LOW (node));
+ {
+ fprintf (file, "-");
+ fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
+ -TREE_INT_CST_LOW (node));
+ }
else
- fprintf (file,
-#if HOST_BITS_PER_WIDE_INT == 64
-#if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
- " 0x%lx%016lx",
-#else
- " 0x%x%016x",
-#endif
-#else
-#if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
- " 0x%lx%08lx",
-#else
- " 0x%x%08x",
-#endif
-#endif
+ fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
}
if (TREE_CODE (node) == REAL_CST)
{
-#ifndef REAL_IS_NOT_DOUBLE
- fprintf (file, " %e", TREE_REAL_CST (node));
+ REAL_VALUE_TYPE d;
+
+ if (TREE_OVERFLOW (node))
+ fprintf (file, " overflow");
+
+#if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
+ d = TREE_REAL_CST (node);
+ if (REAL_VALUE_ISINF (d))
+ fprintf (file, " Inf");
+ else if (REAL_VALUE_ISNAN (d))
+ fprintf (file, " Nan");
+ else
+ {
+ char string[100];
+
+ REAL_VALUE_TO_DECIMAL (d, "%e", string);
+ fprintf (file, " %s", string);
+ }
#else
{
int i;
- char *p = (char *) &TREE_REAL_CST (node);
+ unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
fprintf (file, " 0x");
for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
fprintf (file, "%02x", *p++);
fprintf (file, "");
}
-#endif /* REAL_IS_NOT_DOUBLE */
+#endif
}
fprintf (file, ">");
return;
}
- /* It is unsafe to look at any other filds of an ERROR_MARK node. */
+ /* It is unsafe to look at any other filds of an ERROR_MARK node. */
if (TREE_CODE (node) == ERROR_MARK)
{
print_node_brief (file, prefix, node, indent);
return;
}
- hash = ((int) node & ~(1 << (HOST_BITS_PER_INT - 1))) % HASH_SIZE;
+ hash = ((unsigned HOST_WIDE_INT) node) % HASH_SIZE;
/* If node is in the table, just mention its address. */
for (b = table[hash]; b; b = b->next)
/* Print the slot this node is in, and its code, and address. */
fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
- fprintf (file, HOST_PTR_PRINTF, node);
+ fprintf (file, HOST_PTR_PRINTF, (HOST_WIDE_INT) node);
/* Print the name, if any. */
if (class == 'd')
print_node (file, "type", TREE_TYPE (node), indent + 4);
if (TREE_TYPE (node))
indent_to (file, indent + 3);
+
+ print_obstack_name ((char *) node, file, "");
+ indent_to (file, indent + 3);
}
/* If a permanent object is in the wrong obstack, or the reverse, warn. */
case 'd':
mode = DECL_MODE (node);
+ if (DECL_IGNORED_P (node))
+ fputs (" ignored", file);
+ if (DECL_ABSTRACT (node))
+ fputs (" abstract", file);
+ if (DECL_IN_SYSTEM_HEADER (node))
+ fputs (" in_system_header", file);
+ if (DECL_COMMON (node))
+ fputs (" common", file);
if (DECL_EXTERNAL (node))
fputs (" external", file);
- if (DECL_NONLOCAL (node))
- fputs (" nonlocal", file);
if (DECL_REGISTER (node))
fputs (" regdecl", file);
+ if (DECL_PACKED (node))
+ fputs (" packed", file);
+ if (DECL_NONLOCAL (node))
+ fputs (" nonlocal", file);
if (DECL_INLINE (node))
fputs (" inline", file);
- if (DECL_BIT_FIELD (node))
+
+ if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
+ fputs (" suppress-debug", file);
+
+ if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
+ fputs (" built-in", file);
+ if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN_NONANSI (node))
+ fputs (" built-in-nonansi", file);
+
+ if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
fputs (" bit-field", file);
+ if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
+ fputs (" too-late", file);
+ if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
+ fputs (" in-text-section", file);
+
if (DECL_VIRTUAL_P (node))
fputs (" virtual", file);
- if (DECL_IGNORED_P (node))
- fputs (" ignored", file);
- if (DECL_IN_SYSTEM_HEADER (node))
- fputs (" in_system_header", file);
+ if (DECL_DEFER_OUTPUT (node))
+ fputs (" defer-output", file);
+ if (DECL_TRANSPARENT_UNION (node))
+ fputs (" transparent-union", file);
+
if (DECL_LANG_FLAG_0 (node))
fputs (" decl_0", file);
if (DECL_LANG_FLAG_1 (node))
DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
print_node (file, "size", DECL_SIZE (node), indent + 4);
+ print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
indent_to (file, indent + 3);
if (TREE_CODE (node) != FUNCTION_DECL)
fprintf (file, " align %d", DECL_ALIGN (node));
if (TREE_CODE (node) == FIELD_DECL)
print_node (file, "bitpos", DECL_FIELD_BITPOS (node), indent + 4);
print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
+ print_node_brief (file, "machine_attributes", DECL_MACHINE_ATTRIBUTES (node), indent + 4);
print_node_brief (file, "abstract_origin",
DECL_ABSTRACT_ORIGIN (node), indent + 4);
else if (TREE_CODE (node) == FUNCTION_DECL)
{
fprintf (file, "saved-insns ");
- fprintf (file, HOST_PTR_PRINTF, DECL_SAVED_INSNS (node));
+ fprintf (file, HOST_PTR_PRINTF,
+ (HOST_WIDE_INT) DECL_SAVED_INSNS (node));
}
}
case 't':
if (TYPE_NO_FORCE_BLK (node))
- fputs (" no_force_blk", file);
+ fputs (" no-force-blk", file);
+ if (TYPE_STRING_FLAG (node))
+ fputs (" string-flag", file);
+ if (TYPE_NEEDS_CONSTRUCTING (node))
+ fputs (" needs-constructing", file);
+ if (TYPE_TRANSPARENT_UNION (node))
+ fputs (" transparent-union", file);
+ if (TYPE_PACKED (node))
+ fputs (" packed", file);
+
if (TYPE_LANG_FLAG_0 (node))
fputs (" type_0", file);
if (TYPE_LANG_FLAG_1 (node))
fprintf (file, " align %d", TYPE_ALIGN (node));
fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
+ print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
+
if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
- else if (TREE_CODE (node) == INTEGER_TYPE)
+ else if (TREE_CODE (node) == INTEGER_TYPE
+ || TREE_CODE (node) == BOOLEAN_TYPE
+ || TREE_CODE (node) == CHAR_TYPE)
{
fprintf (file, " precision %d", TYPE_PRECISION (node));
print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
}
else if (TREE_CODE (node) == REAL_TYPE)
fprintf (file, " precision %d", TYPE_PRECISION (node));
- else if (TREE_CODE (node) == RECORD_TYPE || TREE_CODE (node) == UNION_TYPE)
+ else if (TREE_CODE (node) == RECORD_TYPE
+ || TREE_CODE (node) == UNION_TYPE
+ || TREE_CODE (node) == QUAL_UNION_TYPE)
print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
else if (TREE_CODE (node) == FUNCTION_TYPE || TREE_CODE (node) == METHOD_TYPE)
{
indent_to (file, indent + 4);
fprintf (file, "rtl %d ", i);
if (TREE_OPERAND (node, i))
- print_rtl (file, TREE_OPERAND (node, i));
+ print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
else
fprintf (file, "(nil)");
fprintf (file, "\n");
switch (TREE_CODE (node))
{
case INTEGER_CST:
+ if (TREE_CONSTANT_OVERFLOW (node))
+ fprintf (file, " overflow");
+
+ fprintf (file, " ");
if (TREE_INT_CST_HIGH (node) == 0)
- fprintf (file, " %1u", TREE_INT_CST_LOW (node));
+ fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
+ TREE_INT_CST_LOW (node));
else if (TREE_INT_CST_HIGH (node) == -1
&& TREE_INT_CST_LOW (node) != 0)
- fprintf (file, " -%1u", -TREE_INT_CST_LOW (node));
+ {
+ fprintf (file, "-");
+ fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
+ -TREE_INT_CST_LOW (node));
+ }
else
- fprintf (file,
-#if HOST_BITS_PER_WIDE_INT == 64
-#if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
- " 0x%lx%016lx",
-#else
- " 0x%x%016x",
-#endif
-#else
-#if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
- " 0x%lx%08lx",
-#else
- " 0x%x%08x",
-#endif
-#endif
+ fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
break;
case REAL_CST:
-#ifndef REAL_IS_NOT_DOUBLE
- fprintf (file, " %e", TREE_REAL_CST (node));
-#else
{
- char *p = (char *) &TREE_REAL_CST (node);
- fprintf (file, " 0x");
- for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
- fprintf (file, "%02x", *p++);
- fprintf (file, "");
+ REAL_VALUE_TYPE d;
+
+ if (TREE_OVERFLOW (node))
+ fprintf (file, " overflow");
+
+#if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
+ d = TREE_REAL_CST (node);
+ if (REAL_VALUE_ISINF (d))
+ fprintf (file, " Inf");
+ else if (REAL_VALUE_ISNAN (d))
+ fprintf (file, " Nan");
+ else
+ {
+ char string[100];
+
+ REAL_VALUE_TO_DECIMAL (d, "%e", string);
+ fprintf (file, " %s", string);
+ }
+#else
+ {
+ int i;
+ unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
+ fprintf (file, " 0x");
+ for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
+ fprintf (file, "%02x", *p++);
+ fprintf (file, "");
+ }
+#endif
}
-#endif /* REAL_IS_NOT_DOUBLE */
break;
case COMPLEX_CST:
case STRING_CST:
fprintf (file, " \"%s\"", TREE_STRING_POINTER (node));
+ /* Print the chain at second level. */
+ if (indent == 4)
+ print_node (file, "chain", TREE_CHAIN (node), indent + 4);
+ else
+ print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
break;
case IDENTIFIER_NODE:
case TREE_VEC:
len = TREE_VEC_LENGTH (node);
for (i = 0; i < len; i++)
- {
- char temp[10];
- sprintf (temp, "elt %d", i);
- indent_to (file, indent + 4);
- print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
- }
+ if (TREE_VEC_ELT (node, i))
+ {
+ char temp[10];
+ sprintf (temp, "elt %d", i);
+ indent_to (file, indent + 4);
+ print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
+ }
break;
case OP_IDENTIFIER:
break;
}
+
+ fprintf (file, ">");
}
OSDN Git Service
