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 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"
33 /* Define the hash table of nodes already seen.
34 Such nodes are not repeated; brief cross-references are used. */
44 static struct bucket **table;
46 /* Print the node NODE on standard error, for debugging.
47 Most nodes referred to by this one are printed recursively
48 down to a depth of six. */
51 debug_tree (tree node)
53 table = XCNEWVEC (struct bucket *, HASH_SIZE);
54 print_node (stderr, "", node, 0);
60 /* Print PREFIX and ADDR to FILE. */
62 dump_addr (FILE *file, const char *prefix, const void *addr)
64 if (flag_dump_noaddr || flag_dump_unnumbered)
65 fprintf (file, "%s#", prefix);
67 fprintf (file, "%s%p", prefix, addr);
70 /* Print a node in brief fashion, with just the code, address and name. */
73 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent)
75 enum tree_code_class class;
80 class = TREE_CODE_CLASS (TREE_CODE (node));
82 /* Always print the slot this node is in, and its code, address and
86 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]);
87 dump_addr (file, " ", node);
89 if (class == tcc_declaration)
92 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
93 else if (TREE_CODE (node) == LABEL_DECL
94 && LABEL_DECL_UID (node) != -1)
95 fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
97 fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
100 else if (class == tcc_type)
102 if (TYPE_NAME (node))
104 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
105 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
106 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
107 && DECL_NAME (TYPE_NAME (node)))
108 fprintf (file, " %s",
109 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
112 if (TREE_CODE (node) == IDENTIFIER_NODE)
113 fprintf (file, " %s", IDENTIFIER_POINTER (node));
115 /* We might as well always print the value of an integer or real. */
116 if (TREE_CODE (node) == INTEGER_CST)
118 if (TREE_OVERFLOW (node))
119 fprintf (file, " overflow");
122 if (TREE_INT_CST_HIGH (node) == 0)
123 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
124 else if (TREE_INT_CST_HIGH (node) == -1
125 && TREE_INT_CST_LOW (node) != 0)
126 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
127 -TREE_INT_CST_LOW (node));
129 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
130 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
132 if (TREE_CODE (node) == REAL_CST)
136 if (TREE_OVERFLOW (node))
137 fprintf (file, " overflow");
139 d = TREE_REAL_CST (node);
140 if (REAL_VALUE_ISINF (d))
141 fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
142 else if (REAL_VALUE_ISNAN (d))
143 fprintf (file, " Nan");
147 real_to_decimal (string, &d, sizeof (string), 0, 1);
148 fprintf (file, " %s", string);
151 if (TREE_CODE (node) == FIXED_CST)
156 if (TREE_OVERFLOW (node))
157 fprintf (file, " overflow");
159 f = TREE_FIXED_CST (node);
160 fixed_to_decimal (string, &f, sizeof (string));
161 fprintf (file, " %s", string);
168 indent_to (FILE *file, int column)
172 /* Since this is the long way, indent to desired column. */
174 fprintf (file, "\n");
175 for (i = 0; i < column; i++)
179 /* Print the node NODE in full on file FILE, preceded by PREFIX,
180 starting in column INDENT. */
183 print_node (FILE *file, const char *prefix, tree node, int indent)
187 enum machine_mode mode;
188 enum tree_code_class class;
191 expanded_location xloc;
197 code = TREE_CODE (node);
198 class = TREE_CODE_CLASS (code);
200 /* Don't get too deep in nesting. If the user wants to see deeper,
201 it is easy to use the address of a lowest-level node
202 as an argument in another call to debug_tree. */
206 print_node_brief (file, prefix, node, indent);
210 if (indent > 8 && (class == tcc_type || class == tcc_declaration))
212 print_node_brief (file, prefix, node, indent);
216 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
217 if (TREE_CODE (node) == ERROR_MARK)
219 print_node_brief (file, prefix, node, indent);
223 hash = ((unsigned long) node) % HASH_SIZE;
225 /* If node is in the table, just mention its address. */
226 for (b = table[hash]; b; b = b->next)
229 print_node_brief (file, prefix, node, indent);
233 /* Add this node to the table. */
234 b = XNEW (struct bucket);
236 b->next = table[hash];
239 /* Indent to the specified column, since this is the long form. */
240 indent_to (file, indent);
242 /* Print the slot this node is in, and its code, and address. */
243 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]);
244 dump_addr (file, " ", node);
246 /* Print the name, if any. */
247 if (class == tcc_declaration)
249 if (DECL_NAME (node))
250 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
251 else if (TREE_CODE (node) == LABEL_DECL
252 && LABEL_DECL_UID (node) != -1)
253 fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
255 fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
258 else if (class == tcc_type)
260 if (TYPE_NAME (node))
262 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
263 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
264 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
265 && DECL_NAME (TYPE_NAME (node)))
266 fprintf (file, " %s",
267 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
270 if (TREE_CODE (node) == IDENTIFIER_NODE)
271 fprintf (file, " %s", IDENTIFIER_POINTER (node));
273 if (TREE_CODE (node) == INTEGER_CST)
276 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
278 else if (!GIMPLE_TUPLE_P (node))
280 print_node (file, "type", TREE_TYPE (node), indent + 4);
281 if (TREE_TYPE (node))
282 indent_to (file, indent + 3);
285 if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node))
286 fputs (" side-effects", file);
288 if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node))
289 fputs (" readonly", file);
290 if (!TYPE_P (node) && TREE_CONSTANT (node))
291 fputs (" constant", file);
292 else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node))
293 fputs (" sizes-gimplified", file);
295 if (TREE_INVARIANT (node))
296 fputs (" invariant", file);
297 if (TREE_ADDRESSABLE (node))
298 fputs (" addressable", file);
299 if (TREE_THIS_VOLATILE (node))
300 fputs (" volatile", file);
301 if (TREE_ASM_WRITTEN (node))
302 fputs (" asm_written", file);
303 if (TREE_USED (node))
304 fputs (" used", file);
305 if (TREE_NOTHROW (node))
306 fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
307 if (TREE_PUBLIC (node))
308 fputs (" public", file);
309 if (TREE_PRIVATE (node))
310 fputs (" private", file);
311 if (TREE_PROTECTED (node))
312 fputs (" protected", file);
313 if (TREE_STATIC (node))
314 fputs (" static", file);
315 if (TREE_DEPRECATED (node))
316 fputs (" deprecated", file);
317 if (TREE_VISITED (node))
318 fputs (" visited", file);
319 if (TREE_LANG_FLAG_0 (node))
320 fputs (" tree_0", file);
321 if (TREE_LANG_FLAG_1 (node))
322 fputs (" tree_1", file);
323 if (TREE_LANG_FLAG_2 (node))
324 fputs (" tree_2", file);
325 if (TREE_LANG_FLAG_3 (node))
326 fputs (" tree_3", file);
327 if (TREE_LANG_FLAG_4 (node))
328 fputs (" tree_4", file);
329 if (TREE_LANG_FLAG_5 (node))
330 fputs (" tree_5", file);
331 if (TREE_LANG_FLAG_6 (node))
332 fputs (" tree_6", file);
334 /* DECL_ nodes have additional attributes. */
336 switch (TREE_CODE_CLASS (TREE_CODE (node)))
338 case tcc_declaration:
339 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
341 if (DECL_UNSIGNED (node))
342 fputs (" unsigned", file);
343 if (DECL_IGNORED_P (node))
344 fputs (" ignored", file);
345 if (DECL_ABSTRACT (node))
346 fputs (" abstract", file);
347 if (DECL_EXTERNAL (node))
348 fputs (" external", file);
349 if (DECL_NONLOCAL (node))
350 fputs (" nonlocal", file);
352 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
354 if (DECL_WEAK (node))
355 fputs (" weak", file);
356 if (DECL_IN_SYSTEM_HEADER (node))
357 fputs (" in_system_header", file);
359 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL)
360 && TREE_CODE (node) != LABEL_DECL
361 && TREE_CODE (node) != FUNCTION_DECL
362 && DECL_REGISTER (node))
363 fputs (" regdecl", file);
365 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
366 fputs (" suppress-debug", file);
368 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
369 fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file);
370 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
371 fputs (" built-in", file);
372 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
373 fputs (" no-static-chain", file);
375 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
376 fputs (" packed", file);
377 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
378 fputs (" bit-field", file);
379 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
380 fputs (" nonaddressable", file);
382 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
383 fputs (" error-issued", file);
385 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
386 fputs (" in-text-section", file);
387 if (TREE_CODE (node) == VAR_DECL && DECL_COMMON (node))
388 fputs (" common", file);
389 if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL_P (node))
391 enum tls_model kind = DECL_TLS_MODEL (node);
394 case TLS_MODEL_GLOBAL_DYNAMIC:
395 fputs (" tls-global-dynamic", file);
397 case TLS_MODEL_LOCAL_DYNAMIC:
398 fputs (" tls-local-dynamic", file);
400 case TLS_MODEL_INITIAL_EXEC:
401 fputs (" tls-initial-exec", file);
403 case TLS_MODEL_LOCAL_EXEC:
404 fputs (" tls-local-exec", file);
411 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
413 if (DECL_VIRTUAL_P (node))
414 fputs (" virtual", file);
415 if (DECL_PRESERVE_P (node))
416 fputs (" preserve", file);
417 if (DECL_NO_TBAA_P (node))
418 fputs (" no-tbaa", file);
419 if (DECL_LANG_FLAG_0 (node))
420 fputs (" decl_0", file);
421 if (DECL_LANG_FLAG_1 (node))
422 fputs (" decl_1", file);
423 if (DECL_LANG_FLAG_2 (node))
424 fputs (" decl_2", file);
425 if (DECL_LANG_FLAG_3 (node))
426 fputs (" decl_3", file);
427 if (DECL_LANG_FLAG_4 (node))
428 fputs (" decl_4", file);
429 if (DECL_LANG_FLAG_5 (node))
430 fputs (" decl_5", file);
431 if (DECL_LANG_FLAG_6 (node))
432 fputs (" decl_6", file);
433 if (DECL_LANG_FLAG_7 (node))
434 fputs (" decl_7", file);
436 mode = DECL_MODE (node);
437 fprintf (file, " %s", GET_MODE_NAME (mode));
440 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS) && DECL_DEFER_OUTPUT (node))
441 fputs (" defer-output", file);
444 xloc = expand_location (DECL_SOURCE_LOCATION (node));
445 fprintf (file, " file %s line %d", xloc.file, xloc.line);
447 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
449 print_node (file, "size", DECL_SIZE (node), indent + 4);
450 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
452 if (TREE_CODE (node) != FUNCTION_DECL
453 || DECL_INLINE (node) || DECL_BUILT_IN (node))
454 indent_to (file, indent + 3);
456 if (DECL_USER_ALIGN (node))
457 fprintf (file, " user");
459 fprintf (file, " align %d", DECL_ALIGN (node));
460 if (TREE_CODE (node) == FIELD_DECL)
461 fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
462 DECL_OFFSET_ALIGN (node));
464 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
466 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
467 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
469 fprintf (file, " built-in %s:%s",
470 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
471 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
474 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
475 fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
476 (HOST_WIDE_INT) DECL_POINTER_ALIAS_SET (node));
478 if (TREE_CODE (node) == FIELD_DECL)
480 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
481 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
483 if (DECL_BIT_FIELD_TYPE (node))
484 print_node (file, "bit_field_type", DECL_BIT_FIELD_TYPE (node),
488 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
490 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
492 print_node_brief (file, "attributes",
493 DECL_ATTRIBUTES (node), indent + 4);
494 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
496 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
498 print_node_brief (file, "abstract_origin",
499 DECL_ABSTRACT_ORIGIN (node), indent + 4);
501 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
503 print_node (file, "arguments", DECL_ARGUMENT_FLD (node), indent + 4);
504 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
507 lang_hooks.print_decl (file, node, indent);
509 if (DECL_RTL_SET_P (node))
511 indent_to (file, indent + 4);
512 print_rtl (file, DECL_RTL (node));
515 if (TREE_CODE (node) == PARM_DECL)
517 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
519 if (DECL_INCOMING_RTL (node) != 0)
521 indent_to (file, indent + 4);
522 fprintf (file, "incoming-rtl ");
523 print_rtl (file, DECL_INCOMING_RTL (node));
526 else if (TREE_CODE (node) == FUNCTION_DECL
527 && DECL_STRUCT_FUNCTION (node) != 0)
529 indent_to (file, indent + 4);
530 dump_addr (file, "saved-insns ", DECL_STRUCT_FUNCTION (node));
533 if ((TREE_CODE (node) == VAR_DECL || TREE_CODE (node) == PARM_DECL)
534 && DECL_HAS_VALUE_EXPR_P (node))
535 print_node (file, "value-expr", DECL_VALUE_EXPR (node), indent + 4);
537 if (TREE_CODE (node) == STRUCT_FIELD_TAG)
539 fprintf (file, " sft size " HOST_WIDE_INT_PRINT_DEC,
541 fprintf (file, " sft offset " HOST_WIDE_INT_PRINT_DEC,
543 print_node_brief (file, "parent var", SFT_PARENT_VAR (node),
546 /* Print the decl chain only if decl is at second level. */
548 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
550 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
554 if (TYPE_UNSIGNED (node))
555 fputs (" unsigned", file);
557 /* The no-force-blk flag is used for different things in
559 if ((TREE_CODE (node) == RECORD_TYPE
560 || TREE_CODE (node) == UNION_TYPE
561 || TREE_CODE (node) == QUAL_UNION_TYPE)
562 && TYPE_NO_FORCE_BLK (node))
563 fputs (" no-force-blk", file);
564 else if (TREE_CODE (node) == INTEGER_TYPE
565 && TYPE_IS_SIZETYPE (node))
566 fputs (" sizetype", file);
567 else if (TREE_CODE (node) == FUNCTION_TYPE
568 && TYPE_RETURNS_STACK_DEPRESSED (node))
569 fputs (" returns-stack-depressed", file);
571 if (TYPE_STRING_FLAG (node))
572 fputs (" string-flag", file);
573 if (TYPE_NEEDS_CONSTRUCTING (node))
574 fputs (" needs-constructing", file);
576 /* The transparent-union flag is used for different things in
578 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
579 fputs (" transparent-union", file);
580 else if (TREE_CODE (node) == ARRAY_TYPE
581 && TYPE_NONALIASED_COMPONENT (node))
582 fputs (" nonaliased-component", file);
584 if (TYPE_PACKED (node))
585 fputs (" packed", file);
587 if (TYPE_RESTRICT (node))
588 fputs (" restrict", file);
590 if (TYPE_LANG_FLAG_0 (node))
591 fputs (" type_0", file);
592 if (TYPE_LANG_FLAG_1 (node))
593 fputs (" type_1", file);
594 if (TYPE_LANG_FLAG_2 (node))
595 fputs (" type_2", file);
596 if (TYPE_LANG_FLAG_3 (node))
597 fputs (" type_3", file);
598 if (TYPE_LANG_FLAG_4 (node))
599 fputs (" type_4", file);
600 if (TYPE_LANG_FLAG_5 (node))
601 fputs (" type_5", file);
602 if (TYPE_LANG_FLAG_6 (node))
603 fputs (" type_6", file);
605 mode = TYPE_MODE (node);
606 fprintf (file, " %s", GET_MODE_NAME (mode));
608 print_node (file, "size", TYPE_SIZE (node), indent + 4);
609 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
610 indent_to (file, indent + 3);
612 if (TYPE_USER_ALIGN (node))
613 fprintf (file, " user");
615 fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
616 TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
617 (HOST_WIDE_INT) TYPE_ALIAS_SET (node));
619 if (TYPE_STRUCTURAL_EQUALITY_P (node))
620 fprintf (file, " structural equality");
622 dump_addr (file, " canonical type ", TYPE_CANONICAL (node));
624 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
626 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE
627 || TREE_CODE (node) == FIXED_POINT_TYPE)
629 fprintf (file, " precision %d", TYPE_PRECISION (node));
630 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
631 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
634 if (TREE_CODE (node) == ENUMERAL_TYPE)
635 print_node (file, "values", TYPE_VALUES (node), indent + 4);
636 else if (TREE_CODE (node) == ARRAY_TYPE)
637 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
638 else if (TREE_CODE (node) == VECTOR_TYPE)
639 fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node));
640 else if (TREE_CODE (node) == RECORD_TYPE
641 || TREE_CODE (node) == UNION_TYPE
642 || TREE_CODE (node) == QUAL_UNION_TYPE)
643 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
644 else if (TREE_CODE (node) == FUNCTION_TYPE
645 || TREE_CODE (node) == METHOD_TYPE)
647 if (TYPE_METHOD_BASETYPE (node))
648 print_node_brief (file, "method basetype",
649 TYPE_METHOD_BASETYPE (node), indent + 4);
650 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
652 else if (TREE_CODE (node) == OFFSET_TYPE)
653 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
656 if (TYPE_CONTEXT (node))
657 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
659 lang_hooks.print_type (file, node, indent);
661 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
662 indent_to (file, indent + 3);
664 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
666 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
668 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
678 if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node))
679 fputs (" unsigned", file);
680 if (TREE_CODE (node) == BIND_EXPR)
682 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
683 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
684 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
687 if (TREE_CODE (node) == CALL_EXPR)
689 call_expr_arg_iterator iter;
691 print_node (file, "fn", CALL_EXPR_FN (node), indent + 4);
692 print_node (file, "static_chain", CALL_EXPR_STATIC_CHAIN (node),
695 FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
698 sprintf (temp, "arg %d", i);
699 print_node (file, temp, arg, indent + 4);
705 len = TREE_OPERAND_LENGTH (node);
707 for (i = 0; i < len; i++)
711 sprintf (temp, "arg %d", i);
712 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
715 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
718 case tcc_gimple_stmt:
719 len = TREE_CODE_LENGTH (TREE_CODE (node));
721 for (i = 0; i < len; i++)
725 sprintf (temp, "arg %d", i);
726 print_node (file, temp, GIMPLE_STMT_OPERAND (node, i), indent + 4);
731 case tcc_exceptional:
732 switch (TREE_CODE (node))
735 if (TREE_OVERFLOW (node))
736 fprintf (file, " overflow");
739 if (TREE_INT_CST_HIGH (node) == 0)
740 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
741 TREE_INT_CST_LOW (node));
742 else if (TREE_INT_CST_HIGH (node) == -1
743 && TREE_INT_CST_LOW (node) != 0)
744 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
745 -TREE_INT_CST_LOW (node));
747 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
748 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
755 if (TREE_OVERFLOW (node))
756 fprintf (file, " overflow");
758 d = TREE_REAL_CST (node);
759 if (REAL_VALUE_ISINF (d))
760 fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
761 else if (REAL_VALUE_ISNAN (d))
762 fprintf (file, " Nan");
766 real_to_decimal (string, &d, sizeof (string), 0, 1);
767 fprintf (file, " %s", string);
777 if (TREE_OVERFLOW (node))
778 fprintf (file, " overflow");
780 f = TREE_FIXED_CST (node);
781 fixed_to_decimal (string, &f, sizeof (string));
782 fprintf (file, " %s", string);
788 tree vals = TREE_VECTOR_CST_ELTS (node);
794 for (link = vals; link; link = TREE_CHAIN (link), ++i)
796 sprintf (buf, "elt%d: ", i);
797 print_node (file, buf, TREE_VALUE (link), indent + 4);
803 print_node (file, "real", TREE_REALPART (node), indent + 4);
804 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
809 const char *p = TREE_STRING_POINTER (node);
810 int i = TREE_STRING_LENGTH (node);
815 if (ch >= ' ' && ch < 127)
818 fprintf(file, "\\%03o", ch & 0xFF);
822 /* Print the chain at second level. */
824 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
826 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
829 case IDENTIFIER_NODE:
830 lang_hooks.print_identifier (file, node, indent);
834 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
835 print_node (file, "value", TREE_VALUE (node), indent + 4);
836 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
840 len = TREE_VEC_LENGTH (node);
841 for (i = 0; i < len; i++)
842 if (TREE_VEC_ELT (node, i))
845 sprintf (temp, "elt %d", i);
846 indent_to (file, indent + 4);
847 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
852 dump_addr (file, " head ", node->stmt_list.head);
853 dump_addr (file, " tail ", node->stmt_list.tail);
854 fprintf (file, " stmts");
856 tree_stmt_iterator i;
857 for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i))
859 /* Not printing the addresses of the (not-a-tree)
860 'struct tree_stmt_list_node's. */
861 dump_addr (file, " ", tsi_stmt (i));
863 fprintf (file, "\n");
864 for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i))
866 /* Not printing the addresses of the (not-a-tree)
867 'struct tree_stmt_list_node's. */
868 print_node (file, "stmt", tsi_stmt (i), indent + 4);
871 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
875 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
876 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node),
878 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
879 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
880 print_node (file, "abstract_origin",
881 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
885 print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
886 print_node_brief (file, "def_stmt",
887 SSA_NAME_DEF_STMT (node), indent + 4);
889 indent_to (file, indent + 4);
890 fprintf (file, "version %u", SSA_NAME_VERSION (node));
891 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
892 fprintf (file, " in-abnormal-phi");
893 if (SSA_NAME_IN_FREE_LIST (node))
894 fprintf (file, " in-free-list");
896 if (SSA_NAME_PTR_INFO (node)
897 || SSA_NAME_VALUE (node))
899 indent_to (file, indent + 3);
900 if (SSA_NAME_PTR_INFO (node))
901 dump_addr (file, " ptr-info ", SSA_NAME_PTR_INFO (node));
902 if (SSA_NAME_VALUE (node))
903 dump_addr (file, " value ", SSA_NAME_VALUE (node));
910 fprintf (file, " %s",
911 omp_clause_code_name[OMP_CLAUSE_CODE (node)]);
912 for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (node)]; i++)
914 indent_to (file, indent + 4);
915 fprintf (file, "op %d:", i);
916 print_node_brief (file, "", OMP_CLAUSE_OPERAND (node, i), 0);
922 if (EXCEPTIONAL_CLASS_P (node))
923 lang_hooks.print_xnode (file, node, indent);
930 if (EXPR_HAS_LOCATION (node))
932 expanded_location xloc = expand_location (EXPR_LOCATION (node));
933 indent_to (file, indent+4);
934 fprintf (file, "%s:%d", xloc.file, xloc.line);