diff options
Diffstat (limited to 'gcc-4.2.1-5666.3/gcc/print-tree.c')
| -rw-r--r-- | gcc-4.2.1-5666.3/gcc/print-tree.c | 887 |
1 files changed, 887 insertions, 0 deletions
diff --git a/gcc-4.2.1-5666.3/gcc/print-tree.c b/gcc-4.2.1-5666.3/gcc/print-tree.c new file mode 100644 index 000000000..34af1999b --- /dev/null +++ b/gcc-4.2.1-5666.3/gcc/print-tree.c @@ -0,0 +1,887 @@ +/* Prints out tree in human readable form - GCC + Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, + 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC 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. + +GCC 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 GCC; see the file COPYING. If not, write to the Free +Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA +02110-1301, USA. */ + + +#include "config.h" +#include "system.h" +#include "coretypes.h" +#include "tm.h" +#include "tree.h" +#include "real.h" +#include "ggc.h" +#include "langhooks.h" +#include "tree-iterator.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; + +/* Print the node NODE on standard error, for debugging. + Most nodes referred to by this one are printed recursively + down to a depth of six. */ + +void +debug_tree (tree node) +{ + table = XCNEWVEC (struct bucket *, HASH_SIZE); + print_node (stderr, "", node, 0); + free (table); + table = 0; + putc ('\n', stderr); +} + +/* Print PREFIX and ADDR to FILE. */ +void +dump_addr (FILE *file, const char *prefix, void *addr) +{ + if (flag_dump_noaddr || flag_dump_unnumbered) + fprintf (file, "%s#", prefix); + else + fprintf (file, "%s%p", prefix, addr); +} + +/* Print a node in brief fashion, with just the code, address and name. */ + +void +print_node_brief (FILE *file, const char *prefix, tree node, int indent) +{ + enum tree_code_class class; + + if (node == 0) + return; + + class = TREE_CODE_CLASS (TREE_CODE (node)); + + /* Always print the slot this node is in, and its code, address and + name if any. */ + if (indent > 0) + fprintf (file, " "); + fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]); + dump_addr (file, " ", node); + + if (class == tcc_declaration) + { + if (DECL_NAME (node)) + fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); + else if (TREE_CODE (node) == LABEL_DECL + && LABEL_DECL_UID (node) != -1) + fprintf (file, " L." HOST_WIDE_INT_PRINT_DEC, LABEL_DECL_UID (node)); + else + fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D', + DECL_UID (node)); + } + else if (class == tcc_type) + { + if (TYPE_NAME (node)) + { + if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE) + fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node))); + else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL + && DECL_NAME (TYPE_NAME (node))) + fprintf (file, " %s", + IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node)))); + } + } + if (TREE_CODE (node) == IDENTIFIER_NODE) + fprintf (file, " %s", IDENTIFIER_POINTER (node)); + + /* We might as well always print the value of an integer or real. */ + 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, 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, "-" HOST_WIDE_INT_PRINT_UNSIGNED, + -TREE_INT_CST_LOW (node)); + else + fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX, + TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (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); + } + } + + fprintf (file, ">"); +} + +void +indent_to (FILE *file, int column) +{ + int i; + + /* Since this is the long way, indent to desired column. */ + if (column > 0) + fprintf (file, "\n"); + for (i = 0; i < column; i++) + fprintf (file, " "); +} + +/* Print the node NODE in full on file FILE, preceded by PREFIX, + starting in column INDENT. */ + +void +print_node (FILE *file, const char *prefix, tree node, int indent) +{ + int hash; + struct bucket *b; + enum machine_mode mode; + enum tree_code_class class; + int len; + int i; + expanded_location xloc; + enum tree_code code; + + if (node == 0) + return; + + code = TREE_CODE (node); + class = TREE_CODE_CLASS (code); + + /* Don't get too deep in nesting. If the user wants to see deeper, + it is easy to use the address of a lowest-level node + as an argument in another call to debug_tree. */ + + if (indent > 24) + { + print_node_brief (file, prefix, node, indent); + return; + } + + if (indent > 8 && (class == tcc_type || class == tcc_declaration)) + { + print_node_brief (file, prefix, node, indent); + return; + } + + /* It is unsafe to look at any other fields of an ERROR_MARK node. */ + if (TREE_CODE (node) == ERROR_MARK) + { + print_node_brief (file, prefix, node, indent); + return; + } + + hash = ((unsigned long) 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; + } + + /* Add this node to the table. */ + b = XNEW (struct bucket); + b->node = node; + b->next = table[hash]; + table[hash] = b; + + /* Indent to the specified column, since this is the long form. */ + indent_to (file, indent); + + /* Print the slot this node is in, and its code, and address. */ + fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]); + dump_addr (file, " ", node); + + /* Print the name, if any. */ + if (class == tcc_declaration) + { + if (DECL_NAME (node)) + fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); + else if (TREE_CODE (node) == LABEL_DECL + && LABEL_DECL_UID (node) != -1) + fprintf (file, " L." HOST_WIDE_INT_PRINT_DEC, LABEL_DECL_UID (node)); + else + fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D', + DECL_UID (node)); + } + else if (class == tcc_type) + { + if (TYPE_NAME (node)) + { + if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE) + fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node))); + else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL + && DECL_NAME (TYPE_NAME (node))) + fprintf (file, " %s", + IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node)))); + } + } + if (TREE_CODE (node) == IDENTIFIER_NODE) + fprintf (file, " %s", IDENTIFIER_POINTER (node)); + + if (TREE_CODE (node) == INTEGER_CST) + { + if (indent <= 4) + print_node_brief (file, "type", TREE_TYPE (node), indent + 4); + } + else + { + print_node (file, "type", TREE_TYPE (node), indent + 4); + if (TREE_TYPE (node)) + indent_to (file, indent + 3); + } + + if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node)) + fputs (" side-effects", file); + + if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node)) + fputs (" readonly", file); + if (!TYPE_P (node) && TREE_CONSTANT (node)) + fputs (" constant", file); + else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node)) + fputs (" sizes-gimplified", file); + + if (TREE_INVARIANT (node)) + fputs (" invariant", file); + if (TREE_ADDRESSABLE (node)) + fputs (" addressable", file); + if (TREE_THIS_VOLATILE (node)) + fputs (" volatile", file); + if (TREE_ASM_WRITTEN (node)) + fputs (" asm_written", file); + if (TREE_USED (node)) + fputs (" used", file); + if (TREE_NOTHROW (node)) + fputs (TYPE_P (node) ? " align-ok" : " nothrow", file); + if (TREE_PUBLIC (node)) + fputs (" public", file); + if (TREE_PRIVATE (node)) + fputs (" private", file); + if (TREE_PROTECTED (node)) + fputs (" protected", file); + if (TREE_STATIC (node)) + fputs (" static", file); + if (TREE_DEPRECATED (node)) + fputs (" deprecated", file); + /* APPLE LOCAL begin "unavailable" attribute (Radar 2809697) */ + if (TREE_UNAVAILABLE (node)) + fputs (" unavailable", file); + /* APPLE LOCAL end "unavailable" attribute (Radar 2809697) */ + if (TREE_VISITED (node)) + fputs (" visited", file); + if (TREE_LANG_FLAG_0 (node)) + fputs (" tree_0", file); + if (TREE_LANG_FLAG_1 (node)) + fputs (" tree_1", file); + if (TREE_LANG_FLAG_2 (node)) + fputs (" tree_2", file); + if (TREE_LANG_FLAG_3 (node)) + fputs (" tree_3", file); + if (TREE_LANG_FLAG_4 (node)) + fputs (" tree_4", file); + if (TREE_LANG_FLAG_5 (node)) + fputs (" tree_5", file); + if (TREE_LANG_FLAG_6 (node)) + fputs (" tree_6", file); + + /* DECL_ nodes have additional attributes. */ + + switch (TREE_CODE_CLASS (TREE_CODE (node))) + { + case tcc_declaration: + if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) + { + if (DECL_UNSIGNED (node)) + fputs (" unsigned", file); + if (DECL_IGNORED_P (node)) + fputs (" ignored", file); + if (DECL_ABSTRACT (node)) + fputs (" abstract", file); + if (DECL_EXTERNAL (node)) + fputs (" external", file); + if (DECL_NONLOCAL (node)) + fputs (" nonlocal", file); + } + if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS)) + { + if (DECL_WEAK (node)) + fputs (" weak", file); + if (DECL_IN_SYSTEM_HEADER (node)) + fputs (" in_system_header", file); + } + if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL) + && TREE_CODE (node) != LABEL_DECL + && TREE_CODE (node) != FUNCTION_DECL + && DECL_REGISTER (node)) + fputs (" regdecl", file); + /* APPLE LOCAL begin CW asm blocks */ + if (DECL_IASM_ASM_FUNCTION (node)) + fputs (" asm-function", file); + if (DECL_IASM_NORETURN (node)) + fputs (" asm-noreturn", file); + if (DECL_IASM_FRAME_SIZE (node) != (unsigned int)-2) + fprintf (file, " asm-frame-size %d", DECL_IASM_FRAME_SIZE (node)); + /* APPLE LOCAL end CW asm blocks */ + if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node)) + fputs (" suppress-debug", file); + + if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node)) + fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file); + if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node)) + fputs (" built-in", file); + if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node)) + fputs (" no-static-chain", file); + + if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node)) + fputs (" packed", file); + if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node)) + fputs (" bit-field", file); + if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node)) + fputs (" nonaddressable", file); + + if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node)) + fputs (" error-issued", file); + + if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node)) + fputs (" in-text-section", file); + if (TREE_CODE (node) == VAR_DECL && DECL_COMMON (node)) + fputs (" common", file); + if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL_P (node)) + { + enum tls_model kind = DECL_TLS_MODEL (node); + switch (kind) + { + case TLS_MODEL_GLOBAL_DYNAMIC: + fputs (" tls-global-dynamic", file); + break; + case TLS_MODEL_LOCAL_DYNAMIC: + fputs (" tls-local-dynamic", file); + break; + case TLS_MODEL_INITIAL_EXEC: + fputs (" tls-initial-exec", file); + break; + case TLS_MODEL_LOCAL_EXEC: + fputs (" tls-local-exec", file); + break; + default: + gcc_unreachable (); + } + } + + if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) + { + if (DECL_VIRTUAL_P (node)) + fputs (" virtual", file); + if (DECL_PRESERVE_P (node)) + fputs (" preserve", file); + if (DECL_LANG_FLAG_0 (node)) + fputs (" decl_0", file); + if (DECL_LANG_FLAG_1 (node)) + fputs (" decl_1", file); + if (DECL_LANG_FLAG_2 (node)) + fputs (" decl_2", file); + if (DECL_LANG_FLAG_3 (node)) + fputs (" decl_3", file); + if (DECL_LANG_FLAG_4 (node)) + fputs (" decl_4", file); + if (DECL_LANG_FLAG_5 (node)) + fputs (" decl_5", file); + if (DECL_LANG_FLAG_6 (node)) + fputs (" decl_6", file); + if (DECL_LANG_FLAG_7 (node)) + fputs (" decl_7", file); + + mode = DECL_MODE (node); + fprintf (file, " %s", GET_MODE_NAME (mode)); + } + + if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS) && DECL_DEFER_OUTPUT (node)) + fputs (" defer-output", file); + + + xloc = expand_location (DECL_SOURCE_LOCATION (node)); + fprintf (file, " file %s line %d", xloc.file, xloc.line); + + 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); + + if (TREE_CODE (node) != FUNCTION_DECL + || DECL_INLINE (node) || DECL_BUILT_IN (node)) + indent_to (file, indent + 3); + + /* APPLE LOCAL begin mainline aligned functions 5933878 */ + if (DECL_USER_ALIGN (node)) + fprintf (file, " user"); + + fprintf (file, " align %d", DECL_ALIGN (node)); + if (TREE_CODE (node) == FIELD_DECL) + fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED, + DECL_OFFSET_ALIGN (node)); + + if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node)) + /* APPLE LOCAL end mainline aligned functions 5933878 */ + { + if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD) + fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node)); + else + 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 (DECL_POINTER_ALIAS_SET_KNOWN_P (node)) + fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC, + DECL_POINTER_ALIAS_SET (node)); + } + if (TREE_CODE (node) == FIELD_DECL) + { + print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4); + 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), + indent + 4); + } + + print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4); + + if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) + { + print_node_brief (file, "attributes", + DECL_ATTRIBUTES (node), indent + 4); + print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4); + } + if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL)) + { + print_node_brief (file, "abstract_origin", + DECL_ABSTRACT_ORIGIN (node), indent + 4); + } + 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); + } + + lang_hooks.print_decl (file, node, indent); + + if (DECL_RTL_SET_P (node)) + { + indent_to (file, indent + 4); + print_rtl (file, DECL_RTL (node)); + } + + if (TREE_CODE (node) == PARM_DECL) + { + print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4); + + if (DECL_INCOMING_RTL (node) != 0) + { + indent_to (file, indent + 4); + fprintf (file, "incoming-rtl "); + print_rtl (file, DECL_INCOMING_RTL (node)); + } + } + else if (TREE_CODE (node) == FUNCTION_DECL + && DECL_STRUCT_FUNCTION (node) != 0) + { + indent_to (file, indent + 4); + dump_addr (file, "saved-insns ", DECL_STRUCT_FUNCTION (node)); + } + + if ((TREE_CODE (node) == VAR_DECL || TREE_CODE (node) == PARM_DECL) + && DECL_HAS_VALUE_EXPR_P (node)) + print_node (file, "value-expr", DECL_VALUE_EXPR (node), indent + 4); + + if (TREE_CODE (node) == STRUCT_FIELD_TAG) + { + fprintf (file, " sft size " HOST_WIDE_INT_PRINT_DEC, + SFT_SIZE (node)); + fprintf (file, " sft offset " HOST_WIDE_INT_PRINT_DEC, + SFT_OFFSET (node)); + print_node_brief (file, "parent var", SFT_PARENT_VAR (node), + indent + 4); + } + /* Print the decl chain only if decl is 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 tcc_type: + if (TYPE_UNSIGNED (node)) + fputs (" unsigned", file); + + /* The no-force-blk flag is used for different things in + different types. */ + if ((TREE_CODE (node) == RECORD_TYPE + || TREE_CODE (node) == UNION_TYPE + || TREE_CODE (node) == QUAL_UNION_TYPE) + && TYPE_NO_FORCE_BLK (node)) + fputs (" no-force-blk", file); + else if (TREE_CODE (node) == INTEGER_TYPE + && TYPE_IS_SIZETYPE (node)) + fputs (" sizetype", file); + else if (TREE_CODE (node) == FUNCTION_TYPE + && TYPE_RETURNS_STACK_DEPRESSED (node)) + fputs (" returns-stack-depressed", file); + + if (TYPE_STRING_FLAG (node)) + fputs (" string-flag", file); + if (TYPE_NEEDS_CONSTRUCTING (node)) + fputs (" needs-constructing", file); + + /* The transparent-union flag is used for different things in + different nodes. */ + if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node)) + fputs (" transparent-union", file); + else if (TREE_CODE (node) == ARRAY_TYPE + && TYPE_NONALIASED_COMPONENT (node)) + fputs (" nonaliased-component", file); + + if (TYPE_PACKED (node)) + fputs (" packed", file); + + if (TYPE_RESTRICT (node)) + fputs (" restrict", file); + + if (TYPE_LANG_FLAG_0 (node)) + fputs (" type_0", file); + if (TYPE_LANG_FLAG_1 (node)) + fputs (" type_1", file); + if (TYPE_LANG_FLAG_2 (node)) + fputs (" type_2", file); + if (TYPE_LANG_FLAG_3 (node)) + fputs (" type_3", file); + if (TYPE_LANG_FLAG_4 (node)) + fputs (" type_4", file); + if (TYPE_LANG_FLAG_5 (node)) + fputs (" type_5", file); + if (TYPE_LANG_FLAG_6 (node)) + fputs (" type_6", 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); + 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), + TYPE_ALIAS_SET (node)); + + print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4); + + if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE) + { + 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); + } + + if (TREE_CODE (node) == ENUMERAL_TYPE) + print_node (file, "values", TYPE_VALUES (node), indent + 4); + else if (TREE_CODE (node) == ARRAY_TYPE) + print_node (file, "domain", TYPE_DOMAIN (node), indent + 4); + else if (TREE_CODE (node) == VECTOR_TYPE) + fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node)); + 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) + { + if (TYPE_METHOD_BASETYPE (node)) + print_node_brief (file, "method basetype", + TYPE_METHOD_BASETYPE (node), indent + 4); + print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4); + } + else if (TREE_CODE (node) == OFFSET_TYPE) + print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node), + indent + 4); + + if (TYPE_CONTEXT (node)) + print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4); + + lang_hooks.print_type (file, node, indent); + + if (TYPE_POINTER_TO (node) || TREE_CHAIN (node)) + indent_to (file, indent + 3); + + print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node), + indent + 4); + print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node), + indent + 4); + print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4); + break; + + case tcc_expression: + case tcc_comparison: + case tcc_unary: + case tcc_binary: + case tcc_reference: + case tcc_statement: + if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node)) + fputs (" unsigned", file); + if (TREE_CODE (node) == BIND_EXPR) + { + print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4); + print_node (file, "body", TREE_OPERAND (node, 1), indent + 4); + print_node (file, "block", TREE_OPERAND (node, 2), indent + 4); + break; + } + + len = TREE_CODE_LENGTH (TREE_CODE (node)); + + for (i = 0; i < len; i++) + { + char temp[10]; + + sprintf (temp, "arg %d", i); + print_node (file, temp, TREE_OPERAND (node, i), indent + 4); + } + + print_node (file, "chain", TREE_CHAIN (node), indent + 4); + break; + + case tcc_constant: + case tcc_exceptional: + 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, 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, "-" HOST_WIDE_INT_PRINT_UNSIGNED, + -TREE_INT_CST_LOW (node)); + else + fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX, + TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (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); + } + } + break; + + case VECTOR_CST: + { + tree vals = TREE_VECTOR_CST_ELTS (node); + char buf[10]; + tree link; + int i; + + i = 0; + for (link = vals; link; link = TREE_CHAIN (link), ++i) + { + sprintf (buf, "elt%d: ", i); + print_node (file, buf, TREE_VALUE (link), indent + 4); + } + } + break; + + case COMPLEX_CST: + print_node (file, "real", TREE_REALPART (node), indent + 4); + print_node (file, "imag", TREE_IMAGPART (node), indent + 4); + break; + + case STRING_CST: + { + const char *p = TREE_STRING_POINTER (node); + int i = TREE_STRING_LENGTH (node); + fputs (" \"", file); + while (--i >= 0) + { + char ch = *p++; + if (ch >= ' ' && ch < 127) + putc (ch, file); + else + fprintf(file, "\\%03o", ch & 0xFF); + } + fputc ('\"', file); + } + /* 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: + lang_hooks.print_identifier (file, node, indent); + break; + + case TREE_LIST: + print_node (file, "purpose", TREE_PURPOSE (node), indent + 4); + print_node (file, "value", TREE_VALUE (node), indent + 4); + print_node (file, "chain", TREE_CHAIN (node), indent + 4); + break; + + case TREE_VEC: + len = TREE_VEC_LENGTH (node); + for (i = 0; i < len; i++) + 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 STATEMENT_LIST: + dump_addr (file, " head ", node->stmt_list.head); + dump_addr (file, " tail ", node->stmt_list.tail); + fprintf (file, " stmts"); + { + tree_stmt_iterator i; + for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i)) + { + /* Not printing the addresses of the (not-a-tree) + 'struct tree_stmt_list_node's. */ + dump_addr (file, " ", tsi_stmt (i)); + } + fprintf (file, "\n"); + for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i)) + { + /* Not printing the addresses of the (not-a-tree) + 'struct tree_stmt_list_node's. */ + print_node (file, "stmt", tsi_stmt (i), indent + 4); + } + } + print_node (file, "chain", TREE_CHAIN (node), indent + 4); + break; + + case BLOCK: + print_node (file, "vars", BLOCK_VARS (node), indent + 4); + print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), + indent + 4); + print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4); + print_node (file, "chain", BLOCK_CHAIN (node), indent + 4); + print_node (file, "abstract_origin", + BLOCK_ABSTRACT_ORIGIN (node), indent + 4); + break; + + case SSA_NAME: + print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4); + print_node_brief (file, "def_stmt", + SSA_NAME_DEF_STMT (node), indent + 4); + + indent_to (file, indent + 4); + 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)) + fprintf (file, " in-free-list"); + + if (SSA_NAME_PTR_INFO (node) + || SSA_NAME_VALUE (node)) + { + indent_to (file, indent + 3); + if (SSA_NAME_PTR_INFO (node)) + dump_addr (file, " ptr-info ", SSA_NAME_PTR_INFO (node)); + if (SSA_NAME_VALUE (node)) + dump_addr (file, " value ", SSA_NAME_VALUE (node)); + } + break; + + case OMP_CLAUSE: + { + int i; + fprintf (file, " %s", + omp_clause_code_name[OMP_CLAUSE_CODE (node)]); + for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (node)]; i++) + { + indent_to (file, indent + 4); + fprintf (file, "op %d:", i); + print_node_brief (file, "", OMP_CLAUSE_OPERAND (node, i), 0); + } + } + break; + + default: + if (EXCEPTIONAL_CLASS_P (node)) + lang_hooks.print_xnode (file, node, indent); + break; + } + + break; + } + + if (EXPR_HAS_LOCATION (node)) + { + expanded_location xloc = expand_location (EXPR_LOCATION (node)); + indent_to (file, indent+4); + fprintf (file, "%s:%d", xloc.file, xloc.line); + } + + fprintf (file, ">"); +} |