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;
167 class = TREE_CODE_CLASS (TREE_CODE (node));
169 /* Don't get too deep in nesting. If the user wants to see deeper,
170 it is easy to use the address of a lowest-level node
171 as an argument in another call to debug_tree. */
175 print_node_brief (file, prefix, node, indent);
179 if (indent > 8 && (class == 't' || class == 'd'))
181 print_node_brief (file, prefix, node, indent);
185 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
186 if (TREE_CODE (node) == ERROR_MARK)
188 print_node_brief (file, prefix, node, indent);
192 hash = ((unsigned long) node) % HASH_SIZE;
194 /* If node is in the table, just mention its address. */
195 for (b = table[hash]; b; b = b->next)
198 print_node_brief (file, prefix, node, indent);
202 /* Add this node to the table. */
203 b = xmalloc (sizeof (struct bucket));
205 b->next = table[hash];
208 /* Indent to the specified column, since this is the long form. */
209 indent_to (file, indent);
211 /* Print the slot this node is in, and its code, and address. */
212 fprintf (file, "%s <%s " HOST_PTR_PRINTF,
213 prefix, tree_code_name[(int) TREE_CODE (node)], (void *) node);
215 /* Print the name, if any. */
218 if (DECL_NAME (node))
219 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
221 else if (class == 't')
223 if (TYPE_NAME (node))
225 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
226 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
227 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
228 && DECL_NAME (TYPE_NAME (node)))
229 fprintf (file, " %s",
230 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
233 if (TREE_CODE (node) == IDENTIFIER_NODE)
234 fprintf (file, " %s", IDENTIFIER_POINTER (node));
236 if (TREE_CODE (node) == INTEGER_CST)
239 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
243 print_node (file, "type", TREE_TYPE (node), indent + 4);
244 if (TREE_TYPE (node))
245 indent_to (file, indent + 3);
248 if (TREE_SIDE_EFFECTS (node))
249 fputs (" side-effects", file);
250 if (TREE_READONLY (node))
251 fputs (" readonly", file);
252 if (TREE_CONSTANT (node))
253 fputs (" constant", file);
254 if (TREE_ADDRESSABLE (node))
255 fputs (" addressable", file);
256 if (TREE_THIS_VOLATILE (node))
257 fputs (" volatile", file);
258 if (TREE_ASM_WRITTEN (node))
259 fputs (" asm_written", file);
260 if (TREE_USED (node))
261 fputs (" used", file);
262 if (TREE_NOTHROW (node))
263 fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
264 if (TREE_PUBLIC (node))
265 fputs (" public", file);
266 if (TREE_PRIVATE (node))
267 fputs (" private", file);
268 if (TREE_PROTECTED (node))
269 fputs (" protected", file);
270 if (TREE_STATIC (node))
271 fputs (" static", file);
272 if (TREE_DEPRECATED (node))
273 fputs (" deprecated", file);
274 if (TREE_LANG_FLAG_0 (node))
275 fputs (" tree_0", file);
276 if (TREE_LANG_FLAG_1 (node))
277 fputs (" tree_1", file);
278 if (TREE_LANG_FLAG_2 (node))
279 fputs (" tree_2", file);
280 if (TREE_LANG_FLAG_3 (node))
281 fputs (" tree_3", file);
282 if (TREE_LANG_FLAG_4 (node))
283 fputs (" tree_4", file);
284 if (TREE_LANG_FLAG_5 (node))
285 fputs (" tree_5", file);
286 if (TREE_LANG_FLAG_6 (node))
287 fputs (" tree_6", file);
289 /* DECL_ nodes have additional attributes. */
291 switch (TREE_CODE_CLASS (TREE_CODE (node)))
294 mode = DECL_MODE (node);
296 if (DECL_UNSIGNED (node))
297 fputs (" unsigned", file);
298 if (DECL_IGNORED_P (node))
299 fputs (" ignored", file);
300 if (DECL_ABSTRACT (node))
301 fputs (" abstract", file);
302 if (DECL_IN_SYSTEM_HEADER (node))
303 fputs (" in_system_header", file);
304 if (DECL_COMMON (node))
305 fputs (" common", file);
306 if (DECL_EXTERNAL (node))
307 fputs (" external", file);
308 if (DECL_WEAK (node))
309 fputs (" weak", file);
310 if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
311 && TREE_CODE (node) != FUNCTION_DECL
312 && TREE_CODE (node) != LABEL_DECL)
313 fputs (" regdecl", file);
314 if (DECL_NONLOCAL (node))
315 fputs (" nonlocal", file);
317 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
318 fputs (" suppress-debug", file);
320 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
321 fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file);
322 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
323 fputs (" built-in", file);
324 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
325 fputs (" no-static-chain", file);
327 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
328 fputs (" packed", file);
329 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
330 fputs (" bit-field", file);
331 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
332 fputs (" nonaddressable", file);
334 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
335 fputs (" too-late", file);
336 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
337 fputs (" error-issued", file);
339 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
340 fputs (" in-text-section", file);
341 if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
342 fputs (" thread-local", file);
344 if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
345 fputs (" transparent-union", file);
347 if (DECL_VIRTUAL_P (node))
348 fputs (" virtual", file);
349 if (DECL_DEFER_OUTPUT (node))
350 fputs (" defer-output", file);
352 if (DECL_LANG_FLAG_0 (node))
353 fputs (" decl_0", file);
354 if (DECL_LANG_FLAG_1 (node))
355 fputs (" decl_1", file);
356 if (DECL_LANG_FLAG_2 (node))
357 fputs (" decl_2", file);
358 if (DECL_LANG_FLAG_3 (node))
359 fputs (" decl_3", file);
360 if (DECL_LANG_FLAG_4 (node))
361 fputs (" decl_4", file);
362 if (DECL_LANG_FLAG_5 (node))
363 fputs (" decl_5", file);
364 if (DECL_LANG_FLAG_6 (node))
365 fputs (" decl_6", file);
366 if (DECL_LANG_FLAG_7 (node))
367 fputs (" decl_7", file);
369 fprintf (file, " %s", GET_MODE_NAME (mode));
370 fprintf (file, " file %s line %d",
371 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
373 print_node (file, "size", DECL_SIZE (node), indent + 4);
374 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
376 if (TREE_CODE (node) != FUNCTION_DECL
377 || DECL_INLINE (node) || DECL_BUILT_IN (node))
378 indent_to (file, indent + 3);
380 if (TREE_CODE (node) != FUNCTION_DECL)
382 if (DECL_USER_ALIGN (node))
383 fprintf (file, " user");
385 fprintf (file, " align %d", DECL_ALIGN (node));
386 if (TREE_CODE (node) == FIELD_DECL)
387 fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
388 DECL_OFFSET_ALIGN (node));
390 else if (DECL_BUILT_IN (node))
392 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
393 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
395 fprintf (file, " built-in %s:%s",
396 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
397 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
400 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
401 fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
402 DECL_POINTER_ALIAS_SET (node));
404 if (TREE_CODE (node) == FIELD_DECL)
406 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
407 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
411 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
412 print_node_brief (file, "attributes",
413 DECL_ATTRIBUTES (node), indent + 4);
414 print_node_brief (file, "abstract_origin",
415 DECL_ABSTRACT_ORIGIN (node), indent + 4);
417 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
418 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
419 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
421 lang_hooks.print_decl (file, node, indent);
423 if (DECL_RTL_SET_P (node))
425 indent_to (file, indent + 4);
426 print_rtl (file, DECL_RTL (node));
429 if (TREE_CODE (node) == PARM_DECL)
431 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
432 print_node (file, "arg-type-as-written",
433 DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
435 if (DECL_INCOMING_RTL (node) != 0)
437 indent_to (file, indent + 4);
438 fprintf (file, "incoming-rtl ");
439 print_rtl (file, DECL_INCOMING_RTL (node));
442 else if (TREE_CODE (node) == FUNCTION_DECL
443 && DECL_STRUCT_FUNCTION (node) != 0)
445 indent_to (file, indent + 4);
446 fprintf (file, "saved-insns " HOST_PTR_PRINTF,
447 (void *) DECL_STRUCT_FUNCTION (node));
450 /* Print the decl chain only if decl is at second level. */
452 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
454 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
458 if (TYPE_UNSIGNED (node))
459 fputs (" unsigned", file);
461 /* The no-force-blk flag is used for different things in
463 if ((TREE_CODE (node) == RECORD_TYPE
464 || TREE_CODE (node) == UNION_TYPE
465 || TREE_CODE (node) == QUAL_UNION_TYPE)
466 && TYPE_NO_FORCE_BLK (node))
467 fputs (" no-force-blk", file);
468 else if (TREE_CODE (node) == INTEGER_TYPE
469 && TYPE_IS_SIZETYPE (node))
470 fputs (" sizetype", file);
471 else if (TREE_CODE (node) == FUNCTION_TYPE
472 && TYPE_RETURNS_STACK_DEPRESSED (node))
473 fputs (" returns-stack-depressed", file);
475 if (TYPE_STRING_FLAG (node))
476 fputs (" string-flag", file);
477 if (TYPE_NEEDS_CONSTRUCTING (node))
478 fputs (" needs-constructing", file);
480 /* The transparent-union flag is used for different things in
482 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
483 fputs (" transparent-union", file);
484 else if (TREE_CODE (node) == ARRAY_TYPE
485 && TYPE_NONALIASED_COMPONENT (node))
486 fputs (" nonaliased-component", file);
488 if (TYPE_PACKED (node))
489 fputs (" packed", file);
491 if (TYPE_RESTRICT (node))
492 fputs (" restrict", file);
494 if (TYPE_LANG_FLAG_0 (node))
495 fputs (" type_0", file);
496 if (TYPE_LANG_FLAG_1 (node))
497 fputs (" type_1", file);
498 if (TYPE_LANG_FLAG_2 (node))
499 fputs (" type_2", file);
500 if (TYPE_LANG_FLAG_3 (node))
501 fputs (" type_3", file);
502 if (TYPE_LANG_FLAG_4 (node))
503 fputs (" type_4", file);
504 if (TYPE_LANG_FLAG_5 (node))
505 fputs (" type_5", file);
506 if (TYPE_LANG_FLAG_6 (node))
507 fputs (" type_6", file);
509 mode = TYPE_MODE (node);
510 fprintf (file, " %s", GET_MODE_NAME (mode));
512 print_node (file, "size", TYPE_SIZE (node), indent + 4);
513 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
514 indent_to (file, indent + 3);
516 if (TYPE_USER_ALIGN (node))
517 fprintf (file, " user");
519 fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
520 TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
521 TYPE_ALIAS_SET (node));
523 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
525 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
527 fprintf (file, " precision %d", TYPE_PRECISION (node));
528 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
529 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
532 if (TREE_CODE (node) == ENUMERAL_TYPE)
533 print_node (file, "values", TYPE_VALUES (node), indent + 4);
534 else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
535 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
536 else if (TREE_CODE (node) == RECORD_TYPE
537 || TREE_CODE (node) == UNION_TYPE
538 || TREE_CODE (node) == QUAL_UNION_TYPE)
539 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
540 else if (TREE_CODE (node) == FUNCTION_TYPE
541 || TREE_CODE (node) == METHOD_TYPE)
543 if (TYPE_METHOD_BASETYPE (node))
544 print_node_brief (file, "method basetype",
545 TYPE_METHOD_BASETYPE (node), indent + 4);
546 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
548 else if (TREE_CODE (node) == OFFSET_TYPE)
549 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
552 if (TYPE_CONTEXT (node))
553 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
555 lang_hooks.print_type (file, node, indent);
557 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
558 indent_to (file, indent + 3);
560 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
562 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
564 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
568 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
569 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
570 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
571 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
572 print_node (file, "abstract_origin",
573 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
582 if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node))
583 fputs (" unsigned", file);
584 else if (TREE_CODE (node) == SAVE_EXPR && SAVE_EXPR_NOPLACEHOLDER (node))
585 fputs (" noplaceholder", file);
586 if (TREE_CODE (node) == BIND_EXPR)
588 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
589 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
590 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
594 len = TREE_CODE_LENGTH (TREE_CODE (node));
596 /* Some nodes contain rtx's, not trees,
597 after a certain point. Print the rtx's as rtx's. */
598 first_rtl = first_rtl_op (TREE_CODE (node));
600 for (i = 0; i < len; i++)
604 indent_to (file, indent + 4);
605 fprintf (file, "rtl %d ", i);
606 if (TREE_OPERAND (node, i))
607 print_rtl (file, (rtx) TREE_OPERAND (node, i));
609 fprintf (file, "(nil)");
610 fprintf (file, "\n");
616 sprintf (temp, "arg %d", i);
617 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
621 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
623 indent_to (file, indent+4);
624 fprintf (file, "%s:%d:%d",
625 (EXPR_WFL_FILENAME_NODE (node ) ?
626 EXPR_WFL_FILENAME (node) : "(no file info)"),
627 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
629 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
634 switch (TREE_CODE (node))
637 if (TREE_CONSTANT_OVERFLOW (node))
638 fprintf (file, " overflow");
641 if (TREE_INT_CST_HIGH (node) == 0)
642 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
643 TREE_INT_CST_LOW (node));
644 else if (TREE_INT_CST_HIGH (node) == -1
645 && TREE_INT_CST_LOW (node) != 0)
646 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
647 -TREE_INT_CST_LOW (node));
649 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
650 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
657 if (TREE_OVERFLOW (node))
658 fprintf (file, " overflow");
660 d = TREE_REAL_CST (node);
661 if (REAL_VALUE_ISINF (d))
662 fprintf (file, " Inf");
663 else if (REAL_VALUE_ISNAN (d))
664 fprintf (file, " Nan");
668 real_to_decimal (string, &d, sizeof (string), 0, 1);
669 fprintf (file, " %s", string);
676 tree vals = TREE_VECTOR_CST_ELTS (node);
682 for (link = vals; link; link = TREE_CHAIN (link), ++i)
684 sprintf (buf, "elt%d: ", i);
685 print_node (file, buf, TREE_VALUE (link), indent + 4);
691 print_node (file, "real", TREE_REALPART (node), indent + 4);
692 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
697 const char *p = TREE_STRING_POINTER (node);
698 int i = TREE_STRING_LENGTH (node);
703 if (ch >= ' ' && ch < 127)
706 fprintf(file, "\\%03o", ch & 0xFF);
710 /* Print the chain at second level. */
712 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
714 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
717 case IDENTIFIER_NODE:
718 lang_hooks.print_identifier (file, node, indent);
722 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
723 print_node (file, "value", TREE_VALUE (node), indent + 4);
724 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
728 len = TREE_VEC_LENGTH (node);
729 for (i = 0; i < len; i++)
730 if (TREE_VEC_ELT (node, i))
733 sprintf (temp, "elt %d", i);
734 indent_to (file, indent + 4);
735 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
740 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
741 lang_hooks.print_xnode (file, node, indent);