1/* Prints out tree in human readable form - GNU C-compiler
2 Copyright (C) 1990, 91, 93-97, 1998 Free Software Foundation, Inc.
3
4This file is part of GNU CC.
5
6GNU CC is free software; you can redistribute it and/or modify
7it under the terms of the GNU General Public License as published by
8the Free Software Foundation; either version 2, or (at your option)
9any later version.
10
11GNU CC is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for more details.
15
16You should have received a copy of the GNU General Public License
17along with GNU CC; see the file COPYING. If not, write to
18the Free Software Foundation, 59 Temple Place - Suite 330,
19Boston, MA 02111-1307, USA. */
20
21/* $FreeBSD: head/contrib/gcc/print-tree.c 52521 1999-10-26 09:17:58Z obrien $ */
22
23
24#include "config.h"
25#include "system.h"
26#include "tree.h"
27
28extern char *mode_name[];
29
30void print_node ();
31void indent_to ();
32
33/* Define the hash table of nodes already seen.
34 Such nodes are not repeated; brief cross-references are used. */
35
36#define HASH_SIZE 37
37
38struct bucket
39{
40 tree node;
41 struct bucket *next;
42};
43
44static struct bucket **table;
45
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. */
49
50void
51debug_tree (node)
52 tree node;
53{
54 char *object = (char *) oballoc (0);
55
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);
59 table = 0;
60 obfree (object);
61 fprintf (stderr, "\n");
62}
63
64/* Print a node in brief fashion, with just the code, address and name. */
65
66void
67print_node_brief (file, prefix, node, indent)
68 FILE *file;
69 const char *prefix;
70 tree node;
71 int indent;
72{
73 char class;
74
75 if (node == 0)
76 return;
77
78 class = TREE_CODE_CLASS (TREE_CODE (node));
79
80 /* Always print the slot this node is in, and its code, address and
81 name if any. */
82 if (indent > 0)
83 fprintf (file, " ");
84 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
85 fprintf (file, HOST_PTR_PRINTF, (char *) node);
86
87 if (class == 'd')
88 {
89 if (DECL_NAME (node))
90 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
91 }
92 else if (class == 't')
93 {
94 if (TYPE_NAME (node))
95 {
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))));
102 }
103 }
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)
108 {
109 if (TREE_CONSTANT_OVERFLOW (node))
110 fprintf (file, " overflow");
111
112 fprintf (file, " ");
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)
117 {
118 fprintf (file, "-");
119 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
120 -TREE_INT_CST_LOW (node));
121 }
122 else
123 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
124 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
125 }
126 if (TREE_CODE (node) == REAL_CST)
127 {
128 REAL_VALUE_TYPE d;
129
130 if (TREE_OVERFLOW (node))
131 fprintf (file, " overflow");
132
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");
139 else
140 {
141 char string[100];
142
143 REAL_VALUE_TO_DECIMAL (d, "%e", string);
144 fprintf (file, " %s", string);
145 }
146#else
147 {
148 int i;
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++);
153 fprintf (file, "");
154 }
155#endif
156 }
157
158 fprintf (file, ">");
159}
160
161void
162indent_to (file, column)
163 FILE *file;
164 int column;
165{
166 int i;
167
168 /* Since this is the long way, indent to desired column. */
169 if (column > 0)
170 fprintf (file, "\n");
171 for (i = 0; i < column; i++)
172 fprintf (file, " ");
173}
174
175/* Print the node NODE in full on file FILE, preceded by PREFIX,
176 starting in column INDENT. */
177
178void
179print_node (file, prefix, node, indent)
180 FILE *file;
181 const char *prefix;
182 tree node;
183 int indent;
184{
185 int hash;
186 struct bucket *b;
187 enum machine_mode mode;
188 char class;
189 int len;
190 int first_rtl;
191 int i;
192
193 if (node == 0)
194 return;
195
196 class = TREE_CODE_CLASS (TREE_CODE (node));
197
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. */
201
202 if (indent > 24)
203 {
204 print_node_brief (file, prefix, node, indent);
205 return;
206 }
207
208 if (indent > 8 && (class == 't' || class == 'd'))
209 {
210 print_node_brief (file, prefix, node, indent);
211 return;
212 }
213
214 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
215 if (TREE_CODE (node) == ERROR_MARK)
216 {
217 print_node_brief (file, prefix, node, indent);
218 return;
219 }
220
221 hash = ((unsigned long) node) % HASH_SIZE;
222
223 /* If node is in the table, just mention its address. */
224 for (b = table[hash]; b; b = b->next)
225 if (b->node == node)
226 {
227 print_node_brief (file, prefix, node, indent);
228 return;
229 }
230
231 /* Add this node to the table. */
232 b = (struct bucket *) oballoc (sizeof (struct bucket));
233 b->node = node;
234 b->next = table[hash];
235 table[hash] = b;
236
237 /* Indent to the specified column, since this is the long form. */
238 indent_to (file, indent);
239
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, (char *) node);
243
244 /* Print the name, if any. */
245 if (class == 'd')
246 {
247 if (DECL_NAME (node))
248 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
249 }
250 else if (class == 't')
251 {
252 if (TYPE_NAME (node))
253 {
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))));
260 }
261 }
262 if (TREE_CODE (node) == IDENTIFIER_NODE)
263 fprintf (file, " %s", IDENTIFIER_POINTER (node));
264
265 if (TREE_CODE (node) == INTEGER_CST)
266 {
267 if (indent <= 4)
268 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
269 }
270 else
271 {
272 print_node (file, "type", TREE_TYPE (node), indent + 4);
273 if (TREE_TYPE (node))
274 indent_to (file, indent + 3);
275
276 print_obstack_name ((char *) node, file, "");
277 indent_to (file, indent + 3);
278 }
279
280 /* If a permanent object is in the wrong obstack, or the reverse, warn. */
281 if (object_permanent_p (node) != TREE_PERMANENT (node))
282 {
283 if (TREE_PERMANENT (node))
284 fputs (" !!permanent object in non-permanent obstack!!", file);
285 else
286 fputs (" !!non-permanent object in permanent obstack!!", file);
287 indent_to (file, indent + 3);
288 }
289
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);
328
329 /* DECL_ nodes have additional attributes. */
330
331 switch (TREE_CODE_CLASS (TREE_CODE (node)))
332 {
333 case 'd':
334 mode = DECL_MODE (node);
335
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);
354
355 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
356 fputs (" suppress-debug", file);
357
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);
362
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);
369
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);
376
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);
393
394 fprintf (file, " %s", mode_name[(int) mode]);
395
396 fprintf (file, " file %s line %d",
397 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
398
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 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
410 fprintf (file, " alias set %d", DECL_POINTER_ALIAS_SET (node));
411 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
412 print_node_brief (file, "machine_attributes", DECL_MACHINE_ATTRIBUTES (node), indent + 4);
413 print_node_brief (file, "abstract_origin",
414 DECL_ABSTRACT_ORIGIN (node), indent + 4);
415
416 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
417 print_node (file, "result", DECL_RESULT (node), indent + 4);
418 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
419
420 print_lang_decl (file, node, indent);
421
422 if (DECL_RTL (node) != 0)
423 {
424 indent_to (file, indent + 4);
425 print_rtl (file, DECL_RTL (node));
426 }
427
428 if (DECL_SAVED_INSNS (node) != 0)
429 {
430 indent_to (file, indent + 4);
431 if (TREE_CODE (node) == PARM_DECL)
432 {
433 fprintf (file, "incoming-rtl ");
434 print_rtl (file, DECL_INCOMING_RTL (node));
435 }
436 else if (TREE_CODE (node) == FUNCTION_DECL)
437 {
438 fprintf (file, "saved-insns ");
439 fprintf (file, HOST_PTR_PRINTF,
440 (char *) DECL_SAVED_INSNS (node));
441 }
442 }
443
444 /* Print the decl chain only if decl is at second level. */
445 if (indent == 4)
446 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
447 else
448 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
449 break;
450
451 case 't':
452 if (TYPE_NO_FORCE_BLK (node))
453 fputs (" no-force-blk", file);
454 if (TYPE_STRING_FLAG (node))
455 fputs (" string-flag", file);
456 if (TYPE_NEEDS_CONSTRUCTING (node))
457 fputs (" needs-constructing", file);
458 if (TYPE_TRANSPARENT_UNION (node))
459 fputs (" transparent-union", file);
460 if (TYPE_PACKED (node))
461 fputs (" packed", file);
462
463 if (TYPE_LANG_FLAG_0 (node))
464 fputs (" type_0", file);
465 if (TYPE_LANG_FLAG_1 (node))
466 fputs (" type_1", file);
467 if (TYPE_LANG_FLAG_2 (node))
468 fputs (" type_2", file);
469 if (TYPE_LANG_FLAG_3 (node))
470 fputs (" type_3", file);
471 if (TYPE_LANG_FLAG_4 (node))
472 fputs (" type_4", file);
473 if (TYPE_LANG_FLAG_5 (node))
474 fputs (" type_5", file);
475 if (TYPE_LANG_FLAG_6 (node))
476 fputs (" type_6", file);
477
478 mode = TYPE_MODE (node);
479 fprintf (file, " %s", mode_name[(int) mode]);
480
481 print_node (file, "size", TYPE_SIZE (node), indent + 4);
482 indent_to (file, indent + 3);
483
484 fprintf (file, " align %d", TYPE_ALIGN (node));
485 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
486 fprintf (file, " alias set %d", TYPE_ALIAS_SET (node));
487
488 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
489
490 if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
491 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
492 else if (TREE_CODE (node) == INTEGER_TYPE
493 || TREE_CODE (node) == BOOLEAN_TYPE
494 || TREE_CODE (node) == CHAR_TYPE)
495 {
496 fprintf (file, " precision %d", TYPE_PRECISION (node));
497 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
498 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
499 }
500 else if (TREE_CODE (node) == ENUMERAL_TYPE)
501 {
502 fprintf (file, " precision %d", TYPE_PRECISION (node));
503 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
504 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
505 print_node (file, "values", TYPE_VALUES (node), indent + 4);
506 }
507 else if (TREE_CODE (node) == REAL_TYPE)
508 fprintf (file, " precision %d", TYPE_PRECISION (node));
509 else if (TREE_CODE (node) == RECORD_TYPE
510 || TREE_CODE (node) == UNION_TYPE
511 || TREE_CODE (node) == QUAL_UNION_TYPE)
512 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
513 else if (TREE_CODE (node) == FUNCTION_TYPE || TREE_CODE (node) == METHOD_TYPE)
514 {
515 if (TYPE_METHOD_BASETYPE (node))
516 print_node_brief (file, "method basetype", TYPE_METHOD_BASETYPE (node), indent + 4);
517 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
518 }
519 if (TYPE_CONTEXT (node))
520 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
521
522 print_lang_type (file, node, indent);
523
524 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
525 indent_to (file, indent + 3);
526 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node), indent + 4);
527 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node), indent + 4);
528 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
529 break;
530
531 case 'b':
532 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
533 print_node (file, "tags", BLOCK_TYPE_TAGS (node), indent + 4);
534 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
535 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
536 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
537 print_node (file, "abstract_origin",
538 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
539 break;
540
541 case 'e':
542 case '<':
543 case '1':
544 case '2':
545 case 'r':
546 case 's':
547 if (TREE_CODE (node) == BIND_EXPR)
548 {
549 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
550 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
551 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
552 break;
553 }
554
555 len = tree_code_length[(int) TREE_CODE (node)];
556 /* Some nodes contain rtx's, not trees,
557 after a certain point. Print the rtx's as rtx's. */
558 first_rtl = first_rtl_op (TREE_CODE (node));
559 for (i = 0; i < len; i++)
560 {
561 if (i >= first_rtl)
562 {
563 indent_to (file, indent + 4);
564 fprintf (file, "rtl %d ", i);
565 if (TREE_OPERAND (node, i))
566 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
567 else
568 fprintf (file, "(nil)");
569 fprintf (file, "\n");
570 }
571 else
572 {
573 char temp[10];
574
575 sprintf (temp, "arg %d", i);
576 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
577 }
578 }
579
580 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
581 {
582 indent_to (file, indent+4);
583 fprintf (file, "%s:%d:%d",
584 (EXPR_WFL_FILENAME_NODE (node ) ?
585 EXPR_WFL_FILENAME (node) : "(no file info)"),
586 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
587 }
588 break;
589
590 case 'c':
591 case 'x':
592 switch (TREE_CODE (node))
593 {
594 case INTEGER_CST:
595 if (TREE_CONSTANT_OVERFLOW (node))
596 fprintf (file, " overflow");
597
598 fprintf (file, " ");
599 if (TREE_INT_CST_HIGH (node) == 0)
600 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
601 TREE_INT_CST_LOW (node));
602 else if (TREE_INT_CST_HIGH (node) == -1
603 && TREE_INT_CST_LOW (node) != 0)
604 {
605 fprintf (file, "-");
606 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
607 -TREE_INT_CST_LOW (node));
608 }
609 else
610 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
611 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
612 break;
613
614 case REAL_CST:
615 {
616 REAL_VALUE_TYPE d;
617
618 if (TREE_OVERFLOW (node))
619 fprintf (file, " overflow");
620
621#if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
622 d = TREE_REAL_CST (node);
623 if (REAL_VALUE_ISINF (d))
624 fprintf (file, " Inf");
625 else if (REAL_VALUE_ISNAN (d))
626 fprintf (file, " Nan");
627 else
628 {
629 char string[100];
630
631 REAL_VALUE_TO_DECIMAL (d, "%e", string);
632 fprintf (file, " %s", string);
633 }
634#else
635 {
636 int i;
637 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
638 fprintf (file, " 0x");
639 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
640 fprintf (file, "%02x", *p++);
641 fprintf (file, "");
642 }
643#endif
644 }
645 break;
646
647 case COMPLEX_CST:
648 print_node (file, "real", TREE_REALPART (node), indent + 4);
649 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
650 break;
651
652 case STRING_CST:
653 fprintf (file, " \"%s\"", TREE_STRING_POINTER (node));
654 /* Print the chain at second level. */
655 if (indent == 4)
656 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
657 else
658 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
659 break;
660
661 case IDENTIFIER_NODE:
662 print_lang_identifier (file, node, indent);
663 break;
664
665 case TREE_LIST:
666 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
667 print_node (file, "value", TREE_VALUE (node), indent + 4);
668 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
669 break;
670
671 case TREE_VEC:
672 len = TREE_VEC_LENGTH (node);
673 for (i = 0; i < len; i++)
674 if (TREE_VEC_ELT (node, i))
675 {
676 char temp[10];
677 sprintf (temp, "elt %d", i);
678 indent_to (file, indent + 4);
679 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
680 }
681 break;
682
683 case OP_IDENTIFIER:
684 print_node (file, "op1", TREE_PURPOSE (node), indent + 4);
685 print_node (file, "op2", TREE_VALUE (node), indent + 4);
686 break;
687
688 default:
689 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
690 lang_print_xnode (file, node, indent);
691 break;
692 }
693
694 break;
695 }
696
697 fprintf (file, ">");
698}
2 Copyright (C) 1990, 91, 93-97, 1998 Free Software Foundation, Inc.
3
4This file is part of GNU CC.
5
6GNU CC is free software; you can redistribute it and/or modify
7it under the terms of the GNU General Public License as published by
8the Free Software Foundation; either version 2, or (at your option)
9any later version.
10
11GNU CC is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for more details.
15
16You should have received a copy of the GNU General Public License
17along with GNU CC; see the file COPYING. If not, write to
18the Free Software Foundation, 59 Temple Place - Suite 330,
19Boston, MA 02111-1307, USA. */
20
21/* $FreeBSD: head/contrib/gcc/print-tree.c 52521 1999-10-26 09:17:58Z obrien $ */
22
23
24#include "config.h"
25#include "system.h"
26#include "tree.h"
27
28extern char *mode_name[];
29
30void print_node ();
31void indent_to ();
32
33/* Define the hash table of nodes already seen.
34 Such nodes are not repeated; brief cross-references are used. */
35
36#define HASH_SIZE 37
37
38struct bucket
39{
40 tree node;
41 struct bucket *next;
42};
43
44static struct bucket **table;
45
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. */
49
50void
51debug_tree (node)
52 tree node;
53{
54 char *object = (char *) oballoc (0);
55
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);
59 table = 0;
60 obfree (object);
61 fprintf (stderr, "\n");
62}
63
64/* Print a node in brief fashion, with just the code, address and name. */
65
66void
67print_node_brief (file, prefix, node, indent)
68 FILE *file;
69 const char *prefix;
70 tree node;
71 int indent;
72{
73 char class;
74
75 if (node == 0)
76 return;
77
78 class = TREE_CODE_CLASS (TREE_CODE (node));
79
80 /* Always print the slot this node is in, and its code, address and
81 name if any. */
82 if (indent > 0)
83 fprintf (file, " ");
84 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
85 fprintf (file, HOST_PTR_PRINTF, (char *) node);
86
87 if (class == 'd')
88 {
89 if (DECL_NAME (node))
90 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
91 }
92 else if (class == 't')
93 {
94 if (TYPE_NAME (node))
95 {
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))));
102 }
103 }
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)
108 {
109 if (TREE_CONSTANT_OVERFLOW (node))
110 fprintf (file, " overflow");
111
112 fprintf (file, " ");
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)
117 {
118 fprintf (file, "-");
119 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
120 -TREE_INT_CST_LOW (node));
121 }
122 else
123 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
124 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
125 }
126 if (TREE_CODE (node) == REAL_CST)
127 {
128 REAL_VALUE_TYPE d;
129
130 if (TREE_OVERFLOW (node))
131 fprintf (file, " overflow");
132
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");
139 else
140 {
141 char string[100];
142
143 REAL_VALUE_TO_DECIMAL (d, "%e", string);
144 fprintf (file, " %s", string);
145 }
146#else
147 {
148 int i;
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++);
153 fprintf (file, "");
154 }
155#endif
156 }
157
158 fprintf (file, ">");
159}
160
161void
162indent_to (file, column)
163 FILE *file;
164 int column;
165{
166 int i;
167
168 /* Since this is the long way, indent to desired column. */
169 if (column > 0)
170 fprintf (file, "\n");
171 for (i = 0; i < column; i++)
172 fprintf (file, " ");
173}
174
175/* Print the node NODE in full on file FILE, preceded by PREFIX,
176 starting in column INDENT. */
177
178void
179print_node (file, prefix, node, indent)
180 FILE *file;
181 const char *prefix;
182 tree node;
183 int indent;
184{
185 int hash;
186 struct bucket *b;
187 enum machine_mode mode;
188 char class;
189 int len;
190 int first_rtl;
191 int i;
192
193 if (node == 0)
194 return;
195
196 class = TREE_CODE_CLASS (TREE_CODE (node));
197
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. */
201
202 if (indent > 24)
203 {
204 print_node_brief (file, prefix, node, indent);
205 return;
206 }
207
208 if (indent > 8 && (class == 't' || class == 'd'))
209 {
210 print_node_brief (file, prefix, node, indent);
211 return;
212 }
213
214 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
215 if (TREE_CODE (node) == ERROR_MARK)
216 {
217 print_node_brief (file, prefix, node, indent);
218 return;
219 }
220
221 hash = ((unsigned long) node) % HASH_SIZE;
222
223 /* If node is in the table, just mention its address. */
224 for (b = table[hash]; b; b = b->next)
225 if (b->node == node)
226 {
227 print_node_brief (file, prefix, node, indent);
228 return;
229 }
230
231 /* Add this node to the table. */
232 b = (struct bucket *) oballoc (sizeof (struct bucket));
233 b->node = node;
234 b->next = table[hash];
235 table[hash] = b;
236
237 /* Indent to the specified column, since this is the long form. */
238 indent_to (file, indent);
239
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, (char *) node);
243
244 /* Print the name, if any. */
245 if (class == 'd')
246 {
247 if (DECL_NAME (node))
248 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
249 }
250 else if (class == 't')
251 {
252 if (TYPE_NAME (node))
253 {
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))));
260 }
261 }
262 if (TREE_CODE (node) == IDENTIFIER_NODE)
263 fprintf (file, " %s", IDENTIFIER_POINTER (node));
264
265 if (TREE_CODE (node) == INTEGER_CST)
266 {
267 if (indent <= 4)
268 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
269 }
270 else
271 {
272 print_node (file, "type", TREE_TYPE (node), indent + 4);
273 if (TREE_TYPE (node))
274 indent_to (file, indent + 3);
275
276 print_obstack_name ((char *) node, file, "");
277 indent_to (file, indent + 3);
278 }
279
280 /* If a permanent object is in the wrong obstack, or the reverse, warn. */
281 if (object_permanent_p (node) != TREE_PERMANENT (node))
282 {
283 if (TREE_PERMANENT (node))
284 fputs (" !!permanent object in non-permanent obstack!!", file);
285 else
286 fputs (" !!non-permanent object in permanent obstack!!", file);
287 indent_to (file, indent + 3);
288 }
289
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);
328
329 /* DECL_ nodes have additional attributes. */
330
331 switch (TREE_CODE_CLASS (TREE_CODE (node)))
332 {
333 case 'd':
334 mode = DECL_MODE (node);
335
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);
354
355 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
356 fputs (" suppress-debug", file);
357
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);
362
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);
369
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);
376
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);
393
394 fprintf (file, " %s", mode_name[(int) mode]);
395
396 fprintf (file, " file %s line %d",
397 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
398
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 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
410 fprintf (file, " alias set %d", DECL_POINTER_ALIAS_SET (node));
411 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
412 print_node_brief (file, "machine_attributes", DECL_MACHINE_ATTRIBUTES (node), indent + 4);
413 print_node_brief (file, "abstract_origin",
414 DECL_ABSTRACT_ORIGIN (node), indent + 4);
415
416 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
417 print_node (file, "result", DECL_RESULT (node), indent + 4);
418 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
419
420 print_lang_decl (file, node, indent);
421
422 if (DECL_RTL (node) != 0)
423 {
424 indent_to (file, indent + 4);
425 print_rtl (file, DECL_RTL (node));
426 }
427
428 if (DECL_SAVED_INSNS (node) != 0)
429 {
430 indent_to (file, indent + 4);
431 if (TREE_CODE (node) == PARM_DECL)
432 {
433 fprintf (file, "incoming-rtl ");
434 print_rtl (file, DECL_INCOMING_RTL (node));
435 }
436 else if (TREE_CODE (node) == FUNCTION_DECL)
437 {
438 fprintf (file, "saved-insns ");
439 fprintf (file, HOST_PTR_PRINTF,
440 (char *) DECL_SAVED_INSNS (node));
441 }
442 }
443
444 /* Print the decl chain only if decl is at second level. */
445 if (indent == 4)
446 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
447 else
448 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
449 break;
450
451 case 't':
452 if (TYPE_NO_FORCE_BLK (node))
453 fputs (" no-force-blk", file);
454 if (TYPE_STRING_FLAG (node))
455 fputs (" string-flag", file);
456 if (TYPE_NEEDS_CONSTRUCTING (node))
457 fputs (" needs-constructing", file);
458 if (TYPE_TRANSPARENT_UNION (node))
459 fputs (" transparent-union", file);
460 if (TYPE_PACKED (node))
461 fputs (" packed", file);
462
463 if (TYPE_LANG_FLAG_0 (node))
464 fputs (" type_0", file);
465 if (TYPE_LANG_FLAG_1 (node))
466 fputs (" type_1", file);
467 if (TYPE_LANG_FLAG_2 (node))
468 fputs (" type_2", file);
469 if (TYPE_LANG_FLAG_3 (node))
470 fputs (" type_3", file);
471 if (TYPE_LANG_FLAG_4 (node))
472 fputs (" type_4", file);
473 if (TYPE_LANG_FLAG_5 (node))
474 fputs (" type_5", file);
475 if (TYPE_LANG_FLAG_6 (node))
476 fputs (" type_6", file);
477
478 mode = TYPE_MODE (node);
479 fprintf (file, " %s", mode_name[(int) mode]);
480
481 print_node (file, "size", TYPE_SIZE (node), indent + 4);
482 indent_to (file, indent + 3);
483
484 fprintf (file, " align %d", TYPE_ALIGN (node));
485 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
486 fprintf (file, " alias set %d", TYPE_ALIAS_SET (node));
487
488 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
489
490 if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
491 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
492 else if (TREE_CODE (node) == INTEGER_TYPE
493 || TREE_CODE (node) == BOOLEAN_TYPE
494 || TREE_CODE (node) == CHAR_TYPE)
495 {
496 fprintf (file, " precision %d", TYPE_PRECISION (node));
497 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
498 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
499 }
500 else if (TREE_CODE (node) == ENUMERAL_TYPE)
501 {
502 fprintf (file, " precision %d", TYPE_PRECISION (node));
503 print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
504 print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
505 print_node (file, "values", TYPE_VALUES (node), indent + 4);
506 }
507 else if (TREE_CODE (node) == REAL_TYPE)
508 fprintf (file, " precision %d", TYPE_PRECISION (node));
509 else if (TREE_CODE (node) == RECORD_TYPE
510 || TREE_CODE (node) == UNION_TYPE
511 || TREE_CODE (node) == QUAL_UNION_TYPE)
512 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
513 else if (TREE_CODE (node) == FUNCTION_TYPE || TREE_CODE (node) == METHOD_TYPE)
514 {
515 if (TYPE_METHOD_BASETYPE (node))
516 print_node_brief (file, "method basetype", TYPE_METHOD_BASETYPE (node), indent + 4);
517 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
518 }
519 if (TYPE_CONTEXT (node))
520 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
521
522 print_lang_type (file, node, indent);
523
524 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
525 indent_to (file, indent + 3);
526 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node), indent + 4);
527 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node), indent + 4);
528 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
529 break;
530
531 case 'b':
532 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
533 print_node (file, "tags", BLOCK_TYPE_TAGS (node), indent + 4);
534 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
535 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
536 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
537 print_node (file, "abstract_origin",
538 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
539 break;
540
541 case 'e':
542 case '<':
543 case '1':
544 case '2':
545 case 'r':
546 case 's':
547 if (TREE_CODE (node) == BIND_EXPR)
548 {
549 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
550 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
551 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
552 break;
553 }
554
555 len = tree_code_length[(int) TREE_CODE (node)];
556 /* Some nodes contain rtx's, not trees,
557 after a certain point. Print the rtx's as rtx's. */
558 first_rtl = first_rtl_op (TREE_CODE (node));
559 for (i = 0; i < len; i++)
560 {
561 if (i >= first_rtl)
562 {
563 indent_to (file, indent + 4);
564 fprintf (file, "rtl %d ", i);
565 if (TREE_OPERAND (node, i))
566 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
567 else
568 fprintf (file, "(nil)");
569 fprintf (file, "\n");
570 }
571 else
572 {
573 char temp[10];
574
575 sprintf (temp, "arg %d", i);
576 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
577 }
578 }
579
580 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
581 {
582 indent_to (file, indent+4);
583 fprintf (file, "%s:%d:%d",
584 (EXPR_WFL_FILENAME_NODE (node ) ?
585 EXPR_WFL_FILENAME (node) : "(no file info)"),
586 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
587 }
588 break;
589
590 case 'c':
591 case 'x':
592 switch (TREE_CODE (node))
593 {
594 case INTEGER_CST:
595 if (TREE_CONSTANT_OVERFLOW (node))
596 fprintf (file, " overflow");
597
598 fprintf (file, " ");
599 if (TREE_INT_CST_HIGH (node) == 0)
600 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
601 TREE_INT_CST_LOW (node));
602 else if (TREE_INT_CST_HIGH (node) == -1
603 && TREE_INT_CST_LOW (node) != 0)
604 {
605 fprintf (file, "-");
606 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
607 -TREE_INT_CST_LOW (node));
608 }
609 else
610 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
611 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
612 break;
613
614 case REAL_CST:
615 {
616 REAL_VALUE_TYPE d;
617
618 if (TREE_OVERFLOW (node))
619 fprintf (file, " overflow");
620
621#if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
622 d = TREE_REAL_CST (node);
623 if (REAL_VALUE_ISINF (d))
624 fprintf (file, " Inf");
625 else if (REAL_VALUE_ISNAN (d))
626 fprintf (file, " Nan");
627 else
628 {
629 char string[100];
630
631 REAL_VALUE_TO_DECIMAL (d, "%e", string);
632 fprintf (file, " %s", string);
633 }
634#else
635 {
636 int i;
637 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
638 fprintf (file, " 0x");
639 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
640 fprintf (file, "%02x", *p++);
641 fprintf (file, "");
642 }
643#endif
644 }
645 break;
646
647 case COMPLEX_CST:
648 print_node (file, "real", TREE_REALPART (node), indent + 4);
649 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
650 break;
651
652 case STRING_CST:
653 fprintf (file, " \"%s\"", TREE_STRING_POINTER (node));
654 /* Print the chain at second level. */
655 if (indent == 4)
656 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
657 else
658 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
659 break;
660
661 case IDENTIFIER_NODE:
662 print_lang_identifier (file, node, indent);
663 break;
664
665 case TREE_LIST:
666 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
667 print_node (file, "value", TREE_VALUE (node), indent + 4);
668 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
669 break;
670
671 case TREE_VEC:
672 len = TREE_VEC_LENGTH (node);
673 for (i = 0; i < len; i++)
674 if (TREE_VEC_ELT (node, i))
675 {
676 char temp[10];
677 sprintf (temp, "elt %d", i);
678 indent_to (file, indent + 4);
679 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
680 }
681 break;
682
683 case OP_IDENTIFIER:
684 print_node (file, "op1", TREE_PURPOSE (node), indent + 4);
685 print_node (file, "op2", TREE_VALUE (node), indent + 4);
686 break;
687
688 default:
689 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
690 lang_print_xnode (file, node, indent);
691 break;
692 }
693
694 break;
695 }
696
697 fprintf (file, ">");
698}