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, 2002, 2003 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. */
53 table = (struct bucket **) xcalloc (HASH_SIZE, sizeof (struct bucket *));
54 print_node (stderr, "", node, 0);
60 /* Print a node in brief fashion, with just the code, address and name. */
63 print_node_brief (file, prefix, node, indent)
74 class = TREE_CODE_CLASS (TREE_CODE (node));
76 /* Always print the slot this node is in, and its code, address and
80 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
81 fprintf (file, HOST_PTR_PRINTF, (char *) node);
86 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
88 else if (class == 't')
92 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
93 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
94 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
95 && DECL_NAME (TYPE_NAME (node)))
97 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
100 if (TREE_CODE (node) == IDENTIFIER_NODE)
101 fprintf (file, " %s", IDENTIFIER_POINTER (node));
103 /* We might as well always print the value of an integer or real. */
104 if (TREE_CODE (node) == INTEGER_CST)
106 if (TREE_CONSTANT_OVERFLOW (node))
107 fprintf (file, " overflow");
110 if (TREE_INT_CST_HIGH (node) == 0)
111 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
112 else if (TREE_INT_CST_HIGH (node) == -1
113 && TREE_INT_CST_LOW (node) != 0)
116 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
117 -TREE_INT_CST_LOW (node));
120 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
121 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
123 if (TREE_CODE (node) == REAL_CST)
127 if (TREE_OVERFLOW (node))
128 fprintf (file, " overflow");
130 d = TREE_REAL_CST (node);
131 if (REAL_VALUE_ISINF (d))
132 fprintf (file, " Inf");
133 else if (REAL_VALUE_ISNAN (d))
134 fprintf (file, " Nan");
138 real_to_decimal (string, &d, sizeof (string), 0, 1);
139 fprintf (file, " %s", string);
147 indent_to (file, column)
153 /* Since this is the long way, indent to desired column. */
155 fprintf (file, "\n");
156 for (i = 0; i < column; i++)
160 /* Print the node NODE in full on file FILE, preceded by PREFIX,
161 starting in column INDENT. */
164 print_node (file, prefix, node, indent)
172 enum machine_mode mode;
181 class = TREE_CODE_CLASS (TREE_CODE (node));
183 /* Don't get too deep in nesting. If the user wants to see deeper,
184 it is easy to use the address of a lowest-level node
185 as an argument in another call to debug_tree. */
189 print_node_brief (file, prefix, node, indent);
193 if (indent > 8 && (class == 't' || class == 'd'))
195 print_node_brief (file, prefix, node, indent);
199 /* It is unsafe to look at any other fields of an ERROR_MARK node. */
200 if (TREE_CODE (node) == ERROR_MARK)
202 print_node_brief (file, prefix, node, indent);
206 hash = ((unsigned long) node) % HASH_SIZE;
208 /* If node is in the table, just mention its address. */
209 for (b = table[hash]; b; b = b->next)
212 print_node_brief (file, prefix, node, indent);
216 /* Add this node to the table. */
217 b = (struct bucket *) xmalloc (sizeof (struct bucket));
219 b->next = table[hash];
222 /* Indent to the specified column, since this is the long form. */
223 indent_to (file, indent);
225 /* Print the slot this node is in, and its code, and address. */
226 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
227 fprintf (file, HOST_PTR_PRINTF, (char *) node);
229 /* Print the name, if any. */
232 if (DECL_NAME (node))
233 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
235 else if (class == 't')
237 if (TYPE_NAME (node))
239 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
240 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
241 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
242 && DECL_NAME (TYPE_NAME (node)))
243 fprintf (file, " %s",
244 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
247 if (TREE_CODE (node) == IDENTIFIER_NODE)
248 fprintf (file, " %s", IDENTIFIER_POINTER (node));
250 if (TREE_CODE (node) == INTEGER_CST)
253 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
257 print_node (file, "type", TREE_TYPE (node), indent + 4);
258 if (TREE_TYPE (node))
259 indent_to (file, indent + 3);
262 if (TREE_SIDE_EFFECTS (node))
263 fputs (" side-effects", file);
264 if (TREE_READONLY (node))
265 fputs (" readonly", file);
266 if (TREE_CONSTANT (node))
267 fputs (" constant", file);
268 if (TREE_ADDRESSABLE (node))
269 fputs (" addressable", file);
270 if (TREE_THIS_VOLATILE (node))
271 fputs (" volatile", file);
272 if (TREE_UNSIGNED (node))
273 fputs (" unsigned", file);
274 if (TREE_ASM_WRITTEN (node))
275 fputs (" asm_written", file);
276 if (TREE_USED (node))
277 fputs (" used", file);
278 if (TREE_NOTHROW (node))
279 fputs (" nothrow", file);
280 if (TREE_PUBLIC (node))
281 fputs (" public", file);
282 if (TREE_PRIVATE (node))
283 fputs (" private", file);
284 if (TREE_PROTECTED (node))
285 fputs (" protected", file);
286 if (TREE_STATIC (node))
287 fputs (" static", file);
288 if (TREE_DEPRECATED (node))
289 fputs (" deprecated", file);
290 if (TREE_LANG_FLAG_0 (node))
291 fputs (" tree_0", file);
292 if (TREE_LANG_FLAG_1 (node))
293 fputs (" tree_1", file);
294 if (TREE_LANG_FLAG_2 (node))
295 fputs (" tree_2", file);
296 if (TREE_LANG_FLAG_3 (node))
297 fputs (" tree_3", file);
298 if (TREE_LANG_FLAG_4 (node))
299 fputs (" tree_4", file);
300 if (TREE_LANG_FLAG_5 (node))
301 fputs (" tree_5", file);
302 if (TREE_LANG_FLAG_6 (node))
303 fputs (" tree_6", file);
305 /* DECL_ nodes have additional attributes. */
307 switch (TREE_CODE_CLASS (TREE_CODE (node)))
310 mode = DECL_MODE (node);
312 if (DECL_IGNORED_P (node))
313 fputs (" ignored", file);
314 if (DECL_ABSTRACT (node))
315 fputs (" abstract", file);
316 if (DECL_IN_SYSTEM_HEADER (node))
317 fputs (" in_system_header", file);
318 if (DECL_COMMON (node))
319 fputs (" common", file);
320 if (DECL_EXTERNAL (node))
321 fputs (" external", file);
322 if (DECL_WEAK (node))
323 fputs (" weak", file);
324 if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
325 && TREE_CODE (node) != FUNCTION_DECL
326 && TREE_CODE (node) != LABEL_DECL)
327 fputs (" regdecl", file);
328 if (DECL_NONLOCAL (node))
329 fputs (" nonlocal", file);
331 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
332 fputs (" suppress-debug", file);
334 if (TREE_CODE (node) == FUNCTION_DECL && DID_INLINE_FUNC (node))
335 fputs (" autoinline", file);
336 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
337 fputs (" inline", file);
338 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
339 fputs (" built-in", file);
340 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
341 fputs (" no-static-chain", file);
343 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
344 fputs (" packed", file);
345 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
346 fputs (" bit-field", file);
347 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
348 fputs (" nonaddressable", file);
350 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
351 fputs (" too-late", file);
352 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
353 fputs (" error-issued", file);
355 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
356 fputs (" in-text-section", file);
357 if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
358 fputs (" thread-local", file);
360 if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
361 fputs (" transparent-union", file);
363 if (DECL_VIRTUAL_P (node))
364 fputs (" virtual", file);
365 if (DECL_DEFER_OUTPUT (node))
366 fputs (" defer-output", file);
368 if (DECL_LANG_FLAG_0 (node))
369 fputs (" decl_0", file);
370 if (DECL_LANG_FLAG_1 (node))
371 fputs (" decl_1", file);
372 if (DECL_LANG_FLAG_2 (node))
373 fputs (" decl_2", file);
374 if (DECL_LANG_FLAG_3 (node))
375 fputs (" decl_3", file);
376 if (DECL_LANG_FLAG_4 (node))
377 fputs (" decl_4", file);
378 if (DECL_LANG_FLAG_5 (node))
379 fputs (" decl_5", file);
380 if (DECL_LANG_FLAG_6 (node))
381 fputs (" decl_6", file);
382 if (DECL_LANG_FLAG_7 (node))
383 fputs (" decl_7", file);
385 fprintf (file, " %s", GET_MODE_NAME (mode));
386 fprintf (file, " file %s line %d",
387 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
389 print_node (file, "size", DECL_SIZE (node), indent + 4);
390 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
392 if (TREE_CODE (node) != FUNCTION_DECL
393 || DECL_INLINE (node) || DECL_BUILT_IN (node))
394 indent_to (file, indent + 3);
396 if (TREE_CODE (node) != FUNCTION_DECL)
398 if (DECL_USER_ALIGN (node))
399 fprintf (file, " user");
401 fprintf (file, " align %d", DECL_ALIGN (node));
402 if (TREE_CODE (node) == FIELD_DECL)
404 fprintf (file, " offset_align ");
405 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
406 DECL_OFFSET_ALIGN (node));
409 else if (DECL_BUILT_IN (node))
411 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
412 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
414 fprintf (file, " built-in %s:%s",
415 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
416 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
419 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
421 fprintf (file, " alias set ");
422 fprintf (file, HOST_WIDE_INT_PRINT_DEC,
423 DECL_POINTER_ALIAS_SET (node));
426 if (TREE_CODE (node) == FIELD_DECL)
428 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
429 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
433 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
434 print_node_brief (file, "attributes",
435 DECL_ATTRIBUTES (node), indent + 4);
436 print_node_brief (file, "abstract_origin",
437 DECL_ABSTRACT_ORIGIN (node), indent + 4);
439 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
440 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
441 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
443 (*lang_hooks.print_decl) (file, node, indent);
445 if (DECL_RTL_SET_P (node))
447 indent_to (file, indent + 4);
448 print_rtl (file, DECL_RTL (node));
451 if (TREE_CODE (node) == PARM_DECL)
453 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
454 print_node (file, "arg-type-as-written",
455 DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
457 if (DECL_INCOMING_RTL (node) != 0)
459 indent_to (file, indent + 4);
460 fprintf (file, "incoming-rtl ");
461 print_rtl (file, DECL_INCOMING_RTL (node));
464 else if (TREE_CODE (node) == FUNCTION_DECL
465 && DECL_SAVED_INSNS (node) != 0)
467 indent_to (file, indent + 4);
468 fprintf (file, "saved-insns ");
469 fprintf (file, HOST_PTR_PRINTF, (char *) DECL_SAVED_INSNS (node));
472 /* Print the decl chain only if decl is at second level. */
474 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
476 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
480 /* The no-force-blk flag is used for different things in
482 if ((TREE_CODE (node) == RECORD_TYPE
483 || TREE_CODE (node) == UNION_TYPE
484 || TREE_CODE (node) == QUAL_UNION_TYPE)
485 && TYPE_NO_FORCE_BLK (node))
486 fputs (" no-force-blk", file);
487 else if (TREE_CODE (node) == INTEGER_TYPE
488 && TYPE_IS_SIZETYPE (node))
489 fputs (" sizetype", file);
490 else if (TREE_CODE (node) == FUNCTION_TYPE
491 && TYPE_RETURNS_STACK_DEPRESSED (node))
492 fputs (" returns-stack-depressed", file);
494 if (TYPE_STRING_FLAG (node))
495 fputs (" string-flag", file);
496 if (TYPE_NEEDS_CONSTRUCTING (node))
497 fputs (" needs-constructing", file);
499 /* The transparent-union flag is used for different things in
501 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
502 fputs (" transparent-union", file);
503 else if (TREE_CODE (node) == ARRAY_TYPE
504 && TYPE_NONALIASED_COMPONENT (node))
505 fputs (" nonaliased-component", file);
506 else if (TREE_CODE (node) == FUNCTION_TYPE
507 && TYPE_AMBIENT_BOUNDEDNESS (node))
508 fputs (" ambient-boundedness", file);
510 if (TYPE_PACKED (node))
511 fputs (" packed", file);
513 if (TYPE_RESTRICT (node))
514 fputs (" restrict", file);
516 if (TYPE_LANG_FLAG_0 (node))
517 fputs (" type_0", file);
518 if (TYPE_LANG_FLAG_1 (node))
519 fputs (" type_1", file);
520 if (TYPE_LANG_FLAG_2 (node))
521 fputs (" type_2", file);
522 if (TYPE_LANG_FLAG_3 (node))
523 fputs (" type_3", file);
524 if (TYPE_LANG_FLAG_4 (node))
525 fputs (" type_4", file);
526 if (TYPE_LANG_FLAG_5 (node))
527 fputs (" type_5", file);
528 if (TYPE_LANG_FLAG_6 (node))
529 fputs (" type_6", file);
531 mode = TYPE_MODE (node);
532 fprintf (file, " %s", GET_MODE_NAME (mode));
534 print_node (file, "size", TYPE_SIZE (node), indent + 4);
535 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
536 indent_to (file, indent + 3);
538 if (TYPE_USER_ALIGN (node))
539 fprintf (file, " user");
541 fprintf (file, " align %d", TYPE_ALIGN (node));
542 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
543 fprintf (file, " alias set ");
544 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TYPE_ALIAS_SET (node));
546 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
548 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
550 fprintf (file, " precision %d", TYPE_PRECISION (node));
551 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
552 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
555 if (TREE_CODE (node) == ENUMERAL_TYPE)
556 print_node (file, "values", TYPE_VALUES (node), indent + 4);
557 else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
558 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
559 else if (TREE_CODE (node) == RECORD_TYPE
560 || TREE_CODE (node) == UNION_TYPE
561 || TREE_CODE (node) == QUAL_UNION_TYPE)
562 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
563 else if (TREE_CODE (node) == FUNCTION_TYPE
564 || TREE_CODE (node) == METHOD_TYPE)
566 if (TYPE_METHOD_BASETYPE (node))
567 print_node_brief (file, "method basetype",
568 TYPE_METHOD_BASETYPE (node), indent + 4);
569 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
571 else if (TREE_CODE (node) == OFFSET_TYPE)
572 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
575 if (TYPE_CONTEXT (node))
576 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
578 (*lang_hooks.print_type) (file, node, indent);
580 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
581 indent_to (file, indent + 3);
583 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
585 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
587 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
591 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
592 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
593 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
594 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
595 print_node (file, "abstract_origin",
596 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
605 if (TREE_CODE (node) == BIND_EXPR)
607 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
608 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
609 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
613 len = TREE_CODE_LENGTH (TREE_CODE (node));
615 /* Some nodes contain rtx's, not trees,
616 after a certain point. Print the rtx's as rtx's. */
617 first_rtl = first_rtl_op (TREE_CODE (node));
619 for (i = 0; i < len; i++)
623 indent_to (file, indent + 4);
624 fprintf (file, "rtl %d ", i);
625 if (TREE_OPERAND (node, i))
626 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
628 fprintf (file, "(nil)");
629 fprintf (file, "\n");
635 sprintf (temp, "arg %d", i);
636 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
640 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
642 indent_to (file, indent+4);
643 fprintf (file, "%s:%d:%d",
644 (EXPR_WFL_FILENAME_NODE (node ) ?
645 EXPR_WFL_FILENAME (node) : "(no file info)"),
646 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
648 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
653 switch (TREE_CODE (node))
656 if (TREE_CONSTANT_OVERFLOW (node))
657 fprintf (file, " overflow");
660 if (TREE_INT_CST_HIGH (node) == 0)
661 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
662 TREE_INT_CST_LOW (node));
663 else if (TREE_INT_CST_HIGH (node) == -1
664 && TREE_INT_CST_LOW (node) != 0)
667 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
668 -TREE_INT_CST_LOW (node));
671 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
672 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
679 if (TREE_OVERFLOW (node))
680 fprintf (file, " overflow");
682 d = TREE_REAL_CST (node);
683 if (REAL_VALUE_ISINF (d))
684 fprintf (file, " Inf");
685 else if (REAL_VALUE_ISNAN (d))
686 fprintf (file, " Nan");
690 real_to_decimal (string, &d, sizeof (string), 0, 1);
691 fprintf (file, " %s", string);
698 tree vals = TREE_VECTOR_CST_ELTS (node);
704 for (link = vals; link; link = TREE_CHAIN (link), ++i)
706 sprintf (buf, "elt%d: ", i);
707 print_node (file, buf, TREE_VALUE (link), indent + 4);
713 print_node (file, "real", TREE_REALPART (node), indent + 4);
714 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
719 const char *p = TREE_STRING_POINTER (node);
720 int i = TREE_STRING_LENGTH (node);
725 if (ch >= ' ' && ch < 127)
728 fprintf(file, "\\%03o", ch & 0xFF);
732 /* Print the chain at second level. */
734 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
736 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
739 case IDENTIFIER_NODE:
740 (*lang_hooks.print_identifier) (file, node, indent);
744 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
745 print_node (file, "value", TREE_VALUE (node), indent + 4);
746 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
750 len = TREE_VEC_LENGTH (node);
751 for (i = 0; i < len; i++)
752 if (TREE_VEC_ELT (node, i))
755 sprintf (temp, "elt %d", i);
756 indent_to (file, indent + 4);
757 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
762 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
763 (*lang_hooks.print_xnode) (file, node, indent);