Update copyright.
[official-gcc.git] / gcc / print-tree.c
blob914ffcb3fcc73e7c311c6750485894ea73996e55
1 /* Prints out tree in human readable form - GNU C-compiler
2 Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002 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 2, 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 COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
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"
32 /* Define the hash table of nodes already seen.
33 Such nodes are not repeated; brief cross-references are used. */
35 #define HASH_SIZE 37
37 struct bucket
39 tree node;
40 struct bucket *next;
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. */
49 void
50 debug_tree (node)
51 tree node;
53 table = (struct bucket **) xcalloc (HASH_SIZE, sizeof (struct bucket *));
54 print_node (stderr, "", node, 0);
55 table = 0;
56 fprintf (stderr, "\n");
59 /* Print a node in brief fashion, with just the code, address and name. */
61 void
62 print_node_brief (file, prefix, node, indent)
63 FILE *file;
64 const char *prefix;
65 tree node;
66 int indent;
68 char class;
70 if (node == 0)
71 return;
73 class = TREE_CODE_CLASS (TREE_CODE (node));
75 /* Always print the slot this node is in, and its code, address and
76 name if any. */
77 if (indent > 0)
78 fprintf (file, " ");
79 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
80 fprintf (file, HOST_PTR_PRINTF, (char *) node);
82 if (class == 'd')
84 if (DECL_NAME (node))
85 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
87 else if (class == 't')
89 if (TYPE_NAME (node))
91 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
92 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
93 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
94 && DECL_NAME (TYPE_NAME (node)))
95 fprintf (file, " %s",
96 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
99 if (TREE_CODE (node) == IDENTIFIER_NODE)
100 fprintf (file, " %s", IDENTIFIER_POINTER (node));
102 /* We might as well always print the value of an integer or real. */
103 if (TREE_CODE (node) == INTEGER_CST)
105 if (TREE_CONSTANT_OVERFLOW (node))
106 fprintf (file, " overflow");
108 fprintf (file, " ");
109 if (TREE_INT_CST_HIGH (node) == 0)
110 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
111 else if (TREE_INT_CST_HIGH (node) == -1
112 && TREE_INT_CST_LOW (node) != 0)
114 fprintf (file, "-");
115 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
116 -TREE_INT_CST_LOW (node));
118 else
119 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
120 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
122 if (TREE_CODE (node) == REAL_CST)
124 REAL_VALUE_TYPE d;
126 if (TREE_OVERFLOW (node))
127 fprintf (file, " overflow");
129 d = TREE_REAL_CST (node);
130 if (REAL_VALUE_ISINF (d))
131 fprintf (file, " Inf");
132 else if (REAL_VALUE_ISNAN (d))
133 fprintf (file, " Nan");
134 else
136 char string[60];
137 real_to_decimal (string, &d, sizeof (string), 0, 1);
138 fprintf (file, " %s", string);
142 fprintf (file, ">");
145 void
146 indent_to (file, column)
147 FILE *file;
148 int column;
150 int i;
152 /* Since this is the long way, indent to desired column. */
153 if (column > 0)
154 fprintf (file, "\n");
155 for (i = 0; i < column; i++)
156 fprintf (file, " ");
159 /* Print the node NODE in full on file FILE, preceded by PREFIX,
160 starting in column INDENT. */
162 void
163 print_node (file, prefix, node, indent)
164 FILE *file;
165 const char *prefix;
166 tree node;
167 int indent;
169 int hash;
170 struct bucket *b;
171 enum machine_mode mode;
172 char class;
173 int len;
174 int first_rtl;
175 int i;
177 if (node == 0)
178 return;
180 class = TREE_CODE_CLASS (TREE_CODE (node));
182 /* Don't get too deep in nesting. If the user wants to see deeper,
183 it is easy to use the address of a lowest-level node
184 as an argument in another call to debug_tree. */
186 if (indent > 24)
188 print_node_brief (file, prefix, node, indent);
189 return;
192 if (indent > 8 && (class == 't' || class == 'd'))
194 print_node_brief (file, prefix, node, indent);
195 return;
198 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
199 if (TREE_CODE (node) == ERROR_MARK)
201 print_node_brief (file, prefix, node, indent);
202 return;
205 hash = ((unsigned long) node) % HASH_SIZE;
207 /* If node is in the table, just mention its address. */
208 for (b = table[hash]; b; b = b->next)
209 if (b->node == node)
211 print_node_brief (file, prefix, node, indent);
212 return;
215 /* Add this node to the table. */
216 b = (struct bucket *) xmalloc (sizeof (struct bucket));
217 b->node = node;
218 b->next = table[hash];
219 table[hash] = b;
221 /* Indent to the specified column, since this is the long form. */
222 indent_to (file, indent);
224 /* Print the slot this node is in, and its code, and address. */
225 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
226 fprintf (file, HOST_PTR_PRINTF, (char *) node);
228 /* Print the name, if any. */
229 if (class == 'd')
231 if (DECL_NAME (node))
232 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
234 else if (class == 't')
236 if (TYPE_NAME (node))
238 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
239 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
240 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
241 && DECL_NAME (TYPE_NAME (node)))
242 fprintf (file, " %s",
243 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
246 if (TREE_CODE (node) == IDENTIFIER_NODE)
247 fprintf (file, " %s", IDENTIFIER_POINTER (node));
249 if (TREE_CODE (node) == INTEGER_CST)
251 if (indent <= 4)
252 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
254 else
256 print_node (file, "type", TREE_TYPE (node), indent + 4);
257 if (TREE_TYPE (node))
258 indent_to (file, indent + 3);
261 if (TREE_SIDE_EFFECTS (node))
262 fputs (" side-effects", file);
263 if (TREE_READONLY (node))
264 fputs (" readonly", file);
265 if (TREE_CONSTANT (node))
266 fputs (" constant", file);
267 if (TREE_ADDRESSABLE (node))
268 fputs (" addressable", file);
269 if (TREE_THIS_VOLATILE (node))
270 fputs (" volatile", file);
271 if (TREE_UNSIGNED (node))
272 fputs (" unsigned", file);
273 if (TREE_ASM_WRITTEN (node))
274 fputs (" asm_written", file);
275 if (TREE_USED (node))
276 fputs (" used", file);
277 if (TREE_NOTHROW (node))
278 fputs (" nothrow", file);
279 if (TREE_PUBLIC (node))
280 fputs (" public", file);
281 if (TREE_PRIVATE (node))
282 fputs (" private", file);
283 if (TREE_PROTECTED (node))
284 fputs (" protected", file);
285 if (TREE_STATIC (node))
286 fputs (" static", file);
287 if (TREE_DEPRECATED (node))
288 fputs (" deprecated", file);
289 if (TREE_LANG_FLAG_0 (node))
290 fputs (" tree_0", file);
291 if (TREE_LANG_FLAG_1 (node))
292 fputs (" tree_1", file);
293 if (TREE_LANG_FLAG_2 (node))
294 fputs (" tree_2", file);
295 if (TREE_LANG_FLAG_3 (node))
296 fputs (" tree_3", file);
297 if (TREE_LANG_FLAG_4 (node))
298 fputs (" tree_4", file);
299 if (TREE_LANG_FLAG_5 (node))
300 fputs (" tree_5", file);
301 if (TREE_LANG_FLAG_6 (node))
302 fputs (" tree_6", file);
304 /* DECL_ nodes have additional attributes. */
306 switch (TREE_CODE_CLASS (TREE_CODE (node)))
308 case 'd':
309 mode = DECL_MODE (node);
311 if (DECL_IGNORED_P (node))
312 fputs (" ignored", file);
313 if (DECL_ABSTRACT (node))
314 fputs (" abstract", file);
315 if (DECL_IN_SYSTEM_HEADER (node))
316 fputs (" in_system_header", file);
317 if (DECL_COMMON (node))
318 fputs (" common", file);
319 if (DECL_EXTERNAL (node))
320 fputs (" external", file);
321 if (DECL_WEAK (node))
322 fputs (" weak", file);
323 if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
324 && TREE_CODE (node) != FUNCTION_DECL
325 && TREE_CODE (node) != LABEL_DECL)
326 fputs (" regdecl", file);
327 if (DECL_NONLOCAL (node))
328 fputs (" nonlocal", file);
330 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
331 fputs (" suppress-debug", file);
333 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
334 fputs (" inline", file);
335 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
336 fputs (" built-in", file);
337 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN_NONANSI (node))
338 fputs (" built-in-nonansi", file);
339 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
340 fputs (" no-static-chain", file);
342 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
343 fputs (" packed", file);
344 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
345 fputs (" bit-field", file);
346 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
347 fputs (" nonaddressable", file);
349 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
350 fputs (" too-late", file);
351 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
352 fputs (" error-issued", file);
354 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
355 fputs (" in-text-section", file);
356 if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
357 fputs (" thread-local", file);
359 if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
360 fputs (" transparent-union", file);
362 if (DECL_VIRTUAL_P (node))
363 fputs (" virtual", file);
364 if (DECL_DEFER_OUTPUT (node))
365 fputs (" defer-output", file);
367 if (DECL_LANG_FLAG_0 (node))
368 fputs (" decl_0", file);
369 if (DECL_LANG_FLAG_1 (node))
370 fputs (" decl_1", file);
371 if (DECL_LANG_FLAG_2 (node))
372 fputs (" decl_2", file);
373 if (DECL_LANG_FLAG_3 (node))
374 fputs (" decl_3", file);
375 if (DECL_LANG_FLAG_4 (node))
376 fputs (" decl_4", file);
377 if (DECL_LANG_FLAG_5 (node))
378 fputs (" decl_5", file);
379 if (DECL_LANG_FLAG_6 (node))
380 fputs (" decl_6", file);
381 if (DECL_LANG_FLAG_7 (node))
382 fputs (" decl_7", file);
384 fprintf (file, " %s", GET_MODE_NAME (mode));
385 fprintf (file, " file %s line %d",
386 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
388 print_node (file, "size", DECL_SIZE (node), indent + 4);
389 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
391 if (TREE_CODE (node) != FUNCTION_DECL
392 || DECL_INLINE (node) || DECL_BUILT_IN (node))
393 indent_to (file, indent + 3);
395 if (TREE_CODE (node) != FUNCTION_DECL)
397 if (DECL_USER_ALIGN (node))
398 fprintf (file, " user");
400 fprintf (file, " align %d", DECL_ALIGN (node));
401 if (TREE_CODE (node) == FIELD_DECL)
403 fprintf (file, " offset_align ");
404 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
405 DECL_OFFSET_ALIGN (node));
408 else if (DECL_BUILT_IN (node))
410 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
411 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
412 else
413 fprintf (file, " built-in %s:%s",
414 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
415 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
418 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
420 fprintf (file, " alias set ");
421 fprintf (file, HOST_WIDE_INT_PRINT_DEC,
422 DECL_POINTER_ALIAS_SET (node));
425 if (TREE_CODE (node) == FIELD_DECL)
427 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
428 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
429 indent + 4);
432 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
433 print_node_brief (file, "attributes",
434 DECL_ATTRIBUTES (node), indent + 4);
435 print_node_brief (file, "abstract_origin",
436 DECL_ABSTRACT_ORIGIN (node), indent + 4);
438 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
439 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
440 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
442 (*lang_hooks.print_decl) (file, node, indent);
444 if (DECL_RTL_SET_P (node))
446 indent_to (file, indent + 4);
447 print_rtl (file, DECL_RTL (node));
450 if (TREE_CODE (node) == PARM_DECL)
452 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
453 print_node (file, "arg-type-as-written",
454 DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
456 if (DECL_INCOMING_RTL (node) != 0)
458 indent_to (file, indent + 4);
459 fprintf (file, "incoming-rtl ");
460 print_rtl (file, DECL_INCOMING_RTL (node));
463 else if (TREE_CODE (node) == FUNCTION_DECL
464 && DECL_SAVED_INSNS (node) != 0)
466 indent_to (file, indent + 4);
467 fprintf (file, "saved-insns ");
468 fprintf (file, HOST_PTR_PRINTF, (char *) DECL_SAVED_INSNS (node));
471 /* Print the decl chain only if decl is at second level. */
472 if (indent == 4)
473 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
474 else
475 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
476 break;
478 case 't':
479 /* The no-force-blk flag is used for different things in
480 different types. */
481 if ((TREE_CODE (node) == RECORD_TYPE
482 || TREE_CODE (node) == UNION_TYPE
483 || TREE_CODE (node) == QUAL_UNION_TYPE)
484 && TYPE_NO_FORCE_BLK (node))
485 fputs (" no-force-blk", file);
486 else if (TREE_CODE (node) == INTEGER_TYPE
487 && TYPE_IS_SIZETYPE (node))
488 fputs (" sizetype", file);
489 else if (TREE_CODE (node) == FUNCTION_TYPE
490 && TYPE_RETURNS_STACK_DEPRESSED (node))
491 fputs (" returns-stack-depressed", file);
493 if (TYPE_STRING_FLAG (node))
494 fputs (" string-flag", file);
495 if (TYPE_NEEDS_CONSTRUCTING (node))
496 fputs (" needs-constructing", file);
498 /* The transparent-union flag is used for different things in
499 different nodes. */
500 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
501 fputs (" transparent-union", file);
502 else if (TREE_CODE (node) == ARRAY_TYPE
503 && TYPE_NONALIASED_COMPONENT (node))
504 fputs (" nonaliased-component", file);
505 else if (TREE_CODE (node) == FUNCTION_TYPE
506 && TYPE_AMBIENT_BOUNDEDNESS (node))
507 fputs (" ambient-boundedness", file);
509 if (TYPE_PACKED (node))
510 fputs (" packed", file);
512 if (TYPE_RESTRICT (node))
513 fputs (" restrict", file);
515 if (TYPE_LANG_FLAG_0 (node))
516 fputs (" type_0", file);
517 if (TYPE_LANG_FLAG_1 (node))
518 fputs (" type_1", file);
519 if (TYPE_LANG_FLAG_2 (node))
520 fputs (" type_2", file);
521 if (TYPE_LANG_FLAG_3 (node))
522 fputs (" type_3", file);
523 if (TYPE_LANG_FLAG_4 (node))
524 fputs (" type_4", file);
525 if (TYPE_LANG_FLAG_5 (node))
526 fputs (" type_5", file);
527 if (TYPE_LANG_FLAG_6 (node))
528 fputs (" type_6", file);
530 mode = TYPE_MODE (node);
531 fprintf (file, " %s", GET_MODE_NAME (mode));
533 print_node (file, "size", TYPE_SIZE (node), indent + 4);
534 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
535 indent_to (file, indent + 3);
537 if (TYPE_USER_ALIGN (node))
538 fprintf (file, " user");
540 fprintf (file, " align %d", TYPE_ALIGN (node));
541 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
542 fprintf (file, " alias set ");
543 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TYPE_ALIAS_SET (node));
545 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
547 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
549 fprintf (file, " precision %d", TYPE_PRECISION (node));
550 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
551 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
554 if (TREE_CODE (node) == ENUMERAL_TYPE)
555 print_node (file, "values", TYPE_VALUES (node), indent + 4);
556 else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
557 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
558 else if (TREE_CODE (node) == RECORD_TYPE
559 || TREE_CODE (node) == UNION_TYPE
560 || TREE_CODE (node) == QUAL_UNION_TYPE)
561 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
562 else if (TREE_CODE (node) == FUNCTION_TYPE
563 || TREE_CODE (node) == METHOD_TYPE)
565 if (TYPE_METHOD_BASETYPE (node))
566 print_node_brief (file, "method basetype",
567 TYPE_METHOD_BASETYPE (node), indent + 4);
568 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
570 else if (TREE_CODE (node) == OFFSET_TYPE)
571 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
572 indent + 4);
574 if (TYPE_CONTEXT (node))
575 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
577 (*lang_hooks.print_type) (file, node, indent);
579 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
580 indent_to (file, indent + 3);
582 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
583 indent + 4);
584 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
585 indent + 4);
586 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
587 break;
589 case 'b':
590 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
591 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
592 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
593 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
594 print_node (file, "abstract_origin",
595 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
596 break;
598 case 'e':
599 case '<':
600 case '1':
601 case '2':
602 case 'r':
603 case 's':
604 if (TREE_CODE (node) == BIND_EXPR)
606 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
607 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
608 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
609 break;
612 len = TREE_CODE_LENGTH (TREE_CODE (node));
614 /* Some nodes contain rtx's, not trees,
615 after a certain point. Print the rtx's as rtx's. */
616 first_rtl = first_rtl_op (TREE_CODE (node));
618 for (i = 0; i < len; i++)
620 if (i >= first_rtl)
622 indent_to (file, indent + 4);
623 fprintf (file, "rtl %d ", i);
624 if (TREE_OPERAND (node, i))
625 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
626 else
627 fprintf (file, "(nil)");
628 fprintf (file, "\n");
630 else
632 char temp[10];
634 sprintf (temp, "arg %d", i);
635 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
639 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
641 indent_to (file, indent+4);
642 fprintf (file, "%s:%d:%d",
643 (EXPR_WFL_FILENAME_NODE (node ) ?
644 EXPR_WFL_FILENAME (node) : "(no file info)"),
645 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
647 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
648 break;
650 case 'c':
651 case 'x':
652 switch (TREE_CODE (node))
654 case INTEGER_CST:
655 if (TREE_CONSTANT_OVERFLOW (node))
656 fprintf (file, " overflow");
658 fprintf (file, " ");
659 if (TREE_INT_CST_HIGH (node) == 0)
660 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
661 TREE_INT_CST_LOW (node));
662 else if (TREE_INT_CST_HIGH (node) == -1
663 && TREE_INT_CST_LOW (node) != 0)
665 fprintf (file, "-");
666 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
667 -TREE_INT_CST_LOW (node));
669 else
670 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
671 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
672 break;
674 case REAL_CST:
676 REAL_VALUE_TYPE d;
678 if (TREE_OVERFLOW (node))
679 fprintf (file, " overflow");
681 d = TREE_REAL_CST (node);
682 if (REAL_VALUE_ISINF (d))
683 fprintf (file, " Inf");
684 else if (REAL_VALUE_ISNAN (d))
685 fprintf (file, " Nan");
686 else
688 char string[64];
689 real_to_decimal (string, &d, sizeof (string), 0, 1);
690 fprintf (file, " %s", string);
693 break;
695 case VECTOR_CST:
697 tree vals = TREE_VECTOR_CST_ELTS (node);
698 char buf[10];
699 tree link;
700 int i;
702 i = 0;
703 for (link = vals; link; link = TREE_CHAIN (link), ++i)
705 sprintf (buf, "elt%d: ", i);
706 print_node (file, buf, TREE_VALUE (link), indent + 4);
709 break;
711 case COMPLEX_CST:
712 print_node (file, "real", TREE_REALPART (node), indent + 4);
713 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
714 break;
716 case STRING_CST:
718 const char *p = TREE_STRING_POINTER (node);
719 int i = TREE_STRING_LENGTH (node);
720 fputs (" \"", file);
721 while (--i >= 0)
723 char ch = *p++;
724 if (ch >= ' ' && ch < 127)
725 putc (ch, file);
726 else
727 fprintf(file, "\\%03o", ch & 0xFF);
729 fputc ('\"', file);
731 /* Print the chain at second level. */
732 if (indent == 4)
733 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
734 else
735 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
736 break;
738 case IDENTIFIER_NODE:
739 (*lang_hooks.print_identifier) (file, node, indent);
740 break;
742 case TREE_LIST:
743 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
744 print_node (file, "value", TREE_VALUE (node), indent + 4);
745 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
746 break;
748 case TREE_VEC:
749 len = TREE_VEC_LENGTH (node);
750 for (i = 0; i < len; i++)
751 if (TREE_VEC_ELT (node, i))
753 char temp[10];
754 sprintf (temp, "elt %d", i);
755 indent_to (file, indent + 4);
756 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
758 break;
760 default:
761 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
762 (*lang_hooks.print_xnode) (file, node, indent);
763 break;
766 break;
769 fprintf (file, ">");