gcc/cp/ptree.cc

   1 /* Prints out trees in human readable form.
   2    Copyright (C) 1992-2025 Free Software Foundation, Inc.
   3    Hacked by Michael Tiemann (tiemann@cygnus.com)
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 3, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "cp-tree.h"
  26 #include "print-tree.h"
  27
  28 void
  29 cxx_print_decl (FILE *file, tree node, int indent)
  30 {
  31   if (TREE_CODE (node) == FIELD_DECL)
  32     {
  33       if (DECL_MUTABLE_P (node))
  34         {
  35           indent_to (file, indent + 3);
  36           fprintf (file, " mutable ");
  37         }
  38       return;
  39     }
  40
  41   if (TREE_CODE (node) == FUNCTION_DECL)
  42     {
  43       int flags = TFF_DECL_SPECIFIERS|TFF_RETURN_TYPE
  44         |TFF_FUNCTION_DEFAULT_ARGUMENTS|TFF_EXCEPTION_SPECIFICATION ;
  45       indent_to (file, indent + 3);
  46       fprintf (file, " full-name \"%s\"", decl_as_string (node, flags));
  47     }
  48   else if (TREE_CODE (node) == TEMPLATE_DECL)
  49     {
  50       print_node (file, "result", DECL_TEMPLATE_RESULT (node), indent + 4);
  51       print_node (file, "parms", DECL_TEMPLATE_PARMS (node), indent + 4);
  52       indent_to (file, indent + 3);
  53       fprintf (file, " full-name \"%s\"",
  54                decl_as_string (node, TFF_TEMPLATE_HEADER));
  55     }
  56
  57   bool need_indent = true;
  58
  59   tree ntnode = STRIP_TEMPLATE (node);
  60   if (TREE_CODE (ntnode) == FUNCTION_DECL
  61       || TREE_CODE (ntnode) == VAR_DECL
  62       || TREE_CODE (ntnode) == TYPE_DECL
  63       || TREE_CODE (ntnode) == CONCEPT_DECL
  64       || TREE_CODE (ntnode) == NAMESPACE_DECL)
  65     {
  66       unsigned m = 0;
  67       if (DECL_LANG_SPECIFIC (ntnode) && DECL_MODULE_IMPORT_P (ntnode))
  68         m = get_importing_module (ntnode, true);
  69
  70       if (const char *name = m == ~0u ? "" : module_name (m, true))
  71         {
  72           if (need_indent)
  73             indent_to (file, indent + 3);
  74           fprintf (file, " module %d:%s", m, name);
  75           need_indent = false;
  76         }
  77
  78       if (DECL_LANG_SPECIFIC (ntnode))
  79         {
  80           if (DECL_MODULE_PURVIEW_P (ntnode))
  81             {
  82               if (need_indent)
  83                 indent_to (file, indent + 3);
  84               fprintf (file, " purview");
  85               need_indent = false;
  86             }
  87           if (DECL_MODULE_ATTACH_P (ntnode))
  88             {
  89               if (need_indent)
  90                 indent_to (file, indent + 3);
  91               fprintf (file, " attached");
  92               need_indent = false;
  93             }
  94         }
  95     }
  96
  97   if (DECL_MODULE_EXPORT_P (node))
  98     {
  99       if (need_indent)
 100         indent_to (file, indent + 3);
 101       fprintf (file, " exported");
 102       need_indent = false;
 103     }
 104
 105   if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
 106       || !DECL_LANG_SPECIFIC (node))
 107     return;
 108
 109   if (DECL_EXTERNAL (node) && DECL_NOT_REALLY_EXTERN (node))
 110     {
 111       if (need_indent)
 112         indent_to (file, indent + 3);
 113       fprintf (file, " not-really-extern");
 114       need_indent = false;
 115     }
 116
 117   if (TREE_CODE (node) == FUNCTION_DECL
 118       && DECL_PENDING_INLINE_INFO (node))
 119     {
 120       if (need_indent)
 121         indent_to (file, indent + 3);
 122       fprintf (file, " pending-inline-info %p",
 123                (void *) DECL_PENDING_INLINE_INFO (node));
 124       need_indent = false;
 125     }
 126
 127   if ((VAR_OR_FUNCTION_DECL_P (node)
 128        || TREE_CODE (node) == FIELD_DECL
 129        || TREE_CODE (node) == TYPE_DECL
 130        || TREE_CODE (node) == CONCEPT_DECL
 131        || TREE_CODE (node) == TEMPLATE_DECL)
 132       && DECL_TEMPLATE_INFO (node))
 133     {
 134       print_node (file, "template-info", DECL_TEMPLATE_INFO (node),
 135                   indent + 4);
 136       indent_to (file, indent + 3);
 137       fprintf (file, " use_template=%d", DECL_USE_TEMPLATE (node));
 138     }
 139 }
 140
 141 void
 142 cxx_print_type (FILE *file, tree node, int indent)
 143 {
 144   if (tree ti = TYPE_TEMPLATE_INFO (node))
 145     print_node (file, "template-info", ti, indent + 4);
 146
 147   switch (TREE_CODE (node))
 148     {
 149     case BOUND_TEMPLATE_TEMPLATE_PARM:
 150     case TEMPLATE_TYPE_PARM:
 151     case TEMPLATE_TEMPLATE_PARM:
 152       print_node (file, "tpi", TEMPLATE_TYPE_PARM_INDEX (node), indent + 4);
 153       return;
 154
 155     case FUNCTION_TYPE:
 156     case METHOD_TYPE:
 157       if (TYPE_RAISES_EXCEPTIONS (node))
 158         print_node (file, "throws", TYPE_RAISES_EXCEPTIONS (node), indent + 4);
 159       return;
 160
 161     case RECORD_TYPE:
 162     case UNION_TYPE:
 163       break;
 164
 165     case DECLTYPE_TYPE:
 166       print_node (file, "expr", DECLTYPE_TYPE_EXPR (node), indent + 4);
 167       return;
 168
 169     case DEPENDENT_OPERATOR_TYPE:
 170       print_node (file, "saved_lookups",
 171                   DEPENDENT_OPERATOR_TYPE_SAVED_LOOKUPS (node),
 172                   indent + 4);
 173       return;
 174
 175     case TYPENAME_TYPE:
 176       print_node (file, "fullname", TYPENAME_TYPE_FULLNAME (node),
 177                   indent + 4);
 178       return;
 179
 180     case TYPEOF_TYPE:
 181       print_node (file, "expr", TYPEOF_TYPE_EXPR (node), indent + 4);
 182       return;
 183
 184     case BASES:
 185       if (BASES_DIRECT (node))
 186         fputs (" direct", file);
 187       print_node (file, "type", BASES_TYPE (node), indent + 4);
 188       return;
 189
 190     case TYPE_PACK_EXPANSION:
 191       print_node (file, "pattern", PACK_EXPANSION_PATTERN (node), indent + 4);
 192       print_node (file, "args", PACK_EXPANSION_EXTRA_ARGS (node), indent + 4);
 193       return;
 194
 195     case PACK_INDEX_TYPE:
 196       print_node (file, "pack", PACK_INDEX_PACK (node), indent + 4);
 197       print_node (file, "index", PACK_INDEX_INDEX (node), indent + 4);
 198       return;
 199
 200     default:
 201       return;
 202     }
 203
 204   if (TYPE_PTRMEMFUNC_P (node))
 205     print_node (file, "ptrmemfunc fn type", TYPE_PTRMEMFUNC_FN_TYPE (node),
 206                 indent + 4);
 207
 208   if (! CLASS_TYPE_P (node))
 209     return;
 210
 211   indent_to (file, indent + 4);
 212   fprintf (file, "full-name \"%s\"",
 213            type_as_string (node, TFF_CLASS_KEY_OR_ENUM));
 214
 215   indent_to (file, indent + 3);
 216
 217   if (TYPE_NEEDS_CONSTRUCTING (node))
 218     fputs ( " needs-constructor", file);
 219   if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (node))
 220     fputs (" needs-destructor", file);
 221   if (TYPE_HAS_DEFAULT_CONSTRUCTOR (node))
 222     fputs (" X()", file);
 223   if (TYPE_HAS_CONVERSION (node))
 224     fputs (" has-type-conversion", file);
 225   if (TYPE_HAS_COPY_CTOR (node))
 226     {
 227       if (TYPE_HAS_CONST_COPY_CTOR (node))
 228         fputs (" X(constX&)", file);
 229       else
 230         fputs (" X(X&)", file);
 231     }
 232   if (TYPE_HAS_NEW_OPERATOR (node))
 233     fputs (" new", file);
 234   if (TYPE_HAS_ARRAY_NEW_OPERATOR (node))
 235     fputs (" new[]", file);
 236   if (TYPE_GETS_DELETE (node) & 1)
 237     fputs (" delete", file);
 238   if (TYPE_GETS_DELETE (node) & 2)
 239     fputs (" delete[]", file);
 240   if (TYPE_HAS_COPY_ASSIGN (node))
 241     fputs (" this=(X&)", file);
 242
 243   if (TREE_CODE (node) == RECORD_TYPE)
 244     {
 245       if (TYPE_BINFO (node))
 246         fprintf (file, " n_parents=%d",
 247                  BINFO_N_BASE_BINFOS (TYPE_BINFO (node)));
 248       else
 249         fprintf (file, " no-binfo");
 250
 251       fprintf (file, " use_template=%d", CLASSTYPE_USE_TEMPLATE (node));
 252       if (CLASSTYPE_INTERFACE_ONLY (node))
 253         fprintf (file, " interface-only");
 254       if (CLASSTYPE_INTERFACE_UNKNOWN (node))
 255         fprintf (file, " interface-unknown");
 256     }
 257 }
 258
 259 void
 260 cxx_print_identifier (FILE *file, tree node, int indent)
 261 {
 262   if (indent == 0)
 263     fprintf (file, " ");
 264   else
 265     indent_to (file, indent + 4);
 266   fprintf (file, "%s local bindings <%p>", get_identifier_kind_name (node),
 267            (void *) IDENTIFIER_BINDING (node));
 268 }
 269
 270 void
 271 cxx_print_lambda_node (FILE *file, tree node, int indent)
 272 {
 273   fprintf (file, " default_capture_mode=[");
 274   switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (node))
 275     {
 276     case CPLD_NONE:
 277       fprintf (file, "NONE");
 278       break;
 279     case CPLD_COPY:
 280       fprintf (file, "COPY");
 281       break;
 282     case CPLD_REFERENCE:
 283       fprintf (file, "CPLD_REFERENCE");
 284       break;
 285     default:
 286       fprintf (file, "??");
 287       break;
 288     }
 289   fprintf (file, "] ");
 290   print_node (file, "capture_list", LAMBDA_EXPR_CAPTURE_LIST (node), indent + 4);
 291   print_node (file, "this_capture", LAMBDA_EXPR_THIS_CAPTURE (node), indent + 4);
 292 }
 293
 294 void
 295 cxx_print_xnode (FILE *file, tree node, int indent)
 296 {
 297   switch (TREE_CODE (node))
 298     {
 299     case BASELINK:
 300       print_node (file, "functions", BASELINK_FUNCTIONS (node), indent + 4);
 301       print_node (file, "binfo", BASELINK_BINFO (node), indent + 4);
 302       print_node (file, "access_binfo", BASELINK_ACCESS_BINFO (node),
 303                   indent + 4);
 304       print_node (file, "optype", BASELINK_OPTYPE (node), indent + 4);
 305       break;
 306     case OVERLOAD:
 307       print_node (file, "function", OVL_FUNCTION (node), indent + 4);
 308       print_node (file, "next", OVL_CHAIN (node), indent + 4);
 309       break;
 310     case BINDING_VECTOR:
 311       {
 312         unsigned len = BINDING_VECTOR_NUM_CLUSTERS (node);
 313         print_node (file, "name", BINDING_VECTOR_NAME (node), indent + 4);
 314         fprintf (file, " clusters %u, alloc %u", len,
 315                  BINDING_VECTOR_ALLOC_CLUSTERS (node));
 316         for (unsigned ix = 0; ix != len; ix++)
 317           {
 318             binding_cluster *cluster = &BINDING_VECTOR_CLUSTER (node, ix);
 319             char pfx[32];
 320             for (unsigned jx = 0; jx != BINDING_VECTOR_SLOTS_PER_CLUSTER; jx++)
 321               if (cluster->indices[jx].span)
 322                 {
 323                   int len = sprintf (pfx, "module:%u",
 324                                      cluster->indices[jx].base);
 325                   if (cluster->indices[jx].span > 1)
 326                     len += sprintf (&pfx[len], "(+%u)",
 327                                     cluster->indices[jx].span);
 328                   len += sprintf (&pfx[len], " cluster:%u/%u", ix, jx);
 329                   binding_slot &slot = cluster->slots[jx];
 330                   if (slot.is_lazy ())
 331                     {
 332                       indent_to (file, indent + 4);
 333                       unsigned lazy = slot.get_lazy ();
 334                       fprintf (file, "%s snum:%u", pfx, lazy);
 335                     }
 336                   else if (slot)
 337                     print_node (file, pfx, slot, indent + 4);
 338                   else
 339                     {
 340                       indent_to (file, indent + 4);
 341                       fprintf (file, "%s NULL", pfx);
 342                     }
 343                 }
 344           }
 345       }
 346       break;
 347     case TEMPLATE_PARM_INDEX:
 348       print_node (file, "decl", TEMPLATE_PARM_DECL (node), indent+4);
 349       indent_to (file, indent + 3);
 350       fprintf (file, "index %d level %d orig_level %d",
 351                TEMPLATE_PARM_IDX (node), TEMPLATE_PARM_LEVEL (node),
 352                TEMPLATE_PARM_ORIG_LEVEL (node));
 353       break;
 354     case TEMPLATE_INFO:
 355       print_node (file, "template", TI_TEMPLATE (node), indent+4);
 356       print_node (file, "args", TI_ARGS (node), indent+4);
 357       if (TI_TEMPLATE (node)
 358           && PRIMARY_TEMPLATE_P (TI_TEMPLATE (node)))
 359         print_node (file, "partial", TI_PARTIAL_INFO (node), indent+4);
 360       if (TI_PENDING_TEMPLATE_FLAG (node))
 361         {
 362           indent_to (file, indent + 3);
 363           fprintf (file, "pending_template");
 364         }
 365       break;
 366     case CONSTRAINT_INFO:
 367       {
 368         tree_constraint_info *cinfo = (tree_constraint_info *)node;
 369         if (cinfo->template_reqs)
 370           print_node (file, "template_reqs", cinfo->template_reqs, indent+4);
 371         if (cinfo->declarator_reqs)
 372           print_node (file, "declarator_reqs", cinfo->declarator_reqs,
 373                       indent+4);
 374         print_node (file, "associated_constr",
 375                           cinfo->associated_constr, indent+4);
 376         break;
 377       }
 378     case ARGUMENT_PACK_SELECT:
 379       print_node (file, "pack", ARGUMENT_PACK_SELECT_FROM_PACK (node),
 380                   indent+4);
 381       indent_to (file, indent + 3);
 382       fprintf (file, "index %d", ARGUMENT_PACK_SELECT_INDEX (node));
 383       break;
 384     case DEFERRED_NOEXCEPT:
 385       print_node (file, "pattern", DEFERRED_NOEXCEPT_PATTERN (node), indent+4);
 386       print_node (file, "args", DEFERRED_NOEXCEPT_ARGS (node), indent+4);
 387       break;
 388     case TRAIT_EXPR:
 389       indent_to (file, indent+4);
 390       fprintf (file, "kind %d", TRAIT_EXPR_KIND (node));
 391       print_node (file, "type 1", TRAIT_EXPR_TYPE1 (node), indent+4);
 392       if (TRAIT_EXPR_TYPE2 (node))
 393         print_node (file, "type 2", TRAIT_EXPR_TYPE2 (node), indent+4);
 394       break;
 395     case LAMBDA_EXPR:
 396       cxx_print_lambda_node (file, node, indent);
 397       break;
 398     case STATIC_ASSERT:
 399       if (location_t loc = STATIC_ASSERT_SOURCE_LOCATION (node))
 400         {
 401           expanded_location xloc = expand_location (loc);
 402           indent_to (file, indent+4);
 403           fprintf (file, "%s:%d:%d", xloc.file, xloc.line, xloc.column);
 404         }
 405       print_node (file, "condition", STATIC_ASSERT_CONDITION (node), indent+4);
 406       if (tree message = STATIC_ASSERT_MESSAGE (node))
 407         print_node (file, "message", message, indent+4);
 408       break;
 409     case PTRMEM_CST:
 410       print_node (file, "member", PTRMEM_CST_MEMBER (node), indent+4);
 411       break;
 412     default:
 413       break;
 414     }
 415 }
 416
 417 /* Print the node NODE on standard error, for debugging.  */
 418
 419 DEBUG_FUNCTION void
 420 debug_tree (cp_expr node)
 421 {
 422   debug_tree (node.get_value());
 423 }
 424
 425 DEBUG_FUNCTION void
 426 debug_overload (tree node)
 427 {
 428   FILE *file = stdout;
 429
 430   for (lkp_iterator iter (node); iter; ++iter)
 431     {
 432       tree decl = *iter;
 433       auto xloc = expand_location (DECL_SOURCE_LOCATION (decl));
 434       auto fullname = decl_as_string (decl, 0);
 435       bool using_p = iter.using_p ();
 436       bool hidden_p = iter.hidden_p ();
 437
 438       fprintf (file, "%p:%c%c %s:%d:%d \"%s\"\n", (void *)decl,
 439                hidden_p ? 'H' : '-',
 440                using_p ? 'U' : '-',
 441                xloc.file, xloc.line, xloc.column, fullname);
 442     }
 443 }