]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/print-tree.c
projects / thirdparty / gcc.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Makefile.in, [...]: replace "GNU CC" with "GCC".
[thirdparty/gcc.git] / gcc / print-tree.c
CommitLineData
52eeef3a 1/* Prints out tree in human readable form - GNU C-compiler
06ceef4e
RK		 2 Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
52eeef3a 4
1322177d 5This file is part of GCC.
52eeef3a 6
1322177d
LB		 7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 2, or (at your option) any later
10version.
52eeef3a 11
1322177d
LB		 12GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13WARRANTY; without even the implied warranty of MERCHANTABILITY or
14FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15for more details.
52eeef3a
RS		 16
17You should have received a copy of the GNU General Public License
1322177d
LB		 18along with GCC; see the file COPYING. If not, write to the Free
19Software Foundation, 59 Temple Place - Suite 330, Boston, MA
2002111-1307, USA. */
52eeef3a
RS		 21
22
23#include "config.h"
670ee920 24#include "system.h"
52eeef3a 25#include "tree.h"
a3770a81 26#include "ggc.h"
52eeef3a 27
52eeef3a
RS		 28/* Define the hash table of nodes already seen.
29 Such nodes are not repeated; brief cross-references are used. */
30
31#define HASH_SIZE 37
32
33struct bucket
34{
35 tree node;
36 struct bucket *next;
37};
38
39static struct bucket **table;
40
41/* Print the node NODE on standard error, for debugging.
42 Most nodes referred to by this one are printed recursively
43 down to a depth of six. */
44
45void
46debug_tree (node)
47 tree node;
48{
1f8f4a0b 49 table = (struct bucket **) permalloc (HASH_SIZE * sizeof (struct bucket *));
961192e1 50 memset ((char *) table, 0, HASH_SIZE * sizeof (struct bucket *));
52eeef3a
RS		 51 print_node (stderr, "", node, 0);
52 table = 0;
52eeef3a
RS		 53 fprintf (stderr, "\n");
54}
55
56/* Print a node in brief fashion, with just the code, address and name. */
57
58void
59print_node_brief (file, prefix, node, indent)
60 FILE *file;
5d5993dd 61 const char *prefix;
52eeef3a
RS		 62 tree node;
63 int indent;
64{
65 char class;
66
67 if (node == 0)
68 return;
69
70 class = TREE_CODE_CLASS (TREE_CODE (node));
71
72 /* Always print the slot this node is in, and its code, address and
73 name if any. */
74 if (indent > 0)
75 fprintf (file, " ");
906c4e36 76 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
7bcac048 77 fprintf (file, HOST_PTR_PRINTF, (char *) node);
52eeef3a
RS		 78
79 if (class == 'd')
80 {
81 if (DECL_NAME (node))
82 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
83 }
84 else if (class == 't')
85 {
86 if (TYPE_NAME (node))
87 {
88 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
89 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
90 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
91 && DECL_NAME (TYPE_NAME (node)))
92 fprintf (file, " %s",
93 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
94 }
95 }
96 if (TREE_CODE (node) == IDENTIFIER_NODE)
97 fprintf (file, " %s", IDENTIFIER_POINTER (node));
f2aca197
RK		 98
99 /* We might as well always print the value of an integer or real. */
52eeef3a
RS		 100 if (TREE_CODE (node) == INTEGER_CST)
101 {
3e5f8018
RK		 102 if (TREE_CONSTANT_OVERFLOW (node))
103 fprintf (file, " overflow");
104
1e66ce77 105 fprintf (file, " ");
52eeef3a 106 if (TREE_INT_CST_HIGH (node) == 0)
1e66ce77 107 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
52eeef3a
RS		 108 else if (TREE_INT_CST_HIGH (node) == -1
109 && TREE_INT_CST_LOW (node) != 0)
1e66ce77
RK		 110 {
111 fprintf (file, "-");
112 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
05bccae2 113 -TREE_INT_CST_LOW (node));
1e66ce77 114 }
52eeef3a 115 else
1e66ce77 116 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
906c4e36 117 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
52eeef3a
RS		 118 }
119 if (TREE_CODE (node) == REAL_CST)
120 {
7063dcbe
RK		 121 REAL_VALUE_TYPE d;
122
86b38416
RK		 123 if (TREE_OVERFLOW (node))
124 fprintf (file, " overflow");
125
126#if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
7063dcbe 127 d = TREE_REAL_CST (node);
86b38416
RK		 128 if (REAL_VALUE_ISINF (d))
129 fprintf (file, " Inf");
130 else if (REAL_VALUE_ISNAN (d))
131 fprintf (file, " Nan");
132 else
133 {
134 char string[100];
135
136 REAL_VALUE_TO_DECIMAL (d, "%e", string);
137 fprintf (file, " %s", string);
138 }
52eeef3a
RS		 139#else
140 {
141 int i;
48daf828 142 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
52eeef3a
RS		 143 fprintf (file, " 0x");
144 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
145 fprintf (file, "%02x", *p++);
146 fprintf (file, "");
147 }
86b38416 148#endif
52eeef3a
RS		 149 }
150
151 fprintf (file, ">");
152}
153
154void
155indent_to (file, column)
156 FILE *file;
157 int column;
158{
159 int i;
160
161 /* Since this is the long way, indent to desired column. */
162 if (column > 0)
163 fprintf (file, "\n");
164 for (i = 0; i < column; i++)
165 fprintf (file, " ");
166}
167\f
168/* Print the node NODE in full on file FILE, preceded by PREFIX,
169 starting in column INDENT. */
170
171void
172print_node (file, prefix, node, indent)
173 FILE *file;
5d5993dd 174 const char *prefix;
52eeef3a
RS		 175 tree node;
176 int indent;
177{
178 int hash;
179 struct bucket *b;
180 enum machine_mode mode;
181 char class;
182 int len;
183 int first_rtl;
184 int i;
185
186 if (node == 0)
187 return;
188
189 class = TREE_CODE_CLASS (TREE_CODE (node));
190
191 /* Don't get too deep in nesting. If the user wants to see deeper,
192 it is easy to use the address of a lowest-level node
193 as an argument in another call to debug_tree. */
194
195 if (indent > 24)
196 {
197 print_node_brief (file, prefix, node, indent);
198 return;
199 }
200
201 if (indent > 8 && (class == 't' || class == 'd'))
202 {
203 print_node_brief (file, prefix, node, indent);
204 return;
205 }
206
0f41302f 207 /* It is unsafe to look at any other filds of an ERROR_MARK node. */
52eeef3a
RS		 208 if (TREE_CODE (node) == ERROR_MARK)
209 {
210 print_node_brief (file, prefix, node, indent);
211 return;
212 }
213
7bcac048 214 hash = ((unsigned long) node) % HASH_SIZE;
52eeef3a
RS		 215
216 /* If node is in the table, just mention its address. */
217 for (b = table[hash]; b; b = b->next)
218 if (b->node == node)
219 {
220 print_node_brief (file, prefix, node, indent);
221 return;
222 }
223
224 /* Add this node to the table. */
1f8f4a0b 225 b = (struct bucket *) permalloc (sizeof (struct bucket));
52eeef3a
RS		 226 b->node = node;
227 b->next = table[hash];
228 table[hash] = b;
229
230 /* Indent to the specified column, since this is the long form. */
231 indent_to (file, indent);
232
233 /* Print the slot this node is in, and its code, and address. */
906c4e36 234 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
7bcac048 235 fprintf (file, HOST_PTR_PRINTF, (char *) node);
52eeef3a
RS		 236
237 /* Print the name, if any. */
238 if (class == 'd')
239 {
240 if (DECL_NAME (node))
241 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
242 }
243 else if (class == 't')
244 {
245 if (TYPE_NAME (node))
246 {
247 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
248 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
249 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
250 && DECL_NAME (TYPE_NAME (node)))
251 fprintf (file, " %s",
252 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
253 }
254 }
255 if (TREE_CODE (node) == IDENTIFIER_NODE)
256 fprintf (file, " %s", IDENTIFIER_POINTER (node));
257
258 if (TREE_CODE (node) == INTEGER_CST)
259 {
260 if (indent <= 4)
261 print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
262 }
263 else
264 {
265 print_node (file, "type", TREE_TYPE (node), indent + 4);
266 if (TREE_TYPE (node))
267 indent_to (file, indent + 3);
52eeef3a
RS		 268 }
269
270 if (TREE_SIDE_EFFECTS (node))
271 fputs (" side-effects", file);
272 if (TREE_READONLY (node))
273 fputs (" readonly", file);
274 if (TREE_CONSTANT (node))
275 fputs (" constant", file);
276 if (TREE_ADDRESSABLE (node))
277 fputs (" addressable", file);
278 if (TREE_THIS_VOLATILE (node))
279 fputs (" volatile", file);
280 if (TREE_UNSIGNED (node))
281 fputs (" unsigned", file);
282 if (TREE_ASM_WRITTEN (node))
283 fputs (" asm_written", file);
284 if (TREE_USED (node))
285 fputs (" used", file);
12a22e76
JM		 286 if (TREE_NOTHROW (node))
287 fputs (" nothrow", file);
52eeef3a
RS		 288 if (TREE_PUBLIC (node))
289 fputs (" public", file);
86fff623
MM		 290 if (TREE_PRIVATE (node))
291 fputs (" private", file);
292 if (TREE_PROTECTED (node))
293 fputs (" protected", file);
52eeef3a
RS		 294 if (TREE_STATIC (node))
295 fputs (" static", file);
296 if (TREE_LANG_FLAG_0 (node))
297 fputs (" tree_0", file);
298 if (TREE_LANG_FLAG_1 (node))
299 fputs (" tree_1", file);
300 if (TREE_LANG_FLAG_2 (node))
301 fputs (" tree_2", file);
302 if (TREE_LANG_FLAG_3 (node))
303 fputs (" tree_3", file);
304 if (TREE_LANG_FLAG_4 (node))
305 fputs (" tree_4", file);
306 if (TREE_LANG_FLAG_5 (node))
307 fputs (" tree_5", file);
308 if (TREE_LANG_FLAG_6 (node))
309 fputs (" tree_6", file);
310
311 /* DECL_ nodes have additional attributes. */
312
313 switch (TREE_CODE_CLASS (TREE_CODE (node)))
314 {
315 case 'd':
316 mode = DECL_MODE (node);
317
96a31ab8
RK		 318 if (DECL_IGNORED_P (node))
319 fputs (" ignored", file);
320 if (DECL_ABSTRACT (node))
321 fputs (" abstract", file);
322 if (DECL_IN_SYSTEM_HEADER (node))
323 fputs (" in_system_header", file);
324 if (DECL_COMMON (node))
325 fputs (" common", file);
216d5cdd 326 if (DECL_EXTERNAL (node))
52eeef3a 327 fputs (" external", file);
3af78b06
RK		 328 if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
329 && TREE_CODE (node) != FUNCTION_DECL
330 && TREE_CODE (node) != LABEL_DECL)
52eeef3a 331 fputs (" regdecl", file);
96a31ab8
RK		 332 if (DECL_NONLOCAL (node))
333 fputs (" nonlocal", file);
96a31ab8
RK		 334
335 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
788d4ba0 336 fputs (" suppress-debug", file);
96a31ab8 337
17aec3eb
RK		 338 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
339 fputs (" inline", file);
96a31ab8
RK		 340 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
341 fputs (" built-in", file);
342 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN_NONANSI (node))
343 fputs (" built-in-nonansi", file);
3af78b06
RK		 344 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
345 fputs (" no-static-chain", file);
96a31ab8 346
17aec3eb
RK		 347 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
348 fputs (" packed", file);
96a31ab8 349 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
52eeef3a 350 fputs (" bit-field", file);
6732576c
RK		 351 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
352 fputs (" nonaddressable", file);
17aec3eb 353
96a31ab8
RK		 354 if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
355 fputs (" too-late", file);
3af78b06
RK		 356 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
357 fputs (" error-issued", file);
17aec3eb 358
96a31ab8
RK		 359 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
360 fputs (" in-text-section", file);
361
17aec3eb
RK		 362 if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
363 fputs (" transparent-union", file);
364
52eeef3a
RS		 365 if (DECL_VIRTUAL_P (node))
366 fputs (" virtual", file);
96a31ab8
RK		 367 if (DECL_DEFER_OUTPUT (node))
368 fputs (" defer-output", file);
96a31ab8 369
52eeef3a
RS		 370 if (DECL_LANG_FLAG_0 (node))
371 fputs (" decl_0", file);
372 if (DECL_LANG_FLAG_1 (node))
373 fputs (" decl_1", file);
374 if (DECL_LANG_FLAG_2 (node))
375 fputs (" decl_2", file);
376 if (DECL_LANG_FLAG_3 (node))
377 fputs (" decl_3", file);
378 if (DECL_LANG_FLAG_4 (node))
379 fputs (" decl_4", file);
380 if (DECL_LANG_FLAG_5 (node))
381 fputs (" decl_5", file);
382 if (DECL_LANG_FLAG_6 (node))
383 fputs (" decl_6", file);
384 if (DECL_LANG_FLAG_7 (node))
385 fputs (" decl_7", file);
386
a4ec8d12 387 fprintf (file, " %s", GET_MODE_NAME(mode));
52eeef3a
RS		 388 fprintf (file, " file %s line %d",
389 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
390
391 print_node (file, "size", DECL_SIZE (node), indent + 4);
06ceef4e
RK		 392 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
393
9df2c88c
RK		 394 if (TREE_CODE (node) != FUNCTION_DECL
395 || DECL_INLINE (node) || DECL_BUILT_IN (node))
396 indent_to (file, indent + 3);
397
c0920bf9 398 if (TREE_CODE (node) != FUNCTION_DECL)
aa4661f8 399 {
f2aca197
RK		 400 if (DECL_USER_ALIGN (node))
401 fprintf (file, " user");
402
aa4661f8
RK		 403 fprintf (file, " align %d", DECL_ALIGN (node));
404 if (TREE_CODE (node) == FIELD_DECL)
0cba764e
RK		 405 {
406 fprintf (file, " offset_align ");
407 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
408 DECL_OFFSET_ALIGN (node));
409 }
aa4661f8 410 }
c0920bf9 411 else if (DECL_BUILT_IN (node))
7d492372
DD		 412 {
413 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
414 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
415 else
416 fprintf (file, " built-in %s:%s",
417 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
418 built_in_names[(int) DECL_FUNCTION_CODE (node)]);
419 }
9df2c88c 420
3932261a 421 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
c5588504
JL		 422 {
423 fprintf (file, " alias set ");
424 fprintf (file, HOST_WIDE_INT_PRINT_DEC,
425 DECL_POINTER_ALIAS_SET (node));
426 }
9df2c88c
RK		 427
428 if (TREE_CODE (node) == FIELD_DECL)
770ae6cc
RK		 429 {
430 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
431 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
432 indent + 4);
433 }
9df2c88c 434
52eeef3a 435 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
9df2c88c
RK		 436 print_node_brief (file, "machine_attributes",
437 DECL_MACHINE_ATTRIBUTES (node), indent + 4);
c5caa350
CH		 438 print_node_brief (file, "abstract_origin",
439 DECL_ABSTRACT_ORIGIN (node), indent + 4);
52eeef3a
RS		 440
441 print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
17aec3eb 442 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
52eeef3a
RS		 443 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
444
445 print_lang_decl (file, node, indent);
446
19e7881c 447 if (DECL_RTL_SET_P (node))
52eeef3a
RS		 448 {
449 indent_to (file, indent + 4);
450 print_rtl (file, DECL_RTL (node));
451 }
452
df10e9ec 453 if (TREE_CODE (node) == PARM_DECL)
17aec3eb 454 {
df10e9ec
RK		 455 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
456 print_node (file, "arg-type-as-written",
457 DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
458
459 if (DECL_INCOMING_RTL (node) != 0)
460 {
461 indent_to (file, indent + 4);
462 fprintf (file, "incoming-rtl ");
463 print_rtl (file, DECL_INCOMING_RTL (node));
464 }
17aec3eb
RK		 465 }
466 else if (TREE_CODE (node) == FUNCTION_DECL
467 && DECL_SAVED_INSNS (node) != 0)
52eeef3a
RS		 468 {
469 indent_to (file, indent + 4);
17aec3eb
RK		 470 fprintf (file, "saved-insns ");
471 fprintf (file, HOST_PTR_PRINTF, (char *) DECL_SAVED_INSNS (node));
52eeef3a
RS		 472 }
473
474 /* Print the decl chain only if decl is at second level. */
475 if (indent == 4)
476 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
477 else
478 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
479 break;
480
481 case 't':
0cba764e
RK		 482 /* The no-force-blk flag is used for different things in
483 different types. */
484 if ((TREE_CODE (node) == RECORD_TYPE
485 || TREE_CODE (node) == UNION_TYPE
486 || TREE_CODE (node) == QUAL_UNION_TYPE)
487 && TYPE_NO_FORCE_BLK (node))
96a31ab8 488 fputs (" no-force-blk", file);
0cba764e
RK		 489 else if (TREE_CODE (node) == INTEGER_TYPE
490 && TYPE_IS_SIZETYPE (node))
491 fputs (" sizetype", file);
492 else if (TREE_CODE (node) == FUNCTION_TYPE
493 && TYPE_RETURNS_STACK_DEPRESSED (node))
494 fputs (" returns-stack-depressed", file);
495
96a31ab8
RK		 496 if (TYPE_STRING_FLAG (node))
497 fputs (" string-flag", file);
498 if (TYPE_NEEDS_CONSTRUCTING (node))
499 fputs (" needs-constructing", file);
0cba764e 500
5667abce
ZW		 501 /* The transparent-union flag is used for different things in
502 different nodes. */
0cba764e
RK		 503 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
504 fputs (" transparent-union", file);
505 else if (TREE_CODE (node) == ARRAY_TYPE
506 && TYPE_NONALIASED_COMPONENT (node))
507 fputs (" nonaliased-component", file);
508 else if (TREE_CODE (node) == FUNCTION_TYPE
509 && TYPE_AMBIENT_BOUNDEDNESS (node))
510 fputs (" ambient-boundedness", file);
511
3fc341ac
RK		 512 if (TYPE_PACKED (node))
513 fputs (" packed", file);
96a31ab8 514
52eeef3a
RS		 515 if (TYPE_LANG_FLAG_0 (node))
516 fputs (" type_0", file);
517 if (TYPE_LANG_FLAG_1 (node))
518 fputs (" type_1", file);
519 if (TYPE_LANG_FLAG_2 (node))
520 fputs (" type_2", file);
521 if (TYPE_LANG_FLAG_3 (node))
522 fputs (" type_3", file);
523 if (TYPE_LANG_FLAG_4 (node))
524 fputs (" type_4", file);
525 if (TYPE_LANG_FLAG_5 (node))
526 fputs (" type_5", file);
527 if (TYPE_LANG_FLAG_6 (node))
528 fputs (" type_6", file);
529
530 mode = TYPE_MODE (node);
a4ec8d12 531 fprintf (file, " %s", GET_MODE_NAME(mode));
52eeef3a
RS		 532
533 print_node (file, "size", TYPE_SIZE (node), indent + 4);
06ceef4e 534 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
52eeef3a
RS		 535 indent_to (file, indent + 3);
536
f2aca197
RK		 537 if (TYPE_USER_ALIGN (node))
538 fprintf (file, " user");
539
52eeef3a
RS		 540 fprintf (file, " align %d", TYPE_ALIGN (node));
541 fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
c5588504
JL		 542 fprintf (file, " alias set ");
543 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TYPE_ALIAS_SET (node));
52eeef3a 544
0c7f6f66
RK		 545 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
546
f2aca197 547 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
52eeef3a
RS		 548 {
549 fprintf (file, " precision %d", TYPE_PRECISION (node));
f2aca197
RK		 550 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
551 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
52eeef3a 552 }
f2aca197
RK		 553
554 if (TREE_CODE (node) == ENUMERAL_TYPE)
555 print_node (file, "values", TYPE_VALUES (node), indent + 4);
556 else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
557 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
c1b98a95
RK		 558 else if (TREE_CODE (node) == RECORD_TYPE
559 || TREE_CODE (node) == UNION_TYPE
560 || TREE_CODE (node) == QUAL_UNION_TYPE)
52eeef3a 561 print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
0cba764e
RK		 562 else if (TREE_CODE (node) == FUNCTION_TYPE
563 || TREE_CODE (node) == METHOD_TYPE)
52eeef3a
RS		 564 {
565 if (TYPE_METHOD_BASETYPE (node))
0cba764e
RK		 566 print_node_brief (file, "method basetype",
567 TYPE_METHOD_BASETYPE (node), indent + 4);
52eeef3a
RS		 568 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
569 }
e7b9b18e
JM		 570 else if (TREE_CODE (node) == OFFSET_TYPE)
571 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
572 indent + 4);
f2aca197 573
52eeef3a
RS		 574 if (TYPE_CONTEXT (node))
575 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
576
577 print_lang_type (file, node, indent);
578
579 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
580 indent_to (file, indent + 3);
f2aca197
RK		 581
582 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
583 indent + 4);
584 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
585 indent + 4);
52eeef3a
RS		 586 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
587 break;
588
3b59a331
RS		 589 case 'b':
590 print_node (file, "vars", BLOCK_VARS (node), indent + 4);
3b59a331
RS		 591 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
592 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
593 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
594 print_node (file, "abstract_origin",
595 BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
e643155b 596 break;
3b59a331 597
52eeef3a
RS		 598 case 'e':
599 case '<':
600 case '1':
601 case '2':
602 case 'r':
603 case 's':
0a6969ad 604 if (TREE_CODE (node) == BIND_EXPR)
52eeef3a 605 {
52eeef3a
RS		 606 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
607 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
bf1c6940 608 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
e643155b 609 break;
52eeef3a
RS		 610 }
611
8d5e6e25
RK		 612 len = TREE_CODE_LENGTH (TREE_CODE (node));
613
b7f6588d 614 /* Some nodes contain rtx's, not trees,
52eeef3a 615 after a certain point. Print the rtx's as rtx's. */
b7f6588d 616 first_rtl = first_rtl_op (TREE_CODE (node));
8d5e6e25 617
52eeef3a
RS		 618 for (i = 0; i < len; i++)
619 {
620 if (i >= first_rtl)
621 {
622 indent_to (file, indent + 4);
623 fprintf (file, "rtl %d ", i);
624 if (TREE_OPERAND (node, i))
024b05a7 625 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
52eeef3a
RS		 626 else
627 fprintf (file, "(nil)");
628 fprintf (file, "\n");
629 }
630 else
631 {
632 char temp[10];
633
634 sprintf (temp, "arg %d", i);
635 print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
636 }
637 }
bf1e5319
APB		 638
639 if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
640 {
641 indent_to (file, indent+4);
642 fprintf (file, "%s:%d:%d",
643 (EXPR_WFL_FILENAME_NODE (node ) ?
644 EXPR_WFL_FILENAME (node) : "(no file info)"),
645 EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
646 }
9c2c54dc 647 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
52eeef3a
RS		 648 break;
649
650 case 'c':
651 case 'x':
652 switch (TREE_CODE (node))
653 {
654 case INTEGER_CST:
3e5f8018
RK		 655 if (TREE_CONSTANT_OVERFLOW (node))
656 fprintf (file, " overflow");
657
1e66ce77 658 fprintf (file, " ");
52eeef3a 659 if (TREE_INT_CST_HIGH (node) == 0)
1e66ce77 660 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
910d1693 661 TREE_INT_CST_LOW (node));
52eeef3a
RS		 662 else if (TREE_INT_CST_HIGH (node) == -1
663 && TREE_INT_CST_LOW (node) != 0)
1e66ce77
RK		 664 {
665 fprintf (file, "-");
666 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
667 -TREE_INT_CST_LOW (node));
668 }
52eeef3a 669 else
1e66ce77 670 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
906c4e36 671 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
52eeef3a
RS		 672 break;
673
674 case REAL_CST:
52eeef3a 675 {
7063dcbe
RK		 676 REAL_VALUE_TYPE d;
677
86b38416
RK		 678 if (TREE_OVERFLOW (node))
679 fprintf (file, " overflow");
680
681#if !defined(REAL_IS_NOT_DOUBLE) || defined(REAL_ARITHMETIC)
7063dcbe 682 d = TREE_REAL_CST (node);
86b38416
RK		 683 if (REAL_VALUE_ISINF (d))
684 fprintf (file, " Inf");
685 else if (REAL_VALUE_ISNAN (d))
686 fprintf (file, " Nan");
687 else
688 {
689 char string[100];
690
691 REAL_VALUE_TO_DECIMAL (d, "%e", string);
692 fprintf (file, " %s", string);
693 }
694#else
695 {
696 int i;
697 unsigned char *p = (unsigned char *) &TREE_REAL_CST (node);
698 fprintf (file, " 0x");
699 for (i = 0; i < sizeof TREE_REAL_CST (node); i++)
700 fprintf (file, "%02x", *p++);
701 fprintf (file, "");
702 }
703#endif
52eeef3a 704 }
52eeef3a
RS		 705 break;
706
707 case COMPLEX_CST:
708 print_node (file, "real", TREE_REALPART (node), indent + 4);
709 print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
710 break;
711
712 case STRING_CST:
713 fprintf (file, " \"%s\"", TREE_STRING_POINTER (node));
28d10cea
RS		 714 /* Print the chain at second level. */
715 if (indent == 4)
716 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
717 else
718 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
52eeef3a
RS		 719 break;
720
721 case IDENTIFIER_NODE:
722 print_lang_identifier (file, node, indent);
723 break;
724
725 case TREE_LIST:
726 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
727 print_node (file, "value", TREE_VALUE (node), indent + 4);
728 print_node (file, "chain", TREE_CHAIN (node), indent + 4);
729 break;
730
731 case TREE_VEC:
732 len = TREE_VEC_LENGTH (node);
733 for (i = 0; i < len; i++)
3629f741
JW		 734 if (TREE_VEC_ELT (node, i))
735 {
736 char temp[10];
737 sprintf (temp, "elt %d", i);
738 indent_to (file, indent + 4);
739 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
740 }
52eeef3a
RS		 741 break;
742
743 case OP_IDENTIFIER:
744 print_node (file, "op1", TREE_PURPOSE (node), indent + 4);
745 print_node (file, "op2", TREE_VALUE (node), indent + 4);
0a6969ad
JC		 746 break;
747
748 default:
bc289659
ML		 749 if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
750 lang_print_xnode (file, node, indent);
0a6969ad 751 break;
52eeef3a
RS		 752 }
753
754 break;
755 }
f6adcfdc
RS		 756
757 fprintf (file, ">");
52eeef3a 758}
Mirror of https://gcc.gnu.org/git/gcc.git