mirror of
https://forge.sourceware.org/marek/gcc.git
synced 2026-02-22 03:47:02 -05:00
This patch provides a way for plugins to add extra information to a diagnostic sink, potentially capturing more information via a "finalizer" hook. gcc/c-family/ChangeLog: * c-opts.cc: Define INCLUDE_VECTOR. gcc/cp/ChangeLog: * error.cc: Define INCLUDE_VECTOR. gcc/ChangeLog: * diagnostic-global-context.cc: Define INCLUDE_VECTOR. * diagnostics/buffering.cc: Likewise. * diagnostics/context.cc (context::finish): Call finalize_extensions on each sink. (sink::dump): Dump any extensions. (sink::finalize_extensions): New. * diagnostics/macro-unwinding.cc: Define INCLUDE_VECTOR. * diagnostics/selftest-context.cc: Likewise. * diagnostics/sink.h (class sink::extension): New. (sink::add_extension): New. (sink::finalize_extensions): New decl. (sink::m_extensions): New member. * gcc.cc: Define INCLUDE_VECTOR. * langhooks.cc: Likewise. * opts.cc: Likewise. * tree-diagnostic-client-data-hooks.cc: Likewise. * tree-diagnostic.cc: Likewise. gcc/fortran/ChangeLog: * error.cc: Define INCLUDE_VECTOR. gcc/testsuite/ChangeLog: * gcc.dg/plugin/diagnostic_group_plugin.cc: Define INCLUDE_VECTOR. * gcc.dg/plugin/diagnostic_plugin_test_show_locus.cc: Likewise. * gcc.dg/plugin/location_overflow_plugin.cc: Likewise. libcc1/ChangeLog: * context.cc: Define INCLUDE_VECTOR. Signed-off-by: David Malcolm <dmalcolm@redhat.com>
5083 lines
141 KiB
C++
5083 lines
141 KiB
C++
/* Call-backs for C++ error reporting.
|
||
This code is non-reentrant.
|
||
Copyright (C) 1993-2025 Free Software Foundation, Inc.
|
||
This file is part of GCC.
|
||
|
||
GCC is free software; you can redistribute it and/or modify
|
||
it under the terms of the GNU General Public License as published by
|
||
the Free Software Foundation; either version 3, or (at your option)
|
||
any later version.
|
||
|
||
GCC is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with GCC; see the file COPYING3. If not see
|
||
<http://www.gnu.org/licenses/>. */
|
||
|
||
#define INCLUDE_VECTOR
|
||
#include "config.h"
|
||
/* For use with name_hint. */
|
||
#include "system.h"
|
||
#include "coretypes.h"
|
||
#include "cp-tree.h"
|
||
#include "stringpool.h"
|
||
#include "tree-diagnostic.h"
|
||
#include "diagnostics/color.h"
|
||
#include "langhooks-def.h"
|
||
#include "intl.h"
|
||
#include "cxx-pretty-print.h"
|
||
#include "tree-pretty-print.h"
|
||
#include "tree-pretty-print-markup.h"
|
||
#include "gimple-pretty-print.h"
|
||
#include "c-family/c-objc.h"
|
||
#include "ubsan.h"
|
||
#include "internal-fn.h"
|
||
#include "c-family/c-type-mismatch.h"
|
||
#include "cp-name-hint.h"
|
||
#include "attribs.h"
|
||
#include "pretty-print-format-impl.h"
|
||
#include "diagnostics/text-sink.h"
|
||
|
||
#define pp_separate_with_comma(PP) pp_cxx_separate_with (PP, ',')
|
||
#define pp_separate_with_semicolon(PP) pp_cxx_separate_with (PP, ';')
|
||
|
||
/* cxx_pp is a C++ front-end-specific pretty printer: this is where we
|
||
dump C++ ASTs as strings. It is mostly used only by the various
|
||
tree -> string functions that are occasionally called from the
|
||
debugger or by the front-end for things like
|
||
__PRETTY_FUNCTION__. */
|
||
static cxx_pretty_printer actual_pretty_printer;
|
||
static cxx_pretty_printer * const cxx_pp = &actual_pretty_printer;
|
||
|
||
/* Translate if being used for diagnostics, but not for dump files or
|
||
__PRETTY_FUNCTION. */
|
||
#define M_(msgid) (pp_translate_identifiers (cxx_pp) ? _(msgid) : (msgid))
|
||
|
||
# define NEXT_CODE(T) (TREE_CODE (TREE_TYPE (T)))
|
||
|
||
static const char *args_to_string (tree, int);
|
||
static const char *code_to_string (enum tree_code);
|
||
static const char *cv_to_string (tree, int);
|
||
static const char *decl_to_string (tree, int, bool);
|
||
static const char *fndecl_to_string (tree, int);
|
||
static const char *op_to_string (bool, enum tree_code);
|
||
static const char *parm_to_string (int);
|
||
static const char *type_to_string (tree, int, bool, bool *, bool,
|
||
const char * = nullptr);
|
||
|
||
static void dump_alias_template_specialization (cxx_pretty_printer *, tree, int);
|
||
static void dump_type (cxx_pretty_printer *, tree, int);
|
||
static void dump_typename (cxx_pretty_printer *, tree, int);
|
||
static void dump_simple_decl (cxx_pretty_printer *, tree, tree, int);
|
||
static void dump_decl (cxx_pretty_printer *, tree, int);
|
||
static void dump_template_decl (cxx_pretty_printer *, tree, int);
|
||
static void dump_function_decl (cxx_pretty_printer *, tree, int);
|
||
static void dump_expr (cxx_pretty_printer *, tree, int);
|
||
static void dump_unary_op (cxx_pretty_printer *, const char *, tree, int);
|
||
static void dump_binary_op (cxx_pretty_printer *, const char *, tree, int);
|
||
static void dump_aggr_type (cxx_pretty_printer *, tree, int);
|
||
static void dump_type_prefix (cxx_pretty_printer *, tree, int);
|
||
static void dump_type_suffix (cxx_pretty_printer *, tree, int);
|
||
static void dump_function_name (cxx_pretty_printer *, tree, int);
|
||
static void dump_call_expr_args (cxx_pretty_printer *, tree, int, bool);
|
||
static void dump_expr_list (cxx_pretty_printer *, tree, int);
|
||
static void dump_global_iord (cxx_pretty_printer *, tree);
|
||
static void dump_parameters (cxx_pretty_printer *, tree, int);
|
||
static void dump_ref_qualifier (cxx_pretty_printer *, tree, int);
|
||
static void dump_exception_spec (cxx_pretty_printer *, tree, int);
|
||
static void dump_template_argument (cxx_pretty_printer *, tree, int);
|
||
static void dump_template_argument_list (cxx_pretty_printer *, tree, int);
|
||
static void dump_template_parameter (cxx_pretty_printer *, tree, int);
|
||
static void dump_template_bindings (cxx_pretty_printer *, tree, tree,
|
||
vec<tree, va_gc> *);
|
||
static void dump_scope (cxx_pretty_printer *, tree, int);
|
||
static void dump_template_parms (cxx_pretty_printer *, tree, int, int);
|
||
static int get_non_default_template_args_count (tree, int);
|
||
static const char *function_category (tree);
|
||
static void maybe_print_constexpr_context (diagnostics::text_sink &);
|
||
static void maybe_print_instantiation_context (diagnostics::text_sink &);
|
||
static void print_instantiation_full_context (diagnostics::text_sink &);
|
||
static void print_instantiation_partial_context (diagnostics::text_sink &,
|
||
struct tinst_level *,
|
||
location_t);
|
||
static void maybe_print_constraint_context (diagnostics::text_sink &);
|
||
static void cp_diagnostic_text_starter (diagnostics::text_sink &,
|
||
const diagnostics::diagnostic_info *);
|
||
static void cp_print_error_function (diagnostics::text_sink &,
|
||
const diagnostics::diagnostic_info *);
|
||
|
||
static bool cp_printer (pretty_printer *, text_info *, const char *,
|
||
int, bool, bool, bool, bool *, pp_token_list &);
|
||
|
||
/* Color names for highlighting "%qH" vs "%qI" values,
|
||
and ranges corresponding to them. */
|
||
const char *const highlight_colors::percent_h = "highlight-a";
|
||
const char *const highlight_colors::percent_i = "highlight-b";
|
||
|
||
/* Struct for handling %H or %I, which require delaying printing the
|
||
type until a postprocessing stage. */
|
||
|
||
class deferred_printed_type
|
||
{
|
||
public:
|
||
deferred_printed_type ()
|
||
: m_tree (NULL_TREE),
|
||
m_printed_text (),
|
||
m_token_list (nullptr),
|
||
m_verbose (false), m_quote (false)
|
||
{}
|
||
|
||
deferred_printed_type (tree type,
|
||
pp_token_list &token_list,
|
||
bool verbose,
|
||
bool quote)
|
||
: m_tree (type),
|
||
m_printed_text (),
|
||
m_token_list (&token_list),
|
||
m_verbose (verbose),
|
||
m_quote (quote)
|
||
{
|
||
gcc_assert (type);
|
||
}
|
||
|
||
void set_text_for_token_list (const char *text, bool quote)
|
||
{
|
||
/* Replace the contents of m_token_list with a text token for TEXT,
|
||
possibly wrapped by BEGIN_QUOTE/END_QUOTE (if QUOTE is true).
|
||
This allows us to ignore any {BEGIN,END}_QUOTE tokens added
|
||
by %qH and %qI, and instead use the quoting from type_to_string,
|
||
and its logic for "aka". */
|
||
while (m_token_list->m_first)
|
||
m_token_list->pop_front ();
|
||
|
||
if (quote)
|
||
m_token_list->push_back<pp_token_begin_quote> ();
|
||
|
||
// TEXT is gc-allocated, so we can borrow it
|
||
m_token_list->push_back_text (label_text::borrow (text));
|
||
|
||
if (quote)
|
||
m_token_list->push_back<pp_token_end_quote> ();
|
||
}
|
||
|
||
/* The tree is not GTY-marked: they are only non-NULL within a
|
||
call to pp_format. */
|
||
tree m_tree;
|
||
label_text m_printed_text;
|
||
pp_token_list *m_token_list;
|
||
bool m_verbose;
|
||
bool m_quote;
|
||
};
|
||
|
||
/* Subclass of format_postprocessor for the C++ frontend.
|
||
This handles the %H and %I formatting codes, printing them
|
||
in a postprocessing phase (since they affect each other). */
|
||
|
||
class cxx_format_postprocessor : public format_postprocessor
|
||
{
|
||
public:
|
||
cxx_format_postprocessor ()
|
||
: m_type_a (), m_type_b ()
|
||
{}
|
||
|
||
std::unique_ptr<format_postprocessor>
|
||
clone() const final override
|
||
{
|
||
return std::make_unique<cxx_format_postprocessor> ();
|
||
}
|
||
|
||
void handle (pretty_printer *pp) final override;
|
||
|
||
deferred_printed_type m_type_a;
|
||
deferred_printed_type m_type_b;
|
||
};
|
||
|
||
/* Constructor and destructor for cxx_dump_pretty_printer, defined here to
|
||
avoid needing to move cxx_format_postprocessor into the header as well. */
|
||
|
||
cxx_dump_pretty_printer::
|
||
cxx_dump_pretty_printer (int phase)
|
||
: phase (phase)
|
||
{
|
||
outf = dump_begin (phase, &flags);
|
||
if (outf)
|
||
{
|
||
pp_format_decoder (this) = cp_printer;
|
||
set_format_postprocessor (std::make_unique<cxx_format_postprocessor> ());
|
||
set_output_stream (outf);
|
||
}
|
||
}
|
||
|
||
cxx_dump_pretty_printer::
|
||
~cxx_dump_pretty_printer ()
|
||
{
|
||
if (outf)
|
||
{
|
||
pp_flush (this);
|
||
dump_end (phase, outf);
|
||
}
|
||
}
|
||
|
||
/* Return the in-scope template that's currently being parsed, or
|
||
NULL_TREE otherwise. */
|
||
|
||
static tree
|
||
get_current_template ()
|
||
{
|
||
if (scope_chain && in_template_context && !current_instantiation ())
|
||
if (tree ti = get_template_info (current_scope ()))
|
||
{
|
||
if (PRIMARY_TEMPLATE_P (TI_TEMPLATE (ti)) && TI_PARTIAL_INFO (ti))
|
||
ti = TI_PARTIAL_INFO (ti);
|
||
return TI_TEMPLATE (ti);
|
||
}
|
||
|
||
return NULL_TREE;
|
||
}
|
||
|
||
/* A map from TEMPLATE_DECLs that we've determined to be erroneous
|
||
at parse time to the location of the first error within. */
|
||
|
||
erroneous_templates_t *erroneous_templates;
|
||
|
||
/* Callback function diagnostics::context::m_adjust_diagnostic_info.
|
||
|
||
Errors issued when parsing a template are automatically treated like
|
||
permerrors associated with the -Wtemplate-body flag and can be
|
||
downgraded into warnings accordingly, in which case we'll still
|
||
issue an error if we later need to instantiate the template. */
|
||
|
||
static void
|
||
cp_adjust_diagnostic_info (const diagnostics::context &context,
|
||
diagnostics::diagnostic_info *diagnostic)
|
||
{
|
||
if (diagnostic->m_kind == diagnostics::kind::error)
|
||
if (tree tmpl = get_current_template ())
|
||
{
|
||
diagnostic->m_option_id = OPT_Wtemplate_body;
|
||
|
||
if (context.m_permissive)
|
||
diagnostic->m_kind = diagnostics::kind::warning;
|
||
|
||
bool existed;
|
||
location_t &error_loc
|
||
= hash_map_safe_get_or_insert<true> (erroneous_templates,
|
||
tmpl, &existed);
|
||
if (!existed)
|
||
/* Remember that this template had a parse-time error so
|
||
that we'll ensure a hard error has been issued upon
|
||
its instantiation. */
|
||
error_loc = diagnostic->m_richloc->get_loc ();
|
||
}
|
||
}
|
||
|
||
/* A generalization of seen_error which also returns true if we've
|
||
permissively downgraded an error to a warning inside a template. */
|
||
|
||
bool
|
||
cp_seen_error ()
|
||
{
|
||
if ((seen_error) ())
|
||
return true;
|
||
|
||
if (erroneous_templates)
|
||
if (tree tmpl = get_current_template ())
|
||
if (erroneous_templates->get (tmpl))
|
||
return true;
|
||
|
||
return false;
|
||
}
|
||
|
||
/* CONTEXT->printer is a basic pretty printer that was constructed
|
||
presumably by diagnostic_initialize(), called early in the
|
||
compiler's initialization process (in general_init) Before the FE
|
||
is initialized. This (C++) FE-specific diagnostic initializer is
|
||
thus replacing the basic pretty printer with one that has C++-aware
|
||
capacities. */
|
||
|
||
void
|
||
cxx_initialize_diagnostics (diagnostics::context *context)
|
||
{
|
||
cxx_pretty_printer *pp = new cxx_pretty_printer ();
|
||
pp->set_format_postprocessor (std::make_unique<cxx_format_postprocessor> ());
|
||
context->set_pretty_printer (std::unique_ptr<pretty_printer> (pp));
|
||
|
||
c_common_diagnostics_set_defaults (context);
|
||
diagnostics::text_starter (context) = cp_diagnostic_text_starter;
|
||
/* diagnostic_finalizer is already c_diagnostic_text_finalizer. */
|
||
context->set_format_decoder (cp_printer);
|
||
context->set_adjust_diagnostic_info_callback (cp_adjust_diagnostic_info);
|
||
}
|
||
|
||
/* Dump an '@module' name suffix for DECL, if it's attached to an import. */
|
||
|
||
static void
|
||
dump_module_suffix (cxx_pretty_printer *pp, tree decl)
|
||
{
|
||
if (!modules_p ())
|
||
return;
|
||
|
||
if (!DECL_CONTEXT (decl))
|
||
return;
|
||
|
||
if (TREE_CODE (decl) != CONST_DECL
|
||
|| !UNSCOPED_ENUM_P (DECL_CONTEXT (decl)))
|
||
{
|
||
if (!DECL_NAMESPACE_SCOPE_P (decl))
|
||
return;
|
||
|
||
if (TREE_CODE (decl) == NAMESPACE_DECL
|
||
&& !DECL_NAMESPACE_ALIAS (decl)
|
||
&& (TREE_PUBLIC (decl) || !TREE_PUBLIC (CP_DECL_CONTEXT (decl))))
|
||
return;
|
||
}
|
||
|
||
int m = get_originating_module (decl, /*global=-1*/true);
|
||
if (m > 0)
|
||
if (const char *n = module_name (m, false))
|
||
{
|
||
pp_character (pp, '@');
|
||
pp->set_padding (pp_none);
|
||
pp_string (pp, n);
|
||
}
|
||
}
|
||
|
||
/* The scope of the declaration we're currently printing, to avoid redundantly
|
||
dumping the same scope on parameter types. */
|
||
static tree current_dump_scope;
|
||
|
||
/* Dump a scope, if deemed necessary. */
|
||
|
||
static void
|
||
dump_scope (cxx_pretty_printer *pp, tree scope, int flags)
|
||
{
|
||
int f = flags & (TFF_SCOPE | TFF_CHASE_TYPEDEF);
|
||
|
||
if (scope == NULL_TREE || scope == current_dump_scope)
|
||
return;
|
||
|
||
/* Enum values within an unscoped enum will be CONST_DECL with an
|
||
ENUMERAL_TYPE as their "scope". Use CP_TYPE_CONTEXT of the
|
||
ENUMERAL_TYPE, so as to print any enclosing namespace. */
|
||
if (UNSCOPED_ENUM_P (scope))
|
||
scope = CP_TYPE_CONTEXT (scope);
|
||
|
||
if (TREE_CODE (scope) == NAMESPACE_DECL)
|
||
{
|
||
if (scope != global_namespace)
|
||
{
|
||
dump_decl (pp, scope, f);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
}
|
||
else if (AGGREGATE_TYPE_P (scope)
|
||
|| SCOPED_ENUM_P (scope))
|
||
{
|
||
dump_type (pp, scope, f);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
else if ((flags & TFF_SCOPE) && TREE_CODE (scope) == FUNCTION_DECL)
|
||
{
|
||
dump_function_decl (pp, scope, f | TFF_NO_TEMPLATE_BINDINGS);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
}
|
||
|
||
/* Dump the template ARGument under control of FLAGS. */
|
||
|
||
static void
|
||
dump_template_argument (cxx_pretty_printer *pp, tree arg, int flags)
|
||
{
|
||
if (ARGUMENT_PACK_P (arg))
|
||
dump_template_argument_list (pp, ARGUMENT_PACK_ARGS (arg),
|
||
/* No default args in argument packs. */
|
||
flags|TFF_NO_OMIT_DEFAULT_TEMPLATE_ARGUMENTS);
|
||
else if (TYPE_P (arg) || TREE_CODE (arg) == TEMPLATE_DECL)
|
||
dump_type (pp, arg, flags & ~TFF_CLASS_KEY_OR_ENUM);
|
||
else
|
||
{
|
||
if (TREE_CODE (arg) == TREE_LIST)
|
||
arg = TREE_VALUE (arg);
|
||
|
||
/* Strip implicit conversions. */
|
||
while (CONVERT_EXPR_P (arg))
|
||
arg = TREE_OPERAND (arg, 0);
|
||
|
||
dump_expr (pp, arg, (flags | TFF_EXPR_IN_PARENS) & ~TFF_CLASS_KEY_OR_ENUM);
|
||
}
|
||
}
|
||
|
||
/* Count the number of template arguments ARGS whose value does not
|
||
match the (optional) default template parameter in PARAMS */
|
||
|
||
static int
|
||
get_non_default_template_args_count (tree args, int flags)
|
||
{
|
||
int n = TREE_VEC_LENGTH (INNERMOST_TEMPLATE_ARGS (args));
|
||
|
||
if (/* We use this flag when generating debug information. We don't
|
||
want to expand templates at this point, for this may generate
|
||
new decls, which gets decl counts out of sync, which may in
|
||
turn cause codegen differences between compilations with and
|
||
without -g. */
|
||
(flags & TFF_NO_OMIT_DEFAULT_TEMPLATE_ARGUMENTS) != 0
|
||
|| !flag_pretty_templates)
|
||
return n;
|
||
|
||
return GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (INNERMOST_TEMPLATE_ARGS (args));
|
||
}
|
||
|
||
/* Dump a template-argument-list ARGS (always a TREE_VEC) under control
|
||
of FLAGS. */
|
||
|
||
static void
|
||
dump_template_argument_list (cxx_pretty_printer *pp, tree args, int flags)
|
||
{
|
||
int n = get_non_default_template_args_count (args, flags);
|
||
int need_comma = 0;
|
||
int i;
|
||
|
||
for (i = 0; i < n; ++i)
|
||
{
|
||
tree arg = TREE_VEC_ELT (args, i);
|
||
|
||
/* Only print a comma if we know there is an argument coming. In
|
||
the case of an empty template argument pack, no actual
|
||
argument will be printed. */
|
||
if (need_comma
|
||
&& (!ARGUMENT_PACK_P (arg)
|
||
|| TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg)) > 0))
|
||
pp_separate_with_comma (pp);
|
||
|
||
dump_template_argument (pp, arg, flags);
|
||
need_comma = 1;
|
||
}
|
||
}
|
||
|
||
/* Dump a template parameter PARM (a TREE_LIST) under control of FLAGS. */
|
||
|
||
static void
|
||
dump_template_parameter (cxx_pretty_printer *pp, tree parm, int flags)
|
||
{
|
||
tree p;
|
||
tree a;
|
||
|
||
if (parm == error_mark_node)
|
||
return;
|
||
|
||
p = TREE_VALUE (parm);
|
||
a = TREE_PURPOSE (parm);
|
||
|
||
if (TREE_CODE (p) == TYPE_DECL)
|
||
{
|
||
if (flags & TFF_DECL_SPECIFIERS)
|
||
{
|
||
pp_cxx_ws_string (pp, "class");
|
||
if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (p)))
|
||
pp_cxx_ws_string (pp, "...");
|
||
if (DECL_NAME (p))
|
||
pp_cxx_tree_identifier (pp, DECL_NAME (p));
|
||
}
|
||
else if (DECL_NAME (p))
|
||
pp_cxx_tree_identifier (pp, DECL_NAME (p));
|
||
else
|
||
pp_cxx_canonical_template_parameter (pp, TREE_TYPE (p));
|
||
}
|
||
else
|
||
dump_decl (pp, p, flags | TFF_DECL_SPECIFIERS);
|
||
|
||
if ((flags & TFF_FUNCTION_DEFAULT_ARGUMENTS) && a != NULL_TREE)
|
||
{
|
||
pp_cxx_whitespace (pp);
|
||
pp_equal (pp);
|
||
pp_cxx_whitespace (pp);
|
||
if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
|
||
dump_type (pp, a, flags & ~TFF_CHASE_TYPEDEF);
|
||
else
|
||
dump_expr (pp, a, flags | TFF_EXPR_IN_PARENS);
|
||
}
|
||
}
|
||
|
||
/* Dump, under control of FLAGS, a template-parameter-list binding.
|
||
PARMS is a TREE_LIST of TREE_VEC of TREE_LIST and ARGS is a
|
||
TREE_VEC. */
|
||
|
||
static void
|
||
dump_template_bindings (cxx_pretty_printer *pp, tree parms, tree args,
|
||
vec<tree, va_gc> *typenames)
|
||
{
|
||
/* Print "[with" and ']', conditional on whether anything is printed at all.
|
||
This is tied to whether a semicolon is needed to separate multiple template
|
||
parameters. */
|
||
struct prepost_semicolon
|
||
{
|
||
cxx_pretty_printer *pp;
|
||
bool need_semicolon;
|
||
|
||
void operator() ()
|
||
{
|
||
if (need_semicolon)
|
||
pp_separate_with_semicolon (pp);
|
||
else
|
||
{
|
||
pp_cxx_whitespace (pp);
|
||
pp_string (pp, colorize_start (pp_show_color (pp), "targs"));
|
||
pp_cxx_left_bracket (pp);
|
||
pp->translate_string ("with");
|
||
pp_cxx_whitespace (pp);
|
||
need_semicolon = true;
|
||
}
|
||
}
|
||
|
||
~prepost_semicolon ()
|
||
{
|
||
if (need_semicolon)
|
||
{
|
||
pp_cxx_right_bracket (pp);
|
||
pp_string (pp, colorize_stop (pp_show_color (pp)));
|
||
}
|
||
}
|
||
} semicolon_or_introducer = {pp, false};
|
||
|
||
int i;
|
||
tree t;
|
||
|
||
while (parms)
|
||
{
|
||
tree p = TREE_VALUE (parms);
|
||
int lvl = TMPL_PARMS_DEPTH (parms);
|
||
int arg_idx = 0;
|
||
int i;
|
||
tree lvl_args = NULL_TREE;
|
||
|
||
/* Don't crash if we had an invalid argument list. */
|
||
if (TMPL_ARGS_DEPTH (args) >= lvl)
|
||
lvl_args = TMPL_ARGS_LEVEL (args, lvl);
|
||
|
||
for (i = 0; i < TREE_VEC_LENGTH (p); ++i)
|
||
{
|
||
tree arg = NULL_TREE;
|
||
|
||
/* Don't crash if we had an invalid argument list. */
|
||
if (lvl_args && NUM_TMPL_ARGS (lvl_args) > arg_idx)
|
||
arg = TREE_VEC_ELT (lvl_args, arg_idx);
|
||
|
||
tree parm_i = TREE_VEC_ELT (p, i);
|
||
/* If the template argument repeats the template parameter (T = T),
|
||
skip the parameter.*/
|
||
if (arg && TREE_CODE (arg) == TEMPLATE_TYPE_PARM
|
||
&& arg == TYPE_MAIN_VARIANT (arg)
|
||
&& TREE_CODE (parm_i) == TREE_LIST
|
||
&& TREE_CODE (TREE_VALUE (parm_i)) == TYPE_DECL
|
||
&& (TREE_CODE (TREE_TYPE (TREE_VALUE (parm_i)))
|
||
== TEMPLATE_TYPE_PARM)
|
||
&& (DECL_NAME (TREE_VALUE (parm_i))
|
||
== DECL_NAME (TYPE_STUB_DECL (arg))))
|
||
continue;
|
||
|
||
semicolon_or_introducer ();
|
||
dump_template_parameter (pp, parm_i, TFF_PLAIN_IDENTIFIER);
|
||
pp_cxx_whitespace (pp);
|
||
pp_equal (pp);
|
||
pp_cxx_whitespace (pp);
|
||
if (arg)
|
||
{
|
||
if (ARGUMENT_PACK_P (arg))
|
||
pp_cxx_left_brace (pp);
|
||
dump_template_argument (pp, arg, TFF_PLAIN_IDENTIFIER);
|
||
if (ARGUMENT_PACK_P (arg))
|
||
pp_cxx_right_brace (pp);
|
||
}
|
||
else
|
||
pp_string (pp, M_("<missing>"));
|
||
|
||
++arg_idx;
|
||
}
|
||
|
||
parms = TREE_CHAIN (parms);
|
||
}
|
||
|
||
/* Don't bother with typenames for a partial instantiation. */
|
||
if (vec_safe_is_empty (typenames) || uses_template_parms (args))
|
||
return;
|
||
|
||
/* Don't try to print typenames when we're processing a clone. */
|
||
if (current_function_decl
|
||
&& !DECL_LANG_SPECIFIC (current_function_decl))
|
||
return;
|
||
|
||
/* Don't try to do this once cgraph starts throwing away front-end
|
||
information. */
|
||
if (at_eof >= 3)
|
||
return;
|
||
|
||
FOR_EACH_VEC_SAFE_ELT (typenames, i, t)
|
||
{
|
||
semicolon_or_introducer ();
|
||
dump_type (pp, t, TFF_PLAIN_IDENTIFIER);
|
||
pp_cxx_whitespace (pp);
|
||
pp_equal (pp);
|
||
pp_cxx_whitespace (pp);
|
||
push_deferring_access_checks (dk_no_check);
|
||
t = tsubst (t, args, tf_none, NULL_TREE);
|
||
pop_deferring_access_checks ();
|
||
/* Strip typedefs. We can't just use TFF_CHASE_TYPEDEF because
|
||
pp_simple_type_specifier doesn't know about it. */
|
||
t = strip_typedefs (t, NULL, STF_USER_VISIBLE);
|
||
dump_type (pp, t, TFF_PLAIN_IDENTIFIER);
|
||
}
|
||
}
|
||
|
||
/* Dump a human-readable equivalent of the alias template
|
||
specialization of T. */
|
||
|
||
static void
|
||
dump_alias_template_specialization (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
gcc_assert (alias_template_specialization_p (t, nt_opaque));
|
||
|
||
tree decl = TYPE_NAME (t);
|
||
if (!(flags & TFF_UNQUALIFIED_NAME))
|
||
dump_scope (pp, CP_DECL_CONTEXT (decl), flags);
|
||
pp_cxx_tree_identifier (pp, DECL_NAME (decl));
|
||
dump_template_parms (pp, DECL_TEMPLATE_INFO (decl),
|
||
/*primary=*/false,
|
||
flags & ~TFF_TEMPLATE_HEADER);
|
||
}
|
||
|
||
/* Dump a human-readable equivalent of TYPE. FLAGS controls the
|
||
format. */
|
||
|
||
static void
|
||
dump_type (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
if (t == NULL_TREE)
|
||
return;
|
||
|
||
/* Don't print e.g. "struct mytypedef". */
|
||
if (TYPE_P (t) && typedef_variant_p (t))
|
||
{
|
||
tree decl = TYPE_NAME (t);
|
||
if ((flags & TFF_CHASE_TYPEDEF)
|
||
|| DECL_SELF_REFERENCE_P (decl)
|
||
|| (!flag_pretty_templates
|
||
&& DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)))
|
||
{
|
||
unsigned int stf_flags = (!(pp->flags & pp_c_flag_gnu_v3)
|
||
? STF_USER_VISIBLE : 0);
|
||
t = strip_typedefs (t, NULL, stf_flags);
|
||
}
|
||
else if (alias_template_specialization_p (t, nt_opaque))
|
||
{
|
||
dump_alias_template_specialization (pp, t, flags);
|
||
return;
|
||
}
|
||
else if (same_type_p (t, TREE_TYPE (decl)))
|
||
t = decl;
|
||
else
|
||
{
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
if (! (flags & TFF_UNQUALIFIED_NAME))
|
||
dump_scope (pp, CP_DECL_CONTEXT (decl), flags);
|
||
pp_cxx_tree_identifier (pp, TYPE_IDENTIFIER (t));
|
||
return;
|
||
}
|
||
}
|
||
|
||
if (TYPE_PTRMEMFUNC_P (t))
|
||
goto offset_type;
|
||
|
||
switch (TREE_CODE (t))
|
||
{
|
||
case LANG_TYPE:
|
||
if (t == init_list_type_node)
|
||
pp_string (pp, M_("<brace-enclosed initializer list>"));
|
||
else if (t == unknown_type_node)
|
||
pp_string (pp, M_("<unresolved overloaded function type>"));
|
||
else
|
||
{
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
if (tree id = TYPE_IDENTIFIER (t))
|
||
pp_cxx_tree_identifier (pp, id);
|
||
}
|
||
break;
|
||
|
||
case TREE_VEC:
|
||
{
|
||
/* A list of types used for a trait. */
|
||
bool need_comma = false;
|
||
for (tree arg : tree_vec_range (t))
|
||
{
|
||
if (need_comma)
|
||
pp_separate_with_comma (pp);
|
||
dump_type (pp, arg, flags);
|
||
need_comma = true;
|
||
}
|
||
}
|
||
break;
|
||
|
||
case TREE_LIST:
|
||
/* A list of function parms. */
|
||
dump_parameters (pp, t, flags);
|
||
break;
|
||
|
||
case IDENTIFIER_NODE:
|
||
pp_cxx_tree_identifier (pp, t);
|
||
break;
|
||
|
||
case TREE_BINFO:
|
||
dump_type (pp, BINFO_TYPE (t), flags);
|
||
break;
|
||
|
||
case RECORD_TYPE:
|
||
case UNION_TYPE:
|
||
case ENUMERAL_TYPE:
|
||
dump_aggr_type (pp, t, flags);
|
||
break;
|
||
|
||
case TYPE_DECL:
|
||
if (flags & TFF_CHASE_TYPEDEF)
|
||
{
|
||
dump_type (pp, DECL_ORIGINAL_TYPE (t)
|
||
? DECL_ORIGINAL_TYPE (t) : TREE_TYPE (t), flags);
|
||
break;
|
||
}
|
||
/* Fall through. */
|
||
|
||
case TEMPLATE_DECL:
|
||
case NAMESPACE_DECL:
|
||
dump_decl (pp, t, flags & ~TFF_DECL_SPECIFIERS);
|
||
break;
|
||
|
||
case INTEGER_TYPE:
|
||
case REAL_TYPE:
|
||
case VOID_TYPE:
|
||
case OPAQUE_TYPE:
|
||
case BOOLEAN_TYPE:
|
||
case COMPLEX_TYPE:
|
||
case VECTOR_TYPE:
|
||
case FIXED_POINT_TYPE:
|
||
pp_type_specifier_seq (pp, t);
|
||
break;
|
||
|
||
case TEMPLATE_TEMPLATE_PARM:
|
||
/* For parameters inside template signature. */
|
||
if (TYPE_IDENTIFIER (t))
|
||
pp_cxx_tree_identifier (pp, TYPE_IDENTIFIER (t));
|
||
else
|
||
pp_cxx_canonical_template_parameter (pp, t);
|
||
break;
|
||
|
||
case BOUND_TEMPLATE_TEMPLATE_PARM:
|
||
{
|
||
tree args = TYPE_TI_ARGS (t);
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
pp_cxx_tree_identifier (pp, TYPE_IDENTIFIER (t));
|
||
pp_cxx_begin_template_argument_list (pp);
|
||
dump_template_argument_list (pp, args, flags);
|
||
pp_cxx_end_template_argument_list (pp);
|
||
}
|
||
break;
|
||
|
||
case TEMPLATE_TYPE_PARM:
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
if (template_placeholder_p (t))
|
||
{
|
||
tree tmpl = TREE_TYPE (CLASS_PLACEHOLDER_TEMPLATE (t));
|
||
pp_cxx_tree_identifier (pp, TYPE_IDENTIFIER (tmpl));
|
||
pp_string (pp, "<...auto...>");
|
||
}
|
||
else if (TYPE_IDENTIFIER (t))
|
||
pp_cxx_tree_identifier (pp, TYPE_IDENTIFIER (t));
|
||
else
|
||
pp_cxx_canonical_template_parameter
|
||
(pp, TEMPLATE_TYPE_PARM_INDEX (t));
|
||
/* If this is a constrained placeholder, add the requirements. */
|
||
if (tree c = PLACEHOLDER_TYPE_CONSTRAINTS (t))
|
||
pp_cxx_constrained_type_spec (pp, c);
|
||
break;
|
||
|
||
/* This is not always necessary for pointers and such, but doing this
|
||
reduces code size. */
|
||
case ARRAY_TYPE:
|
||
case POINTER_TYPE:
|
||
case REFERENCE_TYPE:
|
||
case OFFSET_TYPE:
|
||
offset_type:
|
||
case FUNCTION_TYPE:
|
||
case METHOD_TYPE:
|
||
{
|
||
dump_type_prefix (pp, t, flags);
|
||
dump_type_suffix (pp, t, flags);
|
||
break;
|
||
}
|
||
case TYPENAME_TYPE:
|
||
if (! (flags & TFF_CHASE_TYPEDEF)
|
||
&& DECL_ORIGINAL_TYPE (TYPE_NAME (t)))
|
||
{
|
||
dump_decl (pp, TYPE_NAME (t), TFF_PLAIN_IDENTIFIER);
|
||
break;
|
||
}
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
pp_cxx_ws_string (pp,
|
||
TYPENAME_IS_ENUM_P (t) ? "enum"
|
||
: TYPENAME_IS_CLASS_P (t) ? "class"
|
||
: TYPENAME_IS_UNION_P (t) ? "union"
|
||
: "typename");
|
||
dump_typename (pp, t, flags);
|
||
break;
|
||
|
||
case UNBOUND_CLASS_TEMPLATE:
|
||
if (! (flags & TFF_UNQUALIFIED_NAME))
|
||
{
|
||
dump_type (pp, TYPE_CONTEXT (t), flags);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
pp_cxx_ws_string (pp, "template");
|
||
dump_type (pp, TYPE_IDENTIFIER (t), flags);
|
||
break;
|
||
|
||
case TYPEOF_TYPE:
|
||
pp_cxx_ws_string (pp, "__typeof__");
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TYPEOF_TYPE_EXPR (t), flags & ~TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case TRAIT_TYPE:
|
||
pp_cxx_trait (pp, t);
|
||
break;
|
||
|
||
case TYPE_PACK_EXPANSION:
|
||
dump_type (pp, PACK_EXPANSION_PATTERN (t), flags);
|
||
pp_cxx_ws_string (pp, "...");
|
||
break;
|
||
|
||
case PACK_INDEX_TYPE:
|
||
dump_type (pp, PACK_INDEX_PACK (t), flags);
|
||
pp_cxx_left_bracket (pp);
|
||
dump_expr (pp, PACK_INDEX_INDEX (t), flags & ~TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_bracket (pp);
|
||
break;
|
||
|
||
case TYPE_ARGUMENT_PACK:
|
||
dump_template_argument (pp, t, flags);
|
||
break;
|
||
|
||
case DECLTYPE_TYPE:
|
||
pp_cxx_ws_string (pp, "decltype");
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, DECLTYPE_TYPE_EXPR (t), flags & ~TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case NULLPTR_TYPE:
|
||
pp_string (pp, "std::nullptr_t");
|
||
break;
|
||
|
||
default:
|
||
pp_unsupported_tree (pp, t);
|
||
/* Fall through. */
|
||
|
||
case ERROR_MARK:
|
||
pp_string (pp, M_("<type error>"));
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Dump a TYPENAME_TYPE. We need to notice when the context is itself
|
||
a TYPENAME_TYPE. */
|
||
|
||
static void
|
||
dump_typename (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
tree ctx = TYPE_CONTEXT (t);
|
||
|
||
if (TREE_CODE (ctx) == TYPENAME_TYPE)
|
||
dump_typename (pp, ctx, flags);
|
||
else
|
||
dump_type (pp, ctx, flags & ~TFF_CLASS_KEY_OR_ENUM);
|
||
pp_cxx_colon_colon (pp);
|
||
dump_decl (pp, TYPENAME_TYPE_FULLNAME (t), flags);
|
||
}
|
||
|
||
/* Return the name of the supplied aggregate, or enumeral type. */
|
||
|
||
const char *
|
||
class_key_or_enum_as_string (tree t)
|
||
{
|
||
if (TREE_CODE (t) == ENUMERAL_TYPE)
|
||
{
|
||
if (SCOPED_ENUM_P (t))
|
||
return "enum class";
|
||
else
|
||
return "enum";
|
||
}
|
||
else if (TREE_CODE (t) == UNION_TYPE)
|
||
return "union";
|
||
else if (TYPE_LANG_SPECIFIC (t) && CLASSTYPE_DECLARED_CLASS (t))
|
||
return "class";
|
||
else
|
||
return "struct";
|
||
}
|
||
|
||
/* Disable warnings about missing quoting in GCC diagnostics for
|
||
the pp_verbatim call. Their format strings deliberately don't
|
||
follow GCC diagnostic conventions. */
|
||
#if __GNUC__ >= 10
|
||
#pragma GCC diagnostic push
|
||
#pragma GCC diagnostic ignored "-Wformat-diag"
|
||
#endif
|
||
|
||
/* Print out a class declaration T under the control of FLAGS,
|
||
in the form `class foo'. */
|
||
|
||
static void
|
||
dump_aggr_type (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
const char *variety = class_key_or_enum_as_string (t);
|
||
int typdef = 0;
|
||
int tmplate = 0;
|
||
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
|
||
if (flags & TFF_CLASS_KEY_OR_ENUM)
|
||
pp_cxx_ws_string (pp, variety);
|
||
|
||
tree decl = TYPE_NAME (t);
|
||
|
||
if (decl)
|
||
{
|
||
typdef = (!DECL_ARTIFICIAL (decl)
|
||
/* An alias specialization is not considered to be a
|
||
typedef. */
|
||
&& !alias_template_specialization_p (t, nt_opaque));
|
||
|
||
if ((typdef
|
||
&& ((flags & TFF_CHASE_TYPEDEF)
|
||
|| (!flag_pretty_templates && DECL_LANG_SPECIFIC (decl)
|
||
&& DECL_TEMPLATE_INFO (decl))))
|
||
|| DECL_SELF_REFERENCE_P (decl))
|
||
{
|
||
t = TYPE_MAIN_VARIANT (t);
|
||
decl = TYPE_NAME (t);
|
||
typdef = 0;
|
||
}
|
||
|
||
tmplate = !typdef && TREE_CODE (t) != ENUMERAL_TYPE
|
||
&& TYPE_LANG_SPECIFIC (t) && CLASSTYPE_TEMPLATE_INFO (t)
|
||
&& (TREE_CODE (CLASSTYPE_TI_TEMPLATE (t)) != TEMPLATE_DECL
|
||
|| PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t)));
|
||
|
||
if (! (flags & TFF_UNQUALIFIED_NAME))
|
||
dump_scope (pp, CP_DECL_CONTEXT (decl), flags | TFF_SCOPE);
|
||
flags &= ~TFF_UNQUALIFIED_NAME;
|
||
if (tmplate)
|
||
{
|
||
/* Because the template names are mangled, we have to locate
|
||
the most general template, and use that name. */
|
||
tree tpl = TYPE_TI_TEMPLATE (t);
|
||
|
||
while (DECL_TEMPLATE_INFO (tpl))
|
||
tpl = DECL_TI_TEMPLATE (tpl);
|
||
decl = tpl;
|
||
}
|
||
}
|
||
|
||
if (LAMBDA_TYPE_P (t))
|
||
{
|
||
/* A lambda's "type" is essentially its signature. */
|
||
pp_string (pp, M_("<lambda"));
|
||
tree const fn = lambda_function (t);
|
||
if (fn)
|
||
{
|
||
int const parm_flags
|
||
= DECL_XOBJ_MEMBER_FUNCTION_P (fn) ? TFF_XOBJ_FUNC | flags
|
||
: flags;
|
||
dump_parameters (pp, FUNCTION_FIRST_USER_PARMTYPE (fn), parm_flags);
|
||
}
|
||
pp_greater (pp);
|
||
}
|
||
else if (!decl || IDENTIFIER_ANON_P (DECL_NAME (decl)))
|
||
{
|
||
if (flags & TFF_CLASS_KEY_OR_ENUM)
|
||
pp_string (pp, M_("<unnamed>"));
|
||
else
|
||
pp_printf (pp, M_("<unnamed %s>"), variety);
|
||
}
|
||
else
|
||
pp_cxx_tree_identifier (pp, DECL_NAME (decl));
|
||
|
||
dump_module_suffix (pp, decl);
|
||
|
||
if (tmplate)
|
||
dump_template_parms (pp, TYPE_TEMPLATE_INFO (t),
|
||
!CLASSTYPE_USE_TEMPLATE (t),
|
||
flags & ~TFF_TEMPLATE_HEADER);
|
||
}
|
||
|
||
#if __GNUC__ >= 10
|
||
#pragma GCC diagnostic pop
|
||
#endif
|
||
|
||
/* Dump into the obstack the initial part of the output for a given type.
|
||
This is necessary when dealing with things like functions returning
|
||
functions. Examples:
|
||
|
||
return type of `int (* fee ())()': pointer -> function -> int. Both
|
||
pointer (and reference and offset) and function (and member) types must
|
||
deal with prefix and suffix.
|
||
|
||
Arrays must also do this for DECL nodes, like int a[], and for things like
|
||
int *[]&. */
|
||
|
||
static void
|
||
dump_type_prefix (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
if (TYPE_PTRMEMFUNC_P (t))
|
||
{
|
||
t = TYPE_PTRMEMFUNC_FN_TYPE (t);
|
||
goto offset_type;
|
||
}
|
||
|
||
switch (TREE_CODE (t))
|
||
{
|
||
case POINTER_TYPE:
|
||
case REFERENCE_TYPE:
|
||
{
|
||
tree sub = TREE_TYPE (t);
|
||
|
||
dump_type_prefix (pp, sub, flags);
|
||
if (TREE_CODE (sub) == ARRAY_TYPE
|
||
|| TREE_CODE (sub) == FUNCTION_TYPE)
|
||
{
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
/* If we're dealing with the GNU form of attributes, print this:
|
||
void (__attribute__((noreturn)) *f) ();
|
||
If it is the standard [[]] attribute, we'll print the attribute
|
||
in dump_type_suffix. */
|
||
if (!cxx11_attribute_p (TYPE_ATTRIBUTES (sub)))
|
||
pp_c_attributes_display (pp, TYPE_ATTRIBUTES (sub));
|
||
}
|
||
if (TYPE_PTR_P (t))
|
||
pp_star (pp);
|
||
else if (TYPE_REF_P (t))
|
||
{
|
||
if (TYPE_REF_IS_RVALUE (t))
|
||
pp_ampersand_ampersand (pp);
|
||
else
|
||
pp_ampersand (pp);
|
||
}
|
||
pp->set_padding (pp_before);
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
}
|
||
break;
|
||
|
||
case OFFSET_TYPE:
|
||
offset_type:
|
||
dump_type_prefix (pp, TREE_TYPE (t), flags);
|
||
if (TREE_CODE (t) == OFFSET_TYPE) /* pmfs deal with this in d_t_p */
|
||
{
|
||
pp_maybe_space (pp);
|
||
if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE)
|
||
pp_cxx_left_paren (pp);
|
||
dump_type (pp, TYPE_OFFSET_BASETYPE (t), flags);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
pp_cxx_star (pp);
|
||
pp_cxx_cv_qualifier_seq (pp, t);
|
||
pp->set_padding (pp_before);
|
||
break;
|
||
|
||
/* This can be reached without a pointer when dealing with
|
||
templates, e.g. std::is_function. */
|
||
case FUNCTION_TYPE:
|
||
dump_type_prefix (pp, TREE_TYPE (t), flags);
|
||
break;
|
||
|
||
case METHOD_TYPE:
|
||
dump_type_prefix (pp, TREE_TYPE (t), flags);
|
||
pp_maybe_space (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_aggr_type (pp, TYPE_METHOD_BASETYPE (t), flags);
|
||
pp_cxx_colon_colon (pp);
|
||
break;
|
||
|
||
case ARRAY_TYPE:
|
||
dump_type_prefix (pp, TREE_TYPE (t), flags);
|
||
break;
|
||
|
||
case ENUMERAL_TYPE:
|
||
case IDENTIFIER_NODE:
|
||
case INTEGER_TYPE:
|
||
case BOOLEAN_TYPE:
|
||
case REAL_TYPE:
|
||
case RECORD_TYPE:
|
||
case TEMPLATE_TYPE_PARM:
|
||
case TEMPLATE_TEMPLATE_PARM:
|
||
case BOUND_TEMPLATE_TEMPLATE_PARM:
|
||
case TREE_LIST:
|
||
case TYPE_DECL:
|
||
case TREE_VEC:
|
||
case UNION_TYPE:
|
||
case LANG_TYPE:
|
||
case VOID_TYPE:
|
||
case OPAQUE_TYPE:
|
||
case TYPENAME_TYPE:
|
||
case COMPLEX_TYPE:
|
||
case VECTOR_TYPE:
|
||
case TYPEOF_TYPE:
|
||
case TRAIT_TYPE:
|
||
case DECLTYPE_TYPE:
|
||
case TYPE_PACK_EXPANSION:
|
||
case FIXED_POINT_TYPE:
|
||
case NULLPTR_TYPE:
|
||
case PACK_INDEX_TYPE:
|
||
dump_type (pp, t, flags);
|
||
pp->set_padding (pp_before);
|
||
break;
|
||
|
||
default:
|
||
pp_unsupported_tree (pp, t);
|
||
/* fall through. */
|
||
case ERROR_MARK:
|
||
pp_string (pp, M_("<typeprefixerror>"));
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Dump the suffix of type T, under control of FLAGS. This is the part
|
||
which appears after the identifier (or function parms). */
|
||
|
||
static void
|
||
dump_type_suffix (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
if (TYPE_PTRMEMFUNC_P (t))
|
||
t = TYPE_PTRMEMFUNC_FN_TYPE (t);
|
||
|
||
switch (TREE_CODE (t))
|
||
{
|
||
case POINTER_TYPE:
|
||
case REFERENCE_TYPE:
|
||
case OFFSET_TYPE:
|
||
if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE
|
||
|| TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE)
|
||
pp_cxx_right_paren (pp);
|
||
if (TREE_CODE (t) == POINTER_TYPE)
|
||
flags |= TFF_POINTER;
|
||
dump_type_suffix (pp, TREE_TYPE (t), flags);
|
||
break;
|
||
|
||
case FUNCTION_TYPE:
|
||
case METHOD_TYPE:
|
||
{
|
||
tree arg;
|
||
if (TREE_CODE (t) == METHOD_TYPE)
|
||
/* Can only be reached through a pointer. */
|
||
pp_cxx_right_paren (pp);
|
||
arg = TYPE_ARG_TYPES (t);
|
||
if (TREE_CODE (t) == METHOD_TYPE)
|
||
arg = TREE_CHAIN (arg);
|
||
|
||
/* Function pointers don't have default args. Not in standard C++,
|
||
anyway; they may in g++, but we'll just pretend otherwise. */
|
||
dump_parameters (pp, arg, flags & ~TFF_FUNCTION_DEFAULT_ARGUMENTS);
|
||
|
||
pp->set_padding (pp_before);
|
||
pp_cxx_cv_qualifiers (pp, type_memfn_quals (t),
|
||
TREE_CODE (t) == FUNCTION_TYPE
|
||
&& (flags & TFF_POINTER));
|
||
dump_ref_qualifier (pp, t, flags);
|
||
if (tx_safe_fn_type_p (t))
|
||
pp_cxx_ws_string (pp, "transaction_safe");
|
||
dump_exception_spec (pp, TYPE_RAISES_EXCEPTIONS (t), flags);
|
||
/* If this is the standard [[]] attribute, print
|
||
void (*)() [[noreturn]]; */
|
||
if (cxx11_attribute_p (TYPE_ATTRIBUTES (t)))
|
||
{
|
||
pp_space (pp);
|
||
pp_c_attributes_display (pp, TYPE_ATTRIBUTES (t));
|
||
pp->set_padding (pp_before);
|
||
}
|
||
dump_type_suffix (pp, TREE_TYPE (t), flags);
|
||
break;
|
||
}
|
||
|
||
case ARRAY_TYPE:
|
||
pp_maybe_space (pp);
|
||
pp_cxx_left_bracket (pp);
|
||
if (tree dtype = TYPE_DOMAIN (t))
|
||
{
|
||
tree max = TYPE_MAX_VALUE (dtype);
|
||
/* Zero-length arrays have a null upper bound in C and SIZE_MAX
|
||
in C++. Handle both since the type might be constructed by
|
||
the middle end and end up here as a result of a warning (see
|
||
PR c++/97201). */
|
||
if (!max || integer_all_onesp (max))
|
||
pp_character (pp, '0');
|
||
else if (tree_fits_shwi_p (max))
|
||
pp_wide_integer (pp, tree_to_shwi (max) + 1);
|
||
else
|
||
{
|
||
STRIP_NOPS (max);
|
||
if (TREE_CODE (max) == SAVE_EXPR)
|
||
max = TREE_OPERAND (max, 0);
|
||
if (TREE_CODE (max) == MINUS_EXPR
|
||
|| TREE_CODE (max) == PLUS_EXPR)
|
||
{
|
||
max = TREE_OPERAND (max, 0);
|
||
while (CONVERT_EXPR_P (max))
|
||
max = TREE_OPERAND (max, 0);
|
||
}
|
||
else
|
||
max = fold_build2_loc (input_location,
|
||
PLUS_EXPR, dtype, max,
|
||
build_int_cst (dtype, 1));
|
||
dump_expr (pp, max, flags & ~TFF_EXPR_IN_PARENS);
|
||
}
|
||
}
|
||
pp_cxx_right_bracket (pp);
|
||
dump_type_suffix (pp, TREE_TYPE (t), flags);
|
||
break;
|
||
|
||
case ENUMERAL_TYPE:
|
||
case IDENTIFIER_NODE:
|
||
case INTEGER_TYPE:
|
||
case BOOLEAN_TYPE:
|
||
case REAL_TYPE:
|
||
case RECORD_TYPE:
|
||
case TEMPLATE_TYPE_PARM:
|
||
case TEMPLATE_TEMPLATE_PARM:
|
||
case BOUND_TEMPLATE_TEMPLATE_PARM:
|
||
case TREE_LIST:
|
||
case TYPE_DECL:
|
||
case TREE_VEC:
|
||
case UNION_TYPE:
|
||
case LANG_TYPE:
|
||
case VOID_TYPE:
|
||
case OPAQUE_TYPE:
|
||
case TYPENAME_TYPE:
|
||
case COMPLEX_TYPE:
|
||
case VECTOR_TYPE:
|
||
case TYPEOF_TYPE:
|
||
case TRAIT_TYPE:
|
||
case DECLTYPE_TYPE:
|
||
case TYPE_PACK_EXPANSION:
|
||
case FIXED_POINT_TYPE:
|
||
case NULLPTR_TYPE:
|
||
case PACK_INDEX_TYPE:
|
||
break;
|
||
|
||
default:
|
||
pp_unsupported_tree (pp, t);
|
||
case ERROR_MARK:
|
||
/* Don't mark it here, we should have already done in
|
||
dump_type_prefix. */
|
||
break;
|
||
}
|
||
}
|
||
|
||
static void
|
||
dump_global_iord (cxx_pretty_printer *pp, tree t)
|
||
{
|
||
const char *p = NULL;
|
||
|
||
if (DECL_GLOBAL_CTOR_P (t))
|
||
p = M_("(static initializers for %s)");
|
||
else if (DECL_GLOBAL_DTOR_P (t))
|
||
p = M_("(static destructors for %s)");
|
||
else
|
||
gcc_unreachable ();
|
||
|
||
pp_printf (pp, p, DECL_SOURCE_FILE (t));
|
||
}
|
||
|
||
/* Write a representation of OpenMP "declare mapper" T to PP in a manner
|
||
suitable for error messages. */
|
||
|
||
static void
|
||
dump_omp_declare_mapper (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
pp_string (pp, "#pragma omp declare mapper");
|
||
if (t == NULL_TREE || t == error_mark_node)
|
||
return;
|
||
pp_space (pp);
|
||
pp_cxx_left_paren (pp);
|
||
if (OMP_DECLARE_MAPPER_ID (t))
|
||
{
|
||
pp_cxx_tree_identifier (pp, OMP_DECLARE_MAPPER_ID (t));
|
||
pp_colon (pp);
|
||
}
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
|
||
static void
|
||
dump_simple_decl (cxx_pretty_printer *pp, tree t, tree type, int flags)
|
||
{
|
||
if (VAR_P (t) && DECL_NTTP_OBJECT_P (t))
|
||
return dump_expr (pp, DECL_INITIAL (t), flags);
|
||
|
||
if (TREE_CODE (t) == VAR_DECL
|
||
&& DECL_LANG_SPECIFIC (t)
|
||
&& DECL_OMP_DECLARE_MAPPER_P (t))
|
||
return dump_omp_declare_mapper (pp, DECL_INITIAL (t), flags);
|
||
|
||
if (flags & TFF_DECL_SPECIFIERS)
|
||
{
|
||
if (concept_definition_p (t))
|
||
pp_cxx_ws_string (pp, "concept");
|
||
else if (VAR_P (t) && DECL_DECLARED_CONSTEXPR_P (t))
|
||
pp_cxx_ws_string (pp, "constexpr");
|
||
|
||
if (!concept_definition_p (t))
|
||
dump_type_prefix (pp, type, flags & ~TFF_UNQUALIFIED_NAME);
|
||
pp_maybe_space (pp);
|
||
}
|
||
if (! (flags & TFF_UNQUALIFIED_NAME)
|
||
&& TREE_CODE (t) != PARM_DECL
|
||
&& (!DECL_INITIAL (t)
|
||
|| TREE_CODE (DECL_INITIAL (t)) != TEMPLATE_PARM_INDEX))
|
||
dump_scope (pp, CP_DECL_CONTEXT (t), flags);
|
||
flags &= ~TFF_UNQUALIFIED_NAME;
|
||
if ((flags & TFF_DECL_SPECIFIERS)
|
||
&& DECL_TEMPLATE_PARM_P (t)
|
||
&& TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (t)))
|
||
pp_string (pp, "...");
|
||
if (DECL_NAME (t))
|
||
{
|
||
if (TREE_CODE (t) == FIELD_DECL && DECL_NORMAL_CAPTURE_P (t))
|
||
{
|
||
pp_less (pp);
|
||
pp_string (pp, IDENTIFIER_POINTER (DECL_NAME (t)) + 2);
|
||
pp_string (pp, " capture>");
|
||
}
|
||
else
|
||
dump_decl (pp, DECL_NAME (t), flags);
|
||
}
|
||
else if (DECL_DECOMPOSITION_P (t))
|
||
pp_string (pp, M_("<structured bindings>"));
|
||
else if (TREE_CODE (t) == FIELD_DECL && DECL_FIELD_IS_BASE (t))
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
else
|
||
pp_string (pp, M_("<anonymous>"));
|
||
|
||
dump_module_suffix (pp, t);
|
||
|
||
if (flags & TFF_DECL_SPECIFIERS)
|
||
dump_type_suffix (pp, type, flags);
|
||
}
|
||
|
||
class colorize_guard
|
||
{
|
||
bool colorize;
|
||
cxx_pretty_printer *pp;
|
||
public:
|
||
colorize_guard (bool _colorize, cxx_pretty_printer *pp, const char *name)
|
||
: colorize (_colorize && pp_show_color (pp)), pp (pp)
|
||
{
|
||
pp_string (pp, colorize_start (colorize, name));
|
||
}
|
||
~colorize_guard ()
|
||
{
|
||
pp_string (pp, colorize_stop (colorize));
|
||
}
|
||
};
|
||
|
||
/* Print an IDENTIFIER_NODE that is the name of a declaration. */
|
||
|
||
static void
|
||
dump_decl_name (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
/* These special cases are duplicated here so that other functions
|
||
can feed identifiers to error and get them demangled properly. */
|
||
if (IDENTIFIER_CONV_OP_P (t))
|
||
{
|
||
pp_cxx_ws_string (pp, "operator");
|
||
/* Not exactly IDENTIFIER_TYPE_VALUE. */
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
return;
|
||
}
|
||
if (dguide_name_p (t))
|
||
{
|
||
dump_decl (pp, CLASSTYPE_TI_TEMPLATE (TREE_TYPE (t)),
|
||
TFF_UNQUALIFIED_NAME);
|
||
return;
|
||
}
|
||
|
||
const char *str = IDENTIFIER_POINTER (t);
|
||
if (startswith (str, "_ZGR"))
|
||
{
|
||
pp_cxx_ws_string (pp, "<temporary>");
|
||
return;
|
||
}
|
||
|
||
pp_cxx_tree_identifier (pp, t);
|
||
}
|
||
|
||
/* Dump a human readable string for the decl T under control of FLAGS. */
|
||
|
||
static void
|
||
dump_decl (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
if (t == NULL_TREE)
|
||
return;
|
||
|
||
/* If doing Objective-C++, give Objective-C a chance to demangle
|
||
Objective-C method names. */
|
||
if (c_dialect_objc ())
|
||
{
|
||
const char *demangled = objc_maybe_printable_name (t, flags);
|
||
if (demangled)
|
||
{
|
||
pp_string (pp, demangled);
|
||
return;
|
||
}
|
||
}
|
||
|
||
switch (TREE_CODE (t))
|
||
{
|
||
case TYPE_DECL:
|
||
/* Don't say 'typedef class A' */
|
||
if (DECL_ARTIFICIAL (t) && !DECL_SELF_REFERENCE_P (t))
|
||
{
|
||
if ((flags & TFF_DECL_SPECIFIERS)
|
||
&& TREE_CODE (TREE_TYPE (t)) == TEMPLATE_TYPE_PARM)
|
||
{
|
||
/* Say `class T' not just `T'. */
|
||
pp_cxx_ws_string (pp, "class");
|
||
|
||
/* Emit the `...' for a parameter pack. */
|
||
if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (t)))
|
||
pp_cxx_ws_string (pp, "...");
|
||
}
|
||
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
break;
|
||
}
|
||
if (TYPE_DECL_ALIAS_P (t)
|
||
&& (flags & TFF_DECL_SPECIFIERS
|
||
|| flags & TFF_CLASS_KEY_OR_ENUM))
|
||
{
|
||
pp_cxx_ws_string (pp, "using");
|
||
if (! (flags & TFF_UNQUALIFIED_NAME))
|
||
dump_scope (pp, CP_DECL_CONTEXT (t), flags);
|
||
dump_decl (pp, DECL_NAME (t), flags);
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_ws_string (pp, "=");
|
||
pp_cxx_whitespace (pp);
|
||
dump_type (pp, (DECL_ORIGINAL_TYPE (t)
|
||
? DECL_ORIGINAL_TYPE (t) : TREE_TYPE (t)),
|
||
flags);
|
||
break;
|
||
}
|
||
if ((flags & TFF_DECL_SPECIFIERS)
|
||
&& !DECL_SELF_REFERENCE_P (t))
|
||
pp_cxx_ws_string (pp, "typedef");
|
||
dump_simple_decl (pp, t, DECL_ORIGINAL_TYPE (t)
|
||
? DECL_ORIGINAL_TYPE (t) : TREE_TYPE (t),
|
||
flags);
|
||
break;
|
||
|
||
case VAR_DECL:
|
||
if (DECL_NAME (t) && VTABLE_NAME_P (DECL_NAME (t)))
|
||
{
|
||
pp_string (pp, M_("vtable for "));
|
||
gcc_assert (TYPE_P (DECL_CONTEXT (t)));
|
||
dump_type (pp, DECL_CONTEXT (t), flags);
|
||
break;
|
||
}
|
||
/* Fall through. */
|
||
case FIELD_DECL:
|
||
case PARM_DECL:
|
||
dump_simple_decl (pp, t, TREE_TYPE (t), flags);
|
||
|
||
/* Handle variable template specializations. */
|
||
if (VAR_P (t)
|
||
&& DECL_LANG_SPECIFIC (t)
|
||
&& DECL_TEMPLATE_INFO (t)
|
||
&& PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t)))
|
||
{
|
||
pp_cxx_begin_template_argument_list (pp);
|
||
tree args = INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (t));
|
||
dump_template_argument_list (pp, args, flags);
|
||
pp_cxx_end_template_argument_list (pp);
|
||
}
|
||
break;
|
||
|
||
case RESULT_DECL:
|
||
pp_string (pp, M_("<return value> "));
|
||
dump_simple_decl (pp, t, TREE_TYPE (t), flags);
|
||
break;
|
||
|
||
case NAMESPACE_DECL:
|
||
if (flags & TFF_DECL_SPECIFIERS)
|
||
pp->declaration (t);
|
||
else
|
||
{
|
||
if (! (flags & TFF_UNQUALIFIED_NAME))
|
||
dump_scope (pp, CP_DECL_CONTEXT (t), flags);
|
||
flags &= ~TFF_UNQUALIFIED_NAME;
|
||
if (DECL_NAME (t) == NULL_TREE)
|
||
{
|
||
if (!(pp->flags & pp_c_flag_gnu_v3))
|
||
pp_cxx_ws_string (pp, M_("{anonymous}"));
|
||
else
|
||
pp_cxx_ws_string (pp, M_("(anonymous namespace)"));
|
||
}
|
||
else
|
||
pp_cxx_tree_identifier (pp, DECL_NAME (t));
|
||
}
|
||
break;
|
||
|
||
case SCOPE_REF:
|
||
dump_type (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_colon_colon (pp);
|
||
dump_decl (pp, TREE_OPERAND (t, 1), TFF_UNQUALIFIED_NAME);
|
||
break;
|
||
|
||
case ARRAY_REF:
|
||
dump_decl (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_left_bracket (pp);
|
||
dump_decl (pp, TREE_OPERAND (t, 1), flags);
|
||
pp_cxx_right_bracket (pp);
|
||
break;
|
||
|
||
/* So that we can do dump_decl on an aggr type. */
|
||
case RECORD_TYPE:
|
||
case UNION_TYPE:
|
||
case ENUMERAL_TYPE:
|
||
dump_type (pp, t, flags);
|
||
break;
|
||
|
||
case BIT_NOT_EXPR:
|
||
/* This is a pseudo destructor call which has not been folded into
|
||
a PSEUDO_DTOR_EXPR yet. */
|
||
pp_cxx_complement (pp);
|
||
dump_type (pp, TREE_OPERAND (t, 0), flags);
|
||
break;
|
||
|
||
case TYPE_EXPR:
|
||
gcc_unreachable ();
|
||
break;
|
||
|
||
case IDENTIFIER_NODE:
|
||
dump_decl_name (pp, t, flags);
|
||
break;
|
||
|
||
case OVERLOAD:
|
||
if (!OVL_SINGLE_P (t))
|
||
{
|
||
tree ctx = ovl_scope (t);
|
||
if (ctx != global_namespace)
|
||
{
|
||
if (TYPE_P (ctx))
|
||
dump_type (pp, ctx, flags);
|
||
else
|
||
dump_decl (pp, ctx, flags);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
dump_decl (pp, OVL_NAME (t), flags);
|
||
break;
|
||
}
|
||
|
||
/* If there's only one function, dump that. */
|
||
return dump_decl (pp, OVL_FIRST (t), flags);
|
||
|
||
case FUNCTION_DECL:
|
||
if (! DECL_LANG_SPECIFIC (t))
|
||
{
|
||
if (DECL_ABSTRACT_ORIGIN (t)
|
||
&& DECL_ABSTRACT_ORIGIN (t) != t)
|
||
dump_decl (pp, DECL_ABSTRACT_ORIGIN (t), flags);
|
||
else
|
||
dump_function_name (pp, t, flags);
|
||
}
|
||
else if (DECL_GLOBAL_CTOR_P (t) || DECL_GLOBAL_DTOR_P (t))
|
||
dump_global_iord (pp, t);
|
||
else
|
||
dump_function_decl (pp, t, flags);
|
||
break;
|
||
|
||
case TEMPLATE_DECL:
|
||
dump_template_decl (pp, t, flags);
|
||
break;
|
||
|
||
case CONCEPT_DECL:
|
||
dump_simple_decl (pp, t, TREE_TYPE (t), flags);
|
||
break;
|
||
|
||
case TEMPLATE_ID_EXPR:
|
||
{
|
||
tree name = TREE_OPERAND (t, 0);
|
||
tree args = TREE_OPERAND (t, 1);
|
||
|
||
if (!identifier_p (name))
|
||
name = OVL_NAME (name);
|
||
dump_decl (pp, name, flags);
|
||
pp_cxx_begin_template_argument_list (pp);
|
||
if (args == error_mark_node)
|
||
pp_string (pp, M_("<template arguments error>"));
|
||
else if (args)
|
||
dump_template_argument_list
|
||
(pp, args, flags|TFF_NO_OMIT_DEFAULT_TEMPLATE_ARGUMENTS);
|
||
pp_cxx_end_template_argument_list (pp);
|
||
}
|
||
break;
|
||
|
||
case LABEL_DECL:
|
||
if (DECL_NAME (t))
|
||
pp_cxx_tree_identifier (pp, DECL_NAME (t));
|
||
else
|
||
dump_generic_node (pp, t, 0, TDF_SLIM, false);
|
||
break;
|
||
|
||
case CONST_DECL:
|
||
if ((TREE_TYPE (t) != NULL_TREE && NEXT_CODE (t) == ENUMERAL_TYPE)
|
||
|| (DECL_INITIAL (t) &&
|
||
TREE_CODE (DECL_INITIAL (t)) == TEMPLATE_PARM_INDEX))
|
||
dump_simple_decl (pp, t, TREE_TYPE (t), flags);
|
||
else if (DECL_NAME (t))
|
||
dump_decl (pp, DECL_NAME (t), flags);
|
||
else if (DECL_INITIAL (t))
|
||
dump_expr (pp, DECL_INITIAL (t), flags | TFF_EXPR_IN_PARENS);
|
||
else
|
||
pp_string (pp, M_("<enumerator>"));
|
||
break;
|
||
|
||
case USING_DECL:
|
||
{
|
||
if (flags & TFF_DECL_SPECIFIERS)
|
||
pp_cxx_ws_string (pp, "using");
|
||
bool variadic = false;
|
||
if (!(flags & TFF_UNQUALIFIED_NAME))
|
||
{
|
||
tree scope = USING_DECL_SCOPE (t);
|
||
tree name = DECL_NAME (t);
|
||
if (PACK_EXPANSION_P (scope))
|
||
{
|
||
scope = PACK_EXPANSION_PATTERN (scope);
|
||
variadic = true;
|
||
}
|
||
if (identifier_p (name)
|
||
&& IDENTIFIER_CONV_OP_P (name)
|
||
&& PACK_EXPANSION_P (TREE_TYPE (name)))
|
||
{
|
||
name = make_conv_op_name (PACK_EXPANSION_PATTERN
|
||
(TREE_TYPE (name)));
|
||
variadic = true;
|
||
}
|
||
dump_type (pp, scope, flags);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
dump_decl (pp, DECL_NAME (t), flags);
|
||
if (variadic)
|
||
pp_cxx_ws_string (pp, "...");
|
||
}
|
||
break;
|
||
|
||
case STATIC_ASSERT:
|
||
pp->declaration (t);
|
||
break;
|
||
|
||
case BASELINK:
|
||
dump_decl (pp, BASELINK_FUNCTIONS (t), flags);
|
||
break;
|
||
|
||
case TEMPLATE_TYPE_PARM:
|
||
if (flags & TFF_DECL_SPECIFIERS)
|
||
pp->declaration (t);
|
||
else
|
||
pp->type_id (t);
|
||
break;
|
||
|
||
case UNBOUND_CLASS_TEMPLATE:
|
||
case TYPE_PACK_EXPANSION:
|
||
case TREE_BINFO:
|
||
dump_type (pp, t, flags);
|
||
break;
|
||
|
||
default:
|
||
pp_unsupported_tree (pp, t);
|
||
/* Fall through. */
|
||
|
||
case ERROR_MARK:
|
||
pp_string (pp, M_("<declaration error>"));
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Dump a template declaration T under control of FLAGS. This means the
|
||
'template <...> leaders plus the 'class X' or 'void fn(...)' part. */
|
||
|
||
static void
|
||
dump_template_decl (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
tree orig_parms = DECL_TEMPLATE_PARMS (t);
|
||
tree parms;
|
||
int i;
|
||
|
||
if (flags & TFF_TEMPLATE_HEADER)
|
||
{
|
||
for (parms = orig_parms = nreverse (orig_parms);
|
||
parms;
|
||
parms = TREE_CHAIN (parms))
|
||
{
|
||
tree inner_parms = INNERMOST_TEMPLATE_PARMS (parms);
|
||
int len = TREE_VEC_LENGTH (inner_parms);
|
||
|
||
if (len == 0)
|
||
{
|
||
/* Skip over the dummy template levels of a template template
|
||
parm. */
|
||
gcc_assert (TREE_CODE (TREE_TYPE (t)) == TEMPLATE_TEMPLATE_PARM);
|
||
continue;
|
||
}
|
||
|
||
pp_cxx_ws_string (pp, "template");
|
||
pp_cxx_begin_template_argument_list (pp);
|
||
|
||
/* If we've shown the template prefix, we'd better show the
|
||
parameters' and decl's type too. */
|
||
flags |= TFF_DECL_SPECIFIERS;
|
||
|
||
for (i = 0; i < len; i++)
|
||
{
|
||
if (i)
|
||
pp_separate_with_comma (pp);
|
||
dump_template_parameter (pp, TREE_VEC_ELT (inner_parms, i),
|
||
flags);
|
||
}
|
||
pp_cxx_end_template_argument_list (pp);
|
||
pp_cxx_whitespace (pp);
|
||
}
|
||
nreverse(orig_parms);
|
||
|
||
if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
|
||
{
|
||
/* Say `template<arg> class TT' not just `template<arg> TT'. */
|
||
pp_cxx_ws_string (pp, "class");
|
||
|
||
/* If this is a parameter pack, print the ellipsis. */
|
||
if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (t)))
|
||
pp_cxx_ws_string (pp, "...");
|
||
}
|
||
|
||
/* Only print the requirements if we're also printing
|
||
the template header. */
|
||
if (flag_concepts)
|
||
if (tree ci = get_constraints (t))
|
||
if (check_constraint_info (ci))
|
||
if (tree reqs = CI_TEMPLATE_REQS (ci))
|
||
{
|
||
pp_cxx_requires_clause (pp, reqs);
|
||
pp_cxx_whitespace (pp);
|
||
}
|
||
}
|
||
|
||
|
||
if (DECL_CLASS_TEMPLATE_P (t))
|
||
dump_type (pp, TREE_TYPE (t),
|
||
((flags & ~TFF_CLASS_KEY_OR_ENUM) | TFF_TEMPLATE_NAME
|
||
| (flags & TFF_DECL_SPECIFIERS ? TFF_CLASS_KEY_OR_ENUM : 0)));
|
||
else if (DECL_TEMPLATE_RESULT (t)
|
||
&& (VAR_P (DECL_TEMPLATE_RESULT (t))
|
||
/* Alias template. */
|
||
|| DECL_TYPE_TEMPLATE_P (t)
|
||
/* Concept definition. &*/
|
||
|| TREE_CODE (DECL_TEMPLATE_RESULT (t)) == CONCEPT_DECL))
|
||
dump_decl (pp, DECL_TEMPLATE_RESULT (t), flags | TFF_TEMPLATE_NAME);
|
||
else
|
||
{
|
||
gcc_assert (TREE_TYPE (t));
|
||
switch (NEXT_CODE (t))
|
||
{
|
||
case METHOD_TYPE:
|
||
case FUNCTION_TYPE:
|
||
dump_function_decl (pp, t, flags | TFF_TEMPLATE_NAME);
|
||
break;
|
||
default:
|
||
/* This case can occur with some invalid code. */
|
||
dump_type (pp, TREE_TYPE (t),
|
||
(flags & ~TFF_CLASS_KEY_OR_ENUM) | TFF_TEMPLATE_NAME
|
||
| (flags & TFF_DECL_SPECIFIERS
|
||
? TFF_CLASS_KEY_OR_ENUM : 0));
|
||
}
|
||
}
|
||
}
|
||
|
||
/* find_typenames looks through the type of the function template T
|
||
and returns a vec containing any typedefs, decltypes or TYPENAME_TYPEs
|
||
it finds. */
|
||
|
||
struct find_typenames_t
|
||
{
|
||
hash_set<tree> *p_set;
|
||
vec<tree, va_gc> *typenames;
|
||
};
|
||
|
||
static tree
|
||
find_typenames_r (tree *tp, int *walk_subtrees, void *data)
|
||
{
|
||
struct find_typenames_t *d = (struct find_typenames_t *)data;
|
||
tree mv = NULL_TREE;
|
||
|
||
if (TYPE_P (*tp) && is_typedef_decl (TYPE_NAME (*tp)))
|
||
/* Add the type of the typedef without any additional cv-quals. */
|
||
mv = TREE_TYPE (TYPE_NAME (*tp));
|
||
else if (TREE_CODE (*tp) == TYPENAME_TYPE
|
||
|| TREE_CODE (*tp) == DECLTYPE_TYPE)
|
||
/* Add the typename without any cv-qualifiers. */
|
||
mv = TYPE_MAIN_VARIANT (*tp);
|
||
|
||
if (PACK_EXPANSION_P (*tp))
|
||
{
|
||
/* Don't mess with parameter packs since we don't remember
|
||
the pack expansion context for a particular typename. */
|
||
*walk_subtrees = false;
|
||
return NULL_TREE;
|
||
}
|
||
|
||
if (mv && (mv == *tp || !d->p_set->add (mv)))
|
||
vec_safe_push (d->typenames, mv);
|
||
|
||
return NULL_TREE;
|
||
}
|
||
|
||
static vec<tree, va_gc> *
|
||
find_typenames (tree t)
|
||
{
|
||
struct find_typenames_t ft;
|
||
ft.p_set = new hash_set<tree>;
|
||
ft.typenames = NULL;
|
||
cp_walk_tree (&TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
|
||
find_typenames_r, &ft, ft.p_set);
|
||
delete ft.p_set;
|
||
return ft.typenames;
|
||
}
|
||
|
||
/* Output the "[with ...]" clause for a template instantiation T iff
|
||
TEMPLATE_PARMS, TEMPLATE_ARGS and FLAGS are suitable. T may be NULL if
|
||
formatting a deduction/substitution diagnostic rather than an
|
||
instantiation. */
|
||
|
||
static void
|
||
dump_substitution (cxx_pretty_printer *pp,
|
||
tree t, tree template_parms, tree template_args,
|
||
int flags)
|
||
{
|
||
if (template_parms != NULL_TREE && template_args != NULL_TREE
|
||
&& !(flags & TFF_NO_TEMPLATE_BINDINGS))
|
||
{
|
||
vec<tree, va_gc> *typenames = t ? find_typenames (t) : NULL;
|
||
dump_template_bindings (pp, template_parms, template_args, typenames);
|
||
}
|
||
}
|
||
|
||
/* Dump the lambda function FN including its 'mutable' qualifier and any
|
||
template bindings. */
|
||
|
||
static void
|
||
dump_lambda_function (cxx_pretty_printer *pp,
|
||
tree fn, tree template_parms, tree template_args,
|
||
int flags)
|
||
{
|
||
/* A lambda's signature is essentially its "type". */
|
||
dump_type (pp, DECL_CONTEXT (fn), flags);
|
||
if (DECL_XOBJ_MEMBER_FUNCTION_P (fn))
|
||
/* Early escape. */;
|
||
else if (TREE_CODE (TREE_TYPE (fn)) == FUNCTION_TYPE)
|
||
{
|
||
pp->set_padding (pp_before);
|
||
pp_c_ws_string (pp, "static");
|
||
}
|
||
else if (!(TYPE_QUALS (class_of_this_parm (TREE_TYPE (fn)))
|
||
& TYPE_QUAL_CONST))
|
||
{
|
||
pp->set_padding (pp_before);
|
||
pp_c_ws_string (pp, "mutable");
|
||
}
|
||
dump_substitution (pp, fn, template_parms, template_args, flags);
|
||
}
|
||
|
||
/* Pretty print a function decl. There are several ways we want to print a
|
||
function declaration. The TFF_ bits in FLAGS tells us how to behave.
|
||
As error can only apply the '#' flag once to give 0 and 1 for V, there
|
||
is %D which doesn't print the throw specs, and %F which does. */
|
||
|
||
static void
|
||
dump_function_decl (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
tree fntype;
|
||
tree parmtypes;
|
||
tree cname = NULL_TREE;
|
||
tree template_args = NULL_TREE;
|
||
tree template_parms = NULL_TREE;
|
||
int show_return = flags & TFF_RETURN_TYPE || flags & TFF_DECL_SPECIFIERS;
|
||
int do_outer_scope = ! (flags & TFF_UNQUALIFIED_NAME);
|
||
tree exceptions;
|
||
bool constexpr_p;
|
||
tree ret = NULL_TREE;
|
||
|
||
int dump_function_name_flags = flags & ~TFF_UNQUALIFIED_NAME;
|
||
flags = dump_function_name_flags & ~TFF_TEMPLATE_NAME;
|
||
if (TREE_CODE (t) == TEMPLATE_DECL)
|
||
t = DECL_TEMPLATE_RESULT (t);
|
||
|
||
/* Save the exceptions, in case t is a specialization and we are
|
||
emitting an error about incompatible specifications. */
|
||
exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (t));
|
||
|
||
/* Likewise for the constexpr specifier, in case t is a specialization. */
|
||
constexpr_p = (DECL_DECLARED_CONSTEXPR_P (t)
|
||
&& !decl_implicit_constexpr_p (t));
|
||
|
||
/* Pretty print template instantiations only. */
|
||
if (DECL_USE_TEMPLATE (t) && DECL_TEMPLATE_INFO (t)
|
||
&& !(flags & TFF_NO_TEMPLATE_BINDINGS)
|
||
&& flag_pretty_templates)
|
||
{
|
||
tree tmpl;
|
||
|
||
template_args = DECL_TI_ARGS (t);
|
||
tmpl = most_general_template (t);
|
||
if (tmpl && TREE_CODE (tmpl) == TEMPLATE_DECL)
|
||
{
|
||
template_parms = DECL_TEMPLATE_PARMS (tmpl);
|
||
t = tmpl;
|
||
}
|
||
}
|
||
|
||
if (DECL_NAME (t) && LAMBDA_FUNCTION_P (t))
|
||
return dump_lambda_function (pp, t, template_parms, template_args, flags);
|
||
|
||
fntype = TREE_TYPE (t);
|
||
parmtypes = FUNCTION_FIRST_USER_PARMTYPE (t);
|
||
|
||
if (DECL_CLASS_SCOPE_P (t))
|
||
cname = DECL_CONTEXT (t);
|
||
/* This is for partially instantiated template methods. */
|
||
else if (TREE_CODE (fntype) == METHOD_TYPE)
|
||
cname = TREE_TYPE (TREE_VALUE (parmtypes));
|
||
|
||
if (flags & TFF_DECL_SPECIFIERS)
|
||
{
|
||
if (DECL_STATIC_FUNCTION_P (t))
|
||
pp_cxx_ws_string (pp, "static");
|
||
else if (DECL_VIRTUAL_P (t))
|
||
pp_cxx_ws_string (pp, "virtual");
|
||
|
||
if (constexpr_p)
|
||
{
|
||
if (DECL_IMMEDIATE_FUNCTION_P (t))
|
||
pp_cxx_ws_string (pp, "consteval");
|
||
else
|
||
pp_cxx_ws_string (pp, "constexpr");
|
||
}
|
||
}
|
||
|
||
/* Print the return type? */
|
||
if (show_return)
|
||
show_return = (!DECL_CONV_FN_P (t) && !DECL_CONSTRUCTOR_P (t)
|
||
&& !DECL_DESTRUCTOR_P (t) && !deduction_guide_p (t));
|
||
if (show_return)
|
||
{
|
||
ret = fndecl_declared_return_type (t);
|
||
dump_type_prefix (pp, ret, flags);
|
||
}
|
||
|
||
/* Print the function name. */
|
||
if (!do_outer_scope)
|
||
/* Nothing. */;
|
||
else if (cname)
|
||
{
|
||
dump_type (pp, cname, flags);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
else
|
||
dump_scope (pp, CP_DECL_CONTEXT (t), flags);
|
||
|
||
/* Name lookup for the rest of the function declarator is implicitly in the
|
||
scope of the function, so avoid printing redundant scope qualifiers. */
|
||
auto cds = make_temp_override (current_dump_scope, CP_DECL_CONTEXT (t));
|
||
|
||
dump_function_name (pp, t, dump_function_name_flags);
|
||
|
||
/* By default we need no padding here, but if we emit target_version or
|
||
target_clones then we need some. */
|
||
pp->set_padding (pp_none);
|
||
pp_cxx_function_target_version (pp, t);
|
||
pp_cxx_maybe_whitespace (pp);
|
||
pp_cxx_function_target_clones (pp, t);
|
||
pp_cxx_maybe_whitespace (pp);
|
||
|
||
if (!(flags & TFF_NO_FUNCTION_ARGUMENTS))
|
||
{
|
||
int const parm_flags
|
||
= DECL_XOBJ_MEMBER_FUNCTION_P (t) ? TFF_XOBJ_FUNC | flags : flags;
|
||
dump_parameters (pp, parmtypes, parm_flags);
|
||
|
||
if (TREE_CODE (fntype) == METHOD_TYPE)
|
||
{
|
||
pp->set_padding (pp_before);
|
||
pp_cxx_cv_qualifier_seq (pp, class_of_this_parm (fntype));
|
||
dump_ref_qualifier (pp, fntype, flags);
|
||
}
|
||
|
||
if (tx_safe_fn_type_p (fntype))
|
||
{
|
||
pp->set_padding (pp_before);
|
||
pp_cxx_ws_string (pp, "transaction_safe");
|
||
}
|
||
|
||
if (flags & TFF_EXCEPTION_SPECIFICATION)
|
||
{
|
||
pp->set_padding (pp_before);
|
||
dump_exception_spec (pp, exceptions, flags);
|
||
}
|
||
|
||
if (show_return)
|
||
dump_type_suffix (pp, ret, flags);
|
||
else if (deduction_guide_p (t))
|
||
{
|
||
pp->set_padding (pp_before);
|
||
pp_cxx_ws_string (pp, "->");
|
||
dump_type (pp, TREE_TYPE (TREE_TYPE (t)), flags);
|
||
}
|
||
|
||
if (flag_concepts)
|
||
if (tree ci = get_constraints (t))
|
||
if (tree reqs = CI_DECLARATOR_REQS (ci))
|
||
pp_cxx_requires_clause (pp, reqs);
|
||
|
||
dump_substitution (pp, t, template_parms, template_args, flags);
|
||
|
||
if (tree base = DECL_INHERITED_CTOR_BASE (t))
|
||
{
|
||
pp_cxx_ws_string (pp, "[inherited from");
|
||
dump_type (pp, base, TFF_PLAIN_IDENTIFIER);
|
||
pp_character (pp, ']');
|
||
}
|
||
}
|
||
else if (template_args)
|
||
{
|
||
bool need_comma = false;
|
||
int i;
|
||
pp_cxx_begin_template_argument_list (pp);
|
||
template_args = INNERMOST_TEMPLATE_ARGS (template_args);
|
||
for (i = 0; i < TREE_VEC_LENGTH (template_args); ++i)
|
||
{
|
||
tree arg = TREE_VEC_ELT (template_args, i);
|
||
if (need_comma)
|
||
pp_separate_with_comma (pp);
|
||
if (ARGUMENT_PACK_P (arg))
|
||
pp_cxx_left_brace (pp);
|
||
dump_template_argument (pp, arg, TFF_PLAIN_IDENTIFIER);
|
||
if (ARGUMENT_PACK_P (arg))
|
||
pp_cxx_right_brace (pp);
|
||
need_comma = true;
|
||
}
|
||
pp_cxx_end_template_argument_list (pp);
|
||
}
|
||
}
|
||
|
||
/* Print a parameter list. If this is for a member function, the
|
||
member object ptr (and any other hidden args) should have
|
||
already been removed. */
|
||
|
||
static void
|
||
dump_parameters (cxx_pretty_printer *pp, tree parmtypes, int flags)
|
||
{
|
||
int first = 1;
|
||
flags &= ~TFF_SCOPE;
|
||
pp_cxx_left_paren (pp);
|
||
|
||
for (first = 1; parmtypes != void_list_node;
|
||
parmtypes = TREE_CHAIN (parmtypes))
|
||
{
|
||
if (first && flags & TFF_XOBJ_FUNC)
|
||
pp_string (pp, "this ");
|
||
if (!first)
|
||
pp_separate_with_comma (pp);
|
||
first = 0;
|
||
if (!parmtypes)
|
||
{
|
||
pp_cxx_ws_string (pp, "...");
|
||
break;
|
||
}
|
||
|
||
dump_type (pp, TREE_VALUE (parmtypes), flags);
|
||
|
||
if ((flags & TFF_FUNCTION_DEFAULT_ARGUMENTS) && TREE_PURPOSE (parmtypes))
|
||
{
|
||
pp_cxx_whitespace (pp);
|
||
pp_equal (pp);
|
||
pp_cxx_whitespace (pp);
|
||
dump_expr (pp, TREE_PURPOSE (parmtypes), flags | TFF_EXPR_IN_PARENS);
|
||
}
|
||
}
|
||
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
|
||
/* Print ref-qualifier of a FUNCTION_TYPE or METHOD_TYPE. FLAGS are ignored. */
|
||
|
||
static void
|
||
dump_ref_qualifier (cxx_pretty_printer *pp, tree t, int flags ATTRIBUTE_UNUSED)
|
||
{
|
||
if (FUNCTION_REF_QUALIFIED (t))
|
||
{
|
||
pp->set_padding (pp_before);
|
||
if (FUNCTION_RVALUE_QUALIFIED (t))
|
||
pp_cxx_ws_string (pp, "&&");
|
||
else
|
||
pp_cxx_ws_string (pp, "&");
|
||
}
|
||
}
|
||
|
||
/* Print an exception specification. T is the exception specification. */
|
||
|
||
static void
|
||
dump_exception_spec (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
if (t && TREE_PURPOSE (t))
|
||
{
|
||
pp_cxx_ws_string (pp, "noexcept");
|
||
if (!integer_onep (TREE_PURPOSE (t)))
|
||
{
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
if (DEFERRED_NOEXCEPT_SPEC_P (t))
|
||
pp_cxx_ws_string (pp, "<uninstantiated>");
|
||
else
|
||
dump_expr (pp, TREE_PURPOSE (t), flags);
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
}
|
||
else if (t)
|
||
{
|
||
pp_cxx_ws_string (pp, "throw");
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
if (TREE_VALUE (t) != NULL_TREE)
|
||
while (1)
|
||
{
|
||
dump_type (pp, TREE_VALUE (t), flags);
|
||
t = TREE_CHAIN (t);
|
||
if (!t)
|
||
break;
|
||
pp_separate_with_comma (pp);
|
||
}
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
}
|
||
|
||
/* Handle the function name for a FUNCTION_DECL node, grokking operators
|
||
and destructors properly. */
|
||
|
||
static void
|
||
dump_function_name (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
/* Only colorize when we're printing something before the name; in
|
||
particular, not when printing a CALL_EXPR. */
|
||
bool colorize = flags & (TFF_DECL_SPECIFIERS | TFF_RETURN_TYPE
|
||
| TFF_TEMPLATE_HEADER);
|
||
|
||
colorize_guard g (colorize, pp, "fnname");
|
||
|
||
tree name = DECL_NAME (t);
|
||
|
||
/* We can get here with a decl that was synthesized by language-
|
||
independent machinery (e.g. coverage.cc) in which case it won't
|
||
have a lang_specific structure attached and DECL_CONSTRUCTOR_P
|
||
will crash. In this case it is safe just to print out the
|
||
literal name. */
|
||
if (!DECL_LANG_SPECIFIC (t))
|
||
{
|
||
pp_cxx_tree_identifier (pp, name);
|
||
return;
|
||
}
|
||
|
||
if (TREE_CODE (t) == TEMPLATE_DECL)
|
||
t = DECL_TEMPLATE_RESULT (t);
|
||
|
||
/* Don't let the user see __comp_ctor et al. */
|
||
if (DECL_CONSTRUCTOR_P (t)
|
||
|| DECL_DESTRUCTOR_P (t))
|
||
{
|
||
if (LAMBDA_TYPE_P (DECL_CONTEXT (t)))
|
||
name = get_identifier ("<lambda>");
|
||
else if (TYPE_UNNAMED_P (DECL_CONTEXT (t)))
|
||
name = get_identifier ("<constructor>");
|
||
else
|
||
name = constructor_name (DECL_CONTEXT (t));
|
||
}
|
||
|
||
if (DECL_DESTRUCTOR_P (t))
|
||
{
|
||
pp_cxx_complement (pp);
|
||
dump_decl (pp, name, TFF_PLAIN_IDENTIFIER);
|
||
}
|
||
else if (DECL_CONV_FN_P (t))
|
||
{
|
||
/* This cannot use the hack that the operator's return
|
||
type is stashed off of its name because it may be
|
||
used for error reporting. In the case of conflicting
|
||
declarations, both will have the same name, yet
|
||
the types will be different, hence the TREE_TYPE field
|
||
of the first name will be clobbered by the second. */
|
||
pp_cxx_ws_string (pp, "operator");
|
||
dump_type (pp, TREE_TYPE (TREE_TYPE (t)), flags);
|
||
}
|
||
else
|
||
dump_decl (pp, name, flags);
|
||
|
||
dump_module_suffix (pp, t);
|
||
|
||
if (DECL_TEMPLATE_INFO (t)
|
||
&& !(flags & TFF_TEMPLATE_NAME)
|
||
&& !DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (t)
|
||
&& (TREE_CODE (DECL_TI_TEMPLATE (t)) != TEMPLATE_DECL
|
||
|| PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t))))
|
||
dump_template_parms (pp, DECL_TEMPLATE_INFO (t), !DECL_USE_TEMPLATE (t),
|
||
flags);
|
||
}
|
||
|
||
/* Dump the template parameters from the template info INFO under control of
|
||
FLAGS. PRIMARY indicates whether this is a primary template decl, or
|
||
specialization (partial or complete). For partial specializations we show
|
||
the specialized parameter values. For a primary template we show no
|
||
decoration. */
|
||
|
||
static void
|
||
dump_template_parms (cxx_pretty_printer *pp, tree info,
|
||
int primary, int flags)
|
||
{
|
||
tree args = info ? TI_ARGS (info) : NULL_TREE;
|
||
|
||
if (primary && flags & TFF_TEMPLATE_NAME)
|
||
return;
|
||
flags &= ~(TFF_CLASS_KEY_OR_ENUM | TFF_TEMPLATE_NAME);
|
||
pp_cxx_begin_template_argument_list (pp);
|
||
|
||
/* Be careful only to print things when we have them, so as not
|
||
to crash producing error messages. */
|
||
if (args && !primary)
|
||
{
|
||
int len, ix;
|
||
len = get_non_default_template_args_count (args, flags);
|
||
|
||
args = INNERMOST_TEMPLATE_ARGS (args);
|
||
for (ix = 0; ix != len; ix++)
|
||
{
|
||
tree arg = TREE_VEC_ELT (args, ix);
|
||
|
||
/* Only print a comma if we know there is an argument coming. In
|
||
the case of an empty template argument pack, no actual
|
||
argument will be printed. */
|
||
if (ix
|
||
&& (!ARGUMENT_PACK_P (arg)
|
||
|| TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg)) > 0))
|
||
pp_separate_with_comma (pp);
|
||
|
||
if (!arg)
|
||
pp_string (pp, M_("<template parameter error>"));
|
||
else
|
||
dump_template_argument (pp, arg, flags);
|
||
}
|
||
}
|
||
else if (primary)
|
||
{
|
||
tree tpl = TI_TEMPLATE (info);
|
||
tree parms = DECL_TEMPLATE_PARMS (tpl);
|
||
int len, ix;
|
||
|
||
parms = TREE_CODE (parms) == TREE_LIST ? TREE_VALUE (parms) : NULL_TREE;
|
||
len = parms ? TREE_VEC_LENGTH (parms) : 0;
|
||
|
||
for (ix = 0; ix != len; ix++)
|
||
{
|
||
tree parm;
|
||
|
||
if (TREE_VEC_ELT (parms, ix) == error_mark_node)
|
||
{
|
||
pp_string (pp, M_("<template parameter error>"));
|
||
continue;
|
||
}
|
||
|
||
parm = TREE_VALUE (TREE_VEC_ELT (parms, ix));
|
||
|
||
if (ix)
|
||
pp_separate_with_comma (pp);
|
||
|
||
dump_decl (pp, parm, flags & ~TFF_DECL_SPECIFIERS);
|
||
}
|
||
}
|
||
pp_cxx_end_template_argument_list (pp);
|
||
}
|
||
|
||
/* Print out the arguments of CALL_EXPR T as a parenthesized list using
|
||
flags FLAGS. Skip over the first argument if SKIPFIRST is true. */
|
||
|
||
static void
|
||
dump_call_expr_args (cxx_pretty_printer *pp, tree t, int flags, bool skipfirst)
|
||
{
|
||
const int len = call_expr_nargs (t);
|
||
|
||
pp_cxx_left_paren (pp);
|
||
for (int i = skipfirst; i < len; ++i)
|
||
{
|
||
tree arg = get_nth_callarg (t, i);
|
||
dump_expr (pp, arg, flags | TFF_EXPR_IN_PARENS);
|
||
if (i + 1 < len)
|
||
pp_separate_with_comma (pp);
|
||
}
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
|
||
/* Print out a list of initializers (subr of dump_expr). */
|
||
|
||
static void
|
||
dump_expr_list (cxx_pretty_printer *pp, tree l, int flags)
|
||
{
|
||
while (l)
|
||
{
|
||
dump_expr (pp, TREE_VALUE (l), flags | TFF_EXPR_IN_PARENS);
|
||
l = TREE_CHAIN (l);
|
||
if (l)
|
||
pp_separate_with_comma (pp);
|
||
}
|
||
}
|
||
|
||
/* Print out a vector of initializers (subr of dump_expr). */
|
||
|
||
static void
|
||
dump_expr_init_vec (cxx_pretty_printer *pp, vec<constructor_elt, va_gc> *v,
|
||
int flags)
|
||
{
|
||
unsigned HOST_WIDE_INT idx;
|
||
tree value;
|
||
|
||
FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
|
||
{
|
||
if (TREE_CODE (value) == RAW_DATA_CST)
|
||
for (unsigned i = 0; i < (unsigned) RAW_DATA_LENGTH (value); ++i)
|
||
{
|
||
if (TYPE_UNSIGNED (TREE_TYPE (value))
|
||
|| TYPE_PRECISION (TREE_TYPE (value)) > CHAR_BIT)
|
||
pp_decimal_int (pp, RAW_DATA_UCHAR_ELT (value, i));
|
||
else
|
||
pp_decimal_int (pp, RAW_DATA_SCHAR_ELT (value, i));
|
||
if (i == RAW_DATA_LENGTH (value) - 1U)
|
||
break;
|
||
else if (i == 9 && RAW_DATA_LENGTH (value) > 20)
|
||
{
|
||
pp_string (pp, ", ..., ");
|
||
i = RAW_DATA_LENGTH (value) - 11;
|
||
}
|
||
else
|
||
pp_separate_with_comma (pp);
|
||
}
|
||
else
|
||
dump_expr (pp, value, flags | TFF_EXPR_IN_PARENS);
|
||
if (idx != v->length () - 1)
|
||
pp_separate_with_comma (pp);
|
||
}
|
||
}
|
||
|
||
|
||
/* We've gotten an indirect REFERENCE (an OBJ_TYPE_REF) to a virtual
|
||
function. Resolve it to a close relative -- in the sense of static
|
||
type -- variant being overridden. That is close to what was written in
|
||
the source code. Subroutine of dump_expr. */
|
||
|
||
static tree
|
||
resolve_virtual_fun_from_obj_type_ref (tree ref)
|
||
{
|
||
tree obj_type = TREE_TYPE (OBJ_TYPE_REF_TOKEN (ref));
|
||
HOST_WIDE_INT index = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (ref));
|
||
tree fun = BINFO_VIRTUALS (TYPE_BINFO (TREE_TYPE (obj_type)));
|
||
while (index)
|
||
{
|
||
fun = TREE_CHAIN (fun);
|
||
index -= (TARGET_VTABLE_USES_DESCRIPTORS
|
||
? TARGET_VTABLE_USES_DESCRIPTORS : 1);
|
||
}
|
||
|
||
return BV_FN (fun);
|
||
}
|
||
|
||
/* Print out an expression E under control of FLAGS. */
|
||
|
||
static void
|
||
dump_expr (cxx_pretty_printer *pp, tree t, int flags)
|
||
{
|
||
tree op;
|
||
|
||
if (t == 0)
|
||
return;
|
||
|
||
if (STATEMENT_CLASS_P (t))
|
||
{
|
||
pp_cxx_ws_string (pp, M_("<statement>"));
|
||
return;
|
||
}
|
||
|
||
switch (TREE_CODE (t))
|
||
{
|
||
case VAR_DECL:
|
||
case PARM_DECL:
|
||
case FIELD_DECL:
|
||
case CONST_DECL:
|
||
case FUNCTION_DECL:
|
||
case TEMPLATE_DECL:
|
||
case NAMESPACE_DECL:
|
||
case LABEL_DECL:
|
||
case OVERLOAD:
|
||
case TYPE_DECL:
|
||
case USING_DECL:
|
||
case IDENTIFIER_NODE:
|
||
dump_decl (pp, t, ((flags & ~(TFF_DECL_SPECIFIERS|TFF_RETURN_TYPE
|
||
|TFF_TEMPLATE_HEADER))
|
||
| TFF_NO_TEMPLATE_BINDINGS
|
||
| TFF_NO_FUNCTION_ARGUMENTS));
|
||
break;
|
||
|
||
case SSA_NAME:
|
||
if (SSA_NAME_VAR (t)
|
||
&& !DECL_ARTIFICIAL (SSA_NAME_VAR (t)))
|
||
dump_expr (pp, SSA_NAME_VAR (t), flags);
|
||
else
|
||
pp_cxx_ws_string (pp, M_("<unknown>"));
|
||
break;
|
||
|
||
case VOID_CST:
|
||
case INTEGER_CST:
|
||
case REAL_CST:
|
||
case STRING_CST:
|
||
case COMPLEX_CST:
|
||
pp->constant (t);
|
||
break;
|
||
|
||
case USERDEF_LITERAL:
|
||
pp_cxx_userdef_literal (pp, t);
|
||
break;
|
||
|
||
case THROW_EXPR:
|
||
/* While waiting for caret diagnostics, avoid printing
|
||
__cxa_allocate_exception, __cxa_throw, and the like. */
|
||
pp_cxx_ws_string (pp, M_("<throw-expression>"));
|
||
break;
|
||
|
||
case PTRMEM_CST:
|
||
pp_ampersand (pp);
|
||
dump_type (pp, PTRMEM_CST_CLASS (t), flags);
|
||
pp_cxx_colon_colon (pp);
|
||
pp_cxx_tree_identifier (pp, DECL_NAME (PTRMEM_CST_MEMBER (t)));
|
||
break;
|
||
|
||
case COMPOUND_EXPR:
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
pp_separate_with_comma (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 1), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case COND_EXPR:
|
||
case VEC_COND_EXPR:
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
pp_string (pp, " ? ");
|
||
dump_expr (pp, TREE_OPERAND (t, 1), flags | TFF_EXPR_IN_PARENS);
|
||
pp_string (pp, " : ");
|
||
dump_expr (pp, TREE_OPERAND (t, 2), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case SAVE_EXPR:
|
||
if (TREE_HAS_CONSTRUCTOR (t))
|
||
{
|
||
pp_cxx_ws_string (pp, "new");
|
||
pp_cxx_whitespace (pp);
|
||
dump_type (pp, TREE_TYPE (TREE_TYPE (t)), flags);
|
||
}
|
||
else
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
break;
|
||
|
||
case AGGR_INIT_EXPR:
|
||
case CALL_EXPR:
|
||
{
|
||
tree fn = cp_get_callee (t);
|
||
bool skipfirst = false;
|
||
|
||
/* Deal with internal functions. */
|
||
if (fn == NULL_TREE)
|
||
{
|
||
pp_string (pp, internal_fn_name (CALL_EXPR_IFN (t)));
|
||
dump_call_expr_args (pp, t, flags, skipfirst);
|
||
break;
|
||
}
|
||
|
||
if (TREE_CODE (fn) == ADDR_EXPR)
|
||
fn = TREE_OPERAND (fn, 0);
|
||
|
||
/* Nobody is interested in seeing the guts of vcalls. */
|
||
if (TREE_CODE (fn) == OBJ_TYPE_REF)
|
||
fn = resolve_virtual_fun_from_obj_type_ref (fn);
|
||
|
||
if (TREE_TYPE (fn) != NULL_TREE
|
||
&& NEXT_CODE (fn) == METHOD_TYPE
|
||
&& call_expr_nargs (t))
|
||
{
|
||
tree ob = get_nth_callarg (t, 0);
|
||
if (is_dummy_object (ob))
|
||
/* Don't print dummy object. */;
|
||
else if (TREE_CODE (ob) == ADDR_EXPR)
|
||
{
|
||
dump_expr (pp, TREE_OPERAND (ob, 0),
|
||
flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_dot (pp);
|
||
}
|
||
else if (!is_this_parameter (ob))
|
||
{
|
||
dump_expr (pp, ob, flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_arrow (pp);
|
||
}
|
||
skipfirst = true;
|
||
}
|
||
if (flag_sanitize & SANITIZE_UNDEFINED
|
||
&& is_ubsan_builtin_p (fn))
|
||
{
|
||
pp_string (cxx_pp, M_("<ubsan routine call>"));
|
||
break;
|
||
}
|
||
|
||
if (TREE_CODE (fn) == FUNCTION_DECL
|
||
&& DECL_CONSTRUCTOR_P (fn)
|
||
&& is_dummy_object (get_nth_callarg (t, 0)))
|
||
dump_type (pp, DECL_CONTEXT (fn), flags);
|
||
else
|
||
dump_expr (pp, fn, flags | TFF_EXPR_IN_PARENS);
|
||
dump_call_expr_args (pp, t, flags, skipfirst);
|
||
}
|
||
break;
|
||
|
||
case TARGET_EXPR:
|
||
/* Note that this only works for G++ target exprs. If somebody
|
||
builds a general TARGET_EXPR, there's no way to represent that
|
||
it initializes anything other that the parameter slot for the
|
||
default argument. Note we may have cleared out the first
|
||
operand in expand_expr, so don't go killing ourselves. */
|
||
if (TARGET_EXPR_INITIAL (t))
|
||
dump_expr (pp, TARGET_EXPR_INITIAL (t), flags | TFF_EXPR_IN_PARENS);
|
||
break;
|
||
|
||
case POINTER_PLUS_EXPR:
|
||
dump_binary_op (pp, "+", t, flags);
|
||
break;
|
||
|
||
case POINTER_DIFF_EXPR:
|
||
dump_binary_op (pp, "-", t, flags);
|
||
break;
|
||
|
||
case INIT_EXPR:
|
||
case MODIFY_EXPR:
|
||
dump_binary_op (pp, OVL_OP_INFO (true, NOP_EXPR)->name, t, flags);
|
||
break;
|
||
|
||
case PLUS_EXPR:
|
||
case MINUS_EXPR:
|
||
case MULT_EXPR:
|
||
case TRUNC_DIV_EXPR:
|
||
case TRUNC_MOD_EXPR:
|
||
case MIN_EXPR:
|
||
case MAX_EXPR:
|
||
case LSHIFT_EXPR:
|
||
case RSHIFT_EXPR:
|
||
case BIT_IOR_EXPR:
|
||
case BIT_XOR_EXPR:
|
||
case BIT_AND_EXPR:
|
||
case TRUTH_ANDIF_EXPR:
|
||
case TRUTH_ORIF_EXPR:
|
||
case LT_EXPR:
|
||
case LE_EXPR:
|
||
case GT_EXPR:
|
||
case GE_EXPR:
|
||
case EQ_EXPR:
|
||
case NE_EXPR:
|
||
case SPACESHIP_EXPR:
|
||
case EXACT_DIV_EXPR:
|
||
dump_binary_op (pp, OVL_OP_INFO (false, TREE_CODE (t))->name, t, flags);
|
||
break;
|
||
|
||
case CEIL_DIV_EXPR:
|
||
case FLOOR_DIV_EXPR:
|
||
case ROUND_DIV_EXPR:
|
||
case RDIV_EXPR:
|
||
dump_binary_op (pp, "/", t, flags);
|
||
break;
|
||
|
||
case CEIL_MOD_EXPR:
|
||
case FLOOR_MOD_EXPR:
|
||
case ROUND_MOD_EXPR:
|
||
dump_binary_op (pp, "%", t, flags);
|
||
break;
|
||
|
||
case COMPONENT_REF:
|
||
{
|
||
tree ob = TREE_OPERAND (t, 0);
|
||
if (INDIRECT_REF_P (ob))
|
||
{
|
||
ob = TREE_OPERAND (ob, 0);
|
||
if (!is_this_parameter (ob)
|
||
&& !is_dummy_object (ob))
|
||
{
|
||
dump_expr (pp, ob, flags | TFF_EXPR_IN_PARENS);
|
||
if (TYPE_REF_P (TREE_TYPE (ob)))
|
||
pp_cxx_dot (pp);
|
||
else
|
||
pp_cxx_arrow (pp);
|
||
}
|
||
}
|
||
else
|
||
{
|
||
dump_expr (pp, ob, flags | TFF_EXPR_IN_PARENS);
|
||
if (TREE_CODE (ob) != ARROW_EXPR)
|
||
pp_cxx_dot (pp);
|
||
}
|
||
dump_expr (pp, TREE_OPERAND (t, 1), flags & ~TFF_EXPR_IN_PARENS);
|
||
}
|
||
break;
|
||
|
||
case ARRAY_REF:
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_left_bracket (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 1), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_bracket (pp);
|
||
break;
|
||
|
||
case OMP_ARRAY_SECTION:
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_left_bracket (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 1), flags);
|
||
pp_colon (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 2), flags);
|
||
pp_cxx_right_bracket (pp);
|
||
break;
|
||
|
||
case UNARY_PLUS_EXPR:
|
||
dump_unary_op (pp, "+", t, flags);
|
||
break;
|
||
|
||
case ADDR_EXPR:
|
||
if (TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL
|
||
|| TREE_CODE (TREE_OPERAND (t, 0)) == STRING_CST
|
||
/* An ADDR_EXPR can have reference type. In that case, we
|
||
shouldn't print the `&' doing so indicates to the user
|
||
that the expression has pointer type. */
|
||
|| (TREE_TYPE (t)
|
||
&& TYPE_REF_P (TREE_TYPE (t))))
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
else if (TREE_CODE (TREE_OPERAND (t, 0)) == LABEL_DECL)
|
||
dump_unary_op (pp, "&&", t, flags);
|
||
else
|
||
dump_unary_op (pp, "&", t, flags);
|
||
break;
|
||
|
||
case INDIRECT_REF:
|
||
if (TREE_HAS_CONSTRUCTOR (t))
|
||
{
|
||
t = TREE_OPERAND (t, 0);
|
||
gcc_assert (TREE_CODE (t) == CALL_EXPR);
|
||
dump_expr (pp, CALL_EXPR_FN (t), flags | TFF_EXPR_IN_PARENS);
|
||
dump_call_expr_args (pp, t, flags, true);
|
||
}
|
||
else if (is_stub_object (t))
|
||
{
|
||
pp_string (pp, "std::declval<");
|
||
if (lvalue_p (t)) /* T& */
|
||
dump_type (pp, TREE_TYPE (STRIP_REFERENCE_REF (t)), flags);
|
||
else /* T */
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_string (pp, ">()");
|
||
}
|
||
else
|
||
{
|
||
if (TREE_OPERAND (t,0) != NULL_TREE
|
||
&& TREE_TYPE (TREE_OPERAND (t, 0))
|
||
&& NEXT_CODE (TREE_OPERAND (t, 0)) == REFERENCE_TYPE)
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
else
|
||
dump_unary_op (pp, "*", t, flags);
|
||
}
|
||
break;
|
||
|
||
case MEM_REF:
|
||
/* Delegate to the base "C" pretty printer. */
|
||
pp->c_pretty_printer::unary_expression (t);
|
||
break;
|
||
|
||
case TARGET_MEM_REF:
|
||
/* TARGET_MEM_REF can't appear directly from source, but can appear
|
||
during late GIMPLE optimizations and through late diagnostic we might
|
||
need to support it. Print it as dereferencing of a pointer after
|
||
cast to the TARGET_MEM_REF type, with pointer arithmetics on some
|
||
pointer to single byte types, so
|
||
*(type *)((char *) ptr + step * index + index2) if all the operands
|
||
are present and the casts are needed. */
|
||
pp_cxx_star (pp);
|
||
pp_cxx_left_paren (pp);
|
||
if (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (TMR_BASE (t)))) == NULL_TREE
|
||
|| !integer_onep (TYPE_SIZE_UNIT
|
||
(TREE_TYPE (TREE_TYPE (TMR_BASE (t))))))
|
||
{
|
||
if (TYPE_SIZE_UNIT (TREE_TYPE (t))
|
||
&& integer_onep (TYPE_SIZE_UNIT (TREE_TYPE (t))))
|
||
{
|
||
pp_cxx_left_paren (pp);
|
||
dump_type (pp, build_pointer_type (TREE_TYPE (t)), flags);
|
||
}
|
||
else
|
||
{
|
||
dump_type (pp, build_pointer_type (TREE_TYPE (t)), flags);
|
||
pp_cxx_right_paren (pp);
|
||
pp_cxx_left_paren (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_type (pp, build_pointer_type (char_type_node), flags);
|
||
}
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
else if (!same_type_p (TREE_TYPE (t),
|
||
TREE_TYPE (TREE_TYPE (TMR_BASE (t)))))
|
||
{
|
||
dump_type (pp, build_pointer_type (TREE_TYPE (t)), flags);
|
||
pp_cxx_right_paren (pp);
|
||
pp_cxx_left_paren (pp);
|
||
}
|
||
dump_expr (pp, TMR_BASE (t), flags);
|
||
if (TMR_STEP (t) && TMR_INDEX (t))
|
||
{
|
||
pp_cxx_ws_string (pp, "+");
|
||
dump_expr (pp, TMR_INDEX (t), flags);
|
||
pp_cxx_ws_string (pp, "*");
|
||
dump_expr (pp, TMR_STEP (t), flags);
|
||
}
|
||
if (TMR_INDEX2 (t))
|
||
{
|
||
pp_cxx_ws_string (pp, "+");
|
||
dump_expr (pp, TMR_INDEX2 (t), flags);
|
||
}
|
||
if (!integer_zerop (TMR_OFFSET (t)))
|
||
{
|
||
pp_cxx_ws_string (pp, "+");
|
||
dump_expr (pp, fold_convert (ssizetype, TMR_OFFSET (t)), flags);
|
||
}
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case NEGATE_EXPR:
|
||
case BIT_NOT_EXPR:
|
||
case TRUTH_NOT_EXPR:
|
||
case PREDECREMENT_EXPR:
|
||
case PREINCREMENT_EXPR:
|
||
dump_unary_op (pp, OVL_OP_INFO (false, TREE_CODE (t))->name, t, flags);
|
||
break;
|
||
|
||
case POSTDECREMENT_EXPR:
|
||
case POSTINCREMENT_EXPR:
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_ws_string (pp, OVL_OP_INFO (false, TREE_CODE (t))->name);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case NON_LVALUE_EXPR:
|
||
/* FIXME: This is a KLUDGE workaround for a parsing problem. There
|
||
should be another level of INDIRECT_REF so that I don't have to do
|
||
this. */
|
||
if (TREE_TYPE (t) != NULL_TREE && NEXT_CODE (t) == POINTER_TYPE)
|
||
{
|
||
tree next = TREE_TYPE (TREE_TYPE (t));
|
||
|
||
while (TYPE_PTR_P (next))
|
||
next = TREE_TYPE (next);
|
||
|
||
if (TREE_CODE (next) == FUNCTION_TYPE)
|
||
{
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_left_paren (pp);
|
||
pp_cxx_star (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags & ~TFF_EXPR_IN_PARENS);
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
}
|
||
/* Else fall through. */
|
||
}
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
break;
|
||
|
||
CASE_CONVERT:
|
||
case IMPLICIT_CONV_EXPR:
|
||
case VIEW_CONVERT_EXPR:
|
||
case EXCESS_PRECISION_EXPR:
|
||
{
|
||
tree op = TREE_OPERAND (t, 0);
|
||
|
||
if (location_wrapper_p (t))
|
||
{
|
||
dump_expr (pp, op, flags);
|
||
break;
|
||
}
|
||
|
||
tree ttype = TREE_TYPE (t);
|
||
tree optype = TREE_TYPE (op);
|
||
if (!optype)
|
||
optype = unknown_type_node;
|
||
|
||
if (TREE_CODE (ttype) != TREE_CODE (optype)
|
||
&& INDIRECT_TYPE_P (ttype)
|
||
&& INDIRECT_TYPE_P (optype)
|
||
&& same_type_p (TREE_TYPE (optype),
|
||
TREE_TYPE (ttype)))
|
||
{
|
||
if (TYPE_REF_P (ttype))
|
||
{
|
||
STRIP_NOPS (op);
|
||
if (TREE_CODE (op) == ADDR_EXPR)
|
||
dump_expr (pp, TREE_OPERAND (op, 0), flags);
|
||
else
|
||
dump_unary_op (pp, "*", t, flags);
|
||
}
|
||
else
|
||
dump_unary_op (pp, "&", t, flags);
|
||
}
|
||
else if (!same_type_p (optype, ttype))
|
||
{
|
||
/* It is a cast, but we cannot tell whether it is a
|
||
reinterpret or static cast. Use the C style notation. */
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_left_paren (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_cxx_right_paren (pp);
|
||
dump_expr (pp, op, flags | TFF_EXPR_IN_PARENS);
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
else
|
||
dump_expr (pp, op, flags);
|
||
break;
|
||
}
|
||
|
||
case CONSTRUCTOR:
|
||
if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
|
||
{
|
||
tree idx = build_ptrmemfunc_access_expr (t, pfn_identifier);
|
||
|
||
if (integer_zerop (idx))
|
||
{
|
||
/* A NULL pointer-to-member constant. */
|
||
pp_cxx_left_paren (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_cxx_right_paren (pp);
|
||
pp_character (pp, '0');
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
}
|
||
else if (tree_fits_shwi_p (idx))
|
||
{
|
||
tree virtuals;
|
||
unsigned HOST_WIDE_INT n;
|
||
|
||
t = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t)));
|
||
t = TYPE_METHOD_BASETYPE (t);
|
||
virtuals = BINFO_VIRTUALS (TYPE_BINFO (TYPE_MAIN_VARIANT (t)));
|
||
|
||
n = tree_to_shwi (idx);
|
||
|
||
/* Map vtable index back one, to allow for the null pointer to
|
||
member. */
|
||
--n;
|
||
|
||
while (n > 0 && virtuals)
|
||
{
|
||
--n;
|
||
virtuals = TREE_CHAIN (virtuals);
|
||
}
|
||
if (virtuals)
|
||
{
|
||
dump_expr (pp, BV_FN (virtuals),
|
||
flags | TFF_EXPR_IN_PARENS);
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
if (TREE_TYPE (t) && LAMBDA_TYPE_P (TREE_TYPE (t)))
|
||
pp_string (pp, "<lambda closure object>");
|
||
if (TREE_TYPE (t) && EMPTY_CONSTRUCTOR_P (t))
|
||
{
|
||
dump_type (pp, TREE_TYPE (t), 0);
|
||
pp_cxx_left_paren (pp);
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
else
|
||
{
|
||
if (!BRACE_ENCLOSED_INITIALIZER_P (t))
|
||
dump_type (pp, TREE_TYPE (t), 0);
|
||
pp_cxx_left_brace (pp);
|
||
dump_expr_init_vec (pp, CONSTRUCTOR_ELTS (t), flags);
|
||
pp_cxx_right_brace (pp);
|
||
}
|
||
|
||
break;
|
||
|
||
case OFFSET_REF:
|
||
{
|
||
tree ob = TREE_OPERAND (t, 0);
|
||
if (is_dummy_object (ob))
|
||
{
|
||
t = TREE_OPERAND (t, 1);
|
||
if (TREE_CODE (t) == FUNCTION_DECL)
|
||
/* A::f */
|
||
dump_expr (pp, t, flags | TFF_EXPR_IN_PARENS);
|
||
else if (BASELINK_P (t))
|
||
dump_expr (pp, OVL_FIRST (BASELINK_FUNCTIONS (t)),
|
||
flags | TFF_EXPR_IN_PARENS);
|
||
else
|
||
dump_decl (pp, t, flags);
|
||
}
|
||
else
|
||
{
|
||
if (INDIRECT_REF_P (ob))
|
||
{
|
||
dump_expr (pp, TREE_OPERAND (ob, 0), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_arrow (pp);
|
||
pp_cxx_star (pp);
|
||
}
|
||
else
|
||
{
|
||
dump_expr (pp, ob, flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_dot (pp);
|
||
pp_cxx_star (pp);
|
||
}
|
||
dump_expr (pp, TREE_OPERAND (t, 1), flags | TFF_EXPR_IN_PARENS);
|
||
}
|
||
break;
|
||
}
|
||
|
||
case TEMPLATE_PARM_INDEX:
|
||
dump_decl (pp, TEMPLATE_PARM_DECL (t), flags & ~TFF_DECL_SPECIFIERS);
|
||
break;
|
||
|
||
case CAST_EXPR:
|
||
if (TREE_OPERAND (t, 0) == NULL_TREE
|
||
|| TREE_CHAIN (TREE_OPERAND (t, 0)))
|
||
{
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr_list (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
else
|
||
{
|
||
pp_cxx_left_paren (pp);
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_cxx_right_paren (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr_list (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
break;
|
||
|
||
case STATIC_CAST_EXPR:
|
||
pp_cxx_ws_string (pp, "static_cast");
|
||
goto cast;
|
||
case REINTERPRET_CAST_EXPR:
|
||
pp_cxx_ws_string (pp, "reinterpret_cast");
|
||
goto cast;
|
||
case CONST_CAST_EXPR:
|
||
pp_cxx_ws_string (pp, "const_cast");
|
||
goto cast;
|
||
case DYNAMIC_CAST_EXPR:
|
||
pp_cxx_ws_string (pp, "dynamic_cast");
|
||
cast:
|
||
pp_cxx_begin_template_argument_list (pp);
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_cxx_end_template_argument_list (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case ARROW_EXPR:
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_arrow (pp);
|
||
break;
|
||
|
||
case SIZEOF_EXPR:
|
||
case ALIGNOF_EXPR:
|
||
if (TREE_CODE (t) == SIZEOF_EXPR)
|
||
pp_cxx_ws_string (pp, "sizeof");
|
||
else if (ALIGNOF_EXPR_STD_P (t))
|
||
pp_cxx_ws_string (pp, "alignof");
|
||
else
|
||
pp_cxx_ws_string (pp, "__alignof__");
|
||
op = TREE_OPERAND (t, 0);
|
||
if (PACK_EXPANSION_P (op))
|
||
{
|
||
pp_string (pp, "...");
|
||
op = PACK_EXPANSION_PATTERN (op);
|
||
}
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
if (TREE_CODE (t) == SIZEOF_EXPR && SIZEOF_EXPR_TYPE_P (t))
|
||
dump_type (pp, TREE_TYPE (op), flags);
|
||
else if (TYPE_P (TREE_OPERAND (t, 0)))
|
||
dump_type (pp, op, flags);
|
||
else
|
||
dump_expr (pp, op, flags);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case AT_ENCODE_EXPR:
|
||
pp_cxx_ws_string (pp, "@encode");
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_type (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case NOEXCEPT_EXPR:
|
||
pp_cxx_ws_string (pp, "noexcept");
|
||
pp_cxx_whitespace (pp);
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case REALPART_EXPR:
|
||
case IMAGPART_EXPR:
|
||
pp_cxx_ws_string (pp, OVL_OP_INFO (false, TREE_CODE (t))->name);
|
||
pp_cxx_whitespace (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
break;
|
||
|
||
case DEFERRED_PARSE:
|
||
pp_string (pp, M_("<unparsed>"));
|
||
break;
|
||
|
||
case TRY_CATCH_EXPR:
|
||
case CLEANUP_POINT_EXPR:
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
break;
|
||
|
||
case PSEUDO_DTOR_EXPR:
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
pp_cxx_dot (pp);
|
||
if (TREE_OPERAND (t, 1))
|
||
{
|
||
dump_type (pp, TREE_OPERAND (t, 1), flags);
|
||
pp_cxx_colon_colon (pp);
|
||
}
|
||
pp_cxx_complement (pp);
|
||
dump_type (pp, TREE_OPERAND (t, 2), flags);
|
||
break;
|
||
|
||
case TEMPLATE_ID_EXPR:
|
||
dump_decl (pp, t, flags);
|
||
break;
|
||
|
||
case BIND_EXPR:
|
||
case STMT_EXPR:
|
||
case EXPR_STMT:
|
||
case STATEMENT_LIST:
|
||
/* We don't yet have a way of dumping statements in a
|
||
human-readable format. */
|
||
pp_string (pp, "({...})");
|
||
break;
|
||
|
||
case LOOP_EXPR:
|
||
pp_string (pp, "while (1) { ");
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags & ~TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_brace (pp);
|
||
break;
|
||
|
||
case EXIT_EXPR:
|
||
pp_string (pp, "if (");
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags & ~TFF_EXPR_IN_PARENS);
|
||
pp_string (pp, ") break; ");
|
||
break;
|
||
|
||
case BASELINK:
|
||
dump_expr (pp, BASELINK_FUNCTIONS (t), flags & ~TFF_EXPR_IN_PARENS);
|
||
break;
|
||
|
||
case EMPTY_CLASS_EXPR:
|
||
dump_type (pp, TREE_TYPE (t), flags);
|
||
pp_cxx_left_paren (pp);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case ARGUMENT_PACK_SELECT:
|
||
dump_template_argument (pp, ARGUMENT_PACK_SELECT_FROM_PACK (t), flags);
|
||
break;
|
||
|
||
case RECORD_TYPE:
|
||
case UNION_TYPE:
|
||
case ENUMERAL_TYPE:
|
||
case REAL_TYPE:
|
||
case VOID_TYPE:
|
||
case OPAQUE_TYPE:
|
||
case BOOLEAN_TYPE:
|
||
case INTEGER_TYPE:
|
||
case COMPLEX_TYPE:
|
||
case VECTOR_TYPE:
|
||
case DECLTYPE_TYPE:
|
||
pp_type_specifier_seq (pp, t);
|
||
break;
|
||
|
||
case TYPENAME_TYPE:
|
||
/* We get here when we want to print a dependent type as an
|
||
id-expression, without any disambiguator decoration. */
|
||
pp->id_expression (t);
|
||
break;
|
||
|
||
case TEMPLATE_TYPE_PARM:
|
||
case TEMPLATE_TEMPLATE_PARM:
|
||
case BOUND_TEMPLATE_TEMPLATE_PARM:
|
||
dump_type (pp, t, flags);
|
||
break;
|
||
|
||
case TRAIT_EXPR:
|
||
pp_cxx_trait (pp, t);
|
||
break;
|
||
|
||
case VA_ARG_EXPR:
|
||
pp_cxx_va_arg_expression (pp, t);
|
||
break;
|
||
|
||
case OFFSETOF_EXPR:
|
||
pp_cxx_offsetof_expression (pp, t);
|
||
break;
|
||
|
||
case ADDRESSOF_EXPR:
|
||
pp_cxx_addressof_expression (pp, t);
|
||
break;
|
||
|
||
case SCOPE_REF:
|
||
dump_decl (pp, t, flags);
|
||
break;
|
||
|
||
case EXPR_PACK_EXPANSION:
|
||
case UNARY_LEFT_FOLD_EXPR:
|
||
case UNARY_RIGHT_FOLD_EXPR:
|
||
case BINARY_LEFT_FOLD_EXPR:
|
||
case BINARY_RIGHT_FOLD_EXPR:
|
||
case TYPEID_EXPR:
|
||
case MEMBER_REF:
|
||
case DOTSTAR_EXPR:
|
||
case NEW_EXPR:
|
||
case VEC_NEW_EXPR:
|
||
case DELETE_EXPR:
|
||
case VEC_DELETE_EXPR:
|
||
case MODOP_EXPR:
|
||
case ABS_EXPR:
|
||
case ABSU_EXPR:
|
||
case CONJ_EXPR:
|
||
case VECTOR_CST:
|
||
case FIXED_CST:
|
||
case UNORDERED_EXPR:
|
||
case ORDERED_EXPR:
|
||
case UNLT_EXPR:
|
||
case UNLE_EXPR:
|
||
case UNGT_EXPR:
|
||
case UNGE_EXPR:
|
||
case UNEQ_EXPR:
|
||
case LTGT_EXPR:
|
||
case COMPLEX_EXPR:
|
||
case BIT_FIELD_REF:
|
||
case FIX_TRUNC_EXPR:
|
||
case FLOAT_EXPR:
|
||
pp->expression (t);
|
||
break;
|
||
|
||
case PACK_INDEX_EXPR:
|
||
pp->expression (PACK_INDEX_PACK (t));
|
||
pp_cxx_left_bracket (pp);
|
||
pp->expression (PACK_INDEX_INDEX (t));
|
||
pp_cxx_right_bracket (pp);
|
||
break;
|
||
|
||
case TRUTH_AND_EXPR:
|
||
case TRUTH_OR_EXPR:
|
||
case TRUTH_XOR_EXPR:
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_left_paren (pp);
|
||
pp->expression (t);
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case OBJ_TYPE_REF:
|
||
dump_expr (pp, resolve_virtual_fun_from_obj_type_ref (t), flags);
|
||
break;
|
||
|
||
case LAMBDA_EXPR:
|
||
pp_string (pp, M_("<lambda>"));
|
||
break;
|
||
|
||
case PAREN_EXPR:
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_paren (pp);
|
||
break;
|
||
|
||
case REQUIRES_EXPR:
|
||
pp_cxx_requires_expr (cxx_pp, t);
|
||
break;
|
||
|
||
case SIMPLE_REQ:
|
||
pp_cxx_simple_requirement (cxx_pp, t);
|
||
break;
|
||
|
||
case TYPE_REQ:
|
||
pp_cxx_type_requirement (cxx_pp, t);
|
||
break;
|
||
|
||
case COMPOUND_REQ:
|
||
pp_cxx_compound_requirement (cxx_pp, t);
|
||
break;
|
||
|
||
case NESTED_REQ:
|
||
pp_cxx_nested_requirement (cxx_pp, t);
|
||
break;
|
||
|
||
case ATOMIC_CONSTR:
|
||
case CONJ_CONSTR:
|
||
case DISJ_CONSTR:
|
||
{
|
||
pp_cxx_constraint (cxx_pp, t);
|
||
break;
|
||
}
|
||
|
||
case PLACEHOLDER_EXPR:
|
||
pp_string (pp, M_("*this"));
|
||
break;
|
||
|
||
case TREE_LIST:
|
||
dump_expr_list (pp, t, flags);
|
||
break;
|
||
|
||
case NONTYPE_ARGUMENT_PACK:
|
||
{
|
||
tree args = ARGUMENT_PACK_ARGS (t);
|
||
int len = TREE_VEC_LENGTH (args);
|
||
pp_cxx_left_brace (pp);
|
||
for (int i = 0; i < len; ++i)
|
||
{
|
||
if (i > 0)
|
||
pp_separate_with_comma (pp);
|
||
dump_expr (pp, TREE_VEC_ELT (args, i), flags);
|
||
}
|
||
pp_cxx_right_brace (pp);
|
||
break;
|
||
}
|
||
|
||
case CO_AWAIT_EXPR:
|
||
pp_cxx_ws_string (pp, "co_await");
|
||
pp_cxx_whitespace (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
break;
|
||
|
||
case CO_YIELD_EXPR:
|
||
pp_cxx_ws_string (pp, "co_yield");
|
||
pp_cxx_whitespace (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
break;
|
||
|
||
case CO_RETURN_EXPR:
|
||
pp_cxx_ws_string (pp, "co_return");
|
||
if (TREE_OPERAND (t, 0))
|
||
{
|
||
pp_cxx_whitespace (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags);
|
||
}
|
||
break;
|
||
|
||
/* This list is incomplete, but should suffice for now.
|
||
It is very important that `sorry' does not call
|
||
`report_error_function'. That could cause an infinite loop. */
|
||
default:
|
||
pp_unsupported_tree (pp, t);
|
||
/* Fall through. */
|
||
case ERROR_MARK:
|
||
pp_string (pp, M_("<expression error>"));
|
||
break;
|
||
}
|
||
}
|
||
|
||
static void
|
||
dump_binary_op (cxx_pretty_printer *pp, const char *opstring, tree t,
|
||
int flags)
|
||
{
|
||
pp_cxx_left_paren (pp);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_whitespace (pp);
|
||
if (opstring)
|
||
pp_cxx_ws_string (pp, opstring);
|
||
else
|
||
pp_string (pp, M_("<unknown operator>"));
|
||
pp_cxx_whitespace (pp);
|
||
tree op1 = TREE_OPERAND (t, 1);
|
||
if (TREE_CODE (t) == POINTER_PLUS_EXPR
|
||
&& TREE_CODE (op1) == INTEGER_CST
|
||
&& tree_int_cst_sign_bit (op1))
|
||
/* A pointer minus an integer is represented internally as plus a very
|
||
large number, don't expose that to users. */
|
||
op1 = convert (ssizetype, op1);
|
||
dump_expr (pp, op1, flags | TFF_EXPR_IN_PARENS);
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
|
||
static void
|
||
dump_unary_op (cxx_pretty_printer *pp, const char *opstring, tree t, int flags)
|
||
{
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_left_paren (pp);
|
||
pp_cxx_ws_string (pp, opstring);
|
||
dump_expr (pp, TREE_OPERAND (t, 0), flags & ~TFF_EXPR_IN_PARENS);
|
||
if (flags & TFF_EXPR_IN_PARENS)
|
||
pp_cxx_right_paren (pp);
|
||
}
|
||
|
||
static void
|
||
reinit_cxx_pp (void)
|
||
{
|
||
pp_clear_output_area (cxx_pp);
|
||
cxx_pp->set_padding (pp_none);
|
||
pp_indentation (cxx_pp) = 0;
|
||
pp_needs_newline (cxx_pp) = false;
|
||
pp_show_color (cxx_pp) = false;
|
||
cxx_pp->enclosing_scope = current_function_decl;
|
||
}
|
||
|
||
/* Same as pp_formatted_text, except the return string is a separate
|
||
copy and has a GGC storage duration, e.g. an indefinite lifetime. */
|
||
|
||
inline const char *
|
||
pp_ggc_formatted_text (pretty_printer *pp)
|
||
{
|
||
return ggc_strdup (pp_formatted_text (pp));
|
||
}
|
||
|
||
/* Exported interface to stringifying types, exprs and decls under TFF_*
|
||
control. */
|
||
|
||
const char *
|
||
type_as_string (tree typ, int flags)
|
||
{
|
||
reinit_cxx_pp ();
|
||
pp_translate_identifiers (cxx_pp) = false;
|
||
dump_type (cxx_pp, typ, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
const char *
|
||
type_as_string_translate (tree typ, int flags)
|
||
{
|
||
reinit_cxx_pp ();
|
||
dump_type (cxx_pp, typ, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
const char *
|
||
expr_as_string (tree decl, int flags)
|
||
{
|
||
reinit_cxx_pp ();
|
||
pp_translate_identifiers (cxx_pp) = false;
|
||
dump_expr (cxx_pp, decl, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
/* Wrap decl_as_string with options appropriate for dwarf. */
|
||
|
||
const char *
|
||
decl_as_dwarf_string (tree decl, int flags)
|
||
{
|
||
const char *name;
|
||
/* Curiously, reinit_cxx_pp doesn't reset the flags field, so setting the flag
|
||
here will be adequate to get the desired behavior. */
|
||
cxx_pp->flags |= pp_c_flag_gnu_v3;
|
||
name = decl_as_string (decl, flags);
|
||
/* Subsequent calls to the pretty printer shouldn't use this style. */
|
||
cxx_pp->flags &= ~pp_c_flag_gnu_v3;
|
||
return name;
|
||
}
|
||
|
||
const char *
|
||
decl_as_string (tree decl, int flags)
|
||
{
|
||
reinit_cxx_pp ();
|
||
pp_translate_identifiers (cxx_pp) = false;
|
||
dump_decl (cxx_pp, decl, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
const char *
|
||
decl_as_string_translate (tree decl, int flags)
|
||
{
|
||
reinit_cxx_pp ();
|
||
dump_decl (cxx_pp, decl, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
/* Wrap lang_decl_name with options appropriate for dwarf. */
|
||
|
||
const char *
|
||
lang_decl_dwarf_name (tree decl, int v, bool translate)
|
||
{
|
||
const char *name;
|
||
/* Curiously, reinit_cxx_pp doesn't reset the flags field, so setting the flag
|
||
here will be adequate to get the desired behavior. */
|
||
cxx_pp->flags |= pp_c_flag_gnu_v3;
|
||
name = lang_decl_name (decl, v, translate);
|
||
/* Subsequent calls to the pretty printer shouldn't use this style. */
|
||
cxx_pp->flags &= ~pp_c_flag_gnu_v3;
|
||
return name;
|
||
}
|
||
|
||
/* Generate the three forms of printable names for cxx_printable_name. */
|
||
|
||
const char *
|
||
lang_decl_name (tree decl, int v, bool translate)
|
||
{
|
||
if (v >= 2)
|
||
return (translate
|
||
? decl_as_string_translate (decl, TFF_DECL_SPECIFIERS)
|
||
: decl_as_string (decl, TFF_DECL_SPECIFIERS));
|
||
|
||
reinit_cxx_pp ();
|
||
pp_translate_identifiers (cxx_pp) = translate;
|
||
if (v == 1
|
||
&& (DECL_CLASS_SCOPE_P (decl)
|
||
|| (DECL_NAMESPACE_SCOPE_P (decl)
|
||
&& CP_DECL_CONTEXT (decl) != global_namespace)))
|
||
{
|
||
dump_type (cxx_pp, CP_DECL_CONTEXT (decl), TFF_PLAIN_IDENTIFIER);
|
||
pp_cxx_colon_colon (cxx_pp);
|
||
}
|
||
|
||
if (TREE_CODE (decl) == FUNCTION_DECL)
|
||
dump_function_name (cxx_pp, decl, TFF_PLAIN_IDENTIFIER);
|
||
else if ((DECL_NAME (decl) == NULL_TREE)
|
||
&& TREE_CODE (decl) == NAMESPACE_DECL)
|
||
dump_decl (cxx_pp, decl, TFF_PLAIN_IDENTIFIER | TFF_UNQUALIFIED_NAME);
|
||
else
|
||
dump_decl (cxx_pp, DECL_NAME (decl), TFF_PLAIN_IDENTIFIER);
|
||
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
/* Return the location of a tree passed to %+ formats. */
|
||
|
||
location_t
|
||
location_of (tree t)
|
||
{
|
||
if (TYPE_P (t))
|
||
{
|
||
t = TYPE_MAIN_DECL (t);
|
||
if (t == NULL_TREE)
|
||
return input_location;
|
||
}
|
||
else if (TREE_CODE (t) == OVERLOAD)
|
||
t = (OVL_FIRST (t) != conv_op_marker ? OVL_FIRST (t)
|
||
: OVL_FIRST (OVL_CHAIN (t)));
|
||
|
||
if (DECL_P (t))
|
||
return DECL_SOURCE_LOCATION (t);
|
||
if (TREE_CODE (t) == DEFERRED_PARSE)
|
||
return defparse_location (t);
|
||
return cp_expr_loc_or_input_loc (t);
|
||
}
|
||
|
||
/* Now the interfaces from error et al to dump_type et al. Each takes an
|
||
on/off VERBOSE flag and supply the appropriate TFF_ flags to a dump_
|
||
function. */
|
||
|
||
static const char *
|
||
decl_to_string (tree decl, int verbose, bool show_color)
|
||
{
|
||
int flags = 0;
|
||
|
||
if (TREE_CODE (decl) == TYPE_DECL || TREE_CODE (decl) == RECORD_TYPE
|
||
|| TREE_CODE (decl) == UNION_TYPE || TREE_CODE (decl) == ENUMERAL_TYPE)
|
||
flags = TFF_CLASS_KEY_OR_ENUM;
|
||
if (verbose)
|
||
flags |= TFF_DECL_SPECIFIERS;
|
||
else if (TREE_CODE (decl) == FUNCTION_DECL)
|
||
flags |= TFF_DECL_SPECIFIERS | TFF_RETURN_TYPE;
|
||
flags |= TFF_TEMPLATE_HEADER;
|
||
|
||
reinit_cxx_pp ();
|
||
pp_show_color (cxx_pp) = show_color;
|
||
dump_decl (cxx_pp, decl, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
const char *
|
||
expr_to_string (tree decl)
|
||
{
|
||
reinit_cxx_pp ();
|
||
dump_expr (cxx_pp, decl, 0);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
static const char *
|
||
fndecl_to_string (tree fndecl, int verbose)
|
||
{
|
||
int flags;
|
||
|
||
flags = TFF_EXCEPTION_SPECIFICATION | TFF_DECL_SPECIFIERS
|
||
| TFF_TEMPLATE_HEADER;
|
||
if (verbose)
|
||
flags |= TFF_FUNCTION_DEFAULT_ARGUMENTS;
|
||
reinit_cxx_pp ();
|
||
dump_decl (cxx_pp, fndecl, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
|
||
static const char *
|
||
code_to_string (enum tree_code c)
|
||
{
|
||
return get_tree_code_name (c);
|
||
}
|
||
|
||
const char *
|
||
language_to_string (enum languages c)
|
||
{
|
||
switch (c)
|
||
{
|
||
case lang_c:
|
||
return "C";
|
||
|
||
case lang_cplusplus:
|
||
return "C++";
|
||
|
||
default:
|
||
gcc_unreachable ();
|
||
}
|
||
return NULL;
|
||
}
|
||
|
||
/* Return the proper printed version of a parameter to a C++ function. */
|
||
|
||
static const char *
|
||
parm_to_string (int p)
|
||
{
|
||
reinit_cxx_pp ();
|
||
if (p < 0)
|
||
pp_string (cxx_pp, "'this'");
|
||
else
|
||
pp_decimal_int (cxx_pp, p + 1);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
static const char *
|
||
op_to_string (bool assop, enum tree_code p)
|
||
{
|
||
tree id = ovl_op_identifier (assop, p);
|
||
return id ? IDENTIFIER_POINTER (id) : M_("<unknown>");
|
||
}
|
||
|
||
/* Return a GC-allocated representation of type TYP, with verbosity VERBOSE.
|
||
|
||
If QUOTE is non-NULL and if *QUOTE is true, then quotes are added to the
|
||
string in appropriate places, and *QUOTE is written to with false
|
||
to suppress pp_format's trailing close quote so that e.g.
|
||
foo_typedef {aka underlying_foo} {enum}
|
||
can be printed by "%qT" as:
|
||
`foo_typedef' {aka `underlying_foo'} {enum}
|
||
rather than:
|
||
`foo_typedef {aka underlying_foo} {enum}'
|
||
When adding such quotes, if POSTPROCESSED is true (for handling %H and %I)
|
||
then a leading open quote will be added, whereas if POSTPROCESSED is false
|
||
(for handling %T) then any leading quote has already been added by
|
||
pp_format, or is not needed due to QUOTE being NULL (for template arguments
|
||
within %H and %I).
|
||
|
||
SHOW_COLOR and HIGHLIGHT_COLOR are used to determine the colorization of
|
||
any quotes that are added. */
|
||
|
||
static const char *
|
||
type_to_string (tree typ, int verbose, bool postprocessed, bool *quote,
|
||
bool show_color, const char *highlight_color)
|
||
{
|
||
int flags = 0;
|
||
if (verbose)
|
||
flags |= TFF_CLASS_KEY_OR_ENUM;
|
||
flags |= TFF_TEMPLATE_HEADER;
|
||
|
||
reinit_cxx_pp ();
|
||
pp_show_color (cxx_pp) = show_color;
|
||
|
||
if (postprocessed && quote && *quote)
|
||
{
|
||
pp_begin_quote (cxx_pp, show_color);
|
||
if (show_color && highlight_color)
|
||
pp_string (cxx_pp, colorize_start (show_color, highlight_color));
|
||
}
|
||
|
||
struct obstack *ob = pp_buffer (cxx_pp)->m_obstack;
|
||
int type_start, type_len;
|
||
type_start = obstack_object_size (ob);
|
||
|
||
dump_type (cxx_pp, typ, flags);
|
||
|
||
/* Remember the end of the initial dump. */
|
||
type_len = obstack_object_size (ob) - type_start;
|
||
|
||
/* If we're printing a type that involves typedefs, also print the
|
||
stripped version. But sometimes the stripped version looks
|
||
exactly the same, so we don't want it after all. To avoid printing
|
||
it in that case, we play ugly obstack games. */
|
||
if (typ && TYPE_P (typ) && typ != TYPE_CANONICAL (typ)
|
||
&& !uses_template_parms (typ))
|
||
{
|
||
int aka_start, aka_len; char *p;
|
||
tree aka = strip_typedefs (typ, NULL, STF_USER_VISIBLE);
|
||
if (quote && *quote)
|
||
pp_end_quote (cxx_pp, show_color);
|
||
pp_string (cxx_pp, " {aka");
|
||
pp_cxx_whitespace (cxx_pp);
|
||
if (quote && *quote)
|
||
pp_begin_quote (cxx_pp, show_color);
|
||
if (highlight_color)
|
||
pp_string (cxx_pp, colorize_start (show_color, highlight_color));
|
||
/* And remember the start of the aka dump. */
|
||
aka_start = obstack_object_size (ob);
|
||
dump_type (cxx_pp, aka, flags);
|
||
aka_len = obstack_object_size (ob) - aka_start;
|
||
if (quote && *quote)
|
||
pp_end_quote (cxx_pp, show_color);
|
||
pp_right_brace (cxx_pp);
|
||
p = (char*)obstack_base (ob);
|
||
/* If they are identical, cut off the aka by unwinding the obstack. */
|
||
if (type_len == aka_len
|
||
&& memcmp (p + type_start, p+aka_start, type_len) == 0)
|
||
{
|
||
/* We can't add a '\0' here, since we may be adding a closing quote
|
||
below, and it would be hidden by the '\0'.
|
||
Instead, manually unwind the current object within the obstack
|
||
so that the insertion point is at the end of the type, before
|
||
the "' {aka". */
|
||
int delta = type_start + type_len - obstack_object_size (ob);
|
||
gcc_assert (delta <= 0);
|
||
obstack_blank_fast (ob, delta);
|
||
}
|
||
else
|
||
if (quote)
|
||
/* No further closing quotes are needed. */
|
||
*quote = false;
|
||
}
|
||
|
||
if (quote && *quote)
|
||
{
|
||
if (show_color && highlight_color)
|
||
pp_string (cxx_pp, colorize_stop (show_color));
|
||
pp_end_quote (cxx_pp, show_color);
|
||
*quote = false;
|
||
}
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
static const char *
|
||
args_to_string (tree p, int verbose)
|
||
{
|
||
int flags = 0;
|
||
if (verbose)
|
||
flags |= TFF_CLASS_KEY_OR_ENUM;
|
||
|
||
if (p == NULL_TREE)
|
||
return "";
|
||
|
||
if (TYPE_P (TREE_VALUE (p)))
|
||
return type_as_string_translate (p, flags);
|
||
|
||
reinit_cxx_pp ();
|
||
for (; p; p = TREE_CHAIN (p))
|
||
{
|
||
if (null_node_p (TREE_VALUE (p)))
|
||
pp_cxx_ws_string (cxx_pp, "NULL");
|
||
else
|
||
dump_type (cxx_pp, error_type (TREE_VALUE (p)), flags);
|
||
if (TREE_CHAIN (p))
|
||
pp_separate_with_comma (cxx_pp);
|
||
}
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
/* Pretty-print a deduction substitution (from deduction_tsubst_fntype). P
|
||
is a TREE_LIST with purpose the TEMPLATE_DECL, value the template
|
||
arguments. */
|
||
|
||
static const char *
|
||
subst_to_string (tree p, bool show_color)
|
||
{
|
||
tree decl = TREE_PURPOSE (p);
|
||
tree targs = TREE_VALUE (p);
|
||
tree tparms = DECL_TEMPLATE_PARMS (decl);
|
||
int flags = (TFF_DECL_SPECIFIERS|TFF_TEMPLATE_HEADER
|
||
|TFF_NO_TEMPLATE_BINDINGS);
|
||
|
||
if (p == NULL_TREE)
|
||
return "";
|
||
|
||
reinit_cxx_pp ();
|
||
pp_show_color (cxx_pp) = show_color;
|
||
dump_template_decl (cxx_pp, TREE_PURPOSE (p), flags);
|
||
dump_substitution (cxx_pp, NULL, tparms, targs, /*flags=*/0);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
static const char *
|
||
cv_to_string (tree p, int v)
|
||
{
|
||
reinit_cxx_pp ();
|
||
cxx_pp->set_padding (v ? pp_before : pp_none);
|
||
pp_cxx_cv_qualifier_seq (cxx_pp, p);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
static const char *
|
||
eh_spec_to_string (tree p, int /*v*/)
|
||
{
|
||
int flags = 0;
|
||
reinit_cxx_pp ();
|
||
dump_exception_spec (cxx_pp, p, flags);
|
||
return pp_ggc_formatted_text (cxx_pp);
|
||
}
|
||
|
||
/* Langhook for print_error_function. */
|
||
void
|
||
cxx_print_error_function (diagnostics::text_sink &text_output,
|
||
const char *file,
|
||
const diagnostics::diagnostic_info *diagnostic)
|
||
{
|
||
char *prefix;
|
||
if (file)
|
||
prefix = xstrdup (file);
|
||
else
|
||
prefix = NULL;
|
||
lhd_print_error_function (text_output, file, diagnostic);
|
||
|
||
pp_set_prefix (text_output.get_printer (), prefix);
|
||
maybe_print_instantiation_context (text_output);
|
||
}
|
||
|
||
static void
|
||
cp_diagnostic_text_starter (diagnostics::text_sink &text_output,
|
||
const diagnostics::diagnostic_info *diagnostic)
|
||
{
|
||
pp_set_prefix (text_output.get_printer (),
|
||
text_output.build_indent_prefix (true));
|
||
text_output.report_current_module (diagnostic_location (diagnostic));
|
||
cp_print_error_function (text_output, diagnostic);
|
||
maybe_print_instantiation_context (text_output);
|
||
maybe_print_constexpr_context (text_output);
|
||
maybe_print_constraint_context (text_output);
|
||
pp_set_prefix (text_output.get_printer (),
|
||
text_output.build_prefix (*diagnostic));
|
||
}
|
||
|
||
/* Print current function onto BUFFER, in the process of reporting
|
||
a diagnostic message. Called from cp_diagnostic_starter. */
|
||
static void
|
||
cp_print_error_function (diagnostics::text_sink &text_output,
|
||
const diagnostics::diagnostic_info *diagnostic)
|
||
{
|
||
/* If we are in an instantiation context, current_function_decl is likely
|
||
to be wrong, so just rely on print_instantiation_full_context. */
|
||
if (current_instantiation ())
|
||
return;
|
||
/* The above is true for constraint satisfaction also. */
|
||
if (current_failed_constraint)
|
||
return;
|
||
diagnostics::context *const context = &text_output.get_context ();
|
||
if (diagnostic_last_function_changed (context, diagnostic))
|
||
{
|
||
pretty_printer *const pp = text_output.get_printer ();
|
||
char *old_prefix = pp_take_prefix (pp);
|
||
const char *file = LOCATION_FILE (diagnostic_location (diagnostic));
|
||
tree abstract_origin = diagnostic_abstract_origin (diagnostic);
|
||
char *new_prefix = (file && abstract_origin == NULL)
|
||
? text_output.file_name_as_prefix (file) : NULL;
|
||
|
||
pp_set_prefix (pp, new_prefix);
|
||
|
||
if (current_function_decl == NULL)
|
||
pp_string (pp, _("At global scope:"));
|
||
else
|
||
{
|
||
tree fndecl, ao;
|
||
|
||
if (abstract_origin)
|
||
{
|
||
ao = BLOCK_ABSTRACT_ORIGIN (abstract_origin);
|
||
gcc_assert (TREE_CODE (ao) == FUNCTION_DECL);
|
||
fndecl = ao;
|
||
}
|
||
else
|
||
fndecl = current_function_decl;
|
||
|
||
pp_printf (pp, function_category (fndecl),
|
||
fndecl);
|
||
|
||
while (abstract_origin)
|
||
{
|
||
location_t *locus;
|
||
tree block = abstract_origin;
|
||
|
||
locus = &BLOCK_SOURCE_LOCATION (block);
|
||
fndecl = NULL;
|
||
block = BLOCK_SUPERCONTEXT (block);
|
||
while (block && TREE_CODE (block) == BLOCK
|
||
&& BLOCK_ABSTRACT_ORIGIN (block))
|
||
{
|
||
ao = BLOCK_ABSTRACT_ORIGIN (block);
|
||
if (TREE_CODE (ao) == FUNCTION_DECL)
|
||
{
|
||
fndecl = ao;
|
||
break;
|
||
}
|
||
else if (TREE_CODE (ao) != BLOCK)
|
||
break;
|
||
|
||
block = BLOCK_SUPERCONTEXT (block);
|
||
}
|
||
if (fndecl)
|
||
abstract_origin = block;
|
||
else
|
||
{
|
||
while (block && TREE_CODE (block) == BLOCK)
|
||
block = BLOCK_SUPERCONTEXT (block);
|
||
|
||
if (block && TREE_CODE (block) == FUNCTION_DECL)
|
||
fndecl = block;
|
||
abstract_origin = NULL;
|
||
}
|
||
if (fndecl)
|
||
{
|
||
expanded_location s = expand_location (*locus);
|
||
pp_character (pp, ',');
|
||
pp_newline (pp);
|
||
if (s.file != NULL)
|
||
{
|
||
if (text_output.show_column_p () && s.column != 0)
|
||
pp_printf (pp,
|
||
G_(" inlined from %qD at %r%s:%d:%d%R"),
|
||
fndecl,
|
||
"locus", s.file, s.line, s.column);
|
||
else
|
||
pp_printf (pp,
|
||
G_(" inlined from %qD at %r%s:%d%R"),
|
||
fndecl,
|
||
"locus", s.file, s.line);
|
||
|
||
}
|
||
else
|
||
pp_printf (pp, G_(" inlined from %qD"),
|
||
fndecl);
|
||
}
|
||
}
|
||
pp_character (pp, ':');
|
||
}
|
||
pp_newline (pp);
|
||
|
||
diagnostic_set_last_function (context, diagnostic);
|
||
pp->set_prefix (old_prefix);
|
||
}
|
||
}
|
||
|
||
/* Returns a description of FUNCTION using standard terminology. The
|
||
result is a format string of the form "In CATEGORY %qD". */
|
||
|
||
static const char *
|
||
function_category (tree fn)
|
||
{
|
||
/* We can get called from the middle-end for diagnostics of function
|
||
clones. Make sure we have language specific information before
|
||
dereferencing it. */
|
||
if (DECL_LANG_SPECIFIC (STRIP_TEMPLATE (fn))
|
||
&& DECL_FUNCTION_MEMBER_P (fn))
|
||
{
|
||
if (DECL_STATIC_FUNCTION_P (fn))
|
||
return G_("In static member function %qD");
|
||
else if (DECL_COPY_CONSTRUCTOR_P (fn))
|
||
return G_("In copy constructor %qD");
|
||
else if (DECL_CONSTRUCTOR_P (fn))
|
||
return G_("In constructor %qD");
|
||
else if (DECL_DESTRUCTOR_P (fn))
|
||
return G_("In destructor %qD");
|
||
else if (LAMBDA_FUNCTION_P (fn))
|
||
return G_("In lambda function");
|
||
else if (DECL_XOBJ_MEMBER_FUNCTION_P (fn))
|
||
return G_("In explicit object member function %qD");
|
||
else
|
||
return G_("In member function %qD");
|
||
}
|
||
else
|
||
return G_("In function %qD");
|
||
}
|
||
|
||
/* Disable warnings about missing quoting in GCC diagnostics for
|
||
the pp_verbatim calls. Their format strings deliberately don't
|
||
follow GCC diagnostic conventions. */
|
||
#if __GNUC__ >= 10
|
||
#pragma GCC diagnostic push
|
||
#pragma GCC diagnostic ignored "-Wformat-diag"
|
||
#endif
|
||
|
||
/* Report the full context of a current template instantiation,
|
||
onto BUFFER. */
|
||
static void
|
||
print_instantiation_full_context (diagnostics::text_sink &text_output)
|
||
{
|
||
struct tinst_level *p = current_instantiation ();
|
||
location_t location = input_location;
|
||
|
||
if (p)
|
||
{
|
||
bool show_file
|
||
= ((!text_output.show_nesting_p ())
|
||
|| text_output.show_locations_in_nesting_p ());
|
||
char *indent = text_output.build_indent_prefix (true);
|
||
bool expansion_stmt_p = TREE_CODE (p->tldcl) == TEMPLATE_FOR_STMT;
|
||
pp_verbatim (text_output.get_printer (),
|
||
expansion_stmt_p
|
||
? G_("%s%s%sIn instantiation of %<template for%> "
|
||
"iteration %E:\n")
|
||
: p->list_p ()
|
||
? G_("%s%s%sIn substitution of %qS:\n")
|
||
: G_("%s%s%sIn instantiation of %q#D:\n"),
|
||
indent,
|
||
show_file ? LOCATION_FILE (location) : "",
|
||
show_file ? ": " : "",
|
||
expansion_stmt_p
|
||
? TREE_VEC_ELT (p->targs, 0)
|
||
: p->get_node ());
|
||
free (indent);
|
||
location = p->locus;
|
||
p = p->next;
|
||
}
|
||
|
||
print_instantiation_partial_context (text_output, p, location);
|
||
}
|
||
|
||
static void
|
||
print_location (diagnostics::text_sink &text_output,
|
||
location_t loc)
|
||
{
|
||
expanded_location xloc = expand_location (loc);
|
||
pretty_printer *const pp = text_output.get_printer ();
|
||
if (text_output.show_column_p ())
|
||
pp_verbatim (pp, G_("%r%s:%d:%d:%R "),
|
||
"locus", xloc.file, xloc.line, xloc.column);
|
||
else
|
||
pp_verbatim (pp, G_("%r%s:%d:%R "),
|
||
"locus", xloc.file, xloc.line);
|
||
}
|
||
|
||
/* A RAII class for use when emitting a line of contextual information
|
||
via pp_verbatim to a diagnostics::text_sink to add before/after
|
||
behaviors to the pp_verbatim calls.
|
||
|
||
If the text output has show_nesting_p (), then the ctor prints
|
||
leading indentation and a bullet point, and the dtor prints
|
||
the location on a new line, and calls diagnostic_show_locus, both
|
||
with indentation (and no bullet point).
|
||
|
||
Otherwise (when the text output has !show_nesting_p), the ctor prints
|
||
the location as leading information on the same line, and the
|
||
dtor optionally calls diagnostic_show_locus. */
|
||
|
||
class auto_context_line
|
||
{
|
||
public:
|
||
auto_context_line (diagnostics::text_sink &text_output,
|
||
location_t loc,
|
||
bool show_locus = false)
|
||
: m_text_output (text_output),
|
||
m_loc (loc),
|
||
m_show_locus (show_locus)
|
||
{
|
||
char *indent = m_text_output.build_indent_prefix (true);
|
||
pp_verbatim (m_text_output.get_printer (), indent);
|
||
free (indent);
|
||
if (!m_text_output.show_nesting_p ())
|
||
print_location (m_text_output, m_loc);
|
||
}
|
||
~auto_context_line ()
|
||
{
|
||
pretty_printer *const pp = m_text_output.get_printer ();
|
||
if (m_text_output.show_nesting_p ())
|
||
{
|
||
if (m_text_output.show_locations_in_nesting_p ())
|
||
{
|
||
char *indent = m_text_output.build_indent_prefix (false);
|
||
pp_verbatim (pp, indent);
|
||
print_location (m_text_output, m_loc);
|
||
pp_newline (pp);
|
||
|
||
char *saved_prefix = pp_take_prefix (pp);
|
||
pp_set_prefix (pp, indent);
|
||
gcc_rich_location rich_loc (m_loc);
|
||
diagnostic_show_locus (&m_text_output.get_context (),
|
||
m_text_output.get_source_printing_options (),
|
||
&rich_loc,
|
||
diagnostics::kind::note, pp);
|
||
pp_set_prefix (pp, saved_prefix);
|
||
}
|
||
}
|
||
else if (m_show_locus)
|
||
{
|
||
char *saved_prefix = pp_take_prefix (pp);
|
||
pp_set_prefix (pp, nullptr);
|
||
gcc_rich_location rich_loc (m_loc);
|
||
diagnostic_show_locus (&m_text_output.get_context (),
|
||
m_text_output.get_source_printing_options (),
|
||
&rich_loc,
|
||
diagnostics::kind::note, pp);
|
||
pp_set_prefix (pp, saved_prefix);
|
||
}
|
||
}
|
||
private:
|
||
diagnostics::text_sink &m_text_output;
|
||
location_t m_loc;
|
||
bool m_show_locus;
|
||
};
|
||
|
||
/* Helper function of print_instantiation_partial_context() that
|
||
prints a single line of instantiation context. */
|
||
|
||
static void
|
||
print_instantiation_partial_context_line (diagnostics::text_sink &text_output,
|
||
struct tinst_level *t,
|
||
location_t loc, bool recursive_p)
|
||
{
|
||
if (loc == UNKNOWN_LOCATION)
|
||
return;
|
||
|
||
auto_context_line sentinel (text_output, loc, true);
|
||
|
||
pretty_printer *const pp = text_output.get_printer ();
|
||
|
||
if (t != NULL)
|
||
{
|
||
if (TREE_CODE (t->tldcl) == TEMPLATE_FOR_STMT)
|
||
pp_verbatim (pp,
|
||
recursive_p
|
||
? G_("recursively required from %<template for%> "
|
||
"iteration %E\n")
|
||
: G_("required from %<template for%> iteration %E\n"),
|
||
TREE_VEC_ELT (t->targs, 0));
|
||
else if (t->list_p ())
|
||
pp_verbatim (pp,
|
||
recursive_p
|
||
? G_("recursively required by substitution of %qS\n")
|
||
: G_("required by substitution of %qS\n"),
|
||
t->get_node ());
|
||
else
|
||
pp_verbatim (pp,
|
||
recursive_p
|
||
? G_("recursively required from %q#D\n")
|
||
: G_("required from %q#D\n"),
|
||
t->get_node ());
|
||
}
|
||
else
|
||
{
|
||
pp_verbatim (pp,
|
||
recursive_p
|
||
? G_("recursively required from here\n")
|
||
: G_("required from here\n"));
|
||
}
|
||
}
|
||
|
||
/* Same as print_instantiation_full_context but less verbose. */
|
||
|
||
static void
|
||
print_instantiation_partial_context (diagnostics::text_sink &text_output,
|
||
struct tinst_level *t0, location_t loc)
|
||
{
|
||
struct tinst_level *t;
|
||
int n_total = 0;
|
||
int n;
|
||
location_t prev_loc = loc;
|
||
|
||
for (t = t0; t != NULL; t = t->next)
|
||
if (prev_loc != t->locus)
|
||
{
|
||
prev_loc = t->locus;
|
||
n_total++;
|
||
}
|
||
|
||
t = t0;
|
||
|
||
if (template_backtrace_limit
|
||
&& n_total > template_backtrace_limit)
|
||
{
|
||
int skip = n_total - template_backtrace_limit;
|
||
int head = template_backtrace_limit / 2;
|
||
|
||
/* Avoid skipping just 1. If so, skip 2. */
|
||
if (skip == 1)
|
||
{
|
||
skip = 2;
|
||
head = (template_backtrace_limit - 1) / 2;
|
||
}
|
||
|
||
for (n = 0; n < head; n++)
|
||
{
|
||
gcc_assert (t != NULL);
|
||
if (loc != t->locus)
|
||
print_instantiation_partial_context_line (text_output, t, loc,
|
||
/*recursive_p=*/false);
|
||
loc = t->locus;
|
||
t = t->next;
|
||
}
|
||
if (t != NULL && skip > 0)
|
||
{
|
||
auto_context_line sentinel (text_output, loc);
|
||
pp_verbatim (text_output.get_printer (),
|
||
G_("[ skipping %d instantiation contexts,"
|
||
" use -ftemplate-backtrace-limit=0 to disable ]\n"),
|
||
skip);
|
||
do {
|
||
loc = t->locus;
|
||
t = t->next;
|
||
} while (t != NULL && --skip > 0);
|
||
}
|
||
}
|
||
|
||
while (t != NULL)
|
||
{
|
||
while (t->next != NULL && t->locus == t->next->locus)
|
||
{
|
||
loc = t->locus;
|
||
t = t->next;
|
||
}
|
||
print_instantiation_partial_context_line (text_output, t, loc,
|
||
t->locus == loc);
|
||
loc = t->locus;
|
||
t = t->next;
|
||
}
|
||
print_instantiation_partial_context_line (text_output, NULL, loc,
|
||
/*recursive_p=*/false);
|
||
}
|
||
|
||
/* Called from cp_thing to print the template context for an error. */
|
||
static void
|
||
maybe_print_instantiation_context (diagnostics::text_sink &text_output)
|
||
{
|
||
if (!problematic_instantiation_changed () || current_instantiation () == 0)
|
||
return;
|
||
|
||
record_last_problematic_instantiation ();
|
||
print_instantiation_full_context (text_output);
|
||
}
|
||
|
||
/* Report what constexpr call(s) we're trying to expand, if any. */
|
||
|
||
void
|
||
maybe_print_constexpr_context (diagnostics::text_sink &text_output)
|
||
{
|
||
vec<tree> call_stack = cx_error_context ();
|
||
unsigned ix;
|
||
tree t;
|
||
|
||
FOR_EACH_VEC_ELT (call_stack, ix, t)
|
||
{
|
||
const char *s = expr_as_string (t, 0);
|
||
pretty_printer *const pp = text_output.get_printer ();
|
||
auto_context_line sentinel (text_output, EXPR_LOCATION (t));
|
||
pp_verbatim (pp,
|
||
G_("in %<constexpr%> expansion of %qs"),
|
||
s);
|
||
pp_newline (pp);
|
||
}
|
||
}
|
||
|
||
|
||
static void
|
||
print_constrained_decl_info (diagnostics::text_sink &text_output,
|
||
tree decl)
|
||
{
|
||
auto_context_line sentinel (text_output, DECL_SOURCE_LOCATION (decl));
|
||
pretty_printer *const pp = text_output.get_printer ();
|
||
pp_verbatim (pp, G_("required by the constraints of %q#D\n"), decl);
|
||
}
|
||
|
||
static void
|
||
print_concept_check_info (diagnostics::text_sink &text_output,
|
||
tree expr, tree map, tree args)
|
||
{
|
||
gcc_assert (concept_check_p (expr));
|
||
|
||
tree tmpl = TREE_OPERAND (expr, 0);
|
||
|
||
auto_context_line sentinel (text_output, DECL_SOURCE_LOCATION (tmpl));
|
||
|
||
cxx_pretty_printer *const pp
|
||
= (cxx_pretty_printer *)text_output.get_printer ();
|
||
pp_verbatim (pp, G_("required for the satisfaction of %qE"), expr);
|
||
if (map && map != error_mark_node)
|
||
{
|
||
tree subst_map = tsubst_parameter_mapping (map, args, tf_none, NULL_TREE);
|
||
pp_cxx_parameter_mapping (pp, (subst_map != error_mark_node
|
||
? subst_map : map));
|
||
}
|
||
pp_newline (pp);
|
||
}
|
||
|
||
/* Diagnose the entry point into the satisfaction error. Returns the next
|
||
context, if any. */
|
||
|
||
static tree
|
||
print_constraint_context_head (diagnostics::text_sink &text_output,
|
||
tree cxt, tree args)
|
||
{
|
||
tree src = TREE_VALUE (cxt);
|
||
if (!src)
|
||
{
|
||
auto_context_line sentinel (text_output, input_location);
|
||
pretty_printer *const pp = text_output.get_printer ();
|
||
pp_verbatim (pp, G_("required for constraint satisfaction\n"));
|
||
return NULL_TREE;
|
||
}
|
||
if (DECL_P (src))
|
||
{
|
||
print_constrained_decl_info (text_output, src);
|
||
return NULL_TREE;
|
||
}
|
||
else
|
||
{
|
||
print_concept_check_info (text_output, src, TREE_PURPOSE (cxt), args);
|
||
return TREE_CHAIN (cxt);
|
||
}
|
||
}
|
||
|
||
static void
|
||
print_requires_expression_info (diagnostics::text_sink &text_output,
|
||
tree constr, tree args)
|
||
{
|
||
|
||
tree expr = ATOMIC_CONSTR_EXPR (constr);
|
||
tree map = ATOMIC_CONSTR_MAP (constr);
|
||
map = tsubst_parameter_mapping (map, args, tf_none, NULL_TREE);
|
||
if (map == error_mark_node)
|
||
return;
|
||
|
||
auto_context_line sentinel (text_output, cp_expr_loc_or_input_loc (expr));
|
||
cxx_pretty_printer *const pp
|
||
= static_cast <cxx_pretty_printer *> (text_output.get_printer ());
|
||
|
||
tree parms = TREE_OPERAND (expr, 0);
|
||
pp_verbatim (pp, parms ? G_("in requirements with ")
|
||
: G_("in requirements "));
|
||
while (parms)
|
||
{
|
||
pp_verbatim (pp, "%q#D", parms);
|
||
if (TREE_CHAIN (parms))
|
||
pp_separate_with_comma (pp);
|
||
parms = TREE_CHAIN (parms);
|
||
}
|
||
pp_cxx_parameter_mapping (pp, map);
|
||
|
||
pp_verbatim (pp, "\n");
|
||
}
|
||
|
||
void
|
||
maybe_print_single_constraint_context (diagnostics::text_sink &text_output,
|
||
tree failed)
|
||
{
|
||
if (!failed)
|
||
return;
|
||
|
||
tree constr = TREE_VALUE (failed);
|
||
if (!constr || constr == error_mark_node)
|
||
return;
|
||
tree cxt = CONSTR_CONTEXT (constr);
|
||
if (!cxt)
|
||
return;
|
||
tree args = TREE_PURPOSE (failed);
|
||
|
||
/* Print the stack of requirements. */
|
||
cxt = print_constraint_context_head (text_output, cxt, args);
|
||
while (cxt && !DECL_P (TREE_VALUE (cxt)))
|
||
{
|
||
tree expr = TREE_VALUE (cxt);
|
||
tree map = TREE_PURPOSE (cxt);
|
||
print_concept_check_info (text_output, expr, map, args);
|
||
cxt = TREE_CHAIN (cxt);
|
||
}
|
||
|
||
/* For certain constraints, we can provide additional context. */
|
||
if (TREE_CODE (constr) == ATOMIC_CONSTR
|
||
&& TREE_CODE (ATOMIC_CONSTR_EXPR (constr)) == REQUIRES_EXPR)
|
||
print_requires_expression_info (text_output, constr, args);
|
||
}
|
||
|
||
void
|
||
maybe_print_constraint_context (diagnostics::text_sink &text_output)
|
||
{
|
||
if (!current_failed_constraint)
|
||
return;
|
||
|
||
tree cur = current_failed_constraint;
|
||
|
||
/* Recursively print nested contexts. */
|
||
current_failed_constraint = TREE_CHAIN (current_failed_constraint);
|
||
if (current_failed_constraint)
|
||
maybe_print_constraint_context (text_output);
|
||
|
||
/* Print this context. */
|
||
maybe_print_single_constraint_context (text_output, cur);
|
||
}
|
||
|
||
/* Return true iff TYPE_A and TYPE_B are template types that are
|
||
meaningful to compare. */
|
||
|
||
static bool
|
||
comparable_template_types_p (tree type_a, tree type_b)
|
||
{
|
||
if (!CLASS_TYPE_P (type_a))
|
||
return false;
|
||
if (!CLASS_TYPE_P (type_b))
|
||
return false;
|
||
|
||
tree tinfo_a = TYPE_TEMPLATE_INFO (type_a);
|
||
tree tinfo_b = TYPE_TEMPLATE_INFO (type_b);
|
||
if (!tinfo_a || !tinfo_b)
|
||
return false;
|
||
|
||
return TI_TEMPLATE (tinfo_a) == TI_TEMPLATE (tinfo_b);
|
||
}
|
||
|
||
/* Start a new line indented by SPC spaces on PP. */
|
||
|
||
static void
|
||
newline_and_indent (pretty_printer *pp, int spc)
|
||
{
|
||
pp_newline (pp);
|
||
for (int i = 0; i < spc; i++)
|
||
pp_space (pp);
|
||
}
|
||
|
||
/* Generate a GC-allocated string for ARG, an expression or type. */
|
||
|
||
static const char *
|
||
arg_to_string (tree arg, bool verbose)
|
||
{
|
||
if (TYPE_P (arg))
|
||
return type_to_string (arg, verbose, true, NULL, false);
|
||
else
|
||
return expr_to_string (arg);
|
||
}
|
||
|
||
/* Subroutine to type_to_string_with_compare and
|
||
print_template_tree_comparison.
|
||
|
||
Print a representation of ARG (an expression or type) to PP,
|
||
colorizing it if PP->show_color, using HIGHLIGHT_COLOR,
|
||
or "type-diff" if the latter is NULL. */
|
||
|
||
static void
|
||
print_nonequal_arg (pretty_printer *pp, tree arg, bool verbose,
|
||
const char *highlight_color)
|
||
{
|
||
if (!highlight_color)
|
||
highlight_color = "type-diff";
|
||
pp_printf (pp, "%r%s%R",
|
||
highlight_color,
|
||
(arg
|
||
? arg_to_string (arg, verbose)
|
||
: G_("(no argument)")));
|
||
}
|
||
|
||
/* Recursively print template TYPE_A to PP, as compared to template TYPE_B.
|
||
|
||
The types must satisfy comparable_template_types_p.
|
||
|
||
If INDENT is 0, then this is equivalent to type_to_string (TYPE_A), but
|
||
potentially colorizing/eliding in comparison with TYPE_B.
|
||
|
||
For example given types:
|
||
vector<map<int,double>>
|
||
and
|
||
vector<map<int,float>>
|
||
then the result on PP would be:
|
||
vector<map<[...],double>>
|
||
with type elision, and:
|
||
vector<map<int,double>>
|
||
without type elision.
|
||
|
||
In both cases the parts of TYPE that differ from PEER will be colorized
|
||
if pp_show_color (pp) is true. In the above example, this would be
|
||
"double".
|
||
|
||
If INDENT is non-zero, then the types are printed in a tree-like form
|
||
which shows both types. In the above example, the result on PP would be:
|
||
|
||
vector<
|
||
map<
|
||
[...],
|
||
[double != float]>>
|
||
|
||
and without type-elision would be:
|
||
|
||
vector<
|
||
map<
|
||
int,
|
||
[double != float]>>
|
||
|
||
As before, the differing parts of the types are colorized if
|
||
pp_show_color (pp) is true ("double" and "float" in this example).
|
||
|
||
Template arguments in which both types are using the default arguments
|
||
are not printed; if at least one of the two types is using a non-default
|
||
argument, then that argument is printed (or both arguments for the
|
||
tree-like print format). */
|
||
|
||
static void
|
||
print_template_differences (pretty_printer *pp, tree type_a, tree type_b,
|
||
bool verbose, int indent,
|
||
const char *highlight_color_a,
|
||
const char *highlight_color_b)
|
||
{
|
||
if (indent)
|
||
newline_and_indent (pp, indent);
|
||
|
||
tree tinfo_a = TYPE_TEMPLATE_INFO (type_a);
|
||
tree tinfo_b = TYPE_TEMPLATE_INFO (type_b);
|
||
|
||
pp_printf (pp, "%s<",
|
||
IDENTIFIER_POINTER (DECL_NAME (TI_TEMPLATE (tinfo_a))));
|
||
|
||
tree args_a = TI_ARGS (tinfo_a);
|
||
tree args_b = TI_ARGS (tinfo_b);
|
||
gcc_assert (TREE_CODE (args_a) == TREE_VEC);
|
||
gcc_assert (TREE_CODE (args_b) == TREE_VEC);
|
||
int flags = 0;
|
||
int len_a = get_non_default_template_args_count (args_a, flags);
|
||
args_a = INNERMOST_TEMPLATE_ARGS (args_a);
|
||
int len_b = get_non_default_template_args_count (args_b, flags);
|
||
args_b = INNERMOST_TEMPLATE_ARGS (args_b);
|
||
/* Determine the maximum range of args for which non-default template args
|
||
were used; beyond this, only default args (if any) were used, and so
|
||
they will be equal from this point onwards.
|
||
One of the two peers might have used default arguments within this
|
||
range, but the other will be using non-default arguments, and so
|
||
it's more readable to print both within this range, to highlight
|
||
the differences. */
|
||
int len_max = MAX (len_a, len_b);
|
||
gcc_assert (TREE_CODE (args_a) == TREE_VEC);
|
||
gcc_assert (TREE_CODE (args_b) == TREE_VEC);
|
||
for (int idx = 0; idx < len_max; idx++)
|
||
{
|
||
if (idx)
|
||
pp_character (pp, ',');
|
||
|
||
tree arg_a = TREE_VEC_ELT (args_a, idx);
|
||
tree arg_b = TREE_VEC_ELT (args_b, idx);
|
||
if (arg_a == arg_b)
|
||
{
|
||
if (indent)
|
||
newline_and_indent (pp, indent + 2);
|
||
/* Can do elision here, printing "[...]". */
|
||
if (flag_elide_type)
|
||
pp_string (pp, G_("[...]"));
|
||
else
|
||
pp_string (pp, arg_to_string (arg_a, verbose));
|
||
}
|
||
else
|
||
{
|
||
int new_indent = indent ? indent + 2 : 0;
|
||
if (comparable_template_types_p (arg_a, arg_b))
|
||
print_template_differences (pp, arg_a, arg_b, verbose, new_indent,
|
||
highlight_color_a, highlight_color_b);
|
||
else
|
||
if (indent)
|
||
{
|
||
newline_and_indent (pp, indent + 2);
|
||
pp_character (pp, '[');
|
||
print_nonequal_arg (pp, arg_a, verbose, highlight_color_a);
|
||
pp_string (pp, " != ");
|
||
print_nonequal_arg (pp, arg_b, verbose, highlight_color_b);
|
||
pp_character (pp, ']');
|
||
}
|
||
else
|
||
print_nonequal_arg (pp, arg_a, verbose, highlight_color_a);
|
||
}
|
||
}
|
||
pp_printf (pp, ">");
|
||
}
|
||
|
||
/* As type_to_string, but for a template, potentially colorizing/eliding
|
||
in comparison with PEER.
|
||
For example, if TYPE is map<int,double> and PEER is map<int,int>,
|
||
then the resulting string would be:
|
||
map<[...],double>
|
||
with type elision, and:
|
||
map<int,double>
|
||
without type elision.
|
||
|
||
In both cases the parts of TYPE that differ from PEER will be colorized
|
||
if SHOW_COLOR is true. In the above example, this would be "double".
|
||
|
||
Template arguments in which both types are using the default arguments
|
||
are not printed; if at least one of the two types is using a non-default
|
||
argument, then both arguments are printed.
|
||
|
||
The resulting string is in a GC-allocated buffer. */
|
||
|
||
static const char *
|
||
type_to_string_with_compare (tree type, tree peer, bool verbose,
|
||
bool show_color,
|
||
const char *this_highlight_color,
|
||
const char *peer_highlight_color)
|
||
{
|
||
pretty_printer inner_pp;
|
||
pretty_printer *pp = &inner_pp;
|
||
pp_show_color (pp) = show_color;
|
||
|
||
print_template_differences (pp, type, peer, verbose, 0,
|
||
this_highlight_color, peer_highlight_color);
|
||
return pp_ggc_formatted_text (pp);
|
||
}
|
||
|
||
/* Recursively print a tree-like comparison of TYPE_A and TYPE_B to PP,
|
||
indented by INDENT spaces.
|
||
|
||
For example given types:
|
||
|
||
vector<map<int,double>>
|
||
|
||
and
|
||
|
||
vector<map<double,float>>
|
||
|
||
the output with type elision would be:
|
||
|
||
vector<
|
||
map<
|
||
[...],
|
||
[double != float]>>
|
||
|
||
and without type-elision would be:
|
||
|
||
vector<
|
||
map<
|
||
int,
|
||
[double != float]>>
|
||
|
||
TYPE_A and TYPE_B must both be comparable template types
|
||
(as per comparable_template_types_p).
|
||
|
||
Template arguments in which both types are using the default arguments
|
||
are not printed; if at least one of the two types is using a non-default
|
||
argument, then both arguments are printed. */
|
||
|
||
static void
|
||
print_template_tree_comparison (pretty_printer *pp, tree type_a, tree type_b,
|
||
bool verbose, int indent,
|
||
const char *highlight_color_a,
|
||
const char *highlight_color_b)
|
||
{
|
||
print_template_differences (pp, type_a, type_b, verbose, indent,
|
||
highlight_color_a,
|
||
highlight_color_b);
|
||
}
|
||
|
||
/* Subroutine for use in a format_postprocessor::handle
|
||
implementation. Adds a chunk to the end of
|
||
formatted output, so that it will be printed
|
||
by pp_output_formatted_text. */
|
||
|
||
static void
|
||
append_formatted_chunk (pretty_printer *pp, const char *content)
|
||
{
|
||
output_buffer *buffer = pp_buffer (pp);
|
||
pp_formatted_chunks *chunk_array = buffer->m_cur_formatted_chunks;
|
||
chunk_array->append_formatted_chunk (buffer->m_chunk_obstack, content);
|
||
}
|
||
|
||
#if __GNUC__ >= 10
|
||
#pragma GCC diagnostic pop
|
||
#endif
|
||
|
||
/* If we had %H and %I, and hence deferred printing them,
|
||
print them now, storing the result into custom_token_value
|
||
for the custom pp_token. Quote them if 'q' was provided.
|
||
Also print the difference in tree form, adding it as
|
||
an additional chunk. */
|
||
|
||
void
|
||
cxx_format_postprocessor::handle (pretty_printer *pp)
|
||
{
|
||
/* If we have one of %H and %I, the other should have
|
||
been present. */
|
||
if (m_type_a.m_tree || m_type_b.m_tree)
|
||
{
|
||
const bool show_highlight_colors = pp_show_highlight_colors (pp);
|
||
const char *percent_h
|
||
= show_highlight_colors ? highlight_colors::percent_h : nullptr;
|
||
const char *percent_i
|
||
= show_highlight_colors ? highlight_colors::percent_i : nullptr;
|
||
/* Avoid reentrancy issues by working with a copy of
|
||
m_type_a and m_type_b, resetting them now. */
|
||
deferred_printed_type type_a = std::move (m_type_a);
|
||
deferred_printed_type type_b = std::move (m_type_b);
|
||
m_type_a = deferred_printed_type ();
|
||
m_type_b = deferred_printed_type ();
|
||
|
||
gcc_assert (type_a.m_token_list);
|
||
gcc_assert (type_b.m_token_list);
|
||
|
||
bool show_color = pp_show_color (pp);
|
||
|
||
const char *type_a_text;
|
||
const char *type_b_text;
|
||
|
||
if (comparable_template_types_p (type_a.m_tree, type_b.m_tree))
|
||
{
|
||
type_a_text = type_to_string_with_compare
|
||
(type_a.m_tree, type_b.m_tree,
|
||
type_a.m_verbose, show_color,
|
||
percent_h, percent_i);
|
||
type_b_text = type_to_string_with_compare
|
||
(type_b.m_tree, type_a.m_tree,
|
||
type_b.m_verbose, show_color,
|
||
percent_i, percent_h);
|
||
|
||
if (flag_diagnostics_show_template_tree)
|
||
{
|
||
pretty_printer inner_pp;
|
||
pp_show_color (&inner_pp) = pp_show_color (pp);
|
||
print_template_tree_comparison
|
||
(&inner_pp, type_a.m_tree, type_b.m_tree, type_a.m_verbose, 2,
|
||
percent_h, percent_i);
|
||
append_formatted_chunk (pp, pp_ggc_formatted_text (&inner_pp));
|
||
}
|
||
}
|
||
else
|
||
{
|
||
/* If the types were not comparable (or if only one of %H/%I was
|
||
provided), they are printed normally, and no difference tree
|
||
is printed. */
|
||
type_a_text = type_to_string (type_a.m_tree, type_a.m_verbose,
|
||
true, &type_a.m_quote, show_color,
|
||
percent_h);
|
||
type_b_text = type_to_string (type_b.m_tree, type_b.m_verbose,
|
||
true, &type_b.m_quote, show_color,
|
||
percent_i);
|
||
}
|
||
|
||
type_a.set_text_for_token_list (type_a_text, type_a.m_quote);
|
||
type_b.set_text_for_token_list (type_b_text, type_b.m_quote);
|
||
}
|
||
}
|
||
|
||
/* Subroutine for handling %H and %I, to support i18n of messages like:
|
||
|
||
error_at (loc, "could not convert %qE from %qH to %qI",
|
||
expr, type_a, type_b);
|
||
|
||
so that we can print things like:
|
||
|
||
could not convert 'foo' from 'map<int,double>' to 'map<int,int>'
|
||
|
||
and, with type-elision:
|
||
|
||
could not convert 'foo' from 'map<[...],double>' to 'map<[...],int>'
|
||
|
||
(with color-coding of the differences between the types).
|
||
|
||
The %H and %I format codes are peers: both must be present,
|
||
and they affect each other. Hence to handle them, we must
|
||
delay printing until we have both, deferring the printing to
|
||
pretty_printer's m_format_postprocessor hook.
|
||
|
||
This is called in phase 2 of pp_format, when it is accumulating
|
||
a series of pp_token lists. Since we have to interact with the
|
||
fiddly quoting logic for "aka", we store the pp_token_list *
|
||
and in the m_format_postprocessor hook we generate text for the type
|
||
(possibly with quotes and colors), then replace all tokens in that token list
|
||
(such as [BEGIN_QUOTE, END_QUOTE]) with a text token containing the
|
||
freshly generated text.
|
||
|
||
We also need to stash whether a 'q' prefix was provided (the QUOTE
|
||
param) so that we can add the quotes when writing out the delayed
|
||
chunk. */
|
||
|
||
static void
|
||
defer_phase_2_of_type_diff (deferred_printed_type *deferred,
|
||
tree type,
|
||
pp_token_list &formatted_token_list,
|
||
bool verbose, bool quote)
|
||
{
|
||
gcc_assert (deferred->m_tree == NULL_TREE);
|
||
*deferred = deferred_printed_type (type, formatted_token_list,
|
||
verbose, quote);
|
||
}
|
||
|
||
/* Implementation of pp_markup::element_quoted_type::print_type
|
||
for C++/ObjC++. */
|
||
|
||
void
|
||
pp_markup::element_quoted_type::print_type (pp_markup::context &ctxt)
|
||
{
|
||
const char *highlight_color
|
||
= pp_show_highlight_colors (&ctxt.m_pp) ? m_highlight_color : nullptr;
|
||
const char *result
|
||
= type_to_string (m_type, false, false, &ctxt.m_quoted,
|
||
pp_show_color (&ctxt.m_pp), highlight_color);
|
||
pp_string (&ctxt.m_pp, result);
|
||
}
|
||
|
||
/* Called from output_format -- during diagnostic message processing --
|
||
to handle C++ specific format specifier with the following meanings:
|
||
%A function argument-list.
|
||
%C tree code.
|
||
%D declaration.
|
||
%E expression.
|
||
%F function declaration.
|
||
%H type difference (from).
|
||
%I type difference (to).
|
||
%L language as used in extern "lang".
|
||
%O binary operator.
|
||
%P function parameter whose position is indicated by an integer.
|
||
%Q assignment operator.
|
||
%S substitution (template + args)
|
||
%T type.
|
||
%V cv-qualifier.
|
||
%X exception-specification. */
|
||
static bool
|
||
cp_printer (pretty_printer *pp, text_info *text, const char *spec,
|
||
int precision, bool wide, bool set_locus, bool verbose,
|
||
bool *quoted, pp_token_list &formatted_token_list)
|
||
{
|
||
gcc_assert (pp_format_postprocessor (pp));
|
||
cxx_format_postprocessor *postprocessor
|
||
= static_cast <cxx_format_postprocessor *> (pp_format_postprocessor (pp));
|
||
|
||
const char *result;
|
||
tree t = NULL;
|
||
#define next_tree (t = va_arg (*text->m_args_ptr, tree))
|
||
#define next_tcode ((enum tree_code) va_arg (*text->m_args_ptr, int))
|
||
#define next_lang ((enum languages) va_arg (*text->m_args_ptr, int))
|
||
#define next_int va_arg (*text->m_args_ptr, int)
|
||
|
||
if (precision != 0 || wide)
|
||
return false;
|
||
|
||
switch (*spec)
|
||
{
|
||
case 'A': result = args_to_string (next_tree, verbose); break;
|
||
case 'C': result = code_to_string (next_tcode); break;
|
||
case 'D':
|
||
{
|
||
tree temp = next_tree;
|
||
if (VAR_P (temp)
|
||
&& DECL_HAS_DEBUG_EXPR_P (temp))
|
||
{
|
||
temp = DECL_DEBUG_EXPR (temp);
|
||
if (!DECL_P (temp))
|
||
{
|
||
result = expr_to_string (temp);
|
||
break;
|
||
}
|
||
}
|
||
result = decl_to_string (temp, verbose, pp_show_color (pp));
|
||
}
|
||
break;
|
||
case 'E': result = expr_to_string (next_tree); break;
|
||
case 'F': result = fndecl_to_string (next_tree, verbose); break;
|
||
case 'H':
|
||
defer_phase_2_of_type_diff (&postprocessor->m_type_a, next_tree,
|
||
formatted_token_list, verbose, *quoted);
|
||
return true;
|
||
case 'I':
|
||
defer_phase_2_of_type_diff (&postprocessor->m_type_b, next_tree,
|
||
formatted_token_list, verbose, *quoted);
|
||
return true;
|
||
case 'L': result = language_to_string (next_lang); break;
|
||
case 'O': result = op_to_string (false, next_tcode); break;
|
||
case 'P': result = parm_to_string (next_int); break;
|
||
case 'Q': result = op_to_string (true, next_tcode); break;
|
||
case 'S': result = subst_to_string (next_tree, pp_show_color (pp)); break;
|
||
case 'T':
|
||
{
|
||
result = type_to_string (next_tree, verbose, false, quoted,
|
||
pp_show_color (pp));
|
||
}
|
||
break;
|
||
case 'V': result = cv_to_string (next_tree, verbose); break;
|
||
case 'X': result = eh_spec_to_string (next_tree, verbose); break;
|
||
|
||
default:
|
||
return false;
|
||
}
|
||
|
||
pp_string (pp, result);
|
||
if (set_locus && t != NULL)
|
||
text->set_location (0, location_of (t), SHOW_RANGE_WITH_CARET);
|
||
return true;
|
||
#undef next_tree
|
||
#undef next_tcode
|
||
#undef next_lang
|
||
#undef next_int
|
||
}
|
||
|
||
/* Warn about the use of C++0x features when appropriate. */
|
||
void
|
||
maybe_warn_cpp0x (cpp0x_warn_str str, location_t loc/*=input_location*/)
|
||
{
|
||
if (cxx_dialect == cxx98)
|
||
switch (str)
|
||
{
|
||
case CPP0X_INITIALIZER_LISTS:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"extended initializer lists "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_EXPLICIT_CONVERSION:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"explicit conversion operators "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_VARIADIC_TEMPLATES:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"variadic templates "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_LAMBDA_EXPR:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"lambda expressions "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_AUTO:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"C++11 auto only available with %<-std=c++11%> or "
|
||
"%<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_SCOPED_ENUMS:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"scoped enums only available with %<-std=c++11%> or "
|
||
"%<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_DEFAULTED_DELETED:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"defaulted and deleted functions "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_INLINE_NAMESPACES:
|
||
if (pedantic)
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"inline namespaces "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_OVERRIDE_CONTROLS:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"override controls (override/final) "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_NSDMI:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"non-static data member initializers "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_USER_DEFINED_LITERALS:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"user-defined literals "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_DELEGATING_CTORS:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"delegating constructors "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_INHERITING_CTORS:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"inheriting constructors "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_ATTRIBUTES:
|
||
if (pedantic)
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"C++11 attributes "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
case CPP0X_REF_QUALIFIER:
|
||
pedwarn (loc, OPT_Wc__11_extensions,
|
||
"ref-qualifiers "
|
||
"only available with %<-std=c++11%> or %<-std=gnu++11%>");
|
||
break;
|
||
default:
|
||
gcc_unreachable ();
|
||
}
|
||
}
|
||
|
||
/* Warn about the use of variadic templates when appropriate. */
|
||
void
|
||
maybe_warn_variadic_templates (void)
|
||
{
|
||
maybe_warn_cpp0x (CPP0X_VARIADIC_TEMPLATES);
|
||
}
|
||
|
||
|
||
/* Issue an ISO C++98 pedantic warning at LOCATION, conditional on
|
||
option OPTION_ID with text GMSGID. Use this function to report
|
||
diagnostics for constructs that are invalid C++98, but valid
|
||
C++0x. */
|
||
bool
|
||
pedwarn_cxx98 (location_t location,
|
||
diagnostics::option_id option_id,
|
||
const char *gmsgid, ...)
|
||
{
|
||
diagnostics::diagnostic_info diagnostic;
|
||
va_list ap;
|
||
bool ret;
|
||
rich_location richloc (line_table, location);
|
||
|
||
va_start (ap, gmsgid);
|
||
diagnostic_set_info (&diagnostic, gmsgid, &ap, &richloc,
|
||
(cxx_dialect == cxx98
|
||
? diagnostics::kind::pedwarn
|
||
: diagnostics::kind::warning));
|
||
diagnostic.m_option_id = option_id;
|
||
ret = diagnostic_report_diagnostic (global_dc, &diagnostic);
|
||
va_end (ap);
|
||
return ret;
|
||
}
|
||
|
||
/* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is what
|
||
we found when we tried to do the lookup. LOCATION is the location of
|
||
the NAME identifier. */
|
||
|
||
void
|
||
qualified_name_lookup_error (tree scope, tree name,
|
||
tree decl, location_t location)
|
||
{
|
||
if (scope == error_mark_node)
|
||
; /* We already complained. */
|
||
else if (TYPE_P (scope))
|
||
{
|
||
if (!COMPLETE_TYPE_P (scope)
|
||
&& !currently_open_class (scope))
|
||
error_at (location, "incomplete type %qT used in nested name specifier",
|
||
scope);
|
||
else if (TREE_CODE (decl) == TREE_LIST)
|
||
{
|
||
auto_diagnostic_group d;
|
||
error_at (location, "reference to %<%T::%D%> is ambiguous",
|
||
scope, name);
|
||
print_candidates (decl);
|
||
}
|
||
else
|
||
{
|
||
auto_diagnostic_group d;
|
||
name_hint hint;
|
||
if (SCOPED_ENUM_P (scope) && TREE_CODE (name) == IDENTIFIER_NODE)
|
||
hint = suggest_alternative_in_scoped_enum (name, scope);
|
||
if (const char *suggestion = hint.suggestion ())
|
||
{
|
||
gcc_rich_location richloc (location);
|
||
richloc.add_fixit_replace (suggestion);
|
||
error_at (&richloc,
|
||
"%qD is not a member of %qT; did you mean %qs?",
|
||
name, scope, suggestion);
|
||
}
|
||
else
|
||
error_at (location, "%qD is not a member of %qT", name, scope);
|
||
}
|
||
}
|
||
else if (scope != global_namespace)
|
||
{
|
||
auto_diagnostic_group d;
|
||
bool emit_fixit = true;
|
||
name_hint hint
|
||
= suggest_alternative_in_explicit_scope (location, name, scope);
|
||
if (!hint)
|
||
{
|
||
hint = suggest_alternatives_in_other_namespaces (location, name);
|
||
/* "location" is just the location of the name, not of the explicit
|
||
scope, and it's not easy to get at the latter, so we can't issue
|
||
fix-it hints for the suggestion. */
|
||
emit_fixit = false;
|
||
}
|
||
if (const char *suggestion = hint.suggestion ())
|
||
{
|
||
gcc_rich_location richloc (location);
|
||
if (emit_fixit)
|
||
richloc.add_fixit_replace (suggestion);
|
||
error_at (&richloc, "%qD is not a member of %qD; did you mean %qs?",
|
||
name, scope, suggestion);
|
||
}
|
||
else
|
||
error_at (location, "%qD is not a member of %qD", name, scope);
|
||
}
|
||
else
|
||
{
|
||
auto_diagnostic_group d;
|
||
name_hint hint = suggest_alternatives_for (location, name, true);
|
||
if (const char *suggestion = hint.suggestion ())
|
||
{
|
||
gcc_rich_location richloc (location);
|
||
richloc.add_fixit_replace (suggestion);
|
||
error_at (&richloc,
|
||
"%<::%D%> has not been declared; did you mean %qs?",
|
||
name, suggestion);
|
||
}
|
||
else
|
||
error_at (location, "%<::%D%> has not been declared", name);
|
||
}
|
||
}
|
||
|
||
/* C++-specific implementation of range_label::get_text () vfunc for
|
||
range_label_for_type_mismatch.
|
||
|
||
Compare with print_template_differences above. */
|
||
|
||
label_text
|
||
range_label_for_type_mismatch::get_text (unsigned /*range_idx*/) const
|
||
{
|
||
if (m_labelled_type == NULL_TREE)
|
||
return label_text::borrow (NULL);
|
||
|
||
const bool verbose = false;
|
||
const bool show_color = false;
|
||
|
||
const char *result;
|
||
if (m_other_type
|
||
&& comparable_template_types_p (m_labelled_type, m_other_type))
|
||
result = type_to_string_with_compare (m_labelled_type, m_other_type,
|
||
verbose, show_color,
|
||
nullptr, nullptr);
|
||
else
|
||
result = type_to_string (m_labelled_type, verbose, true, NULL, show_color);
|
||
|
||
/* Both of the above return GC-allocated buffers, so the caller mustn't
|
||
free them. */
|
||
return label_text::borrow (result);
|
||
}
|