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 Free Software Foundation, Inc.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 2, or (at your option) any later
10version.
11
12GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13WARRANTY; without even the implied warranty of MERCHANTABILITY or
14FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING. If not, write to the Free
19Software Foundation, 59 Temple Place - Suite 330, Boston, MA
2002111-1307, USA. */
21
22
23#include "config.h"
24#include "system.h"
25#include "coretypes.h"
26#include "tm.h"
27#include "tree.h"
28#include "real.h"
29#include "ggc.h"
30#include "langhooks.h"
31
32/* Define the hash table of nodes already seen.
33 Such nodes are not repeated; brief cross-references are used. */
34
35#define HASH_SIZE 37
36
37struct bucket
38{
--- 5 unchanged lines hidden (view full) ---
44
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. */
48
49void
50debug_tree (tree node)
51{
52 table = xcalloc (HASH_SIZE, sizeof (struct bucket *));
53 print_node (stderr, "", node, 0);
54 free (table);
55 table = 0;
56 putc ('\n', stderr);
57}
58
59/* Print a node in brief fashion, with just the code, address and name. */
60
61void
62print_node_brief (FILE *file, const char *prefix, tree node, int indent)
63{
64 char class;
65
66 if (node == 0)
67 return;
68
69 class = TREE_CODE_CLASS (TREE_CODE (node));
70
71 /* Always print the slot this node is in, and its code, address and
72 name if any. */
73 if (indent > 0)
74 fprintf (file, " ");
75 fprintf (file, "%s <%s " HOST_PTR_PRINTF,
76 prefix, tree_code_name[(int) TREE_CODE (node)], (char *) node);
77
78 if (class == 'd')
79 {
80 if (DECL_NAME (node))
81 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
82 }
83 else if (class == 't')
84 {
85 if (TYPE_NAME (node))
86 {
87 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
88 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
89 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
90 && DECL_NAME (TYPE_NAME (node)))
91 fprintf (file, " %s",
--- 24 unchanged lines hidden (view full) ---
116 {
117 REAL_VALUE_TYPE d;
118
119 if (TREE_OVERFLOW (node))
120 fprintf (file, " overflow");
121
122 d = TREE_REAL_CST (node);
123 if (REAL_VALUE_ISINF (d))
124 fprintf (file, " Inf");
125 else if (REAL_VALUE_ISNAN (d))
126 fprintf (file, " Nan");
127 else
128 {
129 char string[60];
130 real_to_decimal (string, &d, sizeof (string), 0, 1);
131 fprintf (file, " %s", string);
132 }
--- 18 unchanged lines hidden (view full) ---
151 starting in column INDENT. */
152
153void
154print_node (FILE *file, const char *prefix, tree node, int indent)
155{
156 int hash;
157 struct bucket *b;
158 enum machine_mode mode;
159 char class;
160 int len;
161 int first_rtl;
162 int i;
163
164 if (node == 0)
165 return;
166
167 class = TREE_CODE_CLASS (TREE_CODE (node));
168
169 /* Don't get too deep in nesting. If the user wants to see deeper,
170 it is easy to use the address of a lowest-level node
171 as an argument in another call to debug_tree. */
172
173 if (indent > 24)
174 {
175 print_node_brief (file, prefix, node, indent);
176 return;
177 }
178
179 if (indent > 8 && (class == 't' || class == 'd'))
180 {
181 print_node_brief (file, prefix, node, indent);
182 return;
183 }
184
185 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
186 if (TREE_CODE (node) == ERROR_MARK)
187 {
--- 7 unchanged lines hidden (view full) ---
195 for (b = table[hash]; b; b = b->next)
196 if (b->node == node)
197 {
198 print_node_brief (file, prefix, node, indent);
199 return;
200 }
201
202 /* Add this node to the table. */
203 b = xmalloc (sizeof (struct bucket));
204 b->node = node;
205 b->next = table[hash];
206 table[hash] = b;
207
208 /* Indent to the specified column, since this is the long form. */
209 indent_to (file, indent);
210
211 /* Print the slot this node is in, and its code, and address. */
212 fprintf (file, "%s <%s " HOST_PTR_PRINTF,
213 prefix, tree_code_name[(int) TREE_CODE (node)], (void *) node);
214
215 /* Print the name, if any. */
216 if (class == 'd')
217 {
218 if (DECL_NAME (node))
219 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
220 }
221 else if (class == 't')
222 {
223 if (TYPE_NAME (node))
224 {
225 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
226 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
227 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
228 && DECL_NAME (TYPE_NAME (node)))
229 fprintf (file, " %s",
--- 10 unchanged lines hidden (view full) ---
240 }
241 else
242 {
243 print_node (file, "type", TREE_TYPE (node), indent + 4);
244 if (TREE_TYPE (node))
245 indent_to (file, indent + 3);
246 }
247
248 if (TREE_SIDE_EFFECTS (node))
249 fputs (" side-effects", file);
250 if (TREE_READONLY (node))
251 fputs (" readonly", file);
252 if (TREE_CONSTANT (node))
253 fputs (" constant", file);
254 if (TREE_ADDRESSABLE (node))
255 fputs (" addressable", file);
256 if (TREE_THIS_VOLATILE (node))
257 fputs (" volatile", file);
258 if (TREE_UNSIGNED (node))
259 fputs (" unsigned", file);
260 if (TREE_ASM_WRITTEN (node))
261 fputs (" asm_written", file);
262 if (TREE_USED (node))
263 fputs (" used", file);
264 if (TREE_NOTHROW (node))
265 fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
266 if (TREE_PUBLIC (node))
267 fputs (" public", file);
268 if (TREE_PRIVATE (node))
269 fputs (" private", file);
270 if (TREE_PROTECTED (node))
271 fputs (" protected", file);
272 if (TREE_STATIC (node))
273 fputs (" static", file);
274 if (TREE_DEPRECATED (node))
275 fputs (" deprecated", file);
276 if (TREE_LANG_FLAG_0 (node))
277 fputs (" tree_0", file);
278 if (TREE_LANG_FLAG_1 (node))
279 fputs (" tree_1", file);
280 if (TREE_LANG_FLAG_2 (node))
281 fputs (" tree_2", file);
282 if (TREE_LANG_FLAG_3 (node))
283 fputs (" tree_3", file);
284 if (TREE_LANG_FLAG_4 (node))
285 fputs (" tree_4", file);
286 if (TREE_LANG_FLAG_5 (node))
287 fputs (" tree_5", file);
288 if (TREE_LANG_FLAG_6 (node))
289 fputs (" tree_6", file);
290
291 /* DECL_ nodes have additional attributes. */
292
293 switch (TREE_CODE_CLASS (TREE_CODE (node)))
294 {
295 case 'd':
296 mode = DECL_MODE (node);
297
298 if (DECL_IGNORED_P (node))
299 fputs (" ignored", file);
300 if (DECL_ABSTRACT (node))
301 fputs (" abstract", file);
302 if (DECL_IN_SYSTEM_HEADER (node))
303 fputs (" in_system_header", file);
304 if (DECL_COMMON (node))
305 fputs (" common", file);
306 if (DECL_EXTERNAL (node))
307 fputs (" external", file);
308 if (DECL_WEAK (node))
309 fputs (" weak", file);
310 if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
311 && TREE_CODE (node) != FUNCTION_DECL
312 && TREE_CODE (node) != LABEL_DECL)
313 fputs (" regdecl", file);
314 if (DECL_NONLOCAL (node))
315 fputs (" nonlocal", file);
316
317 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
318 fputs (" suppress-debug", file);
319
320 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
321 fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file);
322 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
323 fputs (" built-in", file);
324 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
325 fputs (" no-static-chain", file);
326
327 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
328 fputs (" packed", file);
329 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
330 fputs (" bit-field", file);
331 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
332 fputs (" nonaddressable", file);
333
334 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
335 fputs (" too-late", file);
336 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
337 fputs (" error-issued", file);
338
339 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
340 fputs (" in-text-section", file);
341 if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
342 fputs (" thread-local", file);
343
344 if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
345 fputs (" transparent-union", file);
346
347 if (DECL_VIRTUAL_P (node))
348 fputs (" virtual", file);
349 if (DECL_DEFER_OUTPUT (node))
350 fputs (" defer-output", file);
351
352 if (DECL_LANG_FLAG_0 (node))
353 fputs (" decl_0", file);
354 if (DECL_LANG_FLAG_1 (node))
355 fputs (" decl_1", file);
356 if (DECL_LANG_FLAG_2 (node))
357 fputs (" decl_2", file);
358 if (DECL_LANG_FLAG_3 (node))
359 fputs (" decl_3", file);
360 if (DECL_LANG_FLAG_4 (node))
361 fputs (" decl_4", file);
362 if (DECL_LANG_FLAG_5 (node))
363 fputs (" decl_5", file);
364 if (DECL_LANG_FLAG_6 (node))
365 fputs (" decl_6", file);
366 if (DECL_LANG_FLAG_7 (node))
367 fputs (" decl_7", file);
368
369 fprintf (file, " %s", GET_MODE_NAME (mode));
370 fprintf (file, " file %s line %d",
371 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
372
373 print_node (file, "size", DECL_SIZE (node), indent + 4);
374 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
375
376 if (TREE_CODE (node) != FUNCTION_DECL
377 || DECL_INLINE (node) || DECL_BUILT_IN (node))
378 indent_to (file, indent + 3);
379
380 if (TREE_CODE (node) != FUNCTION_DECL)
381 {
382 if (DECL_USER_ALIGN (node))
383 fprintf (file, " user");
384
385 fprintf (file, " align %d", DECL_ALIGN (node));
386 if (TREE_CODE (node) == FIELD_DECL)
387 fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
388 DECL_OFFSET_ALIGN (node));
389 }
390 else if (DECL_BUILT_IN (node))
391 {
392 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
393 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
394 else
395 fprintf (file, " built-in %s:%s",
396 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
397 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
398 }
399
400 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
401 fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
402 DECL_POINTER_ALIAS_SET (node));
403
404 if (TREE_CODE (node) == FIELD_DECL)
405 {
406 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
407 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
408 indent + 4);
409 }
410
411 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
412 print_node_brief (file, "attributes",
413 DECL_ATTRIBUTES (node), indent + 4);
414 print_node_brief (file, "abstract_origin",
415 DECL_ABSTRACT_ORIGIN (node), indent + 4);
416
417 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
418 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
419 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
420
421 (*lang_hooks.print_decl) (file, node, indent);
422
423 if (DECL_RTL_SET_P (node))
424 {
425 indent_to (file, indent + 4);
426 print_rtl (file, DECL_RTL (node));
427 }
428
429 if (TREE_CODE (node) == PARM_DECL)
430 {
431 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
432 print_node (file, "arg-type-as-written",
433 DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
434
435 if (DECL_INCOMING_RTL (node) != 0)
436 {
437 indent_to (file, indent + 4);
438 fprintf (file, "incoming-rtl ");
439 print_rtl (file, DECL_INCOMING_RTL (node));
440 }
441 }
442 else if (TREE_CODE (node) == FUNCTION_DECL
443 && DECL_SAVED_INSNS (node) != 0)
444 {
445 indent_to (file, indent + 4);
446 fprintf (file, "saved-insns " HOST_PTR_PRINTF,
447 (void *) DECL_SAVED_INSNS (node));
448 }
449
450 /* Print the decl chain only if decl is at second level. */
451 if (indent == 4)
452 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
453 else
454 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
455 break;
456
457 case 't':
458 /* The no-force-blk flag is used for different things in
459 different types. */
460 if ((TREE_CODE (node) == RECORD_TYPE
461 || TREE_CODE (node) == UNION_TYPE
462 || TREE_CODE (node) == QUAL_UNION_TYPE)
463 && TYPE_NO_FORCE_BLK (node))
464 fputs (" no-force-blk", file);
465 else if (TREE_CODE (node) == INTEGER_TYPE
--- 57 unchanged lines hidden (view full) ---
523 {
524 fprintf (file, " precision %d", TYPE_PRECISION (node));
525 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
526 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
527 }
528
529 if (TREE_CODE (node) == ENUMERAL_TYPE)
530 print_node (file, "values", TYPE_VALUES (node), indent + 4);
531 else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
532 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
533 else if (TREE_CODE (node) == RECORD_TYPE
534 || TREE_CODE (node) == UNION_TYPE
535 || TREE_CODE (node) == QUAL_UNION_TYPE)
536 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
537 else if (TREE_CODE (node) == FUNCTION_TYPE
538 || TREE_CODE (node) == METHOD_TYPE)
539 {
540 if (TYPE_METHOD_BASETYPE (node))
541 print_node_brief (file, "method basetype",
542 TYPE_METHOD_BASETYPE (node), indent + 4);
543 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
544 }
545 else if (TREE_CODE (node) == OFFSET_TYPE)
546 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
547 indent + 4);
548
549 if (TYPE_CONTEXT (node))
550 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
551
552 (*lang_hooks.print_type) (file, node, indent);
553
554 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
555 indent_to (file, indent + 3);
556
557 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
558 indent + 4);
559 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
560 indent + 4);
561 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
562 break;
563
564 case 'b':
565 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
566 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
567 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
568 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
569 print_node (file, "abstract_origin",
570 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
571 break;
572
573 case 'e':
574 case '<':
575 case '1':
576 case '2':
577 case 'r':
578 case 's':
579 if (TREE_CODE (node) == BIND_EXPR)
580 {
581 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
582 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
583 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
584 break;
585 }
586
587 len = TREE_CODE_LENGTH (TREE_CODE (node));
588
589 /* Some nodes contain rtx's, not trees,
590 after a certain point. Print the rtx's as rtx's. */
591 first_rtl = first_rtl_op (TREE_CODE (node));
592
593 for (i = 0; i < len; i++)
594 {
595 if (i >= first_rtl)
596 {
597 indent_to (file, indent + 4);
598 fprintf (file, "rtl %d ", i);
599 if (TREE_OPERAND (node, i))
600 print_rtl (file, (rtx) TREE_OPERAND (node, i));
601 else
602 fprintf (file, "(nil)");
603 fprintf (file, "\n");
604 }
605 else
606 {
607 char temp[10];
608
609 sprintf (temp, "arg %d", i);
610 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
611 }
612 }
613
614 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
615 {
616 indent_to (file, indent+4);
617 fprintf (file, "%s:%d:%d",
618 (EXPR_WFL_FILENAME_NODE (node ) ?
619 EXPR_WFL_FILENAME (node) : "(no file info)"),
620 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
621 }
622 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
623 break;
624
625 case 'c':
626 case 'x':
627 switch (TREE_CODE (node))
628 {
629 case INTEGER_CST:
630 if (TREE_CONSTANT_OVERFLOW (node))
631 fprintf (file, " overflow");
632
633 fprintf (file, " ");
634 if (TREE_INT_CST_HIGH (node) == 0)
--- 12 unchanged lines hidden (view full) ---
647 {
648 REAL_VALUE_TYPE d;
649
650 if (TREE_OVERFLOW (node))
651 fprintf (file, " overflow");
652
653 d = TREE_REAL_CST (node);
654 if (REAL_VALUE_ISINF (d))
655 fprintf (file, " Inf");
656 else if (REAL_VALUE_ISNAN (d))
657 fprintf (file, " Nan");
658 else
659 {
660 char string[64];
661 real_to_decimal (string, &d, sizeof (string), 0, 1);
662 fprintf (file, " %s", string);
663 }
--- 39 unchanged lines hidden (view full) ---
703 /* Print the chain at second level. */
704 if (indent == 4)
705 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
706 else
707 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
708 break;
709
710 case IDENTIFIER_NODE:
711 (*lang_hooks.print_identifier) (file, node, indent);
712 break;
713
714 case TREE_LIST:
715 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
716 print_node (file, "value", TREE_VALUE (node), indent + 4);
717 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
718 break;
719
--- 4 unchanged lines hidden (view full) ---
724 {
725 char temp[10];
726 sprintf (temp, "elt %d", i);
727 indent_to (file, indent + 4);
728 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
729 }
730 break;
731
732 default:
733 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
734 (*lang_hooks.print_xnode) (file, node, indent);
735 break;
736 }
737
738 break;
739 }
740
741 fprintf (file, ">");
742}
2 Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 2, or (at your option) any later
10version.
11
12GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13WARRANTY; without even the implied warranty of MERCHANTABILITY or
14FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING. If not, write to the Free
19Software Foundation, 59 Temple Place - Suite 330, Boston, MA
2002111-1307, USA. */
21
22
23#include "config.h"
24#include "system.h"
25#include "coretypes.h"
26#include "tm.h"
27#include "tree.h"
28#include "real.h"
29#include "ggc.h"
30#include "langhooks.h"
31
32/* Define the hash table of nodes already seen.
33 Such nodes are not repeated; brief cross-references are used. */
34
35#define HASH_SIZE 37
36
37struct bucket
38{
--- 5 unchanged lines hidden (view full) ---
44
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. */
48
49void
50debug_tree (tree node)
51{
52 table = xcalloc (HASH_SIZE, sizeof (struct bucket *));
53 print_node (stderr, "", node, 0);
54 free (table);
55 table = 0;
56 putc ('\n', stderr);
57}
58
59/* Print a node in brief fashion, with just the code, address and name. */
60
61void
62print_node_brief (FILE *file, const char *prefix, tree node, int indent)
63{
64 char class;
65
66 if (node == 0)
67 return;
68
69 class = TREE_CODE_CLASS (TREE_CODE (node));
70
71 /* Always print the slot this node is in, and its code, address and
72 name if any. */
73 if (indent > 0)
74 fprintf (file, " ");
75 fprintf (file, "%s <%s " HOST_PTR_PRINTF,
76 prefix, tree_code_name[(int) TREE_CODE (node)], (char *) node);
77
78 if (class == 'd')
79 {
80 if (DECL_NAME (node))
81 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
82 }
83 else if (class == 't')
84 {
85 if (TYPE_NAME (node))
86 {
87 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
88 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
89 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
90 && DECL_NAME (TYPE_NAME (node)))
91 fprintf (file, " %s",
--- 24 unchanged lines hidden (view full) ---
116 {
117 REAL_VALUE_TYPE d;
118
119 if (TREE_OVERFLOW (node))
120 fprintf (file, " overflow");
121
122 d = TREE_REAL_CST (node);
123 if (REAL_VALUE_ISINF (d))
124 fprintf (file, " Inf");
125 else if (REAL_VALUE_ISNAN (d))
126 fprintf (file, " Nan");
127 else
128 {
129 char string[60];
130 real_to_decimal (string, &d, sizeof (string), 0, 1);
131 fprintf (file, " %s", string);
132 }
--- 18 unchanged lines hidden (view full) ---
151 starting in column INDENT. */
152
153void
154print_node (FILE *file, const char *prefix, tree node, int indent)
155{
156 int hash;
157 struct bucket *b;
158 enum machine_mode mode;
159 char class;
160 int len;
161 int first_rtl;
162 int i;
163
164 if (node == 0)
165 return;
166
167 class = TREE_CODE_CLASS (TREE_CODE (node));
168
169 /* Don't get too deep in nesting. If the user wants to see deeper,
170 it is easy to use the address of a lowest-level node
171 as an argument in another call to debug_tree. */
172
173 if (indent > 24)
174 {
175 print_node_brief (file, prefix, node, indent);
176 return;
177 }
178
179 if (indent > 8 && (class == 't' || class == 'd'))
180 {
181 print_node_brief (file, prefix, node, indent);
182 return;
183 }
184
185 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
186 if (TREE_CODE (node) == ERROR_MARK)
187 {
--- 7 unchanged lines hidden (view full) ---
195 for (b = table[hash]; b; b = b->next)
196 if (b->node == node)
197 {
198 print_node_brief (file, prefix, node, indent);
199 return;
200 }
201
202 /* Add this node to the table. */
203 b = xmalloc (sizeof (struct bucket));
204 b->node = node;
205 b->next = table[hash];
206 table[hash] = b;
207
208 /* Indent to the specified column, since this is the long form. */
209 indent_to (file, indent);
210
211 /* Print the slot this node is in, and its code, and address. */
212 fprintf (file, "%s <%s " HOST_PTR_PRINTF,
213 prefix, tree_code_name[(int) TREE_CODE (node)], (void *) node);
214
215 /* Print the name, if any. */
216 if (class == 'd')
217 {
218 if (DECL_NAME (node))
219 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
220 }
221 else if (class == 't')
222 {
223 if (TYPE_NAME (node))
224 {
225 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
226 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
227 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
228 && DECL_NAME (TYPE_NAME (node)))
229 fprintf (file, " %s",
--- 10 unchanged lines hidden (view full) ---
240 }
241 else
242 {
243 print_node (file, "type", TREE_TYPE (node), indent + 4);
244 if (TREE_TYPE (node))
245 indent_to (file, indent + 3);
246 }
247
248 if (TREE_SIDE_EFFECTS (node))
249 fputs (" side-effects", file);
250 if (TREE_READONLY (node))
251 fputs (" readonly", file);
252 if (TREE_CONSTANT (node))
253 fputs (" constant", file);
254 if (TREE_ADDRESSABLE (node))
255 fputs (" addressable", file);
256 if (TREE_THIS_VOLATILE (node))
257 fputs (" volatile", file);
258 if (TREE_UNSIGNED (node))
259 fputs (" unsigned", file);
260 if (TREE_ASM_WRITTEN (node))
261 fputs (" asm_written", file);
262 if (TREE_USED (node))
263 fputs (" used", file);
264 if (TREE_NOTHROW (node))
265 fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
266 if (TREE_PUBLIC (node))
267 fputs (" public", file);
268 if (TREE_PRIVATE (node))
269 fputs (" private", file);
270 if (TREE_PROTECTED (node))
271 fputs (" protected", file);
272 if (TREE_STATIC (node))
273 fputs (" static", file);
274 if (TREE_DEPRECATED (node))
275 fputs (" deprecated", file);
276 if (TREE_LANG_FLAG_0 (node))
277 fputs (" tree_0", file);
278 if (TREE_LANG_FLAG_1 (node))
279 fputs (" tree_1", file);
280 if (TREE_LANG_FLAG_2 (node))
281 fputs (" tree_2", file);
282 if (TREE_LANG_FLAG_3 (node))
283 fputs (" tree_3", file);
284 if (TREE_LANG_FLAG_4 (node))
285 fputs (" tree_4", file);
286 if (TREE_LANG_FLAG_5 (node))
287 fputs (" tree_5", file);
288 if (TREE_LANG_FLAG_6 (node))
289 fputs (" tree_6", file);
290
291 /* DECL_ nodes have additional attributes. */
292
293 switch (TREE_CODE_CLASS (TREE_CODE (node)))
294 {
295 case 'd':
296 mode = DECL_MODE (node);
297
298 if (DECL_IGNORED_P (node))
299 fputs (" ignored", file);
300 if (DECL_ABSTRACT (node))
301 fputs (" abstract", file);
302 if (DECL_IN_SYSTEM_HEADER (node))
303 fputs (" in_system_header", file);
304 if (DECL_COMMON (node))
305 fputs (" common", file);
306 if (DECL_EXTERNAL (node))
307 fputs (" external", file);
308 if (DECL_WEAK (node))
309 fputs (" weak", file);
310 if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
311 && TREE_CODE (node) != FUNCTION_DECL
312 && TREE_CODE (node) != LABEL_DECL)
313 fputs (" regdecl", file);
314 if (DECL_NONLOCAL (node))
315 fputs (" nonlocal", file);
316
317 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
318 fputs (" suppress-debug", file);
319
320 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
321 fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file);
322 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
323 fputs (" built-in", file);
324 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
325 fputs (" no-static-chain", file);
326
327 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
328 fputs (" packed", file);
329 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
330 fputs (" bit-field", file);
331 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
332 fputs (" nonaddressable", file);
333
334 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
335 fputs (" too-late", file);
336 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
337 fputs (" error-issued", file);
338
339 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
340 fputs (" in-text-section", file);
341 if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
342 fputs (" thread-local", file);
343
344 if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
345 fputs (" transparent-union", file);
346
347 if (DECL_VIRTUAL_P (node))
348 fputs (" virtual", file);
349 if (DECL_DEFER_OUTPUT (node))
350 fputs (" defer-output", file);
351
352 if (DECL_LANG_FLAG_0 (node))
353 fputs (" decl_0", file);
354 if (DECL_LANG_FLAG_1 (node))
355 fputs (" decl_1", file);
356 if (DECL_LANG_FLAG_2 (node))
357 fputs (" decl_2", file);
358 if (DECL_LANG_FLAG_3 (node))
359 fputs (" decl_3", file);
360 if (DECL_LANG_FLAG_4 (node))
361 fputs (" decl_4", file);
362 if (DECL_LANG_FLAG_5 (node))
363 fputs (" decl_5", file);
364 if (DECL_LANG_FLAG_6 (node))
365 fputs (" decl_6", file);
366 if (DECL_LANG_FLAG_7 (node))
367 fputs (" decl_7", file);
368
369 fprintf (file, " %s", GET_MODE_NAME (mode));
370 fprintf (file, " file %s line %d",
371 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
372
373 print_node (file, "size", DECL_SIZE (node), indent + 4);
374 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
375
376 if (TREE_CODE (node) != FUNCTION_DECL
377 || DECL_INLINE (node) || DECL_BUILT_IN (node))
378 indent_to (file, indent + 3);
379
380 if (TREE_CODE (node) != FUNCTION_DECL)
381 {
382 if (DECL_USER_ALIGN (node))
383 fprintf (file, " user");
384
385 fprintf (file, " align %d", DECL_ALIGN (node));
386 if (TREE_CODE (node) == FIELD_DECL)
387 fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
388 DECL_OFFSET_ALIGN (node));
389 }
390 else if (DECL_BUILT_IN (node))
391 {
392 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
393 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
394 else
395 fprintf (file, " built-in %s:%s",
396 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
397 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
398 }
399
400 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
401 fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
402 DECL_POINTER_ALIAS_SET (node));
403
404 if (TREE_CODE (node) == FIELD_DECL)
405 {
406 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
407 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
408 indent + 4);
409 }
410
411 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
412 print_node_brief (file, "attributes",
413 DECL_ATTRIBUTES (node), indent + 4);
414 print_node_brief (file, "abstract_origin",
415 DECL_ABSTRACT_ORIGIN (node), indent + 4);
416
417 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
418 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
419 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
420
421 (*lang_hooks.print_decl) (file, node, indent);
422
423 if (DECL_RTL_SET_P (node))
424 {
425 indent_to (file, indent + 4);
426 print_rtl (file, DECL_RTL (node));
427 }
428
429 if (TREE_CODE (node) == PARM_DECL)
430 {
431 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
432 print_node (file, "arg-type-as-written",
433 DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
434
435 if (DECL_INCOMING_RTL (node) != 0)
436 {
437 indent_to (file, indent + 4);
438 fprintf (file, "incoming-rtl ");
439 print_rtl (file, DECL_INCOMING_RTL (node));
440 }
441 }
442 else if (TREE_CODE (node) == FUNCTION_DECL
443 && DECL_SAVED_INSNS (node) != 0)
444 {
445 indent_to (file, indent + 4);
446 fprintf (file, "saved-insns " HOST_PTR_PRINTF,
447 (void *) DECL_SAVED_INSNS (node));
448 }
449
450 /* Print the decl chain only if decl is at second level. */
451 if (indent == 4)
452 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
453 else
454 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
455 break;
456
457 case 't':
458 /* The no-force-blk flag is used for different things in
459 different types. */
460 if ((TREE_CODE (node) == RECORD_TYPE
461 || TREE_CODE (node) == UNION_TYPE
462 || TREE_CODE (node) == QUAL_UNION_TYPE)
463 && TYPE_NO_FORCE_BLK (node))
464 fputs (" no-force-blk", file);
465 else if (TREE_CODE (node) == INTEGER_TYPE
--- 57 unchanged lines hidden (view full) ---
523 {
524 fprintf (file, " precision %d", TYPE_PRECISION (node));
525 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
526 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
527 }
528
529 if (TREE_CODE (node) == ENUMERAL_TYPE)
530 print_node (file, "values", TYPE_VALUES (node), indent + 4);
531 else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
532 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
533 else if (TREE_CODE (node) == RECORD_TYPE
534 || TREE_CODE (node) == UNION_TYPE
535 || TREE_CODE (node) == QUAL_UNION_TYPE)
536 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
537 else if (TREE_CODE (node) == FUNCTION_TYPE
538 || TREE_CODE (node) == METHOD_TYPE)
539 {
540 if (TYPE_METHOD_BASETYPE (node))
541 print_node_brief (file, "method basetype",
542 TYPE_METHOD_BASETYPE (node), indent + 4);
543 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
544 }
545 else if (TREE_CODE (node) == OFFSET_TYPE)
546 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
547 indent + 4);
548
549 if (TYPE_CONTEXT (node))
550 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
551
552 (*lang_hooks.print_type) (file, node, indent);
553
554 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
555 indent_to (file, indent + 3);
556
557 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
558 indent + 4);
559 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
560 indent + 4);
561 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
562 break;
563
564 case 'b':
565 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
566 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
567 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
568 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
569 print_node (file, "abstract_origin",
570 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
571 break;
572
573 case 'e':
574 case '<':
575 case '1':
576 case '2':
577 case 'r':
578 case 's':
579 if (TREE_CODE (node) == BIND_EXPR)
580 {
581 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
582 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
583 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
584 break;
585 }
586
587 len = TREE_CODE_LENGTH (TREE_CODE (node));
588
589 /* Some nodes contain rtx's, not trees,
590 after a certain point. Print the rtx's as rtx's. */
591 first_rtl = first_rtl_op (TREE_CODE (node));
592
593 for (i = 0; i < len; i++)
594 {
595 if (i >= first_rtl)
596 {
597 indent_to (file, indent + 4);
598 fprintf (file, "rtl %d ", i);
599 if (TREE_OPERAND (node, i))
600 print_rtl (file, (rtx) TREE_OPERAND (node, i));
601 else
602 fprintf (file, "(nil)");
603 fprintf (file, "\n");
604 }
605 else
606 {
607 char temp[10];
608
609 sprintf (temp, "arg %d", i);
610 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
611 }
612 }
613
614 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
615 {
616 indent_to (file, indent+4);
617 fprintf (file, "%s:%d:%d",
618 (EXPR_WFL_FILENAME_NODE (node ) ?
619 EXPR_WFL_FILENAME (node) : "(no file info)"),
620 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
621 }
622 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
623 break;
624
625 case 'c':
626 case 'x':
627 switch (TREE_CODE (node))
628 {
629 case INTEGER_CST:
630 if (TREE_CONSTANT_OVERFLOW (node))
631 fprintf (file, " overflow");
632
633 fprintf (file, " ");
634 if (TREE_INT_CST_HIGH (node) == 0)
--- 12 unchanged lines hidden (view full) ---
647 {
648 REAL_VALUE_TYPE d;
649
650 if (TREE_OVERFLOW (node))
651 fprintf (file, " overflow");
652
653 d = TREE_REAL_CST (node);
654 if (REAL_VALUE_ISINF (d))
655 fprintf (file, " Inf");
656 else if (REAL_VALUE_ISNAN (d))
657 fprintf (file, " Nan");
658 else
659 {
660 char string[64];
661 real_to_decimal (string, &d, sizeof (string), 0, 1);
662 fprintf (file, " %s", string);
663 }
--- 39 unchanged lines hidden (view full) ---
703 /* Print the chain at second level. */
704 if (indent == 4)
705 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
706 else
707 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
708 break;
709
710 case IDENTIFIER_NODE:
711 (*lang_hooks.print_identifier) (file, node, indent);
712 break;
713
714 case TREE_LIST:
715 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
716 print_node (file, "value", TREE_VALUE (node), indent + 4);
717 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
718 break;
719
--- 4 unchanged lines hidden (view full) ---
724 {
725 char temp[10];
726 sprintf (temp, "elt %d", i);
727 indent_to (file, indent + 4);
728 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
729 }
730 break;
731
732 default:
733 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
734 (*lang_hooks.print_xnode) (file, node, indent);
735 break;
736 }
737
738 break;
739 }
740
741 fprintf (file, ">");
742}