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. */
877 tcontext
= CP_DECL_CONTEXT (decl
);
879 /* Ignore the artificial declare reduction functions. */
881 && TREE_CODE (tcontext
) == FUNCTION_DECL
882 && DECL_OMP_DECLARE_REDUCTION_P (tcontext
))
883 return decl_mangling_context (tcontext
);
888 /* <name> ::= <unscoped-name>
889 ::= <unscoped-template-name> <template-args>
893 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
894 called from <local-name>, which mangles the enclosing scope
895 elsewhere and then uses this function to mangle just the part
896 underneath the function scope. So don't use the <local-name>
897 production, to avoid an infinite recursion. */
900 write_name (tree decl
, const int ignore_local_scope
)
904 MANGLE_TRACE_TREE ("name", decl
);
906 if (TREE_CODE (decl
) == TYPE_DECL
)
908 /* In case this is a typedef, fish out the corresponding
909 TYPE_DECL for the main variant. */
910 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
913 context
= decl_mangling_context (decl
);
915 gcc_assert (context
!= NULL_TREE
);
917 if (abi_warn_or_compat_version_crosses (7)
918 && ignore_local_scope
919 && TREE_CODE (context
) == PARM_DECL
)
920 G
.need_abi_warning
= 1;
922 /* A decl in :: or ::std scope is treated specially. The former is
923 mangled using <unscoped-name> or <unscoped-template-name>, the
924 latter with a special substitution. Also, a name that is
925 directly in a local function scope is also mangled with
926 <unscoped-name> rather than a full <nested-name>. */
927 if (context
== global_namespace
928 || DECL_NAMESPACE_STD_P (context
)
929 || (ignore_local_scope
930 && (TREE_CODE (context
) == FUNCTION_DECL
931 || (abi_version_at_least (7)
932 && TREE_CODE (context
) == PARM_DECL
))))
935 /* Is this a template instance? */
936 if (decl_is_template_id (decl
, &template_info
))
938 /* Yes: use <unscoped-template-name>. */
939 write_unscoped_template_name (TI_TEMPLATE (template_info
));
940 write_template_args (TI_ARGS (template_info
));
943 /* Everything else gets an <unqualified-name>. */
944 write_unscoped_name (decl
);
948 /* Handle local names, unless we asked not to (that is, invoked
949 under <local-name>, to handle only the part of the name under
951 if (!ignore_local_scope
)
953 /* Scan up the list of scope context, looking for a
954 function. If we find one, this entity is in local
955 function scope. local_entity tracks context one scope
956 level down, so it will contain the element that's
957 directly in that function's scope, either decl or one of
958 its enclosing scopes. */
959 tree local_entity
= decl
;
960 while (context
!= global_namespace
)
962 /* Make sure we're always dealing with decls. */
963 if (TYPE_P (context
))
964 context
= TYPE_NAME (context
);
965 /* Is this a function? */
966 if (TREE_CODE (context
) == FUNCTION_DECL
967 || TREE_CODE (context
) == PARM_DECL
)
969 /* Yes, we have local scope. Use the <local-name>
970 production for the innermost function scope. */
971 write_local_name (context
, local_entity
, decl
);
974 /* Up one scope level. */
975 local_entity
= context
;
976 context
= decl_mangling_context (context
);
979 /* No local scope found? Fall through to <nested-name>. */
982 /* Other decls get a <nested-name> to encode their scope. */
983 write_nested_name (decl
);
987 /* <unscoped-name> ::= <unqualified-name>
988 ::= St <unqualified-name> # ::std:: */
991 write_unscoped_name (const tree decl
)
993 tree context
= decl_mangling_context (decl
);
995 MANGLE_TRACE_TREE ("unscoped-name", decl
);
997 /* Is DECL in ::std? */
998 if (DECL_NAMESPACE_STD_P (context
))
1000 write_string ("St");
1001 write_unqualified_name (decl
);
1005 /* If not, it should be either in the global namespace, or directly
1006 in a local function scope. A lambda can also be mangled in the
1007 scope of a default argument. */
1008 gcc_assert (context
== global_namespace
1009 || TREE_CODE (context
) == PARM_DECL
1010 || TREE_CODE (context
) == FUNCTION_DECL
);
1012 write_unqualified_name (decl
);
1016 /* <unscoped-template-name> ::= <unscoped-name>
1017 ::= <substitution> */
1020 write_unscoped_template_name (const tree decl
)
1022 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
1024 if (find_substitution (decl
))
1026 write_unscoped_name (decl
);
1027 add_substitution (decl
);
1030 /* Write the nested name, including CV-qualifiers, of DECL.
1032 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1033 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1035 <ref-qualifier> ::= R # & ref-qualifier
1036 ::= O # && ref-qualifier
1037 <CV-qualifiers> ::= [r] [V] [K] */
1040 write_nested_name (const tree decl
)
1044 MANGLE_TRACE_TREE ("nested-name", decl
);
1048 /* Write CV-qualifiers, if this is a member function. */
1049 if (TREE_CODE (decl
) == FUNCTION_DECL
1050 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1052 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1054 if (DECL_CONST_MEMFUNC_P (decl
))
1056 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1058 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1065 /* Is this a template instance? */
1066 if (decl_is_template_id (decl
, &template_info
))
1068 /* Yes, use <template-prefix>. */
1069 write_template_prefix (decl
);
1070 write_template_args (TI_ARGS (template_info
));
1072 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1073 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1075 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1076 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1078 write_template_prefix (decl
);
1079 write_template_args (TREE_OPERAND (name
, 1));
1083 write_prefix (decl_mangling_context (decl
));
1084 write_unqualified_name (decl
);
1089 /* No, just use <prefix> */
1090 write_prefix (decl_mangling_context (decl
));
1091 write_unqualified_name (decl
);
1096 /* <prefix> ::= <prefix> <unqualified-name>
1097 ::= <template-param>
1098 ::= <template-prefix> <template-args>
1101 ::= <substitution> */
1104 write_prefix (const tree node
)
1107 /* Non-NULL if NODE represents a template-id. */
1108 tree template_info
= NULL
;
1111 || node
== global_namespace
)
1114 MANGLE_TRACE_TREE ("prefix", node
);
1116 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1122 if (find_substitution (node
))
1127 /* If this is a function or parm decl, that means we've hit function
1128 scope, so this prefix must be for a local name. In this
1129 case, we're under the <local-name> production, which encodes
1130 the enclosing function scope elsewhere. So don't continue
1132 if (TREE_CODE (node
) == FUNCTION_DECL
1133 || TREE_CODE (node
) == PARM_DECL
)
1137 decl_is_template_id (decl
, &template_info
);
1141 /* Node is a type. */
1142 decl
= TYPE_NAME (node
);
1143 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1144 template_info
= TYPE_TEMPLATE_INFO (node
);
1147 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1148 write_template_param (node
);
1149 else if (template_info
!= NULL
)
1152 write_template_prefix (decl
);
1153 write_template_args (TI_ARGS (template_info
));
1155 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1157 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1158 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1160 write_template_prefix (decl
);
1161 write_template_args (TREE_OPERAND (name
, 1));
1165 write_prefix (decl_mangling_context (decl
));
1166 write_unqualified_name (decl
);
1170 /* Not templated. */
1172 write_prefix (decl_mangling_context (decl
));
1173 write_unqualified_name (decl
);
1175 || TREE_CODE (decl
) == FIELD_DECL
)
1177 /* <data-member-prefix> := <member source-name> M */
1183 add_substitution (node
);
1186 /* <template-prefix> ::= <prefix> <template component>
1187 ::= <template-param>
1188 ::= <substitution> */
1191 write_template_prefix (const tree node
)
1193 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1194 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1195 tree context
= decl_mangling_context (decl
);
1200 MANGLE_TRACE_TREE ("template-prefix", node
);
1202 /* Find the template decl. */
1203 if (decl_is_template_id (decl
, &template_info
))
1204 templ
= TI_TEMPLATE (template_info
);
1205 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1206 /* For a typename type, all we have is the name. */
1207 templ
= DECL_NAME (decl
);
1210 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1212 templ
= TYPE_TI_TEMPLATE (type
);
1215 /* For a member template, though, the template name for the
1216 innermost name must have all the outer template levels
1217 instantiated. For instance, consider
1219 template<typename T> struct Outer {
1220 template<typename U> struct Inner {};
1223 The template name for `Inner' in `Outer<int>::Inner<float>' is
1224 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1225 levels separately, so there's no TEMPLATE_DECL available for this
1226 (there's only `Outer<T>::Inner<U>').
1228 In order to get the substitutions right, we create a special
1229 TREE_LIST to represent the substitution candidate for a nested
1230 template. The TREE_PURPOSE is the template's context, fully
1231 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1234 So, for the example above, `Outer<int>::Inner' is represented as a
1235 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1236 and whose value is `Outer<T>::Inner<U>'. */
1237 if (context
&& TYPE_P (context
))
1238 substitution
= build_tree_list (context
, templ
);
1240 substitution
= templ
;
1242 if (find_substitution (substitution
))
1245 if (TREE_TYPE (templ
)
1246 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1247 write_template_param (TREE_TYPE (templ
));
1250 write_prefix (context
);
1251 write_unqualified_name (decl
);
1254 add_substitution (substitution
);
1257 /* As the list of identifiers for the structured binding declaration
1258 DECL is likely gone, try to recover the DC <source-name>+ E portion
1259 from its mangled name. Return pointer to the DC and set len to
1260 the length up to and including the terminating E. On failure
1264 find_decomp_unqualified_name (tree decl
, size_t *len
)
1266 const char *p
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1267 const char *end
= p
+ IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
1268 bool nested
= false;
1269 if (strncmp (p
, "_Z", 2))
1272 if (!strncmp (p
, "St", 2))
1278 while (ISDIGIT (p
[0]))
1281 long num
= strtol (p
, &e
, 10);
1282 if (num
>= 1 && num
< end
- e
)
1288 if (strncmp (p
, "DC", 2))
1302 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1303 mangled through special entry points.
1305 <unqualified-name> ::= <operator-name>
1308 ::= <unnamed-type-name>
1309 ::= <local-source-name>
1311 <local-source-name> ::= L <source-name> <discriminator> */
1314 write_unqualified_id (tree identifier
)
1316 if (IDENTIFIER_CONV_OP_P (identifier
))
1317 write_conversion_operator_name (TREE_TYPE (identifier
));
1318 else if (IDENTIFIER_OVL_OP_P (identifier
))
1320 const ovl_op_info_t
*ovl_op
= IDENTIFIER_OVL_OP_INFO (identifier
);
1321 write_string (ovl_op
->mangled_name
);
1323 else if (UDLIT_OPER_P (identifier
))
1324 write_literal_operator_name (identifier
);
1326 write_source_name (identifier
);
1330 write_unqualified_name (tree decl
)
1332 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1334 if (identifier_p (decl
))
1336 write_unqualified_id (decl
);
1342 if (DECL_NAME (decl
) == NULL_TREE
)
1345 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1346 const char *decomp_str
= NULL
;
1347 size_t decomp_len
= 0;
1349 && DECL_DECOMPOSITION_P (decl
)
1350 && DECL_NAME (decl
) == NULL_TREE
1351 && DECL_NAMESPACE_SCOPE_P (decl
))
1352 decomp_str
= find_decomp_unqualified_name (decl
, &decomp_len
);
1354 write_chars (decomp_str
, decomp_len
);
1356 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1358 else if (DECL_DECLARES_FUNCTION_P (decl
))
1361 if (DECL_CONSTRUCTOR_P (decl
))
1362 write_special_name_constructor (decl
);
1363 else if (DECL_DESTRUCTOR_P (decl
))
1364 write_special_name_destructor (decl
);
1365 else if (DECL_CONV_FN_P (decl
))
1367 /* Conversion operator. Handle it right here.
1368 <operator> ::= cv <type> */
1370 if (decl_is_template_id (decl
, NULL
))
1373 fn_type
= get_mostly_instantiated_function_type (decl
);
1374 type
= TREE_TYPE (fn_type
);
1376 else if (FNDECL_USED_AUTO (decl
))
1377 type
= DECL_SAVED_AUTO_RETURN_TYPE (decl
);
1379 type
= DECL_CONV_FN_TYPE (decl
);
1380 write_conversion_operator_name (type
);
1382 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1384 const char *mangled_name
1385 = (ovl_op_info
[DECL_ASSIGNMENT_OPERATOR_P (decl
)]
1386 [DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
)].mangled_name
);
1387 write_string (mangled_name
);
1389 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1390 write_literal_operator_name (DECL_NAME (decl
));
1397 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1398 && DECL_NAMESPACE_SCOPE_P (decl
)
1399 && decl_linkage (decl
) == lk_internal
)
1401 MANGLE_TRACE_TREE ("local-source-name", decl
);
1403 write_source_name (DECL_NAME (decl
));
1404 /* The default discriminator is 1, and that's all we ever use,
1405 so there's no code to output one here. */
1409 tree type
= TREE_TYPE (decl
);
1411 if (TREE_CODE (decl
) == TYPE_DECL
1412 && TYPE_UNNAMED_P (type
))
1413 write_unnamed_type_name (type
);
1414 else if (TREE_CODE (decl
) == TYPE_DECL
1415 && LAMBDA_TYPE_P (type
))
1416 write_closure_type_name (type
);
1418 write_source_name (DECL_NAME (decl
));
1421 /* We use the ABI tags from the primary class template, ignoring tags on any
1422 specializations. This is necessary because C++ doesn't require a
1423 specialization to be declared before it is used unless the use requires a
1424 complete type, but we need to get the tags right on incomplete types as
1426 if (tree tmpl
= most_general_template (decl
))
1428 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1429 if (res
== NULL_TREE
)
1430 /* UNBOUND_CLASS_TEMPLATE. */;
1431 else if (DECL_DECLARES_TYPE_P (decl
))
1433 else if (any_abi_below (11))
1435 /* ABI v10 implicit tags on the template. */
1436 tree mtags
= missing_abi_tags (res
);
1437 /* Explicit tags on the template. */
1438 tree ttags
= get_abi_tags (res
);
1439 /* Tags on the instantiation. */
1440 tree dtags
= get_abi_tags (decl
);
1442 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1443 G
.need_abi_warning
= 1;
1445 /* Add the v10 tags to the explicit tags now. */
1446 mtags
= chainon (mtags
, ttags
);
1448 if (!G
.need_abi_warning
1449 && abi_warn_or_compat_version_crosses (11)
1450 && !equal_abi_tags (dtags
, mtags
))
1451 G
.need_abi_warning
= 1;
1453 if (!abi_version_at_least (10))
1454 /* In abi <10, we only got the explicit tags. */
1456 else if (flag_abi_version
== 10)
1458 /* In ABI 10, we want explict and implicit tags. */
1459 write_abi_tags (mtags
);
1465 tree tags
= get_abi_tags (decl
);
1466 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1467 && any_abi_below (11))
1468 if (tree mtags
= missing_abi_tags (decl
))
1470 if (abi_warn_or_compat_version_crosses (11))
1471 G
.need_abi_warning
= true;
1472 if (!abi_version_at_least (11))
1473 tags
= chainon (mtags
, tags
);
1475 write_abi_tags (tags
);
1478 /* Write the unqualified-name for a conversion operator to TYPE. */
1481 write_conversion_operator_name (const tree type
)
1483 write_string ("cv");
1487 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1489 <source-name> ::= </length/ number> <identifier> */
1492 write_source_name (tree identifier
)
1494 MANGLE_TRACE_TREE ("source-name", identifier
);
1496 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1497 write_identifier (IDENTIFIER_POINTER (identifier
));
1500 /* Compare two TREE_STRINGs like strcmp. */
1503 tree_string_cmp (const void *p1
, const void *p2
)
1507 tree s1
= *(const tree
*)p1
;
1508 tree s2
= *(const tree
*)p2
;
1509 return strcmp (TREE_STRING_POINTER (s1
),
1510 TREE_STRING_POINTER (s2
));
1513 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1515 static vec
<tree
, va_gc
> *
1516 sorted_abi_tags (tree tags
)
1518 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1520 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1522 if (ABI_TAG_IMPLICIT (t
))
1524 tree str
= TREE_VALUE (t
);
1525 vec_safe_push (vec
, str
);
1528 vec
->qsort (tree_string_cmp
);
1533 /* ID is the name of a function or type with abi_tags attribute TAGS.
1534 Write out the name, suitably decorated. */
1537 write_abi_tags (tree tags
)
1539 if (tags
== NULL_TREE
)
1542 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1544 unsigned i
; tree str
;
1545 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1548 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1549 write_identifier (TREE_STRING_POINTER (str
));
1552 release_tree_vector (vec
);
1555 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1558 equal_abi_tags (tree t1
, tree t2
)
1560 releasing_vec v1
= sorted_abi_tags (t1
);
1561 releasing_vec v2
= sorted_abi_tags (t2
);
1563 unsigned len1
= v1
->length();
1564 if (len1
!= v2
->length())
1566 for (unsigned i
= 0; i
< len1
; ++i
)
1567 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1572 /* Write a user-defined literal operator.
1573 ::= li <source-name> # "" <source-name>
1574 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1577 write_literal_operator_name (tree identifier
)
1579 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1580 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1581 write_unsigned_number (strlen (suffix
));
1582 write_identifier (suffix
);
1585 /* Encode 0 as _, and 1+ as n-1_. */
1588 write_compact_number (int num
)
1591 write_unsigned_number (num
- 1);
1595 /* Return how many unnamed types precede TYPE in its enclosing class. */
1598 nested_anon_class_index (tree type
)
1601 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1602 for (; member
; member
= DECL_CHAIN (member
))
1603 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1605 tree memtype
= TREE_TYPE (member
);
1606 if (memtype
== type
)
1608 else if (TYPE_UNNAMED_P (memtype
))
1618 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1621 write_unnamed_type_name (const tree type
)
1624 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1626 if (TYPE_FUNCTION_SCOPE_P (type
))
1627 discriminator
= discriminator_for_local_entity (TYPE_NAME (type
));
1628 else if (TYPE_CLASS_SCOPE_P (type
))
1629 discriminator
= nested_anon_class_index (type
);
1632 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1633 /* Just use the old mangling at namespace scope. */
1634 write_source_name (TYPE_IDENTIFIER (type
));
1638 write_string ("Ut");
1639 write_compact_number (discriminator
);
1642 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1643 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1646 write_closure_type_name (const tree type
)
1648 tree fn
= lambda_function (type
);
1649 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1650 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1652 MANGLE_TRACE_TREE ("closure-type-name", type
);
1654 write_string ("Ul");
1655 write_method_parms (parms
, /*method_p=*/1, fn
);
1657 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1660 /* Convert NUMBER to ascii using base BASE and generating at least
1661 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1662 into which to store the characters. Returns the number of
1663 characters generated (these will be laid out in advance of where
1667 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1668 char *buffer
, const unsigned int min_digits
)
1670 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1671 unsigned digits
= 0;
1675 unsigned HOST_WIDE_INT d
= number
/ base
;
1677 *--buffer
= base_digits
[number
- d
* base
];
1681 while (digits
< min_digits
)
1683 *--buffer
= base_digits
[0];
1689 /* Non-terminal <number>.
1691 <number> ::= [n] </decimal integer/> */
1694 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1695 const unsigned int base
)
1697 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1700 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1703 number
= -((HOST_WIDE_INT
) number
);
1705 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1706 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1709 /* Write out an integral CST in decimal. Most numbers are small, and
1710 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1711 bigger than that, which we must deal with. */
1714 write_integer_cst (const tree cst
)
1716 int sign
= tree_int_cst_sgn (cst
);
1717 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1718 if (!wi::fits_uhwi_p (abs_value
))
1720 /* A bignum. We do this in chunks, each of which fits in a
1722 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1723 unsigned HOST_WIDE_INT chunk
;
1724 unsigned chunk_digits
;
1725 char *ptr
= buffer
+ sizeof (buffer
);
1730 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1735 if (sizeof (HOST_WIDE_INT
) >= 8)
1737 /* It is at least 64 bits, so 10^18 is representable. */
1742 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1743 base
= build_int_cstu (type
, chunk
);
1744 n
= wide_int_to_tree (type
, wi::to_wide (cst
));
1749 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1753 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1754 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1757 done
= integer_zerop (d
);
1758 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1759 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1760 done
? 1 : chunk_digits
);
1766 write_chars (ptr
, count
);
1773 write_unsigned_number (abs_value
.to_uhwi ());
1777 /* Write out a floating-point literal.
1779 "Floating-point literals are encoded using the bit pattern of the
1780 target processor's internal representation of that number, as a
1781 fixed-length lowercase hexadecimal string, high-order bytes first
1782 (even if the target processor would store low-order bytes first).
1783 The "n" prefix is not used for floating-point literals; the sign
1784 bit is encoded with the rest of the number.
1786 Here are some examples, assuming the IEEE standard representation
1787 for floating point numbers. (Spaces are for readability, not
1788 part of the encoding.)
1791 -1.0f Lf bf80 0000 E
1792 1.17549435e-38f Lf 0080 0000 E
1793 1.40129846e-45f Lf 0000 0001 E
1794 0.0f Lf 0000 0000 E"
1796 Caller is responsible for the Lx and the E. */
1798 write_real_cst (const tree value
)
1800 long target_real
[4]; /* largest supported float */
1801 /* Buffer for eight hex digits in a 32-bit number but big enough
1802 even for 64-bit long to avoid warnings. */
1806 tree type
= TREE_TYPE (value
);
1807 int words
= GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type
)) / 32;
1809 real_to_target (target_real
, &TREE_REAL_CST (value
),
1812 /* The value in target_real is in the target word order,
1813 so we must write it out backward if that happens to be
1814 little-endian. write_number cannot be used, it will
1815 produce uppercase. */
1816 if (FLOAT_WORDS_BIG_ENDIAN
)
1817 i
= 0, limit
= words
, dir
= 1;
1819 i
= words
- 1, limit
= -1, dir
= -1;
1821 for (; i
!= limit
; i
+= dir
)
1823 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1824 write_chars (buffer
, 8);
1828 /* Non-terminal <identifier>.
1830 <identifier> ::= </unqualified source code identifier> */
1833 write_identifier (const char *identifier
)
1835 MANGLE_TRACE ("identifier", identifier
);
1836 write_string (identifier
);
1839 /* Handle constructor productions of non-terminal <special-name>.
1840 CTOR is a constructor FUNCTION_DECL.
1842 <special-name> ::= C1 # complete object constructor
1843 ::= C2 # base object constructor
1844 ::= C3 # complete object allocating constructor
1846 Currently, allocating constructors are never used. */
1849 write_special_name_constructor (const tree ctor
)
1852 bool new_inh
= (flag_new_inheriting_ctors
1853 && DECL_INHERITED_CTOR (ctor
));
1856 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1858 /* This is the old-style "[unified]" constructor.
1859 In some cases, we may emit this function and call
1860 it from the clones in order to share code and save space. */
1861 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1865 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1869 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1872 /* Handle destructor productions of non-terminal <special-name>.
1873 DTOR is a destructor FUNCTION_DECL.
1875 <special-name> ::= D0 # deleting (in-charge) destructor
1876 ::= D1 # complete object (in-charge) destructor
1877 ::= D2 # base object (not-in-charge) destructor */
1880 write_special_name_destructor (const tree dtor
)
1882 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1883 write_string ("D0");
1884 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1885 write_string ("D2");
1886 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1887 /* This is the old-style "[unified]" destructor.
1888 In some cases, we may emit this function and call
1889 it from the clones in order to share code and save space. */
1890 write_string ("D4");
1893 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1894 write_string ("D1");
1898 /* Return the discriminator for ENTITY appearing inside
1899 FUNCTION. The discriminator is the lexical ordinal of VAR or TYPE among
1900 entities with the same name and kind in the same FUNCTION. */
1903 discriminator_for_local_entity (tree entity
)
1905 if (!DECL_LANG_SPECIFIC (entity
))
1907 /* Some decls, like __FUNCTION__, don't need a discriminator. */
1908 gcc_checking_assert (DECL_ARTIFICIAL (entity
));
1911 else if (tree disc
= DECL_DISCRIMINATOR (entity
))
1912 return TREE_INT_CST_LOW (disc
);
1914 /* The first entity with a particular name doesn't get
1915 DECL_DISCRIMINATOR set up. */
1919 /* Return the discriminator for STRING, a string literal used inside
1920 FUNCTION. The discriminator is the lexical ordinal of STRING among
1921 string literals used in FUNCTION. */
1924 discriminator_for_string_literal (tree
/*function*/,
1927 /* For now, we don't discriminate amongst string literals. */
1931 /* <discriminator> := _ <number> # when number < 10
1932 := __ <number> _ # when number >= 10
1934 The discriminator is used only for the second and later occurrences
1935 of the same name within a single function. In this case <number> is
1936 n - 2, if this is the nth occurrence, in lexical order. */
1939 write_discriminator (const int discriminator
)
1941 /* If discriminator is zero, don't write anything. Otherwise... */
1942 if (discriminator
> 0)
1945 if (discriminator
- 1 >= 10)
1947 if (abi_warn_or_compat_version_crosses (11))
1948 G
.need_abi_warning
= 1;
1949 if (abi_version_at_least (11))
1952 write_unsigned_number (discriminator
- 1);
1953 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
1958 /* Mangle the name of a function-scope entity. FUNCTION is the
1959 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1960 default argument scope. ENTITY is the decl for the entity itself.
1961 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1962 either ENTITY itself or an enclosing scope of ENTITY.
1964 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1965 := Z <function encoding> E s [<discriminator>]
1966 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1969 write_local_name (tree function
, const tree local_entity
,
1972 tree parm
= NULL_TREE
;
1974 MANGLE_TRACE_TREE ("local-name", entity
);
1976 if (TREE_CODE (function
) == PARM_DECL
)
1979 function
= DECL_CONTEXT (parm
);
1983 write_encoding (function
);
1986 /* For this purpose, parameters are numbered from right-to-left. */
1991 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1999 write_compact_number (i
- 1);
2002 if (TREE_CODE (entity
) == STRING_CST
)
2005 write_discriminator (discriminator_for_string_literal (function
,
2010 /* Now the <entity name>. Let write_name know its being called
2011 from <local-name>, so it doesn't try to process the enclosing
2012 function scope again. */
2013 write_name (entity
, /*ignore_local_scope=*/1);
2014 if (DECL_DISCRIMINATOR_P (local_entity
)
2015 && !(TREE_CODE (local_entity
) == TYPE_DECL
2016 && TYPE_ANON_P (TREE_TYPE (local_entity
))))
2017 write_discriminator (discriminator_for_local_entity (local_entity
));
2021 /* Non-terminals <type> and <CV-qualifier>.
2023 <type> ::= <builtin-type>
2025 ::= <class-enum-type>
2027 ::= <pointer-to-member-type>
2028 ::= <template-param>
2031 ::= P <type> # pointer-to
2032 ::= R <type> # reference-to
2033 ::= C <type> # complex pair (C 2000)
2034 ::= G <type> # imaginary (C 2000) [not supported]
2035 ::= U <source-name> <type> # vendor extended type qualifier
2039 <type> ::= RR <type> # rvalue reference-to
2040 <type> ::= Dt <expression> # decltype of an id-expression or
2041 # class member access
2042 <type> ::= DT <expression> # decltype of an expression
2043 <type> ::= Dn # decltype of nullptr
2045 TYPE is a type node. */
2048 write_type (tree type
)
2050 /* This gets set to nonzero if TYPE turns out to be a (possibly
2051 CV-qualified) builtin type. */
2052 int is_builtin_type
= 0;
2054 MANGLE_TRACE_TREE ("type", type
);
2056 if (type
== error_mark_node
)
2059 type
= canonicalize_for_substitution (type
);
2060 if (find_substitution (type
))
2064 if (write_CV_qualifiers_for_type (type
) > 0)
2065 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2066 mangle the unqualified type. The recursive call is needed here
2067 since both the qualified and unqualified types are substitution
2070 tree t
= TYPE_MAIN_VARIANT (type
);
2071 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2073 tree attrs
= NULL_TREE
;
2074 if (tx_safe_fn_type_p (type
))
2075 attrs
= tree_cons (get_identifier ("transaction_safe"),
2077 t
= cp_build_type_attribute_variant (t
, attrs
);
2079 gcc_assert (t
!= type
);
2080 if (FUNC_OR_METHOD_TYPE_P (t
))
2082 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2083 if (flag_noexcept_type
)
2085 tree r
= TYPE_RAISES_EXCEPTIONS (type
);
2086 t
= build_exception_variant (t
, r
);
2088 if (abi_version_at_least (8)
2089 || type
== TYPE_MAIN_VARIANT (type
))
2090 /* Avoid adding the unqualified function type as a substitution. */
2091 write_function_type (t
);
2094 if (abi_warn_or_compat_version_crosses (8))
2095 G
.need_abi_warning
= 1;
2100 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2101 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2102 so that the cv-qualification of the element type is available
2103 in write_array_type. */
2104 write_array_type (type
);
2107 tree type_orig
= type
;
2109 /* See through any typedefs. */
2110 type
= TYPE_MAIN_VARIANT (type
);
2111 if (FUNC_OR_METHOD_TYPE_P (type
))
2112 type
= cxx_copy_lang_qualifiers (type
, type_orig
);
2114 /* According to the C++ ABI, some library classes are passed the
2115 same as the scalar type of their single member and use the same
2117 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2118 type
= TREE_TYPE (first_field (type
));
2120 if (TYPE_PTRDATAMEM_P (type
))
2121 write_pointer_to_member_type (type
);
2124 /* Handle any target-specific fundamental types. */
2125 const char *target_mangling
2126 = targetm
.mangle_type (type_orig
);
2128 if (target_mangling
)
2130 write_string (target_mangling
);
2131 /* Add substitutions for types other than fundamental
2133 if (!VOID_TYPE_P (type
)
2134 && TREE_CODE (type
) != INTEGER_TYPE
2135 && TREE_CODE (type
) != REAL_TYPE
2136 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2137 add_substitution (type
);
2141 switch (TREE_CODE (type
))
2145 case INTEGER_TYPE
: /* Includes wchar_t. */
2147 case FIXED_POINT_TYPE
:
2149 /* If this is a typedef, TYPE may not be one of
2150 the standard builtin type nodes, but an alias of one. Use
2151 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2152 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2159 write_type (TREE_TYPE (type
));
2164 write_function_type (type
);
2170 /* A pointer-to-member function is represented as a special
2171 RECORD_TYPE, so check for this first. */
2172 if (TYPE_PTRMEMFUNC_P (type
))
2173 write_pointer_to_member_type (type
);
2175 write_class_enum_type (type
);
2179 case UNBOUND_CLASS_TEMPLATE
:
2180 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2181 ordinary nested names. */
2182 write_nested_name (TYPE_STUB_DECL (type
));
2186 case REFERENCE_TYPE
:
2187 if (TYPE_PTR_P (type
))
2189 else if (TYPE_REF_IS_RVALUE (type
))
2194 tree target
= TREE_TYPE (type
);
2195 /* Attribute const/noreturn are not reflected in mangling.
2196 We strip them here rather than at a lower level because
2197 a typedef or template argument can have function type
2198 with function-cv-quals (that use the same representation),
2199 but you can't have a pointer/reference to such a type. */
2200 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2202 if (abi_warn_or_compat_version_crosses (5)
2203 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2204 G
.need_abi_warning
= 1;
2205 if (abi_version_at_least (5))
2206 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2208 write_type (target
);
2212 case TEMPLATE_TYPE_PARM
:
2215 if (AUTO_IS_DECLTYPE (type
))
2216 write_identifier ("Dc");
2218 write_identifier ("Da");
2223 case TEMPLATE_PARM_INDEX
:
2224 write_template_param (type
);
2227 case TEMPLATE_TEMPLATE_PARM
:
2228 write_template_template_param (type
);
2231 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2232 write_template_template_param (type
);
2234 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2238 if (abi_version_at_least (4))
2240 write_string ("Dv");
2241 /* Non-constant vector size would be encoded with
2242 _ expression, but we don't support that yet. */
2243 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
)
2248 write_string ("U8__vector");
2249 if (abi_warn_or_compat_version_crosses (4))
2250 G
.need_abi_warning
= 1;
2251 write_type (TREE_TYPE (type
));
2254 case TYPE_PACK_EXPANSION
:
2255 write_string ("Dp");
2256 write_type (PACK_EXPANSION_PATTERN (type
));
2260 /* These shouldn't make it into mangling. */
2261 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2262 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2264 /* In ABI <5, we stripped decltype of a plain decl. */
2265 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2267 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2268 tree etype
= NULL_TREE
;
2269 switch (TREE_CODE (expr
))
2276 case TEMPLATE_PARM_INDEX
:
2277 etype
= TREE_TYPE (expr
);
2284 if (etype
&& !type_uses_auto (etype
))
2286 if (abi_warn_or_compat_version_crosses (5))
2287 G
.need_abi_warning
= 1;
2288 if (!abi_version_at_least (5))
2297 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2301 ++cp_unevaluated_operand
;
2302 write_expression (DECLTYPE_TYPE_EXPR (type
));
2303 --cp_unevaluated_operand
;
2308 write_string ("Dn");
2309 if (abi_version_at_least (7))
2311 if (abi_warn_or_compat_version_crosses (7))
2312 G
.need_abi_warning
= 1;
2316 sorry ("mangling %<typeof%>, use %<decltype%> instead");
2319 case UNDERLYING_TYPE
:
2320 sorry ("mangling %<__underlying_type%>");
2332 /* Types other than builtin types are substitution candidates. */
2333 if (!is_builtin_type
)
2334 add_substitution (type
);
2337 /* qsort callback for sorting a vector of attribute entries. */
2340 attr_strcmp (const void *p1
, const void *p2
)
2342 tree a1
= *(const tree
*)p1
;
2343 tree a2
= *(const tree
*)p2
;
2345 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2346 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2348 return strcmp (as1
->name
, as2
->name
);
2351 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2352 CV-qualifiers written for TYPE.
2354 <CV-qualifiers> ::= [r] [V] [K] */
2357 write_CV_qualifiers_for_type (const tree type
)
2359 int num_qualifiers
= 0;
2361 /* The order is specified by:
2363 "In cases where multiple order-insensitive qualifiers are
2364 present, they should be ordered 'K' (closest to the base type),
2365 'V', 'r', and 'U' (farthest from the base type) ..." */
2367 /* Mangle attributes that affect type identity as extended qualifiers.
2369 We don't do this with classes and enums because their attributes
2370 are part of their definitions, not something added on. */
2372 if (!OVERLOAD_TYPE_P (type
))
2375 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2377 tree name
= get_attribute_name (a
);
2378 const attribute_spec
*as
= lookup_attribute_spec (name
);
2379 if (as
&& as
->affects_type_identity
2380 /* Skip internal-only attributes, which are distinguished from
2381 others by having a space. At present, all internal-only
2382 attributes that affect type identity are target-specific
2383 and are handled by targetm.mangle_type instead. */
2384 && !strchr (IDENTIFIER_POINTER (name
), ' ')
2385 && !is_attribute_p ("transaction_safe", name
)
2386 && !is_attribute_p ("abi_tag", name
))
2389 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2390 G
.need_abi_warning
= true;
2391 if (abi_version_at_least (10))
2393 vec
.qsort (attr_strcmp
);
2394 while (!vec
.is_empty())
2397 const attribute_spec
*as
2398 = lookup_attribute_spec (get_attribute_name (a
));
2401 write_unsigned_number (strlen (as
->name
));
2402 write_string (as
->name
);
2406 for (tree args
= TREE_VALUE (a
); args
;
2407 args
= TREE_CHAIN (args
))
2409 tree arg
= TREE_VALUE (args
);
2410 write_template_arg (arg
);
2420 /* Note that we do not use cp_type_quals below; given "const
2421 int[3]", the "const" is emitted with the "int", not with the
2423 cp_cv_quals quals
= TYPE_QUALS (type
);
2425 if (quals
& TYPE_QUAL_RESTRICT
)
2430 if (quals
& TYPE_QUAL_VOLATILE
)
2435 if (quals
& TYPE_QUAL_CONST
)
2441 return num_qualifiers
;
2444 /* Non-terminal <builtin-type>.
2446 <builtin-type> ::= v # void
2451 ::= h # unsigned char
2453 ::= t # unsigned short
2455 ::= j # unsigned int
2457 ::= m # unsigned long
2458 ::= x # long long, __int64
2459 ::= y # unsigned long long, __int64
2461 ::= o # unsigned __int128
2464 ::= e # long double, __float80
2465 ::= g # __float128 [not supported]
2466 ::= u <source-name> # vendor extended type */
2469 write_builtin_type (tree type
)
2471 if (TYPE_CANONICAL (type
))
2472 type
= TYPE_CANONICAL (type
);
2474 switch (TREE_CODE (type
))
2485 /* TYPE may still be wchar_t, char8_t, char16_t, or char32_t, since that
2486 isn't in integer_type_nodes. */
2487 if (type
== wchar_type_node
)
2489 else if (type
== char8_type_node
)
2490 write_string ("Du");
2491 else if (type
== char16_type_node
)
2492 write_string ("Ds");
2493 else if (type
== char32_type_node
)
2494 write_string ("Di");
2498 /* Assume TYPE is one of the shared integer type nodes. Find
2499 it in the array of these nodes. */
2501 for (itk
= 0; itk
< itk_none
; ++itk
)
2502 if (integer_types
[itk
] != NULL_TREE
2503 && integer_type_codes
[itk
] != '\0'
2504 && type
== integer_types
[itk
])
2506 /* Print the corresponding single-letter code. */
2507 write_char (integer_type_codes
[itk
]);
2511 if (itk
== itk_none
)
2513 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2514 TYPE_UNSIGNED (type
));
2521 if (TYPE_PRECISION (type
) == 128)
2522 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2525 /* Allow for cases where TYPE is not one of the shared
2526 integer type nodes and write a "vendor extended builtin
2527 type" with a name the form intN or uintN, respectively.
2528 Situations like this can happen if you have an
2529 __attribute__((__mode__(__SI__))) type and use exotic
2530 switches like '-mint8' on AVR. Of course, this is
2531 undefined by the C++ ABI (and '-mint8' is not even
2532 Standard C conforming), but when using such special
2533 options you're pretty much in nowhere land anyway. */
2535 char prec
[11]; /* up to ten digits for an unsigned */
2537 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2538 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2539 write_char ('u'); /* "vendor extended builtin type" */
2540 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2541 write_string (prefix
);
2542 write_string (prec
);
2549 if (type
== float_type_node
)
2551 else if (type
== double_type_node
)
2553 else if (type
== long_double_type_node
)
2555 else if (type
== dfloat32_type_node
)
2556 write_string ("Df");
2557 else if (type
== dfloat64_type_node
)
2558 write_string ("Dd");
2559 else if (type
== dfloat128_type_node
)
2560 write_string ("De");
2565 case FIXED_POINT_TYPE
:
2566 write_string ("DF");
2567 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2568 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2569 if (type
== fract_type_node
2570 || type
== sat_fract_type_node
2571 || type
== accum_type_node
2572 || type
== sat_accum_type_node
)
2574 else if (type
== unsigned_fract_type_node
2575 || type
== sat_unsigned_fract_type_node
2576 || type
== unsigned_accum_type_node
2577 || type
== sat_unsigned_accum_type_node
)
2579 else if (type
== short_fract_type_node
2580 || type
== sat_short_fract_type_node
2581 || type
== short_accum_type_node
2582 || type
== sat_short_accum_type_node
)
2584 else if (type
== unsigned_short_fract_type_node
2585 || type
== sat_unsigned_short_fract_type_node
2586 || type
== unsigned_short_accum_type_node
2587 || type
== sat_unsigned_short_accum_type_node
)
2589 else if (type
== long_fract_type_node
2590 || type
== sat_long_fract_type_node
2591 || type
== long_accum_type_node
2592 || type
== sat_long_accum_type_node
)
2594 else if (type
== unsigned_long_fract_type_node
2595 || type
== sat_unsigned_long_fract_type_node
2596 || type
== unsigned_long_accum_type_node
2597 || type
== sat_unsigned_long_accum_type_node
)
2599 else if (type
== long_long_fract_type_node
2600 || type
== sat_long_long_fract_type_node
2601 || type
== long_long_accum_type_node
2602 || type
== sat_long_long_accum_type_node
)
2604 else if (type
== unsigned_long_long_fract_type_node
2605 || type
== sat_unsigned_long_long_fract_type_node
2606 || type
== unsigned_long_long_accum_type_node
2607 || type
== sat_unsigned_long_long_accum_type_node
)
2610 sorry ("mangling unknown fixed point type");
2611 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2612 if (TYPE_SATURATING (type
))
2623 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2624 METHOD_TYPE. The return type is mangled before the parameter
2627 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2630 write_function_type (const tree type
)
2632 MANGLE_TRACE_TREE ("function-type", type
);
2634 /* For a pointer to member function, the function type may have
2635 cv-qualifiers, indicating the quals for the artificial 'this'
2637 if (TREE_CODE (type
) == METHOD_TYPE
)
2639 /* The first parameter must be a POINTER_TYPE pointing to the
2640 `this' parameter. */
2641 tree this_type
= class_of_this_parm (type
);
2642 write_CV_qualifiers_for_type (this_type
);
2645 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2647 if (tx_safe_fn_type_p (type
))
2648 write_string ("Dx");
2651 /* We don't track whether or not a type is `extern "C"'. Note that
2652 you can have an `extern "C"' function that does not have
2653 `extern "C"' type, and vice versa:
2655 extern "C" typedef void function_t();
2656 function_t f; // f has C++ linkage, but its type is
2659 typedef void function_t();
2660 extern "C" function_t f; // Vice versa.
2663 write_bare_function_type (type
, /*include_return_type_p=*/1,
2665 if (FUNCTION_REF_QUALIFIED (type
))
2667 if (FUNCTION_RVALUE_QUALIFIED (type
))
2675 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2676 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2677 is mangled before the parameter types. If non-NULL, DECL is
2678 FUNCTION_DECL for the function whose type is being emitted. */
2681 write_bare_function_type (const tree type
, const int include_return_type_p
,
2684 MANGLE_TRACE_TREE ("bare-function-type", type
);
2686 /* Mangle the return type, if requested. */
2687 if (include_return_type_p
)
2688 write_type (TREE_TYPE (type
));
2690 /* Now mangle the types of the arguments. */
2692 write_method_parms (TYPE_ARG_TYPES (type
),
2693 TREE_CODE (type
) == METHOD_TYPE
,
2698 /* Write the mangled representation of a method parameter list of
2699 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2700 considered a non-static method, and the this parameter is omitted.
2701 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2702 parameters are being emitted. */
2705 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2707 tree first_parm_type
;
2708 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2710 /* Assume this parameter type list is variable-length. If it ends
2711 with a void type, then it's not. */
2714 /* If this is a member function, skip the first arg, which is the
2716 "Member functions do not encode the type of their implicit this
2719 Similarly, there's no need to mangle artificial parameters, like
2720 the VTT parameters for constructors and destructors. */
2723 parm_types
= TREE_CHAIN (parm_types
);
2724 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2726 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2728 parm_types
= TREE_CHAIN (parm_types
);
2729 parm_decl
= DECL_CHAIN (parm_decl
);
2732 if (decl
&& ctor_omit_inherited_parms (decl
))
2733 /* Bring back parameters omitted from an inherited ctor. */
2734 parm_types
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl
));
2737 for (first_parm_type
= parm_types
;
2739 parm_types
= TREE_CHAIN (parm_types
))
2741 tree parm
= TREE_VALUE (parm_types
);
2742 if (parm
== void_type_node
)
2744 /* "Empty parameter lists, whether declared as () or
2745 conventionally as (void), are encoded with a void parameter
2747 if (parm_types
== first_parm_type
)
2749 /* If the parm list is terminated with a void type, it's
2752 /* A void type better be the last one. */
2753 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2760 /* <builtin-type> ::= z # ellipsis */
2764 /* <class-enum-type> ::= <name> */
2767 write_class_enum_type (const tree type
)
2769 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2772 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2775 <template-args> ::= I <template-arg>* E */
2778 write_template_args (tree args
)
2783 MANGLE_TRACE_TREE ("template-args", args
);
2788 length
= TREE_VEC_LENGTH (args
);
2790 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2792 /* We have nested template args. We want the innermost template
2794 args
= TREE_VEC_ELT (args
, length
- 1);
2795 length
= TREE_VEC_LENGTH (args
);
2797 for (i
= 0; i
< length
; ++i
)
2798 write_template_arg (TREE_VEC_ELT (args
, i
));
2805 <unqualified-name> <template-args>
2806 part of SCOPE_REF or COMPONENT_REF mangling. */
2809 write_member_name (tree member
)
2811 if (identifier_p (member
))
2813 if (abi_version_at_least (11) && IDENTIFIER_ANY_OP_P (member
))
2815 write_string ("on");
2816 if (abi_warn_or_compat_version_crosses (11))
2817 G
.need_abi_warning
= 1;
2819 write_unqualified_id (member
);
2821 else if (DECL_P (member
))
2822 write_unqualified_name (member
);
2823 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2825 tree name
= TREE_OPERAND (member
, 0);
2826 name
= OVL_FIRST (name
);
2827 write_member_name (name
);
2828 write_template_args (TREE_OPERAND (member
, 1));
2831 write_expression (member
);
2834 /* <expression> ::= <unary operator-name> <expression>
2835 ::= <binary operator-name> <expression> <expression>
2838 <expr-primary> ::= <template-param>
2839 ::= L <type> <value number> E # literal
2840 ::= L <mangled-name> E # external name
2841 ::= st <type> # sizeof
2842 ::= sr <type> <unqualified-name> # dependent name
2843 ::= sr <type> <unqualified-name> <template-args> */
2846 write_expression (tree expr
)
2848 enum tree_code code
= TREE_CODE (expr
);
2850 if (TREE_CODE (expr
) == TARGET_EXPR
)
2852 expr
= TARGET_EXPR_INITIAL (expr
);
2853 code
= TREE_CODE (expr
);
2856 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2857 argument is converted (via qualification conversions) to another type. */
2858 while (CONVERT_EXPR_CODE_P (code
)
2859 || location_wrapper_p (expr
)
2860 /* Parentheses aren't mangled. */
2861 || code
== PAREN_EXPR
2862 || code
== NON_LVALUE_EXPR
2863 || (code
== VIEW_CONVERT_EXPR
2864 && TREE_CODE (TREE_OPERAND (expr
, 0)) == TEMPLATE_PARM_INDEX
))
2866 expr
= TREE_OPERAND (expr
, 0);
2867 code
= TREE_CODE (expr
);
2870 if (code
== BASELINK
2871 && (!type_unknown_p (expr
)
2872 || !BASELINK_QUALIFIED_P (expr
)))
2874 expr
= BASELINK_FUNCTIONS (expr
);
2875 code
= TREE_CODE (expr
);
2878 /* Handle pointers-to-members by making them look like expression
2880 if (code
== PTRMEM_CST
)
2882 expr
= build_nt (ADDR_EXPR
,
2883 build_qualified_name (/*type=*/NULL_TREE
,
2884 PTRMEM_CST_CLASS (expr
),
2885 PTRMEM_CST_MEMBER (expr
),
2886 /*template_p=*/false));
2887 code
= TREE_CODE (expr
);
2890 /* Handle template parameters. */
2891 if (code
== TEMPLATE_TYPE_PARM
2892 || code
== TEMPLATE_TEMPLATE_PARM
2893 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2894 || code
== TEMPLATE_PARM_INDEX
)
2895 write_template_param (expr
);
2896 /* Handle literals. */
2897 else if (TREE_CODE_CLASS (code
) == tcc_constant
2898 || code
== CONST_DECL
)
2899 write_template_arg_literal (expr
);
2900 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2902 gcc_assert (id_equal (DECL_NAME (expr
), "this"));
2903 write_string ("fpT");
2905 else if (code
== PARM_DECL
)
2907 /* A function parameter used in a late-specified return type. */
2908 int index
= DECL_PARM_INDEX (expr
);
2909 int level
= DECL_PARM_LEVEL (expr
);
2910 int delta
= G
.parm_depth
- level
+ 1;
2911 gcc_assert (index
>= 1);
2915 if (abi_version_at_least (5))
2917 /* Let L be the number of function prototype scopes from the
2918 innermost one (in which the parameter reference occurs) up
2919 to (and including) the one containing the declaration of
2920 the referenced parameter. If the parameter declaration
2921 clause of the innermost function prototype scope has been
2922 completely seen, it is not counted (in that case -- which
2923 is perhaps the most common -- L can be zero). */
2925 write_unsigned_number (delta
- 1);
2927 if (abi_warn_or_compat_version_crosses (5))
2928 G
.need_abi_warning
= true;
2931 write_compact_number (index
- 1);
2933 else if (DECL_P (expr
))
2936 write_mangled_name (expr
, false);
2939 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2941 tree op
= TREE_OPERAND (expr
, 0);
2943 if (PACK_EXPANSION_P (op
))
2945 if (abi_warn_or_compat_version_crosses (11))
2946 G
.need_abi_warning
= true;
2947 if (abi_version_at_least (11))
2949 /* sZ rather than szDp. */
2950 write_string ("sZ");
2951 write_expression (PACK_EXPANSION_PATTERN (op
));
2956 if (SIZEOF_EXPR_TYPE_P (expr
))
2958 write_string ("st");
2959 write_type (TREE_TYPE (op
));
2961 else if (ARGUMENT_PACK_P (op
))
2963 tree args
= ARGUMENT_PACK_ARGS (op
);
2964 int length
= TREE_VEC_LENGTH (args
);
2965 if (abi_warn_or_compat_version_crosses (10))
2966 G
.need_abi_warning
= true;
2967 if (abi_version_at_least (10))
2969 /* sP <template-arg>* E # sizeof...(T), size of a captured
2970 template parameter pack from an alias template */
2971 write_string ("sP");
2972 for (int i
= 0; i
< length
; ++i
)
2973 write_template_arg (TREE_VEC_ELT (args
, i
));
2978 /* In GCC 5 we represented this sizeof wrong, with the effect
2979 that we mangled it as the last element of the pack. */
2980 tree arg
= TREE_VEC_ELT (args
, length
-1);
2983 write_string ("st");
2988 write_string ("sz");
2989 write_expression (arg
);
2993 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2995 write_string ("st");
2996 write_type (TREE_OPERAND (expr
, 0));
3001 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
3002 && TYPE_P (TREE_OPERAND (expr
, 0)))
3004 write_string ("at");
3005 write_type (TREE_OPERAND (expr
, 0));
3007 else if (code
== SCOPE_REF
3008 || code
== BASELINK
)
3011 if (code
== SCOPE_REF
)
3013 scope
= TREE_OPERAND (expr
, 0);
3014 member
= TREE_OPERAND (expr
, 1);
3015 if (BASELINK_P (member
))
3016 member
= BASELINK_FUNCTIONS (member
);
3020 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
3021 member
= BASELINK_FUNCTIONS (expr
);
3024 /* If the MEMBER is a real declaration, then the qualifying
3025 scope was not dependent. Ideally, we would not have a
3026 SCOPE_REF in those cases, but sometimes we do. If the second
3027 argument is a DECL, then the name must not have been
3029 if (DECL_P (member
))
3030 write_expression (member
);
3033 write_string ("sr");
3035 write_member_name (member
);
3038 else if (INDIRECT_REF_P (expr
)
3039 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3040 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3042 write_expression (TREE_OPERAND (expr
, 0));
3044 else if (identifier_p (expr
))
3046 /* An operator name appearing as a dependent name needs to be
3047 specially marked to disambiguate between a use of the operator
3048 name and a use of the operator in an expression. */
3049 if (IDENTIFIER_ANY_OP_P (expr
))
3050 write_string ("on");
3051 write_unqualified_id (expr
);
3053 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3055 tree fn
= TREE_OPERAND (expr
, 0);
3057 if (IDENTIFIER_ANY_OP_P (fn
))
3058 write_string ("on");
3059 write_unqualified_id (fn
);
3060 write_template_args (TREE_OPERAND (expr
, 1));
3062 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3064 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3065 const char *name
= OVL_OP_INFO (true, subop
)->mangled_name
;
3067 write_string (name
);
3068 write_expression (TREE_OPERAND (expr
, 0));
3069 write_expression (TREE_OPERAND (expr
, 2));
3071 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3073 /* ::= [gs] nw <expression>* _ <type> E
3074 ::= [gs] nw <expression>* _ <type> <initializer>
3075 ::= [gs] na <expression>* _ <type> E
3076 ::= [gs] na <expression>* _ <type> <initializer>
3077 <initializer> ::= pi <expression>* E */
3078 tree placement
= TREE_OPERAND (expr
, 0);
3079 tree type
= TREE_OPERAND (expr
, 1);
3080 tree nelts
= TREE_OPERAND (expr
, 2);
3081 tree init
= TREE_OPERAND (expr
, 3);
3084 gcc_assert (code
== NEW_EXPR
);
3085 if (TREE_OPERAND (expr
, 2))
3086 code
= VEC_NEW_EXPR
;
3088 if (NEW_EXPR_USE_GLOBAL (expr
))
3089 write_string ("gs");
3091 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3093 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3094 write_expression (TREE_VALUE (t
));
3101 ++processing_template_decl
;
3102 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3103 tf_warning_or_error
);
3104 type
= build_cplus_array_type (type
, domain
);
3105 --processing_template_decl
;
3109 if (init
&& TREE_CODE (init
) == TREE_LIST
3110 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3111 write_expression (TREE_VALUE (init
));
3115 write_string ("pi");
3116 if (init
&& init
!= void_node
)
3117 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3118 write_expression (TREE_VALUE (t
));
3122 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3124 gcc_assert (code
== DELETE_EXPR
);
3125 if (DELETE_EXPR_USE_VEC (expr
))
3126 code
= VEC_DELETE_EXPR
;
3128 if (DELETE_EXPR_USE_GLOBAL (expr
))
3129 write_string ("gs");
3131 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3133 write_expression (TREE_OPERAND (expr
, 0));
3135 else if (code
== THROW_EXPR
)
3137 tree op
= TREE_OPERAND (expr
, 0);
3140 write_string ("tw");
3141 write_expression (op
);
3144 write_string ("tr");
3146 else if (code
== CONSTRUCTOR
)
3148 bool braced_init
= BRACE_ENCLOSED_INITIALIZER_P (expr
);
3149 tree etype
= TREE_TYPE (expr
);
3152 write_string ("il");
3155 write_string ("tl");
3159 if (!initializer_zerop (expr
) || !trivial_type_p (etype
))
3161 /* Convert braced initializer lists to STRING_CSTs so that
3162 A<"Foo"> mangles the same as A<{'F', 'o', 'o', 0}> while
3163 still using the latter mangling for strings that
3164 originated as braced initializer lists. */
3165 expr
= braced_lists_to_strings (etype
, expr
);
3167 if (TREE_CODE (expr
) == CONSTRUCTOR
)
3169 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3170 unsigned last_nonzero
= -1, i
;
3173 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3174 if (!initializer_zerop (val
))
3177 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3179 if (i
> last_nonzero
)
3181 write_expression (val
);
3186 gcc_assert (TREE_CODE (expr
) == STRING_CST
);
3187 write_expression (expr
);
3192 else if (code
== LAMBDA_EXPR
)
3194 /* [temp.over.link] Two lambda-expressions are never considered
3197 So just use the closure type mangling. */
3198 write_string ("tl");
3199 write_type (LAMBDA_EXPR_CLOSURE (expr
));
3202 else if (dependent_name (expr
))
3204 write_unqualified_id (dependent_name (expr
));
3212 /* When we bind a variable or function to a non-type template
3213 argument with reference type, we create an ADDR_EXPR to show
3214 the fact that the entity's address has been taken. But, we
3215 don't actually want to output a mangling code for the `&'. */
3216 if (TREE_CODE (expr
) == ADDR_EXPR
3218 && TYPE_REF_P (TREE_TYPE (expr
)))
3220 expr
= TREE_OPERAND (expr
, 0);
3223 write_expression (expr
);
3227 code
= TREE_CODE (expr
);
3230 if (code
== COMPONENT_REF
)
3232 tree ob
= TREE_OPERAND (expr
, 0);
3234 if (TREE_CODE (ob
) == ARROW_EXPR
)
3236 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3237 ob
= TREE_OPERAND (ob
, 0);
3238 write_expression (ob
);
3240 else if (!is_dummy_object (ob
))
3242 write_string ("dt");
3243 write_expression (ob
);
3245 /* else, for a non-static data member with no associated object (in
3246 unevaluated context), use the unresolved-name mangling. */
3248 write_member_name (TREE_OPERAND (expr
, 1));
3252 /* If it wasn't any of those, recursively expand the expression. */
3253 name
= OVL_OP_INFO (false, code
)->mangled_name
;
3255 /* We used to mangle const_cast and static_cast like a C cast. */
3256 if (code
== CONST_CAST_EXPR
3257 || code
== STATIC_CAST_EXPR
)
3259 if (abi_warn_or_compat_version_crosses (6))
3260 G
.need_abi_warning
= 1;
3261 if (!abi_version_at_least (6))
3262 name
= OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
;
3270 error ("use of built-in trait %qE in function signature; "
3271 "use library traits instead", expr
);
3275 sorry ("mangling %C", code
);
3281 write_string (name
);
3287 tree fn
= CALL_EXPR_FN (expr
);
3289 if (TREE_CODE (fn
) == ADDR_EXPR
)
3290 fn
= TREE_OPERAND (fn
, 0);
3292 /* Mangle a dependent name as the name, not whatever happens to
3293 be the first function in the overload set. */
3295 && type_dependent_expression_p_push (expr
))
3298 write_expression (fn
);
3301 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3302 write_expression (CALL_EXPR_ARG (expr
, i
));
3307 write_type (TREE_TYPE (expr
));
3308 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3309 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3312 tree args
= TREE_OPERAND (expr
, 0);
3314 for (; args
; args
= TREE_CHAIN (args
))
3315 write_expression (TREE_VALUE (args
));
3320 case DYNAMIC_CAST_EXPR
:
3321 case REINTERPRET_CAST_EXPR
:
3322 case STATIC_CAST_EXPR
:
3323 case CONST_CAST_EXPR
:
3324 write_type (TREE_TYPE (expr
));
3325 write_expression (TREE_OPERAND (expr
, 0));
3328 case PREINCREMENT_EXPR
:
3329 case PREDECREMENT_EXPR
:
3330 if (abi_version_at_least (6))
3332 if (abi_warn_or_compat_version_crosses (6))
3333 G
.need_abi_warning
= 1;
3337 /* In the middle-end, some expressions have more operands than
3338 they do in templates (and mangling). */
3339 len
= cp_tree_operand_length (expr
);
3341 for (i
= 0; i
< len
; ++i
)
3343 tree operand
= TREE_OPERAND (expr
, i
);
3344 /* As a GNU extension, the middle operand of a
3345 conditional may be omitted. Since expression
3346 manglings are supposed to represent the input token
3347 stream, there's no good way to mangle such an
3348 expression without extending the C++ ABI. */
3349 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3351 error ("omitted middle operand to %<?:%> operand "
3352 "cannot be mangled");
3355 else if (FOLD_EXPR_P (expr
))
3357 /* The first 'operand' of a fold-expression is the operator
3358 that it folds over. */
3361 int fcode
= TREE_INT_CST_LOW (operand
);
3362 write_string (OVL_OP_INFO (false, fcode
)->mangled_name
);
3365 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3367 /* The order of operands of the binary left and right
3368 folds is the same, but we want to mangle them in
3369 lexical order, i.e. non-pack first. */
3371 operand
= FOLD_EXPR_INIT (expr
);
3373 operand
= FOLD_EXPR_PACK (expr
);
3375 if (PACK_EXPANSION_P (operand
))
3376 operand
= PACK_EXPANSION_PATTERN (operand
);
3378 write_expression (operand
);
3384 /* Literal subcase of non-terminal <template-arg>.
3386 "Literal arguments, e.g. "A<42L>", are encoded with their type
3387 and value. Negative integer values are preceded with "n"; for
3388 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3389 encoded as 0, true as 1." */
3392 write_template_arg_literal (const tree value
)
3394 if (TREE_CODE (value
) == STRING_CST
)
3395 /* Temporarily mangle strings as braced initializer lists. */
3396 write_string ("tl");
3400 tree valtype
= TREE_TYPE (value
);
3401 write_type (valtype
);
3403 /* Write a null member pointer value as (type)0, regardless of its
3404 real representation. */
3405 if (null_member_pointer_value_p (value
))
3406 write_integer_cst (integer_zero_node
);
3408 switch (TREE_CODE (value
))
3411 write_integer_cst (DECL_INITIAL (value
));
3415 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3416 || integer_zerop (value
) || integer_onep (value
));
3417 if (!(abi_version_at_least (14)
3418 && NULLPTR_TYPE_P (TREE_TYPE (value
))))
3419 write_integer_cst (value
);
3423 write_real_cst (value
);
3427 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3428 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3430 write_integer_cst (TREE_REALPART (value
));
3432 write_integer_cst (TREE_IMAGPART (value
));
3434 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3435 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3437 write_real_cst (TREE_REALPART (value
));
3439 write_real_cst (TREE_IMAGPART (value
));
3447 /* Mangle strings the same as braced initializer lists. */
3448 unsigned n
= TREE_STRING_LENGTH (value
);
3449 const char *str
= TREE_STRING_POINTER (value
);
3451 /* Count the number of trailing nuls and subtract them from
3452 STRSIZE because they don't need to be mangled. */
3453 for (const char *p
= str
+ n
- 1; ; --p
)
3457 n
-= str
+ n
- !!*p
- p
;
3461 tree eltype
= TREE_TYPE (valtype
);
3462 for (const char *p
= str
; n
--; ++p
)
3465 write_type (eltype
);
3466 write_unsigned_number (*(const unsigned char*)p
);
3479 /* Non-terminal <template-arg>.
3481 <template-arg> ::= <type> # type
3482 ::= L <type> </value/ number> E # literal
3483 ::= LZ <name> E # external name
3484 ::= X <expression> E # expression */
3487 write_template_arg (tree node
)
3489 enum tree_code code
= TREE_CODE (node
);
3491 MANGLE_TRACE_TREE ("template-arg", node
);
3493 /* A template template parameter's argument list contains TREE_LIST
3494 nodes of which the value field is the actual argument. */
3495 if (code
== TREE_LIST
)
3497 node
= TREE_VALUE (node
);
3498 /* If it's a decl, deal with its type instead. */
3501 node
= TREE_TYPE (node
);
3502 code
= TREE_CODE (node
);
3506 if (template_parm_object_p (node
))
3507 /* We want to mangle the argument, not the var we stored it in. */
3508 node
= DECL_INITIAL (node
);
3510 /* Strip a conversion added by convert_nontype_argument. */
3511 if (TREE_CODE (node
) == IMPLICIT_CONV_EXPR
)
3512 node
= TREE_OPERAND (node
, 0);
3513 if (REFERENCE_REF_P (node
))
3514 node
= TREE_OPERAND (node
, 0);
3515 if (TREE_CODE (node
) == NOP_EXPR
3516 && TYPE_REF_P (TREE_TYPE (node
)))
3518 /* Template parameters can be of reference type. To maintain
3519 internal consistency, such arguments use a conversion from
3520 address of object to reference type. */
3521 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3522 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3525 if (TREE_CODE (node
) == BASELINK
3526 && !type_unknown_p (node
))
3528 if (abi_version_at_least (6))
3529 node
= BASELINK_FUNCTIONS (node
);
3530 if (abi_warn_or_compat_version_crosses (6))
3531 /* We wrongly wrapped a class-scope function in X/E. */
3532 G
.need_abi_warning
= 1;
3535 if (ARGUMENT_PACK_P (node
))
3537 /* Expand the template argument pack. */
3538 tree args
= ARGUMENT_PACK_ARGS (node
);
3539 int i
, length
= TREE_VEC_LENGTH (args
);
3540 if (abi_version_at_least (6))
3544 if (abi_warn_or_compat_version_crosses (6))
3545 G
.need_abi_warning
= 1;
3546 for (i
= 0; i
< length
; ++i
)
3547 write_template_arg (TREE_VEC_ELT (args
, i
));
3550 else if (TYPE_P (node
))
3552 else if (code
== TEMPLATE_DECL
)
3553 /* A template appearing as a template arg is a template template arg. */
3554 write_template_template_arg (node
);
3555 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3556 || code
== CONST_DECL
3557 || null_member_pointer_value_p (node
))
3558 write_template_arg_literal (node
);
3559 else if (DECL_P (node
))
3562 /* Until ABI version 3, the underscore before the mangled name
3563 was incorrectly omitted. */
3564 if (!abi_version_at_least (3))
3567 write_string ("_Z");
3568 if (abi_warn_or_compat_version_crosses (3))
3569 G
.need_abi_warning
= 1;
3570 write_encoding (node
);
3575 /* Template arguments may be expressions. */
3577 write_expression (node
);
3582 /* <template-template-arg>
3584 ::= <substitution> */
3587 write_template_template_arg (const tree decl
)
3589 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3591 if (find_substitution (decl
))
3593 write_name (decl
, /*ignore_local_scope=*/0);
3594 add_substitution (decl
);
3598 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3600 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3601 ::= A <expression> _ </element/ type>
3603 "Array types encode the dimension (number of elements) and the
3604 element type. For variable length arrays, the dimension (but not
3605 the '_' separator) is omitted."
3606 Note that for flexible array members, like for other arrays of
3607 unspecified size, the dimension is also omitted. */
3610 write_array_type (const tree type
)
3613 if (TYPE_DOMAIN (type
))
3617 index_type
= TYPE_DOMAIN (type
);
3618 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3619 It's null for flexible array members which have no upper bound
3620 (this is a change from GCC 5 and prior where such members were
3621 incorrectly mangled as zero-length arrays). */
3622 if (tree max
= TYPE_MAX_VALUE (index_type
))
3624 if (TREE_CODE (max
) == INTEGER_CST
)
3626 /* The ABI specifies that we should mangle the number of
3627 elements in the array, not the largest allowed index. */
3628 offset_int wmax
= wi::to_offset (max
) + 1;
3629 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3630 number of elements as zero. */
3631 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3632 gcc_assert (wi::fits_uhwi_p (wmax
));
3633 write_unsigned_number (wmax
.to_uhwi ());
3637 max
= TREE_OPERAND (max
, 0);
3638 write_expression (max
);
3643 write_type (TREE_TYPE (type
));
3646 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3647 variables. TYPE is a pointer-to-member POINTER_TYPE.
3649 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3652 write_pointer_to_member_type (const tree type
)
3655 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3656 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3659 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3660 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3661 TEMPLATE_PARM_INDEX.
3663 <template-param> ::= T </parameter/ number> _ */
3666 write_template_param (const tree parm
)
3670 MANGLE_TRACE_TREE ("template-parm", parm
);
3672 switch (TREE_CODE (parm
))
3674 case TEMPLATE_TYPE_PARM
:
3675 case TEMPLATE_TEMPLATE_PARM
:
3676 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3677 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3680 case TEMPLATE_PARM_INDEX
:
3681 parm_index
= TEMPLATE_PARM_IDX (parm
);
3689 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3690 earliest template param denoted by `_'. */
3691 write_compact_number (parm_index
);
3694 /* <template-template-param>
3695 ::= <template-param>
3696 ::= <substitution> */
3699 write_template_template_param (const tree parm
)
3701 tree templ
= NULL_TREE
;
3703 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3704 template template parameter. The substitution candidate here is
3705 only the template. */
3706 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3709 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3710 if (find_substitution (templ
))
3714 /* <template-param> encodes only the template parameter position,
3715 not its template arguments, which is fine here. */
3716 write_template_param (parm
);
3718 add_substitution (templ
);
3721 /* Non-terminal <substitution>.
3723 <substitution> ::= S <seq-id> _
3727 write_substitution (const int seq_id
)
3729 MANGLE_TRACE ("substitution", "");
3733 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3737 /* Start mangling ENTITY. */
3740 start_mangling (const tree entity
)
3743 G
.need_abi_warning
= false;
3744 G
.need_cxx17_warning
= false;
3745 obstack_free (&name_obstack
, name_base
);
3746 mangle_obstack
= &name_obstack
;
3747 name_base
= obstack_alloc (&name_obstack
, 0);
3750 /* Done with mangling. If WARN is true, and the name of G.entity will
3751 be mangled differently in a future version of the ABI, issue a
3755 finish_mangling_internal (void)
3757 /* Clear all the substitutions. */
3758 vec_safe_truncate (G
.substitutions
, 0);
3760 /* Null-terminate the string. */
3765 /* Like finish_mangling_internal, but return the mangled string. */
3767 static inline const char *
3768 finish_mangling (void)
3770 finish_mangling_internal ();
3771 return (const char *) obstack_finish (mangle_obstack
);
3774 /* Like finish_mangling_internal, but return an identifier. */
3777 finish_mangling_get_identifier (void)
3779 finish_mangling_internal ();
3780 /* Don't obstack_finish here, and the next start_mangling will
3781 remove the identifier. */
3782 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3785 /* Initialize data structures for mangling. */
3790 gcc_obstack_init (&name_obstack
);
3791 name_base
= obstack_alloc (&name_obstack
, 0);
3792 vec_alloc (G
.substitutions
, 0);
3794 /* Cache these identifiers for quick comparison when checking for
3795 standard substitutions. */
3796 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3797 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3798 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3799 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3800 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3801 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3804 /* Generate the mangled name of DECL. */
3807 mangle_decl_string (const tree decl
)
3810 tree saved_fn
= NULL_TREE
;
3811 bool template_p
= false;
3813 /* We shouldn't be trying to mangle an uninstantiated template. */
3814 gcc_assert (!type_dependent_expression_p (decl
));
3816 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3818 struct tinst_level
*tl
= current_instantiation ();
3819 if ((!tl
|| tl
->maybe_get_node () != decl
)
3820 && push_tinst_level (decl
))
3823 saved_fn
= current_function_decl
;
3824 current_function_decl
= NULL_TREE
;
3827 iloc_sentinel
ils (DECL_SOURCE_LOCATION (decl
));
3829 start_mangling (decl
);
3831 if (TREE_CODE (decl
) == TYPE_DECL
)
3832 write_type (TREE_TYPE (decl
));
3834 write_mangled_name (decl
, true);
3836 result
= finish_mangling_get_identifier ();
3838 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3839 IDENTIFIER_POINTER (result
));
3844 current_function_decl
= saved_fn
;
3850 /* Return an identifier for the external mangled name of DECL. */
3853 get_mangled_id (tree decl
)
3855 tree id
= mangle_decl_string (decl
);
3856 return targetm
.mangle_decl_assembler_name (decl
, id
);
3859 /* Create an identifier for the external mangled name of DECL. */
3862 mangle_decl (const tree decl
)
3867 /* Don't bother mangling uninstantiated templates. */
3868 ++processing_template_decl
;
3869 if (TREE_CODE (decl
) == TYPE_DECL
)
3870 dep
= dependent_type_p (TREE_TYPE (decl
));
3872 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3873 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3874 --processing_template_decl
;
3878 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3879 It is not needed to assign names to anonymous namespace, but we use the
3880 "<anon>" marker to be able to tell if type is C++ ODR type or type
3881 produced by other language. */
3882 if (TREE_CODE (decl
) == TYPE_DECL
3883 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3884 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3885 id
= get_identifier ("<anon>");
3888 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3889 || !no_linkage_check (TREE_TYPE (decl
), true));
3890 if (abi_version_at_least (10))
3891 if (tree fn
= decl_function_context (decl
))
3892 maybe_check_abi_tags (fn
, decl
);
3893 id
= get_mangled_id (decl
);
3895 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3897 if (G
.need_cxx17_warning
3898 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
3899 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wnoexcept_type
,
3900 "mangled name for %qD will change in C++17 because the "
3901 "exception specification is part of a function type",
3904 if (id
!= DECL_NAME (decl
)
3905 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3906 && TREE_CODE (decl
) != TYPE_DECL
3907 && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl
))
3909 int save_ver
= flag_abi_version
;
3910 tree id2
= NULL_TREE
;
3912 if (!DECL_REALLY_EXTERN (decl
))
3914 record_mangling (decl
, G
.need_abi_warning
);
3916 if (!G
.need_abi_warning
)
3919 flag_abi_version
= flag_abi_compat_version
;
3920 id2
= mangle_decl_string (decl
);
3921 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3922 flag_abi_version
= save_ver
;
3925 note_mangling_alias (decl
, id2
);
3930 const char fabi_version
[] = "-fabi-version";
3932 if (flag_abi_compat_version
!= warn_abi_version
3933 || id2
== NULL_TREE
)
3935 flag_abi_version
= warn_abi_version
;
3936 id2
= mangle_decl_string (decl
);
3937 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3939 flag_abi_version
= save_ver
;
3943 else if (warn_abi_version
!= 0
3944 && abi_version_at_least (warn_abi_version
))
3945 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3946 "the mangled name of %qD changed between "
3947 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3948 G
.entity
, fabi_version
, warn_abi_version
, id2
,
3949 fabi_version
, save_ver
, id
);
3951 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3952 "the mangled name of %qD changes between "
3953 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3954 G
.entity
, fabi_version
, save_ver
, id
,
3955 fabi_version
, warn_abi_version
, id2
);
3958 flag_abi_version
= save_ver
;
3962 /* Generate the mangled representation of TYPE. */
3965 mangle_type_string (const tree type
)
3969 start_mangling (type
);
3971 result
= finish_mangling ();
3973 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3977 /* Create an identifier for the mangled name of a special component
3978 for belonging to TYPE. CODE is the ABI-specified code for this
3982 mangle_special_for_type (const tree type
, const char *code
)
3986 /* We don't have an actual decl here for the special component, so
3987 we can't just process the <encoded-name>. Instead, fake it. */
3988 start_mangling (type
);
3990 /* Start the mangling. */
3991 write_string ("_Z");
3992 write_string (code
);
3996 result
= finish_mangling_get_identifier ();
3999 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
4000 IDENTIFIER_POINTER (result
));
4005 /* Create an identifier for the mangled representation of the typeinfo
4006 structure for TYPE. */
4009 mangle_typeinfo_for_type (const tree type
)
4011 return mangle_special_for_type (type
, "TI");
4014 /* Create an identifier for the mangled name of the NTBS containing
4015 the mangled name of TYPE. */
4018 mangle_typeinfo_string_for_type (const tree type
)
4020 return mangle_special_for_type (type
, "TS");
4023 /* Create an identifier for the mangled name of the vtable for TYPE. */
4026 mangle_vtbl_for_type (const tree type
)
4028 return mangle_special_for_type (type
, "TV");
4031 /* Returns an identifier for the mangled name of the VTT for TYPE. */
4034 mangle_vtt_for_type (const tree type
)
4036 return mangle_special_for_type (type
, "TT");
4039 /* Returns an identifier for the mangled name of the decomposition
4040 artificial variable DECL. DECLS is the vector of the VAR_DECLs
4041 for the identifier-list. */
4044 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
4046 gcc_assert (!type_dependent_expression_p (decl
));
4048 location_t saved_loc
= input_location
;
4049 input_location
= DECL_SOURCE_LOCATION (decl
);
4051 start_mangling (decl
);
4052 write_string ("_Z");
4054 tree context
= decl_mangling_context (decl
);
4055 gcc_assert (context
!= NULL_TREE
);
4057 bool nested
= false;
4058 if (DECL_NAMESPACE_STD_P (context
))
4059 write_string ("St");
4060 else if (context
!= global_namespace
)
4064 write_prefix (decl_mangling_context (decl
));
4067 write_string ("DC");
4070 FOR_EACH_VEC_ELT (decls
, i
, d
)
4071 write_unqualified_name (d
);
4077 tree id
= finish_mangling_get_identifier ();
4079 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4080 IDENTIFIER_POINTER (id
));
4082 input_location
= saved_loc
;
4086 /* Return an identifier for a construction vtable group. TYPE is
4087 the most derived class in the hierarchy; BINFO is the base
4088 subobject for which this construction vtable group will be used.
4090 This mangling isn't part of the ABI specification; in the ABI
4091 specification, the vtable group is dumped in the same COMDAT as the
4092 main vtable, and is referenced only from that vtable, so it doesn't
4093 need an external name. For binary formats without COMDAT sections,
4094 though, we need external names for the vtable groups.
4096 We use the production
4098 <special-name> ::= CT <type> <offset number> _ <base type> */
4101 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4105 start_mangling (type
);
4107 write_string ("_Z");
4108 write_string ("TC");
4110 write_integer_cst (BINFO_OFFSET (binfo
));
4112 write_type (BINFO_TYPE (binfo
));
4114 result
= finish_mangling_get_identifier ();
4116 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4117 IDENTIFIER_POINTER (result
));
4121 /* Mangle a this pointer or result pointer adjustment.
4123 <call-offset> ::= h <fixed offset number> _
4124 ::= v <fixed offset number> _ <virtual offset number> _ */
4127 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4129 write_char (virtual_offset
? 'v' : 'h');
4131 /* For either flavor, write the fixed offset. */
4132 write_integer_cst (fixed_offset
);
4135 /* For a virtual thunk, add the virtual offset. */
4138 write_integer_cst (virtual_offset
);
4143 /* Return an identifier for the mangled name of a this-adjusting or
4144 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4145 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4146 is a virtual thunk, and it is the vtbl offset in
4147 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4148 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4149 thunk itself. A covariant thunk name always includes the adjustment
4150 for the this pointer, even if there is none.
4152 <special-name> ::= T <call-offset> <base encoding>
4153 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4157 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4158 tree virtual_offset
, tree thunk
)
4162 if (abi_version_at_least (11))
4163 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4165 start_mangling (fn_decl
);
4167 write_string ("_Z");
4170 if (!this_adjusting
)
4172 /* Covariant thunk with no this adjustment */
4174 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4175 mangle_call_offset (fixed_offset
, virtual_offset
);
4177 else if (!DECL_THUNK_P (fn_decl
))
4178 /* Plain this adjusting thunk. */
4179 mangle_call_offset (fixed_offset
, virtual_offset
);
4182 /* This adjusting thunk to covariant thunk. */
4184 mangle_call_offset (fixed_offset
, virtual_offset
);
4185 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4186 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4188 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4189 mangle_call_offset (fixed_offset
, virtual_offset
);
4190 fn_decl
= THUNK_TARGET (fn_decl
);
4194 write_encoding (fn_decl
);
4196 result
= finish_mangling_get_identifier ();
4198 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4202 /* Handle ABI backwards compatibility for past bugs where we didn't call
4203 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4204 it makes a difference. If FOR_DECL is non-null, it's the declaration
4205 that we're actually trying to mangle; if it's null, we're mangling the
4206 guard variable for T. */
4209 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4211 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4214 tree oldtags
= get_abi_tags (t
);
4218 tree newtags
= get_abi_tags (t
);
4219 if (newtags
&& newtags
!= oldtags
4220 && abi_version_crosses (ver
))
4222 if (for_decl
&& DECL_THUNK_P (for_decl
))
4223 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4224 "the mangled name of a thunk for %qD changes between "
4225 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4226 t
, flag_abi_version
, warn_abi_version
);
4228 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4229 "the mangled name of %qD changes between "
4230 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4231 for_decl
, flag_abi_version
, warn_abi_version
);
4233 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4234 "the mangled name of the initialization guard variable "
4235 "for %qD changes between %<-fabi-version=%d%> and "
4236 "%<-fabi-version=%d%>",
4237 t
, flag_abi_version
, warn_abi_version
);
4241 /* Write out the appropriate string for this variable when generating
4242 another mangled name based on this one. */
4245 write_guarded_var_name (const tree variable
)
4247 if (DECL_NAME (variable
)
4248 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4249 /* The name of a guard variable for a reference temporary should refer
4250 to the reference, not the temporary. */
4251 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4253 write_name (variable
, /*ignore_local_scope=*/0);
4256 /* Return an identifier for the name of an initialization guard
4257 variable for indicated VARIABLE. */
4260 mangle_guard_variable (const tree variable
)
4262 if (abi_version_at_least (10))
4263 maybe_check_abi_tags (variable
);
4264 start_mangling (variable
);
4265 write_string ("_ZGV");
4266 write_guarded_var_name (variable
);
4267 return finish_mangling_get_identifier ();
4270 /* Return an identifier for the name of a thread_local initialization
4271 function for VARIABLE. */
4274 mangle_tls_init_fn (const tree variable
)
4276 check_abi_tags (variable
);
4277 start_mangling (variable
);
4278 write_string ("_ZTH");
4279 write_guarded_var_name (variable
);
4280 return finish_mangling_get_identifier ();
4283 /* Return an identifier for the name of a thread_local wrapper
4284 function for VARIABLE. */
4286 #define TLS_WRAPPER_PREFIX "_ZTW"
4289 mangle_tls_wrapper_fn (const tree variable
)
4291 check_abi_tags (variable
);
4292 start_mangling (variable
);
4293 write_string (TLS_WRAPPER_PREFIX
);
4294 write_guarded_var_name (variable
);
4295 return finish_mangling_get_identifier ();
4298 /* Return true iff FN is a thread_local wrapper function. */
4301 decl_tls_wrapper_p (const tree fn
)
4303 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4305 tree name
= DECL_NAME (fn
);
4306 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4307 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4310 /* Return an identifier for the name of a temporary variable used to
4311 initialize a static reference. This is now part of the ABI. */
4314 mangle_ref_init_variable (const tree variable
)
4316 start_mangling (variable
);
4317 write_string ("_ZGR");
4318 check_abi_tags (variable
);
4319 write_name (variable
, /*ignore_local_scope=*/0);
4320 /* Avoid name clashes with aggregate initialization of multiple
4321 references at once. */
4322 write_compact_number (current_ref_temp_count
++);
4323 return finish_mangling_get_identifier ();
4326 /* Return an identifier for the mangled name of a C++20 template parameter
4327 object for template argument EXPR. */
4330 mangle_template_parm_object (tree expr
)
4332 start_mangling (expr
);
4333 write_string ("_ZTAX");
4334 write_expression (expr
);
4336 return finish_mangling_get_identifier ();
4339 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4340 function generates a mangled name for the vtable map variable of
4341 the class type. For example, if the class type is
4342 "std::bad_exception", the mangled name for the class is
4343 "St13bad_exception". This function would generate the name
4344 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4345 "_VTV<std::bad_exception>::__vtable_map". */
4349 get_mangled_vtable_map_var_name (tree class_type
)
4351 char *var_name
= NULL
;
4352 const char *prefix
= "_ZN4_VTVI";
4353 const char *postfix
= "E12__vtable_mapE";
4355 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4357 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4359 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4361 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4362 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4365 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4367 strlen (postfix
) + 1;
4369 var_name
= (char *) xmalloc (len
);
4371 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4376 #include "gt-cp-mangle.h"