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
class;
82 class = 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 (class == 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 (class == 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
class;
194 expanded_location xloc
;
200 code
= TREE_CODE (node
);
201 class = 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 && (class == tcc_type
|| class == 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 (TREE_CODE (node
) == 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) TREE_CODE (node
)]);
251 dump_addr (file
, " ", node
);
253 /* Print the name, if any. */
254 if (class == tcc_declaration
)
256 if (DECL_NAME (node
))
257 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
258 else if (TREE_CODE (node
) == LABEL_DECL
259 && LABEL_DECL_UID (node
) != -1)
260 fprintf (file
, " L.%d", (int) LABEL_DECL_UID (node
));
262 fprintf (file
, " %c.%u", TREE_CODE (node
) == CONST_DECL
? 'C' : 'D',
265 else if (class == 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 (TREE_CODE (node
) == IDENTIFIER_NODE
)
278 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
280 if (TREE_CODE (node
) == 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 (TREE_CODE (node
)))
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 && TREE_CODE (node
) != LABEL_DECL
366 && TREE_CODE (node
) != FUNCTION_DECL
367 && DECL_REGISTER (node
))
368 fputs (" regdecl", file
);
370 if (TREE_CODE (node
) == TYPE_DECL
&& TYPE_DECL_SUPPRESS_DEBUG (node
))
371 fputs (" suppress-debug", file
);
373 if (TREE_CODE (node
) == FUNCTION_DECL
374 && DECL_FUNCTION_SPECIFIC_TARGET (node
))
375 fputs (" function-specific-target", file
);
376 if (TREE_CODE (node
) == FUNCTION_DECL
377 && DECL_FUNCTION_SPECIFIC_OPTIMIZATION (node
))
378 fputs (" function-specific-opt", file
);
379 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (node
))
380 fputs (" autoinline", file
);
381 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_BUILT_IN (node
))
382 fputs (" built-in", file
);
383 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_NO_STATIC_CHAIN (node
))
384 fputs (" no-static-chain", file
);
386 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_PACKED (node
))
387 fputs (" packed", file
);
388 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_BIT_FIELD (node
))
389 fputs (" bit-field", file
);
390 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_NONADDRESSABLE_P (node
))
391 fputs (" nonaddressable", file
);
393 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_ERROR_ISSUED (node
))
394 fputs (" error-issued", file
);
396 if (TREE_CODE (node
) == VAR_DECL
&& DECL_IN_TEXT_SECTION (node
))
397 fputs (" in-text-section", file
);
398 if (TREE_CODE (node
) == VAR_DECL
&& DECL_COMMON (node
))
399 fputs (" common", file
);
400 if (TREE_CODE (node
) == 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 (TREE_CODE (node
) != FUNCTION_DECL
465 || DECL_INLINE (node
) || DECL_BUILT_IN (node
))
466 indent_to (file
, indent
+ 3);
468 if (DECL_USER_ALIGN (node
))
469 fprintf (file
, " user");
471 fprintf (file
, " align %d", DECL_ALIGN (node
));
472 if (TREE_CODE (node
) == FIELD_DECL
)
473 fprintf (file
, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED
,
474 DECL_OFFSET_ALIGN (node
));
476 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_BUILT_IN (node
))
478 if (DECL_BUILT_IN_CLASS (node
) == BUILT_IN_MD
)
479 fprintf (file
, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node
));
481 fprintf (file
, " built-in %s:%s",
482 built_in_class_names
[(int) DECL_BUILT_IN_CLASS (node
)],
483 built_in_names
[(int) DECL_FUNCTION_CODE (node
)]);
486 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node
))
487 fprintf (file
, " alias set " HOST_WIDE_INT_PRINT_DEC
,
488 (HOST_WIDE_INT
) DECL_POINTER_ALIAS_SET (node
));
490 if (TREE_CODE (node
) == FIELD_DECL
)
492 print_node (file
, "offset", DECL_FIELD_OFFSET (node
), indent
+ 4);
493 print_node (file
, "bit offset", DECL_FIELD_BIT_OFFSET (node
),
495 if (DECL_BIT_FIELD_TYPE (node
))
496 print_node (file
, "bit_field_type", DECL_BIT_FIELD_TYPE (node
),
500 print_node_brief (file
, "context", DECL_CONTEXT (node
), indent
+ 4);
502 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
504 print_node_brief (file
, "attributes",
505 DECL_ATTRIBUTES (node
), indent
+ 4);
506 print_node_brief (file
, "initial", DECL_INITIAL (node
), indent
+ 4);
508 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WRTL
))
510 print_node_brief (file
, "abstract_origin",
511 DECL_ABSTRACT_ORIGIN (node
), indent
+ 4);
513 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_NON_COMMON
))
515 print_node (file
, "arguments", DECL_ARGUMENT_FLD (node
), indent
+ 4);
516 print_node (file
, "result", DECL_RESULT_FLD (node
), indent
+ 4);
519 lang_hooks
.print_decl (file
, node
, indent
);
521 if (DECL_RTL_SET_P (node
))
523 indent_to (file
, indent
+ 4);
524 print_rtl (file
, DECL_RTL (node
));
527 if (TREE_CODE (node
) == PARM_DECL
)
529 print_node (file
, "arg-type", DECL_ARG_TYPE (node
), indent
+ 4);
531 if (DECL_INCOMING_RTL (node
) != 0)
533 indent_to (file
, indent
+ 4);
534 fprintf (file
, "incoming-rtl ");
535 print_rtl (file
, DECL_INCOMING_RTL (node
));
538 else if (TREE_CODE (node
) == FUNCTION_DECL
539 && DECL_STRUCT_FUNCTION (node
) != 0)
541 indent_to (file
, indent
+ 4);
542 dump_addr (file
, "saved-insns ", DECL_STRUCT_FUNCTION (node
));
545 if ((TREE_CODE (node
) == VAR_DECL
|| TREE_CODE (node
) == PARM_DECL
)
546 && DECL_HAS_VALUE_EXPR_P (node
))
547 print_node (file
, "value-expr", DECL_VALUE_EXPR (node
), indent
+ 4);
549 /* Print the decl chain only if decl is at second level. */
551 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
553 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
557 if (TYPE_UNSIGNED (node
))
558 fputs (" unsigned", file
);
560 /* The no-force-blk flag is used for different things in
562 if ((TREE_CODE (node
) == RECORD_TYPE
563 || TREE_CODE (node
) == UNION_TYPE
564 || TREE_CODE (node
) == QUAL_UNION_TYPE
)
565 && TYPE_NO_FORCE_BLK (node
))
566 fputs (" no-force-blk", file
);
567 else if (TREE_CODE (node
) == INTEGER_TYPE
568 && TYPE_IS_SIZETYPE (node
))
569 fputs (" sizetype", 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
) == BIND_EXPR
)
680 print_node (file
, "vars", TREE_OPERAND (node
, 0), indent
+ 4);
681 print_node (file
, "body", TREE_OPERAND (node
, 1), indent
+ 4);
682 print_node (file
, "block", TREE_OPERAND (node
, 2), indent
+ 4);
685 if (TREE_CODE (node
) == CALL_EXPR
)
687 call_expr_arg_iterator iter
;
689 print_node (file
, "fn", CALL_EXPR_FN (node
), indent
+ 4);
690 print_node (file
, "static_chain", CALL_EXPR_STATIC_CHAIN (node
),
693 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, node
)
696 sprintf (temp
, "arg %d", i
);
697 print_node (file
, temp
, arg
, indent
+ 4);
703 len
= TREE_OPERAND_LENGTH (node
);
705 for (i
= 0; i
< len
; i
++)
709 sprintf (temp
, "arg %d", i
);
710 print_node (file
, temp
, TREE_OPERAND (node
, i
), indent
+ 4);
713 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
717 case tcc_exceptional
:
718 switch (TREE_CODE (node
))
721 if (TREE_OVERFLOW (node
))
722 fprintf (file
, " overflow");
725 if (TREE_INT_CST_HIGH (node
) == 0)
726 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
727 TREE_INT_CST_LOW (node
));
728 else if (TREE_INT_CST_HIGH (node
) == -1
729 && TREE_INT_CST_LOW (node
) != 0)
730 fprintf (file
, "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
731 -TREE_INT_CST_LOW (node
));
733 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
734 (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (node
),
735 (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (node
));
742 if (TREE_OVERFLOW (node
))
743 fprintf (file
, " overflow");
745 d
= TREE_REAL_CST (node
);
746 if (REAL_VALUE_ISINF (d
))
747 fprintf (file
, REAL_VALUE_NEGATIVE (d
) ? " -Inf" : " Inf");
748 else if (REAL_VALUE_ISNAN (d
))
749 fprintf (file
, " Nan");
753 real_to_decimal (string
, &d
, sizeof (string
), 0, 1);
754 fprintf (file
, " %s", string
);
764 if (TREE_OVERFLOW (node
))
765 fprintf (file
, " overflow");
767 f
= TREE_FIXED_CST (node
);
768 fixed_to_decimal (string
, &f
, sizeof (string
));
769 fprintf (file
, " %s", string
);
775 tree vals
= TREE_VECTOR_CST_ELTS (node
);
781 for (link
= vals
; link
; link
= TREE_CHAIN (link
), ++i
)
783 sprintf (buf
, "elt%d: ", i
);
784 print_node (file
, buf
, TREE_VALUE (link
), indent
+ 4);
790 print_node (file
, "real", TREE_REALPART (node
), indent
+ 4);
791 print_node (file
, "imag", TREE_IMAGPART (node
), indent
+ 4);
796 const char *p
= TREE_STRING_POINTER (node
);
797 int i
= TREE_STRING_LENGTH (node
);
802 if (ch
>= ' ' && ch
< 127)
805 fprintf(file
, "\\%03o", ch
& 0xFF);
809 /* Print the chain at second level. */
811 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
813 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
816 case IDENTIFIER_NODE
:
817 lang_hooks
.print_identifier (file
, node
, indent
);
821 print_node (file
, "purpose", TREE_PURPOSE (node
), indent
+ 4);
822 print_node (file
, "value", TREE_VALUE (node
), indent
+ 4);
823 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
827 len
= TREE_VEC_LENGTH (node
);
828 for (i
= 0; i
< len
; i
++)
829 if (TREE_VEC_ELT (node
, i
))
832 sprintf (temp
, "elt %d", i
);
833 indent_to (file
, indent
+ 4);
834 print_node_brief (file
, temp
, TREE_VEC_ELT (node
, i
), 0);
840 unsigned HOST_WIDE_INT cnt
;
842 len
= VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (node
));
843 fprintf (file
, " lngt %d", len
);
844 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node
),
847 print_node (file
, "idx", index
, indent
+ 4);
848 print_node (file
, "val", value
, indent
+ 4);
854 dump_addr (file
, " head ", node
->stmt_list
.head
);
855 dump_addr (file
, " tail ", node
->stmt_list
.tail
);
856 fprintf (file
, " stmts");
858 tree_stmt_iterator i
;
859 for (i
= tsi_start (node
); !tsi_end_p (i
); tsi_next (&i
))
861 /* Not printing the addresses of the (not-a-tree)
862 'struct tree_stmt_list_node's. */
863 dump_addr (file
, " ", tsi_stmt (i
));
865 fprintf (file
, "\n");
866 for (i
= tsi_start (node
); !tsi_end_p (i
); tsi_next (&i
))
868 /* Not printing the addresses of the (not-a-tree)
869 'struct tree_stmt_list_node's. */
870 print_node (file
, "stmt", tsi_stmt (i
), indent
+ 4);
873 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
877 print_node (file
, "vars", BLOCK_VARS (node
), indent
+ 4);
878 print_node (file
, "supercontext", BLOCK_SUPERCONTEXT (node
),
880 print_node (file
, "subblocks", BLOCK_SUBBLOCKS (node
), indent
+ 4);
881 print_node (file
, "chain", BLOCK_CHAIN (node
), indent
+ 4);
882 print_node (file
, "abstract_origin",
883 BLOCK_ABSTRACT_ORIGIN (node
), indent
+ 4);
887 print_node_brief (file
, "var", SSA_NAME_VAR (node
), indent
+ 4);
888 fprintf (file
, "def_stmt ");
889 print_gimple_stmt (file
, SSA_NAME_DEF_STMT (node
), indent
+ 4, 0);
891 indent_to (file
, indent
+ 4);
892 fprintf (file
, "version %u", SSA_NAME_VERSION (node
));
893 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node
))
894 fprintf (file
, " in-abnormal-phi");
895 if (SSA_NAME_IN_FREE_LIST (node
))
896 fprintf (file
, " in-free-list");
898 if (SSA_NAME_PTR_INFO (node
)
899 || SSA_NAME_VALUE (node
))
901 indent_to (file
, indent
+ 3);
902 if (SSA_NAME_PTR_INFO (node
))
903 dump_addr (file
, " ptr-info ", SSA_NAME_PTR_INFO (node
));
904 if (SSA_NAME_VALUE (node
))
905 dump_addr (file
, " value ", SSA_NAME_VALUE (node
));
912 fprintf (file
, " %s",
913 omp_clause_code_name
[OMP_CLAUSE_CODE (node
)]);
914 for (i
= 0; i
< omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)]; i
++)
916 indent_to (file
, indent
+ 4);
917 fprintf (file
, "op %d:", i
);
918 print_node_brief (file
, "", OMP_CLAUSE_OPERAND (node
, i
), 0);
923 case OPTIMIZATION_NODE
:
924 cl_optimization_print (file
, indent
+ 4, TREE_OPTIMIZATION (node
));
927 case TARGET_OPTION_NODE
:
928 cl_target_option_print (file
, indent
+ 4, TREE_TARGET_OPTION (node
));
932 if (EXCEPTIONAL_CLASS_P (node
))
933 lang_hooks
.print_xnode (file
, node
, indent
);
940 if (EXPR_HAS_LOCATION (node
))
942 expanded_location xloc
= expand_location (EXPR_LOCATION (node
));
943 indent_to (file
, indent
+4);
944 fprintf (file
, "%s:%d:%d", xloc
.file
, xloc
.line
, xloc
.column
);