1 /* Prints out tree in human readable form - GNU C-compiler
2 Copyright (C) 1990, 1991, 1993, 1994 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
25 extern char **tree_code_name;
27 extern char *mode_name[];
32 /* Define the hash table of nodes already seen.
33 Such nodes are not repeated; brief cross-references are used. */
43 static struct bucket **table;
45 /* Print the node NODE on standard error, for debugging.
46 Most nodes referred to by this one are printed recursively
47 down to a depth of six. */
53 char *object = (char *) oballoc (0);
55 table = (struct bucket **) oballoc (HASH_SIZE * sizeof (struct bucket *));
56 bzero ((char *) table, HASH_SIZE * sizeof (struct bucket *));
57 print_node (stderr, "", node, 0);
60 fprintf (stderr, "\n");
63 /* Print a node in brief fashion, with just the code, address and name. */
66 print_node_brief (file, prefix, node, indent)
77 class = TREE_CODE_CLASS (TREE_CODE (node));
79 /* Always print the slot this node is in, and its code, address and
83 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
84 fprintf (file, HOST_PTR_PRINTF, (HOST_WIDE_INT) node);
89 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
91 else if (class == 't')
95 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
96 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
97 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
98 && DECL_NAME (TYPE_NAME (node)))
100 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
103 if (TREE_CODE (node) == IDENTIFIER_NODE)
104 fprintf (file, " %s", IDENTIFIER_POINTER (node));
105 /* We might as well always print the value of an integer. */
106 if (TREE_CODE (node) == INTEGER_CST)
108 if (TREE_CONSTANT_OVERFLOW (node))
109 fprintf (file, " overflow");
111 if (TREE_INT_CST_HIGH (node) == 0)
113 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
118 TREE_INT_CST_LOW (node));
119 else if (TREE_INT_CST_HIGH (node) == -1
120 && TREE_INT_CST_LOW (node) != 0)
122 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
127 -TREE_INT_CST_LOW (node));
130 #if HOST_BITS_PER_WIDE_INT == 64
131 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
137 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
143 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
145 if (TREE_CODE (node) == REAL_CST)
147 REAL_VALUE_TYPE d = TREE_REAL_CST (node);
148 if (TREE_OVERFLOW (node))
149 fprintf (file, " overflow");
151 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
152 if (REAL_VALUE_ISINF (d))
153 fprintf (file, " Inf");
154 else if (REAL_VALUE_ISNAN (d))
155 fprintf (file, " Nan");
160 REAL_VALUE_TO_DECIMAL (d, "%e", string);
161 fprintf (file, " %s", string);
166 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
167 fprintf (file, " 0x");
168 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
169 fprintf (file, "%02x", *p++);
179 indent_to (file, column)
185 /* Since this is the long way, indent to desired column. */
187 fprintf (file, "\n");
188 for (i = 0; i < column; i++)
192 /* Print the node NODE in full on file FILE, preceded by PREFIX,
193 starting in column INDENT. */
196 print_node (file, prefix, node, indent)
204 enum machine_mode mode;
213 class = TREE_CODE_CLASS (TREE_CODE (node));
215 /* Don't get too deep in nesting. If the user wants to see deeper,
216 it is easy to use the address of a lowest-level node
217 as an argument in another call to debug_tree. */
221 print_node_brief (file, prefix, node, indent);
225 if (indent > 8 && (class == 't' || class == 'd'))
227 print_node_brief (file, prefix, node, indent);
231 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
232 if (TREE_CODE (node) == ERROR_MARK)
234 print_node_brief (file, prefix, node, indent);
238 hash = ((unsigned HOST_WIDE_INT) node) % HASH_SIZE;
240 /* If node is in the table, just mention its address. */
241 for (b = table[hash]; b; b = b->next)
244 print_node_brief (file, prefix, node, indent);
248 /* Add this node to the table. */
249 b = (struct bucket *) oballoc (sizeof (struct bucket));
251 b->next = table[hash];
254 /* Indent to the specified column, since this is the long form. */
255 indent_to (file, indent);
257 /* Print the slot this node is in, and its code, and address. */
258 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
259 fprintf (file, HOST_PTR_PRINTF, (HOST_WIDE_INT) node);
261 /* Print the name, if any. */
264 if (DECL_NAME (node))
265 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
267 else if (class == 't')
269 if (TYPE_NAME (node))
271 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
272 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
273 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
274 && DECL_NAME (TYPE_NAME (node)))
275 fprintf (file, " %s",
276 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
279 if (TREE_CODE (node) == IDENTIFIER_NODE)
280 fprintf (file, " %s", IDENTIFIER_POINTER (node));
282 if (TREE_CODE (node) == INTEGER_CST)
285 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
289 print_node (file, "type", TREE_TYPE (node), indent + 4);
290 if (TREE_TYPE (node))
291 indent_to (file, indent + 3);
293 print_obstack_name ((char *) node, file, "");
294 indent_to (file, indent + 3);
297 /* If a permanent object is in the wrong obstack, or the reverse, warn. */
298 if (object_permanent_p (node) != TREE_PERMANENT (node))
300 if (TREE_PERMANENT (node))
301 fputs (" !!permanent object in non-permanent obstack!!", file);
303 fputs (" !!non-permanent object in permanent obstack!!", file);
304 indent_to (file, indent + 3);
307 if (TREE_SIDE_EFFECTS (node))
308 fputs (" side-effects", file);
309 if (TREE_READONLY (node))
310 fputs (" readonly", file);
311 if (TREE_CONSTANT (node))
312 fputs (" constant", file);
313 if (TREE_ADDRESSABLE (node))
314 fputs (" addressable", file);
315 if (TREE_THIS_VOLATILE (node))
316 fputs (" volatile", file);
317 if (TREE_UNSIGNED (node))
318 fputs (" unsigned", file);
319 if (TREE_ASM_WRITTEN (node))
320 fputs (" asm_written", file);
321 if (TREE_USED (node))
322 fputs (" used", file);
323 if (TREE_RAISES (node))
324 fputs (" raises", file);
325 if (TREE_PERMANENT (node))
326 fputs (" permanent", file);
327 if (TREE_PUBLIC (node))
328 fputs (" public", file);
329 if (TREE_STATIC (node))
330 fputs (" static", file);
331 if (TREE_LANG_FLAG_0 (node))
332 fputs (" tree_0", file);
333 if (TREE_LANG_FLAG_1 (node))
334 fputs (" tree_1", file);
335 if (TREE_LANG_FLAG_2 (node))
336 fputs (" tree_2", file);
337 if (TREE_LANG_FLAG_3 (node))
338 fputs (" tree_3", file);
339 if (TREE_LANG_FLAG_4 (node))
340 fputs (" tree_4", file);
341 if (TREE_LANG_FLAG_5 (node))
342 fputs (" tree_5", file);
343 if (TREE_LANG_FLAG_6 (node))
344 fputs (" tree_6", file);
346 /* DECL_ nodes have additional attributes. */
348 switch (TREE_CODE_CLASS (TREE_CODE (node)))
351 mode = DECL_MODE (node);
353 if (DECL_EXTERNAL (node))
354 fputs (" external", file);
355 if (DECL_NONLOCAL (node))
356 fputs (" nonlocal", file);
357 if (DECL_REGISTER (node))
358 fputs (" regdecl", file);
359 if (DECL_INLINE (node))
360 fputs (" inline", file);
361 if (DECL_BIT_FIELD (node))
362 fputs (" bit-field", file);
363 if (DECL_VIRTUAL_P (node))
364 fputs (" virtual", file);
365 if (DECL_IGNORED_P (node))
366 fputs (" ignored", file);
367 if (DECL_IN_SYSTEM_HEADER (node))
368 fputs (" in_system_header", file);
369 if (DECL_LANG_FLAG_0 (node))
370 fputs (" decl_0", file);
371 if (DECL_LANG_FLAG_1 (node))
372 fputs (" decl_1", file);
373 if (DECL_LANG_FLAG_2 (node))
374 fputs (" decl_2", file);
375 if (DECL_LANG_FLAG_3 (node))
376 fputs (" decl_3", file);
377 if (DECL_LANG_FLAG_4 (node))
378 fputs (" decl_4", file);
379 if (DECL_LANG_FLAG_5 (node))
380 fputs (" decl_5", file);
381 if (DECL_LANG_FLAG_6 (node))
382 fputs (" decl_6", file);
383 if (DECL_LANG_FLAG_7 (node))
384 fputs (" decl_7", file);
386 fprintf (file, " %s", mode_name[(int) mode]);
388 fprintf (file, " file %s line %d",
389 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
391 print_node (file, "size", DECL_SIZE (node), indent + 4);
392 indent_to (file, indent + 3);
393 if (TREE_CODE (node) != FUNCTION_DECL)
394 fprintf (file, " align %d", DECL_ALIGN (node));
395 else if (DECL_INLINE (node))
396 fprintf (file, " frame_size %d", DECL_FRAME_SIZE (node));
397 else if (DECL_BUILT_IN (node))
398 fprintf (file, " built-in code %d", DECL_FUNCTION_CODE (node));
399 if (TREE_CODE (node) == FIELD_DECL)
400 print_node (file, "bitpos", DECL_FIELD_BITPOS (node), indent + 4);
401 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
402 print_node_brief (file, "abstract_origin",
403 DECL_ABSTRACT_ORIGIN (node), indent + 4);
405 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
406 print_node (file, "result", DECL_RESULT (node), indent + 4);
407 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
409 print_lang_decl (file, node, indent);
411 if (DECL_RTL (node) != 0)
413 indent_to (file, indent + 4);
414 print_rtl (file, DECL_RTL (node));
417 if (DECL_SAVED_INSNS (node) != 0)
419 indent_to (file, indent + 4);
420 if (TREE_CODE (node) == PARM_DECL)
422 fprintf (file, "incoming-rtl ");
423 print_rtl (file, DECL_INCOMING_RTL (node));
425 else if (TREE_CODE (node) == FUNCTION_DECL)
427 fprintf (file, "saved-insns ");
428 fprintf (file, HOST_PTR_PRINTF,
429 (HOST_WIDE_INT) DECL_SAVED_INSNS (node));
433 /* Print the decl chain only if decl is at second level. */
435 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
437 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
441 if (TYPE_NO_FORCE_BLK (node))
442 fputs (" no_force_blk", file);
443 if (TYPE_LANG_FLAG_0 (node))
444 fputs (" type_0", file);
445 if (TYPE_LANG_FLAG_1 (node))
446 fputs (" type_1", file);
447 if (TYPE_LANG_FLAG_2 (node))
448 fputs (" type_2", file);
449 if (TYPE_LANG_FLAG_3 (node))
450 fputs (" type_3", file);
451 if (TYPE_LANG_FLAG_4 (node))
452 fputs (" type_4", file);
453 if (TYPE_LANG_FLAG_5 (node))
454 fputs (" type_5", file);
455 if (TYPE_LANG_FLAG_6 (node))
456 fputs (" type_6", file);
458 mode = TYPE_MODE (node);
459 fprintf (file, " %s", mode_name[(int) mode]);
461 print_node (file, "size", TYPE_SIZE (node), indent + 4);
462 indent_to (file, indent + 3);
464 fprintf (file, " align %d", TYPE_ALIGN (node));
465 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
467 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
469 if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
470 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
471 else if (TREE_CODE (node) == INTEGER_TYPE
472 || TREE_CODE (node) == BOOLEAN_TYPE
473 || TREE_CODE (node) == CHAR_TYPE)
475 fprintf (file, " precision %d", TYPE_PRECISION (node));
476 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
477 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
479 else if (TREE_CODE (node) == ENUMERAL_TYPE)
481 fprintf (file, " precision %d", TYPE_PRECISION (node));
482 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
483 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
484 print_node (file, "values", TYPE_VALUES (node), indent + 4);
486 else if (TREE_CODE (node) == REAL_TYPE)
487 fprintf (file, " precision %d", TYPE_PRECISION (node));
488 else if (TREE_CODE (node) == RECORD_TYPE
489 || TREE_CODE (node) == UNION_TYPE
490 || TREE_CODE (node) == QUAL_UNION_TYPE)
491 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
492 else if (TREE_CODE (node) == FUNCTION_TYPE || TREE_CODE (node) == METHOD_TYPE)
494 if (TYPE_METHOD_BASETYPE (node))
495 print_node_brief (file, "method basetype", TYPE_METHOD_BASETYPE (node), indent + 4);
496 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
498 if (TYPE_CONTEXT (node))
499 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
501 print_lang_type (file, node, indent);
503 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
504 indent_to (file, indent + 3);
505 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node), indent + 4);
506 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node), indent + 4);
507 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
511 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
512 print_node (file, "tags", BLOCK_TYPE_TAGS (node), indent + 4);
513 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
514 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
515 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
516 print_node (file, "abstract_origin",
517 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
526 switch (TREE_CODE (node))
529 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
530 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
531 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
535 first_rtl = len = tree_code_length[(int) TREE_CODE (node)];
536 /* These kinds of nodes contain rtx's, not trees,
537 after a certain point. Print the rtx's as rtx's. */
538 switch (TREE_CODE (node))
546 case METHOD_CALL_EXPR:
549 case WITH_CLEANUP_EXPR:
550 /* Should be defined to be 2. */
556 for (i = 0; i < len; i++)
560 indent_to (file, indent + 4);
561 fprintf (file, "rtl %d ", i);
562 if (TREE_OPERAND (node, i))
563 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
565 fprintf (file, "(nil)");
566 fprintf (file, "\n");
572 sprintf (temp, "arg %d", i);
573 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
580 switch (TREE_CODE (node))
583 if (TREE_CONSTANT_OVERFLOW (node))
584 fprintf (file, " overflow");
586 if (TREE_INT_CST_HIGH (node) == 0)
588 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
593 TREE_INT_CST_LOW (node));
594 else if (TREE_INT_CST_HIGH (node) == -1
595 && TREE_INT_CST_LOW (node) != 0)
597 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
602 -TREE_INT_CST_LOW (node));
605 #if HOST_BITS_PER_WIDE_INT == 64
606 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
612 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
618 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
623 REAL_VALUE_TYPE d = TREE_REAL_CST (node);
624 if (TREE_OVERFLOW (node))
625 fprintf (file, " overflow");
627 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
628 if (REAL_VALUE_ISINF (d))
629 fprintf (file, " Inf");
630 else if (REAL_VALUE_ISNAN (d))
631 fprintf (file, " Nan");
636 REAL_VALUE_TO_DECIMAL (d, "%e", string);
637 fprintf (file, " %s", string);
642 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
643 fprintf (file, " 0x");
644 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
645 fprintf (file, "%02x", *p++);
653 print_node (file, "real", TREE_REALPART (node), indent + 4);
654 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
658 fprintf (file, " \"%s\"", TREE_STRING_POINTER (node));
659 /* Print the chain at second level. */
661 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
663 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
666 case IDENTIFIER_NODE:
667 print_lang_identifier (file, node, indent);
671 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
672 print_node (file, "value", TREE_VALUE (node), indent + 4);
673 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
677 len = TREE_VEC_LENGTH (node);
678 for (i = 0; i < len; i++)
679 if (TREE_VEC_ELT (node, i))
682 sprintf (temp, "elt %d", i);
683 indent_to (file, indent + 4);
684 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
689 print_node (file, "op1", TREE_PURPOSE (node), indent + 4);
690 print_node (file, "op2", TREE_VALUE (node), indent + 4);