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 (TYPE_LANG_SPECIFIC (NODE) != NULL \
85 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
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_cxx1z_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_cxx1z_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_TYPENAME_P (identifier
))
1265 write_conversion_operator_name (TREE_TYPE (identifier
));
1266 else if (IDENTIFIER_OPNAME_P (identifier
))
1269 const char *mangled_name
= NULL
;
1271 /* Unfortunately, there is no easy way to go from the
1272 name of the operator back to the corresponding tree
1274 for (i
= 0; i
< MAX_TREE_CODES
; ++i
)
1275 if (operator_name_info
[i
].identifier
== identifier
)
1277 /* The ABI says that we prefer binary operator
1278 names to unary operator names. */
1279 if (operator_name_info
[i
].arity
== 2)
1281 mangled_name
= operator_name_info
[i
].mangled_name
;
1284 else if (!mangled_name
)
1285 mangled_name
= operator_name_info
[i
].mangled_name
;
1287 else if (assignment_operator_name_info
[i
].identifier
1291 = assignment_operator_name_info
[i
].mangled_name
;
1294 write_string (mangled_name
);
1296 else if (UDLIT_OPER_P (identifier
))
1297 write_literal_operator_name (identifier
);
1299 write_source_name (identifier
);
1303 write_unqualified_name (tree decl
)
1305 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1307 if (identifier_p (decl
))
1309 write_unqualified_id (decl
);
1315 if (DECL_NAME (decl
) == NULL_TREE
)
1318 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1319 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1321 else if (DECL_DECLARES_FUNCTION_P (decl
))
1324 if (DECL_CONSTRUCTOR_P (decl
))
1325 write_special_name_constructor (decl
);
1326 else if (DECL_DESTRUCTOR_P (decl
))
1327 write_special_name_destructor (decl
);
1328 else if (DECL_CONV_FN_P (decl
))
1330 /* Conversion operator. Handle it right here.
1331 <operator> ::= cv <type> */
1333 if (decl_is_template_id (decl
, NULL
))
1336 fn_type
= get_mostly_instantiated_function_type (decl
);
1337 type
= TREE_TYPE (fn_type
);
1339 else if (FNDECL_USED_AUTO (decl
))
1340 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1341 ->x_auto_return_pattern
);
1343 type
= DECL_CONV_FN_TYPE (decl
);
1344 write_conversion_operator_name (type
);
1346 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1348 operator_name_info_t
*oni
;
1349 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1350 oni
= assignment_operator_name_info
;
1352 oni
= operator_name_info
;
1354 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1356 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1357 write_literal_operator_name (DECL_NAME (decl
));
1364 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1365 && DECL_NAMESPACE_SCOPE_P (decl
)
1366 && decl_linkage (decl
) == lk_internal
)
1368 MANGLE_TRACE_TREE ("local-source-name", decl
);
1370 write_source_name (DECL_NAME (decl
));
1371 /* The default discriminator is 1, and that's all we ever use,
1372 so there's no code to output one here. */
1376 tree type
= TREE_TYPE (decl
);
1378 if (TREE_CODE (decl
) == TYPE_DECL
1379 && TYPE_UNNAMED_P (type
))
1380 write_unnamed_type_name (type
);
1381 else if (TREE_CODE (decl
) == TYPE_DECL
1382 && LAMBDA_TYPE_P (type
))
1383 write_closure_type_name (type
);
1385 write_source_name (DECL_NAME (decl
));
1388 /* We use the ABI tags from the primary class template, ignoring tags on any
1389 specializations. This is necessary because C++ doesn't require a
1390 specialization to be declared before it is used unless the use requires a
1391 complete type, but we need to get the tags right on incomplete types as
1393 if (tree tmpl
= most_general_template (decl
))
1395 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1396 if (res
== NULL_TREE
)
1397 /* UNBOUND_CLASS_TEMPLATE. */;
1398 else if (DECL_DECLARES_TYPE_P (decl
))
1400 else if (any_abi_below (11))
1402 /* ABI v10 implicit tags on the template. */
1403 tree mtags
= missing_abi_tags (res
);
1404 /* Explicit tags on the template. */
1405 tree ttags
= get_abi_tags (res
);
1406 /* Tags on the instantiation. */
1407 tree dtags
= get_abi_tags (decl
);
1409 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1410 G
.need_abi_warning
= 1;
1412 /* Add the v10 tags to the explicit tags now. */
1413 mtags
= chainon (mtags
, ttags
);
1415 if (!G
.need_abi_warning
1416 && abi_warn_or_compat_version_crosses (11)
1417 && !equal_abi_tags (dtags
, mtags
))
1418 G
.need_abi_warning
= 1;
1420 if (!abi_version_at_least (10))
1421 /* In abi <10, we only got the explicit tags. */
1423 else if (flag_abi_version
== 10)
1425 /* In ABI 10, we want explict and implicit tags. */
1426 write_abi_tags (mtags
);
1432 tree tags
= get_abi_tags (decl
);
1433 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1434 && any_abi_below (11))
1435 if (tree mtags
= missing_abi_tags (decl
))
1437 if (abi_warn_or_compat_version_crosses (11))
1438 G
.need_abi_warning
= true;
1439 if (!abi_version_at_least (11))
1440 tags
= chainon (mtags
, tags
);
1442 write_abi_tags (tags
);
1445 /* Write the unqualified-name for a conversion operator to TYPE. */
1448 write_conversion_operator_name (const tree type
)
1450 write_string ("cv");
1454 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1456 <source-name> ::= </length/ number> <identifier> */
1459 write_source_name (tree identifier
)
1461 MANGLE_TRACE_TREE ("source-name", identifier
);
1463 /* Never write the whole template-id name including the template
1464 arguments; we only want the template name. */
1465 if (IDENTIFIER_TEMPLATE (identifier
))
1466 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1468 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1469 write_identifier (IDENTIFIER_POINTER (identifier
));
1472 /* Compare two TREE_STRINGs like strcmp. */
1475 tree_string_cmp (const void *p1
, const void *p2
)
1479 tree s1
= *(const tree
*)p1
;
1480 tree s2
= *(const tree
*)p2
;
1481 return strcmp (TREE_STRING_POINTER (s1
),
1482 TREE_STRING_POINTER (s2
));
1485 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1487 static vec
<tree
, va_gc
> *
1488 sorted_abi_tags (tree tags
)
1490 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1492 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1494 if (ABI_TAG_IMPLICIT (t
))
1496 tree str
= TREE_VALUE (t
);
1497 vec_safe_push (vec
, str
);
1500 vec
->qsort (tree_string_cmp
);
1505 /* ID is the name of a function or type with abi_tags attribute TAGS.
1506 Write out the name, suitably decorated. */
1509 write_abi_tags (tree tags
)
1511 if (tags
== NULL_TREE
)
1514 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1516 unsigned i
; tree str
;
1517 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1520 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1521 write_identifier (TREE_STRING_POINTER (str
));
1524 release_tree_vector (vec
);
1527 /* Simplified unique_ptr clone to release a tree vec on exit. */
1529 struct releasing_vec
1531 typedef vec
<tree
, va_gc
> vec_t
;
1533 releasing_vec (vec_t
*v
): v(v
) { }
1534 releasing_vec (): v(make_tree_vector ()) { }
1536 vec_t
&operator* () const { return *v
; }
1537 vec_t
*operator-> () const { return v
; }
1538 vec_t
*get () const { return v
; }
1539 operator vec_t
*() const { return v
; }
1540 tree
& operator[] (unsigned i
) const { return (*v
)[i
]; }
1542 ~releasing_vec() { release_tree_vector (v
); }
1547 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1550 equal_abi_tags (tree t1
, tree t2
)
1552 releasing_vec v1
= sorted_abi_tags (t1
);
1553 releasing_vec v2
= sorted_abi_tags (t2
);
1555 unsigned len1
= v1
->length();
1556 if (len1
!= v2
->length())
1558 for (unsigned i
= 0; i
< len1
; ++i
)
1559 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1564 /* Write a user-defined literal operator.
1565 ::= li <source-name> # "" <source-name>
1566 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1569 write_literal_operator_name (tree identifier
)
1571 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1572 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1573 write_unsigned_number (strlen (suffix
));
1574 write_identifier (suffix
);
1577 /* Encode 0 as _, and 1+ as n-1_. */
1580 write_compact_number (int num
)
1583 write_unsigned_number (num
- 1);
1587 /* Return how many unnamed types precede TYPE in its enclosing class. */
1590 nested_anon_class_index (tree type
)
1593 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1594 for (; member
; member
= DECL_CHAIN (member
))
1595 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1597 tree memtype
= TREE_TYPE (member
);
1598 if (memtype
== type
)
1600 else if (TYPE_UNNAMED_P (memtype
))
1607 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1610 write_unnamed_type_name (const tree type
)
1613 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1615 if (TYPE_FUNCTION_SCOPE_P (type
))
1616 discriminator
= local_class_index (type
);
1617 else if (TYPE_CLASS_SCOPE_P (type
))
1618 discriminator
= nested_anon_class_index (type
);
1621 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1622 /* Just use the old mangling at namespace scope. */
1623 write_source_name (TYPE_IDENTIFIER (type
));
1627 write_string ("Ut");
1628 write_compact_number (discriminator
);
1631 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1632 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1635 write_closure_type_name (const tree type
)
1637 tree fn
= lambda_function (type
);
1638 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1639 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1641 MANGLE_TRACE_TREE ("closure-type-name", type
);
1643 write_string ("Ul");
1644 write_method_parms (parms
, /*method_p=*/1, fn
);
1646 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1649 /* Convert NUMBER to ascii using base BASE and generating at least
1650 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1651 into which to store the characters. Returns the number of
1652 characters generated (these will be laid out in advance of where
1656 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1657 char *buffer
, const unsigned int min_digits
)
1659 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1660 unsigned digits
= 0;
1664 unsigned HOST_WIDE_INT d
= number
/ base
;
1666 *--buffer
= base_digits
[number
- d
* base
];
1670 while (digits
< min_digits
)
1672 *--buffer
= base_digits
[0];
1678 /* Non-terminal <number>.
1680 <number> ::= [n] </decimal integer/> */
1683 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1684 const unsigned int base
)
1686 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1689 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1692 number
= -((HOST_WIDE_INT
) number
);
1694 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1695 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1698 /* Write out an integral CST in decimal. Most numbers are small, and
1699 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1700 bigger than that, which we must deal with. */
1703 write_integer_cst (const tree cst
)
1705 int sign
= tree_int_cst_sgn (cst
);
1706 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1707 if (!wi::fits_uhwi_p (abs_value
))
1709 /* A bignum. We do this in chunks, each of which fits in a
1711 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1712 unsigned HOST_WIDE_INT chunk
;
1713 unsigned chunk_digits
;
1714 char *ptr
= buffer
+ sizeof (buffer
);
1719 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1724 if (sizeof (HOST_WIDE_INT
) >= 8)
1726 /* It is at least 64 bits, so 10^18 is representable. */
1731 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1732 base
= build_int_cstu (type
, chunk
);
1733 n
= wide_int_to_tree (type
, cst
);
1738 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1742 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1743 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1746 done
= integer_zerop (d
);
1747 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1748 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1749 done
? 1 : chunk_digits
);
1755 write_chars (ptr
, count
);
1762 write_unsigned_number (abs_value
.to_uhwi ());
1766 /* Write out a floating-point literal.
1768 "Floating-point literals are encoded using the bit pattern of the
1769 target processor's internal representation of that number, as a
1770 fixed-length lowercase hexadecimal string, high-order bytes first
1771 (even if the target processor would store low-order bytes first).
1772 The "n" prefix is not used for floating-point literals; the sign
1773 bit is encoded with the rest of the number.
1775 Here are some examples, assuming the IEEE standard representation
1776 for floating point numbers. (Spaces are for readability, not
1777 part of the encoding.)
1780 -1.0f Lf bf80 0000 E
1781 1.17549435e-38f Lf 0080 0000 E
1782 1.40129846e-45f Lf 0000 0001 E
1783 0.0f Lf 0000 0000 E"
1785 Caller is responsible for the Lx and the E. */
1787 write_real_cst (const tree value
)
1789 long target_real
[4]; /* largest supported float */
1790 /* Buffer for eight hex digits in a 32-bit number but big enough
1791 even for 64-bit long to avoid warnings. */
1795 tree type
= TREE_TYPE (value
);
1796 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1798 real_to_target (target_real
, &TREE_REAL_CST (value
),
1801 /* The value in target_real is in the target word order,
1802 so we must write it out backward if that happens to be
1803 little-endian. write_number cannot be used, it will
1804 produce uppercase. */
1805 if (FLOAT_WORDS_BIG_ENDIAN
)
1806 i
= 0, limit
= words
, dir
= 1;
1808 i
= words
- 1, limit
= -1, dir
= -1;
1810 for (; i
!= limit
; i
+= dir
)
1812 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1813 write_chars (buffer
, 8);
1817 /* Non-terminal <identifier>.
1819 <identifier> ::= </unqualified source code identifier> */
1822 write_identifier (const char *identifier
)
1824 MANGLE_TRACE ("identifier", identifier
);
1825 write_string (identifier
);
1828 /* Handle constructor productions of non-terminal <special-name>.
1829 CTOR is a constructor FUNCTION_DECL.
1831 <special-name> ::= C1 # complete object constructor
1832 ::= C2 # base object constructor
1833 ::= C3 # complete object allocating constructor
1835 Currently, allocating constructors are never used. */
1838 write_special_name_constructor (const tree ctor
)
1841 bool new_inh
= (flag_new_inheriting_ctors
1842 && DECL_INHERITED_CTOR (ctor
));
1845 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1847 /* This is the old-style "[unified]" constructor.
1848 In some cases, we may emit this function and call
1849 it from the clones in order to share code and save space. */
1850 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1854 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1858 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1861 /* Handle destructor productions of non-terminal <special-name>.
1862 DTOR is a destructor FUNCTION_DECL.
1864 <special-name> ::= D0 # deleting (in-charge) destructor
1865 ::= D1 # complete object (in-charge) destructor
1866 ::= D2 # base object (not-in-charge) destructor */
1869 write_special_name_destructor (const tree dtor
)
1871 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1872 write_string ("D0");
1873 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1874 write_string ("D2");
1875 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1876 /* This is the old-style "[unified]" destructor.
1877 In some cases, we may emit this function and call
1878 it from the clones in order to share code and save space. */
1879 write_string ("D4");
1882 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1883 write_string ("D1");
1887 /* Scan the vector of local classes and return how many others with the
1888 same name (or same no name) and context precede ENTITY. */
1891 local_class_index (tree entity
)
1893 int ix
, discriminator
= 0;
1894 tree name
= (TYPE_UNNAMED_P (entity
) ? NULL_TREE
1895 : TYPE_IDENTIFIER (entity
));
1896 tree ctx
= TYPE_CONTEXT (entity
);
1897 for (ix
= 0; ; ix
++)
1899 tree type
= (*local_classes
)[ix
];
1901 return discriminator
;
1902 if (TYPE_CONTEXT (type
) == ctx
1903 && (name
? TYPE_IDENTIFIER (type
) == name
1904 : TYPE_UNNAMED_P (type
)))
1910 /* Return the discriminator for ENTITY appearing inside
1911 FUNCTION. The discriminator is the lexical ordinal of VAR among
1912 entities with the same name in the same FUNCTION. */
1915 discriminator_for_local_entity (tree entity
)
1917 if (DECL_DISCRIMINATOR_P (entity
))
1919 if (DECL_DISCRIMINATOR_SET_P (entity
))
1920 return DECL_DISCRIMINATOR (entity
);
1922 /* The first entity with a particular name doesn't get
1923 DECL_DISCRIMINATOR set up. */
1926 else if (TREE_CODE (entity
) == TYPE_DECL
)
1928 /* Scan the list of local classes. */
1929 entity
= TREE_TYPE (entity
);
1931 /* Lambdas and unnamed types have their own discriminators. */
1932 if (LAMBDA_TYPE_P (entity
) || TYPE_UNNAMED_P (entity
))
1935 return local_class_index (entity
);
1941 /* Return the discriminator for STRING, a string literal used inside
1942 FUNCTION. The discriminator is the lexical ordinal of STRING among
1943 string literals used in FUNCTION. */
1946 discriminator_for_string_literal (tree
/*function*/,
1949 /* For now, we don't discriminate amongst string literals. */
1953 /* <discriminator> := _ <number> # when number < 10
1954 := __ <number> _ # when number >= 10
1956 The discriminator is used only for the second and later occurrences
1957 of the same name within a single function. In this case <number> is
1958 n - 2, if this is the nth occurrence, in lexical order. */
1961 write_discriminator (const int discriminator
)
1963 /* If discriminator is zero, don't write anything. Otherwise... */
1964 if (discriminator
> 0)
1967 if (discriminator
- 1 >= 10)
1969 if (abi_warn_or_compat_version_crosses (11))
1970 G
.need_abi_warning
= 1;
1971 if (abi_version_at_least (11))
1974 write_unsigned_number (discriminator
- 1);
1975 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
1980 /* Mangle the name of a function-scope entity. FUNCTION is the
1981 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1982 default argument scope. ENTITY is the decl for the entity itself.
1983 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1984 either ENTITY itself or an enclosing scope of ENTITY.
1986 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1987 := Z <function encoding> E s [<discriminator>]
1988 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1991 write_local_name (tree function
, const tree local_entity
,
1994 tree parm
= NULL_TREE
;
1996 MANGLE_TRACE_TREE ("local-name", entity
);
1998 if (TREE_CODE (function
) == PARM_DECL
)
2001 function
= DECL_CONTEXT (parm
);
2005 write_encoding (function
);
2008 /* For this purpose, parameters are numbered from right-to-left. */
2013 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
2021 write_compact_number (i
- 1);
2024 if (TREE_CODE (entity
) == STRING_CST
)
2027 write_discriminator (discriminator_for_string_literal (function
,
2032 /* Now the <entity name>. Let write_name know its being called
2033 from <local-name>, so it doesn't try to process the enclosing
2034 function scope again. */
2035 write_name (entity
, /*ignore_local_scope=*/1);
2036 write_discriminator (discriminator_for_local_entity (local_entity
));
2040 /* Non-terminals <type> and <CV-qualifier>.
2042 <type> ::= <builtin-type>
2044 ::= <class-enum-type>
2046 ::= <pointer-to-member-type>
2047 ::= <template-param>
2050 ::= P <type> # pointer-to
2051 ::= R <type> # reference-to
2052 ::= C <type> # complex pair (C 2000)
2053 ::= G <type> # imaginary (C 2000) [not supported]
2054 ::= U <source-name> <type> # vendor extended type qualifier
2058 <type> ::= RR <type> # rvalue reference-to
2059 <type> ::= Dt <expression> # decltype of an id-expression or
2060 # class member access
2061 <type> ::= DT <expression> # decltype of an expression
2062 <type> ::= Dn # decltype of nullptr
2064 TYPE is a type node. */
2067 write_type (tree type
)
2069 /* This gets set to nonzero if TYPE turns out to be a (possibly
2070 CV-qualified) builtin type. */
2071 int is_builtin_type
= 0;
2073 MANGLE_TRACE_TREE ("type", type
);
2075 if (type
== error_mark_node
)
2078 type
= canonicalize_for_substitution (type
);
2079 if (find_substitution (type
))
2083 if (write_CV_qualifiers_for_type (type
) > 0)
2084 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2085 mangle the unqualified type. The recursive call is needed here
2086 since both the qualified and unqualified types are substitution
2089 tree t
= TYPE_MAIN_VARIANT (type
);
2090 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2092 tree attrs
= NULL_TREE
;
2093 if (tx_safe_fn_type_p (type
))
2094 attrs
= tree_cons (get_identifier ("transaction_safe"),
2096 t
= cp_build_type_attribute_variant (t
, attrs
);
2098 gcc_assert (t
!= type
);
2099 if (TREE_CODE (t
) == FUNCTION_TYPE
2100 || TREE_CODE (t
) == METHOD_TYPE
)
2102 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2103 if (abi_version_at_least (8)
2104 || type
== TYPE_MAIN_VARIANT (type
))
2105 /* Avoid adding the unqualified function type as a substitution. */
2106 write_function_type (t
);
2109 if (abi_warn_or_compat_version_crosses (8))
2110 G
.need_abi_warning
= 1;
2115 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2116 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2117 so that the cv-qualification of the element type is available
2118 in write_array_type. */
2119 write_array_type (type
);
2122 tree type_orig
= type
;
2124 /* See through any typedefs. */
2125 type
= TYPE_MAIN_VARIANT (type
);
2126 if (TREE_CODE (type
) == FUNCTION_TYPE
2127 || TREE_CODE (type
) == METHOD_TYPE
)
2129 type
= build_ref_qualified_type (type
, type_memfn_rqual (type_orig
));
2130 type
= build_exception_variant (type
,
2131 TYPE_RAISES_EXCEPTIONS (type_orig
));
2134 /* According to the C++ ABI, some library classes are passed the
2135 same as the scalar type of their single member and use the same
2137 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2138 type
= TREE_TYPE (first_field (type
));
2140 if (TYPE_PTRDATAMEM_P (type
))
2141 write_pointer_to_member_type (type
);
2144 /* Handle any target-specific fundamental types. */
2145 const char *target_mangling
2146 = targetm
.mangle_type (type_orig
);
2148 if (target_mangling
)
2150 write_string (target_mangling
);
2151 /* Add substitutions for types other than fundamental
2153 if (!VOID_TYPE_P (type
)
2154 && TREE_CODE (type
) != INTEGER_TYPE
2155 && TREE_CODE (type
) != REAL_TYPE
2156 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2157 add_substitution (type
);
2161 switch (TREE_CODE (type
))
2165 case INTEGER_TYPE
: /* Includes wchar_t. */
2167 case FIXED_POINT_TYPE
:
2169 /* If this is a typedef, TYPE may not be one of
2170 the standard builtin type nodes, but an alias of one. Use
2171 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2172 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2179 write_type (TREE_TYPE (type
));
2184 write_function_type (type
);
2190 /* A pointer-to-member function is represented as a special
2191 RECORD_TYPE, so check for this first. */
2192 if (TYPE_PTRMEMFUNC_P (type
))
2193 write_pointer_to_member_type (type
);
2195 write_class_enum_type (type
);
2199 case UNBOUND_CLASS_TEMPLATE
:
2200 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2201 ordinary nested names. */
2202 write_nested_name (TYPE_STUB_DECL (type
));
2206 case REFERENCE_TYPE
:
2207 if (TYPE_PTR_P (type
))
2209 else if (TYPE_REF_IS_RVALUE (type
))
2214 tree target
= TREE_TYPE (type
);
2215 /* Attribute const/noreturn are not reflected in mangling.
2216 We strip them here rather than at a lower level because
2217 a typedef or template argument can have function type
2218 with function-cv-quals (that use the same representation),
2219 but you can't have a pointer/reference to such a type. */
2220 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2222 if (abi_warn_or_compat_version_crosses (5)
2223 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2224 G
.need_abi_warning
= 1;
2225 if (abi_version_at_least (5))
2226 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2228 write_type (target
);
2232 case TEMPLATE_TYPE_PARM
:
2235 if (AUTO_IS_DECLTYPE (type
))
2236 write_identifier ("Dc");
2238 write_identifier ("Da");
2243 case TEMPLATE_PARM_INDEX
:
2244 write_template_param (type
);
2247 case TEMPLATE_TEMPLATE_PARM
:
2248 write_template_template_param (type
);
2251 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2252 write_template_template_param (type
);
2254 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2258 if (abi_version_at_least (4))
2260 write_string ("Dv");
2261 /* Non-constant vector size would be encoded with
2262 _ expression, but we don't support that yet. */
2263 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2267 write_string ("U8__vector");
2268 if (abi_warn_or_compat_version_crosses (4))
2269 G
.need_abi_warning
= 1;
2270 write_type (TREE_TYPE (type
));
2273 case TYPE_PACK_EXPANSION
:
2274 write_string ("Dp");
2275 write_type (PACK_EXPANSION_PATTERN (type
));
2279 /* These shouldn't make it into mangling. */
2280 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2281 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2283 /* In ABI <5, we stripped decltype of a plain decl. */
2284 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2286 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2287 tree etype
= NULL_TREE
;
2288 switch (TREE_CODE (expr
))
2295 case TEMPLATE_PARM_INDEX
:
2296 etype
= TREE_TYPE (expr
);
2303 if (etype
&& !type_uses_auto (etype
))
2305 if (abi_warn_or_compat_version_crosses (5))
2306 G
.need_abi_warning
= 1;
2307 if (!abi_version_at_least (5))
2316 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2320 ++cp_unevaluated_operand
;
2321 write_expression (DECLTYPE_TYPE_EXPR (type
));
2322 --cp_unevaluated_operand
;
2327 write_string ("Dn");
2328 if (abi_version_at_least (7))
2330 if (abi_warn_or_compat_version_crosses (7))
2331 G
.need_abi_warning
= 1;
2335 sorry ("mangling typeof, use decltype instead");
2338 case UNDERLYING_TYPE
:
2339 sorry ("mangling __underlying_type");
2351 /* Types other than builtin types are substitution candidates. */
2352 if (!is_builtin_type
)
2353 add_substitution (type
);
2356 /* qsort callback for sorting a vector of attribute entries. */
2359 attr_strcmp (const void *p1
, const void *p2
)
2361 tree a1
= *(const tree
*)p1
;
2362 tree a2
= *(const tree
*)p2
;
2364 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2365 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2367 return strcmp (as1
->name
, as2
->name
);
2370 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2371 CV-qualifiers written for TYPE.
2373 <CV-qualifiers> ::= [r] [V] [K] */
2376 write_CV_qualifiers_for_type (const tree type
)
2378 int num_qualifiers
= 0;
2380 /* The order is specified by:
2382 "In cases where multiple order-insensitive qualifiers are
2383 present, they should be ordered 'K' (closest to the base type),
2384 'V', 'r', and 'U' (farthest from the base type) ..." */
2386 /* Mangle attributes that affect type identity as extended qualifiers.
2388 We don't do this with classes and enums because their attributes
2389 are part of their definitions, not something added on. */
2391 if (!OVERLOAD_TYPE_P (type
))
2394 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2396 tree name
= get_attribute_name (a
);
2397 const attribute_spec
*as
= lookup_attribute_spec (name
);
2398 if (as
&& as
->affects_type_identity
2399 && !is_attribute_p ("transaction_safe", name
)
2400 && !is_attribute_p ("abi_tag", name
))
2403 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2404 G
.need_abi_warning
= true;
2405 if (abi_version_at_least (10))
2407 vec
.qsort (attr_strcmp
);
2408 while (!vec
.is_empty())
2411 const attribute_spec
*as
2412 = lookup_attribute_spec (get_attribute_name (a
));
2415 write_unsigned_number (strlen (as
->name
));
2416 write_string (as
->name
);
2420 for (tree args
= TREE_VALUE (a
); args
;
2421 args
= TREE_CHAIN (args
))
2423 tree arg
= TREE_VALUE (args
);
2424 write_template_arg (arg
);
2434 /* Note that we do not use cp_type_quals below; given "const
2435 int[3]", the "const" is emitted with the "int", not with the
2437 cp_cv_quals quals
= TYPE_QUALS (type
);
2439 if (quals
& TYPE_QUAL_RESTRICT
)
2444 if (quals
& TYPE_QUAL_VOLATILE
)
2449 if (quals
& TYPE_QUAL_CONST
)
2455 return num_qualifiers
;
2458 /* Non-terminal <builtin-type>.
2460 <builtin-type> ::= v # void
2465 ::= h # unsigned char
2467 ::= t # unsigned short
2469 ::= j # unsigned int
2471 ::= m # unsigned long
2472 ::= x # long long, __int64
2473 ::= y # unsigned long long, __int64
2475 ::= o # unsigned __int128
2478 ::= e # long double, __float80
2479 ::= g # __float128 [not supported]
2480 ::= u <source-name> # vendor extended type */
2483 write_builtin_type (tree type
)
2485 if (TYPE_CANONICAL (type
))
2486 type
= TYPE_CANONICAL (type
);
2488 switch (TREE_CODE (type
))
2499 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2500 isn't in integer_type_nodes. */
2501 if (type
== wchar_type_node
)
2503 else if (type
== char16_type_node
)
2504 write_string ("Ds");
2505 else if (type
== char32_type_node
)
2506 write_string ("Di");
2510 /* Assume TYPE is one of the shared integer type nodes. Find
2511 it in the array of these nodes. */
2513 for (itk
= 0; itk
< itk_none
; ++itk
)
2514 if (integer_types
[itk
] != NULL_TREE
2515 && integer_type_codes
[itk
] != '\0'
2516 && type
== integer_types
[itk
])
2518 /* Print the corresponding single-letter code. */
2519 write_char (integer_type_codes
[itk
]);
2523 if (itk
== itk_none
)
2525 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2526 TYPE_UNSIGNED (type
));
2533 if (TYPE_PRECISION (type
) == 128)
2534 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2537 /* Allow for cases where TYPE is not one of the shared
2538 integer type nodes and write a "vendor extended builtin
2539 type" with a name the form intN or uintN, respectively.
2540 Situations like this can happen if you have an
2541 __attribute__((__mode__(__SI__))) type and use exotic
2542 switches like '-mint8' on AVR. Of course, this is
2543 undefined by the C++ ABI (and '-mint8' is not even
2544 Standard C conforming), but when using such special
2545 options you're pretty much in nowhere land anyway. */
2547 char prec
[11]; /* up to ten digits for an unsigned */
2549 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2550 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2551 write_char ('u'); /* "vendor extended builtin type" */
2552 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2553 write_string (prefix
);
2554 write_string (prec
);
2561 if (type
== float_type_node
)
2563 else if (type
== double_type_node
)
2565 else if (type
== long_double_type_node
)
2567 else if (type
== dfloat32_type_node
)
2568 write_string ("Df");
2569 else if (type
== dfloat64_type_node
)
2570 write_string ("Dd");
2571 else if (type
== dfloat128_type_node
)
2572 write_string ("De");
2577 case FIXED_POINT_TYPE
:
2578 write_string ("DF");
2579 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2580 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2581 if (type
== fract_type_node
2582 || type
== sat_fract_type_node
2583 || type
== accum_type_node
2584 || type
== sat_accum_type_node
)
2586 else if (type
== unsigned_fract_type_node
2587 || type
== sat_unsigned_fract_type_node
2588 || type
== unsigned_accum_type_node
2589 || type
== sat_unsigned_accum_type_node
)
2591 else if (type
== short_fract_type_node
2592 || type
== sat_short_fract_type_node
2593 || type
== short_accum_type_node
2594 || type
== sat_short_accum_type_node
)
2596 else if (type
== unsigned_short_fract_type_node
2597 || type
== sat_unsigned_short_fract_type_node
2598 || type
== unsigned_short_accum_type_node
2599 || type
== sat_unsigned_short_accum_type_node
)
2601 else if (type
== long_fract_type_node
2602 || type
== sat_long_fract_type_node
2603 || type
== long_accum_type_node
2604 || type
== sat_long_accum_type_node
)
2606 else if (type
== unsigned_long_fract_type_node
2607 || type
== sat_unsigned_long_fract_type_node
2608 || type
== unsigned_long_accum_type_node
2609 || type
== sat_unsigned_long_accum_type_node
)
2611 else if (type
== long_long_fract_type_node
2612 || type
== sat_long_long_fract_type_node
2613 || type
== long_long_accum_type_node
2614 || type
== sat_long_long_accum_type_node
)
2616 else if (type
== unsigned_long_long_fract_type_node
2617 || type
== sat_unsigned_long_long_fract_type_node
2618 || type
== unsigned_long_long_accum_type_node
2619 || type
== sat_unsigned_long_long_accum_type_node
)
2622 sorry ("mangling unknown fixed point type");
2623 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2624 if (TYPE_SATURATING (type
))
2635 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2636 METHOD_TYPE. The return type is mangled before the parameter
2639 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2642 write_function_type (const tree type
)
2644 MANGLE_TRACE_TREE ("function-type", type
);
2646 /* For a pointer to member function, the function type may have
2647 cv-qualifiers, indicating the quals for the artificial 'this'
2649 if (TREE_CODE (type
) == METHOD_TYPE
)
2651 /* The first parameter must be a POINTER_TYPE pointing to the
2652 `this' parameter. */
2653 tree this_type
= class_of_this_parm (type
);
2654 write_CV_qualifiers_for_type (this_type
);
2657 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2659 if (tx_safe_fn_type_p (type
))
2660 write_string ("Dx");
2663 /* We don't track whether or not a type is `extern "C"'. Note that
2664 you can have an `extern "C"' function that does not have
2665 `extern "C"' type, and vice versa:
2667 extern "C" typedef void function_t();
2668 function_t f; // f has C++ linkage, but its type is
2671 typedef void function_t();
2672 extern "C" function_t f; // Vice versa.
2675 write_bare_function_type (type
, /*include_return_type_p=*/1,
2677 if (FUNCTION_REF_QUALIFIED (type
))
2679 if (FUNCTION_RVALUE_QUALIFIED (type
))
2687 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2688 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2689 is mangled before the parameter types. If non-NULL, DECL is
2690 FUNCTION_DECL for the function whose type is being emitted. */
2693 write_bare_function_type (const tree type
, const int include_return_type_p
,
2696 MANGLE_TRACE_TREE ("bare-function-type", type
);
2698 /* Mangle the return type, if requested. */
2699 if (include_return_type_p
)
2700 write_type (TREE_TYPE (type
));
2702 /* Now mangle the types of the arguments. */
2704 write_method_parms (TYPE_ARG_TYPES (type
),
2705 TREE_CODE (type
) == METHOD_TYPE
,
2710 /* Write the mangled representation of a method parameter list of
2711 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2712 considered a non-static method, and the this parameter is omitted.
2713 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2714 parameters are being emitted. */
2717 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2719 tree first_parm_type
;
2720 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2722 /* Assume this parameter type list is variable-length. If it ends
2723 with a void type, then it's not. */
2726 /* If this is a member function, skip the first arg, which is the
2728 "Member functions do not encode the type of their implicit this
2731 Similarly, there's no need to mangle artificial parameters, like
2732 the VTT parameters for constructors and destructors. */
2735 parm_types
= TREE_CHAIN (parm_types
);
2736 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2738 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2740 parm_types
= TREE_CHAIN (parm_types
);
2741 parm_decl
= DECL_CHAIN (parm_decl
);
2745 for (first_parm_type
= parm_types
;
2747 parm_types
= TREE_CHAIN (parm_types
))
2749 tree parm
= TREE_VALUE (parm_types
);
2750 if (parm
== void_type_node
)
2752 /* "Empty parameter lists, whether declared as () or
2753 conventionally as (void), are encoded with a void parameter
2755 if (parm_types
== first_parm_type
)
2757 /* If the parm list is terminated with a void type, it's
2760 /* A void type better be the last one. */
2761 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2768 /* <builtin-type> ::= z # ellipsis */
2772 /* <class-enum-type> ::= <name> */
2775 write_class_enum_type (const tree type
)
2777 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2780 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2783 <template-args> ::= I <template-arg>* E */
2786 write_template_args (tree args
)
2791 MANGLE_TRACE_TREE ("template-args", args
);
2796 length
= TREE_VEC_LENGTH (args
);
2798 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2800 /* We have nested template args. We want the innermost template
2802 args
= TREE_VEC_ELT (args
, length
- 1);
2803 length
= TREE_VEC_LENGTH (args
);
2805 for (i
= 0; i
< length
; ++i
)
2806 write_template_arg (TREE_VEC_ELT (args
, i
));
2813 <unqualified-name> <template-args>
2814 part of SCOPE_REF or COMPONENT_REF mangling. */
2817 write_member_name (tree member
)
2819 if (abi_version_at_least (11) && IDENTIFIER_OPNAME_P (member
))
2821 write_string ("on");
2822 if (abi_warn_or_compat_version_crosses (11))
2823 G
.need_abi_warning
= 1;
2825 if (identifier_p (member
))
2826 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 if (TREE_CODE (name
) == OVERLOAD
)
2833 name
= OVL_FUNCTION (name
);
2834 write_member_name (name
);
2835 write_template_args (TREE_OPERAND (member
, 1));
2838 write_expression (member
);
2841 /* <expression> ::= <unary operator-name> <expression>
2842 ::= <binary operator-name> <expression> <expression>
2845 <expr-primary> ::= <template-param>
2846 ::= L <type> <value number> E # literal
2847 ::= L <mangled-name> E # external name
2848 ::= st <type> # sizeof
2849 ::= sr <type> <unqualified-name> # dependent name
2850 ::= sr <type> <unqualified-name> <template-args> */
2853 write_expression (tree expr
)
2855 enum tree_code code
= TREE_CODE (expr
);
2857 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2858 argument is converted (via qualification conversions) to another type. */
2859 while (CONVERT_EXPR_CODE_P (code
)
2860 /* Parentheses aren't mangled. */
2861 || code
== PAREN_EXPR
2862 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2864 expr
= TREE_OPERAND (expr
, 0);
2865 code
= TREE_CODE (expr
);
2868 if (code
== BASELINK
2869 && (!type_unknown_p (expr
)
2870 || !BASELINK_QUALIFIED_P (expr
)))
2872 expr
= BASELINK_FUNCTIONS (expr
);
2873 code
= TREE_CODE (expr
);
2876 /* Handle pointers-to-members by making them look like expression
2878 if (code
== PTRMEM_CST
)
2880 expr
= build_nt (ADDR_EXPR
,
2881 build_qualified_name (/*type=*/NULL_TREE
,
2882 PTRMEM_CST_CLASS (expr
),
2883 PTRMEM_CST_MEMBER (expr
),
2884 /*template_p=*/false));
2885 code
= TREE_CODE (expr
);
2888 /* Handle template parameters. */
2889 if (code
== TEMPLATE_TYPE_PARM
2890 || code
== TEMPLATE_TEMPLATE_PARM
2891 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2892 || code
== TEMPLATE_PARM_INDEX
)
2893 write_template_param (expr
);
2894 /* Handle literals. */
2895 else if (TREE_CODE_CLASS (code
) == tcc_constant
2896 || code
== CONST_DECL
)
2897 write_template_arg_literal (expr
);
2898 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2900 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr
))));
2901 write_string ("fpT");
2903 else if (code
== PARM_DECL
)
2905 /* A function parameter used in a late-specified return type. */
2906 int index
= DECL_PARM_INDEX (expr
);
2907 int level
= DECL_PARM_LEVEL (expr
);
2908 int delta
= G
.parm_depth
- level
+ 1;
2909 gcc_assert (index
>= 1);
2913 if (abi_version_at_least (5))
2915 /* Let L be the number of function prototype scopes from the
2916 innermost one (in which the parameter reference occurs) up
2917 to (and including) the one containing the declaration of
2918 the referenced parameter. If the parameter declaration
2919 clause of the innermost function prototype scope has been
2920 completely seen, it is not counted (in that case -- which
2921 is perhaps the most common -- L can be zero). */
2923 write_unsigned_number (delta
- 1);
2925 if (abi_warn_or_compat_version_crosses (5))
2926 G
.need_abi_warning
= true;
2929 write_compact_number (index
- 1);
2931 else if (DECL_P (expr
))
2934 write_mangled_name (expr
, false);
2937 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2939 tree op
= TREE_OPERAND (expr
, 0);
2941 if (PACK_EXPANSION_P (op
))
2943 if (abi_warn_or_compat_version_crosses (11))
2944 G
.need_abi_warning
= true;
2945 if (abi_version_at_least (11))
2947 /* sZ rather than szDp. */
2948 write_string ("sZ");
2949 write_expression (PACK_EXPANSION_PATTERN (op
));
2954 if (SIZEOF_EXPR_TYPE_P (expr
))
2956 write_string ("st");
2957 write_type (TREE_TYPE (op
));
2959 else if (ARGUMENT_PACK_P (op
))
2961 tree args
= ARGUMENT_PACK_ARGS (op
);
2962 int length
= TREE_VEC_LENGTH (args
);
2963 if (abi_warn_or_compat_version_crosses (10))
2964 G
.need_abi_warning
= true;
2965 if (abi_version_at_least (10))
2967 /* sP <template-arg>* E # sizeof...(T), size of a captured
2968 template parameter pack from an alias template */
2969 write_string ("sP");
2970 for (int i
= 0; i
< length
; ++i
)
2971 write_template_arg (TREE_VEC_ELT (args
, i
));
2976 /* In GCC 5 we represented this sizeof wrong, with the effect
2977 that we mangled it as the last element of the pack. */
2978 tree arg
= TREE_VEC_ELT (args
, length
-1);
2981 write_string ("st");
2986 write_string ("sz");
2987 write_expression (arg
);
2991 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2993 write_string ("st");
2994 write_type (TREE_OPERAND (expr
, 0));
2999 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
3000 && TYPE_P (TREE_OPERAND (expr
, 0)))
3002 write_string ("at");
3003 write_type (TREE_OPERAND (expr
, 0));
3005 else if (code
== SCOPE_REF
3006 || code
== BASELINK
)
3009 if (code
== SCOPE_REF
)
3011 scope
= TREE_OPERAND (expr
, 0);
3012 member
= TREE_OPERAND (expr
, 1);
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_OPNAME_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);
3052 if (is_overloaded_fn (fn
))
3053 fn
= get_first_fn (fn
);
3055 fn
= DECL_NAME (fn
);
3056 if (IDENTIFIER_OPNAME_P (fn
))
3057 write_string ("on");
3058 write_unqualified_id (fn
);
3059 write_template_args (TREE_OPERAND (expr
, 1));
3061 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3063 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3064 const char *name
= (assignment_operator_name_info
[(int) subop
]
3066 write_string (name
);
3067 write_expression (TREE_OPERAND (expr
, 0));
3068 write_expression (TREE_OPERAND (expr
, 2));
3070 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3072 /* ::= [gs] nw <expression>* _ <type> E
3073 ::= [gs] nw <expression>* _ <type> <initializer>
3074 ::= [gs] na <expression>* _ <type> E
3075 ::= [gs] na <expression>* _ <type> <initializer>
3076 <initializer> ::= pi <expression>* E */
3077 tree placement
= TREE_OPERAND (expr
, 0);
3078 tree type
= TREE_OPERAND (expr
, 1);
3079 tree nelts
= TREE_OPERAND (expr
, 2);
3080 tree init
= TREE_OPERAND (expr
, 3);
3083 gcc_assert (code
== NEW_EXPR
);
3084 if (TREE_OPERAND (expr
, 2))
3085 code
= VEC_NEW_EXPR
;
3087 if (NEW_EXPR_USE_GLOBAL (expr
))
3088 write_string ("gs");
3090 write_string (operator_name_info
[(int) code
].mangled_name
);
3092 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3093 write_expression (TREE_VALUE (t
));
3100 ++processing_template_decl
;
3101 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3102 tf_warning_or_error
);
3103 type
= build_cplus_array_type (type
, domain
);
3104 --processing_template_decl
;
3108 if (init
&& TREE_CODE (init
) == TREE_LIST
3109 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3110 write_expression (TREE_VALUE (init
));
3114 write_string ("pi");
3115 if (init
&& init
!= void_node
)
3116 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3117 write_expression (TREE_VALUE (t
));
3121 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3123 gcc_assert (code
== DELETE_EXPR
);
3124 if (DELETE_EXPR_USE_VEC (expr
))
3125 code
= VEC_DELETE_EXPR
;
3127 if (DELETE_EXPR_USE_GLOBAL (expr
))
3128 write_string ("gs");
3130 write_string (operator_name_info
[(int) code
].mangled_name
);
3132 write_expression (TREE_OPERAND (expr
, 0));
3134 else if (code
== THROW_EXPR
)
3136 tree op
= TREE_OPERAND (expr
, 0);
3139 write_string ("tw");
3140 write_expression (op
);
3143 write_string ("tr");
3145 else if (code
== CONSTRUCTOR
)
3147 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3148 unsigned i
; tree val
;
3150 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3151 write_string ("il");
3154 write_string ("tl");
3155 write_type (TREE_TYPE (expr
));
3157 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3158 write_expression (val
);
3161 else if (dependent_name (expr
))
3163 write_unqualified_id (dependent_name (expr
));
3171 /* When we bind a variable or function to a non-type template
3172 argument with reference type, we create an ADDR_EXPR to show
3173 the fact that the entity's address has been taken. But, we
3174 don't actually want to output a mangling code for the `&'. */
3175 if (TREE_CODE (expr
) == ADDR_EXPR
3177 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
3179 expr
= TREE_OPERAND (expr
, 0);
3182 write_expression (expr
);
3186 code
= TREE_CODE (expr
);
3189 if (code
== COMPONENT_REF
)
3191 tree ob
= TREE_OPERAND (expr
, 0);
3193 if (TREE_CODE (ob
) == ARROW_EXPR
)
3195 write_string (operator_name_info
[(int)code
].mangled_name
);
3196 ob
= TREE_OPERAND (ob
, 0);
3197 write_expression (ob
);
3199 else if (!is_dummy_object (ob
))
3201 write_string ("dt");
3202 write_expression (ob
);
3204 /* else, for a non-static data member with no associated object (in
3205 unevaluated context), use the unresolved-name mangling. */
3207 write_member_name (TREE_OPERAND (expr
, 1));
3211 /* If it wasn't any of those, recursively expand the expression. */
3212 name
= operator_name_info
[(int) code
].mangled_name
;
3214 /* We used to mangle const_cast and static_cast like a C cast. */
3215 if (code
== CONST_CAST_EXPR
3216 || code
== STATIC_CAST_EXPR
)
3218 if (abi_warn_or_compat_version_crosses (6))
3219 G
.need_abi_warning
= 1;
3220 if (!abi_version_at_least (6))
3221 name
= operator_name_info
[CAST_EXPR
].mangled_name
;
3229 error ("use of built-in trait %qE in function signature; "
3230 "use library traits instead", expr
);
3234 sorry ("mangling %C", code
);
3240 write_string (name
);
3246 tree fn
= CALL_EXPR_FN (expr
);
3248 if (TREE_CODE (fn
) == ADDR_EXPR
)
3249 fn
= TREE_OPERAND (fn
, 0);
3251 /* Mangle a dependent name as the name, not whatever happens to
3252 be the first function in the overload set. */
3253 if ((TREE_CODE (fn
) == FUNCTION_DECL
3254 || TREE_CODE (fn
) == OVERLOAD
)
3255 && type_dependent_expression_p_push (expr
))
3256 fn
= DECL_NAME (get_first_fn (fn
));
3258 write_expression (fn
);
3261 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3262 write_expression (CALL_EXPR_ARG (expr
, i
));
3267 write_type (TREE_TYPE (expr
));
3268 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3269 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3272 tree args
= TREE_OPERAND (expr
, 0);
3274 for (; args
; args
= TREE_CHAIN (args
))
3275 write_expression (TREE_VALUE (args
));
3280 case DYNAMIC_CAST_EXPR
:
3281 case REINTERPRET_CAST_EXPR
:
3282 case STATIC_CAST_EXPR
:
3283 case CONST_CAST_EXPR
:
3284 write_type (TREE_TYPE (expr
));
3285 write_expression (TREE_OPERAND (expr
, 0));
3288 case PREINCREMENT_EXPR
:
3289 case PREDECREMENT_EXPR
:
3290 if (abi_version_at_least (6))
3292 if (abi_warn_or_compat_version_crosses (6))
3293 G
.need_abi_warning
= 1;
3297 /* In the middle-end, some expressions have more operands than
3298 they do in templates (and mangling). */
3299 len
= cp_tree_operand_length (expr
);
3301 for (i
= 0; i
< len
; ++i
)
3303 tree operand
= TREE_OPERAND (expr
, i
);
3304 /* As a GNU extension, the middle operand of a
3305 conditional may be omitted. Since expression
3306 manglings are supposed to represent the input token
3307 stream, there's no good way to mangle such an
3308 expression without extending the C++ ABI. */
3309 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3311 error ("omitted middle operand to %<?:%> operand "
3312 "cannot be mangled");
3315 else if (FOLD_EXPR_P (expr
))
3317 /* The first 'operand' of a fold-expression is the operator
3318 that it folds over. */
3321 int fcode
= TREE_INT_CST_LOW (operand
);
3322 write_string (operator_name_info
[fcode
].mangled_name
);
3325 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3327 /* The order of operands of the binary left and right
3328 folds is the same, but we want to mangle them in
3329 lexical order, i.e. non-pack first. */
3331 operand
= FOLD_EXPR_INIT (expr
);
3333 operand
= FOLD_EXPR_PACK (expr
);
3335 if (PACK_EXPANSION_P (operand
))
3336 operand
= PACK_EXPANSION_PATTERN (operand
);
3338 write_expression (operand
);
3344 /* Literal subcase of non-terminal <template-arg>.
3346 "Literal arguments, e.g. "A<42L>", are encoded with their type
3347 and value. Negative integer values are preceded with "n"; for
3348 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3349 encoded as 0, true as 1." */
3352 write_template_arg_literal (const tree value
)
3355 write_type (TREE_TYPE (value
));
3357 /* Write a null member pointer value as (type)0, regardless of its
3358 real representation. */
3359 if (null_member_pointer_value_p (value
))
3360 write_integer_cst (integer_zero_node
);
3362 switch (TREE_CODE (value
))
3365 write_integer_cst (DECL_INITIAL (value
));
3369 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3370 || integer_zerop (value
) || integer_onep (value
));
3371 write_integer_cst (value
);
3375 write_real_cst (value
);
3379 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3380 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3382 write_integer_cst (TREE_REALPART (value
));
3384 write_integer_cst (TREE_IMAGPART (value
));
3386 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3387 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3389 write_real_cst (TREE_REALPART (value
));
3391 write_real_cst (TREE_IMAGPART (value
));
3398 sorry ("string literal in function template signature");
3408 /* Non-terminal <template-arg>.
3410 <template-arg> ::= <type> # type
3411 ::= L <type> </value/ number> E # literal
3412 ::= LZ <name> E # external name
3413 ::= X <expression> E # expression */
3416 write_template_arg (tree node
)
3418 enum tree_code code
= TREE_CODE (node
);
3420 MANGLE_TRACE_TREE ("template-arg", node
);
3422 /* A template template parameter's argument list contains TREE_LIST
3423 nodes of which the value field is the actual argument. */
3424 if (code
== TREE_LIST
)
3426 node
= TREE_VALUE (node
);
3427 /* If it's a decl, deal with its type instead. */
3430 node
= TREE_TYPE (node
);
3431 code
= TREE_CODE (node
);
3435 if (REFERENCE_REF_P (node
))
3436 node
= TREE_OPERAND (node
, 0);
3437 if (TREE_CODE (node
) == NOP_EXPR
3438 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3440 /* Template parameters can be of reference type. To maintain
3441 internal consistency, such arguments use a conversion from
3442 address of object to reference type. */
3443 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3444 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3447 if (TREE_CODE (node
) == BASELINK
3448 && !type_unknown_p (node
))
3450 if (abi_version_at_least (6))
3451 node
= BASELINK_FUNCTIONS (node
);
3452 if (abi_warn_or_compat_version_crosses (6))
3453 /* We wrongly wrapped a class-scope function in X/E. */
3454 G
.need_abi_warning
= 1;
3457 if (ARGUMENT_PACK_P (node
))
3459 /* Expand the template argument pack. */
3460 tree args
= ARGUMENT_PACK_ARGS (node
);
3461 int i
, length
= TREE_VEC_LENGTH (args
);
3462 if (abi_version_at_least (6))
3466 if (abi_warn_or_compat_version_crosses (6))
3467 G
.need_abi_warning
= 1;
3468 for (i
= 0; i
< length
; ++i
)
3469 write_template_arg (TREE_VEC_ELT (args
, i
));
3472 else if (TYPE_P (node
))
3474 else if (code
== TEMPLATE_DECL
)
3475 /* A template appearing as a template arg is a template template arg. */
3476 write_template_template_arg (node
);
3477 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3478 || code
== CONST_DECL
3479 || null_member_pointer_value_p (node
))
3480 write_template_arg_literal (node
);
3481 else if (DECL_P (node
))
3484 /* Until ABI version 3, the underscore before the mangled name
3485 was incorrectly omitted. */
3486 if (!abi_version_at_least (3))
3489 write_string ("_Z");
3490 if (abi_warn_or_compat_version_crosses (3))
3491 G
.need_abi_warning
= 1;
3492 write_encoding (node
);
3497 /* Template arguments may be expressions. */
3499 write_expression (node
);
3504 /* <template-template-arg>
3506 ::= <substitution> */
3509 write_template_template_arg (const tree decl
)
3511 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3513 if (find_substitution (decl
))
3515 write_name (decl
, /*ignore_local_scope=*/0);
3516 add_substitution (decl
);
3520 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3522 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3523 ::= A <expression> _ </element/ type>
3525 "Array types encode the dimension (number of elements) and the
3526 element type. For variable length arrays, the dimension (but not
3527 the '_' separator) is omitted."
3528 Note that for flexible array members, like for other arrays of
3529 unspecified size, the dimension is also omitted. */
3532 write_array_type (const tree type
)
3535 if (TYPE_DOMAIN (type
))
3539 index_type
= TYPE_DOMAIN (type
);
3540 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3541 It's null for flexible array members which have no upper bound
3542 (this is a change from GCC 5 and prior where such members were
3543 incorrectly mangled as zero-length arrays). */
3544 if (tree max
= TYPE_MAX_VALUE (index_type
))
3546 if (TREE_CODE (max
) == INTEGER_CST
)
3548 /* The ABI specifies that we should mangle the number of
3549 elements in the array, not the largest allowed index. */
3550 offset_int wmax
= wi::to_offset (max
) + 1;
3551 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3552 number of elements as zero. */
3553 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3554 gcc_assert (wi::fits_uhwi_p (wmax
));
3555 write_unsigned_number (wmax
.to_uhwi ());
3559 max
= TREE_OPERAND (max
, 0);
3560 write_expression (max
);
3565 write_type (TREE_TYPE (type
));
3568 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3569 variables. TYPE is a pointer-to-member POINTER_TYPE.
3571 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3574 write_pointer_to_member_type (const tree type
)
3577 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3578 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3581 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3582 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3583 TEMPLATE_PARM_INDEX.
3585 <template-param> ::= T </parameter/ number> _ */
3588 write_template_param (const tree parm
)
3592 MANGLE_TRACE_TREE ("template-parm", parm
);
3594 switch (TREE_CODE (parm
))
3596 case TEMPLATE_TYPE_PARM
:
3597 case TEMPLATE_TEMPLATE_PARM
:
3598 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3599 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3602 case TEMPLATE_PARM_INDEX
:
3603 parm_index
= TEMPLATE_PARM_IDX (parm
);
3611 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3612 earliest template param denoted by `_'. */
3613 write_compact_number (parm_index
);
3616 /* <template-template-param>
3617 ::= <template-param>
3618 ::= <substitution> */
3621 write_template_template_param (const tree parm
)
3623 tree templ
= NULL_TREE
;
3625 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3626 template template parameter. The substitution candidate here is
3627 only the template. */
3628 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3631 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3632 if (find_substitution (templ
))
3636 /* <template-param> encodes only the template parameter position,
3637 not its template arguments, which is fine here. */
3638 write_template_param (parm
);
3640 add_substitution (templ
);
3643 /* Non-terminal <substitution>.
3645 <substitution> ::= S <seq-id> _
3649 write_substitution (const int seq_id
)
3651 MANGLE_TRACE ("substitution", "");
3655 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3659 /* Start mangling ENTITY. */
3662 start_mangling (const tree entity
)
3665 G
.need_abi_warning
= false;
3666 G
.need_cxx1z_warning
= false;
3667 obstack_free (&name_obstack
, name_base
);
3668 mangle_obstack
= &name_obstack
;
3669 name_base
= obstack_alloc (&name_obstack
, 0);
3672 /* Done with mangling. If WARN is true, and the name of G.entity will
3673 be mangled differently in a future version of the ABI, issue a
3677 finish_mangling_internal (void)
3679 /* Clear all the substitutions. */
3680 vec_safe_truncate (G
.substitutions
, 0);
3682 /* Null-terminate the string. */
3687 /* Like finish_mangling_internal, but return the mangled string. */
3689 static inline const char *
3690 finish_mangling (void)
3692 finish_mangling_internal ();
3693 return (const char *) obstack_finish (mangle_obstack
);
3696 /* Like finish_mangling_internal, but return an identifier. */
3699 finish_mangling_get_identifier (void)
3701 finish_mangling_internal ();
3702 /* Don't obstack_finish here, and the next start_mangling will
3703 remove the identifier. */
3704 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3707 /* Initialize data structures for mangling. */
3712 gcc_obstack_init (&name_obstack
);
3713 name_base
= obstack_alloc (&name_obstack
, 0);
3714 vec_alloc (G
.substitutions
, 0);
3716 /* Cache these identifiers for quick comparison when checking for
3717 standard substitutions. */
3718 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3719 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3720 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3721 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3722 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3723 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3726 /* Generate the mangled name of DECL. */
3729 mangle_decl_string (const tree decl
)
3732 location_t saved_loc
= input_location
;
3733 tree saved_fn
= NULL_TREE
;
3734 bool template_p
= false;
3736 /* We shouldn't be trying to mangle an uninstantiated template. */
3737 gcc_assert (!type_dependent_expression_p (decl
));
3739 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3741 struct tinst_level
*tl
= current_instantiation ();
3742 if ((!tl
|| tl
->decl
!= decl
)
3743 && push_tinst_level (decl
))
3746 saved_fn
= current_function_decl
;
3747 current_function_decl
= NULL_TREE
;
3750 input_location
= DECL_SOURCE_LOCATION (decl
);
3752 start_mangling (decl
);
3754 if (TREE_CODE (decl
) == TYPE_DECL
)
3755 write_type (TREE_TYPE (decl
));
3757 write_mangled_name (decl
, true);
3759 result
= finish_mangling_get_identifier ();
3761 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3762 IDENTIFIER_POINTER (result
));
3767 current_function_decl
= saved_fn
;
3769 input_location
= saved_loc
;
3774 /* Return an identifier for the external mangled name of DECL. */
3777 get_mangled_id (tree decl
)
3779 tree id
= mangle_decl_string (decl
);
3780 return targetm
.mangle_decl_assembler_name (decl
, id
);
3783 /* If DECL is an implicit mangling alias, return its symtab node; otherwise
3786 static symtab_node
*
3787 decl_implicit_alias_p (tree decl
)
3789 if (DECL_P (decl
) && DECL_ARTIFICIAL (decl
)
3790 && DECL_IGNORED_P (decl
)
3791 && (TREE_CODE (decl
) == FUNCTION_DECL
3792 || (VAR_P (decl
) && TREE_STATIC (decl
))))
3794 symtab_node
*n
= symtab_node::get (decl
);
3795 if (n
&& n
->cpp_implicit_alias
)
3801 /* If DECL is a mangling alias, remove it from the symbol table and return
3802 true; otherwise return false. */
3805 maybe_remove_implicit_alias (tree decl
)
3807 if (symtab_node
*n
= decl_implicit_alias_p (decl
))
3815 /* Create an identifier for the external mangled name of DECL. */
3818 mangle_decl (const tree decl
)
3823 /* Don't bother mangling uninstantiated templates. */
3824 ++processing_template_decl
;
3825 if (TREE_CODE (decl
) == TYPE_DECL
)
3826 dep
= dependent_type_p (TREE_TYPE (decl
));
3828 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3829 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3830 --processing_template_decl
;
3834 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3835 It is not needed to assign names to anonymous namespace, but we use the
3836 "<anon>" marker to be able to tell if type is C++ ODR type or type
3837 produced by other language. */
3838 if (TREE_CODE (decl
) == TYPE_DECL
3839 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3840 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3841 id
= get_identifier ("<anon>");
3844 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3845 || !no_linkage_check (TREE_TYPE (decl
), true));
3846 if (abi_version_at_least (10))
3847 if (tree fn
= decl_function_context (decl
))
3848 maybe_check_abi_tags (fn
, decl
);
3849 id
= get_mangled_id (decl
);
3851 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3853 if (G
.need_cxx1z_warning
3854 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
3855 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wc__1z_compat
,
3856 "mangled name for %qD will change in C++17 because the "
3857 "exception specification is part of a function type",
3860 if (id
!= DECL_NAME (decl
)
3861 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3862 && TREE_CODE (decl
) != TYPE_DECL
3863 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3864 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3866 int save_ver
= flag_abi_version
;
3867 tree id2
= NULL_TREE
;
3869 if (!DECL_REALLY_EXTERN (decl
))
3873 /* Check IDENTIFIER_GLOBAL_VALUE before setting to avoid redundant
3874 errors from multiple definitions. */
3875 tree d
= IDENTIFIER_GLOBAL_VALUE (id
);
3876 if (!d
|| decl_implicit_alias_p (d
))
3879 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3882 if (!G
.need_abi_warning
)
3885 /* If the mangling will change in the future, emit an alias with the
3886 future mangled name for forward-compatibility. */
3889 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3890 inform (DECL_SOURCE_LOCATION (decl
), "a later -fabi-version= (or "
3891 "=0) avoids this error with a change in mangling");
3894 flag_abi_version
= flag_abi_compat_version
;
3895 id2
= mangle_decl_string (decl
);
3896 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3897 flag_abi_version
= save_ver
;
3900 note_mangling_alias (decl
, id2
);
3905 if (flag_abi_compat_version
!= warn_abi_version
3906 || id2
== NULL_TREE
)
3908 flag_abi_version
= warn_abi_version
;
3909 id2
= mangle_decl_string (decl
);
3910 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3912 flag_abi_version
= save_ver
;
3916 else if (warn_abi_version
!= 0
3917 && abi_version_at_least (warn_abi_version
))
3918 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3919 "the mangled name of %qD changed between "
3920 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3921 G
.entity
, warn_abi_version
, id2
,
3924 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3925 "the mangled name of %qD changes between "
3926 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3927 G
.entity
, save_ver
, id
,
3928 warn_abi_version
, id2
);
3931 flag_abi_version
= save_ver
;
3935 /* Generate the mangled representation of TYPE. */
3938 mangle_type_string (const tree type
)
3942 start_mangling (type
);
3944 result
= finish_mangling ();
3946 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3950 /* Create an identifier for the mangled name of a special component
3951 for belonging to TYPE. CODE is the ABI-specified code for this
3955 mangle_special_for_type (const tree type
, const char *code
)
3959 /* We don't have an actual decl here for the special component, so
3960 we can't just process the <encoded-name>. Instead, fake it. */
3961 start_mangling (type
);
3963 /* Start the mangling. */
3964 write_string ("_Z");
3965 write_string (code
);
3969 result
= finish_mangling_get_identifier ();
3972 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3973 IDENTIFIER_POINTER (result
));
3978 /* Create an identifier for the mangled representation of the typeinfo
3979 structure for TYPE. */
3982 mangle_typeinfo_for_type (const tree type
)
3984 return mangle_special_for_type (type
, "TI");
3987 /* Create an identifier for the mangled name of the NTBS containing
3988 the mangled name of TYPE. */
3991 mangle_typeinfo_string_for_type (const tree type
)
3993 return mangle_special_for_type (type
, "TS");
3996 /* Create an identifier for the mangled name of the vtable for TYPE. */
3999 mangle_vtbl_for_type (const tree type
)
4001 return mangle_special_for_type (type
, "TV");
4004 /* Returns an identifier for the mangled name of the VTT for TYPE. */
4007 mangle_vtt_for_type (const tree type
)
4009 return mangle_special_for_type (type
, "TT");
4012 /* Returns an identifier for the mangled name of the decomposition
4013 artificial variable DECL. DECLS is the vector of the VAR_DECLs
4014 for the identifier-list. */
4017 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
4019 gcc_assert (!type_dependent_expression_p (decl
));
4021 location_t saved_loc
= input_location
;
4022 input_location
= DECL_SOURCE_LOCATION (decl
);
4024 start_mangling (decl
);
4025 write_string ("_Z");
4027 tree context
= decl_mangling_context (decl
);
4028 gcc_assert (context
!= NULL_TREE
);
4030 bool nested
= false;
4031 if (DECL_NAMESPACE_STD_P (context
))
4032 write_string ("St");
4033 else if (context
!= global_namespace
)
4037 write_prefix (decl_mangling_context (decl
));
4040 write_string ("DC");
4043 FOR_EACH_VEC_ELT (decls
, i
, d
)
4044 write_unqualified_name (d
);
4050 tree id
= finish_mangling_get_identifier ();
4052 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4053 IDENTIFIER_POINTER (id
));
4055 input_location
= saved_loc
;
4059 /* Return an identifier for a construction vtable group. TYPE is
4060 the most derived class in the hierarchy; BINFO is the base
4061 subobject for which this construction vtable group will be used.
4063 This mangling isn't part of the ABI specification; in the ABI
4064 specification, the vtable group is dumped in the same COMDAT as the
4065 main vtable, and is referenced only from that vtable, so it doesn't
4066 need an external name. For binary formats without COMDAT sections,
4067 though, we need external names for the vtable groups.
4069 We use the production
4071 <special-name> ::= CT <type> <offset number> _ <base type> */
4074 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4078 start_mangling (type
);
4080 write_string ("_Z");
4081 write_string ("TC");
4083 write_integer_cst (BINFO_OFFSET (binfo
));
4085 write_type (BINFO_TYPE (binfo
));
4087 result
= finish_mangling_get_identifier ();
4089 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4090 IDENTIFIER_POINTER (result
));
4094 /* Mangle a this pointer or result pointer adjustment.
4096 <call-offset> ::= h <fixed offset number> _
4097 ::= v <fixed offset number> _ <virtual offset number> _ */
4100 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4102 write_char (virtual_offset
? 'v' : 'h');
4104 /* For either flavor, write the fixed offset. */
4105 write_integer_cst (fixed_offset
);
4108 /* For a virtual thunk, add the virtual offset. */
4111 write_integer_cst (virtual_offset
);
4116 /* Return an identifier for the mangled name of a this-adjusting or
4117 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4118 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4119 is a virtual thunk, and it is the vtbl offset in
4120 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4121 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4122 thunk itself. A covariant thunk name always includes the adjustment
4123 for the this pointer, even if there is none.
4125 <special-name> ::= T <call-offset> <base encoding>
4126 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4130 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4131 tree virtual_offset
, tree thunk
)
4135 if (abi_version_at_least (11))
4136 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4138 start_mangling (fn_decl
);
4140 write_string ("_Z");
4143 if (!this_adjusting
)
4145 /* Covariant thunk with no this adjustment */
4147 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4148 mangle_call_offset (fixed_offset
, virtual_offset
);
4150 else if (!DECL_THUNK_P (fn_decl
))
4151 /* Plain this adjusting thunk. */
4152 mangle_call_offset (fixed_offset
, virtual_offset
);
4155 /* This adjusting thunk to covariant thunk. */
4157 mangle_call_offset (fixed_offset
, virtual_offset
);
4158 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4159 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4161 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4162 mangle_call_offset (fixed_offset
, virtual_offset
);
4163 fn_decl
= THUNK_TARGET (fn_decl
);
4167 write_encoding (fn_decl
);
4169 result
= finish_mangling_get_identifier ();
4171 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4175 struct conv_type_hasher
: ggc_ptr_hash
<tree_node
>
4177 static hashval_t
hash (tree
);
4178 static bool equal (tree
, tree
);
4181 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
4182 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
4185 static GTY (()) hash_table
<conv_type_hasher
> *conv_type_names
;
4187 /* Hash a node (VAL1) in the table. */
4190 conv_type_hasher::hash (tree val
)
4192 return (hashval_t
) TYPE_UID (TREE_TYPE (val
));
4195 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
4198 conv_type_hasher::equal (tree val1
, tree val2
)
4200 return TREE_TYPE (val1
) == val2
;
4203 /* Return an identifier for the mangled unqualified name for a
4204 conversion operator to TYPE. This mangling is not specified by the
4205 ABI spec; it is only used internally. */
4208 mangle_conv_op_name_for_type (const tree type
)
4213 if (type
== error_mark_node
)
4214 return error_mark_node
;
4216 if (conv_type_names
== NULL
)
4217 conv_type_names
= hash_table
<conv_type_hasher
>::create_ggc (31);
4219 slot
= conv_type_names
->find_slot_with_hash (type
,
4220 (hashval_t
) TYPE_UID (type
),
4227 /* Create a unique name corresponding to TYPE. */
4228 sprintf (buffer
, "operator %lu",
4229 (unsigned long) conv_type_names
->elements ());
4230 identifier
= get_identifier (buffer
);
4233 /* Hang TYPE off the identifier so it can be found easily later
4234 when performing conversions. */
4235 TREE_TYPE (identifier
) = type
;
4237 /* Set bits on the identifier so we know later it's a conversion. */
4238 IDENTIFIER_OPNAME_P (identifier
) = 1;
4239 IDENTIFIER_TYPENAME_P (identifier
) = 1;
4245 /* Handle ABI backwards compatibility for past bugs where we didn't call
4246 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4247 it makes a difference. If FOR_DECL is non-null, it's the declaration
4248 that we're actually trying to mangle; if it's null, we're mangling the
4249 guard variable for T. */
4252 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4254 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4257 tree oldtags
= get_abi_tags (t
);
4261 tree newtags
= get_abi_tags (t
);
4262 if (newtags
&& newtags
!= oldtags
4263 && abi_version_crosses (ver
))
4265 if (for_decl
&& DECL_THUNK_P (for_decl
))
4266 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4267 "the mangled name of a thunk for %qD changes between "
4268 "-fabi-version=%d and -fabi-version=%d",
4269 t
, flag_abi_version
, warn_abi_version
);
4271 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4272 "the mangled name of %qD changes between "
4273 "-fabi-version=%d and -fabi-version=%d",
4274 for_decl
, flag_abi_version
, warn_abi_version
);
4276 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4277 "the mangled name of the initialization guard variable "
4278 "for %qD changes between -fabi-version=%d and "
4280 t
, flag_abi_version
, warn_abi_version
);
4284 /* Write out the appropriate string for this variable when generating
4285 another mangled name based on this one. */
4288 write_guarded_var_name (const tree variable
)
4290 if (DECL_NAME (variable
)
4291 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4292 /* The name of a guard variable for a reference temporary should refer
4293 to the reference, not the temporary. */
4294 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4296 write_name (variable
, /*ignore_local_scope=*/0);
4299 /* Return an identifier for the name of an initialization guard
4300 variable for indicated VARIABLE. */
4303 mangle_guard_variable (const tree variable
)
4305 if (abi_version_at_least (10))
4306 maybe_check_abi_tags (variable
);
4307 start_mangling (variable
);
4308 write_string ("_ZGV");
4309 write_guarded_var_name (variable
);
4310 return finish_mangling_get_identifier ();
4313 /* Return an identifier for the name of a thread_local initialization
4314 function for VARIABLE. */
4317 mangle_tls_init_fn (const tree variable
)
4319 check_abi_tags (variable
);
4320 start_mangling (variable
);
4321 write_string ("_ZTH");
4322 write_guarded_var_name (variable
);
4323 return finish_mangling_get_identifier ();
4326 /* Return an identifier for the name of a thread_local wrapper
4327 function for VARIABLE. */
4329 #define TLS_WRAPPER_PREFIX "_ZTW"
4332 mangle_tls_wrapper_fn (const tree variable
)
4334 check_abi_tags (variable
);
4335 start_mangling (variable
);
4336 write_string (TLS_WRAPPER_PREFIX
);
4337 write_guarded_var_name (variable
);
4338 return finish_mangling_get_identifier ();
4341 /* Return true iff FN is a thread_local wrapper function. */
4344 decl_tls_wrapper_p (const tree fn
)
4346 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4348 tree name
= DECL_NAME (fn
);
4349 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4350 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4353 /* Return an identifier for the name of a temporary variable used to
4354 initialize a static reference. This isn't part of the ABI, but we might
4355 as well call them something readable. */
4357 static GTY(()) int temp_count
;
4360 mangle_ref_init_variable (const tree variable
)
4362 start_mangling (variable
);
4363 write_string ("_ZGR");
4364 check_abi_tags (variable
);
4365 write_name (variable
, /*ignore_local_scope=*/0);
4366 /* Avoid name clashes with aggregate initialization of multiple
4367 references at once. */
4368 write_unsigned_number (temp_count
++);
4369 return finish_mangling_get_identifier ();
4372 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4373 function generates a mangled name for the vtable map variable of
4374 the class type. For example, if the class type is
4375 "std::bad_exception", the mangled name for the class is
4376 "St13bad_exception". This function would generate the name
4377 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4378 "_VTV<std::bad_exception>::__vtable_map". */
4382 get_mangled_vtable_map_var_name (tree class_type
)
4384 char *var_name
= NULL
;
4385 const char *prefix
= "_ZN4_VTVI";
4386 const char *postfix
= "E12__vtable_mapE";
4388 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4390 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4392 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4394 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4395 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4398 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4400 strlen (postfix
) + 1;
4402 var_name
= (char *) xmalloc (len
);
4404 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4409 #include "gt-cp-mangle.h"
projects / thirdparty / gcc.git / blob