1 /* Name mangling for the 3.0 -*- C++ -*- ABI.
2 Copyright (C) 2000-2019 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
106 vec
<tree
, va_gc
> *substitutions
;
108 /* The entity that is being mangled. */
109 tree
GTY ((skip
)) entity
;
111 /* How many parameter scopes we are inside. */
114 /* True if the mangling will be different in a future version of the
116 bool need_abi_warning
;
118 /* True if the mangling will be different in C++17 mode. */
119 bool need_cxx17_warning
;
122 static GTY (()) globals G
;
124 /* The obstack on which we build mangled names. */
125 static struct obstack
*mangle_obstack
;
127 /* The obstack on which we build mangled names that are not going to
128 be IDENTIFIER_NODEs. */
129 static struct obstack name_obstack
;
131 /* The first object on the name_obstack; we use this to free memory
132 allocated on the name_obstack. */
133 static void *name_base
;
135 /* Indices into subst_identifiers. These are identifiers used in
136 special substitution rules. */
144 SUBID_BASIC_IOSTREAM
,
147 substitution_identifier_index_t
;
149 /* For quick substitution checks, look up these common identifiers
151 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
153 /* Single-letter codes for builtin integer types, defined in
154 <builtin-type>. These are indexed by integer_type_kind values. */
156 integer_type_codes
[itk_none
] =
159 'a', /* itk_signed_char */
160 'h', /* itk_unsigned_char */
162 't', /* itk_unsigned_short */
164 'j', /* itk_unsigned_int */
166 'm', /* itk_unsigned_long */
167 'x', /* itk_long_long */
168 'y', /* itk_unsigned_long_long */
169 /* __intN types are handled separately */
170 '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0'
173 static int decl_is_template_id (const tree
, tree
* const);
175 /* Functions for handling substitutions. */
177 static inline tree
canonicalize_for_substitution (tree
);
178 static void add_substitution (tree
);
179 static inline int is_std_substitution (const tree
,
180 const substitution_identifier_index_t
);
181 static inline int is_std_substitution_char (const tree
,
182 const substitution_identifier_index_t
);
183 static int find_substitution (tree
);
184 static void mangle_call_offset (const tree
, const tree
);
186 /* Functions for emitting mangled representations of things. */
188 static void write_mangled_name (const tree
, bool);
189 static void write_encoding (const tree
);
190 static void write_name (tree
, const int);
191 static void write_abi_tags (tree
);
192 static void write_unscoped_name (const tree
);
193 static void write_unscoped_template_name (const tree
);
194 static void write_nested_name (const tree
);
195 static void write_prefix (const tree
);
196 static void write_template_prefix (const tree
);
197 static void write_unqualified_name (tree
);
198 static void write_conversion_operator_name (const tree
);
199 static void write_source_name (tree
);
200 static void write_literal_operator_name (tree
);
201 static void write_unnamed_type_name (const tree
);
202 static void write_closure_type_name (const tree
);
203 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
205 static void write_number (unsigned HOST_WIDE_INT
, const int,
207 static void write_compact_number (int num
);
208 static void write_integer_cst (const tree
);
209 static void write_real_cst (const tree
);
210 static void write_identifier (const char *);
211 static void write_special_name_constructor (const tree
);
212 static void write_special_name_destructor (const tree
);
213 static void write_type (tree
);
214 static int write_CV_qualifiers_for_type (const tree
);
215 static void write_builtin_type (tree
);
216 static void write_function_type (const tree
);
217 static void write_bare_function_type (const tree
, const int, const tree
);
218 static void write_method_parms (tree
, const int, const tree
);
219 static void write_class_enum_type (const tree
);
220 static void write_template_args (tree
);
221 static void write_expression (tree
);
222 static void write_template_arg_literal (const tree
);
223 static void write_template_arg (tree
);
224 static void write_template_template_arg (const tree
);
225 static void write_array_type (const tree
);
226 static void write_pointer_to_member_type (const tree
);
227 static void write_template_param (const tree
);
228 static void write_template_template_param (const tree
);
229 static void write_substitution (const int);
230 static int discriminator_for_local_entity (tree
);
231 static int discriminator_for_string_literal (tree
, tree
);
232 static void write_discriminator (const int);
233 static void write_local_name (tree
, const tree
, const tree
);
234 static void dump_substitution_candidates (void);
235 static tree
mangle_decl_string (const tree
);
236 static void maybe_check_abi_tags (tree
, tree
= NULL_TREE
, int = 10);
237 static bool equal_abi_tags (tree
, tree
);
239 /* Control functions. */
241 static inline void start_mangling (const tree
);
242 static tree
mangle_special_for_type (const tree
, const char *);
244 /* Append a single character to the end of the mangled
246 #define write_char(CHAR) \
247 obstack_1grow (mangle_obstack, (CHAR))
249 /* Append a sized buffer to the end of the mangled representation. */
250 #define write_chars(CHAR, LEN) \
251 obstack_grow (mangle_obstack, (CHAR), (LEN))
253 /* Append a NUL-terminated string to the end of the mangled
255 #define write_string(STRING) \
256 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
258 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
259 same purpose (context, which may be a type) and value (template
260 decl). See write_template_prefix for more information on what this
262 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
263 (TREE_CODE (NODE1) == TREE_LIST \
264 && TREE_CODE (NODE2) == TREE_LIST \
265 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
266 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
267 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
268 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
270 /* Write out an unsigned quantity in base 10. */
271 #define write_unsigned_number(NUMBER) \
272 write_number ((NUMBER), /*unsigned_p=*/1, 10)
274 /* If DECL is a template instance (including the uninstantiated template
275 itself), return nonzero and, if TEMPLATE_INFO is non-NULL, set
276 *TEMPLATE_INFO to its template info. Otherwise return zero. */
279 decl_is_template_id (const tree decl
, tree
* const template_info
)
281 if (TREE_CODE (decl
) == TYPE_DECL
)
283 /* TYPE_DECLs are handled specially. Look at its type to decide
284 if this is a template instantiation. */
285 const tree type
= TREE_TYPE (decl
);
287 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
289 if (template_info
!= NULL
)
290 /* For a templated TYPE_DECL, the template info is hanging
292 *template_info
= TYPE_TEMPLATE_INFO (type
);
298 /* Check if this is a primary template. */
299 if (DECL_LANG_SPECIFIC (decl
) != NULL
300 && VAR_OR_FUNCTION_DECL_P (decl
)
301 && DECL_TEMPLATE_INFO (decl
)
302 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
303 && TREE_CODE (decl
) != TEMPLATE_DECL
)
305 if (template_info
!= NULL
)
306 /* For most templated decls, the template info is hanging
308 *template_info
= DECL_TEMPLATE_INFO (decl
);
313 /* It's not a template id. */
317 /* Produce debugging output of current substitution candidates. */
320 dump_substitution_candidates (void)
325 fprintf (stderr
, " ++ substitutions ");
326 FOR_EACH_VEC_ELT (*G
.substitutions
, i
, el
)
328 const char *name
= "???";
331 fprintf (stderr
, " ");
333 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
334 else if (TREE_CODE (el
) == TREE_LIST
)
335 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
336 else if (TYPE_NAME (el
))
337 name
= TYPE_NAME_STRING (el
);
338 fprintf (stderr
, " S%d_ = ", i
- 1);
340 (CP_TYPE_RESTRICT_P (el
)
341 || CP_TYPE_VOLATILE_P (el
)
342 || CP_TYPE_CONST_P (el
)))
343 fprintf (stderr
, "CV-");
344 fprintf (stderr
, "%s (%s at %p)\n",
345 name
, get_tree_code_name (TREE_CODE (el
)), (void *) el
);
349 /* <exception-spec> ::=
350 Do -- non-throwing exception specification
351 DO <expression> E -- computed (instantiation-dependent) noexcept
352 Dw <type>* E -- throw (types) */
355 write_exception_spec (tree spec
)
358 if (!spec
|| spec
== noexcept_false_spec
)
362 if (!flag_noexcept_type
)
364 G
.need_cxx17_warning
= true;
368 if (spec
== noexcept_true_spec
|| spec
== empty_except_spec
)
370 else if (tree expr
= TREE_PURPOSE (spec
))
372 /* noexcept (expr) */
373 gcc_assert (uses_template_parms (expr
));
375 write_expression (expr
);
380 /* throw (type-list) */
382 for (tree t
= spec
; t
; t
= TREE_CHAIN (t
))
383 write_type (TREE_VALUE (t
));
388 /* Both decls and types can be substitution candidates, but sometimes
389 they refer to the same thing. For instance, a TYPE_DECL and
390 RECORD_TYPE for the same class refer to the same thing, and should
391 be treated accordingly in substitutions. This function returns a
392 canonicalized tree node representing NODE that is used when adding
393 and substitution candidates and finding matches. */
396 canonicalize_for_substitution (tree node
)
398 /* For a TYPE_DECL, use the type instead. */
399 if (TREE_CODE (node
) == TYPE_DECL
)
400 node
= TREE_TYPE (node
);
402 && TYPE_CANONICAL (node
) != node
403 && TYPE_MAIN_VARIANT (node
) != node
)
406 /* Here we want to strip the topmost typedef only.
407 We need to do that so is_std_substitution can do proper
409 if (TREE_CODE (node
) == FUNCTION_TYPE
)
410 /* Use build_qualified_type and TYPE_QUALS here to preserve
411 the old buggy mangling of attribute noreturn with abi<5. */
412 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
415 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
416 cp_type_quals (node
));
417 if (TREE_CODE (node
) == FUNCTION_TYPE
418 || TREE_CODE (node
) == METHOD_TYPE
)
420 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
421 tree r
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig
));
422 if (flag_noexcept_type
)
423 node
= build_exception_variant (node
, r
);
425 /* Set the warning flag if appropriate. */
426 write_exception_spec (r
);
432 /* Add NODE as a substitution candidate. NODE must not already be on
433 the list of candidates. */
436 add_substitution (tree node
)
441 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
442 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
444 /* Get the canonicalized substitution candidate for NODE. */
445 c
= canonicalize_for_substitution (node
);
446 if (DEBUG_MANGLE
&& c
!= node
)
447 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
448 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
451 /* Make sure NODE isn't already a candidate. */
457 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
459 gcc_assert (!(DECL_P (node
) && node
== candidate
));
460 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
461 && same_type_p (node
, candidate
)));
465 /* Put the decl onto the varray of substitution candidates. */
466 vec_safe_push (G
.substitutions
, node
);
469 dump_substitution_candidates ();
472 /* Helper function for find_substitution. Returns nonzero if NODE,
473 which may be a decl or a CLASS_TYPE, is a template-id with template
474 name of substitution_index[INDEX] in the ::std namespace. */
477 is_std_substitution (const tree node
,
478 const substitution_identifier_index_t index
)
485 type
= TREE_TYPE (node
);
488 else if (CLASS_TYPE_P (node
))
491 decl
= TYPE_NAME (node
);
494 /* These are not the droids you're looking for. */
497 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
498 && TYPE_LANG_SPECIFIC (type
)
499 && TYPE_TEMPLATE_INFO (type
)
500 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
501 == subst_identifiers
[index
]));
504 /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
505 which can be a decl or type. */
508 get_abi_tags (tree t
)
510 if (!t
|| TREE_CODE (t
) == NAMESPACE_DECL
)
513 if (DECL_P (t
) && DECL_DECLARES_TYPE_P (t
))
518 attrs
= TYPE_ATTRIBUTES (t
);
520 attrs
= DECL_ATTRIBUTES (t
);
522 tree tags
= lookup_attribute ("abi_tag", attrs
);
524 tags
= TREE_VALUE (tags
);
528 /* Helper function for find_substitution. Returns nonzero if NODE,
529 which may be a decl or a CLASS_TYPE, is the template-id
530 ::std::identifier<char>, where identifier is
531 substitution_index[INDEX]. */
534 is_std_substitution_char (const tree node
,
535 const substitution_identifier_index_t index
)
538 /* Check NODE's name is ::std::identifier. */
539 if (!is_std_substitution (node
, index
))
541 /* Figure out its template args. */
543 args
= DECL_TI_ARGS (node
);
544 else if (CLASS_TYPE_P (node
))
545 args
= CLASSTYPE_TI_ARGS (node
);
547 /* Oops, not a template. */
549 /* NODE's template arg list should be <char>. */
551 TREE_VEC_LENGTH (args
) == 1
552 && TREE_VEC_ELT (args
, 0) == char_type_node
;
555 /* Check whether a substitution should be used to represent NODE in
558 First, check standard special-case substitutions.
560 <substitution> ::= St
567 # ::std::basic_string
570 # ::std::basic_string<char,
571 ::std::char_traits<char>,
572 ::std::allocator<char> >
575 # ::std::basic_istream<char, ::std::char_traits<char> >
578 # ::std::basic_ostream<char, ::std::char_traits<char> >
581 # ::std::basic_iostream<char, ::std::char_traits<char> >
583 Then examine the stack of currently available substitution
584 candidates for entities appearing earlier in the same mangling
586 If a substitution is found, write its mangled representation and
587 return nonzero. If none is found, just return zero. */
590 find_substitution (tree node
)
593 const int size
= vec_safe_length (G
.substitutions
);
596 const char *abbr
= NULL
;
599 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
600 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
602 /* Obtain the canonicalized substitution representation for NODE.
603 This is what we'll compare against. */
604 node
= canonicalize_for_substitution (node
);
606 /* Check for builtin substitutions. */
608 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
609 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
611 /* Check for std::allocator. */
613 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
614 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
617 /* Check for std::basic_string. */
618 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
622 /* If this is a type (i.e. a fully-qualified template-id),
624 std::basic_string <char,
625 std::char_traits<char>,
626 std::allocator<char> > . */
627 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
628 && CLASSTYPE_USE_TEMPLATE (type
))
630 tree args
= CLASSTYPE_TI_ARGS (type
);
631 if (TREE_VEC_LENGTH (args
) == 3
632 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
633 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
635 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
641 /* Substitute for the template name only if this isn't a type. */
645 /* Check for basic_{i,o,io}stream. */
646 else if (TYPE_P (node
)
647 && cp_type_quals (type
) == TYPE_UNQUALIFIED
648 && CLASS_TYPE_P (type
)
649 && CLASSTYPE_USE_TEMPLATE (type
)
650 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
652 /* First, check for the template
653 args <char, std::char_traits<char> > . */
654 tree args
= CLASSTYPE_TI_ARGS (type
);
655 if (TREE_VEC_LENGTH (args
) == 2
656 && TYPE_P (TREE_VEC_ELT (args
, 0))
657 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
658 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
661 /* Got them. Is this basic_istream? */
662 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
664 /* Or basic_ostream? */
665 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
667 /* Or basic_iostream? */
668 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
673 /* Check for namespace std. */
674 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
680 tree tags
= NULL_TREE
;
681 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
682 tags
= get_abi_tags (type
);
683 /* Now check the list of available substitutions for this mangling
685 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
687 tree candidate
= (*G
.substitutions
)[i
];
688 /* NODE is a matched to a candidate if it's the same decl node or
689 if it's the same type. */
690 if (decl
== candidate
691 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
692 && same_type_p (type
, candidate
))
693 || NESTED_TEMPLATE_MATCH (node
, candidate
))
695 write_substitution (i
);
701 /* No substitution found. */
707 /* If there are ABI tags on the abbreviation, it becomes
708 a substitution candidate. */
709 write_abi_tags (tags
);
710 add_substitution (node
);
715 /* Returns whether DECL's symbol name should be the plain unqualified-id
716 rather than a more complicated mangled name. */
719 unmangled_name_p (const tree decl
)
721 if (TREE_CODE (decl
) == FUNCTION_DECL
)
723 /* The names of `extern "C"' functions are not mangled. */
724 return (DECL_EXTERN_C_FUNCTION_P (decl
)
725 /* But overloaded operator names *are* mangled. */
726 && !DECL_OVERLOADED_OPERATOR_P (decl
));
728 else if (VAR_P (decl
))
730 /* static variables are mangled. */
731 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
734 /* extern "C" declarations aren't mangled. */
735 if (DECL_EXTERN_C_P (decl
))
738 /* Other variables at non-global scope are mangled. */
739 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
742 /* Variable template instantiations are mangled. */
743 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
744 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
747 /* Declarations with ABI tags are mangled. */
748 if (get_abi_tags (decl
))
751 /* The names of non-static global variables aren't mangled. */
758 /* TOP_LEVEL is true, if this is being called at outermost level of
759 mangling. It should be false when mangling a decl appearing in an
760 expression within some other mangling.
762 <mangled-name> ::= _Z <encoding> */
765 write_mangled_name (const tree decl
, bool top_level
)
767 MANGLE_TRACE_TREE ("mangled-name", decl
);
769 check_abi_tags (decl
);
771 if (unmangled_name_p (decl
))
774 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
777 /* The standard notes: "The <encoding> of an extern "C"
778 function is treated like global-scope data, i.e. as its
779 <source-name> without a type." We cannot write
780 overloaded operators that way though, because it contains
781 characters invalid in assembler. */
783 write_source_name (DECL_NAME (decl
));
789 write_encoding (decl
);
793 /* Returns true if the return type of DECL is part of its signature, and
794 therefore its mangling. */
797 mangle_return_type_p (tree decl
)
799 return (!DECL_CONSTRUCTOR_P (decl
)
800 && !DECL_DESTRUCTOR_P (decl
)
801 && !DECL_CONV_FN_P (decl
)
802 && decl_is_template_id (decl
, NULL
));
805 /* <encoding> ::= <function name> <bare-function-type>
809 write_encoding (const tree decl
)
811 MANGLE_TRACE_TREE ("encoding", decl
);
813 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
815 /* For overloaded operators write just the mangled name
816 without arguments. */
817 if (DECL_OVERLOADED_OPERATOR_P (decl
))
818 write_name (decl
, /*ignore_local_scope=*/0);
820 write_source_name (DECL_NAME (decl
));
824 write_name (decl
, /*ignore_local_scope=*/0);
825 if (TREE_CODE (decl
) == FUNCTION_DECL
)
829 bool tmpl
= decl_is_template_id (decl
, NULL
);
833 fn_type
= get_mostly_instantiated_function_type (decl
);
834 /* FN_TYPE will not have parameter types for in-charge or
835 VTT parameters. Therefore, we pass NULL_TREE to
836 write_bare_function_type -- otherwise, it will get
837 confused about which artificial parameters to skip. */
842 fn_type
= TREE_TYPE (decl
);
846 write_bare_function_type (fn_type
,
847 mangle_return_type_p (decl
),
852 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
853 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
856 decl_mangling_context (tree decl
)
858 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
860 if (tcontext
!= NULL_TREE
)
863 if (TREE_CODE (decl
) == TEMPLATE_DECL
864 && DECL_TEMPLATE_RESULT (decl
))
865 decl
= DECL_TEMPLATE_RESULT (decl
);
867 if (TREE_CODE (decl
) == TYPE_DECL
868 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
870 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
874 else if (template_type_parameter_p (decl
))
875 /* template type parms have no mangling context. */
877 return CP_DECL_CONTEXT (decl
);
880 /* <name> ::= <unscoped-name>
881 ::= <unscoped-template-name> <template-args>
885 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
886 called from <local-name>, which mangles the enclosing scope
887 elsewhere and then uses this function to mangle just the part
888 underneath the function scope. So don't use the <local-name>
889 production, to avoid an infinite recursion. */
892 write_name (tree decl
, const int ignore_local_scope
)
896 MANGLE_TRACE_TREE ("name", decl
);
898 if (TREE_CODE (decl
) == TYPE_DECL
)
900 /* In case this is a typedef, fish out the corresponding
901 TYPE_DECL for the main variant. */
902 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
905 context
= decl_mangling_context (decl
);
907 gcc_assert (context
!= NULL_TREE
);
909 if (abi_warn_or_compat_version_crosses (7)
910 && ignore_local_scope
911 && TREE_CODE (context
) == PARM_DECL
)
912 G
.need_abi_warning
= 1;
914 /* A decl in :: or ::std scope is treated specially. The former is
915 mangled using <unscoped-name> or <unscoped-template-name>, the
916 latter with a special substitution. Also, a name that is
917 directly in a local function scope is also mangled with
918 <unscoped-name> rather than a full <nested-name>. */
919 if (context
== global_namespace
920 || DECL_NAMESPACE_STD_P (context
)
921 || (ignore_local_scope
922 && (TREE_CODE (context
) == FUNCTION_DECL
923 || (abi_version_at_least (7)
924 && TREE_CODE (context
) == PARM_DECL
))))
927 /* Is this a template instance? */
928 if (decl_is_template_id (decl
, &template_info
))
930 /* Yes: use <unscoped-template-name>. */
931 write_unscoped_template_name (TI_TEMPLATE (template_info
));
932 write_template_args (TI_ARGS (template_info
));
935 /* Everything else gets an <unqualified-name>. */
936 write_unscoped_name (decl
);
940 /* Handle local names, unless we asked not to (that is, invoked
941 under <local-name>, to handle only the part of the name under
943 if (!ignore_local_scope
)
945 /* Scan up the list of scope context, looking for a
946 function. If we find one, this entity is in local
947 function scope. local_entity tracks context one scope
948 level down, so it will contain the element that's
949 directly in that function's scope, either decl or one of
950 its enclosing scopes. */
951 tree local_entity
= decl
;
952 while (context
!= global_namespace
)
954 /* Make sure we're always dealing with decls. */
955 if (TYPE_P (context
))
956 context
= TYPE_NAME (context
);
957 /* Is this a function? */
958 if (TREE_CODE (context
) == FUNCTION_DECL
959 || TREE_CODE (context
) == PARM_DECL
)
961 /* Yes, we have local scope. Use the <local-name>
962 production for the innermost function scope. */
963 write_local_name (context
, local_entity
, decl
);
966 /* Up one scope level. */
967 local_entity
= context
;
968 context
= decl_mangling_context (context
);
971 /* No local scope found? Fall through to <nested-name>. */
974 /* Other decls get a <nested-name> to encode their scope. */
975 write_nested_name (decl
);
979 /* <unscoped-name> ::= <unqualified-name>
980 ::= St <unqualified-name> # ::std:: */
983 write_unscoped_name (const tree decl
)
985 tree context
= decl_mangling_context (decl
);
987 MANGLE_TRACE_TREE ("unscoped-name", decl
);
989 /* Is DECL in ::std? */
990 if (DECL_NAMESPACE_STD_P (context
))
993 write_unqualified_name (decl
);
997 /* If not, it should be either in the global namespace, or directly
998 in a local function scope. A lambda can also be mangled in the
999 scope of a default argument. */
1000 gcc_assert (context
== global_namespace
1001 || TREE_CODE (context
) == PARM_DECL
1002 || TREE_CODE (context
) == FUNCTION_DECL
);
1004 write_unqualified_name (decl
);
1008 /* <unscoped-template-name> ::= <unscoped-name>
1009 ::= <substitution> */
1012 write_unscoped_template_name (const tree decl
)
1014 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
1016 if (find_substitution (decl
))
1018 write_unscoped_name (decl
);
1019 add_substitution (decl
);
1022 /* Write the nested name, including CV-qualifiers, of DECL.
1024 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1025 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1027 <ref-qualifier> ::= R # & ref-qualifier
1028 ::= O # && ref-qualifier
1029 <CV-qualifiers> ::= [r] [V] [K] */
1032 write_nested_name (const tree decl
)
1036 MANGLE_TRACE_TREE ("nested-name", decl
);
1040 /* Write CV-qualifiers, if this is a member function. */
1041 if (TREE_CODE (decl
) == FUNCTION_DECL
1042 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1044 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1046 if (DECL_CONST_MEMFUNC_P (decl
))
1048 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1050 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1057 /* Is this a template instance? */
1058 if (decl_is_template_id (decl
, &template_info
))
1060 /* Yes, use <template-prefix>. */
1061 write_template_prefix (decl
);
1062 write_template_args (TI_ARGS (template_info
));
1064 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1065 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1067 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1068 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1070 write_template_prefix (decl
);
1071 write_template_args (TREE_OPERAND (name
, 1));
1075 write_prefix (decl_mangling_context (decl
));
1076 write_unqualified_name (decl
);
1081 /* No, just use <prefix> */
1082 write_prefix (decl_mangling_context (decl
));
1083 write_unqualified_name (decl
);
1088 /* <prefix> ::= <prefix> <unqualified-name>
1089 ::= <template-param>
1090 ::= <template-prefix> <template-args>
1093 ::= <substitution> */
1096 write_prefix (const tree node
)
1099 /* Non-NULL if NODE represents a template-id. */
1100 tree template_info
= NULL
;
1103 || node
== global_namespace
)
1106 MANGLE_TRACE_TREE ("prefix", node
);
1108 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1114 if (find_substitution (node
))
1119 /* If this is a function or parm decl, that means we've hit function
1120 scope, so this prefix must be for a local name. In this
1121 case, we're under the <local-name> production, which encodes
1122 the enclosing function scope elsewhere. So don't continue
1124 if (TREE_CODE (node
) == FUNCTION_DECL
1125 || TREE_CODE (node
) == PARM_DECL
)
1129 decl_is_template_id (decl
, &template_info
);
1133 /* Node is a type. */
1134 decl
= TYPE_NAME (node
);
1135 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1136 template_info
= TYPE_TEMPLATE_INFO (node
);
1139 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1140 write_template_param (node
);
1141 else if (template_info
!= NULL
)
1144 write_template_prefix (decl
);
1145 write_template_args (TI_ARGS (template_info
));
1147 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1149 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1150 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1152 write_template_prefix (decl
);
1153 write_template_args (TREE_OPERAND (name
, 1));
1157 write_prefix (decl_mangling_context (decl
));
1158 write_unqualified_name (decl
);
1162 /* Not templated. */
1164 write_prefix (decl_mangling_context (decl
));
1165 write_unqualified_name (decl
);
1167 || TREE_CODE (decl
) == FIELD_DECL
)
1169 /* <data-member-prefix> := <member source-name> M */
1175 add_substitution (node
);
1178 /* <template-prefix> ::= <prefix> <template component>
1179 ::= <template-param>
1180 ::= <substitution> */
1183 write_template_prefix (const tree node
)
1185 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1186 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1187 tree context
= decl_mangling_context (decl
);
1192 MANGLE_TRACE_TREE ("template-prefix", node
);
1194 /* Find the template decl. */
1195 if (decl_is_template_id (decl
, &template_info
))
1196 templ
= TI_TEMPLATE (template_info
);
1197 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1198 /* For a typename type, all we have is the name. */
1199 templ
= DECL_NAME (decl
);
1202 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1204 templ
= TYPE_TI_TEMPLATE (type
);
1207 /* For a member template, though, the template name for the
1208 innermost name must have all the outer template levels
1209 instantiated. For instance, consider
1211 template<typename T> struct Outer {
1212 template<typename U> struct Inner {};
1215 The template name for `Inner' in `Outer<int>::Inner<float>' is
1216 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1217 levels separately, so there's no TEMPLATE_DECL available for this
1218 (there's only `Outer<T>::Inner<U>').
1220 In order to get the substitutions right, we create a special
1221 TREE_LIST to represent the substitution candidate for a nested
1222 template. The TREE_PURPOSE is the template's context, fully
1223 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1226 So, for the example above, `Outer<int>::Inner' is represented as a
1227 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1228 and whose value is `Outer<T>::Inner<U>'. */
1229 if (context
&& TYPE_P (context
))
1230 substitution
= build_tree_list (context
, templ
);
1232 substitution
= templ
;
1234 if (find_substitution (substitution
))
1237 if (TREE_TYPE (templ
)
1238 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1239 write_template_param (TREE_TYPE (templ
));
1242 write_prefix (context
);
1243 write_unqualified_name (decl
);
1246 add_substitution (substitution
);
1249 /* As the list of identifiers for the structured binding declaration
1250 DECL is likely gone, try to recover the DC <source-name>+ E portion
1251 from its mangled name. Return pointer to the DC and set len to
1252 the length up to and including the terminating E. On failure
1256 find_decomp_unqualified_name (tree decl
, size_t *len
)
1258 const char *p
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1259 const char *end
= p
+ IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
1260 bool nested
= false;
1261 if (strncmp (p
, "_Z", 2))
1264 if (!strncmp (p
, "St", 2))
1270 while (ISDIGIT (p
[0]))
1273 long num
= strtol (p
, &e
, 10);
1274 if (num
>= 1 && num
< end
- e
)
1280 if (strncmp (p
, "DC", 2))
1294 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1295 mangled through special entry points.
1297 <unqualified-name> ::= <operator-name>
1300 ::= <unnamed-type-name>
1301 ::= <local-source-name>
1303 <local-source-name> ::= L <source-name> <discriminator> */
1306 write_unqualified_id (tree identifier
)
1308 if (IDENTIFIER_CONV_OP_P (identifier
))
1309 write_conversion_operator_name (TREE_TYPE (identifier
));
1310 else if (IDENTIFIER_OVL_OP_P (identifier
))
1312 const ovl_op_info_t
*ovl_op
= IDENTIFIER_OVL_OP_INFO (identifier
);
1313 write_string (ovl_op
->mangled_name
);
1315 else if (UDLIT_OPER_P (identifier
))
1316 write_literal_operator_name (identifier
);
1318 write_source_name (identifier
);
1322 write_unqualified_name (tree decl
)
1324 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1326 if (identifier_p (decl
))
1328 write_unqualified_id (decl
);
1334 if (DECL_NAME (decl
) == NULL_TREE
)
1337 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1338 const char *decomp_str
= NULL
;
1339 size_t decomp_len
= 0;
1341 && DECL_DECOMPOSITION_P (decl
)
1342 && DECL_NAME (decl
) == NULL_TREE
1343 && DECL_NAMESPACE_SCOPE_P (decl
))
1344 decomp_str
= find_decomp_unqualified_name (decl
, &decomp_len
);
1346 write_chars (decomp_str
, decomp_len
);
1348 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1350 else if (DECL_DECLARES_FUNCTION_P (decl
))
1353 if (DECL_CONSTRUCTOR_P (decl
))
1354 write_special_name_constructor (decl
);
1355 else if (DECL_DESTRUCTOR_P (decl
))
1356 write_special_name_destructor (decl
);
1357 else if (DECL_CONV_FN_P (decl
))
1359 /* Conversion operator. Handle it right here.
1360 <operator> ::= cv <type> */
1362 if (decl_is_template_id (decl
, NULL
))
1365 fn_type
= get_mostly_instantiated_function_type (decl
);
1366 type
= TREE_TYPE (fn_type
);
1368 else if (FNDECL_USED_AUTO (decl
))
1369 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1370 ->x_auto_return_pattern
);
1372 type
= DECL_CONV_FN_TYPE (decl
);
1373 write_conversion_operator_name (type
);
1375 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1377 const char *mangled_name
1378 = (ovl_op_info
[DECL_ASSIGNMENT_OPERATOR_P (decl
)]
1379 [DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
)].mangled_name
);
1380 write_string (mangled_name
);
1382 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1383 write_literal_operator_name (DECL_NAME (decl
));
1390 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1391 && DECL_NAMESPACE_SCOPE_P (decl
)
1392 && decl_linkage (decl
) == lk_internal
)
1394 MANGLE_TRACE_TREE ("local-source-name", decl
);
1396 write_source_name (DECL_NAME (decl
));
1397 /* The default discriminator is 1, and that's all we ever use,
1398 so there's no code to output one here. */
1402 tree type
= TREE_TYPE (decl
);
1404 if (TREE_CODE (decl
) == TYPE_DECL
1405 && TYPE_UNNAMED_P (type
))
1406 write_unnamed_type_name (type
);
1407 else if (TREE_CODE (decl
) == TYPE_DECL
1408 && LAMBDA_TYPE_P (type
))
1409 write_closure_type_name (type
);
1411 write_source_name (DECL_NAME (decl
));
1414 /* We use the ABI tags from the primary class template, ignoring tags on any
1415 specializations. This is necessary because C++ doesn't require a
1416 specialization to be declared before it is used unless the use requires a
1417 complete type, but we need to get the tags right on incomplete types as
1419 if (tree tmpl
= most_general_template (decl
))
1421 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1422 if (res
== NULL_TREE
)
1423 /* UNBOUND_CLASS_TEMPLATE. */;
1424 else if (DECL_DECLARES_TYPE_P (decl
))
1426 else if (any_abi_below (11))
1428 /* ABI v10 implicit tags on the template. */
1429 tree mtags
= missing_abi_tags (res
);
1430 /* Explicit tags on the template. */
1431 tree ttags
= get_abi_tags (res
);
1432 /* Tags on the instantiation. */
1433 tree dtags
= get_abi_tags (decl
);
1435 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1436 G
.need_abi_warning
= 1;
1438 /* Add the v10 tags to the explicit tags now. */
1439 mtags
= chainon (mtags
, ttags
);
1441 if (!G
.need_abi_warning
1442 && abi_warn_or_compat_version_crosses (11)
1443 && !equal_abi_tags (dtags
, mtags
))
1444 G
.need_abi_warning
= 1;
1446 if (!abi_version_at_least (10))
1447 /* In abi <10, we only got the explicit tags. */
1449 else if (flag_abi_version
== 10)
1451 /* In ABI 10, we want explict and implicit tags. */
1452 write_abi_tags (mtags
);
1458 tree tags
= get_abi_tags (decl
);
1459 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1460 && any_abi_below (11))
1461 if (tree mtags
= missing_abi_tags (decl
))
1463 if (abi_warn_or_compat_version_crosses (11))
1464 G
.need_abi_warning
= true;
1465 if (!abi_version_at_least (11))
1466 tags
= chainon (mtags
, tags
);
1468 write_abi_tags (tags
);
1471 /* Write the unqualified-name for a conversion operator to TYPE. */
1474 write_conversion_operator_name (const tree type
)
1476 write_string ("cv");
1480 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1482 <source-name> ::= </length/ number> <identifier> */
1485 write_source_name (tree identifier
)
1487 MANGLE_TRACE_TREE ("source-name", identifier
);
1489 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1490 write_identifier (IDENTIFIER_POINTER (identifier
));
1493 /* Compare two TREE_STRINGs like strcmp. */
1496 tree_string_cmp (const void *p1
, const void *p2
)
1500 tree s1
= *(const tree
*)p1
;
1501 tree s2
= *(const tree
*)p2
;
1502 return strcmp (TREE_STRING_POINTER (s1
),
1503 TREE_STRING_POINTER (s2
));
1506 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1508 static vec
<tree
, va_gc
> *
1509 sorted_abi_tags (tree tags
)
1511 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1513 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1515 if (ABI_TAG_IMPLICIT (t
))
1517 tree str
= TREE_VALUE (t
);
1518 vec_safe_push (vec
, str
);
1521 vec
->qsort (tree_string_cmp
);
1526 /* ID is the name of a function or type with abi_tags attribute TAGS.
1527 Write out the name, suitably decorated. */
1530 write_abi_tags (tree tags
)
1532 if (tags
== NULL_TREE
)
1535 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1537 unsigned i
; tree str
;
1538 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1541 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1542 write_identifier (TREE_STRING_POINTER (str
));
1545 release_tree_vector (vec
);
1548 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1551 equal_abi_tags (tree t1
, tree t2
)
1553 releasing_vec v1
= sorted_abi_tags (t1
);
1554 releasing_vec v2
= sorted_abi_tags (t2
);
1556 unsigned len1
= v1
->length();
1557 if (len1
!= v2
->length())
1559 for (unsigned i
= 0; i
< len1
; ++i
)
1560 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1565 /* Write a user-defined literal operator.
1566 ::= li <source-name> # "" <source-name>
1567 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1570 write_literal_operator_name (tree identifier
)
1572 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1573 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1574 write_unsigned_number (strlen (suffix
));
1575 write_identifier (suffix
);
1578 /* Encode 0 as _, and 1+ as n-1_. */
1581 write_compact_number (int num
)
1584 write_unsigned_number (num
- 1);
1588 /* Return how many unnamed types precede TYPE in its enclosing class. */
1591 nested_anon_class_index (tree type
)
1594 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1595 for (; member
; member
= DECL_CHAIN (member
))
1596 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1598 tree memtype
= TREE_TYPE (member
);
1599 if (memtype
== type
)
1601 else if (TYPE_UNNAMED_P (memtype
))
1611 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1614 write_unnamed_type_name (const tree type
)
1617 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1619 if (TYPE_FUNCTION_SCOPE_P (type
))
1620 discriminator
= discriminator_for_local_entity (TYPE_NAME (type
));
1621 else if (TYPE_CLASS_SCOPE_P (type
))
1622 discriminator
= nested_anon_class_index (type
);
1625 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1626 /* Just use the old mangling at namespace scope. */
1627 write_source_name (TYPE_IDENTIFIER (type
));
1631 write_string ("Ut");
1632 write_compact_number (discriminator
);
1635 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1636 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1639 write_closure_type_name (const tree type
)
1641 tree fn
= lambda_function (type
);
1642 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1643 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1645 MANGLE_TRACE_TREE ("closure-type-name", type
);
1647 write_string ("Ul");
1648 write_method_parms (parms
, /*method_p=*/1, fn
);
1650 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1653 /* Convert NUMBER to ascii using base BASE and generating at least
1654 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1655 into which to store the characters. Returns the number of
1656 characters generated (these will be laid out in advance of where
1660 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1661 char *buffer
, const unsigned int min_digits
)
1663 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1664 unsigned digits
= 0;
1668 unsigned HOST_WIDE_INT d
= number
/ base
;
1670 *--buffer
= base_digits
[number
- d
* base
];
1674 while (digits
< min_digits
)
1676 *--buffer
= base_digits
[0];
1682 /* Non-terminal <number>.
1684 <number> ::= [n] </decimal integer/> */
1687 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1688 const unsigned int base
)
1690 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1693 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1696 number
= -((HOST_WIDE_INT
) number
);
1698 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1699 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1702 /* Write out an integral CST in decimal. Most numbers are small, and
1703 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1704 bigger than that, which we must deal with. */
1707 write_integer_cst (const tree cst
)
1709 int sign
= tree_int_cst_sgn (cst
);
1710 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1711 if (!wi::fits_uhwi_p (abs_value
))
1713 /* A bignum. We do this in chunks, each of which fits in a
1715 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1716 unsigned HOST_WIDE_INT chunk
;
1717 unsigned chunk_digits
;
1718 char *ptr
= buffer
+ sizeof (buffer
);
1723 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1728 if (sizeof (HOST_WIDE_INT
) >= 8)
1730 /* It is at least 64 bits, so 10^18 is representable. */
1735 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1736 base
= build_int_cstu (type
, chunk
);
1737 n
= wide_int_to_tree (type
, wi::to_wide (cst
));
1742 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1746 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1747 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1750 done
= integer_zerop (d
);
1751 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1752 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1753 done
? 1 : chunk_digits
);
1759 write_chars (ptr
, count
);
1766 write_unsigned_number (abs_value
.to_uhwi ());
1770 /* Write out a floating-point literal.
1772 "Floating-point literals are encoded using the bit pattern of the
1773 target processor's internal representation of that number, as a
1774 fixed-length lowercase hexadecimal string, high-order bytes first
1775 (even if the target processor would store low-order bytes first).
1776 The "n" prefix is not used for floating-point literals; the sign
1777 bit is encoded with the rest of the number.
1779 Here are some examples, assuming the IEEE standard representation
1780 for floating point numbers. (Spaces are for readability, not
1781 part of the encoding.)
1784 -1.0f Lf bf80 0000 E
1785 1.17549435e-38f Lf 0080 0000 E
1786 1.40129846e-45f Lf 0000 0001 E
1787 0.0f Lf 0000 0000 E"
1789 Caller is responsible for the Lx and the E. */
1791 write_real_cst (const tree value
)
1793 long target_real
[4]; /* largest supported float */
1794 /* Buffer for eight hex digits in a 32-bit number but big enough
1795 even for 64-bit long to avoid warnings. */
1799 tree type
= TREE_TYPE (value
);
1800 int words
= GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type
)) / 32;
1802 real_to_target (target_real
, &TREE_REAL_CST (value
),
1805 /* The value in target_real is in the target word order,
1806 so we must write it out backward if that happens to be
1807 little-endian. write_number cannot be used, it will
1808 produce uppercase. */
1809 if (FLOAT_WORDS_BIG_ENDIAN
)
1810 i
= 0, limit
= words
, dir
= 1;
1812 i
= words
- 1, limit
= -1, dir
= -1;
1814 for (; i
!= limit
; i
+= dir
)
1816 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1817 write_chars (buffer
, 8);
1821 /* Non-terminal <identifier>.
1823 <identifier> ::= </unqualified source code identifier> */
1826 write_identifier (const char *identifier
)
1828 MANGLE_TRACE ("identifier", identifier
);
1829 write_string (identifier
);
1832 /* Handle constructor productions of non-terminal <special-name>.
1833 CTOR is a constructor FUNCTION_DECL.
1835 <special-name> ::= C1 # complete object constructor
1836 ::= C2 # base object constructor
1837 ::= C3 # complete object allocating constructor
1839 Currently, allocating constructors are never used. */
1842 write_special_name_constructor (const tree ctor
)
1845 bool new_inh
= (flag_new_inheriting_ctors
1846 && DECL_INHERITED_CTOR (ctor
));
1849 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1851 /* This is the old-style "[unified]" constructor.
1852 In some cases, we may emit this function and call
1853 it from the clones in order to share code and save space. */
1854 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1858 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1862 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1865 /* Handle destructor productions of non-terminal <special-name>.
1866 DTOR is a destructor FUNCTION_DECL.
1868 <special-name> ::= D0 # deleting (in-charge) destructor
1869 ::= D1 # complete object (in-charge) destructor
1870 ::= D2 # base object (not-in-charge) destructor */
1873 write_special_name_destructor (const tree dtor
)
1875 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1876 write_string ("D0");
1877 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1878 write_string ("D2");
1879 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1880 /* This is the old-style "[unified]" destructor.
1881 In some cases, we may emit this function and call
1882 it from the clones in order to share code and save space. */
1883 write_string ("D4");
1886 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1887 write_string ("D1");
1891 /* Return the discriminator for ENTITY appearing inside
1892 FUNCTION. The discriminator is the lexical ordinal of VAR or TYPE among
1893 entities with the same name and kind in the same FUNCTION. */
1896 discriminator_for_local_entity (tree entity
)
1898 if (!DECL_LANG_SPECIFIC (entity
))
1900 /* Some decls, like __FUNCTION__, don't need a discriminator. */
1901 gcc_checking_assert (DECL_ARTIFICIAL (entity
));
1904 else if (tree disc
= DECL_DISCRIMINATOR (entity
))
1905 return TREE_INT_CST_LOW (disc
);
1907 /* The first entity with a particular name doesn't get
1908 DECL_DISCRIMINATOR set up. */
1912 /* Return the discriminator for STRING, a string literal used inside
1913 FUNCTION. The discriminator is the lexical ordinal of STRING among
1914 string literals used in FUNCTION. */
1917 discriminator_for_string_literal (tree
/*function*/,
1920 /* For now, we don't discriminate amongst string literals. */
1924 /* <discriminator> := _ <number> # when number < 10
1925 := __ <number> _ # when number >= 10
1927 The discriminator is used only for the second and later occurrences
1928 of the same name within a single function. In this case <number> is
1929 n - 2, if this is the nth occurrence, in lexical order. */
1932 write_discriminator (const int discriminator
)
1934 /* If discriminator is zero, don't write anything. Otherwise... */
1935 if (discriminator
> 0)
1938 if (discriminator
- 1 >= 10)
1940 if (abi_warn_or_compat_version_crosses (11))
1941 G
.need_abi_warning
= 1;
1942 if (abi_version_at_least (11))
1945 write_unsigned_number (discriminator
- 1);
1946 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
1951 /* Mangle the name of a function-scope entity. FUNCTION is the
1952 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1953 default argument scope. ENTITY is the decl for the entity itself.
1954 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1955 either ENTITY itself or an enclosing scope of ENTITY.
1957 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1958 := Z <function encoding> E s [<discriminator>]
1959 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1962 write_local_name (tree function
, const tree local_entity
,
1965 tree parm
= NULL_TREE
;
1967 MANGLE_TRACE_TREE ("local-name", entity
);
1969 if (TREE_CODE (function
) == PARM_DECL
)
1972 function
= DECL_CONTEXT (parm
);
1976 write_encoding (function
);
1979 /* For this purpose, parameters are numbered from right-to-left. */
1984 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1992 write_compact_number (i
- 1);
1995 if (TREE_CODE (entity
) == STRING_CST
)
1998 write_discriminator (discriminator_for_string_literal (function
,
2003 /* Now the <entity name>. Let write_name know its being called
2004 from <local-name>, so it doesn't try to process the enclosing
2005 function scope again. */
2006 write_name (entity
, /*ignore_local_scope=*/1);
2007 if (DECL_DISCRIMINATOR_P (local_entity
)
2008 && !(TREE_CODE (local_entity
) == TYPE_DECL
2009 && (LAMBDA_TYPE_P (TREE_TYPE (local_entity
))
2010 || TYPE_UNNAMED_P (TREE_TYPE (local_entity
)))))
2011 write_discriminator (discriminator_for_local_entity (local_entity
));
2015 /* Non-terminals <type> and <CV-qualifier>.
2017 <type> ::= <builtin-type>
2019 ::= <class-enum-type>
2021 ::= <pointer-to-member-type>
2022 ::= <template-param>
2025 ::= P <type> # pointer-to
2026 ::= R <type> # reference-to
2027 ::= C <type> # complex pair (C 2000)
2028 ::= G <type> # imaginary (C 2000) [not supported]
2029 ::= U <source-name> <type> # vendor extended type qualifier
2033 <type> ::= RR <type> # rvalue reference-to
2034 <type> ::= Dt <expression> # decltype of an id-expression or
2035 # class member access
2036 <type> ::= DT <expression> # decltype of an expression
2037 <type> ::= Dn # decltype of nullptr
2039 TYPE is a type node. */
2042 write_type (tree type
)
2044 /* This gets set to nonzero if TYPE turns out to be a (possibly
2045 CV-qualified) builtin type. */
2046 int is_builtin_type
= 0;
2048 MANGLE_TRACE_TREE ("type", type
);
2050 if (type
== error_mark_node
)
2053 type
= canonicalize_for_substitution (type
);
2054 if (find_substitution (type
))
2058 if (write_CV_qualifiers_for_type (type
) > 0)
2059 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2060 mangle the unqualified type. The recursive call is needed here
2061 since both the qualified and unqualified types are substitution
2064 tree t
= TYPE_MAIN_VARIANT (type
);
2065 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2067 tree attrs
= NULL_TREE
;
2068 if (tx_safe_fn_type_p (type
))
2069 attrs
= tree_cons (get_identifier ("transaction_safe"),
2071 t
= cp_build_type_attribute_variant (t
, attrs
);
2073 gcc_assert (t
!= type
);
2074 if (TREE_CODE (t
) == FUNCTION_TYPE
2075 || TREE_CODE (t
) == METHOD_TYPE
)
2077 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2078 if (flag_noexcept_type
)
2080 tree r
= TYPE_RAISES_EXCEPTIONS (type
);
2081 t
= build_exception_variant (t
, r
);
2083 if (abi_version_at_least (8)
2084 || type
== TYPE_MAIN_VARIANT (type
))
2085 /* Avoid adding the unqualified function type as a substitution. */
2086 write_function_type (t
);
2089 if (abi_warn_or_compat_version_crosses (8))
2090 G
.need_abi_warning
= 1;
2095 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2096 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2097 so that the cv-qualification of the element type is available
2098 in write_array_type. */
2099 write_array_type (type
);
2102 tree type_orig
= type
;
2104 /* See through any typedefs. */
2105 type
= TYPE_MAIN_VARIANT (type
);
2106 if (TREE_CODE (type
) == FUNCTION_TYPE
2107 || TREE_CODE (type
) == METHOD_TYPE
)
2108 type
= cxx_copy_lang_qualifiers (type
, type_orig
);
2110 /* According to the C++ ABI, some library classes are passed the
2111 same as the scalar type of their single member and use the same
2113 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2114 type
= TREE_TYPE (first_field (type
));
2116 if (TYPE_PTRDATAMEM_P (type
))
2117 write_pointer_to_member_type (type
);
2120 /* Handle any target-specific fundamental types. */
2121 const char *target_mangling
2122 = targetm
.mangle_type (type_orig
);
2124 if (target_mangling
)
2126 write_string (target_mangling
);
2127 /* Add substitutions for types other than fundamental
2129 if (!VOID_TYPE_P (type
)
2130 && TREE_CODE (type
) != INTEGER_TYPE
2131 && TREE_CODE (type
) != REAL_TYPE
2132 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2133 add_substitution (type
);
2137 switch (TREE_CODE (type
))
2141 case INTEGER_TYPE
: /* Includes wchar_t. */
2143 case FIXED_POINT_TYPE
:
2145 /* If this is a typedef, TYPE may not be one of
2146 the standard builtin type nodes, but an alias of one. Use
2147 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2148 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2155 write_type (TREE_TYPE (type
));
2160 write_function_type (type
);
2166 /* A pointer-to-member function is represented as a special
2167 RECORD_TYPE, so check for this first. */
2168 if (TYPE_PTRMEMFUNC_P (type
))
2169 write_pointer_to_member_type (type
);
2171 write_class_enum_type (type
);
2175 case UNBOUND_CLASS_TEMPLATE
:
2176 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2177 ordinary nested names. */
2178 write_nested_name (TYPE_STUB_DECL (type
));
2182 case REFERENCE_TYPE
:
2183 if (TYPE_PTR_P (type
))
2185 else if (TYPE_REF_IS_RVALUE (type
))
2190 tree target
= TREE_TYPE (type
);
2191 /* Attribute const/noreturn are not reflected in mangling.
2192 We strip them here rather than at a lower level because
2193 a typedef or template argument can have function type
2194 with function-cv-quals (that use the same representation),
2195 but you can't have a pointer/reference to such a type. */
2196 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2198 if (abi_warn_or_compat_version_crosses (5)
2199 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2200 G
.need_abi_warning
= 1;
2201 if (abi_version_at_least (5))
2202 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2204 write_type (target
);
2208 case TEMPLATE_TYPE_PARM
:
2211 if (AUTO_IS_DECLTYPE (type
))
2212 write_identifier ("Dc");
2214 write_identifier ("Da");
2219 case TEMPLATE_PARM_INDEX
:
2220 write_template_param (type
);
2223 case TEMPLATE_TEMPLATE_PARM
:
2224 write_template_template_param (type
);
2227 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2228 write_template_template_param (type
);
2230 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2234 if (abi_version_at_least (4))
2236 write_string ("Dv");
2237 /* Non-constant vector size would be encoded with
2238 _ expression, but we don't support that yet. */
2239 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
)
2244 write_string ("U8__vector");
2245 if (abi_warn_or_compat_version_crosses (4))
2246 G
.need_abi_warning
= 1;
2247 write_type (TREE_TYPE (type
));
2250 case TYPE_PACK_EXPANSION
:
2251 write_string ("Dp");
2252 write_type (PACK_EXPANSION_PATTERN (type
));
2256 /* These shouldn't make it into mangling. */
2257 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2258 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2260 /* In ABI <5, we stripped decltype of a plain decl. */
2261 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2263 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2264 tree etype
= NULL_TREE
;
2265 switch (TREE_CODE (expr
))
2272 case TEMPLATE_PARM_INDEX
:
2273 etype
= TREE_TYPE (expr
);
2280 if (etype
&& !type_uses_auto (etype
))
2282 if (abi_warn_or_compat_version_crosses (5))
2283 G
.need_abi_warning
= 1;
2284 if (!abi_version_at_least (5))
2293 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2297 ++cp_unevaluated_operand
;
2298 write_expression (DECLTYPE_TYPE_EXPR (type
));
2299 --cp_unevaluated_operand
;
2304 write_string ("Dn");
2305 if (abi_version_at_least (7))
2307 if (abi_warn_or_compat_version_crosses (7))
2308 G
.need_abi_warning
= 1;
2312 sorry ("mangling typeof, use decltype instead");
2315 case UNDERLYING_TYPE
:
2316 sorry ("mangling __underlying_type");
2328 /* Types other than builtin types are substitution candidates. */
2329 if (!is_builtin_type
)
2330 add_substitution (type
);
2333 /* qsort callback for sorting a vector of attribute entries. */
2336 attr_strcmp (const void *p1
, const void *p2
)
2338 tree a1
= *(const tree
*)p1
;
2339 tree a2
= *(const tree
*)p2
;
2341 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2342 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2344 return strcmp (as1
->name
, as2
->name
);
2347 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2348 CV-qualifiers written for TYPE.
2350 <CV-qualifiers> ::= [r] [V] [K] */
2353 write_CV_qualifiers_for_type (const tree type
)
2355 int num_qualifiers
= 0;
2357 /* The order is specified by:
2359 "In cases where multiple order-insensitive qualifiers are
2360 present, they should be ordered 'K' (closest to the base type),
2361 'V', 'r', and 'U' (farthest from the base type) ..." */
2363 /* Mangle attributes that affect type identity as extended qualifiers.
2365 We don't do this with classes and enums because their attributes
2366 are part of their definitions, not something added on. */
2368 if (!OVERLOAD_TYPE_P (type
))
2371 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2373 tree name
= get_attribute_name (a
);
2374 const attribute_spec
*as
= lookup_attribute_spec (name
);
2375 if (as
&& as
->affects_type_identity
2376 && !is_attribute_p ("transaction_safe", name
)
2377 && !is_attribute_p ("abi_tag", name
))
2380 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2381 G
.need_abi_warning
= true;
2382 if (abi_version_at_least (10))
2384 vec
.qsort (attr_strcmp
);
2385 while (!vec
.is_empty())
2388 const attribute_spec
*as
2389 = lookup_attribute_spec (get_attribute_name (a
));
2392 write_unsigned_number (strlen (as
->name
));
2393 write_string (as
->name
);
2397 for (tree args
= TREE_VALUE (a
); args
;
2398 args
= TREE_CHAIN (args
))
2400 tree arg
= TREE_VALUE (args
);
2401 write_template_arg (arg
);
2411 /* Note that we do not use cp_type_quals below; given "const
2412 int[3]", the "const" is emitted with the "int", not with the
2414 cp_cv_quals quals
= TYPE_QUALS (type
);
2416 if (quals
& TYPE_QUAL_RESTRICT
)
2421 if (quals
& TYPE_QUAL_VOLATILE
)
2426 if (quals
& TYPE_QUAL_CONST
)
2432 return num_qualifiers
;
2435 /* Non-terminal <builtin-type>.
2437 <builtin-type> ::= v # void
2442 ::= h # unsigned char
2444 ::= t # unsigned short
2446 ::= j # unsigned int
2448 ::= m # unsigned long
2449 ::= x # long long, __int64
2450 ::= y # unsigned long long, __int64
2452 ::= o # unsigned __int128
2455 ::= e # long double, __float80
2456 ::= g # __float128 [not supported]
2457 ::= u <source-name> # vendor extended type */
2460 write_builtin_type (tree type
)
2462 if (TYPE_CANONICAL (type
))
2463 type
= TYPE_CANONICAL (type
);
2465 switch (TREE_CODE (type
))
2476 /* TYPE may still be wchar_t, char8_t, char16_t, or char32_t, since that
2477 isn't in integer_type_nodes. */
2478 if (type
== wchar_type_node
)
2480 else if (type
== char8_type_node
)
2481 write_string ("Du");
2482 else if (type
== char16_type_node
)
2483 write_string ("Ds");
2484 else if (type
== char32_type_node
)
2485 write_string ("Di");
2489 /* Assume TYPE is one of the shared integer type nodes. Find
2490 it in the array of these nodes. */
2492 for (itk
= 0; itk
< itk_none
; ++itk
)
2493 if (integer_types
[itk
] != NULL_TREE
2494 && integer_type_codes
[itk
] != '\0'
2495 && type
== integer_types
[itk
])
2497 /* Print the corresponding single-letter code. */
2498 write_char (integer_type_codes
[itk
]);
2502 if (itk
== itk_none
)
2504 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2505 TYPE_UNSIGNED (type
));
2512 if (TYPE_PRECISION (type
) == 128)
2513 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2516 /* Allow for cases where TYPE is not one of the shared
2517 integer type nodes and write a "vendor extended builtin
2518 type" with a name the form intN or uintN, respectively.
2519 Situations like this can happen if you have an
2520 __attribute__((__mode__(__SI__))) type and use exotic
2521 switches like '-mint8' on AVR. Of course, this is
2522 undefined by the C++ ABI (and '-mint8' is not even
2523 Standard C conforming), but when using such special
2524 options you're pretty much in nowhere land anyway. */
2526 char prec
[11]; /* up to ten digits for an unsigned */
2528 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2529 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2530 write_char ('u'); /* "vendor extended builtin type" */
2531 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2532 write_string (prefix
);
2533 write_string (prec
);
2540 if (type
== float_type_node
)
2542 else if (type
== double_type_node
)
2544 else if (type
== long_double_type_node
)
2546 else if (type
== dfloat32_type_node
)
2547 write_string ("Df");
2548 else if (type
== dfloat64_type_node
)
2549 write_string ("Dd");
2550 else if (type
== dfloat128_type_node
)
2551 write_string ("De");
2556 case FIXED_POINT_TYPE
:
2557 write_string ("DF");
2558 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2559 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2560 if (type
== fract_type_node
2561 || type
== sat_fract_type_node
2562 || type
== accum_type_node
2563 || type
== sat_accum_type_node
)
2565 else if (type
== unsigned_fract_type_node
2566 || type
== sat_unsigned_fract_type_node
2567 || type
== unsigned_accum_type_node
2568 || type
== sat_unsigned_accum_type_node
)
2570 else if (type
== short_fract_type_node
2571 || type
== sat_short_fract_type_node
2572 || type
== short_accum_type_node
2573 || type
== sat_short_accum_type_node
)
2575 else if (type
== unsigned_short_fract_type_node
2576 || type
== sat_unsigned_short_fract_type_node
2577 || type
== unsigned_short_accum_type_node
2578 || type
== sat_unsigned_short_accum_type_node
)
2580 else if (type
== long_fract_type_node
2581 || type
== sat_long_fract_type_node
2582 || type
== long_accum_type_node
2583 || type
== sat_long_accum_type_node
)
2585 else if (type
== unsigned_long_fract_type_node
2586 || type
== sat_unsigned_long_fract_type_node
2587 || type
== unsigned_long_accum_type_node
2588 || type
== sat_unsigned_long_accum_type_node
)
2590 else if (type
== long_long_fract_type_node
2591 || type
== sat_long_long_fract_type_node
2592 || type
== long_long_accum_type_node
2593 || type
== sat_long_long_accum_type_node
)
2595 else if (type
== unsigned_long_long_fract_type_node
2596 || type
== sat_unsigned_long_long_fract_type_node
2597 || type
== unsigned_long_long_accum_type_node
2598 || type
== sat_unsigned_long_long_accum_type_node
)
2601 sorry ("mangling unknown fixed point type");
2602 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2603 if (TYPE_SATURATING (type
))
2614 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2615 METHOD_TYPE. The return type is mangled before the parameter
2618 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2621 write_function_type (const tree type
)
2623 MANGLE_TRACE_TREE ("function-type", type
);
2625 /* For a pointer to member function, the function type may have
2626 cv-qualifiers, indicating the quals for the artificial 'this'
2628 if (TREE_CODE (type
) == METHOD_TYPE
)
2630 /* The first parameter must be a POINTER_TYPE pointing to the
2631 `this' parameter. */
2632 tree this_type
= class_of_this_parm (type
);
2633 write_CV_qualifiers_for_type (this_type
);
2636 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2638 if (tx_safe_fn_type_p (type
))
2639 write_string ("Dx");
2642 /* We don't track whether or not a type is `extern "C"'. Note that
2643 you can have an `extern "C"' function that does not have
2644 `extern "C"' type, and vice versa:
2646 extern "C" typedef void function_t();
2647 function_t f; // f has C++ linkage, but its type is
2650 typedef void function_t();
2651 extern "C" function_t f; // Vice versa.
2654 write_bare_function_type (type
, /*include_return_type_p=*/1,
2656 if (FUNCTION_REF_QUALIFIED (type
))
2658 if (FUNCTION_RVALUE_QUALIFIED (type
))
2666 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2667 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2668 is mangled before the parameter types. If non-NULL, DECL is
2669 FUNCTION_DECL for the function whose type is being emitted. */
2672 write_bare_function_type (const tree type
, const int include_return_type_p
,
2675 MANGLE_TRACE_TREE ("bare-function-type", type
);
2677 /* Mangle the return type, if requested. */
2678 if (include_return_type_p
)
2679 write_type (TREE_TYPE (type
));
2681 /* Now mangle the types of the arguments. */
2683 write_method_parms (TYPE_ARG_TYPES (type
),
2684 TREE_CODE (type
) == METHOD_TYPE
,
2689 /* Write the mangled representation of a method parameter list of
2690 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2691 considered a non-static method, and the this parameter is omitted.
2692 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2693 parameters are being emitted. */
2696 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2698 tree first_parm_type
;
2699 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2701 /* Assume this parameter type list is variable-length. If it ends
2702 with a void type, then it's not. */
2705 /* If this is a member function, skip the first arg, which is the
2707 "Member functions do not encode the type of their implicit this
2710 Similarly, there's no need to mangle artificial parameters, like
2711 the VTT parameters for constructors and destructors. */
2714 parm_types
= TREE_CHAIN (parm_types
);
2715 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2717 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2719 parm_types
= TREE_CHAIN (parm_types
);
2720 parm_decl
= DECL_CHAIN (parm_decl
);
2723 if (decl
&& ctor_omit_inherited_parms (decl
))
2724 /* Bring back parameters omitted from an inherited ctor. */
2725 parm_types
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl
));
2728 for (first_parm_type
= parm_types
;
2730 parm_types
= TREE_CHAIN (parm_types
))
2732 tree parm
= TREE_VALUE (parm_types
);
2733 if (parm
== void_type_node
)
2735 /* "Empty parameter lists, whether declared as () or
2736 conventionally as (void), are encoded with a void parameter
2738 if (parm_types
== first_parm_type
)
2740 /* If the parm list is terminated with a void type, it's
2743 /* A void type better be the last one. */
2744 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2751 /* <builtin-type> ::= z # ellipsis */
2755 /* <class-enum-type> ::= <name> */
2758 write_class_enum_type (const tree type
)
2760 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2763 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2766 <template-args> ::= I <template-arg>* E */
2769 write_template_args (tree args
)
2774 MANGLE_TRACE_TREE ("template-args", args
);
2779 length
= TREE_VEC_LENGTH (args
);
2781 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2783 /* We have nested template args. We want the innermost template
2785 args
= TREE_VEC_ELT (args
, length
- 1);
2786 length
= TREE_VEC_LENGTH (args
);
2788 for (i
= 0; i
< length
; ++i
)
2789 write_template_arg (TREE_VEC_ELT (args
, i
));
2796 <unqualified-name> <template-args>
2797 part of SCOPE_REF or COMPONENT_REF mangling. */
2800 write_member_name (tree member
)
2802 if (identifier_p (member
))
2804 if (abi_version_at_least (11) && IDENTIFIER_ANY_OP_P (member
))
2806 write_string ("on");
2807 if (abi_warn_or_compat_version_crosses (11))
2808 G
.need_abi_warning
= 1;
2810 write_unqualified_id (member
);
2812 else if (DECL_P (member
))
2813 write_unqualified_name (member
);
2814 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2816 tree name
= TREE_OPERAND (member
, 0);
2817 name
= OVL_FIRST (name
);
2818 write_member_name (name
);
2819 write_template_args (TREE_OPERAND (member
, 1));
2822 write_expression (member
);
2825 /* <expression> ::= <unary operator-name> <expression>
2826 ::= <binary operator-name> <expression> <expression>
2829 <expr-primary> ::= <template-param>
2830 ::= L <type> <value number> E # literal
2831 ::= L <mangled-name> E # external name
2832 ::= st <type> # sizeof
2833 ::= sr <type> <unqualified-name> # dependent name
2834 ::= sr <type> <unqualified-name> <template-args> */
2837 write_expression (tree expr
)
2839 enum tree_code code
= TREE_CODE (expr
);
2841 if (TREE_CODE (expr
) == TARGET_EXPR
)
2843 expr
= TARGET_EXPR_INITIAL (expr
);
2844 code
= TREE_CODE (expr
);
2847 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2848 argument is converted (via qualification conversions) to another type. */
2849 while (CONVERT_EXPR_CODE_P (code
)
2850 || location_wrapper_p (expr
)
2851 /* Parentheses aren't mangled. */
2852 || code
== PAREN_EXPR
2853 || code
== NON_LVALUE_EXPR
2854 || (code
== VIEW_CONVERT_EXPR
2855 && TREE_CODE (TREE_OPERAND (expr
, 0)) == TEMPLATE_PARM_INDEX
))
2857 expr
= TREE_OPERAND (expr
, 0);
2858 code
= TREE_CODE (expr
);
2861 if (code
== BASELINK
2862 && (!type_unknown_p (expr
)
2863 || !BASELINK_QUALIFIED_P (expr
)))
2865 expr
= BASELINK_FUNCTIONS (expr
);
2866 code
= TREE_CODE (expr
);
2869 /* Handle pointers-to-members by making them look like expression
2871 if (code
== PTRMEM_CST
)
2873 expr
= build_nt (ADDR_EXPR
,
2874 build_qualified_name (/*type=*/NULL_TREE
,
2875 PTRMEM_CST_CLASS (expr
),
2876 PTRMEM_CST_MEMBER (expr
),
2877 /*template_p=*/false));
2878 code
= TREE_CODE (expr
);
2881 /* Handle template parameters. */
2882 if (code
== TEMPLATE_TYPE_PARM
2883 || code
== TEMPLATE_TEMPLATE_PARM
2884 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2885 || code
== TEMPLATE_PARM_INDEX
)
2886 write_template_param (expr
);
2887 /* Handle literals. */
2888 else if (TREE_CODE_CLASS (code
) == tcc_constant
2889 || code
== CONST_DECL
)
2890 write_template_arg_literal (expr
);
2891 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2893 gcc_assert (id_equal (DECL_NAME (expr
), "this"));
2894 write_string ("fpT");
2896 else if (code
== PARM_DECL
)
2898 /* A function parameter used in a late-specified return type. */
2899 int index
= DECL_PARM_INDEX (expr
);
2900 int level
= DECL_PARM_LEVEL (expr
);
2901 int delta
= G
.parm_depth
- level
+ 1;
2902 gcc_assert (index
>= 1);
2906 if (abi_version_at_least (5))
2908 /* Let L be the number of function prototype scopes from the
2909 innermost one (in which the parameter reference occurs) up
2910 to (and including) the one containing the declaration of
2911 the referenced parameter. If the parameter declaration
2912 clause of the innermost function prototype scope has been
2913 completely seen, it is not counted (in that case -- which
2914 is perhaps the most common -- L can be zero). */
2916 write_unsigned_number (delta
- 1);
2918 if (abi_warn_or_compat_version_crosses (5))
2919 G
.need_abi_warning
= true;
2922 write_compact_number (index
- 1);
2924 else if (DECL_P (expr
))
2927 write_mangled_name (expr
, false);
2930 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2932 tree op
= TREE_OPERAND (expr
, 0);
2934 if (PACK_EXPANSION_P (op
))
2936 if (abi_warn_or_compat_version_crosses (11))
2937 G
.need_abi_warning
= true;
2938 if (abi_version_at_least (11))
2940 /* sZ rather than szDp. */
2941 write_string ("sZ");
2942 write_expression (PACK_EXPANSION_PATTERN (op
));
2947 if (SIZEOF_EXPR_TYPE_P (expr
))
2949 write_string ("st");
2950 write_type (TREE_TYPE (op
));
2952 else if (ARGUMENT_PACK_P (op
))
2954 tree args
= ARGUMENT_PACK_ARGS (op
);
2955 int length
= TREE_VEC_LENGTH (args
);
2956 if (abi_warn_or_compat_version_crosses (10))
2957 G
.need_abi_warning
= true;
2958 if (abi_version_at_least (10))
2960 /* sP <template-arg>* E # sizeof...(T), size of a captured
2961 template parameter pack from an alias template */
2962 write_string ("sP");
2963 for (int i
= 0; i
< length
; ++i
)
2964 write_template_arg (TREE_VEC_ELT (args
, i
));
2969 /* In GCC 5 we represented this sizeof wrong, with the effect
2970 that we mangled it as the last element of the pack. */
2971 tree arg
= TREE_VEC_ELT (args
, length
-1);
2974 write_string ("st");
2979 write_string ("sz");
2980 write_expression (arg
);
2984 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2986 write_string ("st");
2987 write_type (TREE_OPERAND (expr
, 0));
2992 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2993 && TYPE_P (TREE_OPERAND (expr
, 0)))
2995 write_string ("at");
2996 write_type (TREE_OPERAND (expr
, 0));
2998 else if (code
== SCOPE_REF
2999 || code
== BASELINK
)
3002 if (code
== SCOPE_REF
)
3004 scope
= TREE_OPERAND (expr
, 0);
3005 member
= TREE_OPERAND (expr
, 1);
3006 if (BASELINK_P (member
))
3007 member
= BASELINK_FUNCTIONS (member
);
3011 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
3012 member
= BASELINK_FUNCTIONS (expr
);
3015 /* If the MEMBER is a real declaration, then the qualifying
3016 scope was not dependent. Ideally, we would not have a
3017 SCOPE_REF in those cases, but sometimes we do. If the second
3018 argument is a DECL, then the name must not have been
3020 if (DECL_P (member
))
3021 write_expression (member
);
3024 write_string ("sr");
3026 write_member_name (member
);
3029 else if (INDIRECT_REF_P (expr
)
3030 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3031 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3033 write_expression (TREE_OPERAND (expr
, 0));
3035 else if (identifier_p (expr
))
3037 /* An operator name appearing as a dependent name needs to be
3038 specially marked to disambiguate between a use of the operator
3039 name and a use of the operator in an expression. */
3040 if (IDENTIFIER_ANY_OP_P (expr
))
3041 write_string ("on");
3042 write_unqualified_id (expr
);
3044 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3046 tree fn
= TREE_OPERAND (expr
, 0);
3048 if (IDENTIFIER_ANY_OP_P (fn
))
3049 write_string ("on");
3050 write_unqualified_id (fn
);
3051 write_template_args (TREE_OPERAND (expr
, 1));
3053 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3055 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3056 const char *name
= OVL_OP_INFO (true, subop
)->mangled_name
;
3058 write_string (name
);
3059 write_expression (TREE_OPERAND (expr
, 0));
3060 write_expression (TREE_OPERAND (expr
, 2));
3062 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3064 /* ::= [gs] nw <expression>* _ <type> E
3065 ::= [gs] nw <expression>* _ <type> <initializer>
3066 ::= [gs] na <expression>* _ <type> E
3067 ::= [gs] na <expression>* _ <type> <initializer>
3068 <initializer> ::= pi <expression>* E */
3069 tree placement
= TREE_OPERAND (expr
, 0);
3070 tree type
= TREE_OPERAND (expr
, 1);
3071 tree nelts
= TREE_OPERAND (expr
, 2);
3072 tree init
= TREE_OPERAND (expr
, 3);
3075 gcc_assert (code
== NEW_EXPR
);
3076 if (TREE_OPERAND (expr
, 2))
3077 code
= VEC_NEW_EXPR
;
3079 if (NEW_EXPR_USE_GLOBAL (expr
))
3080 write_string ("gs");
3082 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3084 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3085 write_expression (TREE_VALUE (t
));
3092 ++processing_template_decl
;
3093 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3094 tf_warning_or_error
);
3095 type
= build_cplus_array_type (type
, domain
);
3096 --processing_template_decl
;
3100 if (init
&& TREE_CODE (init
) == TREE_LIST
3101 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3102 write_expression (TREE_VALUE (init
));
3106 write_string ("pi");
3107 if (init
&& init
!= void_node
)
3108 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3109 write_expression (TREE_VALUE (t
));
3113 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3115 gcc_assert (code
== DELETE_EXPR
);
3116 if (DELETE_EXPR_USE_VEC (expr
))
3117 code
= VEC_DELETE_EXPR
;
3119 if (DELETE_EXPR_USE_GLOBAL (expr
))
3120 write_string ("gs");
3122 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3124 write_expression (TREE_OPERAND (expr
, 0));
3126 else if (code
== THROW_EXPR
)
3128 tree op
= TREE_OPERAND (expr
, 0);
3131 write_string ("tw");
3132 write_expression (op
);
3135 write_string ("tr");
3137 else if (code
== CONSTRUCTOR
)
3139 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3140 unsigned i
; tree val
;
3142 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3143 write_string ("il");
3146 write_string ("tl");
3147 write_type (TREE_TYPE (expr
));
3149 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3150 write_expression (val
);
3153 else if (code
== LAMBDA_EXPR
)
3155 /* [temp.over.link] Two lambda-expressions are never considered
3158 So just use the closure type mangling. */
3159 write_string ("tl");
3160 write_type (LAMBDA_EXPR_CLOSURE (expr
));
3163 else if (dependent_name (expr
))
3165 write_unqualified_id (dependent_name (expr
));
3173 /* When we bind a variable or function to a non-type template
3174 argument with reference type, we create an ADDR_EXPR to show
3175 the fact that the entity's address has been taken. But, we
3176 don't actually want to output a mangling code for the `&'. */
3177 if (TREE_CODE (expr
) == ADDR_EXPR
3179 && TYPE_REF_P (TREE_TYPE (expr
)))
3181 expr
= TREE_OPERAND (expr
, 0);
3184 write_expression (expr
);
3188 code
= TREE_CODE (expr
);
3191 if (code
== COMPONENT_REF
)
3193 tree ob
= TREE_OPERAND (expr
, 0);
3195 if (TREE_CODE (ob
) == ARROW_EXPR
)
3197 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3198 ob
= TREE_OPERAND (ob
, 0);
3199 write_expression (ob
);
3201 else if (!is_dummy_object (ob
))
3203 write_string ("dt");
3204 write_expression (ob
);
3206 /* else, for a non-static data member with no associated object (in
3207 unevaluated context), use the unresolved-name mangling. */
3209 write_member_name (TREE_OPERAND (expr
, 1));
3213 /* If it wasn't any of those, recursively expand the expression. */
3214 name
= OVL_OP_INFO (false, code
)->mangled_name
;
3216 /* We used to mangle const_cast and static_cast like a C cast. */
3217 if (code
== CONST_CAST_EXPR
3218 || code
== STATIC_CAST_EXPR
)
3220 if (abi_warn_or_compat_version_crosses (6))
3221 G
.need_abi_warning
= 1;
3222 if (!abi_version_at_least (6))
3223 name
= OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
;
3231 error ("use of built-in trait %qE in function signature; "
3232 "use library traits instead", expr
);
3236 sorry ("mangling %C", code
);
3242 write_string (name
);
3248 tree fn
= CALL_EXPR_FN (expr
);
3250 if (TREE_CODE (fn
) == ADDR_EXPR
)
3251 fn
= TREE_OPERAND (fn
, 0);
3253 /* Mangle a dependent name as the name, not whatever happens to
3254 be the first function in the overload set. */
3255 if ((TREE_CODE (fn
) == FUNCTION_DECL
3256 || TREE_CODE (fn
) == OVERLOAD
)
3257 && type_dependent_expression_p_push (expr
))
3260 write_expression (fn
);
3263 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3264 write_expression (CALL_EXPR_ARG (expr
, i
));
3269 write_type (TREE_TYPE (expr
));
3270 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3271 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3274 tree args
= TREE_OPERAND (expr
, 0);
3276 for (; args
; args
= TREE_CHAIN (args
))
3277 write_expression (TREE_VALUE (args
));
3282 case DYNAMIC_CAST_EXPR
:
3283 case REINTERPRET_CAST_EXPR
:
3284 case STATIC_CAST_EXPR
:
3285 case CONST_CAST_EXPR
:
3286 write_type (TREE_TYPE (expr
));
3287 write_expression (TREE_OPERAND (expr
, 0));
3290 case PREINCREMENT_EXPR
:
3291 case PREDECREMENT_EXPR
:
3292 if (abi_version_at_least (6))
3294 if (abi_warn_or_compat_version_crosses (6))
3295 G
.need_abi_warning
= 1;
3299 /* In the middle-end, some expressions have more operands than
3300 they do in templates (and mangling). */
3301 len
= cp_tree_operand_length (expr
);
3303 for (i
= 0; i
< len
; ++i
)
3305 tree operand
= TREE_OPERAND (expr
, i
);
3306 /* As a GNU extension, the middle operand of a
3307 conditional may be omitted. Since expression
3308 manglings are supposed to represent the input token
3309 stream, there's no good way to mangle such an
3310 expression without extending the C++ ABI. */
3311 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3313 error ("omitted middle operand to %<?:%> operand "
3314 "cannot be mangled");
3317 else if (FOLD_EXPR_P (expr
))
3319 /* The first 'operand' of a fold-expression is the operator
3320 that it folds over. */
3323 int fcode
= TREE_INT_CST_LOW (operand
);
3324 write_string (OVL_OP_INFO (false, fcode
)->mangled_name
);
3327 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3329 /* The order of operands of the binary left and right
3330 folds is the same, but we want to mangle them in
3331 lexical order, i.e. non-pack first. */
3333 operand
= FOLD_EXPR_INIT (expr
);
3335 operand
= FOLD_EXPR_PACK (expr
);
3337 if (PACK_EXPANSION_P (operand
))
3338 operand
= PACK_EXPANSION_PATTERN (operand
);
3340 write_expression (operand
);
3346 /* Literal subcase of non-terminal <template-arg>.
3348 "Literal arguments, e.g. "A<42L>", are encoded with their type
3349 and value. Negative integer values are preceded with "n"; for
3350 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3351 encoded as 0, true as 1." */
3354 write_template_arg_literal (const tree value
)
3357 write_type (TREE_TYPE (value
));
3359 /* Write a null member pointer value as (type)0, regardless of its
3360 real representation. */
3361 if (null_member_pointer_value_p (value
))
3362 write_integer_cst (integer_zero_node
);
3364 switch (TREE_CODE (value
))
3367 write_integer_cst (DECL_INITIAL (value
));
3371 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3372 || integer_zerop (value
) || integer_onep (value
));
3373 write_integer_cst (value
);
3377 write_real_cst (value
);
3381 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3382 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3384 write_integer_cst (TREE_REALPART (value
));
3386 write_integer_cst (TREE_IMAGPART (value
));
3388 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3389 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3391 write_real_cst (TREE_REALPART (value
));
3393 write_real_cst (TREE_IMAGPART (value
));
3400 sorry ("string literal in function template signature");
3410 /* Non-terminal <template-arg>.
3412 <template-arg> ::= <type> # type
3413 ::= L <type> </value/ number> E # literal
3414 ::= LZ <name> E # external name
3415 ::= X <expression> E # expression */
3418 write_template_arg (tree node
)
3420 enum tree_code code
= TREE_CODE (node
);
3422 MANGLE_TRACE_TREE ("template-arg", node
);
3424 /* A template template parameter's argument list contains TREE_LIST
3425 nodes of which the value field is the actual argument. */
3426 if (code
== TREE_LIST
)
3428 node
= TREE_VALUE (node
);
3429 /* If it's a decl, deal with its type instead. */
3432 node
= TREE_TYPE (node
);
3433 code
= TREE_CODE (node
);
3437 if (template_parm_object_p (node
))
3438 /* We want to mangle the argument, not the var we stored it in. */
3439 node
= DECL_INITIAL (node
);
3441 /* Strip a conversion added by convert_nontype_argument. */
3442 if (TREE_CODE (node
) == IMPLICIT_CONV_EXPR
)
3443 node
= TREE_OPERAND (node
, 0);
3444 if (REFERENCE_REF_P (node
))
3445 node
= TREE_OPERAND (node
, 0);
3446 if (TREE_CODE (node
) == NOP_EXPR
3447 && TYPE_REF_P (TREE_TYPE (node
)))
3449 /* Template parameters can be of reference type. To maintain
3450 internal consistency, such arguments use a conversion from
3451 address of object to reference type. */
3452 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3453 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3456 if (TREE_CODE (node
) == BASELINK
3457 && !type_unknown_p (node
))
3459 if (abi_version_at_least (6))
3460 node
= BASELINK_FUNCTIONS (node
);
3461 if (abi_warn_or_compat_version_crosses (6))
3462 /* We wrongly wrapped a class-scope function in X/E. */
3463 G
.need_abi_warning
= 1;
3466 if (ARGUMENT_PACK_P (node
))
3468 /* Expand the template argument pack. */
3469 tree args
= ARGUMENT_PACK_ARGS (node
);
3470 int i
, length
= TREE_VEC_LENGTH (args
);
3471 if (abi_version_at_least (6))
3475 if (abi_warn_or_compat_version_crosses (6))
3476 G
.need_abi_warning
= 1;
3477 for (i
= 0; i
< length
; ++i
)
3478 write_template_arg (TREE_VEC_ELT (args
, i
));
3481 else if (TYPE_P (node
))
3483 else if (code
== TEMPLATE_DECL
)
3484 /* A template appearing as a template arg is a template template arg. */
3485 write_template_template_arg (node
);
3486 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3487 || code
== CONST_DECL
3488 || null_member_pointer_value_p (node
))
3489 write_template_arg_literal (node
);
3490 else if (DECL_P (node
))
3493 /* Until ABI version 3, the underscore before the mangled name
3494 was incorrectly omitted. */
3495 if (!abi_version_at_least (3))
3498 write_string ("_Z");
3499 if (abi_warn_or_compat_version_crosses (3))
3500 G
.need_abi_warning
= 1;
3501 write_encoding (node
);
3506 /* Template arguments may be expressions. */
3508 write_expression (node
);
3513 /* <template-template-arg>
3515 ::= <substitution> */
3518 write_template_template_arg (const tree decl
)
3520 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3522 if (find_substitution (decl
))
3524 write_name (decl
, /*ignore_local_scope=*/0);
3525 add_substitution (decl
);
3529 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3531 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3532 ::= A <expression> _ </element/ type>
3534 "Array types encode the dimension (number of elements) and the
3535 element type. For variable length arrays, the dimension (but not
3536 the '_' separator) is omitted."
3537 Note that for flexible array members, like for other arrays of
3538 unspecified size, the dimension is also omitted. */
3541 write_array_type (const tree type
)
3544 if (TYPE_DOMAIN (type
))
3548 index_type
= TYPE_DOMAIN (type
);
3549 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3550 It's null for flexible array members which have no upper bound
3551 (this is a change from GCC 5 and prior where such members were
3552 incorrectly mangled as zero-length arrays). */
3553 if (tree max
= TYPE_MAX_VALUE (index_type
))
3555 if (TREE_CODE (max
) == INTEGER_CST
)
3557 /* The ABI specifies that we should mangle the number of
3558 elements in the array, not the largest allowed index. */
3559 offset_int wmax
= wi::to_offset (max
) + 1;
3560 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3561 number of elements as zero. */
3562 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3563 gcc_assert (wi::fits_uhwi_p (wmax
));
3564 write_unsigned_number (wmax
.to_uhwi ());
3568 max
= TREE_OPERAND (max
, 0);
3569 write_expression (max
);
3574 write_type (TREE_TYPE (type
));
3577 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3578 variables. TYPE is a pointer-to-member POINTER_TYPE.
3580 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3583 write_pointer_to_member_type (const tree type
)
3586 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3587 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3590 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3591 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3592 TEMPLATE_PARM_INDEX.
3594 <template-param> ::= T </parameter/ number> _ */
3597 write_template_param (const tree parm
)
3601 MANGLE_TRACE_TREE ("template-parm", parm
);
3603 switch (TREE_CODE (parm
))
3605 case TEMPLATE_TYPE_PARM
:
3606 case TEMPLATE_TEMPLATE_PARM
:
3607 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3608 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3611 case TEMPLATE_PARM_INDEX
:
3612 parm_index
= TEMPLATE_PARM_IDX (parm
);
3620 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3621 earliest template param denoted by `_'. */
3622 write_compact_number (parm_index
);
3625 /* <template-template-param>
3626 ::= <template-param>
3627 ::= <substitution> */
3630 write_template_template_param (const tree parm
)
3632 tree templ
= NULL_TREE
;
3634 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3635 template template parameter. The substitution candidate here is
3636 only the template. */
3637 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3640 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3641 if (find_substitution (templ
))
3645 /* <template-param> encodes only the template parameter position,
3646 not its template arguments, which is fine here. */
3647 write_template_param (parm
);
3649 add_substitution (templ
);
3652 /* Non-terminal <substitution>.
3654 <substitution> ::= S <seq-id> _
3658 write_substitution (const int seq_id
)
3660 MANGLE_TRACE ("substitution", "");
3664 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3668 /* Start mangling ENTITY. */
3671 start_mangling (const tree entity
)
3674 G
.need_abi_warning
= false;
3675 G
.need_cxx17_warning
= false;
3676 obstack_free (&name_obstack
, name_base
);
3677 mangle_obstack
= &name_obstack
;
3678 name_base
= obstack_alloc (&name_obstack
, 0);
3681 /* Done with mangling. If WARN is true, and the name of G.entity will
3682 be mangled differently in a future version of the ABI, issue a
3686 finish_mangling_internal (void)
3688 /* Clear all the substitutions. */
3689 vec_safe_truncate (G
.substitutions
, 0);
3691 /* Null-terminate the string. */
3696 /* Like finish_mangling_internal, but return the mangled string. */
3698 static inline const char *
3699 finish_mangling (void)
3701 finish_mangling_internal ();
3702 return (const char *) obstack_finish (mangle_obstack
);
3705 /* Like finish_mangling_internal, but return an identifier. */
3708 finish_mangling_get_identifier (void)
3710 finish_mangling_internal ();
3711 /* Don't obstack_finish here, and the next start_mangling will
3712 remove the identifier. */
3713 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3716 /* Initialize data structures for mangling. */
3721 gcc_obstack_init (&name_obstack
);
3722 name_base
= obstack_alloc (&name_obstack
, 0);
3723 vec_alloc (G
.substitutions
, 0);
3725 /* Cache these identifiers for quick comparison when checking for
3726 standard substitutions. */
3727 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3728 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3729 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3730 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3731 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3732 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3735 /* Generate the mangled name of DECL. */
3738 mangle_decl_string (const tree decl
)
3741 location_t saved_loc
= input_location
;
3742 tree saved_fn
= NULL_TREE
;
3743 bool template_p
= false;
3745 /* We shouldn't be trying to mangle an uninstantiated template. */
3746 gcc_assert (!type_dependent_expression_p (decl
));
3748 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3750 struct tinst_level
*tl
= current_instantiation ();
3751 if ((!tl
|| tl
->maybe_get_node () != decl
)
3752 && push_tinst_level (decl
))
3755 saved_fn
= current_function_decl
;
3756 current_function_decl
= NULL_TREE
;
3759 input_location
= DECL_SOURCE_LOCATION (decl
);
3761 start_mangling (decl
);
3763 if (TREE_CODE (decl
) == TYPE_DECL
)
3764 write_type (TREE_TYPE (decl
));
3766 write_mangled_name (decl
, true);
3768 result
= finish_mangling_get_identifier ();
3770 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3771 IDENTIFIER_POINTER (result
));
3776 current_function_decl
= saved_fn
;
3778 input_location
= saved_loc
;
3783 /* Return an identifier for the external mangled name of DECL. */
3786 get_mangled_id (tree decl
)
3788 tree id
= mangle_decl_string (decl
);
3789 return targetm
.mangle_decl_assembler_name (decl
, id
);
3792 /* Create an identifier for the external mangled name of DECL. */
3795 mangle_decl (const tree decl
)
3800 /* Don't bother mangling uninstantiated templates. */
3801 ++processing_template_decl
;
3802 if (TREE_CODE (decl
) == TYPE_DECL
)
3803 dep
= dependent_type_p (TREE_TYPE (decl
));
3805 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3806 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3807 --processing_template_decl
;
3811 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3812 It is not needed to assign names to anonymous namespace, but we use the
3813 "<anon>" marker to be able to tell if type is C++ ODR type or type
3814 produced by other language. */
3815 if (TREE_CODE (decl
) == TYPE_DECL
3816 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3817 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3818 id
= get_identifier ("<anon>");
3821 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3822 || !no_linkage_check (TREE_TYPE (decl
), true));
3823 if (abi_version_at_least (10))
3824 if (tree fn
= decl_function_context (decl
))
3825 maybe_check_abi_tags (fn
, decl
);
3826 id
= get_mangled_id (decl
);
3828 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3830 if (G
.need_cxx17_warning
3831 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
3832 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wnoexcept_type
,
3833 "mangled name for %qD will change in C++17 because the "
3834 "exception specification is part of a function type",
3837 if (id
!= DECL_NAME (decl
)
3838 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3839 && TREE_CODE (decl
) != TYPE_DECL
3840 && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl
))
3842 int save_ver
= flag_abi_version
;
3843 tree id2
= NULL_TREE
;
3845 if (!DECL_REALLY_EXTERN (decl
))
3847 record_mangling (decl
, G
.need_abi_warning
);
3849 if (!G
.need_abi_warning
)
3852 flag_abi_version
= flag_abi_compat_version
;
3853 id2
= mangle_decl_string (decl
);
3854 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3855 flag_abi_version
= save_ver
;
3858 note_mangling_alias (decl
, id2
);
3863 const char fabi_version
[] = "-fabi-version";
3865 if (flag_abi_compat_version
!= warn_abi_version
3866 || id2
== NULL_TREE
)
3868 flag_abi_version
= warn_abi_version
;
3869 id2
= mangle_decl_string (decl
);
3870 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3872 flag_abi_version
= save_ver
;
3876 else if (warn_abi_version
!= 0
3877 && abi_version_at_least (warn_abi_version
))
3878 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3879 "the mangled name of %qD changed between "
3880 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3881 G
.entity
, fabi_version
, warn_abi_version
, id2
,
3882 fabi_version
, save_ver
, id
);
3884 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3885 "the mangled name of %qD changes between "
3886 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3887 G
.entity
, fabi_version
, save_ver
, id
,
3888 fabi_version
, warn_abi_version
, id2
);
3891 flag_abi_version
= save_ver
;
3895 /* Generate the mangled representation of TYPE. */
3898 mangle_type_string (const tree type
)
3902 start_mangling (type
);
3904 result
= finish_mangling ();
3906 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3910 /* Create an identifier for the mangled name of a special component
3911 for belonging to TYPE. CODE is the ABI-specified code for this
3915 mangle_special_for_type (const tree type
, const char *code
)
3919 /* We don't have an actual decl here for the special component, so
3920 we can't just process the <encoded-name>. Instead, fake it. */
3921 start_mangling (type
);
3923 /* Start the mangling. */
3924 write_string ("_Z");
3925 write_string (code
);
3929 result
= finish_mangling_get_identifier ();
3932 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3933 IDENTIFIER_POINTER (result
));
3938 /* Create an identifier for the mangled representation of the typeinfo
3939 structure for TYPE. */
3942 mangle_typeinfo_for_type (const tree type
)
3944 return mangle_special_for_type (type
, "TI");
3947 /* Create an identifier for the mangled name of the NTBS containing
3948 the mangled name of TYPE. */
3951 mangle_typeinfo_string_for_type (const tree type
)
3953 return mangle_special_for_type (type
, "TS");
3956 /* Create an identifier for the mangled name of the vtable for TYPE. */
3959 mangle_vtbl_for_type (const tree type
)
3961 return mangle_special_for_type (type
, "TV");
3964 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3967 mangle_vtt_for_type (const tree type
)
3969 return mangle_special_for_type (type
, "TT");
3972 /* Returns an identifier for the mangled name of the decomposition
3973 artificial variable DECL. DECLS is the vector of the VAR_DECLs
3974 for the identifier-list. */
3977 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
3979 gcc_assert (!type_dependent_expression_p (decl
));
3981 location_t saved_loc
= input_location
;
3982 input_location
= DECL_SOURCE_LOCATION (decl
);
3984 start_mangling (decl
);
3985 write_string ("_Z");
3987 tree context
= decl_mangling_context (decl
);
3988 gcc_assert (context
!= NULL_TREE
);
3990 bool nested
= false;
3991 if (DECL_NAMESPACE_STD_P (context
))
3992 write_string ("St");
3993 else if (context
!= global_namespace
)
3997 write_prefix (decl_mangling_context (decl
));
4000 write_string ("DC");
4003 FOR_EACH_VEC_ELT (decls
, i
, d
)
4004 write_unqualified_name (d
);
4010 tree id
= finish_mangling_get_identifier ();
4012 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4013 IDENTIFIER_POINTER (id
));
4015 input_location
= saved_loc
;
4019 /* Return an identifier for a construction vtable group. TYPE is
4020 the most derived class in the hierarchy; BINFO is the base
4021 subobject for which this construction vtable group will be used.
4023 This mangling isn't part of the ABI specification; in the ABI
4024 specification, the vtable group is dumped in the same COMDAT as the
4025 main vtable, and is referenced only from that vtable, so it doesn't
4026 need an external name. For binary formats without COMDAT sections,
4027 though, we need external names for the vtable groups.
4029 We use the production
4031 <special-name> ::= CT <type> <offset number> _ <base type> */
4034 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4038 start_mangling (type
);
4040 write_string ("_Z");
4041 write_string ("TC");
4043 write_integer_cst (BINFO_OFFSET (binfo
));
4045 write_type (BINFO_TYPE (binfo
));
4047 result
= finish_mangling_get_identifier ();
4049 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4050 IDENTIFIER_POINTER (result
));
4054 /* Mangle a this pointer or result pointer adjustment.
4056 <call-offset> ::= h <fixed offset number> _
4057 ::= v <fixed offset number> _ <virtual offset number> _ */
4060 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4062 write_char (virtual_offset
? 'v' : 'h');
4064 /* For either flavor, write the fixed offset. */
4065 write_integer_cst (fixed_offset
);
4068 /* For a virtual thunk, add the virtual offset. */
4071 write_integer_cst (virtual_offset
);
4076 /* Return an identifier for the mangled name of a this-adjusting or
4077 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4078 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4079 is a virtual thunk, and it is the vtbl offset in
4080 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4081 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4082 thunk itself. A covariant thunk name always includes the adjustment
4083 for the this pointer, even if there is none.
4085 <special-name> ::= T <call-offset> <base encoding>
4086 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4090 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4091 tree virtual_offset
, tree thunk
)
4095 if (abi_version_at_least (11))
4096 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4098 start_mangling (fn_decl
);
4100 write_string ("_Z");
4103 if (!this_adjusting
)
4105 /* Covariant thunk with no this adjustment */
4107 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4108 mangle_call_offset (fixed_offset
, virtual_offset
);
4110 else if (!DECL_THUNK_P (fn_decl
))
4111 /* Plain this adjusting thunk. */
4112 mangle_call_offset (fixed_offset
, virtual_offset
);
4115 /* This adjusting thunk to covariant thunk. */
4117 mangle_call_offset (fixed_offset
, virtual_offset
);
4118 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4119 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4121 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4122 mangle_call_offset (fixed_offset
, virtual_offset
);
4123 fn_decl
= THUNK_TARGET (fn_decl
);
4127 write_encoding (fn_decl
);
4129 result
= finish_mangling_get_identifier ();
4131 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4135 /* Handle ABI backwards compatibility for past bugs where we didn't call
4136 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4137 it makes a difference. If FOR_DECL is non-null, it's the declaration
4138 that we're actually trying to mangle; if it's null, we're mangling the
4139 guard variable for T. */
4142 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4144 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4147 tree oldtags
= get_abi_tags (t
);
4151 tree newtags
= get_abi_tags (t
);
4152 if (newtags
&& newtags
!= oldtags
4153 && abi_version_crosses (ver
))
4155 if (for_decl
&& DECL_THUNK_P (for_decl
))
4156 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4157 "the mangled name of a thunk for %qD changes between "
4158 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4159 t
, flag_abi_version
, warn_abi_version
);
4161 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4162 "the mangled name of %qD changes between "
4163 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4164 for_decl
, flag_abi_version
, warn_abi_version
);
4166 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4167 "the mangled name of the initialization guard variable "
4168 "for %qD changes between %<-fabi-version=%d%> and "
4169 "%<-fabi-version=%d%>",
4170 t
, flag_abi_version
, warn_abi_version
);
4174 /* Write out the appropriate string for this variable when generating
4175 another mangled name based on this one. */
4178 write_guarded_var_name (const tree variable
)
4180 if (DECL_NAME (variable
)
4181 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4182 /* The name of a guard variable for a reference temporary should refer
4183 to the reference, not the temporary. */
4184 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4186 write_name (variable
, /*ignore_local_scope=*/0);
4189 /* Return an identifier for the name of an initialization guard
4190 variable for indicated VARIABLE. */
4193 mangle_guard_variable (const tree variable
)
4195 if (abi_version_at_least (10))
4196 maybe_check_abi_tags (variable
);
4197 start_mangling (variable
);
4198 write_string ("_ZGV");
4199 write_guarded_var_name (variable
);
4200 return finish_mangling_get_identifier ();
4203 /* Return an identifier for the name of a thread_local initialization
4204 function for VARIABLE. */
4207 mangle_tls_init_fn (const tree variable
)
4209 check_abi_tags (variable
);
4210 start_mangling (variable
);
4211 write_string ("_ZTH");
4212 write_guarded_var_name (variable
);
4213 return finish_mangling_get_identifier ();
4216 /* Return an identifier for the name of a thread_local wrapper
4217 function for VARIABLE. */
4219 #define TLS_WRAPPER_PREFIX "_ZTW"
4222 mangle_tls_wrapper_fn (const tree variable
)
4224 check_abi_tags (variable
);
4225 start_mangling (variable
);
4226 write_string (TLS_WRAPPER_PREFIX
);
4227 write_guarded_var_name (variable
);
4228 return finish_mangling_get_identifier ();
4231 /* Return true iff FN is a thread_local wrapper function. */
4234 decl_tls_wrapper_p (const tree fn
)
4236 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4238 tree name
= DECL_NAME (fn
);
4239 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4240 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4243 /* Return an identifier for the name of a temporary variable used to
4244 initialize a static reference. This is now part of the ABI. */
4247 mangle_ref_init_variable (const tree variable
)
4249 start_mangling (variable
);
4250 write_string ("_ZGR");
4251 check_abi_tags (variable
);
4252 write_name (variable
, /*ignore_local_scope=*/0);
4253 /* Avoid name clashes with aggregate initialization of multiple
4254 references at once. */
4255 write_compact_number (current_ref_temp_count
++);
4256 return finish_mangling_get_identifier ();
4259 /* Return an identifier for the mangled name of a C++20 template parameter
4260 object for template argument EXPR. */
4263 mangle_template_parm_object (tree expr
)
4265 start_mangling (expr
);
4266 write_string ("_ZTAX");
4267 write_expression (expr
);
4269 return finish_mangling_get_identifier ();
4272 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4273 function generates a mangled name for the vtable map variable of
4274 the class type. For example, if the class type is
4275 "std::bad_exception", the mangled name for the class is
4276 "St13bad_exception". This function would generate the name
4277 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4278 "_VTV<std::bad_exception>::__vtable_map". */
4282 get_mangled_vtable_map_var_name (tree class_type
)
4284 char *var_name
= NULL
;
4285 const char *prefix
= "_ZN4_VTVI";
4286 const char *postfix
= "E12__vtable_mapE";
4288 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4290 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4292 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4294 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4295 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4298 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4300 strlen (postfix
) + 1;
4302 var_name
= (char *) xmalloc (len
);
4304 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4309 #include "gt-cp-mangle.h"