1 /* Name mangling for the 3.0 -*- C++ -*- ABI.
2 Copyright (C) 2000-2022 Free Software Foundation, Inc.
3 Written by Alex Samuel <samuel@codesourcery.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file implements mangling of C++ names according to the IA64
22 C++ ABI specification. A mangled name encodes a function or
23 variable's name, scope, type, and/or template arguments into a text
24 identifier. This identifier is used as the function's or
25 variable's linkage name, to preserve compatibility between C++'s
26 language features (templates, scoping, and overloading) and C
29 Additionally, g++ uses mangled names internally. To support this,
30 mangling of types is allowed, even though the mangled name of a
31 type should not appear by itself as an exported name. Ditto for
32 uninstantiated templates.
34 The primary entry point for this module is mangle_decl, which
35 returns an identifier containing the mangled name for a decl.
36 Additional entry points are provided to build mangled names of
37 particular constructs when the appropriate decl for that construct
38 is not available. These are:
40 mangle_typeinfo_for_type: typeinfo data
41 mangle_typeinfo_string_for_type: typeinfo type name
42 mangle_vtbl_for_type: virtual table data
43 mangle_vtt_for_type: VTT data
44 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
45 mangle_thunk: thunk function or entry */
49 #include "coretypes.h"
51 #include "vtable-verify.h"
53 #include "stringpool.h"
55 #include "stor-layout.h"
59 /* Debugging support. */
61 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
63 #define DEBUG_MANGLE 0
66 /* Macros for tracing the write_* functions. */
68 # define MANGLE_TRACE(FN, INPUT) \
69 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
70 # define MANGLE_TRACE_TREE(FN, NODE) \
71 fprintf (stderr, " %-24s: %-24s (%p)\n", \
72 (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE))
74 # define MANGLE_TRACE(FN, INPUT)
75 # define MANGLE_TRACE_TREE(FN, NODE)
78 /* Nonzero if NODE is a class template-id. We can't rely on
79 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
80 that hard to distinguish A<T> from A, where A<T> is the type as
81 instantiated outside of the template, and A is the type used
82 without parameters inside the template. */
83 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
84 (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
85 || (CLASS_TYPE_P (NODE) \
86 && CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
87 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))
89 /* For deciding whether to set G.need_abi_warning, we need to consider both
90 warn_abi_version and flag_abi_compat_version. */
91 #define abi_warn_or_compat_version_crosses(N) \
92 (abi_version_crosses (N) || abi_compat_version_crosses (N))
94 /* And sometimes we can simplify the code path if we don't need to worry about
96 #define abi_flag_at_least(flag,N) (flag == 0 || flag >= N)
97 #define any_abi_below(N) \
98 (!abi_version_at_least (N) \
99 || !abi_flag_at_least (warn_abi_version, (N)) \
100 || !abi_flag_at_least (flag_abi_compat_version, (N)))
102 /* Things we only need one of. This module is not reentrant. */
103 struct GTY(()) globals
{
104 /* An array of the current substitution candidates, in the order
105 we've seen them. Contains NULLS, which correspond to module
107 vec
<tree
, va_gc
> *substitutions
;
109 /* The entity that is being mangled. */
110 tree
GTY ((skip
)) entity
;
112 /* How many parameter scopes we are inside. */
115 /* True if the mangling will be different in a future version of the
117 bool need_abi_warning
;
119 /* True if the mangling will be different in C++17 mode. */
120 bool need_cxx17_warning
;
122 /* True if we mangled a module name. */
126 static GTY (()) globals G
;
128 /* The obstack on which we build mangled names. */
129 static struct obstack
*mangle_obstack
;
131 /* The obstack on which we build mangled names that are not going to
132 be IDENTIFIER_NODEs. */
133 static struct obstack name_obstack
;
135 /* The first object on the name_obstack; we use this to free memory
136 allocated on the name_obstack. */
137 static void *name_base
;
139 /* Indices into subst_identifiers. These are identifiers used in
140 special substitution rules. */
148 SUBID_BASIC_IOSTREAM
,
151 substitution_identifier_index_t
;
153 /* For quick substitution checks, look up these common identifiers
155 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
157 /* Single-letter codes for builtin integer types, defined in
158 <builtin-type>. These are indexed by integer_type_kind values. */
160 integer_type_codes
[itk_none
] =
163 'a', /* itk_signed_char */
164 'h', /* itk_unsigned_char */
166 't', /* itk_unsigned_short */
168 'j', /* itk_unsigned_int */
170 'm', /* itk_unsigned_long */
171 'x', /* itk_long_long */
172 'y', /* itk_unsigned_long_long */
173 /* __intN types are handled separately */
174 '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0'
177 static tree
maybe_template_info (const tree
);
179 /* Functions for handling substitutions. */
181 static inline tree
canonicalize_for_substitution (tree
);
182 static void add_substitution (tree
);
183 static inline bool is_std_substitution (const tree
,
184 const substitution_identifier_index_t
);
185 static inline bool is_std_substitution_char (const tree
,
186 const substitution_identifier_index_t
);
187 static int find_substitution (tree
);
188 static void mangle_call_offset (const tree
, const tree
);
190 /* Functions for emitting mangled representations of things. */
192 static void write_mangled_name (const tree
, bool);
193 static void write_encoding (const tree
);
194 static void write_name (tree
, const int);
195 static void write_abi_tags (tree
);
196 static void write_unscoped_name (const tree
);
197 static void write_unscoped_template_name (const tree
);
198 static void write_nested_name (const tree
);
199 static void write_prefix (const tree
);
200 static void write_template_prefix (const tree
);
201 static void write_unqualified_name (tree
);
202 static void write_conversion_operator_name (const tree
);
203 static void write_source_name (tree
);
204 static void write_literal_operator_name (tree
);
205 static void write_unnamed_type_name (const tree
);
206 static void write_closure_type_name (const tree
);
207 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
209 static void write_number (unsigned HOST_WIDE_INT
, const int,
211 static void write_compact_number (int num
);
212 static void write_integer_cst (const tree
);
213 static void write_real_cst (const tree
);
214 static void write_identifier (const char *);
215 static void write_special_name_constructor (const tree
);
216 static void write_special_name_destructor (const tree
);
217 static void write_type (tree
);
218 static int write_CV_qualifiers_for_type (const tree
);
219 static void write_builtin_type (tree
);
220 static void write_function_type (const tree
);
221 static void write_bare_function_type (const tree
, const int, const tree
);
222 static void write_method_parms (tree
, const int, const tree
);
223 static void write_class_enum_type (const tree
);
224 static void write_template_args (tree
);
225 static void write_expression (tree
);
226 static void write_template_arg_literal (const tree
);
227 static void write_template_arg (tree
);
228 static void write_template_template_arg (const tree
);
229 static void write_array_type (const tree
);
230 static void write_pointer_to_member_type (const tree
);
231 static void write_template_param (const tree
);
232 static void write_template_template_param (const tree
);
233 static void write_substitution (const int);
234 static int discriminator_for_local_entity (tree
);
235 static int discriminator_for_string_literal (tree
, tree
);
236 static void write_discriminator (const int);
237 static void write_local_name (tree
, const tree
, const tree
);
238 static void dump_substitution_candidates (void);
239 static tree
mangle_decl_string (const tree
);
240 static void maybe_check_abi_tags (tree
, tree
= NULL_TREE
, int = 10);
241 static bool equal_abi_tags (tree
, tree
);
243 /* Control functions. */
245 static inline void start_mangling (const tree
);
246 static tree
mangle_special_for_type (const tree
, const char *);
248 /* Append a single character to the end of the mangled
250 #define write_char(CHAR) \
251 obstack_1grow (mangle_obstack, (CHAR))
253 /* Append a sized buffer to the end of the mangled representation. */
254 #define write_chars(CHAR, LEN) \
255 obstack_grow (mangle_obstack, (CHAR), (LEN))
257 /* Append a NUL-terminated string to the end of the mangled
259 #define write_string(STRING) \
260 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
262 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
263 same purpose (context, which may be a type) and value (template
264 decl). See write_template_prefix for more information on what this
266 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
267 (TREE_CODE (NODE1) == TREE_LIST \
268 && TREE_CODE (NODE2) == TREE_LIST \
269 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
270 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
271 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
272 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
274 /* Write out an unsigned quantity in base 10. */
275 #define write_unsigned_number(NUMBER) \
276 write_number ((NUMBER), /*unsigned_p=*/1, 10)
278 /* If DECL is a template instance (including the uninstantiated template
279 itself), return its TEMPLATE_INFO. Otherwise return NULL. */
282 maybe_template_info (const tree decl
)
284 if (TREE_CODE (decl
) == TYPE_DECL
)
286 /* TYPE_DECLs are handled specially. Look at its type to decide
287 if this is a template instantiation. */
288 const tree type
= TREE_TYPE (decl
);
290 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
291 return TYPE_TEMPLATE_INFO (type
);
295 /* Check if the template is a primary template. */
296 if (DECL_LANG_SPECIFIC (decl
) != NULL
297 && VAR_OR_FUNCTION_DECL_P (decl
)
298 && DECL_TEMPLATE_INFO (decl
)
299 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
300 return DECL_TEMPLATE_INFO (decl
);
303 /* It's not a template id. */
307 /* Produce debugging output of current substitution candidates. */
310 dump_substitution_candidates (void)
315 fprintf (stderr
, " ++ substitutions ");
316 FOR_EACH_VEC_ELT (*G
.substitutions
, i
, el
)
318 const char *name
= "???";
321 fprintf (stderr
, " ");
324 else if (DECL_P (el
))
325 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
326 else if (TREE_CODE (el
) == TREE_LIST
)
327 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
328 else if (TYPE_NAME (el
))
329 name
= TYPE_NAME_STRING (el
);
330 fprintf (stderr
, " S%d_ = ", i
- 1);
334 (CP_TYPE_RESTRICT_P (el
)
335 || CP_TYPE_VOLATILE_P (el
)
336 || CP_TYPE_CONST_P (el
)))
337 fprintf (stderr
, "CV-");
338 fprintf (stderr
, "%s (%s at %p)",
339 name
, get_tree_code_name (TREE_CODE (el
)), (void *) el
);
341 fprintf (stderr
, "\n");
345 /* <exception-spec> ::=
346 Do -- non-throwing exception specification
347 DO <expression> E -- computed (instantiation-dependent) noexcept
348 Dw <type>* E -- throw (types) */
351 write_exception_spec (tree spec
)
354 if (!spec
|| spec
== noexcept_false_spec
)
358 if (!flag_noexcept_type
)
360 G
.need_cxx17_warning
= true;
364 if (spec
== noexcept_true_spec
|| spec
== empty_except_spec
)
366 else if (tree expr
= TREE_PURPOSE (spec
))
368 /* noexcept (expr) */
369 gcc_assert (uses_template_parms (expr
));
371 write_expression (expr
);
376 /* throw (type-list) */
378 for (tree t
= spec
; t
; t
= TREE_CHAIN (t
))
379 write_type (TREE_VALUE (t
));
384 /* Both decls and types can be substitution candidates, but sometimes
385 they refer to the same thing. For instance, a TYPE_DECL and
386 RECORD_TYPE for the same class refer to the same thing, and should
387 be treated accordingly in substitutions. This function returns a
388 canonicalized tree node representing NODE that is used when adding
389 and substitution candidates and finding matches. */
392 canonicalize_for_substitution (tree node
)
394 /* For a TYPE_DECL, use the type instead. */
395 if (TREE_CODE (node
) == TYPE_DECL
)
396 node
= TREE_TYPE (node
);
398 && TYPE_CANONICAL (node
) != node
399 && TYPE_MAIN_VARIANT (node
) != node
)
402 /* Here we want to strip the topmost typedef only.
403 We need to do that so is_std_substitution can do proper
405 if (TREE_CODE (node
) == FUNCTION_TYPE
)
406 /* Use build_qualified_type and TYPE_QUALS here to preserve
407 the old buggy mangling of attribute noreturn with abi<5. */
408 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
411 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
412 cp_type_quals (node
));
413 if (FUNC_OR_METHOD_TYPE_P (node
))
415 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
416 tree r
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig
));
417 if (flag_noexcept_type
)
418 node
= build_exception_variant (node
, r
);
420 /* Set the warning flag if appropriate. */
421 write_exception_spec (r
);
427 /* Add NODE as a substitution candidate. NODE must not already be on
428 the list of candidates. */
431 add_substitution (tree node
)
436 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
437 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
439 /* Get the canonicalized substitution candidate for NODE. */
440 c
= canonicalize_for_substitution (node
);
441 if (DEBUG_MANGLE
&& c
!= node
)
442 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
443 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
446 /* Make sure NODE isn't already a candidate. */
452 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
455 gcc_assert (!(DECL_P (node
) && node
== candidate
));
456 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
457 && same_type_p (node
, candidate
)));
461 /* Put the decl onto the varray of substitution candidates. */
462 vec_safe_push (G
.substitutions
, node
);
465 dump_substitution_candidates ();
468 /* Helper function for find_substitution. Returns nonzero if NODE,
469 which may be a decl or a CLASS_TYPE, is a template-id with template
470 name of substitution_index[INDEX] in the ::std namespace, with
471 global module attachment. */
474 is_std_substitution (const tree node
,
475 const substitution_identifier_index_t index
)
482 type
= TREE_TYPE (node
);
485 else if (CLASS_TYPE_P (node
))
488 decl
= TYPE_NAME (node
);
491 /* These are not the droids you're looking for. */
494 if (!DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
)))
497 if (!(TYPE_LANG_SPECIFIC (type
) && TYPE_TEMPLATE_INFO (type
)))
500 tree tmpl
= TYPE_TI_TEMPLATE (type
);
501 if (DECL_NAME (tmpl
) != subst_identifiers
[index
])
504 if (modules_p () && get_originating_module (tmpl
, true) >= 0)
510 /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
511 which can be a decl or type. */
514 get_abi_tags (tree t
)
516 if (!t
|| TREE_CODE (t
) == NAMESPACE_DECL
)
519 if (DECL_P (t
) && DECL_DECLARES_TYPE_P (t
))
524 attrs
= TYPE_ATTRIBUTES (t
);
526 attrs
= DECL_ATTRIBUTES (t
);
528 tree tags
= lookup_attribute ("abi_tag", attrs
);
530 tags
= TREE_VALUE (tags
);
534 /* Helper function for find_substitution. Returns nonzero if NODE,
535 which may be a decl or a CLASS_TYPE, is the template-id
536 ::std::identifier<char>, where identifier is
537 substitution_index[INDEX]. */
540 is_std_substitution_char (const tree node
,
541 const substitution_identifier_index_t index
)
544 /* Check NODE's name is ::std::identifier. */
545 if (!is_std_substitution (node
, index
))
547 /* Figure out its template args. */
549 args
= DECL_TI_ARGS (node
);
550 else if (CLASS_TYPE_P (node
))
551 args
= CLASSTYPE_TI_ARGS (node
);
553 /* Oops, not a template. */
555 /* NODE's template arg list should be <char>. */
557 TREE_VEC_LENGTH (args
) == 1
558 && TREE_VEC_ELT (args
, 0) == char_type_node
;
561 /* Check whether a substitution should be used to represent NODE in
564 First, check standard special-case substitutions.
566 <substitution> ::= St
573 # ::std::basic_string
576 # ::std::basic_string<char,
577 ::std::char_traits<char>,
578 ::std::allocator<char> >
581 # ::std::basic_istream<char, ::std::char_traits<char> >
584 # ::std::basic_ostream<char, ::std::char_traits<char> >
587 # ::std::basic_iostream<char, ::std::char_traits<char> >
589 Then examine the stack of currently available substitution
590 candidates for entities appearing earlier in the same mangling
592 If a substitution is found, write its mangled representation and
593 return nonzero. If none is found, just return zero. */
596 find_substitution (tree node
)
599 const int size
= vec_safe_length (G
.substitutions
);
602 const char *abbr
= NULL
;
605 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
606 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
608 /* Obtain the canonicalized substitution representation for NODE.
609 This is what we'll compare against. */
610 node
= canonicalize_for_substitution (node
);
612 /* Check for builtin substitutions. */
614 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
615 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
617 /* Check for std::allocator. */
619 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
620 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
623 /* Check for std::basic_string. */
624 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
628 /* If this is a type (i.e. a fully-qualified template-id),
630 std::basic_string <char,
631 std::char_traits<char>,
632 std::allocator<char> > . */
633 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
634 && CLASSTYPE_USE_TEMPLATE (type
))
636 tree args
= CLASSTYPE_TI_ARGS (type
);
637 if (TREE_VEC_LENGTH (args
) == 3
638 && template_args_equal (TREE_VEC_ELT (args
, 0), char_type_node
)
639 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
641 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
647 /* Substitute for the template name only if this isn't a type. */
651 /* Check for basic_{i,o,io}stream. */
652 else if (TYPE_P (node
)
653 && cp_type_quals (type
) == TYPE_UNQUALIFIED
654 && CLASS_TYPE_P (type
)
655 && CLASSTYPE_USE_TEMPLATE (type
)
656 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
658 /* First, check for the template
659 args <char, std::char_traits<char> > . */
660 tree args
= CLASSTYPE_TI_ARGS (type
);
661 if (TREE_VEC_LENGTH (args
) == 2
662 && template_args_equal (TREE_VEC_ELT (args
, 0), char_type_node
)
663 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
666 /* Got them. Is this basic_istream? */
667 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
669 /* Or basic_ostream? */
670 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
672 /* Or basic_iostream? */
673 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
678 /* Check for namespace std. */
679 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
685 tree tags
= NULL_TREE
;
686 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
687 tags
= get_abi_tags (type
);
688 /* Now check the list of available substitutions for this mangling
691 for (i
= 0; i
< size
; ++i
)
692 if (tree candidate
= (*G
.substitutions
)[i
])
694 /* NODE is a matched to a candidate if it's the same decl node or
695 if it's the same type. */
696 if (decl
== candidate
697 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
698 && same_type_p (type
, candidate
))
699 || NESTED_TEMPLATE_MATCH (node
, candidate
))
701 write_substitution (i
);
707 /* No substitution found. */
713 /* If there are ABI tags on the abbreviation, it becomes
714 a substitution candidate. */
715 write_abi_tags (tags
);
716 add_substitution (node
);
721 /* Returns whether DECL's symbol name should be the plain unqualified-id
722 rather than a more complicated mangled name. */
725 unmangled_name_p (const tree decl
)
727 if (TREE_CODE (decl
) == FUNCTION_DECL
)
729 /* The names of `extern "C"' functions are not mangled. */
730 return (DECL_EXTERN_C_FUNCTION_P (decl
)
731 /* But overloaded operator names *are* mangled. */
732 && !DECL_OVERLOADED_OPERATOR_P (decl
));
734 else if (VAR_P (decl
))
736 /* static variables are mangled. */
737 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
740 /* extern "C" declarations aren't mangled. */
741 if (DECL_EXTERN_C_P (decl
))
744 /* Other variables at non-global scope are mangled. */
745 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
748 /* Variable template instantiations are mangled. */
749 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
750 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
753 /* Declarations with ABI tags are mangled. */
754 if (get_abi_tags (decl
))
757 // Declarations attached to a named module are mangled
758 if (modules_p () && get_originating_module (decl
, true) >= 0)
761 /* The names of non-static global variables aren't mangled. */
768 /* TOP_LEVEL is true, if this is being called at outermost level of
769 mangling. It should be false when mangling a decl appearing in an
770 expression within some other mangling.
772 <mangled-name> ::= _Z <encoding> */
775 write_mangled_name (const tree decl
, bool top_level
)
777 MANGLE_TRACE_TREE ("mangled-name", decl
);
779 check_abi_tags (decl
);
781 if (unmangled_name_p (decl
))
784 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
787 /* The standard notes: "The <encoding> of an extern "C"
788 function is treated like global-scope data, i.e. as its
789 <source-name> without a type." We cannot write
790 overloaded operators that way though, because it contains
791 characters invalid in assembler. */
793 write_source_name (DECL_NAME (decl
));
799 write_encoding (decl
);
803 /* Returns true if the return type of DECL is part of its signature, and
804 therefore its mangling. */
807 mangle_return_type_p (tree decl
)
809 return (!DECL_CONSTRUCTOR_P (decl
)
810 && !DECL_DESTRUCTOR_P (decl
)
811 && !DECL_CONV_FN_P (decl
)
812 && maybe_template_info (decl
));
815 /* <encoding> ::= <function name> <bare-function-type>
819 write_encoding (const tree decl
)
821 MANGLE_TRACE_TREE ("encoding", decl
);
823 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
825 /* For overloaded operators write just the mangled name
826 without arguments. */
827 if (DECL_OVERLOADED_OPERATOR_P (decl
))
828 write_name (decl
, /*ignore_local_scope=*/0);
830 write_source_name (DECL_NAME (decl
));
834 write_name (decl
, /*ignore_local_scope=*/0);
835 if (TREE_CODE (decl
) == FUNCTION_DECL
)
840 if (maybe_template_info (decl
))
842 fn_type
= get_mostly_instantiated_function_type (decl
);
843 /* FN_TYPE will not have parameter types for in-charge or
844 VTT parameters. Therefore, we pass NULL_TREE to
845 write_bare_function_type -- otherwise, it will get
846 confused about which artificial parameters to skip. */
851 fn_type
= TREE_TYPE (decl
);
855 write_bare_function_type (fn_type
,
856 mangle_return_type_p (decl
),
859 /* If this is a coroutine helper, then append an appropriate string to
861 if (tree ramp
= DECL_RAMP_FN (decl
))
863 if (DECL_ACTOR_FN (ramp
) == decl
)
864 write_string (JOIN_STR
"actor");
865 else if (DECL_DESTROY_FN (ramp
) == decl
)
866 write_string (JOIN_STR
"destroy");
873 /* Interface to substitution and identifier mangling, used by the
874 module name mangler. */
877 mangle_module_substitution (int v
)
879 write_substitution (v
- 1);
883 mangle_module_component (tree comp
, bool partition_p
)
888 write_source_name (comp
);
890 // Module substitutions use the same number-space as entity
891 // substitutions, but are orthogonal.
892 vec_safe_push (G
.substitutions
, NULL_TREE
);
893 return G
.substitutions
->length ();
896 /* If the outermost non-namespace context (including DECL itself) is
897 a module-linkage decl, mangle the module information. For module
898 global initializers we need to include the partition part.
900 <module-name> ::= <module-sub>
902 || <module-name> <module-sub>
903 <module-sub> :: W [P] <unqualified-name>
907 write_module (int m
, bool include_partition
)
910 mangle_module (m
, include_partition
);
914 maybe_write_module (tree decl
)
916 if (!DECL_NAMESPACE_SCOPE_P (decl
))
919 if (!TREE_PUBLIC (STRIP_TEMPLATE (decl
)))
922 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
925 int m
= get_originating_module (decl
, true);
927 write_module (m
, false);
930 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
931 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
934 decl_mangling_context (tree decl
)
936 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
938 if (tcontext
!= NULL_TREE
)
941 if (TREE_CODE (decl
) == TEMPLATE_DECL
942 && DECL_TEMPLATE_RESULT (decl
))
943 decl
= DECL_TEMPLATE_RESULT (decl
);
945 if (TREE_CODE (decl
) == TYPE_DECL
946 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
948 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
952 else if (template_type_parameter_p (decl
))
953 /* template type parms have no mangling context. */
956 tcontext
= CP_DECL_CONTEXT (decl
);
958 /* Ignore the artificial declare reduction functions. */
960 && TREE_CODE (tcontext
) == FUNCTION_DECL
961 && DECL_OMP_DECLARE_REDUCTION_P (tcontext
))
962 return decl_mangling_context (tcontext
);
967 /* <name> ::= <unscoped-name>
968 ::= <unscoped-template-name> <template-args>
972 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
973 called from <local-name>, which mangles the enclosing scope
974 elsewhere and then uses this function to mangle just the part
975 underneath the function scope. So don't use the <local-name>
976 production, to avoid an infinite recursion. */
979 write_name (tree decl
, const int ignore_local_scope
)
983 MANGLE_TRACE_TREE ("name", decl
);
985 if (TREE_CODE (decl
) == TYPE_DECL
)
987 /* In case this is a typedef, fish out the corresponding
988 TYPE_DECL for the main variant. */
989 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
992 context
= decl_mangling_context (decl
);
994 gcc_assert (context
!= NULL_TREE
);
996 if (abi_warn_or_compat_version_crosses (7)
997 && ignore_local_scope
998 && TREE_CODE (context
) == PARM_DECL
)
999 G
.need_abi_warning
= 1;
1001 /* A decl in :: or ::std scope is treated specially. The former is
1002 mangled using <unscoped-name> or <unscoped-template-name>, the
1003 latter with a special substitution. Also, a name that is
1004 directly in a local function scope is also mangled with
1005 <unscoped-name> rather than a full <nested-name>. */
1006 if (context
== global_namespace
1007 || DECL_NAMESPACE_STD_P (context
)
1008 || (ignore_local_scope
1009 && (TREE_CODE (context
) == FUNCTION_DECL
1010 || (abi_version_at_least (7)
1011 && TREE_CODE (context
) == PARM_DECL
))))
1013 /* Is this a template instance? */
1014 if (tree info
= maybe_template_info (decl
))
1016 /* Yes: use <unscoped-template-name>. */
1017 write_unscoped_template_name (TI_TEMPLATE (info
));
1018 write_template_args (TI_ARGS (info
));
1021 /* Everything else gets an <unqualified-name>. */
1022 write_unscoped_name (decl
);
1026 /* Handle local names, unless we asked not to (that is, invoked
1027 under <local-name>, to handle only the part of the name under
1028 the local scope). */
1029 if (!ignore_local_scope
)
1031 /* Scan up the list of scope context, looking for a
1032 function. If we find one, this entity is in local
1033 function scope. local_entity tracks context one scope
1034 level down, so it will contain the element that's
1035 directly in that function's scope, either decl or one of
1036 its enclosing scopes. */
1037 tree local_entity
= decl
;
1038 while (context
!= global_namespace
)
1040 /* Make sure we're always dealing with decls. */
1041 if (TYPE_P (context
))
1042 context
= TYPE_NAME (context
);
1043 /* Is this a function? */
1044 if (TREE_CODE (context
) == FUNCTION_DECL
1045 || TREE_CODE (context
) == PARM_DECL
)
1047 /* Yes, we have local scope. Use the <local-name>
1048 production for the innermost function scope. */
1049 write_local_name (context
, local_entity
, decl
);
1052 /* Up one scope level. */
1053 local_entity
= context
;
1054 context
= decl_mangling_context (context
);
1057 /* No local scope found? Fall through to <nested-name>. */
1060 /* Other decls get a <nested-name> to encode their scope. */
1061 write_nested_name (decl
);
1065 /* <unscoped-name> ::= <unqualified-name>
1066 ::= St <unqualified-name> # ::std:: */
1069 write_unscoped_name (const tree decl
)
1071 tree context
= decl_mangling_context (decl
);
1073 MANGLE_TRACE_TREE ("unscoped-name", decl
);
1075 /* Is DECL in ::std? */
1076 if (DECL_NAMESPACE_STD_P (context
))
1078 write_string ("St");
1079 write_unqualified_name (decl
);
1083 /* If not, it should be either in the global namespace, or directly
1084 in a local function scope. A lambda can also be mangled in the
1085 scope of a default argument. */
1086 gcc_assert (context
== global_namespace
1087 || TREE_CODE (context
) == PARM_DECL
1088 || TREE_CODE (context
) == FUNCTION_DECL
);
1090 write_unqualified_name (decl
);
1094 /* <unscoped-template-name> ::= <unscoped-name>
1095 ::= <substitution> */
1098 write_unscoped_template_name (const tree decl
)
1100 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
1102 if (find_substitution (decl
))
1104 write_unscoped_name (decl
);
1105 add_substitution (decl
);
1108 /* Write the nested name, including CV-qualifiers, of DECL.
1110 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1111 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1113 <ref-qualifier> ::= R # & ref-qualifier
1114 ::= O # && ref-qualifier
1115 <CV-qualifiers> ::= [r] [V] [K] */
1118 write_nested_name (const tree decl
)
1120 MANGLE_TRACE_TREE ("nested-name", decl
);
1124 /* Write CV-qualifiers, if this is a member function. */
1125 if (TREE_CODE (decl
) == FUNCTION_DECL
1126 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1128 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1130 if (DECL_CONST_MEMFUNC_P (decl
))
1132 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1134 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1141 /* Is this a template instance? */
1142 if (tree info
= maybe_template_info (decl
))
1144 /* Yes, use <template-prefix>. */
1145 write_template_prefix (decl
);
1146 write_template_args (TI_ARGS (info
));
1148 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1149 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1151 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1152 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1154 write_template_prefix (decl
);
1155 write_template_args (TREE_OPERAND (name
, 1));
1159 write_prefix (decl_mangling_context (decl
));
1160 write_unqualified_name (decl
);
1165 /* No, just use <prefix> */
1166 write_prefix (decl_mangling_context (decl
));
1167 write_unqualified_name (decl
);
1172 /* <prefix> ::= <prefix> <unqualified-name>
1173 ::= <template-param>
1174 ::= <template-prefix> <template-args>
1177 ::= <substitution> */
1180 write_prefix (const tree node
)
1185 || node
== global_namespace
)
1188 MANGLE_TRACE_TREE ("prefix", node
);
1190 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1196 if (find_substitution (node
))
1199 tree template_info
= NULL_TREE
;
1202 /* If this is a function or parm decl, that means we've hit function
1203 scope, so this prefix must be for a local name. In this
1204 case, we're under the <local-name> production, which encodes
1205 the enclosing function scope elsewhere. So don't continue
1207 if (TREE_CODE (node
) == FUNCTION_DECL
1208 || TREE_CODE (node
) == PARM_DECL
)
1212 template_info
= maybe_template_info (decl
);
1216 /* Node is a type. */
1217 decl
= TYPE_NAME (node
);
1218 /* The DECL might not point at the node. */
1219 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1220 template_info
= TYPE_TEMPLATE_INFO (node
);
1223 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1224 write_template_param (node
);
1225 else if (template_info
)
1228 write_template_prefix (decl
);
1229 write_template_args (TI_ARGS (template_info
));
1231 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1233 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1234 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1236 write_template_prefix (decl
);
1237 write_template_args (TREE_OPERAND (name
, 1));
1241 write_prefix (decl_mangling_context (decl
));
1242 write_unqualified_name (decl
);
1246 /* Not templated. */
1248 write_prefix (decl_mangling_context (decl
));
1249 write_unqualified_name (decl
);
1251 || TREE_CODE (decl
) == FIELD_DECL
)
1253 /* <data-member-prefix> := <member source-name> M */
1259 add_substitution (node
);
1262 /* <template-prefix> ::= <prefix> <template component>
1263 ::= <template-param>
1264 ::= <substitution> */
1267 write_template_prefix (const tree node
)
1269 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1270 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1271 tree context
= decl_mangling_context (decl
);
1275 MANGLE_TRACE_TREE ("template-prefix", node
);
1277 /* Find the template decl. */
1278 if (tree info
= maybe_template_info (decl
))
1279 templ
= TI_TEMPLATE (info
);
1280 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1281 /* For a typename type, all we have is the name. */
1282 templ
= DECL_NAME (decl
);
1285 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1287 templ
= TYPE_TI_TEMPLATE (type
);
1290 /* For a member template, though, the template name for the
1291 innermost name must have all the outer template levels
1292 instantiated. For instance, consider
1294 template<typename T> struct Outer {
1295 template<typename U> struct Inner {};
1298 The template name for `Inner' in `Outer<int>::Inner<float>' is
1299 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1300 levels separately, so there's no TEMPLATE_DECL available for this
1301 (there's only `Outer<T>::Inner<U>').
1303 In order to get the substitutions right, we create a special
1304 TREE_LIST to represent the substitution candidate for a nested
1305 template. The TREE_PURPOSE is the template's context, fully
1306 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1309 So, for the example above, `Outer<int>::Inner' is represented as a
1310 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1311 and whose value is `Outer<T>::Inner<U>'. */
1312 if (context
&& TYPE_P (context
))
1313 substitution
= build_tree_list (context
, templ
);
1315 substitution
= templ
;
1317 if (find_substitution (substitution
))
1320 if (TREE_TYPE (templ
)
1321 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1322 write_template_param (TREE_TYPE (templ
));
1325 write_prefix (context
);
1326 write_unqualified_name (decl
);
1329 add_substitution (substitution
);
1332 /* As the list of identifiers for the structured binding declaration
1333 DECL is likely gone, try to recover the DC <source-name>+ E portion
1334 from its mangled name. Return pointer to the DC and set len to
1335 the length up to and including the terminating E. On failure
1339 find_decomp_unqualified_name (tree decl
, size_t *len
)
1341 const char *p
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1342 const char *end
= p
+ IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
1343 bool nested
= false;
1344 if (!startswith (p
, "_Z"))
1347 if (startswith (p
, "St"))
1353 while (ISDIGIT (p
[0]))
1356 long num
= strtol (p
, &e
, 10);
1357 if (num
>= 1 && num
< end
- e
)
1363 if (!startswith (p
, "DC"))
1377 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1378 mangled through special entry points.
1380 <unqualified-name> ::= [<module-name>] <operator-name>
1382 ::= [<module-name>] <source-name>
1383 ::= [<module-name>] <unnamed-type-name>
1384 ::= <local-source-name>
1386 <local-source-name> ::= L <source-name> <discriminator> */
1389 write_unqualified_id (tree identifier
)
1391 if (IDENTIFIER_CONV_OP_P (identifier
))
1392 write_conversion_operator_name (TREE_TYPE (identifier
));
1393 else if (IDENTIFIER_OVL_OP_P (identifier
))
1395 const ovl_op_info_t
*ovl_op
= IDENTIFIER_OVL_OP_INFO (identifier
);
1396 write_string (ovl_op
->mangled_name
);
1398 else if (UDLIT_OPER_P (identifier
))
1399 write_literal_operator_name (identifier
);
1401 write_source_name (identifier
);
1405 write_unqualified_name (tree decl
)
1407 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1410 maybe_write_module (decl
);
1412 if (identifier_p (decl
))
1414 write_unqualified_id (decl
);
1420 if (DECL_NAME (decl
) == NULL_TREE
)
1423 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1424 const char *decomp_str
= NULL
;
1425 size_t decomp_len
= 0;
1427 && DECL_DECOMPOSITION_P (decl
)
1428 && DECL_NAME (decl
) == NULL_TREE
1429 && DECL_NAMESPACE_SCOPE_P (decl
))
1430 decomp_str
= find_decomp_unqualified_name (decl
, &decomp_len
);
1432 write_chars (decomp_str
, decomp_len
);
1434 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1436 else if (DECL_DECLARES_FUNCTION_P (decl
))
1439 if (DECL_CONSTRUCTOR_P (decl
))
1440 write_special_name_constructor (decl
);
1441 else if (DECL_DESTRUCTOR_P (decl
))
1442 write_special_name_destructor (decl
);
1443 else if (DECL_CONV_FN_P (decl
))
1445 /* Conversion operator. Handle it right here.
1446 <operator> ::= cv <type> */
1448 if (maybe_template_info (decl
))
1451 fn_type
= get_mostly_instantiated_function_type (decl
);
1452 type
= TREE_TYPE (fn_type
);
1454 else if (FNDECL_USED_AUTO (decl
))
1455 type
= DECL_SAVED_AUTO_RETURN_TYPE (decl
);
1457 type
= DECL_CONV_FN_TYPE (decl
);
1458 write_conversion_operator_name (type
);
1460 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1463 if (!(t
= DECL_RAMP_FN (decl
)))
1465 const char *mangled_name
1466 = (ovl_op_info
[DECL_ASSIGNMENT_OPERATOR_P (t
)]
1467 [DECL_OVERLOADED_OPERATOR_CODE_RAW (t
)].mangled_name
);
1468 write_string (mangled_name
);
1470 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1471 write_literal_operator_name (DECL_NAME (decl
));
1478 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1479 && DECL_NAMESPACE_SCOPE_P (decl
)
1480 && decl_linkage (decl
) == lk_internal
)
1482 MANGLE_TRACE_TREE ("local-source-name", decl
);
1484 write_source_name (DECL_NAME (decl
));
1485 /* The default discriminator is 1, and that's all we ever use,
1486 so there's no code to output one here. */
1490 tree type
= TREE_TYPE (decl
);
1492 if (TREE_CODE (decl
) == TYPE_DECL
1493 && TYPE_UNNAMED_P (type
))
1494 write_unnamed_type_name (type
);
1495 else if (TREE_CODE (decl
) == TYPE_DECL
&& LAMBDA_TYPE_P (type
))
1496 write_closure_type_name (type
);
1498 write_source_name (DECL_NAME (decl
));
1501 /* We use the ABI tags from the primary class template, ignoring tags on any
1502 specializations. This is necessary because C++ doesn't require a
1503 specialization to be declared before it is used unless the use requires a
1504 complete type, but we need to get the tags right on incomplete types as
1506 if (tree tmpl
= most_general_template (decl
))
1508 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1509 if (res
== NULL_TREE
)
1510 /* UNBOUND_CLASS_TEMPLATE. */;
1511 else if (DECL_DECLARES_TYPE_P (decl
))
1513 else if (any_abi_below (11))
1515 /* ABI v10 implicit tags on the template. */
1516 tree mtags
= missing_abi_tags (res
);
1517 /* Explicit tags on the template. */
1518 tree ttags
= get_abi_tags (res
);
1519 /* Tags on the instantiation. */
1520 tree dtags
= get_abi_tags (decl
);
1522 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1523 G
.need_abi_warning
= 1;
1525 /* Add the v10 tags to the explicit tags now. */
1526 mtags
= chainon (mtags
, ttags
);
1528 if (!G
.need_abi_warning
1529 && abi_warn_or_compat_version_crosses (11)
1530 && !equal_abi_tags (dtags
, mtags
))
1531 G
.need_abi_warning
= 1;
1533 if (!abi_version_at_least (10))
1534 /* In abi <10, we only got the explicit tags. */
1536 else if (flag_abi_version
== 10)
1538 /* In ABI 10, we want explict and implicit tags. */
1539 write_abi_tags (mtags
);
1545 tree tags
= get_abi_tags (decl
);
1546 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1547 && any_abi_below (11))
1548 if (tree mtags
= missing_abi_tags (decl
))
1550 if (abi_warn_or_compat_version_crosses (11))
1551 G
.need_abi_warning
= true;
1552 if (!abi_version_at_least (11))
1553 tags
= chainon (mtags
, tags
);
1555 write_abi_tags (tags
);
1558 /* Write the unqualified-name for a conversion operator to TYPE. */
1561 write_conversion_operator_name (const tree type
)
1563 write_string ("cv");
1567 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1569 <source-name> ::= </length/ number> <identifier> */
1572 write_source_name (tree identifier
)
1574 MANGLE_TRACE_TREE ("source-name", identifier
);
1576 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1577 write_identifier (IDENTIFIER_POINTER (identifier
));
1580 /* Compare two TREE_STRINGs like strcmp. */
1583 tree_string_cmp (const void *p1
, const void *p2
)
1587 tree s1
= *(const tree
*)p1
;
1588 tree s2
= *(const tree
*)p2
;
1589 return strcmp (TREE_STRING_POINTER (s1
),
1590 TREE_STRING_POINTER (s2
));
1593 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1595 static vec
<tree
, va_gc
> *
1596 sorted_abi_tags (tree tags
)
1598 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1600 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1602 if (ABI_TAG_IMPLICIT (t
))
1604 tree str
= TREE_VALUE (t
);
1605 vec_safe_push (vec
, str
);
1608 vec
->qsort (tree_string_cmp
);
1613 /* ID is the name of a function or type with abi_tags attribute TAGS.
1614 Write out the name, suitably decorated. */
1617 write_abi_tags (tree tags
)
1619 if (tags
== NULL_TREE
)
1622 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1624 unsigned i
; tree str
;
1625 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1628 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1629 write_identifier (TREE_STRING_POINTER (str
));
1632 release_tree_vector (vec
);
1635 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1638 equal_abi_tags (tree t1
, tree t2
)
1640 releasing_vec v1
= sorted_abi_tags (t1
);
1641 releasing_vec v2
= sorted_abi_tags (t2
);
1643 unsigned len1
= v1
->length();
1644 if (len1
!= v2
->length())
1646 for (unsigned i
= 0; i
< len1
; ++i
)
1647 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1652 /* Write a user-defined literal operator.
1653 ::= li <source-name> # "" <source-name>
1654 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1657 write_literal_operator_name (tree identifier
)
1659 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1660 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1661 write_unsigned_number (strlen (suffix
));
1662 write_identifier (suffix
);
1665 /* Encode 0 as _, and 1+ as n-1_. */
1668 write_compact_number (int num
)
1670 gcc_checking_assert (num
>= 0);
1672 write_unsigned_number (num
- 1);
1676 /* Return how many unnamed types precede TYPE in its enclosing class. */
1679 nested_anon_class_index (tree type
)
1682 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1683 for (; member
; member
= DECL_CHAIN (member
))
1684 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1686 tree memtype
= TREE_TYPE (member
);
1687 if (memtype
== type
)
1689 else if (TYPE_UNNAMED_P (memtype
))
1699 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1702 write_unnamed_type_name (const tree type
)
1705 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1707 if (TYPE_FUNCTION_SCOPE_P (type
))
1708 discriminator
= discriminator_for_local_entity (TYPE_NAME (type
));
1709 else if (TYPE_CLASS_SCOPE_P (type
))
1710 discriminator
= nested_anon_class_index (type
);
1713 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1714 /* Just use the old mangling at namespace scope. */
1715 write_source_name (TYPE_IDENTIFIER (type
));
1719 write_string ("Ut");
1720 write_compact_number (discriminator
);
1723 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1724 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1727 write_closure_type_name (const tree type
)
1729 tree fn
= lambda_function (type
);
1730 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1731 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1733 MANGLE_TRACE_TREE ("closure-type-name", type
);
1735 write_string ("Ul");
1736 write_method_parms (parms
, /*method_p=*/1, fn
);
1738 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1741 /* Convert NUMBER to ascii using base BASE and generating at least
1742 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1743 into which to store the characters. Returns the number of
1744 characters generated (these will be laid out in advance of where
1748 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1749 char *buffer
, const unsigned int min_digits
)
1751 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1752 unsigned digits
= 0;
1756 unsigned HOST_WIDE_INT d
= number
/ base
;
1758 *--buffer
= base_digits
[number
- d
* base
];
1762 while (digits
< min_digits
)
1764 *--buffer
= base_digits
[0];
1770 /* Non-terminal <number>.
1772 <number> ::= [n] </decimal integer/> */
1775 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1776 const unsigned int base
)
1778 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1781 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1784 number
= -((HOST_WIDE_INT
) number
);
1786 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1787 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1790 /* Write out an integral CST in decimal. Most numbers are small, and
1791 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1792 bigger than that, which we must deal with. */
1795 write_integer_cst (const tree cst
)
1797 int sign
= tree_int_cst_sgn (cst
);
1798 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1799 if (!wi::fits_uhwi_p (abs_value
))
1801 /* A bignum. We do this in chunks, each of which fits in a
1803 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1804 unsigned HOST_WIDE_INT chunk
;
1805 unsigned chunk_digits
;
1806 char *ptr
= buffer
+ sizeof (buffer
);
1811 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1816 if (sizeof (HOST_WIDE_INT
) >= 8)
1818 /* It is at least 64 bits, so 10^18 is representable. */
1823 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1824 base
= build_int_cstu (type
, chunk
);
1825 n
= wide_int_to_tree (type
, wi::to_wide (cst
));
1830 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1834 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1835 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1838 done
= integer_zerop (d
);
1839 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1840 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1841 done
? 1 : chunk_digits
);
1847 write_chars (ptr
, count
);
1854 write_unsigned_number (abs_value
.to_uhwi ());
1858 /* Write out a floating-point literal.
1860 "Floating-point literals are encoded using the bit pattern of the
1861 target processor's internal representation of that number, as a
1862 fixed-length lowercase hexadecimal string, high-order bytes first
1863 (even if the target processor would store low-order bytes first).
1864 The "n" prefix is not used for floating-point literals; the sign
1865 bit is encoded with the rest of the number.
1867 Here are some examples, assuming the IEEE standard representation
1868 for floating point numbers. (Spaces are for readability, not
1869 part of the encoding.)
1872 -1.0f Lf bf80 0000 E
1873 1.17549435e-38f Lf 0080 0000 E
1874 1.40129846e-45f Lf 0000 0001 E
1875 0.0f Lf 0000 0000 E"
1877 Caller is responsible for the Lx and the E. */
1879 write_real_cst (const tree value
)
1881 long target_real
[4]; /* largest supported float */
1882 /* Buffer for eight hex digits in a 32-bit number but big enough
1883 even for 64-bit long to avoid warnings. */
1887 tree type
= TREE_TYPE (value
);
1888 int words
= GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type
)) / 32;
1890 real_to_target (target_real
, &TREE_REAL_CST (value
),
1893 /* The value in target_real is in the target word order,
1894 so we must write it out backward if that happens to be
1895 little-endian. write_number cannot be used, it will
1896 produce uppercase. */
1897 if (FLOAT_WORDS_BIG_ENDIAN
)
1898 i
= 0, limit
= words
, dir
= 1;
1900 i
= words
- 1, limit
= -1, dir
= -1;
1902 for (; i
!= limit
; i
+= dir
)
1904 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1905 write_chars (buffer
, 8);
1909 /* Non-terminal <identifier>.
1911 <identifier> ::= </unqualified source code identifier> */
1914 write_identifier (const char *identifier
)
1916 MANGLE_TRACE ("identifier", identifier
);
1917 write_string (identifier
);
1920 /* Handle constructor productions of non-terminal <special-name>.
1921 CTOR is a constructor FUNCTION_DECL.
1923 <special-name> ::= C1 # complete object constructor
1924 ::= C2 # base object constructor
1925 ::= C3 # complete object allocating constructor
1927 Currently, allocating constructors are never used. */
1930 write_special_name_constructor (const tree ctor
)
1933 bool new_inh
= (flag_new_inheriting_ctors
1934 && DECL_INHERITED_CTOR (ctor
));
1937 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1939 /* This is the old-style "[unified]" constructor.
1940 In some cases, we may emit this function and call
1941 it from the clones in order to share code and save space. */
1942 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1946 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1950 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1953 /* Handle destructor productions of non-terminal <special-name>.
1954 DTOR is a destructor FUNCTION_DECL.
1956 <special-name> ::= D0 # deleting (in-charge) destructor
1957 ::= D1 # complete object (in-charge) destructor
1958 ::= D2 # base object (not-in-charge) destructor */
1961 write_special_name_destructor (const tree dtor
)
1963 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1964 write_string ("D0");
1965 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1966 write_string ("D2");
1967 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1968 /* This is the old-style "[unified]" destructor.
1969 In some cases, we may emit this function and call
1970 it from the clones in order to share code and save space. */
1971 write_string ("D4");
1974 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1975 write_string ("D1");
1979 /* Return the discriminator for ENTITY appearing inside
1980 FUNCTION. The discriminator is the lexical ordinal of VAR or TYPE among
1981 entities with the same name and kind in the same FUNCTION. */
1984 discriminator_for_local_entity (tree entity
)
1986 if (!DECL_LANG_SPECIFIC (entity
))
1988 /* Some decls, like __FUNCTION__, don't need a discriminator. */
1989 gcc_checking_assert (DECL_ARTIFICIAL (entity
));
1992 else if (tree disc
= DECL_DISCRIMINATOR (entity
))
1993 return TREE_INT_CST_LOW (disc
);
1995 /* The first entity with a particular name doesn't get
1996 DECL_DISCRIMINATOR set up. */
2000 /* Return the discriminator for STRING, a string literal used inside
2001 FUNCTION. The discriminator is the lexical ordinal of STRING among
2002 string literals used in FUNCTION. */
2005 discriminator_for_string_literal (tree
/*function*/,
2008 /* For now, we don't discriminate amongst string literals. */
2012 /* <discriminator> := _ <number> # when number < 10
2013 := __ <number> _ # when number >= 10
2015 The discriminator is used only for the second and later occurrences
2016 of the same name within a single function. In this case <number> is
2017 n - 2, if this is the nth occurrence, in lexical order. */
2020 write_discriminator (const int discriminator
)
2022 /* If discriminator is zero, don't write anything. Otherwise... */
2023 if (discriminator
> 0)
2026 if (discriminator
- 1 >= 10)
2028 if (abi_warn_or_compat_version_crosses (11))
2029 G
.need_abi_warning
= 1;
2030 if (abi_version_at_least (11))
2033 write_unsigned_number (discriminator
- 1);
2034 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
2039 /* Mangle the name of a function-scope entity. FUNCTION is the
2040 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
2041 default argument scope. ENTITY is the decl for the entity itself.
2042 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
2043 either ENTITY itself or an enclosing scope of ENTITY.
2045 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
2046 := Z <function encoding> E s [<discriminator>]
2047 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
2050 write_local_name (tree function
, const tree local_entity
,
2053 tree parm
= NULL_TREE
;
2055 MANGLE_TRACE_TREE ("local-name", entity
);
2057 if (TREE_CODE (function
) == PARM_DECL
)
2060 function
= DECL_CONTEXT (parm
);
2064 write_encoding (function
);
2067 /* For this purpose, parameters are numbered from right-to-left. */
2070 int i
= list_length (parm
);
2072 write_compact_number (i
- 1);
2075 if (TREE_CODE (entity
) == STRING_CST
)
2078 write_discriminator (discriminator_for_string_literal (function
,
2083 /* Now the <entity name>. Let write_name know its being called
2084 from <local-name>, so it doesn't try to process the enclosing
2085 function scope again. */
2086 write_name (entity
, /*ignore_local_scope=*/1);
2087 if (DECL_DISCRIMINATOR_P (local_entity
)
2088 && !(TREE_CODE (local_entity
) == TYPE_DECL
2089 && TYPE_ANON_P (TREE_TYPE (local_entity
))))
2090 write_discriminator (discriminator_for_local_entity (local_entity
));
2094 /* Non-terminals <type> and <CV-qualifier>.
2096 <type> ::= <builtin-type>
2098 ::= <class-enum-type>
2100 ::= <pointer-to-member-type>
2101 ::= <template-param>
2104 ::= P <type> # pointer-to
2105 ::= R <type> # reference-to
2106 ::= C <type> # complex pair (C 2000)
2107 ::= G <type> # imaginary (C 2000) [not supported]
2108 ::= U <source-name> <type> # vendor extended type qualifier
2112 <type> ::= RR <type> # rvalue reference-to
2113 <type> ::= Dt <expression> # decltype of an id-expression or
2114 # class member access
2115 <type> ::= DT <expression> # decltype of an expression
2116 <type> ::= Dn # decltype of nullptr
2118 TYPE is a type node. */
2121 write_type (tree type
)
2123 /* This gets set to nonzero if TYPE turns out to be a (possibly
2124 CV-qualified) builtin type. */
2125 int is_builtin_type
= 0;
2127 MANGLE_TRACE_TREE ("type", type
);
2129 if (type
== error_mark_node
)
2132 type
= canonicalize_for_substitution (type
);
2133 if (find_substitution (type
))
2137 if (write_CV_qualifiers_for_type (type
) > 0)
2138 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2139 mangle the unqualified type. The recursive call is needed here
2140 since both the qualified and unqualified types are substitution
2143 tree t
= TYPE_MAIN_VARIANT (type
);
2144 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2146 tree attrs
= NULL_TREE
;
2147 if (tx_safe_fn_type_p (type
))
2148 attrs
= tree_cons (get_identifier ("transaction_safe"),
2150 t
= cp_build_type_attribute_variant (t
, attrs
);
2152 gcc_assert (t
!= type
);
2153 if (FUNC_OR_METHOD_TYPE_P (t
))
2155 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2156 if (flag_noexcept_type
)
2158 tree r
= TYPE_RAISES_EXCEPTIONS (type
);
2159 t
= build_exception_variant (t
, r
);
2161 if (abi_version_at_least (8)
2162 || type
== TYPE_MAIN_VARIANT (type
))
2163 /* Avoid adding the unqualified function type as a substitution. */
2164 write_function_type (t
);
2167 if (abi_warn_or_compat_version_crosses (8))
2168 G
.need_abi_warning
= 1;
2173 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2174 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2175 so that the cv-qualification of the element type is available
2176 in write_array_type. */
2177 write_array_type (type
);
2180 tree type_orig
= type
;
2182 /* See through any typedefs. */
2183 type
= TYPE_MAIN_VARIANT (type
);
2184 if (FUNC_OR_METHOD_TYPE_P (type
))
2185 type
= cxx_copy_lang_qualifiers (type
, type_orig
);
2187 /* According to the C++ ABI, some library classes are passed the
2188 same as the scalar type of their single member and use the same
2190 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2191 type
= TREE_TYPE (first_field (type
));
2193 if (TYPE_PTRDATAMEM_P (type
))
2194 write_pointer_to_member_type (type
);
2197 /* Handle any target-specific fundamental types. */
2198 const char *target_mangling
2199 = targetm
.mangle_type (type_orig
);
2201 if (target_mangling
)
2203 write_string (target_mangling
);
2204 /* Add substitutions for types other than fundamental
2206 if (!VOID_TYPE_P (type
)
2207 && TREE_CODE (type
) != INTEGER_TYPE
2208 && TREE_CODE (type
) != REAL_TYPE
2209 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2210 add_substitution (type
);
2214 switch (TREE_CODE (type
))
2218 case INTEGER_TYPE
: /* Includes wchar_t. */
2220 case FIXED_POINT_TYPE
:
2222 /* If this is a typedef, TYPE may not be one of
2223 the standard builtin type nodes, but an alias of one. Use
2224 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2225 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2232 write_type (TREE_TYPE (type
));
2237 write_function_type (type
);
2243 /* A pointer-to-member function is represented as a special
2244 RECORD_TYPE, so check for this first. */
2245 if (TYPE_PTRMEMFUNC_P (type
))
2246 write_pointer_to_member_type (type
);
2248 write_class_enum_type (type
);
2252 case UNBOUND_CLASS_TEMPLATE
:
2253 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2254 ordinary nested names. */
2255 write_nested_name (TYPE_STUB_DECL (type
));
2259 case REFERENCE_TYPE
:
2260 if (TYPE_PTR_P (type
))
2262 else if (TYPE_REF_IS_RVALUE (type
))
2267 tree target
= TREE_TYPE (type
);
2268 /* Attribute const/noreturn are not reflected in mangling.
2269 We strip them here rather than at a lower level because
2270 a typedef or template argument can have function type
2271 with function-cv-quals (that use the same representation),
2272 but you can't have a pointer/reference to such a type. */
2273 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2275 if (abi_warn_or_compat_version_crosses (5)
2276 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2277 G
.need_abi_warning
= 1;
2278 if (abi_version_at_least (5))
2279 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2281 write_type (target
);
2285 case TEMPLATE_TYPE_PARM
:
2288 if (AUTO_IS_DECLTYPE (type
))
2289 write_identifier ("Dc");
2291 write_identifier ("Da");
2296 case TEMPLATE_PARM_INDEX
:
2297 write_template_param (type
);
2300 case TEMPLATE_TEMPLATE_PARM
:
2301 write_template_template_param (type
);
2304 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2305 write_template_template_param (type
);
2307 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2311 if (abi_version_at_least (4))
2313 write_string ("Dv");
2314 /* Non-constant vector size would be encoded with
2315 _ expression, but we don't support that yet. */
2316 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
)
2321 write_string ("U8__vector");
2322 if (abi_warn_or_compat_version_crosses (4))
2323 G
.need_abi_warning
= 1;
2324 write_type (TREE_TYPE (type
));
2327 case TYPE_PACK_EXPANSION
:
2328 write_string ("Dp");
2329 write_type (PACK_EXPANSION_PATTERN (type
));
2333 /* These shouldn't make it into mangling. */
2334 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2335 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2337 /* In ABI <5, we stripped decltype of a plain decl. */
2338 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2340 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2341 tree etype
= NULL_TREE
;
2342 switch (TREE_CODE (expr
))
2349 case TEMPLATE_PARM_INDEX
:
2350 etype
= TREE_TYPE (expr
);
2357 if (etype
&& !type_uses_auto (etype
))
2359 if (abi_warn_or_compat_version_crosses (5))
2360 G
.need_abi_warning
= 1;
2361 if (!abi_version_at_least (5))
2370 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2374 ++cp_unevaluated_operand
;
2375 write_expression (DECLTYPE_TYPE_EXPR (type
));
2376 --cp_unevaluated_operand
;
2381 write_string ("Dn");
2382 if (abi_version_at_least (7))
2384 if (abi_warn_or_compat_version_crosses (7))
2385 G
.need_abi_warning
= 1;
2389 sorry ("mangling %<typeof%>, use %<decltype%> instead");
2392 case UNDERLYING_TYPE
:
2393 sorry ("mangling %<__underlying_type%>");
2405 /* Types other than builtin types are substitution candidates. */
2406 if (!is_builtin_type
)
2407 add_substitution (type
);
2410 /* qsort callback for sorting a vector of attribute entries. */
2413 attr_strcmp (const void *p1
, const void *p2
)
2415 tree a1
= *(const tree
*)p1
;
2416 tree a2
= *(const tree
*)p2
;
2418 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2419 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2421 return strcmp (as1
->name
, as2
->name
);
2424 /* Return true if we should mangle a type attribute with name NAME. */
2427 mangle_type_attribute_p (tree name
)
2429 const attribute_spec
*as
= lookup_attribute_spec (name
);
2430 if (!as
|| !as
->affects_type_identity
)
2433 /* Skip internal-only attributes, which are distinguished from others
2434 by having a space. At present, all internal-only attributes that
2435 affect type identity are target-specific and are handled by
2436 targetm.mangle_type instead.
2438 Another reason to do this is that a space isn't a valid identifier
2439 character for most file formats. */
2440 if (strchr (IDENTIFIER_POINTER (name
), ' '))
2443 /* The following attributes are mangled specially. */
2444 if (is_attribute_p ("transaction_safe", name
))
2446 if (is_attribute_p ("abi_tag", name
))
2452 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2453 CV-qualifiers written for TYPE.
2455 <CV-qualifiers> ::= [r] [V] [K] */
2458 write_CV_qualifiers_for_type (const tree type
)
2460 int num_qualifiers
= 0;
2462 /* The order is specified by:
2464 "In cases where multiple order-insensitive qualifiers are
2465 present, they should be ordered 'K' (closest to the base type),
2466 'V', 'r', and 'U' (farthest from the base type) ..." */
2468 /* Mangle attributes that affect type identity as extended qualifiers.
2470 We don't do this with classes and enums because their attributes
2471 are part of their definitions, not something added on. */
2473 if (!OVERLOAD_TYPE_P (type
))
2476 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2477 if (mangle_type_attribute_p (get_attribute_name (a
)))
2479 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2480 G
.need_abi_warning
= true;
2481 if (abi_version_at_least (10))
2483 vec
.qsort (attr_strcmp
);
2484 while (!vec
.is_empty())
2487 const attribute_spec
*as
2488 = lookup_attribute_spec (get_attribute_name (a
));
2491 write_unsigned_number (strlen (as
->name
));
2492 write_string (as
->name
);
2496 for (tree args
= TREE_VALUE (a
); args
;
2497 args
= TREE_CHAIN (args
))
2499 tree arg
= TREE_VALUE (args
);
2500 write_template_arg (arg
);
2510 /* Note that we do not use cp_type_quals below; given "const
2511 int[3]", the "const" is emitted with the "int", not with the
2513 cp_cv_quals quals
= TYPE_QUALS (type
);
2515 if (quals
& TYPE_QUAL_RESTRICT
)
2520 if (quals
& TYPE_QUAL_VOLATILE
)
2525 if (quals
& TYPE_QUAL_CONST
)
2531 return num_qualifiers
;
2534 /* Non-terminal <builtin-type>.
2536 <builtin-type> ::= v # void
2541 ::= h # unsigned char
2543 ::= t # unsigned short
2545 ::= j # unsigned int
2547 ::= m # unsigned long
2548 ::= x # long long, __int64
2549 ::= y # unsigned long long, __int64
2551 ::= o # unsigned __int128
2554 ::= e # long double, __float80
2555 ::= g # __float128 [not supported]
2556 ::= u <source-name> # vendor extended type */
2559 write_builtin_type (tree type
)
2561 if (TYPE_CANONICAL (type
))
2562 type
= TYPE_CANONICAL (type
);
2564 switch (TREE_CODE (type
))
2575 /* TYPE may still be wchar_t, char8_t, char16_t, or char32_t, since that
2576 isn't in integer_type_nodes. */
2577 if (type
== wchar_type_node
)
2579 else if (type
== char8_type_node
)
2580 write_string ("Du");
2581 else if (type
== char16_type_node
)
2582 write_string ("Ds");
2583 else if (type
== char32_type_node
)
2584 write_string ("Di");
2588 /* Assume TYPE is one of the shared integer type nodes. Find
2589 it in the array of these nodes. */
2591 for (itk
= 0; itk
< itk_none
; ++itk
)
2592 if (integer_types
[itk
] != NULL_TREE
2593 && integer_type_codes
[itk
] != '\0'
2594 && type
== integer_types
[itk
])
2596 /* Print the corresponding single-letter code. */
2597 write_char (integer_type_codes
[itk
]);
2601 if (itk
== itk_none
)
2603 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2604 TYPE_UNSIGNED (type
));
2611 if (TYPE_PRECISION (type
) == 128)
2612 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2615 /* Allow for cases where TYPE is not one of the shared
2616 integer type nodes and write a "vendor extended builtin
2617 type" with a name the form intN or uintN, respectively.
2618 Situations like this can happen if you have an
2619 __attribute__((__mode__(__SI__))) type and use exotic
2620 switches like '-mint8' on AVR. Of course, this is
2621 undefined by the C++ ABI (and '-mint8' is not even
2622 Standard C conforming), but when using such special
2623 options you're pretty much in nowhere land anyway. */
2625 char prec
[11]; /* up to ten digits for an unsigned */
2627 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2628 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2629 write_char ('u'); /* "vendor extended builtin type" */
2630 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2631 write_string (prefix
);
2632 write_string (prec
);
2639 if (type
== float_type_node
)
2641 else if (type
== double_type_node
)
2643 else if (type
== long_double_type_node
)
2645 else if (type
== dfloat32_type_node
|| type
== fallback_dfloat32_type
)
2646 write_string ("Df");
2647 else if (type
== dfloat64_type_node
|| type
== fallback_dfloat64_type
)
2648 write_string ("Dd");
2649 else if (type
== dfloat128_type_node
|| type
== fallback_dfloat128_type
)
2650 write_string ("De");
2655 case FIXED_POINT_TYPE
:
2656 write_string ("DF");
2657 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2658 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2659 if (type
== fract_type_node
2660 || type
== sat_fract_type_node
2661 || type
== accum_type_node
2662 || type
== sat_accum_type_node
)
2664 else if (type
== unsigned_fract_type_node
2665 || type
== sat_unsigned_fract_type_node
2666 || type
== unsigned_accum_type_node
2667 || type
== sat_unsigned_accum_type_node
)
2669 else if (type
== short_fract_type_node
2670 || type
== sat_short_fract_type_node
2671 || type
== short_accum_type_node
2672 || type
== sat_short_accum_type_node
)
2674 else if (type
== unsigned_short_fract_type_node
2675 || type
== sat_unsigned_short_fract_type_node
2676 || type
== unsigned_short_accum_type_node
2677 || type
== sat_unsigned_short_accum_type_node
)
2679 else if (type
== long_fract_type_node
2680 || type
== sat_long_fract_type_node
2681 || type
== long_accum_type_node
2682 || type
== sat_long_accum_type_node
)
2684 else if (type
== unsigned_long_fract_type_node
2685 || type
== sat_unsigned_long_fract_type_node
2686 || type
== unsigned_long_accum_type_node
2687 || type
== sat_unsigned_long_accum_type_node
)
2689 else if (type
== long_long_fract_type_node
2690 || type
== sat_long_long_fract_type_node
2691 || type
== long_long_accum_type_node
2692 || type
== sat_long_long_accum_type_node
)
2694 else if (type
== unsigned_long_long_fract_type_node
2695 || type
== sat_unsigned_long_long_fract_type_node
2696 || type
== unsigned_long_long_accum_type_node
2697 || type
== sat_unsigned_long_long_accum_type_node
)
2700 sorry ("mangling unknown fixed point type");
2701 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2702 if (TYPE_SATURATING (type
))
2713 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2714 METHOD_TYPE. The return type is mangled before the parameter
2717 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2720 write_function_type (const tree type
)
2722 MANGLE_TRACE_TREE ("function-type", type
);
2724 /* For a pointer to member function, the function type may have
2725 cv-qualifiers, indicating the quals for the artificial 'this'
2727 if (TREE_CODE (type
) == METHOD_TYPE
)
2729 /* The first parameter must be a POINTER_TYPE pointing to the
2730 `this' parameter. */
2731 tree this_type
= class_of_this_parm (type
);
2732 write_CV_qualifiers_for_type (this_type
);
2735 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2737 if (tx_safe_fn_type_p (type
))
2738 write_string ("Dx");
2741 /* We don't track whether or not a type is `extern "C"'. Note that
2742 you can have an `extern "C"' function that does not have
2743 `extern "C"' type, and vice versa:
2745 extern "C" typedef void function_t();
2746 function_t f; // f has C++ linkage, but its type is
2749 typedef void function_t();
2750 extern "C" function_t f; // Vice versa.
2753 write_bare_function_type (type
, /*include_return_type_p=*/1,
2755 if (FUNCTION_REF_QUALIFIED (type
))
2757 if (FUNCTION_RVALUE_QUALIFIED (type
))
2765 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2766 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2767 is mangled before the parameter types. If non-NULL, DECL is
2768 FUNCTION_DECL for the function whose type is being emitted. */
2771 write_bare_function_type (const tree type
, const int include_return_type_p
,
2774 MANGLE_TRACE_TREE ("bare-function-type", type
);
2776 /* Mangle the return type, if requested. */
2777 if (include_return_type_p
)
2778 write_type (TREE_TYPE (type
));
2780 /* Now mangle the types of the arguments. */
2782 write_method_parms (TYPE_ARG_TYPES (type
),
2783 TREE_CODE (type
) == METHOD_TYPE
,
2788 /* Write the mangled representation of a method parameter list of
2789 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2790 considered a non-static method, and the this parameter is omitted.
2791 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2792 parameters are being emitted. */
2795 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2797 tree first_parm_type
;
2798 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2800 /* Assume this parameter type list is variable-length. If it ends
2801 with a void type, then it's not. */
2804 /* If this is a member function, skip the first arg, which is the
2806 "Member functions do not encode the type of their implicit this
2809 Similarly, there's no need to mangle artificial parameters, like
2810 the VTT parameters for constructors and destructors. */
2813 parm_types
= TREE_CHAIN (parm_types
);
2814 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2816 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2818 parm_types
= TREE_CHAIN (parm_types
);
2819 parm_decl
= DECL_CHAIN (parm_decl
);
2822 if (decl
&& ctor_omit_inherited_parms (decl
))
2823 /* Bring back parameters omitted from an inherited ctor. */
2824 parm_types
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl
));
2827 for (first_parm_type
= parm_types
;
2829 parm_types
= TREE_CHAIN (parm_types
))
2831 tree parm
= TREE_VALUE (parm_types
);
2832 if (parm
== void_type_node
)
2834 /* "Empty parameter lists, whether declared as () or
2835 conventionally as (void), are encoded with a void parameter
2837 if (parm_types
== first_parm_type
)
2839 /* If the parm list is terminated with a void type, it's
2842 /* A void type better be the last one. */
2843 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2850 /* <builtin-type> ::= z # ellipsis */
2854 /* <class-enum-type> ::= <name> */
2857 write_class_enum_type (const tree type
)
2859 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2862 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2865 <template-args> ::= I <template-arg>* E */
2868 write_template_args (tree args
)
2873 MANGLE_TRACE_TREE ("template-args", args
);
2878 length
= TREE_VEC_LENGTH (args
);
2880 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2882 /* We have nested template args. We want the innermost template
2884 args
= TREE_VEC_ELT (args
, length
- 1);
2885 length
= TREE_VEC_LENGTH (args
);
2887 for (i
= 0; i
< length
; ++i
)
2888 write_template_arg (TREE_VEC_ELT (args
, i
));
2895 <unqualified-name> <template-args>
2896 part of SCOPE_REF or COMPONENT_REF mangling. */
2899 write_member_name (tree member
)
2901 if (identifier_p (member
))
2903 if (IDENTIFIER_ANY_OP_P (member
))
2905 if (abi_version_at_least (11))
2906 write_string ("on");
2907 if (abi_warn_or_compat_version_crosses (11))
2908 G
.need_abi_warning
= 1;
2910 write_unqualified_id (member
);
2912 else if (DECL_P (member
))
2914 gcc_assert (!DECL_OVERLOADED_OPERATOR_P (member
));
2915 write_unqualified_name (member
);
2917 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2919 tree name
= TREE_OPERAND (member
, 0);
2920 name
= OVL_FIRST (name
);
2921 write_member_name (name
);
2922 write_template_args (TREE_OPERAND (member
, 1));
2925 write_expression (member
);
2928 /* EXPR is a base COMPONENT_REF; write the minimized base conversion path for
2929 converting to BASE, or just the conversion of EXPR if BASE is null.
2931 "Given a fully explicit base path P := C_n -> ... -> C_0, the minimized base
2932 path Min(P) is defined as follows: let C_i be the last element for which the
2933 conversion to C_0 is unambiguous; if that element is C_n, the minimized path
2934 is C_n -> C_0; otherwise, the minimized path is Min(C_n -> ... -> C_i) ->
2937 We mangle the conversion to C_i if it's different from C_n. */
2940 write_base_ref (tree expr
, tree base
= NULL_TREE
)
2942 if (TREE_CODE (expr
) != COMPONENT_REF
)
2945 tree field
= TREE_OPERAND (expr
, 1);
2947 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_FIELD_IS_BASE (field
))
2950 tree object
= TREE_OPERAND (expr
, 0);
2952 tree binfo
= NULL_TREE
;
2955 tree cur
= TREE_TYPE (object
);
2956 binfo
= lookup_base (cur
, base
, ba_unique
, NULL
, tf_none
);
2959 /* We're at the end of the base conversion chain, so it can't be
2961 base
= TREE_TYPE (field
);
2963 if (binfo
== error_mark_node
)
2965 /* cur->base is ambiguous, so make the conversion to
2966 last explicit, expressed as a cast (last&)object. */
2967 tree last
= TREE_TYPE (expr
);
2968 write_string (OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
);
2969 write_type (build_reference_type (last
));
2970 write_expression (object
);
2972 else if (write_base_ref (object
, base
))
2973 /* cur->base is unambiguous, but we had another base conversion
2974 underneath and wrote it out. */;
2976 /* No more base conversions, just write out the object. */
2977 write_expression (object
);
2982 /* The number of elements spanned by a RANGE_EXPR. */
2984 unsigned HOST_WIDE_INT
2985 range_expr_nelts (tree expr
)
2987 tree lo
= TREE_OPERAND (expr
, 0);
2988 tree hi
= TREE_OPERAND (expr
, 1);
2989 return tree_to_uhwi (hi
) - tree_to_uhwi (lo
) + 1;
2992 /* <expression> ::= <unary operator-name> <expression>
2993 ::= <binary operator-name> <expression> <expression>
2996 <expr-primary> ::= <template-param>
2997 ::= L <type> <value number> E # literal
2998 ::= L <mangled-name> E # external name
2999 ::= st <type> # sizeof
3000 ::= sr <type> <unqualified-name> # dependent name
3001 ::= sr <type> <unqualified-name> <template-args> */
3004 write_expression (tree expr
)
3006 enum tree_code code
= TREE_CODE (expr
);
3008 if (TREE_CODE (expr
) == TARGET_EXPR
)
3010 expr
= TARGET_EXPR_INITIAL (expr
);
3011 code
= TREE_CODE (expr
);
3014 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
3015 argument is converted (via qualification conversions) to another type. */
3016 while (CONVERT_EXPR_CODE_P (code
)
3017 || code
== IMPLICIT_CONV_EXPR
3018 || location_wrapper_p (expr
)
3019 /* Parentheses aren't mangled. */
3020 || code
== PAREN_EXPR
3021 || code
== NON_LVALUE_EXPR
3022 || (code
== VIEW_CONVERT_EXPR
3023 && TREE_CODE (TREE_OPERAND (expr
, 0)) == TEMPLATE_PARM_INDEX
))
3025 expr
= TREE_OPERAND (expr
, 0);
3026 code
= TREE_CODE (expr
);
3029 if (code
== BASELINK
3030 && (!type_unknown_p (expr
)
3031 || !BASELINK_QUALIFIED_P (expr
)))
3033 expr
= BASELINK_FUNCTIONS (expr
);
3034 code
= TREE_CODE (expr
);
3037 /* Handle pointers-to-members by making them look like expression
3039 if (code
== PTRMEM_CST
)
3041 expr
= build_nt (ADDR_EXPR
,
3042 build_qualified_name (/*type=*/NULL_TREE
,
3043 PTRMEM_CST_CLASS (expr
),
3044 PTRMEM_CST_MEMBER (expr
),
3045 /*template_p=*/false));
3046 code
= TREE_CODE (expr
);
3049 /* Handle template parameters. */
3050 if (code
== TEMPLATE_TYPE_PARM
3051 || code
== TEMPLATE_TEMPLATE_PARM
3052 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
3053 || code
== TEMPLATE_PARM_INDEX
)
3054 write_template_param (expr
);
3055 /* Handle literals. */
3056 else if (TREE_CODE_CLASS (code
) == tcc_constant
3057 || code
== CONST_DECL
)
3058 write_template_arg_literal (expr
);
3059 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
3061 gcc_assert (id_equal (DECL_NAME (expr
), "this"));
3062 write_string ("fpT");
3064 else if (code
== PARM_DECL
)
3066 /* A function parameter used in a late-specified return type. */
3067 int index
= DECL_PARM_INDEX (expr
);
3068 int level
= DECL_PARM_LEVEL (expr
);
3069 int delta
= G
.parm_depth
- level
+ 1;
3070 gcc_assert (index
>= 1);
3074 if (abi_version_at_least (5))
3076 /* Let L be the number of function prototype scopes from the
3077 innermost one (in which the parameter reference occurs) up
3078 to (and including) the one containing the declaration of
3079 the referenced parameter. If the parameter declaration
3080 clause of the innermost function prototype scope has been
3081 completely seen, it is not counted (in that case -- which
3082 is perhaps the most common -- L can be zero). */
3084 write_unsigned_number (delta
- 1);
3086 if (abi_warn_or_compat_version_crosses (5))
3087 G
.need_abi_warning
= true;
3090 write_compact_number (index
- 1);
3092 else if (DECL_P (expr
))
3095 write_mangled_name (expr
, false);
3098 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
3100 tree op
= TREE_OPERAND (expr
, 0);
3102 if (PACK_EXPANSION_P (op
))
3104 if (abi_warn_or_compat_version_crosses (11))
3105 G
.need_abi_warning
= true;
3106 if (abi_version_at_least (11))
3108 /* sZ rather than szDp. */
3109 write_string ("sZ");
3110 write_expression (PACK_EXPANSION_PATTERN (op
));
3115 if (SIZEOF_EXPR_TYPE_P (expr
))
3117 write_string ("st");
3118 write_type (TREE_TYPE (op
));
3120 else if (ARGUMENT_PACK_P (op
))
3122 tree args
= ARGUMENT_PACK_ARGS (op
);
3123 int length
= TREE_VEC_LENGTH (args
);
3124 if (abi_warn_or_compat_version_crosses (10))
3125 G
.need_abi_warning
= true;
3126 if (abi_version_at_least (10))
3128 /* sP <template-arg>* E # sizeof...(T), size of a captured
3129 template parameter pack from an alias template */
3130 write_string ("sP");
3131 for (int i
= 0; i
< length
; ++i
)
3132 write_template_arg (TREE_VEC_ELT (args
, i
));
3137 /* In GCC 5 we represented this sizeof wrong, with the effect
3138 that we mangled it as the last element of the pack. */
3139 tree arg
= TREE_VEC_ELT (args
, length
-1);
3142 write_string ("st");
3147 write_string ("sz");
3148 write_expression (arg
);
3152 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
3154 write_string ("st");
3155 write_type (TREE_OPERAND (expr
, 0));
3160 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
)
3162 if (!ALIGNOF_EXPR_STD_P (expr
))
3164 if (abi_warn_or_compat_version_crosses (16))
3165 G
.need_abi_warning
= true;
3166 if (abi_version_at_least (16))
3168 /* We used to mangle __alignof__ like alignof. */
3169 write_string ("u11__alignof__");
3170 write_template_arg (TREE_OPERAND (expr
, 0));
3175 if (TYPE_P (TREE_OPERAND (expr
, 0)))
3177 write_string ("at");
3178 write_type (TREE_OPERAND (expr
, 0));
3183 else if (code
== SCOPE_REF
3184 || code
== BASELINK
)
3187 if (code
== SCOPE_REF
)
3189 scope
= TREE_OPERAND (expr
, 0);
3190 member
= TREE_OPERAND (expr
, 1);
3191 if (BASELINK_P (member
))
3192 member
= BASELINK_FUNCTIONS (member
);
3196 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
3197 member
= BASELINK_FUNCTIONS (expr
);
3200 /* If the MEMBER is a real declaration, then the qualifying
3201 scope was not dependent. Ideally, we would not have a
3202 SCOPE_REF in those cases, but sometimes we do. If the second
3203 argument is a DECL, then the name must not have been
3205 if (DECL_P (member
))
3206 write_expression (member
);
3209 gcc_assert (code
!= BASELINK
|| BASELINK_QUALIFIED_P (expr
));
3210 write_string ("sr");
3212 write_member_name (member
);
3215 else if (INDIRECT_REF_P (expr
)
3216 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3217 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3219 write_expression (TREE_OPERAND (expr
, 0));
3221 else if (identifier_p (expr
))
3223 /* An operator name appearing as a dependent name needs to be
3224 specially marked to disambiguate between a use of the operator
3225 name and a use of the operator in an expression. */
3226 if (IDENTIFIER_ANY_OP_P (expr
))
3227 write_string ("on");
3228 write_unqualified_id (expr
);
3230 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3232 tree fn
= TREE_OPERAND (expr
, 0);
3234 if (IDENTIFIER_ANY_OP_P (fn
))
3235 write_string ("on");
3236 write_unqualified_id (fn
);
3237 write_template_args (TREE_OPERAND (expr
, 1));
3239 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3241 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3242 const char *name
= OVL_OP_INFO (true, subop
)->mangled_name
;
3244 write_string (name
);
3245 write_expression (TREE_OPERAND (expr
, 0));
3246 write_expression (TREE_OPERAND (expr
, 2));
3248 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3250 /* ::= [gs] nw <expression>* _ <type> E
3251 ::= [gs] nw <expression>* _ <type> <initializer>
3252 ::= [gs] na <expression>* _ <type> E
3253 ::= [gs] na <expression>* _ <type> <initializer>
3254 <initializer> ::= pi <expression>* E */
3255 tree placement
= TREE_OPERAND (expr
, 0);
3256 tree type
= TREE_OPERAND (expr
, 1);
3257 tree nelts
= TREE_OPERAND (expr
, 2);
3258 tree init
= TREE_OPERAND (expr
, 3);
3261 gcc_assert (code
== NEW_EXPR
);
3262 if (TREE_OPERAND (expr
, 2))
3263 code
= VEC_NEW_EXPR
;
3265 if (NEW_EXPR_USE_GLOBAL (expr
))
3266 write_string ("gs");
3268 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3270 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3271 write_expression (TREE_VALUE (t
));
3278 ++processing_template_decl
;
3279 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3280 tf_warning_or_error
);
3281 type
= build_cplus_array_type (type
, domain
);
3282 --processing_template_decl
;
3286 if (init
&& TREE_CODE (init
) == TREE_LIST
3287 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3288 write_expression (TREE_VALUE (init
));
3292 write_string ("pi");
3293 if (init
&& init
!= void_node
)
3294 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3295 write_expression (TREE_VALUE (t
));
3299 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3301 gcc_assert (code
== DELETE_EXPR
);
3302 if (DELETE_EXPR_USE_VEC (expr
))
3303 code
= VEC_DELETE_EXPR
;
3305 if (DELETE_EXPR_USE_GLOBAL (expr
))
3306 write_string ("gs");
3308 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3310 write_expression (TREE_OPERAND (expr
, 0));
3312 else if (code
== THROW_EXPR
)
3314 tree op
= TREE_OPERAND (expr
, 0);
3317 write_string ("tw");
3318 write_expression (op
);
3321 write_string ("tr");
3323 else if (code
== CONSTRUCTOR
)
3325 bool braced_init
= BRACE_ENCLOSED_INITIALIZER_P (expr
);
3326 tree etype
= TREE_TYPE (expr
);
3329 write_string ("il");
3332 write_string ("tl");
3336 /* If this is an undigested initializer, mangle it as written.
3337 COMPOUND_LITERAL_P doesn't actually distinguish between digested and
3338 undigested braced casts, but it should work to use it to distinguish
3339 between braced casts in a template signature (undigested) and template
3340 parm object values (digested), and all CONSTRUCTORS that get here
3341 should be one of those two cases. */
3342 bool undigested
= braced_init
|| COMPOUND_LITERAL_P (expr
);
3343 if (undigested
|| !zero_init_expr_p (expr
))
3345 /* Convert braced initializer lists to STRING_CSTs so that
3346 A<"Foo"> mangles the same as A<{'F', 'o', 'o', 0}> while
3347 still using the latter mangling for strings that
3348 originated as braced initializer lists. */
3349 expr
= braced_lists_to_strings (etype
, expr
);
3351 if (TREE_CODE (expr
) == CONSTRUCTOR
)
3353 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3354 unsigned last_nonzero
= UINT_MAX
;
3355 constructor_elt
*ce
;
3358 for (HOST_WIDE_INT i
= 0; vec_safe_iterate (elts
, i
, &ce
); ++i
)
3359 if ((TREE_CODE (etype
) == UNION_TYPE
3360 && ce
->index
!= first_field (etype
))
3361 || !zero_init_expr_p (ce
->value
))
3364 if (undigested
|| last_nonzero
!= UINT_MAX
)
3365 for (HOST_WIDE_INT i
= 0; vec_safe_iterate (elts
, i
, &ce
); ++i
)
3367 if (i
> last_nonzero
)
3369 if (!undigested
&& TREE_CODE (etype
) == UNION_TYPE
)
3371 /* Express the active member as a designator. */
3372 write_string ("di");
3373 write_unqualified_name (ce
->index
);
3376 if (ce
->index
&& TREE_CODE (ce
->index
) == RANGE_EXPR
)
3377 reps
= range_expr_nelts (ce
->index
);
3378 for (unsigned j
= 0; j
< reps
; ++j
)
3379 write_expression (ce
->value
);
3384 gcc_assert (TREE_CODE (expr
) == STRING_CST
);
3385 write_expression (expr
);
3390 else if (code
== LAMBDA_EXPR
)
3392 /* [temp.over.link] Two lambda-expressions are never considered
3395 So just use the closure type mangling. */
3396 write_string ("tl");
3397 write_type (LAMBDA_EXPR_CLOSURE (expr
));
3400 else if (dependent_name (expr
))
3402 tree name
= dependent_name (expr
);
3403 if (IDENTIFIER_ANY_OP_P (name
))
3405 if (abi_version_at_least (16))
3406 write_string ("on");
3407 if (abi_warn_or_compat_version_crosses (16))
3408 G
.need_abi_warning
= 1;
3410 write_unqualified_id (name
);
3418 /* When we bind a variable or function to a non-type template
3419 argument with reference type, we create an ADDR_EXPR to show
3420 the fact that the entity's address has been taken. But, we
3421 don't actually want to output a mangling code for the `&'. */
3422 if (TREE_CODE (expr
) == ADDR_EXPR
3424 && TYPE_REF_P (TREE_TYPE (expr
)))
3426 expr
= TREE_OPERAND (expr
, 0);
3429 write_expression (expr
);
3433 code
= TREE_CODE (expr
);
3436 if (code
== COMPONENT_REF
)
3438 tree ob
= TREE_OPERAND (expr
, 0);
3440 if (TREE_CODE (ob
) == ARROW_EXPR
)
3442 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3443 ob
= TREE_OPERAND (ob
, 0);
3444 write_expression (ob
);
3446 else if (write_base_ref (expr
))
3448 else if (!is_dummy_object (ob
))
3450 write_string ("dt");
3451 write_expression (ob
);
3453 /* else, for a non-static data member with no associated object (in
3454 unevaluated context), use the unresolved-name mangling. */
3456 write_member_name (TREE_OPERAND (expr
, 1));
3460 /* If it wasn't any of those, recursively expand the expression. */
3461 name
= OVL_OP_INFO (false, code
)->mangled_name
;
3463 /* We used to mangle const_cast and static_cast like a C cast. */
3464 if (code
== CONST_CAST_EXPR
3465 || code
== STATIC_CAST_EXPR
)
3467 if (abi_warn_or_compat_version_crosses (6))
3468 G
.need_abi_warning
= 1;
3469 if (!abi_version_at_least (6))
3470 name
= OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
;
3478 error ("use of built-in trait %qE in function signature; "
3479 "use library traits instead", expr
);
3483 sorry ("mangling %C", code
);
3489 write_string (name
);
3495 tree fn
= CALL_EXPR_FN (expr
);
3497 if (TREE_CODE (fn
) == ADDR_EXPR
)
3498 fn
= TREE_OPERAND (fn
, 0);
3500 /* Mangle a dependent name as the name, not whatever happens to
3501 be the first function in the overload set. */
3503 && type_dependent_expression_p_push (expr
))
3506 write_expression (fn
);
3509 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3510 write_expression (CALL_EXPR_ARG (expr
, i
));
3515 write_type (TREE_TYPE (expr
));
3516 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3517 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3520 tree args
= TREE_OPERAND (expr
, 0);
3522 for (; args
; args
= TREE_CHAIN (args
))
3523 write_expression (TREE_VALUE (args
));
3528 case DYNAMIC_CAST_EXPR
:
3529 case REINTERPRET_CAST_EXPR
:
3530 case STATIC_CAST_EXPR
:
3531 case CONST_CAST_EXPR
:
3532 write_type (TREE_TYPE (expr
));
3533 write_expression (TREE_OPERAND (expr
, 0));
3536 case PREINCREMENT_EXPR
:
3537 case PREDECREMENT_EXPR
:
3538 if (abi_version_at_least (6))
3540 if (abi_warn_or_compat_version_crosses (6))
3541 G
.need_abi_warning
= 1;
3545 /* In the middle-end, some expressions have more operands than
3546 they do in templates (and mangling). */
3547 len
= cp_tree_operand_length (expr
);
3549 for (i
= 0; i
< len
; ++i
)
3551 tree operand
= TREE_OPERAND (expr
, i
);
3552 /* As a GNU extension, the middle operand of a
3553 conditional may be omitted. Since expression
3554 manglings are supposed to represent the input token
3555 stream, there's no good way to mangle such an
3556 expression without extending the C++ ABI. */
3557 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3559 error ("omitted middle operand to %<?:%> operand "
3560 "cannot be mangled");
3563 else if (FOLD_EXPR_P (expr
))
3565 /* The first 'operand' of a fold-expression is the operator
3566 that it folds over. */
3569 int fcode
= TREE_INT_CST_LOW (operand
);
3570 write_string (OVL_OP_INFO (false, fcode
)->mangled_name
);
3573 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3575 /* The order of operands of the binary left and right
3576 folds is the same, but we want to mangle them in
3577 lexical order, i.e. non-pack first. */
3579 operand
= FOLD_EXPR_INIT (expr
);
3581 operand
= FOLD_EXPR_PACK (expr
);
3583 if (PACK_EXPANSION_P (operand
))
3584 operand
= PACK_EXPANSION_PATTERN (operand
);
3586 write_expression (operand
);
3592 /* Literal subcase of non-terminal <template-arg>.
3594 "Literal arguments, e.g. "A<42L>", are encoded with their type
3595 and value. Negative integer values are preceded with "n"; for
3596 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3597 encoded as 0, true as 1." */
3600 write_template_arg_literal (const tree value
)
3602 if (TREE_CODE (value
) == STRING_CST
)
3603 /* Temporarily mangle strings as braced initializer lists. */
3604 write_string ("tl");
3608 tree valtype
= TREE_TYPE (value
);
3609 write_type (valtype
);
3611 /* Write a null member pointer value as (type)0, regardless of its
3612 real representation. */
3613 if (null_member_pointer_value_p (value
))
3614 write_integer_cst (integer_zero_node
);
3616 switch (TREE_CODE (value
))
3619 write_integer_cst (DECL_INITIAL (value
));
3623 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3624 || integer_zerop (value
) || integer_onep (value
));
3625 if (!(abi_version_at_least (14)
3626 && NULLPTR_TYPE_P (TREE_TYPE (value
))))
3627 write_integer_cst (value
);
3631 write_real_cst (value
);
3635 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3636 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3638 write_integer_cst (TREE_REALPART (value
));
3640 write_integer_cst (TREE_IMAGPART (value
));
3642 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3643 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3645 write_real_cst (TREE_REALPART (value
));
3647 write_real_cst (TREE_IMAGPART (value
));
3655 /* Mangle strings the same as braced initializer lists. */
3656 unsigned n
= TREE_STRING_LENGTH (value
);
3657 const char *str
= TREE_STRING_POINTER (value
);
3659 /* Count the number of trailing nuls and subtract them from
3660 STRSIZE because they don't need to be mangled. */
3661 for (const char *p
= str
+ n
- 1; ; --p
)
3665 n
-= str
+ n
- !!*p
- p
;
3669 tree eltype
= TREE_TYPE (valtype
);
3670 for (const char *p
= str
; n
--; ++p
)
3673 write_type (eltype
);
3674 write_unsigned_number (*(const unsigned char*)p
);
3687 /* Non-terminal <template-arg>.
3689 <template-arg> ::= <type> # type
3690 ::= L <type> </value/ number> E # literal
3691 ::= LZ <name> E # external name
3692 ::= X <expression> E # expression */
3695 write_template_arg (tree node
)
3697 enum tree_code code
= TREE_CODE (node
);
3699 MANGLE_TRACE_TREE ("template-arg", node
);
3701 /* A template template parameter's argument list contains TREE_LIST
3702 nodes of which the value field is the actual argument. */
3703 if (code
== TREE_LIST
)
3705 node
= TREE_VALUE (node
);
3706 /* If it's a decl, deal with its type instead. */
3709 node
= TREE_TYPE (node
);
3710 code
= TREE_CODE (node
);
3714 if (template_parm_object_p (node
))
3715 /* We want to mangle the argument, not the var we stored it in. */
3716 node
= tparm_object_argument (node
);
3718 /* Strip a conversion added by convert_nontype_argument. */
3719 if (TREE_CODE (node
) == IMPLICIT_CONV_EXPR
)
3720 node
= TREE_OPERAND (node
, 0);
3721 if (REFERENCE_REF_P (node
))
3722 node
= TREE_OPERAND (node
, 0);
3723 if (TREE_CODE (node
) == NOP_EXPR
3724 && TYPE_REF_P (TREE_TYPE (node
)))
3726 /* Template parameters can be of reference type. To maintain
3727 internal consistency, such arguments use a conversion from
3728 address of object to reference type. */
3729 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3730 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3733 if (TREE_CODE (node
) == BASELINK
3734 && !type_unknown_p (node
))
3736 if (abi_version_at_least (6))
3737 node
= BASELINK_FUNCTIONS (node
);
3738 if (abi_warn_or_compat_version_crosses (6))
3739 /* We wrongly wrapped a class-scope function in X/E. */
3740 G
.need_abi_warning
= 1;
3743 if (ARGUMENT_PACK_P (node
))
3745 /* Expand the template argument pack. */
3746 tree args
= ARGUMENT_PACK_ARGS (node
);
3747 int i
, length
= TREE_VEC_LENGTH (args
);
3748 if (abi_version_at_least (6))
3752 if (abi_warn_or_compat_version_crosses (6))
3753 G
.need_abi_warning
= 1;
3754 for (i
= 0; i
< length
; ++i
)
3755 write_template_arg (TREE_VEC_ELT (args
, i
));
3758 else if (TYPE_P (node
))
3760 else if (code
== TEMPLATE_DECL
)
3761 /* A template appearing as a template arg is a template template arg. */
3762 write_template_template_arg (node
);
3763 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3764 || code
== CONST_DECL
3765 || null_member_pointer_value_p (node
))
3766 write_template_arg_literal (node
);
3767 else if (DECL_P (node
))
3770 /* Until ABI version 3, the underscore before the mangled name
3771 was incorrectly omitted. */
3772 if (!abi_version_at_least (3))
3775 write_string ("_Z");
3776 if (abi_warn_or_compat_version_crosses (3))
3777 G
.need_abi_warning
= 1;
3778 write_encoding (node
);
3783 /* Template arguments may be expressions. */
3785 write_expression (node
);
3790 /* <template-template-arg>
3792 ::= <substitution> */
3795 write_template_template_arg (const tree decl
)
3797 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3799 if (find_substitution (decl
))
3801 write_name (decl
, /*ignore_local_scope=*/0);
3802 add_substitution (decl
);
3806 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3808 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3809 ::= A <expression> _ </element/ type>
3811 "Array types encode the dimension (number of elements) and the
3812 element type. For variable length arrays, the dimension (but not
3813 the '_' separator) is omitted."
3814 Note that for flexible array members, like for other arrays of
3815 unspecified size, the dimension is also omitted. */
3818 write_array_type (const tree type
)
3821 if (TYPE_DOMAIN (type
))
3825 index_type
= TYPE_DOMAIN (type
);
3826 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3827 It's null for flexible array members which have no upper bound
3828 (this is a change from GCC 5 and prior where such members were
3829 incorrectly mangled as zero-length arrays). */
3830 if (tree max
= TYPE_MAX_VALUE (index_type
))
3832 if (TREE_CODE (max
) == INTEGER_CST
)
3834 /* The ABI specifies that we should mangle the number of
3835 elements in the array, not the largest allowed index. */
3836 offset_int wmax
= wi::to_offset (max
) + 1;
3837 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3838 number of elements as zero. */
3839 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3840 gcc_assert (wi::fits_uhwi_p (wmax
));
3841 write_unsigned_number (wmax
.to_uhwi ());
3845 max
= TREE_OPERAND (max
, 0);
3846 write_expression (max
);
3851 write_type (TREE_TYPE (type
));
3854 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3855 variables. TYPE is a pointer-to-member POINTER_TYPE.
3857 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3860 write_pointer_to_member_type (const tree type
)
3863 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3864 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3867 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3868 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3869 TEMPLATE_PARM_INDEX.
3871 <template-param> ::= T </parameter/ number> _ */
3874 write_template_param (const tree parm
)
3878 MANGLE_TRACE_TREE ("template-parm", parm
);
3880 switch (TREE_CODE (parm
))
3882 case TEMPLATE_TYPE_PARM
:
3883 case TEMPLATE_TEMPLATE_PARM
:
3884 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3885 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3888 case TEMPLATE_PARM_INDEX
:
3889 parm_index
= TEMPLATE_PARM_IDX (parm
);
3897 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3898 earliest template param denoted by `_'. */
3899 write_compact_number (parm_index
);
3902 /* <template-template-param>
3903 ::= <template-param>
3904 ::= <substitution> */
3907 write_template_template_param (const tree parm
)
3909 tree templ
= NULL_TREE
;
3911 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3912 template template parameter. The substitution candidate here is
3913 only the template. */
3914 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3917 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3918 if (find_substitution (templ
))
3922 /* <template-param> encodes only the template parameter position,
3923 not its template arguments, which is fine here. */
3924 write_template_param (parm
);
3926 add_substitution (templ
);
3929 /* Non-terminal <substitution>.
3931 <substitution> ::= S <seq-id> _
3935 write_substitution (const int seq_id
)
3937 MANGLE_TRACE ("substitution", "");
3941 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3945 /* Start mangling ENTITY. */
3948 start_mangling (const tree entity
)
3951 G
.need_abi_warning
= false;
3952 G
.need_cxx17_warning
= false;
3954 obstack_free (&name_obstack
, name_base
);
3955 mangle_obstack
= &name_obstack
;
3956 name_base
= obstack_alloc (&name_obstack
, 0);
3959 /* Done with mangling. Release the data. */
3962 finish_mangling_internal (void)
3964 /* Clear all the substitutions. */
3965 vec_safe_truncate (G
.substitutions
, 0);
3968 mangle_module_fini ();
3970 /* Null-terminate the string. */
3975 /* Like finish_mangling_internal, but return the mangled string. */
3977 static inline const char *
3978 finish_mangling (void)
3980 finish_mangling_internal ();
3981 return (const char *) obstack_finish (mangle_obstack
);
3984 /* Like finish_mangling_internal, but return an identifier. */
3987 finish_mangling_get_identifier (void)
3989 finish_mangling_internal ();
3990 /* Don't obstack_finish here, and the next start_mangling will
3991 remove the identifier. */
3992 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3995 /* Initialize data structures for mangling. */
4000 gcc_obstack_init (&name_obstack
);
4001 name_base
= obstack_alloc (&name_obstack
, 0);
4002 vec_alloc (G
.substitutions
, 0);
4004 /* Cache these identifiers for quick comparison when checking for
4005 standard substitutions. */
4006 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
4007 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
4008 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
4009 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
4010 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
4011 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
4014 /* Generate a mangling for MODULE's global initializer fn. */
4017 mangle_module_global_init (int module
)
4019 start_mangling (NULL_TREE
);
4021 write_string ("_ZGI");
4022 write_module (module
, true);
4024 return finish_mangling_get_identifier ();
4027 /* Generate the mangled name of DECL. */
4030 mangle_decl_string (const tree decl
)
4033 tree saved_fn
= NULL_TREE
;
4034 bool template_p
= false;
4036 /* We shouldn't be trying to mangle an uninstantiated template. */
4037 gcc_assert (!type_dependent_expression_p (decl
));
4039 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
4041 struct tinst_level
*tl
= current_instantiation ();
4042 if ((!tl
|| tl
->maybe_get_node () != decl
)
4043 && push_tinst_level (decl
))
4046 saved_fn
= current_function_decl
;
4047 current_function_decl
= NULL_TREE
;
4050 iloc_sentinel
ils (DECL_SOURCE_LOCATION (decl
));
4052 start_mangling (decl
);
4054 if (TREE_CODE (decl
) == TYPE_DECL
)
4055 write_type (TREE_TYPE (decl
));
4057 write_mangled_name (decl
, true);
4059 result
= finish_mangling_get_identifier ();
4061 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
4062 IDENTIFIER_POINTER (result
));
4067 current_function_decl
= saved_fn
;
4073 /* Return an identifier for the external mangled name of DECL. */
4076 get_mangled_id (tree decl
)
4078 tree id
= mangle_decl_string (decl
);
4079 return targetm
.mangle_decl_assembler_name (decl
, id
);
4082 /* Create an identifier for the external mangled name of DECL. */
4085 mangle_decl (const tree decl
)
4090 /* Don't bother mangling uninstantiated templates. */
4091 ++processing_template_decl
;
4092 if (TREE_CODE (decl
) == TYPE_DECL
)
4093 dep
= dependent_type_p (TREE_TYPE (decl
));
4095 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
4096 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
4097 --processing_template_decl
;
4101 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
4102 It is not needed to assign names to anonymous namespace, but we use the
4103 "<anon>" marker to be able to tell if type is C++ ODR type or type
4104 produced by other language. */
4105 if (TREE_CODE (decl
) == TYPE_DECL
4106 && TYPE_STUB_DECL (TREE_TYPE (decl
))
4107 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
4108 id
= get_identifier ("<anon>");
4111 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
4112 || !no_linkage_check (TREE_TYPE (decl
), true));
4113 if (abi_version_at_least (10))
4114 if (tree fn
= decl_function_context (decl
))
4115 maybe_check_abi_tags (fn
, decl
);
4116 id
= get_mangled_id (decl
);
4118 SET_DECL_ASSEMBLER_NAME (decl
, id
);
4120 if (G
.need_cxx17_warning
4121 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
4122 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wnoexcept_type
,
4123 "mangled name for %qD will change in C++17 because the "
4124 "exception specification is part of a function type",
4127 if (id
!= DECL_NAME (decl
)
4128 /* Don't do this for a fake symbol we aren't going to emit anyway. */
4129 && TREE_CODE (decl
) != TYPE_DECL
4130 && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl
))
4132 int save_ver
= flag_abi_version
;
4133 tree id2
= NULL_TREE
;
4135 if (!DECL_REALLY_EXTERN (decl
))
4137 record_mangling (decl
, G
.need_abi_warning
);
4139 if (!G
.need_abi_warning
)
4142 flag_abi_version
= flag_abi_compat_version
;
4143 id2
= mangle_decl_string (decl
);
4144 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
4145 flag_abi_version
= save_ver
;
4148 note_mangling_alias (decl
, id2
);
4153 const char fabi_version
[] = "-fabi-version";
4155 if (flag_abi_compat_version
!= warn_abi_version
4156 || id2
== NULL_TREE
)
4158 flag_abi_version
= warn_abi_version
;
4159 id2
= mangle_decl_string (decl
);
4160 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
4162 flag_abi_version
= save_ver
;
4166 else if (warn_abi_version
!= 0
4167 && abi_version_at_least (warn_abi_version
))
4168 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
4169 "the mangled name of %qD changed between "
4170 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4171 G
.entity
, fabi_version
, warn_abi_version
, id2
,
4172 fabi_version
, save_ver
, id
);
4174 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
4175 "the mangled name of %qD changes between "
4176 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4177 G
.entity
, fabi_version
, save_ver
, id
,
4178 fabi_version
, warn_abi_version
, id2
);
4181 flag_abi_version
= save_ver
;
4185 /* Generate the mangled representation of TYPE. */
4188 mangle_type_string (const tree type
)
4192 start_mangling (type
);
4194 result
= finish_mangling ();
4196 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
4200 /* Create an identifier for the mangled name of a special component
4201 for belonging to TYPE. CODE is the ABI-specified code for this
4205 mangle_special_for_type (const tree type
, const char *code
)
4209 /* We don't have an actual decl here for the special component, so
4210 we can't just process the <encoded-name>. Instead, fake it. */
4211 start_mangling (type
);
4213 /* Start the mangling. */
4214 write_string ("_Z");
4215 write_string (code
);
4219 result
= finish_mangling_get_identifier ();
4222 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
4223 IDENTIFIER_POINTER (result
));
4228 /* Create an identifier for the mangled representation of the typeinfo
4229 structure for TYPE. */
4232 mangle_typeinfo_for_type (const tree type
)
4234 return mangle_special_for_type (type
, "TI");
4237 /* Create an identifier for the mangled name of the NTBS containing
4238 the mangled name of TYPE. */
4241 mangle_typeinfo_string_for_type (const tree type
)
4243 return mangle_special_for_type (type
, "TS");
4246 /* Create an identifier for the mangled name of the vtable for TYPE. */
4249 mangle_vtbl_for_type (const tree type
)
4251 return mangle_special_for_type (type
, "TV");
4254 /* Returns an identifier for the mangled name of the VTT for TYPE. */
4257 mangle_vtt_for_type (const tree type
)
4259 return mangle_special_for_type (type
, "TT");
4262 /* Returns an identifier for the mangled name of the decomposition
4263 artificial variable DECL. DECLS is the vector of the VAR_DECLs
4264 for the identifier-list. */
4267 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
4269 gcc_assert (!type_dependent_expression_p (decl
));
4271 location_t saved_loc
= input_location
;
4272 input_location
= DECL_SOURCE_LOCATION (decl
);
4274 start_mangling (decl
);
4275 write_string ("_Z");
4277 tree context
= decl_mangling_context (decl
);
4278 gcc_assert (context
!= NULL_TREE
);
4280 bool nested
= false;
4281 if (DECL_NAMESPACE_STD_P (context
))
4282 write_string ("St");
4283 else if (context
!= global_namespace
)
4287 write_prefix (decl_mangling_context (decl
));
4290 write_string ("DC");
4293 FOR_EACH_VEC_ELT (decls
, i
, d
)
4294 write_unqualified_name (d
);
4300 tree id
= finish_mangling_get_identifier ();
4302 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4303 IDENTIFIER_POINTER (id
));
4305 input_location
= saved_loc
;
4309 /* Return an identifier for a construction vtable group. TYPE is
4310 the most derived class in the hierarchy; BINFO is the base
4311 subobject for which this construction vtable group will be used.
4313 This mangling isn't part of the ABI specification; in the ABI
4314 specification, the vtable group is dumped in the same COMDAT as the
4315 main vtable, and is referenced only from that vtable, so it doesn't
4316 need an external name. For binary formats without COMDAT sections,
4317 though, we need external names for the vtable groups.
4319 We use the production
4321 <special-name> ::= CT <type> <offset number> _ <base type> */
4324 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4328 start_mangling (type
);
4330 write_string ("_Z");
4331 write_string ("TC");
4333 write_integer_cst (BINFO_OFFSET (binfo
));
4335 write_type (BINFO_TYPE (binfo
));
4337 result
= finish_mangling_get_identifier ();
4339 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4340 IDENTIFIER_POINTER (result
));
4344 /* Mangle a this pointer or result pointer adjustment.
4346 <call-offset> ::= h <fixed offset number> _
4347 ::= v <fixed offset number> _ <virtual offset number> _ */
4350 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4352 write_char (virtual_offset
? 'v' : 'h');
4354 /* For either flavor, write the fixed offset. */
4355 write_integer_cst (fixed_offset
);
4358 /* For a virtual thunk, add the virtual offset. */
4361 write_integer_cst (virtual_offset
);
4366 /* Return an identifier for the mangled name of a this-adjusting or
4367 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4368 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4369 is a virtual thunk, and it is the vtbl offset in
4370 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4371 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4372 thunk itself. A covariant thunk name always includes the adjustment
4373 for the this pointer, even if there is none.
4375 <special-name> ::= T <call-offset> <base encoding>
4376 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4380 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4381 tree virtual_offset
, tree thunk
)
4385 if (abi_version_at_least (11))
4386 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4388 start_mangling (fn_decl
);
4390 write_string ("_Z");
4393 if (!this_adjusting
)
4395 /* Covariant thunk with no this adjustment */
4397 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4398 mangle_call_offset (fixed_offset
, virtual_offset
);
4400 else if (!DECL_THUNK_P (fn_decl
))
4401 /* Plain this adjusting thunk. */
4402 mangle_call_offset (fixed_offset
, virtual_offset
);
4405 /* This adjusting thunk to covariant thunk. */
4407 mangle_call_offset (fixed_offset
, virtual_offset
);
4408 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4409 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4411 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4412 mangle_call_offset (fixed_offset
, virtual_offset
);
4413 fn_decl
= THUNK_TARGET (fn_decl
);
4417 write_encoding (fn_decl
);
4419 result
= finish_mangling_get_identifier ();
4421 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4425 /* Handle ABI backwards compatibility for past bugs where we didn't call
4426 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4427 it makes a difference. If FOR_DECL is non-null, it's the declaration
4428 that we're actually trying to mangle; if it's null, we're mangling the
4429 guard variable for T. */
4432 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4434 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4437 tree oldtags
= get_abi_tags (t
);
4441 tree newtags
= get_abi_tags (t
);
4442 if (newtags
&& newtags
!= oldtags
4443 && abi_version_crosses (ver
))
4445 if (for_decl
&& DECL_THUNK_P (for_decl
))
4446 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4447 "the mangled name of a thunk for %qD changes between "
4448 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4449 t
, flag_abi_version
, warn_abi_version
);
4451 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4452 "the mangled name of %qD changes between "
4453 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4454 for_decl
, flag_abi_version
, warn_abi_version
);
4456 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4457 "the mangled name of the initialization guard variable "
4458 "for %qD changes between %<-fabi-version=%d%> and "
4459 "%<-fabi-version=%d%>",
4460 t
, flag_abi_version
, warn_abi_version
);
4464 /* Write out the appropriate string for this variable when generating
4465 another mangled name based on this one. */
4468 write_guarded_var_name (const tree variable
)
4470 if (DECL_NAME (variable
)
4471 && startswith (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR"))
4472 /* The name of a guard variable for a reference temporary should refer
4473 to the reference, not the temporary. */
4474 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4476 write_name (variable
, /*ignore_local_scope=*/0);
4479 /* Return an identifier for the name of an initialization guard
4480 variable for indicated VARIABLE. */
4483 mangle_guard_variable (const tree variable
)
4485 if (abi_version_at_least (10))
4486 maybe_check_abi_tags (variable
);
4487 start_mangling (variable
);
4488 write_string ("_ZGV");
4489 write_guarded_var_name (variable
);
4490 return finish_mangling_get_identifier ();
4493 /* Return an identifier for the name of a thread_local initialization
4494 function for VARIABLE. */
4497 mangle_tls_init_fn (const tree variable
)
4499 check_abi_tags (variable
);
4500 start_mangling (variable
);
4501 write_string ("_ZTH");
4502 write_guarded_var_name (variable
);
4503 return finish_mangling_get_identifier ();
4506 /* Return an identifier for the name of a thread_local wrapper
4507 function for VARIABLE. */
4509 #define TLS_WRAPPER_PREFIX "_ZTW"
4512 mangle_tls_wrapper_fn (const tree variable
)
4514 check_abi_tags (variable
);
4515 start_mangling (variable
);
4516 write_string (TLS_WRAPPER_PREFIX
);
4517 write_guarded_var_name (variable
);
4518 return finish_mangling_get_identifier ();
4521 /* Return true iff FN is a thread_local wrapper function. */
4524 decl_tls_wrapper_p (const tree fn
)
4526 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4528 tree name
= DECL_NAME (fn
);
4529 return startswith (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
);
4532 /* Return an identifier for the name of a temporary variable used to
4533 initialize a static reference. This is now part of the ABI. */
4536 mangle_ref_init_variable (const tree variable
)
4538 start_mangling (variable
);
4539 write_string ("_ZGR");
4540 check_abi_tags (variable
);
4541 write_name (variable
, /*ignore_local_scope=*/0);
4542 /* Avoid name clashes with aggregate initialization of multiple
4543 references at once. */
4544 write_compact_number (current_ref_temp_count
++);
4545 return finish_mangling_get_identifier ();
4548 /* Return an identifier for the mangled name of a C++20 template parameter
4549 object for template argument EXPR. */
4552 mangle_template_parm_object (tree expr
)
4554 start_mangling (expr
);
4555 write_string ("_ZTAX");
4556 write_expression (expr
);
4558 return finish_mangling_get_identifier ();
4561 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4562 function generates a mangled name for the vtable map variable of
4563 the class type. For example, if the class type is
4564 "std::bad_exception", the mangled name for the class is
4565 "St13bad_exception". This function would generate the name
4566 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4567 "_VTV<std::bad_exception>::__vtable_map". */
4571 get_mangled_vtable_map_var_name (tree class_type
)
4573 char *var_name
= NULL
;
4574 const char *prefix
= "_ZN4_VTVI";
4575 const char *postfix
= "E12__vtable_mapE";
4577 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4579 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4581 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4583 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4584 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4587 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4589 strlen (postfix
) + 1;
4591 var_name
= (char *) xmalloc (len
);
4593 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4598 #include "gt-cp-mangle.h"