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 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
29 #include "langhooks.h"
31 /* Define the hash table of nodes already seen.
32 Such nodes are not repeated; brief cross-references are used. */
42 static struct bucket **table;
44 /* Print the node NODE on standard error, for debugging.
45 Most nodes referred to by this one are printed recursively
46 down to a depth of six. */
52 table = (struct bucket **) permalloc (HASH_SIZE * sizeof (struct bucket *));
53 memset ((char *) table, 0, HASH_SIZE * sizeof (struct bucket *));
54 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));
102 /* We might as well always print the value of an integer or real. */
103 if (TREE_CODE (node) == INTEGER_CST)
105 if (TREE_CONSTANT_OVERFLOW (node))
106 fprintf (file, " overflow");
109 if (TREE_INT_CST_HIGH (node) == 0)
110 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
111 else if (TREE_INT_CST_HIGH (node) == -1
112 && TREE_INT_CST_LOW (node) != 0)
115 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
116 -TREE_INT_CST_LOW (node));
119 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
120 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
122 if (TREE_CODE (node) == REAL_CST)
126 if (TREE_OVERFLOW (node))
127 fprintf (file, " overflow");
129 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
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");
139 REAL_VALUE_TO_DECIMAL (d, "%e", string);
140 fprintf (file, " %s", string);
145 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
146 fprintf (file, " 0x");
147 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
148 fprintf (file, "%02x", *p++);
158 indent_to (file, column)
164 /* Since this is the long way, indent to desired column. */
166 fprintf (file, "\n");
167 for (i = 0; i < column; i++)
171 /* Print the node NODE in full on file FILE, preceded by PREFIX,
172 starting in column INDENT. */
175 print_node (file, prefix, node, indent)
183 enum machine_mode mode;
192 class = TREE_CODE_CLASS (TREE_CODE (node));
194 /* Don't get too deep in nesting. If the user wants to see deeper,
195 it is easy to use the address of a lowest-level node
196 as an argument in another call to debug_tree. */
200 print_node_brief (file, prefix, node, indent);
204 if (indent > 8 && (class == 't' || class == 'd'))
206 print_node_brief (file, prefix, node, indent);
210 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
211 if (TREE_CODE (node) == ERROR_MARK)
213 print_node_brief (file, prefix, node, indent);
217 hash = ((unsigned long) node) % HASH_SIZE;
219 /* If node is in the table, just mention its address. */
220 for (b = table[hash]; b; b = b->next)
223 print_node_brief (file, prefix, node, indent);
227 /* Add this node to the table. */
228 b = (struct bucket *) permalloc (sizeof (struct bucket));
230 b->next = table[hash];
233 /* Indent to the specified column, since this is the long form. */
234 indent_to (file, indent);
236 /* Print the slot this node is in, and its code, and address. */
237 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
238 fprintf (file, HOST_PTR_PRINTF, (char *) node);
240 /* Print the name, if any. */
243 if (DECL_NAME (node))
244 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
246 else if (class == 't')
248 if (TYPE_NAME (node))
250 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
251 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
252 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
253 && DECL_NAME (TYPE_NAME (node)))
254 fprintf (file, " %s",
255 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
258 if (TREE_CODE (node) == IDENTIFIER_NODE)
259 fprintf (file, " %s", IDENTIFIER_POINTER (node));
261 if (TREE_CODE (node) == INTEGER_CST)
264 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
268 print_node (file, "type", TREE_TYPE (node), indent + 4);
269 if (TREE_TYPE (node))
270 indent_to (file, indent + 3);
273 if (TREE_SIDE_EFFECTS (node))
274 fputs (" side-effects", file);
275 if (TREE_READONLY (node))
276 fputs (" readonly", file);
277 if (TREE_CONSTANT (node))
278 fputs (" constant", file);
279 if (TREE_ADDRESSABLE (node))
280 fputs (" addressable", file);
281 if (TREE_THIS_VOLATILE (node))
282 fputs (" volatile", file);
283 if (TREE_UNSIGNED (node))
284 fputs (" unsigned", file);
285 if (TREE_ASM_WRITTEN (node))
286 fputs (" asm_written", file);
287 if (TREE_USED (node))
288 fputs (" used", file);
289 if (TREE_NOTHROW (node))
290 fputs (" nothrow", file);
291 if (TREE_PUBLIC (node))
292 fputs (" public", file);
293 if (TREE_PRIVATE (node))
294 fputs (" private", file);
295 if (TREE_PROTECTED (node))
296 fputs (" protected", file);
297 if (TREE_STATIC (node))
298 fputs (" static", file);
299 if (TREE_DEPRECATED (node))
300 fputs (" deprecated", file);
301 if (TREE_LANG_FLAG_0 (node))
302 fputs (" tree_0", file);
303 if (TREE_LANG_FLAG_1 (node))
304 fputs (" tree_1", file);
305 if (TREE_LANG_FLAG_2 (node))
306 fputs (" tree_2", file);
307 if (TREE_LANG_FLAG_3 (node))
308 fputs (" tree_3", file);
309 if (TREE_LANG_FLAG_4 (node))
310 fputs (" tree_4", file);
311 if (TREE_LANG_FLAG_5 (node))
312 fputs (" tree_5", file);
313 if (TREE_LANG_FLAG_6 (node))
314 fputs (" tree_6", file);
316 /* DECL_ nodes have additional attributes. */
318 switch (TREE_CODE_CLASS (TREE_CODE (node)))
321 mode = DECL_MODE (node);
323 if (DECL_IGNORED_P (node))
324 fputs (" ignored", file);
325 if (DECL_ABSTRACT (node))
326 fputs (" abstract", file);
327 if (DECL_IN_SYSTEM_HEADER (node))
328 fputs (" in_system_header", file);
329 if (DECL_COMMON (node))
330 fputs (" common", file);
331 if (DECL_EXTERNAL (node))
332 fputs (" external", file);
333 if (DECL_WEAK (node))
334 fputs (" weak", file);
335 if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
336 && TREE_CODE (node) != FUNCTION_DECL
337 && TREE_CODE (node) != LABEL_DECL)
338 fputs (" regdecl", file);
339 if (DECL_NONLOCAL (node))
340 fputs (" nonlocal", file);
342 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
343 fputs (" suppress-debug", file);
345 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
346 fputs (" inline", file);
347 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
348 fputs (" built-in", file);
349 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN_NONANSI (node))
350 fputs (" built-in-nonansi", file);
351 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
352 fputs (" no-static-chain", file);
354 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
355 fputs (" packed", file);
356 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
357 fputs (" bit-field", file);
358 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
359 fputs (" nonaddressable", file);
361 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
362 fputs (" too-late", file);
363 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
364 fputs (" error-issued", file);
366 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
367 fputs (" in-text-section", file);
369 if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
370 fputs (" transparent-union", file);
372 if (DECL_VIRTUAL_P (node))
373 fputs (" virtual", file);
374 if (DECL_DEFER_OUTPUT (node))
375 fputs (" defer-output", file);
377 if (DECL_LANG_FLAG_0 (node))
378 fputs (" decl_0", file);
379 if (DECL_LANG_FLAG_1 (node))
380 fputs (" decl_1", file);
381 if (DECL_LANG_FLAG_2 (node))
382 fputs (" decl_2", file);
383 if (DECL_LANG_FLAG_3 (node))
384 fputs (" decl_3", file);
385 if (DECL_LANG_FLAG_4 (node))
386 fputs (" decl_4", file);
387 if (DECL_LANG_FLAG_5 (node))
388 fputs (" decl_5", file);
389 if (DECL_LANG_FLAG_6 (node))
390 fputs (" decl_6", file);
391 if (DECL_LANG_FLAG_7 (node))
392 fputs (" decl_7", file);
394 fprintf (file, " %s", GET_MODE_NAME (mode));
395 fprintf (file, " file %s line %d",
396 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
398 print_node (file, "size", DECL_SIZE (node), indent + 4);
399 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
401 if (TREE_CODE (node) != FUNCTION_DECL
402 || DECL_INLINE (node) || DECL_BUILT_IN (node))
403 indent_to (file, indent + 3);
405 if (TREE_CODE (node) != FUNCTION_DECL)
407 if (DECL_USER_ALIGN (node))
408 fprintf (file, " user");
410 fprintf (file, " align %d", DECL_ALIGN (node));
411 if (TREE_CODE (node) == FIELD_DECL)
413 fprintf (file, " offset_align ");
414 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
415 DECL_OFFSET_ALIGN (node));
418 else if (DECL_BUILT_IN (node))
420 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
421 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (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)]);
428 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
430 fprintf (file, " alias set ");
431 fprintf (file, HOST_WIDE_INT_PRINT_DEC,
432 DECL_POINTER_ALIAS_SET (node));
435 if (TREE_CODE (node) == FIELD_DECL)
437 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
438 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
442 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
443 print_node_brief (file, "attributes",
444 DECL_ATTRIBUTES (node), indent + 4);
445 print_node_brief (file, "abstract_origin",
446 DECL_ABSTRACT_ORIGIN (node), indent + 4);
448 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
449 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
450 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
452 (*lang_hooks.print_decl) (file, node, indent);
454 if (DECL_RTL_SET_P (node))
456 indent_to (file, indent + 4);
457 print_rtl (file, DECL_RTL (node));
460 if (TREE_CODE (node) == PARM_DECL)
462 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
463 print_node (file, "arg-type-as-written",
464 DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
466 if (DECL_INCOMING_RTL (node) != 0)
468 indent_to (file, indent + 4);
469 fprintf (file, "incoming-rtl ");
470 print_rtl (file, DECL_INCOMING_RTL (node));
473 else if (TREE_CODE (node) == FUNCTION_DECL
474 && DECL_SAVED_INSNS (node) != 0)
476 indent_to (file, indent + 4);
477 fprintf (file, "saved-insns ");
478 fprintf (file, HOST_PTR_PRINTF, (char *) DECL_SAVED_INSNS (node));
481 /* Print the decl chain only if decl is at second level. */
483 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
485 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
489 /* The no-force-blk flag is used for different things in
491 if ((TREE_CODE (node) == RECORD_TYPE
492 || TREE_CODE (node) == UNION_TYPE
493 || TREE_CODE (node) == QUAL_UNION_TYPE)
494 && TYPE_NO_FORCE_BLK (node))
495 fputs (" no-force-blk", file);
496 else if (TREE_CODE (node) == INTEGER_TYPE
497 && TYPE_IS_SIZETYPE (node))
498 fputs (" sizetype", file);
499 else if (TREE_CODE (node) == FUNCTION_TYPE
500 && TYPE_RETURNS_STACK_DEPRESSED (node))
501 fputs (" returns-stack-depressed", file);
503 if (TYPE_STRING_FLAG (node))
504 fputs (" string-flag", file);
505 if (TYPE_NEEDS_CONSTRUCTING (node))
506 fputs (" needs-constructing", file);
508 /* The transparent-union flag is used for different things in
510 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
511 fputs (" transparent-union", file);
512 else if (TREE_CODE (node) == ARRAY_TYPE
513 && TYPE_NONALIASED_COMPONENT (node))
514 fputs (" nonaliased-component", file);
515 else if (TREE_CODE (node) == FUNCTION_TYPE
516 && TYPE_AMBIENT_BOUNDEDNESS (node))
517 fputs (" ambient-boundedness", file);
519 if (TYPE_PACKED (node))
520 fputs (" packed", file);
522 if (TYPE_LANG_FLAG_0 (node))
523 fputs (" type_0", file);
524 if (TYPE_LANG_FLAG_1 (node))
525 fputs (" type_1", file);
526 if (TYPE_LANG_FLAG_2 (node))
527 fputs (" type_2", file);
528 if (TYPE_LANG_FLAG_3 (node))
529 fputs (" type_3", file);
530 if (TYPE_LANG_FLAG_4 (node))
531 fputs (" type_4", file);
532 if (TYPE_LANG_FLAG_5 (node))
533 fputs (" type_5", file);
534 if (TYPE_LANG_FLAG_6 (node))
535 fputs (" type_6", file);
537 mode = TYPE_MODE (node);
538 fprintf (file, " %s", GET_MODE_NAME (mode));
540 print_node (file, "size", TYPE_SIZE (node), indent + 4);
541 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
542 indent_to (file, indent + 3);
544 if (TYPE_USER_ALIGN (node))
545 fprintf (file, " user");
547 fprintf (file, " align %d", TYPE_ALIGN (node));
548 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
549 fprintf (file, " alias set ");
550 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TYPE_ALIAS_SET (node));
552 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
554 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
556 fprintf (file, " precision %d", TYPE_PRECISION (node));
557 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
558 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
561 if (TREE_CODE (node) == ENUMERAL_TYPE)
562 print_node (file, "values", TYPE_VALUES (node), indent + 4);
563 else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
564 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
565 else if (TREE_CODE (node) == RECORD_TYPE
566 || TREE_CODE (node) == UNION_TYPE
567 || TREE_CODE (node) == QUAL_UNION_TYPE)
568 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
569 else if (TREE_CODE (node) == FUNCTION_TYPE
570 || TREE_CODE (node) == METHOD_TYPE)
572 if (TYPE_METHOD_BASETYPE (node))
573 print_node_brief (file, "method basetype",
574 TYPE_METHOD_BASETYPE (node), indent + 4);
575 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
577 else if (TREE_CODE (node) == OFFSET_TYPE)
578 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
581 if (TYPE_CONTEXT (node))
582 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
584 (*lang_hooks.print_type) (file, node, indent);
586 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
587 indent_to (file, indent + 3);
589 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
591 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
593 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
597 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
598 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
599 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
600 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
601 print_node (file, "abstract_origin",
602 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
611 if (TREE_CODE (node) == BIND_EXPR)
613 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
614 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
615 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
619 len = TREE_CODE_LENGTH (TREE_CODE (node));
621 /* Some nodes contain rtx's, not trees,
622 after a certain point. Print the rtx's as rtx's. */
623 first_rtl = first_rtl_op (TREE_CODE (node));
625 for (i = 0; i < len; i++)
629 indent_to (file, indent + 4);
630 fprintf (file, "rtl %d ", i);
631 if (TREE_OPERAND (node, i))
632 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
634 fprintf (file, "(nil)");
635 fprintf (file, "\n");
641 sprintf (temp, "arg %d", i);
642 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
646 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
648 indent_to (file, indent+4);
649 fprintf (file, "%s:%d:%d",
650 (EXPR_WFL_FILENAME_NODE (node ) ?
651 EXPR_WFL_FILENAME (node) : "(no file info)"),
652 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
654 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
659 switch (TREE_CODE (node))
662 if (TREE_CONSTANT_OVERFLOW (node))
663 fprintf (file, " overflow");
666 if (TREE_INT_CST_HIGH (node) == 0)
667 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
668 TREE_INT_CST_LOW (node));
669 else if (TREE_INT_CST_HIGH (node) == -1
670 && TREE_INT_CST_LOW (node) != 0)
673 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
674 -TREE_INT_CST_LOW (node));
677 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
678 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
685 if (TREE_OVERFLOW (node))
686 fprintf (file, " overflow");
688 #if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
689 d = TREE_REAL_CST (node);
690 if (REAL_VALUE_ISINF (d))
691 fprintf (file, " Inf");
692 else if (REAL_VALUE_ISNAN (d))
693 fprintf (file, " Nan");
698 REAL_VALUE_TO_DECIMAL (d, "%e", string);
699 fprintf (file, " %s", string);
704 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
705 fprintf (file, " 0x");
706 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
707 fprintf (file, "%02x", *p++);
716 tree vals = TREE_VECTOR_CST_ELTS (node);
722 for (link = vals; link; link = TREE_CHAIN (link), ++i)
724 sprintf (buf, "elt%d: ", i);
725 print_node (file, buf, TREE_VALUE (link), indent + 4);
731 print_node (file, "real", TREE_REALPART (node), indent + 4);
732 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
736 fprintf (file, " \"%s\"", TREE_STRING_POINTER (node));
737 /* Print the chain at second level. */
739 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
741 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
744 case IDENTIFIER_NODE:
745 (*lang_hooks.print_identifier) (file, node, indent);
749 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
750 print_node (file, "value", TREE_VALUE (node), indent + 4);
751 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
755 len = TREE_VEC_LENGTH (node);
756 for (i = 0; i < len; i++)
757 if (TREE_VEC_ELT (node, i))
760 sprintf (temp, "elt %d", i);
761 indent_to (file, indent + 4);
762 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
767 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
768 (*lang_hooks.print_xnode) (file, node, indent);