1 /* Prints out tree in human readable form - GCC
2 Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "fixed-value.h"
30 #include "langhooks.h"
31 #include "tree-iterator.h"
32 #include "diagnostic.h"
33 #include "tree-flow.h"
35 /* Define the hash table of nodes already seen.
36 Such nodes are not repeated; brief cross-references are used. */
46 static struct bucket **table;
48 /* Print the node NODE on standard error, for debugging.
49 Most nodes referred to by this one are printed recursively
50 down to a depth of six. */
53 debug_tree (tree node)
55 table = XCNEWVEC (struct bucket *, HASH_SIZE);
56 print_node (stderr, "", node, 0);
62 /* Print PREFIX and ADDR to FILE. */
64 dump_addr (FILE *file, const char *prefix, const void *addr)
66 if (flag_dump_noaddr || flag_dump_unnumbered)
67 fprintf (file, "%s#", prefix);
69 fprintf (file, "%s%p", prefix, addr);
72 /* Print a node in brief fashion, with just the code, address and name. */
75 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent)
77 enum tree_code_class tclass;
82 tclass = TREE_CODE_CLASS (TREE_CODE (node));
84 /* Always print the slot this node is in, and its code, address and
88 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]);
89 dump_addr (file, " ", node);
91 if (tclass == tcc_declaration)
94 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
95 else if (TREE_CODE (node) == LABEL_DECL
96 && LABEL_DECL_UID (node) != -1)
97 fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
99 fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
102 else if (tclass == tcc_type)
104 if (TYPE_NAME (node))
106 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
107 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
108 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
109 && DECL_NAME (TYPE_NAME (node)))
110 fprintf (file, " %s",
111 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
114 if (TREE_CODE (node) == IDENTIFIER_NODE)
115 fprintf (file, " %s", IDENTIFIER_POINTER (node));
117 /* We might as well always print the value of an integer or real. */
118 if (TREE_CODE (node) == INTEGER_CST)
120 if (TREE_OVERFLOW (node))
121 fprintf (file, " overflow");
124 if (TREE_INT_CST_HIGH (node) == 0)
125 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
126 else if (TREE_INT_CST_HIGH (node) == -1
127 && TREE_INT_CST_LOW (node) != 0)
128 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
129 -TREE_INT_CST_LOW (node));
131 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
132 (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (node),
133 (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (node));
135 if (TREE_CODE (node) == REAL_CST)
139 if (TREE_OVERFLOW (node))
140 fprintf (file, " overflow");
142 d = TREE_REAL_CST (node);
143 if (REAL_VALUE_ISINF (d))
144 fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
145 else if (REAL_VALUE_ISNAN (d))
146 fprintf (file, " Nan");
150 real_to_decimal (string, &d, sizeof (string), 0, 1);
151 fprintf (file, " %s", string);
154 if (TREE_CODE (node) == FIXED_CST)
159 if (TREE_OVERFLOW (node))
160 fprintf (file, " overflow");
162 f = TREE_FIXED_CST (node);
163 fixed_to_decimal (string, &f, sizeof (string));
164 fprintf (file, " %s", string);
171 indent_to (FILE *file, int column)
175 /* Since this is the long way, indent to desired column. */
177 fprintf (file, "\n");
178 for (i = 0; i < column; i++)
182 /* Print the node NODE in full on file FILE, preceded by PREFIX,
183 starting in column INDENT. */
186 print_node (FILE *file, const char *prefix, tree node, int indent)
190 enum machine_mode mode;
191 enum tree_code_class tclass;
194 expanded_location xloc;
200 code = TREE_CODE (node);
201 tclass = TREE_CODE_CLASS (code);
203 /* Don't get too deep in nesting. If the user wants to see deeper,
204 it is easy to use the address of a lowest-level node
205 as an argument in another call to debug_tree. */
209 print_node_brief (file, prefix, node, indent);
213 if (indent > 8 && (tclass == tcc_type || tclass == tcc_declaration))
215 print_node_brief (file, prefix, node, indent);
219 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
220 if (code == ERROR_MARK)
222 print_node_brief (file, prefix, node, indent);
226 /* Allow this function to be called if the table is not there. */
229 hash = ((unsigned long) node) % HASH_SIZE;
231 /* If node is in the table, just mention its address. */
232 for (b = table[hash]; b; b = b->next)
235 print_node_brief (file, prefix, node, indent);
239 /* Add this node to the table. */
240 b = XNEW (struct bucket);
242 b->next = table[hash];
246 /* Indent to the specified column, since this is the long form. */
247 indent_to (file, indent);
249 /* Print the slot this node is in, and its code, and address. */
250 fprintf (file, "%s <%s", prefix, tree_code_name[(int) code]);
251 dump_addr (file, " ", node);
253 /* Print the name, if any. */
254 if (tclass == tcc_declaration)
256 if (DECL_NAME (node))
257 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
258 else if (code == LABEL_DECL
259 && LABEL_DECL_UID (node) != -1)
260 fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
262 fprintf (file, " %c.%u", code == CONST_DECL ? 'C' : 'D',
265 else if (tclass == tcc_type)
267 if (TYPE_NAME (node))
269 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
270 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
271 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
272 && DECL_NAME (TYPE_NAME (node)))
273 fprintf (file, " %s",
274 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
277 if (code == IDENTIFIER_NODE)
278 fprintf (file, " %s", IDENTIFIER_POINTER (node));
280 if (code == INTEGER_CST)
283 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
287 print_node (file, "type", TREE_TYPE (node), indent + 4);
288 if (TREE_TYPE (node))
289 indent_to (file, indent + 3);
292 if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node))
293 fputs (" side-effects", file);
295 if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node))
296 fputs (" readonly", file);
297 if (!TYPE_P (node) && TREE_CONSTANT (node))
298 fputs (" constant", file);
299 else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node))
300 fputs (" sizes-gimplified", file);
302 if (TREE_ADDRESSABLE (node))
303 fputs (" addressable", file);
304 if (TREE_THIS_VOLATILE (node))
305 fputs (" volatile", file);
306 if (TREE_ASM_WRITTEN (node))
307 fputs (" asm_written", file);
308 if (TREE_USED (node))
309 fputs (" used", file);
310 if (TREE_NOTHROW (node))
311 fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
312 if (TREE_PUBLIC (node))
313 fputs (" public", file);
314 if (TREE_PRIVATE (node))
315 fputs (" private", file);
316 if (TREE_PROTECTED (node))
317 fputs (" protected", file);
318 if (TREE_STATIC (node))
319 fputs (" static", file);
320 if (TREE_DEPRECATED (node))
321 fputs (" deprecated", file);
322 if (TREE_VISITED (node))
323 fputs (" visited", file);
324 if (TREE_LANG_FLAG_0 (node))
325 fputs (" tree_0", file);
326 if (TREE_LANG_FLAG_1 (node))
327 fputs (" tree_1", file);
328 if (TREE_LANG_FLAG_2 (node))
329 fputs (" tree_2", file);
330 if (TREE_LANG_FLAG_3 (node))
331 fputs (" tree_3", file);
332 if (TREE_LANG_FLAG_4 (node))
333 fputs (" tree_4", file);
334 if (TREE_LANG_FLAG_5 (node))
335 fputs (" tree_5", file);
336 if (TREE_LANG_FLAG_6 (node))
337 fputs (" tree_6", file);
339 /* DECL_ nodes have additional attributes. */
341 switch (TREE_CODE_CLASS (code))
343 case tcc_declaration:
344 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
346 if (DECL_UNSIGNED (node))
347 fputs (" unsigned", file);
348 if (DECL_IGNORED_P (node))
349 fputs (" ignored", file);
350 if (DECL_ABSTRACT (node))
351 fputs (" abstract", file);
352 if (DECL_EXTERNAL (node))
353 fputs (" external", file);
354 if (DECL_NONLOCAL (node))
355 fputs (" nonlocal", file);
357 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
359 if (DECL_WEAK (node))
360 fputs (" weak", file);
361 if (DECL_IN_SYSTEM_HEADER (node))
362 fputs (" in_system_header", file);
364 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL)
365 && code != LABEL_DECL
366 && code != FUNCTION_DECL
367 && DECL_REGISTER (node))
368 fputs (" regdecl", file);
370 if (code == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
371 fputs (" suppress-debug", file);
373 if (code == FUNCTION_DECL
374 && DECL_FUNCTION_SPECIFIC_TARGET (node))
375 fputs (" function-specific-target", file);
376 if (code == FUNCTION_DECL
377 && DECL_FUNCTION_SPECIFIC_OPTIMIZATION (node))
378 fputs (" function-specific-opt", file);
379 if (code == FUNCTION_DECL && DECL_DECLARED_INLINE_P (node))
380 fputs (" autoinline", file);
381 if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
382 fputs (" built-in", file);
383 if (code == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
384 fputs (" no-static-chain", file);
386 if (code == FIELD_DECL && DECL_PACKED (node))
387 fputs (" packed", file);
388 if (code == FIELD_DECL && DECL_BIT_FIELD (node))
389 fputs (" bit-field", file);
390 if (code == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
391 fputs (" nonaddressable", file);
393 if (code == LABEL_DECL && DECL_ERROR_ISSUED (node))
394 fputs (" error-issued", file);
396 if (code == VAR_DECL && DECL_IN_TEXT_SECTION (node))
397 fputs (" in-text-section", file);
398 if (code == VAR_DECL && DECL_COMMON (node))
399 fputs (" common", file);
400 if (code == VAR_DECL && DECL_THREAD_LOCAL_P (node))
402 enum tls_model kind = DECL_TLS_MODEL (node);
405 case TLS_MODEL_GLOBAL_DYNAMIC:
406 fputs (" tls-global-dynamic", file);
408 case TLS_MODEL_LOCAL_DYNAMIC:
409 fputs (" tls-local-dynamic", file);
411 case TLS_MODEL_INITIAL_EXEC:
412 fputs (" tls-initial-exec", file);
414 case TLS_MODEL_LOCAL_EXEC:
415 fputs (" tls-local-exec", file);
422 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
424 if (DECL_VIRTUAL_P (node))
425 fputs (" virtual", file);
426 if (DECL_PRESERVE_P (node))
427 fputs (" preserve", file);
428 if (DECL_NO_TBAA_P (node))
429 fputs (" no-tbaa", file);
430 if (DECL_LANG_FLAG_0 (node))
431 fputs (" decl_0", file);
432 if (DECL_LANG_FLAG_1 (node))
433 fputs (" decl_1", file);
434 if (DECL_LANG_FLAG_2 (node))
435 fputs (" decl_2", file);
436 if (DECL_LANG_FLAG_3 (node))
437 fputs (" decl_3", file);
438 if (DECL_LANG_FLAG_4 (node))
439 fputs (" decl_4", file);
440 if (DECL_LANG_FLAG_5 (node))
441 fputs (" decl_5", file);
442 if (DECL_LANG_FLAG_6 (node))
443 fputs (" decl_6", file);
444 if (DECL_LANG_FLAG_7 (node))
445 fputs (" decl_7", file);
447 mode = DECL_MODE (node);
448 fprintf (file, " %s", GET_MODE_NAME (mode));
451 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS) && DECL_DEFER_OUTPUT (node))
452 fputs (" defer-output", file);
455 xloc = expand_location (DECL_SOURCE_LOCATION (node));
456 fprintf (file, " file %s line %d col %d", xloc.file, xloc.line,
459 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
461 print_node (file, "size", DECL_SIZE (node), indent + 4);
462 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
464 if (code != FUNCTION_DECL || DECL_BUILT_IN (node))
465 indent_to (file, indent + 3);
467 if (DECL_USER_ALIGN (node))
468 fprintf (file, " user");
470 fprintf (file, " align %d", DECL_ALIGN (node));
471 if (code == FIELD_DECL)
472 fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
473 DECL_OFFSET_ALIGN (node));
475 if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
477 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
478 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
480 fprintf (file, " built-in %s:%s",
481 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
482 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
485 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
486 fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
487 (HOST_WIDE_INT) DECL_POINTER_ALIAS_SET (node));
489 if (code == FIELD_DECL)
491 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
492 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
494 if (DECL_BIT_FIELD_TYPE (node))
495 print_node (file, "bit_field_type", DECL_BIT_FIELD_TYPE (node),
499 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
501 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
503 print_node_brief (file, "attributes",
504 DECL_ATTRIBUTES (node), indent + 4);
505 if (code != PARM_DECL)
506 print_node_brief (file, "initial", DECL_INITIAL (node),
509 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
511 print_node_brief (file, "abstract_origin",
512 DECL_ABSTRACT_ORIGIN (node), indent + 4);
514 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
516 print_node (file, "arguments", DECL_ARGUMENT_FLD (node), indent + 4);
517 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
520 lang_hooks.print_decl (file, node, indent);
522 if (DECL_RTL_SET_P (node))
524 indent_to (file, indent + 4);
525 print_rtl (file, DECL_RTL (node));
528 if (code == PARM_DECL)
530 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
532 if (DECL_INCOMING_RTL (node) != 0)
534 indent_to (file, indent + 4);
535 fprintf (file, "incoming-rtl ");
536 print_rtl (file, DECL_INCOMING_RTL (node));
539 else if (code == FUNCTION_DECL
540 && DECL_STRUCT_FUNCTION (node) != 0)
542 indent_to (file, indent + 4);
543 dump_addr (file, "saved-insns ", DECL_STRUCT_FUNCTION (node));
546 if ((code == VAR_DECL || code == PARM_DECL)
547 && DECL_HAS_VALUE_EXPR_P (node))
548 print_node (file, "value-expr", DECL_VALUE_EXPR (node), indent + 4);
550 /* Print the decl chain only if decl is at second level. */
552 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
554 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
558 if (TYPE_UNSIGNED (node))
559 fputs (" unsigned", file);
561 /* The no-force-blk flag is used for different things in
563 if ((code == RECORD_TYPE
564 || code == UNION_TYPE
565 || code == QUAL_UNION_TYPE)
566 && TYPE_NO_FORCE_BLK (node))
567 fputs (" no-force-blk", file);
568 else if (code == INTEGER_TYPE
569 && TYPE_IS_SIZETYPE (node))
570 fputs (" sizetype", file);
572 if (TYPE_STRING_FLAG (node))
573 fputs (" string-flag", file);
574 if (TYPE_NEEDS_CONSTRUCTING (node))
575 fputs (" needs-constructing", file);
577 /* The transparent-union flag is used for different things in
579 if (code == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
580 fputs (" transparent-union", file);
581 else if (code == ARRAY_TYPE
582 && TYPE_NONALIASED_COMPONENT (node))
583 fputs (" nonaliased-component", file);
585 if (TYPE_PACKED (node))
586 fputs (" packed", file);
588 if (TYPE_RESTRICT (node))
589 fputs (" restrict", file);
591 if (TYPE_LANG_FLAG_0 (node))
592 fputs (" type_0", file);
593 if (TYPE_LANG_FLAG_1 (node))
594 fputs (" type_1", file);
595 if (TYPE_LANG_FLAG_2 (node))
596 fputs (" type_2", file);
597 if (TYPE_LANG_FLAG_3 (node))
598 fputs (" type_3", file);
599 if (TYPE_LANG_FLAG_4 (node))
600 fputs (" type_4", file);
601 if (TYPE_LANG_FLAG_5 (node))
602 fputs (" type_5", file);
603 if (TYPE_LANG_FLAG_6 (node))
604 fputs (" type_6", file);
606 mode = TYPE_MODE (node);
607 fprintf (file, " %s", GET_MODE_NAME (mode));
609 print_node (file, "size", TYPE_SIZE (node), indent + 4);
610 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
611 indent_to (file, indent + 3);
613 if (TYPE_USER_ALIGN (node))
614 fprintf (file, " user");
616 fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
617 TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
618 (HOST_WIDE_INT) TYPE_ALIAS_SET (node));
620 if (TYPE_STRUCTURAL_EQUALITY_P (node))
621 fprintf (file, " structural equality");
623 dump_addr (file, " canonical type ", TYPE_CANONICAL (node));
625 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
627 if (INTEGRAL_TYPE_P (node) || code == REAL_TYPE
628 || code == FIXED_POINT_TYPE)
630 fprintf (file, " precision %d", TYPE_PRECISION (node));
631 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
632 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
635 if (code == ENUMERAL_TYPE)
636 print_node (file, "values", TYPE_VALUES (node), indent + 4);
637 else if (code == ARRAY_TYPE)
638 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
639 else if (code == VECTOR_TYPE)
640 fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node));
641 else if (code == RECORD_TYPE
642 || code == UNION_TYPE
643 || code == QUAL_UNION_TYPE)
644 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
645 else if (code == FUNCTION_TYPE
646 || code == METHOD_TYPE)
648 if (TYPE_METHOD_BASETYPE (node))
649 print_node_brief (file, "method basetype",
650 TYPE_METHOD_BASETYPE (node), indent + 4);
651 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
653 else if (code == OFFSET_TYPE)
654 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
657 if (TYPE_CONTEXT (node))
658 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
660 lang_hooks.print_type (file, node, indent);
662 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
663 indent_to (file, indent + 3);
665 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
667 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
669 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
679 if (code == BIND_EXPR)
681 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
682 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
683 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
686 if (code == CALL_EXPR)
688 call_expr_arg_iterator iter;
690 print_node (file, "fn", CALL_EXPR_FN (node), indent + 4);
691 print_node (file, "static_chain", CALL_EXPR_STATIC_CHAIN (node),
694 FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
697 sprintf (temp, "arg %d", i);
698 print_node (file, temp, arg, indent + 4);
704 len = TREE_OPERAND_LENGTH (node);
706 for (i = 0; i < len; i++)
710 sprintf (temp, "arg %d", i);
711 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
714 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
718 case tcc_exceptional:
722 if (TREE_OVERFLOW (node))
723 fprintf (file, " overflow");
726 if (TREE_INT_CST_HIGH (node) == 0)
727 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
728 TREE_INT_CST_LOW (node));
729 else if (TREE_INT_CST_HIGH (node) == -1
730 && TREE_INT_CST_LOW (node) != 0)
731 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
732 -TREE_INT_CST_LOW (node));
734 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
735 (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (node),
736 (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (node));
743 if (TREE_OVERFLOW (node))
744 fprintf (file, " overflow");
746 d = TREE_REAL_CST (node);
747 if (REAL_VALUE_ISINF (d))
748 fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
749 else if (REAL_VALUE_ISNAN (d))
750 fprintf (file, " Nan");
754 real_to_decimal (string, &d, sizeof (string), 0, 1);
755 fprintf (file, " %s", string);
765 if (TREE_OVERFLOW (node))
766 fprintf (file, " overflow");
768 f = TREE_FIXED_CST (node);
769 fixed_to_decimal (string, &f, sizeof (string));
770 fprintf (file, " %s", string);
776 tree vals = TREE_VECTOR_CST_ELTS (node);
782 for (link = vals; link; link = TREE_CHAIN (link), ++i)
784 sprintf (buf, "elt%d: ", i);
785 print_node (file, buf, TREE_VALUE (link), indent + 4);
791 print_node (file, "real", TREE_REALPART (node), indent + 4);
792 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
797 const char *p = TREE_STRING_POINTER (node);
798 int i = TREE_STRING_LENGTH (node);
803 if (ch >= ' ' && ch < 127)
806 fprintf(file, "\\%03o", ch & 0xFF);
810 /* Print the chain at second level. */
812 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
814 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
817 case IDENTIFIER_NODE:
818 lang_hooks.print_identifier (file, node, indent);
822 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
823 print_node (file, "value", TREE_VALUE (node), indent + 4);
824 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
828 len = TREE_VEC_LENGTH (node);
829 for (i = 0; i < len; i++)
830 if (TREE_VEC_ELT (node, i))
833 sprintf (temp, "elt %d", i);
834 indent_to (file, indent + 4);
835 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
841 unsigned HOST_WIDE_INT cnt;
843 len = VEC_length (constructor_elt, CONSTRUCTOR_ELTS (node));
844 fprintf (file, " lngt %d", len);
845 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node),
848 print_node (file, "idx", index, indent + 4);
849 print_node (file, "val", value, indent + 4);
855 dump_addr (file, " head ", node->stmt_list.head);
856 dump_addr (file, " tail ", node->stmt_list.tail);
857 fprintf (file, " stmts");
859 tree_stmt_iterator i;
860 for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i))
862 /* Not printing the addresses of the (not-a-tree)
863 'struct tree_stmt_list_node's. */
864 dump_addr (file, " ", tsi_stmt (i));
866 fprintf (file, "\n");
867 for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i))
869 /* Not printing the addresses of the (not-a-tree)
870 'struct tree_stmt_list_node's. */
871 print_node (file, "stmt", tsi_stmt (i), indent + 4);
874 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
878 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
879 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node),
881 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
882 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
883 print_node (file, "abstract_origin",
884 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
888 print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
889 fprintf (file, "def_stmt ");
890 print_gimple_stmt (file, SSA_NAME_DEF_STMT (node), indent + 4, 0);
892 indent_to (file, indent + 4);
893 fprintf (file, "version %u", SSA_NAME_VERSION (node));
894 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
895 fprintf (file, " in-abnormal-phi");
896 if (SSA_NAME_IN_FREE_LIST (node))
897 fprintf (file, " in-free-list");
899 if (SSA_NAME_PTR_INFO (node)
900 || SSA_NAME_VALUE (node))
902 indent_to (file, indent + 3);
903 if (SSA_NAME_PTR_INFO (node))
904 dump_addr (file, " ptr-info ", SSA_NAME_PTR_INFO (node));
905 if (SSA_NAME_VALUE (node))
906 dump_addr (file, " value ", SSA_NAME_VALUE (node));
913 fprintf (file, " %s",
914 omp_clause_code_name[OMP_CLAUSE_CODE (node)]);
915 for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (node)]; i++)
917 indent_to (file, indent + 4);
918 fprintf (file, "op %d:", i);
919 print_node_brief (file, "", OMP_CLAUSE_OPERAND (node, i), 0);
924 case OPTIMIZATION_NODE:
925 cl_optimization_print (file, indent + 4, TREE_OPTIMIZATION (node));
928 case TARGET_OPTION_NODE:
929 cl_target_option_print (file, indent + 4, TREE_TARGET_OPTION (node));
932 fprintf (file, " imported declaration");
933 print_node_brief (file, "associated declaration",
934 IMPORTED_DECL_ASSOCIATED_DECL (node),
939 if (EXCEPTIONAL_CLASS_P (node))
940 lang_hooks.print_xnode (file, node, indent);
947 if (EXPR_HAS_LOCATION (node))
949 expanded_location xloc = expand_location (EXPR_LOCATION (node));
950 indent_to (file, indent+4);
951 fprintf (file, "%s:%d:%d", xloc.file, xloc.line, xloc.column);