1 /* Name mangling for the 3.0 -*- C++ -*- ABI.
2 Copyright (C) 2000-2017 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 int local_class_index (tree
);
237 static void maybe_check_abi_tags (tree
, tree
= NULL_TREE
, int = 10);
238 static bool equal_abi_tags (tree
, tree
);
240 /* Control functions. */
242 static inline void start_mangling (const tree
);
243 static tree
mangle_special_for_type (const tree
, const char *);
245 /* Append a single character to the end of the mangled
247 #define write_char(CHAR) \
248 obstack_1grow (mangle_obstack, (CHAR))
250 /* Append a sized buffer to the end of the mangled representation. */
251 #define write_chars(CHAR, LEN) \
252 obstack_grow (mangle_obstack, (CHAR), (LEN))
254 /* Append a NUL-terminated string to the end of the mangled
256 #define write_string(STRING) \
257 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
259 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
260 same purpose (context, which may be a type) and value (template
261 decl). See write_template_prefix for more information on what this
263 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
264 (TREE_CODE (NODE1) == TREE_LIST \
265 && TREE_CODE (NODE2) == TREE_LIST \
266 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
267 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
268 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
269 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
271 /* Write out an unsigned quantity in base 10. */
272 #define write_unsigned_number(NUMBER) \
273 write_number ((NUMBER), /*unsigned_p=*/1, 10)
275 /* If DECL is a template instance (including the uninstantiated template
276 itself), return nonzero and, if TEMPLATE_INFO is non-NULL, set
277 *TEMPLATE_INFO to its template info. Otherwise return zero. */
280 decl_is_template_id (const tree decl
, tree
* const template_info
)
282 if (TREE_CODE (decl
) == TYPE_DECL
)
284 /* TYPE_DECLs are handled specially. Look at its type to decide
285 if this is a template instantiation. */
286 const tree type
= TREE_TYPE (decl
);
288 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
290 if (template_info
!= NULL
)
291 /* For a templated TYPE_DECL, the template info is hanging
293 *template_info
= TYPE_TEMPLATE_INFO (type
);
299 /* Check if this is a primary template. */
300 if (DECL_LANG_SPECIFIC (decl
) != NULL
301 && VAR_OR_FUNCTION_DECL_P (decl
)
302 && DECL_TEMPLATE_INFO (decl
)
303 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
304 && TREE_CODE (decl
) != TEMPLATE_DECL
)
306 if (template_info
!= NULL
)
307 /* For most templated decls, the template info is hanging
309 *template_info
= DECL_TEMPLATE_INFO (decl
);
314 /* It's not a template id. */
318 /* Produce debugging output of current substitution candidates. */
321 dump_substitution_candidates (void)
326 fprintf (stderr
, " ++ substitutions ");
327 FOR_EACH_VEC_ELT (*G
.substitutions
, i
, el
)
329 const char *name
= "???";
332 fprintf (stderr
, " ");
334 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
335 else if (TREE_CODE (el
) == TREE_LIST
)
336 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
337 else if (TYPE_NAME (el
))
338 name
= TYPE_NAME_STRING (el
);
339 fprintf (stderr
, " S%d_ = ", i
- 1);
341 (CP_TYPE_RESTRICT_P (el
)
342 || CP_TYPE_VOLATILE_P (el
)
343 || CP_TYPE_CONST_P (el
)))
344 fprintf (stderr
, "CV-");
345 fprintf (stderr
, "%s (%s at %p)\n",
346 name
, get_tree_code_name (TREE_CODE (el
)), (void *) el
);
350 /* <exception-spec> ::=
351 Do -- non-throwing exception specification
352 DO <expression> E -- computed (instantiation-dependent) noexcept
353 Dw <type>* E -- throw (types) */
356 write_exception_spec (tree spec
)
359 if (!spec
|| spec
== noexcept_false_spec
)
363 if (!flag_noexcept_type
)
365 G
.need_cxx17_warning
= true;
369 if (spec
== noexcept_true_spec
|| spec
== empty_except_spec
)
371 else if (tree expr
= TREE_PURPOSE (spec
))
373 /* noexcept (expr) */
374 gcc_assert (uses_template_parms (expr
));
376 write_expression (expr
);
381 /* throw (type-list) */
383 for (tree t
= spec
; t
; t
= TREE_CHAIN (t
))
384 write_type (TREE_VALUE (t
));
389 /* Both decls and types can be substitution candidates, but sometimes
390 they refer to the same thing. For instance, a TYPE_DECL and
391 RECORD_TYPE for the same class refer to the same thing, and should
392 be treated accordingly in substitutions. This function returns a
393 canonicalized tree node representing NODE that is used when adding
394 and substitution candidates and finding matches. */
397 canonicalize_for_substitution (tree node
)
399 /* For a TYPE_DECL, use the type instead. */
400 if (TREE_CODE (node
) == TYPE_DECL
)
401 node
= TREE_TYPE (node
);
403 && TYPE_CANONICAL (node
) != node
404 && TYPE_MAIN_VARIANT (node
) != node
)
407 /* Here we want to strip the topmost typedef only.
408 We need to do that so is_std_substitution can do proper
410 if (TREE_CODE (node
) == FUNCTION_TYPE
)
411 /* Use build_qualified_type and TYPE_QUALS here to preserve
412 the old buggy mangling of attribute noreturn with abi<5. */
413 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
416 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
417 cp_type_quals (node
));
418 if (TREE_CODE (node
) == FUNCTION_TYPE
419 || TREE_CODE (node
) == METHOD_TYPE
)
421 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
422 tree r
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig
));
423 if (flag_noexcept_type
)
424 node
= build_exception_variant (node
, r
);
426 /* Set the warning flag if appropriate. */
427 write_exception_spec (r
);
433 /* Add NODE as a substitution candidate. NODE must not already be on
434 the list of candidates. */
437 add_substitution (tree node
)
442 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
443 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
445 /* Get the canonicalized substitution candidate for NODE. */
446 c
= canonicalize_for_substitution (node
);
447 if (DEBUG_MANGLE
&& c
!= node
)
448 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
449 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
452 /* Make sure NODE isn't already a candidate. */
458 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
460 gcc_assert (!(DECL_P (node
) && node
== candidate
));
461 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
462 && same_type_p (node
, candidate
)));
466 /* Put the decl onto the varray of substitution candidates. */
467 vec_safe_push (G
.substitutions
, node
);
470 dump_substitution_candidates ();
473 /* Helper function for find_substitution. Returns nonzero if NODE,
474 which may be a decl or a CLASS_TYPE, is a template-id with template
475 name of substitution_index[INDEX] in the ::std namespace. */
478 is_std_substitution (const tree node
,
479 const substitution_identifier_index_t index
)
486 type
= TREE_TYPE (node
);
489 else if (CLASS_TYPE_P (node
))
492 decl
= TYPE_NAME (node
);
495 /* These are not the droids you're looking for. */
498 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
499 && TYPE_LANG_SPECIFIC (type
)
500 && TYPE_TEMPLATE_INFO (type
)
501 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
502 == subst_identifiers
[index
]));
505 /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
506 which can be a decl or type. */
509 get_abi_tags (tree t
)
511 if (!t
|| TREE_CODE (t
) == NAMESPACE_DECL
)
514 if (DECL_P (t
) && DECL_DECLARES_TYPE_P (t
))
519 attrs
= TYPE_ATTRIBUTES (t
);
521 attrs
= DECL_ATTRIBUTES (t
);
523 tree tags
= lookup_attribute ("abi_tag", attrs
);
525 tags
= TREE_VALUE (tags
);
529 /* Helper function for find_substitution. Returns nonzero if NODE,
530 which may be a decl or a CLASS_TYPE, is the template-id
531 ::std::identifier<char>, where identifier is
532 substitution_index[INDEX]. */
535 is_std_substitution_char (const tree node
,
536 const substitution_identifier_index_t index
)
539 /* Check NODE's name is ::std::identifier. */
540 if (!is_std_substitution (node
, index
))
542 /* Figure out its template args. */
544 args
= DECL_TI_ARGS (node
);
545 else if (CLASS_TYPE_P (node
))
546 args
= CLASSTYPE_TI_ARGS (node
);
548 /* Oops, not a template. */
550 /* NODE's template arg list should be <char>. */
552 TREE_VEC_LENGTH (args
) == 1
553 && TREE_VEC_ELT (args
, 0) == char_type_node
;
556 /* Check whether a substitution should be used to represent NODE in
559 First, check standard special-case substitutions.
561 <substitution> ::= St
568 # ::std::basic_string
571 # ::std::basic_string<char,
572 ::std::char_traits<char>,
573 ::std::allocator<char> >
576 # ::std::basic_istream<char, ::std::char_traits<char> >
579 # ::std::basic_ostream<char, ::std::char_traits<char> >
582 # ::std::basic_iostream<char, ::std::char_traits<char> >
584 Then examine the stack of currently available substitution
585 candidates for entities appearing earlier in the same mangling
587 If a substitution is found, write its mangled representation and
588 return nonzero. If none is found, just return zero. */
591 find_substitution (tree node
)
594 const int size
= vec_safe_length (G
.substitutions
);
597 const char *abbr
= NULL
;
600 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
601 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
603 /* Obtain the canonicalized substitution representation for NODE.
604 This is what we'll compare against. */
605 node
= canonicalize_for_substitution (node
);
607 /* Check for builtin substitutions. */
609 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
610 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
612 /* Check for std::allocator. */
614 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
615 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
618 /* Check for std::basic_string. */
619 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
623 /* If this is a type (i.e. a fully-qualified template-id),
625 std::basic_string <char,
626 std::char_traits<char>,
627 std::allocator<char> > . */
628 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
629 && CLASSTYPE_USE_TEMPLATE (type
))
631 tree args
= CLASSTYPE_TI_ARGS (type
);
632 if (TREE_VEC_LENGTH (args
) == 3
633 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
634 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
636 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
642 /* Substitute for the template name only if this isn't a type. */
646 /* Check for basic_{i,o,io}stream. */
647 else if (TYPE_P (node
)
648 && cp_type_quals (type
) == TYPE_UNQUALIFIED
649 && CLASS_TYPE_P (type
)
650 && CLASSTYPE_USE_TEMPLATE (type
)
651 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
653 /* First, check for the template
654 args <char, std::char_traits<char> > . */
655 tree args
= CLASSTYPE_TI_ARGS (type
);
656 if (TREE_VEC_LENGTH (args
) == 2
657 && TYPE_P (TREE_VEC_ELT (args
, 0))
658 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
659 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
662 /* Got them. Is this basic_istream? */
663 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
665 /* Or basic_ostream? */
666 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
668 /* Or basic_iostream? */
669 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
674 /* Check for namespace std. */
675 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
681 tree tags
= NULL_TREE
;
682 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
683 tags
= get_abi_tags (type
);
684 /* Now check the list of available substitutions for this mangling
686 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
688 tree candidate
= (*G
.substitutions
)[i
];
689 /* NODE is a matched to a candidate if it's the same decl node or
690 if it's the same type. */
691 if (decl
== candidate
692 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
693 && same_type_p (type
, candidate
))
694 || NESTED_TEMPLATE_MATCH (node
, candidate
))
696 write_substitution (i
);
702 /* No substitution found. */
708 /* If there are ABI tags on the abbreviation, it becomes
709 a substitution candidate. */
710 write_abi_tags (tags
);
711 add_substitution (node
);
716 /* Returns whether DECL's symbol name should be the plain unqualified-id
717 rather than a more complicated mangled name. */
720 unmangled_name_p (const tree decl
)
722 if (TREE_CODE (decl
) == FUNCTION_DECL
)
724 /* The names of `extern "C"' functions are not mangled. */
725 return (DECL_EXTERN_C_FUNCTION_P (decl
)
726 /* But overloaded operator names *are* mangled. */
727 && !DECL_OVERLOADED_OPERATOR_P (decl
));
729 else if (VAR_P (decl
))
731 /* static variables are mangled. */
732 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
735 /* extern "C" declarations aren't mangled. */
736 if (DECL_EXTERN_C_P (decl
))
739 /* Other variables at non-global scope are mangled. */
740 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
743 /* Variable template instantiations are mangled. */
744 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
745 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
748 /* Declarations with ABI tags are mangled. */
749 if (get_abi_tags (decl
))
752 /* The names of non-static global variables aren't mangled. */
759 /* TOP_LEVEL is true, if this is being called at outermost level of
760 mangling. It should be false when mangling a decl appearing in an
761 expression within some other mangling.
763 <mangled-name> ::= _Z <encoding> */
766 write_mangled_name (const tree decl
, bool top_level
)
768 MANGLE_TRACE_TREE ("mangled-name", decl
);
770 check_abi_tags (decl
);
772 if (unmangled_name_p (decl
))
775 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
778 /* The standard notes: "The <encoding> of an extern "C"
779 function is treated like global-scope data, i.e. as its
780 <source-name> without a type." We cannot write
781 overloaded operators that way though, because it contains
782 characters invalid in assembler. */
784 write_source_name (DECL_NAME (decl
));
790 write_encoding (decl
);
794 /* Returns true if the return type of DECL is part of its signature, and
795 therefore its mangling. */
798 mangle_return_type_p (tree decl
)
800 return (!DECL_CONSTRUCTOR_P (decl
)
801 && !DECL_DESTRUCTOR_P (decl
)
802 && !DECL_CONV_FN_P (decl
)
803 && decl_is_template_id (decl
, NULL
));
806 /* <encoding> ::= <function name> <bare-function-type>
810 write_encoding (const tree decl
)
812 MANGLE_TRACE_TREE ("encoding", decl
);
814 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
816 /* For overloaded operators write just the mangled name
817 without arguments. */
818 if (DECL_OVERLOADED_OPERATOR_P (decl
))
819 write_name (decl
, /*ignore_local_scope=*/0);
821 write_source_name (DECL_NAME (decl
));
825 write_name (decl
, /*ignore_local_scope=*/0);
826 if (TREE_CODE (decl
) == FUNCTION_DECL
)
830 bool tmpl
= decl_is_template_id (decl
, NULL
);
834 fn_type
= get_mostly_instantiated_function_type (decl
);
835 /* FN_TYPE will not have parameter types for in-charge or
836 VTT parameters. Therefore, we pass NULL_TREE to
837 write_bare_function_type -- otherwise, it will get
838 confused about which artificial parameters to skip. */
843 fn_type
= TREE_TYPE (decl
);
847 write_bare_function_type (fn_type
,
848 mangle_return_type_p (decl
),
853 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
854 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
857 decl_mangling_context (tree decl
)
859 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
861 if (tcontext
!= NULL_TREE
)
864 if (TREE_CODE (decl
) == TEMPLATE_DECL
865 && DECL_TEMPLATE_RESULT (decl
))
866 decl
= DECL_TEMPLATE_RESULT (decl
);
868 if (TREE_CODE (decl
) == TYPE_DECL
869 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
871 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
875 else if (template_type_parameter_p (decl
))
876 /* template type parms have no mangling context. */
878 return CP_DECL_CONTEXT (decl
);
881 /* <name> ::= <unscoped-name>
882 ::= <unscoped-template-name> <template-args>
886 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
887 called from <local-name>, which mangles the enclosing scope
888 elsewhere and then uses this function to mangle just the part
889 underneath the function scope. So don't use the <local-name>
890 production, to avoid an infinite recursion. */
893 write_name (tree decl
, const int ignore_local_scope
)
897 MANGLE_TRACE_TREE ("name", decl
);
899 if (TREE_CODE (decl
) == TYPE_DECL
)
901 /* In case this is a typedef, fish out the corresponding
902 TYPE_DECL for the main variant. */
903 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
906 context
= decl_mangling_context (decl
);
908 gcc_assert (context
!= NULL_TREE
);
910 if (abi_warn_or_compat_version_crosses (7)
911 && ignore_local_scope
912 && TREE_CODE (context
) == PARM_DECL
)
913 G
.need_abi_warning
= 1;
915 /* A decl in :: or ::std scope is treated specially. The former is
916 mangled using <unscoped-name> or <unscoped-template-name>, the
917 latter with a special substitution. Also, a name that is
918 directly in a local function scope is also mangled with
919 <unscoped-name> rather than a full <nested-name>. */
920 if (context
== global_namespace
921 || DECL_NAMESPACE_STD_P (context
)
922 || (ignore_local_scope
923 && (TREE_CODE (context
) == FUNCTION_DECL
924 || (abi_version_at_least (7)
925 && TREE_CODE (context
) == PARM_DECL
))))
928 /* Is this a template instance? */
929 if (decl_is_template_id (decl
, &template_info
))
931 /* Yes: use <unscoped-template-name>. */
932 write_unscoped_template_name (TI_TEMPLATE (template_info
));
933 write_template_args (TI_ARGS (template_info
));
936 /* Everything else gets an <unqualified-name>. */
937 write_unscoped_name (decl
);
941 /* Handle local names, unless we asked not to (that is, invoked
942 under <local-name>, to handle only the part of the name under
944 if (!ignore_local_scope
)
946 /* Scan up the list of scope context, looking for a
947 function. If we find one, this entity is in local
948 function scope. local_entity tracks context one scope
949 level down, so it will contain the element that's
950 directly in that function's scope, either decl or one of
951 its enclosing scopes. */
952 tree local_entity
= decl
;
953 while (context
!= global_namespace
)
955 /* Make sure we're always dealing with decls. */
956 if (TYPE_P (context
))
957 context
= TYPE_NAME (context
);
958 /* Is this a function? */
959 if (TREE_CODE (context
) == FUNCTION_DECL
960 || TREE_CODE (context
) == PARM_DECL
)
962 /* Yes, we have local scope. Use the <local-name>
963 production for the innermost function scope. */
964 write_local_name (context
, local_entity
, decl
);
967 /* Up one scope level. */
968 local_entity
= context
;
969 context
= decl_mangling_context (context
);
972 /* No local scope found? Fall through to <nested-name>. */
975 /* Other decls get a <nested-name> to encode their scope. */
976 write_nested_name (decl
);
980 /* <unscoped-name> ::= <unqualified-name>
981 ::= St <unqualified-name> # ::std:: */
984 write_unscoped_name (const tree decl
)
986 tree context
= decl_mangling_context (decl
);
988 MANGLE_TRACE_TREE ("unscoped-name", decl
);
990 /* Is DECL in ::std? */
991 if (DECL_NAMESPACE_STD_P (context
))
994 write_unqualified_name (decl
);
998 /* If not, it should be either in the global namespace, or directly
999 in a local function scope. A lambda can also be mangled in the
1000 scope of a default argument. */
1001 gcc_assert (context
== global_namespace
1002 || TREE_CODE (context
) == PARM_DECL
1003 || TREE_CODE (context
) == FUNCTION_DECL
);
1005 write_unqualified_name (decl
);
1009 /* <unscoped-template-name> ::= <unscoped-name>
1010 ::= <substitution> */
1013 write_unscoped_template_name (const tree decl
)
1015 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
1017 if (find_substitution (decl
))
1019 write_unscoped_name (decl
);
1020 add_substitution (decl
);
1023 /* Write the nested name, including CV-qualifiers, of DECL.
1025 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1026 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1028 <ref-qualifier> ::= R # & ref-qualifier
1029 ::= O # && ref-qualifier
1030 <CV-qualifiers> ::= [r] [V] [K] */
1033 write_nested_name (const tree decl
)
1037 MANGLE_TRACE_TREE ("nested-name", decl
);
1041 /* Write CV-qualifiers, if this is a member function. */
1042 if (TREE_CODE (decl
) == FUNCTION_DECL
1043 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1045 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1047 if (DECL_CONST_MEMFUNC_P (decl
))
1049 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1051 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1058 /* Is this a template instance? */
1059 if (decl_is_template_id (decl
, &template_info
))
1061 /* Yes, use <template-prefix>. */
1062 write_template_prefix (decl
);
1063 write_template_args (TI_ARGS (template_info
));
1065 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1066 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1068 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1069 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1071 write_template_prefix (decl
);
1072 write_template_args (TREE_OPERAND (name
, 1));
1076 write_prefix (decl_mangling_context (decl
));
1077 write_unqualified_name (decl
);
1082 /* No, just use <prefix> */
1083 write_prefix (decl_mangling_context (decl
));
1084 write_unqualified_name (decl
);
1089 /* <prefix> ::= <prefix> <unqualified-name>
1090 ::= <template-param>
1091 ::= <template-prefix> <template-args>
1094 ::= <substitution> */
1097 write_prefix (const tree node
)
1100 /* Non-NULL if NODE represents a template-id. */
1101 tree template_info
= NULL
;
1104 || node
== global_namespace
)
1107 MANGLE_TRACE_TREE ("prefix", node
);
1109 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1115 if (find_substitution (node
))
1120 /* If this is a function or parm decl, that means we've hit function
1121 scope, so this prefix must be for a local name. In this
1122 case, we're under the <local-name> production, which encodes
1123 the enclosing function scope elsewhere. So don't continue
1125 if (TREE_CODE (node
) == FUNCTION_DECL
1126 || TREE_CODE (node
) == PARM_DECL
)
1130 decl_is_template_id (decl
, &template_info
);
1134 /* Node is a type. */
1135 decl
= TYPE_NAME (node
);
1136 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1137 template_info
= TYPE_TEMPLATE_INFO (node
);
1140 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1141 write_template_param (node
);
1142 else if (template_info
!= NULL
)
1145 write_template_prefix (decl
);
1146 write_template_args (TI_ARGS (template_info
));
1148 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1150 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1151 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1153 write_template_prefix (decl
);
1154 write_template_args (TREE_OPERAND (name
, 1));
1158 write_prefix (decl_mangling_context (decl
));
1159 write_unqualified_name (decl
);
1163 /* Not templated. */
1165 write_prefix (decl_mangling_context (decl
));
1166 write_unqualified_name (decl
);
1168 || TREE_CODE (decl
) == FIELD_DECL
)
1170 /* <data-member-prefix> := <member source-name> M */
1176 add_substitution (node
);
1179 /* <template-prefix> ::= <prefix> <template component>
1180 ::= <template-param>
1181 ::= <substitution> */
1184 write_template_prefix (const tree node
)
1186 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1187 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1188 tree context
= decl_mangling_context (decl
);
1193 MANGLE_TRACE_TREE ("template-prefix", node
);
1195 /* Find the template decl. */
1196 if (decl_is_template_id (decl
, &template_info
))
1197 templ
= TI_TEMPLATE (template_info
);
1198 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1199 /* For a typename type, all we have is the name. */
1200 templ
= DECL_NAME (decl
);
1203 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1205 templ
= TYPE_TI_TEMPLATE (type
);
1208 /* For a member template, though, the template name for the
1209 innermost name must have all the outer template levels
1210 instantiated. For instance, consider
1212 template<typename T> struct Outer {
1213 template<typename U> struct Inner {};
1216 The template name for `Inner' in `Outer<int>::Inner<float>' is
1217 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1218 levels separately, so there's no TEMPLATE_DECL available for this
1219 (there's only `Outer<T>::Inner<U>').
1221 In order to get the substitutions right, we create a special
1222 TREE_LIST to represent the substitution candidate for a nested
1223 template. The TREE_PURPOSE is the template's context, fully
1224 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1227 So, for the example above, `Outer<int>::Inner' is represented as a
1228 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1229 and whose value is `Outer<T>::Inner<U>'. */
1230 if (context
&& TYPE_P (context
))
1231 substitution
= build_tree_list (context
, templ
);
1233 substitution
= templ
;
1235 if (find_substitution (substitution
))
1238 if (TREE_TYPE (templ
)
1239 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1240 write_template_param (TREE_TYPE (templ
));
1243 write_prefix (context
);
1244 write_unqualified_name (decl
);
1247 add_substitution (substitution
);
1250 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1251 mangled through special entry points.
1253 <unqualified-name> ::= <operator-name>
1256 ::= <unnamed-type-name>
1257 ::= <local-source-name>
1259 <local-source-name> ::= L <source-name> <discriminator> */
1262 write_unqualified_id (tree identifier
)
1264 if (IDENTIFIER_CONV_OP_P (identifier
))
1265 write_conversion_operator_name (TREE_TYPE (identifier
));
1266 else if (IDENTIFIER_OVL_OP_P (identifier
))
1268 const ovl_op_info_t
*ovl_op
= IDENTIFIER_OVL_OP_INFO (identifier
);
1269 write_string (ovl_op
->mangled_name
);
1271 else if (UDLIT_OPER_P (identifier
))
1272 write_literal_operator_name (identifier
);
1274 write_source_name (identifier
);
1278 write_unqualified_name (tree decl
)
1280 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1282 if (identifier_p (decl
))
1284 write_unqualified_id (decl
);
1290 if (DECL_NAME (decl
) == NULL_TREE
)
1293 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1294 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1296 else if (DECL_DECLARES_FUNCTION_P (decl
))
1299 if (DECL_CONSTRUCTOR_P (decl
))
1300 write_special_name_constructor (decl
);
1301 else if (DECL_DESTRUCTOR_P (decl
))
1302 write_special_name_destructor (decl
);
1303 else if (DECL_CONV_FN_P (decl
))
1305 /* Conversion operator. Handle it right here.
1306 <operator> ::= cv <type> */
1308 if (decl_is_template_id (decl
, NULL
))
1311 fn_type
= get_mostly_instantiated_function_type (decl
);
1312 type
= TREE_TYPE (fn_type
);
1314 else if (FNDECL_USED_AUTO (decl
))
1315 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1316 ->x_auto_return_pattern
);
1318 type
= DECL_CONV_FN_TYPE (decl
);
1319 write_conversion_operator_name (type
);
1321 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1323 const char *mangled_name
1324 = (ovl_op_info
[DECL_ASSIGNMENT_OPERATOR_P (decl
)]
1325 [DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
)].mangled_name
);
1326 write_string (mangled_name
);
1328 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1329 write_literal_operator_name (DECL_NAME (decl
));
1336 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1337 && DECL_NAMESPACE_SCOPE_P (decl
)
1338 && decl_linkage (decl
) == lk_internal
)
1340 MANGLE_TRACE_TREE ("local-source-name", decl
);
1342 write_source_name (DECL_NAME (decl
));
1343 /* The default discriminator is 1, and that's all we ever use,
1344 so there's no code to output one here. */
1348 tree type
= TREE_TYPE (decl
);
1350 if (TREE_CODE (decl
) == TYPE_DECL
1351 && TYPE_UNNAMED_P (type
))
1352 write_unnamed_type_name (type
);
1353 else if (TREE_CODE (decl
) == TYPE_DECL
1354 && LAMBDA_TYPE_P (type
))
1355 write_closure_type_name (type
);
1357 write_source_name (DECL_NAME (decl
));
1360 /* We use the ABI tags from the primary class template, ignoring tags on any
1361 specializations. This is necessary because C++ doesn't require a
1362 specialization to be declared before it is used unless the use requires a
1363 complete type, but we need to get the tags right on incomplete types as
1365 if (tree tmpl
= most_general_template (decl
))
1367 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1368 if (res
== NULL_TREE
)
1369 /* UNBOUND_CLASS_TEMPLATE. */;
1370 else if (DECL_DECLARES_TYPE_P (decl
))
1372 else if (any_abi_below (11))
1374 /* ABI v10 implicit tags on the template. */
1375 tree mtags
= missing_abi_tags (res
);
1376 /* Explicit tags on the template. */
1377 tree ttags
= get_abi_tags (res
);
1378 /* Tags on the instantiation. */
1379 tree dtags
= get_abi_tags (decl
);
1381 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1382 G
.need_abi_warning
= 1;
1384 /* Add the v10 tags to the explicit tags now. */
1385 mtags
= chainon (mtags
, ttags
);
1387 if (!G
.need_abi_warning
1388 && abi_warn_or_compat_version_crosses (11)
1389 && !equal_abi_tags (dtags
, mtags
))
1390 G
.need_abi_warning
= 1;
1392 if (!abi_version_at_least (10))
1393 /* In abi <10, we only got the explicit tags. */
1395 else if (flag_abi_version
== 10)
1397 /* In ABI 10, we want explict and implicit tags. */
1398 write_abi_tags (mtags
);
1404 tree tags
= get_abi_tags (decl
);
1405 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1406 && any_abi_below (11))
1407 if (tree mtags
= missing_abi_tags (decl
))
1409 if (abi_warn_or_compat_version_crosses (11))
1410 G
.need_abi_warning
= true;
1411 if (!abi_version_at_least (11))
1412 tags
= chainon (mtags
, tags
);
1414 write_abi_tags (tags
);
1417 /* Write the unqualified-name for a conversion operator to TYPE. */
1420 write_conversion_operator_name (const tree type
)
1422 write_string ("cv");
1426 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1428 <source-name> ::= </length/ number> <identifier> */
1431 write_source_name (tree identifier
)
1433 MANGLE_TRACE_TREE ("source-name", identifier
);
1435 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1436 write_identifier (IDENTIFIER_POINTER (identifier
));
1439 /* Compare two TREE_STRINGs like strcmp. */
1442 tree_string_cmp (const void *p1
, const void *p2
)
1446 tree s1
= *(const tree
*)p1
;
1447 tree s2
= *(const tree
*)p2
;
1448 return strcmp (TREE_STRING_POINTER (s1
),
1449 TREE_STRING_POINTER (s2
));
1452 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1454 static vec
<tree
, va_gc
> *
1455 sorted_abi_tags (tree tags
)
1457 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1459 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1461 if (ABI_TAG_IMPLICIT (t
))
1463 tree str
= TREE_VALUE (t
);
1464 vec_safe_push (vec
, str
);
1467 vec
->qsort (tree_string_cmp
);
1472 /* ID is the name of a function or type with abi_tags attribute TAGS.
1473 Write out the name, suitably decorated. */
1476 write_abi_tags (tree tags
)
1478 if (tags
== NULL_TREE
)
1481 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1483 unsigned i
; tree str
;
1484 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1487 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1488 write_identifier (TREE_STRING_POINTER (str
));
1491 release_tree_vector (vec
);
1494 /* Simplified unique_ptr clone to release a tree vec on exit. */
1496 struct releasing_vec
1498 typedef vec
<tree
, va_gc
> vec_t
;
1500 releasing_vec (vec_t
*v
): v(v
) { }
1501 releasing_vec (): v(make_tree_vector ()) { }
1503 vec_t
&operator* () const { return *v
; }
1504 vec_t
*operator-> () const { return v
; }
1505 vec_t
*get () const { return v
; }
1506 operator vec_t
*() const { return v
; }
1507 tree
& operator[] (unsigned i
) const { return (*v
)[i
]; }
1509 ~releasing_vec() { release_tree_vector (v
); }
1514 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1517 equal_abi_tags (tree t1
, tree t2
)
1519 releasing_vec v1
= sorted_abi_tags (t1
);
1520 releasing_vec v2
= sorted_abi_tags (t2
);
1522 unsigned len1
= v1
->length();
1523 if (len1
!= v2
->length())
1525 for (unsigned i
= 0; i
< len1
; ++i
)
1526 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1531 /* Write a user-defined literal operator.
1532 ::= li <source-name> # "" <source-name>
1533 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1536 write_literal_operator_name (tree identifier
)
1538 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1539 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1540 write_unsigned_number (strlen (suffix
));
1541 write_identifier (suffix
);
1544 /* Encode 0 as _, and 1+ as n-1_. */
1547 write_compact_number (int num
)
1550 write_unsigned_number (num
- 1);
1554 /* Return how many unnamed types precede TYPE in its enclosing class. */
1557 nested_anon_class_index (tree type
)
1560 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1561 for (; member
; member
= DECL_CHAIN (member
))
1562 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1564 tree memtype
= TREE_TYPE (member
);
1565 if (memtype
== type
)
1567 else if (TYPE_UNNAMED_P (memtype
))
1574 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1577 write_unnamed_type_name (const tree type
)
1580 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1582 if (TYPE_FUNCTION_SCOPE_P (type
))
1583 discriminator
= local_class_index (type
);
1584 else if (TYPE_CLASS_SCOPE_P (type
))
1585 discriminator
= nested_anon_class_index (type
);
1588 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1589 /* Just use the old mangling at namespace scope. */
1590 write_source_name (TYPE_IDENTIFIER (type
));
1594 write_string ("Ut");
1595 write_compact_number (discriminator
);
1598 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1599 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1602 write_closure_type_name (const tree type
)
1604 tree fn
= lambda_function (type
);
1605 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1606 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1608 MANGLE_TRACE_TREE ("closure-type-name", type
);
1610 write_string ("Ul");
1611 write_method_parms (parms
, /*method_p=*/1, fn
);
1613 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1616 /* Convert NUMBER to ascii using base BASE and generating at least
1617 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1618 into which to store the characters. Returns the number of
1619 characters generated (these will be laid out in advance of where
1623 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1624 char *buffer
, const unsigned int min_digits
)
1626 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1627 unsigned digits
= 0;
1631 unsigned HOST_WIDE_INT d
= number
/ base
;
1633 *--buffer
= base_digits
[number
- d
* base
];
1637 while (digits
< min_digits
)
1639 *--buffer
= base_digits
[0];
1645 /* Non-terminal <number>.
1647 <number> ::= [n] </decimal integer/> */
1650 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1651 const unsigned int base
)
1653 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1656 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1659 number
= -((HOST_WIDE_INT
) number
);
1661 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1662 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1665 /* Write out an integral CST in decimal. Most numbers are small, and
1666 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1667 bigger than that, which we must deal with. */
1670 write_integer_cst (const tree cst
)
1672 int sign
= tree_int_cst_sgn (cst
);
1673 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1674 if (!wi::fits_uhwi_p (abs_value
))
1676 /* A bignum. We do this in chunks, each of which fits in a
1678 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1679 unsigned HOST_WIDE_INT chunk
;
1680 unsigned chunk_digits
;
1681 char *ptr
= buffer
+ sizeof (buffer
);
1686 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1691 if (sizeof (HOST_WIDE_INT
) >= 8)
1693 /* It is at least 64 bits, so 10^18 is representable. */
1698 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1699 base
= build_int_cstu (type
, chunk
);
1700 n
= wide_int_to_tree (type
, wi::to_wide (cst
));
1705 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1709 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1710 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1713 done
= integer_zerop (d
);
1714 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1715 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1716 done
? 1 : chunk_digits
);
1722 write_chars (ptr
, count
);
1729 write_unsigned_number (abs_value
.to_uhwi ());
1733 /* Write out a floating-point literal.
1735 "Floating-point literals are encoded using the bit pattern of the
1736 target processor's internal representation of that number, as a
1737 fixed-length lowercase hexadecimal string, high-order bytes first
1738 (even if the target processor would store low-order bytes first).
1739 The "n" prefix is not used for floating-point literals; the sign
1740 bit is encoded with the rest of the number.
1742 Here are some examples, assuming the IEEE standard representation
1743 for floating point numbers. (Spaces are for readability, not
1744 part of the encoding.)
1747 -1.0f Lf bf80 0000 E
1748 1.17549435e-38f Lf 0080 0000 E
1749 1.40129846e-45f Lf 0000 0001 E
1750 0.0f Lf 0000 0000 E"
1752 Caller is responsible for the Lx and the E. */
1754 write_real_cst (const tree value
)
1756 long target_real
[4]; /* largest supported float */
1757 /* Buffer for eight hex digits in a 32-bit number but big enough
1758 even for 64-bit long to avoid warnings. */
1762 tree type
= TREE_TYPE (value
);
1763 int words
= GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type
)) / 32;
1765 real_to_target (target_real
, &TREE_REAL_CST (value
),
1768 /* The value in target_real is in the target word order,
1769 so we must write it out backward if that happens to be
1770 little-endian. write_number cannot be used, it will
1771 produce uppercase. */
1772 if (FLOAT_WORDS_BIG_ENDIAN
)
1773 i
= 0, limit
= words
, dir
= 1;
1775 i
= words
- 1, limit
= -1, dir
= -1;
1777 for (; i
!= limit
; i
+= dir
)
1779 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1780 write_chars (buffer
, 8);
1784 /* Non-terminal <identifier>.
1786 <identifier> ::= </unqualified source code identifier> */
1789 write_identifier (const char *identifier
)
1791 MANGLE_TRACE ("identifier", identifier
);
1792 write_string (identifier
);
1795 /* Handle constructor productions of non-terminal <special-name>.
1796 CTOR is a constructor FUNCTION_DECL.
1798 <special-name> ::= C1 # complete object constructor
1799 ::= C2 # base object constructor
1800 ::= C3 # complete object allocating constructor
1802 Currently, allocating constructors are never used. */
1805 write_special_name_constructor (const tree ctor
)
1808 bool new_inh
= (flag_new_inheriting_ctors
1809 && DECL_INHERITED_CTOR (ctor
));
1812 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1814 /* This is the old-style "[unified]" constructor.
1815 In some cases, we may emit this function and call
1816 it from the clones in order to share code and save space. */
1817 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1821 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1825 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1828 /* Handle destructor productions of non-terminal <special-name>.
1829 DTOR is a destructor FUNCTION_DECL.
1831 <special-name> ::= D0 # deleting (in-charge) destructor
1832 ::= D1 # complete object (in-charge) destructor
1833 ::= D2 # base object (not-in-charge) destructor */
1836 write_special_name_destructor (const tree dtor
)
1838 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1839 write_string ("D0");
1840 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1841 write_string ("D2");
1842 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1843 /* This is the old-style "[unified]" destructor.
1844 In some cases, we may emit this function and call
1845 it from the clones in order to share code and save space. */
1846 write_string ("D4");
1849 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1850 write_string ("D1");
1854 /* Scan the vector of local classes and return how many others with the
1855 same name (or same no name) and context precede ENTITY. */
1858 local_class_index (tree entity
)
1860 int ix
, discriminator
= 0;
1861 tree name
= (TYPE_UNNAMED_P (entity
) ? NULL_TREE
1862 : TYPE_IDENTIFIER (entity
));
1863 tree ctx
= TYPE_CONTEXT (entity
);
1864 for (ix
= 0; ; ix
++)
1866 tree type
= (*local_classes
)[ix
];
1868 return discriminator
;
1869 if (TYPE_CONTEXT (type
) == ctx
1870 && (name
? TYPE_IDENTIFIER (type
) == name
1871 : TYPE_UNNAMED_P (type
)))
1877 /* Return the discriminator for ENTITY appearing inside
1878 FUNCTION. The discriminator is the lexical ordinal of VAR among
1879 entities with the same name in the same FUNCTION. */
1882 discriminator_for_local_entity (tree entity
)
1884 if (DECL_DISCRIMINATOR_P (entity
))
1886 if (DECL_DISCRIMINATOR_SET_P (entity
))
1887 return DECL_DISCRIMINATOR (entity
);
1889 /* The first entity with a particular name doesn't get
1890 DECL_DISCRIMINATOR set up. */
1893 else if (TREE_CODE (entity
) == TYPE_DECL
)
1895 /* Scan the list of local classes. */
1896 entity
= TREE_TYPE (entity
);
1898 /* Lambdas and unnamed types have their own discriminators. */
1899 if (LAMBDA_TYPE_P (entity
) || TYPE_UNNAMED_P (entity
))
1902 return local_class_index (entity
);
1908 /* Return the discriminator for STRING, a string literal used inside
1909 FUNCTION. The discriminator is the lexical ordinal of STRING among
1910 string literals used in FUNCTION. */
1913 discriminator_for_string_literal (tree
/*function*/,
1916 /* For now, we don't discriminate amongst string literals. */
1920 /* <discriminator> := _ <number> # when number < 10
1921 := __ <number> _ # when number >= 10
1923 The discriminator is used only for the second and later occurrences
1924 of the same name within a single function. In this case <number> is
1925 n - 2, if this is the nth occurrence, in lexical order. */
1928 write_discriminator (const int discriminator
)
1930 /* If discriminator is zero, don't write anything. Otherwise... */
1931 if (discriminator
> 0)
1934 if (discriminator
- 1 >= 10)
1936 if (abi_warn_or_compat_version_crosses (11))
1937 G
.need_abi_warning
= 1;
1938 if (abi_version_at_least (11))
1941 write_unsigned_number (discriminator
- 1);
1942 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
1947 /* Mangle the name of a function-scope entity. FUNCTION is the
1948 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1949 default argument scope. ENTITY is the decl for the entity itself.
1950 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1951 either ENTITY itself or an enclosing scope of ENTITY.
1953 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1954 := Z <function encoding> E s [<discriminator>]
1955 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1958 write_local_name (tree function
, const tree local_entity
,
1961 tree parm
= NULL_TREE
;
1963 MANGLE_TRACE_TREE ("local-name", entity
);
1965 if (TREE_CODE (function
) == PARM_DECL
)
1968 function
= DECL_CONTEXT (parm
);
1972 write_encoding (function
);
1975 /* For this purpose, parameters are numbered from right-to-left. */
1980 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1988 write_compact_number (i
- 1);
1991 if (TREE_CODE (entity
) == STRING_CST
)
1994 write_discriminator (discriminator_for_string_literal (function
,
1999 /* Now the <entity name>. Let write_name know its being called
2000 from <local-name>, so it doesn't try to process the enclosing
2001 function scope again. */
2002 write_name (entity
, /*ignore_local_scope=*/1);
2003 write_discriminator (discriminator_for_local_entity (local_entity
));
2007 /* Non-terminals <type> and <CV-qualifier>.
2009 <type> ::= <builtin-type>
2011 ::= <class-enum-type>
2013 ::= <pointer-to-member-type>
2014 ::= <template-param>
2017 ::= P <type> # pointer-to
2018 ::= R <type> # reference-to
2019 ::= C <type> # complex pair (C 2000)
2020 ::= G <type> # imaginary (C 2000) [not supported]
2021 ::= U <source-name> <type> # vendor extended type qualifier
2025 <type> ::= RR <type> # rvalue reference-to
2026 <type> ::= Dt <expression> # decltype of an id-expression or
2027 # class member access
2028 <type> ::= DT <expression> # decltype of an expression
2029 <type> ::= Dn # decltype of nullptr
2031 TYPE is a type node. */
2034 write_type (tree type
)
2036 /* This gets set to nonzero if TYPE turns out to be a (possibly
2037 CV-qualified) builtin type. */
2038 int is_builtin_type
= 0;
2040 MANGLE_TRACE_TREE ("type", type
);
2042 if (type
== error_mark_node
)
2045 type
= canonicalize_for_substitution (type
);
2046 if (find_substitution (type
))
2050 if (write_CV_qualifiers_for_type (type
) > 0)
2051 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2052 mangle the unqualified type. The recursive call is needed here
2053 since both the qualified and unqualified types are substitution
2056 tree t
= TYPE_MAIN_VARIANT (type
);
2057 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2059 tree attrs
= NULL_TREE
;
2060 if (tx_safe_fn_type_p (type
))
2061 attrs
= tree_cons (get_identifier ("transaction_safe"),
2063 t
= cp_build_type_attribute_variant (t
, attrs
);
2065 gcc_assert (t
!= type
);
2066 if (TREE_CODE (t
) == FUNCTION_TYPE
2067 || TREE_CODE (t
) == METHOD_TYPE
)
2069 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2070 if (flag_noexcept_type
)
2072 tree r
= TYPE_RAISES_EXCEPTIONS (type
);
2073 t
= build_exception_variant (t
, r
);
2075 if (abi_version_at_least (8)
2076 || type
== TYPE_MAIN_VARIANT (type
))
2077 /* Avoid adding the unqualified function type as a substitution. */
2078 write_function_type (t
);
2081 if (abi_warn_or_compat_version_crosses (8))
2082 G
.need_abi_warning
= 1;
2087 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2088 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2089 so that the cv-qualification of the element type is available
2090 in write_array_type. */
2091 write_array_type (type
);
2094 tree type_orig
= type
;
2096 /* See through any typedefs. */
2097 type
= TYPE_MAIN_VARIANT (type
);
2098 if (TREE_CODE (type
) == FUNCTION_TYPE
2099 || TREE_CODE (type
) == METHOD_TYPE
)
2101 type
= build_ref_qualified_type (type
, type_memfn_rqual (type_orig
));
2102 type
= build_exception_variant (type
,
2103 TYPE_RAISES_EXCEPTIONS (type_orig
));
2106 /* According to the C++ ABI, some library classes are passed the
2107 same as the scalar type of their single member and use the same
2109 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2110 type
= TREE_TYPE (first_field (type
));
2112 if (TYPE_PTRDATAMEM_P (type
))
2113 write_pointer_to_member_type (type
);
2116 /* Handle any target-specific fundamental types. */
2117 const char *target_mangling
2118 = targetm
.mangle_type (type_orig
);
2120 if (target_mangling
)
2122 write_string (target_mangling
);
2123 /* Add substitutions for types other than fundamental
2125 if (!VOID_TYPE_P (type
)
2126 && TREE_CODE (type
) != INTEGER_TYPE
2127 && TREE_CODE (type
) != REAL_TYPE
2128 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2129 add_substitution (type
);
2133 switch (TREE_CODE (type
))
2137 case INTEGER_TYPE
: /* Includes wchar_t. */
2139 case FIXED_POINT_TYPE
:
2141 /* If this is a typedef, TYPE may not be one of
2142 the standard builtin type nodes, but an alias of one. Use
2143 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2144 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2151 write_type (TREE_TYPE (type
));
2156 write_function_type (type
);
2162 /* A pointer-to-member function is represented as a special
2163 RECORD_TYPE, so check for this first. */
2164 if (TYPE_PTRMEMFUNC_P (type
))
2165 write_pointer_to_member_type (type
);
2167 write_class_enum_type (type
);
2171 case UNBOUND_CLASS_TEMPLATE
:
2172 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2173 ordinary nested names. */
2174 write_nested_name (TYPE_STUB_DECL (type
));
2178 case REFERENCE_TYPE
:
2179 if (TYPE_PTR_P (type
))
2181 else if (TYPE_REF_IS_RVALUE (type
))
2186 tree target
= TREE_TYPE (type
);
2187 /* Attribute const/noreturn are not reflected in mangling.
2188 We strip them here rather than at a lower level because
2189 a typedef or template argument can have function type
2190 with function-cv-quals (that use the same representation),
2191 but you can't have a pointer/reference to such a type. */
2192 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2194 if (abi_warn_or_compat_version_crosses (5)
2195 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2196 G
.need_abi_warning
= 1;
2197 if (abi_version_at_least (5))
2198 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2200 write_type (target
);
2204 case TEMPLATE_TYPE_PARM
:
2207 if (AUTO_IS_DECLTYPE (type
))
2208 write_identifier ("Dc");
2210 write_identifier ("Da");
2215 case TEMPLATE_PARM_INDEX
:
2216 write_template_param (type
);
2219 case TEMPLATE_TEMPLATE_PARM
:
2220 write_template_template_param (type
);
2223 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2224 write_template_template_param (type
);
2226 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2230 if (abi_version_at_least (4))
2232 write_string ("Dv");
2233 /* Non-constant vector size would be encoded with
2234 _ expression, but we don't support that yet. */
2235 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2239 write_string ("U8__vector");
2240 if (abi_warn_or_compat_version_crosses (4))
2241 G
.need_abi_warning
= 1;
2242 write_type (TREE_TYPE (type
));
2245 case TYPE_PACK_EXPANSION
:
2246 write_string ("Dp");
2247 write_type (PACK_EXPANSION_PATTERN (type
));
2251 /* These shouldn't make it into mangling. */
2252 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2253 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2255 /* In ABI <5, we stripped decltype of a plain decl. */
2256 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2258 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2259 tree etype
= NULL_TREE
;
2260 switch (TREE_CODE (expr
))
2267 case TEMPLATE_PARM_INDEX
:
2268 etype
= TREE_TYPE (expr
);
2275 if (etype
&& !type_uses_auto (etype
))
2277 if (abi_warn_or_compat_version_crosses (5))
2278 G
.need_abi_warning
= 1;
2279 if (!abi_version_at_least (5))
2288 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2292 ++cp_unevaluated_operand
;
2293 write_expression (DECLTYPE_TYPE_EXPR (type
));
2294 --cp_unevaluated_operand
;
2299 write_string ("Dn");
2300 if (abi_version_at_least (7))
2302 if (abi_warn_or_compat_version_crosses (7))
2303 G
.need_abi_warning
= 1;
2307 sorry ("mangling typeof, use decltype instead");
2310 case UNDERLYING_TYPE
:
2311 sorry ("mangling __underlying_type");
2323 /* Types other than builtin types are substitution candidates. */
2324 if (!is_builtin_type
)
2325 add_substitution (type
);
2328 /* qsort callback for sorting a vector of attribute entries. */
2331 attr_strcmp (const void *p1
, const void *p2
)
2333 tree a1
= *(const tree
*)p1
;
2334 tree a2
= *(const tree
*)p2
;
2336 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2337 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2339 return strcmp (as1
->name
, as2
->name
);
2342 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2343 CV-qualifiers written for TYPE.
2345 <CV-qualifiers> ::= [r] [V] [K] */
2348 write_CV_qualifiers_for_type (const tree type
)
2350 int num_qualifiers
= 0;
2352 /* The order is specified by:
2354 "In cases where multiple order-insensitive qualifiers are
2355 present, they should be ordered 'K' (closest to the base type),
2356 'V', 'r', and 'U' (farthest from the base type) ..." */
2358 /* Mangle attributes that affect type identity as extended qualifiers.
2360 We don't do this with classes and enums because their attributes
2361 are part of their definitions, not something added on. */
2363 if (!OVERLOAD_TYPE_P (type
))
2366 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2368 tree name
= get_attribute_name (a
);
2369 const attribute_spec
*as
= lookup_attribute_spec (name
);
2370 if (as
&& as
->affects_type_identity
2371 && !is_attribute_p ("transaction_safe", name
)
2372 && !is_attribute_p ("abi_tag", name
))
2375 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2376 G
.need_abi_warning
= true;
2377 if (abi_version_at_least (10))
2379 vec
.qsort (attr_strcmp
);
2380 while (!vec
.is_empty())
2383 const attribute_spec
*as
2384 = lookup_attribute_spec (get_attribute_name (a
));
2387 write_unsigned_number (strlen (as
->name
));
2388 write_string (as
->name
);
2392 for (tree args
= TREE_VALUE (a
); args
;
2393 args
= TREE_CHAIN (args
))
2395 tree arg
= TREE_VALUE (args
);
2396 write_template_arg (arg
);
2406 /* Note that we do not use cp_type_quals below; given "const
2407 int[3]", the "const" is emitted with the "int", not with the
2409 cp_cv_quals quals
= TYPE_QUALS (type
);
2411 if (quals
& TYPE_QUAL_RESTRICT
)
2416 if (quals
& TYPE_QUAL_VOLATILE
)
2421 if (quals
& TYPE_QUAL_CONST
)
2427 return num_qualifiers
;
2430 /* Non-terminal <builtin-type>.
2432 <builtin-type> ::= v # void
2437 ::= h # unsigned char
2439 ::= t # unsigned short
2441 ::= j # unsigned int
2443 ::= m # unsigned long
2444 ::= x # long long, __int64
2445 ::= y # unsigned long long, __int64
2447 ::= o # unsigned __int128
2450 ::= e # long double, __float80
2451 ::= g # __float128 [not supported]
2452 ::= u <source-name> # vendor extended type */
2455 write_builtin_type (tree type
)
2457 if (TYPE_CANONICAL (type
))
2458 type
= TYPE_CANONICAL (type
);
2460 switch (TREE_CODE (type
))
2471 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2472 isn't in integer_type_nodes. */
2473 if (type
== wchar_type_node
)
2475 else if (type
== char16_type_node
)
2476 write_string ("Ds");
2477 else if (type
== char32_type_node
)
2478 write_string ("Di");
2482 /* Assume TYPE is one of the shared integer type nodes. Find
2483 it in the array of these nodes. */
2485 for (itk
= 0; itk
< itk_none
; ++itk
)
2486 if (integer_types
[itk
] != NULL_TREE
2487 && integer_type_codes
[itk
] != '\0'
2488 && type
== integer_types
[itk
])
2490 /* Print the corresponding single-letter code. */
2491 write_char (integer_type_codes
[itk
]);
2495 if (itk
== itk_none
)
2497 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2498 TYPE_UNSIGNED (type
));
2505 if (TYPE_PRECISION (type
) == 128)
2506 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2509 /* Allow for cases where TYPE is not one of the shared
2510 integer type nodes and write a "vendor extended builtin
2511 type" with a name the form intN or uintN, respectively.
2512 Situations like this can happen if you have an
2513 __attribute__((__mode__(__SI__))) type and use exotic
2514 switches like '-mint8' on AVR. Of course, this is
2515 undefined by the C++ ABI (and '-mint8' is not even
2516 Standard C conforming), but when using such special
2517 options you're pretty much in nowhere land anyway. */
2519 char prec
[11]; /* up to ten digits for an unsigned */
2521 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2522 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2523 write_char ('u'); /* "vendor extended builtin type" */
2524 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2525 write_string (prefix
);
2526 write_string (prec
);
2533 if (type
== float_type_node
)
2535 else if (type
== double_type_node
)
2537 else if (type
== long_double_type_node
)
2539 else if (type
== dfloat32_type_node
)
2540 write_string ("Df");
2541 else if (type
== dfloat64_type_node
)
2542 write_string ("Dd");
2543 else if (type
== dfloat128_type_node
)
2544 write_string ("De");
2549 case FIXED_POINT_TYPE
:
2550 write_string ("DF");
2551 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2552 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2553 if (type
== fract_type_node
2554 || type
== sat_fract_type_node
2555 || type
== accum_type_node
2556 || type
== sat_accum_type_node
)
2558 else if (type
== unsigned_fract_type_node
2559 || type
== sat_unsigned_fract_type_node
2560 || type
== unsigned_accum_type_node
2561 || type
== sat_unsigned_accum_type_node
)
2563 else if (type
== short_fract_type_node
2564 || type
== sat_short_fract_type_node
2565 || type
== short_accum_type_node
2566 || type
== sat_short_accum_type_node
)
2568 else if (type
== unsigned_short_fract_type_node
2569 || type
== sat_unsigned_short_fract_type_node
2570 || type
== unsigned_short_accum_type_node
2571 || type
== sat_unsigned_short_accum_type_node
)
2573 else if (type
== long_fract_type_node
2574 || type
== sat_long_fract_type_node
2575 || type
== long_accum_type_node
2576 || type
== sat_long_accum_type_node
)
2578 else if (type
== unsigned_long_fract_type_node
2579 || type
== sat_unsigned_long_fract_type_node
2580 || type
== unsigned_long_accum_type_node
2581 || type
== sat_unsigned_long_accum_type_node
)
2583 else if (type
== long_long_fract_type_node
2584 || type
== sat_long_long_fract_type_node
2585 || type
== long_long_accum_type_node
2586 || type
== sat_long_long_accum_type_node
)
2588 else if (type
== unsigned_long_long_fract_type_node
2589 || type
== sat_unsigned_long_long_fract_type_node
2590 || type
== unsigned_long_long_accum_type_node
2591 || type
== sat_unsigned_long_long_accum_type_node
)
2594 sorry ("mangling unknown fixed point type");
2595 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2596 if (TYPE_SATURATING (type
))
2607 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2608 METHOD_TYPE. The return type is mangled before the parameter
2611 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2614 write_function_type (const tree type
)
2616 MANGLE_TRACE_TREE ("function-type", type
);
2618 /* For a pointer to member function, the function type may have
2619 cv-qualifiers, indicating the quals for the artificial 'this'
2621 if (TREE_CODE (type
) == METHOD_TYPE
)
2623 /* The first parameter must be a POINTER_TYPE pointing to the
2624 `this' parameter. */
2625 tree this_type
= class_of_this_parm (type
);
2626 write_CV_qualifiers_for_type (this_type
);
2629 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2631 if (tx_safe_fn_type_p (type
))
2632 write_string ("Dx");
2635 /* We don't track whether or not a type is `extern "C"'. Note that
2636 you can have an `extern "C"' function that does not have
2637 `extern "C"' type, and vice versa:
2639 extern "C" typedef void function_t();
2640 function_t f; // f has C++ linkage, but its type is
2643 typedef void function_t();
2644 extern "C" function_t f; // Vice versa.
2647 write_bare_function_type (type
, /*include_return_type_p=*/1,
2649 if (FUNCTION_REF_QUALIFIED (type
))
2651 if (FUNCTION_RVALUE_QUALIFIED (type
))
2659 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2660 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2661 is mangled before the parameter types. If non-NULL, DECL is
2662 FUNCTION_DECL for the function whose type is being emitted. */
2665 write_bare_function_type (const tree type
, const int include_return_type_p
,
2668 MANGLE_TRACE_TREE ("bare-function-type", type
);
2670 /* Mangle the return type, if requested. */
2671 if (include_return_type_p
)
2672 write_type (TREE_TYPE (type
));
2674 /* Now mangle the types of the arguments. */
2676 write_method_parms (TYPE_ARG_TYPES (type
),
2677 TREE_CODE (type
) == METHOD_TYPE
,
2682 /* Write the mangled representation of a method parameter list of
2683 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2684 considered a non-static method, and the this parameter is omitted.
2685 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2686 parameters are being emitted. */
2689 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2691 tree first_parm_type
;
2692 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2694 /* Assume this parameter type list is variable-length. If it ends
2695 with a void type, then it's not. */
2698 /* If this is a member function, skip the first arg, which is the
2700 "Member functions do not encode the type of their implicit this
2703 Similarly, there's no need to mangle artificial parameters, like
2704 the VTT parameters for constructors and destructors. */
2707 parm_types
= TREE_CHAIN (parm_types
);
2708 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2710 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2712 parm_types
= TREE_CHAIN (parm_types
);
2713 parm_decl
= DECL_CHAIN (parm_decl
);
2716 if (decl
&& ctor_omit_inherited_parms (decl
))
2717 /* Bring back parameters omitted from an inherited ctor. */
2718 parm_types
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl
));
2721 for (first_parm_type
= parm_types
;
2723 parm_types
= TREE_CHAIN (parm_types
))
2725 tree parm
= TREE_VALUE (parm_types
);
2726 if (parm
== void_type_node
)
2728 /* "Empty parameter lists, whether declared as () or
2729 conventionally as (void), are encoded with a void parameter
2731 if (parm_types
== first_parm_type
)
2733 /* If the parm list is terminated with a void type, it's
2736 /* A void type better be the last one. */
2737 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2744 /* <builtin-type> ::= z # ellipsis */
2748 /* <class-enum-type> ::= <name> */
2751 write_class_enum_type (const tree type
)
2753 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2756 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2759 <template-args> ::= I <template-arg>* E */
2762 write_template_args (tree args
)
2767 MANGLE_TRACE_TREE ("template-args", args
);
2772 length
= TREE_VEC_LENGTH (args
);
2774 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2776 /* We have nested template args. We want the innermost template
2778 args
= TREE_VEC_ELT (args
, length
- 1);
2779 length
= TREE_VEC_LENGTH (args
);
2781 for (i
= 0; i
< length
; ++i
)
2782 write_template_arg (TREE_VEC_ELT (args
, i
));
2789 <unqualified-name> <template-args>
2790 part of SCOPE_REF or COMPONENT_REF mangling. */
2793 write_member_name (tree member
)
2795 if (identifier_p (member
))
2797 if (abi_version_at_least (11) && IDENTIFIER_ANY_OP_P (member
))
2799 write_string ("on");
2800 if (abi_warn_or_compat_version_crosses (11))
2801 G
.need_abi_warning
= 1;
2803 write_unqualified_id (member
);
2805 else if (DECL_P (member
))
2806 write_unqualified_name (member
);
2807 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2809 tree name
= TREE_OPERAND (member
, 0);
2810 name
= OVL_FIRST (name
);
2811 write_member_name (name
);
2812 write_template_args (TREE_OPERAND (member
, 1));
2815 write_expression (member
);
2818 /* <expression> ::= <unary operator-name> <expression>
2819 ::= <binary operator-name> <expression> <expression>
2822 <expr-primary> ::= <template-param>
2823 ::= L <type> <value number> E # literal
2824 ::= L <mangled-name> E # external name
2825 ::= st <type> # sizeof
2826 ::= sr <type> <unqualified-name> # dependent name
2827 ::= sr <type> <unqualified-name> <template-args> */
2830 write_expression (tree expr
)
2832 enum tree_code code
= TREE_CODE (expr
);
2834 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2835 argument is converted (via qualification conversions) to another type. */
2836 while (CONVERT_EXPR_CODE_P (code
)
2837 /* Parentheses aren't mangled. */
2838 || code
== PAREN_EXPR
2839 || code
== NON_LVALUE_EXPR
)
2841 expr
= TREE_OPERAND (expr
, 0);
2842 code
= TREE_CODE (expr
);
2845 if (code
== BASELINK
2846 && (!type_unknown_p (expr
)
2847 || !BASELINK_QUALIFIED_P (expr
)))
2849 expr
= BASELINK_FUNCTIONS (expr
);
2850 code
= TREE_CODE (expr
);
2853 /* Handle pointers-to-members by making them look like expression
2855 if (code
== PTRMEM_CST
)
2857 expr
= build_nt (ADDR_EXPR
,
2858 build_qualified_name (/*type=*/NULL_TREE
,
2859 PTRMEM_CST_CLASS (expr
),
2860 PTRMEM_CST_MEMBER (expr
),
2861 /*template_p=*/false));
2862 code
= TREE_CODE (expr
);
2865 /* Handle template parameters. */
2866 if (code
== TEMPLATE_TYPE_PARM
2867 || code
== TEMPLATE_TEMPLATE_PARM
2868 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2869 || code
== TEMPLATE_PARM_INDEX
)
2870 write_template_param (expr
);
2871 /* Handle literals. */
2872 else if (TREE_CODE_CLASS (code
) == tcc_constant
2873 || code
== CONST_DECL
)
2874 write_template_arg_literal (expr
);
2875 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2877 gcc_assert (id_equal (DECL_NAME (expr
), "this"));
2878 write_string ("fpT");
2880 else if (code
== PARM_DECL
)
2882 /* A function parameter used in a late-specified return type. */
2883 int index
= DECL_PARM_INDEX (expr
);
2884 int level
= DECL_PARM_LEVEL (expr
);
2885 int delta
= G
.parm_depth
- level
+ 1;
2886 gcc_assert (index
>= 1);
2890 if (abi_version_at_least (5))
2892 /* Let L be the number of function prototype scopes from the
2893 innermost one (in which the parameter reference occurs) up
2894 to (and including) the one containing the declaration of
2895 the referenced parameter. If the parameter declaration
2896 clause of the innermost function prototype scope has been
2897 completely seen, it is not counted (in that case -- which
2898 is perhaps the most common -- L can be zero). */
2900 write_unsigned_number (delta
- 1);
2902 if (abi_warn_or_compat_version_crosses (5))
2903 G
.need_abi_warning
= true;
2906 write_compact_number (index
- 1);
2908 else if (DECL_P (expr
))
2911 write_mangled_name (expr
, false);
2914 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2916 tree op
= TREE_OPERAND (expr
, 0);
2918 if (PACK_EXPANSION_P (op
))
2920 if (abi_warn_or_compat_version_crosses (11))
2921 G
.need_abi_warning
= true;
2922 if (abi_version_at_least (11))
2924 /* sZ rather than szDp. */
2925 write_string ("sZ");
2926 write_expression (PACK_EXPANSION_PATTERN (op
));
2931 if (SIZEOF_EXPR_TYPE_P (expr
))
2933 write_string ("st");
2934 write_type (TREE_TYPE (op
));
2936 else if (ARGUMENT_PACK_P (op
))
2938 tree args
= ARGUMENT_PACK_ARGS (op
);
2939 int length
= TREE_VEC_LENGTH (args
);
2940 if (abi_warn_or_compat_version_crosses (10))
2941 G
.need_abi_warning
= true;
2942 if (abi_version_at_least (10))
2944 /* sP <template-arg>* E # sizeof...(T), size of a captured
2945 template parameter pack from an alias template */
2946 write_string ("sP");
2947 for (int i
= 0; i
< length
; ++i
)
2948 write_template_arg (TREE_VEC_ELT (args
, i
));
2953 /* In GCC 5 we represented this sizeof wrong, with the effect
2954 that we mangled it as the last element of the pack. */
2955 tree arg
= TREE_VEC_ELT (args
, length
-1);
2958 write_string ("st");
2963 write_string ("sz");
2964 write_expression (arg
);
2968 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2970 write_string ("st");
2971 write_type (TREE_OPERAND (expr
, 0));
2976 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2977 && TYPE_P (TREE_OPERAND (expr
, 0)))
2979 write_string ("at");
2980 write_type (TREE_OPERAND (expr
, 0));
2982 else if (code
== SCOPE_REF
2983 || code
== BASELINK
)
2986 if (code
== SCOPE_REF
)
2988 scope
= TREE_OPERAND (expr
, 0);
2989 member
= TREE_OPERAND (expr
, 1);
2990 gcc_assert (!BASELINK_P (member
));
2994 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
2995 member
= BASELINK_FUNCTIONS (expr
);
2998 /* If the MEMBER is a real declaration, then the qualifying
2999 scope was not dependent. Ideally, we would not have a
3000 SCOPE_REF in those cases, but sometimes we do. If the second
3001 argument is a DECL, then the name must not have been
3003 if (DECL_P (member
))
3004 write_expression (member
);
3007 write_string ("sr");
3009 write_member_name (member
);
3012 else if (INDIRECT_REF_P (expr
)
3013 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3014 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
3016 write_expression (TREE_OPERAND (expr
, 0));
3018 else if (identifier_p (expr
))
3020 /* An operator name appearing as a dependent name needs to be
3021 specially marked to disambiguate between a use of the operator
3022 name and a use of the operator in an expression. */
3023 if (IDENTIFIER_ANY_OP_P (expr
))
3024 write_string ("on");
3025 write_unqualified_id (expr
);
3027 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3029 tree fn
= TREE_OPERAND (expr
, 0);
3031 if (IDENTIFIER_ANY_OP_P (fn
))
3032 write_string ("on");
3033 write_unqualified_id (fn
);
3034 write_template_args (TREE_OPERAND (expr
, 1));
3036 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3038 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3039 const char *name
= OVL_OP_INFO (true, subop
)->mangled_name
;
3041 write_string (name
);
3042 write_expression (TREE_OPERAND (expr
, 0));
3043 write_expression (TREE_OPERAND (expr
, 2));
3045 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3047 /* ::= [gs] nw <expression>* _ <type> E
3048 ::= [gs] nw <expression>* _ <type> <initializer>
3049 ::= [gs] na <expression>* _ <type> E
3050 ::= [gs] na <expression>* _ <type> <initializer>
3051 <initializer> ::= pi <expression>* E */
3052 tree placement
= TREE_OPERAND (expr
, 0);
3053 tree type
= TREE_OPERAND (expr
, 1);
3054 tree nelts
= TREE_OPERAND (expr
, 2);
3055 tree init
= TREE_OPERAND (expr
, 3);
3058 gcc_assert (code
== NEW_EXPR
);
3059 if (TREE_OPERAND (expr
, 2))
3060 code
= VEC_NEW_EXPR
;
3062 if (NEW_EXPR_USE_GLOBAL (expr
))
3063 write_string ("gs");
3065 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3067 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3068 write_expression (TREE_VALUE (t
));
3075 ++processing_template_decl
;
3076 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3077 tf_warning_or_error
);
3078 type
= build_cplus_array_type (type
, domain
);
3079 --processing_template_decl
;
3083 if (init
&& TREE_CODE (init
) == TREE_LIST
3084 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3085 write_expression (TREE_VALUE (init
));
3089 write_string ("pi");
3090 if (init
&& init
!= void_node
)
3091 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3092 write_expression (TREE_VALUE (t
));
3096 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3098 gcc_assert (code
== DELETE_EXPR
);
3099 if (DELETE_EXPR_USE_VEC (expr
))
3100 code
= VEC_DELETE_EXPR
;
3102 if (DELETE_EXPR_USE_GLOBAL (expr
))
3103 write_string ("gs");
3105 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3107 write_expression (TREE_OPERAND (expr
, 0));
3109 else if (code
== THROW_EXPR
)
3111 tree op
= TREE_OPERAND (expr
, 0);
3114 write_string ("tw");
3115 write_expression (op
);
3118 write_string ("tr");
3120 else if (code
== CONSTRUCTOR
)
3122 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3123 unsigned i
; tree val
;
3125 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3126 write_string ("il");
3129 write_string ("tl");
3130 write_type (TREE_TYPE (expr
));
3132 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3133 write_expression (val
);
3136 else if (dependent_name (expr
))
3138 write_unqualified_id (dependent_name (expr
));
3146 /* When we bind a variable or function to a non-type template
3147 argument with reference type, we create an ADDR_EXPR to show
3148 the fact that the entity's address has been taken. But, we
3149 don't actually want to output a mangling code for the `&'. */
3150 if (TREE_CODE (expr
) == ADDR_EXPR
3152 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
3154 expr
= TREE_OPERAND (expr
, 0);
3157 write_expression (expr
);
3161 code
= TREE_CODE (expr
);
3164 if (code
== COMPONENT_REF
)
3166 tree ob
= TREE_OPERAND (expr
, 0);
3168 if (TREE_CODE (ob
) == ARROW_EXPR
)
3170 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3171 ob
= TREE_OPERAND (ob
, 0);
3172 write_expression (ob
);
3174 else if (!is_dummy_object (ob
))
3176 write_string ("dt");
3177 write_expression (ob
);
3179 /* else, for a non-static data member with no associated object (in
3180 unevaluated context), use the unresolved-name mangling. */
3182 write_member_name (TREE_OPERAND (expr
, 1));
3186 /* If it wasn't any of those, recursively expand the expression. */
3187 name
= OVL_OP_INFO (false, code
)->mangled_name
;
3189 /* We used to mangle const_cast and static_cast like a C cast. */
3190 if (code
== CONST_CAST_EXPR
3191 || code
== STATIC_CAST_EXPR
)
3193 if (abi_warn_or_compat_version_crosses (6))
3194 G
.need_abi_warning
= 1;
3195 if (!abi_version_at_least (6))
3196 name
= OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
;
3204 error ("use of built-in trait %qE in function signature; "
3205 "use library traits instead", expr
);
3209 sorry ("mangling %C", code
);
3215 write_string (name
);
3221 tree fn
= CALL_EXPR_FN (expr
);
3223 if (TREE_CODE (fn
) == ADDR_EXPR
)
3224 fn
= TREE_OPERAND (fn
, 0);
3226 /* Mangle a dependent name as the name, not whatever happens to
3227 be the first function in the overload set. */
3228 if ((TREE_CODE (fn
) == FUNCTION_DECL
3229 || TREE_CODE (fn
) == OVERLOAD
)
3230 && type_dependent_expression_p_push (expr
))
3233 write_expression (fn
);
3236 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3237 write_expression (CALL_EXPR_ARG (expr
, i
));
3242 write_type (TREE_TYPE (expr
));
3243 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3244 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3247 tree args
= TREE_OPERAND (expr
, 0);
3249 for (; args
; args
= TREE_CHAIN (args
))
3250 write_expression (TREE_VALUE (args
));
3255 case DYNAMIC_CAST_EXPR
:
3256 case REINTERPRET_CAST_EXPR
:
3257 case STATIC_CAST_EXPR
:
3258 case CONST_CAST_EXPR
:
3259 write_type (TREE_TYPE (expr
));
3260 write_expression (TREE_OPERAND (expr
, 0));
3263 case PREINCREMENT_EXPR
:
3264 case PREDECREMENT_EXPR
:
3265 if (abi_version_at_least (6))
3267 if (abi_warn_or_compat_version_crosses (6))
3268 G
.need_abi_warning
= 1;
3272 /* In the middle-end, some expressions have more operands than
3273 they do in templates (and mangling). */
3274 len
= cp_tree_operand_length (expr
);
3276 for (i
= 0; i
< len
; ++i
)
3278 tree operand
= TREE_OPERAND (expr
, i
);
3279 /* As a GNU extension, the middle operand of a
3280 conditional may be omitted. Since expression
3281 manglings are supposed to represent the input token
3282 stream, there's no good way to mangle such an
3283 expression without extending the C++ ABI. */
3284 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3286 error ("omitted middle operand to %<?:%> operand "
3287 "cannot be mangled");
3290 else if (FOLD_EXPR_P (expr
))
3292 /* The first 'operand' of a fold-expression is the operator
3293 that it folds over. */
3296 int fcode
= TREE_INT_CST_LOW (operand
);
3297 write_string (OVL_OP_INFO (false, fcode
)->mangled_name
);
3300 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3302 /* The order of operands of the binary left and right
3303 folds is the same, but we want to mangle them in
3304 lexical order, i.e. non-pack first. */
3306 operand
= FOLD_EXPR_INIT (expr
);
3308 operand
= FOLD_EXPR_PACK (expr
);
3310 if (PACK_EXPANSION_P (operand
))
3311 operand
= PACK_EXPANSION_PATTERN (operand
);
3313 write_expression (operand
);
3319 /* Literal subcase of non-terminal <template-arg>.
3321 "Literal arguments, e.g. "A<42L>", are encoded with their type
3322 and value. Negative integer values are preceded with "n"; for
3323 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3324 encoded as 0, true as 1." */
3327 write_template_arg_literal (const tree value
)
3330 write_type (TREE_TYPE (value
));
3332 /* Write a null member pointer value as (type)0, regardless of its
3333 real representation. */
3334 if (null_member_pointer_value_p (value
))
3335 write_integer_cst (integer_zero_node
);
3337 switch (TREE_CODE (value
))
3340 write_integer_cst (DECL_INITIAL (value
));
3344 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3345 || integer_zerop (value
) || integer_onep (value
));
3346 write_integer_cst (value
);
3350 write_real_cst (value
);
3354 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3355 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3357 write_integer_cst (TREE_REALPART (value
));
3359 write_integer_cst (TREE_IMAGPART (value
));
3361 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3362 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3364 write_real_cst (TREE_REALPART (value
));
3366 write_real_cst (TREE_IMAGPART (value
));
3373 sorry ("string literal in function template signature");
3383 /* Non-terminal <template-arg>.
3385 <template-arg> ::= <type> # type
3386 ::= L <type> </value/ number> E # literal
3387 ::= LZ <name> E # external name
3388 ::= X <expression> E # expression */
3391 write_template_arg (tree node
)
3393 enum tree_code code
= TREE_CODE (node
);
3395 MANGLE_TRACE_TREE ("template-arg", node
);
3397 /* A template template parameter's argument list contains TREE_LIST
3398 nodes of which the value field is the actual argument. */
3399 if (code
== TREE_LIST
)
3401 node
= TREE_VALUE (node
);
3402 /* If it's a decl, deal with its type instead. */
3405 node
= TREE_TYPE (node
);
3406 code
= TREE_CODE (node
);
3410 /* Strip a conversion added by convert_nontype_argument. */
3411 if (TREE_CODE (node
) == IMPLICIT_CONV_EXPR
)
3412 node
= TREE_OPERAND (node
, 0);
3413 if (REFERENCE_REF_P (node
))
3414 node
= TREE_OPERAND (node
, 0);
3415 if (TREE_CODE (node
) == NOP_EXPR
3416 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3418 /* Template parameters can be of reference type. To maintain
3419 internal consistency, such arguments use a conversion from
3420 address of object to reference type. */
3421 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3422 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3425 if (TREE_CODE (node
) == BASELINK
3426 && !type_unknown_p (node
))
3428 if (abi_version_at_least (6))
3429 node
= BASELINK_FUNCTIONS (node
);
3430 if (abi_warn_or_compat_version_crosses (6))
3431 /* We wrongly wrapped a class-scope function in X/E. */
3432 G
.need_abi_warning
= 1;
3435 if (ARGUMENT_PACK_P (node
))
3437 /* Expand the template argument pack. */
3438 tree args
= ARGUMENT_PACK_ARGS (node
);
3439 int i
, length
= TREE_VEC_LENGTH (args
);
3440 if (abi_version_at_least (6))
3444 if (abi_warn_or_compat_version_crosses (6))
3445 G
.need_abi_warning
= 1;
3446 for (i
= 0; i
< length
; ++i
)
3447 write_template_arg (TREE_VEC_ELT (args
, i
));
3450 else if (TYPE_P (node
))
3452 else if (code
== TEMPLATE_DECL
)
3453 /* A template appearing as a template arg is a template template arg. */
3454 write_template_template_arg (node
);
3455 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3456 || code
== CONST_DECL
3457 || null_member_pointer_value_p (node
))
3458 write_template_arg_literal (node
);
3459 else if (DECL_P (node
))
3462 /* Until ABI version 3, the underscore before the mangled name
3463 was incorrectly omitted. */
3464 if (!abi_version_at_least (3))
3467 write_string ("_Z");
3468 if (abi_warn_or_compat_version_crosses (3))
3469 G
.need_abi_warning
= 1;
3470 write_encoding (node
);
3475 /* Template arguments may be expressions. */
3477 write_expression (node
);
3482 /* <template-template-arg>
3484 ::= <substitution> */
3487 write_template_template_arg (const tree decl
)
3489 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3491 if (find_substitution (decl
))
3493 write_name (decl
, /*ignore_local_scope=*/0);
3494 add_substitution (decl
);
3498 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3500 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3501 ::= A <expression> _ </element/ type>
3503 "Array types encode the dimension (number of elements) and the
3504 element type. For variable length arrays, the dimension (but not
3505 the '_' separator) is omitted."
3506 Note that for flexible array members, like for other arrays of
3507 unspecified size, the dimension is also omitted. */
3510 write_array_type (const tree type
)
3513 if (TYPE_DOMAIN (type
))
3517 index_type
= TYPE_DOMAIN (type
);
3518 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3519 It's null for flexible array members which have no upper bound
3520 (this is a change from GCC 5 and prior where such members were
3521 incorrectly mangled as zero-length arrays). */
3522 if (tree max
= TYPE_MAX_VALUE (index_type
))
3524 if (TREE_CODE (max
) == INTEGER_CST
)
3526 /* The ABI specifies that we should mangle the number of
3527 elements in the array, not the largest allowed index. */
3528 offset_int wmax
= wi::to_offset (max
) + 1;
3529 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3530 number of elements as zero. */
3531 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3532 gcc_assert (wi::fits_uhwi_p (wmax
));
3533 write_unsigned_number (wmax
.to_uhwi ());
3537 max
= TREE_OPERAND (max
, 0);
3538 write_expression (max
);
3543 write_type (TREE_TYPE (type
));
3546 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3547 variables. TYPE is a pointer-to-member POINTER_TYPE.
3549 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3552 write_pointer_to_member_type (const tree type
)
3555 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3556 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3559 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3560 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3561 TEMPLATE_PARM_INDEX.
3563 <template-param> ::= T </parameter/ number> _ */
3566 write_template_param (const tree parm
)
3570 MANGLE_TRACE_TREE ("template-parm", parm
);
3572 switch (TREE_CODE (parm
))
3574 case TEMPLATE_TYPE_PARM
:
3575 case TEMPLATE_TEMPLATE_PARM
:
3576 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3577 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3580 case TEMPLATE_PARM_INDEX
:
3581 parm_index
= TEMPLATE_PARM_IDX (parm
);
3589 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3590 earliest template param denoted by `_'. */
3591 write_compact_number (parm_index
);
3594 /* <template-template-param>
3595 ::= <template-param>
3596 ::= <substitution> */
3599 write_template_template_param (const tree parm
)
3601 tree templ
= NULL_TREE
;
3603 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3604 template template parameter. The substitution candidate here is
3605 only the template. */
3606 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3609 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3610 if (find_substitution (templ
))
3614 /* <template-param> encodes only the template parameter position,
3615 not its template arguments, which is fine here. */
3616 write_template_param (parm
);
3618 add_substitution (templ
);
3621 /* Non-terminal <substitution>.
3623 <substitution> ::= S <seq-id> _
3627 write_substitution (const int seq_id
)
3629 MANGLE_TRACE ("substitution", "");
3633 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3637 /* Start mangling ENTITY. */
3640 start_mangling (const tree entity
)
3643 G
.need_abi_warning
= false;
3644 G
.need_cxx17_warning
= false;
3645 obstack_free (&name_obstack
, name_base
);
3646 mangle_obstack
= &name_obstack
;
3647 name_base
= obstack_alloc (&name_obstack
, 0);
3650 /* Done with mangling. If WARN is true, and the name of G.entity will
3651 be mangled differently in a future version of the ABI, issue a
3655 finish_mangling_internal (void)
3657 /* Clear all the substitutions. */
3658 vec_safe_truncate (G
.substitutions
, 0);
3660 /* Null-terminate the string. */
3665 /* Like finish_mangling_internal, but return the mangled string. */
3667 static inline const char *
3668 finish_mangling (void)
3670 finish_mangling_internal ();
3671 return (const char *) obstack_finish (mangle_obstack
);
3674 /* Like finish_mangling_internal, but return an identifier. */
3677 finish_mangling_get_identifier (void)
3679 finish_mangling_internal ();
3680 /* Don't obstack_finish here, and the next start_mangling will
3681 remove the identifier. */
3682 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3685 /* Initialize data structures for mangling. */
3690 gcc_obstack_init (&name_obstack
);
3691 name_base
= obstack_alloc (&name_obstack
, 0);
3692 vec_alloc (G
.substitutions
, 0);
3694 /* Cache these identifiers for quick comparison when checking for
3695 standard substitutions. */
3696 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3697 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3698 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3699 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3700 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3701 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3704 /* Generate the mangled name of DECL. */
3707 mangle_decl_string (const tree decl
)
3710 location_t saved_loc
= input_location
;
3711 tree saved_fn
= NULL_TREE
;
3712 bool template_p
= false;
3714 /* We shouldn't be trying to mangle an uninstantiated template. */
3715 gcc_assert (!type_dependent_expression_p (decl
));
3717 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3719 struct tinst_level
*tl
= current_instantiation ();
3720 if ((!tl
|| tl
->decl
!= decl
)
3721 && push_tinst_level (decl
))
3724 saved_fn
= current_function_decl
;
3725 current_function_decl
= NULL_TREE
;
3728 input_location
= DECL_SOURCE_LOCATION (decl
);
3730 start_mangling (decl
);
3732 if (TREE_CODE (decl
) == TYPE_DECL
)
3733 write_type (TREE_TYPE (decl
));
3735 write_mangled_name (decl
, true);
3737 result
= finish_mangling_get_identifier ();
3739 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3740 IDENTIFIER_POINTER (result
));
3745 current_function_decl
= saved_fn
;
3747 input_location
= saved_loc
;
3752 /* Return an identifier for the external mangled name of DECL. */
3755 get_mangled_id (tree decl
)
3757 tree id
= mangle_decl_string (decl
);
3758 return targetm
.mangle_decl_assembler_name (decl
, id
);
3761 /* Create an identifier for the external mangled name of DECL. */
3764 mangle_decl (const tree decl
)
3769 /* Don't bother mangling uninstantiated templates. */
3770 ++processing_template_decl
;
3771 if (TREE_CODE (decl
) == TYPE_DECL
)
3772 dep
= dependent_type_p (TREE_TYPE (decl
));
3774 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3775 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3776 --processing_template_decl
;
3780 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3781 It is not needed to assign names to anonymous namespace, but we use the
3782 "<anon>" marker to be able to tell if type is C++ ODR type or type
3783 produced by other language. */
3784 if (TREE_CODE (decl
) == TYPE_DECL
3785 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3786 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3787 id
= get_identifier ("<anon>");
3790 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3791 || !no_linkage_check (TREE_TYPE (decl
), true));
3792 if (abi_version_at_least (10))
3793 if (tree fn
= decl_function_context (decl
))
3794 maybe_check_abi_tags (fn
, decl
);
3795 id
= get_mangled_id (decl
);
3797 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3799 if (G
.need_cxx17_warning
3800 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
3801 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wnoexcept_type
,
3802 "mangled name for %qD will change in C++17 because the "
3803 "exception specification is part of a function type",
3806 if (id
!= DECL_NAME (decl
)
3807 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3808 && TREE_CODE (decl
) != TYPE_DECL
3809 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3810 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3812 int save_ver
= flag_abi_version
;
3813 tree id2
= NULL_TREE
;
3815 if (!DECL_REALLY_EXTERN (decl
))
3817 record_mangling (decl
, G
.need_abi_warning
);
3819 if (!G
.need_abi_warning
)
3822 flag_abi_version
= flag_abi_compat_version
;
3823 id2
= mangle_decl_string (decl
);
3824 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3825 flag_abi_version
= save_ver
;
3828 note_mangling_alias (decl
, id2
);
3833 const char fabi_version
[] = "-fabi-version";
3835 if (flag_abi_compat_version
!= warn_abi_version
3836 || id2
== NULL_TREE
)
3838 flag_abi_version
= warn_abi_version
;
3839 id2
= mangle_decl_string (decl
);
3840 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3842 flag_abi_version
= save_ver
;
3846 else if (warn_abi_version
!= 0
3847 && abi_version_at_least (warn_abi_version
))
3848 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3849 "the mangled name of %qD changed between "
3850 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3851 G
.entity
, fabi_version
, warn_abi_version
, id2
,
3852 fabi_version
, save_ver
, id
);
3854 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3855 "the mangled name of %qD changes between "
3856 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3857 G
.entity
, fabi_version
, save_ver
, id
,
3858 fabi_version
, warn_abi_version
, id2
);
3861 flag_abi_version
= save_ver
;
3865 /* Generate the mangled representation of TYPE. */
3868 mangle_type_string (const tree type
)
3872 start_mangling (type
);
3874 result
= finish_mangling ();
3876 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3880 /* Create an identifier for the mangled name of a special component
3881 for belonging to TYPE. CODE is the ABI-specified code for this
3885 mangle_special_for_type (const tree type
, const char *code
)
3889 /* We don't have an actual decl here for the special component, so
3890 we can't just process the <encoded-name>. Instead, fake it. */
3891 start_mangling (type
);
3893 /* Start the mangling. */
3894 write_string ("_Z");
3895 write_string (code
);
3899 result
= finish_mangling_get_identifier ();
3902 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3903 IDENTIFIER_POINTER (result
));
3908 /* Create an identifier for the mangled representation of the typeinfo
3909 structure for TYPE. */
3912 mangle_typeinfo_for_type (const tree type
)
3914 return mangle_special_for_type (type
, "TI");
3917 /* Create an identifier for the mangled name of the NTBS containing
3918 the mangled name of TYPE. */
3921 mangle_typeinfo_string_for_type (const tree type
)
3923 return mangle_special_for_type (type
, "TS");
3926 /* Create an identifier for the mangled name of the vtable for TYPE. */
3929 mangle_vtbl_for_type (const tree type
)
3931 return mangle_special_for_type (type
, "TV");
3934 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3937 mangle_vtt_for_type (const tree type
)
3939 return mangle_special_for_type (type
, "TT");
3942 /* Returns an identifier for the mangled name of the decomposition
3943 artificial variable DECL. DECLS is the vector of the VAR_DECLs
3944 for the identifier-list. */
3947 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
3949 gcc_assert (!type_dependent_expression_p (decl
));
3951 location_t saved_loc
= input_location
;
3952 input_location
= DECL_SOURCE_LOCATION (decl
);
3954 start_mangling (decl
);
3955 write_string ("_Z");
3957 tree context
= decl_mangling_context (decl
);
3958 gcc_assert (context
!= NULL_TREE
);
3960 bool nested
= false;
3961 if (DECL_NAMESPACE_STD_P (context
))
3962 write_string ("St");
3963 else if (context
!= global_namespace
)
3967 write_prefix (decl_mangling_context (decl
));
3970 write_string ("DC");
3973 FOR_EACH_VEC_ELT (decls
, i
, d
)
3974 write_unqualified_name (d
);
3980 tree id
= finish_mangling_get_identifier ();
3982 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
3983 IDENTIFIER_POINTER (id
));
3985 input_location
= saved_loc
;
3989 /* Return an identifier for a construction vtable group. TYPE is
3990 the most derived class in the hierarchy; BINFO is the base
3991 subobject for which this construction vtable group will be used.
3993 This mangling isn't part of the ABI specification; in the ABI
3994 specification, the vtable group is dumped in the same COMDAT as the
3995 main vtable, and is referenced only from that vtable, so it doesn't
3996 need an external name. For binary formats without COMDAT sections,
3997 though, we need external names for the vtable groups.
3999 We use the production
4001 <special-name> ::= CT <type> <offset number> _ <base type> */
4004 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4008 start_mangling (type
);
4010 write_string ("_Z");
4011 write_string ("TC");
4013 write_integer_cst (BINFO_OFFSET (binfo
));
4015 write_type (BINFO_TYPE (binfo
));
4017 result
= finish_mangling_get_identifier ();
4019 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4020 IDENTIFIER_POINTER (result
));
4024 /* Mangle a this pointer or result pointer adjustment.
4026 <call-offset> ::= h <fixed offset number> _
4027 ::= v <fixed offset number> _ <virtual offset number> _ */
4030 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4032 write_char (virtual_offset
? 'v' : 'h');
4034 /* For either flavor, write the fixed offset. */
4035 write_integer_cst (fixed_offset
);
4038 /* For a virtual thunk, add the virtual offset. */
4041 write_integer_cst (virtual_offset
);
4046 /* Return an identifier for the mangled name of a this-adjusting or
4047 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4048 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4049 is a virtual thunk, and it is the vtbl offset in
4050 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4051 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4052 thunk itself. A covariant thunk name always includes the adjustment
4053 for the this pointer, even if there is none.
4055 <special-name> ::= T <call-offset> <base encoding>
4056 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4060 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4061 tree virtual_offset
, tree thunk
)
4065 if (abi_version_at_least (11))
4066 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4068 start_mangling (fn_decl
);
4070 write_string ("_Z");
4073 if (!this_adjusting
)
4075 /* Covariant thunk with no this adjustment */
4077 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4078 mangle_call_offset (fixed_offset
, virtual_offset
);
4080 else if (!DECL_THUNK_P (fn_decl
))
4081 /* Plain this adjusting thunk. */
4082 mangle_call_offset (fixed_offset
, virtual_offset
);
4085 /* This adjusting thunk to covariant thunk. */
4087 mangle_call_offset (fixed_offset
, virtual_offset
);
4088 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4089 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4091 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4092 mangle_call_offset (fixed_offset
, virtual_offset
);
4093 fn_decl
= THUNK_TARGET (fn_decl
);
4097 write_encoding (fn_decl
);
4099 result
= finish_mangling_get_identifier ();
4101 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4105 /* Handle ABI backwards compatibility for past bugs where we didn't call
4106 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4107 it makes a difference. If FOR_DECL is non-null, it's the declaration
4108 that we're actually trying to mangle; if it's null, we're mangling the
4109 guard variable for T. */
4112 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4114 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4117 tree oldtags
= get_abi_tags (t
);
4121 tree newtags
= get_abi_tags (t
);
4122 if (newtags
&& newtags
!= oldtags
4123 && abi_version_crosses (ver
))
4125 if (for_decl
&& DECL_THUNK_P (for_decl
))
4126 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4127 "the mangled name of a thunk for %qD changes between "
4128 "-fabi-version=%d and -fabi-version=%d",
4129 t
, flag_abi_version
, warn_abi_version
);
4131 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4132 "the mangled name of %qD changes between "
4133 "-fabi-version=%d and -fabi-version=%d",
4134 for_decl
, flag_abi_version
, warn_abi_version
);
4136 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4137 "the mangled name of the initialization guard variable "
4138 "for %qD changes between -fabi-version=%d and "
4140 t
, flag_abi_version
, warn_abi_version
);
4144 /* Write out the appropriate string for this variable when generating
4145 another mangled name based on this one. */
4148 write_guarded_var_name (const tree variable
)
4150 if (DECL_NAME (variable
)
4151 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4152 /* The name of a guard variable for a reference temporary should refer
4153 to the reference, not the temporary. */
4154 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4156 write_name (variable
, /*ignore_local_scope=*/0);
4159 /* Return an identifier for the name of an initialization guard
4160 variable for indicated VARIABLE. */
4163 mangle_guard_variable (const tree variable
)
4165 if (abi_version_at_least (10))
4166 maybe_check_abi_tags (variable
);
4167 start_mangling (variable
);
4168 write_string ("_ZGV");
4169 write_guarded_var_name (variable
);
4170 return finish_mangling_get_identifier ();
4173 /* Return an identifier for the name of a thread_local initialization
4174 function for VARIABLE. */
4177 mangle_tls_init_fn (const tree variable
)
4179 check_abi_tags (variable
);
4180 start_mangling (variable
);
4181 write_string ("_ZTH");
4182 write_guarded_var_name (variable
);
4183 return finish_mangling_get_identifier ();
4186 /* Return an identifier for the name of a thread_local wrapper
4187 function for VARIABLE. */
4189 #define TLS_WRAPPER_PREFIX "_ZTW"
4192 mangle_tls_wrapper_fn (const tree variable
)
4194 check_abi_tags (variable
);
4195 start_mangling (variable
);
4196 write_string (TLS_WRAPPER_PREFIX
);
4197 write_guarded_var_name (variable
);
4198 return finish_mangling_get_identifier ();
4201 /* Return true iff FN is a thread_local wrapper function. */
4204 decl_tls_wrapper_p (const tree fn
)
4206 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4208 tree name
= DECL_NAME (fn
);
4209 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4210 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4213 /* Return an identifier for the name of a temporary variable used to
4214 initialize a static reference. This isn't part of the ABI, but we might
4215 as well call them something readable. */
4217 static GTY(()) int temp_count
;
4220 mangle_ref_init_variable (const tree variable
)
4222 start_mangling (variable
);
4223 write_string ("_ZGR");
4224 check_abi_tags (variable
);
4225 write_name (variable
, /*ignore_local_scope=*/0);
4226 /* Avoid name clashes with aggregate initialization of multiple
4227 references at once. */
4228 write_unsigned_number (temp_count
++);
4229 return finish_mangling_get_identifier ();
4232 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4233 function generates a mangled name for the vtable map variable of
4234 the class type. For example, if the class type is
4235 "std::bad_exception", the mangled name for the class is
4236 "St13bad_exception". This function would generate the name
4237 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4238 "_VTV<std::bad_exception>::__vtable_map". */
4242 get_mangled_vtable_map_var_name (tree class_type
)
4244 char *var_name
= NULL
;
4245 const char *prefix
= "_ZN4_VTVI";
4246 const char *postfix
= "E12__vtable_mapE";
4248 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4250 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4252 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4254 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4255 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4258 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4260 strlen (postfix
) + 1;
4262 var_name
= (char *) xmalloc (len
);
4264 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4269 #include "gt-cp-mangle.h"