1 /* Name mangling for the 3.0 -*- C++ -*- ABI.
2 Copyright (C) 2000-2016 Free Software Foundation, Inc.
3 Written by Alex Samuel <samuel@codesourcery.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file implements mangling of C++ names according to the IA64
22 C++ ABI specification. A mangled name encodes a function or
23 variable's name, scope, type, and/or template arguments into a text
24 identifier. This identifier is used as the function's or
25 variable's linkage name, to preserve compatibility between C++'s
26 language features (templates, scoping, and overloading) and C
29 Additionally, g++ uses mangled names internally. To support this,
30 mangling of types is allowed, even though the mangled name of a
31 type should not appear by itself as an exported name. Ditto for
32 uninstantiated templates.
34 The primary entry point for this module is mangle_decl, which
35 returns an identifier containing the mangled name for a decl.
36 Additional entry points are provided to build mangled names of
37 particular constructs when the appropriate decl for that construct
38 is not available. These are:
40 mangle_typeinfo_for_type: typeinfo data
41 mangle_typeinfo_string_for_type: typeinfo type name
42 mangle_vtbl_for_type: virtual table data
43 mangle_vtt_for_type: VTT data
44 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
45 mangle_thunk: thunk function or entry */
49 #include "coretypes.h"
51 #include "vtable-verify.h"
53 #include "stringpool.h"
55 #include "stor-layout.h"
59 /* Debugging support. */
61 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
63 #define DEBUG_MANGLE 0
66 /* Macros for tracing the write_* functions. */
68 # define MANGLE_TRACE(FN, INPUT) \
69 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
70 # define MANGLE_TRACE_TREE(FN, NODE) \
71 fprintf (stderr, " %-24s: %-24s (%p)\n", \
72 (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE))
74 # define MANGLE_TRACE(FN, INPUT)
75 # define MANGLE_TRACE_TREE(FN, NODE)
78 /* Nonzero if NODE is a class template-id. We can't rely on
79 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
80 that hard to distinguish A<T> from A, where A<T> is the type as
81 instantiated outside of the template, and A is the type used
82 without parameters inside the template. */
83 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
84 (TYPE_LANG_SPECIFIC (NODE) != NULL \
85 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
86 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
87 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
89 /* For deciding whether to set G.need_abi_warning, we need to consider both
90 warn_abi_version and flag_abi_compat_version. */
91 #define abi_warn_or_compat_version_crosses(N) \
92 (abi_version_crosses (N) || abi_compat_version_crosses (N))
94 /* And sometimes we can simplify the code path if we don't need to worry about
96 #define abi_flag_at_least(flag,N) (flag == 0 || flag >= N)
97 #define any_abi_below(N) \
98 (!abi_version_at_least (N) \
99 || !abi_flag_at_least (warn_abi_version, (N)) \
100 || !abi_flag_at_least (flag_abi_compat_version, (N)))
102 /* Things we only need one of. This module is not reentrant. */
103 struct GTY(()) globals
{
104 /* An array of the current substitution candidates, in the order
106 vec
<tree
, va_gc
> *substitutions
;
108 /* The entity that is being mangled. */
109 tree
GTY ((skip
)) entity
;
111 /* How many parameter scopes we are inside. */
114 /* True if the mangling will be different in a future version of the
116 bool need_abi_warning
;
119 static GTY (()) globals G
;
121 /* The obstack on which we build mangled names. */
122 static struct obstack
*mangle_obstack
;
124 /* The obstack on which we build mangled names that are not going to
125 be IDENTIFIER_NODEs. */
126 static struct obstack name_obstack
;
128 /* The first object on the name_obstack; we use this to free memory
129 allocated on the name_obstack. */
130 static void *name_base
;
132 /* Indices into subst_identifiers. These are identifiers used in
133 special substitution rules. */
141 SUBID_BASIC_IOSTREAM
,
144 substitution_identifier_index_t
;
146 /* For quick substitution checks, look up these common identifiers
148 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
150 /* Single-letter codes for builtin integer types, defined in
151 <builtin-type>. These are indexed by integer_type_kind values. */
153 integer_type_codes
[itk_none
] =
156 'a', /* itk_signed_char */
157 'h', /* itk_unsigned_char */
159 't', /* itk_unsigned_short */
161 'j', /* itk_unsigned_int */
163 'm', /* itk_unsigned_long */
164 'x', /* itk_long_long */
165 'y', /* itk_unsigned_long_long */
166 /* __intN types are handled separately */
167 '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0'
170 static int decl_is_template_id (const tree
, tree
* const);
172 /* Functions for handling substitutions. */
174 static inline tree
canonicalize_for_substitution (tree
);
175 static void add_substitution (tree
);
176 static inline int is_std_substitution (const tree
,
177 const substitution_identifier_index_t
);
178 static inline int is_std_substitution_char (const tree
,
179 const substitution_identifier_index_t
);
180 static int find_substitution (tree
);
181 static void mangle_call_offset (const tree
, const tree
);
183 /* Functions for emitting mangled representations of things. */
185 static void write_mangled_name (const tree
, bool);
186 static void write_encoding (const tree
);
187 static void write_name (tree
, const int);
188 static void write_abi_tags (tree
);
189 static void write_unscoped_name (const tree
);
190 static void write_unscoped_template_name (const tree
);
191 static void write_nested_name (const tree
);
192 static void write_prefix (const tree
);
193 static void write_template_prefix (const tree
);
194 static void write_unqualified_name (tree
);
195 static void write_conversion_operator_name (const tree
);
196 static void write_source_name (tree
);
197 static void write_literal_operator_name (tree
);
198 static void write_unnamed_type_name (const tree
);
199 static void write_closure_type_name (const tree
);
200 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
202 static void write_number (unsigned HOST_WIDE_INT
, const int,
204 static void write_compact_number (int num
);
205 static void write_integer_cst (const tree
);
206 static void write_real_cst (const tree
);
207 static void write_identifier (const char *);
208 static void write_special_name_constructor (const tree
);
209 static void write_special_name_destructor (const tree
);
210 static void write_type (tree
);
211 static int write_CV_qualifiers_for_type (const tree
);
212 static void write_builtin_type (tree
);
213 static void write_function_type (const tree
);
214 static void write_bare_function_type (const tree
, const int, const tree
);
215 static void write_method_parms (tree
, const int, const tree
);
216 static void write_class_enum_type (const tree
);
217 static void write_template_args (tree
);
218 static void write_expression (tree
);
219 static void write_template_arg_literal (const tree
);
220 static void write_template_arg (tree
);
221 static void write_template_template_arg (const tree
);
222 static void write_array_type (const tree
);
223 static void write_pointer_to_member_type (const tree
);
224 static void write_template_param (const tree
);
225 static void write_template_template_param (const tree
);
226 static void write_substitution (const int);
227 static int discriminator_for_local_entity (tree
);
228 static int discriminator_for_string_literal (tree
, tree
);
229 static void write_discriminator (const int);
230 static void write_local_name (tree
, const tree
, const tree
);
231 static void dump_substitution_candidates (void);
232 static tree
mangle_decl_string (const tree
);
233 static int local_class_index (tree
);
234 static void maybe_check_abi_tags (tree
, tree
= NULL_TREE
);
235 static bool equal_abi_tags (tree
, tree
);
237 /* Control functions. */
239 static inline void start_mangling (const tree
);
240 static tree
mangle_special_for_type (const tree
, const char *);
242 /* Foreign language functions. */
244 static void write_java_integer_type_codes (const tree
);
246 /* Append a single character to the end of the mangled
248 #define write_char(CHAR) \
249 obstack_1grow (mangle_obstack, (CHAR))
251 /* Append a sized buffer to the end of the mangled representation. */
252 #define write_chars(CHAR, LEN) \
253 obstack_grow (mangle_obstack, (CHAR), (LEN))
255 /* Append a NUL-terminated string to the end of the mangled
257 #define write_string(STRING) \
258 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
260 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
261 same purpose (context, which may be a type) and value (template
262 decl). See write_template_prefix for more information on what this
264 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
265 (TREE_CODE (NODE1) == TREE_LIST \
266 && TREE_CODE (NODE2) == TREE_LIST \
267 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
268 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
269 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
270 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
272 /* Write out an unsigned quantity in base 10. */
273 #define write_unsigned_number(NUMBER) \
274 write_number ((NUMBER), /*unsigned_p=*/1, 10)
276 /* If DECL is a template instance (including the uninstantiated template
277 itself), return nonzero and, if TEMPLATE_INFO is non-NULL, set
278 *TEMPLATE_INFO to its template info. Otherwise return zero. */
281 decl_is_template_id (const tree decl
, tree
* const template_info
)
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
))
291 if (template_info
!= NULL
)
292 /* For a templated TYPE_DECL, the template info is hanging
294 *template_info
= TYPE_TEMPLATE_INFO (type
);
300 /* Check if this is a primary template. */
301 if (DECL_LANG_SPECIFIC (decl
) != NULL
302 && VAR_OR_FUNCTION_DECL_P (decl
)
303 && DECL_TEMPLATE_INFO (decl
)
304 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
305 && TREE_CODE (decl
) != TEMPLATE_DECL
)
307 if (template_info
!= NULL
)
308 /* For most templated decls, the template info is hanging
310 *template_info
= DECL_TEMPLATE_INFO (decl
);
315 /* It's not a template id. */
319 /* Produce debugging output of current substitution candidates. */
322 dump_substitution_candidates (void)
327 fprintf (stderr
, " ++ substitutions ");
328 FOR_EACH_VEC_ELT (*G
.substitutions
, i
, el
)
330 const char *name
= "???";
333 fprintf (stderr
, " ");
335 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
336 else if (TREE_CODE (el
) == TREE_LIST
)
337 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
338 else if (TYPE_NAME (el
))
339 name
= TYPE_NAME_STRING (el
);
340 fprintf (stderr
, " S%d_ = ", i
- 1);
342 (CP_TYPE_RESTRICT_P (el
)
343 || CP_TYPE_VOLATILE_P (el
)
344 || CP_TYPE_CONST_P (el
)))
345 fprintf (stderr
, "CV-");
346 fprintf (stderr
, "%s (%s at %p)\n",
347 name
, get_tree_code_name (TREE_CODE (el
)), (void *) el
);
351 /* Both decls and types can be substitution candidates, but sometimes
352 they refer to the same thing. For instance, a TYPE_DECL and
353 RECORD_TYPE for the same class refer to the same thing, and should
354 be treated accordingly in substitutions. This function returns a
355 canonicalized tree node representing NODE that is used when adding
356 and substitution candidates and finding matches. */
359 canonicalize_for_substitution (tree node
)
361 /* For a TYPE_DECL, use the type instead. */
362 if (TREE_CODE (node
) == TYPE_DECL
)
363 node
= TREE_TYPE (node
);
365 && TYPE_CANONICAL (node
) != node
366 && TYPE_MAIN_VARIANT (node
) != node
)
369 /* Here we want to strip the topmost typedef only.
370 We need to do that so is_std_substitution can do proper
372 if (TREE_CODE (node
) == FUNCTION_TYPE
)
373 /* Use build_qualified_type and TYPE_QUALS here to preserve
374 the old buggy mangling of attribute noreturn with abi<5. */
375 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
378 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
379 cp_type_quals (node
));
380 if (TREE_CODE (node
) == FUNCTION_TYPE
381 || TREE_CODE (node
) == METHOD_TYPE
)
382 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
387 /* Add NODE as a substitution candidate. NODE must not already be on
388 the list of candidates. */
391 add_substitution (tree node
)
396 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
397 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
399 /* Get the canonicalized substitution candidate for NODE. */
400 c
= canonicalize_for_substitution (node
);
401 if (DEBUG_MANGLE
&& c
!= node
)
402 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
403 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
406 /* Make sure NODE isn't already a candidate. */
412 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
414 gcc_assert (!(DECL_P (node
) && node
== candidate
));
415 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
416 && same_type_p (node
, candidate
)));
420 /* Put the decl onto the varray of substitution candidates. */
421 vec_safe_push (G
.substitutions
, node
);
424 dump_substitution_candidates ();
427 /* Helper function for find_substitution. Returns nonzero if NODE,
428 which may be a decl or a CLASS_TYPE, is a template-id with template
429 name of substitution_index[INDEX] in the ::std namespace. */
432 is_std_substitution (const tree node
,
433 const substitution_identifier_index_t index
)
440 type
= TREE_TYPE (node
);
443 else if (CLASS_TYPE_P (node
))
446 decl
= TYPE_NAME (node
);
449 /* These are not the droids you're looking for. */
452 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
453 && TYPE_LANG_SPECIFIC (type
)
454 && TYPE_TEMPLATE_INFO (type
)
455 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
456 == subst_identifiers
[index
]));
459 /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
460 which can be a decl or type. */
463 get_abi_tags (tree t
)
465 if (!t
|| TREE_CODE (t
) == NAMESPACE_DECL
)
468 if (DECL_P (t
) && DECL_DECLARES_TYPE_P (t
))
473 attrs
= TYPE_ATTRIBUTES (t
);
475 attrs
= DECL_ATTRIBUTES (t
);
477 tree tags
= lookup_attribute ("abi_tag", attrs
);
479 tags
= TREE_VALUE (tags
);
483 /* Helper function for find_substitution. Returns nonzero if NODE,
484 which may be a decl or a CLASS_TYPE, is the template-id
485 ::std::identifier<char>, where identifier is
486 substitution_index[INDEX]. */
489 is_std_substitution_char (const tree node
,
490 const substitution_identifier_index_t index
)
493 /* Check NODE's name is ::std::identifier. */
494 if (!is_std_substitution (node
, index
))
496 /* Figure out its template args. */
498 args
= DECL_TI_ARGS (node
);
499 else if (CLASS_TYPE_P (node
))
500 args
= CLASSTYPE_TI_ARGS (node
);
502 /* Oops, not a template. */
504 /* NODE's template arg list should be <char>. */
506 TREE_VEC_LENGTH (args
) == 1
507 && TREE_VEC_ELT (args
, 0) == char_type_node
;
510 /* Check whether a substitution should be used to represent NODE in
513 First, check standard special-case substitutions.
515 <substitution> ::= St
522 # ::std::basic_string
525 # ::std::basic_string<char,
526 ::std::char_traits<char>,
527 ::std::allocator<char> >
530 # ::std::basic_istream<char, ::std::char_traits<char> >
533 # ::std::basic_ostream<char, ::std::char_traits<char> >
536 # ::std::basic_iostream<char, ::std::char_traits<char> >
538 Then examine the stack of currently available substitution
539 candidates for entities appearing earlier in the same mangling
541 If a substitution is found, write its mangled representation and
542 return nonzero. If none is found, just return zero. */
545 find_substitution (tree node
)
548 const int size
= vec_safe_length (G
.substitutions
);
551 const char *abbr
= NULL
;
554 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
555 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
557 /* Obtain the canonicalized substitution representation for NODE.
558 This is what we'll compare against. */
559 node
= canonicalize_for_substitution (node
);
561 /* Check for builtin substitutions. */
563 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
564 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
566 /* Check for std::allocator. */
568 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
569 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
572 /* Check for std::basic_string. */
573 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
577 /* If this is a type (i.e. a fully-qualified template-id),
579 std::basic_string <char,
580 std::char_traits<char>,
581 std::allocator<char> > . */
582 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
583 && CLASSTYPE_USE_TEMPLATE (type
))
585 tree args
= CLASSTYPE_TI_ARGS (type
);
586 if (TREE_VEC_LENGTH (args
) == 3
587 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
588 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
590 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
596 /* Substitute for the template name only if this isn't a type. */
600 /* Check for basic_{i,o,io}stream. */
601 else if (TYPE_P (node
)
602 && cp_type_quals (type
) == TYPE_UNQUALIFIED
603 && CLASS_TYPE_P (type
)
604 && CLASSTYPE_USE_TEMPLATE (type
)
605 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
607 /* First, check for the template
608 args <char, std::char_traits<char> > . */
609 tree args
= CLASSTYPE_TI_ARGS (type
);
610 if (TREE_VEC_LENGTH (args
) == 2
611 && TYPE_P (TREE_VEC_ELT (args
, 0))
612 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
613 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
616 /* Got them. Is this basic_istream? */
617 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
619 /* Or basic_ostream? */
620 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
622 /* Or basic_iostream? */
623 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
628 /* Check for namespace std. */
629 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
635 tree tags
= NULL_TREE
;
636 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
637 tags
= get_abi_tags (type
);
638 /* Now check the list of available substitutions for this mangling
640 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
642 tree candidate
= (*G
.substitutions
)[i
];
643 /* NODE is a matched to a candidate if it's the same decl node or
644 if it's the same type. */
645 if (decl
== candidate
646 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
647 && same_type_p (type
, candidate
))
648 || NESTED_TEMPLATE_MATCH (node
, candidate
))
650 write_substitution (i
);
656 /* No substitution found. */
662 /* If there are ABI tags on the abbreviation, it becomes
663 a substitution candidate. */
664 write_abi_tags (tags
);
665 add_substitution (node
);
670 /* Returns whether DECL's symbol name should be the plain unqualified-id
671 rather than a more complicated mangled name. */
674 unmangled_name_p (const tree decl
)
676 if (TREE_CODE (decl
) == FUNCTION_DECL
)
678 /* The names of `extern "C"' functions are not mangled. */
679 return (DECL_EXTERN_C_FUNCTION_P (decl
)
680 /* But overloaded operator names *are* mangled. */
681 && !DECL_OVERLOADED_OPERATOR_P (decl
));
683 else if (VAR_P (decl
))
685 /* static variables are mangled. */
686 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
689 /* extern "C" declarations aren't mangled. */
690 if (DECL_EXTERN_C_P (decl
))
693 /* Other variables at non-global scope are mangled. */
694 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
697 /* Variable template instantiations are mangled. */
698 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
699 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
702 /* Declarations with ABI tags are mangled. */
703 if (get_abi_tags (decl
))
706 /* The names of non-static global variables aren't mangled. */
713 /* TOP_LEVEL is true, if this is being called at outermost level of
714 mangling. It should be false when mangling a decl appearing in an
715 expression within some other mangling.
717 <mangled-name> ::= _Z <encoding> */
720 write_mangled_name (const tree decl
, bool top_level
)
722 MANGLE_TRACE_TREE ("mangled-name", decl
);
724 check_abi_tags (decl
);
726 if (unmangled_name_p (decl
))
729 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
732 /* The standard notes: "The <encoding> of an extern "C"
733 function is treated like global-scope data, i.e. as its
734 <source-name> without a type." We cannot write
735 overloaded operators that way though, because it contains
736 characters invalid in assembler. */
738 write_source_name (DECL_NAME (decl
));
744 write_encoding (decl
);
748 /* Returns true if the return type of DECL is part of its signature, and
749 therefore its mangling. */
752 mangle_return_type_p (tree decl
)
754 return (!DECL_CONSTRUCTOR_P (decl
)
755 && !DECL_DESTRUCTOR_P (decl
)
756 && !DECL_CONV_FN_P (decl
)
757 && decl_is_template_id (decl
, NULL
));
760 /* <encoding> ::= <function name> <bare-function-type>
764 write_encoding (const tree decl
)
766 MANGLE_TRACE_TREE ("encoding", decl
);
768 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
770 /* For overloaded operators write just the mangled name
771 without arguments. */
772 if (DECL_OVERLOADED_OPERATOR_P (decl
))
773 write_name (decl
, /*ignore_local_scope=*/0);
775 write_source_name (DECL_NAME (decl
));
779 write_name (decl
, /*ignore_local_scope=*/0);
780 if (TREE_CODE (decl
) == FUNCTION_DECL
)
785 if (decl_is_template_id (decl
, NULL
))
787 fn_type
= get_mostly_instantiated_function_type (decl
);
788 /* FN_TYPE will not have parameter types for in-charge or
789 VTT parameters. Therefore, we pass NULL_TREE to
790 write_bare_function_type -- otherwise, it will get
791 confused about which artificial parameters to skip. */
796 fn_type
= TREE_TYPE (decl
);
800 write_bare_function_type (fn_type
,
801 mangle_return_type_p (decl
),
806 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
807 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
810 decl_mangling_context (tree decl
)
812 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
814 if (tcontext
!= NULL_TREE
)
817 if (TREE_CODE (decl
) == TEMPLATE_DECL
818 && DECL_TEMPLATE_RESULT (decl
))
819 decl
= DECL_TEMPLATE_RESULT (decl
);
821 if (TREE_CODE (decl
) == TYPE_DECL
822 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
824 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
828 else if (template_type_parameter_p (decl
))
829 /* template type parms have no mangling context. */
831 return CP_DECL_CONTEXT (decl
);
834 /* <name> ::= <unscoped-name>
835 ::= <unscoped-template-name> <template-args>
839 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
840 called from <local-name>, which mangles the enclosing scope
841 elsewhere and then uses this function to mangle just the part
842 underneath the function scope. So don't use the <local-name>
843 production, to avoid an infinite recursion. */
846 write_name (tree decl
, const int ignore_local_scope
)
850 MANGLE_TRACE_TREE ("name", decl
);
852 if (TREE_CODE (decl
) == TYPE_DECL
)
854 /* In case this is a typedef, fish out the corresponding
855 TYPE_DECL for the main variant. */
856 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
859 context
= decl_mangling_context (decl
);
861 gcc_assert (context
!= NULL_TREE
);
863 if (abi_warn_or_compat_version_crosses (7)
864 && ignore_local_scope
865 && TREE_CODE (context
) == PARM_DECL
)
866 G
.need_abi_warning
= 1;
868 /* A decl in :: or ::std scope is treated specially. The former is
869 mangled using <unscoped-name> or <unscoped-template-name>, the
870 latter with a special substitution. Also, a name that is
871 directly in a local function scope is also mangled with
872 <unscoped-name> rather than a full <nested-name>. */
873 if (context
== global_namespace
874 || DECL_NAMESPACE_STD_P (context
)
875 || (ignore_local_scope
876 && (TREE_CODE (context
) == FUNCTION_DECL
877 || (abi_version_at_least (7)
878 && TREE_CODE (context
) == PARM_DECL
))))
881 /* Is this a template instance? */
882 if (decl_is_template_id (decl
, &template_info
))
884 /* Yes: use <unscoped-template-name>. */
885 write_unscoped_template_name (TI_TEMPLATE (template_info
));
886 write_template_args (TI_ARGS (template_info
));
889 /* Everything else gets an <unqualified-name>. */
890 write_unscoped_name (decl
);
894 /* Handle local names, unless we asked not to (that is, invoked
895 under <local-name>, to handle only the part of the name under
897 if (!ignore_local_scope
)
899 /* Scan up the list of scope context, looking for a
900 function. If we find one, this entity is in local
901 function scope. local_entity tracks context one scope
902 level down, so it will contain the element that's
903 directly in that function's scope, either decl or one of
904 its enclosing scopes. */
905 tree local_entity
= decl
;
906 while (context
!= global_namespace
)
908 /* Make sure we're always dealing with decls. */
909 if (TYPE_P (context
))
910 context
= TYPE_NAME (context
);
911 /* Is this a function? */
912 if (TREE_CODE (context
) == FUNCTION_DECL
913 || TREE_CODE (context
) == PARM_DECL
)
915 /* Yes, we have local scope. Use the <local-name>
916 production for the innermost function scope. */
917 write_local_name (context
, local_entity
, decl
);
920 /* Up one scope level. */
921 local_entity
= context
;
922 context
= decl_mangling_context (context
);
925 /* No local scope found? Fall through to <nested-name>. */
928 /* Other decls get a <nested-name> to encode their scope. */
929 write_nested_name (decl
);
933 /* <unscoped-name> ::= <unqualified-name>
934 ::= St <unqualified-name> # ::std:: */
937 write_unscoped_name (const tree decl
)
939 tree context
= decl_mangling_context (decl
);
941 MANGLE_TRACE_TREE ("unscoped-name", decl
);
943 /* Is DECL in ::std? */
944 if (DECL_NAMESPACE_STD_P (context
))
947 write_unqualified_name (decl
);
951 /* If not, it should be either in the global namespace, or directly
952 in a local function scope. A lambda can also be mangled in the
953 scope of a default argument. */
954 gcc_assert (context
== global_namespace
955 || TREE_CODE (context
) == PARM_DECL
956 || TREE_CODE (context
) == FUNCTION_DECL
);
958 write_unqualified_name (decl
);
962 /* <unscoped-template-name> ::= <unscoped-name>
963 ::= <substitution> */
966 write_unscoped_template_name (const tree decl
)
968 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
970 if (find_substitution (decl
))
972 write_unscoped_name (decl
);
973 add_substitution (decl
);
976 /* Write the nested name, including CV-qualifiers, of DECL.
978 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
979 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
981 <ref-qualifier> ::= R # & ref-qualifier
982 ::= O # && ref-qualifier
983 <CV-qualifiers> ::= [r] [V] [K] */
986 write_nested_name (const tree decl
)
990 MANGLE_TRACE_TREE ("nested-name", decl
);
994 /* Write CV-qualifiers, if this is a member function. */
995 if (TREE_CODE (decl
) == FUNCTION_DECL
996 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
998 if (DECL_VOLATILE_MEMFUNC_P (decl
))
1000 if (DECL_CONST_MEMFUNC_P (decl
))
1002 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
1004 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
1011 /* Is this a template instance? */
1012 if (decl_is_template_id (decl
, &template_info
))
1014 /* Yes, use <template-prefix>. */
1015 write_template_prefix (decl
);
1016 write_template_args (TI_ARGS (template_info
));
1018 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
1019 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1021 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1022 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1024 write_template_prefix (decl
);
1025 write_template_args (TREE_OPERAND (name
, 1));
1029 write_prefix (decl_mangling_context (decl
));
1030 write_unqualified_name (decl
);
1035 /* No, just use <prefix> */
1036 write_prefix (decl_mangling_context (decl
));
1037 write_unqualified_name (decl
);
1042 /* <prefix> ::= <prefix> <unqualified-name>
1043 ::= <template-param>
1044 ::= <template-prefix> <template-args>
1047 ::= <substitution> */
1050 write_prefix (const tree node
)
1053 /* Non-NULL if NODE represents a template-id. */
1054 tree template_info
= NULL
;
1057 || node
== global_namespace
)
1060 MANGLE_TRACE_TREE ("prefix", node
);
1062 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1068 if (find_substitution (node
))
1073 /* If this is a function or parm decl, that means we've hit function
1074 scope, so this prefix must be for a local name. In this
1075 case, we're under the <local-name> production, which encodes
1076 the enclosing function scope elsewhere. So don't continue
1078 if (TREE_CODE (node
) == FUNCTION_DECL
1079 || TREE_CODE (node
) == PARM_DECL
)
1083 decl_is_template_id (decl
, &template_info
);
1087 /* Node is a type. */
1088 decl
= TYPE_NAME (node
);
1089 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1090 template_info
= TYPE_TEMPLATE_INFO (node
);
1093 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1094 write_template_param (node
);
1095 else if (template_info
!= NULL
)
1098 write_template_prefix (decl
);
1099 write_template_args (TI_ARGS (template_info
));
1101 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1103 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1104 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1106 write_template_prefix (decl
);
1107 write_template_args (TREE_OPERAND (name
, 1));
1111 write_prefix (decl_mangling_context (decl
));
1112 write_unqualified_name (decl
);
1116 /* Not templated. */
1118 write_prefix (decl_mangling_context (decl
));
1119 write_unqualified_name (decl
);
1121 || TREE_CODE (decl
) == FIELD_DECL
)
1123 /* <data-member-prefix> := <member source-name> M */
1129 add_substitution (node
);
1132 /* <template-prefix> ::= <prefix> <template component>
1133 ::= <template-param>
1134 ::= <substitution> */
1137 write_template_prefix (const tree node
)
1139 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1140 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1141 tree context
= decl_mangling_context (decl
);
1146 MANGLE_TRACE_TREE ("template-prefix", node
);
1148 /* Find the template decl. */
1149 if (decl_is_template_id (decl
, &template_info
))
1150 templ
= TI_TEMPLATE (template_info
);
1151 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1152 /* For a typename type, all we have is the name. */
1153 templ
= DECL_NAME (decl
);
1156 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1158 templ
= TYPE_TI_TEMPLATE (type
);
1161 /* For a member template, though, the template name for the
1162 innermost name must have all the outer template levels
1163 instantiated. For instance, consider
1165 template<typename T> struct Outer {
1166 template<typename U> struct Inner {};
1169 The template name for `Inner' in `Outer<int>::Inner<float>' is
1170 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1171 levels separately, so there's no TEMPLATE_DECL available for this
1172 (there's only `Outer<T>::Inner<U>').
1174 In order to get the substitutions right, we create a special
1175 TREE_LIST to represent the substitution candidate for a nested
1176 template. The TREE_PURPOSE is the template's context, fully
1177 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1180 So, for the example above, `Outer<int>::Inner' is represented as a
1181 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1182 and whose value is `Outer<T>::Inner<U>'. */
1183 if (context
&& TYPE_P (context
))
1184 substitution
= build_tree_list (context
, templ
);
1186 substitution
= templ
;
1188 if (find_substitution (substitution
))
1191 if (TREE_TYPE (templ
)
1192 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1193 write_template_param (TREE_TYPE (templ
));
1196 write_prefix (context
);
1197 write_unqualified_name (decl
);
1200 add_substitution (substitution
);
1203 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1204 mangled through special entry points.
1206 <unqualified-name> ::= <operator-name>
1209 ::= <unnamed-type-name>
1210 ::= <local-source-name>
1212 <local-source-name> ::= L <source-name> <discriminator> */
1215 write_unqualified_id (tree identifier
)
1217 if (IDENTIFIER_TYPENAME_P (identifier
))
1218 write_conversion_operator_name (TREE_TYPE (identifier
));
1219 else if (IDENTIFIER_OPNAME_P (identifier
))
1222 const char *mangled_name
= NULL
;
1224 /* Unfortunately, there is no easy way to go from the
1225 name of the operator back to the corresponding tree
1227 for (i
= 0; i
< MAX_TREE_CODES
; ++i
)
1228 if (operator_name_info
[i
].identifier
== identifier
)
1230 /* The ABI says that we prefer binary operator
1231 names to unary operator names. */
1232 if (operator_name_info
[i
].arity
== 2)
1234 mangled_name
= operator_name_info
[i
].mangled_name
;
1237 else if (!mangled_name
)
1238 mangled_name
= operator_name_info
[i
].mangled_name
;
1240 else if (assignment_operator_name_info
[i
].identifier
1244 = assignment_operator_name_info
[i
].mangled_name
;
1247 write_string (mangled_name
);
1249 else if (UDLIT_OPER_P (identifier
))
1250 write_literal_operator_name (identifier
);
1252 write_source_name (identifier
);
1256 write_unqualified_name (tree decl
)
1258 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1260 if (identifier_p (decl
))
1262 write_unqualified_id (decl
);
1268 if (DECL_NAME (decl
) == NULL_TREE
)
1271 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1272 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1274 else if (DECL_DECLARES_FUNCTION_P (decl
))
1277 if (DECL_CONSTRUCTOR_P (decl
))
1278 write_special_name_constructor (decl
);
1279 else if (DECL_DESTRUCTOR_P (decl
))
1280 write_special_name_destructor (decl
);
1281 else if (DECL_CONV_FN_P (decl
))
1283 /* Conversion operator. Handle it right here.
1284 <operator> ::= cv <type> */
1286 if (decl_is_template_id (decl
, NULL
))
1289 fn_type
= get_mostly_instantiated_function_type (decl
);
1290 type
= TREE_TYPE (fn_type
);
1292 else if (FNDECL_USED_AUTO (decl
))
1293 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1294 ->x_auto_return_pattern
);
1296 type
= DECL_CONV_FN_TYPE (decl
);
1297 write_conversion_operator_name (type
);
1299 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1301 operator_name_info_t
*oni
;
1302 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1303 oni
= assignment_operator_name_info
;
1305 oni
= operator_name_info
;
1307 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1309 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1310 write_literal_operator_name (DECL_NAME (decl
));
1317 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1318 && DECL_NAMESPACE_SCOPE_P (decl
)
1319 && decl_linkage (decl
) == lk_internal
)
1321 MANGLE_TRACE_TREE ("local-source-name", decl
);
1323 write_source_name (DECL_NAME (decl
));
1324 /* The default discriminator is 1, and that's all we ever use,
1325 so there's no code to output one here. */
1329 tree type
= TREE_TYPE (decl
);
1331 if (TREE_CODE (decl
) == TYPE_DECL
1332 && TYPE_UNNAMED_P (type
))
1333 write_unnamed_type_name (type
);
1334 else if (TREE_CODE (decl
) == TYPE_DECL
1335 && LAMBDA_TYPE_P (type
))
1336 write_closure_type_name (type
);
1338 write_source_name (DECL_NAME (decl
));
1341 /* We use the ABI tags from the primary class template, ignoring tags on any
1342 specializations. This is necessary because C++ doesn't require a
1343 specialization to be declared before it is used unless the use requires a
1344 complete type, but we need to get the tags right on incomplete types as
1346 if (tree tmpl
= most_general_template (decl
))
1348 tree res
= DECL_TEMPLATE_RESULT (tmpl
);
1349 if (res
== NULL_TREE
)
1350 /* UNBOUND_CLASS_TEMPLATE. */;
1351 else if (DECL_DECLARES_TYPE_P (decl
))
1353 else if (any_abi_below (11))
1355 /* ABI v10 implicit tags on the template. */
1356 tree mtags
= missing_abi_tags (res
);
1357 /* Explicit tags on the template. */
1358 tree ttags
= get_abi_tags (res
);
1359 /* Tags on the instantiation. */
1360 tree dtags
= get_abi_tags (decl
);
1362 if (mtags
&& abi_warn_or_compat_version_crosses (10))
1363 G
.need_abi_warning
= 1;
1365 /* Add the v10 tags to the explicit tags now. */
1366 mtags
= chainon (mtags
, ttags
);
1368 if (!G
.need_abi_warning
1369 && abi_warn_or_compat_version_crosses (11)
1370 && !equal_abi_tags (dtags
, mtags
))
1371 G
.need_abi_warning
= 1;
1373 if (!abi_version_at_least (10))
1374 /* In abi <10, we only got the explicit tags. */
1376 else if (flag_abi_version
== 10)
1378 /* In ABI 10, we want explict and implicit tags. */
1379 write_abi_tags (mtags
);
1385 tree tags
= get_abi_tags (decl
);
1386 write_abi_tags (tags
);
1389 /* Write the unqualified-name for a conversion operator to TYPE. */
1392 write_conversion_operator_name (const tree type
)
1394 write_string ("cv");
1398 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1400 <source-name> ::= </length/ number> <identifier> */
1403 write_source_name (tree identifier
)
1405 MANGLE_TRACE_TREE ("source-name", identifier
);
1407 /* Never write the whole template-id name including the template
1408 arguments; we only want the template name. */
1409 if (IDENTIFIER_TEMPLATE (identifier
))
1410 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1412 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1413 write_identifier (IDENTIFIER_POINTER (identifier
));
1416 /* Compare two TREE_STRINGs like strcmp. */
1419 tree_string_cmp (const void *p1
, const void *p2
)
1423 tree s1
= *(const tree
*)p1
;
1424 tree s2
= *(const tree
*)p2
;
1425 return strcmp (TREE_STRING_POINTER (s1
),
1426 TREE_STRING_POINTER (s2
));
1429 /* Return the TREE_LIST of TAGS as a sorted VEC. */
1431 static vec
<tree
, va_gc
> *
1432 sorted_abi_tags (tree tags
)
1434 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1436 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1438 if (ABI_TAG_IMPLICIT (t
))
1440 tree str
= TREE_VALUE (t
);
1441 vec_safe_push (vec
, str
);
1444 vec
->qsort (tree_string_cmp
);
1449 /* ID is the name of a function or type with abi_tags attribute TAGS.
1450 Write out the name, suitably decorated. */
1453 write_abi_tags (tree tags
)
1455 if (tags
== NULL_TREE
)
1458 vec
<tree
, va_gc
> * vec
= sorted_abi_tags (tags
);
1460 unsigned i
; tree str
;
1461 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1464 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1465 write_identifier (TREE_STRING_POINTER (str
));
1468 release_tree_vector (vec
);
1471 /* Simplified unique_ptr clone to release a tree vec on exit. */
1473 struct releasing_vec
1475 typedef vec
<tree
, va_gc
> vec_t
;
1477 releasing_vec (vec_t
*v
): v(v
) { }
1478 releasing_vec (): v(make_tree_vector ()) { }
1480 vec_t
&operator* () const { return *v
; }
1481 vec_t
*operator-> () const { return v
; }
1482 vec_t
*get () const { return v
; }
1483 operator vec_t
*() const { return v
; }
1484 tree
& operator[] (unsigned i
) const { return (*v
)[i
]; }
1486 ~releasing_vec() { release_tree_vector (v
); }
1491 /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1494 equal_abi_tags (tree t1
, tree t2
)
1496 releasing_vec v1
= sorted_abi_tags (t1
);
1497 releasing_vec v2
= sorted_abi_tags (t2
);
1499 unsigned len1
= v1
->length();
1500 if (len1
!= v2
->length())
1502 for (unsigned i
= 0; i
< len1
; ++i
)
1503 if (tree_string_cmp (v1
[i
], v2
[i
]) != 0)
1508 /* Write a user-defined literal operator.
1509 ::= li <source-name> # "" <source-name>
1510 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1513 write_literal_operator_name (tree identifier
)
1515 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1516 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1517 write_unsigned_number (strlen (suffix
));
1518 write_identifier (suffix
);
1521 /* Encode 0 as _, and 1+ as n-1_. */
1524 write_compact_number (int num
)
1527 write_unsigned_number (num
- 1);
1531 /* Return how many unnamed types precede TYPE in its enclosing class. */
1534 nested_anon_class_index (tree type
)
1537 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1538 for (; member
; member
= DECL_CHAIN (member
))
1539 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1541 tree memtype
= TREE_TYPE (member
);
1542 if (memtype
== type
)
1544 else if (TYPE_UNNAMED_P (memtype
))
1551 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1554 write_unnamed_type_name (const tree type
)
1557 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1559 if (TYPE_FUNCTION_SCOPE_P (type
))
1560 discriminator
= local_class_index (type
);
1561 else if (TYPE_CLASS_SCOPE_P (type
))
1562 discriminator
= nested_anon_class_index (type
);
1565 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1566 /* Just use the old mangling at namespace scope. */
1567 write_source_name (TYPE_IDENTIFIER (type
));
1571 write_string ("Ut");
1572 write_compact_number (discriminator
);
1575 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1576 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1579 write_closure_type_name (const tree type
)
1581 tree fn
= lambda_function (type
);
1582 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1583 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1585 MANGLE_TRACE_TREE ("closure-type-name", type
);
1587 write_string ("Ul");
1588 write_method_parms (parms
, /*method_p=*/1, fn
);
1590 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1593 /* Convert NUMBER to ascii using base BASE and generating at least
1594 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1595 into which to store the characters. Returns the number of
1596 characters generated (these will be laid out in advance of where
1600 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1601 char *buffer
, const unsigned int min_digits
)
1603 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1604 unsigned digits
= 0;
1608 unsigned HOST_WIDE_INT d
= number
/ base
;
1610 *--buffer
= base_digits
[number
- d
* base
];
1614 while (digits
< min_digits
)
1616 *--buffer
= base_digits
[0];
1622 /* Non-terminal <number>.
1624 <number> ::= [n] </decimal integer/> */
1627 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1628 const unsigned int base
)
1630 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1633 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1636 number
= -((HOST_WIDE_INT
) number
);
1638 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1639 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1642 /* Write out an integral CST in decimal. Most numbers are small, and
1643 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1644 bigger than that, which we must deal with. */
1647 write_integer_cst (const tree cst
)
1649 int sign
= tree_int_cst_sgn (cst
);
1650 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1651 if (!wi::fits_uhwi_p (abs_value
))
1653 /* A bignum. We do this in chunks, each of which fits in a
1655 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1656 unsigned HOST_WIDE_INT chunk
;
1657 unsigned chunk_digits
;
1658 char *ptr
= buffer
+ sizeof (buffer
);
1663 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1668 if (sizeof (HOST_WIDE_INT
) >= 8)
1670 /* It is at least 64 bits, so 10^18 is representable. */
1675 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1676 base
= build_int_cstu (type
, chunk
);
1677 n
= wide_int_to_tree (type
, cst
);
1682 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1686 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1687 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1690 done
= integer_zerop (d
);
1691 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1692 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1693 done
? 1 : chunk_digits
);
1699 write_chars (ptr
, count
);
1706 write_unsigned_number (abs_value
.to_uhwi ());
1710 /* Write out a floating-point literal.
1712 "Floating-point literals are encoded using the bit pattern of the
1713 target processor's internal representation of that number, as a
1714 fixed-length lowercase hexadecimal string, high-order bytes first
1715 (even if the target processor would store low-order bytes first).
1716 The "n" prefix is not used for floating-point literals; the sign
1717 bit is encoded with the rest of the number.
1719 Here are some examples, assuming the IEEE standard representation
1720 for floating point numbers. (Spaces are for readability, not
1721 part of the encoding.)
1724 -1.0f Lf bf80 0000 E
1725 1.17549435e-38f Lf 0080 0000 E
1726 1.40129846e-45f Lf 0000 0001 E
1727 0.0f Lf 0000 0000 E"
1729 Caller is responsible for the Lx and the E. */
1731 write_real_cst (const tree value
)
1733 long target_real
[4]; /* largest supported float */
1734 char buffer
[9]; /* eight hex digits in a 32-bit number */
1737 tree type
= TREE_TYPE (value
);
1738 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1740 real_to_target (target_real
, &TREE_REAL_CST (value
),
1743 /* The value in target_real is in the target word order,
1744 so we must write it out backward if that happens to be
1745 little-endian. write_number cannot be used, it will
1746 produce uppercase. */
1747 if (FLOAT_WORDS_BIG_ENDIAN
)
1748 i
= 0, limit
= words
, dir
= 1;
1750 i
= words
- 1, limit
= -1, dir
= -1;
1752 for (; i
!= limit
; i
+= dir
)
1754 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1755 write_chars (buffer
, 8);
1759 /* Non-terminal <identifier>.
1761 <identifier> ::= </unqualified source code identifier> */
1764 write_identifier (const char *identifier
)
1766 MANGLE_TRACE ("identifier", identifier
);
1767 write_string (identifier
);
1770 /* Handle constructor productions of non-terminal <special-name>.
1771 CTOR is a constructor FUNCTION_DECL.
1773 <special-name> ::= C1 # complete object constructor
1774 ::= C2 # base object constructor
1775 ::= C3 # complete object allocating constructor
1777 Currently, allocating constructors are never used. */
1780 write_special_name_constructor (const tree ctor
)
1782 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1783 write_string ("C2");
1784 /* This is the old-style "[unified]" constructor.
1785 In some cases, we may emit this function and call
1786 it from the clones in order to share code and save space. */
1787 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1788 write_string ("C4");
1791 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1792 write_string ("C1");
1796 /* Handle destructor productions of non-terminal <special-name>.
1797 DTOR is a destructor FUNCTION_DECL.
1799 <special-name> ::= D0 # deleting (in-charge) destructor
1800 ::= D1 # complete object (in-charge) destructor
1801 ::= D2 # base object (not-in-charge) destructor */
1804 write_special_name_destructor (const tree dtor
)
1806 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1807 write_string ("D0");
1808 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1809 write_string ("D2");
1810 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1811 /* This is the old-style "[unified]" destructor.
1812 In some cases, we may emit this function and call
1813 it from the clones in order to share code and save space. */
1814 write_string ("D4");
1817 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1818 write_string ("D1");
1822 /* Scan the vector of local classes and return how many others with the
1823 same name (or same no name) and context precede ENTITY. */
1826 local_class_index (tree entity
)
1828 int ix
, discriminator
= 0;
1829 tree name
= (TYPE_UNNAMED_P (entity
) ? NULL_TREE
1830 : TYPE_IDENTIFIER (entity
));
1831 tree ctx
= TYPE_CONTEXT (entity
);
1832 for (ix
= 0; ; ix
++)
1834 tree type
= (*local_classes
)[ix
];
1836 return discriminator
;
1837 if (TYPE_CONTEXT (type
) == ctx
1838 && (name
? TYPE_IDENTIFIER (type
) == name
1839 : TYPE_UNNAMED_P (type
)))
1845 /* Return the discriminator for ENTITY appearing inside
1846 FUNCTION. The discriminator is the lexical ordinal of VAR among
1847 entities with the same name in the same FUNCTION. */
1850 discriminator_for_local_entity (tree entity
)
1852 if (DECL_DISCRIMINATOR_P (entity
))
1854 if (DECL_DISCRIMINATOR_SET_P (entity
))
1855 return DECL_DISCRIMINATOR (entity
);
1857 /* The first entity with a particular name doesn't get
1858 DECL_DISCRIMINATOR set up. */
1861 else if (TREE_CODE (entity
) == TYPE_DECL
)
1863 /* Scan the list of local classes. */
1864 entity
= TREE_TYPE (entity
);
1866 /* Lambdas and unnamed types have their own discriminators. */
1867 if (LAMBDA_TYPE_P (entity
) || TYPE_UNNAMED_P (entity
))
1870 return local_class_index (entity
);
1876 /* Return the discriminator for STRING, a string literal used inside
1877 FUNCTION. The discriminator is the lexical ordinal of STRING among
1878 string literals used in FUNCTION. */
1881 discriminator_for_string_literal (tree
/*function*/,
1884 /* For now, we don't discriminate amongst string literals. */
1888 /* <discriminator> := _ <number>
1890 The discriminator is used only for the second and later occurrences
1891 of the same name within a single function. In this case <number> is
1892 n - 2, if this is the nth occurrence, in lexical order. */
1895 write_discriminator (const int discriminator
)
1897 /* If discriminator is zero, don't write anything. Otherwise... */
1898 if (discriminator
> 0)
1901 write_unsigned_number (discriminator
- 1);
1905 /* Mangle the name of a function-scope entity. FUNCTION is the
1906 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1907 default argument scope. ENTITY is the decl for the entity itself.
1908 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1909 either ENTITY itself or an enclosing scope of ENTITY.
1911 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1912 := Z <function encoding> E s [<discriminator>]
1913 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1916 write_local_name (tree function
, const tree local_entity
,
1919 tree parm
= NULL_TREE
;
1921 MANGLE_TRACE_TREE ("local-name", entity
);
1923 if (TREE_CODE (function
) == PARM_DECL
)
1926 function
= DECL_CONTEXT (parm
);
1930 write_encoding (function
);
1933 /* For this purpose, parameters are numbered from right-to-left. */
1938 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1946 write_compact_number (i
- 1);
1949 if (TREE_CODE (entity
) == STRING_CST
)
1952 write_discriminator (discriminator_for_string_literal (function
,
1957 /* Now the <entity name>. Let write_name know its being called
1958 from <local-name>, so it doesn't try to process the enclosing
1959 function scope again. */
1960 write_name (entity
, /*ignore_local_scope=*/1);
1961 write_discriminator (discriminator_for_local_entity (local_entity
));
1965 /* Non-terminals <type> and <CV-qualifier>.
1967 <type> ::= <builtin-type>
1969 ::= <class-enum-type>
1971 ::= <pointer-to-member-type>
1972 ::= <template-param>
1975 ::= P <type> # pointer-to
1976 ::= R <type> # reference-to
1977 ::= C <type> # complex pair (C 2000)
1978 ::= G <type> # imaginary (C 2000) [not supported]
1979 ::= U <source-name> <type> # vendor extended type qualifier
1983 <type> ::= RR <type> # rvalue reference-to
1984 <type> ::= Dt <expression> # decltype of an id-expression or
1985 # class member access
1986 <type> ::= DT <expression> # decltype of an expression
1987 <type> ::= Dn # decltype of nullptr
1989 TYPE is a type node. */
1992 write_type (tree type
)
1994 /* This gets set to nonzero if TYPE turns out to be a (possibly
1995 CV-qualified) builtin type. */
1996 int is_builtin_type
= 0;
1998 MANGLE_TRACE_TREE ("type", type
);
2000 if (type
== error_mark_node
)
2003 type
= canonicalize_for_substitution (type
);
2004 if (find_substitution (type
))
2008 if (write_CV_qualifiers_for_type (type
) > 0)
2009 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2010 mangle the unqualified type. The recursive call is needed here
2011 since both the qualified and unqualified types are substitution
2014 tree t
= TYPE_MAIN_VARIANT (type
);
2015 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
2017 tree attrs
= NULL_TREE
;
2018 if (tx_safe_fn_type_p (type
))
2019 attrs
= tree_cons (get_identifier ("transaction_safe"),
2021 t
= cp_build_type_attribute_variant (t
, attrs
);
2023 gcc_assert (t
!= type
);
2024 if (TREE_CODE (t
) == FUNCTION_TYPE
2025 || TREE_CODE (t
) == METHOD_TYPE
)
2027 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
2028 if (abi_version_at_least (8)
2029 || type
== TYPE_MAIN_VARIANT (type
))
2030 /* Avoid adding the unqualified function type as a substitution. */
2031 write_function_type (t
);
2034 if (abi_warn_or_compat_version_crosses (8))
2035 G
.need_abi_warning
= 1;
2040 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2041 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2042 so that the cv-qualification of the element type is available
2043 in write_array_type. */
2044 write_array_type (type
);
2047 tree type_orig
= type
;
2049 /* See through any typedefs. */
2050 type
= TYPE_MAIN_VARIANT (type
);
2051 if (TREE_CODE (type
) == FUNCTION_TYPE
2052 || TREE_CODE (type
) == METHOD_TYPE
)
2053 type
= build_ref_qualified_type (type
, type_memfn_rqual (type_orig
));
2055 /* According to the C++ ABI, some library classes are passed the
2056 same as the scalar type of their single member and use the same
2058 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
2059 type
= TREE_TYPE (first_field (type
));
2061 if (TYPE_PTRDATAMEM_P (type
))
2062 write_pointer_to_member_type (type
);
2065 /* Handle any target-specific fundamental types. */
2066 const char *target_mangling
2067 = targetm
.mangle_type (type_orig
);
2069 if (target_mangling
)
2071 write_string (target_mangling
);
2072 /* Add substitutions for types other than fundamental
2074 if (!VOID_TYPE_P (type
)
2075 && TREE_CODE (type
) != INTEGER_TYPE
2076 && TREE_CODE (type
) != REAL_TYPE
2077 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2078 add_substitution (type
);
2082 switch (TREE_CODE (type
))
2086 case INTEGER_TYPE
: /* Includes wchar_t. */
2088 case FIXED_POINT_TYPE
:
2090 /* If this is a typedef, TYPE may not be one of
2091 the standard builtin type nodes, but an alias of one. Use
2092 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2093 write_builtin_type (TYPE_MAIN_VARIANT (type
));
2100 write_type (TREE_TYPE (type
));
2105 write_function_type (type
);
2111 /* A pointer-to-member function is represented as a special
2112 RECORD_TYPE, so check for this first. */
2113 if (TYPE_PTRMEMFUNC_P (type
))
2114 write_pointer_to_member_type (type
);
2116 write_class_enum_type (type
);
2120 case UNBOUND_CLASS_TEMPLATE
:
2121 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2122 ordinary nested names. */
2123 write_nested_name (TYPE_STUB_DECL (type
));
2127 case REFERENCE_TYPE
:
2128 if (TYPE_PTR_P (type
))
2130 else if (TYPE_REF_IS_RVALUE (type
))
2135 tree target
= TREE_TYPE (type
);
2136 /* Attribute const/noreturn are not reflected in mangling.
2137 We strip them here rather than at a lower level because
2138 a typedef or template argument can have function type
2139 with function-cv-quals (that use the same representation),
2140 but you can't have a pointer/reference to such a type. */
2141 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2143 if (abi_warn_or_compat_version_crosses (5)
2144 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2145 G
.need_abi_warning
= 1;
2146 if (abi_version_at_least (5))
2147 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2149 write_type (target
);
2153 case TEMPLATE_TYPE_PARM
:
2156 if (AUTO_IS_DECLTYPE (type
))
2157 write_identifier ("Dc");
2159 write_identifier ("Da");
2163 /* else fall through. */
2164 case TEMPLATE_PARM_INDEX
:
2165 write_template_param (type
);
2168 case TEMPLATE_TEMPLATE_PARM
:
2169 write_template_template_param (type
);
2172 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2173 write_template_template_param (type
);
2175 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2179 if (abi_version_at_least (4))
2181 write_string ("Dv");
2182 /* Non-constant vector size would be encoded with
2183 _ expression, but we don't support that yet. */
2184 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2188 write_string ("U8__vector");
2189 if (abi_warn_or_compat_version_crosses (4))
2190 G
.need_abi_warning
= 1;
2191 write_type (TREE_TYPE (type
));
2194 case TYPE_PACK_EXPANSION
:
2195 write_string ("Dp");
2196 write_type (PACK_EXPANSION_PATTERN (type
));
2200 /* These shouldn't make it into mangling. */
2201 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2202 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2204 /* In ABI <5, we stripped decltype of a plain decl. */
2205 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2207 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2208 tree etype
= NULL_TREE
;
2209 switch (TREE_CODE (expr
))
2216 case TEMPLATE_PARM_INDEX
:
2217 etype
= TREE_TYPE (expr
);
2224 if (etype
&& !type_uses_auto (etype
))
2226 if (abi_warn_or_compat_version_crosses (5))
2227 G
.need_abi_warning
= 1;
2228 if (!abi_version_at_least (5))
2237 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2241 ++cp_unevaluated_operand
;
2242 write_expression (DECLTYPE_TYPE_EXPR (type
));
2243 --cp_unevaluated_operand
;
2248 write_string ("Dn");
2249 if (abi_version_at_least (7))
2251 if (abi_warn_or_compat_version_crosses (7))
2252 G
.need_abi_warning
= 1;
2256 sorry ("mangling typeof, use decltype instead");
2259 case UNDERLYING_TYPE
:
2260 sorry ("mangling __underlying_type");
2272 /* Types other than builtin types are substitution candidates. */
2273 if (!is_builtin_type
)
2274 add_substitution (type
);
2277 /* qsort callback for sorting a vector of attribute entries. */
2280 attr_strcmp (const void *p1
, const void *p2
)
2282 tree a1
= *(const tree
*)p1
;
2283 tree a2
= *(const tree
*)p2
;
2285 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2286 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2288 return strcmp (as1
->name
, as2
->name
);
2291 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2292 CV-qualifiers written for TYPE.
2294 <CV-qualifiers> ::= [r] [V] [K] */
2297 write_CV_qualifiers_for_type (const tree type
)
2299 int num_qualifiers
= 0;
2301 /* The order is specified by:
2303 "In cases where multiple order-insensitive qualifiers are
2304 present, they should be ordered 'K' (closest to the base type),
2305 'V', 'r', and 'U' (farthest from the base type) ..." */
2307 /* Mangle attributes that affect type identity as extended qualifiers.
2309 We don't do this with classes and enums because their attributes
2310 are part of their definitions, not something added on. */
2312 if (!OVERLOAD_TYPE_P (type
))
2315 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2317 tree name
= get_attribute_name (a
);
2318 const attribute_spec
*as
= lookup_attribute_spec (name
);
2319 if (as
&& as
->affects_type_identity
2320 && !is_attribute_p ("transaction_safe", name
)
2321 && !is_attribute_p ("abi_tag", name
))
2324 if (abi_warn_or_compat_version_crosses (10) && !vec
.is_empty ())
2325 G
.need_abi_warning
= true;
2326 if (abi_version_at_least (10))
2328 vec
.qsort (attr_strcmp
);
2329 while (!vec
.is_empty())
2332 const attribute_spec
*as
2333 = lookup_attribute_spec (get_attribute_name (a
));
2336 write_unsigned_number (strlen (as
->name
));
2337 write_string (as
->name
);
2341 for (tree args
= TREE_VALUE (a
); args
;
2342 args
= TREE_CHAIN (args
))
2344 tree arg
= TREE_VALUE (args
);
2345 write_template_arg (arg
);
2355 /* Note that we do not use cp_type_quals below; given "const
2356 int[3]", the "const" is emitted with the "int", not with the
2358 cp_cv_quals quals
= TYPE_QUALS (type
);
2360 if (quals
& TYPE_QUAL_RESTRICT
)
2365 if (quals
& TYPE_QUAL_VOLATILE
)
2370 if (quals
& TYPE_QUAL_CONST
)
2376 return num_qualifiers
;
2379 /* Non-terminal <builtin-type>.
2381 <builtin-type> ::= v # void
2386 ::= h # unsigned char
2388 ::= t # unsigned short
2390 ::= j # unsigned int
2392 ::= m # unsigned long
2393 ::= x # long long, __int64
2394 ::= y # unsigned long long, __int64
2396 ::= o # unsigned __int128
2399 ::= e # long double, __float80
2400 ::= g # __float128 [not supported]
2401 ::= u <source-name> # vendor extended type */
2404 write_builtin_type (tree type
)
2406 if (TYPE_CANONICAL (type
))
2407 type
= TYPE_CANONICAL (type
);
2409 switch (TREE_CODE (type
))
2420 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2421 isn't in integer_type_nodes. */
2422 if (type
== wchar_type_node
)
2424 else if (type
== char16_type_node
)
2425 write_string ("Ds");
2426 else if (type
== char32_type_node
)
2427 write_string ("Di");
2428 else if (TYPE_FOR_JAVA (type
))
2429 write_java_integer_type_codes (type
);
2433 /* Assume TYPE is one of the shared integer type nodes. Find
2434 it in the array of these nodes. */
2436 for (itk
= 0; itk
< itk_none
; ++itk
)
2437 if (integer_types
[itk
] != NULL_TREE
2438 && integer_type_codes
[itk
] != '\0'
2439 && type
== integer_types
[itk
])
2441 /* Print the corresponding single-letter code. */
2442 write_char (integer_type_codes
[itk
]);
2446 if (itk
== itk_none
)
2448 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2449 TYPE_UNSIGNED (type
));
2456 if (TYPE_PRECISION (type
) == 128)
2457 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2460 /* Allow for cases where TYPE is not one of the shared
2461 integer type nodes and write a "vendor extended builtin
2462 type" with a name the form intN or uintN, respectively.
2463 Situations like this can happen if you have an
2464 __attribute__((__mode__(__SI__))) type and use exotic
2465 switches like '-mint8' on AVR. Of course, this is
2466 undefined by the C++ ABI (and '-mint8' is not even
2467 Standard C conforming), but when using such special
2468 options you're pretty much in nowhere land anyway. */
2470 char prec
[11]; /* up to ten digits for an unsigned */
2472 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2473 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2474 write_char ('u'); /* "vendor extended builtin type" */
2475 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2476 write_string (prefix
);
2477 write_string (prec
);
2484 if (type
== float_type_node
2485 || type
== java_float_type_node
)
2487 else if (type
== double_type_node
2488 || type
== java_double_type_node
)
2490 else if (type
== long_double_type_node
)
2492 else if (type
== dfloat32_type_node
)
2493 write_string ("Df");
2494 else if (type
== dfloat64_type_node
)
2495 write_string ("Dd");
2496 else if (type
== dfloat128_type_node
)
2497 write_string ("De");
2502 case FIXED_POINT_TYPE
:
2503 write_string ("DF");
2504 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2505 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2506 if (type
== fract_type_node
2507 || type
== sat_fract_type_node
2508 || type
== accum_type_node
2509 || type
== sat_accum_type_node
)
2511 else if (type
== unsigned_fract_type_node
2512 || type
== sat_unsigned_fract_type_node
2513 || type
== unsigned_accum_type_node
2514 || type
== sat_unsigned_accum_type_node
)
2516 else if (type
== short_fract_type_node
2517 || type
== sat_short_fract_type_node
2518 || type
== short_accum_type_node
2519 || type
== sat_short_accum_type_node
)
2521 else if (type
== unsigned_short_fract_type_node
2522 || type
== sat_unsigned_short_fract_type_node
2523 || type
== unsigned_short_accum_type_node
2524 || type
== sat_unsigned_short_accum_type_node
)
2526 else if (type
== long_fract_type_node
2527 || type
== sat_long_fract_type_node
2528 || type
== long_accum_type_node
2529 || type
== sat_long_accum_type_node
)
2531 else if (type
== unsigned_long_fract_type_node
2532 || type
== sat_unsigned_long_fract_type_node
2533 || type
== unsigned_long_accum_type_node
2534 || type
== sat_unsigned_long_accum_type_node
)
2536 else if (type
== long_long_fract_type_node
2537 || type
== sat_long_long_fract_type_node
2538 || type
== long_long_accum_type_node
2539 || type
== sat_long_long_accum_type_node
)
2541 else if (type
== unsigned_long_long_fract_type_node
2542 || type
== sat_unsigned_long_long_fract_type_node
2543 || type
== unsigned_long_long_accum_type_node
2544 || type
== sat_unsigned_long_long_accum_type_node
)
2547 sorry ("mangling unknown fixed point type");
2548 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2549 if (TYPE_SATURATING (type
))
2560 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2561 METHOD_TYPE. The return type is mangled before the parameter
2564 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2567 write_function_type (const tree type
)
2569 MANGLE_TRACE_TREE ("function-type", type
);
2571 /* For a pointer to member function, the function type may have
2572 cv-qualifiers, indicating the quals for the artificial 'this'
2574 if (TREE_CODE (type
) == METHOD_TYPE
)
2576 /* The first parameter must be a POINTER_TYPE pointing to the
2577 `this' parameter. */
2578 tree this_type
= class_of_this_parm (type
);
2579 write_CV_qualifiers_for_type (this_type
);
2582 if (tx_safe_fn_type_p (type
))
2583 write_string ("Dx");
2586 /* We don't track whether or not a type is `extern "C"'. Note that
2587 you can have an `extern "C"' function that does not have
2588 `extern "C"' type, and vice versa:
2590 extern "C" typedef void function_t();
2591 function_t f; // f has C++ linkage, but its type is
2594 typedef void function_t();
2595 extern "C" function_t f; // Vice versa.
2598 write_bare_function_type (type
, /*include_return_type_p=*/1,
2600 if (FUNCTION_REF_QUALIFIED (type
))
2602 if (FUNCTION_RVALUE_QUALIFIED (type
))
2610 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2611 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2612 is mangled before the parameter types. If non-NULL, DECL is
2613 FUNCTION_DECL for the function whose type is being emitted.
2615 If DECL is a member of a Java type, then a literal 'J'
2616 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2619 <bare-function-type> ::= [J]</signature/ type>+ */
2622 write_bare_function_type (const tree type
, const int include_return_type_p
,
2627 MANGLE_TRACE_TREE ("bare-function-type", type
);
2629 /* Detect Java methods and emit special encoding. */
2631 && DECL_FUNCTION_MEMBER_P (decl
)
2632 && TYPE_FOR_JAVA (DECL_CONTEXT (decl
))
2633 && !DECL_CONSTRUCTOR_P (decl
)
2634 && !DECL_DESTRUCTOR_P (decl
)
2635 && !DECL_CONV_FN_P (decl
))
2645 /* Mangle the return type, if requested. */
2646 if (include_return_type_p
|| java_method_p
)
2647 write_type (TREE_TYPE (type
));
2649 /* Now mangle the types of the arguments. */
2651 write_method_parms (TYPE_ARG_TYPES (type
),
2652 TREE_CODE (type
) == METHOD_TYPE
,
2657 /* Write the mangled representation of a method parameter list of
2658 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2659 considered a non-static method, and the this parameter is omitted.
2660 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2661 parameters are being emitted. */
2664 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2666 tree first_parm_type
;
2667 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2669 /* Assume this parameter type list is variable-length. If it ends
2670 with a void type, then it's not. */
2673 /* If this is a member function, skip the first arg, which is the
2675 "Member functions do not encode the type of their implicit this
2678 Similarly, there's no need to mangle artificial parameters, like
2679 the VTT parameters for constructors and destructors. */
2682 parm_types
= TREE_CHAIN (parm_types
);
2683 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2685 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2687 parm_types
= TREE_CHAIN (parm_types
);
2688 parm_decl
= DECL_CHAIN (parm_decl
);
2692 for (first_parm_type
= parm_types
;
2694 parm_types
= TREE_CHAIN (parm_types
))
2696 tree parm
= TREE_VALUE (parm_types
);
2697 if (parm
== void_type_node
)
2699 /* "Empty parameter lists, whether declared as () or
2700 conventionally as (void), are encoded with a void parameter
2702 if (parm_types
== first_parm_type
)
2704 /* If the parm list is terminated with a void type, it's
2707 /* A void type better be the last one. */
2708 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2715 /* <builtin-type> ::= z # ellipsis */
2719 /* <class-enum-type> ::= <name> */
2722 write_class_enum_type (const tree type
)
2724 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2727 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2730 <template-args> ::= I <template-arg>* E */
2733 write_template_args (tree args
)
2738 MANGLE_TRACE_TREE ("template-args", args
);
2743 length
= TREE_VEC_LENGTH (args
);
2745 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2747 /* We have nested template args. We want the innermost template
2749 args
= TREE_VEC_ELT (args
, length
- 1);
2750 length
= TREE_VEC_LENGTH (args
);
2752 for (i
= 0; i
< length
; ++i
)
2753 write_template_arg (TREE_VEC_ELT (args
, i
));
2760 <unqualified-name> <template-args>
2761 part of SCOPE_REF or COMPONENT_REF mangling. */
2764 write_member_name (tree member
)
2766 if (identifier_p (member
))
2767 write_unqualified_id (member
);
2768 else if (DECL_P (member
))
2769 write_unqualified_name (member
);
2770 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2772 tree name
= TREE_OPERAND (member
, 0);
2773 if (TREE_CODE (name
) == OVERLOAD
)
2774 name
= OVL_FUNCTION (name
);
2775 write_member_name (name
);
2776 write_template_args (TREE_OPERAND (member
, 1));
2779 write_expression (member
);
2782 /* <expression> ::= <unary operator-name> <expression>
2783 ::= <binary operator-name> <expression> <expression>
2786 <expr-primary> ::= <template-param>
2787 ::= L <type> <value number> E # literal
2788 ::= L <mangled-name> E # external name
2789 ::= st <type> # sizeof
2790 ::= sr <type> <unqualified-name> # dependent name
2791 ::= sr <type> <unqualified-name> <template-args> */
2794 write_expression (tree expr
)
2796 enum tree_code code
= TREE_CODE (expr
);
2798 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2799 is converted (via qualification conversions) to another
2801 while (TREE_CODE (expr
) == NOP_EXPR
2802 /* Parentheses aren't mangled. */
2803 || code
== PAREN_EXPR
2804 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2806 expr
= TREE_OPERAND (expr
, 0);
2807 code
= TREE_CODE (expr
);
2810 if (code
== BASELINK
2811 && (!type_unknown_p (expr
)
2812 || !BASELINK_QUALIFIED_P (expr
)))
2814 expr
= BASELINK_FUNCTIONS (expr
);
2815 code
= TREE_CODE (expr
);
2818 /* Handle pointers-to-members by making them look like expression
2820 if (code
== PTRMEM_CST
)
2822 expr
= build_nt (ADDR_EXPR
,
2823 build_qualified_name (/*type=*/NULL_TREE
,
2824 PTRMEM_CST_CLASS (expr
),
2825 PTRMEM_CST_MEMBER (expr
),
2826 /*template_p=*/false));
2827 code
= TREE_CODE (expr
);
2830 /* Handle template parameters. */
2831 if (code
== TEMPLATE_TYPE_PARM
2832 || code
== TEMPLATE_TEMPLATE_PARM
2833 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2834 || code
== TEMPLATE_PARM_INDEX
)
2835 write_template_param (expr
);
2836 /* Handle literals. */
2837 else if (TREE_CODE_CLASS (code
) == tcc_constant
2838 || code
== CONST_DECL
)
2839 write_template_arg_literal (expr
);
2840 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2842 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr
))));
2843 write_string ("fpT");
2845 else if (code
== PARM_DECL
)
2847 /* A function parameter used in a late-specified return type. */
2848 int index
= DECL_PARM_INDEX (expr
);
2849 int level
= DECL_PARM_LEVEL (expr
);
2850 int delta
= G
.parm_depth
- level
+ 1;
2851 gcc_assert (index
>= 1);
2855 if (abi_version_at_least (5))
2857 /* Let L be the number of function prototype scopes from the
2858 innermost one (in which the parameter reference occurs) up
2859 to (and including) the one containing the declaration of
2860 the referenced parameter. If the parameter declaration
2861 clause of the innermost function prototype scope has been
2862 completely seen, it is not counted (in that case -- which
2863 is perhaps the most common -- L can be zero). */
2865 write_unsigned_number (delta
- 1);
2867 if (abi_warn_or_compat_version_crosses (5))
2868 G
.need_abi_warning
= true;
2871 write_compact_number (index
- 1);
2873 else if (DECL_P (expr
))
2876 write_mangled_name (expr
, false);
2879 else if (TREE_CODE (expr
) == SIZEOF_EXPR
)
2881 tree op
= TREE_OPERAND (expr
, 0);
2883 if (PACK_EXPANSION_P (op
))
2885 if (abi_warn_or_compat_version_crosses (11))
2886 G
.need_abi_warning
= true;
2887 if (abi_version_at_least (11))
2889 /* sZ rather than szDp. */
2890 write_string ("sZ");
2891 write_expression (PACK_EXPANSION_PATTERN (op
));
2896 if (SIZEOF_EXPR_TYPE_P (expr
))
2898 write_string ("st");
2899 write_type (TREE_TYPE (op
));
2901 else if (ARGUMENT_PACK_P (op
))
2903 tree args
= ARGUMENT_PACK_ARGS (op
);
2904 int length
= TREE_VEC_LENGTH (args
);
2905 if (abi_warn_or_compat_version_crosses (10))
2906 G
.need_abi_warning
= true;
2907 if (abi_version_at_least (10))
2909 /* sP <template-arg>* E # sizeof...(T), size of a captured
2910 template parameter pack from an alias template */
2911 write_string ("sP");
2912 for (int i
= 0; i
< length
; ++i
)
2913 write_template_arg (TREE_VEC_ELT (args
, i
));
2918 /* In GCC 5 we represented this sizeof wrong, with the effect
2919 that we mangled it as the last element of the pack. */
2920 tree arg
= TREE_VEC_ELT (args
, length
-1);
2923 write_string ("st");
2928 write_string ("sz");
2929 write_expression (arg
);
2933 else if (TYPE_P (TREE_OPERAND (expr
, 0)))
2935 write_string ("st");
2936 write_type (TREE_OPERAND (expr
, 0));
2941 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2942 && TYPE_P (TREE_OPERAND (expr
, 0)))
2944 write_string ("at");
2945 write_type (TREE_OPERAND (expr
, 0));
2947 else if (code
== SCOPE_REF
2948 || code
== BASELINK
)
2951 if (code
== SCOPE_REF
)
2953 scope
= TREE_OPERAND (expr
, 0);
2954 member
= TREE_OPERAND (expr
, 1);
2958 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
2959 member
= BASELINK_FUNCTIONS (expr
);
2962 /* If the MEMBER is a real declaration, then the qualifying
2963 scope was not dependent. Ideally, we would not have a
2964 SCOPE_REF in those cases, but sometimes we do. If the second
2965 argument is a DECL, then the name must not have been
2967 if (DECL_P (member
))
2968 write_expression (member
);
2971 write_string ("sr");
2973 write_member_name (member
);
2976 else if (INDIRECT_REF_P (expr
)
2977 && TREE_TYPE (TREE_OPERAND (expr
, 0))
2978 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2980 write_expression (TREE_OPERAND (expr
, 0));
2982 else if (identifier_p (expr
))
2984 /* An operator name appearing as a dependent name needs to be
2985 specially marked to disambiguate between a use of the operator
2986 name and a use of the operator in an expression. */
2987 if (IDENTIFIER_OPNAME_P (expr
))
2988 write_string ("on");
2989 write_unqualified_id (expr
);
2991 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
2993 tree fn
= TREE_OPERAND (expr
, 0);
2994 if (is_overloaded_fn (fn
))
2995 fn
= get_first_fn (fn
);
2997 fn
= DECL_NAME (fn
);
2998 if (IDENTIFIER_OPNAME_P (fn
))
2999 write_string ("on");
3000 write_unqualified_id (fn
);
3001 write_template_args (TREE_OPERAND (expr
, 1));
3003 else if (TREE_CODE (expr
) == MODOP_EXPR
)
3005 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
3006 const char *name
= (assignment_operator_name_info
[(int) subop
]
3008 write_string (name
);
3009 write_expression (TREE_OPERAND (expr
, 0));
3010 write_expression (TREE_OPERAND (expr
, 2));
3012 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
3014 /* ::= [gs] nw <expression>* _ <type> E
3015 ::= [gs] nw <expression>* _ <type> <initializer>
3016 ::= [gs] na <expression>* _ <type> E
3017 ::= [gs] na <expression>* _ <type> <initializer>
3018 <initializer> ::= pi <expression>* E */
3019 tree placement
= TREE_OPERAND (expr
, 0);
3020 tree type
= TREE_OPERAND (expr
, 1);
3021 tree nelts
= TREE_OPERAND (expr
, 2);
3022 tree init
= TREE_OPERAND (expr
, 3);
3025 gcc_assert (code
== NEW_EXPR
);
3026 if (TREE_OPERAND (expr
, 2))
3027 code
= VEC_NEW_EXPR
;
3029 if (NEW_EXPR_USE_GLOBAL (expr
))
3030 write_string ("gs");
3032 write_string (operator_name_info
[(int) code
].mangled_name
);
3034 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
3035 write_expression (TREE_VALUE (t
));
3042 ++processing_template_decl
;
3043 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3044 tf_warning_or_error
);
3045 type
= build_cplus_array_type (type
, domain
);
3046 --processing_template_decl
;
3050 if (init
&& TREE_CODE (init
) == TREE_LIST
3051 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
3052 write_expression (TREE_VALUE (init
));
3056 write_string ("pi");
3057 if (init
&& init
!= void_node
)
3058 for (t
= init
; t
; t
= TREE_CHAIN (t
))
3059 write_expression (TREE_VALUE (t
));
3063 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
3065 gcc_assert (code
== DELETE_EXPR
);
3066 if (DELETE_EXPR_USE_VEC (expr
))
3067 code
= VEC_DELETE_EXPR
;
3069 if (DELETE_EXPR_USE_GLOBAL (expr
))
3070 write_string ("gs");
3072 write_string (operator_name_info
[(int) code
].mangled_name
);
3074 write_expression (TREE_OPERAND (expr
, 0));
3076 else if (code
== THROW_EXPR
)
3078 tree op
= TREE_OPERAND (expr
, 0);
3081 write_string ("tw");
3082 write_expression (op
);
3085 write_string ("tr");
3087 else if (code
== CONSTRUCTOR
)
3089 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
3090 unsigned i
; tree val
;
3092 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3093 write_string ("il");
3096 write_string ("tl");
3097 write_type (TREE_TYPE (expr
));
3099 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
3100 write_expression (val
);
3103 else if (dependent_name (expr
))
3105 write_unqualified_id (dependent_name (expr
));
3113 /* When we bind a variable or function to a non-type template
3114 argument with reference type, we create an ADDR_EXPR to show
3115 the fact that the entity's address has been taken. But, we
3116 don't actually want to output a mangling code for the `&'. */
3117 if (TREE_CODE (expr
) == ADDR_EXPR
3119 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
3121 expr
= TREE_OPERAND (expr
, 0);
3124 write_expression (expr
);
3128 code
= TREE_CODE (expr
);
3131 if (code
== COMPONENT_REF
)
3133 tree ob
= TREE_OPERAND (expr
, 0);
3135 if (TREE_CODE (ob
) == ARROW_EXPR
)
3137 write_string (operator_name_info
[(int)code
].mangled_name
);
3138 ob
= TREE_OPERAND (ob
, 0);
3139 write_expression (ob
);
3141 else if (!is_dummy_object (ob
))
3143 write_string ("dt");
3144 write_expression (ob
);
3146 /* else, for a non-static data member with no associated object (in
3147 unevaluated context), use the unresolved-name mangling. */
3149 write_member_name (TREE_OPERAND (expr
, 1));
3153 /* If it wasn't any of those, recursively expand the expression. */
3154 name
= operator_name_info
[(int) code
].mangled_name
;
3156 /* We used to mangle const_cast and static_cast like a C cast. */
3157 if (code
== CONST_CAST_EXPR
3158 || code
== STATIC_CAST_EXPR
)
3160 if (abi_warn_or_compat_version_crosses (6))
3161 G
.need_abi_warning
= 1;
3162 if (!abi_version_at_least (6))
3163 name
= operator_name_info
[CAST_EXPR
].mangled_name
;
3171 error ("use of built-in trait %qE in function signature; "
3172 "use library traits instead", expr
);
3176 sorry ("mangling %C", code
);
3182 write_string (name
);
3188 tree fn
= CALL_EXPR_FN (expr
);
3190 if (TREE_CODE (fn
) == ADDR_EXPR
)
3191 fn
= TREE_OPERAND (fn
, 0);
3193 /* Mangle a dependent name as the name, not whatever happens to
3194 be the first function in the overload set. */
3195 if ((TREE_CODE (fn
) == FUNCTION_DECL
3196 || TREE_CODE (fn
) == OVERLOAD
)
3197 && type_dependent_expression_p_push (expr
))
3198 fn
= DECL_NAME (get_first_fn (fn
));
3200 write_expression (fn
);
3203 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3204 write_expression (CALL_EXPR_ARG (expr
, i
));
3209 write_type (TREE_TYPE (expr
));
3210 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3211 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3214 tree args
= TREE_OPERAND (expr
, 0);
3216 for (; args
; args
= TREE_CHAIN (args
))
3217 write_expression (TREE_VALUE (args
));
3222 case DYNAMIC_CAST_EXPR
:
3223 case REINTERPRET_CAST_EXPR
:
3224 case STATIC_CAST_EXPR
:
3225 case CONST_CAST_EXPR
:
3226 write_type (TREE_TYPE (expr
));
3227 write_expression (TREE_OPERAND (expr
, 0));
3230 case PREINCREMENT_EXPR
:
3231 case PREDECREMENT_EXPR
:
3232 if (abi_version_at_least (6))
3234 if (abi_warn_or_compat_version_crosses (6))
3235 G
.need_abi_warning
= 1;
3239 /* In the middle-end, some expressions have more operands than
3240 they do in templates (and mangling). */
3241 len
= cp_tree_operand_length (expr
);
3243 for (i
= 0; i
< len
; ++i
)
3245 tree operand
= TREE_OPERAND (expr
, i
);
3246 /* As a GNU extension, the middle operand of a
3247 conditional may be omitted. Since expression
3248 manglings are supposed to represent the input token
3249 stream, there's no good way to mangle such an
3250 expression without extending the C++ ABI. */
3251 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3253 error ("omitted middle operand to %<?:%> operand "
3254 "cannot be mangled");
3257 else if (FOLD_EXPR_P (expr
))
3259 /* The first 'operand' of a fold-expression is the operator
3260 that it folds over. */
3263 int fcode
= TREE_INT_CST_LOW (operand
);
3264 write_string (operator_name_info
[fcode
].mangled_name
);
3267 else if (code
== BINARY_LEFT_FOLD_EXPR
)
3269 /* The order of operands of the binary left and right
3270 folds is the same, but we want to mangle them in
3271 lexical order, i.e. non-pack first. */
3273 operand
= FOLD_EXPR_INIT (expr
);
3275 operand
= FOLD_EXPR_PACK (expr
);
3277 if (PACK_EXPANSION_P (operand
))
3278 operand
= PACK_EXPANSION_PATTERN (operand
);
3280 write_expression (operand
);
3286 /* Literal subcase of non-terminal <template-arg>.
3288 "Literal arguments, e.g. "A<42L>", are encoded with their type
3289 and value. Negative integer values are preceded with "n"; for
3290 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3291 encoded as 0, true as 1." */
3294 write_template_arg_literal (const tree value
)
3297 write_type (TREE_TYPE (value
));
3299 /* Write a null member pointer value as (type)0, regardless of its
3300 real representation. */
3301 if (null_member_pointer_value_p (value
))
3302 write_integer_cst (integer_zero_node
);
3304 switch (TREE_CODE (value
))
3307 write_integer_cst (DECL_INITIAL (value
));
3311 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3312 || integer_zerop (value
) || integer_onep (value
));
3313 write_integer_cst (value
);
3317 write_real_cst (value
);
3321 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3322 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3324 write_integer_cst (TREE_REALPART (value
));
3326 write_integer_cst (TREE_IMAGPART (value
));
3328 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3329 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3331 write_real_cst (TREE_REALPART (value
));
3333 write_real_cst (TREE_IMAGPART (value
));
3340 sorry ("string literal in function template signature");
3350 /* Non-terminal <template-arg>.
3352 <template-arg> ::= <type> # type
3353 ::= L <type> </value/ number> E # literal
3354 ::= LZ <name> E # external name
3355 ::= X <expression> E # expression */
3358 write_template_arg (tree node
)
3360 enum tree_code code
= TREE_CODE (node
);
3362 MANGLE_TRACE_TREE ("template-arg", node
);
3364 /* A template template parameter's argument list contains TREE_LIST
3365 nodes of which the value field is the actual argument. */
3366 if (code
== TREE_LIST
)
3368 node
= TREE_VALUE (node
);
3369 /* If it's a decl, deal with its type instead. */
3372 node
= TREE_TYPE (node
);
3373 code
= TREE_CODE (node
);
3377 if (REFERENCE_REF_P (node
))
3378 node
= TREE_OPERAND (node
, 0);
3379 if (TREE_CODE (node
) == NOP_EXPR
3380 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3382 /* Template parameters can be of reference type. To maintain
3383 internal consistency, such arguments use a conversion from
3384 address of object to reference type. */
3385 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3386 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3389 if (TREE_CODE (node
) == BASELINK
3390 && !type_unknown_p (node
))
3392 if (abi_version_at_least (6))
3393 node
= BASELINK_FUNCTIONS (node
);
3394 if (abi_warn_or_compat_version_crosses (6))
3395 /* We wrongly wrapped a class-scope function in X/E. */
3396 G
.need_abi_warning
= 1;
3399 if (ARGUMENT_PACK_P (node
))
3401 /* Expand the template argument pack. */
3402 tree args
= ARGUMENT_PACK_ARGS (node
);
3403 int i
, length
= TREE_VEC_LENGTH (args
);
3404 if (abi_version_at_least (6))
3408 if (abi_warn_or_compat_version_crosses (6))
3409 G
.need_abi_warning
= 1;
3410 for (i
= 0; i
< length
; ++i
)
3411 write_template_arg (TREE_VEC_ELT (args
, i
));
3414 else if (TYPE_P (node
))
3416 else if (code
== TEMPLATE_DECL
)
3417 /* A template appearing as a template arg is a template template arg. */
3418 write_template_template_arg (node
);
3419 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3420 || code
== CONST_DECL
3421 || null_member_pointer_value_p (node
))
3422 write_template_arg_literal (node
);
3423 else if (DECL_P (node
))
3426 /* Until ABI version 3, the underscore before the mangled name
3427 was incorrectly omitted. */
3428 if (!abi_version_at_least (3))
3431 write_string ("_Z");
3432 if (abi_warn_or_compat_version_crosses (3))
3433 G
.need_abi_warning
= 1;
3434 write_encoding (node
);
3439 /* Template arguments may be expressions. */
3441 write_expression (node
);
3446 /* <template-template-arg>
3448 ::= <substitution> */
3451 write_template_template_arg (const tree decl
)
3453 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3455 if (find_substitution (decl
))
3457 write_name (decl
, /*ignore_local_scope=*/0);
3458 add_substitution (decl
);
3462 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3464 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3465 ::= A <expression> _ </element/ type>
3467 "Array types encode the dimension (number of elements) and the
3468 element type. For variable length arrays, the dimension (but not
3469 the '_' separator) is omitted."
3470 Note that for flexible array members, like for other arrays of
3471 unspecified size, the dimension is also omitted. */
3474 write_array_type (const tree type
)
3477 if (TYPE_DOMAIN (type
))
3481 index_type
= TYPE_DOMAIN (type
);
3482 /* The INDEX_TYPE gives the upper and lower bounds of the array.
3483 It's null for flexible array members which have no upper bound
3484 (this is a change from GCC 5 and prior where such members were
3485 incorrectly mangled as zero-length arrays). */
3486 if (tree max
= TYPE_MAX_VALUE (index_type
))
3488 if (TREE_CODE (max
) == INTEGER_CST
)
3490 /* The ABI specifies that we should mangle the number of
3491 elements in the array, not the largest allowed index. */
3492 offset_int wmax
= wi::to_offset (max
) + 1;
3493 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3494 number of elements as zero. */
3495 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3496 gcc_assert (wi::fits_uhwi_p (wmax
));
3497 write_unsigned_number (wmax
.to_uhwi ());
3501 max
= TREE_OPERAND (max
, 0);
3502 write_expression (max
);
3507 write_type (TREE_TYPE (type
));
3510 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3511 variables. TYPE is a pointer-to-member POINTER_TYPE.
3513 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3516 write_pointer_to_member_type (const tree type
)
3519 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3520 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3523 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3524 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3525 TEMPLATE_PARM_INDEX.
3527 <template-param> ::= T </parameter/ number> _ */
3530 write_template_param (const tree parm
)
3534 MANGLE_TRACE_TREE ("template-parm", parm
);
3536 switch (TREE_CODE (parm
))
3538 case TEMPLATE_TYPE_PARM
:
3539 case TEMPLATE_TEMPLATE_PARM
:
3540 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3541 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3544 case TEMPLATE_PARM_INDEX
:
3545 parm_index
= TEMPLATE_PARM_IDX (parm
);
3553 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3554 earliest template param denoted by `_'. */
3555 write_compact_number (parm_index
);
3558 /* <template-template-param>
3559 ::= <template-param>
3560 ::= <substitution> */
3563 write_template_template_param (const tree parm
)
3565 tree templ
= NULL_TREE
;
3567 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3568 template template parameter. The substitution candidate here is
3569 only the template. */
3570 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3573 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3574 if (find_substitution (templ
))
3578 /* <template-param> encodes only the template parameter position,
3579 not its template arguments, which is fine here. */
3580 write_template_param (parm
);
3582 add_substitution (templ
);
3585 /* Non-terminal <substitution>.
3587 <substitution> ::= S <seq-id> _
3591 write_substitution (const int seq_id
)
3593 MANGLE_TRACE ("substitution", "");
3597 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3601 /* Start mangling ENTITY. */
3604 start_mangling (const tree entity
)
3607 G
.need_abi_warning
= false;
3608 obstack_free (&name_obstack
, name_base
);
3609 mangle_obstack
= &name_obstack
;
3610 name_base
= obstack_alloc (&name_obstack
, 0);
3613 /* Done with mangling. If WARN is true, and the name of G.entity will
3614 be mangled differently in a future version of the ABI, issue a
3618 finish_mangling_internal (void)
3620 /* Clear all the substitutions. */
3621 vec_safe_truncate (G
.substitutions
, 0);
3623 /* Null-terminate the string. */
3628 /* Like finish_mangling_internal, but return the mangled string. */
3630 static inline const char *
3631 finish_mangling (void)
3633 finish_mangling_internal ();
3634 return (const char *) obstack_finish (mangle_obstack
);
3637 /* Like finish_mangling_internal, but return an identifier. */
3640 finish_mangling_get_identifier (void)
3642 finish_mangling_internal ();
3643 /* Don't obstack_finish here, and the next start_mangling will
3644 remove the identifier. */
3645 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3648 /* Initialize data structures for mangling. */
3653 gcc_obstack_init (&name_obstack
);
3654 name_base
= obstack_alloc (&name_obstack
, 0);
3655 vec_alloc (G
.substitutions
, 0);
3657 /* Cache these identifiers for quick comparison when checking for
3658 standard substitutions. */
3659 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3660 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3661 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3662 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3663 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3664 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3667 /* Generate the mangled name of DECL. */
3670 mangle_decl_string (const tree decl
)
3673 location_t saved_loc
= input_location
;
3674 tree saved_fn
= NULL_TREE
;
3675 bool template_p
= false;
3677 /* We shouldn't be trying to mangle an uninstantiated template. */
3678 gcc_assert (!type_dependent_expression_p (decl
));
3680 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3682 struct tinst_level
*tl
= current_instantiation ();
3683 if ((!tl
|| tl
->decl
!= decl
)
3684 && push_tinst_level (decl
))
3687 saved_fn
= current_function_decl
;
3688 current_function_decl
= NULL_TREE
;
3691 input_location
= DECL_SOURCE_LOCATION (decl
);
3693 start_mangling (decl
);
3695 if (TREE_CODE (decl
) == TYPE_DECL
)
3696 write_type (TREE_TYPE (decl
));
3698 write_mangled_name (decl
, true);
3700 result
= finish_mangling_get_identifier ();
3702 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3703 IDENTIFIER_POINTER (result
));
3708 current_function_decl
= saved_fn
;
3710 input_location
= saved_loc
;
3715 /* Return an identifier for the external mangled name of DECL. */
3718 get_mangled_id (tree decl
)
3720 tree id
= mangle_decl_string (decl
);
3721 return targetm
.mangle_decl_assembler_name (decl
, id
);
3724 /* If DECL is an implicit mangling alias, return its symtab node; otherwise
3727 static symtab_node
*
3728 decl_implicit_alias_p (tree decl
)
3730 if (DECL_P (decl
) && DECL_ARTIFICIAL (decl
)
3731 && DECL_IGNORED_P (decl
)
3732 && (TREE_CODE (decl
) == FUNCTION_DECL
3733 || (VAR_P (decl
) && TREE_STATIC (decl
))))
3735 symtab_node
*n
= symtab_node::get (decl
);
3736 if (n
&& n
->cpp_implicit_alias
)
3742 /* If DECL is a mangling alias, remove it from the symbol table and return
3743 true; otherwise return false. */
3746 maybe_remove_implicit_alias (tree decl
)
3748 if (symtab_node
*n
= decl_implicit_alias_p (decl
))
3756 /* Create an identifier for the external mangled name of DECL. */
3759 mangle_decl (const tree decl
)
3764 /* Don't bother mangling uninstantiated templates. */
3765 ++processing_template_decl
;
3766 if (TREE_CODE (decl
) == TYPE_DECL
)
3767 dep
= dependent_type_p (TREE_TYPE (decl
));
3769 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3770 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3771 --processing_template_decl
;
3775 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3776 It is not needed to assign names to anonymous namespace, but we use the
3777 "<anon>" marker to be able to tell if type is C++ ODR type or type
3778 produced by other language. */
3779 if (TREE_CODE (decl
) == TYPE_DECL
3780 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3781 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3782 id
= get_identifier ("<anon>");
3785 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3786 || !no_linkage_check (TREE_TYPE (decl
), true));
3787 if (abi_version_at_least (10))
3788 if (tree fn
= decl_function_context (decl
))
3789 maybe_check_abi_tags (fn
, decl
);
3790 id
= get_mangled_id (decl
);
3792 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3794 if (id
!= DECL_NAME (decl
)
3795 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3796 && TREE_CODE (decl
) != TYPE_DECL
3797 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3798 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3800 int save_ver
= flag_abi_version
;
3801 tree id2
= NULL_TREE
;
3803 if (!DECL_REALLY_EXTERN (decl
))
3807 /* Check IDENTIFIER_GLOBAL_VALUE before setting to avoid redundant
3808 errors from multiple definitions. */
3809 tree d
= IDENTIFIER_GLOBAL_VALUE (id
);
3810 if (!d
|| decl_implicit_alias_p (d
))
3813 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3816 if (!G
.need_abi_warning
)
3819 /* If the mangling will change in the future, emit an alias with the
3820 future mangled name for forward-compatibility. */
3823 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3824 inform (DECL_SOURCE_LOCATION (decl
), "a later -fabi-version= (or "
3825 "=0) avoids this error with a change in mangling");
3828 flag_abi_version
= flag_abi_compat_version
;
3829 id2
= mangle_decl_string (decl
);
3830 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3831 flag_abi_version
= save_ver
;
3834 note_mangling_alias (decl
, id2
);
3839 if (flag_abi_compat_version
!= warn_abi_version
3840 || id2
== NULL_TREE
)
3842 flag_abi_version
= warn_abi_version
;
3843 id2
= mangle_decl_string (decl
);
3844 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3846 flag_abi_version
= save_ver
;
3850 else if (warn_abi_version
!= 0
3851 && abi_version_at_least (warn_abi_version
))
3852 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3853 "the mangled name of %qD changed between "
3854 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3855 G
.entity
, warn_abi_version
, id2
,
3858 warning_at (DECL_SOURCE_LOCATION (G
.entity
), OPT_Wabi
,
3859 "the mangled name of %qD changes between "
3860 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3861 G
.entity
, save_ver
, id
,
3862 warn_abi_version
, id2
);
3865 flag_abi_version
= save_ver
;
3869 /* Generate the mangled representation of TYPE. */
3872 mangle_type_string (const tree type
)
3876 start_mangling (type
);
3878 result
= finish_mangling ();
3880 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3884 /* Create an identifier for the mangled name of a special component
3885 for belonging to TYPE. CODE is the ABI-specified code for this
3889 mangle_special_for_type (const tree type
, const char *code
)
3893 /* We don't have an actual decl here for the special component, so
3894 we can't just process the <encoded-name>. Instead, fake it. */
3895 start_mangling (type
);
3897 /* Start the mangling. */
3898 write_string ("_Z");
3899 write_string (code
);
3903 result
= finish_mangling_get_identifier ();
3906 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3907 IDENTIFIER_POINTER (result
));
3912 /* Create an identifier for the mangled representation of the typeinfo
3913 structure for TYPE. */
3916 mangle_typeinfo_for_type (const tree type
)
3918 return mangle_special_for_type (type
, "TI");
3921 /* Create an identifier for the mangled name of the NTBS containing
3922 the mangled name of TYPE. */
3925 mangle_typeinfo_string_for_type (const tree type
)
3927 return mangle_special_for_type (type
, "TS");
3930 /* Create an identifier for the mangled name of the vtable for TYPE. */
3933 mangle_vtbl_for_type (const tree type
)
3935 return mangle_special_for_type (type
, "TV");
3938 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3941 mangle_vtt_for_type (const tree type
)
3943 return mangle_special_for_type (type
, "TT");
3946 /* Return an identifier for a construction vtable group. TYPE is
3947 the most derived class in the hierarchy; BINFO is the base
3948 subobject for which this construction vtable group will be used.
3950 This mangling isn't part of the ABI specification; in the ABI
3951 specification, the vtable group is dumped in the same COMDAT as the
3952 main vtable, and is referenced only from that vtable, so it doesn't
3953 need an external name. For binary formats without COMDAT sections,
3954 though, we need external names for the vtable groups.
3956 We use the production
3958 <special-name> ::= CT <type> <offset number> _ <base type> */
3961 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
3965 start_mangling (type
);
3967 write_string ("_Z");
3968 write_string ("TC");
3970 write_integer_cst (BINFO_OFFSET (binfo
));
3972 write_type (BINFO_TYPE (binfo
));
3974 result
= finish_mangling_get_identifier ();
3976 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
3977 IDENTIFIER_POINTER (result
));
3981 /* Mangle a this pointer or result pointer adjustment.
3983 <call-offset> ::= h <fixed offset number> _
3984 ::= v <fixed offset number> _ <virtual offset number> _ */
3987 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
3989 write_char (virtual_offset
? 'v' : 'h');
3991 /* For either flavor, write the fixed offset. */
3992 write_integer_cst (fixed_offset
);
3995 /* For a virtual thunk, add the virtual offset. */
3998 write_integer_cst (virtual_offset
);
4003 /* Return an identifier for the mangled name of a this-adjusting or
4004 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
4005 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
4006 is a virtual thunk, and it is the vtbl offset in
4007 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
4008 zero for a covariant thunk. Note, that FN_DECL might be a covariant
4009 thunk itself. A covariant thunk name always includes the adjustment
4010 for the this pointer, even if there is none.
4012 <special-name> ::= T <call-offset> <base encoding>
4013 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
4017 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
4018 tree virtual_offset
)
4022 start_mangling (fn_decl
);
4024 write_string ("_Z");
4027 if (!this_adjusting
)
4029 /* Covariant thunk with no this adjustment */
4031 mangle_call_offset (integer_zero_node
, NULL_TREE
);
4032 mangle_call_offset (fixed_offset
, virtual_offset
);
4034 else if (!DECL_THUNK_P (fn_decl
))
4035 /* Plain this adjusting thunk. */
4036 mangle_call_offset (fixed_offset
, virtual_offset
);
4039 /* This adjusting thunk to covariant thunk. */
4041 mangle_call_offset (fixed_offset
, virtual_offset
);
4042 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
4043 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
4045 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
4046 mangle_call_offset (fixed_offset
, virtual_offset
);
4047 fn_decl
= THUNK_TARGET (fn_decl
);
4051 write_encoding (fn_decl
);
4053 result
= finish_mangling_get_identifier ();
4055 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
4059 struct conv_type_hasher
: ggc_ptr_hash
<tree_node
>
4061 static hashval_t
hash (tree
);
4062 static bool equal (tree
, tree
);
4065 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
4066 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
4069 static GTY (()) hash_table
<conv_type_hasher
> *conv_type_names
;
4071 /* Hash a node (VAL1) in the table. */
4074 conv_type_hasher::hash (tree val
)
4076 return (hashval_t
) TYPE_UID (TREE_TYPE (val
));
4079 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
4082 conv_type_hasher::equal (tree val1
, tree val2
)
4084 return TREE_TYPE (val1
) == val2
;
4087 /* Return an identifier for the mangled unqualified name for a
4088 conversion operator to TYPE. This mangling is not specified by the
4089 ABI spec; it is only used internally. */
4092 mangle_conv_op_name_for_type (const tree type
)
4097 if (type
== error_mark_node
)
4098 return error_mark_node
;
4100 if (conv_type_names
== NULL
)
4101 conv_type_names
= hash_table
<conv_type_hasher
>::create_ggc (31);
4103 slot
= conv_type_names
->find_slot_with_hash (type
,
4104 (hashval_t
) TYPE_UID (type
),
4111 /* Create a unique name corresponding to TYPE. */
4112 sprintf (buffer
, "operator %lu",
4113 (unsigned long) conv_type_names
->elements ());
4114 identifier
= get_identifier (buffer
);
4117 /* Hang TYPE off the identifier so it can be found easily later
4118 when performing conversions. */
4119 TREE_TYPE (identifier
) = type
;
4121 /* Set bits on the identifier so we know later it's a conversion. */
4122 IDENTIFIER_OPNAME_P (identifier
) = 1;
4123 IDENTIFIER_TYPENAME_P (identifier
) = 1;
4129 /* Handle ABI backwards compatibility for past bugs where we didn't call
4130 check_abi_tags in places where it's needed: call check_abi_tags and warn if
4131 it makes a difference. If FOR_DECL is non-null, it's the declaration
4132 that we're actually trying to mangle; if it's null, we're mangling the
4133 guard variable for T. */
4136 maybe_check_abi_tags (tree t
, tree for_decl
)
4138 if (DECL_ASSEMBLER_NAME_SET_P (t
))
4141 tree oldtags
= get_abi_tags (t
);
4145 tree newtags
= get_abi_tags (t
);
4146 if (newtags
&& newtags
!= oldtags
4147 && abi_version_crosses (10))
4150 warning_at (DECL_SOURCE_LOCATION (for_decl
), OPT_Wabi
,
4151 "the mangled name of %qD changes between "
4152 "-fabi-version=%d and -fabi-version=%d",
4153 for_decl
, flag_abi_version
, warn_abi_version
);
4155 warning_at (DECL_SOURCE_LOCATION (t
), OPT_Wabi
,
4156 "the mangled name of the initialization guard variable for"
4157 "%qD changes between -fabi-version=%d and -fabi-version=%d",
4158 t
, flag_abi_version
, warn_abi_version
);
4162 /* Write out the appropriate string for this variable when generating
4163 another mangled name based on this one. */
4166 write_guarded_var_name (const tree variable
)
4168 if (DECL_NAME (variable
)
4169 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
4170 /* The name of a guard variable for a reference temporary should refer
4171 to the reference, not the temporary. */
4172 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
4174 write_name (variable
, /*ignore_local_scope=*/0);
4177 /* Return an identifier for the name of an initialization guard
4178 variable for indicated VARIABLE. */
4181 mangle_guard_variable (const tree variable
)
4183 if (abi_version_at_least (10))
4184 maybe_check_abi_tags (variable
);
4185 start_mangling (variable
);
4186 write_string ("_ZGV");
4187 write_guarded_var_name (variable
);
4188 return finish_mangling_get_identifier ();
4191 /* Return an identifier for the name of a thread_local initialization
4192 function for VARIABLE. */
4195 mangle_tls_init_fn (const tree variable
)
4197 start_mangling (variable
);
4198 write_string ("_ZTH");
4199 write_guarded_var_name (variable
);
4200 return finish_mangling_get_identifier ();
4203 /* Return an identifier for the name of a thread_local wrapper
4204 function for VARIABLE. */
4206 #define TLS_WRAPPER_PREFIX "_ZTW"
4209 mangle_tls_wrapper_fn (const tree variable
)
4211 start_mangling (variable
);
4212 write_string (TLS_WRAPPER_PREFIX
);
4213 write_guarded_var_name (variable
);
4214 return finish_mangling_get_identifier ();
4217 /* Return true iff FN is a thread_local wrapper function. */
4220 decl_tls_wrapper_p (const tree fn
)
4222 if (TREE_CODE (fn
) != FUNCTION_DECL
)
4224 tree name
= DECL_NAME (fn
);
4225 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
4226 strlen (TLS_WRAPPER_PREFIX
)) == 0;
4229 /* Return an identifier for the name of a temporary variable used to
4230 initialize a static reference. This isn't part of the ABI, but we might
4231 as well call them something readable. */
4233 static GTY(()) int temp_count
;
4236 mangle_ref_init_variable (const tree variable
)
4238 start_mangling (variable
);
4239 write_string ("_ZGR");
4240 check_abi_tags (variable
);
4241 write_name (variable
, /*ignore_local_scope=*/0);
4242 /* Avoid name clashes with aggregate initialization of multiple
4243 references at once. */
4244 write_unsigned_number (temp_count
++);
4245 return finish_mangling_get_identifier ();
4249 /* Foreign language type mangling section. */
4251 /* How to write the type codes for the integer Java type. */
4254 write_java_integer_type_codes (const tree type
)
4256 if (type
== java_int_type_node
)
4258 else if (type
== java_short_type_node
)
4260 else if (type
== java_byte_type_node
)
4262 else if (type
== java_char_type_node
)
4264 else if (type
== java_long_type_node
)
4266 else if (type
== java_boolean_type_node
)
4272 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4273 function generates a mangled name for the vtable map variable of
4274 the class type. For example, if the class type is
4275 "std::bad_exception", the mangled name for the class is
4276 "St13bad_exception". This function would generate the name
4277 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4278 "_VTV<std::bad_exception>::__vtable_map". */
4282 get_mangled_vtable_map_var_name (tree class_type
)
4284 char *var_name
= NULL
;
4285 const char *prefix
= "_ZN4_VTVI";
4286 const char *postfix
= "E12__vtable_mapE";
4288 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4290 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4292 if (strstr (IDENTIFIER_POINTER (class_id
), "<anon>") != NULL
)
4294 class_id
= get_mangled_id (TYPE_NAME (class_type
));
4295 vtbl_register_mangled_name (TYPE_NAME (class_type
), class_id
);
4298 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4300 strlen (postfix
) + 1;
4302 var_name
= (char *) xmalloc (len
);
4304 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4309 #include "gt-cp-mangle.h"