1 /* Prints out tree in human readable form - GNU C-compiler
2 Copyright (C) 1990, 91, 93, 94, 95, 1996 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
26 extern char **tree_code_name;
28 extern char *mode_name[];
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. */
54 char *object = (char *) oballoc (0);
56 table = (struct bucket **) oballoc (HASH_SIZE * sizeof (struct bucket *));
57 bzero ((char *) table, HASH_SIZE * sizeof (struct bucket *));
58 print_node (stderr, "", node, 0);
61 fprintf (stderr, "\n");
64 /* Print a node in brief fashion, with just the code, address and name. */
67 print_node_brief (file, prefix, node, indent)
78 class = TREE_CODE_CLASS (TREE_CODE (node));
80 /* Always print the slot this node is in, and its code, address and
84 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
85 fprintf (file, HOST_PTR_PRINTF, (HOST_WIDE_INT) node);
90 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
92 else if (class == 't')
96 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
97 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
98 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
99 && DECL_NAME (TYPE_NAME (node)))
100 fprintf (file, " %s",
101 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
104 if (TREE_CODE (node) == IDENTIFIER_NODE)
105 fprintf (file, " %s", IDENTIFIER_POINTER (node));
106 /* We might as well always print the value of an integer. */
107 if (TREE_CODE (node) == INTEGER_CST)
109 if (TREE_CONSTANT_OVERFLOW (node))
110 fprintf (file, " overflow");
113 if (TREE_INT_CST_HIGH (node) == 0)
114 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
115 else if (TREE_INT_CST_HIGH (node) == -1
116 && TREE_INT_CST_LOW (node) != 0)
119 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
120 -TREE_INT_CST_LOW (node));
123 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
124 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
126 if (TREE_CODE (node) == REAL_CST)
130 if (TREE_OVERFLOW (node))
131 fprintf (file, " overflow");
133 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
134 d = TREE_REAL_CST (node);
135 if (REAL_VALUE_ISINF (d))
136 fprintf (file, " Inf");
137 else if (REAL_VALUE_ISNAN (d))
138 fprintf (file, " Nan");
143 REAL_VALUE_TO_DECIMAL (d, "%e", string);
144 fprintf (file, " %s", string);
149 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
150 fprintf (file, " 0x");
151 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
152 fprintf (file, "%02x", *p++);
162 indent_to (file, column)
168 /* Since this is the long way, indent to desired column. */
170 fprintf (file, "\n");
171 for (i = 0; i < column; i++)
175 /* Print the node NODE in full on file FILE, preceded by PREFIX,
176 starting in column INDENT. */
179 print_node (file, prefix, node, indent)
187 enum machine_mode mode;
196 class = TREE_CODE_CLASS (TREE_CODE (node));
198 /* Don't get too deep in nesting. If the user wants to see deeper,
199 it is easy to use the address of a lowest-level node
200 as an argument in another call to debug_tree. */
204 print_node_brief (file, prefix, node, indent);
208 if (indent > 8 && (class == 't' || class == 'd'))
210 print_node_brief (file, prefix, node, indent);
214 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
215 if (TREE_CODE (node) == ERROR_MARK)
217 print_node_brief (file, prefix, node, indent);
221 hash = ((unsigned HOST_WIDE_INT) node) % HASH_SIZE;
223 /* If node is in the table, just mention its address. */
224 for (b = table[hash]; b; b = b->next)
227 print_node_brief (file, prefix, node, indent);
231 /* Add this node to the table. */
232 b = (struct bucket *) oballoc (sizeof (struct bucket));
234 b->next = table[hash];
237 /* Indent to the specified column, since this is the long form. */
238 indent_to (file, indent);
240 /* Print the slot this node is in, and its code, and address. */
241 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
242 fprintf (file, HOST_PTR_PRINTF, (HOST_WIDE_INT) node);
244 /* Print the name, if any. */
247 if (DECL_NAME (node))
248 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
250 else if (class == 't')
252 if (TYPE_NAME (node))
254 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
255 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
256 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
257 && DECL_NAME (TYPE_NAME (node)))
258 fprintf (file, " %s",
259 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
262 if (TREE_CODE (node) == IDENTIFIER_NODE)
263 fprintf (file, " %s", IDENTIFIER_POINTER (node));
265 if (TREE_CODE (node) == INTEGER_CST)
268 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
272 print_node (file, "type", TREE_TYPE (node), indent + 4);
273 if (TREE_TYPE (node))
274 indent_to (file, indent + 3);
276 print_obstack_name ((char *) node, file, "");
277 indent_to (file, indent + 3);
280 /* If a permanent object is in the wrong obstack, or the reverse, warn. */
281 if (object_permanent_p (node) != TREE_PERMANENT (node))
283 if (TREE_PERMANENT (node))
284 fputs (" !!permanent object in non-permanent obstack!!", file);
286 fputs (" !!non-permanent object in permanent obstack!!", file);
287 indent_to (file, indent + 3);
290 if (TREE_SIDE_EFFECTS (node))
291 fputs (" side-effects", file);
292 if (TREE_READONLY (node))
293 fputs (" readonly", file);
294 if (TREE_CONSTANT (node))
295 fputs (" constant", file);
296 if (TREE_ADDRESSABLE (node))
297 fputs (" addressable", file);
298 if (TREE_THIS_VOLATILE (node))
299 fputs (" volatile", file);
300 if (TREE_UNSIGNED (node))
301 fputs (" unsigned", file);
302 if (TREE_ASM_WRITTEN (node))
303 fputs (" asm_written", file);
304 if (TREE_USED (node))
305 fputs (" used", file);
306 if (TREE_RAISES (node))
307 fputs (" raises", file);
308 if (TREE_PERMANENT (node))
309 fputs (" permanent", file);
310 if (TREE_PUBLIC (node))
311 fputs (" public", file);
312 if (TREE_STATIC (node))
313 fputs (" static", file);
314 if (TREE_LANG_FLAG_0 (node))
315 fputs (" tree_0", file);
316 if (TREE_LANG_FLAG_1 (node))
317 fputs (" tree_1", file);
318 if (TREE_LANG_FLAG_2 (node))
319 fputs (" tree_2", file);
320 if (TREE_LANG_FLAG_3 (node))
321 fputs (" tree_3", file);
322 if (TREE_LANG_FLAG_4 (node))
323 fputs (" tree_4", file);
324 if (TREE_LANG_FLAG_5 (node))
325 fputs (" tree_5", file);
326 if (TREE_LANG_FLAG_6 (node))
327 fputs (" tree_6", file);
329 /* DECL_ nodes have additional attributes. */
331 switch (TREE_CODE_CLASS (TREE_CODE (node)))
334 mode = DECL_MODE (node);
336 if (DECL_IGNORED_P (node))
337 fputs (" ignored", file);
338 if (DECL_ABSTRACT (node))
339 fputs (" abstract", file);
340 if (DECL_IN_SYSTEM_HEADER (node))
341 fputs (" in_system_header", file);
342 if (DECL_COMMON (node))
343 fputs (" common", file);
344 if (DECL_EXTERNAL (node))
345 fputs (" external", file);
346 if (DECL_REGISTER (node))
347 fputs (" regdecl", file);
348 if (DECL_PACKED (node))
349 fputs (" packed", file);
350 if (DECL_NONLOCAL (node))
351 fputs (" nonlocal", file);
352 if (DECL_INLINE (node))
353 fputs (" inline", file);
355 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
356 fputs (" suppress-debug", file);
358 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
359 fputs (" built-in", file);
360 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN_NONANSI (node))
361 fputs (" built-in-nonansi", file);
363 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
364 fputs (" bit-field", file);
365 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
366 fputs (" too-late", file);
367 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
368 fputs (" in-text-section", file);
370 if (DECL_VIRTUAL_P (node))
371 fputs (" virtual", file);
372 if (DECL_DEFER_OUTPUT (node))
373 fputs (" defer-output", file);
374 if (DECL_TRANSPARENT_UNION (node))
375 fputs (" transparent-union", file);
377 if (DECL_LANG_FLAG_0 (node))
378 fputs (" decl_0", file);
379 if (DECL_LANG_FLAG_1 (node))
380 fputs (" decl_1", file);
381 if (DECL_LANG_FLAG_2 (node))
382 fputs (" decl_2", file);
383 if (DECL_LANG_FLAG_3 (node))
384 fputs (" decl_3", file);
385 if (DECL_LANG_FLAG_4 (node))
386 fputs (" decl_4", file);
387 if (DECL_LANG_FLAG_5 (node))
388 fputs (" decl_5", file);
389 if (DECL_LANG_FLAG_6 (node))
390 fputs (" decl_6", file);
391 if (DECL_LANG_FLAG_7 (node))
392 fputs (" decl_7", file);
394 fprintf (file, " %s", mode_name[(int) mode]);
396 fprintf (file, " file %s line %d",
397 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
399 print_node (file, "size", DECL_SIZE (node), indent + 4);
400 indent_to (file, indent + 3);
401 if (TREE_CODE (node) != FUNCTION_DECL)
402 fprintf (file, " align %d", DECL_ALIGN (node));
403 else if (DECL_INLINE (node))
404 fprintf (file, " frame_size %d", DECL_FRAME_SIZE (node));
405 else if (DECL_BUILT_IN (node))
406 fprintf (file, " built-in code %d", DECL_FUNCTION_CODE (node));
407 if (TREE_CODE (node) == FIELD_DECL)
408 print_node (file, "bitpos", DECL_FIELD_BITPOS (node), indent + 4);
409 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
410 print_node_brief (file, "machine_attributes", DECL_MACHINE_ATTRIBUTES (node), indent + 4);
411 print_node_brief (file, "abstract_origin",
412 DECL_ABSTRACT_ORIGIN (node), indent + 4);
414 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
415 print_node (file, "result", DECL_RESULT (node), indent + 4);
416 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
418 print_lang_decl (file, node, indent);
420 if (DECL_RTL (node) != 0)
422 indent_to (file, indent + 4);
423 print_rtl (file, DECL_RTL (node));
426 if (DECL_SAVED_INSNS (node) != 0)
428 indent_to (file, indent + 4);
429 if (TREE_CODE (node) == PARM_DECL)
431 fprintf (file, "incoming-rtl ");
432 print_rtl (file, DECL_INCOMING_RTL (node));
434 else if (TREE_CODE (node) == FUNCTION_DECL)
436 fprintf (file, "saved-insns ");
437 fprintf (file, HOST_PTR_PRINTF,
438 (HOST_WIDE_INT) DECL_SAVED_INSNS (node));
442 /* Print the decl chain only if decl is at second level. */
444 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
446 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
450 if (TYPE_NO_FORCE_BLK (node))
451 fputs (" no-force-blk", file);
452 if (TYPE_STRING_FLAG (node))
453 fputs (" string-flag", file);
454 if (TYPE_NEEDS_CONSTRUCTING (node))
455 fputs (" needs-constructing", file);
456 if (TYPE_TRANSPARENT_UNION (node))
457 fputs (" transparent-union", file);
458 if (TYPE_PACKED (node))
459 fputs (" packed", file);
461 if (TYPE_LANG_FLAG_0 (node))
462 fputs (" type_0", file);
463 if (TYPE_LANG_FLAG_1 (node))
464 fputs (" type_1", file);
465 if (TYPE_LANG_FLAG_2 (node))
466 fputs (" type_2", file);
467 if (TYPE_LANG_FLAG_3 (node))
468 fputs (" type_3", file);
469 if (TYPE_LANG_FLAG_4 (node))
470 fputs (" type_4", file);
471 if (TYPE_LANG_FLAG_5 (node))
472 fputs (" type_5", file);
473 if (TYPE_LANG_FLAG_6 (node))
474 fputs (" type_6", file);
476 mode = TYPE_MODE (node);
477 fprintf (file, " %s", mode_name[(int) mode]);
479 print_node (file, "size", TYPE_SIZE (node), indent + 4);
480 indent_to (file, indent + 3);
482 fprintf (file, " align %d", TYPE_ALIGN (node));
483 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
485 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
487 if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
488 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
489 else if (TREE_CODE (node) == INTEGER_TYPE
490 || TREE_CODE (node) == BOOLEAN_TYPE
491 || TREE_CODE (node) == CHAR_TYPE)
493 fprintf (file, " precision %d", TYPE_PRECISION (node));
494 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
495 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
497 else if (TREE_CODE (node) == ENUMERAL_TYPE)
499 fprintf (file, " precision %d", TYPE_PRECISION (node));
500 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
501 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
502 print_node (file, "values", TYPE_VALUES (node), indent + 4);
504 else if (TREE_CODE (node) == REAL_TYPE)
505 fprintf (file, " precision %d", TYPE_PRECISION (node));
506 else if (TREE_CODE (node) == RECORD_TYPE
507 || TREE_CODE (node) == UNION_TYPE
508 || TREE_CODE (node) == QUAL_UNION_TYPE)
509 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
510 else if (TREE_CODE (node) == FUNCTION_TYPE || TREE_CODE (node) == METHOD_TYPE)
512 if (TYPE_METHOD_BASETYPE (node))
513 print_node_brief (file, "method basetype", TYPE_METHOD_BASETYPE (node), indent + 4);
514 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
516 if (TYPE_CONTEXT (node))
517 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
519 print_lang_type (file, node, indent);
521 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
522 indent_to (file, indent + 3);
523 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node), indent + 4);
524 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node), indent + 4);
525 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
529 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
530 print_node (file, "tags", BLOCK_TYPE_TAGS (node), indent + 4);
531 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
532 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
533 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
534 print_node (file, "abstract_origin",
535 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
544 switch (TREE_CODE (node))
547 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
548 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
549 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
553 first_rtl = len = tree_code_length[(int) TREE_CODE (node)];
554 /* These kinds of nodes contain rtx's, not trees,
555 after a certain point. Print the rtx's as rtx's. */
556 switch (TREE_CODE (node))
564 case METHOD_CALL_EXPR:
567 case WITH_CLEANUP_EXPR:
568 /* Should be defined to be 2. */
574 for (i = 0; i < len; i++)
578 indent_to (file, indent + 4);
579 fprintf (file, "rtl %d ", i);
580 if (TREE_OPERAND (node, i))
581 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
583 fprintf (file, "(nil)");
584 fprintf (file, "\n");
590 sprintf (temp, "arg %d", i);
591 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
598 switch (TREE_CODE (node))
601 if (TREE_CONSTANT_OVERFLOW (node))
602 fprintf (file, " overflow");
605 if (TREE_INT_CST_HIGH (node) == 0)
606 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
607 TREE_INT_CST_LOW (node));
608 else if (TREE_INT_CST_HIGH (node) == -1
609 && TREE_INT_CST_LOW (node) != 0)
612 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
613 -TREE_INT_CST_LOW (node));
616 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
617 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
624 if (TREE_OVERFLOW (node))
625 fprintf (file, " overflow");
627 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
628 d = TREE_REAL_CST (node);
629 if (REAL_VALUE_ISINF (d))
630 fprintf (file, " Inf");
631 else if (REAL_VALUE_ISNAN (d))
632 fprintf (file, " Nan");
637 REAL_VALUE_TO_DECIMAL (d, "%e", string);
638 fprintf (file, " %s", string);
643 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
644 fprintf (file, " 0x");
645 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
646 fprintf (file, "%02x", *p++);
654 print_node (file, "real", TREE_REALPART (node), indent + 4);
655 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
659 fprintf (file, " \"%s\"", TREE_STRING_POINTER (node));
660 /* Print the chain at second level. */
662 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
664 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
667 case IDENTIFIER_NODE:
668 print_lang_identifier (file, node, indent);
672 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
673 print_node (file, "value", TREE_VALUE (node), indent + 4);
674 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
678 len = TREE_VEC_LENGTH (node);
679 for (i = 0; i < len; i++)
680 if (TREE_VEC_ELT (node, i))
683 sprintf (temp, "elt %d", i);
684 indent_to (file, indent + 4);
685 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
690 print_node (file, "op1", TREE_PURPOSE (node), indent + 4);
691 print_node (file, "op2", TREE_VALUE (node), indent + 4);