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 (FUNC_OR_METHOD_TYPE_P (node
))
419 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
420 tree r
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig
));
421 if (flag_noexcept_type
)
422 node
= build_exception_variant (node
, r
);
424 /* Set the warning flag if appropriate. */
425 write_exception_spec (r
);
431 /* Add NODE as a substitution candidate. NODE must not already be on
432 the list of candidates. */
435 add_substitution (tree node
)
440 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
441 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
443 /* Get the canonicalized substitution candidate for NODE. */
444 c
= canonicalize_for_substitution (node
);
445 if (DEBUG_MANGLE
&& c
!= node
)
446 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
447 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
450 /* Make sure NODE isn't already a candidate. */
456 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
458 gcc_assert (!(DECL_P (node
) && node
== candidate
));
459 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
460 && same_type_p (node
, candidate
)));
464 /* Put the decl onto the varray of substitution candidates. */
465 vec_safe_push (G
.substitutions
, node
);
468 dump_substitution_candidates ();
471 /* Helper function for find_substitution. Returns nonzero if NODE,
472 which may be a decl or a CLASS_TYPE, is a template-id with template
473 name of substitution_index[INDEX] in the ::std namespace. */
476 is_std_substitution (const tree node
,
477 const substitution_identifier_index_t index
)
484 type
= TREE_TYPE (node
);
487 else if (CLASS_TYPE_P (node
))
490 decl
= TYPE_NAME (node
);
493 /* These are not the droids you're looking for. */
496 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
497 && TYPE_LANG_SPECIFIC (type
)
498 && TYPE_TEMPLATE_INFO (type
)
499 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
500 == subst_identifiers
[index
]));
503 /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
504 which can be a decl or type. */
507 get_abi_tags (tree t
)
509 if (!t
|| TREE_CODE (t
) == NAMESPACE_DECL
)
512 if (DECL_P (t
) && DECL_DECLARES_TYPE_P (t
))
517 attrs
= TYPE_ATTRIBUTES (t
);
519 attrs
= DECL_ATTRIBUTES (t
);
521 tree tags
= lookup_attribute ("abi_tag", attrs
);
523 tags
= TREE_VALUE (tags
);
527 /* Helper function for find_substitution. Returns nonzero if NODE,
528 which may be a decl or a CLASS_TYPE, is the template-id
529 ::std::identifier<char>, where identifier is
530 substitution_index[INDEX]. */
533 is_std_substitution_char (const tree node
,
534 const substitution_identifier_index_t index
)
537 /* Check NODE's name is ::std::identifier. */
538 if (!is_std_substitution (node
, index
))
540 /* Figure out its template args. */
542 args
= DECL_TI_ARGS (node
);
543 else if (CLASS_TYPE_P (node
))
544 args
= CLASSTYPE_TI_ARGS (node
);
546 /* Oops, not a template. */
548 /* NODE's template arg list should be <char>. */
550 TREE_VEC_LENGTH (args
) == 1
551 && TREE_VEC_ELT (args
, 0) == char_type_node
;
554 /* Check whether a substitution should be used to represent NODE in
557 First, check standard special-case substitutions.
559 <substitution> ::= St
566 # ::std::basic_string
569 # ::std::basic_string<char,
570 ::std::char_traits<char>,
571 ::std::allocator<char> >
574 # ::std::basic_istream<char, ::std::char_traits<char> >
577 # ::std::basic_ostream<char, ::std::char_traits<char> >
580 # ::std::basic_iostream<char, ::std::char_traits<char> >
582 Then examine the stack of currently available substitution
583 candidates for entities appearing earlier in the same mangling
585 If a substitution is found, write its mangled representation and
586 return nonzero. If none is found, just return zero. */
589 find_substitution (tree node
)
592 const int size
= vec_safe_length (G
.substitutions
);
595 const char *abbr
= NULL
;
598 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
599 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
601 /* Obtain the canonicalized substitution representation for NODE.
602 This is what we'll compare against. */
603 node
= canonicalize_for_substitution (node
);
605 /* Check for builtin substitutions. */
607 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
608 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
610 /* Check for std::allocator. */
612 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
613 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
616 /* Check for std::basic_string. */
617 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
621 /* If this is a type (i.e. a fully-qualified template-id),
623 std::basic_string <char,
624 std::char_traits<char>,
625 std::allocator<char> > . */
626 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
627 && CLASSTYPE_USE_TEMPLATE (type
))
629 tree args
= CLASSTYPE_TI_ARGS (type
);
630 if (TREE_VEC_LENGTH (args
) == 3
631 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
632 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
634 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
640 /* Substitute for the template name only if this isn't a type. */
644 /* Check for basic_{i,o,io}stream. */
645 else if (TYPE_P (node
)
646 && cp_type_quals (type
) == TYPE_UNQUALIFIED
647 && CLASS_TYPE_P (type
)
648 && CLASSTYPE_USE_TEMPLATE (type
)
649 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
651 /* First, check for the template
652 args <char, std::char_traits<char> > . */
653 tree args
= CLASSTYPE_TI_ARGS (type
);
654 if (TREE_VEC_LENGTH (args
) == 2
655 && TYPE_P (TREE_VEC_ELT (args
, 0))
656 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
657 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
660 /* Got them. Is this basic_istream? */
661 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
663 /* Or basic_ostream? */
664 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
666 /* Or basic_iostream? */
667 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
672 /* Check for namespace std. */
673 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
679 tree tags
= NULL_TREE
;
680 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
681 tags
= get_abi_tags (type
);
682 /* Now check the list of available substitutions for this mangling
684 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
686 tree candidate
= (*G
.substitutions
)[i
];
687 /* NODE is a matched to a candidate if it's the same decl node or
688 if it's the same type. */
689 if (decl
== candidate
690 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
691 && same_type_p (type
, candidate
))
692 || NESTED_TEMPLATE_MATCH (node
, candidate
))
694 write_substitution (i
);
700 /* No substitution found. */
706 /* If there are ABI tags on the abbreviation, it becomes
707 a substitution candidate. */
708 write_abi_tags (tags
);
709 add_substitution (node
);
714 /* Returns whether DECL's symbol name should be the plain unqualified-id
715 rather than a more complicated mangled name. */
718 unmangled_name_p (const tree decl
)
720 if (TREE_CODE (decl
) == FUNCTION_DECL
)
722 /* The names of `extern "C"' functions are not mangled. */
723 return (DECL_EXTERN_C_FUNCTION_P (decl
)
724 /* But overloaded operator names *are* mangled. */
725 && !DECL_OVERLOADED_OPERATOR_P (decl
));
727 else if (VAR_P (decl
))
729 /* static variables are mangled. */
730 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
733 /* extern "C" declarations aren't mangled. */
734 if (DECL_EXTERN_C_P (decl
))
737 /* Other variables at non-global scope are mangled. */
738 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
741 /* Variable template instantiations are mangled. */
742 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
743 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
746 /* Declarations with ABI tags are mangled. */
747 if (get_abi_tags (decl
))
750 /* The names of non-static global variables aren't mangled. */
757 /* TOP_LEVEL is true, if this is being called at outermost level of
758 mangling. It should be false when mangling a decl appearing in an
759 expression within some other mangling.
761 <mangled-name> ::= _Z <encoding> */
764 write_mangled_name (const tree decl
, bool top_level
)
766 MANGLE_TRACE_TREE ("mangled-name", decl
);
768 check_abi_tags (decl
);
770 if (unmangled_name_p (decl
))
773 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
776 /* The standard notes: "The <encoding> of an extern "C"
777 function is treated like global-scope data, i.e. as its
778 <source-name> without a type." We cannot write
779 overloaded operators that way though, because it contains
780 characters invalid in assembler. */
782 write_source_name (DECL_NAME (decl
));
788 write_encoding (decl
);
792 /* Returns true if the return type of DECL is part of its signature, and
793 therefore its mangling. */
796 mangle_return_type_p (tree decl
)
798 return (!DECL_CONSTRUCTOR_P (decl
)
799 && !DECL_DESTRUCTOR_P (decl
)
800 && !DECL_CONV_FN_P (decl
)
801 && decl_is_template_id (decl
, NULL
));
804 /* <encoding> ::= <function name> <bare-function-type>
808 write_encoding (const tree decl
)
810 MANGLE_TRACE_TREE ("encoding", decl
);
812 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
814 /* For overloaded operators write just the mangled name
815 without arguments. */
816 if (DECL_OVERLOADED_OPERATOR_P (decl
))
817 write_name (decl
, /*ignore_local_scope=*/0);
819 write_source_name (DECL_NAME (decl
));
823 write_name (decl
, /*ignore_local_scope=*/0);
824 if (TREE_CODE (decl
) == FUNCTION_DECL
)
828 bool tmpl
= decl_is_template_id (decl
, NULL
);
832 fn_type
= get_mostly_instantiated_function_type (decl
);
833 /* FN_TYPE will not have parameter types for in-charge or
834 VTT parameters. Therefore, we pass NULL_TREE to
835 write_bare_function_type -- otherwise, it will get
836 confused about which artificial parameters to skip. */
841 fn_type
= TREE_TYPE (decl
);
845 write_bare_function_type (fn_type
,
846 mangle_return_type_p (decl
),
851 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
852 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
855 decl_mangling_context (tree decl
)
857 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
859 if (tcontext
!= NULL_TREE
)
862 if (TREE_CODE (decl
) == TEMPLATE_DECL
863 && DECL_TEMPLATE_RESULT (decl
))
864 decl
= DECL_TEMPLATE_RESULT (decl
);
866 if (TREE_CODE (decl
) == TYPE_DECL
867 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
869 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
873 else if (template_type_parameter_p (decl
))
874 /* template type parms have no mangling context. */
876 return CP_DECL_CONTEXT (decl
);
879 /* <name> ::= <unscoped-name>
880 ::= <unscoped-template-name> <template-args>
884 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
885 called from <local-name>, which mangles the enclosing scope
886 elsewhere and then uses this function to mangle just the part
887 underneath the function scope. So don't use the <local-name>
888 production, to avoid an infinite recursion. */
891 write_name (tree decl
, const int ignore_local_scope
)
895 MANGLE_TRACE_TREE ("name", decl
);
897 if (TREE_CODE (decl
) == TYPE_DECL
)
899 /* In case this is a typedef, fish out the corresponding
900 TYPE_DECL for the main variant. */
901 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
904 context
= decl_mangling_context (decl
);
906 gcc_assert (context
!= NULL_TREE
);
908 if (abi_warn_or_compat_version_crosses (7)
909 && ignore_local_scope
910 && TREE_CODE (context
) == PARM_DECL
)
911 G
.need_abi_warning
= 1;
913 /* A decl in :: or ::std scope is treated specially. The former is
914 mangled using <unscoped-name> or <unscoped-template-name>, the
915 latter with a special substitution. Also, a name that is
916 directly in a local function scope is also mangled with
917 <unscoped-name> rather than a full <nested-name>. */
918 if (context
== global_namespace
919 || DECL_NAMESPACE_STD_P (context
)
920 || (ignore_local_scope
921 && (TREE_CODE (context
) == FUNCTION_DECL
922 || (abi_version_at_least (7)
923 && TREE_CODE (context
) == PARM_DECL
))))
926 /* Is this a template instance? */
927 if (decl_is_template_id (decl
, &template_info
))
929 /* Yes: use <unscoped-template-name>. */
930 write_unscoped_template_name (TI_TEMPLATE (template_info
));
931 write_template_args (TI_ARGS (template_info
));
934 /* Everything else gets an <unqualified-name>. */
935 write_unscoped_name (decl
);
939 /* Handle local names, unless we asked not to (that is, invoked
940 under <local-name>, to handle only the part of the name under
942 if (!ignore_local_scope
)
944 /* Scan up the list of scope context, looking for a
945 function. If we find one, this entity is in local
946 function scope. local_entity tracks context one scope
947 level down, so it will contain the element that's
948 directly in that function's scope, either decl or one of
949 its enclosing scopes. */
950 tree local_entity
= decl
;
951 while (context
!= global_namespace
)
953 /* Make sure we're always dealing with decls. */
954 if (TYPE_P (context
))
955 context
= TYPE_NAME (context
);
956 /* Is this a function? */
957 if (TREE_CODE (context
) == FUNCTION_DECL
958 || TREE_CODE (context
) == PARM_DECL
)
960 /* Yes, we have local scope. Use the <local-name>
961 production for the innermost function scope. */
962 write_local_name (context
, local_entity
, decl
);
965 /* Up one scope level. */
966 local_entity
= context
;
967 context
= decl_mangling_context (context
);
970 /* No local scope found? Fall through to <nested-name>. */
973 /* Other decls get a <nested-name> to encode their scope. */
974 write_nested_name (decl
);
978 /* <unscoped-name> ::= <unqualified-name>
979 ::= St <unqualified-name> # ::std:: */
982 write_unscoped_name (const tree decl
)
984 tree context
= decl_mangling_context (decl
);
986 MANGLE_TRACE_TREE ("unscoped-name", decl
);
988 /* Is DECL in ::std? */
989 if (DECL_NAMESPACE_STD_P (context
))
992 write_unqualified_name (decl
);
996 /* If not, it should be either in the global namespace, or directly
997 in a local function scope. A lambda can also be mangled in the
998 scope of a default argument. */
999 gcc_assert (context
== global_namespace
1000 || TREE_CODE (context
) == PARM_DECL
1001 || TREE_CODE (context
) == FUNCTION_DECL
);
1003 write_unqualified_name (decl
);
1007 /* <unscoped-template-name> ::= <unscoped-name>
1008 ::= <substitution> */
1011 write_unscoped_template_name (const tree decl
)
1013 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
1015 if (find_substitution (decl
))
1017 write_unscoped_name (decl
);
1018 add_substitution (decl
);
1021 /* Write the nested name, including CV-qualifiers, of DECL.
1023 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1024 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1026 <ref-qualifier> ::= R # & ref-qualifier
1027 ::= O # && ref-qualifier
1028 <CV-qualifiers> ::= [r] [V] [K] */
1031 write_nested_name (const tree decl
)
1035 MANGLE_TRACE_TREE ("nested-name", decl
);
1039 /* Write CV-qualifiers, if this is a member function. */
1040 if (TREE_CODE (decl
) == FUNCTION_DECL
1041 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1043 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1045 if (DECL_CONST_MEMFUNC_P (decl
))
1047 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1049 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1056 /* Is this a template instance? */
1057 if (decl_is_template_id (decl
, &template_info
))
1059 /* Yes, use <template-prefix>. */
1060 write_template_prefix (decl
);
1061 write_template_args (TI_ARGS (template_info
));
1063 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1064 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1066 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1067 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1069 write_template_prefix (decl
);
1070 write_template_args (TREE_OPERAND (name
, 1));
1074 write_prefix (decl_mangling_context (decl
));
1075 write_unqualified_name (decl
);
1080 /* No, just use <prefix> */
1081 write_prefix (decl_mangling_context (decl
));
1082 write_unqualified_name (decl
);
1087 /* <prefix> ::= <prefix> <unqualified-name>
1088 ::= <template-param>
1089 ::= <template-prefix> <template-args>
1092 ::= <substitution> */
1095 write_prefix (const tree node
)
1098 /* Non-NULL if NODE represents a template-id. */
1099 tree template_info
= NULL
;
1102 || node
== global_namespace
)
1105 MANGLE_TRACE_TREE ("prefix", node
);
1107 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1113 if (find_substitution (node
))
1118 /* If this is a function or parm decl, that means we've hit function
1119 scope, so this prefix must be for a local name. In this
1120 case, we're under the <local-name> production, which encodes
1121 the enclosing function scope elsewhere. So don't continue
1123 if (TREE_CODE (node
) == FUNCTION_DECL
1124 || TREE_CODE (node
) == PARM_DECL
)
1128 decl_is_template_id (decl
, &template_info
);
1132 /* Node is a type. */
1133 decl
= TYPE_NAME (node
);
1134 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1135 template_info
= TYPE_TEMPLATE_INFO (node
);
1138 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1139 write_template_param (node
);
1140 else if (template_info
!= NULL
)
1143 write_template_prefix (decl
);
1144 write_template_args (TI_ARGS (template_info
));
1146 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1148 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1149 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1151 write_template_prefix (decl
);
1152 write_template_args (TREE_OPERAND (name
, 1));
1156 write_prefix (decl_mangling_context (decl
));
1157 write_unqualified_name (decl
);
1161 /* Not templated. */
1163 write_prefix (decl_mangling_context (decl
));
1164 write_unqualified_name (decl
);
1166 || TREE_CODE (decl
) == FIELD_DECL
)
1168 /* <data-member-prefix> := <member source-name> M */
1174 add_substitution (node
);
1177 /* <template-prefix> ::= <prefix> <template component>
1178 ::= <template-param>
1179 ::= <substitution> */
1182 write_template_prefix (const tree node
)
1184 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1185 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1186 tree context
= decl_mangling_context (decl
);
1191 MANGLE_TRACE_TREE ("template-prefix", node
);
1193 /* Find the template decl. */
1194 if (decl_is_template_id (decl
, &template_info
))
1195 templ
= TI_TEMPLATE (template_info
);
1196 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1197 /* For a typename type, all we have is the name. */
1198 templ
= DECL_NAME (decl
);
1201 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1203 templ
= TYPE_TI_TEMPLATE (type
);
1206 /* For a member template, though, the template name for the
1207 innermost name must have all the outer template levels
1208 instantiated. For instance, consider
1210 template<typename T> struct Outer {
1211 template<typename U> struct Inner {};
1214 The template name for `Inner' in `Outer<int>::Inner<float>' is
1215 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1216 levels separately, so there's no TEMPLATE_DECL available for this
1217 (there's only `Outer<T>::Inner<U>').
1219 In order to get the substitutions right, we create a special
1220 TREE_LIST to represent the substitution candidate for a nested
1221 template. The TREE_PURPOSE is the template's context, fully
1222 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1225 So, for the example above, `Outer<int>::Inner' is represented as a
1226 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1227 and whose value is `Outer<T>::Inner<U>'. */
1228 if (context
&& TYPE_P (context
))
1229 substitution
= build_tree_list (context
, templ
);
1231 substitution
= templ
;
1233 if (find_substitution (substitution
))
1236 if (TREE_TYPE (templ
)
1237 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1238 write_template_param (TREE_TYPE (templ
));
1241 write_prefix (context
);
1242 write_unqualified_name (decl
);
1245 add_substitution (substitution
);
1248 /* As the list of identifiers for the structured binding declaration
1249 DECL is likely gone, try to recover the DC <source-name>+ E portion
1250 from its mangled name. Return pointer to the DC and set len to
1251 the length up to and including the terminating E. On failure
1255 find_decomp_unqualified_name (tree decl
, size_t *len
)
1257 const char *p
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1258 const char *end
= p
+ IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
1259 bool nested
= false;
1260 if (strncmp (p
, "_Z", 2))
1263 if (!strncmp (p
, "St", 2))
1269 while (ISDIGIT (p
[0]))
1272 long num
= strtol (p
, &e
, 10);
1273 if (num
>= 1 && num
< end
- e
)
1279 if (strncmp (p
, "DC", 2))
1293 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1294 mangled through special entry points.
1296 <unqualified-name> ::= <operator-name>
1299 ::= <unnamed-type-name>
1300 ::= <local-source-name>
1302 <local-source-name> ::= L <source-name> <discriminator> */
1305 write_unqualified_id (tree identifier
)
1307 if (IDENTIFIER_CONV_OP_P (identifier
))
1308 write_conversion_operator_name (TREE_TYPE (identifier
));
1309 else if (IDENTIFIER_OVL_OP_P (identifier
))
1311 const ovl_op_info_t
*ovl_op
= IDENTIFIER_OVL_OP_INFO (identifier
);
1312 write_string (ovl_op
->mangled_name
);
1314 else if (UDLIT_OPER_P (identifier
))
1315 write_literal_operator_name (identifier
);
1317 write_source_name (identifier
);
1321 write_unqualified_name (tree decl
)
1323 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1325 if (identifier_p (decl
))
1327 write_unqualified_id (decl
);
1333 if (DECL_NAME (decl
) == NULL_TREE
)
1336 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1337 const char *decomp_str
= NULL
;
1338 size_t decomp_len
= 0;
1340 && DECL_DECOMPOSITION_P (decl
)
1341 && DECL_NAME (decl
) == NULL_TREE
1342 && DECL_NAMESPACE_SCOPE_P (decl
))
1343 decomp_str
= find_decomp_unqualified_name (decl
, &decomp_len
);
1345 write_chars (decomp_str
, decomp_len
);
1347 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1349 else if (DECL_DECLARES_FUNCTION_P (decl
))
1352 if (DECL_CONSTRUCTOR_P (decl
))
1353 write_special_name_constructor (decl
);
1354 else if (DECL_DESTRUCTOR_P (decl
))
1355 write_special_name_destructor (decl
);
1356 else if (DECL_CONV_FN_P (decl
))
1358 /* Conversion operator. Handle it right here.
1359 <operator> ::= cv <type> */
1361 if (decl_is_template_id (decl
, NULL
))
1364 fn_type
= get_mostly_instantiated_function_type (decl
);
1365 type
= TREE_TYPE (fn_type
);
1367 else if (FNDECL_USED_AUTO (decl
))
1368 type
= DECL_SAVED_AUTO_RETURN_TYPE (decl
);
1370 type
= DECL_CONV_FN_TYPE (decl
);
1371 write_conversion_operator_name (type
);
1373 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1375 const char *mangled_name
1376 = (ovl_op_info
[DECL_ASSIGNMENT_OPERATOR_P (decl
)]
1377 [DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
)].mangled_name
);
1378 write_string (mangled_name
);
1380 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1381 write_literal_operator_name (DECL_NAME (decl
));
1388 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1389 && DECL_NAMESPACE_SCOPE_P (decl
)
1390 && decl_linkage (decl
) == lk_internal
)
1392 MANGLE_TRACE_TREE ("local-source-name", decl
);
1394 write_source_name (DECL_NAME (decl
));
1395 /* The default discriminator is 1, and that's all we ever use,
1396 so there's no code to output one here. */
1400 tree type
= TREE_TYPE (decl
);
1402 if (TREE_CODE (decl
) == TYPE_DECL
1403 && TYPE_UNNAMED_P (type
))
1404 write_unnamed_type_name (type
);
1405 else if (TREE_CODE (decl
) == TYPE_DECL
1406 && LAMBDA_TYPE_P (type
))
1407 write_closure_type_name (type
);
1409 write_source_name (DECL_NAME (decl
));
1412 /* We use the ABI tags from the primary class template, ignoring tags on any
1413 specializations. This is necessary because C++ doesn't require a
1414 specialization to be declared before it is used unless the use requires a
1415 complete type, but we need to get the tags right on incomplete types as
1417 if (tree tmpl
= most_general_template (decl
))
1419 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1420 if (res
== NULL_TREE
)
1421 /* UNBOUND_CLASS_TEMPLATE. */;
1422 else if (DECL_DECLARES_TYPE_P (decl
))
1424 else if (any_abi_below (11))
1426 /* ABI v10 implicit tags on the template. */
1427 tree mtags
= missing_abi_tags (res
);
1428 /* Explicit tags on the template. */
1429 tree ttags
= get_abi_tags (res
);
1430 /* Tags on the instantiation. */
1431 tree dtags
= get_abi_tags (decl
);
1433 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1434 G
.need_abi_warning
= 1;
1436 /* Add the v10 tags to the explicit tags now. */
1437 mtags
= chainon (mtags
, ttags
);
1439 if (!G
.need_abi_warning
1440 && abi_warn_or_compat_version_crosses (11)
1441 && !equal_abi_tags (dtags
, mtags
))
1442 G
.need_abi_warning
= 1;
1444 if (!abi_version_at_least (10))
1445 /* In abi <10, we only got the explicit tags. */
1447 else if (flag_abi_version
== 10)
1449 /* In ABI 10, we want explict and implicit tags. */
1450 write_abi_tags (mtags
);
1456 tree tags
= get_abi_tags (decl
);
1457 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1458 && any_abi_below (11))
1459 if (tree mtags
= missing_abi_tags (decl
))
1461 if (abi_warn_or_compat_version_crosses (11))
1462 G
.need_abi_warning
= true;
1463 if (!abi_version_at_least (11))
1464 tags
= chainon (mtags
, tags
);
1466 write_abi_tags (tags
);
1469 /* Write the unqualified-name for a conversion operator to TYPE. */
1472 write_conversion_operator_name (const tree type
)
1474 write_string ("cv");
1478 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1480 <source-name> ::= </length/ number> <identifier> */
1483 write_source_name (tree identifier
)
1485 MANGLE_TRACE_TREE ("source-name", identifier
);
1487 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1488 write_identifier (IDENTIFIER_POINTER (identifier
));
1491 /* Compare two TREE_STRINGs like strcmp. */
1494 tree_string_cmp (const void *p1
, const void *p2
)
1498 tree s1
= *(const tree
*)p1
;
1499 tree s2
= *(const tree
*)p2
;
1500 return strcmp (TREE_STRING_POINTER (s1
),
1501 TREE_STRING_POINTER (s2
));
1504 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1506 static vec
<tree
, va_gc
> *
1507 sorted_abi_tags (tree tags
)
1509 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1511 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1513 if (ABI_TAG_IMPLICIT (t
))
1515 tree str
= TREE_VALUE (t
);
1516 vec_safe_push (vec
, str
);
1519 vec
->qsort (tree_string_cmp
);
1524 /* ID is the name of a function or type with abi_tags attribute TAGS.
1525 Write out the name, suitably decorated. */
1528 write_abi_tags (tree tags
)
1530 if (tags
== NULL_TREE
)
1533 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1535 unsigned i
; tree str
;
1536 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1539 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1540 write_identifier (TREE_STRING_POINTER (str
));
1543 release_tree_vector (vec
);
1546 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1549 equal_abi_tags (tree t1
, tree t2
)
1551 releasing_vec v1
= sorted_abi_tags (t1
);
1552 releasing_vec v2
= sorted_abi_tags (t2
);
1554 unsigned len1
= v1
->length();
1555 if (len1
!= v2
->length())
1557 for (unsigned i
= 0; i
< len1
; ++i
)
1558 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1563 /* Write a user-defined literal operator.
1564 ::= li <source-name> # "" <source-name>
1565 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1568 write_literal_operator_name (tree identifier
)
1570 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1571 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1572 write_unsigned_number (strlen (suffix
));
1573 write_identifier (suffix
);
1576 /* Encode 0 as _, and 1+ as n-1_. */
1579 write_compact_number (int num
)
1582 write_unsigned_number (num
- 1);
1586 /* Return how many unnamed types precede TYPE in its enclosing class. */
1589 nested_anon_class_index (tree type
)
1592 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1593 for (; member
; member
= DECL_CHAIN (member
))
1594 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1596 tree memtype
= TREE_TYPE (member
);
1597 if (memtype
== type
)
1599 else if (TYPE_UNNAMED_P (memtype
))
1609 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1612 write_unnamed_type_name (const tree type
)
1615 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1617 if (TYPE_FUNCTION_SCOPE_P (type
))
1618 discriminator
= discriminator_for_local_entity (TYPE_NAME (type
));
1619 else if (TYPE_CLASS_SCOPE_P (type
))
1620 discriminator
= nested_anon_class_index (type
);
1623 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1624 /* Just use the old mangling at namespace scope. */
1625 write_source_name (TYPE_IDENTIFIER (type
));
1629 write_string ("Ut");
1630 write_compact_number (discriminator
);
1633 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1634 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1637 write_closure_type_name (const tree type
)
1639 tree fn
= lambda_function (type
);
1640 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1641 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1643 MANGLE_TRACE_TREE ("closure-type-name", type
);
1645 write_string ("Ul");
1646 write_method_parms (parms
, /*method_p=*/1, fn
);
1648 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1651 /* Convert NUMBER to ascii using base BASE and generating at least
1652 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1653 into which to store the characters. Returns the number of
1654 characters generated (these will be laid out in advance of where
1658 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1659 char *buffer
, const unsigned int min_digits
)
1661 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1662 unsigned digits
= 0;
1666 unsigned HOST_WIDE_INT d
= number
/ base
;
1668 *--buffer
= base_digits
[number
- d
* base
];
1672 while (digits
< min_digits
)
1674 *--buffer
= base_digits
[0];
1680 /* Non-terminal <number>.
1682 <number> ::= [n] </decimal integer/> */
1685 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1686 const unsigned int base
)
1688 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1691 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1694 number
= -((HOST_WIDE_INT
) number
);
1696 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1697 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1700 /* Write out an integral CST in decimal. Most numbers are small, and
1701 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1702 bigger than that, which we must deal with. */
1705 write_integer_cst (const tree cst
)
1707 int sign
= tree_int_cst_sgn (cst
);
1708 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1709 if (!wi::fits_uhwi_p (abs_value
))
1711 /* A bignum. We do this in chunks, each of which fits in a
1713 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1714 unsigned HOST_WIDE_INT chunk
;
1715 unsigned chunk_digits
;
1716 char *ptr
= buffer
+ sizeof (buffer
);
1721 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1726 if (sizeof (HOST_WIDE_INT
) >= 8)
1728 /* It is at least 64 bits, so 10^18 is representable. */
1733 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1734 base
= build_int_cstu (type
, chunk
);
1735 n
= wide_int_to_tree (type
, wi::to_wide (cst
));
1740 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1744 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1745 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1748 done
= integer_zerop (d
);
1749 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1750 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1751 done
? 1 : chunk_digits
);
1757 write_chars (ptr
, count
);
1764 write_unsigned_number (abs_value
.to_uhwi ());
1768 /* Write out a floating-point literal.
1770 "Floating-point literals are encoded using the bit pattern of the
1771 target processor's internal representation of that number, as a
1772 fixed-length lowercase hexadecimal string, high-order bytes first
1773 (even if the target processor would store low-order bytes first).
1774 The "n" prefix is not used for floating-point literals; the sign
1775 bit is encoded with the rest of the number.
1777 Here are some examples, assuming the IEEE standard representation
1778 for floating point numbers. (Spaces are for readability, not
1779 part of the encoding.)
1782 -1.0f Lf bf80 0000 E
1783 1.17549435e-38f Lf 0080 0000 E
1784 1.40129846e-45f Lf 0000 0001 E
1785 0.0f Lf 0000 0000 E"
1787 Caller is responsible for the Lx and the E. */
1789 write_real_cst (const tree value
)
1791 long target_real
[4]; /* largest supported float */
1792 /* Buffer for eight hex digits in a 32-bit number but big enough
1793 even for 64-bit long to avoid warnings. */
1797 tree type
= TREE_TYPE (value
);
1798 int words
= GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type
)) / 32;
1800 real_to_target (target_real
, &TREE_REAL_CST (value
),
1803 /* The value in target_real is in the target word order,
1804 so we must write it out backward if that happens to be
1805 little-endian. write_number cannot be used, it will
1806 produce uppercase. */
1807 if (FLOAT_WORDS_BIG_ENDIAN
)
1808 i
= 0, limit
= words
, dir
= 1;
1810 i
= words
- 1, limit
= -1, dir
= -1;
1812 for (; i
!= limit
; i
+= dir
)
1814 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1815 write_chars (buffer
, 8);
1819 /* Non-terminal <identifier>.
1821 <identifier> ::= </unqualified source code identifier> */
1824 write_identifier (const char *identifier
)
1826 MANGLE_TRACE ("identifier", identifier
);
1827 write_string (identifier
);
1830 /* Handle constructor productions of non-terminal <special-name>.
1831 CTOR is a constructor FUNCTION_DECL.
1833 <special-name> ::= C1 # complete object constructor
1834 ::= C2 # base object constructor
1835 ::= C3 # complete object allocating constructor
1837 Currently, allocating constructors are never used. */
1840 write_special_name_constructor (const tree ctor
)
1843 bool new_inh
= (flag_new_inheriting_ctors
1844 && DECL_INHERITED_CTOR (ctor
));
1847 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1849 /* This is the old-style "[unified]" constructor.
1850 In some cases, we may emit this function and call
1851 it from the clones in order to share code and save space. */
1852 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1856 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1860 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1863 /* Handle destructor productions of non-terminal <special-name>.
1864 DTOR is a destructor FUNCTION_DECL.
1866 <special-name> ::= D0 # deleting (in-charge) destructor
1867 ::= D1 # complete object (in-charge) destructor
1868 ::= D2 # base object (not-in-charge) destructor */
1871 write_special_name_destructor (const tree dtor
)
1873 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1874 write_string ("D0");
1875 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1876 write_string ("D2");
1877 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1878 /* This is the old-style "[unified]" destructor.
1879 In some cases, we may emit this function and call
1880 it from the clones in order to share code and save space. */
1881 write_string ("D4");
1884 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1885 write_string ("D1");
1889 /* Return the discriminator for ENTITY appearing inside
1890 FUNCTION. The discriminator is the lexical ordinal of VAR or TYPE among
1891 entities with the same name and kind in the same FUNCTION. */
1894 discriminator_for_local_entity (tree entity
)
1896 if (!DECL_LANG_SPECIFIC (entity
))
1898 /* Some decls, like __FUNCTION__, don't need a discriminator. */
1899 gcc_checking_assert (DECL_ARTIFICIAL (entity
));
1902 else if (tree disc
= DECL_DISCRIMINATOR (entity
))
1903 return TREE_INT_CST_LOW (disc
);
1905 /* The first entity with a particular name doesn't get
1906 DECL_DISCRIMINATOR set up. */
1910 /* Return the discriminator for STRING, a string literal used inside
1911 FUNCTION. The discriminator is the lexical ordinal of STRING among
1912 string literals used in FUNCTION. */
1915 discriminator_for_string_literal (tree
/*function*/,
1918 /* For now, we don't discriminate amongst string literals. */
1922 /* <discriminator> := _ <number> # when number < 10
1923 := __ <number> _ # when number >= 10
1925 The discriminator is used only for the second and later occurrences
1926 of the same name within a single function. In this case <number> is
1927 n - 2, if this is the nth occurrence, in lexical order. */
1930 write_discriminator (const int discriminator
)
1932 /* If discriminator is zero, don't write anything. Otherwise... */
1933 if (discriminator
> 0)
1936 if (discriminator
- 1 >= 10)
1938 if (abi_warn_or_compat_version_crosses (11))
1939 G
.need_abi_warning
= 1;
1940 if (abi_version_at_least (11))
1943 write_unsigned_number (discriminator
- 1);
1944 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
1949 /* Mangle the name of a function-scope entity. FUNCTION is the
1950 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1951 default argument scope. ENTITY is the decl for the entity itself.
1952 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1953 either ENTITY itself or an enclosing scope of ENTITY.
1955 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1956 := Z <function encoding> E s [<discriminator>]
1957 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1960 write_local_name (tree function
, const tree local_entity
,
1963 tree parm
= NULL_TREE
;
1965 MANGLE_TRACE_TREE ("local-name", entity
);
1967 if (TREE_CODE (function
) == PARM_DECL
)
1970 function
= DECL_CONTEXT (parm
);
1974 write_encoding (function
);
1977 /* For this purpose, parameters are numbered from right-to-left. */
1982 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1990 write_compact_number (i
- 1);
1993 if (TREE_CODE (entity
) == STRING_CST
)
1996 write_discriminator (discriminator_for_string_literal (function
,
2001 /* Now the <entity name>. Let write_name know its being called
2002 from <local-name>, so it doesn't try to process the enclosing
2003 function scope again. */
2004 write_name (entity
, /*ignore_local_scope=*/1);
2005 if (DECL_DISCRIMINATOR_P (local_entity
)
2006 && !(TREE_CODE (local_entity
) == TYPE_DECL
2007 && TYPE_ANON_P (TREE_TYPE (local_entity
))))
2008 write_discriminator (discriminator_for_local_entity (local_entity
));
2012 /* Non-terminals <type> and <CV-qualifier>.
2014 <type> ::= <builtin-type>
2016 ::= <class-enum-type>
2018 ::= <pointer-to-member-type>
2019 ::= <template-param>
2022 ::= P <type> # pointer-to
2023 ::= R <type> # reference-to
2024 ::= C <type> # complex pair (C 2000)
2025 ::= G <type> # imaginary (C 2000) [not supported]
2026 ::= U <source-name> <type> # vendor extended type qualifier
2030 <type> ::= RR <type> # rvalue reference-to
2031 <type> ::= Dt <expression> # decltype of an id-expression or
2032 # class member access
2033 <type> ::= DT <expression> # decltype of an expression
2034 <type> ::= Dn # decltype of nullptr
2036 TYPE is a type node. */
2039 write_type (tree type
)
2041 /* This gets set to nonzero if TYPE turns out to be a (possibly
2042 CV-qualified) builtin type. */
2043 int is_builtin_type
= 0;
2045 MANGLE_TRACE_TREE ("type", type
);
2047 if (type
== error_mark_node
)
2050 type
= canonicalize_for_substitution (type
);
2051 if (find_substitution (type
))
2055 if (write_CV_qualifiers_for_type (type
) > 0)
2056 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2057 mangle the unqualified type. The recursive call is needed here
2058 since both the qualified and unqualified types are substitution
2061 tree t
= TYPE_MAIN_VARIANT (type
);
2062 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2064 tree attrs
= NULL_TREE
;
2065 if (tx_safe_fn_type_p (type
))
2066 attrs
= tree_cons (get_identifier ("transaction_safe"),
2068 t
= cp_build_type_attribute_variant (t
, attrs
);
2070 gcc_assert (t
!= type
);
2071 if (FUNC_OR_METHOD_TYPE_P (t
))
2073 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2074 if (flag_noexcept_type
)
2076 tree r
= TYPE_RAISES_EXCEPTIONS (type
);
2077 t
= build_exception_variant (t
, r
);
2079 if (abi_version_at_least (8)
2080 || type
== TYPE_MAIN_VARIANT (type
))
2081 /* Avoid adding the unqualified function type as a substitution. */
2082 write_function_type (t
);
2085 if (abi_warn_or_compat_version_crosses (8))
2086 G
.need_abi_warning
= 1;
2091 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2092 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2093 so that the cv-qualification of the element type is available
2094 in write_array_type. */
2095 write_array_type (type
);
2098 tree type_orig
= type
;
2100 /* See through any typedefs. */
2101 type
= TYPE_MAIN_VARIANT (type
);
2102 if (FUNC_OR_METHOD_TYPE_P (type
))
2103 type
= cxx_copy_lang_qualifiers (type
, type_orig
);
2105 /* According to the C++ ABI, some library classes are passed the
2106 same as the scalar type of their single member and use the same
2108 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2109 type
= TREE_TYPE (first_field (type
));
2111 if (TYPE_PTRDATAMEM_P (type
))
2112 write_pointer_to_member_type (type
);
2115 /* Handle any target-specific fundamental types. */
2116 const char *target_mangling
2117 = targetm
.mangle_type (type_orig
);
2119 if (target_mangling
)
2121 write_string (target_mangling
);
2122 /* Add substitutions for types other than fundamental
2124 if (!VOID_TYPE_P (type
)
2125 && TREE_CODE (type
) != INTEGER_TYPE
2126 && TREE_CODE (type
) != REAL_TYPE
2127 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2128 add_substitution (type
);
2132 switch (TREE_CODE (type
))
2136 case INTEGER_TYPE
: /* Includes wchar_t. */
2138 case FIXED_POINT_TYPE
:
2140 /* If this is a typedef, TYPE may not be one of
2141 the standard builtin type nodes, but an alias of one. Use
2142 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2143 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2150 write_type (TREE_TYPE (type
));
2155 write_function_type (type
);
2161 /* A pointer-to-member function is represented as a special
2162 RECORD_TYPE, so check for this first. */
2163 if (TYPE_PTRMEMFUNC_P (type
))
2164 write_pointer_to_member_type (type
);
2166 write_class_enum_type (type
);
2170 case UNBOUND_CLASS_TEMPLATE
:
2171 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2172 ordinary nested names. */
2173 write_nested_name (TYPE_STUB_DECL (type
));
2177 case REFERENCE_TYPE
:
2178 if (TYPE_PTR_P (type
))
2180 else if (TYPE_REF_IS_RVALUE (type
))
2185 tree target
= TREE_TYPE (type
);
2186 /* Attribute const/noreturn are not reflected in mangling.
2187 We strip them here rather than at a lower level because
2188 a typedef or template argument can have function type
2189 with function-cv-quals (that use the same representation),
2190 but you can't have a pointer/reference to such a type. */
2191 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2193 if (abi_warn_or_compat_version_crosses (5)
2194 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2195 G
.need_abi_warning
= 1;
2196 if (abi_version_at_least (5))
2197 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2199 write_type (target
);
2203 case TEMPLATE_TYPE_PARM
:
2206 if (AUTO_IS_DECLTYPE (type
))
2207 write_identifier ("Dc");
2209 write_identifier ("Da");
2214 case TEMPLATE_PARM_INDEX
:
2215 write_template_param (type
);
2218 case TEMPLATE_TEMPLATE_PARM
:
2219 write_template_template_param (type
);
2222 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2223 write_template_template_param (type
);
2225 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2229 if (abi_version_at_least (4))
2231 write_string ("Dv");
2232 /* Non-constant vector size would be encoded with
2233 _ expression, but we don't support that yet. */
2234 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
)
2239 write_string ("U8__vector");
2240 if (abi_warn_or_compat_version_crosses (4))
2241 G
.need_abi_warning
= 1;
2242 write_type (TREE_TYPE (type
));
2245 case TYPE_PACK_EXPANSION
:
2246 write_string ("Dp");
2247 write_type (PACK_EXPANSION_PATTERN (type
));
2251 /* These shouldn't make it into mangling. */
2252 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2253 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2255 /* In ABI <5, we stripped decltype of a plain decl. */
2256 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2258 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2259 tree etype
= NULL_TREE
;
2260 switch (TREE_CODE (expr
))
2267 case TEMPLATE_PARM_INDEX
:
2268 etype
= TREE_TYPE (expr
);
2275 if (etype
&& !type_uses_auto (etype
))
2277 if (abi_warn_or_compat_version_crosses (5))
2278 G
.need_abi_warning
= 1;
2279 if (!abi_version_at_least (5))
2288 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2292 ++cp_unevaluated_operand
;
2293 write_expression (DECLTYPE_TYPE_EXPR (type
));
2294 --cp_unevaluated_operand
;
2299 write_string ("Dn");
2300 if (abi_version_at_least (7))
2302 if (abi_warn_or_compat_version_crosses (7))
2303 G
.need_abi_warning
= 1;
2307 sorry ("mangling %<typeof%>, use %<decltype%> instead");
2310 case UNDERLYING_TYPE
:
2311 sorry ("mangling %<__underlying_type%>");
2323 /* Types other than builtin types are substitution candidates. */
2324 if (!is_builtin_type
)
2325 add_substitution (type
);
2328 /* qsort callback for sorting a vector of attribute entries. */
2331 attr_strcmp (const void *p1
, const void *p2
)
2333 tree a1
= *(const tree
*)p1
;
2334 tree a2
= *(const tree
*)p2
;
2336 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2337 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2339 return strcmp (as1
->name
, as2
->name
);
2342 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2343 CV-qualifiers written for TYPE.
2345 <CV-qualifiers> ::= [r] [V] [K] */
2348 write_CV_qualifiers_for_type (const tree type
)
2350 int num_qualifiers
= 0;
2352 /* The order is specified by:
2354 "In cases where multiple order-insensitive qualifiers are
2355 present, they should be ordered 'K' (closest to the base type),
2356 'V', 'r', and 'U' (farthest from the base type) ..." */
2358 /* Mangle attributes that affect type identity as extended qualifiers.
2360 We don't do this with classes and enums because their attributes
2361 are part of their definitions, not something added on. */
2363 if (!OVERLOAD_TYPE_P (type
))
2366 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2368 tree name
= get_attribute_name (a
);
2369 const attribute_spec
*as
= lookup_attribute_spec (name
);
2370 if (as
&& as
->affects_type_identity
2371 && !is_attribute_p ("transaction_safe", name
)
2372 && !is_attribute_p ("abi_tag", name
))
2375 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2376 G
.need_abi_warning
= true;
2377 if (abi_version_at_least (10))
2379 vec
.qsort (attr_strcmp
);
2380 while (!vec
.is_empty())
2383 const attribute_spec
*as
2384 = lookup_attribute_spec (get_attribute_name (a
));
2387 write_unsigned_number (strlen (as
->name
));
2388 write_string (as
->name
);
2392 for (tree args
= TREE_VALUE (a
); args
;
2393 args
= TREE_CHAIN (args
))
2395 tree arg
= TREE_VALUE (args
);
2396 write_template_arg (arg
);
2406 /* Note that we do not use cp_type_quals below; given "const
2407 int[3]", the "const" is emitted with the "int", not with the
2409 cp_cv_quals quals
= TYPE_QUALS (type
);
2411 if (quals
& TYPE_QUAL_RESTRICT
)
2416 if (quals
& TYPE_QUAL_VOLATILE
)
2421 if (quals
& TYPE_QUAL_CONST
)
2427 return num_qualifiers
;
2430 /* Non-terminal <builtin-type>.
2432 <builtin-type> ::= v # void
2437 ::= h # unsigned char
2439 ::= t # unsigned short
2441 ::= j # unsigned int
2443 ::= m # unsigned long
2444 ::= x # long long, __int64
2445 ::= y # unsigned long long, __int64
2447 ::= o # unsigned __int128
2450 ::= e # long double, __float80
2451 ::= g # __float128 [not supported]
2452 ::= u <source-name> # vendor extended type */
2455 write_builtin_type (tree type
)
2457 if (TYPE_CANONICAL (type
))
2458 type
= TYPE_CANONICAL (type
);
2460 switch (TREE_CODE (type
))
2471 /* TYPE may still be wchar_t, char8_t, char16_t, or char32_t, since that
2472 isn't in integer_type_nodes. */
2473 if (type
== wchar_type_node
)
2475 else if (type
== char8_type_node
)
2476 write_string ("Du");
2477 else if (type
== char16_type_node
)
2478 write_string ("Ds");
2479 else if (type
== char32_type_node
)
2480 write_string ("Di");
2484 /* Assume TYPE is one of the shared integer type nodes. Find
2485 it in the array of these nodes. */
2487 for (itk
= 0; itk
< itk_none
; ++itk
)
2488 if (integer_types
[itk
] != NULL_TREE
2489 && integer_type_codes
[itk
] != '\0'
2490 && type
== integer_types
[itk
])
2492 /* Print the corresponding single-letter code. */
2493 write_char (integer_type_codes
[itk
]);
2497 if (itk
== itk_none
)
2499 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2500 TYPE_UNSIGNED (type
));
2507 if (TYPE_PRECISION (type
) == 128)
2508 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2511 /* Allow for cases where TYPE is not one of the shared
2512 integer type nodes and write a "vendor extended builtin
2513 type" with a name the form intN or uintN, respectively.
2514 Situations like this can happen if you have an
2515 __attribute__((__mode__(__SI__))) type and use exotic
2516 switches like '-mint8' on AVR. Of course, this is
2517 undefined by the C++ ABI (and '-mint8' is not even
2518 Standard C conforming), but when using such special
2519 options you're pretty much in nowhere land anyway. */
2521 char prec
[11]; /* up to ten digits for an unsigned */
2523 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2524 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2525 write_char ('u'); /* "vendor extended builtin type" */
2526 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2527 write_string (prefix
);
2528 write_string (prec
);
2535 if (type
== float_type_node
)
2537 else if (type
== double_type_node
)
2539 else if (type
== long_double_type_node
)
2541 else if (type
== dfloat32_type_node
)
2542 write_string ("Df");
2543 else if (type
== dfloat64_type_node
)
2544 write_string ("Dd");
2545 else if (type
== dfloat128_type_node
)
2546 write_string ("De");
2551 case FIXED_POINT_TYPE
:
2552 write_string ("DF");
2553 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2554 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2555 if (type
== fract_type_node
2556 || type
== sat_fract_type_node
2557 || type
== accum_type_node
2558 || type
== sat_accum_type_node
)
2560 else if (type
== unsigned_fract_type_node
2561 || type
== sat_unsigned_fract_type_node
2562 || type
== unsigned_accum_type_node
2563 || type
== sat_unsigned_accum_type_node
)
2565 else if (type
== short_fract_type_node
2566 || type
== sat_short_fract_type_node
2567 || type
== short_accum_type_node
2568 || type
== sat_short_accum_type_node
)
2570 else if (type
== unsigned_short_fract_type_node
2571 || type
== sat_unsigned_short_fract_type_node
2572 || type
== unsigned_short_accum_type_node
2573 || type
== sat_unsigned_short_accum_type_node
)
2575 else if (type
== long_fract_type_node
2576 || type
== sat_long_fract_type_node
2577 || type
== long_accum_type_node
2578 || type
== sat_long_accum_type_node
)
2580 else if (type
== unsigned_long_fract_type_node
2581 || type
== sat_unsigned_long_fract_type_node
2582 || type
== unsigned_long_accum_type_node
2583 || type
== sat_unsigned_long_accum_type_node
)
2585 else if (type
== long_long_fract_type_node
2586 || type
== sat_long_long_fract_type_node
2587 || type
== long_long_accum_type_node
2588 || type
== sat_long_long_accum_type_node
)
2590 else if (type
== unsigned_long_long_fract_type_node
2591 || type
== sat_unsigned_long_long_fract_type_node
2592 || type
== unsigned_long_long_accum_type_node
2593 || type
== sat_unsigned_long_long_accum_type_node
)
2596 sorry ("mangling unknown fixed point type");
2597 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2598 if (TYPE_SATURATING (type
))
2609 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2610 METHOD_TYPE. The return type is mangled before the parameter
2613 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2616 write_function_type (const tree type
)
2618 MANGLE_TRACE_TREE ("function-type", type
);
2620 /* For a pointer to member function, the function type may have
2621 cv-qualifiers, indicating the quals for the artificial 'this'
2623 if (TREE_CODE (type
) == METHOD_TYPE
)
2625 /* The first parameter must be a POINTER_TYPE pointing to the
2626 `this' parameter. */
2627 tree this_type
= class_of_this_parm (type
);
2628 write_CV_qualifiers_for_type (this_type
);
2631 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2633 if (tx_safe_fn_type_p (type
))
2634 write_string ("Dx");
2637 /* We don't track whether or not a type is `extern "C"'. Note that
2638 you can have an `extern "C"' function that does not have
2639 `extern "C"' type, and vice versa:
2641 extern "C" typedef void function_t();
2642 function_t f; // f has C++ linkage, but its type is
2645 typedef void function_t();
2646 extern "C" function_t f; // Vice versa.
2649 write_bare_function_type (type
, /*include_return_type_p=*/1,
2651 if (FUNCTION_REF_QUALIFIED (type
))
2653 if (FUNCTION_RVALUE_QUALIFIED (type
))
2661 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2662 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2663 is mangled before the parameter types. If non-NULL, DECL is
2664 FUNCTION_DECL for the function whose type is being emitted. */
2667 write_bare_function_type (const tree type
, const int include_return_type_p
,
2670 MANGLE_TRACE_TREE ("bare-function-type", type
);
2672 /* Mangle the return type, if requested. */
2673 if (include_return_type_p
)
2674 write_type (TREE_TYPE (type
));
2676 /* Now mangle the types of the arguments. */
2678 write_method_parms (TYPE_ARG_TYPES (type
),
2679 TREE_CODE (type
) == METHOD_TYPE
,
2684 /* Write the mangled representation of a method parameter list of
2685 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2686 considered a non-static method, and the this parameter is omitted.
2687 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2688 parameters are being emitted. */
2691 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2693 tree first_parm_type
;
2694 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2696 /* Assume this parameter type list is variable-length. If it ends
2697 with a void type, then it's not. */
2700 /* If this is a member function, skip the first arg, which is the
2702 "Member functions do not encode the type of their implicit this
2705 Similarly, there's no need to mangle artificial parameters, like
2706 the VTT parameters for constructors and destructors. */
2709 parm_types
= TREE_CHAIN (parm_types
);
2710 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2712 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2714 parm_types
= TREE_CHAIN (parm_types
);
2715 parm_decl
= DECL_CHAIN (parm_decl
);
2718 if (decl
&& ctor_omit_inherited_parms (decl
))
2719 /* Bring back parameters omitted from an inherited ctor. */
2720 parm_types
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl
));
2723 for (first_parm_type
= parm_types
;
2725 parm_types
= TREE_CHAIN (parm_types
))
2727 tree parm
= TREE_VALUE (parm_types
);
2728 if (parm
== void_type_node
)
2730 /* "Empty parameter lists, whether declared as () or
2731 conventionally as (void), are encoded with a void parameter
2733 if (parm_types
== first_parm_type
)
2735 /* If the parm list is terminated with a void type, it's
2738 /* A void type better be the last one. */
2739 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2746 /* <builtin-type> ::= z # ellipsis */
2750 /* <class-enum-type> ::= <name> */
2753 write_class_enum_type (const tree type
)
2755 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2758 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2761 <template-args> ::= I <template-arg>* E */
2764 write_template_args (tree args
)
2769 MANGLE_TRACE_TREE ("template-args", args
);
2774 length
= TREE_VEC_LENGTH (args
);
2776 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2778 /* We have nested template args. We want the innermost template
2780 args
= TREE_VEC_ELT (args
, length
- 1);
2781 length
= TREE_VEC_LENGTH (args
);
2783 for (i
= 0; i
< length
; ++i
)
2784 write_template_arg (TREE_VEC_ELT (args
, i
));
2791 <unqualified-name> <template-args>
2792 part of SCOPE_REF or COMPONENT_REF mangling. */
2795 write_member_name (tree member
)
2797 if (identifier_p (member
))
2799 if (abi_version_at_least (11) && IDENTIFIER_ANY_OP_P (member
))
2801 write_string ("on");
2802 if (abi_warn_or_compat_version_crosses (11))
2803 G
.need_abi_warning
= 1;
2805 write_unqualified_id (member
);
2807 else if (DECL_P (member
))
2808 write_unqualified_name (member
);
2809 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2811 tree name
= TREE_OPERAND (member
, 0);
2812 name
= OVL_FIRST (name
);
2813 write_member_name (name
);
2814 write_template_args (TREE_OPERAND (member
, 1));
2817 write_expression (member
);
2820 /* <expression> ::= <unary operator-name> <expression>
2821 ::= <binary operator-name> <expression> <expression>
2824 <expr-primary> ::= <template-param>
2825 ::= L <type> <value number> E # literal
2826 ::= L <mangled-name> E # external name
2827 ::= st <type> # sizeof
2828 ::= sr <type> <unqualified-name> # dependent name
2829 ::= sr <type> <unqualified-name> <template-args> */
2832 write_expression (tree expr
)
2834 enum tree_code code
= TREE_CODE (expr
);
2836 if (TREE_CODE (expr
) == TARGET_EXPR
)
2838 expr
= TARGET_EXPR_INITIAL (expr
);
2839 code
= TREE_CODE (expr
);
2842 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2843 argument is converted (via qualification conversions) to another type. */
2844 while (CONVERT_EXPR_CODE_P (code
)
2845 || location_wrapper_p (expr
)
2846 /* Parentheses aren't mangled. */
2847 || code
== PAREN_EXPR
2848 || code
== NON_LVALUE_EXPR
2849 || (code
== VIEW_CONVERT_EXPR
2850 && TREE_CODE (TREE_OPERAND (expr
, 0)) == TEMPLATE_PARM_INDEX
))
2852 expr
= TREE_OPERAND (expr
, 0);
2853 code
= TREE_CODE (expr
);
2856 if (code
== BASELINK
2857 && (!type_unknown_p (expr
)
2858 || !BASELINK_QUALIFIED_P (expr
)))
2860 expr
= BASELINK_FUNCTIONS (expr
);
2861 code
= TREE_CODE (expr
);
2864 /* Handle pointers-to-members by making them look like expression
2866 if (code
== PTRMEM_CST
)
2868 expr
= build_nt (ADDR_EXPR
,
2869 build_qualified_name (/*type=*/NULL_TREE
,
2870 PTRMEM_CST_CLASS (expr
),
2871 PTRMEM_CST_MEMBER (expr
),
2872 /*template_p=*/false));
2873 code
= TREE_CODE (expr
);
2876 /* Handle template parameters. */
2877 if (code
== TEMPLATE_TYPE_PARM
2878 || code
== TEMPLATE_TEMPLATE_PARM
2879 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2880 || code
== TEMPLATE_PARM_INDEX
)
2881 write_template_param (expr
);
2882 /* Handle literals. */
2883 else if (TREE_CODE_CLASS (code
) == tcc_constant
2884 || code
== CONST_DECL
)
2885 write_template_arg_literal (expr
);
2886 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2888 gcc_assert (id_equal (DECL_NAME (expr
), "this"));
2889 write_string ("fpT");
2891 else if (code
== PARM_DECL
)
2893 /* A function parameter used in a late-specified return type. */
2894 int index
= DECL_PARM_INDEX (expr
);
2895 int level
= DECL_PARM_LEVEL (expr
);
2896 int delta
= G
.parm_depth
- level
+ 1;
2897 gcc_assert (index
>= 1);
2901 if (abi_version_at_least (5))
2903 /* Let L be the number of function prototype scopes from the
2904 innermost one (in which the parameter reference occurs) up
2905 to (and including) the one containing the declaration of
2906 the referenced parameter. If the parameter declaration
2907 clause of the innermost function prototype scope has been
2908 completely seen, it is not counted (in that case -- which
2909 is perhaps the most common -- L can be zero). */
2911 write_unsigned_number (delta
- 1);
2913 if (abi_warn_or_compat_version_crosses (5))
2914 G
.need_abi_warning
= true;
2917 write_compact_number (index
- 1);
2919 else if (DECL_P (expr
))
2922 write_mangled_name (expr
, false);
2925 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2927 tree op
= TREE_OPERAND (expr
, 0);
2929 if (PACK_EXPANSION_P (op
))
2931 if (abi_warn_or_compat_version_crosses (11))
2932 G
.need_abi_warning
= true;
2933 if (abi_version_at_least (11))
2935 /* sZ rather than szDp. */
2936 write_string ("sZ");
2937 write_expression (PACK_EXPANSION_PATTERN (op
));
2942 if (SIZEOF_EXPR_TYPE_P (expr
))
2944 write_string ("st");
2945 write_type (TREE_TYPE (op
));
2947 else if (ARGUMENT_PACK_P (op
))
2949 tree args
= ARGUMENT_PACK_ARGS (op
);
2950 int length
= TREE_VEC_LENGTH (args
);
2951 if (abi_warn_or_compat_version_crosses (10))
2952 G
.need_abi_warning
= true;
2953 if (abi_version_at_least (10))
2955 /* sP <template-arg>* E # sizeof...(T), size of a captured
2956 template parameter pack from an alias template */
2957 write_string ("sP");
2958 for (int i
= 0; i
< length
; ++i
)
2959 write_template_arg (TREE_VEC_ELT (args
, i
));
2964 /* In GCC 5 we represented this sizeof wrong, with the effect
2965 that we mangled it as the last element of the pack. */
2966 tree arg
= TREE_VEC_ELT (args
, length
-1);
2969 write_string ("st");
2974 write_string ("sz");
2975 write_expression (arg
);
2979 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2981 write_string ("st");
2982 write_type (TREE_OPERAND (expr
, 0));
2987 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2988 && TYPE_P (TREE_OPERAND (expr
, 0)))
2990 write_string ("at");
2991 write_type (TREE_OPERAND (expr
, 0));
2993 else if (code
== SCOPE_REF
2994 || code
== BASELINK
)
2997 if (code
== SCOPE_REF
)
2999 scope
= TREE_OPERAND (expr
, 0);
3000 member
= TREE_OPERAND (expr
, 1);
3001 if (BASELINK_P (member
))
3002 member
= BASELINK_FUNCTIONS (member
);
3006 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
3007 member
= BASELINK_FUNCTIONS (expr
);
3010 /* If the MEMBER is a real declaration, then the qualifying
3011 scope was not dependent. Ideally, we would not have a
3012 SCOPE_REF in those cases, but sometimes we do. If the second
3013 argument is a DECL, then the name must not have been
3015 if (DECL_P (member
))
3016 write_expression (member
);
3019 write_string ("sr");
3021 write_member_name (member
);
3024 else if (INDIRECT_REF_P (expr
)
3025 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3026 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3028 write_expression (TREE_OPERAND (expr
, 0));
3030 else if (identifier_p (expr
))
3032 /* An operator name appearing as a dependent name needs to be
3033 specially marked to disambiguate between a use of the operator
3034 name and a use of the operator in an expression. */
3035 if (IDENTIFIER_ANY_OP_P (expr
))
3036 write_string ("on");
3037 write_unqualified_id (expr
);
3039 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3041 tree fn
= TREE_OPERAND (expr
, 0);
3043 if (IDENTIFIER_ANY_OP_P (fn
))
3044 write_string ("on");
3045 write_unqualified_id (fn
);
3046 write_template_args (TREE_OPERAND (expr
, 1));
3048 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3050 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3051 const char *name
= OVL_OP_INFO (true, subop
)->mangled_name
;
3053 write_string (name
);
3054 write_expression (TREE_OPERAND (expr
, 0));
3055 write_expression (TREE_OPERAND (expr
, 2));
3057 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3059 /* ::= [gs] nw <expression>* _ <type> E
3060 ::= [gs] nw <expression>* _ <type> <initializer>
3061 ::= [gs] na <expression>* _ <type> E
3062 ::= [gs] na <expression>* _ <type> <initializer>
3063 <initializer> ::= pi <expression>* E */
3064 tree placement
= TREE_OPERAND (expr
, 0);
3065 tree type
= TREE_OPERAND (expr
, 1);
3066 tree nelts
= TREE_OPERAND (expr
, 2);
3067 tree init
= TREE_OPERAND (expr
, 3);
3070 gcc_assert (code
== NEW_EXPR
);
3071 if (TREE_OPERAND (expr
, 2))
3072 code
= VEC_NEW_EXPR
;
3074 if (NEW_EXPR_USE_GLOBAL (expr
))
3075 write_string ("gs");
3077 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3079 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3080 write_expression (TREE_VALUE (t
));
3087 ++processing_template_decl
;
3088 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3089 tf_warning_or_error
);
3090 type
= build_cplus_array_type (type
, domain
);
3091 --processing_template_decl
;
3095 if (init
&& TREE_CODE (init
) == TREE_LIST
3096 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3097 write_expression (TREE_VALUE (init
));
3101 write_string ("pi");
3102 if (init
&& init
!= void_node
)
3103 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3104 write_expression (TREE_VALUE (t
));
3108 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3110 gcc_assert (code
== DELETE_EXPR
);
3111 if (DELETE_EXPR_USE_VEC (expr
))
3112 code
= VEC_DELETE_EXPR
;
3114 if (DELETE_EXPR_USE_GLOBAL (expr
))
3115 write_string ("gs");
3117 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3119 write_expression (TREE_OPERAND (expr
, 0));
3121 else if (code
== THROW_EXPR
)
3123 tree op
= TREE_OPERAND (expr
, 0);
3126 write_string ("tw");
3127 write_expression (op
);
3130 write_string ("tr");
3132 else if (code
== CONSTRUCTOR
)
3134 bool braced_init
= BRACE_ENCLOSED_INITIALIZER_P (expr
);
3135 tree etype
= TREE_TYPE (expr
);
3138 write_string ("il");
3141 write_string ("tl");
3145 if (!initializer_zerop (expr
) || !trivial_type_p (etype
))
3147 /* Convert braced initializer lists to STRING_CSTs so that
3148 A<"Foo"> mangles the same as A<{'F', 'o', 'o', 0}> while
3149 still using the latter mangling for strings that
3150 originated as braced initializer lists. */
3151 expr
= braced_lists_to_strings (etype
, expr
);
3153 if (TREE_CODE (expr
) == CONSTRUCTOR
)
3155 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3156 unsigned last_nonzero
= -1, i
;
3159 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3160 if (!initializer_zerop (val
))
3163 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3165 if (i
> last_nonzero
)
3167 write_expression (val
);
3172 gcc_assert (TREE_CODE (expr
) == STRING_CST
);
3173 write_expression (expr
);
3178 else if (code
== LAMBDA_EXPR
)
3180 /* [temp.over.link] Two lambda-expressions are never considered
3183 So just use the closure type mangling. */
3184 write_string ("tl");
3185 write_type (LAMBDA_EXPR_CLOSURE (expr
));
3188 else if (dependent_name (expr
))
3190 write_unqualified_id (dependent_name (expr
));
3198 /* When we bind a variable or function to a non-type template
3199 argument with reference type, we create an ADDR_EXPR to show
3200 the fact that the entity's address has been taken. But, we
3201 don't actually want to output a mangling code for the `&'. */
3202 if (TREE_CODE (expr
) == ADDR_EXPR
3204 && TYPE_REF_P (TREE_TYPE (expr
)))
3206 expr
= TREE_OPERAND (expr
, 0);
3209 write_expression (expr
);
3213 code
= TREE_CODE (expr
);
3216 if (code
== COMPONENT_REF
)
3218 tree ob
= TREE_OPERAND (expr
, 0);
3220 if (TREE_CODE (ob
) == ARROW_EXPR
)
3222 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3223 ob
= TREE_OPERAND (ob
, 0);
3224 write_expression (ob
);
3226 else if (!is_dummy_object (ob
))
3228 write_string ("dt");
3229 write_expression (ob
);
3231 /* else, for a non-static data member with no associated object (in
3232 unevaluated context), use the unresolved-name mangling. */
3234 write_member_name (TREE_OPERAND (expr
, 1));
3238 /* If it wasn't any of those, recursively expand the expression. */
3239 name
= OVL_OP_INFO (false, code
)->mangled_name
;
3241 /* We used to mangle const_cast and static_cast like a C cast. */
3242 if (code
== CONST_CAST_EXPR
3243 || code
== STATIC_CAST_EXPR
)
3245 if (abi_warn_or_compat_version_crosses (6))
3246 G
.need_abi_warning
= 1;
3247 if (!abi_version_at_least (6))
3248 name
= OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
;
3256 error ("use of built-in trait %qE in function signature; "
3257 "use library traits instead", expr
);
3261 sorry ("mangling %C", code
);
3267 write_string (name
);
3273 tree fn
= CALL_EXPR_FN (expr
);
3275 if (TREE_CODE (fn
) == ADDR_EXPR
)
3276 fn
= TREE_OPERAND (fn
, 0);
3278 /* Mangle a dependent name as the name, not whatever happens to
3279 be the first function in the overload set. */
3281 && type_dependent_expression_p_push (expr
))
3284 write_expression (fn
);
3287 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3288 write_expression (CALL_EXPR_ARG (expr
, i
));
3293 write_type (TREE_TYPE (expr
));
3294 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3295 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3298 tree args
= TREE_OPERAND (expr
, 0);
3300 for (; args
; args
= TREE_CHAIN (args
))
3301 write_expression (TREE_VALUE (args
));
3306 case DYNAMIC_CAST_EXPR
:
3307 case REINTERPRET_CAST_EXPR
:
3308 case STATIC_CAST_EXPR
:
3309 case CONST_CAST_EXPR
:
3310 write_type (TREE_TYPE (expr
));
3311 write_expression (TREE_OPERAND (expr
, 0));
3314 case PREINCREMENT_EXPR
:
3315 case PREDECREMENT_EXPR
:
3316 if (abi_version_at_least (6))
3318 if (abi_warn_or_compat_version_crosses (6))
3319 G
.need_abi_warning
= 1;
3323 /* In the middle-end, some expressions have more operands than
3324 they do in templates (and mangling). */
3325 len
= cp_tree_operand_length (expr
);
3327 for (i
= 0; i
< len
; ++i
)
3329 tree operand
= TREE_OPERAND (expr
, i
);
3330 /* As a GNU extension, the middle operand of a
3331 conditional may be omitted. Since expression
3332 manglings are supposed to represent the input token
3333 stream, there's no good way to mangle such an
3334 expression without extending the C++ ABI. */
3335 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3337 error ("omitted middle operand to %<?:%> operand "
3338 "cannot be mangled");
3341 else if (FOLD_EXPR_P (expr
))
3343 /* The first 'operand' of a fold-expression is the operator
3344 that it folds over. */
3347 int fcode
= TREE_INT_CST_LOW (operand
);
3348 write_string (OVL_OP_INFO (false, fcode
)->mangled_name
);
3351 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3353 /* The order of operands of the binary left and right
3354 folds is the same, but we want to mangle them in
3355 lexical order, i.e. non-pack first. */
3357 operand
= FOLD_EXPR_INIT (expr
);
3359 operand
= FOLD_EXPR_PACK (expr
);
3361 if (PACK_EXPANSION_P (operand
))
3362 operand
= PACK_EXPANSION_PATTERN (operand
);
3364 write_expression (operand
);
3370 /* Literal subcase of non-terminal <template-arg>.
3372 "Literal arguments, e.g. "A<42L>", are encoded with their type
3373 and value. Negative integer values are preceded with "n"; for
3374 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3375 encoded as 0, true as 1." */
3378 write_template_arg_literal (const tree value
)
3380 if (TREE_CODE (value
) == STRING_CST
)
3381 /* Temporarily mangle strings as braced initializer lists. */
3382 write_string ("tl");
3386 tree valtype
= TREE_TYPE (value
);
3387 write_type (valtype
);
3389 /* Write a null member pointer value as (type)0, regardless of its
3390 real representation. */
3391 if (null_member_pointer_value_p (value
))
3392 write_integer_cst (integer_zero_node
);
3394 switch (TREE_CODE (value
))
3397 write_integer_cst (DECL_INITIAL (value
));
3401 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3402 || integer_zerop (value
) || integer_onep (value
));
3403 if (!(abi_version_at_least (14)
3404 && NULLPTR_TYPE_P (TREE_TYPE (value
))))
3405 write_integer_cst (value
);
3409 write_real_cst (value
);
3413 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3414 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3416 write_integer_cst (TREE_REALPART (value
));
3418 write_integer_cst (TREE_IMAGPART (value
));
3420 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3421 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3423 write_real_cst (TREE_REALPART (value
));
3425 write_real_cst (TREE_IMAGPART (value
));
3433 /* Mangle strings the same as braced initializer lists. */
3434 unsigned n
= TREE_STRING_LENGTH (value
);
3435 const char *str
= TREE_STRING_POINTER (value
);
3437 /* Count the number of trailing nuls and subtract them from
3438 STRSIZE because they don't need to be mangled. */
3439 for (const char *p
= str
+ n
- 1; ; --p
)
3443 n
-= str
+ n
- !!*p
- p
;
3447 tree eltype
= TREE_TYPE (valtype
);
3448 for (const char *p
= str
; n
--; ++p
)
3451 write_type (eltype
);
3452 write_unsigned_number (*(const unsigned char*)p
);
3465 /* Non-terminal <template-arg>.
3467 <template-arg> ::= <type> # type
3468 ::= L <type> </value/ number> E # literal
3469 ::= LZ <name> E # external name
3470 ::= X <expression> E # expression */
3473 write_template_arg (tree node
)
3475 enum tree_code code
= TREE_CODE (node
);
3477 MANGLE_TRACE_TREE ("template-arg", node
);
3479 /* A template template parameter's argument list contains TREE_LIST
3480 nodes of which the value field is the actual argument. */
3481 if (code
== TREE_LIST
)
3483 node
= TREE_VALUE (node
);
3484 /* If it's a decl, deal with its type instead. */
3487 node
= TREE_TYPE (node
);
3488 code
= TREE_CODE (node
);
3492 if (template_parm_object_p (node
))
3493 /* We want to mangle the argument, not the var we stored it in. */
3494 node
= DECL_INITIAL (node
);
3496 /* Strip a conversion added by convert_nontype_argument. */
3497 if (TREE_CODE (node
) == IMPLICIT_CONV_EXPR
)
3498 node
= TREE_OPERAND (node
, 0);
3499 if (REFERENCE_REF_P (node
))
3500 node
= TREE_OPERAND (node
, 0);
3501 if (TREE_CODE (node
) == NOP_EXPR
3502 && TYPE_REF_P (TREE_TYPE (node
)))
3504 /* Template parameters can be of reference type. To maintain
3505 internal consistency, such arguments use a conversion from
3506 address of object to reference type. */
3507 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3508 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3511 if (TREE_CODE (node
) == BASELINK
3512 && !type_unknown_p (node
))
3514 if (abi_version_at_least (6))
3515 node
= BASELINK_FUNCTIONS (node
);
3516 if (abi_warn_or_compat_version_crosses (6))
3517 /* We wrongly wrapped a class-scope function in X/E. */
3518 G
.need_abi_warning
= 1;
3521 if (ARGUMENT_PACK_P (node
))
3523 /* Expand the template argument pack. */
3524 tree args
= ARGUMENT_PACK_ARGS (node
);
3525 int i
, length
= TREE_VEC_LENGTH (args
);
3526 if (abi_version_at_least (6))
3530 if (abi_warn_or_compat_version_crosses (6))
3531 G
.need_abi_warning
= 1;
3532 for (i
= 0; i
< length
; ++i
)
3533 write_template_arg (TREE_VEC_ELT (args
, i
));
3536 else if (TYPE_P (node
))
3538 else if (code
== TEMPLATE_DECL
)
3539 /* A template appearing as a template arg is a template template arg. */
3540 write_template_template_arg (node
);
3541 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3542 || code
== CONST_DECL
3543 || null_member_pointer_value_p (node
))
3544 write_template_arg_literal (node
);
3545 else if (DECL_P (node
))
3548 /* Until ABI version 3, the underscore before the mangled name
3549 was incorrectly omitted. */
3550 if (!abi_version_at_least (3))
3553 write_string ("_Z");
3554 if (abi_warn_or_compat_version_crosses (3))
3555 G
.need_abi_warning
= 1;
3556 write_encoding (node
);
3561 /* Template arguments may be expressions. */
3563 write_expression (node
);
3568 /* <template-template-arg>
3570 ::= <substitution> */
3573 write_template_template_arg (const tree decl
)
3575 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3577 if (find_substitution (decl
))
3579 write_name (decl
, /*ignore_local_scope=*/0);
3580 add_substitution (decl
);
3584 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3586 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3587 ::= A <expression> _ </element/ type>
3589 "Array types encode the dimension (number of elements) and the
3590 element type. For variable length arrays, the dimension (but not
3591 the '_' separator) is omitted."
3592 Note that for flexible array members, like for other arrays of
3593 unspecified size, the dimension is also omitted. */
3596 write_array_type (const tree type
)
3599 if (TYPE_DOMAIN (type
))
3603 index_type
= TYPE_DOMAIN (type
);
3604 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3605 It's null for flexible array members which have no upper bound
3606 (this is a change from GCC 5 and prior where such members were
3607 incorrectly mangled as zero-length arrays). */
3608 if (tree max
= TYPE_MAX_VALUE (index_type
))
3610 if (TREE_CODE (max
) == INTEGER_CST
)
3612 /* The ABI specifies that we should mangle the number of
3613 elements in the array, not the largest allowed index. */
3614 offset_int wmax
= wi::to_offset (max
) + 1;
3615 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3616 number of elements as zero. */
3617 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3618 gcc_assert (wi::fits_uhwi_p (wmax
));
3619 write_unsigned_number (wmax
.to_uhwi ());
3623 max
= TREE_OPERAND (max
, 0);
3624 write_expression (max
);
3629 write_type (TREE_TYPE (type
));
3632 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3633 variables. TYPE is a pointer-to-member POINTER_TYPE.
3635 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3638 write_pointer_to_member_type (const tree type
)
3641 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3642 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3645 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3646 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3647 TEMPLATE_PARM_INDEX.
3649 <template-param> ::= T </parameter/ number> _ */
3652 write_template_param (const tree parm
)
3656 MANGLE_TRACE_TREE ("template-parm", parm
);
3658 switch (TREE_CODE (parm
))
3660 case TEMPLATE_TYPE_PARM
:
3661 case TEMPLATE_TEMPLATE_PARM
:
3662 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3663 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3666 case TEMPLATE_PARM_INDEX
:
3667 parm_index
= TEMPLATE_PARM_IDX (parm
);
3675 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3676 earliest template param denoted by `_'. */
3677 write_compact_number (parm_index
);
3680 /* <template-template-param>
3681 ::= <template-param>
3682 ::= <substitution> */
3685 write_template_template_param (const tree parm
)
3687 tree templ
= NULL_TREE
;
3689 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3690 template template parameter. The substitution candidate here is
3691 only the template. */
3692 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3695 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3696 if (find_substitution (templ
))
3700 /* <template-param> encodes only the template parameter position,
3701 not its template arguments, which is fine here. */
3702 write_template_param (parm
);
3704 add_substitution (templ
);
3707 /* Non-terminal <substitution>.
3709 <substitution> ::= S <seq-id> _
3713 write_substitution (const int seq_id
)
3715 MANGLE_TRACE ("substitution", "");
3719 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3723 /* Start mangling ENTITY. */
3726 start_mangling (const tree entity
)
3729 G
.need_abi_warning
= false;
3730 G
.need_cxx17_warning
= false;
3731 obstack_free (&name_obstack
, name_base
);
3732 mangle_obstack
= &name_obstack
;
3733 name_base
= obstack_alloc (&name_obstack
, 0);
3736 /* Done with mangling. If WARN is true, and the name of G.entity will
3737 be mangled differently in a future version of the ABI, issue a
3741 finish_mangling_internal (void)
3743 /* Clear all the substitutions. */
3744 vec_safe_truncate (G
.substitutions
, 0);
3746 /* Null-terminate the string. */
3751 /* Like finish_mangling_internal, but return the mangled string. */
3753 static inline const char *
3754 finish_mangling (void)
3756 finish_mangling_internal ();
3757 return (const char *) obstack_finish (mangle_obstack
);
3760 /* Like finish_mangling_internal, but return an identifier. */
3763 finish_mangling_get_identifier (void)
3765 finish_mangling_internal ();
3766 /* Don't obstack_finish here, and the next start_mangling will
3767 remove the identifier. */
3768 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3771 /* Initialize data structures for mangling. */
3776 gcc_obstack_init (&name_obstack
);
3777 name_base
= obstack_alloc (&name_obstack
, 0);
3778 vec_alloc (G
.substitutions
, 0);
3780 /* Cache these identifiers for quick comparison when checking for
3781 standard substitutions. */
3782 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3783 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3784 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3785 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3786 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3787 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3790 /* Generate the mangled name of DECL. */
3793 mangle_decl_string (const tree decl
)
3796 tree saved_fn
= NULL_TREE
;
3797 bool template_p
= false;
3799 /* We shouldn't be trying to mangle an uninstantiated template. */
3800 gcc_assert (!type_dependent_expression_p (decl
));
3802 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3804 struct tinst_level
*tl
= current_instantiation ();
3805 if ((!tl
|| tl
->maybe_get_node () != decl
)
3806 && push_tinst_level (decl
))
3809 saved_fn
= current_function_decl
;
3810 current_function_decl
= NULL_TREE
;
3813 iloc_sentinel
ils (DECL_SOURCE_LOCATION (decl
));
3815 start_mangling (decl
);
3817 if (TREE_CODE (decl
) == TYPE_DECL
)
3818 write_type (TREE_TYPE (decl
));
3820 write_mangled_name (decl
, true);
3822 result
= finish_mangling_get_identifier ();
3824 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3825 IDENTIFIER_POINTER (result
));
3830 current_function_decl
= saved_fn
;
3836 /* Return an identifier for the external mangled name of DECL. */
3839 get_mangled_id (tree decl
)
3841 tree id
= mangle_decl_string (decl
);
3842 return targetm
.mangle_decl_assembler_name (decl
, id
);
3845 /* Create an identifier for the external mangled name of DECL. */
3848 mangle_decl (const tree decl
)
3853 /* Don't bother mangling uninstantiated templates. */
3854 ++processing_template_decl
;
3855 if (TREE_CODE (decl
) == TYPE_DECL
)
3856 dep
= dependent_type_p (TREE_TYPE (decl
));
3858 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3859 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3860 --processing_template_decl
;
3864 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3865 It is not needed to assign names to anonymous namespace, but we use the
3866 "<anon>" marker to be able to tell if type is C++ ODR type or type
3867 produced by other language. */
3868 if (TREE_CODE (decl
) == TYPE_DECL
3869 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3870 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3871 id
= get_identifier ("<anon>");
3874 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3875 || !no_linkage_check (TREE_TYPE (decl
), true));
3876 if (abi_version_at_least (10))
3877 if (tree fn
= decl_function_context (decl
))
3878 maybe_check_abi_tags (fn
, decl
);
3879 id
= get_mangled_id (decl
);
3881 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3883 if (G
.need_cxx17_warning
3884 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
3885 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wnoexcept_type
,
3886 "mangled name for %qD will change in C++17 because the "
3887 "exception specification is part of a function type",
3890 if (id
!= DECL_NAME (decl
)
3891 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3892 && TREE_CODE (decl
) != TYPE_DECL
3893 && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl
))
3895 int save_ver
= flag_abi_version
;
3896 tree id2
= NULL_TREE
;
3898 if (!DECL_REALLY_EXTERN (decl
))
3900 record_mangling (decl
, G
.need_abi_warning
);
3902 if (!G
.need_abi_warning
)
3905 flag_abi_version
= flag_abi_compat_version
;
3906 id2
= mangle_decl_string (decl
);
3907 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3908 flag_abi_version
= save_ver
;
3911 note_mangling_alias (decl
, id2
);
3916 const char fabi_version
[] = "-fabi-version";
3918 if (flag_abi_compat_version
!= warn_abi_version
3919 || id2
== NULL_TREE
)
3921 flag_abi_version
= warn_abi_version
;
3922 id2
= mangle_decl_string (decl
);
3923 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3925 flag_abi_version
= save_ver
;
3929 else if (warn_abi_version
!= 0
3930 && abi_version_at_least (warn_abi_version
))
3931 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3932 "the mangled name of %qD changed between "
3933 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3934 G
.entity
, fabi_version
, warn_abi_version
, id2
,
3935 fabi_version
, save_ver
, id
);
3937 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3938 "the mangled name of %qD changes between "
3939 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3940 G
.entity
, fabi_version
, save_ver
, id
,
3941 fabi_version
, warn_abi_version
, id2
);
3944 flag_abi_version
= save_ver
;
3948 /* Generate the mangled representation of TYPE. */
3951 mangle_type_string (const tree type
)
3955 start_mangling (type
);
3957 result
= finish_mangling ();
3959 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3963 /* Create an identifier for the mangled name of a special component
3964 for belonging to TYPE. CODE is the ABI-specified code for this
3968 mangle_special_for_type (const tree type
, const char *code
)
3972 /* We don't have an actual decl here for the special component, so
3973 we can't just process the <encoded-name>. Instead, fake it. */
3974 start_mangling (type
);
3976 /* Start the mangling. */
3977 write_string ("_Z");
3978 write_string (code
);
3982 result
= finish_mangling_get_identifier ();
3985 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3986 IDENTIFIER_POINTER (result
));
3991 /* Create an identifier for the mangled representation of the typeinfo
3992 structure for TYPE. */
3995 mangle_typeinfo_for_type (const tree type
)
3997 return mangle_special_for_type (type
, "TI");
4000 /* Create an identifier for the mangled name of the NTBS containing
4001 the mangled name of TYPE. */
4004 mangle_typeinfo_string_for_type (const tree type
)
4006 return mangle_special_for_type (type
, "TS");
4009 /* Create an identifier for the mangled name of the vtable for TYPE. */
4012 mangle_vtbl_for_type (const tree type
)
4014 return mangle_special_for_type (type
, "TV");
4017 /* Returns an identifier for the mangled name of the VTT for TYPE. */
4020 mangle_vtt_for_type (const tree type
)
4022 return mangle_special_for_type (type
, "TT");
4025 /* Returns an identifier for the mangled name of the decomposition
4026 artificial variable DECL. DECLS is the vector of the VAR_DECLs
4027 for the identifier-list. */
4030 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
4032 gcc_assert (!type_dependent_expression_p (decl
));
4034 location_t saved_loc
= input_location
;
4035 input_location
= DECL_SOURCE_LOCATION (decl
);
4037 start_mangling (decl
);
4038 write_string ("_Z");
4040 tree context
= decl_mangling_context (decl
);
4041 gcc_assert (context
!= NULL_TREE
);
4043 bool nested
= false;
4044 if (DECL_NAMESPACE_STD_P (context
))
4045 write_string ("St");
4046 else if (context
!= global_namespace
)
4050 write_prefix (decl_mangling_context (decl
));
4053 write_string ("DC");
4056 FOR_EACH_VEC_ELT (decls
, i
, d
)
4057 write_unqualified_name (d
);
4063 tree id
= finish_mangling_get_identifier ();
4065 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4066 IDENTIFIER_POINTER (id
));
4068 input_location
= saved_loc
;
4072 /* Return an identifier for a construction vtable group. TYPE is
4073 the most derived class in the hierarchy; BINFO is the base
4074 subobject for which this construction vtable group will be used.
4076 This mangling isn't part of the ABI specification; in the ABI
4077 specification, the vtable group is dumped in the same COMDAT as the
4078 main vtable, and is referenced only from that vtable, so it doesn't
4079 need an external name. For binary formats without COMDAT sections,
4080 though, we need external names for the vtable groups.
4082 We use the production
4084 <special-name> ::= CT <type> <offset number> _ <base type> */
4087 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4091 start_mangling (type
);
4093 write_string ("_Z");
4094 write_string ("TC");
4096 write_integer_cst (BINFO_OFFSET (binfo
));
4098 write_type (BINFO_TYPE (binfo
));
4100 result
= finish_mangling_get_identifier ();
4102 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4103 IDENTIFIER_POINTER (result
));
4107 /* Mangle a this pointer or result pointer adjustment.
4109 <call-offset> ::= h <fixed offset number> _
4110 ::= v <fixed offset number> _ <virtual offset number> _ */
4113 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4115 write_char (virtual_offset
? 'v' : 'h');
4117 /* For either flavor, write the fixed offset. */
4118 write_integer_cst (fixed_offset
);
4121 /* For a virtual thunk, add the virtual offset. */
4124 write_integer_cst (virtual_offset
);
4129 /* Return an identifier for the mangled name of a this-adjusting or
4130 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4131 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4132 is a virtual thunk, and it is the vtbl offset in
4133 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4134 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4135 thunk itself. A covariant thunk name always includes the adjustment
4136 for the this pointer, even if there is none.
4138 <special-name> ::= T <call-offset> <base encoding>
4139 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4143 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4144 tree virtual_offset
, tree thunk
)
4148 if (abi_version_at_least (11))
4149 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4151 start_mangling (fn_decl
);
4153 write_string ("_Z");
4156 if (!this_adjusting
)
4158 /* Covariant thunk with no this adjustment */
4160 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4161 mangle_call_offset (fixed_offset
, virtual_offset
);
4163 else if (!DECL_THUNK_P (fn_decl
))
4164 /* Plain this adjusting thunk. */
4165 mangle_call_offset (fixed_offset
, virtual_offset
);
4168 /* This adjusting thunk to covariant thunk. */
4170 mangle_call_offset (fixed_offset
, virtual_offset
);
4171 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4172 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4174 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4175 mangle_call_offset (fixed_offset
, virtual_offset
);
4176 fn_decl
= THUNK_TARGET (fn_decl
);
4180 write_encoding (fn_decl
);
4182 result
= finish_mangling_get_identifier ();
4184 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4188 /* Handle ABI backwards compatibility for past bugs where we didn't call
4189 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4190 it makes a difference. If FOR_DECL is non-null, it's the declaration
4191 that we're actually trying to mangle; if it's null, we're mangling the
4192 guard variable for T. */
4195 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4197 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4200 tree oldtags
= get_abi_tags (t
);
4204 tree newtags
= get_abi_tags (t
);
4205 if (newtags
&& newtags
!= oldtags
4206 && abi_version_crosses (ver
))
4208 if (for_decl
&& DECL_THUNK_P (for_decl
))
4209 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4210 "the mangled name of a thunk for %qD changes between "
4211 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4212 t
, flag_abi_version
, warn_abi_version
);
4214 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4215 "the mangled name of %qD changes between "
4216 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4217 for_decl
, flag_abi_version
, warn_abi_version
);
4219 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4220 "the mangled name of the initialization guard variable "
4221 "for %qD changes between %<-fabi-version=%d%> and "
4222 "%<-fabi-version=%d%>",
4223 t
, flag_abi_version
, warn_abi_version
);
4227 /* Write out the appropriate string for this variable when generating
4228 another mangled name based on this one. */
4231 write_guarded_var_name (const tree variable
)
4233 if (DECL_NAME (variable
)
4234 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4235 /* The name of a guard variable for a reference temporary should refer
4236 to the reference, not the temporary. */
4237 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4239 write_name (variable
, /*ignore_local_scope=*/0);
4242 /* Return an identifier for the name of an initialization guard
4243 variable for indicated VARIABLE. */
4246 mangle_guard_variable (const tree variable
)
4248 if (abi_version_at_least (10))
4249 maybe_check_abi_tags (variable
);
4250 start_mangling (variable
);
4251 write_string ("_ZGV");
4252 write_guarded_var_name (variable
);
4253 return finish_mangling_get_identifier ();
4256 /* Return an identifier for the name of a thread_local initialization
4257 function for VARIABLE. */
4260 mangle_tls_init_fn (const tree variable
)
4262 check_abi_tags (variable
);
4263 start_mangling (variable
);
4264 write_string ("_ZTH");
4265 write_guarded_var_name (variable
);
4266 return finish_mangling_get_identifier ();
4269 /* Return an identifier for the name of a thread_local wrapper
4270 function for VARIABLE. */
4272 #define TLS_WRAPPER_PREFIX "_ZTW"
4275 mangle_tls_wrapper_fn (const tree variable
)
4277 check_abi_tags (variable
);
4278 start_mangling (variable
);
4279 write_string (TLS_WRAPPER_PREFIX
);
4280 write_guarded_var_name (variable
);
4281 return finish_mangling_get_identifier ();
4284 /* Return true iff FN is a thread_local wrapper function. */
4287 decl_tls_wrapper_p (const tree fn
)
4289 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4291 tree name
= DECL_NAME (fn
);
4292 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4293 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4296 /* Return an identifier for the name of a temporary variable used to
4297 initialize a static reference. This is now part of the ABI. */
4300 mangle_ref_init_variable (const tree variable
)
4302 start_mangling (variable
);
4303 write_string ("_ZGR");
4304 check_abi_tags (variable
);
4305 write_name (variable
, /*ignore_local_scope=*/0);
4306 /* Avoid name clashes with aggregate initialization of multiple
4307 references at once. */
4308 write_compact_number (current_ref_temp_count
++);
4309 return finish_mangling_get_identifier ();
4312 /* Return an identifier for the mangled name of a C++20 template parameter
4313 object for template argument EXPR. */
4316 mangle_template_parm_object (tree expr
)
4318 start_mangling (expr
);
4319 write_string ("_ZTAX");
4320 write_expression (expr
);
4322 return finish_mangling_get_identifier ();
4325 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4326 function generates a mangled name for the vtable map variable of
4327 the class type. For example, if the class type is
4328 "std::bad_exception", the mangled name for the class is
4329 "St13bad_exception". This function would generate the name
4330 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4331 "_VTV<std::bad_exception>::__vtable_map". */
4335 get_mangled_vtable_map_var_name (tree class_type
)
4337 char *var_name
= NULL
;
4338 const char *prefix
= "_ZN4_VTVI";
4339 const char *postfix
= "E12__vtable_mapE";
4341 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4343 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4345 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4347 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4348 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4351 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4353 strlen (postfix
) + 1;
4355 var_name
= (char *) xmalloc (len
);
4357 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4362 #include "gt-cp-mangle.h"