1 /* Prints out tree in human readable form - GCC
2 Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 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
25 #include "coretypes.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. */
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. */
50 debug_tree (tree node
)
52 table
= xcalloc (HASH_SIZE
, sizeof (struct bucket
*));
53 print_node (stderr
, "", node
, 0);
59 /* Print a node in brief fashion, with just the code, address and name. */
62 print_node_brief (FILE *file
, const char *prefix
, tree node
, int indent
)
69 class = TREE_CODE_CLASS (TREE_CODE (node
));
71 /* Always print the slot this node is in, and its code, address and
75 fprintf (file
, "%s <%s " HOST_PTR_PRINTF
,
76 prefix
, tree_code_name
[(int) TREE_CODE (node
)], (char *) node
);
81 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
83 else if (class == 't')
87 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
88 fprintf (file
, " %s", IDENTIFIER_POINTER (TYPE_NAME (node
)));
89 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
90 && DECL_NAME (TYPE_NAME (node
)))
92 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
95 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
96 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
98 /* We might as well always print the value of an integer or real. */
99 if (TREE_CODE (node
) == INTEGER_CST
)
101 if (TREE_CONSTANT_OVERFLOW (node
))
102 fprintf (file
, " overflow");
105 if (TREE_INT_CST_HIGH (node
) == 0)
106 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
, TREE_INT_CST_LOW (node
));
107 else if (TREE_INT_CST_HIGH (node
) == -1
108 && TREE_INT_CST_LOW (node
) != 0)
109 fprintf (file
, "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
110 -TREE_INT_CST_LOW (node
));
112 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
113 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
115 if (TREE_CODE (node
) == REAL_CST
)
119 if (TREE_OVERFLOW (node
))
120 fprintf (file
, " overflow");
122 d
= TREE_REAL_CST (node
);
123 if (REAL_VALUE_ISINF (d
))
124 fprintf (file
, " Inf");
125 else if (REAL_VALUE_ISNAN (d
))
126 fprintf (file
, " Nan");
130 real_to_decimal (string
, &d
, sizeof (string
), 0, 1);
131 fprintf (file
, " %s", string
);
139 indent_to (FILE *file
, int column
)
143 /* Since this is the long way, indent to desired column. */
145 fprintf (file
, "\n");
146 for (i
= 0; i
< column
; i
++)
150 /* Print the node NODE in full on file FILE, preceded by PREFIX,
151 starting in column INDENT. */
154 print_node (FILE *file
, const char *prefix
, tree node
, int indent
)
158 enum machine_mode mode
;
163 expanded_location xloc
;
168 class = TREE_CODE_CLASS (TREE_CODE (node
));
170 /* Don't get too deep in nesting. If the user wants to see deeper,
171 it is easy to use the address of a lowest-level node
172 as an argument in another call to debug_tree. */
176 print_node_brief (file
, prefix
, node
, indent
);
180 if (indent
> 8 && (class == 't' || class == 'd'))
182 print_node_brief (file
, prefix
, node
, indent
);
186 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
187 if (TREE_CODE (node
) == ERROR_MARK
)
189 print_node_brief (file
, prefix
, node
, indent
);
193 hash
= ((unsigned long) node
) % HASH_SIZE
;
195 /* If node is in the table, just mention its address. */
196 for (b
= table
[hash
]; b
; b
= b
->next
)
199 print_node_brief (file
, prefix
, node
, indent
);
203 /* Add this node to the table. */
204 b
= xmalloc (sizeof (struct bucket
));
206 b
->next
= table
[hash
];
209 /* Indent to the specified column, since this is the long form. */
210 indent_to (file
, indent
);
212 /* Print the slot this node is in, and its code, and address. */
213 fprintf (file
, "%s <%s " HOST_PTR_PRINTF
,
214 prefix
, tree_code_name
[(int) TREE_CODE (node
)], (void *) node
);
216 /* Print the name, if any. */
219 if (DECL_NAME (node
))
220 fprintf (file
, " %s", IDENTIFIER_POINTER (DECL_NAME (node
)));
222 else if (class == 't')
224 if (TYPE_NAME (node
))
226 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
227 fprintf (file
, " %s", IDENTIFIER_POINTER (TYPE_NAME (node
)));
228 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
229 && DECL_NAME (TYPE_NAME (node
)))
230 fprintf (file
, " %s",
231 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node
))));
234 if (TREE_CODE (node
) == IDENTIFIER_NODE
)
235 fprintf (file
, " %s", IDENTIFIER_POINTER (node
));
237 if (TREE_CODE (node
) == INTEGER_CST
)
240 print_node_brief (file
, "type", TREE_TYPE (node
), indent
+ 4);
244 print_node (file
, "type", TREE_TYPE (node
), indent
+ 4);
245 if (TREE_TYPE (node
))
246 indent_to (file
, indent
+ 3);
249 if (!TYPE_P (node
) && TREE_SIDE_EFFECTS (node
))
250 fputs (" side-effects", file
);
252 if (TYPE_P (node
) ? TYPE_READONLY (node
) : TREE_READONLY (node
))
253 fputs (" readonly", file
);
254 if (!TYPE_P (node
) && TREE_CONSTANT (node
))
255 fputs (" constant", file
);
256 if (TREE_INVARIANT (node
))
257 fputs (" invariant", file
);
258 if (TREE_ADDRESSABLE (node
))
259 fputs (" addressable", file
);
260 if (TREE_THIS_VOLATILE (node
))
261 fputs (" volatile", file
);
262 if (TREE_ASM_WRITTEN (node
))
263 fputs (" asm_written", file
);
264 if (TREE_USED (node
))
265 fputs (" used", file
);
266 if (TREE_NOTHROW (node
))
267 fputs (TYPE_P (node
) ? " align-ok" : " nothrow", file
);
268 if (TREE_PUBLIC (node
))
269 fputs (" public", file
);
270 if (TREE_PRIVATE (node
))
271 fputs (" private", file
);
272 if (TREE_PROTECTED (node
))
273 fputs (" protected", file
);
274 if (TREE_STATIC (node
))
275 fputs (" static", file
);
276 if (TREE_DEPRECATED (node
))
277 fputs (" deprecated", file
);
278 if (TREE_VISITED (node
))
279 fputs (" visited", file
);
280 if (TREE_LANG_FLAG_0 (node
))
281 fputs (" tree_0", file
);
282 if (TREE_LANG_FLAG_1 (node
))
283 fputs (" tree_1", file
);
284 if (TREE_LANG_FLAG_2 (node
))
285 fputs (" tree_2", file
);
286 if (TREE_LANG_FLAG_3 (node
))
287 fputs (" tree_3", file
);
288 if (TREE_LANG_FLAG_4 (node
))
289 fputs (" tree_4", file
);
290 if (TREE_LANG_FLAG_5 (node
))
291 fputs (" tree_5", file
);
292 if (TREE_LANG_FLAG_6 (node
))
293 fputs (" tree_6", file
);
295 /* DECL_ nodes have additional attributes. */
297 switch (TREE_CODE_CLASS (TREE_CODE (node
)))
300 mode
= DECL_MODE (node
);
302 if (DECL_UNSIGNED (node
))
303 fputs (" unsigned", file
);
304 if (DECL_IGNORED_P (node
))
305 fputs (" ignored", file
);
306 if (DECL_ABSTRACT (node
))
307 fputs (" abstract", file
);
308 if (DECL_IN_SYSTEM_HEADER (node
))
309 fputs (" in_system_header", file
);
310 if (DECL_COMMON (node
))
311 fputs (" common", file
);
312 if (DECL_EXTERNAL (node
))
313 fputs (" external", file
);
314 if (DECL_WEAK (node
))
315 fputs (" weak", file
);
316 if (DECL_REGISTER (node
) && TREE_CODE (node
) != FIELD_DECL
317 && TREE_CODE (node
) != FUNCTION_DECL
318 && TREE_CODE (node
) != LABEL_DECL
)
319 fputs (" regdecl", file
);
320 if (DECL_NONLOCAL (node
))
321 fputs (" nonlocal", file
);
323 if (TREE_CODE (node
) == TYPE_DECL
&& TYPE_DECL_SUPPRESS_DEBUG (node
))
324 fputs (" suppress-debug", file
);
326 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INLINE (node
))
327 fputs (DECL_DECLARED_INLINE_P (node
) ? " inline" : " autoinline", file
);
328 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_BUILT_IN (node
))
329 fputs (" built-in", file
);
330 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_NO_STATIC_CHAIN (node
))
331 fputs (" no-static-chain", file
);
333 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_PACKED (node
))
334 fputs (" packed", file
);
335 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_BIT_FIELD (node
))
336 fputs (" bit-field", file
);
337 if (TREE_CODE (node
) == FIELD_DECL
&& DECL_NONADDRESSABLE_P (node
))
338 fputs (" nonaddressable", file
);
340 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_TOO_LATE (node
))
341 fputs (" too-late", file
);
342 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_ERROR_ISSUED (node
))
343 fputs (" error-issued", file
);
345 if (TREE_CODE (node
) == VAR_DECL
&& DECL_IN_TEXT_SECTION (node
))
346 fputs (" in-text-section", file
);
347 if (TREE_CODE (node
) == VAR_DECL
&& DECL_THREAD_LOCAL (node
))
348 fputs (" thread-local", file
);
350 if (TREE_CODE (node
) == PARM_DECL
&& DECL_TRANSPARENT_UNION (node
))
351 fputs (" transparent-union", file
);
353 if (DECL_VIRTUAL_P (node
))
354 fputs (" virtual", file
);
355 if (DECL_DEFER_OUTPUT (node
))
356 fputs (" defer-output", file
);
358 if (DECL_LANG_FLAG_0 (node
))
359 fputs (" decl_0", file
);
360 if (DECL_LANG_FLAG_1 (node
))
361 fputs (" decl_1", file
);
362 if (DECL_LANG_FLAG_2 (node
))
363 fputs (" decl_2", file
);
364 if (DECL_LANG_FLAG_3 (node
))
365 fputs (" decl_3", file
);
366 if (DECL_LANG_FLAG_4 (node
))
367 fputs (" decl_4", file
);
368 if (DECL_LANG_FLAG_5 (node
))
369 fputs (" decl_5", file
);
370 if (DECL_LANG_FLAG_6 (node
))
371 fputs (" decl_6", file
);
372 if (DECL_LANG_FLAG_7 (node
))
373 fputs (" decl_7", file
);
375 fprintf (file
, " %s", GET_MODE_NAME (mode
));
376 xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
377 fprintf (file
, " file %s line %d", xloc
.file
, xloc
.line
);
379 print_node (file
, "size", DECL_SIZE (node
), indent
+ 4);
380 print_node (file
, "unit size", DECL_SIZE_UNIT (node
), indent
+ 4);
382 if (TREE_CODE (node
) != FUNCTION_DECL
383 || DECL_INLINE (node
) || DECL_BUILT_IN (node
))
384 indent_to (file
, indent
+ 3);
386 if (TREE_CODE (node
) != FUNCTION_DECL
)
388 if (DECL_USER_ALIGN (node
))
389 fprintf (file
, " user");
391 fprintf (file
, " align %d", DECL_ALIGN (node
));
392 if (TREE_CODE (node
) == FIELD_DECL
)
393 fprintf (file
, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED
,
394 DECL_OFFSET_ALIGN (node
));
396 else if (DECL_BUILT_IN (node
))
398 if (DECL_BUILT_IN_CLASS (node
) == BUILT_IN_MD
)
399 fprintf (file
, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node
));
401 fprintf (file
, " built-in %s:%s",
402 built_in_class_names
[(int) DECL_BUILT_IN_CLASS (node
)],
403 built_in_names
[(int) DECL_FUNCTION_CODE (node
)]);
406 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node
))
407 fprintf (file
, " alias set " HOST_WIDE_INT_PRINT_DEC
,
408 DECL_POINTER_ALIAS_SET (node
));
410 if (TREE_CODE (node
) == FIELD_DECL
)
412 print_node (file
, "offset", DECL_FIELD_OFFSET (node
), indent
+ 4);
413 print_node (file
, "bit offset", DECL_FIELD_BIT_OFFSET (node
),
417 print_node_brief (file
, "context", DECL_CONTEXT (node
), indent
+ 4);
418 print_node_brief (file
, "attributes",
419 DECL_ATTRIBUTES (node
), indent
+ 4);
420 print_node_brief (file
, "abstract_origin",
421 DECL_ABSTRACT_ORIGIN (node
), indent
+ 4);
423 print_node (file
, "arguments", DECL_ARGUMENTS (node
), indent
+ 4);
424 print_node (file
, "result", DECL_RESULT_FLD (node
), indent
+ 4);
425 print_node_brief (file
, "initial", DECL_INITIAL (node
), indent
+ 4);
427 lang_hooks
.print_decl (file
, node
, indent
);
429 if (DECL_RTL_SET_P (node
))
431 indent_to (file
, indent
+ 4);
432 print_rtl (file
, DECL_RTL (node
));
435 if (TREE_CODE (node
) == PARM_DECL
)
437 print_node (file
, "arg-type", DECL_ARG_TYPE (node
), indent
+ 4);
438 print_node (file
, "arg-type-as-written",
439 DECL_ARG_TYPE_AS_WRITTEN (node
), indent
+ 4);
441 if (DECL_INCOMING_RTL (node
) != 0)
443 indent_to (file
, indent
+ 4);
444 fprintf (file
, "incoming-rtl ");
445 print_rtl (file
, DECL_INCOMING_RTL (node
));
448 else if (TREE_CODE (node
) == FUNCTION_DECL
449 && DECL_STRUCT_FUNCTION (node
) != 0)
451 indent_to (file
, indent
+ 4);
452 fprintf (file
, "saved-insns " HOST_PTR_PRINTF
,
453 (void *) DECL_STRUCT_FUNCTION (node
));
456 /* Print the decl chain only if decl is at second level. */
458 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
460 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
464 if (TYPE_UNSIGNED (node
))
465 fputs (" unsigned", file
);
467 /* The no-force-blk flag is used for different things in
469 if ((TREE_CODE (node
) == RECORD_TYPE
470 || TREE_CODE (node
) == UNION_TYPE
471 || TREE_CODE (node
) == QUAL_UNION_TYPE
)
472 && TYPE_NO_FORCE_BLK (node
))
473 fputs (" no-force-blk", file
);
474 else if (TREE_CODE (node
) == INTEGER_TYPE
475 && TYPE_IS_SIZETYPE (node
))
476 fputs (" sizetype", file
);
477 else if (TREE_CODE (node
) == FUNCTION_TYPE
478 && TYPE_RETURNS_STACK_DEPRESSED (node
))
479 fputs (" returns-stack-depressed", file
);
481 if (TYPE_STRING_FLAG (node
))
482 fputs (" string-flag", file
);
483 if (TYPE_NEEDS_CONSTRUCTING (node
))
484 fputs (" needs-constructing", file
);
486 /* The transparent-union flag is used for different things in
488 if (TREE_CODE (node
) == UNION_TYPE
&& TYPE_TRANSPARENT_UNION (node
))
489 fputs (" transparent-union", file
);
490 else if (TREE_CODE (node
) == ARRAY_TYPE
491 && TYPE_NONALIASED_COMPONENT (node
))
492 fputs (" nonaliased-component", file
);
494 if (TYPE_PACKED (node
))
495 fputs (" packed", file
);
497 if (TYPE_RESTRICT (node
))
498 fputs (" restrict", file
);
500 if (TYPE_LANG_FLAG_0 (node
))
501 fputs (" type_0", file
);
502 if (TYPE_LANG_FLAG_1 (node
))
503 fputs (" type_1", file
);
504 if (TYPE_LANG_FLAG_2 (node
))
505 fputs (" type_2", file
);
506 if (TYPE_LANG_FLAG_3 (node
))
507 fputs (" type_3", file
);
508 if (TYPE_LANG_FLAG_4 (node
))
509 fputs (" type_4", file
);
510 if (TYPE_LANG_FLAG_5 (node
))
511 fputs (" type_5", file
);
512 if (TYPE_LANG_FLAG_6 (node
))
513 fputs (" type_6", file
);
515 mode
= TYPE_MODE (node
);
516 fprintf (file
, " %s", GET_MODE_NAME (mode
));
518 print_node (file
, "size", TYPE_SIZE (node
), indent
+ 4);
519 print_node (file
, "unit size", TYPE_SIZE_UNIT (node
), indent
+ 4);
520 indent_to (file
, indent
+ 3);
522 if (TYPE_USER_ALIGN (node
))
523 fprintf (file
, " user");
525 fprintf (file
, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC
,
526 TYPE_ALIGN (node
), TYPE_SYMTAB_ADDRESS (node
),
527 TYPE_ALIAS_SET (node
));
529 print_node (file
, "attributes", TYPE_ATTRIBUTES (node
), indent
+ 4);
531 if (INTEGRAL_TYPE_P (node
) || TREE_CODE (node
) == REAL_TYPE
)
533 fprintf (file
, " precision %d", TYPE_PRECISION (node
));
534 print_node_brief (file
, "min", TYPE_MIN_VALUE (node
), indent
+ 4);
535 print_node_brief (file
, "max", TYPE_MAX_VALUE (node
), indent
+ 4);
538 if (TREE_CODE (node
) == ENUMERAL_TYPE
)
539 print_node (file
, "values", TYPE_VALUES (node
), indent
+ 4);
540 else if (TREE_CODE (node
) == ARRAY_TYPE
|| TREE_CODE (node
) == SET_TYPE
)
541 print_node (file
, "domain", TYPE_DOMAIN (node
), indent
+ 4);
542 else if (TREE_CODE (node
) == RECORD_TYPE
543 || TREE_CODE (node
) == UNION_TYPE
544 || TREE_CODE (node
) == QUAL_UNION_TYPE
)
545 print_node (file
, "fields", TYPE_FIELDS (node
), indent
+ 4);
546 else if (TREE_CODE (node
) == FUNCTION_TYPE
547 || TREE_CODE (node
) == METHOD_TYPE
)
549 if (TYPE_METHOD_BASETYPE (node
))
550 print_node_brief (file
, "method basetype",
551 TYPE_METHOD_BASETYPE (node
), indent
+ 4);
552 print_node (file
, "arg-types", TYPE_ARG_TYPES (node
), indent
+ 4);
554 else if (TREE_CODE (node
) == OFFSET_TYPE
)
555 print_node_brief (file
, "basetype", TYPE_OFFSET_BASETYPE (node
),
558 if (TYPE_CONTEXT (node
))
559 print_node_brief (file
, "context", TYPE_CONTEXT (node
), indent
+ 4);
561 lang_hooks
.print_type (file
, node
, indent
);
563 if (TYPE_POINTER_TO (node
) || TREE_CHAIN (node
))
564 indent_to (file
, indent
+ 3);
566 print_node_brief (file
, "pointer_to_this", TYPE_POINTER_TO (node
),
568 print_node_brief (file
, "reference_to_this", TYPE_REFERENCE_TO (node
),
570 print_node_brief (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
579 if (TREE_CODE (node
) == BIT_FIELD_REF
&& BIT_FIELD_REF_UNSIGNED (node
))
580 fputs (" unsigned", file
);
581 else if (TREE_CODE (node
) == SAVE_EXPR
&& SAVE_EXPR_NOPLACEHOLDER (node
))
582 fputs (" noplaceholder", file
);
583 if (TREE_CODE (node
) == BIND_EXPR
)
585 print_node (file
, "vars", TREE_OPERAND (node
, 0), indent
+ 4);
586 print_node (file
, "body", TREE_OPERAND (node
, 1), indent
+ 4);
587 print_node (file
, "block", TREE_OPERAND (node
, 2), indent
+ 4);
591 len
= TREE_CODE_LENGTH (TREE_CODE (node
));
593 /* Some nodes contain rtx's, not trees,
594 after a certain point. Print the rtx's as rtx's. */
595 first_rtl
= first_rtl_op (TREE_CODE (node
));
597 for (i
= 0; i
< len
; i
++)
601 indent_to (file
, indent
+ 4);
602 fprintf (file
, "rtl %d ", i
);
603 if (TREE_OPERAND (node
, i
))
604 print_rtl (file
, (rtx
) TREE_OPERAND (node
, i
));
606 fprintf (file
, "(nil)");
607 fprintf (file
, "\n");
613 sprintf (temp
, "arg %d", i
);
614 print_node (file
, temp
, TREE_OPERAND (node
, i
), indent
+ 4);
618 print_node (file
, "chain", TREE_CHAIN (node
), indent
+ 4);
623 switch (TREE_CODE (node
))
626 if (TREE_CONSTANT_OVERFLOW (node
))
627 fprintf (file
, " overflow");
630 if (TREE_INT_CST_HIGH (node
) == 0)
631 fprintf (file
, HOST_WIDE_INT_PRINT_UNSIGNED
,
632 TREE_INT_CST_LOW (node
));
633 else if (TREE_INT_CST_HIGH (node
) == -1
634 && TREE_INT_CST_LOW (node
) != 0)
635 fprintf (file
, "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
636 -TREE_INT_CST_LOW (node
));
638 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
639 TREE_INT_CST_HIGH (node
), TREE_INT_CST_LOW (node
));
646 if (TREE_OVERFLOW (node
))
647 fprintf (file
, " overflow");
649 d
= TREE_REAL_CST (node
);
650 if (REAL_VALUE_ISINF (d
))
651 fprintf (file
, " Inf");
652 else if (REAL_VALUE_ISNAN (d
))
653 fprintf (file
, " Nan");
657 real_to_decimal (string
, &d
, sizeof (string
), 0, 1);
658 fprintf (file
, " %s", string
);
665 tree vals
= TREE_VECTOR_CST_ELTS (node
);
671 for (link
= vals
; link
; link
= TREE_CHAIN (link
), ++i
)
673 sprintf (buf
, "elt%d: ", i
);
674 print_node (file
, buf
, TREE_VALUE (link
), indent
+ 4);
680 print_node (file
, "real", TREE_REALPART (node
), indent
+ 4);
681 print_node (file
, "imag", TREE_IMAGPART (node
), indent
+ 4);
686 const char *p
= TREE_STRING_POINTER (node
);
687 int i
= TREE_STRING_LENGTH (node
);
692 if (ch
>= ' ' && ch
< 127)
695 fprintf(file
, "\\%03o", ch
& 0xFF);
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 lang_hooks
.print_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
, "vars", BLOCK_VARS (node
), indent
+ 4);
730 print_node (file
, "supercontext", BLOCK_SUPERCONTEXT (node
),
732 print_node (file
, "subblocks", BLOCK_SUBBLOCKS (node
), indent
+ 4);
733 print_node (file
, "chain", BLOCK_CHAIN (node
), indent
+ 4);
734 print_node (file
, "abstract_origin",
735 BLOCK_ABSTRACT_ORIGIN (node
), indent
+ 4);
739 if (TREE_CODE_CLASS (TREE_CODE (node
)) == 'x')
740 lang_hooks
.print_xnode (file
, node
, indent
);
747 if (EXPR_HAS_LOCATION (node
))
749 expanded_location xloc
= expand_location (EXPR_LOCATION (node
));
750 indent_to (file
, indent
+4);
751 fprintf (file
, "%s:%d", xloc
.file
, xloc
.line
);