1 /* Name mangling for the 3.0 -*- C++ -*- ABI.
2 Copyright (C) 2000-2021 Free Software Foundation, Inc.
3 Written by Alex Samuel <samuel@codesourcery.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file implements mangling of C++ names according to the IA64
22 C++ ABI specification. A mangled name encodes a function or
23 variable's name, scope, type, and/or template arguments into a text
24 identifier. This identifier is used as the function's or
25 variable's linkage name, to preserve compatibility between C++'s
26 language features (templates, scoping, and overloading) and C
29 Additionally, g++ uses mangled names internally. To support this,
30 mangling of types is allowed, even though the mangled name of a
31 type should not appear by itself as an exported name. Ditto for
32 uninstantiated templates.
34 The primary entry point for this module is mangle_decl, which
35 returns an identifier containing the mangled name for a decl.
36 Additional entry points are provided to build mangled names of
37 particular constructs when the appropriate decl for that construct
38 is not available. These are:
40 mangle_typeinfo_for_type: typeinfo data
41 mangle_typeinfo_string_for_type: typeinfo type name
42 mangle_vtbl_for_type: virtual table data
43 mangle_vtt_for_type: VTT data
44 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
45 mangle_thunk: thunk function or entry */
49 #include "coretypes.h"
51 #include "vtable-verify.h"
53 #include "stringpool.h"
55 #include "stor-layout.h"
59 /* Debugging support. */
61 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
63 #define DEBUG_MANGLE 0
66 /* Macros for tracing the write_* functions. */
68 # define MANGLE_TRACE(FN, INPUT) \
69 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
70 # define MANGLE_TRACE_TREE(FN, NODE) \
71 fprintf (stderr, " %-24s: %-24s (%p)\n", \
72 (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE))
74 # define MANGLE_TRACE(FN, INPUT)
75 # define MANGLE_TRACE_TREE(FN, NODE)
78 /* Nonzero if NODE is a class template-id. We can't rely on
79 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
80 that hard to distinguish A<T> from A, where A<T> is the type as
81 instantiated outside of the template, and A is the type used
82 without parameters inside the template. */
83 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
84 (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
85 || (CLASS_TYPE_P (NODE) \
86 && CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
87 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))
89 /* For deciding whether to set G.need_abi_warning, we need to consider both
90 warn_abi_version and flag_abi_compat_version. */
91 #define abi_warn_or_compat_version_crosses(N) \
92 (abi_version_crosses (N) || abi_compat_version_crosses (N))
94 /* And sometimes we can simplify the code path if we don't need to worry about
96 #define abi_flag_at_least(flag,N) (flag == 0 || flag >= N)
97 #define any_abi_below(N) \
98 (!abi_version_at_least (N) \
99 || !abi_flag_at_least (warn_abi_version, (N)) \
100 || !abi_flag_at_least (flag_abi_compat_version, (N)))
102 /* Things we only need one of. This module is not reentrant. */
103 struct GTY(()) globals
{
104 /* An array of the current substitution candidates, in the order
106 vec
<tree
, va_gc
> *substitutions
;
108 /* The entity that is being mangled. */
109 tree
GTY ((skip
)) entity
;
111 /* How many parameter scopes we are inside. */
114 /* True if the mangling will be different in a future version of the
116 bool need_abi_warning
;
118 /* True if the mangling will be different in C++17 mode. */
119 bool need_cxx17_warning
;
121 /* True if we mangled a module name. */
125 static GTY (()) globals G
;
127 /* The obstack on which we build mangled names. */
128 static struct obstack
*mangle_obstack
;
130 /* The obstack on which we build mangled names that are not going to
131 be IDENTIFIER_NODEs. */
132 static struct obstack name_obstack
;
134 /* The first object on the name_obstack; we use this to free memory
135 allocated on the name_obstack. */
136 static void *name_base
;
138 /* Indices into subst_identifiers. These are identifiers used in
139 special substitution rules. */
147 SUBID_BASIC_IOSTREAM
,
150 substitution_identifier_index_t
;
152 /* For quick substitution checks, look up these common identifiers
154 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
156 /* Single-letter codes for builtin integer types, defined in
157 <builtin-type>. These are indexed by integer_type_kind values. */
159 integer_type_codes
[itk_none
] =
162 'a', /* itk_signed_char */
163 'h', /* itk_unsigned_char */
165 't', /* itk_unsigned_short */
167 'j', /* itk_unsigned_int */
169 'm', /* itk_unsigned_long */
170 'x', /* itk_long_long */
171 'y', /* itk_unsigned_long_long */
172 /* __intN types are handled separately */
173 '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0'
176 static tree
maybe_template_info (const tree
);
178 /* Functions for handling substitutions. */
180 static inline tree
canonicalize_for_substitution (tree
);
181 static void add_substitution (tree
);
182 static inline int is_std_substitution (const tree
,
183 const substitution_identifier_index_t
);
184 static inline int is_std_substitution_char (const tree
,
185 const substitution_identifier_index_t
);
186 static int find_substitution (tree
);
187 static void mangle_call_offset (const tree
, const tree
);
189 /* Functions for emitting mangled representations of things. */
191 static void write_mangled_name (const tree
, bool);
192 static void write_encoding (const tree
);
193 static void write_name (tree
, const int);
194 static void write_abi_tags (tree
);
195 static void write_unscoped_name (const tree
);
196 static void write_unscoped_template_name (const tree
);
197 static void write_nested_name (const tree
);
198 static void write_prefix (const tree
);
199 static void write_template_prefix (const tree
);
200 static void write_unqualified_name (tree
);
201 static void write_conversion_operator_name (const tree
);
202 static void write_source_name (tree
);
203 static void write_literal_operator_name (tree
);
204 static void write_unnamed_type_name (const tree
);
205 static void write_closure_type_name (const tree
);
206 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
208 static void write_number (unsigned HOST_WIDE_INT
, const int,
210 static void write_compact_number (int num
);
211 static void write_integer_cst (const tree
);
212 static void write_real_cst (const tree
);
213 static void write_identifier (const char *);
214 static void write_special_name_constructor (const tree
);
215 static void write_special_name_destructor (const tree
);
216 static void write_type (tree
);
217 static int write_CV_qualifiers_for_type (const tree
);
218 static void write_builtin_type (tree
);
219 static void write_function_type (const tree
);
220 static void write_bare_function_type (const tree
, const int, const tree
);
221 static void write_method_parms (tree
, const int, const tree
);
222 static void write_class_enum_type (const tree
);
223 static void write_template_args (tree
);
224 static void write_expression (tree
);
225 static void write_template_arg_literal (const tree
);
226 static void write_template_arg (tree
);
227 static void write_template_template_arg (const tree
);
228 static void write_array_type (const tree
);
229 static void write_pointer_to_member_type (const tree
);
230 static void write_template_param (const tree
);
231 static void write_template_template_param (const tree
);
232 static void write_substitution (const int);
233 static int discriminator_for_local_entity (tree
);
234 static int discriminator_for_string_literal (tree
, tree
);
235 static void write_discriminator (const int);
236 static void write_local_name (tree
, const tree
, const tree
);
237 static void dump_substitution_candidates (void);
238 static tree
mangle_decl_string (const tree
);
239 static void maybe_check_abi_tags (tree
, tree
= NULL_TREE
, int = 10);
240 static bool equal_abi_tags (tree
, tree
);
242 /* Control functions. */
244 static inline void start_mangling (const tree
);
245 static tree
mangle_special_for_type (const tree
, const char *);
247 /* Append a single character to the end of the mangled
249 #define write_char(CHAR) \
250 obstack_1grow (mangle_obstack, (CHAR))
252 /* Append a sized buffer to the end of the mangled representation. */
253 #define write_chars(CHAR, LEN) \
254 obstack_grow (mangle_obstack, (CHAR), (LEN))
256 /* Append a NUL-terminated string to the end of the mangled
258 #define write_string(STRING) \
259 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
261 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
262 same purpose (context, which may be a type) and value (template
263 decl). See write_template_prefix for more information on what this
265 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
266 (TREE_CODE (NODE1) == TREE_LIST \
267 && TREE_CODE (NODE2) == TREE_LIST \
268 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
269 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
270 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
271 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
273 /* Write out an unsigned quantity in base 10. */
274 #define write_unsigned_number(NUMBER) \
275 write_number ((NUMBER), /*unsigned_p=*/1, 10)
277 /* If DECL is a template instance (including the uninstantiated template
278 itself), return its TEMPLATE_INFO. Otherwise return NULL. */
281 maybe_template_info (const tree decl
)
283 if (TREE_CODE (decl
) == TYPE_DECL
)
285 /* TYPE_DECLs are handled specially. Look at its type to decide
286 if this is a template instantiation. */
287 const tree type
= TREE_TYPE (decl
);
289 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
290 return TYPE_TEMPLATE_INFO (type
);
294 /* Check if the template is a primary template. */
295 if (DECL_LANG_SPECIFIC (decl
) != NULL
296 && VAR_OR_FUNCTION_DECL_P (decl
)
297 && DECL_TEMPLATE_INFO (decl
)
298 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
299 return DECL_TEMPLATE_INFO (decl
);
302 /* It's not a template id. */
306 /* Produce debugging output of current substitution candidates. */
309 dump_substitution_candidates (void)
314 fprintf (stderr
, " ++ substitutions ");
315 FOR_EACH_VEC_ELT (*G
.substitutions
, i
, el
)
317 const char *name
= "???";
320 fprintf (stderr
, " ");
322 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
323 else if (TREE_CODE (el
) == TREE_LIST
)
324 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
325 else if (TYPE_NAME (el
))
326 name
= TYPE_NAME_STRING (el
);
327 fprintf (stderr
, " S%d_ = ", i
- 1);
329 (CP_TYPE_RESTRICT_P (el
)
330 || CP_TYPE_VOLATILE_P (el
)
331 || CP_TYPE_CONST_P (el
)))
332 fprintf (stderr
, "CV-");
333 fprintf (stderr
, "%s (%s at %p)\n",
334 name
, get_tree_code_name (TREE_CODE (el
)), (void *) el
);
338 /* <exception-spec> ::=
339 Do -- non-throwing exception specification
340 DO <expression> E -- computed (instantiation-dependent) noexcept
341 Dw <type>* E -- throw (types) */
344 write_exception_spec (tree spec
)
347 if (!spec
|| spec
== noexcept_false_spec
)
351 if (!flag_noexcept_type
)
353 G
.need_cxx17_warning
= true;
357 if (spec
== noexcept_true_spec
|| spec
== empty_except_spec
)
359 else if (tree expr
= TREE_PURPOSE (spec
))
361 /* noexcept (expr) */
362 gcc_assert (uses_template_parms (expr
));
364 write_expression (expr
);
369 /* throw (type-list) */
371 for (tree t
= spec
; t
; t
= TREE_CHAIN (t
))
372 write_type (TREE_VALUE (t
));
377 /* Both decls and types can be substitution candidates, but sometimes
378 they refer to the same thing. For instance, a TYPE_DECL and
379 RECORD_TYPE for the same class refer to the same thing, and should
380 be treated accordingly in substitutions. This function returns a
381 canonicalized tree node representing NODE that is used when adding
382 and substitution candidates and finding matches. */
385 canonicalize_for_substitution (tree node
)
387 /* For a TYPE_DECL, use the type instead. */
388 if (TREE_CODE (node
) == TYPE_DECL
)
389 node
= TREE_TYPE (node
);
391 && TYPE_CANONICAL (node
) != node
392 && TYPE_MAIN_VARIANT (node
) != node
)
395 /* Here we want to strip the topmost typedef only.
396 We need to do that so is_std_substitution can do proper
398 if (TREE_CODE (node
) == FUNCTION_TYPE
)
399 /* Use build_qualified_type and TYPE_QUALS here to preserve
400 the old buggy mangling of attribute noreturn with abi<5. */
401 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
404 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
405 cp_type_quals (node
));
406 if (FUNC_OR_METHOD_TYPE_P (node
))
408 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
409 tree r
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig
));
410 if (flag_noexcept_type
)
411 node
= build_exception_variant (node
, r
);
413 /* Set the warning flag if appropriate. */
414 write_exception_spec (r
);
420 /* Add NODE as a substitution candidate. NODE must not already be on
421 the list of candidates. */
424 add_substitution (tree node
)
429 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
430 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
432 /* Get the canonicalized substitution candidate for NODE. */
433 c
= canonicalize_for_substitution (node
);
434 if (DEBUG_MANGLE
&& c
!= node
)
435 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
436 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
439 /* Make sure NODE isn't already a candidate. */
445 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
447 gcc_assert (!(DECL_P (node
) && node
== candidate
));
448 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
449 && same_type_p (node
, candidate
)));
453 /* Put the decl onto the varray of substitution candidates. */
454 vec_safe_push (G
.substitutions
, node
);
457 dump_substitution_candidates ();
460 /* Helper function for find_substitution. Returns nonzero if NODE,
461 which may be a decl or a CLASS_TYPE, is a template-id with template
462 name of substitution_index[INDEX] in the ::std namespace. */
465 is_std_substitution (const tree node
,
466 const substitution_identifier_index_t index
)
473 type
= TREE_TYPE (node
);
476 else if (CLASS_TYPE_P (node
))
479 decl
= TYPE_NAME (node
);
482 /* These are not the droids you're looking for. */
485 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
486 && TYPE_LANG_SPECIFIC (type
)
487 && TYPE_TEMPLATE_INFO (type
)
488 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
489 == subst_identifiers
[index
]));
492 /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
493 which can be a decl or type. */
496 get_abi_tags (tree t
)
498 if (!t
|| TREE_CODE (t
) == NAMESPACE_DECL
)
501 if (DECL_P (t
) && DECL_DECLARES_TYPE_P (t
))
506 attrs
= TYPE_ATTRIBUTES (t
);
508 attrs
= DECL_ATTRIBUTES (t
);
510 tree tags
= lookup_attribute ("abi_tag", attrs
);
512 tags
= TREE_VALUE (tags
);
516 /* Helper function for find_substitution. Returns nonzero if NODE,
517 which may be a decl or a CLASS_TYPE, is the template-id
518 ::std::identifier<char>, where identifier is
519 substitution_index[INDEX]. */
522 is_std_substitution_char (const tree node
,
523 const substitution_identifier_index_t index
)
526 /* Check NODE's name is ::std::identifier. */
527 if (!is_std_substitution (node
, index
))
529 /* Figure out its template args. */
531 args
= DECL_TI_ARGS (node
);
532 else if (CLASS_TYPE_P (node
))
533 args
= CLASSTYPE_TI_ARGS (node
);
535 /* Oops, not a template. */
537 /* NODE's template arg list should be <char>. */
539 TREE_VEC_LENGTH (args
) == 1
540 && TREE_VEC_ELT (args
, 0) == char_type_node
;
543 /* Check whether a substitution should be used to represent NODE in
546 First, check standard special-case substitutions.
548 <substitution> ::= St
555 # ::std::basic_string
558 # ::std::basic_string<char,
559 ::std::char_traits<char>,
560 ::std::allocator<char> >
563 # ::std::basic_istream<char, ::std::char_traits<char> >
566 # ::std::basic_ostream<char, ::std::char_traits<char> >
569 # ::std::basic_iostream<char, ::std::char_traits<char> >
571 Then examine the stack of currently available substitution
572 candidates for entities appearing earlier in the same mangling
574 If a substitution is found, write its mangled representation and
575 return nonzero. If none is found, just return zero. */
578 find_substitution (tree node
)
581 const int size
= vec_safe_length (G
.substitutions
);
584 const char *abbr
= NULL
;
587 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
588 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
590 /* Obtain the canonicalized substitution representation for NODE.
591 This is what we'll compare against. */
592 node
= canonicalize_for_substitution (node
);
594 /* Check for builtin substitutions. */
596 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
597 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
599 /* Check for std::allocator. */
601 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
602 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
605 /* Check for std::basic_string. */
606 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
610 /* If this is a type (i.e. a fully-qualified template-id),
612 std::basic_string <char,
613 std::char_traits<char>,
614 std::allocator<char> > . */
615 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
616 && CLASSTYPE_USE_TEMPLATE (type
))
618 tree args
= CLASSTYPE_TI_ARGS (type
);
619 if (TREE_VEC_LENGTH (args
) == 3
620 && template_args_equal (TREE_VEC_ELT (args
, 0), char_type_node
)
621 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
623 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
629 /* Substitute for the template name only if this isn't a type. */
633 /* Check for basic_{i,o,io}stream. */
634 else if (TYPE_P (node
)
635 && cp_type_quals (type
) == TYPE_UNQUALIFIED
636 && CLASS_TYPE_P (type
)
637 && CLASSTYPE_USE_TEMPLATE (type
)
638 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
640 /* First, check for the template
641 args <char, std::char_traits<char> > . */
642 tree args
= CLASSTYPE_TI_ARGS (type
);
643 if (TREE_VEC_LENGTH (args
) == 2
644 && template_args_equal (TREE_VEC_ELT (args
, 0), char_type_node
)
645 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
648 /* Got them. Is this basic_istream? */
649 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
651 /* Or basic_ostream? */
652 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
654 /* Or basic_iostream? */
655 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
660 /* Check for namespace std. */
661 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
667 tree tags
= NULL_TREE
;
668 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
669 tags
= get_abi_tags (type
);
670 /* Now check the list of available substitutions for this mangling
672 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
674 tree candidate
= (*G
.substitutions
)[i
];
675 /* NODE is a matched to a candidate if it's the same decl node or
676 if it's the same type. */
677 if (decl
== candidate
678 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
679 && same_type_p (type
, candidate
))
680 || NESTED_TEMPLATE_MATCH (node
, candidate
))
682 write_substitution (i
);
688 /* No substitution found. */
694 /* If there are ABI tags on the abbreviation, it becomes
695 a substitution candidate. */
696 write_abi_tags (tags
);
697 add_substitution (node
);
702 /* Returns whether DECL's symbol name should be the plain unqualified-id
703 rather than a more complicated mangled name. */
706 unmangled_name_p (const tree decl
)
708 if (TREE_CODE (decl
) == FUNCTION_DECL
)
710 /* The names of `extern "C"' functions are not mangled. */
711 return (DECL_EXTERN_C_FUNCTION_P (decl
)
712 /* But overloaded operator names *are* mangled. */
713 && !DECL_OVERLOADED_OPERATOR_P (decl
));
715 else if (VAR_P (decl
))
717 /* static variables are mangled. */
718 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
721 /* extern "C" declarations aren't mangled. */
722 if (DECL_EXTERN_C_P (decl
))
725 /* Other variables at non-global scope are mangled. */
726 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
729 /* Variable template instantiations are mangled. */
730 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
731 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
734 /* Declarations with ABI tags are mangled. */
735 if (get_abi_tags (decl
))
738 /* The names of non-static global variables aren't mangled. */
745 /* TOP_LEVEL is true, if this is being called at outermost level of
746 mangling. It should be false when mangling a decl appearing in an
747 expression within some other mangling.
749 <mangled-name> ::= _Z <encoding> */
752 write_mangled_name (const tree decl
, bool top_level
)
754 MANGLE_TRACE_TREE ("mangled-name", decl
);
756 check_abi_tags (decl
);
758 if (unmangled_name_p (decl
))
761 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
764 /* The standard notes: "The <encoding> of an extern "C"
765 function is treated like global-scope data, i.e. as its
766 <source-name> without a type." We cannot write
767 overloaded operators that way though, because it contains
768 characters invalid in assembler. */
770 write_source_name (DECL_NAME (decl
));
776 write_encoding (decl
);
780 /* Returns true if the return type of DECL is part of its signature, and
781 therefore its mangling. */
784 mangle_return_type_p (tree decl
)
786 return (!DECL_CONSTRUCTOR_P (decl
)
787 && !DECL_DESTRUCTOR_P (decl
)
788 && !DECL_CONV_FN_P (decl
)
789 && maybe_template_info (decl
));
792 /* <encoding> ::= <function name> <bare-function-type>
796 write_encoding (const tree decl
)
798 MANGLE_TRACE_TREE ("encoding", decl
);
800 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
802 /* For overloaded operators write just the mangled name
803 without arguments. */
804 if (DECL_OVERLOADED_OPERATOR_P (decl
))
805 write_name (decl
, /*ignore_local_scope=*/0);
807 write_source_name (DECL_NAME (decl
));
811 write_name (decl
, /*ignore_local_scope=*/0);
812 if (TREE_CODE (decl
) == FUNCTION_DECL
)
817 if (maybe_template_info (decl
))
819 fn_type
= get_mostly_instantiated_function_type (decl
);
820 /* FN_TYPE will not have parameter types for in-charge or
821 VTT parameters. Therefore, we pass NULL_TREE to
822 write_bare_function_type -- otherwise, it will get
823 confused about which artificial parameters to skip. */
828 fn_type
= TREE_TYPE (decl
);
832 write_bare_function_type (fn_type
,
833 mangle_return_type_p (decl
),
838 /* Interface to substitution and identifer mangling, used by the
839 module name mangler. */
842 mangle_module_substitution (int v
)
847 write_char ('0' + v
);
852 write_unsigned_number (v
- 10);
858 mangle_identifier (char c
, tree id
)
862 write_source_name (id
);
865 /* If the outermost non-namespace context (including DECL itself) is
866 a module-linkage decl, mangle the module information. For module
867 global initializers we need to include the partition part.
869 <module-name> ::= W <module-id>+ E
870 <module-id> :: <unqualified-name>
871 || _ <digit> ;; short backref
872 || W <number> _ ;; long backref
873 || P <module-id> ;; partition introducer
877 write_module (int m
, bool include_partition
)
882 mangle_module (m
, include_partition
);
887 maybe_write_module (tree decl
)
889 int m
= get_originating_module (decl
, true);
891 write_module (m
, false);
894 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
895 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
898 decl_mangling_context (tree decl
)
900 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
902 if (tcontext
!= NULL_TREE
)
905 if (TREE_CODE (decl
) == TEMPLATE_DECL
906 && DECL_TEMPLATE_RESULT (decl
))
907 decl
= DECL_TEMPLATE_RESULT (decl
);
909 if (TREE_CODE (decl
) == TYPE_DECL
910 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
912 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
916 else if (template_type_parameter_p (decl
))
917 /* template type parms have no mangling context. */
920 tcontext
= CP_DECL_CONTEXT (decl
);
922 /* Ignore the artificial declare reduction functions. */
924 && TREE_CODE (tcontext
) == FUNCTION_DECL
925 && DECL_OMP_DECLARE_REDUCTION_P (tcontext
))
926 return decl_mangling_context (tcontext
);
931 /* <name> ::= <unscoped-name>
932 ::= <unscoped-template-name> <template-args>
936 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
937 called from <local-name>, which mangles the enclosing scope
938 elsewhere and then uses this function to mangle just the part
939 underneath the function scope. So don't use the <local-name>
940 production, to avoid an infinite recursion. */
943 write_name (tree decl
, const int ignore_local_scope
)
947 MANGLE_TRACE_TREE ("name", decl
);
949 if (TREE_CODE (decl
) == TYPE_DECL
)
951 /* In case this is a typedef, fish out the corresponding
952 TYPE_DECL for the main variant. */
953 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
957 maybe_write_module (decl
);
959 context
= decl_mangling_context (decl
);
961 gcc_assert (context
!= NULL_TREE
);
963 if (abi_warn_or_compat_version_crosses (7)
964 && ignore_local_scope
965 && TREE_CODE (context
) == PARM_DECL
)
966 G
.need_abi_warning
= 1;
968 /* A decl in :: or ::std scope is treated specially. The former is
969 mangled using <unscoped-name> or <unscoped-template-name>, the
970 latter with a special substitution. Also, a name that is
971 directly in a local function scope is also mangled with
972 <unscoped-name> rather than a full <nested-name>. */
973 if (context
== global_namespace
974 || DECL_NAMESPACE_STD_P (context
)
975 || (ignore_local_scope
976 && (TREE_CODE (context
) == FUNCTION_DECL
977 || (abi_version_at_least (7)
978 && TREE_CODE (context
) == PARM_DECL
))))
980 /* Is this a template instance? */
981 if (tree info
= maybe_template_info (decl
))
983 /* Yes: use <unscoped-template-name>. */
984 write_unscoped_template_name (TI_TEMPLATE (info
));
985 write_template_args (TI_ARGS (info
));
988 /* Everything else gets an <unqualified-name>. */
989 write_unscoped_name (decl
);
993 /* Handle local names, unless we asked not to (that is, invoked
994 under <local-name>, to handle only the part of the name under
996 if (!ignore_local_scope
)
998 /* Scan up the list of scope context, looking for a
999 function. If we find one, this entity is in local
1000 function scope. local_entity tracks context one scope
1001 level down, so it will contain the element that's
1002 directly in that function's scope, either decl or one of
1003 its enclosing scopes. */
1004 tree local_entity
= decl
;
1005 while (context
!= global_namespace
)
1007 /* Make sure we're always dealing with decls. */
1008 if (TYPE_P (context
))
1009 context
= TYPE_NAME (context
);
1010 /* Is this a function? */
1011 if (TREE_CODE (context
) == FUNCTION_DECL
1012 || TREE_CODE (context
) == PARM_DECL
)
1014 /* Yes, we have local scope. Use the <local-name>
1015 production for the innermost function scope. */
1016 write_local_name (context
, local_entity
, decl
);
1019 /* Up one scope level. */
1020 local_entity
= context
;
1021 context
= decl_mangling_context (context
);
1024 /* No local scope found? Fall through to <nested-name>. */
1027 /* Other decls get a <nested-name> to encode their scope. */
1028 write_nested_name (decl
);
1032 /* <unscoped-name> ::= <unqualified-name>
1033 ::= St <unqualified-name> # ::std:: */
1036 write_unscoped_name (const tree decl
)
1038 tree context
= decl_mangling_context (decl
);
1040 MANGLE_TRACE_TREE ("unscoped-name", decl
);
1042 /* Is DECL in ::std? */
1043 if (DECL_NAMESPACE_STD_P (context
))
1045 write_string ("St");
1046 write_unqualified_name (decl
);
1050 /* If not, it should be either in the global namespace, or directly
1051 in a local function scope. A lambda can also be mangled in the
1052 scope of a default argument. */
1053 gcc_assert (context
== global_namespace
1054 || TREE_CODE (context
) == PARM_DECL
1055 || TREE_CODE (context
) == FUNCTION_DECL
);
1057 write_unqualified_name (decl
);
1061 /* <unscoped-template-name> ::= <unscoped-name>
1062 ::= <substitution> */
1065 write_unscoped_template_name (const tree decl
)
1067 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
1069 if (find_substitution (decl
))
1071 write_unscoped_name (decl
);
1072 add_substitution (decl
);
1075 /* Write the nested name, including CV-qualifiers, of DECL.
1077 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1078 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1080 <ref-qualifier> ::= R # & ref-qualifier
1081 ::= O # && ref-qualifier
1082 <CV-qualifiers> ::= [r] [V] [K] */
1085 write_nested_name (const tree decl
)
1087 MANGLE_TRACE_TREE ("nested-name", decl
);
1091 /* Write CV-qualifiers, if this is a member function. */
1092 if (TREE_CODE (decl
) == FUNCTION_DECL
1093 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1095 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1097 if (DECL_CONST_MEMFUNC_P (decl
))
1099 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1101 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1108 /* Is this a template instance? */
1109 if (tree info
= maybe_template_info (decl
))
1111 /* Yes, use <template-prefix>. */
1112 write_template_prefix (decl
);
1113 write_template_args (TI_ARGS (info
));
1115 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1116 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1118 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1119 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1121 write_template_prefix (decl
);
1122 write_template_args (TREE_OPERAND (name
, 1));
1126 write_prefix (decl_mangling_context (decl
));
1127 write_unqualified_name (decl
);
1132 /* No, just use <prefix> */
1133 write_prefix (decl_mangling_context (decl
));
1134 write_unqualified_name (decl
);
1139 /* <prefix> ::= <prefix> <unqualified-name>
1140 ::= <template-param>
1141 ::= <template-prefix> <template-args>
1144 ::= <substitution> */
1147 write_prefix (const tree node
)
1152 || node
== global_namespace
)
1155 MANGLE_TRACE_TREE ("prefix", node
);
1157 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1163 if (find_substitution (node
))
1166 tree template_info
= NULL_TREE
;
1169 /* If this is a function or parm decl, that means we've hit function
1170 scope, so this prefix must be for a local name. In this
1171 case, we're under the <local-name> production, which encodes
1172 the enclosing function scope elsewhere. So don't continue
1174 if (TREE_CODE (node
) == FUNCTION_DECL
1175 || TREE_CODE (node
) == PARM_DECL
)
1179 template_info
= maybe_template_info (decl
);
1183 /* Node is a type. */
1184 decl
= TYPE_NAME (node
);
1185 /* The DECL might not point at the node. */
1186 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1187 template_info
= TYPE_TEMPLATE_INFO (node
);
1190 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1191 write_template_param (node
);
1192 else if (template_info
)
1195 write_template_prefix (decl
);
1196 write_template_args (TI_ARGS (template_info
));
1198 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1200 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1201 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1203 write_template_prefix (decl
);
1204 write_template_args (TREE_OPERAND (name
, 1));
1208 write_prefix (decl_mangling_context (decl
));
1209 write_unqualified_name (decl
);
1213 /* Not templated. */
1215 write_prefix (decl_mangling_context (decl
));
1216 write_unqualified_name (decl
);
1218 || TREE_CODE (decl
) == FIELD_DECL
)
1220 /* <data-member-prefix> := <member source-name> M */
1226 add_substitution (node
);
1229 /* <template-prefix> ::= <prefix> <template component>
1230 ::= <template-param>
1231 ::= <substitution> */
1234 write_template_prefix (const tree node
)
1236 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1237 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1238 tree context
= decl_mangling_context (decl
);
1242 MANGLE_TRACE_TREE ("template-prefix", node
);
1244 /* Find the template decl. */
1245 if (tree info
= maybe_template_info (decl
))
1246 templ
= TI_TEMPLATE (info
);
1247 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1248 /* For a typename type, all we have is the name. */
1249 templ
= DECL_NAME (decl
);
1252 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1254 templ
= TYPE_TI_TEMPLATE (type
);
1257 /* For a member template, though, the template name for the
1258 innermost name must have all the outer template levels
1259 instantiated. For instance, consider
1261 template<typename T> struct Outer {
1262 template<typename U> struct Inner {};
1265 The template name for `Inner' in `Outer<int>::Inner<float>' is
1266 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1267 levels separately, so there's no TEMPLATE_DECL available for this
1268 (there's only `Outer<T>::Inner<U>').
1270 In order to get the substitutions right, we create a special
1271 TREE_LIST to represent the substitution candidate for a nested
1272 template. The TREE_PURPOSE is the template's context, fully
1273 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1276 So, for the example above, `Outer<int>::Inner' is represented as a
1277 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1278 and whose value is `Outer<T>::Inner<U>'. */
1279 if (context
&& TYPE_P (context
))
1280 substitution
= build_tree_list (context
, templ
);
1282 substitution
= templ
;
1284 if (find_substitution (substitution
))
1287 if (TREE_TYPE (templ
)
1288 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1289 write_template_param (TREE_TYPE (templ
));
1292 write_prefix (context
);
1293 write_unqualified_name (decl
);
1296 add_substitution (substitution
);
1299 /* As the list of identifiers for the structured binding declaration
1300 DECL is likely gone, try to recover the DC <source-name>+ E portion
1301 from its mangled name. Return pointer to the DC and set len to
1302 the length up to and including the terminating E. On failure
1306 find_decomp_unqualified_name (tree decl
, size_t *len
)
1308 const char *p
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1309 const char *end
= p
+ IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
1310 bool nested
= false;
1311 if (strncmp (p
, "_Z", 2))
1314 if (!strncmp (p
, "St", 2))
1320 while (ISDIGIT (p
[0]))
1323 long num
= strtol (p
, &e
, 10);
1324 if (num
>= 1 && num
< end
- e
)
1330 if (strncmp (p
, "DC", 2))
1344 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1345 mangled through special entry points.
1347 <unqualified-name> ::= <operator-name>
1350 ::= <unnamed-type-name>
1351 ::= <local-source-name>
1353 <local-source-name> ::= L <source-name> <discriminator> */
1356 write_unqualified_id (tree identifier
)
1358 if (IDENTIFIER_CONV_OP_P (identifier
))
1359 write_conversion_operator_name (TREE_TYPE (identifier
));
1360 else if (IDENTIFIER_OVL_OP_P (identifier
))
1362 const ovl_op_info_t
*ovl_op
= IDENTIFIER_OVL_OP_INFO (identifier
);
1363 write_string (ovl_op
->mangled_name
);
1365 else if (UDLIT_OPER_P (identifier
))
1366 write_literal_operator_name (identifier
);
1368 write_source_name (identifier
);
1372 write_unqualified_name (tree decl
)
1374 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1376 if (identifier_p (decl
))
1378 write_unqualified_id (decl
);
1384 if (DECL_NAME (decl
) == NULL_TREE
)
1387 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1388 const char *decomp_str
= NULL
;
1389 size_t decomp_len
= 0;
1391 && DECL_DECOMPOSITION_P (decl
)
1392 && DECL_NAME (decl
) == NULL_TREE
1393 && DECL_NAMESPACE_SCOPE_P (decl
))
1394 decomp_str
= find_decomp_unqualified_name (decl
, &decomp_len
);
1396 write_chars (decomp_str
, decomp_len
);
1398 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1400 else if (DECL_DECLARES_FUNCTION_P (decl
))
1403 if (DECL_CONSTRUCTOR_P (decl
))
1404 write_special_name_constructor (decl
);
1405 else if (DECL_DESTRUCTOR_P (decl
))
1406 write_special_name_destructor (decl
);
1407 else if (DECL_CONV_FN_P (decl
))
1409 /* Conversion operator. Handle it right here.
1410 <operator> ::= cv <type> */
1412 if (maybe_template_info (decl
))
1415 fn_type
= get_mostly_instantiated_function_type (decl
);
1416 type
= TREE_TYPE (fn_type
);
1418 else if (FNDECL_USED_AUTO (decl
))
1419 type
= DECL_SAVED_AUTO_RETURN_TYPE (decl
);
1421 type
= DECL_CONV_FN_TYPE (decl
);
1422 write_conversion_operator_name (type
);
1424 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1426 const char *mangled_name
1427 = (ovl_op_info
[DECL_ASSIGNMENT_OPERATOR_P (decl
)]
1428 [DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
)].mangled_name
);
1429 write_string (mangled_name
);
1431 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1432 write_literal_operator_name (DECL_NAME (decl
));
1439 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1440 && DECL_NAMESPACE_SCOPE_P (decl
)
1441 && decl_linkage (decl
) == lk_internal
)
1443 MANGLE_TRACE_TREE ("local-source-name", decl
);
1445 write_source_name (DECL_NAME (decl
));
1446 /* The default discriminator is 1, and that's all we ever use,
1447 so there's no code to output one here. */
1451 tree type
= TREE_TYPE (decl
);
1453 if (TREE_CODE (decl
) == TYPE_DECL
1454 && TYPE_UNNAMED_P (type
))
1455 write_unnamed_type_name (type
);
1456 else if (TREE_CODE (decl
) == TYPE_DECL
&& LAMBDA_TYPE_P (type
))
1457 write_closure_type_name (type
);
1459 write_source_name (DECL_NAME (decl
));
1462 /* We use the ABI tags from the primary class template, ignoring tags on any
1463 specializations. This is necessary because C++ doesn't require a
1464 specialization to be declared before it is used unless the use requires a
1465 complete type, but we need to get the tags right on incomplete types as
1467 if (tree tmpl
= most_general_template (decl
))
1469 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1470 if (res
== NULL_TREE
)
1471 /* UNBOUND_CLASS_TEMPLATE. */;
1472 else if (DECL_DECLARES_TYPE_P (decl
))
1474 else if (any_abi_below (11))
1476 /* ABI v10 implicit tags on the template. */
1477 tree mtags
= missing_abi_tags (res
);
1478 /* Explicit tags on the template. */
1479 tree ttags
= get_abi_tags (res
);
1480 /* Tags on the instantiation. */
1481 tree dtags
= get_abi_tags (decl
);
1483 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1484 G
.need_abi_warning
= 1;
1486 /* Add the v10 tags to the explicit tags now. */
1487 mtags
= chainon (mtags
, ttags
);
1489 if (!G
.need_abi_warning
1490 && abi_warn_or_compat_version_crosses (11)
1491 && !equal_abi_tags (dtags
, mtags
))
1492 G
.need_abi_warning
= 1;
1494 if (!abi_version_at_least (10))
1495 /* In abi <10, we only got the explicit tags. */
1497 else if (flag_abi_version
== 10)
1499 /* In ABI 10, we want explict and implicit tags. */
1500 write_abi_tags (mtags
);
1506 tree tags
= get_abi_tags (decl
);
1507 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CONV_FN_P (decl
)
1508 && any_abi_below (11))
1509 if (tree mtags
= missing_abi_tags (decl
))
1511 if (abi_warn_or_compat_version_crosses (11))
1512 G
.need_abi_warning
= true;
1513 if (!abi_version_at_least (11))
1514 tags
= chainon (mtags
, tags
);
1516 write_abi_tags (tags
);
1519 /* Write the unqualified-name for a conversion operator to TYPE. */
1522 write_conversion_operator_name (const tree type
)
1524 write_string ("cv");
1528 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1530 <source-name> ::= </length/ number> <identifier> */
1533 write_source_name (tree identifier
)
1535 MANGLE_TRACE_TREE ("source-name", identifier
);
1537 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1538 write_identifier (IDENTIFIER_POINTER (identifier
));
1541 /* Compare two TREE_STRINGs like strcmp. */
1544 tree_string_cmp (const void *p1
, const void *p2
)
1548 tree s1
= *(const tree
*)p1
;
1549 tree s2
= *(const tree
*)p2
;
1550 return strcmp (TREE_STRING_POINTER (s1
),
1551 TREE_STRING_POINTER (s2
));
1554 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1556 static vec
<tree
, va_gc
> *
1557 sorted_abi_tags (tree tags
)
1559 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1561 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1563 if (ABI_TAG_IMPLICIT (t
))
1565 tree str
= TREE_VALUE (t
);
1566 vec_safe_push (vec
, str
);
1569 vec
->qsort (tree_string_cmp
);
1574 /* ID is the name of a function or type with abi_tags attribute TAGS.
1575 Write out the name, suitably decorated. */
1578 write_abi_tags (tree tags
)
1580 if (tags
== NULL_TREE
)
1583 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1585 unsigned i
; tree str
;
1586 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1589 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1590 write_identifier (TREE_STRING_POINTER (str
));
1593 release_tree_vector (vec
);
1596 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1599 equal_abi_tags (tree t1
, tree t2
)
1601 releasing_vec v1
= sorted_abi_tags (t1
);
1602 releasing_vec v2
= sorted_abi_tags (t2
);
1604 unsigned len1
= v1
->length();
1605 if (len1
!= v2
->length())
1607 for (unsigned i
= 0; i
< len1
; ++i
)
1608 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1613 /* Write a user-defined literal operator.
1614 ::= li <source-name> # "" <source-name>
1615 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1618 write_literal_operator_name (tree identifier
)
1620 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1621 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1622 write_unsigned_number (strlen (suffix
));
1623 write_identifier (suffix
);
1626 /* Encode 0 as _, and 1+ as n-1_. */
1629 write_compact_number (int num
)
1632 write_unsigned_number (num
- 1);
1636 /* Return how many unnamed types precede TYPE in its enclosing class. */
1639 nested_anon_class_index (tree type
)
1642 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1643 for (; member
; member
= DECL_CHAIN (member
))
1644 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1646 tree memtype
= TREE_TYPE (member
);
1647 if (memtype
== type
)
1649 else if (TYPE_UNNAMED_P (memtype
))
1659 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1662 write_unnamed_type_name (const tree type
)
1665 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1667 if (TYPE_FUNCTION_SCOPE_P (type
))
1668 discriminator
= discriminator_for_local_entity (TYPE_NAME (type
));
1669 else if (TYPE_CLASS_SCOPE_P (type
))
1670 discriminator
= nested_anon_class_index (type
);
1673 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1674 /* Just use the old mangling at namespace scope. */
1675 write_source_name (TYPE_IDENTIFIER (type
));
1679 write_string ("Ut");
1680 write_compact_number (discriminator
);
1683 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1684 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1687 write_closure_type_name (const tree type
)
1689 tree fn
= lambda_function (type
);
1690 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1691 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1693 MANGLE_TRACE_TREE ("closure-type-name", type
);
1695 write_string ("Ul");
1696 write_method_parms (parms
, /*method_p=*/1, fn
);
1698 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1701 /* Convert NUMBER to ascii using base BASE and generating at least
1702 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1703 into which to store the characters. Returns the number of
1704 characters generated (these will be laid out in advance of where
1708 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1709 char *buffer
, const unsigned int min_digits
)
1711 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1712 unsigned digits
= 0;
1716 unsigned HOST_WIDE_INT d
= number
/ base
;
1718 *--buffer
= base_digits
[number
- d
* base
];
1722 while (digits
< min_digits
)
1724 *--buffer
= base_digits
[0];
1730 /* Non-terminal <number>.
1732 <number> ::= [n] </decimal integer/> */
1735 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1736 const unsigned int base
)
1738 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1741 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1744 number
= -((HOST_WIDE_INT
) number
);
1746 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1747 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1750 /* Write out an integral CST in decimal. Most numbers are small, and
1751 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1752 bigger than that, which we must deal with. */
1755 write_integer_cst (const tree cst
)
1757 int sign
= tree_int_cst_sgn (cst
);
1758 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1759 if (!wi::fits_uhwi_p (abs_value
))
1761 /* A bignum. We do this in chunks, each of which fits in a
1763 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1764 unsigned HOST_WIDE_INT chunk
;
1765 unsigned chunk_digits
;
1766 char *ptr
= buffer
+ sizeof (buffer
);
1771 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1776 if (sizeof (HOST_WIDE_INT
) >= 8)
1778 /* It is at least 64 bits, so 10^18 is representable. */
1783 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1784 base
= build_int_cstu (type
, chunk
);
1785 n
= wide_int_to_tree (type
, wi::to_wide (cst
));
1790 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1794 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1795 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1798 done
= integer_zerop (d
);
1799 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1800 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1801 done
? 1 : chunk_digits
);
1807 write_chars (ptr
, count
);
1814 write_unsigned_number (abs_value
.to_uhwi ());
1818 /* Write out a floating-point literal.
1820 "Floating-point literals are encoded using the bit pattern of the
1821 target processor's internal representation of that number, as a
1822 fixed-length lowercase hexadecimal string, high-order bytes first
1823 (even if the target processor would store low-order bytes first).
1824 The "n" prefix is not used for floating-point literals; the sign
1825 bit is encoded with the rest of the number.
1827 Here are some examples, assuming the IEEE standard representation
1828 for floating point numbers. (Spaces are for readability, not
1829 part of the encoding.)
1832 -1.0f Lf bf80 0000 E
1833 1.17549435e-38f Lf 0080 0000 E
1834 1.40129846e-45f Lf 0000 0001 E
1835 0.0f Lf 0000 0000 E"
1837 Caller is responsible for the Lx and the E. */
1839 write_real_cst (const tree value
)
1841 long target_real
[4]; /* largest supported float */
1842 /* Buffer for eight hex digits in a 32-bit number but big enough
1843 even for 64-bit long to avoid warnings. */
1847 tree type
= TREE_TYPE (value
);
1848 int words
= GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type
)) / 32;
1850 real_to_target (target_real
, &TREE_REAL_CST (value
),
1853 /* The value in target_real is in the target word order,
1854 so we must write it out backward if that happens to be
1855 little-endian. write_number cannot be used, it will
1856 produce uppercase. */
1857 if (FLOAT_WORDS_BIG_ENDIAN
)
1858 i
= 0, limit
= words
, dir
= 1;
1860 i
= words
- 1, limit
= -1, dir
= -1;
1862 for (; i
!= limit
; i
+= dir
)
1864 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1865 write_chars (buffer
, 8);
1869 /* Non-terminal <identifier>.
1871 <identifier> ::= </unqualified source code identifier> */
1874 write_identifier (const char *identifier
)
1876 MANGLE_TRACE ("identifier", identifier
);
1877 write_string (identifier
);
1880 /* Handle constructor productions of non-terminal <special-name>.
1881 CTOR is a constructor FUNCTION_DECL.
1883 <special-name> ::= C1 # complete object constructor
1884 ::= C2 # base object constructor
1885 ::= C3 # complete object allocating constructor
1887 Currently, allocating constructors are never used. */
1890 write_special_name_constructor (const tree ctor
)
1893 bool new_inh
= (flag_new_inheriting_ctors
1894 && DECL_INHERITED_CTOR (ctor
));
1897 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1899 /* This is the old-style "[unified]" constructor.
1900 In some cases, we may emit this function and call
1901 it from the clones in order to share code and save space. */
1902 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1906 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1910 write_type (DECL_INHERITED_CTOR_BASE (ctor
));
1913 /* Handle destructor productions of non-terminal <special-name>.
1914 DTOR is a destructor FUNCTION_DECL.
1916 <special-name> ::= D0 # deleting (in-charge) destructor
1917 ::= D1 # complete object (in-charge) destructor
1918 ::= D2 # base object (not-in-charge) destructor */
1921 write_special_name_destructor (const tree dtor
)
1923 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1924 write_string ("D0");
1925 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1926 write_string ("D2");
1927 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1928 /* This is the old-style "[unified]" destructor.
1929 In some cases, we may emit this function and call
1930 it from the clones in order to share code and save space. */
1931 write_string ("D4");
1934 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1935 write_string ("D1");
1939 /* Return the discriminator for ENTITY appearing inside
1940 FUNCTION. The discriminator is the lexical ordinal of VAR or TYPE among
1941 entities with the same name and kind in the same FUNCTION. */
1944 discriminator_for_local_entity (tree entity
)
1946 if (!DECL_LANG_SPECIFIC (entity
))
1948 /* Some decls, like __FUNCTION__, don't need a discriminator. */
1949 gcc_checking_assert (DECL_ARTIFICIAL (entity
));
1952 else if (tree disc
= DECL_DISCRIMINATOR (entity
))
1953 return TREE_INT_CST_LOW (disc
);
1955 /* The first entity with a particular name doesn't get
1956 DECL_DISCRIMINATOR set up. */
1960 /* Return the discriminator for STRING, a string literal used inside
1961 FUNCTION. The discriminator is the lexical ordinal of STRING among
1962 string literals used in FUNCTION. */
1965 discriminator_for_string_literal (tree
/*function*/,
1968 /* For now, we don't discriminate amongst string literals. */
1972 /* <discriminator> := _ <number> # when number < 10
1973 := __ <number> _ # when number >= 10
1975 The discriminator is used only for the second and later occurrences
1976 of the same name within a single function. In this case <number> is
1977 n - 2, if this is the nth occurrence, in lexical order. */
1980 write_discriminator (const int discriminator
)
1982 /* If discriminator is zero, don't write anything. Otherwise... */
1983 if (discriminator
> 0)
1986 if (discriminator
- 1 >= 10)
1988 if (abi_warn_or_compat_version_crosses (11))
1989 G
.need_abi_warning
= 1;
1990 if (abi_version_at_least (11))
1993 write_unsigned_number (discriminator
- 1);
1994 if (abi_version_at_least (11) && discriminator
- 1 >= 10)
1999 /* Mangle the name of a function-scope entity. FUNCTION is the
2000 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
2001 default argument scope. ENTITY is the decl for the entity itself.
2002 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
2003 either ENTITY itself or an enclosing scope of ENTITY.
2005 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
2006 := Z <function encoding> E s [<discriminator>]
2007 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
2010 write_local_name (tree function
, const tree local_entity
,
2013 tree parm
= NULL_TREE
;
2015 MANGLE_TRACE_TREE ("local-name", entity
);
2017 if (TREE_CODE (function
) == PARM_DECL
)
2020 function
= DECL_CONTEXT (parm
);
2024 write_encoding (function
);
2027 /* For this purpose, parameters are numbered from right-to-left. */
2032 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
2040 write_compact_number (i
- 1);
2043 if (TREE_CODE (entity
) == STRING_CST
)
2046 write_discriminator (discriminator_for_string_literal (function
,
2051 /* Now the <entity name>. Let write_name know its being called
2052 from <local-name>, so it doesn't try to process the enclosing
2053 function scope again. */
2054 write_name (entity
, /*ignore_local_scope=*/1);
2055 if (DECL_DISCRIMINATOR_P (local_entity
)
2056 && !(TREE_CODE (local_entity
) == TYPE_DECL
2057 && TYPE_ANON_P (TREE_TYPE (local_entity
))))
2058 write_discriminator (discriminator_for_local_entity (local_entity
));
2062 /* Non-terminals <type> and <CV-qualifier>.
2064 <type> ::= <builtin-type>
2066 ::= <class-enum-type>
2068 ::= <pointer-to-member-type>
2069 ::= <template-param>
2072 ::= P <type> # pointer-to
2073 ::= R <type> # reference-to
2074 ::= C <type> # complex pair (C 2000)
2075 ::= G <type> # imaginary (C 2000) [not supported]
2076 ::= U <source-name> <type> # vendor extended type qualifier
2080 <type> ::= RR <type> # rvalue reference-to
2081 <type> ::= Dt <expression> # decltype of an id-expression or
2082 # class member access
2083 <type> ::= DT <expression> # decltype of an expression
2084 <type> ::= Dn # decltype of nullptr
2086 TYPE is a type node. */
2089 write_type (tree type
)
2091 /* This gets set to nonzero if TYPE turns out to be a (possibly
2092 CV-qualified) builtin type. */
2093 int is_builtin_type
= 0;
2095 MANGLE_TRACE_TREE ("type", type
);
2097 if (type
== error_mark_node
)
2100 type
= canonicalize_for_substitution (type
);
2101 if (find_substitution (type
))
2105 if (write_CV_qualifiers_for_type (type
) > 0)
2106 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2107 mangle the unqualified type. The recursive call is needed here
2108 since both the qualified and unqualified types are substitution
2111 tree t
= TYPE_MAIN_VARIANT (type
);
2112 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2114 tree attrs
= NULL_TREE
;
2115 if (tx_safe_fn_type_p (type
))
2116 attrs
= tree_cons (get_identifier ("transaction_safe"),
2118 t
= cp_build_type_attribute_variant (t
, attrs
);
2120 gcc_assert (t
!= type
);
2121 if (FUNC_OR_METHOD_TYPE_P (t
))
2123 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2124 if (flag_noexcept_type
)
2126 tree r
= TYPE_RAISES_EXCEPTIONS (type
);
2127 t
= build_exception_variant (t
, r
);
2129 if (abi_version_at_least (8)
2130 || type
== TYPE_MAIN_VARIANT (type
))
2131 /* Avoid adding the unqualified function type as a substitution. */
2132 write_function_type (t
);
2135 if (abi_warn_or_compat_version_crosses (8))
2136 G
.need_abi_warning
= 1;
2141 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2142 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2143 so that the cv-qualification of the element type is available
2144 in write_array_type. */
2145 write_array_type (type
);
2148 tree type_orig
= type
;
2150 /* See through any typedefs. */
2151 type
= TYPE_MAIN_VARIANT (type
);
2152 if (FUNC_OR_METHOD_TYPE_P (type
))
2153 type
= cxx_copy_lang_qualifiers (type
, type_orig
);
2155 /* According to the C++ ABI, some library classes are passed the
2156 same as the scalar type of their single member and use the same
2158 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2159 type
= TREE_TYPE (first_field (type
));
2161 if (TYPE_PTRDATAMEM_P (type
))
2162 write_pointer_to_member_type (type
);
2165 /* Handle any target-specific fundamental types. */
2166 const char *target_mangling
2167 = targetm
.mangle_type (type_orig
);
2169 if (target_mangling
)
2171 write_string (target_mangling
);
2172 /* Add substitutions for types other than fundamental
2174 if (!VOID_TYPE_P (type
)
2175 && TREE_CODE (type
) != INTEGER_TYPE
2176 && TREE_CODE (type
) != REAL_TYPE
2177 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2178 add_substitution (type
);
2182 switch (TREE_CODE (type
))
2186 case INTEGER_TYPE
: /* Includes wchar_t. */
2188 case FIXED_POINT_TYPE
:
2190 /* If this is a typedef, TYPE may not be one of
2191 the standard builtin type nodes, but an alias of one. Use
2192 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2193 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2200 write_type (TREE_TYPE (type
));
2205 write_function_type (type
);
2211 /* A pointer-to-member function is represented as a special
2212 RECORD_TYPE, so check for this first. */
2213 if (TYPE_PTRMEMFUNC_P (type
))
2214 write_pointer_to_member_type (type
);
2216 write_class_enum_type (type
);
2220 case UNBOUND_CLASS_TEMPLATE
:
2221 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2222 ordinary nested names. */
2223 write_nested_name (TYPE_STUB_DECL (type
));
2227 case REFERENCE_TYPE
:
2228 if (TYPE_PTR_P (type
))
2230 else if (TYPE_REF_IS_RVALUE (type
))
2235 tree target
= TREE_TYPE (type
);
2236 /* Attribute const/noreturn are not reflected in mangling.
2237 We strip them here rather than at a lower level because
2238 a typedef or template argument can have function type
2239 with function-cv-quals (that use the same representation),
2240 but you can't have a pointer/reference to such a type. */
2241 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2243 if (abi_warn_or_compat_version_crosses (5)
2244 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2245 G
.need_abi_warning
= 1;
2246 if (abi_version_at_least (5))
2247 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2249 write_type (target
);
2253 case TEMPLATE_TYPE_PARM
:
2256 if (AUTO_IS_DECLTYPE (type
))
2257 write_identifier ("Dc");
2259 write_identifier ("Da");
2264 case TEMPLATE_PARM_INDEX
:
2265 write_template_param (type
);
2268 case TEMPLATE_TEMPLATE_PARM
:
2269 write_template_template_param (type
);
2272 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2273 write_template_template_param (type
);
2275 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2279 if (abi_version_at_least (4))
2281 write_string ("Dv");
2282 /* Non-constant vector size would be encoded with
2283 _ expression, but we don't support that yet. */
2284 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
)
2289 write_string ("U8__vector");
2290 if (abi_warn_or_compat_version_crosses (4))
2291 G
.need_abi_warning
= 1;
2292 write_type (TREE_TYPE (type
));
2295 case TYPE_PACK_EXPANSION
:
2296 write_string ("Dp");
2297 write_type (PACK_EXPANSION_PATTERN (type
));
2301 /* These shouldn't make it into mangling. */
2302 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2303 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2305 /* In ABI <5, we stripped decltype of a plain decl. */
2306 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2308 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2309 tree etype
= NULL_TREE
;
2310 switch (TREE_CODE (expr
))
2317 case TEMPLATE_PARM_INDEX
:
2318 etype
= TREE_TYPE (expr
);
2325 if (etype
&& !type_uses_auto (etype
))
2327 if (abi_warn_or_compat_version_crosses (5))
2328 G
.need_abi_warning
= 1;
2329 if (!abi_version_at_least (5))
2338 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2342 ++cp_unevaluated_operand
;
2343 write_expression (DECLTYPE_TYPE_EXPR (type
));
2344 --cp_unevaluated_operand
;
2349 write_string ("Dn");
2350 if (abi_version_at_least (7))
2352 if (abi_warn_or_compat_version_crosses (7))
2353 G
.need_abi_warning
= 1;
2357 sorry ("mangling %<typeof%>, use %<decltype%> instead");
2360 case UNDERLYING_TYPE
:
2361 sorry ("mangling %<__underlying_type%>");
2373 /* Types other than builtin types are substitution candidates. */
2374 if (!is_builtin_type
)
2375 add_substitution (type
);
2378 /* qsort callback for sorting a vector of attribute entries. */
2381 attr_strcmp (const void *p1
, const void *p2
)
2383 tree a1
= *(const tree
*)p1
;
2384 tree a2
= *(const tree
*)p2
;
2386 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2387 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2389 return strcmp (as1
->name
, as2
->name
);
2392 /* Return true if we should mangle a type attribute with name NAME. */
2395 mangle_type_attribute_p (tree name
)
2397 const attribute_spec
*as
= lookup_attribute_spec (name
);
2398 if (!as
|| !as
->affects_type_identity
)
2401 /* Skip internal-only attributes, which are distinguished from others
2402 by having a space. At present, all internal-only attributes that
2403 affect type identity are target-specific and are handled by
2404 targetm.mangle_type instead.
2406 Another reason to do this is that a space isn't a valid identifier
2407 character for most file formats. */
2408 if (strchr (IDENTIFIER_POINTER (name
), ' '))
2411 /* The following attributes are mangled specially. */
2412 if (is_attribute_p ("transaction_safe", name
))
2414 if (is_attribute_p ("abi_tag", name
))
2420 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2421 CV-qualifiers written for TYPE.
2423 <CV-qualifiers> ::= [r] [V] [K] */
2426 write_CV_qualifiers_for_type (const tree type
)
2428 int num_qualifiers
= 0;
2430 /* The order is specified by:
2432 "In cases where multiple order-insensitive qualifiers are
2433 present, they should be ordered 'K' (closest to the base type),
2434 'V', 'r', and 'U' (farthest from the base type) ..." */
2436 /* Mangle attributes that affect type identity as extended qualifiers.
2438 We don't do this with classes and enums because their attributes
2439 are part of their definitions, not something added on. */
2441 if (!OVERLOAD_TYPE_P (type
))
2444 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2445 if (mangle_type_attribute_p (get_attribute_name (a
)))
2447 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2448 G
.need_abi_warning
= true;
2449 if (abi_version_at_least (10))
2451 vec
.qsort (attr_strcmp
);
2452 while (!vec
.is_empty())
2455 const attribute_spec
*as
2456 = lookup_attribute_spec (get_attribute_name (a
));
2459 write_unsigned_number (strlen (as
->name
));
2460 write_string (as
->name
);
2464 for (tree args
= TREE_VALUE (a
); args
;
2465 args
= TREE_CHAIN (args
))
2467 tree arg
= TREE_VALUE (args
);
2468 write_template_arg (arg
);
2478 /* Note that we do not use cp_type_quals below; given "const
2479 int[3]", the "const" is emitted with the "int", not with the
2481 cp_cv_quals quals
= TYPE_QUALS (type
);
2483 if (quals
& TYPE_QUAL_RESTRICT
)
2488 if (quals
& TYPE_QUAL_VOLATILE
)
2493 if (quals
& TYPE_QUAL_CONST
)
2499 return num_qualifiers
;
2502 /* Non-terminal <builtin-type>.
2504 <builtin-type> ::= v # void
2509 ::= h # unsigned char
2511 ::= t # unsigned short
2513 ::= j # unsigned int
2515 ::= m # unsigned long
2516 ::= x # long long, __int64
2517 ::= y # unsigned long long, __int64
2519 ::= o # unsigned __int128
2522 ::= e # long double, __float80
2523 ::= g # __float128 [not supported]
2524 ::= u <source-name> # vendor extended type */
2527 write_builtin_type (tree type
)
2529 if (TYPE_CANONICAL (type
))
2530 type
= TYPE_CANONICAL (type
);
2532 switch (TREE_CODE (type
))
2543 /* TYPE may still be wchar_t, char8_t, char16_t, or char32_t, since that
2544 isn't in integer_type_nodes. */
2545 if (type
== wchar_type_node
)
2547 else if (type
== char8_type_node
)
2548 write_string ("Du");
2549 else if (type
== char16_type_node
)
2550 write_string ("Ds");
2551 else if (type
== char32_type_node
)
2552 write_string ("Di");
2556 /* Assume TYPE is one of the shared integer type nodes. Find
2557 it in the array of these nodes. */
2559 for (itk
= 0; itk
< itk_none
; ++itk
)
2560 if (integer_types
[itk
] != NULL_TREE
2561 && integer_type_codes
[itk
] != '\0'
2562 && type
== integer_types
[itk
])
2564 /* Print the corresponding single-letter code. */
2565 write_char (integer_type_codes
[itk
]);
2569 if (itk
== itk_none
)
2571 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2572 TYPE_UNSIGNED (type
));
2579 if (TYPE_PRECISION (type
) == 128)
2580 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2583 /* Allow for cases where TYPE is not one of the shared
2584 integer type nodes and write a "vendor extended builtin
2585 type" with a name the form intN or uintN, respectively.
2586 Situations like this can happen if you have an
2587 __attribute__((__mode__(__SI__))) type and use exotic
2588 switches like '-mint8' on AVR. Of course, this is
2589 undefined by the C++ ABI (and '-mint8' is not even
2590 Standard C conforming), but when using such special
2591 options you're pretty much in nowhere land anyway. */
2593 char prec
[11]; /* up to ten digits for an unsigned */
2595 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2596 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2597 write_char ('u'); /* "vendor extended builtin type" */
2598 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2599 write_string (prefix
);
2600 write_string (prec
);
2607 if (type
== float_type_node
)
2609 else if (type
== double_type_node
)
2611 else if (type
== long_double_type_node
)
2613 else if (type
== dfloat32_type_node
|| type
== fallback_dfloat32_type
)
2614 write_string ("Df");
2615 else if (type
== dfloat64_type_node
|| type
== fallback_dfloat64_type
)
2616 write_string ("Dd");
2617 else if (type
== dfloat128_type_node
|| type
== fallback_dfloat128_type
)
2618 write_string ("De");
2623 case FIXED_POINT_TYPE
:
2624 write_string ("DF");
2625 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2626 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2627 if (type
== fract_type_node
2628 || type
== sat_fract_type_node
2629 || type
== accum_type_node
2630 || type
== sat_accum_type_node
)
2632 else if (type
== unsigned_fract_type_node
2633 || type
== sat_unsigned_fract_type_node
2634 || type
== unsigned_accum_type_node
2635 || type
== sat_unsigned_accum_type_node
)
2637 else if (type
== short_fract_type_node
2638 || type
== sat_short_fract_type_node
2639 || type
== short_accum_type_node
2640 || type
== sat_short_accum_type_node
)
2642 else if (type
== unsigned_short_fract_type_node
2643 || type
== sat_unsigned_short_fract_type_node
2644 || type
== unsigned_short_accum_type_node
2645 || type
== sat_unsigned_short_accum_type_node
)
2647 else if (type
== long_fract_type_node
2648 || type
== sat_long_fract_type_node
2649 || type
== long_accum_type_node
2650 || type
== sat_long_accum_type_node
)
2652 else if (type
== unsigned_long_fract_type_node
2653 || type
== sat_unsigned_long_fract_type_node
2654 || type
== unsigned_long_accum_type_node
2655 || type
== sat_unsigned_long_accum_type_node
)
2657 else if (type
== long_long_fract_type_node
2658 || type
== sat_long_long_fract_type_node
2659 || type
== long_long_accum_type_node
2660 || type
== sat_long_long_accum_type_node
)
2662 else if (type
== unsigned_long_long_fract_type_node
2663 || type
== sat_unsigned_long_long_fract_type_node
2664 || type
== unsigned_long_long_accum_type_node
2665 || type
== sat_unsigned_long_long_accum_type_node
)
2668 sorry ("mangling unknown fixed point type");
2669 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2670 if (TYPE_SATURATING (type
))
2681 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2682 METHOD_TYPE. The return type is mangled before the parameter
2685 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2688 write_function_type (const tree type
)
2690 MANGLE_TRACE_TREE ("function-type", type
);
2692 /* For a pointer to member function, the function type may have
2693 cv-qualifiers, indicating the quals for the artificial 'this'
2695 if (TREE_CODE (type
) == METHOD_TYPE
)
2697 /* The first parameter must be a POINTER_TYPE pointing to the
2698 `this' parameter. */
2699 tree this_type
= class_of_this_parm (type
);
2700 write_CV_qualifiers_for_type (this_type
);
2703 write_exception_spec (TYPE_RAISES_EXCEPTIONS (type
));
2705 if (tx_safe_fn_type_p (type
))
2706 write_string ("Dx");
2709 /* We don't track whether or not a type is `extern "C"'. Note that
2710 you can have an `extern "C"' function that does not have
2711 `extern "C"' type, and vice versa:
2713 extern "C" typedef void function_t();
2714 function_t f; // f has C++ linkage, but its type is
2717 typedef void function_t();
2718 extern "C" function_t f; // Vice versa.
2721 write_bare_function_type (type
, /*include_return_type_p=*/1,
2723 if (FUNCTION_REF_QUALIFIED (type
))
2725 if (FUNCTION_RVALUE_QUALIFIED (type
))
2733 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2734 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2735 is mangled before the parameter types. If non-NULL, DECL is
2736 FUNCTION_DECL for the function whose type is being emitted. */
2739 write_bare_function_type (const tree type
, const int include_return_type_p
,
2742 MANGLE_TRACE_TREE ("bare-function-type", type
);
2744 /* Mangle the return type, if requested. */
2745 if (include_return_type_p
)
2746 write_type (TREE_TYPE (type
));
2748 /* Now mangle the types of the arguments. */
2750 write_method_parms (TYPE_ARG_TYPES (type
),
2751 TREE_CODE (type
) == METHOD_TYPE
,
2756 /* Write the mangled representation of a method parameter list of
2757 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2758 considered a non-static method, and the this parameter is omitted.
2759 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2760 parameters are being emitted. */
2763 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2765 tree first_parm_type
;
2766 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2768 /* Assume this parameter type list is variable-length. If it ends
2769 with a void type, then it's not. */
2772 /* If this is a member function, skip the first arg, which is the
2774 "Member functions do not encode the type of their implicit this
2777 Similarly, there's no need to mangle artificial parameters, like
2778 the VTT parameters for constructors and destructors. */
2781 parm_types
= TREE_CHAIN (parm_types
);
2782 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2784 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2786 parm_types
= TREE_CHAIN (parm_types
);
2787 parm_decl
= DECL_CHAIN (parm_decl
);
2790 if (decl
&& ctor_omit_inherited_parms (decl
))
2791 /* Bring back parameters omitted from an inherited ctor. */
2792 parm_types
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl
));
2795 for (first_parm_type
= parm_types
;
2797 parm_types
= TREE_CHAIN (parm_types
))
2799 tree parm
= TREE_VALUE (parm_types
);
2800 if (parm
== void_type_node
)
2802 /* "Empty parameter lists, whether declared as () or
2803 conventionally as (void), are encoded with a void parameter
2805 if (parm_types
== first_parm_type
)
2807 /* If the parm list is terminated with a void type, it's
2810 /* A void type better be the last one. */
2811 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2818 /* <builtin-type> ::= z # ellipsis */
2822 /* <class-enum-type> ::= <name> */
2825 write_class_enum_type (const tree type
)
2827 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2830 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2833 <template-args> ::= I <template-arg>* E */
2836 write_template_args (tree args
)
2841 MANGLE_TRACE_TREE ("template-args", args
);
2846 length
= TREE_VEC_LENGTH (args
);
2848 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2850 /* We have nested template args. We want the innermost template
2852 args
= TREE_VEC_ELT (args
, length
- 1);
2853 length
= TREE_VEC_LENGTH (args
);
2855 for (i
= 0; i
< length
; ++i
)
2856 write_template_arg (TREE_VEC_ELT (args
, i
));
2863 <unqualified-name> <template-args>
2864 part of SCOPE_REF or COMPONENT_REF mangling. */
2867 write_member_name (tree member
)
2869 if (identifier_p (member
))
2871 if (abi_version_at_least (11) && IDENTIFIER_ANY_OP_P (member
))
2873 write_string ("on");
2874 if (abi_warn_or_compat_version_crosses (11))
2875 G
.need_abi_warning
= 1;
2877 write_unqualified_id (member
);
2879 else if (DECL_P (member
))
2881 gcc_assert (!DECL_OVERLOADED_OPERATOR_P (member
));
2882 write_unqualified_name (member
);
2884 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2886 tree name
= TREE_OPERAND (member
, 0);
2887 name
= OVL_FIRST (name
);
2888 write_member_name (name
);
2889 write_template_args (TREE_OPERAND (member
, 1));
2892 write_expression (member
);
2895 /* EXPR is a base COMPONENT_REF; write the minimized base conversion path for
2896 converting to BASE, or just the conversion of EXPR if BASE is null.
2898 "Given a fully explicit base path P := C_n -> ... -> C_0, the minimized base
2899 path Min(P) is defined as follows: let C_i be the last element for which the
2900 conversion to C_0 is unambiguous; if that element is C_n, the minimized path
2901 is C_n -> C_0; otherwise, the minimized path is Min(C_n -> ... -> C_i) ->
2904 We mangle the conversion to C_i if it's different from C_n. */
2907 write_base_ref (tree expr
, tree base
= NULL_TREE
)
2909 if (TREE_CODE (expr
) != COMPONENT_REF
)
2912 tree field
= TREE_OPERAND (expr
, 1);
2914 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_FIELD_IS_BASE (field
))
2917 tree object
= TREE_OPERAND (expr
, 0);
2919 tree binfo
= NULL_TREE
;
2922 tree cur
= TREE_TYPE (object
);
2923 binfo
= lookup_base (cur
, base
, ba_unique
, NULL
, tf_none
);
2926 /* We're at the end of the base conversion chain, so it can't be
2928 base
= TREE_TYPE (field
);
2930 if (binfo
== error_mark_node
)
2932 /* cur->base is ambiguous, so make the conversion to
2933 last explicit, expressed as a cast (last&)object. */
2934 tree last
= TREE_TYPE (expr
);
2935 write_string (OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
);
2936 write_type (build_reference_type (last
));
2937 write_expression (object
);
2939 else if (write_base_ref (object
, base
))
2940 /* cur->base is unambiguous, but we had another base conversion
2941 underneath and wrote it out. */;
2943 /* No more base conversions, just write out the object. */
2944 write_expression (object
);
2949 /* <expression> ::= <unary operator-name> <expression>
2950 ::= <binary operator-name> <expression> <expression>
2953 <expr-primary> ::= <template-param>
2954 ::= L <type> <value number> E # literal
2955 ::= L <mangled-name> E # external name
2956 ::= st <type> # sizeof
2957 ::= sr <type> <unqualified-name> # dependent name
2958 ::= sr <type> <unqualified-name> <template-args> */
2961 write_expression (tree expr
)
2963 enum tree_code code
= TREE_CODE (expr
);
2965 if (TREE_CODE (expr
) == TARGET_EXPR
)
2967 expr
= TARGET_EXPR_INITIAL (expr
);
2968 code
= TREE_CODE (expr
);
2971 /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
2972 argument is converted (via qualification conversions) to another type. */
2973 while (CONVERT_EXPR_CODE_P (code
)
2974 || code
== IMPLICIT_CONV_EXPR
2975 || location_wrapper_p (expr
)
2976 /* Parentheses aren't mangled. */
2977 || code
== PAREN_EXPR
2978 || code
== NON_LVALUE_EXPR
2979 || (code
== VIEW_CONVERT_EXPR
2980 && TREE_CODE (TREE_OPERAND (expr
, 0)) == TEMPLATE_PARM_INDEX
))
2982 expr
= TREE_OPERAND (expr
, 0);
2983 code
= TREE_CODE (expr
);
2986 if (code
== BASELINK
2987 && (!type_unknown_p (expr
)
2988 || !BASELINK_QUALIFIED_P (expr
)))
2990 expr
= BASELINK_FUNCTIONS (expr
);
2991 code
= TREE_CODE (expr
);
2994 /* Handle pointers-to-members by making them look like expression
2996 if (code
== PTRMEM_CST
)
2998 expr
= build_nt (ADDR_EXPR
,
2999 build_qualified_name (/*type=*/NULL_TREE
,
3000 PTRMEM_CST_CLASS (expr
),
3001 PTRMEM_CST_MEMBER (expr
),
3002 /*template_p=*/false));
3003 code
= TREE_CODE (expr
);
3006 /* Handle template parameters. */
3007 if (code
== TEMPLATE_TYPE_PARM
3008 || code
== TEMPLATE_TEMPLATE_PARM
3009 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
3010 || code
== TEMPLATE_PARM_INDEX
)
3011 write_template_param (expr
);
3012 /* Handle literals. */
3013 else if (TREE_CODE_CLASS (code
) == tcc_constant
3014 || code
== CONST_DECL
)
3015 write_template_arg_literal (expr
);
3016 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
3018 gcc_assert (id_equal (DECL_NAME (expr
), "this"));
3019 write_string ("fpT");
3021 else if (code
== PARM_DECL
)
3023 /* A function parameter used in a late-specified return type. */
3024 int index
= DECL_PARM_INDEX (expr
);
3025 int level
= DECL_PARM_LEVEL (expr
);
3026 int delta
= G
.parm_depth
- level
+ 1;
3027 gcc_assert (index
>= 1);
3031 if (abi_version_at_least (5))
3033 /* Let L be the number of function prototype scopes from the
3034 innermost one (in which the parameter reference occurs) up
3035 to (and including) the one containing the declaration of
3036 the referenced parameter. If the parameter declaration
3037 clause of the innermost function prototype scope has been
3038 completely seen, it is not counted (in that case -- which
3039 is perhaps the most common -- L can be zero). */
3041 write_unsigned_number (delta
- 1);
3043 if (abi_warn_or_compat_version_crosses (5))
3044 G
.need_abi_warning
= true;
3047 write_compact_number (index
- 1);
3049 else if (DECL_P (expr
))
3052 write_mangled_name (expr
, false);
3055 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
3057 tree op
= TREE_OPERAND (expr
, 0);
3059 if (PACK_EXPANSION_P (op
))
3061 if (abi_warn_or_compat_version_crosses (11))
3062 G
.need_abi_warning
= true;
3063 if (abi_version_at_least (11))
3065 /* sZ rather than szDp. */
3066 write_string ("sZ");
3067 write_expression (PACK_EXPANSION_PATTERN (op
));
3072 if (SIZEOF_EXPR_TYPE_P (expr
))
3074 write_string ("st");
3075 write_type (TREE_TYPE (op
));
3077 else if (ARGUMENT_PACK_P (op
))
3079 tree args
= ARGUMENT_PACK_ARGS (op
);
3080 int length
= TREE_VEC_LENGTH (args
);
3081 if (abi_warn_or_compat_version_crosses (10))
3082 G
.need_abi_warning
= true;
3083 if (abi_version_at_least (10))
3085 /* sP <template-arg>* E # sizeof...(T), size of a captured
3086 template parameter pack from an alias template */
3087 write_string ("sP");
3088 for (int i
= 0; i
< length
; ++i
)
3089 write_template_arg (TREE_VEC_ELT (args
, i
));
3094 /* In GCC 5 we represented this sizeof wrong, with the effect
3095 that we mangled it as the last element of the pack. */
3096 tree arg
= TREE_VEC_ELT (args
, length
-1);
3099 write_string ("st");
3104 write_string ("sz");
3105 write_expression (arg
);
3109 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
3111 write_string ("st");
3112 write_type (TREE_OPERAND (expr
, 0));
3117 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
)
3119 if (!ALIGNOF_EXPR_STD_P (expr
))
3121 if (abi_warn_or_compat_version_crosses (15))
3122 G
.need_abi_warning
= true;
3123 if (abi_version_at_least (15))
3125 /* We used to mangle __alignof__ like alignof. */
3126 write_string ("v111__alignof__");
3127 if (TYPE_P (TREE_OPERAND (expr
, 0)))
3128 write_type (TREE_OPERAND (expr
, 0));
3130 write_expression (TREE_OPERAND (expr
, 0));
3134 if (TYPE_P (TREE_OPERAND (expr
, 0)))
3136 write_string ("at");
3137 write_type (TREE_OPERAND (expr
, 0));
3142 else if (code
== SCOPE_REF
3143 || code
== BASELINK
)
3146 if (code
== SCOPE_REF
)
3148 scope
= TREE_OPERAND (expr
, 0);
3149 member
= TREE_OPERAND (expr
, 1);
3150 if (BASELINK_P (member
))
3151 member
= BASELINK_FUNCTIONS (member
);
3155 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
3156 member
= BASELINK_FUNCTIONS (expr
);
3159 /* If the MEMBER is a real declaration, then the qualifying
3160 scope was not dependent. Ideally, we would not have a
3161 SCOPE_REF in those cases, but sometimes we do. If the second
3162 argument is a DECL, then the name must not have been
3164 if (DECL_P (member
))
3165 write_expression (member
);
3168 gcc_assert (code
!= BASELINK
|| BASELINK_QUALIFIED_P (expr
));
3169 write_string ("sr");
3171 write_member_name (member
);
3174 else if (INDIRECT_REF_P (expr
)
3175 && TREE_TYPE (TREE_OPERAND (expr
, 0))
3176 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3178 write_expression (TREE_OPERAND (expr
, 0));
3180 else if (identifier_p (expr
))
3182 /* An operator name appearing as a dependent name needs to be
3183 specially marked to disambiguate between a use of the operator
3184 name and a use of the operator in an expression. */
3185 if (IDENTIFIER_ANY_OP_P (expr
))
3186 write_string ("on");
3187 write_unqualified_id (expr
);
3189 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
3191 tree fn
= TREE_OPERAND (expr
, 0);
3193 if (IDENTIFIER_ANY_OP_P (fn
))
3194 write_string ("on");
3195 write_unqualified_id (fn
);
3196 write_template_args (TREE_OPERAND (expr
, 1));
3198 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3200 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3201 const char *name
= OVL_OP_INFO (true, subop
)->mangled_name
;
3203 write_string (name
);
3204 write_expression (TREE_OPERAND (expr
, 0));
3205 write_expression (TREE_OPERAND (expr
, 2));
3207 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3209 /* ::= [gs] nw <expression>* _ <type> E
3210 ::= [gs] nw <expression>* _ <type> <initializer>
3211 ::= [gs] na <expression>* _ <type> E
3212 ::= [gs] na <expression>* _ <type> <initializer>
3213 <initializer> ::= pi <expression>* E */
3214 tree placement
= TREE_OPERAND (expr
, 0);
3215 tree type
= TREE_OPERAND (expr
, 1);
3216 tree nelts
= TREE_OPERAND (expr
, 2);
3217 tree init
= TREE_OPERAND (expr
, 3);
3220 gcc_assert (code
== NEW_EXPR
);
3221 if (TREE_OPERAND (expr
, 2))
3222 code
= VEC_NEW_EXPR
;
3224 if (NEW_EXPR_USE_GLOBAL (expr
))
3225 write_string ("gs");
3227 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3229 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3230 write_expression (TREE_VALUE (t
));
3237 ++processing_template_decl
;
3238 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3239 tf_warning_or_error
);
3240 type
= build_cplus_array_type (type
, domain
);
3241 --processing_template_decl
;
3245 if (init
&& TREE_CODE (init
) == TREE_LIST
3246 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3247 write_expression (TREE_VALUE (init
));
3251 write_string ("pi");
3252 if (init
&& init
!= void_node
)
3253 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3254 write_expression (TREE_VALUE (t
));
3258 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3260 gcc_assert (code
== DELETE_EXPR
);
3261 if (DELETE_EXPR_USE_VEC (expr
))
3262 code
= VEC_DELETE_EXPR
;
3264 if (DELETE_EXPR_USE_GLOBAL (expr
))
3265 write_string ("gs");
3267 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3269 write_expression (TREE_OPERAND (expr
, 0));
3271 else if (code
== THROW_EXPR
)
3273 tree op
= TREE_OPERAND (expr
, 0);
3276 write_string ("tw");
3277 write_expression (op
);
3280 write_string ("tr");
3282 else if (code
== CONSTRUCTOR
)
3284 bool braced_init
= BRACE_ENCLOSED_INITIALIZER_P (expr
);
3285 tree etype
= TREE_TYPE (expr
);
3288 write_string ("il");
3291 write_string ("tl");
3295 bool nontriv
= !trivial_type_p (etype
);
3296 if (nontriv
|| !zero_init_expr_p (expr
))
3298 /* Convert braced initializer lists to STRING_CSTs so that
3299 A<"Foo"> mangles the same as A<{'F', 'o', 'o', 0}> while
3300 still using the latter mangling for strings that
3301 originated as braced initializer lists. */
3302 expr
= braced_lists_to_strings (etype
, expr
);
3304 if (TREE_CODE (expr
) == CONSTRUCTOR
)
3306 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3307 unsigned last_nonzero
= UINT_MAX
, i
;
3308 constructor_elt
*ce
;
3312 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3313 if (!zero_init_expr_p (val
))
3316 if (nontriv
|| last_nonzero
!= UINT_MAX
)
3317 for (HOST_WIDE_INT i
= 0; vec_safe_iterate (elts
, i
, &ce
); ++i
)
3319 if (i
> last_nonzero
)
3321 /* FIXME handle RANGE_EXPR */
3322 if (TREE_CODE (etype
) == UNION_TYPE
)
3324 /* Express the active member as a designator. */
3325 write_string ("di");
3326 write_unqualified_name (ce
->index
);
3328 write_expression (ce
->value
);
3333 gcc_assert (TREE_CODE (expr
) == STRING_CST
);
3334 write_expression (expr
);
3339 else if (code
== LAMBDA_EXPR
)
3341 /* [temp.over.link] Two lambda-expressions are never considered
3344 So just use the closure type mangling. */
3345 write_string ("tl");
3346 write_type (LAMBDA_EXPR_CLOSURE (expr
));
3349 else if (dependent_name (expr
))
3351 tree name
= dependent_name (expr
);
3352 gcc_assert (!IDENTIFIER_ANY_OP_P (name
));
3353 write_unqualified_id (name
);
3361 /* When we bind a variable or function to a non-type template
3362 argument with reference type, we create an ADDR_EXPR to show
3363 the fact that the entity's address has been taken. But, we
3364 don't actually want to output a mangling code for the `&'. */
3365 if (TREE_CODE (expr
) == ADDR_EXPR
3367 && TYPE_REF_P (TREE_TYPE (expr
)))
3369 expr
= TREE_OPERAND (expr
, 0);
3372 write_expression (expr
);
3376 code
= TREE_CODE (expr
);
3379 if (code
== COMPONENT_REF
)
3381 tree ob
= TREE_OPERAND (expr
, 0);
3383 if (TREE_CODE (ob
) == ARROW_EXPR
)
3385 write_string (OVL_OP_INFO (false, code
)->mangled_name
);
3386 ob
= TREE_OPERAND (ob
, 0);
3387 write_expression (ob
);
3389 else if (write_base_ref (expr
))
3391 else if (!is_dummy_object (ob
))
3393 write_string ("dt");
3394 write_expression (ob
);
3396 /* else, for a non-static data member with no associated object (in
3397 unevaluated context), use the unresolved-name mangling. */
3399 write_member_name (TREE_OPERAND (expr
, 1));
3403 /* If it wasn't any of those, recursively expand the expression. */
3404 name
= OVL_OP_INFO (false, code
)->mangled_name
;
3406 /* We used to mangle const_cast and static_cast like a C cast. */
3407 if (code
== CONST_CAST_EXPR
3408 || code
== STATIC_CAST_EXPR
)
3410 if (abi_warn_or_compat_version_crosses (6))
3411 G
.need_abi_warning
= 1;
3412 if (!abi_version_at_least (6))
3413 name
= OVL_OP_INFO (false, CAST_EXPR
)->mangled_name
;
3421 error ("use of built-in trait %qE in function signature; "
3422 "use library traits instead", expr
);
3426 sorry ("mangling %C", code
);
3432 write_string (name
);
3438 tree fn
= CALL_EXPR_FN (expr
);
3440 if (TREE_CODE (fn
) == ADDR_EXPR
)
3441 fn
= TREE_OPERAND (fn
, 0);
3443 /* Mangle a dependent name as the name, not whatever happens to
3444 be the first function in the overload set. */
3446 && type_dependent_expression_p_push (expr
))
3449 write_expression (fn
);
3452 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3453 write_expression (CALL_EXPR_ARG (expr
, i
));
3458 write_type (TREE_TYPE (expr
));
3459 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3460 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3463 tree args
= TREE_OPERAND (expr
, 0);
3465 for (; args
; args
= TREE_CHAIN (args
))
3466 write_expression (TREE_VALUE (args
));
3471 case DYNAMIC_CAST_EXPR
:
3472 case REINTERPRET_CAST_EXPR
:
3473 case STATIC_CAST_EXPR
:
3474 case CONST_CAST_EXPR
:
3475 write_type (TREE_TYPE (expr
));
3476 write_expression (TREE_OPERAND (expr
, 0));
3479 case PREINCREMENT_EXPR
:
3480 case PREDECREMENT_EXPR
:
3481 if (abi_version_at_least (6))
3483 if (abi_warn_or_compat_version_crosses (6))
3484 G
.need_abi_warning
= 1;
3488 /* In the middle-end, some expressions have more operands than
3489 they do in templates (and mangling). */
3490 len
= cp_tree_operand_length (expr
);
3492 for (i
= 0; i
< len
; ++i
)
3494 tree operand
= TREE_OPERAND (expr
, i
);
3495 /* As a GNU extension, the middle operand of a
3496 conditional may be omitted. Since expression
3497 manglings are supposed to represent the input token
3498 stream, there's no good way to mangle such an
3499 expression without extending the C++ ABI. */
3500 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3502 error ("omitted middle operand to %<?:%> operand "
3503 "cannot be mangled");
3506 else if (FOLD_EXPR_P (expr
))
3508 /* The first 'operand' of a fold-expression is the operator
3509 that it folds over. */
3512 int fcode
= TREE_INT_CST_LOW (operand
);
3513 write_string (OVL_OP_INFO (false, fcode
)->mangled_name
);
3516 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3518 /* The order of operands of the binary left and right
3519 folds is the same, but we want to mangle them in
3520 lexical order, i.e. non-pack first. */
3522 operand
= FOLD_EXPR_INIT (expr
);
3524 operand
= FOLD_EXPR_PACK (expr
);
3526 if (PACK_EXPANSION_P (operand
))
3527 operand
= PACK_EXPANSION_PATTERN (operand
);
3529 write_expression (operand
);
3535 /* Literal subcase of non-terminal <template-arg>.
3537 "Literal arguments, e.g. "A<42L>", are encoded with their type
3538 and value. Negative integer values are preceded with "n"; for
3539 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3540 encoded as 0, true as 1." */
3543 write_template_arg_literal (const tree value
)
3545 if (TREE_CODE (value
) == STRING_CST
)
3546 /* Temporarily mangle strings as braced initializer lists. */
3547 write_string ("tl");
3551 tree valtype
= TREE_TYPE (value
);
3552 write_type (valtype
);
3554 /* Write a null member pointer value as (type)0, regardless of its
3555 real representation. */
3556 if (null_member_pointer_value_p (value
))
3557 write_integer_cst (integer_zero_node
);
3559 switch (TREE_CODE (value
))
3562 write_integer_cst (DECL_INITIAL (value
));
3566 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3567 || integer_zerop (value
) || integer_onep (value
));
3568 if (!(abi_version_at_least (14)
3569 && NULLPTR_TYPE_P (TREE_TYPE (value
))))
3570 write_integer_cst (value
);
3574 write_real_cst (value
);
3578 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3579 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3581 write_integer_cst (TREE_REALPART (value
));
3583 write_integer_cst (TREE_IMAGPART (value
));
3585 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3586 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3588 write_real_cst (TREE_REALPART (value
));
3590 write_real_cst (TREE_IMAGPART (value
));
3598 /* Mangle strings the same as braced initializer lists. */
3599 unsigned n
= TREE_STRING_LENGTH (value
);
3600 const char *str
= TREE_STRING_POINTER (value
);
3602 /* Count the number of trailing nuls and subtract them from
3603 STRSIZE because they don't need to be mangled. */
3604 for (const char *p
= str
+ n
- 1; ; --p
)
3608 n
-= str
+ n
- !!*p
- p
;
3612 tree eltype
= TREE_TYPE (valtype
);
3613 for (const char *p
= str
; n
--; ++p
)
3616 write_type (eltype
);
3617 write_unsigned_number (*(const unsigned char*)p
);
3630 /* Non-terminal <template-arg>.
3632 <template-arg> ::= <type> # type
3633 ::= L <type> </value/ number> E # literal
3634 ::= LZ <name> E # external name
3635 ::= X <expression> E # expression */
3638 write_template_arg (tree node
)
3640 enum tree_code code
= TREE_CODE (node
);
3642 MANGLE_TRACE_TREE ("template-arg", node
);
3644 /* A template template parameter's argument list contains TREE_LIST
3645 nodes of which the value field is the actual argument. */
3646 if (code
== TREE_LIST
)
3648 node
= TREE_VALUE (node
);
3649 /* If it's a decl, deal with its type instead. */
3652 node
= TREE_TYPE (node
);
3653 code
= TREE_CODE (node
);
3657 if (template_parm_object_p (node
))
3658 /* We want to mangle the argument, not the var we stored it in. */
3659 node
= tparm_object_argument (node
);
3661 /* Strip a conversion added by convert_nontype_argument. */
3662 if (TREE_CODE (node
) == IMPLICIT_CONV_EXPR
)
3663 node
= TREE_OPERAND (node
, 0);
3664 if (REFERENCE_REF_P (node
))
3665 node
= TREE_OPERAND (node
, 0);
3666 if (TREE_CODE (node
) == NOP_EXPR
3667 && TYPE_REF_P (TREE_TYPE (node
)))
3669 /* Template parameters can be of reference type. To maintain
3670 internal consistency, such arguments use a conversion from
3671 address of object to reference type. */
3672 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3673 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3676 if (TREE_CODE (node
) == BASELINK
3677 && !type_unknown_p (node
))
3679 if (abi_version_at_least (6))
3680 node
= BASELINK_FUNCTIONS (node
);
3681 if (abi_warn_or_compat_version_crosses (6))
3682 /* We wrongly wrapped a class-scope function in X/E. */
3683 G
.need_abi_warning
= 1;
3686 if (ARGUMENT_PACK_P (node
))
3688 /* Expand the template argument pack. */
3689 tree args
= ARGUMENT_PACK_ARGS (node
);
3690 int i
, length
= TREE_VEC_LENGTH (args
);
3691 if (abi_version_at_least (6))
3695 if (abi_warn_or_compat_version_crosses (6))
3696 G
.need_abi_warning
= 1;
3697 for (i
= 0; i
< length
; ++i
)
3698 write_template_arg (TREE_VEC_ELT (args
, i
));
3701 else if (TYPE_P (node
))
3703 else if (code
== TEMPLATE_DECL
)
3704 /* A template appearing as a template arg is a template template arg. */
3705 write_template_template_arg (node
);
3706 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3707 || code
== CONST_DECL
3708 || null_member_pointer_value_p (node
))
3709 write_template_arg_literal (node
);
3710 else if (DECL_P (node
))
3713 /* Until ABI version 3, the underscore before the mangled name
3714 was incorrectly omitted. */
3715 if (!abi_version_at_least (3))
3718 write_string ("_Z");
3719 if (abi_warn_or_compat_version_crosses (3))
3720 G
.need_abi_warning
= 1;
3721 write_encoding (node
);
3726 /* Template arguments may be expressions. */
3728 write_expression (node
);
3733 /* <template-template-arg>
3735 ::= <substitution> */
3738 write_template_template_arg (const tree decl
)
3740 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3742 if (find_substitution (decl
))
3744 write_name (decl
, /*ignore_local_scope=*/0);
3745 add_substitution (decl
);
3749 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3751 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3752 ::= A <expression> _ </element/ type>
3754 "Array types encode the dimension (number of elements) and the
3755 element type. For variable length arrays, the dimension (but not
3756 the '_' separator) is omitted."
3757 Note that for flexible array members, like for other arrays of
3758 unspecified size, the dimension is also omitted. */
3761 write_array_type (const tree type
)
3764 if (TYPE_DOMAIN (type
))
3768 index_type
= TYPE_DOMAIN (type
);
3769 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3770 It's null for flexible array members which have no upper bound
3771 (this is a change from GCC 5 and prior where such members were
3772 incorrectly mangled as zero-length arrays). */
3773 if (tree max
= TYPE_MAX_VALUE (index_type
))
3775 if (TREE_CODE (max
) == INTEGER_CST
)
3777 /* The ABI specifies that we should mangle the number of
3778 elements in the array, not the largest allowed index. */
3779 offset_int wmax
= wi::to_offset (max
) + 1;
3780 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3781 number of elements as zero. */
3782 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3783 gcc_assert (wi::fits_uhwi_p (wmax
));
3784 write_unsigned_number (wmax
.to_uhwi ());
3788 max
= TREE_OPERAND (max
, 0);
3789 write_expression (max
);
3794 write_type (TREE_TYPE (type
));
3797 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3798 variables. TYPE is a pointer-to-member POINTER_TYPE.
3800 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3803 write_pointer_to_member_type (const tree type
)
3806 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3807 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3810 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3811 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3812 TEMPLATE_PARM_INDEX.
3814 <template-param> ::= T </parameter/ number> _ */
3817 write_template_param (const tree parm
)
3821 MANGLE_TRACE_TREE ("template-parm", parm
);
3823 switch (TREE_CODE (parm
))
3825 case TEMPLATE_TYPE_PARM
:
3826 case TEMPLATE_TEMPLATE_PARM
:
3827 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3828 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3831 case TEMPLATE_PARM_INDEX
:
3832 parm_index
= TEMPLATE_PARM_IDX (parm
);
3840 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3841 earliest template param denoted by `_'. */
3842 write_compact_number (parm_index
);
3845 /* <template-template-param>
3846 ::= <template-param>
3847 ::= <substitution> */
3850 write_template_template_param (const tree parm
)
3852 tree templ
= NULL_TREE
;
3854 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3855 template template parameter. The substitution candidate here is
3856 only the template. */
3857 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3860 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3861 if (find_substitution (templ
))
3865 /* <template-param> encodes only the template parameter position,
3866 not its template arguments, which is fine here. */
3867 write_template_param (parm
);
3869 add_substitution (templ
);
3872 /* Non-terminal <substitution>.
3874 <substitution> ::= S <seq-id> _
3878 write_substitution (const int seq_id
)
3880 MANGLE_TRACE ("substitution", "");
3884 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3888 /* Start mangling ENTITY. */
3891 start_mangling (const tree entity
)
3894 G
.need_abi_warning
= false;
3895 G
.need_cxx17_warning
= false;
3897 obstack_free (&name_obstack
, name_base
);
3898 mangle_obstack
= &name_obstack
;
3899 name_base
= obstack_alloc (&name_obstack
, 0);
3902 /* Done with mangling. Release the data. */
3905 finish_mangling_internal (void)
3907 /* Clear all the substitutions. */
3908 vec_safe_truncate (G
.substitutions
, 0);
3911 mangle_module_fini ();
3913 /* Null-terminate the string. */
3918 /* Like finish_mangling_internal, but return the mangled string. */
3920 static inline const char *
3921 finish_mangling (void)
3923 finish_mangling_internal ();
3924 return (const char *) obstack_finish (mangle_obstack
);
3927 /* Like finish_mangling_internal, but return an identifier. */
3930 finish_mangling_get_identifier (void)
3932 finish_mangling_internal ();
3933 /* Don't obstack_finish here, and the next start_mangling will
3934 remove the identifier. */
3935 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3938 /* Initialize data structures for mangling. */
3943 gcc_obstack_init (&name_obstack
);
3944 name_base
= obstack_alloc (&name_obstack
, 0);
3945 vec_alloc (G
.substitutions
, 0);
3947 /* Cache these identifiers for quick comparison when checking for
3948 standard substitutions. */
3949 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3950 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3951 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3952 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3953 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3954 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3957 /* Generate a mangling for MODULE's global initializer fn. */
3960 mangle_module_global_init (int module
)
3962 start_mangling (NULL_TREE
);
3964 write_string ("_ZGI");
3965 write_module (module
, true);
3968 return finish_mangling_get_identifier ();
3971 /* Generate the mangled name of DECL. */
3974 mangle_decl_string (const tree decl
)
3977 tree saved_fn
= NULL_TREE
;
3978 bool template_p
= false;
3980 /* We shouldn't be trying to mangle an uninstantiated template. */
3981 gcc_assert (!type_dependent_expression_p (decl
));
3983 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3985 struct tinst_level
*tl
= current_instantiation ();
3986 if ((!tl
|| tl
->maybe_get_node () != decl
)
3987 && push_tinst_level (decl
))
3990 saved_fn
= current_function_decl
;
3991 current_function_decl
= NULL_TREE
;
3994 iloc_sentinel
ils (DECL_SOURCE_LOCATION (decl
));
3996 start_mangling (decl
);
3998 if (TREE_CODE (decl
) == TYPE_DECL
)
3999 write_type (TREE_TYPE (decl
));
4001 write_mangled_name (decl
, true);
4003 result
= finish_mangling_get_identifier ();
4005 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
4006 IDENTIFIER_POINTER (result
));
4011 current_function_decl
= saved_fn
;
4017 /* Return an identifier for the external mangled name of DECL. */
4020 get_mangled_id (tree decl
)
4022 tree id
= mangle_decl_string (decl
);
4023 return targetm
.mangle_decl_assembler_name (decl
, id
);
4026 /* Create an identifier for the external mangled name of DECL. */
4029 mangle_decl (const tree decl
)
4034 /* Don't bother mangling uninstantiated templates. */
4035 ++processing_template_decl
;
4036 if (TREE_CODE (decl
) == TYPE_DECL
)
4037 dep
= dependent_type_p (TREE_TYPE (decl
));
4039 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
4040 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
4041 --processing_template_decl
;
4045 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
4046 It is not needed to assign names to anonymous namespace, but we use the
4047 "<anon>" marker to be able to tell if type is C++ ODR type or type
4048 produced by other language. */
4049 if (TREE_CODE (decl
) == TYPE_DECL
4050 && TYPE_STUB_DECL (TREE_TYPE (decl
))
4051 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
4052 id
= get_identifier ("<anon>");
4055 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
4056 || !no_linkage_check (TREE_TYPE (decl
), true));
4057 if (abi_version_at_least (10))
4058 if (tree fn
= decl_function_context (decl
))
4059 maybe_check_abi_tags (fn
, decl
);
4060 id
= get_mangled_id (decl
);
4062 SET_DECL_ASSEMBLER_NAME (decl
, id
);
4064 if (G
.need_cxx17_warning
4065 && (TREE_PUBLIC (decl
) || DECL_REALLY_EXTERN (decl
)))
4066 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wnoexcept_type
,
4067 "mangled name for %qD will change in C++17 because the "
4068 "exception specification is part of a function type",
4071 if (id
!= DECL_NAME (decl
)
4072 /* Don't do this for a fake symbol we aren't going to emit anyway. */
4073 && TREE_CODE (decl
) != TYPE_DECL
4074 && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl
))
4076 int save_ver
= flag_abi_version
;
4077 tree id2
= NULL_TREE
;
4079 if (!DECL_REALLY_EXTERN (decl
))
4081 record_mangling (decl
, G
.need_abi_warning
);
4083 if (!G
.need_abi_warning
)
4086 flag_abi_version
= flag_abi_compat_version
;
4087 id2
= mangle_decl_string (decl
);
4088 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
4089 flag_abi_version
= save_ver
;
4092 note_mangling_alias (decl
, id2
);
4097 const char fabi_version
[] = "-fabi-version";
4099 if (flag_abi_compat_version
!= warn_abi_version
4100 || id2
== NULL_TREE
)
4102 flag_abi_version
= warn_abi_version
;
4103 id2
= mangle_decl_string (decl
);
4104 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
4106 flag_abi_version
= save_ver
;
4110 else if (warn_abi_version
!= 0
4111 && abi_version_at_least (warn_abi_version
))
4112 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
4113 "the mangled name of %qD changed between "
4114 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4115 G
.entity
, fabi_version
, warn_abi_version
, id2
,
4116 fabi_version
, save_ver
, id
);
4118 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
4119 "the mangled name of %qD changes between "
4120 "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4121 G
.entity
, fabi_version
, save_ver
, id
,
4122 fabi_version
, warn_abi_version
, id2
);
4125 flag_abi_version
= save_ver
;
4129 /* Generate the mangled representation of TYPE. */
4132 mangle_type_string (const tree type
)
4136 start_mangling (type
);
4138 result
= finish_mangling ();
4140 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
4144 /* Create an identifier for the mangled name of a special component
4145 for belonging to TYPE. CODE is the ABI-specified code for this
4149 mangle_special_for_type (const tree type
, const char *code
)
4153 /* We don't have an actual decl here for the special component, so
4154 we can't just process the <encoded-name>. Instead, fake it. */
4155 start_mangling (type
);
4157 /* Start the mangling. */
4158 write_string ("_Z");
4159 write_string (code
);
4163 result
= finish_mangling_get_identifier ();
4166 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
4167 IDENTIFIER_POINTER (result
));
4172 /* Create an identifier for the mangled representation of the typeinfo
4173 structure for TYPE. */
4176 mangle_typeinfo_for_type (const tree type
)
4178 return mangle_special_for_type (type
, "TI");
4181 /* Create an identifier for the mangled name of the NTBS containing
4182 the mangled name of TYPE. */
4185 mangle_typeinfo_string_for_type (const tree type
)
4187 return mangle_special_for_type (type
, "TS");
4190 /* Create an identifier for the mangled name of the vtable for TYPE. */
4193 mangle_vtbl_for_type (const tree type
)
4195 return mangle_special_for_type (type
, "TV");
4198 /* Returns an identifier for the mangled name of the VTT for TYPE. */
4201 mangle_vtt_for_type (const tree type
)
4203 return mangle_special_for_type (type
, "TT");
4206 /* Returns an identifier for the mangled name of the decomposition
4207 artificial variable DECL. DECLS is the vector of the VAR_DECLs
4208 for the identifier-list. */
4211 mangle_decomp (const tree decl
, vec
<tree
> &decls
)
4213 gcc_assert (!type_dependent_expression_p (decl
));
4215 location_t saved_loc
= input_location
;
4216 input_location
= DECL_SOURCE_LOCATION (decl
);
4218 start_mangling (decl
);
4219 write_string ("_Z");
4221 tree context
= decl_mangling_context (decl
);
4222 gcc_assert (context
!= NULL_TREE
);
4224 bool nested
= false;
4225 if (DECL_NAMESPACE_STD_P (context
))
4226 write_string ("St");
4227 else if (context
!= global_namespace
)
4231 write_prefix (decl_mangling_context (decl
));
4234 write_string ("DC");
4237 FOR_EACH_VEC_ELT (decls
, i
, d
)
4238 write_unqualified_name (d
);
4244 tree id
= finish_mangling_get_identifier ();
4246 fprintf (stderr
, "mangle_decomp = '%s'\n\n",
4247 IDENTIFIER_POINTER (id
));
4249 input_location
= saved_loc
;
4253 /* Return an identifier for a construction vtable group. TYPE is
4254 the most derived class in the hierarchy; BINFO is the base
4255 subobject for which this construction vtable group will be used.
4257 This mangling isn't part of the ABI specification; in the ABI
4258 specification, the vtable group is dumped in the same COMDAT as the
4259 main vtable, and is referenced only from that vtable, so it doesn't
4260 need an external name. For binary formats without COMDAT sections,
4261 though, we need external names for the vtable groups.
4263 We use the production
4265 <special-name> ::= CT <type> <offset number> _ <base type> */
4268 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
4272 start_mangling (type
);
4274 write_string ("_Z");
4275 write_string ("TC");
4277 write_integer_cst (BINFO_OFFSET (binfo
));
4279 write_type (BINFO_TYPE (binfo
));
4281 result
= finish_mangling_get_identifier ();
4283 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
4284 IDENTIFIER_POINTER (result
));
4288 /* Mangle a this pointer or result pointer adjustment.
4290 <call-offset> ::= h <fixed offset number> _
4291 ::= v <fixed offset number> _ <virtual offset number> _ */
4294 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
4296 write_char (virtual_offset
? 'v' : 'h');
4298 /* For either flavor, write the fixed offset. */
4299 write_integer_cst (fixed_offset
);
4302 /* For a virtual thunk, add the virtual offset. */
4305 write_integer_cst (virtual_offset
);
4310 /* Return an identifier for the mangled name of a this-adjusting or
4311 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4312 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4313 is a virtual thunk, and it is the vtbl offset in
4314 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4315 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4316 thunk itself. A covariant thunk name always includes the adjustment
4317 for the this pointer, even if there is none.
4319 <special-name> ::= T <call-offset> <base encoding>
4320 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4324 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4325 tree virtual_offset
, tree thunk
)
4329 if (abi_version_at_least (11))
4330 maybe_check_abi_tags (fn_decl
, thunk
, 11);
4332 start_mangling (fn_decl
);
4334 write_string ("_Z");
4337 if (!this_adjusting
)
4339 /* Covariant thunk with no this adjustment */
4341 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4342 mangle_call_offset (fixed_offset
, virtual_offset
);
4344 else if (!DECL_THUNK_P (fn_decl
))
4345 /* Plain this adjusting thunk. */
4346 mangle_call_offset (fixed_offset
, virtual_offset
);
4349 /* This adjusting thunk to covariant thunk. */
4351 mangle_call_offset (fixed_offset
, virtual_offset
);
4352 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4353 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4355 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4356 mangle_call_offset (fixed_offset
, virtual_offset
);
4357 fn_decl
= THUNK_TARGET (fn_decl
);
4361 write_encoding (fn_decl
);
4363 result
= finish_mangling_get_identifier ();
4365 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4369 /* Handle ABI backwards compatibility for past bugs where we didn't call
4370 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4371 it makes a difference. If FOR_DECL is non-null, it's the declaration
4372 that we're actually trying to mangle; if it's null, we're mangling the
4373 guard variable for T. */
4376 maybe_check_abi_tags (tree t
, tree for_decl
, int ver
)
4378 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4381 tree oldtags
= get_abi_tags (t
);
4385 tree newtags
= get_abi_tags (t
);
4386 if (newtags
&& newtags
!= oldtags
4387 && abi_version_crosses (ver
))
4389 if (for_decl
&& DECL_THUNK_P (for_decl
))
4390 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4391 "the mangled name of a thunk for %qD changes between "
4392 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4393 t
, flag_abi_version
, warn_abi_version
);
4395 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4396 "the mangled name of %qD changes between "
4397 "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
4398 for_decl
, flag_abi_version
, warn_abi_version
);
4400 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4401 "the mangled name of the initialization guard variable "
4402 "for %qD changes between %<-fabi-version=%d%> and "
4403 "%<-fabi-version=%d%>",
4404 t
, flag_abi_version
, warn_abi_version
);
4408 /* Write out the appropriate string for this variable when generating
4409 another mangled name based on this one. */
4412 write_guarded_var_name (const tree variable
)
4414 if (DECL_NAME (variable
)
4415 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4416 /* The name of a guard variable for a reference temporary should refer
4417 to the reference, not the temporary. */
4418 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4420 write_name (variable
, /*ignore_local_scope=*/0);
4423 /* Return an identifier for the name of an initialization guard
4424 variable for indicated VARIABLE. */
4427 mangle_guard_variable (const tree variable
)
4429 if (abi_version_at_least (10))
4430 maybe_check_abi_tags (variable
);
4431 start_mangling (variable
);
4432 write_string ("_ZGV");
4433 write_guarded_var_name (variable
);
4434 return finish_mangling_get_identifier ();
4437 /* Return an identifier for the name of a thread_local initialization
4438 function for VARIABLE. */
4441 mangle_tls_init_fn (const tree variable
)
4443 check_abi_tags (variable
);
4444 start_mangling (variable
);
4445 write_string ("_ZTH");
4446 write_guarded_var_name (variable
);
4447 return finish_mangling_get_identifier ();
4450 /* Return an identifier for the name of a thread_local wrapper
4451 function for VARIABLE. */
4453 #define TLS_WRAPPER_PREFIX "_ZTW"
4456 mangle_tls_wrapper_fn (const tree variable
)
4458 check_abi_tags (variable
);
4459 start_mangling (variable
);
4460 write_string (TLS_WRAPPER_PREFIX
);
4461 write_guarded_var_name (variable
);
4462 return finish_mangling_get_identifier ();
4465 /* Return true iff FN is a thread_local wrapper function. */
4468 decl_tls_wrapper_p (const tree fn
)
4470 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4472 tree name
= DECL_NAME (fn
);
4473 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4474 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4477 /* Return an identifier for the name of a temporary variable used to
4478 initialize a static reference. This is now part of the ABI. */
4481 mangle_ref_init_variable (const tree variable
)
4483 start_mangling (variable
);
4484 write_string ("_ZGR");
4485 check_abi_tags (variable
);
4486 write_name (variable
, /*ignore_local_scope=*/0);
4487 /* Avoid name clashes with aggregate initialization of multiple
4488 references at once. */
4489 write_compact_number (current_ref_temp_count
++);
4490 return finish_mangling_get_identifier ();
4493 /* Return an identifier for the mangled name of a C++20 template parameter
4494 object for template argument EXPR. */
4497 mangle_template_parm_object (tree expr
)
4499 start_mangling (expr
);
4500 write_string ("_ZTAX");
4501 write_expression (expr
);
4503 return finish_mangling_get_identifier ();
4506 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4507 function generates a mangled name for the vtable map variable of
4508 the class type. For example, if the class type is
4509 "std::bad_exception", the mangled name for the class is
4510 "St13bad_exception". This function would generate the name
4511 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4512 "_VTV<std::bad_exception>::__vtable_map". */
4516 get_mangled_vtable_map_var_name (tree class_type
)
4518 char *var_name
= NULL
;
4519 const char *prefix
= "_ZN4_VTVI";
4520 const char *postfix
= "E12__vtable_mapE";
4522 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4524 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4526 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4528 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4529 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4532 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4534 strlen (postfix
) + 1;
4536 var_name
= (char *) xmalloc (len
);
4538 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4543 #include "gt-cp-mangle.h"