1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000-2015 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"
54 #include "tree-hasher.h"
55 #include "stor-layout.h"
56 #include "stringpool.h"
62 #include "plugin-api.h"
63 #include "hard-reg-set.h"
69 /* Debugging support. */
71 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
73 #define DEBUG_MANGLE 0
76 /* Macros for tracing the write_* functions. */
78 # define MANGLE_TRACE(FN, INPUT) \
79 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
80 # define MANGLE_TRACE_TREE(FN, NODE) \
81 fprintf (stderr, " %-24s: %-24s (%p)\n", \
82 (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE))
84 # define MANGLE_TRACE(FN, INPUT)
85 # define MANGLE_TRACE_TREE(FN, NODE)
88 /* Nonzero if NODE is a class template-id. We can't rely on
89 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
90 that hard to distinguish A<T> from A, where A<T> is the type as
91 instantiated outside of the template, and A is the type used
92 without parameters inside the template. */
93 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
94 (TYPE_LANG_SPECIFIC (NODE) != NULL \
95 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
96 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
97 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
99 /* Things we only need one of. This module is not reentrant. */
100 typedef struct GTY(()) globals
{
101 /* An array of the current substitution candidates, in the order
103 vec
<tree
, va_gc
> *substitutions
;
105 /* The entity that is being mangled. */
106 tree
GTY ((skip
)) entity
;
108 /* How many parameter scopes we are inside. */
111 /* True if the mangling will be different in a future version of the
113 bool need_abi_warning
;
116 static GTY (()) globals G
;
118 /* The obstack on which we build mangled names. */
119 static struct obstack
*mangle_obstack
;
121 /* The obstack on which we build mangled names that are not going to
122 be IDENTIFIER_NODEs. */
123 static struct obstack name_obstack
;
125 /* The first object on the name_obstack; we use this to free memory
126 allocated on the name_obstack. */
127 static void *name_base
;
129 /* Indices into subst_identifiers. These are identifiers used in
130 special substitution rules. */
138 SUBID_BASIC_IOSTREAM
,
141 substitution_identifier_index_t
;
143 /* For quick substitution checks, look up these common identifiers
145 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
147 /* Single-letter codes for builtin integer types, defined in
148 <builtin-type>. These are indexed by integer_type_kind values. */
150 integer_type_codes
[itk_none
] =
153 'a', /* itk_signed_char */
154 'h', /* itk_unsigned_char */
156 't', /* itk_unsigned_short */
158 'j', /* itk_unsigned_int */
160 'm', /* itk_unsigned_long */
161 'x', /* itk_long_long */
162 'y', /* itk_unsigned_long_long */
163 /* __intN types are handled separately */
164 '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0'
167 static int decl_is_template_id (const tree
, tree
* const);
169 /* Functions for handling substitutions. */
171 static inline tree
canonicalize_for_substitution (tree
);
172 static void add_substitution (tree
);
173 static inline int is_std_substitution (const tree
,
174 const substitution_identifier_index_t
);
175 static inline int is_std_substitution_char (const tree
,
176 const substitution_identifier_index_t
);
177 static int find_substitution (tree
);
178 static void mangle_call_offset (const tree
, const tree
);
180 /* Functions for emitting mangled representations of things. */
182 static void write_mangled_name (const tree
, bool);
183 static void write_encoding (const tree
);
184 static void write_name (tree
, const int);
185 static void write_abi_tags (tree
);
186 static void write_unscoped_name (const tree
);
187 static void write_unscoped_template_name (const tree
);
188 static void write_nested_name (const tree
);
189 static void write_prefix (const tree
);
190 static void write_template_prefix (const tree
);
191 static void write_unqualified_name (tree
);
192 static void write_conversion_operator_name (const tree
);
193 static void write_source_name (tree
);
194 static void write_literal_operator_name (tree
);
195 static void write_unnamed_type_name (const tree
);
196 static void write_closure_type_name (const tree
);
197 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
199 static void write_number (unsigned HOST_WIDE_INT
, const int,
201 static void write_compact_number (int num
);
202 static void write_integer_cst (const tree
);
203 static void write_real_cst (const tree
);
204 static void write_identifier (const char *);
205 static void write_special_name_constructor (const tree
);
206 static void write_special_name_destructor (const tree
);
207 static void write_type (tree
);
208 static int write_CV_qualifiers_for_type (const tree
);
209 static void write_builtin_type (tree
);
210 static void write_function_type (const tree
);
211 static void write_bare_function_type (const tree
, const int, const tree
);
212 static void write_method_parms (tree
, const int, const tree
);
213 static void write_class_enum_type (const tree
);
214 static void write_template_args (tree
);
215 static void write_expression (tree
);
216 static void write_template_arg_literal (const tree
);
217 static void write_template_arg (tree
);
218 static void write_template_template_arg (const tree
);
219 static void write_array_type (const tree
);
220 static void write_pointer_to_member_type (const tree
);
221 static void write_template_param (const tree
);
222 static void write_template_template_param (const tree
);
223 static void write_substitution (const int);
224 static int discriminator_for_local_entity (tree
);
225 static int discriminator_for_string_literal (tree
, tree
);
226 static void write_discriminator (const int);
227 static void write_local_name (tree
, const tree
, const tree
);
228 static void dump_substitution_candidates (void);
229 static tree
mangle_decl_string (const tree
);
230 static int local_class_index (tree
);
232 /* Control functions. */
234 static inline void start_mangling (const tree
);
235 static tree
mangle_special_for_type (const tree
, const char *);
237 /* Foreign language functions. */
239 static void write_java_integer_type_codes (const tree
);
241 /* Append a single character to the end of the mangled
243 #define write_char(CHAR) \
244 obstack_1grow (mangle_obstack, (CHAR))
246 /* Append a sized buffer to the end of the mangled representation. */
247 #define write_chars(CHAR, LEN) \
248 obstack_grow (mangle_obstack, (CHAR), (LEN))
250 /* Append a NUL-terminated string to the end of the mangled
252 #define write_string(STRING) \
253 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
255 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
256 same purpose (context, which may be a type) and value (template
257 decl). See write_template_prefix for more information on what this
259 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
260 (TREE_CODE (NODE1) == TREE_LIST \
261 && TREE_CODE (NODE2) == TREE_LIST \
262 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
263 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
264 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
265 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
267 /* Write out an unsigned quantity in base 10. */
268 #define write_unsigned_number(NUMBER) \
269 write_number ((NUMBER), /*unsigned_p=*/1, 10)
271 /* If DECL is a template instance, return nonzero and, if
272 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
273 Otherwise return zero. */
276 decl_is_template_id (const tree decl
, tree
* const template_info
)
278 if (TREE_CODE (decl
) == TYPE_DECL
)
280 /* TYPE_DECLs are handled specially. Look at its type to decide
281 if this is a template instantiation. */
282 const tree type
= TREE_TYPE (decl
);
284 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
286 if (template_info
!= NULL
)
287 /* For a templated TYPE_DECL, the template info is hanging
289 *template_info
= TYPE_TEMPLATE_INFO (type
);
295 /* Check if this is a primary template. */
296 if (DECL_LANG_SPECIFIC (decl
) != NULL
297 && DECL_USE_TEMPLATE (decl
)
298 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
299 && TREE_CODE (decl
) != TEMPLATE_DECL
)
301 if (template_info
!= NULL
)
302 /* For most templated decls, the template info is hanging
304 *template_info
= DECL_TEMPLATE_INFO (decl
);
309 /* It's not a template id. */
313 /* Produce debugging output of current substitution candidates. */
316 dump_substitution_candidates (void)
321 fprintf (stderr
, " ++ substitutions ");
322 FOR_EACH_VEC_ELT (*G
.substitutions
, i
, el
)
324 const char *name
= "???";
327 fprintf (stderr
, " ");
329 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
330 else if (TREE_CODE (el
) == TREE_LIST
)
331 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
332 else if (TYPE_NAME (el
))
333 name
= TYPE_NAME_STRING (el
);
334 fprintf (stderr
, " S%d_ = ", i
- 1);
336 (CP_TYPE_RESTRICT_P (el
)
337 || CP_TYPE_VOLATILE_P (el
)
338 || CP_TYPE_CONST_P (el
)))
339 fprintf (stderr
, "CV-");
340 fprintf (stderr
, "%s (%s at %p)\n",
341 name
, get_tree_code_name (TREE_CODE (el
)), (void *) el
);
345 /* Both decls and types can be substitution candidates, but sometimes
346 they refer to the same thing. For instance, a TYPE_DECL and
347 RECORD_TYPE for the same class refer to the same thing, and should
348 be treated accordingly in substitutions. This function returns a
349 canonicalized tree node representing NODE that is used when adding
350 and substitution candidates and finding matches. */
353 canonicalize_for_substitution (tree node
)
355 /* For a TYPE_DECL, use the type instead. */
356 if (TREE_CODE (node
) == TYPE_DECL
)
357 node
= TREE_TYPE (node
);
359 && TYPE_CANONICAL (node
) != node
360 && TYPE_MAIN_VARIANT (node
) != node
)
363 /* Here we want to strip the topmost typedef only.
364 We need to do that so is_std_substitution can do proper
366 if (TREE_CODE (node
) == FUNCTION_TYPE
)
367 /* Use build_qualified_type and TYPE_QUALS here to preserve
368 the old buggy mangling of attribute noreturn with abi<5. */
369 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
372 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
373 cp_type_quals (node
));
374 if (TREE_CODE (node
) == FUNCTION_TYPE
375 || TREE_CODE (node
) == METHOD_TYPE
)
376 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
381 /* Add NODE as a substitution candidate. NODE must not already be on
382 the list of candidates. */
385 add_substitution (tree node
)
390 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
391 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
393 /* Get the canonicalized substitution candidate for NODE. */
394 c
= canonicalize_for_substitution (node
);
395 if (DEBUG_MANGLE
&& c
!= node
)
396 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
397 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
401 /* Make sure NODE isn't already a candidate. */
406 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
408 gcc_assert (!(DECL_P (node
) && node
== candidate
));
409 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
410 && same_type_p (node
, candidate
)));
413 #endif /* ENABLE_CHECKING */
415 /* Put the decl onto the varray of substitution candidates. */
416 vec_safe_push (G
.substitutions
, node
);
419 dump_substitution_candidates ();
422 /* Helper function for find_substitution. Returns nonzero if NODE,
423 which may be a decl or a CLASS_TYPE, is a template-id with template
424 name of substitution_index[INDEX] in the ::std namespace. */
427 is_std_substitution (const tree node
,
428 const substitution_identifier_index_t index
)
435 type
= TREE_TYPE (node
);
438 else if (CLASS_TYPE_P (node
))
441 decl
= TYPE_NAME (node
);
444 /* These are not the droids you're looking for. */
447 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
448 && TYPE_LANG_SPECIFIC (type
)
449 && TYPE_TEMPLATE_INFO (type
)
450 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
451 == subst_identifiers
[index
]));
454 /* Helper function for find_substitution. Returns nonzero if NODE,
455 which may be a decl or a CLASS_TYPE, is the template-id
456 ::std::identifier<char>, where identifier is
457 substitution_index[INDEX]. */
460 is_std_substitution_char (const tree node
,
461 const substitution_identifier_index_t index
)
464 /* Check NODE's name is ::std::identifier. */
465 if (!is_std_substitution (node
, index
))
467 /* Figure out its template args. */
469 args
= DECL_TI_ARGS (node
);
470 else if (CLASS_TYPE_P (node
))
471 args
= CLASSTYPE_TI_ARGS (node
);
473 /* Oops, not a template. */
475 /* NODE's template arg list should be <char>. */
477 TREE_VEC_LENGTH (args
) == 1
478 && TREE_VEC_ELT (args
, 0) == char_type_node
;
481 /* Check whether a substitution should be used to represent NODE in
484 First, check standard special-case substitutions.
486 <substitution> ::= St
493 # ::std::basic_string
496 # ::std::basic_string<char,
497 ::std::char_traits<char>,
498 ::std::allocator<char> >
501 # ::std::basic_istream<char, ::std::char_traits<char> >
504 # ::std::basic_ostream<char, ::std::char_traits<char> >
507 # ::std::basic_iostream<char, ::std::char_traits<char> >
509 Then examine the stack of currently available substitution
510 candidates for entities appearing earlier in the same mangling
512 If a substitution is found, write its mangled representation and
513 return nonzero. If none is found, just return zero. */
516 find_substitution (tree node
)
519 const int size
= vec_safe_length (G
.substitutions
);
522 const char *abbr
= NULL
;
525 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
526 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
528 /* Obtain the canonicalized substitution representation for NODE.
529 This is what we'll compare against. */
530 node
= canonicalize_for_substitution (node
);
532 /* Check for builtin substitutions. */
534 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
535 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
537 /* Check for std::allocator. */
539 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
540 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
543 /* Check for std::basic_string. */
544 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
548 /* If this is a type (i.e. a fully-qualified template-id),
550 std::basic_string <char,
551 std::char_traits<char>,
552 std::allocator<char> > . */
553 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
554 && CLASSTYPE_USE_TEMPLATE (type
))
556 tree args
= CLASSTYPE_TI_ARGS (type
);
557 if (TREE_VEC_LENGTH (args
) == 3
558 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
559 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
561 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
567 /* Substitute for the template name only if this isn't a type. */
571 /* Check for basic_{i,o,io}stream. */
572 else if (TYPE_P (node
)
573 && cp_type_quals (type
) == TYPE_UNQUALIFIED
574 && CLASS_TYPE_P (type
)
575 && CLASSTYPE_USE_TEMPLATE (type
)
576 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
578 /* First, check for the template
579 args <char, std::char_traits<char> > . */
580 tree args
= CLASSTYPE_TI_ARGS (type
);
581 if (TREE_VEC_LENGTH (args
) == 2
582 && TYPE_P (TREE_VEC_ELT (args
, 0))
583 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
584 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
587 /* Got them. Is this basic_istream? */
588 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
590 /* Or basic_ostream? */
591 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
593 /* Or basic_iostream? */
594 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
599 /* Check for namespace std. */
600 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
606 tree tags
= NULL_TREE
;
607 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
608 tags
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (type
));
609 /* Now check the list of available substitutions for this mangling
611 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
613 tree candidate
= (*G
.substitutions
)[i
];
614 /* NODE is a matched to a candidate if it's the same decl node or
615 if it's the same type. */
616 if (decl
== candidate
617 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
618 && same_type_p (type
, candidate
))
619 || NESTED_TEMPLATE_MATCH (node
, candidate
))
621 write_substitution (i
);
627 /* No substitution found. */
633 /* If there are ABI tags on the abbreviation, it becomes
634 a substitution candidate. */
635 write_abi_tags (tags
);
636 add_substitution (node
);
641 /* Returns whether DECL's symbol name should be the plain unqualified-id
642 rather than a more complicated mangled name. */
645 unmangled_name_p (const tree decl
)
647 if (TREE_CODE (decl
) == FUNCTION_DECL
)
649 /* The names of `extern "C"' functions are not mangled. */
650 return (DECL_EXTERN_C_FUNCTION_P (decl
)
651 /* But overloaded operator names *are* mangled. */
652 && !DECL_OVERLOADED_OPERATOR_P (decl
));
654 else if (VAR_P (decl
))
656 /* static variables are mangled. */
657 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
660 /* extern "C" declarations aren't mangled. */
661 if (DECL_EXTERN_C_P (decl
))
664 /* Other variables at non-global scope are mangled. */
665 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
668 /* Variable template instantiations are mangled. */
669 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
670 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
673 /* Declarations with ABI tags are mangled. */
674 if (lookup_attribute ("abi_tag", DECL_ATTRIBUTES (decl
)))
677 /* The names of non-static global variables aren't mangled. */
684 /* TOP_LEVEL is true, if this is being called at outermost level of
685 mangling. It should be false when mangling a decl appearing in an
686 expression within some other mangling.
688 <mangled-name> ::= _Z <encoding> */
691 write_mangled_name (const tree decl
, bool top_level
)
693 MANGLE_TRACE_TREE ("mangled-name", decl
);
695 check_abi_tags (decl
);
697 if (unmangled_name_p (decl
))
700 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
703 /* The standard notes: "The <encoding> of an extern "C"
704 function is treated like global-scope data, i.e. as its
705 <source-name> without a type." We cannot write
706 overloaded operators that way though, because it contains
707 characters invalid in assembler. */
709 write_source_name (DECL_NAME (decl
));
715 write_encoding (decl
);
719 /* Returns true if the return type of DECL is part of its signature, and
720 therefore its mangling. */
723 mangle_return_type_p (tree decl
)
725 return (!DECL_CONSTRUCTOR_P (decl
)
726 && !DECL_DESTRUCTOR_P (decl
)
727 && !DECL_CONV_FN_P (decl
)
728 && decl_is_template_id (decl
, NULL
));
731 /* <encoding> ::= <function name> <bare-function-type>
735 write_encoding (const tree decl
)
737 MANGLE_TRACE_TREE ("encoding", decl
);
739 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
741 /* For overloaded operators write just the mangled name
742 without arguments. */
743 if (DECL_OVERLOADED_OPERATOR_P (decl
))
744 write_name (decl
, /*ignore_local_scope=*/0);
746 write_source_name (DECL_NAME (decl
));
750 write_name (decl
, /*ignore_local_scope=*/0);
751 if (TREE_CODE (decl
) == FUNCTION_DECL
)
756 if (decl_is_template_id (decl
, NULL
))
758 fn_type
= get_mostly_instantiated_function_type (decl
);
759 /* FN_TYPE will not have parameter types for in-charge or
760 VTT parameters. Therefore, we pass NULL_TREE to
761 write_bare_function_type -- otherwise, it will get
762 confused about which artificial parameters to skip. */
767 fn_type
= TREE_TYPE (decl
);
771 write_bare_function_type (fn_type
,
772 mangle_return_type_p (decl
),
777 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
778 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
781 decl_mangling_context (tree decl
)
783 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
785 if (tcontext
!= NULL_TREE
)
788 if (TREE_CODE (decl
) == TEMPLATE_DECL
789 && DECL_TEMPLATE_RESULT (decl
))
790 decl
= DECL_TEMPLATE_RESULT (decl
);
792 if (TREE_CODE (decl
) == TYPE_DECL
793 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
795 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
799 else if (template_type_parameter_p (decl
))
800 /* template type parms have no mangling context. */
802 return CP_DECL_CONTEXT (decl
);
805 /* <name> ::= <unscoped-name>
806 ::= <unscoped-template-name> <template-args>
810 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
811 called from <local-name>, which mangles the enclosing scope
812 elsewhere and then uses this function to mangle just the part
813 underneath the function scope. So don't use the <local-name>
814 production, to avoid an infinite recursion. */
817 write_name (tree decl
, const int ignore_local_scope
)
821 MANGLE_TRACE_TREE ("name", decl
);
823 if (TREE_CODE (decl
) == TYPE_DECL
)
825 /* In case this is a typedef, fish out the corresponding
826 TYPE_DECL for the main variant. */
827 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
830 context
= decl_mangling_context (decl
);
832 gcc_assert (context
!= NULL_TREE
);
834 if (abi_version_crosses (7)
835 && ignore_local_scope
836 && TREE_CODE (context
) == PARM_DECL
)
837 G
.need_abi_warning
= 1;
839 /* A decl in :: or ::std scope is treated specially. The former is
840 mangled using <unscoped-name> or <unscoped-template-name>, the
841 latter with a special substitution. Also, a name that is
842 directly in a local function scope is also mangled with
843 <unscoped-name> rather than a full <nested-name>. */
844 if (context
== global_namespace
845 || DECL_NAMESPACE_STD_P (context
)
846 || (ignore_local_scope
847 && (TREE_CODE (context
) == FUNCTION_DECL
848 || (abi_version_at_least (7)
849 && TREE_CODE (context
) == PARM_DECL
))))
852 /* Is this a template instance? */
853 if (decl_is_template_id (decl
, &template_info
))
855 /* Yes: use <unscoped-template-name>. */
856 write_unscoped_template_name (TI_TEMPLATE (template_info
));
857 write_template_args (TI_ARGS (template_info
));
860 /* Everything else gets an <unqualified-name>. */
861 write_unscoped_name (decl
);
865 /* Handle local names, unless we asked not to (that is, invoked
866 under <local-name>, to handle only the part of the name under
868 if (!ignore_local_scope
)
870 /* Scan up the list of scope context, looking for a
871 function. If we find one, this entity is in local
872 function scope. local_entity tracks context one scope
873 level down, so it will contain the element that's
874 directly in that function's scope, either decl or one of
875 its enclosing scopes. */
876 tree local_entity
= decl
;
877 while (context
!= global_namespace
)
879 /* Make sure we're always dealing with decls. */
880 if (TYPE_P (context
))
881 context
= TYPE_NAME (context
);
882 /* Is this a function? */
883 if (TREE_CODE (context
) == FUNCTION_DECL
884 || TREE_CODE (context
) == PARM_DECL
)
886 /* Yes, we have local scope. Use the <local-name>
887 production for the innermost function scope. */
888 write_local_name (context
, local_entity
, decl
);
891 /* Up one scope level. */
892 local_entity
= context
;
893 context
= decl_mangling_context (context
);
896 /* No local scope found? Fall through to <nested-name>. */
899 /* Other decls get a <nested-name> to encode their scope. */
900 write_nested_name (decl
);
904 /* <unscoped-name> ::= <unqualified-name>
905 ::= St <unqualified-name> # ::std:: */
908 write_unscoped_name (const tree decl
)
910 tree context
= decl_mangling_context (decl
);
912 MANGLE_TRACE_TREE ("unscoped-name", decl
);
914 /* Is DECL in ::std? */
915 if (DECL_NAMESPACE_STD_P (context
))
918 write_unqualified_name (decl
);
922 /* If not, it should be either in the global namespace, or directly
923 in a local function scope. A lambda can also be mangled in the
924 scope of a default argument. */
925 gcc_assert (context
== global_namespace
926 || TREE_CODE (context
) == PARM_DECL
927 || TREE_CODE (context
) == FUNCTION_DECL
);
929 write_unqualified_name (decl
);
933 /* <unscoped-template-name> ::= <unscoped-name>
934 ::= <substitution> */
937 write_unscoped_template_name (const tree decl
)
939 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
941 if (find_substitution (decl
))
943 write_unscoped_name (decl
);
944 add_substitution (decl
);
947 /* Write the nested name, including CV-qualifiers, of DECL.
949 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
950 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
952 <ref-qualifier> ::= R # & ref-qualifier
953 ::= O # && ref-qualifier
954 <CV-qualifiers> ::= [r] [V] [K] */
957 write_nested_name (const tree decl
)
961 MANGLE_TRACE_TREE ("nested-name", decl
);
965 /* Write CV-qualifiers, if this is a member function. */
966 if (TREE_CODE (decl
) == FUNCTION_DECL
967 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
969 if (DECL_VOLATILE_MEMFUNC_P (decl
))
971 if (DECL_CONST_MEMFUNC_P (decl
))
973 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
975 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
982 /* Is this a template instance? */
983 if (decl_is_template_id (decl
, &template_info
))
985 /* Yes, use <template-prefix>. */
986 write_template_prefix (decl
);
987 write_template_args (TI_ARGS (template_info
));
989 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
991 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
992 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
994 write_template_prefix (decl
);
995 write_template_args (TREE_OPERAND (name
, 1));
999 write_prefix (decl_mangling_context (decl
));
1000 write_unqualified_name (decl
);
1005 /* No, just use <prefix> */
1006 write_prefix (decl_mangling_context (decl
));
1007 write_unqualified_name (decl
);
1012 /* <prefix> ::= <prefix> <unqualified-name>
1013 ::= <template-param>
1014 ::= <template-prefix> <template-args>
1017 ::= <substitution> */
1020 write_prefix (const tree node
)
1023 /* Non-NULL if NODE represents a template-id. */
1024 tree template_info
= NULL
;
1027 || node
== global_namespace
)
1030 MANGLE_TRACE_TREE ("prefix", node
);
1032 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1038 if (find_substitution (node
))
1043 /* If this is a function or parm decl, that means we've hit function
1044 scope, so this prefix must be for a local name. In this
1045 case, we're under the <local-name> production, which encodes
1046 the enclosing function scope elsewhere. So don't continue
1048 if (TREE_CODE (node
) == FUNCTION_DECL
1049 || TREE_CODE (node
) == PARM_DECL
)
1053 decl_is_template_id (decl
, &template_info
);
1057 /* Node is a type. */
1058 decl
= TYPE_NAME (node
);
1059 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1060 template_info
= TYPE_TEMPLATE_INFO (node
);
1063 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1064 write_template_param (node
);
1065 else if (template_info
!= NULL
)
1068 write_template_prefix (decl
);
1069 write_template_args (TI_ARGS (template_info
));
1071 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1073 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1074 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1076 write_template_prefix (decl
);
1077 write_template_args (TREE_OPERAND (name
, 1));
1081 write_prefix (decl_mangling_context (decl
));
1082 write_unqualified_name (decl
);
1086 /* Not templated. */
1088 write_prefix (decl_mangling_context (decl
));
1089 write_unqualified_name (decl
);
1091 || TREE_CODE (decl
) == FIELD_DECL
)
1093 /* <data-member-prefix> := <member source-name> M */
1099 add_substitution (node
);
1102 /* <template-prefix> ::= <prefix> <template component>
1103 ::= <template-param>
1104 ::= <substitution> */
1107 write_template_prefix (const tree node
)
1109 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1110 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1111 tree context
= decl_mangling_context (decl
);
1116 MANGLE_TRACE_TREE ("template-prefix", node
);
1118 /* Find the template decl. */
1119 if (decl_is_template_id (decl
, &template_info
))
1120 templ
= TI_TEMPLATE (template_info
);
1121 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1122 /* For a typename type, all we have is the name. */
1123 templ
= DECL_NAME (decl
);
1126 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1128 templ
= TYPE_TI_TEMPLATE (type
);
1131 /* For a member template, though, the template name for the
1132 innermost name must have all the outer template levels
1133 instantiated. For instance, consider
1135 template<typename T> struct Outer {
1136 template<typename U> struct Inner {};
1139 The template name for `Inner' in `Outer<int>::Inner<float>' is
1140 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1141 levels separately, so there's no TEMPLATE_DECL available for this
1142 (there's only `Outer<T>::Inner<U>').
1144 In order to get the substitutions right, we create a special
1145 TREE_LIST to represent the substitution candidate for a nested
1146 template. The TREE_PURPOSE is the template's context, fully
1147 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1150 So, for the example above, `Outer<int>::Inner' is represented as a
1151 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1152 and whose value is `Outer<T>::Inner<U>'. */
1153 if (TYPE_P (context
))
1154 substitution
= build_tree_list (context
, templ
);
1156 substitution
= templ
;
1158 if (find_substitution (substitution
))
1161 if (TREE_TYPE (templ
)
1162 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1163 write_template_param (TREE_TYPE (templ
));
1166 write_prefix (context
);
1167 write_unqualified_name (decl
);
1170 add_substitution (substitution
);
1173 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1174 mangled through special entry points.
1176 <unqualified-name> ::= <operator-name>
1179 ::= <unnamed-type-name>
1180 ::= <local-source-name>
1182 <local-source-name> ::= L <source-name> <discriminator> */
1185 write_unqualified_id (tree identifier
)
1187 if (IDENTIFIER_TYPENAME_P (identifier
))
1188 write_conversion_operator_name (TREE_TYPE (identifier
));
1189 else if (IDENTIFIER_OPNAME_P (identifier
))
1192 const char *mangled_name
= NULL
;
1194 /* Unfortunately, there is no easy way to go from the
1195 name of the operator back to the corresponding tree
1197 for (i
= 0; i
< MAX_TREE_CODES
; ++i
)
1198 if (operator_name_info
[i
].identifier
== identifier
)
1200 /* The ABI says that we prefer binary operator
1201 names to unary operator names. */
1202 if (operator_name_info
[i
].arity
== 2)
1204 mangled_name
= operator_name_info
[i
].mangled_name
;
1207 else if (!mangled_name
)
1208 mangled_name
= operator_name_info
[i
].mangled_name
;
1210 else if (assignment_operator_name_info
[i
].identifier
1214 = assignment_operator_name_info
[i
].mangled_name
;
1217 write_string (mangled_name
);
1219 else if (UDLIT_OPER_P (identifier
))
1220 write_literal_operator_name (identifier
);
1222 write_source_name (identifier
);
1226 write_unqualified_name (tree decl
)
1228 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1230 if (identifier_p (decl
))
1232 write_unqualified_id (decl
);
1238 if (DECL_NAME (decl
) == NULL_TREE
)
1241 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1242 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1244 else if (DECL_DECLARES_FUNCTION_P (decl
))
1247 if (DECL_CONSTRUCTOR_P (decl
))
1248 write_special_name_constructor (decl
);
1249 else if (DECL_DESTRUCTOR_P (decl
))
1250 write_special_name_destructor (decl
);
1251 else if (DECL_CONV_FN_P (decl
))
1253 /* Conversion operator. Handle it right here.
1254 <operator> ::= cv <type> */
1256 if (decl_is_template_id (decl
, NULL
))
1259 fn_type
= get_mostly_instantiated_function_type (decl
);
1260 type
= TREE_TYPE (fn_type
);
1262 else if (FNDECL_USED_AUTO (decl
))
1263 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1264 ->x_auto_return_pattern
);
1266 type
= DECL_CONV_FN_TYPE (decl
);
1267 write_conversion_operator_name (type
);
1269 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1271 operator_name_info_t
*oni
;
1272 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1273 oni
= assignment_operator_name_info
;
1275 oni
= operator_name_info
;
1277 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1279 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1280 write_literal_operator_name (DECL_NAME (decl
));
1287 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1288 && DECL_NAMESPACE_SCOPE_P (decl
)
1289 && decl_linkage (decl
) == lk_internal
)
1291 MANGLE_TRACE_TREE ("local-source-name", decl
);
1293 write_source_name (DECL_NAME (decl
));
1294 /* The default discriminator is 1, and that's all we ever use,
1295 so there's no code to output one here. */
1299 tree type
= TREE_TYPE (decl
);
1301 if (TREE_CODE (decl
) == TYPE_DECL
1302 && TYPE_ANONYMOUS_P (type
))
1303 write_unnamed_type_name (type
);
1304 else if (TREE_CODE (decl
) == TYPE_DECL
1305 && LAMBDA_TYPE_P (type
))
1306 write_closure_type_name (type
);
1308 write_source_name (DECL_NAME (decl
));
1311 /* We use the ABI tags from the primary template, ignoring tags on any
1312 specializations. This is necessary because C++ doesn't require a
1313 specialization to be declared before it is used unless the use
1314 requires a complete type, but we need to get the tags right on
1315 incomplete types as well. */
1316 if (tree tmpl
= most_general_template (decl
))
1317 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1318 /* Don't crash on an unbound class template. */
1319 if (decl
&& TREE_CODE (decl
) != NAMESPACE_DECL
)
1321 tree attrs
= (TREE_CODE (decl
) == TYPE_DECL
1322 ? TYPE_ATTRIBUTES (TREE_TYPE (decl
))
1323 : DECL_ATTRIBUTES (decl
));
1324 write_abi_tags (lookup_attribute ("abi_tag", attrs
));
1328 /* Write the unqualified-name for a conversion operator to TYPE. */
1331 write_conversion_operator_name (const tree type
)
1333 write_string ("cv");
1337 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1339 <source-name> ::= </length/ number> <identifier> */
1342 write_source_name (tree identifier
)
1344 MANGLE_TRACE_TREE ("source-name", identifier
);
1346 /* Never write the whole template-id name including the template
1347 arguments; we only want the template name. */
1348 if (IDENTIFIER_TEMPLATE (identifier
))
1349 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1351 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1352 write_identifier (IDENTIFIER_POINTER (identifier
));
1355 /* Compare two TREE_STRINGs like strcmp. */
1358 tree_string_cmp (const void *p1
, const void *p2
)
1362 tree s1
= *(const tree
*)p1
;
1363 tree s2
= *(const tree
*)p2
;
1364 return strcmp (TREE_STRING_POINTER (s1
),
1365 TREE_STRING_POINTER (s2
));
1368 /* ID is the name of a function or type with abi_tags attribute TAGS.
1369 Write out the name, suitably decorated. */
1372 write_abi_tags (tree tags
)
1374 if (tags
== NULL_TREE
)
1377 tags
= TREE_VALUE (tags
);
1379 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1381 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1383 if (ABI_TAG_IMPLICIT (t
))
1385 tree str
= TREE_VALUE (t
);
1386 vec_safe_push (vec
, str
);
1389 vec
->qsort (tree_string_cmp
);
1391 unsigned i
; tree str
;
1392 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1395 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1396 write_identifier (TREE_STRING_POINTER (str
));
1399 release_tree_vector (vec
);
1402 /* Write a user-defined literal operator.
1403 ::= li <source-name> # "" <source-name>
1404 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1407 write_literal_operator_name (tree identifier
)
1409 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1410 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1411 write_unsigned_number (strlen (suffix
));
1412 write_identifier (suffix
);
1415 /* Encode 0 as _, and 1+ as n-1_. */
1418 write_compact_number (int num
)
1421 write_unsigned_number (num
- 1);
1425 /* Return how many unnamed types precede TYPE in its enclosing class. */
1428 nested_anon_class_index (tree type
)
1431 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1432 for (; member
; member
= DECL_CHAIN (member
))
1433 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1435 tree memtype
= TREE_TYPE (member
);
1436 if (memtype
== type
)
1438 else if (TYPE_ANONYMOUS_P (memtype
))
1445 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1448 write_unnamed_type_name (const tree type
)
1451 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1453 if (TYPE_FUNCTION_SCOPE_P (type
))
1454 discriminator
= local_class_index (type
);
1455 else if (TYPE_CLASS_SCOPE_P (type
))
1456 discriminator
= nested_anon_class_index (type
);
1459 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1460 /* Just use the old mangling at namespace scope. */
1461 write_source_name (TYPE_IDENTIFIER (type
));
1465 write_string ("Ut");
1466 write_compact_number (discriminator
);
1469 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1470 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1473 write_closure_type_name (const tree type
)
1475 tree fn
= lambda_function (type
);
1476 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1477 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1479 MANGLE_TRACE_TREE ("closure-type-name", type
);
1481 write_string ("Ul");
1482 write_method_parms (parms
, /*method_p=*/1, fn
);
1484 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1487 /* Convert NUMBER to ascii using base BASE and generating at least
1488 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1489 into which to store the characters. Returns the number of
1490 characters generated (these will be laid out in advance of where
1494 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1495 char *buffer
, const unsigned int min_digits
)
1497 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1498 unsigned digits
= 0;
1502 unsigned HOST_WIDE_INT d
= number
/ base
;
1504 *--buffer
= base_digits
[number
- d
* base
];
1508 while (digits
< min_digits
)
1510 *--buffer
= base_digits
[0];
1516 /* Non-terminal <number>.
1518 <number> ::= [n] </decimal integer/> */
1521 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1522 const unsigned int base
)
1524 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1527 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1530 number
= -((HOST_WIDE_INT
) number
);
1532 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1533 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1536 /* Write out an integral CST in decimal. Most numbers are small, and
1537 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1538 bigger than that, which we must deal with. */
1541 write_integer_cst (const tree cst
)
1543 int sign
= tree_int_cst_sgn (cst
);
1544 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1545 if (!wi::fits_uhwi_p (abs_value
))
1547 /* A bignum. We do this in chunks, each of which fits in a
1549 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1550 unsigned HOST_WIDE_INT chunk
;
1551 unsigned chunk_digits
;
1552 char *ptr
= buffer
+ sizeof (buffer
);
1557 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1562 if (sizeof (HOST_WIDE_INT
) >= 8)
1564 /* It is at least 64 bits, so 10^18 is representable. */
1569 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1570 base
= build_int_cstu (type
, chunk
);
1571 n
= wide_int_to_tree (type
, cst
);
1576 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1580 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1581 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1584 done
= integer_zerop (d
);
1585 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1586 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1587 done
? 1 : chunk_digits
);
1593 write_chars (ptr
, count
);
1600 write_unsigned_number (abs_value
.to_uhwi ());
1604 /* Write out a floating-point literal.
1606 "Floating-point literals are encoded using the bit pattern of the
1607 target processor's internal representation of that number, as a
1608 fixed-length lowercase hexadecimal string, high-order bytes first
1609 (even if the target processor would store low-order bytes first).
1610 The "n" prefix is not used for floating-point literals; the sign
1611 bit is encoded with the rest of the number.
1613 Here are some examples, assuming the IEEE standard representation
1614 for floating point numbers. (Spaces are for readability, not
1615 part of the encoding.)
1618 -1.0f Lf bf80 0000 E
1619 1.17549435e-38f Lf 0080 0000 E
1620 1.40129846e-45f Lf 0000 0001 E
1621 0.0f Lf 0000 0000 E"
1623 Caller is responsible for the Lx and the E. */
1625 write_real_cst (const tree value
)
1627 long target_real
[4]; /* largest supported float */
1628 char buffer
[9]; /* eight hex digits in a 32-bit number */
1631 tree type
= TREE_TYPE (value
);
1632 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1634 real_to_target (target_real
, &TREE_REAL_CST (value
),
1637 /* The value in target_real is in the target word order,
1638 so we must write it out backward if that happens to be
1639 little-endian. write_number cannot be used, it will
1640 produce uppercase. */
1641 if (FLOAT_WORDS_BIG_ENDIAN
)
1642 i
= 0, limit
= words
, dir
= 1;
1644 i
= words
- 1, limit
= -1, dir
= -1;
1646 for (; i
!= limit
; i
+= dir
)
1648 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1649 write_chars (buffer
, 8);
1653 /* Non-terminal <identifier>.
1655 <identifier> ::= </unqualified source code identifier> */
1658 write_identifier (const char *identifier
)
1660 MANGLE_TRACE ("identifier", identifier
);
1661 write_string (identifier
);
1664 /* Handle constructor productions of non-terminal <special-name>.
1665 CTOR is a constructor FUNCTION_DECL.
1667 <special-name> ::= C1 # complete object constructor
1668 ::= C2 # base object constructor
1669 ::= C3 # complete object allocating constructor
1671 Currently, allocating constructors are never used. */
1674 write_special_name_constructor (const tree ctor
)
1676 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1677 write_string ("C2");
1678 /* This is the old-style "[unified]" constructor.
1679 In some cases, we may emit this function and call
1680 it from the clones in order to share code and save space. */
1681 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1682 write_string ("C4");
1685 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1686 write_string ("C1");
1690 /* Handle destructor productions of non-terminal <special-name>.
1691 DTOR is a destructor FUNCTION_DECL.
1693 <special-name> ::= D0 # deleting (in-charge) destructor
1694 ::= D1 # complete object (in-charge) destructor
1695 ::= D2 # base object (not-in-charge) destructor */
1698 write_special_name_destructor (const tree dtor
)
1700 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1701 write_string ("D0");
1702 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1703 write_string ("D2");
1704 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1705 /* This is the old-style "[unified]" destructor.
1706 In some cases, we may emit this function and call
1707 it from the clones in order to share code and save space. */
1708 write_string ("D4");
1711 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1712 write_string ("D1");
1716 /* Scan the vector of local classes and return how many others with the
1717 same name (or same no name) and context precede ENTITY. */
1720 local_class_index (tree entity
)
1722 int ix
, discriminator
= 0;
1723 tree name
= (TYPE_ANONYMOUS_P (entity
) ? NULL_TREE
1724 : TYPE_IDENTIFIER (entity
));
1725 tree ctx
= TYPE_CONTEXT (entity
);
1726 for (ix
= 0; ; ix
++)
1728 tree type
= (*local_classes
)[ix
];
1730 return discriminator
;
1731 if (TYPE_CONTEXT (type
) == ctx
1732 && (name
? TYPE_IDENTIFIER (type
) == name
1733 : TYPE_ANONYMOUS_P (type
)))
1739 /* Return the discriminator for ENTITY appearing inside
1740 FUNCTION. The discriminator is the lexical ordinal of VAR among
1741 entities with the same name in the same FUNCTION. */
1744 discriminator_for_local_entity (tree entity
)
1746 if (DECL_DISCRIMINATOR_P (entity
))
1748 if (DECL_DISCRIMINATOR_SET_P (entity
))
1749 return DECL_DISCRIMINATOR (entity
);
1751 /* The first entity with a particular name doesn't get
1752 DECL_DISCRIMINATOR set up. */
1755 else if (TREE_CODE (entity
) == TYPE_DECL
)
1757 /* Scan the list of local classes. */
1758 entity
= TREE_TYPE (entity
);
1760 /* Lambdas and unnamed types have their own discriminators. */
1761 if (LAMBDA_TYPE_P (entity
) || TYPE_ANONYMOUS_P (entity
))
1764 return local_class_index (entity
);
1770 /* Return the discriminator for STRING, a string literal used inside
1771 FUNCTION. The discriminator is the lexical ordinal of STRING among
1772 string literals used in FUNCTION. */
1775 discriminator_for_string_literal (tree
/*function*/,
1778 /* For now, we don't discriminate amongst string literals. */
1782 /* <discriminator> := _ <number>
1784 The discriminator is used only for the second and later occurrences
1785 of the same name within a single function. In this case <number> is
1786 n - 2, if this is the nth occurrence, in lexical order. */
1789 write_discriminator (const int discriminator
)
1791 /* If discriminator is zero, don't write anything. Otherwise... */
1792 if (discriminator
> 0)
1795 write_unsigned_number (discriminator
- 1);
1799 /* Mangle the name of a function-scope entity. FUNCTION is the
1800 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1801 default argument scope. ENTITY is the decl for the entity itself.
1802 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1803 either ENTITY itself or an enclosing scope of ENTITY.
1805 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1806 := Z <function encoding> E s [<discriminator>]
1807 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1810 write_local_name (tree function
, const tree local_entity
,
1813 tree parm
= NULL_TREE
;
1815 MANGLE_TRACE_TREE ("local-name", entity
);
1817 if (TREE_CODE (function
) == PARM_DECL
)
1820 function
= DECL_CONTEXT (parm
);
1824 write_encoding (function
);
1827 /* For this purpose, parameters are numbered from right-to-left. */
1832 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1840 write_compact_number (i
- 1);
1843 if (TREE_CODE (entity
) == STRING_CST
)
1846 write_discriminator (discriminator_for_string_literal (function
,
1851 /* Now the <entity name>. Let write_name know its being called
1852 from <local-name>, so it doesn't try to process the enclosing
1853 function scope again. */
1854 write_name (entity
, /*ignore_local_scope=*/1);
1855 write_discriminator (discriminator_for_local_entity (local_entity
));
1859 /* Non-terminals <type> and <CV-qualifier>.
1861 <type> ::= <builtin-type>
1863 ::= <class-enum-type>
1865 ::= <pointer-to-member-type>
1866 ::= <template-param>
1869 ::= P <type> # pointer-to
1870 ::= R <type> # reference-to
1871 ::= C <type> # complex pair (C 2000)
1872 ::= G <type> # imaginary (C 2000) [not supported]
1873 ::= U <source-name> <type> # vendor extended type qualifier
1877 <type> ::= RR <type> # rvalue reference-to
1878 <type> ::= Dt <expression> # decltype of an id-expression or
1879 # class member access
1880 <type> ::= DT <expression> # decltype of an expression
1881 <type> ::= Dn # decltype of nullptr
1883 TYPE is a type node. */
1886 write_type (tree type
)
1888 /* This gets set to nonzero if TYPE turns out to be a (possibly
1889 CV-qualified) builtin type. */
1890 int is_builtin_type
= 0;
1892 MANGLE_TRACE_TREE ("type", type
);
1894 if (type
== error_mark_node
)
1897 type
= canonicalize_for_substitution (type
);
1898 if (find_substitution (type
))
1902 if (write_CV_qualifiers_for_type (type
) > 0)
1903 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1904 mangle the unqualified type. The recursive call is needed here
1905 since both the qualified and unqualified types are substitution
1908 tree t
= TYPE_MAIN_VARIANT (type
);
1909 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
1910 t
= cp_build_type_attribute_variant (t
, NULL_TREE
);
1911 gcc_assert (t
!= type
);
1912 if (TREE_CODE (t
) == FUNCTION_TYPE
1913 || TREE_CODE (t
) == METHOD_TYPE
)
1915 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
1916 if (abi_version_at_least (8)
1917 || type
== TYPE_MAIN_VARIANT (type
))
1918 /* Avoid adding the unqualified function type as a substitution. */
1919 write_function_type (t
);
1922 if (abi_version_crosses (8))
1923 G
.need_abi_warning
= 1;
1928 else if (TREE_CODE (type
) == ARRAY_TYPE
)
1929 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1930 so that the cv-qualification of the element type is available
1931 in write_array_type. */
1932 write_array_type (type
);
1935 tree type_orig
= type
;
1937 /* See through any typedefs. */
1938 type
= TYPE_MAIN_VARIANT (type
);
1939 if (TREE_CODE (type
) == FUNCTION_TYPE
1940 || TREE_CODE (type
) == METHOD_TYPE
)
1941 type
= build_ref_qualified_type (type
, type_memfn_rqual (type_orig
));
1943 /* According to the C++ ABI, some library classes are passed the
1944 same as the scalar type of their single member and use the same
1946 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
1947 type
= TREE_TYPE (first_field (type
));
1949 if (TYPE_PTRDATAMEM_P (type
))
1950 write_pointer_to_member_type (type
);
1953 /* Handle any target-specific fundamental types. */
1954 const char *target_mangling
1955 = targetm
.mangle_type (type_orig
);
1957 if (target_mangling
)
1959 write_string (target_mangling
);
1960 /* Add substitutions for types other than fundamental
1962 if (!VOID_TYPE_P (type
)
1963 && TREE_CODE (type
) != INTEGER_TYPE
1964 && TREE_CODE (type
) != REAL_TYPE
1965 && TREE_CODE (type
) != BOOLEAN_TYPE
)
1966 add_substitution (type
);
1970 switch (TREE_CODE (type
))
1974 case INTEGER_TYPE
: /* Includes wchar_t. */
1976 case FIXED_POINT_TYPE
:
1978 /* If this is a typedef, TYPE may not be one of
1979 the standard builtin type nodes, but an alias of one. Use
1980 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1981 write_builtin_type (TYPE_MAIN_VARIANT (type
));
1988 write_type (TREE_TYPE (type
));
1993 write_function_type (type
);
1999 /* A pointer-to-member function is represented as a special
2000 RECORD_TYPE, so check for this first. */
2001 if (TYPE_PTRMEMFUNC_P (type
))
2002 write_pointer_to_member_type (type
);
2004 write_class_enum_type (type
);
2008 case UNBOUND_CLASS_TEMPLATE
:
2009 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2010 ordinary nested names. */
2011 write_nested_name (TYPE_STUB_DECL (type
));
2015 case REFERENCE_TYPE
:
2016 if (TYPE_PTR_P (type
))
2018 else if (TYPE_REF_IS_RVALUE (type
))
2023 tree target
= TREE_TYPE (type
);
2024 /* Attribute const/noreturn are not reflected in mangling.
2025 We strip them here rather than at a lower level because
2026 a typedef or template argument can have function type
2027 with function-cv-quals (that use the same representation),
2028 but you can't have a pointer/reference to such a type. */
2029 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2031 if (abi_version_crosses (5)
2032 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2033 G
.need_abi_warning
= 1;
2034 if (abi_version_at_least (5))
2035 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2037 write_type (target
);
2041 case TEMPLATE_TYPE_PARM
:
2044 if (AUTO_IS_DECLTYPE (type
))
2045 write_identifier ("Dc");
2047 write_identifier ("Da");
2051 /* else fall through. */
2052 case TEMPLATE_PARM_INDEX
:
2053 write_template_param (type
);
2056 case TEMPLATE_TEMPLATE_PARM
:
2057 write_template_template_param (type
);
2060 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2061 write_template_template_param (type
);
2063 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2067 if (abi_version_at_least (4))
2069 write_string ("Dv");
2070 /* Non-constant vector size would be encoded with
2071 _ expression, but we don't support that yet. */
2072 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2076 write_string ("U8__vector");
2077 if (abi_version_crosses (4))
2078 G
.need_abi_warning
= 1;
2079 write_type (TREE_TYPE (type
));
2082 case TYPE_PACK_EXPANSION
:
2083 write_string ("Dp");
2084 write_type (PACK_EXPANSION_PATTERN (type
));
2088 /* These shouldn't make it into mangling. */
2089 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2090 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2092 /* In ABI <5, we stripped decltype of a plain decl. */
2093 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2095 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2096 tree etype
= NULL_TREE
;
2097 switch (TREE_CODE (expr
))
2104 case TEMPLATE_PARM_INDEX
:
2105 etype
= TREE_TYPE (expr
);
2112 if (etype
&& !type_uses_auto (etype
))
2114 if (abi_version_crosses (5))
2115 G
.need_abi_warning
= 1;
2116 if (!abi_version_at_least (5))
2125 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2129 ++cp_unevaluated_operand
;
2130 write_expression (DECLTYPE_TYPE_EXPR (type
));
2131 --cp_unevaluated_operand
;
2136 write_string ("Dn");
2137 if (abi_version_at_least (7))
2139 if (abi_version_crosses (7))
2140 G
.need_abi_warning
= 1;
2144 sorry ("mangling typeof, use decltype instead");
2147 case UNDERLYING_TYPE
:
2148 sorry ("mangling __underlying_type");
2160 /* Types other than builtin types are substitution candidates. */
2161 if (!is_builtin_type
)
2162 add_substitution (type
);
2165 /* qsort callback for sorting a vector of attribute entries. */
2168 attr_strcmp (const void *p1
, const void *p2
)
2170 tree a1
= *(const tree
*)p1
;
2171 tree a2
= *(const tree
*)p2
;
2173 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2174 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2176 return strcmp (as1
->name
, as2
->name
);
2179 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2180 CV-qualifiers written for TYPE.
2182 <CV-qualifiers> ::= [r] [V] [K] */
2185 write_CV_qualifiers_for_type (const tree type
)
2187 int num_qualifiers
= 0;
2189 /* The order is specified by:
2191 "In cases where multiple order-insensitive qualifiers are
2192 present, they should be ordered 'K' (closest to the base type),
2193 'V', 'r', and 'U' (farthest from the base type) ..." */
2195 /* Mangle attributes that affect type identity as extended qualifiers.
2197 We don't do this with classes and enums because their attributes
2198 are part of their definitions, not something added on. */
2200 if (abi_version_at_least (9) && !OVERLOAD_TYPE_P (type
))
2203 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2205 tree name
= get_attribute_name (a
);
2206 const attribute_spec
*as
= lookup_attribute_spec (name
);
2207 if (as
&& as
->affects_type_identity
2208 && !is_attribute_p ("abi_tag", name
))
2211 vec
.qsort (attr_strcmp
);
2212 while (!vec
.is_empty())
2215 const attribute_spec
*as
2216 = lookup_attribute_spec (get_attribute_name (a
));
2219 write_unsigned_number (strlen (as
->name
));
2220 write_string (as
->name
);
2224 for (tree args
= TREE_VALUE (a
); args
;
2225 args
= TREE_CHAIN (args
))
2227 tree arg
= TREE_VALUE (args
);
2228 write_template_arg (arg
);
2234 if (abi_version_crosses (9))
2235 G
.need_abi_warning
= true;
2239 /* Note that we do not use cp_type_quals below; given "const
2240 int[3]", the "const" is emitted with the "int", not with the
2242 cp_cv_quals quals
= TYPE_QUALS (type
);
2244 if (quals
& TYPE_QUAL_RESTRICT
)
2249 if (quals
& TYPE_QUAL_VOLATILE
)
2254 if (quals
& TYPE_QUAL_CONST
)
2260 return num_qualifiers
;
2263 /* Non-terminal <builtin-type>.
2265 <builtin-type> ::= v # void
2270 ::= h # unsigned char
2272 ::= t # unsigned short
2274 ::= j # unsigned int
2276 ::= m # unsigned long
2277 ::= x # long long, __int64
2278 ::= y # unsigned long long, __int64
2280 ::= o # unsigned __int128
2283 ::= e # long double, __float80
2284 ::= g # __float128 [not supported]
2285 ::= u <source-name> # vendor extended type */
2288 write_builtin_type (tree type
)
2290 if (TYPE_CANONICAL (type
))
2291 type
= TYPE_CANONICAL (type
);
2293 switch (TREE_CODE (type
))
2304 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2305 isn't in integer_type_nodes. */
2306 if (type
== wchar_type_node
)
2308 else if (type
== char16_type_node
)
2309 write_string ("Ds");
2310 else if (type
== char32_type_node
)
2311 write_string ("Di");
2312 else if (TYPE_FOR_JAVA (type
))
2313 write_java_integer_type_codes (type
);
2317 /* Assume TYPE is one of the shared integer type nodes. Find
2318 it in the array of these nodes. */
2320 for (itk
= 0; itk
< itk_none
; ++itk
)
2321 if (integer_types
[itk
] != NULL_TREE
2322 && integer_type_codes
[itk
] != '\0'
2323 && type
== integer_types
[itk
])
2325 /* Print the corresponding single-letter code. */
2326 write_char (integer_type_codes
[itk
]);
2330 if (itk
== itk_none
)
2332 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2333 TYPE_UNSIGNED (type
));
2340 if (TYPE_PRECISION (type
) == 128)
2341 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2344 /* Allow for cases where TYPE is not one of the shared
2345 integer type nodes and write a "vendor extended builtin
2346 type" with a name the form intN or uintN, respectively.
2347 Situations like this can happen if you have an
2348 __attribute__((__mode__(__SI__))) type and use exotic
2349 switches like '-mint8' on AVR. Of course, this is
2350 undefined by the C++ ABI (and '-mint8' is not even
2351 Standard C conforming), but when using such special
2352 options you're pretty much in nowhere land anyway. */
2354 char prec
[11]; /* up to ten digits for an unsigned */
2356 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2357 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2358 write_char ('u'); /* "vendor extended builtin type" */
2359 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2360 write_string (prefix
);
2361 write_string (prec
);
2368 if (type
== float_type_node
2369 || type
== java_float_type_node
)
2371 else if (type
== double_type_node
2372 || type
== java_double_type_node
)
2374 else if (type
== long_double_type_node
)
2376 else if (type
== dfloat32_type_node
)
2377 write_string ("Df");
2378 else if (type
== dfloat64_type_node
)
2379 write_string ("Dd");
2380 else if (type
== dfloat128_type_node
)
2381 write_string ("De");
2386 case FIXED_POINT_TYPE
:
2387 write_string ("DF");
2388 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2389 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2390 if (type
== fract_type_node
2391 || type
== sat_fract_type_node
2392 || type
== accum_type_node
2393 || type
== sat_accum_type_node
)
2395 else if (type
== unsigned_fract_type_node
2396 || type
== sat_unsigned_fract_type_node
2397 || type
== unsigned_accum_type_node
2398 || type
== sat_unsigned_accum_type_node
)
2400 else if (type
== short_fract_type_node
2401 || type
== sat_short_fract_type_node
2402 || type
== short_accum_type_node
2403 || type
== sat_short_accum_type_node
)
2405 else if (type
== unsigned_short_fract_type_node
2406 || type
== sat_unsigned_short_fract_type_node
2407 || type
== unsigned_short_accum_type_node
2408 || type
== sat_unsigned_short_accum_type_node
)
2410 else if (type
== long_fract_type_node
2411 || type
== sat_long_fract_type_node
2412 || type
== long_accum_type_node
2413 || type
== sat_long_accum_type_node
)
2415 else if (type
== unsigned_long_fract_type_node
2416 || type
== sat_unsigned_long_fract_type_node
2417 || type
== unsigned_long_accum_type_node
2418 || type
== sat_unsigned_long_accum_type_node
)
2420 else if (type
== long_long_fract_type_node
2421 || type
== sat_long_long_fract_type_node
2422 || type
== long_long_accum_type_node
2423 || type
== sat_long_long_accum_type_node
)
2425 else if (type
== unsigned_long_long_fract_type_node
2426 || type
== sat_unsigned_long_long_fract_type_node
2427 || type
== unsigned_long_long_accum_type_node
2428 || type
== sat_unsigned_long_long_accum_type_node
)
2431 sorry ("mangling unknown fixed point type");
2432 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2433 if (TYPE_SATURATING (type
))
2444 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2445 METHOD_TYPE. The return type is mangled before the parameter
2448 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2451 write_function_type (const tree type
)
2453 MANGLE_TRACE_TREE ("function-type", type
);
2455 /* For a pointer to member function, the function type may have
2456 cv-qualifiers, indicating the quals for the artificial 'this'
2458 if (TREE_CODE (type
) == METHOD_TYPE
)
2460 /* The first parameter must be a POINTER_TYPE pointing to the
2461 `this' parameter. */
2462 tree this_type
= class_of_this_parm (type
);
2463 write_CV_qualifiers_for_type (this_type
);
2467 /* We don't track whether or not a type is `extern "C"'. Note that
2468 you can have an `extern "C"' function that does not have
2469 `extern "C"' type, and vice versa:
2471 extern "C" typedef void function_t();
2472 function_t f; // f has C++ linkage, but its type is
2475 typedef void function_t();
2476 extern "C" function_t f; // Vice versa.
2479 write_bare_function_type (type
, /*include_return_type_p=*/1,
2481 if (FUNCTION_REF_QUALIFIED (type
))
2483 if (FUNCTION_RVALUE_QUALIFIED (type
))
2491 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2492 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2493 is mangled before the parameter types. If non-NULL, DECL is
2494 FUNCTION_DECL for the function whose type is being emitted.
2496 If DECL is a member of a Java type, then a literal 'J'
2497 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2500 <bare-function-type> ::= [J]</signature/ type>+ */
2503 write_bare_function_type (const tree type
, const int include_return_type_p
,
2508 MANGLE_TRACE_TREE ("bare-function-type", type
);
2510 /* Detect Java methods and emit special encoding. */
2512 && DECL_FUNCTION_MEMBER_P (decl
)
2513 && TYPE_FOR_JAVA (DECL_CONTEXT (decl
))
2514 && !DECL_CONSTRUCTOR_P (decl
)
2515 && !DECL_DESTRUCTOR_P (decl
)
2516 && !DECL_CONV_FN_P (decl
))
2526 /* Mangle the return type, if requested. */
2527 if (include_return_type_p
|| java_method_p
)
2528 write_type (TREE_TYPE (type
));
2530 /* Now mangle the types of the arguments. */
2532 write_method_parms (TYPE_ARG_TYPES (type
),
2533 TREE_CODE (type
) == METHOD_TYPE
,
2538 /* Write the mangled representation of a method parameter list of
2539 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2540 considered a non-static method, and the this parameter is omitted.
2541 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2542 parameters are being emitted. */
2545 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2547 tree first_parm_type
;
2548 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2550 /* Assume this parameter type list is variable-length. If it ends
2551 with a void type, then it's not. */
2554 /* If this is a member function, skip the first arg, which is the
2556 "Member functions do not encode the type of their implicit this
2559 Similarly, there's no need to mangle artificial parameters, like
2560 the VTT parameters for constructors and destructors. */
2563 parm_types
= TREE_CHAIN (parm_types
);
2564 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2566 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2568 parm_types
= TREE_CHAIN (parm_types
);
2569 parm_decl
= DECL_CHAIN (parm_decl
);
2573 for (first_parm_type
= parm_types
;
2575 parm_types
= TREE_CHAIN (parm_types
))
2577 tree parm
= TREE_VALUE (parm_types
);
2578 if (parm
== void_type_node
)
2580 /* "Empty parameter lists, whether declared as () or
2581 conventionally as (void), are encoded with a void parameter
2583 if (parm_types
== first_parm_type
)
2585 /* If the parm list is terminated with a void type, it's
2588 /* A void type better be the last one. */
2589 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2596 /* <builtin-type> ::= z # ellipsis */
2600 /* <class-enum-type> ::= <name> */
2603 write_class_enum_type (const tree type
)
2605 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2608 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2611 <template-args> ::= I <template-arg>* E */
2614 write_template_args (tree args
)
2619 MANGLE_TRACE_TREE ("template-args", args
);
2624 length
= TREE_VEC_LENGTH (args
);
2626 if (args
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2628 /* We have nested template args. We want the innermost template
2630 args
= TREE_VEC_ELT (args
, length
- 1);
2631 length
= TREE_VEC_LENGTH (args
);
2633 for (i
= 0; i
< length
; ++i
)
2634 write_template_arg (TREE_VEC_ELT (args
, i
));
2641 <unqualified-name> <template-args>
2642 part of SCOPE_REF or COMPONENT_REF mangling. */
2645 write_member_name (tree member
)
2647 if (identifier_p (member
))
2648 write_unqualified_id (member
);
2649 else if (DECL_P (member
))
2650 write_unqualified_name (member
);
2651 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2653 tree name
= TREE_OPERAND (member
, 0);
2654 if (TREE_CODE (name
) == OVERLOAD
)
2655 name
= OVL_FUNCTION (name
);
2656 write_member_name (name
);
2657 write_template_args (TREE_OPERAND (member
, 1));
2660 write_expression (member
);
2663 /* <expression> ::= <unary operator-name> <expression>
2664 ::= <binary operator-name> <expression> <expression>
2667 <expr-primary> ::= <template-param>
2668 ::= L <type> <value number> E # literal
2669 ::= L <mangled-name> E # external name
2670 ::= st <type> # sizeof
2671 ::= sr <type> <unqualified-name> # dependent name
2672 ::= sr <type> <unqualified-name> <template-args> */
2675 write_expression (tree expr
)
2677 enum tree_code code
= TREE_CODE (expr
);
2679 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2680 is converted (via qualification conversions) to another
2682 while (TREE_CODE (expr
) == NOP_EXPR
2683 /* Parentheses aren't mangled. */
2684 || code
== PAREN_EXPR
2685 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2687 expr
= TREE_OPERAND (expr
, 0);
2688 code
= TREE_CODE (expr
);
2691 if (code
== BASELINK
2692 && (!type_unknown_p (expr
)
2693 || !BASELINK_QUALIFIED_P (expr
)))
2695 expr
= BASELINK_FUNCTIONS (expr
);
2696 code
= TREE_CODE (expr
);
2699 /* Handle pointers-to-members by making them look like expression
2701 if (code
== PTRMEM_CST
)
2703 expr
= build_nt (ADDR_EXPR
,
2704 build_qualified_name (/*type=*/NULL_TREE
,
2705 PTRMEM_CST_CLASS (expr
),
2706 PTRMEM_CST_MEMBER (expr
),
2707 /*template_p=*/false));
2708 code
= TREE_CODE (expr
);
2711 /* Handle template parameters. */
2712 if (code
== TEMPLATE_TYPE_PARM
2713 || code
== TEMPLATE_TEMPLATE_PARM
2714 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2715 || code
== TEMPLATE_PARM_INDEX
)
2716 write_template_param (expr
);
2717 /* Handle literals. */
2718 else if (TREE_CODE_CLASS (code
) == tcc_constant
2719 || code
== CONST_DECL
)
2720 write_template_arg_literal (expr
);
2721 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2723 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr
))));
2724 write_string ("fpT");
2726 else if (code
== PARM_DECL
)
2728 /* A function parameter used in a late-specified return type. */
2729 int index
= DECL_PARM_INDEX (expr
);
2730 int level
= DECL_PARM_LEVEL (expr
);
2731 int delta
= G
.parm_depth
- level
+ 1;
2732 gcc_assert (index
>= 1);
2736 if (abi_version_at_least (5))
2738 /* Let L be the number of function prototype scopes from the
2739 innermost one (in which the parameter reference occurs) up
2740 to (and including) the one containing the declaration of
2741 the referenced parameter. If the parameter declaration
2742 clause of the innermost function prototype scope has been
2743 completely seen, it is not counted (in that case -- which
2744 is perhaps the most common -- L can be zero). */
2746 write_unsigned_number (delta
- 1);
2748 if (abi_version_crosses (5))
2749 G
.need_abi_warning
= true;
2752 write_compact_number (index
- 1);
2754 else if (DECL_P (expr
))
2757 write_mangled_name (expr
, false);
2760 else if (TREE_CODE (expr
) == SIZEOF_EXPR
2761 && SIZEOF_EXPR_TYPE_P (expr
))
2763 write_string ("st");
2764 write_type (TREE_TYPE (TREE_OPERAND (expr
, 0)));
2766 else if (TREE_CODE (expr
) == SIZEOF_EXPR
2767 && TYPE_P (TREE_OPERAND (expr
, 0)))
2769 write_string ("st");
2770 write_type (TREE_OPERAND (expr
, 0));
2772 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2773 && TYPE_P (TREE_OPERAND (expr
, 0)))
2775 write_string ("at");
2776 write_type (TREE_OPERAND (expr
, 0));
2778 else if (code
== SCOPE_REF
2779 || code
== BASELINK
)
2782 if (code
== SCOPE_REF
)
2784 scope
= TREE_OPERAND (expr
, 0);
2785 member
= TREE_OPERAND (expr
, 1);
2789 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
2790 member
= BASELINK_FUNCTIONS (expr
);
2793 /* If the MEMBER is a real declaration, then the qualifying
2794 scope was not dependent. Ideally, we would not have a
2795 SCOPE_REF in those cases, but sometimes we do. If the second
2796 argument is a DECL, then the name must not have been
2798 if (DECL_P (member
))
2799 write_expression (member
);
2802 write_string ("sr");
2804 write_member_name (member
);
2807 else if (INDIRECT_REF_P (expr
)
2808 && TREE_TYPE (TREE_OPERAND (expr
, 0))
2809 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2811 write_expression (TREE_OPERAND (expr
, 0));
2813 else if (identifier_p (expr
))
2815 /* An operator name appearing as a dependent name needs to be
2816 specially marked to disambiguate between a use of the operator
2817 name and a use of the operator in an expression. */
2818 if (IDENTIFIER_OPNAME_P (expr
))
2819 write_string ("on");
2820 write_unqualified_id (expr
);
2822 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
2824 tree fn
= TREE_OPERAND (expr
, 0);
2825 if (is_overloaded_fn (fn
))
2826 fn
= DECL_NAME (get_first_fn (fn
));
2827 if (IDENTIFIER_OPNAME_P (fn
))
2828 write_string ("on");
2829 write_unqualified_id (fn
);
2830 write_template_args (TREE_OPERAND (expr
, 1));
2832 else if (TREE_CODE (expr
) == MODOP_EXPR
)
2834 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
2835 const char *name
= (assignment_operator_name_info
[(int) subop
]
2837 write_string (name
);
2838 write_expression (TREE_OPERAND (expr
, 0));
2839 write_expression (TREE_OPERAND (expr
, 2));
2841 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
2843 /* ::= [gs] nw <expression>* _ <type> E
2844 ::= [gs] nw <expression>* _ <type> <initializer>
2845 ::= [gs] na <expression>* _ <type> E
2846 ::= [gs] na <expression>* _ <type> <initializer>
2847 <initializer> ::= pi <expression>* E */
2848 tree placement
= TREE_OPERAND (expr
, 0);
2849 tree type
= TREE_OPERAND (expr
, 1);
2850 tree nelts
= TREE_OPERAND (expr
, 2);
2851 tree init
= TREE_OPERAND (expr
, 3);
2854 gcc_assert (code
== NEW_EXPR
);
2855 if (TREE_OPERAND (expr
, 2))
2856 code
= VEC_NEW_EXPR
;
2858 if (NEW_EXPR_USE_GLOBAL (expr
))
2859 write_string ("gs");
2861 write_string (operator_name_info
[(int) code
].mangled_name
);
2863 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
2864 write_expression (TREE_VALUE (t
));
2871 ++processing_template_decl
;
2872 domain
= compute_array_index_type (NULL_TREE
, nelts
,
2873 tf_warning_or_error
);
2874 type
= build_cplus_array_type (type
, domain
);
2875 --processing_template_decl
;
2879 if (init
&& TREE_CODE (init
) == TREE_LIST
2880 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
2881 write_expression (TREE_VALUE (init
));
2885 write_string ("pi");
2886 if (init
&& init
!= void_node
)
2887 for (t
= init
; t
; t
= TREE_CHAIN (t
))
2888 write_expression (TREE_VALUE (t
));
2892 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
2894 gcc_assert (code
== DELETE_EXPR
);
2895 if (DELETE_EXPR_USE_VEC (expr
))
2896 code
= VEC_DELETE_EXPR
;
2898 if (DELETE_EXPR_USE_GLOBAL (expr
))
2899 write_string ("gs");
2901 write_string (operator_name_info
[(int) code
].mangled_name
);
2903 write_expression (TREE_OPERAND (expr
, 0));
2905 else if (code
== THROW_EXPR
)
2907 tree op
= TREE_OPERAND (expr
, 0);
2910 write_string ("tw");
2911 write_expression (op
);
2914 write_string ("tr");
2916 else if (code
== CONSTRUCTOR
)
2918 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
2919 unsigned i
; tree val
;
2921 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
2922 write_string ("il");
2925 write_string ("tl");
2926 write_type (TREE_TYPE (expr
));
2928 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
2929 write_expression (val
);
2932 else if (dependent_name (expr
))
2934 write_unqualified_id (dependent_name (expr
));
2941 /* When we bind a variable or function to a non-type template
2942 argument with reference type, we create an ADDR_EXPR to show
2943 the fact that the entity's address has been taken. But, we
2944 don't actually want to output a mangling code for the `&'. */
2945 if (TREE_CODE (expr
) == ADDR_EXPR
2947 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
2949 expr
= TREE_OPERAND (expr
, 0);
2952 write_expression (expr
);
2956 code
= TREE_CODE (expr
);
2959 if (code
== COMPONENT_REF
)
2961 tree ob
= TREE_OPERAND (expr
, 0);
2963 if (TREE_CODE (ob
) == ARROW_EXPR
)
2965 write_string (operator_name_info
[(int)code
].mangled_name
);
2966 ob
= TREE_OPERAND (ob
, 0);
2967 write_expression (ob
);
2969 else if (!is_dummy_object (ob
))
2971 write_string ("dt");
2972 write_expression (ob
);
2974 /* else, for a non-static data member with no associated object (in
2975 unevaluated context), use the unresolved-name mangling. */
2977 write_member_name (TREE_OPERAND (expr
, 1));
2981 /* If it wasn't any of those, recursively expand the expression. */
2982 name
= operator_name_info
[(int) code
].mangled_name
;
2984 /* We used to mangle const_cast and static_cast like a C cast. */
2985 if (code
== CONST_CAST_EXPR
2986 || code
== STATIC_CAST_EXPR
)
2988 if (abi_version_crosses (6))
2989 G
.need_abi_warning
= 1;
2990 if (!abi_version_at_least (6))
2991 name
= operator_name_info
[CAST_EXPR
].mangled_name
;
2999 error ("use of built-in trait %qE in function signature; "
3000 "use library traits instead", expr
);
3004 sorry ("mangling %C", code
);
3010 write_string (name
);
3016 tree fn
= CALL_EXPR_FN (expr
);
3018 if (TREE_CODE (fn
) == ADDR_EXPR
)
3019 fn
= TREE_OPERAND (fn
, 0);
3021 /* Mangle a dependent name as the name, not whatever happens to
3022 be the first function in the overload set. */
3023 if ((TREE_CODE (fn
) == FUNCTION_DECL
3024 || TREE_CODE (fn
) == OVERLOAD
)
3025 && type_dependent_expression_p_push (expr
))
3026 fn
= DECL_NAME (get_first_fn (fn
));
3028 write_expression (fn
);
3031 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3032 write_expression (CALL_EXPR_ARG (expr
, i
));
3037 write_type (TREE_TYPE (expr
));
3038 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3039 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3042 tree args
= TREE_OPERAND (expr
, 0);
3044 for (; args
; args
= TREE_CHAIN (args
))
3045 write_expression (TREE_VALUE (args
));
3050 case DYNAMIC_CAST_EXPR
:
3051 case REINTERPRET_CAST_EXPR
:
3052 case STATIC_CAST_EXPR
:
3053 case CONST_CAST_EXPR
:
3054 write_type (TREE_TYPE (expr
));
3055 write_expression (TREE_OPERAND (expr
, 0));
3058 case PREINCREMENT_EXPR
:
3059 case PREDECREMENT_EXPR
:
3060 if (abi_version_at_least (6))
3062 if (abi_version_crosses (6))
3063 G
.need_abi_warning
= 1;
3067 /* In the middle-end, some expressions have more operands than
3068 they do in templates (and mangling). */
3069 len
= cp_tree_operand_length (expr
);
3071 for (i
= 0; i
< len
; ++i
)
3073 tree operand
= TREE_OPERAND (expr
, i
);
3074 /* As a GNU extension, the middle operand of a
3075 conditional may be omitted. Since expression
3076 manglings are supposed to represent the input token
3077 stream, there's no good way to mangle such an
3078 expression without extending the C++ ABI. */
3079 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3081 error ("omitted middle operand to %<?:%> operand "
3082 "cannot be mangled");
3085 write_expression (operand
);
3091 /* Literal subcase of non-terminal <template-arg>.
3093 "Literal arguments, e.g. "A<42L>", are encoded with their type
3094 and value. Negative integer values are preceded with "n"; for
3095 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3096 encoded as 0, true as 1." */
3099 write_template_arg_literal (const tree value
)
3102 write_type (TREE_TYPE (value
));
3104 /* Write a null member pointer value as (type)0, regardless of its
3105 real representation. */
3106 if (null_member_pointer_value_p (value
))
3107 write_integer_cst (integer_zero_node
);
3109 switch (TREE_CODE (value
))
3112 write_integer_cst (DECL_INITIAL (value
));
3116 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3117 || integer_zerop (value
) || integer_onep (value
));
3118 write_integer_cst (value
);
3122 write_real_cst (value
);
3126 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3127 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3129 write_integer_cst (TREE_REALPART (value
));
3131 write_integer_cst (TREE_IMAGPART (value
));
3133 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3134 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3136 write_real_cst (TREE_REALPART (value
));
3138 write_real_cst (TREE_IMAGPART (value
));
3145 sorry ("string literal in function template signature");
3155 /* Non-terminal <template-arg>.
3157 <template-arg> ::= <type> # type
3158 ::= L <type> </value/ number> E # literal
3159 ::= LZ <name> E # external name
3160 ::= X <expression> E # expression */
3163 write_template_arg (tree node
)
3165 enum tree_code code
= TREE_CODE (node
);
3167 MANGLE_TRACE_TREE ("template-arg", node
);
3169 /* A template template parameter's argument list contains TREE_LIST
3170 nodes of which the value field is the actual argument. */
3171 if (code
== TREE_LIST
)
3173 node
= TREE_VALUE (node
);
3174 /* If it's a decl, deal with its type instead. */
3177 node
= TREE_TYPE (node
);
3178 code
= TREE_CODE (node
);
3182 if (REFERENCE_REF_P (node
))
3183 node
= TREE_OPERAND (node
, 0);
3184 if (TREE_CODE (node
) == NOP_EXPR
3185 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3187 /* Template parameters can be of reference type. To maintain
3188 internal consistency, such arguments use a conversion from
3189 address of object to reference type. */
3190 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3191 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3194 if (TREE_CODE (node
) == BASELINK
3195 && !type_unknown_p (node
))
3197 if (abi_version_at_least (6))
3198 node
= BASELINK_FUNCTIONS (node
);
3199 if (abi_version_crosses (6))
3200 /* We wrongly wrapped a class-scope function in X/E. */
3201 G
.need_abi_warning
= 1;
3204 if (ARGUMENT_PACK_P (node
))
3206 /* Expand the template argument pack. */
3207 tree args
= ARGUMENT_PACK_ARGS (node
);
3208 int i
, length
= TREE_VEC_LENGTH (args
);
3209 if (abi_version_at_least (6))
3213 if (abi_version_crosses (6))
3214 G
.need_abi_warning
= 1;
3215 for (i
= 0; i
< length
; ++i
)
3216 write_template_arg (TREE_VEC_ELT (args
, i
));
3219 else if (TYPE_P (node
))
3221 else if (code
== TEMPLATE_DECL
)
3222 /* A template appearing as a template arg is a template template arg. */
3223 write_template_template_arg (node
);
3224 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3225 || code
== CONST_DECL
3226 || null_member_pointer_value_p (node
))
3227 write_template_arg_literal (node
);
3228 else if (DECL_P (node
))
3231 /* Until ABI version 3, the underscore before the mangled name
3232 was incorrectly omitted. */
3233 if (!abi_version_at_least (3))
3236 write_string ("_Z");
3237 if (abi_version_crosses (3))
3238 G
.need_abi_warning
= 1;
3239 write_encoding (node
);
3244 /* Template arguments may be expressions. */
3246 write_expression (node
);
3251 /* <template-template-arg>
3253 ::= <substitution> */
3256 write_template_template_arg (const tree decl
)
3258 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3260 if (find_substitution (decl
))
3262 write_name (decl
, /*ignore_local_scope=*/0);
3263 add_substitution (decl
);
3267 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3269 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3270 ::= A <expression> _ </element/ type>
3272 "Array types encode the dimension (number of elements) and the
3273 element type. For variable length arrays, the dimension (but not
3274 the '_' separator) is omitted." */
3277 write_array_type (const tree type
)
3280 if (TYPE_DOMAIN (type
))
3285 index_type
= TYPE_DOMAIN (type
);
3286 /* The INDEX_TYPE gives the upper and lower bounds of the
3288 max
= TYPE_MAX_VALUE (index_type
);
3289 if (TREE_CODE (max
) == INTEGER_CST
)
3291 /* The ABI specifies that we should mangle the number of
3292 elements in the array, not the largest allowed index. */
3293 offset_int wmax
= wi::to_offset (max
) + 1;
3294 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3295 number of elements as zero. */
3296 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3297 gcc_assert (wi::fits_uhwi_p (wmax
));
3298 write_unsigned_number (wmax
.to_uhwi ());
3302 max
= TREE_OPERAND (max
, 0);
3303 write_expression (max
);
3308 write_type (TREE_TYPE (type
));
3311 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3312 variables. TYPE is a pointer-to-member POINTER_TYPE.
3314 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3317 write_pointer_to_member_type (const tree type
)
3320 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3321 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3324 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3325 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3326 TEMPLATE_PARM_INDEX.
3328 <template-param> ::= T </parameter/ number> _ */
3331 write_template_param (const tree parm
)
3335 MANGLE_TRACE_TREE ("template-parm", parm
);
3337 switch (TREE_CODE (parm
))
3339 case TEMPLATE_TYPE_PARM
:
3340 case TEMPLATE_TEMPLATE_PARM
:
3341 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3342 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3345 case TEMPLATE_PARM_INDEX
:
3346 parm_index
= TEMPLATE_PARM_IDX (parm
);
3354 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3355 earliest template param denoted by `_'. */
3356 write_compact_number (parm_index
);
3359 /* <template-template-param>
3360 ::= <template-param>
3361 ::= <substitution> */
3364 write_template_template_param (const tree parm
)
3366 tree templ
= NULL_TREE
;
3368 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3369 template template parameter. The substitution candidate here is
3370 only the template. */
3371 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3374 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3375 if (find_substitution (templ
))
3379 /* <template-param> encodes only the template parameter position,
3380 not its template arguments, which is fine here. */
3381 write_template_param (parm
);
3383 add_substitution (templ
);
3386 /* Non-terminal <substitution>.
3388 <substitution> ::= S <seq-id> _
3392 write_substitution (const int seq_id
)
3394 MANGLE_TRACE ("substitution", "");
3398 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3402 /* Start mangling ENTITY. */
3405 start_mangling (const tree entity
)
3408 G
.need_abi_warning
= false;
3409 obstack_free (&name_obstack
, name_base
);
3410 mangle_obstack
= &name_obstack
;
3411 name_base
= obstack_alloc (&name_obstack
, 0);
3414 /* Done with mangling. If WARN is true, and the name of G.entity will
3415 be mangled differently in a future version of the ABI, issue a
3419 finish_mangling_internal (void)
3421 /* Clear all the substitutions. */
3422 vec_safe_truncate (G
.substitutions
, 0);
3424 /* Null-terminate the string. */
3429 /* Like finish_mangling_internal, but return the mangled string. */
3431 static inline const char *
3432 finish_mangling (void)
3434 finish_mangling_internal ();
3435 return (const char *) obstack_finish (mangle_obstack
);
3438 /* Like finish_mangling_internal, but return an identifier. */
3441 finish_mangling_get_identifier (void)
3443 finish_mangling_internal ();
3444 /* Don't obstack_finish here, and the next start_mangling will
3445 remove the identifier. */
3446 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3449 /* Initialize data structures for mangling. */
3454 gcc_obstack_init (&name_obstack
);
3455 name_base
= obstack_alloc (&name_obstack
, 0);
3456 vec_alloc (G
.substitutions
, 0);
3458 /* Cache these identifiers for quick comparison when checking for
3459 standard substitutions. */
3460 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3461 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3462 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3463 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3464 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3465 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3468 /* Generate the mangled name of DECL. */
3471 mangle_decl_string (const tree decl
)
3474 location_t saved_loc
= input_location
;
3475 tree saved_fn
= NULL_TREE
;
3476 bool template_p
= false;
3478 /* We shouldn't be trying to mangle an uninstantiated template. */
3479 gcc_assert (!type_dependent_expression_p (decl
));
3481 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3483 struct tinst_level
*tl
= current_instantiation ();
3484 if ((!tl
|| tl
->decl
!= decl
)
3485 && push_tinst_level (decl
))
3488 saved_fn
= current_function_decl
;
3489 current_function_decl
= NULL_TREE
;
3492 input_location
= DECL_SOURCE_LOCATION (decl
);
3494 start_mangling (decl
);
3496 if (TREE_CODE (decl
) == TYPE_DECL
)
3497 write_type (TREE_TYPE (decl
));
3499 write_mangled_name (decl
, true);
3501 result
= finish_mangling_get_identifier ();
3503 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3504 IDENTIFIER_POINTER (result
));
3509 current_function_decl
= saved_fn
;
3511 input_location
= saved_loc
;
3516 /* Return an identifier for the external mangled name of DECL. */
3519 get_mangled_id (tree decl
)
3521 tree id
= mangle_decl_string (decl
);
3522 return targetm
.mangle_decl_assembler_name (decl
, id
);
3525 /* If DECL is an implicit mangling alias, return its symtab node; otherwise
3528 static symtab_node
*
3529 decl_implicit_alias_p (tree decl
)
3531 if (DECL_P (decl
) && DECL_ARTIFICIAL (decl
)
3532 && DECL_IGNORED_P (decl
)
3533 && (TREE_CODE (decl
) == FUNCTION_DECL
3534 || (TREE_CODE (decl
) == VAR_DECL
3535 && TREE_STATIC (decl
))))
3537 symtab_node
*n
= symtab_node::get (decl
);
3538 if (n
&& n
->cpp_implicit_alias
)
3544 /* If DECL is a mangling alias, remove it from the symbol table and return
3545 true; otherwise return false. */
3548 maybe_remove_implicit_alias (tree decl
)
3550 if (symtab_node
*n
= decl_implicit_alias_p (decl
))
3558 /* Create an identifier for the external mangled name of DECL. */
3561 mangle_decl (const tree decl
)
3566 /* Don't bother mangling uninstantiated templates. */
3567 ++processing_template_decl
;
3568 if (TREE_CODE (decl
) == TYPE_DECL
)
3569 dep
= dependent_type_p (TREE_TYPE (decl
));
3571 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3572 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3573 --processing_template_decl
;
3577 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3578 It is not needed to assign names to anonymous namespace, but we use the
3579 "<anon>" marker to be able to tell if type is C++ ODR type or type
3580 produced by other language. */
3581 if (TREE_CODE (decl
) == TYPE_DECL
3582 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3583 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3584 id
= get_identifier ("<anon>");
3587 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3588 || !no_linkage_check (TREE_TYPE (decl
), true));
3589 id
= get_mangled_id (decl
);
3591 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3593 if (id
!= DECL_NAME (decl
)
3594 && !DECL_REALLY_EXTERN (decl
)
3595 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3596 && TREE_CODE (decl
) != TYPE_DECL
3597 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3598 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3602 /* Check IDENTIFIER_GLOBAL_VALUE before setting to avoid redundant
3603 errors from multiple definitions. */
3604 tree d
= IDENTIFIER_GLOBAL_VALUE (id
);
3605 if (!d
|| decl_implicit_alias_p (d
))
3608 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3611 if (!G
.need_abi_warning
)
3614 /* If the mangling will change in the future, emit an alias with the
3615 future mangled name for forward-compatibility. */
3621 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3622 inform (DECL_SOURCE_LOCATION (decl
), "a later -fabi-version= (or "
3623 "=0) avoids this error with a change in mangling");
3626 save_ver
= flag_abi_version
;
3627 flag_abi_version
= flag_abi_compat_version
;
3628 id2
= mangle_decl_string (decl
);
3629 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3630 flag_abi_version
= save_ver
;
3637 if (flag_abi_compat_version
!= 0
3638 && abi_version_at_least (flag_abi_compat_version
))
3639 warning (OPT_Wabi
, "the mangled name of %q+D changed between "
3640 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3641 G
.entity
, flag_abi_compat_version
, id2
,
3642 flag_abi_version
, id
);
3644 warning (OPT_Wabi
, "the mangled name of %q+D changes between "
3645 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3646 G
.entity
, flag_abi_version
, id
,
3647 flag_abi_compat_version
, id2
);
3650 note_mangling_alias (decl
, id2
);
3654 /* Generate the mangled representation of TYPE. */
3657 mangle_type_string (const tree type
)
3661 start_mangling (type
);
3663 result
= finish_mangling ();
3665 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3669 /* Create an identifier for the mangled name of a special component
3670 for belonging to TYPE. CODE is the ABI-specified code for this
3674 mangle_special_for_type (const tree type
, const char *code
)
3678 /* We don't have an actual decl here for the special component, so
3679 we can't just process the <encoded-name>. Instead, fake it. */
3680 start_mangling (type
);
3682 /* Start the mangling. */
3683 write_string ("_Z");
3684 write_string (code
);
3688 result
= finish_mangling_get_identifier ();
3691 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3692 IDENTIFIER_POINTER (result
));
3697 /* Create an identifier for the mangled representation of the typeinfo
3698 structure for TYPE. */
3701 mangle_typeinfo_for_type (const tree type
)
3703 return mangle_special_for_type (type
, "TI");
3706 /* Create an identifier for the mangled name of the NTBS containing
3707 the mangled name of TYPE. */
3710 mangle_typeinfo_string_for_type (const tree type
)
3712 return mangle_special_for_type (type
, "TS");
3715 /* Create an identifier for the mangled name of the vtable for TYPE. */
3718 mangle_vtbl_for_type (const tree type
)
3720 return mangle_special_for_type (type
, "TV");
3723 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3726 mangle_vtt_for_type (const tree type
)
3728 return mangle_special_for_type (type
, "TT");
3731 /* Return an identifier for a construction vtable group. TYPE is
3732 the most derived class in the hierarchy; BINFO is the base
3733 subobject for which this construction vtable group will be used.
3735 This mangling isn't part of the ABI specification; in the ABI
3736 specification, the vtable group is dumped in the same COMDAT as the
3737 main vtable, and is referenced only from that vtable, so it doesn't
3738 need an external name. For binary formats without COMDAT sections,
3739 though, we need external names for the vtable groups.
3741 We use the production
3743 <special-name> ::= CT <type> <offset number> _ <base type> */
3746 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
3750 start_mangling (type
);
3752 write_string ("_Z");
3753 write_string ("TC");
3755 write_integer_cst (BINFO_OFFSET (binfo
));
3757 write_type (BINFO_TYPE (binfo
));
3759 result
= finish_mangling_get_identifier ();
3761 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
3762 IDENTIFIER_POINTER (result
));
3766 /* Mangle a this pointer or result pointer adjustment.
3768 <call-offset> ::= h <fixed offset number> _
3769 ::= v <fixed offset number> _ <virtual offset number> _ */
3772 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
3774 write_char (virtual_offset
? 'v' : 'h');
3776 /* For either flavor, write the fixed offset. */
3777 write_integer_cst (fixed_offset
);
3780 /* For a virtual thunk, add the virtual offset. */
3783 write_integer_cst (virtual_offset
);
3788 /* Return an identifier for the mangled name of a this-adjusting or
3789 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3790 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3791 is a virtual thunk, and it is the vtbl offset in
3792 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3793 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3794 thunk itself. A covariant thunk name always includes the adjustment
3795 for the this pointer, even if there is none.
3797 <special-name> ::= T <call-offset> <base encoding>
3798 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3802 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
3803 tree virtual_offset
)
3807 start_mangling (fn_decl
);
3809 write_string ("_Z");
3812 if (!this_adjusting
)
3814 /* Covariant thunk with no this adjustment */
3816 mangle_call_offset (integer_zero_node
, NULL_TREE
);
3817 mangle_call_offset (fixed_offset
, virtual_offset
);
3819 else if (!DECL_THUNK_P (fn_decl
))
3820 /* Plain this adjusting thunk. */
3821 mangle_call_offset (fixed_offset
, virtual_offset
);
3824 /* This adjusting thunk to covariant thunk. */
3826 mangle_call_offset (fixed_offset
, virtual_offset
);
3827 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
3828 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
3830 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
3831 mangle_call_offset (fixed_offset
, virtual_offset
);
3832 fn_decl
= THUNK_TARGET (fn_decl
);
3836 write_encoding (fn_decl
);
3838 result
= finish_mangling_get_identifier ();
3840 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
3844 struct conv_type_hasher
: ggc_ptr_hash
<tree_node
>
3846 static hashval_t
hash (tree
);
3847 static bool equal (tree
, tree
);
3850 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3851 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3854 static GTY (()) hash_table
<conv_type_hasher
> *conv_type_names
;
3856 /* Hash a node (VAL1) in the table. */
3859 conv_type_hasher::hash (tree val
)
3861 return (hashval_t
) TYPE_UID (TREE_TYPE (val
));
3864 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3867 conv_type_hasher::equal (tree val1
, tree val2
)
3869 return TREE_TYPE (val1
) == val2
;
3872 /* Return an identifier for the mangled unqualified name for a
3873 conversion operator to TYPE. This mangling is not specified by the
3874 ABI spec; it is only used internally. */
3877 mangle_conv_op_name_for_type (const tree type
)
3882 if (type
== error_mark_node
)
3883 return error_mark_node
;
3885 if (conv_type_names
== NULL
)
3886 conv_type_names
= hash_table
<conv_type_hasher
>::create_ggc (31);
3888 slot
= conv_type_names
->find_slot_with_hash (type
,
3889 (hashval_t
) TYPE_UID (type
),
3896 /* Create a unique name corresponding to TYPE. */
3897 sprintf (buffer
, "operator %lu",
3898 (unsigned long) conv_type_names
->elements ());
3899 identifier
= get_identifier (buffer
);
3902 /* Hang TYPE off the identifier so it can be found easily later
3903 when performing conversions. */
3904 TREE_TYPE (identifier
) = type
;
3906 /* Set bits on the identifier so we know later it's a conversion. */
3907 IDENTIFIER_OPNAME_P (identifier
) = 1;
3908 IDENTIFIER_TYPENAME_P (identifier
) = 1;
3914 /* Write out the appropriate string for this variable when generating
3915 another mangled name based on this one. */
3918 write_guarded_var_name (const tree variable
)
3920 if (DECL_NAME (variable
)
3921 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
3922 /* The name of a guard variable for a reference temporary should refer
3923 to the reference, not the temporary. */
3924 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
3926 write_name (variable
, /*ignore_local_scope=*/0);
3929 /* Return an identifier for the name of an initialization guard
3930 variable for indicated VARIABLE. */
3933 mangle_guard_variable (const tree variable
)
3935 start_mangling (variable
);
3936 write_string ("_ZGV");
3937 write_guarded_var_name (variable
);
3938 return finish_mangling_get_identifier ();
3941 /* Return an identifier for the name of a thread_local initialization
3942 function for VARIABLE. */
3945 mangle_tls_init_fn (const tree variable
)
3947 start_mangling (variable
);
3948 write_string ("_ZTH");
3949 write_guarded_var_name (variable
);
3950 return finish_mangling_get_identifier ();
3953 /* Return an identifier for the name of a thread_local wrapper
3954 function for VARIABLE. */
3956 #define TLS_WRAPPER_PREFIX "_ZTW"
3959 mangle_tls_wrapper_fn (const tree variable
)
3961 start_mangling (variable
);
3962 write_string (TLS_WRAPPER_PREFIX
);
3963 write_guarded_var_name (variable
);
3964 return finish_mangling_get_identifier ();
3967 /* Return true iff FN is a thread_local wrapper function. */
3970 decl_tls_wrapper_p (const tree fn
)
3972 if (TREE_CODE (fn
) != FUNCTION_DECL
)
3974 tree name
= DECL_NAME (fn
);
3975 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
3976 strlen (TLS_WRAPPER_PREFIX
)) == 0;
3979 /* Return an identifier for the name of a temporary variable used to
3980 initialize a static reference. This isn't part of the ABI, but we might
3981 as well call them something readable. */
3983 static GTY(()) int temp_count
;
3986 mangle_ref_init_variable (const tree variable
)
3988 start_mangling (variable
);
3989 write_string ("_ZGR");
3990 write_name (variable
, /*ignore_local_scope=*/0);
3991 /* Avoid name clashes with aggregate initialization of multiple
3992 references at once. */
3993 write_unsigned_number (temp_count
++);
3994 return finish_mangling_get_identifier ();
3998 /* Foreign language type mangling section. */
4000 /* How to write the type codes for the integer Java type. */
4003 write_java_integer_type_codes (const tree type
)
4005 if (type
== java_int_type_node
)
4007 else if (type
== java_short_type_node
)
4009 else if (type
== java_byte_type_node
)
4011 else if (type
== java_char_type_node
)
4013 else if (type
== java_long_type_node
)
4015 else if (type
== java_boolean_type_node
)
4021 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4022 function generates a mangled name for the vtable map variable of
4023 the class type. For example, if the class type is
4024 "std::bad_exception", the mangled name for the class is
4025 "St13bad_exception". This function would generate the name
4026 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4027 "_VTV<std::bad_exception>::__vtable_map". */
4031 get_mangled_vtable_map_var_name (tree class_type
)
4033 char *var_name
= NULL
;
4034 const char *prefix
= "_ZN4_VTVI";
4035 const char *postfix
= "E12__vtable_mapE";
4037 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4039 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4040 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4042 strlen (postfix
) + 1;
4044 var_name
= (char *) xmalloc (len
);
4046 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4051 #include "gt-cp-mangle.h"