Daily bump.
[official-gcc.git] / gcc / print-tree.c
blob37c100786029a2cd3957dff5bd3fdb40485544cc
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
10 version.
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
15 for more details.
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/>. */
22 #include "config.h"
23 #include "system.h"
24 #include "coretypes.h"
25 #include "tm.h"
26 #include "tree.h"
27 #include "real.h"
28 #include "fixed-value.h"
29 #include "ggc.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. */
36 #define HASH_SIZE 37
38 struct bucket
40 tree node;
41 struct bucket *next;
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. */
50 void
51 debug_tree (tree node)
53 table = XCNEWVEC (struct bucket *, HASH_SIZE);
54 print_node (stderr, "", node, 0);
55 free (table);
56 table = 0;
57 putc ('\n', stderr);
60 /* Print PREFIX and ADDR to FILE. */
61 void
62 dump_addr (FILE *file, const char *prefix, const void *addr)
64 if (flag_dump_noaddr || flag_dump_unnumbered)
65 fprintf (file, "%s#", prefix);
66 else
67 fprintf (file, "%s%p", prefix, addr);
70 /* Print a node in brief fashion, with just the code, address and name. */
72 void
73 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent)
75 enum tree_code_class class;
77 if (node == 0)
78 return;
80 class = TREE_CODE_CLASS (TREE_CODE (node));
82 /* Always print the slot this node is in, and its code, address and
83 name if any. */
84 if (indent > 0)
85 fprintf (file, " ");
86 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]);
87 dump_addr (file, " ", node);
89 if (class == tcc_declaration)
91 if (DECL_NAME (node))
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));
96 else
97 fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
98 DECL_UID (node));
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");
121 fprintf (file, " ");
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));
128 else
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)
134 REAL_VALUE_TYPE d;
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");
144 else
146 char string[60];
147 real_to_decimal (string, &d, sizeof (string), 0, 1);
148 fprintf (file, " %s", string);
151 if (TREE_CODE (node) == FIXED_CST)
153 FIXED_VALUE_TYPE f;
154 char string[60];
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);
164 fprintf (file, ">");
167 void
168 indent_to (FILE *file, int column)
170 int i;
172 /* Since this is the long way, indent to desired column. */
173 if (column > 0)
174 fprintf (file, "\n");
175 for (i = 0; i < column; i++)
176 fprintf (file, " ");
179 /* Print the node NODE in full on file FILE, preceded by PREFIX,
180 starting in column INDENT. */
182 void
183 print_node (FILE *file, const char *prefix, tree node, int indent)
185 int hash;
186 struct bucket *b;
187 enum machine_mode mode;
188 enum tree_code_class class;
189 int len;
190 int i;
191 expanded_location xloc;
192 enum tree_code code;
194 if (node == 0)
195 return;
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. */
204 if (indent > 24)
206 print_node_brief (file, prefix, node, indent);
207 return;
210 if (indent > 8 && (class == tcc_type || class == tcc_declaration))
212 print_node_brief (file, prefix, node, indent);
213 return;
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);
220 return;
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)
227 if (b->node == node)
229 print_node_brief (file, prefix, node, indent);
230 return;
233 /* Add this node to the table. */
234 b = XNEW (struct bucket);
235 b->node = node;
236 b->next = table[hash];
237 table[hash] = b;
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));
254 else
255 fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
256 DECL_UID (node));
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)
275 if (indent <= 4)
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);
392 switch (kind)
394 case TLS_MODEL_GLOBAL_DYNAMIC:
395 fputs (" tls-global-dynamic", file);
396 break;
397 case TLS_MODEL_LOCAL_DYNAMIC:
398 fputs (" tls-local-dynamic", file);
399 break;
400 case TLS_MODEL_INITIAL_EXEC:
401 fputs (" tls-initial-exec", file);
402 break;
403 case TLS_MODEL_LOCAL_EXEC:
404 fputs (" tls-local-exec", file);
405 break;
406 default:
407 gcc_unreachable ();
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);
446 #ifdef USE_MAPPED_LOCATION
447 fprintf (file, " col %d", xloc.column);
448 #endif
450 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
452 print_node (file, "size", DECL_SIZE (node), indent + 4);
453 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
455 if (TREE_CODE (node) != FUNCTION_DECL
456 || DECL_INLINE (node) || DECL_BUILT_IN (node))
457 indent_to (file, indent + 3);
459 if (DECL_USER_ALIGN (node))
460 fprintf (file, " user");
462 fprintf (file, " align %d", DECL_ALIGN (node));
463 if (TREE_CODE (node) == FIELD_DECL)
464 fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
465 DECL_OFFSET_ALIGN (node));
467 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
469 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
470 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
471 else
472 fprintf (file, " built-in %s:%s",
473 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
474 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
477 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
478 fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
479 (HOST_WIDE_INT) DECL_POINTER_ALIAS_SET (node));
481 if (TREE_CODE (node) == FIELD_DECL)
483 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
484 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
485 indent + 4);
486 if (DECL_BIT_FIELD_TYPE (node))
487 print_node (file, "bit_field_type", DECL_BIT_FIELD_TYPE (node),
488 indent + 4);
491 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
493 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
495 print_node_brief (file, "attributes",
496 DECL_ATTRIBUTES (node), indent + 4);
497 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
499 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
501 print_node_brief (file, "abstract_origin",
502 DECL_ABSTRACT_ORIGIN (node), indent + 4);
504 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
506 print_node (file, "arguments", DECL_ARGUMENT_FLD (node), indent + 4);
507 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
510 lang_hooks.print_decl (file, node, indent);
512 if (DECL_RTL_SET_P (node))
514 indent_to (file, indent + 4);
515 print_rtl (file, DECL_RTL (node));
518 if (TREE_CODE (node) == PARM_DECL)
520 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
522 if (DECL_INCOMING_RTL (node) != 0)
524 indent_to (file, indent + 4);
525 fprintf (file, "incoming-rtl ");
526 print_rtl (file, DECL_INCOMING_RTL (node));
529 else if (TREE_CODE (node) == FUNCTION_DECL
530 && DECL_STRUCT_FUNCTION (node) != 0)
532 indent_to (file, indent + 4);
533 dump_addr (file, "saved-insns ", DECL_STRUCT_FUNCTION (node));
536 if ((TREE_CODE (node) == VAR_DECL || TREE_CODE (node) == PARM_DECL)
537 && DECL_HAS_VALUE_EXPR_P (node))
538 print_node (file, "value-expr", DECL_VALUE_EXPR (node), indent + 4);
540 if (TREE_CODE (node) == STRUCT_FIELD_TAG)
542 fprintf (file, " sft size " HOST_WIDE_INT_PRINT_DEC,
543 SFT_SIZE (node));
544 fprintf (file, " sft offset " HOST_WIDE_INT_PRINT_DEC,
545 SFT_OFFSET (node));
546 print_node_brief (file, "parent var", SFT_PARENT_VAR (node),
547 indent + 4);
549 /* Print the decl chain only if decl is at second level. */
550 if (indent == 4)
551 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
552 else
553 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
554 break;
556 case tcc_type:
557 if (TYPE_UNSIGNED (node))
558 fputs (" unsigned", file);
560 /* The no-force-blk flag is used for different things in
561 different types. */
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);
570 else if (TREE_CODE (node) == FUNCTION_TYPE
571 && TYPE_RETURNS_STACK_DEPRESSED (node))
572 fputs (" returns-stack-depressed", file);
574 if (TYPE_STRING_FLAG (node))
575 fputs (" string-flag", file);
576 if (TYPE_NEEDS_CONSTRUCTING (node))
577 fputs (" needs-constructing", file);
579 /* The transparent-union flag is used for different things in
580 different nodes. */
581 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
582 fputs (" transparent-union", file);
583 else if (TREE_CODE (node) == ARRAY_TYPE
584 && TYPE_NONALIASED_COMPONENT (node))
585 fputs (" nonaliased-component", file);
587 if (TYPE_PACKED (node))
588 fputs (" packed", file);
590 if (TYPE_RESTRICT (node))
591 fputs (" restrict", file);
593 if (TYPE_LANG_FLAG_0 (node))
594 fputs (" type_0", file);
595 if (TYPE_LANG_FLAG_1 (node))
596 fputs (" type_1", file);
597 if (TYPE_LANG_FLAG_2 (node))
598 fputs (" type_2", file);
599 if (TYPE_LANG_FLAG_3 (node))
600 fputs (" type_3", file);
601 if (TYPE_LANG_FLAG_4 (node))
602 fputs (" type_4", file);
603 if (TYPE_LANG_FLAG_5 (node))
604 fputs (" type_5", file);
605 if (TYPE_LANG_FLAG_6 (node))
606 fputs (" type_6", file);
608 mode = TYPE_MODE (node);
609 fprintf (file, " %s", GET_MODE_NAME (mode));
611 print_node (file, "size", TYPE_SIZE (node), indent + 4);
612 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
613 indent_to (file, indent + 3);
615 if (TYPE_USER_ALIGN (node))
616 fprintf (file, " user");
618 fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
619 TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
620 (HOST_WIDE_INT) TYPE_ALIAS_SET (node));
622 if (TYPE_STRUCTURAL_EQUALITY_P (node))
623 fprintf (file, " structural equality");
624 else
625 dump_addr (file, " canonical type ", TYPE_CANONICAL (node));
627 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
629 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE
630 || TREE_CODE (node) == FIXED_POINT_TYPE)
632 fprintf (file, " precision %d", TYPE_PRECISION (node));
633 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
634 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
637 if (TREE_CODE (node) == ENUMERAL_TYPE)
638 print_node (file, "values", TYPE_VALUES (node), indent + 4);
639 else if (TREE_CODE (node) == ARRAY_TYPE)
640 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
641 else if (TREE_CODE (node) == VECTOR_TYPE)
642 fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node));
643 else if (TREE_CODE (node) == RECORD_TYPE
644 || TREE_CODE (node) == UNION_TYPE
645 || TREE_CODE (node) == QUAL_UNION_TYPE)
646 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
647 else if (TREE_CODE (node) == FUNCTION_TYPE
648 || TREE_CODE (node) == METHOD_TYPE)
650 if (TYPE_METHOD_BASETYPE (node))
651 print_node_brief (file, "method basetype",
652 TYPE_METHOD_BASETYPE (node), indent + 4);
653 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
655 else if (TREE_CODE (node) == OFFSET_TYPE)
656 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
657 indent + 4);
659 if (TYPE_CONTEXT (node))
660 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
662 lang_hooks.print_type (file, node, indent);
664 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
665 indent_to (file, indent + 3);
667 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
668 indent + 4);
669 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
670 indent + 4);
671 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
672 break;
674 case tcc_expression:
675 case tcc_comparison:
676 case tcc_unary:
677 case tcc_binary:
678 case tcc_reference:
679 case tcc_statement:
680 case tcc_vl_exp:
681 if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node))
682 fputs (" unsigned", file);
683 if (TREE_CODE (node) == BIND_EXPR)
685 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
686 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
687 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
688 break;
690 if (TREE_CODE (node) == CALL_EXPR)
692 call_expr_arg_iterator iter;
693 tree arg;
694 print_node (file, "fn", CALL_EXPR_FN (node), indent + 4);
695 print_node (file, "static_chain", CALL_EXPR_STATIC_CHAIN (node),
696 indent + 4);
697 i = 0;
698 FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
700 char temp[10];
701 sprintf (temp, "arg %d", i);
702 print_node (file, temp, arg, indent + 4);
703 i++;
706 else
708 len = TREE_OPERAND_LENGTH (node);
710 for (i = 0; i < len; i++)
712 char temp[10];
714 sprintf (temp, "arg %d", i);
715 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
718 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
719 break;
721 case tcc_gimple_stmt:
722 len = TREE_CODE_LENGTH (TREE_CODE (node));
724 for (i = 0; i < len; i++)
726 char temp[10];
728 sprintf (temp, "arg %d", i);
729 print_node (file, temp, GIMPLE_STMT_OPERAND (node, i), indent + 4);
731 break;
733 case tcc_constant:
734 case tcc_exceptional:
735 switch (TREE_CODE (node))
737 case INTEGER_CST:
738 if (TREE_OVERFLOW (node))
739 fprintf (file, " overflow");
741 fprintf (file, " ");
742 if (TREE_INT_CST_HIGH (node) == 0)
743 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
744 TREE_INT_CST_LOW (node));
745 else if (TREE_INT_CST_HIGH (node) == -1
746 && TREE_INT_CST_LOW (node) != 0)
747 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
748 -TREE_INT_CST_LOW (node));
749 else
750 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
751 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
752 break;
754 case REAL_CST:
756 REAL_VALUE_TYPE d;
758 if (TREE_OVERFLOW (node))
759 fprintf (file, " overflow");
761 d = TREE_REAL_CST (node);
762 if (REAL_VALUE_ISINF (d))
763 fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
764 else if (REAL_VALUE_ISNAN (d))
765 fprintf (file, " Nan");
766 else
768 char string[64];
769 real_to_decimal (string, &d, sizeof (string), 0, 1);
770 fprintf (file, " %s", string);
773 break;
775 case FIXED_CST:
777 FIXED_VALUE_TYPE f;
778 char string[64];
780 if (TREE_OVERFLOW (node))
781 fprintf (file, " overflow");
783 f = TREE_FIXED_CST (node);
784 fixed_to_decimal (string, &f, sizeof (string));
785 fprintf (file, " %s", string);
787 break;
789 case VECTOR_CST:
791 tree vals = TREE_VECTOR_CST_ELTS (node);
792 char buf[10];
793 tree link;
794 int i;
796 i = 0;
797 for (link = vals; link; link = TREE_CHAIN (link), ++i)
799 sprintf (buf, "elt%d: ", i);
800 print_node (file, buf, TREE_VALUE (link), indent + 4);
803 break;
805 case COMPLEX_CST:
806 print_node (file, "real", TREE_REALPART (node), indent + 4);
807 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
808 break;
810 case STRING_CST:
812 const char *p = TREE_STRING_POINTER (node);
813 int i = TREE_STRING_LENGTH (node);
814 fputs (" \"", file);
815 while (--i >= 0)
817 char ch = *p++;
818 if (ch >= ' ' && ch < 127)
819 putc (ch, file);
820 else
821 fprintf(file, "\\%03o", ch & 0xFF);
823 fputc ('\"', file);
825 /* Print the chain at second level. */
826 if (indent == 4)
827 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
828 else
829 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
830 break;
832 case IDENTIFIER_NODE:
833 lang_hooks.print_identifier (file, node, indent);
834 break;
836 case TREE_LIST:
837 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
838 print_node (file, "value", TREE_VALUE (node), indent + 4);
839 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
840 break;
842 case TREE_VEC:
843 len = TREE_VEC_LENGTH (node);
844 for (i = 0; i < len; i++)
845 if (TREE_VEC_ELT (node, i))
847 char temp[10];
848 sprintf (temp, "elt %d", i);
849 indent_to (file, indent + 4);
850 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
852 break;
854 case STATEMENT_LIST:
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);
875 break;
877 case BLOCK:
878 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
879 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node),
880 indent + 4);
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);
885 break;
887 case SSA_NAME:
888 print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
889 print_node_brief (file, "def_stmt",
890 SSA_NAME_DEF_STMT (node), indent + 4);
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));
908 break;
910 case OMP_CLAUSE:
912 int i;
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);
922 break;
924 default:
925 if (EXCEPTIONAL_CLASS_P (node))
926 lang_hooks.print_xnode (file, node, indent);
927 break;
930 break;
933 if (EXPR_HAS_LOCATION (node))
935 expanded_location xloc = expand_location (EXPR_LOCATION (node));
936 indent_to (file, indent+4);
937 fprintf (file, "%s:%d", xloc.file, xloc.line);
938 #ifdef USE_MAPPED_LOCATION
939 fprintf (file, ":%d", xloc.column);
940 #endif
943 fprintf (file, ">");