1 /* Name mangling for the 3.0 -*- C++ -*- ABI.
2 Copyright (C) 2000-2016 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 (nothrow_spec_p (spec
))
371 else if (TREE_PURPOSE (spec
))
373 gcc_assert (uses_template_parms (TREE_PURPOSE (spec
)));
375 write_expression (TREE_PURPOSE (spec
));
381 for (tree t
= spec
; t
; t
= TREE_CHAIN (t
))
382 write_type (TREE_VALUE (t
));
387 /* Both decls and types can be substitution candidates, but sometimes
388 they refer to the same thing. For instance, a TYPE_DECL and
389 RECORD_TYPE for the same class refer to the same thing, and should
390 be treated accordingly in substitutions. This function returns a
391 canonicalized tree node representing NODE that is used when adding
392 and substitution candidates and finding matches. */
395 canonicalize_for_substitution (tree node
)
397 /* For a TYPE_DECL, use the type instead. */
398 if (TREE_CODE (node
) == TYPE_DECL
)
399 node
= TREE_TYPE (node
);
401 && TYPE_CANONICAL (node
) != node
402 && TYPE_MAIN_VARIANT (node
) != node
)
405 /* Here we want to strip the topmost typedef only.
406 We need to do that so is_std_substitution can do proper
408 if (TREE_CODE (node
) == FUNCTION_TYPE
)
409 /* Use build_qualified_type and TYPE_QUALS here to preserve
410 the old buggy mangling of attribute noreturn with abi<5. */
411 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
414 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
415 cp_type_quals (node
));
416 if (TREE_CODE (node
) == FUNCTION_TYPE
417 || TREE_CODE (node
) == METHOD_TYPE
)
419 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
420 tree r
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig
));
421 if (flag_noexcept_type
)
422 node
= build_exception_variant (node
, r
);
424 /* Set the warning flag if appropriate. */
425 write_exception_spec (r
);
431 /* Add NODE as a substitution candidate. NODE must not already be on
432 the list of candidates. */
435 add_substitution (tree node
)
440 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
441 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
443 /* Get the canonicalized substitution candidate for NODE. */
444 c
= canonicalize_for_substitution (node
);
445 if (DEBUG_MANGLE
&& c
!= node
)
446 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
447 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
450 /* Make sure NODE isn't already a candidate. */
456 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
458 gcc_assert (!(DECL_P (node
) && node
== candidate
));
459 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
460 && same_type_p (node
, candidate
)));
464 /* Put the decl onto the varray of substitution candidates. */
465 vec_safe_push (G
.substitutions
, node
);
468 dump_substitution_candidates ();
471 /* Helper function for find_substitution. Returns nonzero if NODE,
472 which may be a decl or a CLASS_TYPE, is a template-id with template
473 name of substitution_index[INDEX] in the ::std namespace. */
476 is_std_substitution (const tree node
,
477 const substitution_identifier_index_t index
)
484 type
= TREE_TYPE (node
);
487 else if (CLASS_TYPE_P (node
))
490 decl
= TYPE_NAME (node
);
493 /* These are not the droids you're looking for. */
496 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
497 && TYPE_LANG_SPECIFIC (type
)
498 && TYPE_TEMPLATE_INFO (type
)
499 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
500 == subst_identifiers
[index
]));
503 /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
504 which can be a decl or type. */
507 get_abi_tags (tree t
)
509 if (!t
|| TREE_CODE (t
) == NAMESPACE_DECL
)
512 if (DECL_P (t
) && DECL_DECLARES_TYPE_P (t
))
517 attrs
= TYPE_ATTRIBUTES (t
);
519 attrs
= DECL_ATTRIBUTES (t
);
521 tree tags
= lookup_attribute ("abi_tag", attrs
);
523 tags
= TREE_VALUE (tags
);
527 /* Helper function for find_substitution. Returns nonzero if NODE,
528 which may be a decl or a CLASS_TYPE, is the template-id
529 ::std::identifier<char>, where identifier is
530 substitution_index[INDEX]. */
533 is_std_substitution_char (const tree node
,
534 const substitution_identifier_index_t index
)
537 /* Check NODE's name is ::std::identifier. */
538 if (!is_std_substitution (node
, index
))
540 /* Figure out its template args. */
542 args
= DECL_TI_ARGS (node
);
543 else if (CLASS_TYPE_P (node
))
544 args
= CLASSTYPE_TI_ARGS (node
);
546 /* Oops, not a template. */
548 /* NODE's template arg list should be <char>. */
550 TREE_VEC_LENGTH (args
) == 1
551 && TREE_VEC_ELT (args
, 0) == char_type_node
;
554 /* Check whether a substitution should be used to represent NODE in
557 First, check standard special-case substitutions.
559 <substitution> ::= St
566 # ::std::basic_string
569 # ::std::basic_string<char,
570 ::std::char_traits<char>,
571 ::std::allocator<char> >
574 # ::std::basic_istream<char, ::std::char_traits<char> >
577 # ::std::basic_ostream<char, ::std::char_traits<char> >
580 # ::std::basic_iostream<char, ::std::char_traits<char> >
582 Then examine the stack of currently available substitution
583 candidates for entities appearing earlier in the same mangling
585 If a substitution is found, write its mangled representation and
586 return nonzero. If none is found, just return zero. */
589 find_substitution (tree node
)
592 const int size
= vec_safe_length (G
.substitutions
);
595 const char *abbr
= NULL
;
598 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
599 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
601 /* Obtain the canonicalized substitution representation for NODE.
602 This is what we'll compare against. */
603 node
= canonicalize_for_substitution (node
);
605 /* Check for builtin substitutions. */
607 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
608 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
610 /* Check for std::allocator. */
612 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
613 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
616 /* Check for std::basic_string. */
617 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
621 /* If this is a type (i.e. a fully-qualified template-id),
623 std::basic_string <char,
624 std::char_traits<char>,
625 std::allocator<char> > . */
626 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
627 && CLASSTYPE_USE_TEMPLATE (type
))
629 tree args
= CLASSTYPE_TI_ARGS (type
);
630 if (TREE_VEC_LENGTH (args
) == 3
631 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
632 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
634 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
640 /* Substitute for the template name only if this isn't a type. */
644 /* Check for basic_{i,o,io}stream. */
645 else if (TYPE_P (node
)
646 && cp_type_quals (type
) == TYPE_UNQUALIFIED
647 && CLASS_TYPE_P (type
)
648 && CLASSTYPE_USE_TEMPLATE (type
)
649 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
651 /* First, check for the template
652 args <char, std::char_traits<char> > . */
653 tree args
= CLASSTYPE_TI_ARGS (type
);
654 if (TREE_VEC_LENGTH (args
) == 2
655 && TYPE_P (TREE_VEC_ELT (args
, 0))
656 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
657 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
660 /* Got them. Is this basic_istream? */
661 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
663 /* Or basic_ostream? */
664 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
666 /* Or basic_iostream? */
667 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
672 /* Check for namespace std. */
673 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
679 tree tags
= NULL_TREE
;
680 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
681 tags
= get_abi_tags (type
);
682 /* Now check the list of available substitutions for this mangling
684 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
686 tree candidate
= (*G
.substitutions
)[i
];
687 /* NODE is a matched to a candidate if it's the same decl node or
688 if it's the same type. */
689 if (decl
== candidate
690 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
691 && same_type_p (type
, candidate
))
692 || NESTED_TEMPLATE_MATCH (node
, candidate
))
694 write_substitution (i
);
700 /* No substitution found. */
706 /* If there are ABI tags on the abbreviation, it becomes
707 a substitution candidate. */
708 write_abi_tags (tags
);
709 add_substitution (node
);
714 /* Returns whether DECL's symbol name should be the plain unqualified-id
715 rather than a more complicated mangled name. */
718 unmangled_name_p (const tree decl
)
720 if (TREE_CODE (decl
) == FUNCTION_DECL
)
722 /* The names of `extern "C"' functions are not mangled. */
723 return (DECL_EXTERN_C_FUNCTION_P (decl
)
724 /* But overloaded operator names *are* mangled. */
725 && !DECL_OVERLOADED_OPERATOR_P (decl
));
727 else if (VAR_P (decl
))
729 /* static variables are mangled. */
730 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
733 /* extern "C" declarations aren't mangled. */
734 if (DECL_EXTERN_C_P (decl
))
737 /* Other variables at non-global scope are mangled. */
738 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
741 /* Variable template instantiations are mangled. */
742 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
743 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
746 /* Declarations with ABI tags are mangled. */
747 if (get_abi_tags (decl
))
750 /* The names of non-static global variables aren't mangled. */
757 /* TOP_LEVEL is true, if this is being called at outermost level of
758 mangling. It should be false when mangling a decl appearing in an
759 expression within some other mangling.
761 <mangled-name> ::= _Z <encoding> */
764 write_mangled_name (const tree decl
, bool top_level
)
766 MANGLE_TRACE_TREE ("mangled-name", decl
);
768 check_abi_tags (decl
);
770 if (unmangled_name_p (decl
))
773 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
776 /* The standard notes: "The <encoding> of an extern "C"
777 function is treated like global-scope data, i.e. as its
778 <source-name> without a type." We cannot write
779 overloaded operators that way though, because it contains
780 characters invalid in assembler. */
782 write_source_name (DECL_NAME (decl
));
788 write_encoding (decl
);
792 /* Returns true if the return type of DECL is part of its signature, and
793 therefore its mangling. */
796 mangle_return_type_p (tree decl
)
798 return (!DECL_CONSTRUCTOR_P (decl
)
799 && !DECL_DESTRUCTOR_P (decl
)
800 && !DECL_CONV_FN_P (decl
)
801 && decl_is_template_id (decl
, NULL
));
804 /* <encoding> ::= <function name> <bare-function-type>
808 write_encoding (const tree decl
)
810 MANGLE_TRACE_TREE ("encoding", decl
);
812 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
814 /* For overloaded operators write just the mangled name
815 without arguments. */
816 if (DECL_OVERLOADED_OPERATOR_P (decl
))
817 write_name (decl
, /*ignore_local_scope=*/0);
819 write_source_name (DECL_NAME (decl
));
823 write_name (decl
, /*ignore_local_scope=*/0);
824 if (TREE_CODE (decl
) == FUNCTION_DECL
)
828 bool tmpl
= decl_is_template_id (decl
, NULL
);
832 ++processing_template_decl
;
833 fn_type
= get_mostly_instantiated_function_type (decl
);
834 /* FN_TYPE will not have parameter types for in-charge or
835 VTT parameters. Therefore, we pass NULL_TREE to
836 write_bare_function_type -- otherwise, it will get
837 confused about which artificial parameters to skip. */
842 fn_type
= TREE_TYPE (decl
);
846 write_bare_function_type (fn_type
,
847 mangle_return_type_p (decl
),
851 --processing_template_decl
;
855 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
856 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
859 decl_mangling_context (tree decl
)
861 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
863 if (tcontext
!= NULL_TREE
)
866 if (TREE_CODE (decl
) == TEMPLATE_DECL
867 && DECL_TEMPLATE_RESULT (decl
))
868 decl
= DECL_TEMPLATE_RESULT (decl
);
870 if (TREE_CODE (decl
) == TYPE_DECL
871 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
873 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
877 else if (template_type_parameter_p (decl
))
878 /* template type parms have no mangling context. */
880 return CP_DECL_CONTEXT (decl
);
883 /* <name> ::= <unscoped-name>
884 ::= <unscoped-template-name> <template-args>
888 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
889 called from <local-name>, which mangles the enclosing scope
890 elsewhere and then uses this function to mangle just the part
891 underneath the function scope. So don't use the <local-name>
892 production, to avoid an infinite recursion. */
895 write_name (tree decl
, const int ignore_local_scope
)
899 MANGLE_TRACE_TREE ("name", decl
);
901 if (TREE_CODE (decl
) == TYPE_DECL
)
903 /* In case this is a typedef, fish out the corresponding
904 TYPE_DECL for the main variant. */
905 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
908 context
= decl_mangling_context (decl
);
910 gcc_assert (context
!= NULL_TREE
);
912 if (abi_warn_or_compat_version_crosses (7)
913 && ignore_local_scope
914 && TREE_CODE (context
) == PARM_DECL
)
915 G
.need_abi_warning
= 1;
917 /* A decl in :: or ::std scope is treated specially. The former is
918 mangled using <unscoped-name> or <unscoped-template-name>, the
919 latter with a special substitution. Also, a name that is
920 directly in a local function scope is also mangled with
921 <unscoped-name> rather than a full <nested-name>. */
922 if (context
== global_namespace
923 || DECL_NAMESPACE_STD_P (context
)
924 || (ignore_local_scope
925 && (TREE_CODE (context
) == FUNCTION_DECL
926 || (abi_version_at_least (7)
927 && TREE_CODE (context
) == PARM_DECL
))))
930 /* Is this a template instance? */
931 if (decl_is_template_id (decl
, &template_info
))
933 /* Yes: use <unscoped-template-name>. */
934 write_unscoped_template_name (TI_TEMPLATE (template_info
));
935 write_template_args (TI_ARGS (template_info
));
938 /* Everything else gets an <unqualified-name>. */
939 write_unscoped_name (decl
);
943 /* Handle local names, unless we asked not to (that is, invoked
944 under <local-name>, to handle only the part of the name under
946 if (!ignore_local_scope
)
948 /* Scan up the list of scope context, looking for a
949 function. If we find one, this entity is in local
950 function scope. local_entity tracks context one scope
951 level down, so it will contain the element that's
952 directly in that function's scope, either decl or one of
953 its enclosing scopes. */
954 tree local_entity
= decl
;
955 while (context
!= global_namespace
)
957 /* Make sure we're always dealing with decls. */
958 if (TYPE_P (context
))
959 context
= TYPE_NAME (context
);
960 /* Is this a function? */
961 if (TREE_CODE (context
) == FUNCTION_DECL
962 || TREE_CODE (context
) == PARM_DECL
)
964 /* Yes, we have local scope. Use the <local-name>
965 production for the innermost function scope. */
966 write_local_name (context
, local_entity
, decl
);
969 /* Up one scope level. */
970 local_entity
= context
;
971 context
= decl_mangling_context (context
);
974 /* No local scope found? Fall through to <nested-name>. */
977 /* Other decls get a <nested-name> to encode their scope. */
978 write_nested_name (decl
);
982 /* <unscoped-name> ::= <unqualified-name>
983 ::= St <unqualified-name> # ::std:: */
986 write_unscoped_name (const tree decl
)
988 tree context
= decl_mangling_context (decl
);
990 MANGLE_TRACE_TREE ("unscoped-name", decl
);
992 /* Is DECL in ::std? */
993 if (DECL_NAMESPACE_STD_P (context
))
996 write_unqualified_name (decl
);
1000 /* If not, it should be either in the global namespace, or directly
1001 in a local function scope. A lambda can also be mangled in the
1002 scope of a default argument. */
1003 gcc_assert (context
== global_namespace
1004 || TREE_CODE (context
) == PARM_DECL
1005 || TREE_CODE (context
) == FUNCTION_DECL
);
1007 write_unqualified_name (decl
);
1011 /* <unscoped-template-name> ::= <unscoped-name>
1012 ::= <substitution> */
1015 write_unscoped_template_name (const tree decl
)
1017 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
1019 if (find_substitution (decl
))
1021 write_unscoped_name (decl
);
1022 add_substitution (decl
);
1025 /* Write the nested name, including CV-qualifiers, of DECL.
1027 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1028 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1030 <ref-qualifier> ::= R # & ref-qualifier
1031 ::= O # && ref-qualifier
1032 <CV-qualifiers> ::= [r] [V] [K] */
1035 write_nested_name (const tree decl
)
1039 MANGLE_TRACE_TREE ("nested-name", decl
);
1043 /* Write CV-qualifiers, if this is a member function. */
1044 if (TREE_CODE (decl
) == FUNCTION_DECL
1045 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1047 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1049 if (DECL_CONST_MEMFUNC_P (decl
))
1051 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1053 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1060 /* Is this a template instance? */
1061 if (decl_is_template_id (decl
, &template_info
))
1063 /* Yes, use <template-prefix>. */
1064 write_template_prefix (decl
);
1065 write_template_args (TI_ARGS (template_info
));
1067 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1068 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1070 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1071 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1073 write_template_prefix (decl
);
1074 write_template_args (TREE_OPERAND (name
, 1));
1078 write_prefix (decl_mangling_context (decl
));
1079 write_unqualified_name (decl
);
1084 /* No, just use <prefix> */
1085 write_prefix (decl_mangling_context (decl
));
1086 write_unqualified_name (decl
);
1091 /* <prefix> ::= <prefix> <unqualified-name>
1092 ::= <template-param>
1093 ::= <template-prefix> <template-args>
1096 ::= <substitution> */
1099 write_prefix (const tree node
)
1102 /* Non-NULL if NODE represents a template-id. */
1103 tree template_info
= NULL
;
1106 || node
== global_namespace
)
1109 MANGLE_TRACE_TREE ("prefix", node
);
1111 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1117 if (find_substitution (node
))
1122 /* If this is a function or parm decl, that means we've hit function
1123 scope, so this prefix must be for a local name. In this
1124 case, we're under the <local-name> production, which encodes
1125 the enclosing function scope elsewhere. So don't continue
1127 if (TREE_CODE (node
) == FUNCTION_DECL
1128 || TREE_CODE (node
) == PARM_DECL
)
1132 decl_is_template_id (decl
, &template_info
);
1136 /* Node is a type. */
1137 decl
= TYPE_NAME (node
);
1138 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1139 template_info
= TYPE_TEMPLATE_INFO (node
);
1142 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1143 write_template_param (node
);
1144 else if (template_info
!= NULL
)
1147 write_template_prefix (decl
);
1148 write_template_args (TI_ARGS (template_info
));
1150 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1152 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1153 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1155 write_template_prefix (decl
);
1156 write_template_args (TREE_OPERAND (name
, 1));
1160 write_prefix (decl_mangling_context (decl
));
1161 write_unqualified_name (decl
);
1165 /* Not templated. */
1167 write_prefix (decl_mangling_context (decl
));
1168 write_unqualified_name (decl
);
1170 || TREE_CODE (decl
) == FIELD_DECL
)
1172 /* <data-member-prefix> := <member source-name> M */
1178 add_substitution (node
);
1181 /* <template-prefix> ::= <prefix> <template component>
1182 ::= <template-param>
1183 ::= <substitution> */
1186 write_template_prefix (const tree node
)
1188 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1189 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1190 tree context
= decl_mangling_context (decl
);
1195 MANGLE_TRACE_TREE ("template-prefix", node
);
1197 /* Find the template decl. */
1198 if (decl_is_template_id (decl
, &template_info
))
1199 templ
= TI_TEMPLATE (template_info
);
1200 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1201 /* For a typename type, all we have is the name. */
1202 templ
= DECL_NAME (decl
);
1205 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1207 templ
= TYPE_TI_TEMPLATE (type
);
1210 /* For a member template, though, the template name for the
1211 innermost name must have all the outer template levels
1212 instantiated. For instance, consider
1214 template<typename T> struct Outer {
1215 template<typename U> struct Inner {};
1218 The template name for `Inner' in `Outer<int>::Inner<float>' is
1219 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1220 levels separately, so there's no TEMPLATE_DECL available for this
1221 (there's only `Outer<T>::Inner<U>').
1223 In order to get the substitutions right, we create a special
1224 TREE_LIST to represent the substitution candidate for a nested
1225 template. The TREE_PURPOSE is the template's context, fully
1226 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1229 So, for the example above, `Outer<int>::Inner' is represented as a
1230 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1231 and whose value is `Outer<T>::Inner<U>'. */
1232 if (context
&& TYPE_P (context
))
1233 substitution
= build_tree_list (context
, templ
);
1235 substitution
= templ
;
1237 if (find_substitution (substitution
))
1240 if (TREE_TYPE (templ
)
1241 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1242 write_template_param (TREE_TYPE (templ
));
1245 write_prefix (context
);
1246 write_unqualified_name (decl
);
1249 add_substitution (substitution
);
1252 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1253 mangled through special entry points.
1255 <unqualified-name> ::= <operator-name>
1258 ::= <unnamed-type-name>
1259 ::= <local-source-name>
1261 <local-source-name> ::= L <source-name> <discriminator> */
1264 write_unqualified_id (tree identifier
)
1266 if (IDENTIFIER_TYPENAME_P (identifier
))
1267 write_conversion_operator_name (TREE_TYPE (identifier
));
1268 else if (IDENTIFIER_OPNAME_P (identifier
))
1271 const char *mangled_name
= NULL
;
1273 /* Unfortunately, there is no easy way to go from the
1274 name of the operator back to the corresponding tree
1276 for (i
= 0; i
< MAX_TREE_CODES
; ++i
)
1277 if (operator_name_info
[i
].identifier
== identifier
)
1279 /* The ABI says that we prefer binary operator
1280 names to unary operator names. */
1281 if (operator_name_info
[i
].arity
== 2)
1283 mangled_name
= operator_name_info
[i
].mangled_name
;
1286 else if (!mangled_name
)
1287 mangled_name
= operator_name_info
[i
].mangled_name
;
1289 else if (assignment_operator_name_info
[i
].identifier
1293 = assignment_operator_name_info
[i
].mangled_name
;
1296 write_string (mangled_name
);
1298 else if (UDLIT_OPER_P (identifier
))
1299 write_literal_operator_name (identifier
);
1301 write_source_name (identifier
);
1305 write_unqualified_name (tree decl
)
1307 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1309 if (identifier_p (decl
))
1311 write_unqualified_id (decl
);
1317 if (DECL_NAME (decl
) == NULL_TREE
)
1320 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1321 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1323 else if (DECL_DECLARES_FUNCTION_P (decl
))
1326 if (DECL_CONSTRUCTOR_P (decl
))
1327 write_special_name_constructor (decl
);
1328 else if (DECL_DESTRUCTOR_P (decl
))
1329 write_special_name_destructor (decl
);
1330 else if (DECL_CONV_FN_P (decl
))
1332 /* Conversion operator. Handle it right here.
1333 <operator> ::= cv <type> */
1335 if (decl_is_template_id (decl
, NULL
))
1338 fn_type
= get_mostly_instantiated_function_type (decl
);
1339 type
= TREE_TYPE (fn_type
);
1341 else if (FNDECL_USED_AUTO (decl
))
1342 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1343 ->x_auto_return_pattern
);
1345 type
= DECL_CONV_FN_TYPE (decl
);
1346 write_conversion_operator_name (type
);
1348 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1350 operator_name_info_t
*oni
;
1351 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1352 oni
= assignment_operator_name_info
;
1354 oni
= operator_name_info
;
1356 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1358 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1359 write_literal_operator_name (DECL_NAME (decl
));
1366 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1367 && DECL_NAMESPACE_SCOPE_P (decl
)
1368 && decl_linkage (decl
) == lk_internal
)
1370 MANGLE_TRACE_TREE ("local-source-name", decl
);
1372 write_source_name (DECL_NAME (decl
));
1373 /* The default discriminator is 1, and that's all we ever use,
1374 so there's no code to output one here. */
1378 tree type
= TREE_TYPE (decl
);
1380 if (TREE_CODE (decl
) == TYPE_DECL
1381 && TYPE_UNNAMED_P (type
))
1382 write_unnamed_type_name (type
);
1383 else if (TREE_CODE (decl
) == TYPE_DECL
1384 && LAMBDA_TYPE_P (type
))
1385 write_closure_type_name (type
);
1387 write_source_name (DECL_NAME (decl
));
1390 /* We use the ABI tags from the primary class template, ignoring tags on any
1391 specializations. This is necessary because C++ doesn't require a
1392 specialization to be declared before it is used unless the use requires a
1393 complete type, but we need to get the tags right on incomplete types as
1395 if (tree tmpl
= most_general_template (decl
))
1397 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1398 if (res
== NULL_TREE
)
1399 /* UNBOUND_CLASS_TEMPLATE. */;
1400 else if (DECL_DECLARES_TYPE_P (decl
))
1402 else if (any_abi_below (11))
1404 /* ABI v10 implicit tags on the template. */
1405 tree mtags
= missing_abi_tags (res
);
1406 /* Explicit tags on the template. */
1407 tree ttags
= get_abi_tags (res
);
1408 /* Tags on the instantiation. */
1409 tree dtags
= get_abi_tags (decl
);
1411 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1412 G
.need_abi_warning
= 1;
1414 /* Add the v10 tags to the explicit tags now. */
1415 mtags
= chainon (mtags
, ttags
);
1417 if (!G
.need_abi_warning
1418 && abi_warn_or_compat_version_crosses (11)
1419 && !equal_abi_tags (dtags
, mtags
))
1420 G
.need_abi_warning
= 1;
1422 if (!abi_version_at_least (10))
1423 /* In abi <10, we only got the explicit tags. */
1425 else if (flag_abi_version
== 10)
1427 /* In ABI 10, we want explict and implicit tags. */
1428 write_abi_tags (mtags
);
1434 tree tags
= get_abi_tags (decl
);
1435 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1436 && any_abi_below (11))
1437 if (tree mtags
= missing_abi_tags (decl
))
1439 if (abi_warn_or_compat_version_crosses (11))
1440 G
.need_abi_warning
= true;
1441 if (!abi_version_at_least (11))
1442 tags
= chainon (mtags
, tags
);
1444 write_abi_tags (tags
);
1447 /* Write the unqualified-name for a conversion operator to TYPE. */
1450 write_conversion_operator_name (const tree type
)
1452 write_string ("cv");
1456 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1458 <source-name> ::= </length/ number> <identifier> */
1461 write_source_name (tree identifier
)
1463 MANGLE_TRACE_TREE ("source-name", identifier
);
1465 /* Never write the whole template-id name including the template
1466 arguments; we only want the template name. */
1467 if (IDENTIFIER_TEMPLATE (identifier
))
1468 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1470 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1471 write_identifier (IDENTIFIER_POINTER (identifier
));
1474 /* Compare two TREE_STRINGs like strcmp. */
1477 tree_string_cmp (const void *p1
, const void *p2
)
1481 tree s1
= *(const tree
*)p1
;
1482 tree s2
= *(const tree
*)p2
;
1483 return strcmp (TREE_STRING_POINTER (s1
),
1484 TREE_STRING_POINTER (s2
));
1487 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1489 static vec
<tree
, va_gc
> *
1490 sorted_abi_tags (tree tags
)
1492 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1494 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1496 if (ABI_TAG_IMPLICIT (t
))
1498 tree str
= TREE_VALUE (t
);
1499 vec_safe_push (vec
, str
);
1502 vec
->qsort (tree_string_cmp
);
1507 /* ID is the name of a function or type with abi_tags attribute TAGS.
1508 Write out the name, suitably decorated. */
1511 write_abi_tags (tree tags
)
1513 if (tags
== NULL_TREE
)
1516 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1518 unsigned i
; tree str
;
1519 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1522 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1523 write_identifier (TREE_STRING_POINTER (str
));
1526 release_tree_vector (vec
);
1529 /* Simplified unique_ptr clone to release a tree vec on exit. */
1531 struct releasing_vec
1533 typedef vec
<tree
, va_gc
> vec_t
;
1535 releasing_vec (vec_t
*v
): v(v
) { }
1536 releasing_vec (): v(make_tree_vector ()) { }
1538 vec_t
&operator* () const { return *v
; }
1539 vec_t
*operator-> () const { return v
; }
1540 vec_t
*get () const { return v
; }
1541 operator vec_t
*() const { return v
; }
1542 tree
& operator[] (unsigned i
) const { return (*v
)[i
]; }
1544 ~releasing_vec() { release_tree_vector (v
); }
1549 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1552 equal_abi_tags (tree t1
, tree t2
)
1554 releasing_vec v1
= sorted_abi_tags (t1
);
1555 releasing_vec v2
= sorted_abi_tags (t2
);
1557 unsigned len1
= v1
->length();
1558 if (len1
!= v2
->length())
1560 for (unsigned i
= 0; i
< len1
; ++i
)
1561 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1566 /* Write a user-defined literal operator.
1567 ::= li <source-name> # "" <source-name>
1568 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1571 write_literal_operator_name (tree identifier
)
1573 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1574 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1575 write_unsigned_number (strlen (suffix
));
1576 write_identifier (suffix
);
1579 /* Encode 0 as _, and 1+ as n-1_. */
1582 write_compact_number (int num
)
1585 write_unsigned_number (num
- 1);
1589 /* Return how many unnamed types precede TYPE in its enclosing class. */
1592 nested_anon_class_index (tree type
)
1595 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1596 for (; member
; member
= DECL_CHAIN (member
))
1597 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1599 tree memtype
= TREE_TYPE (member
);
1600 if (memtype
== type
)
1602 else if (TYPE_UNNAMED_P (memtype
))
1609 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1612 write_unnamed_type_name (const tree type
)
1615 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1617 if (TYPE_FUNCTION_SCOPE_P (type
))
1618 discriminator
= local_class_index (type
);
1619 else if (TYPE_CLASS_SCOPE_P (type
))
1620 discriminator
= nested_anon_class_index (type
);
1623 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1624 /* Just use the old mangling at namespace scope. */
1625 write_source_name (TYPE_IDENTIFIER (type
));
1629 write_string ("Ut");
1630 write_compact_number (discriminator
);
1633 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1634 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1637 write_closure_type_name (const tree type
)
1639 tree fn
= lambda_function (type
);
1640 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1641 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1643 MANGLE_TRACE_TREE ("closure-type-name", type
);
1645 write_string ("Ul");
1646 write_method_parms (parms
, /*method_p=*/1, fn
);
1648 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1651 /* Convert NUMBER to ascii using base BASE and generating at least
1652 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1653 into which to store the characters. Returns the number of
1654 characters generated (these will be laid out in advance of where
1658 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1659 char *buffer
, const unsigned int min_digits
)
1661 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1662 unsigned digits
= 0;
1666 unsigned HOST_WIDE_INT d
= number
/ base
;
1668 *--buffer
= base_digits
[number
- d
* base
];
1672 while (digits
< min_digits
)
1674 *--buffer
= base_digits
[0];
1680 /* Non-terminal <number>.
1682 <number> ::= [n] </decimal integer/> */
1685 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1686 const unsigned int base
)
1688 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1691 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1694 number
= -((HOST_WIDE_INT
) number
);
1696 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1697 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1700 /* Write out an integral CST in decimal. Most numbers are small, and
1701 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1702 bigger than that, which we must deal with. */
1705 write_integer_cst (const tree cst
)
1707 int sign
= tree_int_cst_sgn (cst
);
1708 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1709 if (!wi::fits_uhwi_p (abs_value
))
1711 /* A bignum. We do this in chunks, each of which fits in a
1713 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1714 unsigned HOST_WIDE_INT chunk
;
1715 unsigned chunk_digits
;
1716 char *ptr
= buffer
+ sizeof (buffer
);
1721 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1726 if (sizeof (HOST_WIDE_INT
) >= 8)
1728 /* It is at least 64 bits, so 10^18 is representable. */
1733 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1734 base
= build_int_cstu (type
, chunk
);
1735 n
= wide_int_to_tree (type
, cst
);
1740 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1744 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1745 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1748 done
= integer_zerop (d
);
1749 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1750 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1751 done
? 1 : chunk_digits
);
1757 write_chars (ptr
, count
);
1764 write_unsigned_number (abs_value
.to_uhwi ());
1768 /* Write out a floating-point literal.
1770 "Floating-point literals are encoded using the bit pattern of the
1771 target processor's internal representation of that number, as a
1772 fixed-length lowercase hexadecimal string, high-order bytes first
1773 (even if the target processor would store low-order bytes first).
1774 The "n" prefix is not used for floating-point literals; the sign
1775 bit is encoded with the rest of the number.
1777 Here are some examples, assuming the IEEE standard representation
1778 for floating point numbers. (Spaces are for readability, not
1779 part of the encoding.)
1782 -1.0f Lf bf80 0000 E
1783 1.17549435e-38f Lf 0080 0000 E
1784 1.40129846e-45f Lf 0000 0001 E
1785 0.0f Lf 0000 0000 E"
1787 Caller is responsible for the Lx and the E. */
1789 write_real_cst (const tree value
)
1791 long target_real
[4]; /* largest supported float */
1792 /* Buffer for eight hex digits in a 32-bit number but big enough
1793 even for 64-bit long to avoid warnings. */
1797 tree type
= TREE_TYPE (value
);
1798 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1800 real_to_target (target_real
, &TREE_REAL_CST (value
),
1803 /* The value in target_real is in the target word order,
1804 so we must write it out backward if that happens to be
1805 little-endian. write_number cannot be used, it will
1806 produce uppercase. */
1807 if (FLOAT_WORDS_BIG_ENDIAN
)
1808 i
= 0, limit
= words
, dir
= 1;
1810 i
= words
- 1, limit
= -1, dir
= -1;
1812 for (; i
!= limit
; i
+= dir
)
1814 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1815 write_chars (buffer
, 8);
1819 /* Non-terminal <identifier>.
1821 <identifier> ::= </unqualified source code identifier> */
1824 write_identifier (const char *identifier
)
1826 MANGLE_TRACE ("identifier", identifier
);
1827 write_string (identifier
);
1830 /* Handle constructor productions of non-terminal <special-name>.
1831 CTOR is a constructor FUNCTION_DECL.
1833 <special-name> ::= C1 # complete object constructor
1834 ::= C2 # base object constructor
1835 ::= C3 # complete object allocating constructor
1837 Currently, allocating constructors are never used. */
1840 write_special_name_constructor (const tree ctor
)
1843 bool new_inh
= (flag_new_inheriting_ctors
1844 && DECL_INHERITED_CTOR (ctor
));
1847 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1849 /* This is the old-style "[unified]" constructor.
1850 In some cases, we may emit this function and call
1851 it from the clones in order to share code and save space. */
1852 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1856 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1860 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1863 /* Handle destructor productions of non-terminal <special-name>.
1864 DTOR is a destructor FUNCTION_DECL.
1866 <special-name> ::= D0 # deleting (in-charge) destructor
1867 ::= D1 # complete object (in-charge) destructor
1868 ::= D2 # base object (not-in-charge) destructor */
1871 write_special_name_destructor (const tree dtor
)
1873 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1874 write_string ("D0");
1875 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1876 write_string ("D2");
1877 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1878 /* This is the old-style "[unified]" destructor.
1879 In some cases, we may emit this function and call
1880 it from the clones in order to share code and save space. */
1881 write_string ("D4");
1884 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1885 write_string ("D1");
1889 /* Scan the vector of local classes and return how many others with the
1890 same name (or same no name) and context precede ENTITY. */
1893 local_class_index (tree entity
)
1895 int ix
, discriminator
= 0;
1896 tree name
= (TYPE_UNNAMED_P (entity
) ? NULL_TREE
1897 : TYPE_IDENTIFIER (entity
));
1898 tree ctx
= TYPE_CONTEXT (entity
);
1899 for (ix
= 0; ; ix
++)
1901 tree type
= (*local_classes
)[ix
];
1903 return discriminator
;
1904 if (TYPE_CONTEXT (type
) == ctx
1905 && (name
? TYPE_IDENTIFIER (type
) == name
1906 : TYPE_UNNAMED_P (type
)))
1912 /* Return the discriminator for ENTITY appearing inside
1913 FUNCTION. The discriminator is the lexical ordinal of VAR among
1914 entities with the same name in the same FUNCTION. */
1917 discriminator_for_local_entity (tree entity
)
1919 if (DECL_DISCRIMINATOR_P (entity
))
1921 if (DECL_DISCRIMINATOR_SET_P (entity
))
1922 return DECL_DISCRIMINATOR (entity
);
1924 /* The first entity with a particular name doesn't get
1925 DECL_DISCRIMINATOR set up. */
1928 else if (TREE_CODE (entity
) == TYPE_DECL
)
1930 /* Scan the list of local classes. */
1931 entity
= TREE_TYPE (entity
);
1933 /* Lambdas and unnamed types have their own discriminators. */
1934 if (LAMBDA_TYPE_P (entity
) || TYPE_UNNAMED_P (entity
))
1937 return local_class_index (entity
);
1943 /* Return the discriminator for STRING, a string literal used inside
1944 FUNCTION. The discriminator is the lexical ordinal of STRING among
1945 string literals used in FUNCTION. */
1948 discriminator_for_string_literal (tree
/*function*/,
1951 /* For now, we don't discriminate amongst string literals. */
1955 /* <discriminator> := _ <number>
1957 The discriminator is used only for the second and later occurrences
1958 of the same name within a single function. In this case <number> is
1959 n - 2, if this is the nth occurrence, in lexical order. */
1962 write_discriminator (const int discriminator
)
1964 /* If discriminator is zero, don't write anything. Otherwise... */
1965 if (discriminator
> 0)
1968 write_unsigned_number (discriminator
- 1);
1972 /* Mangle the name of a function-scope entity. FUNCTION is the
1973 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1974 default argument scope. ENTITY is the decl for the entity itself.
1975 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1976 either ENTITY itself or an enclosing scope of ENTITY.
1978 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1979 := Z <function encoding> E s [<discriminator>]
1980 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1983 write_local_name (tree function
, const tree local_entity
,
1986 tree parm
= NULL_TREE
;
1988 MANGLE_TRACE_TREE ("local-name", entity
);
1990 if (TREE_CODE (function
) == PARM_DECL
)
1993 function
= DECL_CONTEXT (parm
);
1997 write_encoding (function
);
2000 /* For this purpose, parameters are numbered from right-to-left. */
2005 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
2013 write_compact_number (i
- 1);
2016 if (TREE_CODE (entity
) == STRING_CST
)
2019 write_discriminator (discriminator_for_string_literal (function
,
2024 /* Now the <entity name>. Let write_name know its being called
2025 from <local-name>, so it doesn't try to process the enclosing
2026 function scope again. */
2027 write_name (entity
, /*ignore_local_scope=*/1);
2028 write_discriminator (discriminator_for_local_entity (local_entity
));
2032 /* Non-terminals <type> and <CV-qualifier>.
2034 <type> ::= <builtin-type>
2036 ::= <class-enum-type>
2038 ::= <pointer-to-member-type>
2039 ::= <template-param>
2042 ::= P <type> # pointer-to
2043 ::= R <type> # reference-to
2044 ::= C <type> # complex pair (C 2000)
2045 ::= G <type> # imaginary (C 2000) [not supported]
2046 ::= U <source-name> <type> # vendor extended type qualifier
2050 <type> ::= RR <type> # rvalue reference-to
2051 <type> ::= Dt <expression> # decltype of an id-expression or
2052 # class member access
2053 <type> ::= DT <expression> # decltype of an expression
2054 <type> ::= Dn # decltype of nullptr
2056 TYPE is a type node. */
2059 write_type (tree type
)
2061 /* This gets set to nonzero if TYPE turns out to be a (possibly
2062 CV-qualified) builtin type. */
2063 int is_builtin_type
= 0;
2065 MANGLE_TRACE_TREE ("type", type
);
2067 if (type
== error_mark_node
)
2070 type
= canonicalize_for_substitution (type
);
2071 if (find_substitution (type
))
2075 if (write_CV_qualifiers_for_type (type
) > 0)
2076 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2077 mangle the unqualified type. The recursive call is needed here
2078 since both the qualified and unqualified types are substitution
2081 tree t
= TYPE_MAIN_VARIANT (type
);
2082 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2084 tree attrs
= NULL_TREE
;
2085 if (tx_safe_fn_type_p (type
))
2086 attrs
= tree_cons (get_identifier ("transaction_safe"),
2088 t
= cp_build_type_attribute_variant (t
, attrs
);
2090 gcc_assert (t
!= type
);
2091 if (TREE_CODE (t
) == FUNCTION_TYPE
2092 || TREE_CODE (t
) == METHOD_TYPE
)
2094 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2095 if (abi_version_at_least (8)
2096 || type
== TYPE_MAIN_VARIANT (type
))
2097 /* Avoid adding the unqualified function type as a substitution. */
2098 write_function_type (t
);
2101 if (abi_warn_or_compat_version_crosses (8))
2102 G
.need_abi_warning
= 1;
2107 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2108 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2109 so that the cv-qualification of the element type is available
2110 in write_array_type. */
2111 write_array_type (type
);
2114 tree type_orig
= type
;
2116 /* See through any typedefs. */
2117 type
= TYPE_MAIN_VARIANT (type
);
2118 if (TREE_CODE (type
) == FUNCTION_TYPE
2119 || TREE_CODE (type
) == METHOD_TYPE
)
2121 type
= build_ref_qualified_type (type
, type_memfn_rqual (type_orig
));
2122 type
= build_exception_variant (type
,
2123 TYPE_RAISES_EXCEPTIONS (type_orig
));
2126 /* According to the C++ ABI, some library classes are passed the
2127 same as the scalar type of their single member and use the same
2129 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2130 type
= TREE_TYPE (first_field (type
));
2132 if (TYPE_PTRDATAMEM_P (type
))
2133 write_pointer_to_member_type (type
);
2136 /* Handle any target-specific fundamental types. */
2137 const char *target_mangling
2138 = targetm
.mangle_type (type_orig
);
2140 if (target_mangling
)
2142 write_string (target_mangling
);
2143 /* Add substitutions for types other than fundamental
2145 if (!VOID_TYPE_P (type
)
2146 && TREE_CODE (type
) != INTEGER_TYPE
2147 && TREE_CODE (type
) != REAL_TYPE
2148 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2149 add_substitution (type
);
2153 switch (TREE_CODE (type
))
2157 case INTEGER_TYPE
: /* Includes wchar_t. */
2159 case FIXED_POINT_TYPE
:
2161 /* If this is a typedef, TYPE may not be one of
2162 the standard builtin type nodes, but an alias of one. Use
2163 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2164 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2171 write_type (TREE_TYPE (type
));
2176 write_function_type (type
);
2182 /* A pointer-to-member function is represented as a special
2183 RECORD_TYPE, so check for this first. */
2184 if (TYPE_PTRMEMFUNC_P (type
))
2185 write_pointer_to_member_type (type
);
2187 write_class_enum_type (type
);
2191 case UNBOUND_CLASS_TEMPLATE
:
2192 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2193 ordinary nested names. */
2194 write_nested_name (TYPE_STUB_DECL (type
));
2198 case REFERENCE_TYPE
:
2199 if (TYPE_PTR_P (type
))
2201 else if (TYPE_REF_IS_RVALUE (type
))
2206 tree target
= TREE_TYPE (type
);
2207 /* Attribute const/noreturn are not reflected in mangling.
2208 We strip them here rather than at a lower level because
2209 a typedef or template argument can have function type
2210 with function-cv-quals (that use the same representation),
2211 but you can't have a pointer/reference to such a type. */
2212 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2214 if (abi_warn_or_compat_version_crosses (5)
2215 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2216 G
.need_abi_warning
= 1;
2217 if (abi_version_at_least (5))
2218 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2220 write_type (target
);
2224 case TEMPLATE_TYPE_PARM
:
2227 if (AUTO_IS_DECLTYPE (type
))
2228 write_identifier ("Dc");
2230 write_identifier ("Da");
2235 case TEMPLATE_PARM_INDEX
:
2236 write_template_param (type
);
2239 case TEMPLATE_TEMPLATE_PARM
:
2240 write_template_template_param (type
);
2243 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2244 write_template_template_param (type
);
2246 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2250 if (abi_version_at_least (4))
2252 write_string ("Dv");
2253 /* Non-constant vector size would be encoded with
2254 _ expression, but we don't support that yet. */
2255 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2259 write_string ("U8__vector");
2260 if (abi_warn_or_compat_version_crosses (4))
2261 G
.need_abi_warning
= 1;
2262 write_type (TREE_TYPE (type
));
2265 case TYPE_PACK_EXPANSION
:
2266 write_string ("Dp");
2267 write_type (PACK_EXPANSION_PATTERN (type
));
2271 /* These shouldn't make it into mangling. */
2272 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2273 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2275 /* In ABI <5, we stripped decltype of a plain decl. */
2276 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2278 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2279 tree etype
= NULL_TREE
;
2280 switch (TREE_CODE (expr
))
2287 case TEMPLATE_PARM_INDEX
:
2288 etype
= TREE_TYPE (expr
);
2295 if (etype
&& !type_uses_auto (etype
))
2297 if (abi_warn_or_compat_version_crosses (5))
2298 G
.need_abi_warning
= 1;
2299 if (!abi_version_at_least (5))
2308 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2312 ++cp_unevaluated_operand
;
2313 write_expression (DECLTYPE_TYPE_EXPR (type
));
2314 --cp_unevaluated_operand
;
2319 write_string ("Dn");
2320 if (abi_version_at_least (7))
2322 if (abi_warn_or_compat_version_crosses (7))
2323 G
.need_abi_warning
= 1;
2327 sorry ("mangling typeof, use decltype instead");
2330 case UNDERLYING_TYPE
:
2331 sorry ("mangling __underlying_type");
2343 /* Types other than builtin types are substitution candidates. */
2344 if (!is_builtin_type
)
2345 add_substitution (type
);
2348 /* qsort callback for sorting a vector of attribute entries. */
2351 attr_strcmp (const void *p1
, const void *p2
)
2353 tree a1
= *(const tree
*)p1
;
2354 tree a2
= *(const tree
*)p2
;
2356 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2357 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2359 return strcmp (as1
->name
, as2
->name
);
2362 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2363 CV-qualifiers written for TYPE.
2365 <CV-qualifiers> ::= [r] [V] [K] */
2368 write_CV_qualifiers_for_type (const tree type
)
2370 int num_qualifiers
= 0;
2372 /* The order is specified by:
2374 "In cases where multiple order-insensitive qualifiers are
2375 present, they should be ordered 'K' (closest to the base type),
2376 'V', 'r', and 'U' (farthest from the base type) ..." */
2378 /* Mangle attributes that affect type identity as extended qualifiers.
2380 We don't do this with classes and enums because their attributes
2381 are part of their definitions, not something added on. */
2383 if (!OVERLOAD_TYPE_P (type
))
2386 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2388 tree name
= get_attribute_name (a
);
2389 const attribute_spec
*as
= lookup_attribute_spec (name
);
2390 if (as
&& as
->affects_type_identity
2391 && !is_attribute_p ("transaction_safe", name
)
2392 && !is_attribute_p ("abi_tag", name
))
2395 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2396 G
.need_abi_warning
= true;
2397 if (abi_version_at_least (10))
2399 vec
.qsort (attr_strcmp
);
2400 while (!vec
.is_empty())
2403 const attribute_spec
*as
2404 = lookup_attribute_spec (get_attribute_name (a
));
2407 write_unsigned_number (strlen (as
->name
));
2408 write_string (as
->name
);
2412 for (tree args
= TREE_VALUE (a
); args
;
2413 args
= TREE_CHAIN (args
))
2415 tree arg
= TREE_VALUE (args
);
2416 write_template_arg (arg
);
2426 /* Note that we do not use cp_type_quals below; given "const
2427 int[3]", the "const" is emitted with the "int", not with the
2429 cp_cv_quals quals
= TYPE_QUALS (type
);
2431 if (quals
& TYPE_QUAL_RESTRICT
)
2436 if (quals
& TYPE_QUAL_VOLATILE
)
2441 if (quals
& TYPE_QUAL_CONST
)
2447 return num_qualifiers
;
2450 /* Non-terminal <builtin-type>.
2452 <builtin-type> ::= v # void
2457 ::= h # unsigned char
2459 ::= t # unsigned short
2461 ::= j # unsigned int
2463 ::= m # unsigned long
2464 ::= x # long long, __int64
2465 ::= y # unsigned long long, __int64
2467 ::= o # unsigned __int128
2470 ::= e # long double, __float80
2471 ::= g # __float128 [not supported]
2472 ::= u <source-name> # vendor extended type */
2475 write_builtin_type (tree type
)
2477 if (TYPE_CANONICAL (type
))
2478 type
= TYPE_CANONICAL (type
);
2480 switch (TREE_CODE (type
))
2491 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2492 isn't in integer_type_nodes. */
2493 if (type
== wchar_type_node
)
2495 else if (type
== char16_type_node
)
2496 write_string ("Ds");
2497 else if (type
== char32_type_node
)
2498 write_string ("Di");
2502 /* Assume TYPE is one of the shared integer type nodes. Find
2503 it in the array of these nodes. */
2505 for (itk
= 0; itk
< itk_none
; ++itk
)
2506 if (integer_types
[itk
] != NULL_TREE
2507 && integer_type_codes
[itk
] != '\0'
2508 && type
== integer_types
[itk
])
2510 /* Print the corresponding single-letter code. */
2511 write_char (integer_type_codes
[itk
]);
2515 if (itk
== itk_none
)
2517 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2518 TYPE_UNSIGNED (type
));
2525 if (TYPE_PRECISION (type
) == 128)
2526 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2529 /* Allow for cases where TYPE is not one of the shared
2530 integer type nodes and write a "vendor extended builtin
2531 type" with a name the form intN or uintN, respectively.
2532 Situations like this can happen if you have an
2533 __attribute__((__mode__(__SI__))) type and use exotic
2534 switches like '-mint8' on AVR. Of course, this is
2535 undefined by the C++ ABI (and '-mint8' is not even
2536 Standard C conforming), but when using such special
2537 options you're pretty much in nowhere land anyway. */
2539 char prec
[11]; /* up to ten digits for an unsigned */
2541 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2542 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2543 write_char ('u'); /* "vendor extended builtin type" */
2544 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2545 write_string (prefix
);
2546 write_string (prec
);
2553 if (type
== float_type_node
)
2555 else if (type
== double_type_node
)
2557 else if (type
== long_double_type_node
)
2559 else if (type
== dfloat32_type_node
)
2560 write_string ("Df");
2561 else if (type
== dfloat64_type_node
)
2562 write_string ("Dd");
2563 else if (type
== dfloat128_type_node
)
2564 write_string ("De");
2569 case FIXED_POINT_TYPE
:
2570 write_string ("DF");
2571 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2572 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2573 if (type
== fract_type_node
2574 || type
== sat_fract_type_node
2575 || type
== accum_type_node
2576 || type
== sat_accum_type_node
)
2578 else if (type
== unsigned_fract_type_node
2579 || type
== sat_unsigned_fract_type_node
2580 || type
== unsigned_accum_type_node
2581 || type
== sat_unsigned_accum_type_node
)
2583 else if (type
== short_fract_type_node
2584 || type
== sat_short_fract_type_node
2585 || type
== short_accum_type_node
2586 || type
== sat_short_accum_type_node
)
2588 else if (type
== unsigned_short_fract_type_node
2589 || type
== sat_unsigned_short_fract_type_node
2590 || type
== unsigned_short_accum_type_node
2591 || type
== sat_unsigned_short_accum_type_node
)
2593 else if (type
== long_fract_type_node
2594 || type
== sat_long_fract_type_node
2595 || type
== long_accum_type_node
2596 || type
== sat_long_accum_type_node
)
2598 else if (type
== unsigned_long_fract_type_node
2599 || type
== sat_unsigned_long_fract_type_node
2600 || type
== unsigned_long_accum_type_node
2601 || type
== sat_unsigned_long_accum_type_node
)
2603 else if (type
== long_long_fract_type_node
2604 || type
== sat_long_long_fract_type_node
2605 || type
== long_long_accum_type_node
2606 || type
== sat_long_long_accum_type_node
)
2608 else if (type
== unsigned_long_long_fract_type_node
2609 || type
== sat_unsigned_long_long_fract_type_node
2610 || type
== unsigned_long_long_accum_type_node
2611 || type
== sat_unsigned_long_long_accum_type_node
)
2614 sorry ("mangling unknown fixed point type");
2615 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2616 if (TYPE_SATURATING (type
))
2627 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2628 METHOD_TYPE. The return type is mangled before the parameter
2631 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2634 write_function_type (const tree type
)
2636 MANGLE_TRACE_TREE ("function-type", type
);
2638 /* For a pointer to member function, the function type may have
2639 cv-qualifiers, indicating the quals for the artificial 'this'
2641 if (TREE_CODE (type
) == METHOD_TYPE
)
2643 /* The first parameter must be a POINTER_TYPE pointing to the
2644 `this' parameter. */
2645 tree this_type
= class_of_this_parm (type
);
2646 write_CV_qualifiers_for_type (this_type
);
2649 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2651 if (tx_safe_fn_type_p (type
))
2652 write_string ("Dx");
2655 /* We don't track whether or not a type is `extern "C"'. Note that
2656 you can have an `extern "C"' function that does not have
2657 `extern "C"' type, and vice versa:
2659 extern "C" typedef void function_t();
2660 function_t f; // f has C++ linkage, but its type is
2663 typedef void function_t();
2664 extern "C" function_t f; // Vice versa.
2667 write_bare_function_type (type
, /*include_return_type_p=*/1,
2669 if (FUNCTION_REF_QUALIFIED (type
))
2671 if (FUNCTION_RVALUE_QUALIFIED (type
))
2679 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2680 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2681 is mangled before the parameter types. If non-NULL, DECL is
2682 FUNCTION_DECL for the function whose type is being emitted. */
2685 write_bare_function_type (const tree type
, const int include_return_type_p
,
2688 MANGLE_TRACE_TREE ("bare-function-type", type
);
2690 /* Mangle the return type, if requested. */
2691 if (include_return_type_p
)
2692 write_type (TREE_TYPE (type
));
2694 /* Now mangle the types of the arguments. */
2696 write_method_parms (TYPE_ARG_TYPES (type
),
2697 TREE_CODE (type
) == METHOD_TYPE
,
2702 /* Write the mangled representation of a method parameter list of
2703 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2704 considered a non-static method, and the this parameter is omitted.
2705 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2706 parameters are being emitted. */
2709 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2711 tree first_parm_type
;
2712 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2714 /* Assume this parameter type list is variable-length. If it ends
2715 with a void type, then it's not. */
2718 /* If this is a member function, skip the first arg, which is the
2720 "Member functions do not encode the type of their implicit this
2723 Similarly, there's no need to mangle artificial parameters, like
2724 the VTT parameters for constructors and destructors. */
2727 parm_types
= TREE_CHAIN (parm_types
);
2728 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2730 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2732 parm_types
= TREE_CHAIN (parm_types
);
2733 parm_decl
= DECL_CHAIN (parm_decl
);
2737 for (first_parm_type
= parm_types
;
2739 parm_types
= TREE_CHAIN (parm_types
))
2741 tree parm
= TREE_VALUE (parm_types
);
2742 if (parm
== void_type_node
)
2744 /* "Empty parameter lists, whether declared as () or
2745 conventionally as (void), are encoded with a void parameter
2747 if (parm_types
== first_parm_type
)
2749 /* If the parm list is terminated with a void type, it's
2752 /* A void type better be the last one. */
2753 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2760 /* <builtin-type> ::= z # ellipsis */
2764 /* <class-enum-type> ::= <name> */
2767 write_class_enum_type (const tree type
)
2769 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2772 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2775 <template-args> ::= I <template-arg>* E */
2778 write_template_args (tree args
)
2783 MANGLE_TRACE_TREE ("template-args", args
);
2788 length
= TREE_VEC_LENGTH (args
);
2790 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2792 /* We have nested template args. We want the innermost template
2794 args
= TREE_VEC_ELT (args
, length
- 1);
2795 length
= TREE_VEC_LENGTH (args
);
2797 for (i
= 0; i
< length
; ++i
)
2798 write_template_arg (TREE_VEC_ELT (args
, i
));
2805 <unqualified-name> <template-args>
2806 part of SCOPE_REF or COMPONENT_REF mangling. */
2809 write_member_name (tree member
)
2811 if (identifier_p (member
))
2812 write_unqualified_id (member
);
2813 else if (DECL_P (member
))
2814 write_unqualified_name (member
);
2815 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2817 tree name
= TREE_OPERAND (member
, 0);
2818 if (TREE_CODE (name
) == OVERLOAD
)
2819 name
= OVL_FUNCTION (name
);
2820 write_member_name (name
);
2821 write_template_args (TREE_OPERAND (member
, 1));
2824 write_expression (member
);
2827 /* <expression> ::= <unary operator-name> <expression>
2828 ::= <binary operator-name> <expression> <expression>
2831 <expr-primary> ::= <template-param>
2832 ::= L <type> <value number> E # literal
2833 ::= L <mangled-name> E # external name
2834 ::= st <type> # sizeof
2835 ::= sr <type> <unqualified-name> # dependent name
2836 ::= sr <type> <unqualified-name> <template-args> */
2839 write_expression (tree expr
)
2841 enum tree_code code
= TREE_CODE (expr
);
2843 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2844 argument is converted (via qualification conversions) to another type. */
2845 while (CONVERT_EXPR_CODE_P (code
)
2846 /* Parentheses aren't mangled. */
2847 || code
== PAREN_EXPR
2848 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2850 expr
= TREE_OPERAND (expr
, 0);
2851 code
= TREE_CODE (expr
);
2854 if (code
== BASELINK
2855 && (!type_unknown_p (expr
)
2856 || !BASELINK_QUALIFIED_P (expr
)))
2858 expr
= BASELINK_FUNCTIONS (expr
);
2859 code
= TREE_CODE (expr
);
2862 /* Handle pointers-to-members by making them look like expression
2864 if (code
== PTRMEM_CST
)
2866 expr
= build_nt (ADDR_EXPR
,
2867 build_qualified_name (/*type=*/NULL_TREE
,
2868 PTRMEM_CST_CLASS (expr
),
2869 PTRMEM_CST_MEMBER (expr
),
2870 /*template_p=*/false));
2871 code
= TREE_CODE (expr
);
2874 /* Handle template parameters. */
2875 if (code
== TEMPLATE_TYPE_PARM
2876 || code
== TEMPLATE_TEMPLATE_PARM
2877 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2878 || code
== TEMPLATE_PARM_INDEX
)
2879 write_template_param (expr
);
2880 /* Handle literals. */
2881 else if (TREE_CODE_CLASS (code
) == tcc_constant
2882 || code
== CONST_DECL
)
2883 write_template_arg_literal (expr
);
2884 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2886 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr
))));
2887 write_string ("fpT");
2889 else if (code
== PARM_DECL
)
2891 /* A function parameter used in a late-specified return type. */
2892 int index
= DECL_PARM_INDEX (expr
);
2893 int level
= DECL_PARM_LEVEL (expr
);
2894 int delta
= G
.parm_depth
- level
+ 1;
2895 gcc_assert (index
>= 1);
2899 if (abi_version_at_least (5))
2901 /* Let L be the number of function prototype scopes from the
2902 innermost one (in which the parameter reference occurs) up
2903 to (and including) the one containing the declaration of
2904 the referenced parameter. If the parameter declaration
2905 clause of the innermost function prototype scope has been
2906 completely seen, it is not counted (in that case -- which
2907 is perhaps the most common -- L can be zero). */
2909 write_unsigned_number (delta
- 1);
2911 if (abi_warn_or_compat_version_crosses (5))
2912 G
.need_abi_warning
= true;
2915 write_compact_number (index
- 1);
2917 else if (DECL_P (expr
))
2920 write_mangled_name (expr
, false);
2923 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2925 tree op
= TREE_OPERAND (expr
, 0);
2927 if (PACK_EXPANSION_P (op
))
2929 if (abi_warn_or_compat_version_crosses (11))
2930 G
.need_abi_warning
= true;
2931 if (abi_version_at_least (11))
2933 /* sZ rather than szDp. */
2934 write_string ("sZ");
2935 write_expression (PACK_EXPANSION_PATTERN (op
));
2940 if (SIZEOF_EXPR_TYPE_P (expr
))
2942 write_string ("st");
2943 write_type (TREE_TYPE (op
));
2945 else if (ARGUMENT_PACK_P (op
))
2947 tree args
= ARGUMENT_PACK_ARGS (op
);
2948 int length
= TREE_VEC_LENGTH (args
);
2949 if (abi_warn_or_compat_version_crosses (10))
2950 G
.need_abi_warning
= true;
2951 if (abi_version_at_least (10))
2953 /* sP <template-arg>* E # sizeof...(T), size of a captured
2954 template parameter pack from an alias template */
2955 write_string ("sP");
2956 for (int i
= 0; i
< length
; ++i
)
2957 write_template_arg (TREE_VEC_ELT (args
, i
));
2962 /* In GCC 5 we represented this sizeof wrong, with the effect
2963 that we mangled it as the last element of the pack. */
2964 tree arg
= TREE_VEC_ELT (args
, length
-1);
2967 write_string ("st");
2972 write_string ("sz");
2973 write_expression (arg
);
2977 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2979 write_string ("st");
2980 write_type (TREE_OPERAND (expr
, 0));
2985 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2986 && TYPE_P (TREE_OPERAND (expr
, 0)))
2988 write_string ("at");
2989 write_type (TREE_OPERAND (expr
, 0));
2991 else if (code
== SCOPE_REF
2992 || code
== BASELINK
)
2995 if (code
== SCOPE_REF
)
2997 scope
= TREE_OPERAND (expr
, 0);
2998 member
= TREE_OPERAND (expr
, 1);
3002 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
3003 member
= BASELINK_FUNCTIONS (expr
);
3006 /* If the MEMBER is a real declaration, then the qualifying
3007 scope was not dependent. Ideally, we would not have a
3008 SCOPE_REF in those cases, but sometimes we do. If the second
3009 argument is a DECL, then the name must not have been
3011 if (DECL_P (member
))
3012 write_expression (member
);
3015 write_string ("sr");
3017 write_member_name (member
);
3020 else if (INDIRECT_REF_P (expr
)
3021 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3022 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
3024 write_expression (TREE_OPERAND (expr
, 0));
3026 else if (identifier_p (expr
))
3028 /* An operator name appearing as a dependent name needs to be
3029 specially marked to disambiguate between a use of the operator
3030 name and a use of the operator in an expression. */
3031 if (IDENTIFIER_OPNAME_P (expr
))
3032 write_string ("on");
3033 write_unqualified_id (expr
);
3035 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3037 tree fn
= TREE_OPERAND (expr
, 0);
3038 if (is_overloaded_fn (fn
))
3039 fn
= get_first_fn (fn
);
3041 fn
= DECL_NAME (fn
);
3042 if (IDENTIFIER_OPNAME_P (fn
))
3043 write_string ("on");
3044 write_unqualified_id (fn
);
3045 write_template_args (TREE_OPERAND (expr
, 1));
3047 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3049 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3050 const char *name
= (assignment_operator_name_info
[(int) subop
]
3052 write_string (name
);
3053 write_expression (TREE_OPERAND (expr
, 0));
3054 write_expression (TREE_OPERAND (expr
, 2));
3056 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3058 /* ::= [gs] nw <expression>* _ <type> E
3059 ::= [gs] nw <expression>* _ <type> <initializer>
3060 ::= [gs] na <expression>* _ <type> E
3061 ::= [gs] na <expression>* _ <type> <initializer>
3062 <initializer> ::= pi <expression>* E */
3063 tree placement
= TREE_OPERAND (expr
, 0);
3064 tree type
= TREE_OPERAND (expr
, 1);
3065 tree nelts
= TREE_OPERAND (expr
, 2);
3066 tree init
= TREE_OPERAND (expr
, 3);
3069 gcc_assert (code
== NEW_EXPR
);
3070 if (TREE_OPERAND (expr
, 2))
3071 code
= VEC_NEW_EXPR
;
3073 if (NEW_EXPR_USE_GLOBAL (expr
))
3074 write_string ("gs");
3076 write_string (operator_name_info
[(int) code
].mangled_name
);
3078 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3079 write_expression (TREE_VALUE (t
));
3086 ++processing_template_decl
;
3087 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3088 tf_warning_or_error
);
3089 type
= build_cplus_array_type (type
, domain
);
3090 --processing_template_decl
;
3094 if (init
&& TREE_CODE (init
) == TREE_LIST
3095 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3096 write_expression (TREE_VALUE (init
));
3100 write_string ("pi");
3101 if (init
&& init
!= void_node
)
3102 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3103 write_expression (TREE_VALUE (t
));
3107 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3109 gcc_assert (code
== DELETE_EXPR
);
3110 if (DELETE_EXPR_USE_VEC (expr
))
3111 code
= VEC_DELETE_EXPR
;
3113 if (DELETE_EXPR_USE_GLOBAL (expr
))
3114 write_string ("gs");
3116 write_string (operator_name_info
[(int) code
].mangled_name
);
3118 write_expression (TREE_OPERAND (expr
, 0));
3120 else if (code
== THROW_EXPR
)
3122 tree op
= TREE_OPERAND (expr
, 0);
3125 write_string ("tw");
3126 write_expression (op
);
3129 write_string ("tr");
3131 else if (code
== CONSTRUCTOR
)
3133 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3134 unsigned i
; tree val
;
3136 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3137 write_string ("il");
3140 write_string ("tl");
3141 write_type (TREE_TYPE (expr
));
3143 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3144 write_expression (val
);
3147 else if (dependent_name (expr
))
3149 write_unqualified_id (dependent_name (expr
));
3157 /* When we bind a variable or function to a non-type template
3158 argument with reference type, we create an ADDR_EXPR to show
3159 the fact that the entity's address has been taken. But, we
3160 don't actually want to output a mangling code for the `&'. */
3161 if (TREE_CODE (expr
) == ADDR_EXPR
3163 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
3165 expr
= TREE_OPERAND (expr
, 0);
3168 write_expression (expr
);
3172 code
= TREE_CODE (expr
);
3175 if (code
== COMPONENT_REF
)
3177 tree ob
= TREE_OPERAND (expr
, 0);
3179 if (TREE_CODE (ob
) == ARROW_EXPR
)
3181 write_string (operator_name_info
[(int)code
].mangled_name
);
3182 ob
= TREE_OPERAND (ob
, 0);
3183 write_expression (ob
);
3185 else if (!is_dummy_object (ob
))
3187 write_string ("dt");
3188 write_expression (ob
);
3190 /* else, for a non-static data member with no associated object (in
3191 unevaluated context), use the unresolved-name mangling. */
3193 write_member_name (TREE_OPERAND (expr
, 1));
3197 /* If it wasn't any of those, recursively expand the expression. */
3198 name
= operator_name_info
[(int) code
].mangled_name
;
3200 /* We used to mangle const_cast and static_cast like a C cast. */
3201 if (code
== CONST_CAST_EXPR
3202 || code
== STATIC_CAST_EXPR
)
3204 if (abi_warn_or_compat_version_crosses (6))
3205 G
.need_abi_warning
= 1;
3206 if (!abi_version_at_least (6))
3207 name
= operator_name_info
[CAST_EXPR
].mangled_name
;
3215 error ("use of built-in trait %qE in function signature; "
3216 "use library traits instead", expr
);
3220 sorry ("mangling %C", code
);
3226 write_string (name
);
3232 tree fn
= CALL_EXPR_FN (expr
);
3234 if (TREE_CODE (fn
) == ADDR_EXPR
)
3235 fn
= TREE_OPERAND (fn
, 0);
3237 /* Mangle a dependent name as the name, not whatever happens to
3238 be the first function in the overload set. */
3239 if ((TREE_CODE (fn
) == FUNCTION_DECL
3240 || TREE_CODE (fn
) == OVERLOAD
)
3241 && type_dependent_expression_p_push (expr
))
3242 fn
= DECL_NAME (get_first_fn (fn
));
3244 write_expression (fn
);
3247 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3248 write_expression (CALL_EXPR_ARG (expr
, i
));
3253 write_type (TREE_TYPE (expr
));
3254 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3255 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3258 tree args
= TREE_OPERAND (expr
, 0);
3260 for (; args
; args
= TREE_CHAIN (args
))
3261 write_expression (TREE_VALUE (args
));
3266 case DYNAMIC_CAST_EXPR
:
3267 case REINTERPRET_CAST_EXPR
:
3268 case STATIC_CAST_EXPR
:
3269 case CONST_CAST_EXPR
:
3270 write_type (TREE_TYPE (expr
));
3271 write_expression (TREE_OPERAND (expr
, 0));
3274 case PREINCREMENT_EXPR
:
3275 case PREDECREMENT_EXPR
:
3276 if (abi_version_at_least (6))
3278 if (abi_warn_or_compat_version_crosses (6))
3279 G
.need_abi_warning
= 1;
3283 /* In the middle-end, some expressions have more operands than
3284 they do in templates (and mangling). */
3285 len
= cp_tree_operand_length (expr
);
3287 for (i
= 0; i
< len
; ++i
)
3289 tree operand
= TREE_OPERAND (expr
, i
);
3290 /* As a GNU extension, the middle operand of a
3291 conditional may be omitted. Since expression
3292 manglings are supposed to represent the input token
3293 stream, there's no good way to mangle such an
3294 expression without extending the C++ ABI. */
3295 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3297 error ("omitted middle operand to %<?:%> operand "
3298 "cannot be mangled");
3301 else if (FOLD_EXPR_P (expr
))
3303 /* The first 'operand' of a fold-expression is the operator
3304 that it folds over. */
3307 int fcode
= TREE_INT_CST_LOW (operand
);
3308 write_string (operator_name_info
[fcode
].mangled_name
);
3311 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3313 /* The order of operands of the binary left and right
3314 folds is the same, but we want to mangle them in
3315 lexical order, i.e. non-pack first. */
3317 operand
= FOLD_EXPR_INIT (expr
);
3319 operand
= FOLD_EXPR_PACK (expr
);
3321 if (PACK_EXPANSION_P (operand
))
3322 operand
= PACK_EXPANSION_PATTERN (operand
);
3324 write_expression (operand
);
3330 /* Literal subcase of non-terminal <template-arg>.
3332 "Literal arguments, e.g. "A<42L>", are encoded with their type
3333 and value. Negative integer values are preceded with "n"; for
3334 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3335 encoded as 0, true as 1." */
3338 write_template_arg_literal (const tree value
)
3341 write_type (TREE_TYPE (value
));
3343 /* Write a null member pointer value as (type)0, regardless of its
3344 real representation. */
3345 if (null_member_pointer_value_p (value
))
3346 write_integer_cst (integer_zero_node
);
3348 switch (TREE_CODE (value
))
3351 write_integer_cst (DECL_INITIAL (value
));
3355 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3356 || integer_zerop (value
) || integer_onep (value
));
3357 write_integer_cst (value
);
3361 write_real_cst (value
);
3365 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3366 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3368 write_integer_cst (TREE_REALPART (value
));
3370 write_integer_cst (TREE_IMAGPART (value
));
3372 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3373 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3375 write_real_cst (TREE_REALPART (value
));
3377 write_real_cst (TREE_IMAGPART (value
));
3384 sorry ("string literal in function template signature");
3394 /* Non-terminal <template-arg>.
3396 <template-arg> ::= <type> # type
3397 ::= L <type> </value/ number> E # literal
3398 ::= LZ <name> E # external name
3399 ::= X <expression> E # expression */
3402 write_template_arg (tree node
)
3404 enum tree_code code
= TREE_CODE (node
);
3406 MANGLE_TRACE_TREE ("template-arg", node
);
3408 /* A template template parameter's argument list contains TREE_LIST
3409 nodes of which the value field is the actual argument. */
3410 if (code
== TREE_LIST
)
3412 node
= TREE_VALUE (node
);
3413 /* If it's a decl, deal with its type instead. */
3416 node
= TREE_TYPE (node
);
3417 code
= TREE_CODE (node
);
3421 if (REFERENCE_REF_P (node
))
3422 node
= TREE_OPERAND (node
, 0);
3423 if (TREE_CODE (node
) == NOP_EXPR
3424 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3426 /* Template parameters can be of reference type. To maintain
3427 internal consistency, such arguments use a conversion from
3428 address of object to reference type. */
3429 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3430 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3433 if (TREE_CODE (node
) == BASELINK
3434 && !type_unknown_p (node
))
3436 if (abi_version_at_least (6))
3437 node
= BASELINK_FUNCTIONS (node
);
3438 if (abi_warn_or_compat_version_crosses (6))
3439 /* We wrongly wrapped a class-scope function in X/E. */
3440 G
.need_abi_warning
= 1;
3443 if (ARGUMENT_PACK_P (node
))
3445 /* Expand the template argument pack. */
3446 tree args
= ARGUMENT_PACK_ARGS (node
);
3447 int i
, length
= TREE_VEC_LENGTH (args
);
3448 if (abi_version_at_least (6))
3452 if (abi_warn_or_compat_version_crosses (6))
3453 G
.need_abi_warning
= 1;
3454 for (i
= 0; i
< length
; ++i
)
3455 write_template_arg (TREE_VEC_ELT (args
, i
));
3458 else if (TYPE_P (node
))
3460 else if (code
== TEMPLATE_DECL
)
3461 /* A template appearing as a template arg is a template template arg. */
3462 write_template_template_arg (node
);
3463 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3464 || code
== CONST_DECL
3465 || null_member_pointer_value_p (node
))
3466 write_template_arg_literal (node
);
3467 else if (DECL_P (node
))
3470 /* Until ABI version 3, the underscore before the mangled name
3471 was incorrectly omitted. */
3472 if (!abi_version_at_least (3))
3475 write_string ("_Z");
3476 if (abi_warn_or_compat_version_crosses (3))
3477 G
.need_abi_warning
= 1;
3478 write_encoding (node
);
3483 /* Template arguments may be expressions. */
3485 write_expression (node
);
3490 /* <template-template-arg>
3492 ::= <substitution> */
3495 write_template_template_arg (const tree decl
)
3497 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3499 if (find_substitution (decl
))
3501 write_name (decl
, /*ignore_local_scope=*/0);
3502 add_substitution (decl
);
3506 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3508 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3509 ::= A <expression> _ </element/ type>
3511 "Array types encode the dimension (number of elements) and the
3512 element type. For variable length arrays, the dimension (but not
3513 the '_' separator) is omitted."
3514 Note that for flexible array members, like for other arrays of
3515 unspecified size, the dimension is also omitted. */
3518 write_array_type (const tree type
)
3521 if (TYPE_DOMAIN (type
))
3525 index_type
= TYPE_DOMAIN (type
);
3526 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3527 It's null for flexible array members which have no upper bound
3528 (this is a change from GCC 5 and prior where such members were
3529 incorrectly mangled as zero-length arrays). */
3530 if (tree max
= TYPE_MAX_VALUE (index_type
))
3532 if (TREE_CODE (max
) == INTEGER_CST
)
3534 /* The ABI specifies that we should mangle the number of
3535 elements in the array, not the largest allowed index. */
3536 offset_int wmax
= wi::to_offset (max
) + 1;
3537 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3538 number of elements as zero. */
3539 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3540 gcc_assert (wi::fits_uhwi_p (wmax
));
3541 write_unsigned_number (wmax
.to_uhwi ());
3545 max
= TREE_OPERAND (max
, 0);
3546 write_expression (max
);
3551 write_type (TREE_TYPE (type
));
3554 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3555 variables. TYPE is a pointer-to-member POINTER_TYPE.
3557 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3560 write_pointer_to_member_type (const tree type
)
3563 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3564 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3567 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3568 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3569 TEMPLATE_PARM_INDEX.
3571 <template-param> ::= T </parameter/ number> _ */
3574 write_template_param (const tree parm
)
3578 MANGLE_TRACE_TREE ("template-parm", parm
);
3580 switch (TREE_CODE (parm
))
3582 case TEMPLATE_TYPE_PARM
:
3583 case TEMPLATE_TEMPLATE_PARM
:
3584 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3585 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3588 case TEMPLATE_PARM_INDEX
:
3589 parm_index
= TEMPLATE_PARM_IDX (parm
);
3597 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3598 earliest template param denoted by `_'. */
3599 write_compact_number (parm_index
);
3602 /* <template-template-param>
3603 ::= <template-param>
3604 ::= <substitution> */
3607 write_template_template_param (const tree parm
)
3609 tree templ
= NULL_TREE
;
3611 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3612 template template parameter. The substitution candidate here is
3613 only the template. */
3614 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3617 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3618 if (find_substitution (templ
))
3622 /* <template-param> encodes only the template parameter position,
3623 not its template arguments, which is fine here. */
3624 write_template_param (parm
);
3626 add_substitution (templ
);
3629 /* Non-terminal <substitution>.
3631 <substitution> ::= S <seq-id> _
3635 write_substitution (const int seq_id
)
3637 MANGLE_TRACE ("substitution", "");
3641 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3645 /* Start mangling ENTITY. */
3648 start_mangling (const tree entity
)
3651 G
.need_abi_warning
= false;
3652 G
.need_cxx1z_warning
= false;
3653 obstack_free (&name_obstack
, name_base
);
3654 mangle_obstack
= &name_obstack
;
3655 name_base
= obstack_alloc (&name_obstack
, 0);
3658 /* Done with mangling. If WARN is true, and the name of G.entity will
3659 be mangled differently in a future version of the ABI, issue a
3663 finish_mangling_internal (void)
3665 /* Clear all the substitutions. */
3666 vec_safe_truncate (G
.substitutions
, 0);
3668 /* Null-terminate the string. */
3673 /* Like finish_mangling_internal, but return the mangled string. */
3675 static inline const char *
3676 finish_mangling (void)
3678 finish_mangling_internal ();
3679 return (const char *) obstack_finish (mangle_obstack
);
3682 /* Like finish_mangling_internal, but return an identifier. */
3685 finish_mangling_get_identifier (void)
3687 finish_mangling_internal ();
3688 /* Don't obstack_finish here, and the next start_mangling will
3689 remove the identifier. */
3690 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3693 /* Initialize data structures for mangling. */
3698 gcc_obstack_init (&name_obstack
);
3699 name_base
= obstack_alloc (&name_obstack
, 0);
3700 vec_alloc (G
.substitutions
, 0);
3702 /* Cache these identifiers for quick comparison when checking for
3703 standard substitutions. */
3704 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3705 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3706 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3707 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3708 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3709 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3712 /* Generate the mangled name of DECL. */
3715 mangle_decl_string (const tree decl
)
3718 location_t saved_loc
= input_location
;
3719 tree saved_fn
= NULL_TREE
;
3720 bool template_p
= false;
3722 /* We shouldn't be trying to mangle an uninstantiated template. */
3723 gcc_assert (!type_dependent_expression_p (decl
));
3725 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3727 struct tinst_level
*tl
= current_instantiation ();
3728 if ((!tl
|| tl
->decl
!= decl
)
3729 && push_tinst_level (decl
))
3732 saved_fn
= current_function_decl
;
3733 current_function_decl
= NULL_TREE
;
3736 input_location
= DECL_SOURCE_LOCATION (decl
);
3738 start_mangling (decl
);
3740 if (TREE_CODE (decl
) == TYPE_DECL
)
3741 write_type (TREE_TYPE (decl
));
3743 write_mangled_name (decl
, true);
3745 result
= finish_mangling_get_identifier ();
3747 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3748 IDENTIFIER_POINTER (result
));
3753 current_function_decl
= saved_fn
;
3755 input_location
= saved_loc
;
3760 /* Return an identifier for the external mangled name of DECL. */
3763 get_mangled_id (tree decl
)
3765 tree id
= mangle_decl_string (decl
);
3766 return targetm
.mangle_decl_assembler_name (decl
, id
);
3769 /* If DECL is an implicit mangling alias, return its symtab node; otherwise
3772 static symtab_node
*
3773 decl_implicit_alias_p (tree decl
)
3775 if (DECL_P (decl
) && DECL_ARTIFICIAL (decl
)
3776 && DECL_IGNORED_P (decl
)
3777 && (TREE_CODE (decl
) == FUNCTION_DECL
3778 || (VAR_P (decl
) && TREE_STATIC (decl
))))
3780 symtab_node
*n
= symtab_node::get (decl
);
3781 if (n
&& n
->cpp_implicit_alias
)
3787 /* If DECL is a mangling alias, remove it from the symbol table and return
3788 true; otherwise return false. */
3791 maybe_remove_implicit_alias (tree decl
)
3793 if (symtab_node
*n
= decl_implicit_alias_p (decl
))
3801 /* Create an identifier for the external mangled name of DECL. */
3804 mangle_decl (const tree decl
)
3809 /* Don't bother mangling uninstantiated templates. */
3810 ++processing_template_decl
;
3811 if (TREE_CODE (decl
) == TYPE_DECL
)
3812 dep
= dependent_type_p (TREE_TYPE (decl
));
3814 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3815 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3816 --processing_template_decl
;
3820 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3821 It is not needed to assign names to anonymous namespace, but we use the
3822 "<anon>" marker to be able to tell if type is C++ ODR type or type
3823 produced by other language. */
3824 if (TREE_CODE (decl
) == TYPE_DECL
3825 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3826 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3827 id
= get_identifier ("<anon>");
3830 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3831 || !no_linkage_check (TREE_TYPE (decl
), true));
3832 if (abi_version_at_least (10))
3833 if (tree fn
= decl_function_context (decl
))
3834 maybe_check_abi_tags (fn
, decl
);
3835 id
= get_mangled_id (decl
);
3837 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3839 if (G
.need_cxx1z_warning
3840 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
3841 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wc__1z_compat
,
3842 "mangled name for %qD will change in C++17 because the "
3843 "exception specification is part of a function type",
3846 if (id
!= DECL_NAME (decl
)
3847 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3848 && TREE_CODE (decl
) != TYPE_DECL
3849 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3850 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3852 int save_ver
= flag_abi_version
;
3853 tree id2
= NULL_TREE
;
3855 if (!DECL_REALLY_EXTERN (decl
))
3859 /* Check IDENTIFIER_GLOBAL_VALUE before setting to avoid redundant
3860 errors from multiple definitions. */
3861 tree d
= IDENTIFIER_GLOBAL_VALUE (id
);
3862 if (!d
|| decl_implicit_alias_p (d
))
3865 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3868 if (!G
.need_abi_warning
)
3871 /* If the mangling will change in the future, emit an alias with the
3872 future mangled name for forward-compatibility. */
3875 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3876 inform (DECL_SOURCE_LOCATION (decl
), "a later -fabi-version= (or "
3877 "=0) avoids this error with a change in mangling");
3880 flag_abi_version
= flag_abi_compat_version
;
3881 id2
= mangle_decl_string (decl
);
3882 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3883 flag_abi_version
= save_ver
;
3886 note_mangling_alias (decl
, id2
);
3891 if (flag_abi_compat_version
!= warn_abi_version
3892 || id2
== NULL_TREE
)
3894 flag_abi_version
= warn_abi_version
;
3895 id2
= mangle_decl_string (decl
);
3896 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3898 flag_abi_version
= save_ver
;
3902 else if (warn_abi_version
!= 0
3903 && abi_version_at_least (warn_abi_version
))
3904 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3905 "the mangled name of %qD changed between "
3906 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3907 G
.entity
, warn_abi_version
, id2
,
3910 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3911 "the mangled name of %qD changes between "
3912 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3913 G
.entity
, save_ver
, id
,
3914 warn_abi_version
, id2
);
3917 flag_abi_version
= save_ver
;
3921 /* Generate the mangled representation of TYPE. */
3924 mangle_type_string (const tree type
)
3928 start_mangling (type
);
3930 result
= finish_mangling ();
3932 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3936 /* Create an identifier for the mangled name of a special component
3937 for belonging to TYPE. CODE is the ABI-specified code for this
3941 mangle_special_for_type (const tree type
, const char *code
)
3945 /* We don't have an actual decl here for the special component, so
3946 we can't just process the <encoded-name>. Instead, fake it. */
3947 start_mangling (type
);
3949 /* Start the mangling. */
3950 write_string ("_Z");
3951 write_string (code
);
3955 result
= finish_mangling_get_identifier ();
3958 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3959 IDENTIFIER_POINTER (result
));
3964 /* Create an identifier for the mangled representation of the typeinfo
3965 structure for TYPE. */
3968 mangle_typeinfo_for_type (const tree type
)
3970 return mangle_special_for_type (type
, "TI");
3973 /* Create an identifier for the mangled name of the NTBS containing
3974 the mangled name of TYPE. */
3977 mangle_typeinfo_string_for_type (const tree type
)
3979 return mangle_special_for_type (type
, "TS");
3982 /* Create an identifier for the mangled name of the vtable for TYPE. */
3985 mangle_vtbl_for_type (const tree type
)
3987 return mangle_special_for_type (type
, "TV");
3990 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3993 mangle_vtt_for_type (const tree type
)
3995 return mangle_special_for_type (type
, "TT");
3998 /* Returns an identifier for the mangled name of the decomposition
3999 artificial variable DECL. DECLS is the vector of the VAR_DECLs
4000 for the identifier-list. */
4003 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
4005 gcc_assert (!type_dependent_expression_p (decl
));
4007 location_t saved_loc
= input_location
;
4008 input_location
= DECL_SOURCE_LOCATION (decl
);
4010 start_mangling (decl
);
4011 write_string ("_Z");
4013 tree context
= decl_mangling_context (decl
);
4014 gcc_assert (context
!= NULL_TREE
);
4016 bool nested
= false;
4017 if (DECL_NAMESPACE_STD_P (context
))
4018 write_string ("St");
4019 else if (context
!= global_namespace
)
4023 write_prefix (decl_mangling_context (decl
));
4026 write_string ("DC");
4029 FOR_EACH_VEC_ELT (decls
, i
, d
)
4030 write_unqualified_name (d
);
4036 tree id
= finish_mangling_get_identifier ();
4038 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4039 IDENTIFIER_POINTER (id
));
4041 input_location
= saved_loc
;
4045 /* Return an identifier for a construction vtable group. TYPE is
4046 the most derived class in the hierarchy; BINFO is the base
4047 subobject for which this construction vtable group will be used.
4049 This mangling isn't part of the ABI specification; in the ABI
4050 specification, the vtable group is dumped in the same COMDAT as the
4051 main vtable, and is referenced only from that vtable, so it doesn't
4052 need an external name. For binary formats without COMDAT sections,
4053 though, we need external names for the vtable groups.
4055 We use the production
4057 <special-name> ::= CT <type> <offset number> _ <base type> */
4060 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4064 start_mangling (type
);
4066 write_string ("_Z");
4067 write_string ("TC");
4069 write_integer_cst (BINFO_OFFSET (binfo
));
4071 write_type (BINFO_TYPE (binfo
));
4073 result
= finish_mangling_get_identifier ();
4075 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4076 IDENTIFIER_POINTER (result
));
4080 /* Mangle a this pointer or result pointer adjustment.
4082 <call-offset> ::= h <fixed offset number> _
4083 ::= v <fixed offset number> _ <virtual offset number> _ */
4086 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4088 write_char (virtual_offset
? 'v' : 'h');
4090 /* For either flavor, write the fixed offset. */
4091 write_integer_cst (fixed_offset
);
4094 /* For a virtual thunk, add the virtual offset. */
4097 write_integer_cst (virtual_offset
);
4102 /* Return an identifier for the mangled name of a this-adjusting or
4103 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4104 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4105 is a virtual thunk, and it is the vtbl offset in
4106 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4107 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4108 thunk itself. A covariant thunk name always includes the adjustment
4109 for the this pointer, even if there is none.
4111 <special-name> ::= T <call-offset> <base encoding>
4112 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4116 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4117 tree virtual_offset
, tree thunk
)
4121 if (abi_version_at_least (11))
4122 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4124 start_mangling (fn_decl
);
4126 write_string ("_Z");
4129 if (!this_adjusting
)
4131 /* Covariant thunk with no this adjustment */
4133 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4134 mangle_call_offset (fixed_offset
, virtual_offset
);
4136 else if (!DECL_THUNK_P (fn_decl
))
4137 /* Plain this adjusting thunk. */
4138 mangle_call_offset (fixed_offset
, virtual_offset
);
4141 /* This adjusting thunk to covariant thunk. */
4143 mangle_call_offset (fixed_offset
, virtual_offset
);
4144 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4145 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4147 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4148 mangle_call_offset (fixed_offset
, virtual_offset
);
4149 fn_decl
= THUNK_TARGET (fn_decl
);
4153 write_encoding (fn_decl
);
4155 result
= finish_mangling_get_identifier ();
4157 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4161 struct conv_type_hasher
: ggc_ptr_hash
<tree_node
>
4163 static hashval_t
hash (tree
);
4164 static bool equal (tree
, tree
);
4167 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
4168 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
4171 static GTY (()) hash_table
<conv_type_hasher
> *conv_type_names
;
4173 /* Hash a node (VAL1) in the table. */
4176 conv_type_hasher::hash (tree val
)
4178 return (hashval_t
) TYPE_UID (TREE_TYPE (val
));
4181 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
4184 conv_type_hasher::equal (tree val1
, tree val2
)
4186 return TREE_TYPE (val1
) == val2
;
4189 /* Return an identifier for the mangled unqualified name for a
4190 conversion operator to TYPE. This mangling is not specified by the
4191 ABI spec; it is only used internally. */
4194 mangle_conv_op_name_for_type (const tree type
)
4199 if (type
== error_mark_node
)
4200 return error_mark_node
;
4202 if (conv_type_names
== NULL
)
4203 conv_type_names
= hash_table
<conv_type_hasher
>::create_ggc (31);
4205 slot
= conv_type_names
->find_slot_with_hash (type
,
4206 (hashval_t
) TYPE_UID (type
),
4213 /* Create a unique name corresponding to TYPE. */
4214 sprintf (buffer
, "operator %lu",
4215 (unsigned long) conv_type_names
->elements ());
4216 identifier
= get_identifier (buffer
);
4219 /* Hang TYPE off the identifier so it can be found easily later
4220 when performing conversions. */
4221 TREE_TYPE (identifier
) = type
;
4223 /* Set bits on the identifier so we know later it's a conversion. */
4224 IDENTIFIER_OPNAME_P (identifier
) = 1;
4225 IDENTIFIER_TYPENAME_P (identifier
) = 1;
4231 /* Handle ABI backwards compatibility for past bugs where we didn't call
4232 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4233 it makes a difference. If FOR_DECL is non-null, it's the declaration
4234 that we're actually trying to mangle; if it's null, we're mangling the
4235 guard variable for T. */
4238 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4240 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4243 tree oldtags
= get_abi_tags (t
);
4247 tree newtags
= get_abi_tags (t
);
4248 if (newtags
&& newtags
!= oldtags
4249 && abi_version_crosses (ver
))
4251 if (for_decl
&& DECL_THUNK_P (for_decl
))
4252 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4253 "the mangled name of a thunk for %qD changes between "
4254 "-fabi-version=%d and -fabi-version=%d",
4255 t
, flag_abi_version
, warn_abi_version
);
4257 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4258 "the mangled name of %qD changes between "
4259 "-fabi-version=%d and -fabi-version=%d",
4260 for_decl
, flag_abi_version
, warn_abi_version
);
4262 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4263 "the mangled name of the initialization guard variable for"
4264 "%qD changes between -fabi-version=%d and -fabi-version=%d",
4265 t
, flag_abi_version
, warn_abi_version
);
4269 /* Write out the appropriate string for this variable when generating
4270 another mangled name based on this one. */
4273 write_guarded_var_name (const tree variable
)
4275 if (DECL_NAME (variable
)
4276 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4277 /* The name of a guard variable for a reference temporary should refer
4278 to the reference, not the temporary. */
4279 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4281 write_name (variable
, /*ignore_local_scope=*/0);
4284 /* Return an identifier for the name of an initialization guard
4285 variable for indicated VARIABLE. */
4288 mangle_guard_variable (const tree variable
)
4290 if (abi_version_at_least (10))
4291 maybe_check_abi_tags (variable
);
4292 start_mangling (variable
);
4293 write_string ("_ZGV");
4294 write_guarded_var_name (variable
);
4295 return finish_mangling_get_identifier ();
4298 /* Return an identifier for the name of a thread_local initialization
4299 function for VARIABLE. */
4302 mangle_tls_init_fn (const tree variable
)
4304 start_mangling (variable
);
4305 write_string ("_ZTH");
4306 write_guarded_var_name (variable
);
4307 return finish_mangling_get_identifier ();
4310 /* Return an identifier for the name of a thread_local wrapper
4311 function for VARIABLE. */
4313 #define TLS_WRAPPER_PREFIX "_ZTW"
4316 mangle_tls_wrapper_fn (const tree variable
)
4318 start_mangling (variable
);
4319 write_string (TLS_WRAPPER_PREFIX
);
4320 write_guarded_var_name (variable
);
4321 return finish_mangling_get_identifier ();
4324 /* Return true iff FN is a thread_local wrapper function. */
4327 decl_tls_wrapper_p (const tree fn
)
4329 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4331 tree name
= DECL_NAME (fn
);
4332 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4333 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4336 /* Return an identifier for the name of a temporary variable used to
4337 initialize a static reference. This isn't part of the ABI, but we might
4338 as well call them something readable. */
4340 static GTY(()) int temp_count
;
4343 mangle_ref_init_variable (const tree variable
)
4345 start_mangling (variable
);
4346 write_string ("_ZGR");
4347 check_abi_tags (variable
);
4348 write_name (variable
, /*ignore_local_scope=*/0);
4349 /* Avoid name clashes with aggregate initialization of multiple
4350 references at once. */
4351 write_unsigned_number (temp_count
++);
4352 return finish_mangling_get_identifier ();
4355 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4356 function generates a mangled name for the vtable map variable of
4357 the class type. For example, if the class type is
4358 "std::bad_exception", the mangled name for the class is
4359 "St13bad_exception". This function would generate the name
4360 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4361 "_VTV<std::bad_exception>::__vtable_map". */
4365 get_mangled_vtable_map_var_name (tree class_type
)
4367 char *var_name
= NULL
;
4368 const char *prefix
= "_ZN4_VTVI";
4369 const char *postfix
= "E12__vtable_mapE";
4371 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4373 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4375 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4377 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4378 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4381 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4383 strlen (postfix
) + 1;
4385 var_name
= (char *) xmalloc (len
);
4387 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4392 #include "gt-cp-mangle.h"