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 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
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
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
27 #include "langhooks.h"
29 /* Define the hash table of nodes already seen.
30 Such nodes are not repeated; brief cross-references are used. */
40 static struct bucket
**table
;
42 /* Print the node NODE on standard error, for debugging.
43 Most nodes referred to by this one are printed recursively
44 down to a depth of six. */
50 table
= (struct bucket
**) permalloc (HASH_SIZE
* sizeof (struct bucket
*));
51 memset ((char *) table
, 0, HASH_SIZE
* sizeof (struct bucket
*));
52 print_node (stderr
, "", node
, 0);
54 fprintf (stderr
, "\n");
57 /* Print a node in brief fashion, with just the code, address and name. */
60 print_node_brief (file
, prefix
, node
, indent
)
71 class = TREE_CODE_CLASS (TREE_CODE (node
));
73 /* Always print the slot this node is in, and its code, address and
77 fprintf (file
, "%s <%s ", prefix
, tree_code_name
[(int) TREE_CODE (node
)]);
78 fprintf (file
, HOST_PTR_PRINTF
, (char *) node
);
83 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
85 else if (class == 't')
89 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
90 fprintf (file
, " %s", IDENTIFIER_POINTER (TYPE_NAME (node
)));
91 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
92 && DECL_NAME (TYPE_NAME (node
)))
94 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
97 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
98 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
100 /* We might as well always print the value of an integer or real. */
101 if (TREE_CODE (node
) == INTEGER_CST
)
103 if (TREE_CONSTANT_OVERFLOW (node
))
104 fprintf (file
, " overflow");
107 if (TREE_INT_CST_HIGH (node
) == 0)
108 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
, TREE_INT_CST_LOW (node
));
109 else if (TREE_INT_CST_HIGH (node
) == -1
110 && TREE_INT_CST_LOW (node
) != 0)
113 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
114 -TREE_INT_CST_LOW (node
));
117 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
118 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
120 if (TREE_CODE (node
) == REAL_CST
)
124 if (TREE_OVERFLOW (node
))
125 fprintf (file
, " overflow");
127 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
128 d
= TREE_REAL_CST (node
);
129 if (REAL_VALUE_ISINF (d
))
130 fprintf (file
, " Inf");
131 else if (REAL_VALUE_ISNAN (d
))
132 fprintf (file
, " Nan");
137 REAL_VALUE_TO_DECIMAL (d
, "%e", string
);
138 fprintf (file
, " %s", string
);
143 unsigned char *p
= (unsigned char *) &TREE_REAL_CST (node
);
144 fprintf (file
, " 0x");
145 for (i
= 0; i
< sizeof TREE_REAL_CST (node
); i
++)
146 fprintf (file
, "%02x", *p
++);
156 indent_to (file
, column
)
162 /* Since this is the long way, indent to desired column. */
164 fprintf (file
, "\n");
165 for (i
= 0; i
< column
; i
++)
169 /* Print the node NODE in full on file FILE, preceded by PREFIX,
170 starting in column INDENT. */
173 print_node (file
, prefix
, node
, indent
)
181 enum machine_mode mode
;
190 class = TREE_CODE_CLASS (TREE_CODE (node
));
192 /* Don't get too deep in nesting. If the user wants to see deeper,
193 it is easy to use the address of a lowest-level node
194 as an argument in another call to debug_tree. */
198 print_node_brief (file
, prefix
, node
, indent
);
202 if (indent
> 8 && (class == 't' || class == 'd'))
204 print_node_brief (file
, prefix
, node
, indent
);
208 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
209 if (TREE_CODE (node
) == ERROR_MARK
)
211 print_node_brief (file
, prefix
, node
, indent
);
215 hash
= ((unsigned long) node
) % HASH_SIZE
;
217 /* If node is in the table, just mention its address. */
218 for (b
= table
[hash
]; b
; b
= b
->next
)
221 print_node_brief (file
, prefix
, node
, indent
);
225 /* Add this node to the table. */
226 b
= (struct bucket
*) permalloc (sizeof (struct bucket
));
228 b
->next
= table
[hash
];
231 /* Indent to the specified column, since this is the long form. */
232 indent_to (file
, indent
);
234 /* Print the slot this node is in, and its code, and address. */
235 fprintf (file
, "%s <%s ", prefix
, tree_code_name
[(int) TREE_CODE (node
)]);
236 fprintf (file
, HOST_PTR_PRINTF
, (char *) node
);
238 /* Print the name, if any. */
241 if (DECL_NAME (node
))
242 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
244 else if (class == 't')
246 if (TYPE_NAME (node
))
248 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
249 fprintf (file
, " %s", IDENTIFIER_POINTER (TYPE_NAME (node
)));
250 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
251 && DECL_NAME (TYPE_NAME (node
)))
252 fprintf (file
, " %s",
253 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
256 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
257 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
259 if (TREE_CODE (node
) == INTEGER_CST
)
262 print_node_brief (file
, "type", TREE_TYPE (node
), indent
+ 4);
266 print_node (file
, "type", TREE_TYPE (node
), indent
+ 4);
267 if (TREE_TYPE (node
))
268 indent_to (file
, indent
+ 3);
271 if (TREE_SIDE_EFFECTS (node
))
272 fputs (" side-effects", file
);
273 if (TREE_READONLY (node
))
274 fputs (" readonly", file
);
275 if (TREE_CONSTANT (node
))
276 fputs (" constant", file
);
277 if (TREE_ADDRESSABLE (node
))
278 fputs (" addressable", file
);
279 if (TREE_THIS_VOLATILE (node
))
280 fputs (" volatile", file
);
281 if (TREE_UNSIGNED (node
))
282 fputs (" unsigned", file
);
283 if (TREE_ASM_WRITTEN (node
))
284 fputs (" asm_written", file
);
285 if (TREE_USED (node
))
286 fputs (" used", file
);
287 if (TREE_NOTHROW (node
))
288 fputs (" nothrow", file
);
289 if (TREE_PUBLIC (node
))
290 fputs (" public", file
);
291 if (TREE_PRIVATE (node
))
292 fputs (" private", file
);
293 if (TREE_PROTECTED (node
))
294 fputs (" protected", file
);
295 if (TREE_STATIC (node
))
296 fputs (" static", file
);
297 if (TREE_DEPRECATED (node
))
298 fputs (" deprecated", file
);
299 if (TREE_LANG_FLAG_0 (node
))
300 fputs (" tree_0", file
);
301 if (TREE_LANG_FLAG_1 (node
))
302 fputs (" tree_1", file
);
303 if (TREE_LANG_FLAG_2 (node
))
304 fputs (" tree_2", file
);
305 if (TREE_LANG_FLAG_3 (node
))
306 fputs (" tree_3", file
);
307 if (TREE_LANG_FLAG_4 (node
))
308 fputs (" tree_4", file
);
309 if (TREE_LANG_FLAG_5 (node
))
310 fputs (" tree_5", file
);
311 if (TREE_LANG_FLAG_6 (node
))
312 fputs (" tree_6", file
);
314 /* DECL_ nodes have additional attributes. */
316 switch (TREE_CODE_CLASS (TREE_CODE (node
)))
319 mode
= DECL_MODE (node
);
321 if (DECL_IGNORED_P (node
))
322 fputs (" ignored", file
);
323 if (DECL_ABSTRACT (node
))
324 fputs (" abstract", file
);
325 if (DECL_IN_SYSTEM_HEADER (node
))
326 fputs (" in_system_header", file
);
327 if (DECL_COMMON (node
))
328 fputs (" common", file
);
329 if (DECL_EXTERNAL (node
))
330 fputs (" external", file
);
331 if (DECL_REGISTER (node
) && TREE_CODE (node
) != FIELD_DECL
332 && TREE_CODE (node
) != FUNCTION_DECL
333 && TREE_CODE (node
) != LABEL_DECL
)
334 fputs (" regdecl", file
);
335 if (DECL_NONLOCAL (node
))
336 fputs (" nonlocal", file
);
338 if (TREE_CODE (node
) == TYPE_DECL
&& TYPE_DECL_SUPPRESS_DEBUG (node
))
339 fputs (" suppress-debug", file
);
341 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INLINE (node
))
342 fputs (" inline", file
);
343 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_BUILT_IN (node
))
344 fputs (" built-in", file
);
345 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_BUILT_IN_NONANSI (node
))
346 fputs (" built-in-nonansi", file
);
347 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_NO_STATIC_CHAIN (node
))
348 fputs (" no-static-chain", file
);
350 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_PACKED (node
))
351 fputs (" packed", file
);
352 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_BIT_FIELD (node
))
353 fputs (" bit-field", file
);
354 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_NONADDRESSABLE_P (node
))
355 fputs (" nonaddressable", file
);
357 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_TOO_LATE (node
))
358 fputs (" too-late", file
);
359 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_ERROR_ISSUED (node
))
360 fputs (" error-issued", file
);
362 if (TREE_CODE (node
) == VAR_DECL
&& DECL_IN_TEXT_SECTION (node
))
363 fputs (" in-text-section", file
);
365 if (TREE_CODE (node
) == PARM_DECL
&& DECL_TRANSPARENT_UNION (node
))
366 fputs (" transparent-union", file
);
368 if (DECL_VIRTUAL_P (node
))
369 fputs (" virtual", file
);
370 if (DECL_DEFER_OUTPUT (node
))
371 fputs (" defer-output", file
);
373 if (DECL_LANG_FLAG_0 (node
))
374 fputs (" decl_0", file
);
375 if (DECL_LANG_FLAG_1 (node
))
376 fputs (" decl_1", file
);
377 if (DECL_LANG_FLAG_2 (node
))
378 fputs (" decl_2", file
);
379 if (DECL_LANG_FLAG_3 (node
))
380 fputs (" decl_3", file
);
381 if (DECL_LANG_FLAG_4 (node
))
382 fputs (" decl_4", file
);
383 if (DECL_LANG_FLAG_5 (node
))
384 fputs (" decl_5", file
);
385 if (DECL_LANG_FLAG_6 (node
))
386 fputs (" decl_6", file
);
387 if (DECL_LANG_FLAG_7 (node
))
388 fputs (" decl_7", file
);
390 fprintf (file
, " %s", GET_MODE_NAME(mode
));
391 fprintf (file
, " file %s line %d",
392 DECL_SOURCE_FILE (node
), DECL_SOURCE_LINE (node
));
394 print_node (file
, "size", DECL_SIZE (node
), indent
+ 4);
395 print_node (file
, "unit size", DECL_SIZE_UNIT (node
), indent
+ 4);
397 if (TREE_CODE (node
) != FUNCTION_DECL
398 || DECL_INLINE (node
) || DECL_BUILT_IN (node
))
399 indent_to (file
, indent
+ 3);
401 if (TREE_CODE (node
) != FUNCTION_DECL
)
403 if (DECL_USER_ALIGN (node
))
404 fprintf (file
, " user");
406 fprintf (file
, " align %d", DECL_ALIGN (node
));
407 if (TREE_CODE (node
) == FIELD_DECL
)
409 fprintf (file
, " offset_align ");
410 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
411 DECL_OFFSET_ALIGN (node
));
414 else if (DECL_BUILT_IN (node
))
416 if (DECL_BUILT_IN_CLASS (node
) == BUILT_IN_MD
)
417 fprintf (file
, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node
));
419 fprintf (file
, " built-in %s:%s",
420 built_in_class_names
[(int) DECL_BUILT_IN_CLASS (node
)],
421 built_in_names
[(int) DECL_FUNCTION_CODE (node
)]);
424 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node
))
426 fprintf (file
, " alias set ");
427 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
,
428 DECL_POINTER_ALIAS_SET (node
));
431 if (TREE_CODE (node
) == FIELD_DECL
)
433 print_node (file
, "offset", DECL_FIELD_OFFSET (node
), indent
+ 4);
434 print_node (file
, "bit offset", DECL_FIELD_BIT_OFFSET (node
),
438 print_node_brief (file
, "context", DECL_CONTEXT (node
), indent
+ 4);
439 print_node_brief (file
, "attributes",
440 DECL_ATTRIBUTES (node
), indent
+ 4);
441 print_node_brief (file
, "abstract_origin",
442 DECL_ABSTRACT_ORIGIN (node
), indent
+ 4);
444 print_node (file
, "arguments", DECL_ARGUMENTS (node
), indent
+ 4);
445 print_node (file
, "result", DECL_RESULT_FLD (node
), indent
+ 4);
446 print_node_brief (file
, "initial", DECL_INITIAL (node
), indent
+ 4);
448 (*lang_hooks
.print_decl
) (file
, node
, indent
);
450 if (DECL_RTL_SET_P (node
))
452 indent_to (file
, indent
+ 4);
453 print_rtl (file
, DECL_RTL (node
));
456 if (TREE_CODE (node
) == PARM_DECL
)
458 print_node (file
, "arg-type", DECL_ARG_TYPE (node
), indent
+ 4);
459 print_node (file
, "arg-type-as-written",
460 DECL_ARG_TYPE_AS_WRITTEN (node
), indent
+ 4);
462 if (DECL_INCOMING_RTL (node
) != 0)
464 indent_to (file
, indent
+ 4);
465 fprintf (file
, "incoming-rtl ");
466 print_rtl (file
, DECL_INCOMING_RTL (node
));
469 else if (TREE_CODE (node
) == FUNCTION_DECL
470 && DECL_SAVED_INSNS (node
) != 0)
472 indent_to (file
, indent
+ 4);
473 fprintf (file
, "saved-insns ");
474 fprintf (file
, HOST_PTR_PRINTF
, (char *) DECL_SAVED_INSNS (node
));
477 /* Print the decl chain only if decl is at second level. */
479 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
481 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
485 /* The no-force-blk flag is used for different things in
487 if ((TREE_CODE (node
) == RECORD_TYPE
488 || TREE_CODE (node
) == UNION_TYPE
489 || TREE_CODE (node
) == QUAL_UNION_TYPE
)
490 && TYPE_NO_FORCE_BLK (node
))
491 fputs (" no-force-blk", file
);
492 else if (TREE_CODE (node
) == INTEGER_TYPE
493 && TYPE_IS_SIZETYPE (node
))
494 fputs (" sizetype", file
);
495 else if (TREE_CODE (node
) == FUNCTION_TYPE
496 && TYPE_RETURNS_STACK_DEPRESSED (node
))
497 fputs (" returns-stack-depressed", file
);
499 if (TYPE_STRING_FLAG (node
))
500 fputs (" string-flag", file
);
501 if (TYPE_NEEDS_CONSTRUCTING (node
))
502 fputs (" needs-constructing", file
);
504 /* The transparent-union flag is used for different things in
506 if (TREE_CODE (node
) == UNION_TYPE
&& TYPE_TRANSPARENT_UNION (node
))
507 fputs (" transparent-union", file
);
508 else if (TREE_CODE (node
) == ARRAY_TYPE
509 && TYPE_NONALIASED_COMPONENT (node
))
510 fputs (" nonaliased-component", file
);
511 else if (TREE_CODE (node
) == FUNCTION_TYPE
512 && TYPE_AMBIENT_BOUNDEDNESS (node
))
513 fputs (" ambient-boundedness", file
);
515 if (TYPE_PACKED (node
))
516 fputs (" packed", file
);
518 if (TYPE_LANG_FLAG_0 (node
))
519 fputs (" type_0", file
);
520 if (TYPE_LANG_FLAG_1 (node
))
521 fputs (" type_1", file
);
522 if (TYPE_LANG_FLAG_2 (node
))
523 fputs (" type_2", file
);
524 if (TYPE_LANG_FLAG_3 (node
))
525 fputs (" type_3", file
);
526 if (TYPE_LANG_FLAG_4 (node
))
527 fputs (" type_4", file
);
528 if (TYPE_LANG_FLAG_5 (node
))
529 fputs (" type_5", file
);
530 if (TYPE_LANG_FLAG_6 (node
))
531 fputs (" type_6", file
);
533 mode
= TYPE_MODE (node
);
534 fprintf (file
, " %s", GET_MODE_NAME(mode
));
536 print_node (file
, "size", TYPE_SIZE (node
), indent
+ 4);
537 print_node (file
, "unit size", TYPE_SIZE_UNIT (node
), indent
+ 4);
538 indent_to (file
, indent
+ 3);
540 if (TYPE_USER_ALIGN (node
))
541 fprintf (file
, " user");
543 fprintf (file
, " align %d", TYPE_ALIGN (node
));
544 fprintf (file
, " symtab %d", TYPE_SYMTAB_ADDRESS (node
));
545 fprintf (file
, " alias set ");
546 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, TYPE_ALIAS_SET (node
));
548 print_node (file
, "attributes", TYPE_ATTRIBUTES (node
), indent
+ 4);
550 if (INTEGRAL_TYPE_P (node
) || TREE_CODE (node
) == REAL_TYPE
)
552 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
553 print_node_brief (file
, "min", TYPE_MIN_VALUE (node
), indent
+ 4);
554 print_node_brief (file
, "max", TYPE_MAX_VALUE (node
), indent
+ 4);
557 if (TREE_CODE (node
) == ENUMERAL_TYPE
)
558 print_node (file
, "values", TYPE_VALUES (node
), indent
+ 4);
559 else if (TREE_CODE (node
) == ARRAY_TYPE
|| TREE_CODE (node
) == SET_TYPE
)
560 print_node (file
, "domain", TYPE_DOMAIN (node
), indent
+ 4);
561 else if (TREE_CODE (node
) == RECORD_TYPE
562 || TREE_CODE (node
) == UNION_TYPE
563 || TREE_CODE (node
) == QUAL_UNION_TYPE
)
564 print_node (file
, "fields", TYPE_FIELDS (node
), indent
+ 4);
565 else if (TREE_CODE (node
) == FUNCTION_TYPE
566 || TREE_CODE (node
) == METHOD_TYPE
)
568 if (TYPE_METHOD_BASETYPE (node
))
569 print_node_brief (file
, "method basetype",
570 TYPE_METHOD_BASETYPE (node
), indent
+ 4);
571 print_node (file
, "arg-types", TYPE_ARG_TYPES (node
), indent
+ 4);
573 else if (TREE_CODE (node
) == OFFSET_TYPE
)
574 print_node_brief (file
, "basetype", TYPE_OFFSET_BASETYPE (node
),
577 if (TYPE_CONTEXT (node
))
578 print_node_brief (file
, "context", TYPE_CONTEXT (node
), indent
+ 4);
580 (*lang_hooks
.print_type
) (file
, node
, indent
);
582 if (TYPE_POINTER_TO (node
) || TREE_CHAIN (node
))
583 indent_to (file
, indent
+ 3);
585 print_node_brief (file
, "pointer_to_this", TYPE_POINTER_TO (node
),
587 print_node_brief (file
, "reference_to_this", TYPE_REFERENCE_TO (node
),
589 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
593 print_node (file
, "vars", BLOCK_VARS (node
), indent
+ 4);
594 print_node (file
, "supercontext", BLOCK_SUPERCONTEXT (node
), indent
+ 4);
595 print_node (file
, "subblocks", BLOCK_SUBBLOCKS (node
), indent
+ 4);
596 print_node (file
, "chain", BLOCK_CHAIN (node
), indent
+ 4);
597 print_node (file
, "abstract_origin",
598 BLOCK_ABSTRACT_ORIGIN (node
), indent
+ 4);
607 if (TREE_CODE (node
) == BIND_EXPR
)
609 print_node (file
, "vars", TREE_OPERAND (node
, 0), indent
+ 4);
610 print_node (file
, "body", TREE_OPERAND (node
, 1), indent
+ 4);
611 print_node (file
, "block", TREE_OPERAND (node
, 2), indent
+ 4);
615 len
= TREE_CODE_LENGTH (TREE_CODE (node
));
617 /* Some nodes contain rtx's, not trees,
618 after a certain point. Print the rtx's as rtx's. */
619 first_rtl
= first_rtl_op (TREE_CODE (node
));
621 for (i
= 0; i
< len
; i
++)
625 indent_to (file
, indent
+ 4);
626 fprintf (file
, "rtl %d ", i
);
627 if (TREE_OPERAND (node
, i
))
628 print_rtl (file
, (struct rtx_def
*) TREE_OPERAND (node
, i
));
630 fprintf (file
, "(nil)");
631 fprintf (file
, "\n");
637 sprintf (temp
, "arg %d", i
);
638 print_node (file
, temp
, TREE_OPERAND (node
, i
), indent
+ 4);
642 if (TREE_CODE (node
) == EXPR_WITH_FILE_LOCATION
)
644 indent_to (file
, indent
+4);
645 fprintf (file
, "%s:%d:%d",
646 (EXPR_WFL_FILENAME_NODE (node
) ?
647 EXPR_WFL_FILENAME (node
) : "(no file info)"),
648 EXPR_WFL_LINENO (node
), EXPR_WFL_COLNO (node
));
650 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
655 switch (TREE_CODE (node
))
658 if (TREE_CONSTANT_OVERFLOW (node
))
659 fprintf (file
, " overflow");
662 if (TREE_INT_CST_HIGH (node
) == 0)
663 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
664 TREE_INT_CST_LOW (node
));
665 else if (TREE_INT_CST_HIGH (node
) == -1
666 && TREE_INT_CST_LOW (node
) != 0)
669 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
670 -TREE_INT_CST_LOW (node
));
673 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
674 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
681 if (TREE_OVERFLOW (node
))
682 fprintf (file
, " overflow");
684 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
685 d
= TREE_REAL_CST (node
);
686 if (REAL_VALUE_ISINF (d
))
687 fprintf (file
, " Inf");
688 else if (REAL_VALUE_ISNAN (d
))
689 fprintf (file
, " Nan");
694 REAL_VALUE_TO_DECIMAL (d
, "%e", string
);
695 fprintf (file
, " %s", string
);
700 unsigned char *p
= (unsigned char *) &TREE_REAL_CST (node
);
701 fprintf (file
, " 0x");
702 for (i
= 0; i
< sizeof TREE_REAL_CST (node
); i
++)
703 fprintf (file
, "%02x", *p
++);
711 print_node (file
, "real", TREE_REALPART (node
), indent
+ 4);
712 print_node (file
, "imag", TREE_IMAGPART (node
), indent
+ 4);
716 fprintf (file
, " \"%s\"", TREE_STRING_POINTER (node
));
717 /* Print the chain at second level. */
719 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
721 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
724 case IDENTIFIER_NODE
:
725 (*lang_hooks
.print_identifier
) (file
, node
, indent
);
729 print_node (file
, "purpose", TREE_PURPOSE (node
), indent
+ 4);
730 print_node (file
, "value", TREE_VALUE (node
), indent
+ 4);
731 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
735 len
= TREE_VEC_LENGTH (node
);
736 for (i
= 0; i
< len
; i
++)
737 if (TREE_VEC_ELT (node
, i
))
740 sprintf (temp
, "elt %d", i
);
741 indent_to (file
, indent
+ 4);
742 print_node_brief (file
, temp
, TREE_VEC_ELT (node
, i
), 0);
747 if (TREE_CODE_CLASS (TREE_CODE (node
)) == 'x')
748 (*lang_hooks
.print_xnode
) (file
, node
, indent
);