print-tree.c revision 259694
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, 2005 Free Software Foundation, Inc. 4 5This file is part of GCC. 6 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. 11 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. 16 17You should have received a copy of the GNU General Public License 18along with GCC; see the file COPYING. If not, write to the Free 19Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 2002110-1301, USA. */ 21 22 23#include "config.h" 24#include "system.h" 25#include "coretypes.h" 26#include "tm.h" 27#include "tree.h" 28#include "real.h" 29#include "ggc.h" 30#include "langhooks.h" 31#include "tree-iterator.h" 32 33/* Define the hash table of nodes already seen. 34 Such nodes are not repeated; brief cross-references are used. */ 35 36#define HASH_SIZE 37 37 38struct bucket 39{ 40 tree node; 41 struct bucket *next; 42}; 43 44static struct bucket **table; 45 46/* Print the node NODE on standard error, for debugging. 47 Most nodes referred to by this one are printed recursively 48 down to a depth of six. */ 49 50void 51debug_tree (tree node) 52{ 53 table = XCNEWVEC (struct bucket *, HASH_SIZE); 54 print_node (stderr, "", node, 0); 55 free (table); 56 table = 0; 57 putc ('\n', stderr); 58} 59 60/* Print PREFIX and ADDR to FILE. */ 61void 62dump_addr (FILE *file, const char *prefix, void *addr) 63{ 64 if (flag_dump_noaddr || flag_dump_unnumbered) 65 fprintf (file, "%s#", prefix); 66 else 67 fprintf (file, "%s%p", prefix, addr); 68} 69 70/* Print a node in brief fashion, with just the code, address and name. */ 71 72void 73print_node_brief (FILE *file, const char *prefix, tree node, int indent) 74{ 75 enum tree_code_class class; 76 77 if (node == 0) 78 return; 79 80 class = TREE_CODE_CLASS (TREE_CODE (node)); 81 82 /* Always print the slot this node is in, and its code, address and 83 name if any. */ 84 if (indent > 0) 85 fprintf (file, " "); 86 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]); 87 dump_addr (file, " ", node); 88 89 if (class == tcc_declaration) 90 { 91 if (DECL_NAME (node)) 92 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); 93 else if (TREE_CODE (node) == LABEL_DECL 94 && LABEL_DECL_UID (node) != -1) 95 fprintf (file, " L." HOST_WIDE_INT_PRINT_DEC, LABEL_DECL_UID (node)); 96 else 97 fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D', 98 DECL_UID (node)); 99 } 100 else if (class == tcc_type) 101 { 102 if (TYPE_NAME (node)) 103 { 104 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE) 105 fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node))); 106 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL 107 && DECL_NAME (TYPE_NAME (node))) 108 fprintf (file, " %s", 109 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node)))); 110 } 111 } 112 if (TREE_CODE (node) == IDENTIFIER_NODE) 113 fprintf (file, " %s", IDENTIFIER_POINTER (node)); 114 115 /* We might as well always print the value of an integer or real. */ 116 if (TREE_CODE (node) == INTEGER_CST) 117 { 118 if (TREE_CONSTANT_OVERFLOW (node)) 119 fprintf (file, " overflow"); 120 121 fprintf (file, " "); 122 if (TREE_INT_CST_HIGH (node) == 0) 123 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node)); 124 else if (TREE_INT_CST_HIGH (node) == -1 125 && TREE_INT_CST_LOW (node) != 0) 126 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED, 127 -TREE_INT_CST_LOW (node)); 128 else 129 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX, 130 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node)); 131 } 132 if (TREE_CODE (node) == REAL_CST) 133 { 134 REAL_VALUE_TYPE d; 135 136 if (TREE_OVERFLOW (node)) 137 fprintf (file, " overflow"); 138 139 d = TREE_REAL_CST (node); 140 if (REAL_VALUE_ISINF (d)) 141 fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf"); 142 else if (REAL_VALUE_ISNAN (d)) 143 fprintf (file, " Nan"); 144 else 145 { 146 char string[60]; 147 real_to_decimal (string, &d, sizeof (string), 0, 1); 148 fprintf (file, " %s", string); 149 } 150 } 151 152 fprintf (file, ">"); 153} 154 155void 156indent_to (FILE *file, int column) 157{ 158 int i; 159 160 /* Since this is the long way, indent to desired column. */ 161 if (column > 0) 162 fprintf (file, "\n"); 163 for (i = 0; i < column; i++) 164 fprintf (file, " "); 165} 166 167/* Print the node NODE in full on file FILE, preceded by PREFIX, 168 starting in column INDENT. */ 169 170void 171print_node (FILE *file, const char *prefix, tree node, int indent) 172{ 173 int hash; 174 struct bucket *b; 175 enum machine_mode mode; 176 enum tree_code_class class; 177 int len; 178 int i; 179 expanded_location xloc; 180 enum tree_code code; 181 182 if (node == 0) 183 return; 184 185 code = TREE_CODE (node); 186 class = TREE_CODE_CLASS (code); 187 188 /* Don't get too deep in nesting. If the user wants to see deeper, 189 it is easy to use the address of a lowest-level node 190 as an argument in another call to debug_tree. */ 191 192 if (indent > 24) 193 { 194 print_node_brief (file, prefix, node, indent); 195 return; 196 } 197 198 if (indent > 8 && (class == tcc_type || class == tcc_declaration)) 199 { 200 print_node_brief (file, prefix, node, indent); 201 return; 202 } 203 204 /* It is unsafe to look at any other fields of an ERROR_MARK node. */ 205 if (TREE_CODE (node) == ERROR_MARK) 206 { 207 print_node_brief (file, prefix, node, indent); 208 return; 209 } 210 211 hash = ((unsigned long) node) % HASH_SIZE; 212 213 /* If node is in the table, just mention its address. */ 214 for (b = table[hash]; b; b = b->next) 215 if (b->node == node) 216 { 217 print_node_brief (file, prefix, node, indent); 218 return; 219 } 220 221 /* Add this node to the table. */ 222 b = XNEW (struct bucket); 223 b->node = node; 224 b->next = table[hash]; 225 table[hash] = b; 226 227 /* Indent to the specified column, since this is the long form. */ 228 indent_to (file, indent); 229 230 /* Print the slot this node is in, and its code, and address. */ 231 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]); 232 dump_addr (file, " ", node); 233 234 /* Print the name, if any. */ 235 if (class == tcc_declaration) 236 { 237 if (DECL_NAME (node)) 238 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); 239 else if (TREE_CODE (node) == LABEL_DECL 240 && LABEL_DECL_UID (node) != -1) 241 fprintf (file, " L." HOST_WIDE_INT_PRINT_DEC, LABEL_DECL_UID (node)); 242 else 243 fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D', 244 DECL_UID (node)); 245 } 246 else if (class == tcc_type) 247 { 248 if (TYPE_NAME (node)) 249 { 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)))); 256 } 257 } 258 if (TREE_CODE (node) == IDENTIFIER_NODE) 259 fprintf (file, " %s", IDENTIFIER_POINTER (node)); 260 261 if (TREE_CODE (node) == INTEGER_CST) 262 { 263 if (indent <= 4) 264 print_node_brief (file, "type", TREE_TYPE (node), indent + 4); 265 } 266 else 267 { 268 print_node (file, "type", TREE_TYPE (node), indent + 4); 269 if (TREE_TYPE (node)) 270 indent_to (file, indent + 3); 271 } 272 273 if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node)) 274 fputs (" side-effects", file); 275 276 if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node)) 277 fputs (" readonly", file); 278 if (!TYPE_P (node) && TREE_CONSTANT (node)) 279 fputs (" constant", file); 280 else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node)) 281 fputs (" sizes-gimplified", file); 282 283 if (TREE_INVARIANT (node)) 284 fputs (" invariant", file); 285 if (TREE_ADDRESSABLE (node)) 286 fputs (" addressable", file); 287 if (TREE_THIS_VOLATILE (node)) 288 fputs (" volatile", file); 289 if (TREE_ASM_WRITTEN (node)) 290 fputs (" asm_written", file); 291 if (TREE_USED (node)) 292 fputs (" used", file); 293 if (TREE_NOTHROW (node)) 294 fputs (TYPE_P (node) ? " align-ok" : " nothrow", file); 295 if (TREE_PUBLIC (node)) 296 fputs (" public", file); 297 if (TREE_PRIVATE (node)) 298 fputs (" private", file); 299 if (TREE_PROTECTED (node)) 300 fputs (" protected", file); 301 if (TREE_STATIC (node)) 302 fputs (" static", file); 303 if (TREE_DEPRECATED (node)) 304 fputs (" deprecated", file); 305 if (TREE_VISITED (node)) 306 fputs (" visited", file); 307 if (TREE_LANG_FLAG_0 (node)) 308 fputs (" tree_0", file); 309 if (TREE_LANG_FLAG_1 (node)) 310 fputs (" tree_1", file); 311 if (TREE_LANG_FLAG_2 (node)) 312 fputs (" tree_2", file); 313 if (TREE_LANG_FLAG_3 (node)) 314 fputs (" tree_3", file); 315 if (TREE_LANG_FLAG_4 (node)) 316 fputs (" tree_4", file); 317 if (TREE_LANG_FLAG_5 (node)) 318 fputs (" tree_5", file); 319 if (TREE_LANG_FLAG_6 (node)) 320 fputs (" tree_6", file); 321 322 /* DECL_ nodes have additional attributes. */ 323 324 switch (TREE_CODE_CLASS (TREE_CODE (node))) 325 { 326 case tcc_declaration: 327 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) 328 { 329 if (DECL_UNSIGNED (node)) 330 fputs (" unsigned", file); 331 if (DECL_IGNORED_P (node)) 332 fputs (" ignored", file); 333 if (DECL_ABSTRACT (node)) 334 fputs (" abstract", file); 335 if (DECL_EXTERNAL (node)) 336 fputs (" external", file); 337 if (DECL_NONLOCAL (node)) 338 fputs (" nonlocal", file); 339 } 340 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS)) 341 { 342 if (DECL_WEAK (node)) 343 fputs (" weak", file); 344 if (DECL_IN_SYSTEM_HEADER (node)) 345 fputs (" in_system_header", file); 346 } 347 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL) 348 && TREE_CODE (node) != LABEL_DECL 349 && TREE_CODE (node) != FUNCTION_DECL 350 && DECL_REGISTER (node)) 351 fputs (" regdecl", file); 352 353 if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node)) 354 fputs (" suppress-debug", file); 355 356 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node)) 357 fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file); 358 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node)) 359 fputs (" built-in", file); 360 if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node)) 361 fputs (" no-static-chain", file); 362 363 if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node)) 364 fputs (" packed", file); 365 if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node)) 366 fputs (" bit-field", file); 367 if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node)) 368 fputs (" nonaddressable", file); 369 370 if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node)) 371 fputs (" error-issued", file); 372 373 if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node)) 374 fputs (" in-text-section", file); 375 if (TREE_CODE (node) == VAR_DECL && DECL_COMMON (node)) 376 fputs (" common", file); 377 if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL_P (node)) 378 { 379 enum tls_model kind = DECL_TLS_MODEL (node); 380 switch (kind) 381 { 382 case TLS_MODEL_GLOBAL_DYNAMIC: 383 fputs (" tls-global-dynamic", file); 384 break; 385 case TLS_MODEL_LOCAL_DYNAMIC: 386 fputs (" tls-local-dynamic", file); 387 break; 388 case TLS_MODEL_INITIAL_EXEC: 389 fputs (" tls-initial-exec", file); 390 break; 391 case TLS_MODEL_LOCAL_EXEC: 392 fputs (" tls-local-exec", file); 393 break; 394 default: 395 gcc_unreachable (); 396 } 397 } 398 399 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) 400 { 401 if (DECL_VIRTUAL_P (node)) 402 fputs (" virtual", file); 403 if (DECL_PRESERVE_P (node)) 404 fputs (" preserve", file); 405 if (DECL_LANG_FLAG_0 (node)) 406 fputs (" decl_0", file); 407 if (DECL_LANG_FLAG_1 (node)) 408 fputs (" decl_1", file); 409 if (DECL_LANG_FLAG_2 (node)) 410 fputs (" decl_2", file); 411 if (DECL_LANG_FLAG_3 (node)) 412 fputs (" decl_3", file); 413 if (DECL_LANG_FLAG_4 (node)) 414 fputs (" decl_4", file); 415 if (DECL_LANG_FLAG_5 (node)) 416 fputs (" decl_5", file); 417 if (DECL_LANG_FLAG_6 (node)) 418 fputs (" decl_6", file); 419 if (DECL_LANG_FLAG_7 (node)) 420 fputs (" decl_7", file); 421 422 mode = DECL_MODE (node); 423 fprintf (file, " %s", GET_MODE_NAME (mode)); 424 } 425 426 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS) && DECL_DEFER_OUTPUT (node)) 427 fputs (" defer-output", file); 428 429 430 xloc = expand_location (DECL_SOURCE_LOCATION (node)); 431 fprintf (file, " file %s line %d", xloc.file, xloc.line); 432 433 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) 434 { 435 print_node (file, "size", DECL_SIZE (node), indent + 4); 436 print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4); 437 438 if (TREE_CODE (node) != FUNCTION_DECL 439 || DECL_INLINE (node) || DECL_BUILT_IN (node)) 440 indent_to (file, indent + 3); 441 442 if (DECL_USER_ALIGN (node)) 443 fprintf (file, " user"); 444 445 fprintf (file, " align %d", DECL_ALIGN (node)); 446 if (TREE_CODE (node) == FIELD_DECL) 447 fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED, 448 DECL_OFFSET_ALIGN (node)); 449 450 if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node)) 451 { 452 if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD) 453 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node)); 454 else 455 fprintf (file, " built-in %s:%s", 456 built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)], 457 built_in_names[(int) DECL_FUNCTION_CODE (node)]); 458 } 459 460 if (DECL_POINTER_ALIAS_SET_KNOWN_P (node)) 461 fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC, 462 DECL_POINTER_ALIAS_SET (node)); 463 } 464 if (TREE_CODE (node) == FIELD_DECL) 465 { 466 print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4); 467 print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node), 468 indent + 4); 469 if (DECL_BIT_FIELD_TYPE (node)) 470 print_node (file, "bit_field_type", DECL_BIT_FIELD_TYPE (node), 471 indent + 4); 472 } 473 474 print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4); 475 476 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) 477 { 478 print_node_brief (file, "attributes", 479 DECL_ATTRIBUTES (node), indent + 4); 480 print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4); 481 } 482 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL)) 483 { 484 print_node_brief (file, "abstract_origin", 485 DECL_ABSTRACT_ORIGIN (node), indent + 4); 486 } 487 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON)) 488 { 489 print_node (file, "arguments", DECL_ARGUMENT_FLD (node), indent + 4); 490 print_node (file, "result", DECL_RESULT_FLD (node), indent + 4); 491 } 492 493 lang_hooks.print_decl (file, node, indent); 494 495 if (DECL_RTL_SET_P (node)) 496 { 497 indent_to (file, indent + 4); 498 print_rtl (file, DECL_RTL (node)); 499 } 500 501 if (TREE_CODE (node) == PARM_DECL) 502 { 503 print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4); 504 505 if (DECL_INCOMING_RTL (node) != 0) 506 { 507 indent_to (file, indent + 4); 508 fprintf (file, "incoming-rtl "); 509 print_rtl (file, DECL_INCOMING_RTL (node)); 510 } 511 } 512 else if (TREE_CODE (node) == FUNCTION_DECL 513 && DECL_STRUCT_FUNCTION (node) != 0) 514 { 515 indent_to (file, indent + 4); 516 dump_addr (file, "saved-insns ", DECL_STRUCT_FUNCTION (node)); 517 } 518 519 if ((TREE_CODE (node) == VAR_DECL || TREE_CODE (node) == PARM_DECL) 520 && DECL_HAS_VALUE_EXPR_P (node)) 521 print_node (file, "value-expr", DECL_VALUE_EXPR (node), indent + 4); 522 523 if (TREE_CODE (node) == STRUCT_FIELD_TAG) 524 { 525 fprintf (file, " sft size " HOST_WIDE_INT_PRINT_DEC, 526 SFT_SIZE (node)); 527 fprintf (file, " sft offset " HOST_WIDE_INT_PRINT_DEC, 528 SFT_OFFSET (node)); 529 print_node_brief (file, "parent var", SFT_PARENT_VAR (node), 530 indent + 4); 531 } 532 /* Print the decl chain only if decl is at second level. */ 533 if (indent == 4) 534 print_node (file, "chain", TREE_CHAIN (node), indent + 4); 535 else 536 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4); 537 break; 538 539 case tcc_type: 540 if (TYPE_UNSIGNED (node)) 541 fputs (" unsigned", file); 542 543 /* The no-force-blk flag is used for different things in 544 different types. */ 545 if ((TREE_CODE (node) == RECORD_TYPE 546 || TREE_CODE (node) == UNION_TYPE 547 || TREE_CODE (node) == QUAL_UNION_TYPE) 548 && TYPE_NO_FORCE_BLK (node)) 549 fputs (" no-force-blk", file); 550 else if (TREE_CODE (node) == INTEGER_TYPE 551 && TYPE_IS_SIZETYPE (node)) 552 fputs (" sizetype", file); 553 else if (TREE_CODE (node) == FUNCTION_TYPE 554 && TYPE_RETURNS_STACK_DEPRESSED (node)) 555 fputs (" returns-stack-depressed", file); 556 557 if (TYPE_STRING_FLAG (node)) 558 fputs (" string-flag", file); 559 if (TYPE_NEEDS_CONSTRUCTING (node)) 560 fputs (" needs-constructing", file); 561 562 /* The transparent-union flag is used for different things in 563 different nodes. */ 564 if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node)) 565 fputs (" transparent-union", file); 566 else if (TREE_CODE (node) == ARRAY_TYPE 567 && TYPE_NONALIASED_COMPONENT (node)) 568 fputs (" nonaliased-component", file); 569 570 if (TYPE_PACKED (node)) 571 fputs (" packed", file); 572 573 if (TYPE_RESTRICT (node)) 574 fputs (" restrict", file); 575 576 if (TYPE_LANG_FLAG_0 (node)) 577 fputs (" type_0", file); 578 if (TYPE_LANG_FLAG_1 (node)) 579 fputs (" type_1", file); 580 if (TYPE_LANG_FLAG_2 (node)) 581 fputs (" type_2", file); 582 if (TYPE_LANG_FLAG_3 (node)) 583 fputs (" type_3", file); 584 if (TYPE_LANG_FLAG_4 (node)) 585 fputs (" type_4", file); 586 if (TYPE_LANG_FLAG_5 (node)) 587 fputs (" type_5", file); 588 if (TYPE_LANG_FLAG_6 (node)) 589 fputs (" type_6", file); 590 591 mode = TYPE_MODE (node); 592 fprintf (file, " %s", GET_MODE_NAME (mode)); 593 594 print_node (file, "size", TYPE_SIZE (node), indent + 4); 595 print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4); 596 indent_to (file, indent + 3); 597 598 if (TYPE_USER_ALIGN (node)) 599 fprintf (file, " user"); 600 601 fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC, 602 TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node), 603 TYPE_ALIAS_SET (node)); 604 605 print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4); 606 607 if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE) 608 { 609 fprintf (file, " precision %d", TYPE_PRECISION (node)); 610 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4); 611 print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4); 612 } 613 614 if (TREE_CODE (node) == ENUMERAL_TYPE) 615 print_node (file, "values", TYPE_VALUES (node), indent + 4); 616 else if (TREE_CODE (node) == ARRAY_TYPE) 617 print_node (file, "domain", TYPE_DOMAIN (node), indent + 4); 618 else if (TREE_CODE (node) == VECTOR_TYPE) 619 fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node)); 620 else if (TREE_CODE (node) == RECORD_TYPE 621 || TREE_CODE (node) == UNION_TYPE 622 || TREE_CODE (node) == QUAL_UNION_TYPE) 623 print_node (file, "fields", TYPE_FIELDS (node), indent + 4); 624 else if (TREE_CODE (node) == FUNCTION_TYPE 625 || TREE_CODE (node) == METHOD_TYPE) 626 { 627 if (TYPE_METHOD_BASETYPE (node)) 628 print_node_brief (file, "method basetype", 629 TYPE_METHOD_BASETYPE (node), indent + 4); 630 print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4); 631 } 632 else if (TREE_CODE (node) == OFFSET_TYPE) 633 print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node), 634 indent + 4); 635 636 if (TYPE_CONTEXT (node)) 637 print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4); 638 639 lang_hooks.print_type (file, node, indent); 640 641 if (TYPE_POINTER_TO (node) || TREE_CHAIN (node)) 642 indent_to (file, indent + 3); 643 644 print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node), 645 indent + 4); 646 print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node), 647 indent + 4); 648 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4); 649 break; 650 651 case tcc_expression: 652 case tcc_comparison: 653 case tcc_unary: 654 case tcc_binary: 655 case tcc_reference: 656 case tcc_statement: 657 if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node)) 658 fputs (" unsigned", file); 659 if (TREE_CODE (node) == BIND_EXPR) 660 { 661 print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4); 662 print_node (file, "body", TREE_OPERAND (node, 1), indent + 4); 663 print_node (file, "block", TREE_OPERAND (node, 2), indent + 4); 664 break; 665 } 666 667 len = TREE_CODE_LENGTH (TREE_CODE (node)); 668 669 for (i = 0; i < len; i++) 670 { 671 char temp[10]; 672 673 sprintf (temp, "arg %d", i); 674 print_node (file, temp, TREE_OPERAND (node, i), indent + 4); 675 } 676 677 print_node (file, "chain", TREE_CHAIN (node), indent + 4); 678 break; 679 680 case tcc_constant: 681 case tcc_exceptional: 682 switch (TREE_CODE (node)) 683 { 684 case INTEGER_CST: 685 if (TREE_CONSTANT_OVERFLOW (node)) 686 fprintf (file, " overflow"); 687 688 fprintf (file, " "); 689 if (TREE_INT_CST_HIGH (node) == 0) 690 fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, 691 TREE_INT_CST_LOW (node)); 692 else if (TREE_INT_CST_HIGH (node) == -1 693 && TREE_INT_CST_LOW (node) != 0) 694 fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED, 695 -TREE_INT_CST_LOW (node)); 696 else 697 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX, 698 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node)); 699 break; 700 701 case REAL_CST: 702 { 703 REAL_VALUE_TYPE d; 704 705 if (TREE_OVERFLOW (node)) 706 fprintf (file, " overflow"); 707 708 d = TREE_REAL_CST (node); 709 if (REAL_VALUE_ISINF (d)) 710 fprintf (file, REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf"); 711 else if (REAL_VALUE_ISNAN (d)) 712 fprintf (file, " Nan"); 713 else 714 { 715 char string[64]; 716 real_to_decimal (string, &d, sizeof (string), 0, 1); 717 fprintf (file, " %s", string); 718 } 719 } 720 break; 721 722 case VECTOR_CST: 723 { 724 tree vals = TREE_VECTOR_CST_ELTS (node); 725 char buf[10]; 726 tree link; 727 int i; 728 729 i = 0; 730 for (link = vals; link; link = TREE_CHAIN (link), ++i) 731 { 732 sprintf (buf, "elt%d: ", i); 733 print_node (file, buf, TREE_VALUE (link), indent + 4); 734 } 735 } 736 break; 737 738 case COMPLEX_CST: 739 print_node (file, "real", TREE_REALPART (node), indent + 4); 740 print_node (file, "imag", TREE_IMAGPART (node), indent + 4); 741 break; 742 743 case STRING_CST: 744 { 745 const char *p = TREE_STRING_POINTER (node); 746 int i = TREE_STRING_LENGTH (node); 747 fputs (" \"", file); 748 while (--i >= 0) 749 { 750 char ch = *p++; 751 if (ch >= ' ' && ch < 127) 752 putc (ch, file); 753 else 754 fprintf(file, "\\%03o", ch & 0xFF); 755 } 756 fputc ('\"', file); 757 } 758 /* Print the chain at second level. */ 759 if (indent == 4) 760 print_node (file, "chain", TREE_CHAIN (node), indent + 4); 761 else 762 print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4); 763 break; 764 765 case IDENTIFIER_NODE: 766 lang_hooks.print_identifier (file, node, indent); 767 break; 768 769 case TREE_LIST: 770 print_node (file, "purpose", TREE_PURPOSE (node), indent + 4); 771 print_node (file, "value", TREE_VALUE (node), indent + 4); 772 print_node (file, "chain", TREE_CHAIN (node), indent + 4); 773 break; 774 775 case TREE_VEC: 776 len = TREE_VEC_LENGTH (node); 777 for (i = 0; i < len; i++) 778 if (TREE_VEC_ELT (node, i)) 779 { 780 char temp[10]; 781 sprintf (temp, "elt %d", i); 782 indent_to (file, indent + 4); 783 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0); 784 } 785 break; 786 787 case STATEMENT_LIST: 788 dump_addr (file, " head ", node->stmt_list.head); 789 dump_addr (file, " tail ", node->stmt_list.tail); 790 fprintf (file, " stmts"); 791 { 792 tree_stmt_iterator i; 793 for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i)) 794 { 795 /* Not printing the addresses of the (not-a-tree) 796 'struct tree_stmt_list_node's. */ 797 dump_addr (file, " ", tsi_stmt (i)); 798 } 799 fprintf (file, "\n"); 800 for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i)) 801 { 802 /* Not printing the addresses of the (not-a-tree) 803 'struct tree_stmt_list_node's. */ 804 print_node (file, "stmt", tsi_stmt (i), indent + 4); 805 } 806 } 807 print_node (file, "chain", TREE_CHAIN (node), indent + 4); 808 break; 809 810 case BLOCK: 811 print_node (file, "vars", BLOCK_VARS (node), indent + 4); 812 print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), 813 indent + 4); 814 print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4); 815 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4); 816 print_node (file, "abstract_origin", 817 BLOCK_ABSTRACT_ORIGIN (node), indent + 4); 818 break; 819 820 case SSA_NAME: 821 print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4); 822 print_node_brief (file, "def_stmt", 823 SSA_NAME_DEF_STMT (node), indent + 4); 824 825 indent_to (file, indent + 4); 826 fprintf (file, "version %u", SSA_NAME_VERSION (node)); 827 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node)) 828 fprintf (file, " in-abnormal-phi"); 829 if (SSA_NAME_IN_FREE_LIST (node)) 830 fprintf (file, " in-free-list"); 831 832 if (SSA_NAME_PTR_INFO (node) 833 || SSA_NAME_VALUE (node)) 834 { 835 indent_to (file, indent + 3); 836 if (SSA_NAME_PTR_INFO (node)) 837 dump_addr (file, " ptr-info ", SSA_NAME_PTR_INFO (node)); 838 if (SSA_NAME_VALUE (node)) 839 dump_addr (file, " value ", SSA_NAME_VALUE (node)); 840 } 841 break; 842 843 case OMP_CLAUSE: 844 { 845 int i; 846 fprintf (file, " %s", 847 omp_clause_code_name[OMP_CLAUSE_CODE (node)]); 848 for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (node)]; i++) 849 { 850 indent_to (file, indent + 4); 851 fprintf (file, "op %d:", i); 852 print_node_brief (file, "", OMP_CLAUSE_OPERAND (node, i), 0); 853 } 854 } 855 break; 856 857 default: 858 if (EXCEPTIONAL_CLASS_P (node)) 859 lang_hooks.print_xnode (file, node, indent); 860 break; 861 } 862 863 break; 864 } 865 866 if (EXPR_HAS_LOCATION (node)) 867 { 868 expanded_location xloc = expand_location (EXPR_LOCATION (node)); 869 indent_to (file, indent+4); 870 fprintf (file, "%s:%d", xloc.file, xloc.line); 871 } 872 873 fprintf (file, ">"); 874} 875