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 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
28 /* Define the hash table of nodes already seen.
29 Such nodes are not repeated; brief cross-references are used. */
39 static struct bucket
**table
;
41 /* Print the node NODE on standard error, for debugging.
42 Most nodes referred to by this one are printed recursively
43 down to a depth of six. */
49 char *object
= (char *) oballoc (0);
51 table
= (struct bucket
**) oballoc (HASH_SIZE
* sizeof (struct bucket
*));
52 bzero ((char *) table
, HASH_SIZE
* sizeof (struct bucket
*));
53 print_node (stderr
, "", node
, 0);
56 fprintf (stderr
, "\n");
59 /* Print a node in brief fashion, with just the code, address and name. */
62 print_node_brief (file
, prefix
, node
, indent
)
73 class = TREE_CODE_CLASS (TREE_CODE (node
));
75 /* Always print the slot this node is in, and its code, address and
79 fprintf (file
, "%s <%s ", prefix
, tree_code_name
[(int) TREE_CODE (node
)]);
80 fprintf (file
, HOST_PTR_PRINTF
, (char *) node
);
85 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
87 else if (class == 't')
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
)))
96 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
99 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
100 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
101 /* We might as well always print the value of an integer. */
102 if (TREE_CODE (node
) == INTEGER_CST
)
104 if (TREE_CONSTANT_OVERFLOW (node
))
105 fprintf (file
, " overflow");
108 if (TREE_INT_CST_HIGH (node
) == 0)
109 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
, TREE_INT_CST_LOW (node
));
110 else if (TREE_INT_CST_HIGH (node
) == -1
111 && TREE_INT_CST_LOW (node
) != 0)
114 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
115 -TREE_INT_CST_LOW (node
));
118 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
119 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
121 if (TREE_CODE (node
) == REAL_CST
)
125 if (TREE_OVERFLOW (node
))
126 fprintf (file
, " overflow");
128 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
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");
138 REAL_VALUE_TO_DECIMAL (d
, "%e", string
);
139 fprintf (file
, " %s", string
);
144 unsigned char *p
= (unsigned char *) &TREE_REAL_CST (node
);
145 fprintf (file
, " 0x");
146 for (i
= 0; i
< sizeof TREE_REAL_CST (node
); i
++)
147 fprintf (file
, "%02x", *p
++);
157 indent_to (file
, column
)
163 /* Since this is the long way, indent to desired column. */
165 fprintf (file
, "\n");
166 for (i
= 0; i
< column
; i
++)
170 /* Print the node NODE in full on file FILE, preceded by PREFIX,
171 starting in column INDENT. */
174 print_node (file
, prefix
, node
, indent
)
182 enum machine_mode mode
;
191 class = TREE_CODE_CLASS (TREE_CODE (node
));
193 /* Don't get too deep in nesting. If the user wants to see deeper,
194 it is easy to use the address of a lowest-level node
195 as an argument in another call to debug_tree. */
199 print_node_brief (file
, prefix
, node
, indent
);
203 if (indent
> 8 && (class == 't' || class == 'd'))
205 print_node_brief (file
, prefix
, node
, indent
);
209 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
210 if (TREE_CODE (node
) == ERROR_MARK
)
212 print_node_brief (file
, prefix
, node
, indent
);
216 hash
= ((unsigned long) node
) % HASH_SIZE
;
218 /* If node is in the table, just mention its address. */
219 for (b
= table
[hash
]; b
; b
= b
->next
)
222 print_node_brief (file
, prefix
, node
, indent
);
226 /* Add this node to the table. */
227 b
= (struct bucket
*) oballoc (sizeof (struct bucket
));
229 b
->next
= table
[hash
];
232 /* Indent to the specified column, since this is the long form. */
233 indent_to (file
, indent
);
235 /* Print the slot this node is in, and its code, and address. */
236 fprintf (file
, "%s <%s ", prefix
, tree_code_name
[(int) TREE_CODE (node
)]);
237 fprintf (file
, HOST_PTR_PRINTF
, (char *) node
);
239 /* Print the name, if any. */
242 if (DECL_NAME (node
))
243 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
245 else if (class == 't')
247 if (TYPE_NAME (node
))
249 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
250 fprintf (file
, " %s", IDENTIFIER_POINTER (TYPE_NAME (node
)));
251 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
252 && DECL_NAME (TYPE_NAME (node
)))
253 fprintf (file
, " %s",
254 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
257 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
258 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
260 if (TREE_CODE (node
) == INTEGER_CST
)
263 print_node_brief (file
, "type", TREE_TYPE (node
), indent
+ 4);
267 print_node (file
, "type", TREE_TYPE (node
), indent
+ 4);
268 if (TREE_TYPE (node
))
269 indent_to (file
, indent
+ 3);
273 print_obstack_name ((char *) node
, file
, "");
274 indent_to (file
, indent
+ 3);
278 /* If a permanent object is in the wrong obstack, or the reverse, warn. */
279 if (!ggc_p
&& object_permanent_p (node
) != TREE_PERMANENT (node
))
281 if (TREE_PERMANENT (node
))
282 fputs (" !!permanent object in non-permanent obstack!!", file
);
284 fputs (" !!non-permanent object in permanent obstack!!", file
);
285 indent_to (file
, indent
+ 3);
288 if (TREE_SIDE_EFFECTS (node
))
289 fputs (" side-effects", file
);
290 if (TREE_READONLY (node
))
291 fputs (" readonly", file
);
292 if (TREE_CONSTANT (node
))
293 fputs (" constant", file
);
294 if (TREE_ADDRESSABLE (node
))
295 fputs (" addressable", file
);
296 if (TREE_THIS_VOLATILE (node
))
297 fputs (" volatile", file
);
298 if (TREE_UNSIGNED (node
))
299 fputs (" unsigned", file
);
300 if (TREE_ASM_WRITTEN (node
))
301 fputs (" asm_written", file
);
302 if (TREE_USED (node
))
303 fputs (" used", file
);
304 if (TREE_NOTHROW (node
))
305 fputs (" nothrow", file
);
306 if (!ggc_p
&& TREE_PERMANENT (node
))
307 fputs (" permanent", file
);
308 if (TREE_PUBLIC (node
))
309 fputs (" public", file
);
310 if (TREE_PRIVATE (node
))
311 fputs (" private", file
);
312 if (TREE_PROTECTED (node
))
313 fputs (" protected", file
);
314 if (TREE_STATIC (node
))
315 fputs (" static", file
);
316 if (TREE_LANG_FLAG_0 (node
))
317 fputs (" tree_0", file
);
318 if (TREE_LANG_FLAG_1 (node
))
319 fputs (" tree_1", file
);
320 if (TREE_LANG_FLAG_2 (node
))
321 fputs (" tree_2", file
);
322 if (TREE_LANG_FLAG_3 (node
))
323 fputs (" tree_3", file
);
324 if (TREE_LANG_FLAG_4 (node
))
325 fputs (" tree_4", file
);
326 if (TREE_LANG_FLAG_5 (node
))
327 fputs (" tree_5", file
);
328 if (TREE_LANG_FLAG_6 (node
))
329 fputs (" tree_6", file
);
331 /* DECL_ nodes have additional attributes. */
333 switch (TREE_CODE_CLASS (TREE_CODE (node
)))
336 mode
= DECL_MODE (node
);
338 if (DECL_IGNORED_P (node
))
339 fputs (" ignored", file
);
340 if (DECL_ABSTRACT (node
))
341 fputs (" abstract", file
);
342 if (DECL_IN_SYSTEM_HEADER (node
))
343 fputs (" in_system_header", file
);
344 if (DECL_COMMON (node
))
345 fputs (" common", file
);
346 if (DECL_EXTERNAL (node
))
347 fputs (" external", file
);
348 if (DECL_REGISTER (node
))
349 fputs (" regdecl", file
);
350 if (DECL_NONLOCAL (node
))
351 fputs (" nonlocal", file
);
353 if (TREE_CODE (node
) == TYPE_DECL
&& TYPE_DECL_SUPPRESS_DEBUG (node
))
354 fputs (" suppress-debug", file
);
356 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INLINE (node
))
357 fputs (" inline", file
);
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
);
363 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_PACKED (node
))
364 fputs (" packed", file
);
365 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_BIT_FIELD (node
))
366 fputs (" bit-field", file
);
368 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_TOO_LATE (node
))
369 fputs (" too-late", file
);
371 if (TREE_CODE (node
) == VAR_DECL
&& DECL_IN_TEXT_SECTION (node
))
372 fputs (" in-text-section", file
);
374 if (TREE_CODE (node
) == PARM_DECL
&& DECL_TRANSPARENT_UNION (node
))
375 fputs (" transparent-union", file
);
377 if (DECL_VIRTUAL_P (node
))
378 fputs (" virtual", file
);
379 if (DECL_DEFER_OUTPUT (node
))
380 fputs (" defer-output", file
);
382 if (DECL_LANG_FLAG_0 (node
))
383 fputs (" decl_0", file
);
384 if (DECL_LANG_FLAG_1 (node
))
385 fputs (" decl_1", file
);
386 if (DECL_LANG_FLAG_2 (node
))
387 fputs (" decl_2", file
);
388 if (DECL_LANG_FLAG_3 (node
))
389 fputs (" decl_3", file
);
390 if (DECL_LANG_FLAG_4 (node
))
391 fputs (" decl_4", file
);
392 if (DECL_LANG_FLAG_5 (node
))
393 fputs (" decl_5", file
);
394 if (DECL_LANG_FLAG_6 (node
))
395 fputs (" decl_6", file
);
396 if (DECL_LANG_FLAG_7 (node
))
397 fputs (" decl_7", file
);
399 fprintf (file
, " %s", GET_MODE_NAME(mode
));
401 fprintf (file
, " file %s line %d",
402 DECL_SOURCE_FILE (node
), DECL_SOURCE_LINE (node
));
404 print_node (file
, "size", DECL_SIZE (node
), indent
+ 4);
405 print_node (file
, "unit size", DECL_SIZE_UNIT (node
), indent
+ 4);
407 if (TREE_CODE (node
) != FUNCTION_DECL
408 || DECL_INLINE (node
) || DECL_BUILT_IN (node
))
409 indent_to (file
, indent
+ 3);
411 if (TREE_CODE (node
) != FUNCTION_DECL
)
413 fprintf (file
, " align %d", DECL_ALIGN (node
));
414 if (TREE_CODE (node
) == FIELD_DECL
)
415 fprintf (file
, " offset_align %d", DECL_OFFSET_ALIGN (node
));
417 else if (DECL_INLINE (node
))
419 fprintf (file
, " frame_size ");
420 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, DECL_FRAME_SIZE (node
));
422 else if (DECL_BUILT_IN (node
))
423 fprintf (file
, " built-in %s:%s",
424 built_in_class_names
[(int) DECL_BUILT_IN_CLASS (node
)],
425 built_in_names
[(int) DECL_FUNCTION_CODE (node
)]);
427 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node
))
429 fprintf (file
, " alias set ");
430 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
,
431 DECL_POINTER_ALIAS_SET (node
));
434 if (TREE_CODE (node
) == FIELD_DECL
)
436 print_node (file
, "offset", DECL_FIELD_OFFSET (node
), indent
+ 4);
437 print_node (file
, "bit offset", DECL_FIELD_BIT_OFFSET (node
),
441 print_node_brief (file
, "context", DECL_CONTEXT (node
), indent
+ 4);
442 print_node_brief (file
, "machine_attributes",
443 DECL_MACHINE_ATTRIBUTES (node
), indent
+ 4);
444 print_node_brief (file
, "abstract_origin",
445 DECL_ABSTRACT_ORIGIN (node
), indent
+ 4);
447 print_node (file
, "arguments", DECL_ARGUMENTS (node
), indent
+ 4);
448 print_node (file
, "result", DECL_RESULT_FLD (node
), indent
+ 4);
449 print_node_brief (file
, "initial", DECL_INITIAL (node
), indent
+ 4);
451 print_lang_decl (file
, node
, indent
);
453 if (DECL_RTL (node
) != 0)
455 indent_to (file
, indent
+ 4);
456 print_rtl (file
, DECL_RTL (node
));
459 if (TREE_CODE (node
) == PARM_DECL
&& DECL_INCOMING_RTL (node
) != 0)
461 indent_to (file
, indent
+ 4);
462 fprintf (file
, "incoming-rtl ");
463 print_rtl (file
, DECL_INCOMING_RTL (node
));
465 else if (TREE_CODE (node
) == FUNCTION_DECL
466 && DECL_SAVED_INSNS (node
) != 0)
468 indent_to (file
, indent
+ 4);
469 fprintf (file
, "saved-insns ");
470 fprintf (file
, HOST_PTR_PRINTF
, (char *) DECL_SAVED_INSNS (node
));
473 /* Print the decl chain only if decl is at second level. */
475 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
477 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
481 if (TYPE_NO_FORCE_BLK (node
))
482 fputs (" no-force-blk", file
);
483 if (TYPE_STRING_FLAG (node
))
484 fputs (" string-flag", file
);
485 if (TYPE_NEEDS_CONSTRUCTING (node
))
486 fputs (" needs-constructing", file
);
487 /* The transparent-union flag is used for different things in
489 if (TYPE_CHECK (node
)->type
.transparent_union_flag
)
491 if (TREE_CODE (node
) == UNION_TYPE
)
492 fputs (" transparent-union", file
);
493 else if (TREE_CODE (node
) == ARRAY_TYPE
)
494 fputs (" nonaliased-component", file
);
496 fputs (" tu-flag", file
);
498 if (TYPE_PACKED (node
))
499 fputs (" packed", file
);
501 if (TYPE_LANG_FLAG_0 (node
))
502 fputs (" type_0", file
);
503 if (TYPE_LANG_FLAG_1 (node
))
504 fputs (" type_1", file
);
505 if (TYPE_LANG_FLAG_2 (node
))
506 fputs (" type_2", file
);
507 if (TYPE_LANG_FLAG_3 (node
))
508 fputs (" type_3", file
);
509 if (TYPE_LANG_FLAG_4 (node
))
510 fputs (" type_4", file
);
511 if (TYPE_LANG_FLAG_5 (node
))
512 fputs (" type_5", file
);
513 if (TYPE_LANG_FLAG_6 (node
))
514 fputs (" type_6", file
);
516 mode
= TYPE_MODE (node
);
517 fprintf (file
, " %s", GET_MODE_NAME(mode
));
519 print_node (file
, "size", TYPE_SIZE (node
), indent
+ 4);
520 print_node (file
, "unit size", TYPE_SIZE_UNIT (node
), indent
+ 4);
521 indent_to (file
, indent
+ 3);
523 fprintf (file
, " align %d", TYPE_ALIGN (node
));
524 fprintf (file
, " symtab %d", TYPE_SYMTAB_ADDRESS (node
));
525 fprintf (file
, " alias set ");
526 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, TYPE_ALIAS_SET (node
));
528 print_node (file
, "attributes", TYPE_ATTRIBUTES (node
), indent
+ 4);
530 if (TREE_CODE (node
) == ARRAY_TYPE
|| TREE_CODE (node
) == SET_TYPE
)
531 print_node (file
, "domain", TYPE_DOMAIN (node
), indent
+ 4);
532 else if (TREE_CODE (node
) == INTEGER_TYPE
533 || TREE_CODE (node
) == BOOLEAN_TYPE
534 || TREE_CODE (node
) == CHAR_TYPE
)
536 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
537 print_node (file
, "min", TYPE_MIN_VALUE (node
), indent
+ 4);
538 print_node (file
, "max", TYPE_MAX_VALUE (node
), indent
+ 4);
540 else if (TREE_CODE (node
) == ENUMERAL_TYPE
)
542 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
543 print_node (file
, "min", TYPE_MIN_VALUE (node
), indent
+ 4);
544 print_node (file
, "max", TYPE_MAX_VALUE (node
), indent
+ 4);
545 print_node (file
, "values", TYPE_VALUES (node
), indent
+ 4);
547 else if (TREE_CODE (node
) == REAL_TYPE
)
548 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
549 else if (TREE_CODE (node
) == RECORD_TYPE
550 || TREE_CODE (node
) == UNION_TYPE
551 || TREE_CODE (node
) == QUAL_UNION_TYPE
)
552 print_node (file
, "fields", TYPE_FIELDS (node
), indent
+ 4);
553 else if (TREE_CODE (node
) == FUNCTION_TYPE
|| TREE_CODE (node
) == METHOD_TYPE
)
555 if (TYPE_METHOD_BASETYPE (node
))
556 print_node_brief (file
, "method basetype", TYPE_METHOD_BASETYPE (node
), indent
+ 4);
557 print_node (file
, "arg-types", TYPE_ARG_TYPES (node
), indent
+ 4);
559 else if (TREE_CODE (node
) == OFFSET_TYPE
)
560 print_node_brief (file
, "basetype", TYPE_OFFSET_BASETYPE (node
),
562 if (TYPE_CONTEXT (node
))
563 print_node_brief (file
, "context", TYPE_CONTEXT (node
), indent
+ 4);
565 print_lang_type (file
, node
, indent
);
567 if (TYPE_POINTER_TO (node
) || TREE_CHAIN (node
))
568 indent_to (file
, indent
+ 3);
569 print_node_brief (file
, "pointer_to_this", TYPE_POINTER_TO (node
), indent
+ 4);
570 print_node_brief (file
, "reference_to_this", TYPE_REFERENCE_TO (node
), indent
+ 4);
571 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
575 print_node (file
, "vars", BLOCK_VARS (node
), indent
+ 4);
576 print_node (file
, "supercontext", BLOCK_SUPERCONTEXT (node
), indent
+ 4);
577 print_node (file
, "subblocks", BLOCK_SUBBLOCKS (node
), indent
+ 4);
578 print_node (file
, "chain", BLOCK_CHAIN (node
), indent
+ 4);
579 print_node (file
, "abstract_origin",
580 BLOCK_ABSTRACT_ORIGIN (node
), indent
+ 4);
589 if (TREE_CODE (node
) == BIND_EXPR
)
591 print_node (file
, "vars", TREE_OPERAND (node
, 0), indent
+ 4);
592 print_node (file
, "body", TREE_OPERAND (node
, 1), indent
+ 4);
593 print_node (file
, "block", TREE_OPERAND (node
, 2), indent
+ 4);
597 len
= TREE_CODE_LENGTH (TREE_CODE (node
));
599 /* Some nodes contain rtx's, not trees,
600 after a certain point. Print the rtx's as rtx's. */
601 first_rtl
= first_rtl_op (TREE_CODE (node
));
603 for (i
= 0; i
< len
; i
++)
607 indent_to (file
, indent
+ 4);
608 fprintf (file
, "rtl %d ", i
);
609 if (TREE_OPERAND (node
, i
))
610 print_rtl (file
, (struct rtx_def
*) TREE_OPERAND (node
, i
));
612 fprintf (file
, "(nil)");
613 fprintf (file
, "\n");
619 sprintf (temp
, "arg %d", i
);
620 print_node (file
, temp
, TREE_OPERAND (node
, i
), indent
+ 4);
624 if (TREE_CODE (node
) == EXPR_WITH_FILE_LOCATION
)
626 indent_to (file
, indent
+4);
627 fprintf (file
, "%s:%d:%d",
628 (EXPR_WFL_FILENAME_NODE (node
) ?
629 EXPR_WFL_FILENAME (node
) : "(no file info)"),
630 EXPR_WFL_LINENO (node
), EXPR_WFL_COLNO (node
));
632 print_node (file
, "chain", BLOCK_CHAIN (node
), indent
+ 4);
637 switch (TREE_CODE (node
))
640 if (TREE_CONSTANT_OVERFLOW (node
))
641 fprintf (file
, " overflow");
644 if (TREE_INT_CST_HIGH (node
) == 0)
645 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
646 TREE_INT_CST_LOW (node
));
647 else if (TREE_INT_CST_HIGH (node
) == -1
648 && TREE_INT_CST_LOW (node
) != 0)
651 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
652 -TREE_INT_CST_LOW (node
));
655 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
656 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
663 if (TREE_OVERFLOW (node
))
664 fprintf (file
, " overflow");
666 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
667 d
= TREE_REAL_CST (node
);
668 if (REAL_VALUE_ISINF (d
))
669 fprintf (file
, " Inf");
670 else if (REAL_VALUE_ISNAN (d
))
671 fprintf (file
, " Nan");
676 REAL_VALUE_TO_DECIMAL (d
, "%e", string
);
677 fprintf (file
, " %s", string
);
682 unsigned char *p
= (unsigned char *) &TREE_REAL_CST (node
);
683 fprintf (file
, " 0x");
684 for (i
= 0; i
< sizeof TREE_REAL_CST (node
); i
++)
685 fprintf (file
, "%02x", *p
++);
693 print_node (file
, "real", TREE_REALPART (node
), indent
+ 4);
694 print_node (file
, "imag", TREE_IMAGPART (node
), indent
+ 4);
698 fprintf (file
, " \"%s\"", TREE_STRING_POINTER (node
));
699 /* Print the chain at second level. */
701 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
703 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
706 case IDENTIFIER_NODE
:
707 print_lang_identifier (file
, node
, indent
);
711 print_node (file
, "purpose", TREE_PURPOSE (node
), indent
+ 4);
712 print_node (file
, "value", TREE_VALUE (node
), indent
+ 4);
713 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
717 len
= TREE_VEC_LENGTH (node
);
718 for (i
= 0; i
< len
; i
++)
719 if (TREE_VEC_ELT (node
, i
))
722 sprintf (temp
, "elt %d", i
);
723 indent_to (file
, indent
+ 4);
724 print_node_brief (file
, temp
, TREE_VEC_ELT (node
, i
), 0);
729 print_node (file
, "op1", TREE_PURPOSE (node
), indent
+ 4);
730 print_node (file
, "op2", TREE_VALUE (node
), indent
+ 4);
734 if (TREE_CODE_CLASS (TREE_CODE (node
)) == 'x')
735 lang_print_xnode (file
, node
, indent
);