/* Prints out tree in human readable form - GCC
- Copyright (C) 1990-2014 Free Software Foundation, Inc.
+ Copyright (C) 1990-2020 Free Software Foundation, Inc.
This file is part of GCC.
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
+#include "cgraph.h"
+#include "diagnostic.h"
#include "varasm.h"
#include "print-rtl.h"
#include "stor-layout.h"
-#include "ggc.h"
#include "langhooks.h"
#include "tree-iterator.h"
-#include "diagnostic.h"
#include "gimple-pretty-print.h" /* FIXME */
-#include "cgraph.h"
#include "tree-cfg.h"
-#include "tree-dump.h"
#include "dumpfile.h"
-#include "wide-int-print.h"
+#include "print-tree.h"
/* Define the hash table of nodes already seen.
Such nodes are not repeated; brief cross-references are used. */
#define HASH_SIZE 37
-struct bucket
-{
- tree node;
- struct bucket *next;
-};
-
-static struct bucket **table;
+static hash_set<tree> *table = NULL;
/* Print PREFIX and ADDR to FILE. */
void
fprintf (file, "%s" HOST_PTR_PRINTF, prefix, addr);
}
+/* Print to FILE a NODE representing a REAL_CST constant, including
+ Infinity and NaN. Be verbose when BFRIEF is false. */
+
+static void
+print_real_cst (FILE *file, const_tree node, bool brief)
+{
+ if (TREE_OVERFLOW (node))
+ fprintf (file, " overflow");
+
+ REAL_VALUE_TYPE d = TREE_REAL_CST (node);
+ if (REAL_VALUE_ISINF (d))
+ fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
+ else if (REAL_VALUE_ISNAN (d))
+ {
+ /* Print a NaN in the format [-][Q]NaN[(significand[exponent])]
+ where significand is a hexadecimal string that starts with
+ the 0x prefix followed by 0 if the number is not canonical
+ and a non-zero digit if it is, and exponent is decimal. */
+ unsigned start = 0;
+ const char *psig = (const char *) d.sig;
+ for (unsigned i = 0; i != sizeof d.sig; ++i)
+ if (psig[i])
+ {
+ start = i;
+ break;
+ }
+
+ fprintf (file, " %s%sNaN", d.sign ? "-" : "",
+ d.signalling ? "S" : "Q");
+
+ if (brief)
+ return;
+
+ if (start)
+ fprintf (file, "(0x%s", d.canonical ? "" : "0");
+ else if (d.uexp)
+ fprintf (file, "(%s", d.canonical ? "" : "0");
+ else if (!d.canonical)
+ {
+ fprintf (file, "(0)");
+ return;
+ }
+
+ if (psig[start])
+ {
+ for (unsigned i = start; i != sizeof d.sig; ++i)
+ if (i == start)
+ fprintf (file, "%x", psig[i]);
+ else
+ fprintf (file, "%02x", psig[i]);
+ }
+
+ if (d.uexp)
+ fprintf (file, "%se%u)", psig[start] ? "," : "", d.uexp);
+ else if (psig[start])
+ fputc (')', file);
+ }
+ else
+ {
+ char string[64];
+ real_to_decimal (string, &d, sizeof (string), 0, 1);
+ fprintf (file, " %s", string);
+ }
+}
+
/* Print a node in brief fashion, with just the code, address and name. */
void
fprintf (file, " overflow");
fprintf (file, " ");
- print_dec (node, file, TYPE_SIGN (TREE_TYPE (node)));
+ print_dec (wi::to_wide (node), file, TYPE_SIGN (TREE_TYPE (node)));
}
if (TREE_CODE (node) == REAL_CST)
- {
- REAL_VALUE_TYPE d;
-
- if (TREE_OVERFLOW (node))
- fprintf (file, " overflow");
-
- d = TREE_REAL_CST (node);
- if (REAL_VALUE_ISINF (d))
- fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
- else if (REAL_VALUE_ISNAN (d))
- fprintf (file, " Nan");
- else
- {
- char string[60];
- real_to_decimal (string, &d, sizeof (string), 0, 1);
- fprintf (file, " %s", string);
- }
- }
+ print_real_cst (file, node, true);
if (TREE_CODE (node) == FIXED_CST)
{
FIXED_VALUE_TYPE f;
starting in column INDENT. */
void
-print_node (FILE *file, const char *prefix, tree node, int indent)
+print_node (FILE *file, const char *prefix, tree node, int indent,
+ bool brief_for_visited)
{
- int hash;
- struct bucket *b;
- enum machine_mode mode;
+ machine_mode mode;
enum tree_code_class tclass;
int len;
int i;
return;
code = TREE_CODE (node);
+
+ /* It is unsafe to look at any other fields of a node with ERROR_MARK or
+ invalid code. */
+ if (code == ERROR_MARK || code >= MAX_TREE_CODES)
+ {
+ print_node_brief (file, prefix, node, indent);
+ return;
+ }
+
tclass = TREE_CODE_CLASS (code);
/* Don't get too deep in nesting. If the user wants to see deeper,
return;
}
- /* It is unsafe to look at any other fields of an ERROR_MARK node. */
- if (code == ERROR_MARK)
- {
- print_node_brief (file, prefix, node, indent);
- return;
- }
-
/* Allow this function to be called if the table is not there. */
if (table)
{
- hash = ((uintptr_t) node) % HASH_SIZE;
-
/* If node is in the table, just mention its address. */
- for (b = table[hash]; b; b = b->next)
- if (b->node == node)
- {
- print_node_brief (file, prefix, node, indent);
- return;
- }
+ if (table->contains (node) && brief_for_visited)
+ {
+ print_node_brief (file, prefix, node, indent);
+ return;
+ }
- /* Add this node to the table. */
- b = XNEW (struct bucket);
- b->node = node;
- b->next = table[hash];
- table[hash] = b;
+ table->add (node);
}
/* Indent to the specified column, since this is the long form. */
if (TREE_USED (node))
fputs (" used", file);
if (TREE_NOTHROW (node))
- fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
+ fputs (" nothrow", file);
if (TREE_PUBLIC (node))
fputs (" public", file);
if (TREE_PRIVATE (node))
if (TREE_PROTECTED (node))
fputs (" protected", file);
if (TREE_STATIC (node))
- fputs (" static", file);
+ fputs (code == CALL_EXPR ? " must-tail-call" : " static", file);
if (TREE_DEPRECATED (node))
fputs (" deprecated", file);
if (TREE_VISITED (node))
fputs (" unsigned", file);
if (DECL_IGNORED_P (node))
fputs (" ignored", file);
- if (DECL_ABSTRACT (node))
+ if (DECL_ABSTRACT_P (node))
fputs (" abstract", file);
if (DECL_EXTERNAL (node))
fputs (" external", file);
fputs (" function-specific-opt", file);
if (code == FUNCTION_DECL && DECL_DECLARED_INLINE_P (node))
fputs (" autoinline", file);
- if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
+ if (code == FUNCTION_DECL && DECL_UNINLINABLE (node))
+ fputs (" uninlinable", file);
+ if (code == FUNCTION_DECL && fndecl_built_in_p (node))
fputs (" built-in", file);
if (code == FUNCTION_DECL && DECL_STATIC_CHAIN (node))
fputs (" static-chain", file);
fputs (" in-constant-pool", file);
if (code == VAR_DECL && DECL_COMMON (node))
fputs (" common", file);
+ if ((code == VAR_DECL || code == PARM_DECL) && DECL_READ_P (node))
+ fputs (" read", file);
if (code == VAR_DECL && DECL_THREAD_LOCAL_P (node))
{
fputs (" ", file);
xloc = expand_location (DECL_SOURCE_LOCATION (node));
- fprintf (file, " file %s line %d col %d", xloc.file, xloc.line,
+ fprintf (file, " %s:%d:%d", xloc.file, xloc.line,
xloc.column);
if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
{
print_node (file, "size", DECL_SIZE (node), indent + 4);
- print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
+ print_node (file, "unit-size", DECL_SIZE_UNIT (node), indent + 4);
- if (code != FUNCTION_DECL || DECL_BUILT_IN (node))
+ if (code != FUNCTION_DECL || fndecl_built_in_p (node))
indent_to (file, indent + 3);
if (DECL_USER_ALIGN (node))
fprintf (file, " user");
- fprintf (file, " align %d", DECL_ALIGN (node));
+ fprintf (file, " align:%d warn_if_not_align:%d",
+ DECL_ALIGN (node), DECL_WARN_IF_NOT_ALIGN (node));
if (code == FIELD_DECL)
fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
DECL_OFFSET_ALIGN (node));
- if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
+ if (code == FUNCTION_DECL && fndecl_built_in_p (node))
{
if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
- fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
+ fprintf (file, " built-in: BUILT_IN_MD:%d",
+ DECL_MD_FUNCTION_CODE (node));
+ else if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_FRONTEND)
+ fprintf (file, " built-in: BUILT_IN_FRONTEND:%d",
+ DECL_FE_FUNCTION_CODE (node));
else
- fprintf (file, " built-in %s:%s",
+ fprintf (file, " built-in: %s:%s",
built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
built_in_names[(int) DECL_FUNCTION_CODE (node)]);
}
if (code == FIELD_DECL)
{
print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
- print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
+ print_node (file, "bit-offset", DECL_FIELD_BIT_OFFSET (node),
indent + 4);
if (DECL_BIT_FIELD_TYPE (node))
print_node (file, "bit_field_type", DECL_BIT_FIELD_TYPE (node),
if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
{
- print_node_brief (file, "attributes",
+ print_node (file, "attributes",
DECL_ATTRIBUTES (node), indent + 4);
if (code != PARM_DECL)
print_node_brief (file, "initial", DECL_INITIAL (node),
}
if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
{
- print_node (file, "arguments", DECL_ARGUMENT_FLD (node), indent + 4);
print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
}
else if (code == FUNCTION_DECL
&& DECL_STRUCT_FUNCTION (node) != 0)
{
+ print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
indent_to (file, indent + 4);
dump_addr (file, "struct-function ", DECL_STRUCT_FUNCTION (node));
}
if (TYPE_NO_FORCE_BLK (node))
fputs (" no-force-blk", file);
- if (TYPE_STRING_FLAG (node))
+ if (code == ARRAY_TYPE && TYPE_STRING_FLAG (node))
fputs (" string-flag", file);
if (TYPE_NEEDS_CONSTRUCTING (node))
fputs (" needs-constructing", file);
+ if ((code == RECORD_TYPE
+ || code == UNION_TYPE
+ || code == QUAL_UNION_TYPE
+ || code == ARRAY_TYPE)
+ && TYPE_REVERSE_STORAGE_ORDER (node))
+ fputs (" reverse-storage-order", file);
+
+ if ((code == RECORD_TYPE
+ || code == UNION_TYPE)
+ && TYPE_CXX_ODR_P (node))
+ fputs (" cxx-odr-p", file);
+
/* The transparent-union flag is used for different things in
different nodes. */
if ((code == UNION_TYPE || code == RECORD_TYPE)
fputs (" type_5", file);
if (TYPE_LANG_FLAG_6 (node))
fputs (" type_6", file);
+ if (TYPE_LANG_FLAG_7 (node))
+ fputs (" type_7", file);
mode = TYPE_MODE (node);
fprintf (file, " %s", GET_MODE_NAME (mode));
print_node (file, "size", TYPE_SIZE (node), indent + 4);
- print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
+ print_node (file, "unit-size", TYPE_SIZE_UNIT (node), indent + 4);
indent_to (file, indent + 3);
if (TYPE_USER_ALIGN (node))
fprintf (file, " user");
- fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
- TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
+ fprintf (file, " align:%d warn_if_not_align:%d symtab:%d alias-set "
+ HOST_WIDE_INT_PRINT_DEC,
+ TYPE_ALIGN (node), TYPE_WARN_IF_NOT_ALIGN (node),
+ TYPE_SYMTAB_ADDRESS (node),
(HOST_WIDE_INT) TYPE_ALIAS_SET (node));
if (TYPE_STRUCTURAL_EQUALITY_P (node))
- fprintf (file, " structural equality");
+ fprintf (file, " structural-equality");
else
- dump_addr (file, " canonical type ", TYPE_CANONICAL (node));
+ dump_addr (file, " canonical-type ", TYPE_CANONICAL (node));
print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
if (INTEGRAL_TYPE_P (node) || code == REAL_TYPE
|| code == FIXED_POINT_TYPE)
{
- fprintf (file, " precision %d", TYPE_PRECISION (node));
+ fprintf (file, " precision:%d", TYPE_PRECISION (node));
print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
}
else if (code == ARRAY_TYPE)
print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
else if (code == VECTOR_TYPE)
- fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node));
+ {
+ fprintf (file, " nunits:");
+ print_dec (TYPE_VECTOR_SUBPARTS (node), file);
+ }
else if (code == RECORD_TYPE
|| code == UNION_TYPE
|| code == QUAL_UNION_TYPE)
i = 0;
FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
{
- char temp[10];
- sprintf (temp, "arg %d", i);
+ /* Buffer big enough to format a 32-bit UINT_MAX into, plus
+ the text. */
+ char temp[15];
+ sprintf (temp, "arg:%u", i);
print_node (file, temp, arg, indent + 4);
i++;
}
for (i = 0; i < len; i++)
{
- char temp[10];
+ /* Buffer big enough to format a 32-bit UINT_MAX into, plus
+ the text. */
+ char temp[15];
- sprintf (temp, "arg %d", i);
+ sprintf (temp, "arg:%d", i);
print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
}
}
fprintf (file, " overflow");
fprintf (file, " ");
- print_dec (node, file, TYPE_SIGN (TREE_TYPE (node)));
+ print_dec (wi::to_wide (node), file, TYPE_SIGN (TREE_TYPE (node)));
break;
case REAL_CST:
- {
- REAL_VALUE_TYPE d;
-
- if (TREE_OVERFLOW (node))
- fprintf (file, " overflow");
-
- d = TREE_REAL_CST (node);
- if (REAL_VALUE_ISINF (d))
- fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
- else if (REAL_VALUE_ISNAN (d))
- fprintf (file, " Nan");
- else
- {
- char string[64];
- real_to_decimal (string, &d, sizeof (string), 0, 1);
- fprintf (file, " %s", string);
- }
- }
+ print_real_cst (file, node, false);
break;
case FIXED_CST:
case VECTOR_CST:
{
- char buf[10];
- unsigned i;
-
- for (i = 0; i < VECTOR_CST_NELTS (node); ++i)
+ /* Big enough for UINT_MAX plus the string below. */
+ char buf[32];
+
+ fprintf (file, " npatterns:%u nelts-per-pattern:%u",
+ VECTOR_CST_NPATTERNS (node),
+ VECTOR_CST_NELTS_PER_PATTERN (node));
+ unsigned int count = vector_cst_encoded_nelts (node);
+ for (unsigned int i = 0; i < count; ++i)
{
- sprintf (buf, "elt%u: ", i);
- print_node (file, buf, VECTOR_CST_ELT (node, i), indent + 4);
+ sprintf (buf, "elt:%u: ", i);
+ print_node (file, buf, VECTOR_CST_ENCODED_ELT (node, i),
+ indent + 4);
}
}
break;
}
break;
+ case POLY_INT_CST:
+ {
+ char buf[10];
+ for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
+ {
+ snprintf (buf, sizeof (buf), "elt%u: ", i);
+ print_node (file, buf, POLY_INT_CST_COEFF (node, i),
+ indent + 4);
+ }
+ }
+ break;
+
case IDENTIFIER_NODE:
lang_hooks.print_identifier (file, node, indent);
break;
case TREE_VEC:
len = TREE_VEC_LENGTH (node);
+ fprintf (file, " length:%d", len);
for (i = 0; i < len; i++)
if (TREE_VEC_ELT (node, i))
{
- char temp[10];
- sprintf (temp, "elt %d", i);
+ /* Buffer big enough to format a 32-bit UINT_MAX into, plus
+ the text. */
+ char temp[15];
+ sprintf (temp, "elt:%d", i);
print_node (file, temp, TREE_VEC_ELT (node, i), indent + 4);
}
break;
{
unsigned HOST_WIDE_INT cnt;
tree index, value;
- len = vec_safe_length (CONSTRUCTOR_ELTS (node));
- fprintf (file, " lngt %d", len);
+ len = CONSTRUCTOR_NELTS (node);
+ fprintf (file, " length:%d", len);
FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node),
cnt, index, value)
{
- print_node (file, "idx", index, indent + 4);
- print_node (file, "val", value, indent + 4);
+ print_node (file, "idx", index, indent + 4, false);
+ print_node (file, "val", value, indent + 4, false);
}
}
break;
case SSA_NAME:
print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
+ indent_to (file, indent + 4);
fprintf (file, "def_stmt ");
- print_gimple_stmt (file, SSA_NAME_DEF_STMT (node), indent + 4, 0);
+ {
+ pretty_printer buffer;
+ buffer.buffer->stream = file;
+ pp_gimple_stmt_1 (&buffer, SSA_NAME_DEF_STMT (node), indent + 4,
+ TDF_NONE);
+ pp_flush (&buffer);
+ }
indent_to (file, indent + 4);
- fprintf (file, "version %u", SSA_NAME_VERSION (node));
+ fprintf (file, "version:%u", SSA_NAME_VERSION (node));
if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
fprintf (file, " in-abnormal-phi");
if (SSA_NAME_IN_FREE_LIST (node))
for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (node)]; i++)
{
indent_to (file, indent + 4);
- fprintf (file, "op %d:", i);
+ fprintf (file, "op-%d:", i);
print_node_brief (file, "", OMP_CLAUSE_OPERAND (node, i), 0);
}
}
cl_target_option_print (file, indent + 4, TREE_TARGET_OPTION (node));
break;
case IMPORTED_DECL:
- fprintf (file, " imported declaration");
- print_node_brief (file, "associated declaration",
+ fprintf (file, " imported-declaration");
+ print_node_brief (file, "associated-declaration",
IMPORTED_DECL_ASSOCIATED_DECL (node),
indent + 4);
break;
+ case TREE_BINFO:
+ fprintf (file, " bases:%d",
+ vec_safe_length (BINFO_BASE_BINFOS (node)));
+ print_node_brief (file, "offset", BINFO_OFFSET (node), indent + 4);
+ print_node_brief (file, "virtuals", BINFO_VIRTUALS (node),
+ indent + 4);
+ print_node_brief (file, "inheritance-chain",
+ BINFO_INHERITANCE_CHAIN (node),
+ indent + 4);
+ break;
+
default:
if (EXCEPTIONAL_CLASS_P (node))
lang_hooks.print_xnode (file, node, indent);
expanded_location xloc = expand_location (EXPR_LOCATION (node));
indent_to (file, indent+4);
fprintf (file, "%s:%d:%d", xloc.file, xloc.line, xloc.column);
+
+ /* Print the range, if any */
+ source_range r = EXPR_LOCATION_RANGE (node);
+ if (r.m_start)
+ {
+ xloc = expand_location (r.m_start);
+ fprintf (file, " start: %s:%d:%d", xloc.file, xloc.line, xloc.column);
+ }
+ else
+ {
+ fprintf (file, " start: unknown");
+ }
+ if (r.m_finish)
+ {
+ xloc = expand_location (r.m_finish);
+ fprintf (file, " finish: %s:%d:%d", xloc.file, xloc.line, xloc.column);
+ }
+ else
+ {
+ fprintf (file, " finish: unknown");
+ }
}
fprintf (file, ">");
}
+/* Print the identifier for DECL according to FLAGS. */
+
+void
+print_decl_identifier (FILE *file, tree decl, int flags)
+{
+ bool needs_colon = false;
+ const char *name;
+ char c;
+
+ if (flags & PRINT_DECL_ORIGIN)
+ {
+ if (DECL_IS_BUILTIN (decl))
+ fputs ("<built-in>", file);
+ else
+ {
+ expanded_location loc
+ = expand_location (DECL_SOURCE_LOCATION (decl));
+ fprintf (file, "%s:%d:%d", loc.file, loc.line, loc.column);
+ }
+ needs_colon = true;
+ }
+
+ if (flags & PRINT_DECL_UNIQUE_NAME)
+ {
+ name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
+ if (!TREE_PUBLIC (decl)
+ || (DECL_WEAK (decl) && !DECL_EXTERNAL (decl)))
+ /* The symbol has internal or weak linkage so its assembler name
+ is not necessarily unique among the compilation units of the
+ program. We therefore have to further mangle it. But we can't
+ simply use DECL_SOURCE_FILE because it contains the name of the
+ file the symbol originates from so, e.g. for function templates
+ in C++ where the templates are defined in a header file, we can
+ have symbols with the same assembler name and DECL_SOURCE_FILE.
+ That's why we use the name of the top-level source file of the
+ compilation unit. ??? Unnecessary for Ada. */
+ name = ACONCAT ((main_input_filename, ":", name, NULL));
+ }
+ else if (flags & PRINT_DECL_NAME)
+ {
+ /* We don't want to print the full qualified name because it can be long,
+ so we strip the scope prefix, but we may need to deal with the suffix
+ created by the compiler. */
+ const char *suffix = strchr (IDENTIFIER_POINTER (DECL_NAME (decl)), '.');
+ name = lang_hooks.decl_printable_name (decl, 2);
+ if (suffix)
+ {
+ const char *dot = strchr (name, '.');
+ while (dot && strcasecmp (dot, suffix) != 0)
+ {
+ name = dot + 1;
+ dot = strchr (name, '.');
+ }
+ }
+ else
+ {
+ const char *dot = strrchr (name, '.');
+ if (dot)
+ name = dot + 1;
+ }
+ }
+ else
+ return;
+
+ if (needs_colon)
+ fputc (':', file);
+
+ while ((c = *name++) != '\0')
+ {
+ /* Strip double-quotes because of VCG. */
+ if (c == '"')
+ continue;
+ fputc (c, file);
+ }
+}
+
/* Print the node NODE on standard error, for debugging.
Most nodes referred to by this one are printed recursively
DEBUG_FUNCTION void
debug_tree (tree node)
{
- table = XCNEWVEC (struct bucket *, HASH_SIZE);
+ table = new hash_set<tree> (HASH_SIZE);
print_node (stderr, "", node, 0);
- free (table);
- table = 0;
+ delete table;
+ table = NULL;
putc ('\n', stderr);
}
}
static void
-dump_tree_via_hooks (const tree_node *ptr, int options)
+dump_tree_via_hooks (const tree_node *ptr, dump_flags_t options)
{
if (DECL_P (ptr))
lang_hooks.print_decl (stderr, const_cast <tree_node*> (ptr), 0);
DEBUG_FUNCTION void
debug (const tree_node &ref)
{
- dump_tree_via_hooks (&ref, 0);
+ dump_tree_via_hooks (&ref, TDF_NONE);
}
DEBUG_FUNCTION void
fprintf (stderr, "<nil>\n");
}
-DEBUG_FUNCTION void
-debug_verbose (const tree_node &ref)
-{
- dump_tree_via_hooks (&ref, TDF_VERBOSE);
-}
-
-DEBUG_FUNCTION void
-debug_verbose (const tree_node *ptr)
-{
- if (ptr)
- debug_verbose (*ptr);
- else
- fprintf (stderr, "<nil>\n");
-}
-
DEBUG_FUNCTION void
debug_head (const tree_node &ref)
{
debug_body (const tree_node &ref)
{
if (TREE_CODE (&ref) == FUNCTION_DECL)
- dump_function_to_file (const_cast <tree_node*> (&ref), stderr, 0);
+ dump_function_to_file (const_cast <tree_node*> (&ref), stderr, TDF_NONE);
else
debug (ref);
}
FOR_EACH_VEC_ELT (ref, ix, elt)
{
- fprintf (stderr, "elt %d ", ix);
+ fprintf (stderr, "elt:%d ", ix);
debug_raw (elt);
}
}
-DEBUG_FUNCTION void
-debug (vec<tree, va_gc> &ref)
-{
- tree elt;
- unsigned ix;
-
- /* Print the slot this node is in, and its code, and address. */
- fprintf (stderr, "<VEC");
- dump_addr (stderr, " ", ref.address ());
-
- FOR_EACH_VEC_ELT (ref, ix, elt)
- {
- fprintf (stderr, "elt %d ", ix);
- debug (elt);
- }
-}
-
-DEBUG_FUNCTION void
-debug (vec<tree, va_gc> *ptr)
-{
- if (ptr)
- debug (*ptr);
- else
- fprintf (stderr, "<nil>\n");
-}
-
DEBUG_FUNCTION void
debug_raw (vec<tree, va_gc> *ptr)
{
fprintf (stderr, "<nil>\n");
}
-DEBUG_FUNCTION void
-debug_vec_tree (vec<tree, va_gc> *vec)
+static void
+debug_slim (tree t)
{
- debug_raw (vec);
+ print_node_brief (stderr, "", t, 0);
}
+
+DEFINE_DEBUG_VEC (tree)
+DEFINE_DEBUG_HASH_SET (tree)