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_ANY_OP_P (identifier
))
1268 const char *mangled_name
= NULL
;
1269 bool assop
= IDENTIFIER_ASSIGN_OP_P (identifier
);
1271 /* Unfortunately, there is no easy way to go from the
1272 name of the operator back to the corresponding tree
1274 for (unsigned i
= 0; i
< MAX_TREE_CODES
; ++i
)
1276 const ovl_op_info_t
*ovl_op
= OVL_OP_INFO (assop
, i
);
1278 if (ovl_op
->identifier
== identifier
)
1280 /* The ABI says that we prefer binary operator
1281 names to unary operator names. */
1282 if (ovl_op
->flags
== OVL_OP_FLAG_BINARY
)
1284 mangled_name
= ovl_op
->mangled_name
;
1287 else if (!mangled_name
)
1288 mangled_name
= ovl_op
->mangled_name
;
1291 write_string (mangled_name
);
1293 else if (UDLIT_OPER_P (identifier
))
1294 write_literal_operator_name (identifier
);
1296 write_source_name (identifier
);
1300 write_unqualified_name (tree decl
)
1302 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1304 if (identifier_p (decl
))
1306 write_unqualified_id (decl
);
1312 if (DECL_NAME (decl
) == NULL_TREE
)
1315 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1316 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1318 else if (DECL_DECLARES_FUNCTION_P (decl
))
1321 if (DECL_CONSTRUCTOR_P (decl
))
1322 write_special_name_constructor (decl
);
1323 else if (DECL_DESTRUCTOR_P (decl
))
1324 write_special_name_destructor (decl
);
1325 else if (DECL_CONV_FN_P (decl
))
1327 /* Conversion operator. Handle it right here.
1328 <operator> ::= cv <type> */
1330 if (decl_is_template_id (decl
, NULL
))
1333 fn_type
= get_mostly_instantiated_function_type (decl
);
1334 type
= TREE_TYPE (fn_type
);
1336 else if (FNDECL_USED_AUTO (decl
))
1337 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1338 ->x_auto_return_pattern
);
1340 type
= DECL_CONV_FN_TYPE (decl
);
1341 write_conversion_operator_name (type
);
1343 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1345 const char *mangled_name
1346 = (OVL_OP_INFO (DECL_ASSIGNMENT_OPERATOR_P (decl
),
1347 DECL_OVERLOADED_OPERATOR_CODE (decl
))->mangled_name
);
1348 write_string (mangled_name
);
1350 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1351 write_literal_operator_name (DECL_NAME (decl
));
1358 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1359 && DECL_NAMESPACE_SCOPE_P (decl
)
1360 && decl_linkage (decl
) == lk_internal
)
1362 MANGLE_TRACE_TREE ("local-source-name", decl
);
1364 write_source_name (DECL_NAME (decl
));
1365 /* The default discriminator is 1, and that's all we ever use,
1366 so there's no code to output one here. */
1370 tree type
= TREE_TYPE (decl
);
1372 if (TREE_CODE (decl
) == TYPE_DECL
1373 && TYPE_UNNAMED_P (type
))
1374 write_unnamed_type_name (type
);
1375 else if (TREE_CODE (decl
) == TYPE_DECL
1376 && LAMBDA_TYPE_P (type
))
1377 write_closure_type_name (type
);
1379 write_source_name (DECL_NAME (decl
));
1382 /* We use the ABI tags from the primary class template, ignoring tags on any
1383 specializations. This is necessary because C++ doesn't require a
1384 specialization to be declared before it is used unless the use requires a
1385 complete type, but we need to get the tags right on incomplete types as
1387 if (tree tmpl
= most_general_template (decl
))
1389 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1390 if (res
== NULL_TREE
)
1391 /* UNBOUND_CLASS_TEMPLATE. */;
1392 else if (DECL_DECLARES_TYPE_P (decl
))
1394 else if (any_abi_below (11))
1396 /* ABI v10 implicit tags on the template. */
1397 tree mtags
= missing_abi_tags (res
);
1398 /* Explicit tags on the template. */
1399 tree ttags
= get_abi_tags (res
);
1400 /* Tags on the instantiation. */
1401 tree dtags
= get_abi_tags (decl
);
1403 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1404 G
.need_abi_warning
= 1;
1406 /* Add the v10 tags to the explicit tags now. */
1407 mtags
= chainon (mtags
, ttags
);
1409 if (!G
.need_abi_warning
1410 && abi_warn_or_compat_version_crosses (11)
1411 && !equal_abi_tags (dtags
, mtags
))
1412 G
.need_abi_warning
= 1;
1414 if (!abi_version_at_least (10))
1415 /* In abi <10, we only got the explicit tags. */
1417 else if (flag_abi_version
== 10)
1419 /* In ABI 10, we want explict and implicit tags. */
1420 write_abi_tags (mtags
);
1426 tree tags
= get_abi_tags (decl
);
1427 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1428 && any_abi_below (11))
1429 if (tree mtags
= missing_abi_tags (decl
))
1431 if (abi_warn_or_compat_version_crosses (11))
1432 G
.need_abi_warning
= true;
1433 if (!abi_version_at_least (11))
1434 tags
= chainon (mtags
, tags
);
1436 write_abi_tags (tags
);
1439 /* Write the unqualified-name for a conversion operator to TYPE. */
1442 write_conversion_operator_name (const tree type
)
1444 write_string ("cv");
1448 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1450 <source-name> ::= </length/ number> <identifier> */
1453 write_source_name (tree identifier
)
1455 MANGLE_TRACE_TREE ("source-name", identifier
);
1457 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1458 write_identifier (IDENTIFIER_POINTER (identifier
));
1461 /* Compare two TREE_STRINGs like strcmp. */
1464 tree_string_cmp (const void *p1
, const void *p2
)
1468 tree s1
= *(const tree
*)p1
;
1469 tree s2
= *(const tree
*)p2
;
1470 return strcmp (TREE_STRING_POINTER (s1
),
1471 TREE_STRING_POINTER (s2
));
1474 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1476 static vec
<tree
, va_gc
> *
1477 sorted_abi_tags (tree tags
)
1479 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1481 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1483 if (ABI_TAG_IMPLICIT (t
))
1485 tree str
= TREE_VALUE (t
);
1486 vec_safe_push (vec
, str
);
1489 vec
->qsort (tree_string_cmp
);
1494 /* ID is the name of a function or type with abi_tags attribute TAGS.
1495 Write out the name, suitably decorated. */
1498 write_abi_tags (tree tags
)
1500 if (tags
== NULL_TREE
)
1503 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1505 unsigned i
; tree str
;
1506 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1509 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1510 write_identifier (TREE_STRING_POINTER (str
));
1513 release_tree_vector (vec
);
1516 /* Simplified unique_ptr clone to release a tree vec on exit. */
1518 struct releasing_vec
1520 typedef vec
<tree
, va_gc
> vec_t
;
1522 releasing_vec (vec_t
*v
): v(v
) { }
1523 releasing_vec (): v(make_tree_vector ()) { }
1525 vec_t
&operator* () const { return *v
; }
1526 vec_t
*operator-> () const { return v
; }
1527 vec_t
*get () const { return v
; }
1528 operator vec_t
*() const { return v
; }
1529 tree
& operator[] (unsigned i
) const { return (*v
)[i
]; }
1531 ~releasing_vec() { release_tree_vector (v
); }
1536 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1539 equal_abi_tags (tree t1
, tree t2
)
1541 releasing_vec v1
= sorted_abi_tags (t1
);
1542 releasing_vec v2
= sorted_abi_tags (t2
);
1544 unsigned len1
= v1
->length();
1545 if (len1
!= v2
->length())
1547 for (unsigned i
= 0; i
< len1
; ++i
)
1548 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1553 /* Write a user-defined literal operator.
1554 ::= li <source-name> # "" <source-name>
1555 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1558 write_literal_operator_name (tree identifier
)
1560 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1561 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1562 write_unsigned_number (strlen (suffix
));
1563 write_identifier (suffix
);
1566 /* Encode 0 as _, and 1+ as n-1_. */
1569 write_compact_number (int num
)
1572 write_unsigned_number (num
- 1);
1576 /* Return how many unnamed types precede TYPE in its enclosing class. */
1579 nested_anon_class_index (tree type
)
1582 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1583 for (; member
; member
= DECL_CHAIN (member
))
1584 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1586 tree memtype
= TREE_TYPE (member
);
1587 if (memtype
== type
)
1589 else if (TYPE_UNNAMED_P (memtype
))
1596 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1599 write_unnamed_type_name (const tree type
)
1602 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1604 if (TYPE_FUNCTION_SCOPE_P (type
))
1605 discriminator
= local_class_index (type
);
1606 else if (TYPE_CLASS_SCOPE_P (type
))
1607 discriminator
= nested_anon_class_index (type
);
1610 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1611 /* Just use the old mangling at namespace scope. */
1612 write_source_name (TYPE_IDENTIFIER (type
));
1616 write_string ("Ut");
1617 write_compact_number (discriminator
);
1620 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1621 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1624 write_closure_type_name (const tree type
)
1626 tree fn
= lambda_function (type
);
1627 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1628 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1630 MANGLE_TRACE_TREE ("closure-type-name", type
);
1632 write_string ("Ul");
1633 write_method_parms (parms
, /*method_p=*/1, fn
);
1635 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1638 /* Convert NUMBER to ascii using base BASE and generating at least
1639 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1640 into which to store the characters. Returns the number of
1641 characters generated (these will be laid out in advance of where
1645 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1646 char *buffer
, const unsigned int min_digits
)
1648 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1649 unsigned digits
= 0;
1653 unsigned HOST_WIDE_INT d
= number
/ base
;
1655 *--buffer
= base_digits
[number
- d
* base
];
1659 while (digits
< min_digits
)
1661 *--buffer
= base_digits
[0];
1667 /* Non-terminal <number>.
1669 <number> ::= [n] </decimal integer/> */
1672 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1673 const unsigned int base
)
1675 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1678 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1681 number
= -((HOST_WIDE_INT
) number
);
1683 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1684 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1687 /* Write out an integral CST in decimal. Most numbers are small, and
1688 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1689 bigger than that, which we must deal with. */
1692 write_integer_cst (const tree cst
)
1694 int sign
= tree_int_cst_sgn (cst
);
1695 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1696 if (!wi::fits_uhwi_p (abs_value
))
1698 /* A bignum. We do this in chunks, each of which fits in a
1700 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1701 unsigned HOST_WIDE_INT chunk
;
1702 unsigned chunk_digits
;
1703 char *ptr
= buffer
+ sizeof (buffer
);
1708 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1713 if (sizeof (HOST_WIDE_INT
) >= 8)
1715 /* It is at least 64 bits, so 10^18 is representable. */
1720 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1721 base
= build_int_cstu (type
, chunk
);
1722 n
= wide_int_to_tree (type
, wi::to_wide (cst
));
1727 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1731 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1732 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1735 done
= integer_zerop (d
);
1736 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1737 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1738 done
? 1 : chunk_digits
);
1744 write_chars (ptr
, count
);
1751 write_unsigned_number (abs_value
.to_uhwi ());
1755 /* Write out a floating-point literal.
1757 "Floating-point literals are encoded using the bit pattern of the
1758 target processor's internal representation of that number, as a
1759 fixed-length lowercase hexadecimal string, high-order bytes first
1760 (even if the target processor would store low-order bytes first).
1761 The "n" prefix is not used for floating-point literals; the sign
1762 bit is encoded with the rest of the number.
1764 Here are some examples, assuming the IEEE standard representation
1765 for floating point numbers. (Spaces are for readability, not
1766 part of the encoding.)
1769 -1.0f Lf bf80 0000 E
1770 1.17549435e-38f Lf 0080 0000 E
1771 1.40129846e-45f Lf 0000 0001 E
1772 0.0f Lf 0000 0000 E"
1774 Caller is responsible for the Lx and the E. */
1776 write_real_cst (const tree value
)
1778 long target_real
[4]; /* largest supported float */
1779 /* Buffer for eight hex digits in a 32-bit number but big enough
1780 even for 64-bit long to avoid warnings. */
1784 tree type
= TREE_TYPE (value
);
1785 int words
= GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type
)) / 32;
1787 real_to_target (target_real
, &TREE_REAL_CST (value
),
1790 /* The value in target_real is in the target word order,
1791 so we must write it out backward if that happens to be
1792 little-endian. write_number cannot be used, it will
1793 produce uppercase. */
1794 if (FLOAT_WORDS_BIG_ENDIAN
)
1795 i
= 0, limit
= words
, dir
= 1;
1797 i
= words
- 1, limit
= -1, dir
= -1;
1799 for (; i
!= limit
; i
+= dir
)
1801 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1802 write_chars (buffer
, 8);
1806 /* Non-terminal <identifier>.
1808 <identifier> ::= </unqualified source code identifier> */
1811 write_identifier (const char *identifier
)
1813 MANGLE_TRACE ("identifier", identifier
);
1814 write_string (identifier
);
1817 /* Handle constructor productions of non-terminal <special-name>.
1818 CTOR is a constructor FUNCTION_DECL.
1820 <special-name> ::= C1 # complete object constructor
1821 ::= C2 # base object constructor
1822 ::= C3 # complete object allocating constructor
1824 Currently, allocating constructors are never used. */
1827 write_special_name_constructor (const tree ctor
)
1830 bool new_inh
= (flag_new_inheriting_ctors
1831 && DECL_INHERITED_CTOR (ctor
));
1834 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1836 /* This is the old-style "[unified]" constructor.
1837 In some cases, we may emit this function and call
1838 it from the clones in order to share code and save space. */
1839 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1843 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1847 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1850 /* Handle destructor productions of non-terminal <special-name>.
1851 DTOR is a destructor FUNCTION_DECL.
1853 <special-name> ::= D0 # deleting (in-charge) destructor
1854 ::= D1 # complete object (in-charge) destructor
1855 ::= D2 # base object (not-in-charge) destructor */
1858 write_special_name_destructor (const tree dtor
)
1860 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1861 write_string ("D0");
1862 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1863 write_string ("D2");
1864 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1865 /* This is the old-style "[unified]" destructor.
1866 In some cases, we may emit this function and call
1867 it from the clones in order to share code and save space. */
1868 write_string ("D4");
1871 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1872 write_string ("D1");
1876 /* Scan the vector of local classes and return how many others with the
1877 same name (or same no name) and context precede ENTITY. */
1880 local_class_index (tree entity
)
1882 int ix
, discriminator
= 0;
1883 tree name
= (TYPE_UNNAMED_P (entity
) ? NULL_TREE
1884 : TYPE_IDENTIFIER (entity
));
1885 tree ctx
= TYPE_CONTEXT (entity
);
1886 for (ix
= 0; ; ix
++)
1888 tree type
= (*local_classes
)[ix
];
1890 return discriminator
;
1891 if (TYPE_CONTEXT (type
) == ctx
1892 && (name
? TYPE_IDENTIFIER (type
) == name
1893 : TYPE_UNNAMED_P (type
)))
1899 /* Return the discriminator for ENTITY appearing inside
1900 FUNCTION. The discriminator is the lexical ordinal of VAR among
1901 entities with the same name in the same FUNCTION. */
1904 discriminator_for_local_entity (tree entity
)
1906 if (DECL_DISCRIMINATOR_P (entity
))
1908 if (DECL_DISCRIMINATOR_SET_P (entity
))
1909 return DECL_DISCRIMINATOR (entity
);
1911 /* The first entity with a particular name doesn't get
1912 DECL_DISCRIMINATOR set up. */
1915 else if (TREE_CODE (entity
) == TYPE_DECL
)
1917 /* Scan the list of local classes. */
1918 entity
= TREE_TYPE (entity
);
1920 /* Lambdas and unnamed types have their own discriminators. */
1921 if (LAMBDA_TYPE_P (entity
) || TYPE_UNNAMED_P (entity
))
1924 return local_class_index (entity
);
1930 /* Return the discriminator for STRING, a string literal used inside
1931 FUNCTION. The discriminator is the lexical ordinal of STRING among
1932 string literals used in FUNCTION. */
1935 discriminator_for_string_literal (tree
/*function*/,
1938 /* For now, we don't discriminate amongst string literals. */
1942 /* <discriminator> := _ <number> # when number < 10
1943 := __ <number> _ # when number >= 10
1945 The discriminator is used only for the second and later occurrences
1946 of the same name within a single function. In this case <number> is
1947 n - 2, if this is the nth occurrence, in lexical order. */
1950 write_discriminator (const int discriminator
)
1952 /* If discriminator is zero, don't write anything. Otherwise... */
1953 if (discriminator
> 0)
1956 if (discriminator
- 1 >= 10)
1958 if (abi_warn_or_compat_version_crosses (11))
1959 G
.need_abi_warning
= 1;
1960 if (abi_version_at_least (11))
1963 write_unsigned_number (discriminator
- 1);
1964 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
1969 /* Mangle the name of a function-scope entity. FUNCTION is the
1970 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1971 default argument scope. ENTITY is the decl for the entity itself.
1972 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1973 either ENTITY itself or an enclosing scope of ENTITY.
1975 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1976 := Z <function encoding> E s [<discriminator>]
1977 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1980 write_local_name (tree function
, const tree local_entity
,
1983 tree parm
= NULL_TREE
;
1985 MANGLE_TRACE_TREE ("local-name", entity
);
1987 if (TREE_CODE (function
) == PARM_DECL
)
1990 function
= DECL_CONTEXT (parm
);
1994 write_encoding (function
);
1997 /* For this purpose, parameters are numbered from right-to-left. */
2002 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
2010 write_compact_number (i
- 1);
2013 if (TREE_CODE (entity
) == STRING_CST
)
2016 write_discriminator (discriminator_for_string_literal (function
,
2021 /* Now the <entity name>. Let write_name know its being called
2022 from <local-name>, so it doesn't try to process the enclosing
2023 function scope again. */
2024 write_name (entity
, /*ignore_local_scope=*/1);
2025 write_discriminator (discriminator_for_local_entity (local_entity
));
2029 /* Non-terminals <type> and <CV-qualifier>.
2031 <type> ::= <builtin-type>
2033 ::= <class-enum-type>
2035 ::= <pointer-to-member-type>
2036 ::= <template-param>
2039 ::= P <type> # pointer-to
2040 ::= R <type> # reference-to
2041 ::= C <type> # complex pair (C 2000)
2042 ::= G <type> # imaginary (C 2000) [not supported]
2043 ::= U <source-name> <type> # vendor extended type qualifier
2047 <type> ::= RR <type> # rvalue reference-to
2048 <type> ::= Dt <expression> # decltype of an id-expression or
2049 # class member access
2050 <type> ::= DT <expression> # decltype of an expression
2051 <type> ::= Dn # decltype of nullptr
2053 TYPE is a type node. */
2056 write_type (tree type
)
2058 /* This gets set to nonzero if TYPE turns out to be a (possibly
2059 CV-qualified) builtin type. */
2060 int is_builtin_type
= 0;
2062 MANGLE_TRACE_TREE ("type", type
);
2064 if (type
== error_mark_node
)
2067 type
= canonicalize_for_substitution (type
);
2068 if (find_substitution (type
))
2072 if (write_CV_qualifiers_for_type (type
) > 0)
2073 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2074 mangle the unqualified type. The recursive call is needed here
2075 since both the qualified and unqualified types are substitution
2078 tree t
= TYPE_MAIN_VARIANT (type
);
2079 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2081 tree attrs
= NULL_TREE
;
2082 if (tx_safe_fn_type_p (type
))
2083 attrs
= tree_cons (get_identifier ("transaction_safe"),
2085 t
= cp_build_type_attribute_variant (t
, attrs
);
2087 gcc_assert (t
!= type
);
2088 if (TREE_CODE (t
) == FUNCTION_TYPE
2089 || TREE_CODE (t
) == METHOD_TYPE
)
2091 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2092 if (flag_noexcept_type
)
2094 tree r
= TYPE_RAISES_EXCEPTIONS (type
);
2095 t
= build_exception_variant (t
, r
);
2097 if (abi_version_at_least (8)
2098 || type
== TYPE_MAIN_VARIANT (type
))
2099 /* Avoid adding the unqualified function type as a substitution. */
2100 write_function_type (t
);
2103 if (abi_warn_or_compat_version_crosses (8))
2104 G
.need_abi_warning
= 1;
2109 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2110 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2111 so that the cv-qualification of the element type is available
2112 in write_array_type. */
2113 write_array_type (type
);
2116 tree type_orig
= type
;
2118 /* See through any typedefs. */
2119 type
= TYPE_MAIN_VARIANT (type
);
2120 if (TREE_CODE (type
) == FUNCTION_TYPE
2121 || TREE_CODE (type
) == METHOD_TYPE
)
2123 type
= build_ref_qualified_type (type
, type_memfn_rqual (type_orig
));
2124 type
= build_exception_variant (type
,
2125 TYPE_RAISES_EXCEPTIONS (type_orig
));
2128 /* According to the C++ ABI, some library classes are passed the
2129 same as the scalar type of their single member and use the same
2131 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2132 type
= TREE_TYPE (first_field (type
));
2134 if (TYPE_PTRDATAMEM_P (type
))
2135 write_pointer_to_member_type (type
);
2138 /* Handle any target-specific fundamental types. */
2139 const char *target_mangling
2140 = targetm
.mangle_type (type_orig
);
2142 if (target_mangling
)
2144 write_string (target_mangling
);
2145 /* Add substitutions for types other than fundamental
2147 if (!VOID_TYPE_P (type
)
2148 && TREE_CODE (type
) != INTEGER_TYPE
2149 && TREE_CODE (type
) != REAL_TYPE
2150 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2151 add_substitution (type
);
2155 switch (TREE_CODE (type
))
2159 case INTEGER_TYPE
: /* Includes wchar_t. */
2161 case FIXED_POINT_TYPE
:
2163 /* If this is a typedef, TYPE may not be one of
2164 the standard builtin type nodes, but an alias of one. Use
2165 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2166 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2173 write_type (TREE_TYPE (type
));
2178 write_function_type (type
);
2184 /* A pointer-to-member function is represented as a special
2185 RECORD_TYPE, so check for this first. */
2186 if (TYPE_PTRMEMFUNC_P (type
))
2187 write_pointer_to_member_type (type
);
2189 write_class_enum_type (type
);
2193 case UNBOUND_CLASS_TEMPLATE
:
2194 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2195 ordinary nested names. */
2196 write_nested_name (TYPE_STUB_DECL (type
));
2200 case REFERENCE_TYPE
:
2201 if (TYPE_PTR_P (type
))
2203 else if (TYPE_REF_IS_RVALUE (type
))
2208 tree target
= TREE_TYPE (type
);
2209 /* Attribute const/noreturn are not reflected in mangling.
2210 We strip them here rather than at a lower level because
2211 a typedef or template argument can have function type
2212 with function-cv-quals (that use the same representation),
2213 but you can't have a pointer/reference to such a type. */
2214 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2216 if (abi_warn_or_compat_version_crosses (5)
2217 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2218 G
.need_abi_warning
= 1;
2219 if (abi_version_at_least (5))
2220 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2222 write_type (target
);
2226 case TEMPLATE_TYPE_PARM
:
2229 if (AUTO_IS_DECLTYPE (type
))
2230 write_identifier ("Dc");
2232 write_identifier ("Da");
2237 case TEMPLATE_PARM_INDEX
:
2238 write_template_param (type
);
2241 case TEMPLATE_TEMPLATE_PARM
:
2242 write_template_template_param (type
);
2245 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2246 write_template_template_param (type
);
2248 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2252 if (abi_version_at_least (4))
2254 write_string ("Dv");
2255 /* Non-constant vector size would be encoded with
2256 _ expression, but we don't support that yet. */
2257 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2261 write_string ("U8__vector");
2262 if (abi_warn_or_compat_version_crosses (4))
2263 G
.need_abi_warning
= 1;
2264 write_type (TREE_TYPE (type
));
2267 case TYPE_PACK_EXPANSION
:
2268 write_string ("Dp");
2269 write_type (PACK_EXPANSION_PATTERN (type
));
2273 /* These shouldn't make it into mangling. */
2274 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2275 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2277 /* In ABI <5, we stripped decltype of a plain decl. */
2278 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2280 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2281 tree etype
= NULL_TREE
;
2282 switch (TREE_CODE (expr
))
2289 case TEMPLATE_PARM_INDEX
:
2290 etype
= TREE_TYPE (expr
);
2297 if (etype
&& !type_uses_auto (etype
))
2299 if (abi_warn_or_compat_version_crosses (5))
2300 G
.need_abi_warning
= 1;
2301 if (!abi_version_at_least (5))
2310 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2314 ++cp_unevaluated_operand
;
2315 write_expression (DECLTYPE_TYPE_EXPR (type
));
2316 --cp_unevaluated_operand
;
2321 write_string ("Dn");
2322 if (abi_version_at_least (7))
2324 if (abi_warn_or_compat_version_crosses (7))
2325 G
.need_abi_warning
= 1;
2329 sorry ("mangling typeof, use decltype instead");
2332 case UNDERLYING_TYPE
:
2333 sorry ("mangling __underlying_type");
2345 /* Types other than builtin types are substitution candidates. */
2346 if (!is_builtin_type
)
2347 add_substitution (type
);
2350 /* qsort callback for sorting a vector of attribute entries. */
2353 attr_strcmp (const void *p1
, const void *p2
)
2355 tree a1
= *(const tree
*)p1
;
2356 tree a2
= *(const tree
*)p2
;
2358 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2359 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2361 return strcmp (as1
->name
, as2
->name
);
2364 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2365 CV-qualifiers written for TYPE.
2367 <CV-qualifiers> ::= [r] [V] [K] */
2370 write_CV_qualifiers_for_type (const tree type
)
2372 int num_qualifiers
= 0;
2374 /* The order is specified by:
2376 "In cases where multiple order-insensitive qualifiers are
2377 present, they should be ordered 'K' (closest to the base type),
2378 'V', 'r', and 'U' (farthest from the base type) ..." */
2380 /* Mangle attributes that affect type identity as extended qualifiers.
2382 We don't do this with classes and enums because their attributes
2383 are part of their definitions, not something added on. */
2385 if (!OVERLOAD_TYPE_P (type
))
2388 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2390 tree name
= get_attribute_name (a
);
2391 const attribute_spec
*as
= lookup_attribute_spec (name
);
2392 if (as
&& as
->affects_type_identity
2393 && !is_attribute_p ("transaction_safe", name
)
2394 && !is_attribute_p ("abi_tag", name
))
2397 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2398 G
.need_abi_warning
= true;
2399 if (abi_version_at_least (10))
2401 vec
.qsort (attr_strcmp
);
2402 while (!vec
.is_empty())
2405 const attribute_spec
*as
2406 = lookup_attribute_spec (get_attribute_name (a
));
2409 write_unsigned_number (strlen (as
->name
));
2410 write_string (as
->name
);
2414 for (tree args
= TREE_VALUE (a
); args
;
2415 args
= TREE_CHAIN (args
))
2417 tree arg
= TREE_VALUE (args
);
2418 write_template_arg (arg
);
2428 /* Note that we do not use cp_type_quals below; given "const
2429 int[3]", the "const" is emitted with the "int", not with the
2431 cp_cv_quals quals
= TYPE_QUALS (type
);
2433 if (quals
& TYPE_QUAL_RESTRICT
)
2438 if (quals
& TYPE_QUAL_VOLATILE
)
2443 if (quals
& TYPE_QUAL_CONST
)
2449 return num_qualifiers
;
2452 /* Non-terminal <builtin-type>.
2454 <builtin-type> ::= v # void
2459 ::= h # unsigned char
2461 ::= t # unsigned short
2463 ::= j # unsigned int
2465 ::= m # unsigned long
2466 ::= x # long long, __int64
2467 ::= y # unsigned long long, __int64
2469 ::= o # unsigned __int128
2472 ::= e # long double, __float80
2473 ::= g # __float128 [not supported]
2474 ::= u <source-name> # vendor extended type */
2477 write_builtin_type (tree type
)
2479 if (TYPE_CANONICAL (type
))
2480 type
= TYPE_CANONICAL (type
);
2482 switch (TREE_CODE (type
))
2493 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2494 isn't in integer_type_nodes. */
2495 if (type
== wchar_type_node
)
2497 else if (type
== char16_type_node
)
2498 write_string ("Ds");
2499 else if (type
== char32_type_node
)
2500 write_string ("Di");
2504 /* Assume TYPE is one of the shared integer type nodes. Find
2505 it in the array of these nodes. */
2507 for (itk
= 0; itk
< itk_none
; ++itk
)
2508 if (integer_types
[itk
] != NULL_TREE
2509 && integer_type_codes
[itk
] != '\0'
2510 && type
== integer_types
[itk
])
2512 /* Print the corresponding single-letter code. */
2513 write_char (integer_type_codes
[itk
]);
2517 if (itk
== itk_none
)
2519 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2520 TYPE_UNSIGNED (type
));
2527 if (TYPE_PRECISION (type
) == 128)
2528 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2531 /* Allow for cases where TYPE is not one of the shared
2532 integer type nodes and write a "vendor extended builtin
2533 type" with a name the form intN or uintN, respectively.
2534 Situations like this can happen if you have an
2535 __attribute__((__mode__(__SI__))) type and use exotic
2536 switches like '-mint8' on AVR. Of course, this is
2537 undefined by the C++ ABI (and '-mint8' is not even
2538 Standard C conforming), but when using such special
2539 options you're pretty much in nowhere land anyway. */
2541 char prec
[11]; /* up to ten digits for an unsigned */
2543 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2544 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2545 write_char ('u'); /* "vendor extended builtin type" */
2546 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2547 write_string (prefix
);
2548 write_string (prec
);
2555 if (type
== float_type_node
)
2557 else if (type
== double_type_node
)
2559 else if (type
== long_double_type_node
)
2561 else if (type
== dfloat32_type_node
)
2562 write_string ("Df");
2563 else if (type
== dfloat64_type_node
)
2564 write_string ("Dd");
2565 else if (type
== dfloat128_type_node
)
2566 write_string ("De");
2571 case FIXED_POINT_TYPE
:
2572 write_string ("DF");
2573 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2574 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2575 if (type
== fract_type_node
2576 || type
== sat_fract_type_node
2577 || type
== accum_type_node
2578 || type
== sat_accum_type_node
)
2580 else if (type
== unsigned_fract_type_node
2581 || type
== sat_unsigned_fract_type_node
2582 || type
== unsigned_accum_type_node
2583 || type
== sat_unsigned_accum_type_node
)
2585 else if (type
== short_fract_type_node
2586 || type
== sat_short_fract_type_node
2587 || type
== short_accum_type_node
2588 || type
== sat_short_accum_type_node
)
2590 else if (type
== unsigned_short_fract_type_node
2591 || type
== sat_unsigned_short_fract_type_node
2592 || type
== unsigned_short_accum_type_node
2593 || type
== sat_unsigned_short_accum_type_node
)
2595 else if (type
== long_fract_type_node
2596 || type
== sat_long_fract_type_node
2597 || type
== long_accum_type_node
2598 || type
== sat_long_accum_type_node
)
2600 else if (type
== unsigned_long_fract_type_node
2601 || type
== sat_unsigned_long_fract_type_node
2602 || type
== unsigned_long_accum_type_node
2603 || type
== sat_unsigned_long_accum_type_node
)
2605 else if (type
== long_long_fract_type_node
2606 || type
== sat_long_long_fract_type_node
2607 || type
== long_long_accum_type_node
2608 || type
== sat_long_long_accum_type_node
)
2610 else if (type
== unsigned_long_long_fract_type_node
2611 || type
== sat_unsigned_long_long_fract_type_node
2612 || type
== unsigned_long_long_accum_type_node
2613 || type
== sat_unsigned_long_long_accum_type_node
)
2616 sorry ("mangling unknown fixed point type");
2617 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2618 if (TYPE_SATURATING (type
))
2629 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2630 METHOD_TYPE. The return type is mangled before the parameter
2633 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2636 write_function_type (const tree type
)
2638 MANGLE_TRACE_TREE ("function-type", type
);
2640 /* For a pointer to member function, the function type may have
2641 cv-qualifiers, indicating the quals for the artificial 'this'
2643 if (TREE_CODE (type
) == METHOD_TYPE
)
2645 /* The first parameter must be a POINTER_TYPE pointing to the
2646 `this' parameter. */
2647 tree this_type
= class_of_this_parm (type
);
2648 write_CV_qualifiers_for_type (this_type
);
2651 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2653 if (tx_safe_fn_type_p (type
))
2654 write_string ("Dx");
2657 /* We don't track whether or not a type is `extern "C"'. Note that
2658 you can have an `extern "C"' function that does not have
2659 `extern "C"' type, and vice versa:
2661 extern "C" typedef void function_t();
2662 function_t f; // f has C++ linkage, but its type is
2665 typedef void function_t();
2666 extern "C" function_t f; // Vice versa.
2669 write_bare_function_type (type
, /*include_return_type_p=*/1,
2671 if (FUNCTION_REF_QUALIFIED (type
))
2673 if (FUNCTION_RVALUE_QUALIFIED (type
))
2681 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2682 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2683 is mangled before the parameter types. If non-NULL, DECL is
2684 FUNCTION_DECL for the function whose type is being emitted. */
2687 write_bare_function_type (const tree type
, const int include_return_type_p
,
2690 MANGLE_TRACE_TREE ("bare-function-type", type
);
2692 /* Mangle the return type, if requested. */
2693 if (include_return_type_p
)
2694 write_type (TREE_TYPE (type
));
2696 /* Now mangle the types of the arguments. */
2698 write_method_parms (TYPE_ARG_TYPES (type
),
2699 TREE_CODE (type
) == METHOD_TYPE
,
2704 /* Write the mangled representation of a method parameter list of
2705 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2706 considered a non-static method, and the this parameter is omitted.
2707 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2708 parameters are being emitted. */
2711 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2713 tree first_parm_type
;
2714 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2716 /* Assume this parameter type list is variable-length. If it ends
2717 with a void type, then it's not. */
2720 /* If this is a member function, skip the first arg, which is the
2722 "Member functions do not encode the type of their implicit this
2725 Similarly, there's no need to mangle artificial parameters, like
2726 the VTT parameters for constructors and destructors. */
2729 parm_types
= TREE_CHAIN (parm_types
);
2730 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2732 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2734 parm_types
= TREE_CHAIN (parm_types
);
2735 parm_decl
= DECL_CHAIN (parm_decl
);
2738 if (decl
&& ctor_omit_inherited_parms (decl
))
2739 /* Bring back parameters omitted from an inherited ctor. */
2740 parm_types
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl
));
2743 for (first_parm_type
= parm_types
;
2745 parm_types
= TREE_CHAIN (parm_types
))
2747 tree parm
= TREE_VALUE (parm_types
);
2748 if (parm
== void_type_node
)
2750 /* "Empty parameter lists, whether declared as () or
2751 conventionally as (void), are encoded with a void parameter
2753 if (parm_types
== first_parm_type
)
2755 /* If the parm list is terminated with a void type, it's
2758 /* A void type better be the last one. */
2759 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2766 /* <builtin-type> ::= z # ellipsis */
2770 /* <class-enum-type> ::= <name> */
2773 write_class_enum_type (const tree type
)
2775 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2778 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2781 <template-args> ::= I <template-arg>* E */
2784 write_template_args (tree args
)
2789 MANGLE_TRACE_TREE ("template-args", args
);
2794 length
= TREE_VEC_LENGTH (args
);
2796 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2798 /* We have nested template args. We want the innermost template
2800 args
= TREE_VEC_ELT (args
, length
- 1);
2801 length
= TREE_VEC_LENGTH (args
);
2803 for (i
= 0; i
< length
; ++i
)
2804 write_template_arg (TREE_VEC_ELT (args
, i
));
2811 <unqualified-name> <template-args>
2812 part of SCOPE_REF or COMPONENT_REF mangling. */
2815 write_member_name (tree member
)
2817 if (identifier_p (member
))
2819 if (abi_version_at_least (11) && IDENTIFIER_ANY_OP_P (member
))
2821 write_string ("on");
2822 if (abi_warn_or_compat_version_crosses (11))
2823 G
.need_abi_warning
= 1;
2825 write_unqualified_id (member
);
2827 else if (DECL_P (member
))
2828 write_unqualified_name (member
);
2829 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2831 tree name
= TREE_OPERAND (member
, 0);
2832 name
= OVL_FIRST (name
);
2833 write_member_name (name
);
2834 write_template_args (TREE_OPERAND (member
, 1));
2837 write_expression (member
);
2840 /* <expression> ::= <unary operator-name> <expression>
2841 ::= <binary operator-name> <expression> <expression>
2844 <expr-primary> ::= <template-param>
2845 ::= L <type> <value number> E # literal
2846 ::= L <mangled-name> E # external name
2847 ::= st <type> # sizeof
2848 ::= sr <type> <unqualified-name> # dependent name
2849 ::= sr <type> <unqualified-name> <template-args> */
2852 write_expression (tree expr
)
2854 enum tree_code code
= TREE_CODE (expr
);
2856 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2857 argument is converted (via qualification conversions) to another type. */
2858 while (CONVERT_EXPR_CODE_P (code
)
2859 /* Parentheses aren't mangled. */
2860 || code
== PAREN_EXPR
2861 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2863 expr
= TREE_OPERAND (expr
, 0);
2864 code
= TREE_CODE (expr
);
2867 if (code
== BASELINK
2868 && (!type_unknown_p (expr
)
2869 || !BASELINK_QUALIFIED_P (expr
)))
2871 expr
= BASELINK_FUNCTIONS (expr
);
2872 code
= TREE_CODE (expr
);
2875 /* Handle pointers-to-members by making them look like expression
2877 if (code
== PTRMEM_CST
)
2879 expr
= build_nt (ADDR_EXPR
,
2880 build_qualified_name (/*type=*/NULL_TREE
,
2881 PTRMEM_CST_CLASS (expr
),
2882 PTRMEM_CST_MEMBER (expr
),
2883 /*template_p=*/false));
2884 code
= TREE_CODE (expr
);
2887 /* Handle template parameters. */
2888 if (code
== TEMPLATE_TYPE_PARM
2889 || code
== TEMPLATE_TEMPLATE_PARM
2890 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2891 || code
== TEMPLATE_PARM_INDEX
)
2892 write_template_param (expr
);
2893 /* Handle literals. */
2894 else if (TREE_CODE_CLASS (code
) == tcc_constant
2895 || code
== CONST_DECL
)
2896 write_template_arg_literal (expr
);
2897 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2899 gcc_assert (id_equal (DECL_NAME (expr
), "this"));
2900 write_string ("fpT");
2902 else if (code
== PARM_DECL
)
2904 /* A function parameter used in a late-specified return type. */
2905 int index
= DECL_PARM_INDEX (expr
);
2906 int level
= DECL_PARM_LEVEL (expr
);
2907 int delta
= G
.parm_depth
- level
+ 1;
2908 gcc_assert (index
>= 1);
2912 if (abi_version_at_least (5))
2914 /* Let L be the number of function prototype scopes from the
2915 innermost one (in which the parameter reference occurs) up
2916 to (and including) the one containing the declaration of
2917 the referenced parameter. If the parameter declaration
2918 clause of the innermost function prototype scope has been
2919 completely seen, it is not counted (in that case -- which
2920 is perhaps the most common -- L can be zero). */
2922 write_unsigned_number (delta
- 1);
2924 if (abi_warn_or_compat_version_crosses (5))
2925 G
.need_abi_warning
= true;
2928 write_compact_number (index
- 1);
2930 else if (DECL_P (expr
))
2933 write_mangled_name (expr
, false);
2936 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2938 tree op
= TREE_OPERAND (expr
, 0);
2940 if (PACK_EXPANSION_P (op
))
2942 if (abi_warn_or_compat_version_crosses (11))
2943 G
.need_abi_warning
= true;
2944 if (abi_version_at_least (11))
2946 /* sZ rather than szDp. */
2947 write_string ("sZ");
2948 write_expression (PACK_EXPANSION_PATTERN (op
));
2953 if (SIZEOF_EXPR_TYPE_P (expr
))
2955 write_string ("st");
2956 write_type (TREE_TYPE (op
));
2958 else if (ARGUMENT_PACK_P (op
))
2960 tree args
= ARGUMENT_PACK_ARGS (op
);
2961 int length
= TREE_VEC_LENGTH (args
);
2962 if (abi_warn_or_compat_version_crosses (10))
2963 G
.need_abi_warning
= true;
2964 if (abi_version_at_least (10))
2966 /* sP <template-arg>* E # sizeof...(T), size of a captured
2967 template parameter pack from an alias template */
2968 write_string ("sP");
2969 for (int i
= 0; i
< length
; ++i
)
2970 write_template_arg (TREE_VEC_ELT (args
, i
));
2975 /* In GCC 5 we represented this sizeof wrong, with the effect
2976 that we mangled it as the last element of the pack. */
2977 tree arg
= TREE_VEC_ELT (args
, length
-1);
2980 write_string ("st");
2985 write_string ("sz");
2986 write_expression (arg
);
2990 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2992 write_string ("st");
2993 write_type (TREE_OPERAND (expr
, 0));
2998 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2999 && TYPE_P (TREE_OPERAND (expr
, 0)))
3001 write_string ("at");
3002 write_type (TREE_OPERAND (expr
, 0));
3004 else if (code
== SCOPE_REF
3005 || code
== BASELINK
)
3008 if (code
== SCOPE_REF
)
3010 scope
= TREE_OPERAND (expr
, 0);
3011 member
= TREE_OPERAND (expr
, 1);
3012 gcc_assert (!BASELINK_P (member
));
3016 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
3017 member
= BASELINK_FUNCTIONS (expr
);
3020 /* If the MEMBER is a real declaration, then the qualifying
3021 scope was not dependent. Ideally, we would not have a
3022 SCOPE_REF in those cases, but sometimes we do. If the second
3023 argument is a DECL, then the name must not have been
3025 if (DECL_P (member
))
3026 write_expression (member
);
3029 write_string ("sr");
3031 write_member_name (member
);
3034 else if (INDIRECT_REF_P (expr
)
3035 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3036 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
3038 write_expression (TREE_OPERAND (expr
, 0));
3040 else if (identifier_p (expr
))
3042 /* An operator name appearing as a dependent name needs to be
3043 specially marked to disambiguate between a use of the operator
3044 name and a use of the operator in an expression. */
3045 if (IDENTIFIER_ANY_OP_P (expr
))
3046 write_string ("on");
3047 write_unqualified_id (expr
);
3049 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3051 tree fn
= TREE_OPERAND (expr
, 0);
3053 if (IDENTIFIER_ANY_OP_P (fn
))
3054 write_string ("on");
3055 write_unqualified_id (fn
);
3056 write_template_args (TREE_OPERAND (expr
, 1));
3058 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3060 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3061 const char *name
= OVL_OP_INFO (true, subop
)->mangled_name
;
3063 write_string (name
);
3064 write_expression (TREE_OPERAND (expr
, 0));
3065 write_expression (TREE_OPERAND (expr
, 2));
3067 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3069 /* ::= [gs] nw <expression>* _ <type> E
3070 ::= [gs] nw <expression>* _ <type> <initializer>
3071 ::= [gs] na <expression>* _ <type> E
3072 ::= [gs] na <expression>* _ <type> <initializer>
3073 <initializer> ::= pi <expression>* E */
3074 tree placement
= TREE_OPERAND (expr
, 0);
3075 tree type
= TREE_OPERAND (expr
, 1);
3076 tree nelts
= TREE_OPERAND (expr
, 2);
3077 tree init
= TREE_OPERAND (expr
, 3);
3080 gcc_assert (code
== NEW_EXPR
);
3081 if (TREE_OPERAND (expr
, 2))
3082 code
= VEC_NEW_EXPR
;
3084 if (NEW_EXPR_USE_GLOBAL (expr
))
3085 write_string ("gs");
3087 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3089 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3090 write_expression (TREE_VALUE (t
));
3097 ++processing_template_decl
;
3098 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3099 tf_warning_or_error
);
3100 type
= build_cplus_array_type (type
, domain
);
3101 --processing_template_decl
;
3105 if (init
&& TREE_CODE (init
) == TREE_LIST
3106 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3107 write_expression (TREE_VALUE (init
));
3111 write_string ("pi");
3112 if (init
&& init
!= void_node
)
3113 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3114 write_expression (TREE_VALUE (t
));
3118 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3120 gcc_assert (code
== DELETE_EXPR
);
3121 if (DELETE_EXPR_USE_VEC (expr
))
3122 code
= VEC_DELETE_EXPR
;
3124 if (DELETE_EXPR_USE_GLOBAL (expr
))
3125 write_string ("gs");
3127 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3129 write_expression (TREE_OPERAND (expr
, 0));
3131 else if (code
== THROW_EXPR
)
3133 tree op
= TREE_OPERAND (expr
, 0);
3136 write_string ("tw");
3137 write_expression (op
);
3140 write_string ("tr");
3142 else if (code
== CONSTRUCTOR
)
3144 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3145 unsigned i
; tree val
;
3147 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3148 write_string ("il");
3151 write_string ("tl");
3152 write_type (TREE_TYPE (expr
));
3154 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3155 write_expression (val
);
3158 else if (dependent_name (expr
))
3160 write_unqualified_id (dependent_name (expr
));
3168 /* When we bind a variable or function to a non-type template
3169 argument with reference type, we create an ADDR_EXPR to show
3170 the fact that the entity's address has been taken. But, we
3171 don't actually want to output a mangling code for the `&'. */
3172 if (TREE_CODE (expr
) == ADDR_EXPR
3174 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
3176 expr
= TREE_OPERAND (expr
, 0);
3179 write_expression (expr
);
3183 code
= TREE_CODE (expr
);
3186 if (code
== COMPONENT_REF
)
3188 tree ob
= TREE_OPERAND (expr
, 0);
3190 if (TREE_CODE (ob
) == ARROW_EXPR
)
3192 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3193 ob
= TREE_OPERAND (ob
, 0);
3194 write_expression (ob
);
3196 else if (!is_dummy_object (ob
))
3198 write_string ("dt");
3199 write_expression (ob
);
3201 /* else, for a non-static data member with no associated object (in
3202 unevaluated context), use the unresolved-name mangling. */
3204 write_member_name (TREE_OPERAND (expr
, 1));
3208 /* If it wasn't any of those, recursively expand the expression. */
3209 name
= OVL_OP_INFO (false, code
)->mangled_name
;
3211 /* We used to mangle const_cast and static_cast like a C cast. */
3212 if (code
== CONST_CAST_EXPR
3213 || code
== STATIC_CAST_EXPR
)
3215 if (abi_warn_or_compat_version_crosses (6))
3216 G
.need_abi_warning
= 1;
3217 if (!abi_version_at_least (6))
3218 name
= OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
;
3226 error ("use of built-in trait %qE in function signature; "
3227 "use library traits instead", expr
);
3231 sorry ("mangling %C", code
);
3237 write_string (name
);
3243 tree fn
= CALL_EXPR_FN (expr
);
3245 if (TREE_CODE (fn
) == ADDR_EXPR
)
3246 fn
= TREE_OPERAND (fn
, 0);
3248 /* Mangle a dependent name as the name, not whatever happens to
3249 be the first function in the overload set. */
3250 if ((TREE_CODE (fn
) == FUNCTION_DECL
3251 || TREE_CODE (fn
) == OVERLOAD
)
3252 && type_dependent_expression_p_push (expr
))
3255 write_expression (fn
);
3258 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3259 write_expression (CALL_EXPR_ARG (expr
, i
));
3264 write_type (TREE_TYPE (expr
));
3265 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3266 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3269 tree args
= TREE_OPERAND (expr
, 0);
3271 for (; args
; args
= TREE_CHAIN (args
))
3272 write_expression (TREE_VALUE (args
));
3277 case DYNAMIC_CAST_EXPR
:
3278 case REINTERPRET_CAST_EXPR
:
3279 case STATIC_CAST_EXPR
:
3280 case CONST_CAST_EXPR
:
3281 write_type (TREE_TYPE (expr
));
3282 write_expression (TREE_OPERAND (expr
, 0));
3285 case PREINCREMENT_EXPR
:
3286 case PREDECREMENT_EXPR
:
3287 if (abi_version_at_least (6))
3289 if (abi_warn_or_compat_version_crosses (6))
3290 G
.need_abi_warning
= 1;
3294 /* In the middle-end, some expressions have more operands than
3295 they do in templates (and mangling). */
3296 len
= cp_tree_operand_length (expr
);
3298 for (i
= 0; i
< len
; ++i
)
3300 tree operand
= TREE_OPERAND (expr
, i
);
3301 /* As a GNU extension, the middle operand of a
3302 conditional may be omitted. Since expression
3303 manglings are supposed to represent the input token
3304 stream, there's no good way to mangle such an
3305 expression without extending the C++ ABI. */
3306 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3308 error ("omitted middle operand to %<?:%> operand "
3309 "cannot be mangled");
3312 else if (FOLD_EXPR_P (expr
))
3314 /* The first 'operand' of a fold-expression is the operator
3315 that it folds over. */
3318 int fcode
= TREE_INT_CST_LOW (operand
);
3319 write_string (OVL_OP_INFO (false, fcode
)->mangled_name
);
3322 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3324 /* The order of operands of the binary left and right
3325 folds is the same, but we want to mangle them in
3326 lexical order, i.e. non-pack first. */
3328 operand
= FOLD_EXPR_INIT (expr
);
3330 operand
= FOLD_EXPR_PACK (expr
);
3332 if (PACK_EXPANSION_P (operand
))
3333 operand
= PACK_EXPANSION_PATTERN (operand
);
3335 write_expression (operand
);
3341 /* Literal subcase of non-terminal <template-arg>.
3343 "Literal arguments, e.g. "A<42L>", are encoded with their type
3344 and value. Negative integer values are preceded with "n"; for
3345 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3346 encoded as 0, true as 1." */
3349 write_template_arg_literal (const tree value
)
3352 write_type (TREE_TYPE (value
));
3354 /* Write a null member pointer value as (type)0, regardless of its
3355 real representation. */
3356 if (null_member_pointer_value_p (value
))
3357 write_integer_cst (integer_zero_node
);
3359 switch (TREE_CODE (value
))
3362 write_integer_cst (DECL_INITIAL (value
));
3366 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3367 || integer_zerop (value
) || integer_onep (value
));
3368 write_integer_cst (value
);
3372 write_real_cst (value
);
3376 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3377 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3379 write_integer_cst (TREE_REALPART (value
));
3381 write_integer_cst (TREE_IMAGPART (value
));
3383 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3384 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3386 write_real_cst (TREE_REALPART (value
));
3388 write_real_cst (TREE_IMAGPART (value
));
3395 sorry ("string literal in function template signature");
3405 /* Non-terminal <template-arg>.
3407 <template-arg> ::= <type> # type
3408 ::= L <type> </value/ number> E # literal
3409 ::= LZ <name> E # external name
3410 ::= X <expression> E # expression */
3413 write_template_arg (tree node
)
3415 enum tree_code code
= TREE_CODE (node
);
3417 MANGLE_TRACE_TREE ("template-arg", node
);
3419 /* A template template parameter's argument list contains TREE_LIST
3420 nodes of which the value field is the actual argument. */
3421 if (code
== TREE_LIST
)
3423 node
= TREE_VALUE (node
);
3424 /* If it's a decl, deal with its type instead. */
3427 node
= TREE_TYPE (node
);
3428 code
= TREE_CODE (node
);
3432 if (REFERENCE_REF_P (node
))
3433 node
= TREE_OPERAND (node
, 0);
3434 if (TREE_CODE (node
) == NOP_EXPR
3435 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3437 /* Template parameters can be of reference type. To maintain
3438 internal consistency, such arguments use a conversion from
3439 address of object to reference type. */
3440 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3441 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3444 if (TREE_CODE (node
) == BASELINK
3445 && !type_unknown_p (node
))
3447 if (abi_version_at_least (6))
3448 node
= BASELINK_FUNCTIONS (node
);
3449 if (abi_warn_or_compat_version_crosses (6))
3450 /* We wrongly wrapped a class-scope function in X/E. */
3451 G
.need_abi_warning
= 1;
3454 if (ARGUMENT_PACK_P (node
))
3456 /* Expand the template argument pack. */
3457 tree args
= ARGUMENT_PACK_ARGS (node
);
3458 int i
, length
= TREE_VEC_LENGTH (args
);
3459 if (abi_version_at_least (6))
3463 if (abi_warn_or_compat_version_crosses (6))
3464 G
.need_abi_warning
= 1;
3465 for (i
= 0; i
< length
; ++i
)
3466 write_template_arg (TREE_VEC_ELT (args
, i
));
3469 else if (TYPE_P (node
))
3471 else if (code
== TEMPLATE_DECL
)
3472 /* A template appearing as a template arg is a template template arg. */
3473 write_template_template_arg (node
);
3474 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3475 || code
== CONST_DECL
3476 || null_member_pointer_value_p (node
))
3477 write_template_arg_literal (node
);
3478 else if (DECL_P (node
))
3481 /* Until ABI version 3, the underscore before the mangled name
3482 was incorrectly omitted. */
3483 if (!abi_version_at_least (3))
3486 write_string ("_Z");
3487 if (abi_warn_or_compat_version_crosses (3))
3488 G
.need_abi_warning
= 1;
3489 write_encoding (node
);
3494 /* Template arguments may be expressions. */
3496 write_expression (node
);
3501 /* <template-template-arg>
3503 ::= <substitution> */
3506 write_template_template_arg (const tree decl
)
3508 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3510 if (find_substitution (decl
))
3512 write_name (decl
, /*ignore_local_scope=*/0);
3513 add_substitution (decl
);
3517 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3519 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3520 ::= A <expression> _ </element/ type>
3522 "Array types encode the dimension (number of elements) and the
3523 element type. For variable length arrays, the dimension (but not
3524 the '_' separator) is omitted."
3525 Note that for flexible array members, like for other arrays of
3526 unspecified size, the dimension is also omitted. */
3529 write_array_type (const tree type
)
3532 if (TYPE_DOMAIN (type
))
3536 index_type
= TYPE_DOMAIN (type
);
3537 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3538 It's null for flexible array members which have no upper bound
3539 (this is a change from GCC 5 and prior where such members were
3540 incorrectly mangled as zero-length arrays). */
3541 if (tree max
= TYPE_MAX_VALUE (index_type
))
3543 if (TREE_CODE (max
) == INTEGER_CST
)
3545 /* The ABI specifies that we should mangle the number of
3546 elements in the array, not the largest allowed index. */
3547 offset_int wmax
= wi::to_offset (max
) + 1;
3548 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3549 number of elements as zero. */
3550 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3551 gcc_assert (wi::fits_uhwi_p (wmax
));
3552 write_unsigned_number (wmax
.to_uhwi ());
3556 max
= TREE_OPERAND (max
, 0);
3557 write_expression (max
);
3562 write_type (TREE_TYPE (type
));
3565 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3566 variables. TYPE is a pointer-to-member POINTER_TYPE.
3568 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3571 write_pointer_to_member_type (const tree type
)
3574 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3575 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3578 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3579 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3580 TEMPLATE_PARM_INDEX.
3582 <template-param> ::= T </parameter/ number> _ */
3585 write_template_param (const tree parm
)
3589 MANGLE_TRACE_TREE ("template-parm", parm
);
3591 switch (TREE_CODE (parm
))
3593 case TEMPLATE_TYPE_PARM
:
3594 case TEMPLATE_TEMPLATE_PARM
:
3595 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3596 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3599 case TEMPLATE_PARM_INDEX
:
3600 parm_index
= TEMPLATE_PARM_IDX (parm
);
3608 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3609 earliest template param denoted by `_'. */
3610 write_compact_number (parm_index
);
3613 /* <template-template-param>
3614 ::= <template-param>
3615 ::= <substitution> */
3618 write_template_template_param (const tree parm
)
3620 tree templ
= NULL_TREE
;
3622 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3623 template template parameter. The substitution candidate here is
3624 only the template. */
3625 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3628 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3629 if (find_substitution (templ
))
3633 /* <template-param> encodes only the template parameter position,
3634 not its template arguments, which is fine here. */
3635 write_template_param (parm
);
3637 add_substitution (templ
);
3640 /* Non-terminal <substitution>.
3642 <substitution> ::= S <seq-id> _
3646 write_substitution (const int seq_id
)
3648 MANGLE_TRACE ("substitution", "");
3652 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3656 /* Start mangling ENTITY. */
3659 start_mangling (const tree entity
)
3662 G
.need_abi_warning
= false;
3663 G
.need_cxx17_warning
= false;
3664 obstack_free (&name_obstack
, name_base
);
3665 mangle_obstack
= &name_obstack
;
3666 name_base
= obstack_alloc (&name_obstack
, 0);
3669 /* Done with mangling. If WARN is true, and the name of G.entity will
3670 be mangled differently in a future version of the ABI, issue a
3674 finish_mangling_internal (void)
3676 /* Clear all the substitutions. */
3677 vec_safe_truncate (G
.substitutions
, 0);
3679 /* Null-terminate the string. */
3684 /* Like finish_mangling_internal, but return the mangled string. */
3686 static inline const char *
3687 finish_mangling (void)
3689 finish_mangling_internal ();
3690 return (const char *) obstack_finish (mangle_obstack
);
3693 /* Like finish_mangling_internal, but return an identifier. */
3696 finish_mangling_get_identifier (void)
3698 finish_mangling_internal ();
3699 /* Don't obstack_finish here, and the next start_mangling will
3700 remove the identifier. */
3701 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3704 /* Initialize data structures for mangling. */
3709 gcc_obstack_init (&name_obstack
);
3710 name_base
= obstack_alloc (&name_obstack
, 0);
3711 vec_alloc (G
.substitutions
, 0);
3713 /* Cache these identifiers for quick comparison when checking for
3714 standard substitutions. */
3715 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3716 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3717 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3718 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3719 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3720 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3723 /* Generate the mangled name of DECL. */
3726 mangle_decl_string (const tree decl
)
3729 location_t saved_loc
= input_location
;
3730 tree saved_fn
= NULL_TREE
;
3731 bool template_p
= false;
3733 /* We shouldn't be trying to mangle an uninstantiated template. */
3734 gcc_assert (!type_dependent_expression_p (decl
));
3736 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3738 struct tinst_level
*tl
= current_instantiation ();
3739 if ((!tl
|| tl
->decl
!= decl
)
3740 && push_tinst_level (decl
))
3743 saved_fn
= current_function_decl
;
3744 current_function_decl
= NULL_TREE
;
3747 input_location
= DECL_SOURCE_LOCATION (decl
);
3749 start_mangling (decl
);
3751 if (TREE_CODE (decl
) == TYPE_DECL
)
3752 write_type (TREE_TYPE (decl
));
3754 write_mangled_name (decl
, true);
3756 result
= finish_mangling_get_identifier ();
3758 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3759 IDENTIFIER_POINTER (result
));
3764 current_function_decl
= saved_fn
;
3766 input_location
= saved_loc
;
3771 /* Return an identifier for the external mangled name of DECL. */
3774 get_mangled_id (tree decl
)
3776 tree id
= mangle_decl_string (decl
);
3777 return targetm
.mangle_decl_assembler_name (decl
, id
);
3780 /* Create an identifier for the external mangled name of DECL. */
3783 mangle_decl (const tree decl
)
3788 /* Don't bother mangling uninstantiated templates. */
3789 ++processing_template_decl
;
3790 if (TREE_CODE (decl
) == TYPE_DECL
)
3791 dep
= dependent_type_p (TREE_TYPE (decl
));
3793 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3794 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3795 --processing_template_decl
;
3799 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3800 It is not needed to assign names to anonymous namespace, but we use the
3801 "<anon>" marker to be able to tell if type is C++ ODR type or type
3802 produced by other language. */
3803 if (TREE_CODE (decl
) == TYPE_DECL
3804 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3805 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3806 id
= get_identifier ("<anon>");
3809 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3810 || !no_linkage_check (TREE_TYPE (decl
), true));
3811 if (abi_version_at_least (10))
3812 if (tree fn
= decl_function_context (decl
))
3813 maybe_check_abi_tags (fn
, decl
);
3814 id
= get_mangled_id (decl
);
3816 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3818 if (G
.need_cxx17_warning
3819 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
3820 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wnoexcept_type
,
3821 "mangled name for %qD will change in C++17 because the "
3822 "exception specification is part of a function type",
3825 if (id
!= DECL_NAME (decl
)
3826 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3827 && TREE_CODE (decl
) != TYPE_DECL
3828 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3829 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3831 int save_ver
= flag_abi_version
;
3832 tree id2
= NULL_TREE
;
3834 if (!DECL_REALLY_EXTERN (decl
))
3836 record_mangling (decl
, G
.need_abi_warning
);
3838 if (!G
.need_abi_warning
)
3841 flag_abi_version
= flag_abi_compat_version
;
3842 id2
= mangle_decl_string (decl
);
3843 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3844 flag_abi_version
= save_ver
;
3847 note_mangling_alias (decl
, id2
);
3852 const char fabi_version
[] = "-fabi-version";
3854 if (flag_abi_compat_version
!= warn_abi_version
3855 || id2
== NULL_TREE
)
3857 flag_abi_version
= warn_abi_version
;
3858 id2
= mangle_decl_string (decl
);
3859 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3861 flag_abi_version
= save_ver
;
3865 else if (warn_abi_version
!= 0
3866 && abi_version_at_least (warn_abi_version
))
3867 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3868 "the mangled name of %qD changed between "
3869 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3870 G
.entity
, fabi_version
, warn_abi_version
, id2
,
3871 fabi_version
, save_ver
, id
);
3873 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3874 "the mangled name of %qD changes between "
3875 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
3876 G
.entity
, fabi_version
, save_ver
, id
,
3877 fabi_version
, warn_abi_version
, id2
);
3880 flag_abi_version
= save_ver
;
3884 /* Generate the mangled representation of TYPE. */
3887 mangle_type_string (const tree type
)
3891 start_mangling (type
);
3893 result
= finish_mangling ();
3895 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3899 /* Create an identifier for the mangled name of a special component
3900 for belonging to TYPE. CODE is the ABI-specified code for this
3904 mangle_special_for_type (const tree type
, const char *code
)
3908 /* We don't have an actual decl here for the special component, so
3909 we can't just process the <encoded-name>. Instead, fake it. */
3910 start_mangling (type
);
3912 /* Start the mangling. */
3913 write_string ("_Z");
3914 write_string (code
);
3918 result
= finish_mangling_get_identifier ();
3921 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3922 IDENTIFIER_POINTER (result
));
3927 /* Create an identifier for the mangled representation of the typeinfo
3928 structure for TYPE. */
3931 mangle_typeinfo_for_type (const tree type
)
3933 return mangle_special_for_type (type
, "TI");
3936 /* Create an identifier for the mangled name of the NTBS containing
3937 the mangled name of TYPE. */
3940 mangle_typeinfo_string_for_type (const tree type
)
3942 return mangle_special_for_type (type
, "TS");
3945 /* Create an identifier for the mangled name of the vtable for TYPE. */
3948 mangle_vtbl_for_type (const tree type
)
3950 return mangle_special_for_type (type
, "TV");
3953 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3956 mangle_vtt_for_type (const tree type
)
3958 return mangle_special_for_type (type
, "TT");
3961 /* Returns an identifier for the mangled name of the decomposition
3962 artificial variable DECL. DECLS is the vector of the VAR_DECLs
3963 for the identifier-list. */
3966 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
3968 gcc_assert (!type_dependent_expression_p (decl
));
3970 location_t saved_loc
= input_location
;
3971 input_location
= DECL_SOURCE_LOCATION (decl
);
3973 start_mangling (decl
);
3974 write_string ("_Z");
3976 tree context
= decl_mangling_context (decl
);
3977 gcc_assert (context
!= NULL_TREE
);
3979 bool nested
= false;
3980 if (DECL_NAMESPACE_STD_P (context
))
3981 write_string ("St");
3982 else if (context
!= global_namespace
)
3986 write_prefix (decl_mangling_context (decl
));
3989 write_string ("DC");
3992 FOR_EACH_VEC_ELT (decls
, i
, d
)
3993 write_unqualified_name (d
);
3999 tree id
= finish_mangling_get_identifier ();
4001 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4002 IDENTIFIER_POINTER (id
));
4004 input_location
= saved_loc
;
4008 /* Return an identifier for a construction vtable group. TYPE is
4009 the most derived class in the hierarchy; BINFO is the base
4010 subobject for which this construction vtable group will be used.
4012 This mangling isn't part of the ABI specification; in the ABI
4013 specification, the vtable group is dumped in the same COMDAT as the
4014 main vtable, and is referenced only from that vtable, so it doesn't
4015 need an external name. For binary formats without COMDAT sections,
4016 though, we need external names for the vtable groups.
4018 We use the production
4020 <special-name> ::= CT <type> <offset number> _ <base type> */
4023 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4027 start_mangling (type
);
4029 write_string ("_Z");
4030 write_string ("TC");
4032 write_integer_cst (BINFO_OFFSET (binfo
));
4034 write_type (BINFO_TYPE (binfo
));
4036 result
= finish_mangling_get_identifier ();
4038 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4039 IDENTIFIER_POINTER (result
));
4043 /* Mangle a this pointer or result pointer adjustment.
4045 <call-offset> ::= h <fixed offset number> _
4046 ::= v <fixed offset number> _ <virtual offset number> _ */
4049 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4051 write_char (virtual_offset
? 'v' : 'h');
4053 /* For either flavor, write the fixed offset. */
4054 write_integer_cst (fixed_offset
);
4057 /* For a virtual thunk, add the virtual offset. */
4060 write_integer_cst (virtual_offset
);
4065 /* Return an identifier for the mangled name of a this-adjusting or
4066 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4067 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4068 is a virtual thunk, and it is the vtbl offset in
4069 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4070 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4071 thunk itself. A covariant thunk name always includes the adjustment
4072 for the this pointer, even if there is none.
4074 <special-name> ::= T <call-offset> <base encoding>
4075 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4079 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4080 tree virtual_offset
, tree thunk
)
4084 if (abi_version_at_least (11))
4085 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4087 start_mangling (fn_decl
);
4089 write_string ("_Z");
4092 if (!this_adjusting
)
4094 /* Covariant thunk with no this adjustment */
4096 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4097 mangle_call_offset (fixed_offset
, virtual_offset
);
4099 else if (!DECL_THUNK_P (fn_decl
))
4100 /* Plain this adjusting thunk. */
4101 mangle_call_offset (fixed_offset
, virtual_offset
);
4104 /* This adjusting thunk to covariant thunk. */
4106 mangle_call_offset (fixed_offset
, virtual_offset
);
4107 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4108 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4110 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4111 mangle_call_offset (fixed_offset
, virtual_offset
);
4112 fn_decl
= THUNK_TARGET (fn_decl
);
4116 write_encoding (fn_decl
);
4118 result
= finish_mangling_get_identifier ();
4120 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4124 /* Handle ABI backwards compatibility for past bugs where we didn't call
4125 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4126 it makes a difference. If FOR_DECL is non-null, it's the declaration
4127 that we're actually trying to mangle; if it's null, we're mangling the
4128 guard variable for T. */
4131 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4133 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4136 tree oldtags
= get_abi_tags (t
);
4140 tree newtags
= get_abi_tags (t
);
4141 if (newtags
&& newtags
!= oldtags
4142 && abi_version_crosses (ver
))
4144 if (for_decl
&& DECL_THUNK_P (for_decl
))
4145 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4146 "the mangled name of a thunk for %qD changes between "
4147 "-fabi-version=%d and -fabi-version=%d",
4148 t
, flag_abi_version
, warn_abi_version
);
4150 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4151 "the mangled name of %qD changes between "
4152 "-fabi-version=%d and -fabi-version=%d",
4153 for_decl
, flag_abi_version
, warn_abi_version
);
4155 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4156 "the mangled name of the initialization guard variable "
4157 "for %qD changes between -fabi-version=%d and "
4159 t
, flag_abi_version
, warn_abi_version
);
4163 /* Write out the appropriate string for this variable when generating
4164 another mangled name based on this one. */
4167 write_guarded_var_name (const tree variable
)
4169 if (DECL_NAME (variable
)
4170 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4171 /* The name of a guard variable for a reference temporary should refer
4172 to the reference, not the temporary. */
4173 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4175 write_name (variable
, /*ignore_local_scope=*/0);
4178 /* Return an identifier for the name of an initialization guard
4179 variable for indicated VARIABLE. */
4182 mangle_guard_variable (const tree variable
)
4184 if (abi_version_at_least (10))
4185 maybe_check_abi_tags (variable
);
4186 start_mangling (variable
);
4187 write_string ("_ZGV");
4188 write_guarded_var_name (variable
);
4189 return finish_mangling_get_identifier ();
4192 /* Return an identifier for the name of a thread_local initialization
4193 function for VARIABLE. */
4196 mangle_tls_init_fn (const tree variable
)
4198 check_abi_tags (variable
);
4199 start_mangling (variable
);
4200 write_string ("_ZTH");
4201 write_guarded_var_name (variable
);
4202 return finish_mangling_get_identifier ();
4205 /* Return an identifier for the name of a thread_local wrapper
4206 function for VARIABLE. */
4208 #define TLS_WRAPPER_PREFIX "_ZTW"
4211 mangle_tls_wrapper_fn (const tree variable
)
4213 check_abi_tags (variable
);
4214 start_mangling (variable
);
4215 write_string (TLS_WRAPPER_PREFIX
);
4216 write_guarded_var_name (variable
);
4217 return finish_mangling_get_identifier ();
4220 /* Return true iff FN is a thread_local wrapper function. */
4223 decl_tls_wrapper_p (const tree fn
)
4225 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4227 tree name
= DECL_NAME (fn
);
4228 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4229 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4232 /* Return an identifier for the name of a temporary variable used to
4233 initialize a static reference. This isn't part of the ABI, but we might
4234 as well call them something readable. */
4236 static GTY(()) int temp_count
;
4239 mangle_ref_init_variable (const tree variable
)
4241 start_mangling (variable
);
4242 write_string ("_ZGR");
4243 check_abi_tags (variable
);
4244 write_name (variable
, /*ignore_local_scope=*/0);
4245 /* Avoid name clashes with aggregate initialization of multiple
4246 references at once. */
4247 write_unsigned_number (temp_count
++);
4248 return finish_mangling_get_identifier ();
4251 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4252 function generates a mangled name for the vtable map variable of
4253 the class type. For example, if the class type is
4254 "std::bad_exception", the mangled name for the class is
4255 "St13bad_exception". This function would generate the name
4256 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4257 "_VTV<std::bad_exception>::__vtable_map". */
4261 get_mangled_vtable_map_var_name (tree class_type
)
4263 char *var_name
= NULL
;
4264 const char *prefix
= "_ZN4_VTVI";
4265 const char *postfix
= "E12__vtable_mapE";
4267 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4269 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4271 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4273 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4274 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4277 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4279 strlen (postfix
) + 1;
4281 var_name
= (char *) xmalloc (len
);
4283 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4288 #include "gt-cp-mangle.h"
projects / thirdparty / gcc.git / blob