]>
gcc.gnu.org Git - gcc.git/blob - gcc/print-tree.c
1 /* Prints out tree in human readable form - GNU C-compiler
2 Copyright (C) 1990, 1991 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);
54 table
= (struct bucket
**) oballoc (HASH_SIZE
* sizeof (struct bucket
*));
55 bzero (table
, HASH_SIZE
* sizeof (struct bucket
*));
56 print_node (stderr
, "", node
, 0);
59 fprintf (stderr
, "\n");
62 /* Print a node in brief fashion, with just the code, address and name. */
65 print_node_brief (file
, prefix
, node
, indent
)
76 class = TREE_CODE_CLASS (TREE_CODE (node
));
78 /* Always print the slot this node is in, and its code, address and
82 fprintf (file
, "%s <%s ", prefix
, tree_code_name
[(int) TREE_CODE (node
)]);
83 fprintf (file
, HOST_PTR_PRINTF
, node
);
88 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
90 else if (class == 't')
94 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
95 fprintf (file
, " %s", IDENTIFIER_POINTER (TYPE_NAME (node
)));
96 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
97 && DECL_NAME (TYPE_NAME (node
)))
99 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
102 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
103 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
104 /* We might as well always print the value of an integer. */
105 if (TREE_CODE (node
) == INTEGER_CST
)
107 if (TREE_INT_CST_HIGH (node
) == 0)
108 fprintf (file
, " %1u", TREE_INT_CST_LOW (node
));
109 else if (TREE_INT_CST_HIGH (node
) == -1
110 && TREE_INT_CST_LOW (node
) != 0)
111 fprintf (file
, " -%1u", -TREE_INT_CST_LOW (node
));
114 #if HOST_BITS_PER_WIDE_INT == 64
115 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
121 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
127 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
129 if (TREE_CODE (node
) == REAL_CST
)
131 #ifndef REAL_IS_NOT_DOUBLE
132 fprintf (file
, " %e", TREE_REAL_CST (node
));
136 char *p
= (char *) &TREE_REAL_CST (node
);
137 fprintf (file
, " 0x");
138 for (i
= 0; i
< sizeof TREE_REAL_CST (node
); i
++)
139 fprintf (file
, "%02x", *p
++);
142 #endif /* REAL_IS_NOT_DOUBLE */
149 indent_to (file
, column
)
155 /* Since this is the long way, indent to desired column. */
157 fprintf (file
, "\n");
158 for (i
= 0; i
< column
; i
++)
162 /* Print the node NODE in full on file FILE, preceded by PREFIX,
163 starting in column INDENT. */
166 print_node (file
, prefix
, node
, indent
)
174 enum machine_mode mode
;
183 class = TREE_CODE_CLASS (TREE_CODE (node
));
185 /* Don't get too deep in nesting. If the user wants to see deeper,
186 it is easy to use the address of a lowest-level node
187 as an argument in another call to debug_tree. */
191 print_node_brief (file
, prefix
, node
, indent
);
195 if (indent
> 8 && (class == 't' || class == 'd'))
197 print_node_brief (file
, prefix
, node
, indent
);
201 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
202 if (TREE_CODE (node
) == ERROR_MARK
)
204 print_node_brief (file
, prefix
, node
, indent
);
208 hash
= ((int) node
& ~(1 << (HOST_BITS_PER_INT
- 1))) % HASH_SIZE
;
210 /* If node is in the table, just mention its address. */
211 for (b
= table
[hash
]; b
; b
= b
->next
)
214 print_node_brief (file
, prefix
, node
, indent
);
218 /* Add this node to the table. */
219 b
= (struct bucket
*) oballoc (sizeof (struct bucket
));
221 b
->next
= table
[hash
];
224 /* Indent to the specified column, since this is the long form. */
225 indent_to (file
, indent
);
227 /* Print the slot this node is in, and its code, and address. */
228 fprintf (file
, "%s <%s ", prefix
, tree_code_name
[(int) TREE_CODE (node
)]);
229 fprintf (file
, HOST_PTR_PRINTF
, node
);
231 /* Print the name, if any. */
234 if (DECL_NAME (node
))
235 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
237 else if (class == 't')
239 if (TYPE_NAME (node
))
241 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
242 fprintf (file
, " %s", IDENTIFIER_POINTER (TYPE_NAME (node
)));
243 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
244 && DECL_NAME (TYPE_NAME (node
)))
245 fprintf (file
, " %s",
246 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
249 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
250 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
252 if (TREE_CODE (node
) == INTEGER_CST
)
255 print_node_brief (file
, "type", TREE_TYPE (node
), indent
+ 4);
259 print_node (file
, "type", TREE_TYPE (node
), indent
+ 4);
260 if (TREE_TYPE (node
))
261 indent_to (file
, indent
+ 3);
264 /* If a permanent object is in the wrong obstack, or the reverse, warn. */
265 if (object_permanent_p (node
) != TREE_PERMANENT (node
))
267 if (TREE_PERMANENT (node
))
268 fputs (" !!permanent object in non-permanent obstack!!", file
);
270 fputs (" !!non-permanent object in permanent obstack!!", file
);
271 indent_to (file
, indent
+ 3);
274 if (TREE_SIDE_EFFECTS (node
))
275 fputs (" side-effects", file
);
276 if (TREE_READONLY (node
))
277 fputs (" readonly", file
);
278 if (TREE_CONSTANT (node
))
279 fputs (" constant", file
);
280 if (TREE_ADDRESSABLE (node
))
281 fputs (" addressable", file
);
282 if (TREE_THIS_VOLATILE (node
))
283 fputs (" volatile", file
);
284 if (TREE_UNSIGNED (node
))
285 fputs (" unsigned", file
);
286 if (TREE_ASM_WRITTEN (node
))
287 fputs (" asm_written", file
);
288 if (TREE_USED (node
))
289 fputs (" used", file
);
290 if (TREE_RAISES (node
))
291 fputs (" raises", file
);
292 if (TREE_PERMANENT (node
))
293 fputs (" permanent", file
);
294 if (TREE_PUBLIC (node
))
295 fputs (" public", file
);
296 if (TREE_STATIC (node
))
297 fputs (" static", file
);
298 if (TREE_LANG_FLAG_0 (node
))
299 fputs (" tree_0", file
);
300 if (TREE_LANG_FLAG_1 (node
))
301 fputs (" tree_1", file
);
302 if (TREE_LANG_FLAG_2 (node
))
303 fputs (" tree_2", file
);
304 if (TREE_LANG_FLAG_3 (node
))
305 fputs (" tree_3", file
);
306 if (TREE_LANG_FLAG_4 (node
))
307 fputs (" tree_4", file
);
308 if (TREE_LANG_FLAG_5 (node
))
309 fputs (" tree_5", file
);
310 if (TREE_LANG_FLAG_6 (node
))
311 fputs (" tree_6", file
);
313 /* DECL_ nodes have additional attributes. */
315 switch (TREE_CODE_CLASS (TREE_CODE (node
)))
318 mode
= DECL_MODE (node
);
320 if (DECL_EXTERNAL (node
))
321 fputs (" external", file
);
322 if (DECL_NONLOCAL (node
))
323 fputs (" nonlocal", file
);
324 if (DECL_REGISTER (node
))
325 fputs (" regdecl", file
);
326 if (DECL_INLINE (node
))
327 fputs (" inline", file
);
328 if (DECL_BIT_FIELD (node
))
329 fputs (" bit-field", file
);
330 if (DECL_VIRTUAL_P (node
))
331 fputs (" virtual", file
);
332 if (DECL_IGNORED_P (node
))
333 fputs (" ignored", file
);
334 if (DECL_IN_SYSTEM_HEADER (node
))
335 fputs (" in_system_header", file
);
336 if (DECL_LANG_FLAG_0 (node
))
337 fputs (" decl_0", file
);
338 if (DECL_LANG_FLAG_1 (node
))
339 fputs (" decl_1", file
);
340 if (DECL_LANG_FLAG_2 (node
))
341 fputs (" decl_2", file
);
342 if (DECL_LANG_FLAG_3 (node
))
343 fputs (" decl_3", file
);
344 if (DECL_LANG_FLAG_4 (node
))
345 fputs (" decl_4", file
);
346 if (DECL_LANG_FLAG_5 (node
))
347 fputs (" decl_5", file
);
348 if (DECL_LANG_FLAG_6 (node
))
349 fputs (" decl_6", file
);
350 if (DECL_LANG_FLAG_7 (node
))
351 fputs (" decl_7", file
);
353 fprintf (file
, " %s", mode_name
[(int) mode
]);
355 fprintf (file
, " file %s line %d",
356 DECL_SOURCE_FILE (node
), DECL_SOURCE_LINE (node
));
358 print_node (file
, "size", DECL_SIZE (node
), indent
+ 4);
359 indent_to (file
, indent
+ 3);
360 if (TREE_CODE (node
) != FUNCTION_DECL
)
361 fprintf (file
, " align %d", DECL_ALIGN (node
));
362 else if (DECL_INLINE (node
))
363 fprintf (file
, " frame_size %d", DECL_FRAME_SIZE (node
));
364 else if (DECL_BUILT_IN (node
))
365 fprintf (file
, " built-in code %d", DECL_FUNCTION_CODE (node
));
366 if (TREE_CODE (node
) == FIELD_DECL
)
367 print_node (file
, "bitpos", DECL_FIELD_BITPOS (node
), indent
+ 4);
368 print_node_brief (file
, "context", DECL_CONTEXT (node
), indent
+ 4);
369 print_node_brief (file
, "abstract_origin",
370 DECL_ABSTRACT_ORIGIN (node
), indent
+ 4);
372 print_node (file
, "arguments", DECL_ARGUMENTS (node
), indent
+ 4);
373 print_node (file
, "result", DECL_RESULT (node
), indent
+ 4);
374 print_node_brief (file
, "initial", DECL_INITIAL (node
), indent
+ 4);
376 print_lang_decl (file
, node
, indent
);
378 if (DECL_RTL (node
) != 0)
380 indent_to (file
, indent
+ 4);
381 print_rtl (file
, DECL_RTL (node
));
384 if (DECL_SAVED_INSNS (node
) != 0)
386 indent_to (file
, indent
+ 4);
387 if (TREE_CODE (node
) == PARM_DECL
)
389 fprintf (file
, "incoming-rtl ");
390 print_rtl (file
, DECL_INCOMING_RTL (node
));
392 else if (TREE_CODE (node
) == FUNCTION_DECL
)
394 fprintf (file
, "saved-insns ");
395 fprintf (file
, HOST_PTR_PRINTF
, DECL_SAVED_INSNS (node
));
399 /* Print the decl chain only if decl is at second level. */
401 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
403 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
407 if (TYPE_NO_FORCE_BLK (node
))
408 fputs (" no_force_blk", file
);
409 if (TYPE_LANG_FLAG_0 (node
))
410 fputs (" type_0", file
);
411 if (TYPE_LANG_FLAG_1 (node
))
412 fputs (" type_1", file
);
413 if (TYPE_LANG_FLAG_2 (node
))
414 fputs (" type_2", file
);
415 if (TYPE_LANG_FLAG_3 (node
))
416 fputs (" type_3", file
);
417 if (TYPE_LANG_FLAG_4 (node
))
418 fputs (" type_4", file
);
419 if (TYPE_LANG_FLAG_5 (node
))
420 fputs (" type_5", file
);
421 if (TYPE_LANG_FLAG_6 (node
))
422 fputs (" type_6", file
);
424 mode
= TYPE_MODE (node
);
425 fprintf (file
, " %s", mode_name
[(int) mode
]);
427 print_node (file
, "size", TYPE_SIZE (node
), indent
+ 4);
428 indent_to (file
, indent
+ 3);
430 fprintf (file
, " align %d", TYPE_ALIGN (node
));
431 fprintf (file
, " symtab %d", TYPE_SYMTAB_ADDRESS (node
));
433 if (TREE_CODE (node
) == ARRAY_TYPE
|| TREE_CODE (node
) == SET_TYPE
)
434 print_node (file
, "domain", TYPE_DOMAIN (node
), indent
+ 4);
435 else if (TREE_CODE (node
) == INTEGER_TYPE
)
437 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
438 print_node (file
, "min", TYPE_MIN_VALUE (node
), indent
+ 4);
439 print_node (file
, "max", TYPE_MAX_VALUE (node
), indent
+ 4);
441 else if (TREE_CODE (node
) == ENUMERAL_TYPE
)
443 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
444 print_node (file
, "min", TYPE_MIN_VALUE (node
), indent
+ 4);
445 print_node (file
, "max", TYPE_MAX_VALUE (node
), indent
+ 4);
446 print_node (file
, "values", TYPE_VALUES (node
), indent
+ 4);
448 else if (TREE_CODE (node
) == REAL_TYPE
)
449 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
450 else if (TREE_CODE (node
) == RECORD_TYPE
|| TREE_CODE (node
) == UNION_TYPE
)
451 print_node (file
, "fields", TYPE_FIELDS (node
), indent
+ 4);
452 else if (TREE_CODE (node
) == FUNCTION_TYPE
|| TREE_CODE (node
) == METHOD_TYPE
)
454 if (TYPE_METHOD_BASETYPE (node
))
455 print_node_brief (file
, "method basetype", TYPE_METHOD_BASETYPE (node
), indent
+ 4);
456 print_node (file
, "arg-types", TYPE_ARG_TYPES (node
), indent
+ 4);
458 if (TYPE_CONTEXT (node
))
459 print_node_brief (file
, "context", TYPE_CONTEXT (node
), indent
+ 4);
461 print_lang_type (file
, node
, indent
);
463 if (TYPE_POINTER_TO (node
) || TREE_CHAIN (node
))
464 indent_to (file
, indent
+ 3);
465 print_node_brief (file
, "pointer_to_this", TYPE_POINTER_TO (node
), indent
+ 4);
466 print_node_brief (file
, "reference_to_this", TYPE_REFERENCE_TO (node
), indent
+ 4);
467 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
476 switch (TREE_CODE (node
))
479 print_node (file
, "vars", BLOCK_VARS (node
), indent
+ 4);
480 print_node (file
, "tags", BLOCK_TYPE_TAGS (node
), indent
+ 4);
481 print_node (file
, "supercontext", BLOCK_SUPERCONTEXT (node
), indent
+ 4);
482 print_node (file
, "subblocks", BLOCK_SUBBLOCKS (node
), indent
+ 4);
483 print_node (file
, "chain", BLOCK_CHAIN (node
), indent
+ 4);
487 print_node (file
, "vars", TREE_OPERAND (node
, 0), indent
+ 4);
488 print_node (file
, "body", TREE_OPERAND (node
, 1), indent
+ 4);
489 print_node (file
, "block", TREE_OPERAND (node
, 2), indent
+ 4);
493 first_rtl
= len
= tree_code_length
[(int) TREE_CODE (node
)];
494 /* These kinds of nodes contain rtx's, not trees,
495 after a certain point. Print the rtx's as rtx's. */
496 switch (TREE_CODE (node
))
504 case METHOD_CALL_EXPR
:
507 case WITH_CLEANUP_EXPR
:
508 /* Should be defined to be 2. */
514 for (i
= 0; i
< len
; i
++)
518 indent_to (file
, indent
+ 4);
519 fprintf (file
, "rtl %d ", i
);
520 if (TREE_OPERAND (node
, i
))
521 print_rtl (file
, TREE_OPERAND (node
, i
));
523 fprintf (file
, "(nil)");
524 fprintf (file
, "\n");
530 sprintf (temp
, "arg %d", i
);
531 print_node (file
, temp
, TREE_OPERAND (node
, i
), indent
+ 4);
538 switch (TREE_CODE (node
))
541 if (TREE_INT_CST_HIGH (node
) == 0)
542 fprintf (file
, " %1u", TREE_INT_CST_LOW (node
));
543 else if (TREE_INT_CST_HIGH (node
) == -1
544 && TREE_INT_CST_LOW (node
) != 0)
545 fprintf (file
, " -%1u", -TREE_INT_CST_LOW (node
));
548 #if HOST_BITS_PER_WIDE_INT == 64
549 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
555 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
561 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
565 #ifndef REAL_IS_NOT_DOUBLE
566 fprintf (file
, " %e", TREE_REAL_CST (node
));
569 char *p
= (char *) &TREE_REAL_CST (node
);
570 fprintf (file
, " 0x");
571 for (i
= 0; i
< sizeof TREE_REAL_CST (node
); i
++)
572 fprintf (file
, "%02x", *p
++);
575 #endif /* REAL_IS_NOT_DOUBLE */
579 print_node (file
, "real", TREE_REALPART (node
), indent
+ 4);
580 print_node (file
, "imag", TREE_IMAGPART (node
), indent
+ 4);
584 fprintf (file
, " \"%s\"", TREE_STRING_POINTER (node
));
587 case IDENTIFIER_NODE
:
588 print_lang_identifier (file
, node
, indent
);
592 print_node (file
, "purpose", TREE_PURPOSE (node
), indent
+ 4);
593 print_node (file
, "value", TREE_VALUE (node
), indent
+ 4);
594 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
598 len
= TREE_VEC_LENGTH (node
);
599 for (i
= 0; i
< len
; i
++)
602 sprintf (temp
, "elt %d", i
);
603 indent_to (file
, indent
+ 4);
604 print_node_brief (file
, temp
, TREE_VEC_ELT (node
, i
), 0);
609 print_node (file
, "op1", TREE_PURPOSE (node
), indent
+ 4);
610 print_node (file
, "op2", TREE_VALUE (node
), indent
+ 4);
This page took 0.065931 seconds and 6 git commands to generate.