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 "hard-reg-set.h"
67 /* Debugging support. */
69 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
71 #define DEBUG_MANGLE 0
74 /* Macros for tracing the write_* functions. */
76 # define MANGLE_TRACE(FN, INPUT) \
77 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
78 # define MANGLE_TRACE_TREE(FN, NODE) \
79 fprintf (stderr, " %-24s: %-24s (%p)\n", \
80 (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE))
82 # define MANGLE_TRACE(FN, INPUT)
83 # define MANGLE_TRACE_TREE(FN, NODE)
86 /* Nonzero if NODE is a class template-id. We can't rely on
87 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
88 that hard to distinguish A<T> from A, where A<T> is the type as
89 instantiated outside of the template, and A is the type used
90 without parameters inside the template. */
91 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
92 (TYPE_LANG_SPECIFIC (NODE) != NULL \
93 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
94 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
95 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
97 /* Things we only need one of. This module is not reentrant. */
98 typedef struct GTY(()) globals
{
99 /* An array of the current substitution candidates, in the order
101 vec
<tree
, va_gc
> *substitutions
;
103 /* The entity that is being mangled. */
104 tree
GTY ((skip
)) entity
;
106 /* How many parameter scopes we are inside. */
109 /* True if the mangling will be different in a future version of the
111 bool need_abi_warning
;
114 static GTY (()) globals G
;
116 /* The obstack on which we build mangled names. */
117 static struct obstack
*mangle_obstack
;
119 /* The obstack on which we build mangled names that are not going to
120 be IDENTIFIER_NODEs. */
121 static struct obstack name_obstack
;
123 /* The first object on the name_obstack; we use this to free memory
124 allocated on the name_obstack. */
125 static void *name_base
;
127 /* Indices into subst_identifiers. These are identifiers used in
128 special substitution rules. */
136 SUBID_BASIC_IOSTREAM
,
139 substitution_identifier_index_t
;
141 /* For quick substitution checks, look up these common identifiers
143 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
145 /* Single-letter codes for builtin integer types, defined in
146 <builtin-type>. These are indexed by integer_type_kind values. */
148 integer_type_codes
[itk_none
] =
151 'a', /* itk_signed_char */
152 'h', /* itk_unsigned_char */
154 't', /* itk_unsigned_short */
156 'j', /* itk_unsigned_int */
158 'm', /* itk_unsigned_long */
159 'x', /* itk_long_long */
160 'y', /* itk_unsigned_long_long */
161 /* __intN types are handled separately */
162 '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0'
165 static int decl_is_template_id (const tree
, tree
* const);
167 /* Functions for handling substitutions. */
169 static inline tree
canonicalize_for_substitution (tree
);
170 static void add_substitution (tree
);
171 static inline int is_std_substitution (const tree
,
172 const substitution_identifier_index_t
);
173 static inline int is_std_substitution_char (const tree
,
174 const substitution_identifier_index_t
);
175 static int find_substitution (tree
);
176 static void mangle_call_offset (const tree
, const tree
);
178 /* Functions for emitting mangled representations of things. */
180 static void write_mangled_name (const tree
, bool);
181 static void write_encoding (const tree
);
182 static void write_name (tree
, const int);
183 static void write_abi_tags (tree
);
184 static void write_unscoped_name (const tree
);
185 static void write_unscoped_template_name (const tree
);
186 static void write_nested_name (const tree
);
187 static void write_prefix (const tree
);
188 static void write_template_prefix (const tree
);
189 static void write_unqualified_name (tree
);
190 static void write_conversion_operator_name (const tree
);
191 static void write_source_name (tree
);
192 static void write_literal_operator_name (tree
);
193 static void write_unnamed_type_name (const tree
);
194 static void write_closure_type_name (const tree
);
195 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
197 static void write_number (unsigned HOST_WIDE_INT
, const int,
199 static void write_compact_number (int num
);
200 static void write_integer_cst (const tree
);
201 static void write_real_cst (const tree
);
202 static void write_identifier (const char *);
203 static void write_special_name_constructor (const tree
);
204 static void write_special_name_destructor (const tree
);
205 static void write_type (tree
);
206 static int write_CV_qualifiers_for_type (const tree
);
207 static void write_builtin_type (tree
);
208 static void write_function_type (const tree
);
209 static void write_bare_function_type (const tree
, const int, const tree
);
210 static void write_method_parms (tree
, const int, const tree
);
211 static void write_class_enum_type (const tree
);
212 static void write_template_args (tree
);
213 static void write_expression (tree
);
214 static void write_template_arg_literal (const tree
);
215 static void write_template_arg (tree
);
216 static void write_template_template_arg (const tree
);
217 static void write_array_type (const tree
);
218 static void write_pointer_to_member_type (const tree
);
219 static void write_template_param (const tree
);
220 static void write_template_template_param (const tree
);
221 static void write_substitution (const int);
222 static int discriminator_for_local_entity (tree
);
223 static int discriminator_for_string_literal (tree
, tree
);
224 static void write_discriminator (const int);
225 static void write_local_name (tree
, const tree
, const tree
);
226 static void dump_substitution_candidates (void);
227 static tree
mangle_decl_string (const tree
);
228 static int local_class_index (tree
);
230 /* Control functions. */
232 static inline void start_mangling (const tree
);
233 static tree
mangle_special_for_type (const tree
, const char *);
235 /* Foreign language functions. */
237 static void write_java_integer_type_codes (const tree
);
239 /* Append a single character to the end of the mangled
241 #define write_char(CHAR) \
242 obstack_1grow (mangle_obstack, (CHAR))
244 /* Append a sized buffer to the end of the mangled representation. */
245 #define write_chars(CHAR, LEN) \
246 obstack_grow (mangle_obstack, (CHAR), (LEN))
248 /* Append a NUL-terminated string to the end of the mangled
250 #define write_string(STRING) \
251 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
253 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
254 same purpose (context, which may be a type) and value (template
255 decl). See write_template_prefix for more information on what this
257 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
258 (TREE_CODE (NODE1) == TREE_LIST \
259 && TREE_CODE (NODE2) == TREE_LIST \
260 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
261 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
262 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
263 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
265 /* Write out an unsigned quantity in base 10. */
266 #define write_unsigned_number(NUMBER) \
267 write_number ((NUMBER), /*unsigned_p=*/1, 10)
269 /* If DECL is a template instance, return nonzero and, if
270 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
271 Otherwise return zero. */
274 decl_is_template_id (const tree decl
, tree
* const template_info
)
276 if (TREE_CODE (decl
) == TYPE_DECL
)
278 /* TYPE_DECLs are handled specially. Look at its type to decide
279 if this is a template instantiation. */
280 const tree type
= TREE_TYPE (decl
);
282 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
284 if (template_info
!= NULL
)
285 /* For a templated TYPE_DECL, the template info is hanging
287 *template_info
= TYPE_TEMPLATE_INFO (type
);
293 /* Check if this is a primary template. */
294 if (DECL_LANG_SPECIFIC (decl
) != NULL
295 && DECL_USE_TEMPLATE (decl
)
296 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
297 && TREE_CODE (decl
) != TEMPLATE_DECL
)
299 if (template_info
!= NULL
)
300 /* For most templated decls, the template info is hanging
302 *template_info
= DECL_TEMPLATE_INFO (decl
);
307 /* It's not a template id. */
311 /* Produce debugging output of current substitution candidates. */
314 dump_substitution_candidates (void)
319 fprintf (stderr
, " ++ substitutions ");
320 FOR_EACH_VEC_ELT (*G
.substitutions
, i
, el
)
322 const char *name
= "???";
325 fprintf (stderr
, " ");
327 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
328 else if (TREE_CODE (el
) == TREE_LIST
)
329 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
330 else if (TYPE_NAME (el
))
331 name
= TYPE_NAME_STRING (el
);
332 fprintf (stderr
, " S%d_ = ", i
- 1);
334 (CP_TYPE_RESTRICT_P (el
)
335 || CP_TYPE_VOLATILE_P (el
)
336 || CP_TYPE_CONST_P (el
)))
337 fprintf (stderr
, "CV-");
338 fprintf (stderr
, "%s (%s at %p)\n",
339 name
, get_tree_code_name (TREE_CODE (el
)), (void *) el
);
343 /* Both decls and types can be substitution candidates, but sometimes
344 they refer to the same thing. For instance, a TYPE_DECL and
345 RECORD_TYPE for the same class refer to the same thing, and should
346 be treated accordingly in substitutions. This function returns a
347 canonicalized tree node representing NODE that is used when adding
348 and substitution candidates and finding matches. */
351 canonicalize_for_substitution (tree node
)
353 /* For a TYPE_DECL, use the type instead. */
354 if (TREE_CODE (node
) == TYPE_DECL
)
355 node
= TREE_TYPE (node
);
357 && TYPE_CANONICAL (node
) != node
358 && TYPE_MAIN_VARIANT (node
) != node
)
361 /* Here we want to strip the topmost typedef only.
362 We need to do that so is_std_substitution can do proper
364 if (TREE_CODE (node
) == FUNCTION_TYPE
)
365 /* Use build_qualified_type and TYPE_QUALS here to preserve
366 the old buggy mangling of attribute noreturn with abi<5. */
367 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
370 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
371 cp_type_quals (node
));
372 if (TREE_CODE (node
) == FUNCTION_TYPE
373 || TREE_CODE (node
) == METHOD_TYPE
)
374 node
= build_ref_qualified_type (node
, type_memfn_rqual (orig
));
379 /* Add NODE as a substitution candidate. NODE must not already be on
380 the list of candidates. */
383 add_substitution (tree node
)
388 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
389 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
391 /* Get the canonicalized substitution candidate for NODE. */
392 c
= canonicalize_for_substitution (node
);
393 if (DEBUG_MANGLE
&& c
!= node
)
394 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
395 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
399 /* Make sure NODE isn't already a candidate. */
404 FOR_EACH_VEC_SAFE_ELT (G
.substitutions
, i
, candidate
)
406 gcc_assert (!(DECL_P (node
) && node
== candidate
));
407 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
408 && same_type_p (node
, candidate
)));
411 #endif /* ENABLE_CHECKING */
413 /* Put the decl onto the varray of substitution candidates. */
414 vec_safe_push (G
.substitutions
, node
);
417 dump_substitution_candidates ();
420 /* Helper function for find_substitution. Returns nonzero if NODE,
421 which may be a decl or a CLASS_TYPE, is a template-id with template
422 name of substitution_index[INDEX] in the ::std namespace. */
425 is_std_substitution (const tree node
,
426 const substitution_identifier_index_t index
)
433 type
= TREE_TYPE (node
);
436 else if (CLASS_TYPE_P (node
))
439 decl
= TYPE_NAME (node
);
442 /* These are not the droids you're looking for. */
445 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
446 && TYPE_LANG_SPECIFIC (type
)
447 && TYPE_TEMPLATE_INFO (type
)
448 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
449 == subst_identifiers
[index
]));
452 /* Helper function for find_substitution. Returns nonzero if NODE,
453 which may be a decl or a CLASS_TYPE, is the template-id
454 ::std::identifier<char>, where identifier is
455 substitution_index[INDEX]. */
458 is_std_substitution_char (const tree node
,
459 const substitution_identifier_index_t index
)
462 /* Check NODE's name is ::std::identifier. */
463 if (!is_std_substitution (node
, index
))
465 /* Figure out its template args. */
467 args
= DECL_TI_ARGS (node
);
468 else if (CLASS_TYPE_P (node
))
469 args
= CLASSTYPE_TI_ARGS (node
);
471 /* Oops, not a template. */
473 /* NODE's template arg list should be <char>. */
475 TREE_VEC_LENGTH (args
) == 1
476 && TREE_VEC_ELT (args
, 0) == char_type_node
;
479 /* Check whether a substitution should be used to represent NODE in
482 First, check standard special-case substitutions.
484 <substitution> ::= St
491 # ::std::basic_string
494 # ::std::basic_string<char,
495 ::std::char_traits<char>,
496 ::std::allocator<char> >
499 # ::std::basic_istream<char, ::std::char_traits<char> >
502 # ::std::basic_ostream<char, ::std::char_traits<char> >
505 # ::std::basic_iostream<char, ::std::char_traits<char> >
507 Then examine the stack of currently available substitution
508 candidates for entities appearing earlier in the same mangling
510 If a substitution is found, write its mangled representation and
511 return nonzero. If none is found, just return zero. */
514 find_substitution (tree node
)
517 const int size
= vec_safe_length (G
.substitutions
);
520 const char *abbr
= NULL
;
523 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
524 get_tree_code_name (TREE_CODE (node
)), (void *) node
);
526 /* Obtain the canonicalized substitution representation for NODE.
527 This is what we'll compare against. */
528 node
= canonicalize_for_substitution (node
);
530 /* Check for builtin substitutions. */
532 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
533 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
535 /* Check for std::allocator. */
537 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
538 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
541 /* Check for std::basic_string. */
542 else if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
546 /* If this is a type (i.e. a fully-qualified template-id),
548 std::basic_string <char,
549 std::char_traits<char>,
550 std::allocator<char> > . */
551 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
552 && CLASSTYPE_USE_TEMPLATE (type
))
554 tree args
= CLASSTYPE_TI_ARGS (type
);
555 if (TREE_VEC_LENGTH (args
) == 3
556 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
557 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
559 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
565 /* Substitute for the template name only if this isn't a type. */
569 /* Check for basic_{i,o,io}stream. */
570 else if (TYPE_P (node
)
571 && cp_type_quals (type
) == TYPE_UNQUALIFIED
572 && CLASS_TYPE_P (type
)
573 && CLASSTYPE_USE_TEMPLATE (type
)
574 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
576 /* First, check for the template
577 args <char, std::char_traits<char> > . */
578 tree args
= CLASSTYPE_TI_ARGS (type
);
579 if (TREE_VEC_LENGTH (args
) == 2
580 && TYPE_P (TREE_VEC_ELT (args
, 0))
581 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
582 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
585 /* Got them. Is this basic_istream? */
586 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
588 /* Or basic_ostream? */
589 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
591 /* Or basic_iostream? */
592 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
597 /* Check for namespace std. */
598 else if (decl
&& DECL_NAMESPACE_STD_P (decl
))
604 tree tags
= NULL_TREE
;
605 if (OVERLOAD_TYPE_P (node
) || DECL_CLASS_TEMPLATE_P (node
))
606 tags
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (type
));
607 /* Now check the list of available substitutions for this mangling
609 if (!abbr
|| tags
) for (i
= 0; i
< size
; ++i
)
611 tree candidate
= (*G
.substitutions
)[i
];
612 /* NODE is a matched to a candidate if it's the same decl node or
613 if it's the same type. */
614 if (decl
== candidate
615 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
616 && same_type_p (type
, candidate
))
617 || NESTED_TEMPLATE_MATCH (node
, candidate
))
619 write_substitution (i
);
625 /* No substitution found. */
631 /* If there are ABI tags on the abbreviation, it becomes
632 a substitution candidate. */
633 write_abi_tags (tags
);
634 add_substitution (node
);
639 /* Returns whether DECL's symbol name should be the plain unqualified-id
640 rather than a more complicated mangled name. */
643 unmangled_name_p (const tree decl
)
645 if (TREE_CODE (decl
) == FUNCTION_DECL
)
647 /* The names of `extern "C"' functions are not mangled. */
648 return (DECL_EXTERN_C_FUNCTION_P (decl
)
649 /* But overloaded operator names *are* mangled. */
650 && !DECL_OVERLOADED_OPERATOR_P (decl
));
652 else if (VAR_P (decl
))
654 /* static variables are mangled. */
655 if (!DECL_EXTERNAL_LINKAGE_P (decl
))
658 /* extern "C" declarations aren't mangled. */
659 if (DECL_EXTERN_C_P (decl
))
662 /* Other variables at non-global scope are mangled. */
663 if (CP_DECL_CONTEXT (decl
) != global_namespace
)
666 /* Variable template instantiations are mangled. */
667 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
668 && variable_template_p (DECL_TI_TEMPLATE (decl
)))
671 /* Declarations with ABI tags are mangled. */
672 if (lookup_attribute ("abi_tag", DECL_ATTRIBUTES (decl
)))
675 /* The names of non-static global variables aren't mangled. */
682 /* TOP_LEVEL is true, if this is being called at outermost level of
683 mangling. It should be false when mangling a decl appearing in an
684 expression within some other mangling.
686 <mangled-name> ::= _Z <encoding> */
689 write_mangled_name (const tree decl
, bool top_level
)
691 MANGLE_TRACE_TREE ("mangled-name", decl
);
693 check_abi_tags (decl
);
695 if (unmangled_name_p (decl
))
698 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
701 /* The standard notes: "The <encoding> of an extern "C"
702 function is treated like global-scope data, i.e. as its
703 <source-name> without a type." We cannot write
704 overloaded operators that way though, because it contains
705 characters invalid in assembler. */
707 write_source_name (DECL_NAME (decl
));
713 write_encoding (decl
);
717 /* Returns true if the return type of DECL is part of its signature, and
718 therefore its mangling. */
721 mangle_return_type_p (tree decl
)
723 return (!DECL_CONSTRUCTOR_P (decl
)
724 && !DECL_DESTRUCTOR_P (decl
)
725 && !DECL_CONV_FN_P (decl
)
726 && decl_is_template_id (decl
, NULL
));
729 /* <encoding> ::= <function name> <bare-function-type>
733 write_encoding (const tree decl
)
735 MANGLE_TRACE_TREE ("encoding", decl
);
737 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
739 /* For overloaded operators write just the mangled name
740 without arguments. */
741 if (DECL_OVERLOADED_OPERATOR_P (decl
))
742 write_name (decl
, /*ignore_local_scope=*/0);
744 write_source_name (DECL_NAME (decl
));
748 write_name (decl
, /*ignore_local_scope=*/0);
749 if (TREE_CODE (decl
) == FUNCTION_DECL
)
754 if (decl_is_template_id (decl
, NULL
))
756 fn_type
= get_mostly_instantiated_function_type (decl
);
757 /* FN_TYPE will not have parameter types for in-charge or
758 VTT parameters. Therefore, we pass NULL_TREE to
759 write_bare_function_type -- otherwise, it will get
760 confused about which artificial parameters to skip. */
765 fn_type
= TREE_TYPE (decl
);
769 write_bare_function_type (fn_type
,
770 mangle_return_type_p (decl
),
775 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
776 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
779 decl_mangling_context (tree decl
)
781 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
783 if (tcontext
!= NULL_TREE
)
786 if (TREE_CODE (decl
) == TEMPLATE_DECL
787 && DECL_TEMPLATE_RESULT (decl
))
788 decl
= DECL_TEMPLATE_RESULT (decl
);
790 if (TREE_CODE (decl
) == TYPE_DECL
791 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
793 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
797 else if (template_type_parameter_p (decl
))
798 /* template type parms have no mangling context. */
800 return CP_DECL_CONTEXT (decl
);
803 /* <name> ::= <unscoped-name>
804 ::= <unscoped-template-name> <template-args>
808 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
809 called from <local-name>, which mangles the enclosing scope
810 elsewhere and then uses this function to mangle just the part
811 underneath the function scope. So don't use the <local-name>
812 production, to avoid an infinite recursion. */
815 write_name (tree decl
, const int ignore_local_scope
)
819 MANGLE_TRACE_TREE ("name", decl
);
821 if (TREE_CODE (decl
) == TYPE_DECL
)
823 /* In case this is a typedef, fish out the corresponding
824 TYPE_DECL for the main variant. */
825 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
828 context
= decl_mangling_context (decl
);
830 gcc_assert (context
!= NULL_TREE
);
832 if (abi_version_crosses (7)
833 && ignore_local_scope
834 && TREE_CODE (context
) == PARM_DECL
)
835 G
.need_abi_warning
= 1;
837 /* A decl in :: or ::std scope is treated specially. The former is
838 mangled using <unscoped-name> or <unscoped-template-name>, the
839 latter with a special substitution. Also, a name that is
840 directly in a local function scope is also mangled with
841 <unscoped-name> rather than a full <nested-name>. */
842 if (context
== global_namespace
843 || DECL_NAMESPACE_STD_P (context
)
844 || (ignore_local_scope
845 && (TREE_CODE (context
) == FUNCTION_DECL
846 || (abi_version_at_least (7)
847 && TREE_CODE (context
) == PARM_DECL
))))
850 /* Is this a template instance? */
851 if (decl_is_template_id (decl
, &template_info
))
853 /* Yes: use <unscoped-template-name>. */
854 write_unscoped_template_name (TI_TEMPLATE (template_info
));
855 write_template_args (TI_ARGS (template_info
));
858 /* Everything else gets an <unqualified-name>. */
859 write_unscoped_name (decl
);
863 /* Handle local names, unless we asked not to (that is, invoked
864 under <local-name>, to handle only the part of the name under
866 if (!ignore_local_scope
)
868 /* Scan up the list of scope context, looking for a
869 function. If we find one, this entity is in local
870 function scope. local_entity tracks context one scope
871 level down, so it will contain the element that's
872 directly in that function's scope, either decl or one of
873 its enclosing scopes. */
874 tree local_entity
= decl
;
875 while (context
!= global_namespace
)
877 /* Make sure we're always dealing with decls. */
878 if (TYPE_P (context
))
879 context
= TYPE_NAME (context
);
880 /* Is this a function? */
881 if (TREE_CODE (context
) == FUNCTION_DECL
882 || TREE_CODE (context
) == PARM_DECL
)
884 /* Yes, we have local scope. Use the <local-name>
885 production for the innermost function scope. */
886 write_local_name (context
, local_entity
, decl
);
889 /* Up one scope level. */
890 local_entity
= context
;
891 context
= decl_mangling_context (context
);
894 /* No local scope found? Fall through to <nested-name>. */
897 /* Other decls get a <nested-name> to encode their scope. */
898 write_nested_name (decl
);
902 /* <unscoped-name> ::= <unqualified-name>
903 ::= St <unqualified-name> # ::std:: */
906 write_unscoped_name (const tree decl
)
908 tree context
= decl_mangling_context (decl
);
910 MANGLE_TRACE_TREE ("unscoped-name", decl
);
912 /* Is DECL in ::std? */
913 if (DECL_NAMESPACE_STD_P (context
))
916 write_unqualified_name (decl
);
920 /* If not, it should be either in the global namespace, or directly
921 in a local function scope. A lambda can also be mangled in the
922 scope of a default argument. */
923 gcc_assert (context
== global_namespace
924 || TREE_CODE (context
) == PARM_DECL
925 || TREE_CODE (context
) == FUNCTION_DECL
);
927 write_unqualified_name (decl
);
931 /* <unscoped-template-name> ::= <unscoped-name>
932 ::= <substitution> */
935 write_unscoped_template_name (const tree decl
)
937 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
939 if (find_substitution (decl
))
941 write_unscoped_name (decl
);
942 add_substitution (decl
);
945 /* Write the nested name, including CV-qualifiers, of DECL.
947 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
948 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
950 <ref-qualifier> ::= R # & ref-qualifier
951 ::= O # && ref-qualifier
952 <CV-qualifiers> ::= [r] [V] [K] */
955 write_nested_name (const tree decl
)
959 MANGLE_TRACE_TREE ("nested-name", decl
);
963 /* Write CV-qualifiers, if this is a member function. */
964 if (TREE_CODE (decl
) == FUNCTION_DECL
965 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
967 if (DECL_VOLATILE_MEMFUNC_P (decl
))
969 if (DECL_CONST_MEMFUNC_P (decl
))
971 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl
)))
973 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl
)))
980 /* Is this a template instance? */
981 if (decl_is_template_id (decl
, &template_info
))
983 /* Yes, use <template-prefix>. */
984 write_template_prefix (decl
);
985 write_template_args (TI_ARGS (template_info
));
987 else if ((!abi_version_at_least (10) || TREE_CODE (decl
) == TYPE_DECL
)
988 && TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
990 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
991 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
993 write_template_prefix (decl
);
994 write_template_args (TREE_OPERAND (name
, 1));
998 write_prefix (decl_mangling_context (decl
));
999 write_unqualified_name (decl
);
1004 /* No, just use <prefix> */
1005 write_prefix (decl_mangling_context (decl
));
1006 write_unqualified_name (decl
);
1011 /* <prefix> ::= <prefix> <unqualified-name>
1012 ::= <template-param>
1013 ::= <template-prefix> <template-args>
1016 ::= <substitution> */
1019 write_prefix (const tree node
)
1022 /* Non-NULL if NODE represents a template-id. */
1023 tree template_info
= NULL
;
1026 || node
== global_namespace
)
1029 MANGLE_TRACE_TREE ("prefix", node
);
1031 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
1037 if (find_substitution (node
))
1042 /* If this is a function or parm decl, that means we've hit function
1043 scope, so this prefix must be for a local name. In this
1044 case, we're under the <local-name> production, which encodes
1045 the enclosing function scope elsewhere. So don't continue
1047 if (TREE_CODE (node
) == FUNCTION_DECL
1048 || TREE_CODE (node
) == PARM_DECL
)
1052 decl_is_template_id (decl
, &template_info
);
1056 /* Node is a type. */
1057 decl
= TYPE_NAME (node
);
1058 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1059 template_info
= TYPE_TEMPLATE_INFO (node
);
1062 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
)
1063 write_template_param (node
);
1064 else if (template_info
!= NULL
)
1067 write_template_prefix (decl
);
1068 write_template_args (TI_ARGS (template_info
));
1070 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1072 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1073 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1075 write_template_prefix (decl
);
1076 write_template_args (TREE_OPERAND (name
, 1));
1080 write_prefix (decl_mangling_context (decl
));
1081 write_unqualified_name (decl
);
1085 /* Not templated. */
1087 write_prefix (decl_mangling_context (decl
));
1088 write_unqualified_name (decl
);
1090 || TREE_CODE (decl
) == FIELD_DECL
)
1092 /* <data-member-prefix> := <member source-name> M */
1098 add_substitution (node
);
1101 /* <template-prefix> ::= <prefix> <template component>
1102 ::= <template-param>
1103 ::= <substitution> */
1106 write_template_prefix (const tree node
)
1108 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1109 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1110 tree context
= decl_mangling_context (decl
);
1115 MANGLE_TRACE_TREE ("template-prefix", node
);
1117 /* Find the template decl. */
1118 if (decl_is_template_id (decl
, &template_info
))
1119 templ
= TI_TEMPLATE (template_info
);
1120 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1121 /* For a typename type, all we have is the name. */
1122 templ
= DECL_NAME (decl
);
1125 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1127 templ
= TYPE_TI_TEMPLATE (type
);
1130 /* For a member template, though, the template name for the
1131 innermost name must have all the outer template levels
1132 instantiated. For instance, consider
1134 template<typename T> struct Outer {
1135 template<typename U> struct Inner {};
1138 The template name for `Inner' in `Outer<int>::Inner<float>' is
1139 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1140 levels separately, so there's no TEMPLATE_DECL available for this
1141 (there's only `Outer<T>::Inner<U>').
1143 In order to get the substitutions right, we create a special
1144 TREE_LIST to represent the substitution candidate for a nested
1145 template. The TREE_PURPOSE is the template's context, fully
1146 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1149 So, for the example above, `Outer<int>::Inner' is represented as a
1150 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1151 and whose value is `Outer<T>::Inner<U>'. */
1152 if (TYPE_P (context
))
1153 substitution
= build_tree_list (context
, templ
);
1155 substitution
= templ
;
1157 if (find_substitution (substitution
))
1160 if (TREE_TYPE (templ
)
1161 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
)
1162 write_template_param (TREE_TYPE (templ
));
1165 write_prefix (context
);
1166 write_unqualified_name (decl
);
1169 add_substitution (substitution
);
1172 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1173 mangled through special entry points.
1175 <unqualified-name> ::= <operator-name>
1178 ::= <unnamed-type-name>
1179 ::= <local-source-name>
1181 <local-source-name> ::= L <source-name> <discriminator> */
1184 write_unqualified_id (tree identifier
)
1186 if (IDENTIFIER_TYPENAME_P (identifier
))
1187 write_conversion_operator_name (TREE_TYPE (identifier
));
1188 else if (IDENTIFIER_OPNAME_P (identifier
))
1191 const char *mangled_name
= NULL
;
1193 /* Unfortunately, there is no easy way to go from the
1194 name of the operator back to the corresponding tree
1196 for (i
= 0; i
< MAX_TREE_CODES
; ++i
)
1197 if (operator_name_info
[i
].identifier
== identifier
)
1199 /* The ABI says that we prefer binary operator
1200 names to unary operator names. */
1201 if (operator_name_info
[i
].arity
== 2)
1203 mangled_name
= operator_name_info
[i
].mangled_name
;
1206 else if (!mangled_name
)
1207 mangled_name
= operator_name_info
[i
].mangled_name
;
1209 else if (assignment_operator_name_info
[i
].identifier
1213 = assignment_operator_name_info
[i
].mangled_name
;
1216 write_string (mangled_name
);
1218 else if (UDLIT_OPER_P (identifier
))
1219 write_literal_operator_name (identifier
);
1221 write_source_name (identifier
);
1225 write_unqualified_name (tree decl
)
1227 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1229 if (identifier_p (decl
))
1231 write_unqualified_id (decl
);
1237 if (DECL_NAME (decl
) == NULL_TREE
)
1240 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1241 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1243 else if (DECL_DECLARES_FUNCTION_P (decl
))
1246 if (DECL_CONSTRUCTOR_P (decl
))
1247 write_special_name_constructor (decl
);
1248 else if (DECL_DESTRUCTOR_P (decl
))
1249 write_special_name_destructor (decl
);
1250 else if (DECL_CONV_FN_P (decl
))
1252 /* Conversion operator. Handle it right here.
1253 <operator> ::= cv <type> */
1255 if (decl_is_template_id (decl
, NULL
))
1258 fn_type
= get_mostly_instantiated_function_type (decl
);
1259 type
= TREE_TYPE (fn_type
);
1261 else if (FNDECL_USED_AUTO (decl
))
1262 type
= (DECL_STRUCT_FUNCTION (decl
)->language
1263 ->x_auto_return_pattern
);
1265 type
= DECL_CONV_FN_TYPE (decl
);
1266 write_conversion_operator_name (type
);
1268 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1270 operator_name_info_t
*oni
;
1271 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1272 oni
= assignment_operator_name_info
;
1274 oni
= operator_name_info
;
1276 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1278 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1279 write_literal_operator_name (DECL_NAME (decl
));
1286 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1287 && DECL_NAMESPACE_SCOPE_P (decl
)
1288 && decl_linkage (decl
) == lk_internal
)
1290 MANGLE_TRACE_TREE ("local-source-name", decl
);
1292 write_source_name (DECL_NAME (decl
));
1293 /* The default discriminator is 1, and that's all we ever use,
1294 so there's no code to output one here. */
1298 tree type
= TREE_TYPE (decl
);
1300 if (TREE_CODE (decl
) == TYPE_DECL
1301 && TYPE_ANONYMOUS_P (type
))
1302 write_unnamed_type_name (type
);
1303 else if (TREE_CODE (decl
) == TYPE_DECL
1304 && LAMBDA_TYPE_P (type
))
1305 write_closure_type_name (type
);
1307 write_source_name (DECL_NAME (decl
));
1310 /* We use the ABI tags from the primary template, ignoring tags on any
1311 specializations. This is necessary because C++ doesn't require a
1312 specialization to be declared before it is used unless the use
1313 requires a complete type, but we need to get the tags right on
1314 incomplete types as well. */
1315 if (tree tmpl
= most_general_template (decl
))
1316 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1317 /* Don't crash on an unbound class template. */
1318 if (decl
&& TREE_CODE (decl
) != NAMESPACE_DECL
)
1320 tree attrs
= (TREE_CODE (decl
) == TYPE_DECL
1321 ? TYPE_ATTRIBUTES (TREE_TYPE (decl
))
1322 : DECL_ATTRIBUTES (decl
));
1323 write_abi_tags (lookup_attribute ("abi_tag", attrs
));
1327 /* Write the unqualified-name for a conversion operator to TYPE. */
1330 write_conversion_operator_name (const tree type
)
1332 write_string ("cv");
1336 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1338 <source-name> ::= </length/ number> <identifier> */
1341 write_source_name (tree identifier
)
1343 MANGLE_TRACE_TREE ("source-name", identifier
);
1345 /* Never write the whole template-id name including the template
1346 arguments; we only want the template name. */
1347 if (IDENTIFIER_TEMPLATE (identifier
))
1348 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1350 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1351 write_identifier (IDENTIFIER_POINTER (identifier
));
1354 /* Compare two TREE_STRINGs like strcmp. */
1357 tree_string_cmp (const void *p1
, const void *p2
)
1361 tree s1
= *(const tree
*)p1
;
1362 tree s2
= *(const tree
*)p2
;
1363 return strcmp (TREE_STRING_POINTER (s1
),
1364 TREE_STRING_POINTER (s2
));
1367 /* ID is the name of a function or type with abi_tags attribute TAGS.
1368 Write out the name, suitably decorated. */
1371 write_abi_tags (tree tags
)
1373 if (tags
== NULL_TREE
)
1376 tags
= TREE_VALUE (tags
);
1378 vec
<tree
, va_gc
> * vec
= make_tree_vector();
1380 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1382 if (ABI_TAG_IMPLICIT (t
))
1384 tree str
= TREE_VALUE (t
);
1385 vec_safe_push (vec
, str
);
1388 vec
->qsort (tree_string_cmp
);
1390 unsigned i
; tree str
;
1391 FOR_EACH_VEC_ELT (*vec
, i
, str
)
1394 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1395 write_identifier (TREE_STRING_POINTER (str
));
1398 release_tree_vector (vec
);
1401 /* Write a user-defined literal operator.
1402 ::= li <source-name> # "" <source-name>
1403 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1406 write_literal_operator_name (tree identifier
)
1408 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1409 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1410 write_unsigned_number (strlen (suffix
));
1411 write_identifier (suffix
);
1414 /* Encode 0 as _, and 1+ as n-1_. */
1417 write_compact_number (int num
)
1420 write_unsigned_number (num
- 1);
1424 /* Return how many unnamed types precede TYPE in its enclosing class. */
1427 nested_anon_class_index (tree type
)
1430 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1431 for (; member
; member
= DECL_CHAIN (member
))
1432 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1434 tree memtype
= TREE_TYPE (member
);
1435 if (memtype
== type
)
1437 else if (TYPE_ANONYMOUS_P (memtype
))
1444 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1447 write_unnamed_type_name (const tree type
)
1450 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1452 if (TYPE_FUNCTION_SCOPE_P (type
))
1453 discriminator
= local_class_index (type
);
1454 else if (TYPE_CLASS_SCOPE_P (type
))
1455 discriminator
= nested_anon_class_index (type
);
1458 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1459 /* Just use the old mangling at namespace scope. */
1460 write_source_name (TYPE_IDENTIFIER (type
));
1464 write_string ("Ut");
1465 write_compact_number (discriminator
);
1468 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1469 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1472 write_closure_type_name (const tree type
)
1474 tree fn
= lambda_function (type
);
1475 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1476 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1478 MANGLE_TRACE_TREE ("closure-type-name", type
);
1480 write_string ("Ul");
1481 write_method_parms (parms
, /*method_p=*/1, fn
);
1483 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1486 /* Convert NUMBER to ascii using base BASE and generating at least
1487 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1488 into which to store the characters. Returns the number of
1489 characters generated (these will be laid out in advance of where
1493 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1494 char *buffer
, const unsigned int min_digits
)
1496 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1497 unsigned digits
= 0;
1501 unsigned HOST_WIDE_INT d
= number
/ base
;
1503 *--buffer
= base_digits
[number
- d
* base
];
1507 while (digits
< min_digits
)
1509 *--buffer
= base_digits
[0];
1515 /* Non-terminal <number>.
1517 <number> ::= [n] </decimal integer/> */
1520 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1521 const unsigned int base
)
1523 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1526 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1529 number
= -((HOST_WIDE_INT
) number
);
1531 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1532 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1535 /* Write out an integral CST in decimal. Most numbers are small, and
1536 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1537 bigger than that, which we must deal with. */
1540 write_integer_cst (const tree cst
)
1542 int sign
= tree_int_cst_sgn (cst
);
1543 widest_int abs_value
= wi::abs (wi::to_widest (cst
));
1544 if (!wi::fits_uhwi_p (abs_value
))
1546 /* A bignum. We do this in chunks, each of which fits in a
1548 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1549 unsigned HOST_WIDE_INT chunk
;
1550 unsigned chunk_digits
;
1551 char *ptr
= buffer
+ sizeof (buffer
);
1556 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1561 if (sizeof (HOST_WIDE_INT
) >= 8)
1563 /* It is at least 64 bits, so 10^18 is representable. */
1568 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1569 base
= build_int_cstu (type
, chunk
);
1570 n
= wide_int_to_tree (type
, cst
);
1575 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1579 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1580 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1583 done
= integer_zerop (d
);
1584 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1585 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1586 done
? 1 : chunk_digits
);
1592 write_chars (ptr
, count
);
1599 write_unsigned_number (abs_value
.to_uhwi ());
1603 /* Write out a floating-point literal.
1605 "Floating-point literals are encoded using the bit pattern of the
1606 target processor's internal representation of that number, as a
1607 fixed-length lowercase hexadecimal string, high-order bytes first
1608 (even if the target processor would store low-order bytes first).
1609 The "n" prefix is not used for floating-point literals; the sign
1610 bit is encoded with the rest of the number.
1612 Here are some examples, assuming the IEEE standard representation
1613 for floating point numbers. (Spaces are for readability, not
1614 part of the encoding.)
1617 -1.0f Lf bf80 0000 E
1618 1.17549435e-38f Lf 0080 0000 E
1619 1.40129846e-45f Lf 0000 0001 E
1620 0.0f Lf 0000 0000 E"
1622 Caller is responsible for the Lx and the E. */
1624 write_real_cst (const tree value
)
1626 long target_real
[4]; /* largest supported float */
1627 char buffer
[9]; /* eight hex digits in a 32-bit number */
1630 tree type
= TREE_TYPE (value
);
1631 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1633 real_to_target (target_real
, &TREE_REAL_CST (value
),
1636 /* The value in target_real is in the target word order,
1637 so we must write it out backward if that happens to be
1638 little-endian. write_number cannot be used, it will
1639 produce uppercase. */
1640 if (FLOAT_WORDS_BIG_ENDIAN
)
1641 i
= 0, limit
= words
, dir
= 1;
1643 i
= words
- 1, limit
= -1, dir
= -1;
1645 for (; i
!= limit
; i
+= dir
)
1647 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1648 write_chars (buffer
, 8);
1652 /* Non-terminal <identifier>.
1654 <identifier> ::= </unqualified source code identifier> */
1657 write_identifier (const char *identifier
)
1659 MANGLE_TRACE ("identifier", identifier
);
1660 write_string (identifier
);
1663 /* Handle constructor productions of non-terminal <special-name>.
1664 CTOR is a constructor FUNCTION_DECL.
1666 <special-name> ::= C1 # complete object constructor
1667 ::= C2 # base object constructor
1668 ::= C3 # complete object allocating constructor
1670 Currently, allocating constructors are never used. */
1673 write_special_name_constructor (const tree ctor
)
1675 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1676 write_string ("C2");
1677 /* This is the old-style "[unified]" constructor.
1678 In some cases, we may emit this function and call
1679 it from the clones in order to share code and save space. */
1680 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1681 write_string ("C4");
1684 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
));
1685 write_string ("C1");
1689 /* Handle destructor productions of non-terminal <special-name>.
1690 DTOR is a destructor FUNCTION_DECL.
1692 <special-name> ::= D0 # deleting (in-charge) destructor
1693 ::= D1 # complete object (in-charge) destructor
1694 ::= D2 # base object (not-in-charge) destructor */
1697 write_special_name_destructor (const tree dtor
)
1699 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1700 write_string ("D0");
1701 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1702 write_string ("D2");
1703 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1704 /* This is the old-style "[unified]" destructor.
1705 In some cases, we may emit this function and call
1706 it from the clones in order to share code and save space. */
1707 write_string ("D4");
1710 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
));
1711 write_string ("D1");
1715 /* Scan the vector of local classes and return how many others with the
1716 same name (or same no name) and context precede ENTITY. */
1719 local_class_index (tree entity
)
1721 int ix
, discriminator
= 0;
1722 tree name
= (TYPE_ANONYMOUS_P (entity
) ? NULL_TREE
1723 : TYPE_IDENTIFIER (entity
));
1724 tree ctx
= TYPE_CONTEXT (entity
);
1725 for (ix
= 0; ; ix
++)
1727 tree type
= (*local_classes
)[ix
];
1729 return discriminator
;
1730 if (TYPE_CONTEXT (type
) == ctx
1731 && (name
? TYPE_IDENTIFIER (type
) == name
1732 : TYPE_ANONYMOUS_P (type
)))
1738 /* Return the discriminator for ENTITY appearing inside
1739 FUNCTION. The discriminator is the lexical ordinal of VAR among
1740 entities with the same name in the same FUNCTION. */
1743 discriminator_for_local_entity (tree entity
)
1745 if (DECL_DISCRIMINATOR_P (entity
))
1747 if (DECL_DISCRIMINATOR_SET_P (entity
))
1748 return DECL_DISCRIMINATOR (entity
);
1750 /* The first entity with a particular name doesn't get
1751 DECL_DISCRIMINATOR set up. */
1754 else if (TREE_CODE (entity
) == TYPE_DECL
)
1756 /* Scan the list of local classes. */
1757 entity
= TREE_TYPE (entity
);
1759 /* Lambdas and unnamed types have their own discriminators. */
1760 if (LAMBDA_TYPE_P (entity
) || TYPE_ANONYMOUS_P (entity
))
1763 return local_class_index (entity
);
1769 /* Return the discriminator for STRING, a string literal used inside
1770 FUNCTION. The discriminator is the lexical ordinal of STRING among
1771 string literals used in FUNCTION. */
1774 discriminator_for_string_literal (tree
/*function*/,
1777 /* For now, we don't discriminate amongst string literals. */
1781 /* <discriminator> := _ <number>
1783 The discriminator is used only for the second and later occurrences
1784 of the same name within a single function. In this case <number> is
1785 n - 2, if this is the nth occurrence, in lexical order. */
1788 write_discriminator (const int discriminator
)
1790 /* If discriminator is zero, don't write anything. Otherwise... */
1791 if (discriminator
> 0)
1794 write_unsigned_number (discriminator
- 1);
1798 /* Mangle the name of a function-scope entity. FUNCTION is the
1799 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1800 default argument scope. ENTITY is the decl for the entity itself.
1801 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1802 either ENTITY itself or an enclosing scope of ENTITY.
1804 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1805 := Z <function encoding> E s [<discriminator>]
1806 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1809 write_local_name (tree function
, const tree local_entity
,
1812 tree parm
= NULL_TREE
;
1814 MANGLE_TRACE_TREE ("local-name", entity
);
1816 if (TREE_CODE (function
) == PARM_DECL
)
1819 function
= DECL_CONTEXT (parm
);
1823 write_encoding (function
);
1826 /* For this purpose, parameters are numbered from right-to-left. */
1831 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1839 write_compact_number (i
- 1);
1842 if (TREE_CODE (entity
) == STRING_CST
)
1845 write_discriminator (discriminator_for_string_literal (function
,
1850 /* Now the <entity name>. Let write_name know its being called
1851 from <local-name>, so it doesn't try to process the enclosing
1852 function scope again. */
1853 write_name (entity
, /*ignore_local_scope=*/1);
1854 write_discriminator (discriminator_for_local_entity (local_entity
));
1858 /* Non-terminals <type> and <CV-qualifier>.
1860 <type> ::= <builtin-type>
1862 ::= <class-enum-type>
1864 ::= <pointer-to-member-type>
1865 ::= <template-param>
1868 ::= P <type> # pointer-to
1869 ::= R <type> # reference-to
1870 ::= C <type> # complex pair (C 2000)
1871 ::= G <type> # imaginary (C 2000) [not supported]
1872 ::= U <source-name> <type> # vendor extended type qualifier
1876 <type> ::= RR <type> # rvalue reference-to
1877 <type> ::= Dt <expression> # decltype of an id-expression or
1878 # class member access
1879 <type> ::= DT <expression> # decltype of an expression
1880 <type> ::= Dn # decltype of nullptr
1882 TYPE is a type node. */
1885 write_type (tree type
)
1887 /* This gets set to nonzero if TYPE turns out to be a (possibly
1888 CV-qualified) builtin type. */
1889 int is_builtin_type
= 0;
1891 MANGLE_TRACE_TREE ("type", type
);
1893 if (type
== error_mark_node
)
1896 type
= canonicalize_for_substitution (type
);
1897 if (find_substitution (type
))
1901 if (write_CV_qualifiers_for_type (type
) > 0)
1902 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1903 mangle the unqualified type. The recursive call is needed here
1904 since both the qualified and unqualified types are substitution
1907 tree t
= TYPE_MAIN_VARIANT (type
);
1908 if (TYPE_ATTRIBUTES (t
) && !OVERLOAD_TYPE_P (t
))
1909 t
= cp_build_type_attribute_variant (t
, NULL_TREE
);
1910 gcc_assert (t
!= type
);
1911 if (TREE_CODE (t
) == FUNCTION_TYPE
1912 || TREE_CODE (t
) == METHOD_TYPE
)
1914 t
= build_ref_qualified_type (t
, type_memfn_rqual (type
));
1915 if (abi_version_at_least (8)
1916 || type
== TYPE_MAIN_VARIANT (type
))
1917 /* Avoid adding the unqualified function type as a substitution. */
1918 write_function_type (t
);
1921 if (abi_version_crosses (8))
1922 G
.need_abi_warning
= 1;
1927 else if (TREE_CODE (type
) == ARRAY_TYPE
)
1928 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1929 so that the cv-qualification of the element type is available
1930 in write_array_type. */
1931 write_array_type (type
);
1934 tree type_orig
= type
;
1936 /* See through any typedefs. */
1937 type
= TYPE_MAIN_VARIANT (type
);
1938 if (TREE_CODE (type
) == FUNCTION_TYPE
1939 || TREE_CODE (type
) == METHOD_TYPE
)
1940 type
= build_ref_qualified_type (type
, type_memfn_rqual (type_orig
));
1942 /* According to the C++ ABI, some library classes are passed the
1943 same as the scalar type of their single member and use the same
1945 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
1946 type
= TREE_TYPE (first_field (type
));
1948 if (TYPE_PTRDATAMEM_P (type
))
1949 write_pointer_to_member_type (type
);
1952 /* Handle any target-specific fundamental types. */
1953 const char *target_mangling
1954 = targetm
.mangle_type (type_orig
);
1956 if (target_mangling
)
1958 write_string (target_mangling
);
1959 /* Add substitutions for types other than fundamental
1961 if (!VOID_TYPE_P (type
)
1962 && TREE_CODE (type
) != INTEGER_TYPE
1963 && TREE_CODE (type
) != REAL_TYPE
1964 && TREE_CODE (type
) != BOOLEAN_TYPE
)
1965 add_substitution (type
);
1969 switch (TREE_CODE (type
))
1973 case INTEGER_TYPE
: /* Includes wchar_t. */
1975 case FIXED_POINT_TYPE
:
1977 /* If this is a typedef, TYPE may not be one of
1978 the standard builtin type nodes, but an alias of one. Use
1979 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1980 write_builtin_type (TYPE_MAIN_VARIANT (type
));
1987 write_type (TREE_TYPE (type
));
1992 write_function_type (type
);
1998 /* A pointer-to-member function is represented as a special
1999 RECORD_TYPE, so check for this first. */
2000 if (TYPE_PTRMEMFUNC_P (type
))
2001 write_pointer_to_member_type (type
);
2003 write_class_enum_type (type
);
2007 case UNBOUND_CLASS_TEMPLATE
:
2008 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2009 ordinary nested names. */
2010 write_nested_name (TYPE_STUB_DECL (type
));
2014 case REFERENCE_TYPE
:
2015 if (TYPE_PTR_P (type
))
2017 else if (TYPE_REF_IS_RVALUE (type
))
2022 tree target
= TREE_TYPE (type
);
2023 /* Attribute const/noreturn are not reflected in mangling.
2024 We strip them here rather than at a lower level because
2025 a typedef or template argument can have function type
2026 with function-cv-quals (that use the same representation),
2027 but you can't have a pointer/reference to such a type. */
2028 if (TREE_CODE (target
) == FUNCTION_TYPE
)
2030 if (abi_version_crosses (5)
2031 && TYPE_QUALS (target
) != TYPE_UNQUALIFIED
)
2032 G
.need_abi_warning
= 1;
2033 if (abi_version_at_least (5))
2034 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
2036 write_type (target
);
2040 case TEMPLATE_TYPE_PARM
:
2043 if (AUTO_IS_DECLTYPE (type
))
2044 write_identifier ("Dc");
2046 write_identifier ("Da");
2050 /* else fall through. */
2051 case TEMPLATE_PARM_INDEX
:
2052 write_template_param (type
);
2055 case TEMPLATE_TEMPLATE_PARM
:
2056 write_template_template_param (type
);
2059 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2060 write_template_template_param (type
);
2062 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2066 if (abi_version_at_least (4))
2068 write_string ("Dv");
2069 /* Non-constant vector size would be encoded with
2070 _ expression, but we don't support that yet. */
2071 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2075 write_string ("U8__vector");
2076 if (abi_version_crosses (4))
2077 G
.need_abi_warning
= 1;
2078 write_type (TREE_TYPE (type
));
2081 case TYPE_PACK_EXPANSION
:
2082 write_string ("Dp");
2083 write_type (PACK_EXPANSION_PATTERN (type
));
2087 /* These shouldn't make it into mangling. */
2088 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2089 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2091 /* In ABI <5, we stripped decltype of a plain decl. */
2092 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2094 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2095 tree etype
= NULL_TREE
;
2096 switch (TREE_CODE (expr
))
2103 case TEMPLATE_PARM_INDEX
:
2104 etype
= TREE_TYPE (expr
);
2111 if (etype
&& !type_uses_auto (etype
))
2113 if (abi_version_crosses (5))
2114 G
.need_abi_warning
= 1;
2115 if (!abi_version_at_least (5))
2124 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2128 ++cp_unevaluated_operand
;
2129 write_expression (DECLTYPE_TYPE_EXPR (type
));
2130 --cp_unevaluated_operand
;
2135 write_string ("Dn");
2136 if (abi_version_at_least (7))
2138 if (abi_version_crosses (7))
2139 G
.need_abi_warning
= 1;
2143 sorry ("mangling typeof, use decltype instead");
2146 case UNDERLYING_TYPE
:
2147 sorry ("mangling __underlying_type");
2159 /* Types other than builtin types are substitution candidates. */
2160 if (!is_builtin_type
)
2161 add_substitution (type
);
2164 /* qsort callback for sorting a vector of attribute entries. */
2167 attr_strcmp (const void *p1
, const void *p2
)
2169 tree a1
= *(const tree
*)p1
;
2170 tree a2
= *(const tree
*)p2
;
2172 const attribute_spec
*as1
= lookup_attribute_spec (get_attribute_name (a1
));
2173 const attribute_spec
*as2
= lookup_attribute_spec (get_attribute_name (a2
));
2175 return strcmp (as1
->name
, as2
->name
);
2178 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2179 CV-qualifiers written for TYPE.
2181 <CV-qualifiers> ::= [r] [V] [K] */
2184 write_CV_qualifiers_for_type (const tree type
)
2186 int num_qualifiers
= 0;
2188 /* The order is specified by:
2190 "In cases where multiple order-insensitive qualifiers are
2191 present, they should be ordered 'K' (closest to the base type),
2192 'V', 'r', and 'U' (farthest from the base type) ..." */
2194 /* Mangle attributes that affect type identity as extended qualifiers.
2196 We don't do this with classes and enums because their attributes
2197 are part of their definitions, not something added on. */
2199 if (abi_version_at_least (10) && !OVERLOAD_TYPE_P (type
))
2202 for (tree a
= TYPE_ATTRIBUTES (type
); a
; a
= TREE_CHAIN (a
))
2204 tree name
= get_attribute_name (a
);
2205 const attribute_spec
*as
= lookup_attribute_spec (name
);
2206 if (as
&& as
->affects_type_identity
2207 && !is_attribute_p ("abi_tag", name
))
2210 vec
.qsort (attr_strcmp
);
2211 while (!vec
.is_empty())
2214 const attribute_spec
*as
2215 = lookup_attribute_spec (get_attribute_name (a
));
2218 write_unsigned_number (strlen (as
->name
));
2219 write_string (as
->name
);
2223 for (tree args
= TREE_VALUE (a
); args
;
2224 args
= TREE_CHAIN (args
))
2226 tree arg
= TREE_VALUE (args
);
2227 write_template_arg (arg
);
2233 if (abi_version_crosses (10))
2234 G
.need_abi_warning
= true;
2238 /* Note that we do not use cp_type_quals below; given "const
2239 int[3]", the "const" is emitted with the "int", not with the
2241 cp_cv_quals quals
= TYPE_QUALS (type
);
2243 if (quals
& TYPE_QUAL_RESTRICT
)
2248 if (quals
& TYPE_QUAL_VOLATILE
)
2253 if (quals
& TYPE_QUAL_CONST
)
2259 return num_qualifiers
;
2262 /* Non-terminal <builtin-type>.
2264 <builtin-type> ::= v # void
2269 ::= h # unsigned char
2271 ::= t # unsigned short
2273 ::= j # unsigned int
2275 ::= m # unsigned long
2276 ::= x # long long, __int64
2277 ::= y # unsigned long long, __int64
2279 ::= o # unsigned __int128
2282 ::= e # long double, __float80
2283 ::= g # __float128 [not supported]
2284 ::= u <source-name> # vendor extended type */
2287 write_builtin_type (tree type
)
2289 if (TYPE_CANONICAL (type
))
2290 type
= TYPE_CANONICAL (type
);
2292 switch (TREE_CODE (type
))
2303 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2304 isn't in integer_type_nodes. */
2305 if (type
== wchar_type_node
)
2307 else if (type
== char16_type_node
)
2308 write_string ("Ds");
2309 else if (type
== char32_type_node
)
2310 write_string ("Di");
2311 else if (TYPE_FOR_JAVA (type
))
2312 write_java_integer_type_codes (type
);
2316 /* Assume TYPE is one of the shared integer type nodes. Find
2317 it in the array of these nodes. */
2319 for (itk
= 0; itk
< itk_none
; ++itk
)
2320 if (integer_types
[itk
] != NULL_TREE
2321 && integer_type_codes
[itk
] != '\0'
2322 && type
== integer_types
[itk
])
2324 /* Print the corresponding single-letter code. */
2325 write_char (integer_type_codes
[itk
]);
2329 if (itk
== itk_none
)
2331 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2332 TYPE_UNSIGNED (type
));
2339 if (TYPE_PRECISION (type
) == 128)
2340 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2343 /* Allow for cases where TYPE is not one of the shared
2344 integer type nodes and write a "vendor extended builtin
2345 type" with a name the form intN or uintN, respectively.
2346 Situations like this can happen if you have an
2347 __attribute__((__mode__(__SI__))) type and use exotic
2348 switches like '-mint8' on AVR. Of course, this is
2349 undefined by the C++ ABI (and '-mint8' is not even
2350 Standard C conforming), but when using such special
2351 options you're pretty much in nowhere land anyway. */
2353 char prec
[11]; /* up to ten digits for an unsigned */
2355 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2356 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2357 write_char ('u'); /* "vendor extended builtin type" */
2358 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2359 write_string (prefix
);
2360 write_string (prec
);
2367 if (type
== float_type_node
2368 || type
== java_float_type_node
)
2370 else if (type
== double_type_node
2371 || type
== java_double_type_node
)
2373 else if (type
== long_double_type_node
)
2375 else if (type
== dfloat32_type_node
)
2376 write_string ("Df");
2377 else if (type
== dfloat64_type_node
)
2378 write_string ("Dd");
2379 else if (type
== dfloat128_type_node
)
2380 write_string ("De");
2385 case FIXED_POINT_TYPE
:
2386 write_string ("DF");
2387 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2388 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2389 if (type
== fract_type_node
2390 || type
== sat_fract_type_node
2391 || type
== accum_type_node
2392 || type
== sat_accum_type_node
)
2394 else if (type
== unsigned_fract_type_node
2395 || type
== sat_unsigned_fract_type_node
2396 || type
== unsigned_accum_type_node
2397 || type
== sat_unsigned_accum_type_node
)
2399 else if (type
== short_fract_type_node
2400 || type
== sat_short_fract_type_node
2401 || type
== short_accum_type_node
2402 || type
== sat_short_accum_type_node
)
2404 else if (type
== unsigned_short_fract_type_node
2405 || type
== sat_unsigned_short_fract_type_node
2406 || type
== unsigned_short_accum_type_node
2407 || type
== sat_unsigned_short_accum_type_node
)
2409 else if (type
== long_fract_type_node
2410 || type
== sat_long_fract_type_node
2411 || type
== long_accum_type_node
2412 || type
== sat_long_accum_type_node
)
2414 else if (type
== unsigned_long_fract_type_node
2415 || type
== sat_unsigned_long_fract_type_node
2416 || type
== unsigned_long_accum_type_node
2417 || type
== sat_unsigned_long_accum_type_node
)
2419 else if (type
== long_long_fract_type_node
2420 || type
== sat_long_long_fract_type_node
2421 || type
== long_long_accum_type_node
2422 || type
== sat_long_long_accum_type_node
)
2424 else if (type
== unsigned_long_long_fract_type_node
2425 || type
== sat_unsigned_long_long_fract_type_node
2426 || type
== unsigned_long_long_accum_type_node
2427 || type
== sat_unsigned_long_long_accum_type_node
)
2430 sorry ("mangling unknown fixed point type");
2431 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2432 if (TYPE_SATURATING (type
))
2443 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2444 METHOD_TYPE. The return type is mangled before the parameter
2447 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2450 write_function_type (const tree type
)
2452 MANGLE_TRACE_TREE ("function-type", type
);
2454 /* For a pointer to member function, the function type may have
2455 cv-qualifiers, indicating the quals for the artificial 'this'
2457 if (TREE_CODE (type
) == METHOD_TYPE
)
2459 /* The first parameter must be a POINTER_TYPE pointing to the
2460 `this' parameter. */
2461 tree this_type
= class_of_this_parm (type
);
2462 write_CV_qualifiers_for_type (this_type
);
2466 /* We don't track whether or not a type is `extern "C"'. Note that
2467 you can have an `extern "C"' function that does not have
2468 `extern "C"' type, and vice versa:
2470 extern "C" typedef void function_t();
2471 function_t f; // f has C++ linkage, but its type is
2474 typedef void function_t();
2475 extern "C" function_t f; // Vice versa.
2478 write_bare_function_type (type
, /*include_return_type_p=*/1,
2480 if (FUNCTION_REF_QUALIFIED (type
))
2482 if (FUNCTION_RVALUE_QUALIFIED (type
))
2490 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2491 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2492 is mangled before the parameter types. If non-NULL, DECL is
2493 FUNCTION_DECL for the function whose type is being emitted.
2495 If DECL is a member of a Java type, then a literal 'J'
2496 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2499 <bare-function-type> ::= [J]</signature/ type>+ */
2502 write_bare_function_type (const tree type
, const int include_return_type_p
,
2507 MANGLE_TRACE_TREE ("bare-function-type", type
);
2509 /* Detect Java methods and emit special encoding. */
2511 && DECL_FUNCTION_MEMBER_P (decl
)
2512 && TYPE_FOR_JAVA (DECL_CONTEXT (decl
))
2513 && !DECL_CONSTRUCTOR_P (decl
)
2514 && !DECL_DESTRUCTOR_P (decl
)
2515 && !DECL_CONV_FN_P (decl
))
2525 /* Mangle the return type, if requested. */
2526 if (include_return_type_p
|| java_method_p
)
2527 write_type (TREE_TYPE (type
));
2529 /* Now mangle the types of the arguments. */
2531 write_method_parms (TYPE_ARG_TYPES (type
),
2532 TREE_CODE (type
) == METHOD_TYPE
,
2537 /* Write the mangled representation of a method parameter list of
2538 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2539 considered a non-static method, and the this parameter is omitted.
2540 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2541 parameters are being emitted. */
2544 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2546 tree first_parm_type
;
2547 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2549 /* Assume this parameter type list is variable-length. If it ends
2550 with a void type, then it's not. */
2553 /* If this is a member function, skip the first arg, which is the
2555 "Member functions do not encode the type of their implicit this
2558 Similarly, there's no need to mangle artificial parameters, like
2559 the VTT parameters for constructors and destructors. */
2562 parm_types
= TREE_CHAIN (parm_types
);
2563 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2565 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2567 parm_types
= TREE_CHAIN (parm_types
);
2568 parm_decl
= DECL_CHAIN (parm_decl
);
2572 for (first_parm_type
= parm_types
;
2574 parm_types
= TREE_CHAIN (parm_types
))
2576 tree parm
= TREE_VALUE (parm_types
);
2577 if (parm
== void_type_node
)
2579 /* "Empty parameter lists, whether declared as () or
2580 conventionally as (void), are encoded with a void parameter
2582 if (parm_types
== first_parm_type
)
2584 /* If the parm list is terminated with a void type, it's
2587 /* A void type better be the last one. */
2588 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2595 /* <builtin-type> ::= z # ellipsis */
2599 /* <class-enum-type> ::= <name> */
2602 write_class_enum_type (const tree type
)
2604 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2607 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2610 <template-args> ::= I <template-arg>* E */
2613 write_template_args (tree args
)
2618 MANGLE_TRACE_TREE ("template-args", args
);
2623 length
= TREE_VEC_LENGTH (args
);
2625 if (args
&& length
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2627 /* We have nested template args. We want the innermost template
2629 args
= TREE_VEC_ELT (args
, length
- 1);
2630 length
= TREE_VEC_LENGTH (args
);
2632 for (i
= 0; i
< length
; ++i
)
2633 write_template_arg (TREE_VEC_ELT (args
, i
));
2640 <unqualified-name> <template-args>
2641 part of SCOPE_REF or COMPONENT_REF mangling. */
2644 write_member_name (tree member
)
2646 if (identifier_p (member
))
2647 write_unqualified_id (member
);
2648 else if (DECL_P (member
))
2649 write_unqualified_name (member
);
2650 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2652 tree name
= TREE_OPERAND (member
, 0);
2653 if (TREE_CODE (name
) == OVERLOAD
)
2654 name
= OVL_FUNCTION (name
);
2655 write_member_name (name
);
2656 write_template_args (TREE_OPERAND (member
, 1));
2659 write_expression (member
);
2662 /* <expression> ::= <unary operator-name> <expression>
2663 ::= <binary operator-name> <expression> <expression>
2666 <expr-primary> ::= <template-param>
2667 ::= L <type> <value number> E # literal
2668 ::= L <mangled-name> E # external name
2669 ::= st <type> # sizeof
2670 ::= sr <type> <unqualified-name> # dependent name
2671 ::= sr <type> <unqualified-name> <template-args> */
2674 write_expression (tree expr
)
2676 enum tree_code code
= TREE_CODE (expr
);
2678 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2679 is converted (via qualification conversions) to another
2681 while (TREE_CODE (expr
) == NOP_EXPR
2682 /* Parentheses aren't mangled. */
2683 || code
== PAREN_EXPR
2684 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2686 expr
= TREE_OPERAND (expr
, 0);
2687 code
= TREE_CODE (expr
);
2690 if (code
== BASELINK
2691 && (!type_unknown_p (expr
)
2692 || !BASELINK_QUALIFIED_P (expr
)))
2694 expr
= BASELINK_FUNCTIONS (expr
);
2695 code
= TREE_CODE (expr
);
2698 /* Handle pointers-to-members by making them look like expression
2700 if (code
== PTRMEM_CST
)
2702 expr
= build_nt (ADDR_EXPR
,
2703 build_qualified_name (/*type=*/NULL_TREE
,
2704 PTRMEM_CST_CLASS (expr
),
2705 PTRMEM_CST_MEMBER (expr
),
2706 /*template_p=*/false));
2707 code
= TREE_CODE (expr
);
2710 /* Handle template parameters. */
2711 if (code
== TEMPLATE_TYPE_PARM
2712 || code
== TEMPLATE_TEMPLATE_PARM
2713 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2714 || code
== TEMPLATE_PARM_INDEX
)
2715 write_template_param (expr
);
2716 /* Handle literals. */
2717 else if (TREE_CODE_CLASS (code
) == tcc_constant
2718 || code
== CONST_DECL
)
2719 write_template_arg_literal (expr
);
2720 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2722 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr
))));
2723 write_string ("fpT");
2725 else if (code
== PARM_DECL
)
2727 /* A function parameter used in a late-specified return type. */
2728 int index
= DECL_PARM_INDEX (expr
);
2729 int level
= DECL_PARM_LEVEL (expr
);
2730 int delta
= G
.parm_depth
- level
+ 1;
2731 gcc_assert (index
>= 1);
2735 if (abi_version_at_least (5))
2737 /* Let L be the number of function prototype scopes from the
2738 innermost one (in which the parameter reference occurs) up
2739 to (and including) the one containing the declaration of
2740 the referenced parameter. If the parameter declaration
2741 clause of the innermost function prototype scope has been
2742 completely seen, it is not counted (in that case -- which
2743 is perhaps the most common -- L can be zero). */
2745 write_unsigned_number (delta
- 1);
2747 if (abi_version_crosses (5))
2748 G
.need_abi_warning
= true;
2751 write_compact_number (index
- 1);
2753 else if (DECL_P (expr
))
2756 write_mangled_name (expr
, false);
2759 else if (TREE_CODE (expr
) == SIZEOF_EXPR
2760 && SIZEOF_EXPR_TYPE_P (expr
))
2762 write_string ("st");
2763 write_type (TREE_TYPE (TREE_OPERAND (expr
, 0)));
2765 else if (TREE_CODE (expr
) == SIZEOF_EXPR
2766 && TYPE_P (TREE_OPERAND (expr
, 0)))
2768 write_string ("st");
2769 write_type (TREE_OPERAND (expr
, 0));
2771 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2772 && TYPE_P (TREE_OPERAND (expr
, 0)))
2774 write_string ("at");
2775 write_type (TREE_OPERAND (expr
, 0));
2777 else if (code
== SCOPE_REF
2778 || code
== BASELINK
)
2781 if (code
== SCOPE_REF
)
2783 scope
= TREE_OPERAND (expr
, 0);
2784 member
= TREE_OPERAND (expr
, 1);
2788 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
2789 member
= BASELINK_FUNCTIONS (expr
);
2792 /* If the MEMBER is a real declaration, then the qualifying
2793 scope was not dependent. Ideally, we would not have a
2794 SCOPE_REF in those cases, but sometimes we do. If the second
2795 argument is a DECL, then the name must not have been
2797 if (DECL_P (member
))
2798 write_expression (member
);
2801 write_string ("sr");
2803 write_member_name (member
);
2806 else if (INDIRECT_REF_P (expr
)
2807 && TREE_TYPE (TREE_OPERAND (expr
, 0))
2808 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2810 write_expression (TREE_OPERAND (expr
, 0));
2812 else if (identifier_p (expr
))
2814 /* An operator name appearing as a dependent name needs to be
2815 specially marked to disambiguate between a use of the operator
2816 name and a use of the operator in an expression. */
2817 if (IDENTIFIER_OPNAME_P (expr
))
2818 write_string ("on");
2819 write_unqualified_id (expr
);
2821 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
2823 tree fn
= TREE_OPERAND (expr
, 0);
2824 if (is_overloaded_fn (fn
))
2825 fn
= DECL_NAME (get_first_fn (fn
));
2826 if (IDENTIFIER_OPNAME_P (fn
))
2827 write_string ("on");
2828 write_unqualified_id (fn
);
2829 write_template_args (TREE_OPERAND (expr
, 1));
2831 else if (TREE_CODE (expr
) == MODOP_EXPR
)
2833 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
2834 const char *name
= (assignment_operator_name_info
[(int) subop
]
2836 write_string (name
);
2837 write_expression (TREE_OPERAND (expr
, 0));
2838 write_expression (TREE_OPERAND (expr
, 2));
2840 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
2842 /* ::= [gs] nw <expression>* _ <type> E
2843 ::= [gs] nw <expression>* _ <type> <initializer>
2844 ::= [gs] na <expression>* _ <type> E
2845 ::= [gs] na <expression>* _ <type> <initializer>
2846 <initializer> ::= pi <expression>* E */
2847 tree placement
= TREE_OPERAND (expr
, 0);
2848 tree type
= TREE_OPERAND (expr
, 1);
2849 tree nelts
= TREE_OPERAND (expr
, 2);
2850 tree init
= TREE_OPERAND (expr
, 3);
2853 gcc_assert (code
== NEW_EXPR
);
2854 if (TREE_OPERAND (expr
, 2))
2855 code
= VEC_NEW_EXPR
;
2857 if (NEW_EXPR_USE_GLOBAL (expr
))
2858 write_string ("gs");
2860 write_string (operator_name_info
[(int) code
].mangled_name
);
2862 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
2863 write_expression (TREE_VALUE (t
));
2870 ++processing_template_decl
;
2871 domain
= compute_array_index_type (NULL_TREE
, nelts
,
2872 tf_warning_or_error
);
2873 type
= build_cplus_array_type (type
, domain
);
2874 --processing_template_decl
;
2878 if (init
&& TREE_CODE (init
) == TREE_LIST
2879 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
2880 write_expression (TREE_VALUE (init
));
2884 write_string ("pi");
2885 if (init
&& init
!= void_node
)
2886 for (t
= init
; t
; t
= TREE_CHAIN (t
))
2887 write_expression (TREE_VALUE (t
));
2891 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
2893 gcc_assert (code
== DELETE_EXPR
);
2894 if (DELETE_EXPR_USE_VEC (expr
))
2895 code
= VEC_DELETE_EXPR
;
2897 if (DELETE_EXPR_USE_GLOBAL (expr
))
2898 write_string ("gs");
2900 write_string (operator_name_info
[(int) code
].mangled_name
);
2902 write_expression (TREE_OPERAND (expr
, 0));
2904 else if (code
== THROW_EXPR
)
2906 tree op
= TREE_OPERAND (expr
, 0);
2909 write_string ("tw");
2910 write_expression (op
);
2913 write_string ("tr");
2915 else if (code
== CONSTRUCTOR
)
2917 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (expr
);
2918 unsigned i
; tree val
;
2920 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
2921 write_string ("il");
2924 write_string ("tl");
2925 write_type (TREE_TYPE (expr
));
2927 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
2928 write_expression (val
);
2931 else if (dependent_name (expr
))
2933 write_unqualified_id (dependent_name (expr
));
2940 /* When we bind a variable or function to a non-type template
2941 argument with reference type, we create an ADDR_EXPR to show
2942 the fact that the entity's address has been taken. But, we
2943 don't actually want to output a mangling code for the `&'. */
2944 if (TREE_CODE (expr
) == ADDR_EXPR
2946 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
2948 expr
= TREE_OPERAND (expr
, 0);
2951 write_expression (expr
);
2955 code
= TREE_CODE (expr
);
2958 if (code
== COMPONENT_REF
)
2960 tree ob
= TREE_OPERAND (expr
, 0);
2962 if (TREE_CODE (ob
) == ARROW_EXPR
)
2964 write_string (operator_name_info
[(int)code
].mangled_name
);
2965 ob
= TREE_OPERAND (ob
, 0);
2966 write_expression (ob
);
2968 else if (!is_dummy_object (ob
))
2970 write_string ("dt");
2971 write_expression (ob
);
2973 /* else, for a non-static data member with no associated object (in
2974 unevaluated context), use the unresolved-name mangling. */
2976 write_member_name (TREE_OPERAND (expr
, 1));
2980 /* If it wasn't any of those, recursively expand the expression. */
2981 name
= operator_name_info
[(int) code
].mangled_name
;
2983 /* We used to mangle const_cast and static_cast like a C cast. */
2984 if (code
== CONST_CAST_EXPR
2985 || code
== STATIC_CAST_EXPR
)
2987 if (abi_version_crosses (6))
2988 G
.need_abi_warning
= 1;
2989 if (!abi_version_at_least (6))
2990 name
= operator_name_info
[CAST_EXPR
].mangled_name
;
2998 error ("use of built-in trait %qE in function signature; "
2999 "use library traits instead", expr
);
3003 sorry ("mangling %C", code
);
3009 write_string (name
);
3015 tree fn
= CALL_EXPR_FN (expr
);
3017 if (TREE_CODE (fn
) == ADDR_EXPR
)
3018 fn
= TREE_OPERAND (fn
, 0);
3020 /* Mangle a dependent name as the name, not whatever happens to
3021 be the first function in the overload set. */
3022 if ((TREE_CODE (fn
) == FUNCTION_DECL
3023 || TREE_CODE (fn
) == OVERLOAD
)
3024 && type_dependent_expression_p_push (expr
))
3025 fn
= DECL_NAME (get_first_fn (fn
));
3027 write_expression (fn
);
3030 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
3031 write_expression (CALL_EXPR_ARG (expr
, i
));
3036 write_type (TREE_TYPE (expr
));
3037 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
3038 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
3041 tree args
= TREE_OPERAND (expr
, 0);
3043 for (; args
; args
= TREE_CHAIN (args
))
3044 write_expression (TREE_VALUE (args
));
3049 case DYNAMIC_CAST_EXPR
:
3050 case REINTERPRET_CAST_EXPR
:
3051 case STATIC_CAST_EXPR
:
3052 case CONST_CAST_EXPR
:
3053 write_type (TREE_TYPE (expr
));
3054 write_expression (TREE_OPERAND (expr
, 0));
3057 case PREINCREMENT_EXPR
:
3058 case PREDECREMENT_EXPR
:
3059 if (abi_version_at_least (6))
3061 if (abi_version_crosses (6))
3062 G
.need_abi_warning
= 1;
3066 /* In the middle-end, some expressions have more operands than
3067 they do in templates (and mangling). */
3068 len
= cp_tree_operand_length (expr
);
3070 for (i
= 0; i
< len
; ++i
)
3072 tree operand
= TREE_OPERAND (expr
, i
);
3073 /* As a GNU extension, the middle operand of a
3074 conditional may be omitted. Since expression
3075 manglings are supposed to represent the input token
3076 stream, there's no good way to mangle such an
3077 expression without extending the C++ ABI. */
3078 if (code
== COND_EXPR
&& i
== 1 && !operand
)
3080 error ("omitted middle operand to %<?:%> operand "
3081 "cannot be mangled");
3084 write_expression (operand
);
3090 /* Literal subcase of non-terminal <template-arg>.
3092 "Literal arguments, e.g. "A<42L>", are encoded with their type
3093 and value. Negative integer values are preceded with "n"; for
3094 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3095 encoded as 0, true as 1." */
3098 write_template_arg_literal (const tree value
)
3101 write_type (TREE_TYPE (value
));
3103 /* Write a null member pointer value as (type)0, regardless of its
3104 real representation. */
3105 if (null_member_pointer_value_p (value
))
3106 write_integer_cst (integer_zero_node
);
3108 switch (TREE_CODE (value
))
3111 write_integer_cst (DECL_INITIAL (value
));
3115 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
3116 || integer_zerop (value
) || integer_onep (value
));
3117 write_integer_cst (value
);
3121 write_real_cst (value
);
3125 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3126 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3128 write_integer_cst (TREE_REALPART (value
));
3130 write_integer_cst (TREE_IMAGPART (value
));
3132 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3133 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3135 write_real_cst (TREE_REALPART (value
));
3137 write_real_cst (TREE_IMAGPART (value
));
3144 sorry ("string literal in function template signature");
3154 /* Non-terminal <template-arg>.
3156 <template-arg> ::= <type> # type
3157 ::= L <type> </value/ number> E # literal
3158 ::= LZ <name> E # external name
3159 ::= X <expression> E # expression */
3162 write_template_arg (tree node
)
3164 enum tree_code code
= TREE_CODE (node
);
3166 MANGLE_TRACE_TREE ("template-arg", node
);
3168 /* A template template parameter's argument list contains TREE_LIST
3169 nodes of which the value field is the actual argument. */
3170 if (code
== TREE_LIST
)
3172 node
= TREE_VALUE (node
);
3173 /* If it's a decl, deal with its type instead. */
3176 node
= TREE_TYPE (node
);
3177 code
= TREE_CODE (node
);
3181 if (REFERENCE_REF_P (node
))
3182 node
= TREE_OPERAND (node
, 0);
3183 if (TREE_CODE (node
) == NOP_EXPR
3184 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3186 /* Template parameters can be of reference type. To maintain
3187 internal consistency, such arguments use a conversion from
3188 address of object to reference type. */
3189 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3190 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3193 if (TREE_CODE (node
) == BASELINK
3194 && !type_unknown_p (node
))
3196 if (abi_version_at_least (6))
3197 node
= BASELINK_FUNCTIONS (node
);
3198 if (abi_version_crosses (6))
3199 /* We wrongly wrapped a class-scope function in X/E. */
3200 G
.need_abi_warning
= 1;
3203 if (ARGUMENT_PACK_P (node
))
3205 /* Expand the template argument pack. */
3206 tree args
= ARGUMENT_PACK_ARGS (node
);
3207 int i
, length
= TREE_VEC_LENGTH (args
);
3208 if (abi_version_at_least (6))
3212 if (abi_version_crosses (6))
3213 G
.need_abi_warning
= 1;
3214 for (i
= 0; i
< length
; ++i
)
3215 write_template_arg (TREE_VEC_ELT (args
, i
));
3218 else if (TYPE_P (node
))
3220 else if (code
== TEMPLATE_DECL
)
3221 /* A template appearing as a template arg is a template template arg. */
3222 write_template_template_arg (node
);
3223 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3224 || code
== CONST_DECL
3225 || null_member_pointer_value_p (node
))
3226 write_template_arg_literal (node
);
3227 else if (DECL_P (node
))
3230 /* Until ABI version 3, the underscore before the mangled name
3231 was incorrectly omitted. */
3232 if (!abi_version_at_least (3))
3235 write_string ("_Z");
3236 if (abi_version_crosses (3))
3237 G
.need_abi_warning
= 1;
3238 write_encoding (node
);
3243 /* Template arguments may be expressions. */
3245 write_expression (node
);
3250 /* <template-template-arg>
3252 ::= <substitution> */
3255 write_template_template_arg (const tree decl
)
3257 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3259 if (find_substitution (decl
))
3261 write_name (decl
, /*ignore_local_scope=*/0);
3262 add_substitution (decl
);
3266 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3268 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3269 ::= A <expression> _ </element/ type>
3271 "Array types encode the dimension (number of elements) and the
3272 element type. For variable length arrays, the dimension (but not
3273 the '_' separator) is omitted." */
3276 write_array_type (const tree type
)
3279 if (TYPE_DOMAIN (type
))
3284 index_type
= TYPE_DOMAIN (type
);
3285 /* The INDEX_TYPE gives the upper and lower bounds of the
3287 max
= TYPE_MAX_VALUE (index_type
);
3288 if (TREE_CODE (max
) == INTEGER_CST
)
3290 /* The ABI specifies that we should mangle the number of
3291 elements in the array, not the largest allowed index. */
3292 offset_int wmax
= wi::to_offset (max
) + 1;
3293 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3294 number of elements as zero. */
3295 wmax
= wi::zext (wmax
, TYPE_PRECISION (TREE_TYPE (max
)));
3296 gcc_assert (wi::fits_uhwi_p (wmax
));
3297 write_unsigned_number (wmax
.to_uhwi ());
3301 max
= TREE_OPERAND (max
, 0);
3302 write_expression (max
);
3307 write_type (TREE_TYPE (type
));
3310 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3311 variables. TYPE is a pointer-to-member POINTER_TYPE.
3313 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3316 write_pointer_to_member_type (const tree type
)
3319 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3320 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3323 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3324 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3325 TEMPLATE_PARM_INDEX.
3327 <template-param> ::= T </parameter/ number> _ */
3330 write_template_param (const tree parm
)
3334 MANGLE_TRACE_TREE ("template-parm", parm
);
3336 switch (TREE_CODE (parm
))
3338 case TEMPLATE_TYPE_PARM
:
3339 case TEMPLATE_TEMPLATE_PARM
:
3340 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3341 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3344 case TEMPLATE_PARM_INDEX
:
3345 parm_index
= TEMPLATE_PARM_IDX (parm
);
3353 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3354 earliest template param denoted by `_'. */
3355 write_compact_number (parm_index
);
3358 /* <template-template-param>
3359 ::= <template-param>
3360 ::= <substitution> */
3363 write_template_template_param (const tree parm
)
3365 tree templ
= NULL_TREE
;
3367 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3368 template template parameter. The substitution candidate here is
3369 only the template. */
3370 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3373 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3374 if (find_substitution (templ
))
3378 /* <template-param> encodes only the template parameter position,
3379 not its template arguments, which is fine here. */
3380 write_template_param (parm
);
3382 add_substitution (templ
);
3385 /* Non-terminal <substitution>.
3387 <substitution> ::= S <seq-id> _
3391 write_substitution (const int seq_id
)
3393 MANGLE_TRACE ("substitution", "");
3397 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3401 /* Start mangling ENTITY. */
3404 start_mangling (const tree entity
)
3407 G
.need_abi_warning
= false;
3408 obstack_free (&name_obstack
, name_base
);
3409 mangle_obstack
= &name_obstack
;
3410 name_base
= obstack_alloc (&name_obstack
, 0);
3413 /* Done with mangling. If WARN is true, and the name of G.entity will
3414 be mangled differently in a future version of the ABI, issue a
3418 finish_mangling_internal (void)
3420 /* Clear all the substitutions. */
3421 vec_safe_truncate (G
.substitutions
, 0);
3423 /* Null-terminate the string. */
3428 /* Like finish_mangling_internal, but return the mangled string. */
3430 static inline const char *
3431 finish_mangling (void)
3433 finish_mangling_internal ();
3434 return (const char *) obstack_finish (mangle_obstack
);
3437 /* Like finish_mangling_internal, but return an identifier. */
3440 finish_mangling_get_identifier (void)
3442 finish_mangling_internal ();
3443 /* Don't obstack_finish here, and the next start_mangling will
3444 remove the identifier. */
3445 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3448 /* Initialize data structures for mangling. */
3453 gcc_obstack_init (&name_obstack
);
3454 name_base
= obstack_alloc (&name_obstack
, 0);
3455 vec_alloc (G
.substitutions
, 0);
3457 /* Cache these identifiers for quick comparison when checking for
3458 standard substitutions. */
3459 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3460 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3461 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3462 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3463 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3464 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3467 /* Generate the mangled name of DECL. */
3470 mangle_decl_string (const tree decl
)
3473 location_t saved_loc
= input_location
;
3474 tree saved_fn
= NULL_TREE
;
3475 bool template_p
= false;
3477 /* We shouldn't be trying to mangle an uninstantiated template. */
3478 gcc_assert (!type_dependent_expression_p (decl
));
3480 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3482 struct tinst_level
*tl
= current_instantiation ();
3483 if ((!tl
|| tl
->decl
!= decl
)
3484 && push_tinst_level (decl
))
3487 saved_fn
= current_function_decl
;
3488 current_function_decl
= NULL_TREE
;
3491 input_location
= DECL_SOURCE_LOCATION (decl
);
3493 start_mangling (decl
);
3495 if (TREE_CODE (decl
) == TYPE_DECL
)
3496 write_type (TREE_TYPE (decl
));
3498 write_mangled_name (decl
, true);
3500 result
= finish_mangling_get_identifier ();
3502 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3503 IDENTIFIER_POINTER (result
));
3508 current_function_decl
= saved_fn
;
3510 input_location
= saved_loc
;
3515 /* Return an identifier for the external mangled name of DECL. */
3518 get_mangled_id (tree decl
)
3520 tree id
= mangle_decl_string (decl
);
3521 return targetm
.mangle_decl_assembler_name (decl
, id
);
3524 /* If DECL is an implicit mangling alias, return its symtab node; otherwise
3527 static symtab_node
*
3528 decl_implicit_alias_p (tree decl
)
3530 if (DECL_P (decl
) && DECL_ARTIFICIAL (decl
)
3531 && DECL_IGNORED_P (decl
)
3532 && (TREE_CODE (decl
) == FUNCTION_DECL
3533 || (VAR_P (decl
) && TREE_STATIC (decl
))))
3535 symtab_node
*n
= symtab_node::get (decl
);
3536 if (n
&& n
->cpp_implicit_alias
)
3542 /* If DECL is a mangling alias, remove it from the symbol table and return
3543 true; otherwise return false. */
3546 maybe_remove_implicit_alias (tree decl
)
3548 if (symtab_node
*n
= decl_implicit_alias_p (decl
))
3556 /* Create an identifier for the external mangled name of DECL. */
3559 mangle_decl (const tree decl
)
3564 /* Don't bother mangling uninstantiated templates. */
3565 ++processing_template_decl
;
3566 if (TREE_CODE (decl
) == TYPE_DECL
)
3567 dep
= dependent_type_p (TREE_TYPE (decl
));
3569 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3570 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3571 --processing_template_decl
;
3575 /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
3576 It is not needed to assign names to anonymous namespace, but we use the
3577 "<anon>" marker to be able to tell if type is C++ ODR type or type
3578 produced by other language. */
3579 if (TREE_CODE (decl
) == TYPE_DECL
3580 && TYPE_STUB_DECL (TREE_TYPE (decl
))
3581 && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl
))))
3582 id
= get_identifier ("<anon>");
3585 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
3586 || !no_linkage_check (TREE_TYPE (decl
), true));
3587 id
= get_mangled_id (decl
);
3589 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3591 if (id
!= DECL_NAME (decl
)
3592 && !DECL_REALLY_EXTERN (decl
)
3593 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3594 && TREE_CODE (decl
) != TYPE_DECL
3595 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3596 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3600 /* Check IDENTIFIER_GLOBAL_VALUE before setting to avoid redundant
3601 errors from multiple definitions. */
3602 tree d
= IDENTIFIER_GLOBAL_VALUE (id
);
3603 if (!d
|| decl_implicit_alias_p (d
))
3606 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3609 if (!G
.need_abi_warning
)
3612 /* If the mangling will change in the future, emit an alias with the
3613 future mangled name for forward-compatibility. */
3619 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3620 inform (DECL_SOURCE_LOCATION (decl
), "a later -fabi-version= (or "
3621 "=0) avoids this error with a change in mangling");
3624 save_ver
= flag_abi_version
;
3625 flag_abi_version
= flag_abi_compat_version
;
3626 id2
= mangle_decl_string (decl
);
3627 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3628 flag_abi_version
= save_ver
;
3635 if (flag_abi_compat_version
!= 0
3636 && abi_version_at_least (flag_abi_compat_version
))
3637 warning (OPT_Wabi
, "the mangled name of %q+D changed between "
3638 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3639 G
.entity
, flag_abi_compat_version
, id2
,
3640 flag_abi_version
, id
);
3642 warning (OPT_Wabi
, "the mangled name of %q+D changes between "
3643 "-fabi-version=%d (%D) and -fabi-version=%d (%D)",
3644 G
.entity
, flag_abi_version
, id
,
3645 flag_abi_compat_version
, id2
);
3648 note_mangling_alias (decl
, id2
);
3652 /* Generate the mangled representation of TYPE. */
3655 mangle_type_string (const tree type
)
3659 start_mangling (type
);
3661 result
= finish_mangling ();
3663 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3667 /* Create an identifier for the mangled name of a special component
3668 for belonging to TYPE. CODE is the ABI-specified code for this
3672 mangle_special_for_type (const tree type
, const char *code
)
3676 /* We don't have an actual decl here for the special component, so
3677 we can't just process the <encoded-name>. Instead, fake it. */
3678 start_mangling (type
);
3680 /* Start the mangling. */
3681 write_string ("_Z");
3682 write_string (code
);
3686 result
= finish_mangling_get_identifier ();
3689 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3690 IDENTIFIER_POINTER (result
));
3695 /* Create an identifier for the mangled representation of the typeinfo
3696 structure for TYPE. */
3699 mangle_typeinfo_for_type (const tree type
)
3701 return mangle_special_for_type (type
, "TI");
3704 /* Create an identifier for the mangled name of the NTBS containing
3705 the mangled name of TYPE. */
3708 mangle_typeinfo_string_for_type (const tree type
)
3710 return mangle_special_for_type (type
, "TS");
3713 /* Create an identifier for the mangled name of the vtable for TYPE. */
3716 mangle_vtbl_for_type (const tree type
)
3718 return mangle_special_for_type (type
, "TV");
3721 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3724 mangle_vtt_for_type (const tree type
)
3726 return mangle_special_for_type (type
, "TT");
3729 /* Return an identifier for a construction vtable group. TYPE is
3730 the most derived class in the hierarchy; BINFO is the base
3731 subobject for which this construction vtable group will be used.
3733 This mangling isn't part of the ABI specification; in the ABI
3734 specification, the vtable group is dumped in the same COMDAT as the
3735 main vtable, and is referenced only from that vtable, so it doesn't
3736 need an external name. For binary formats without COMDAT sections,
3737 though, we need external names for the vtable groups.
3739 We use the production
3741 <special-name> ::= CT <type> <offset number> _ <base type> */
3744 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
3748 start_mangling (type
);
3750 write_string ("_Z");
3751 write_string ("TC");
3753 write_integer_cst (BINFO_OFFSET (binfo
));
3755 write_type (BINFO_TYPE (binfo
));
3757 result
= finish_mangling_get_identifier ();
3759 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
3760 IDENTIFIER_POINTER (result
));
3764 /* Mangle a this pointer or result pointer adjustment.
3766 <call-offset> ::= h <fixed offset number> _
3767 ::= v <fixed offset number> _ <virtual offset number> _ */
3770 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
3772 write_char (virtual_offset
? 'v' : 'h');
3774 /* For either flavor, write the fixed offset. */
3775 write_integer_cst (fixed_offset
);
3778 /* For a virtual thunk, add the virtual offset. */
3781 write_integer_cst (virtual_offset
);
3786 /* Return an identifier for the mangled name of a this-adjusting or
3787 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3788 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3789 is a virtual thunk, and it is the vtbl offset in
3790 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3791 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3792 thunk itself. A covariant thunk name always includes the adjustment
3793 for the this pointer, even if there is none.
3795 <special-name> ::= T <call-offset> <base encoding>
3796 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3800 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
3801 tree virtual_offset
)
3805 start_mangling (fn_decl
);
3807 write_string ("_Z");
3810 if (!this_adjusting
)
3812 /* Covariant thunk with no this adjustment */
3814 mangle_call_offset (integer_zero_node
, NULL_TREE
);
3815 mangle_call_offset (fixed_offset
, virtual_offset
);
3817 else if (!DECL_THUNK_P (fn_decl
))
3818 /* Plain this adjusting thunk. */
3819 mangle_call_offset (fixed_offset
, virtual_offset
);
3822 /* This adjusting thunk to covariant thunk. */
3824 mangle_call_offset (fixed_offset
, virtual_offset
);
3825 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
3826 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
3828 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
3829 mangle_call_offset (fixed_offset
, virtual_offset
);
3830 fn_decl
= THUNK_TARGET (fn_decl
);
3834 write_encoding (fn_decl
);
3836 result
= finish_mangling_get_identifier ();
3838 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
3842 struct conv_type_hasher
: ggc_ptr_hash
<tree_node
>
3844 static hashval_t
hash (tree
);
3845 static bool equal (tree
, tree
);
3848 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3849 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3852 static GTY (()) hash_table
<conv_type_hasher
> *conv_type_names
;
3854 /* Hash a node (VAL1) in the table. */
3857 conv_type_hasher::hash (tree val
)
3859 return (hashval_t
) TYPE_UID (TREE_TYPE (val
));
3862 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3865 conv_type_hasher::equal (tree val1
, tree val2
)
3867 return TREE_TYPE (val1
) == val2
;
3870 /* Return an identifier for the mangled unqualified name for a
3871 conversion operator to TYPE. This mangling is not specified by the
3872 ABI spec; it is only used internally. */
3875 mangle_conv_op_name_for_type (const tree type
)
3880 if (type
== error_mark_node
)
3881 return error_mark_node
;
3883 if (conv_type_names
== NULL
)
3884 conv_type_names
= hash_table
<conv_type_hasher
>::create_ggc (31);
3886 slot
= conv_type_names
->find_slot_with_hash (type
,
3887 (hashval_t
) TYPE_UID (type
),
3894 /* Create a unique name corresponding to TYPE. */
3895 sprintf (buffer
, "operator %lu",
3896 (unsigned long) conv_type_names
->elements ());
3897 identifier
= get_identifier (buffer
);
3900 /* Hang TYPE off the identifier so it can be found easily later
3901 when performing conversions. */
3902 TREE_TYPE (identifier
) = type
;
3904 /* Set bits on the identifier so we know later it's a conversion. */
3905 IDENTIFIER_OPNAME_P (identifier
) = 1;
3906 IDENTIFIER_TYPENAME_P (identifier
) = 1;
3912 /* Write out the appropriate string for this variable when generating
3913 another mangled name based on this one. */
3916 write_guarded_var_name (const tree variable
)
3918 if (DECL_NAME (variable
)
3919 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
3920 /* The name of a guard variable for a reference temporary should refer
3921 to the reference, not the temporary. */
3922 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
3924 write_name (variable
, /*ignore_local_scope=*/0);
3927 /* Return an identifier for the name of an initialization guard
3928 variable for indicated VARIABLE. */
3931 mangle_guard_variable (const tree variable
)
3933 start_mangling (variable
);
3934 write_string ("_ZGV");
3935 write_guarded_var_name (variable
);
3936 return finish_mangling_get_identifier ();
3939 /* Return an identifier for the name of a thread_local initialization
3940 function for VARIABLE. */
3943 mangle_tls_init_fn (const tree variable
)
3945 start_mangling (variable
);
3946 write_string ("_ZTH");
3947 write_guarded_var_name (variable
);
3948 return finish_mangling_get_identifier ();
3951 /* Return an identifier for the name of a thread_local wrapper
3952 function for VARIABLE. */
3954 #define TLS_WRAPPER_PREFIX "_ZTW"
3957 mangle_tls_wrapper_fn (const tree variable
)
3959 start_mangling (variable
);
3960 write_string (TLS_WRAPPER_PREFIX
);
3961 write_guarded_var_name (variable
);
3962 return finish_mangling_get_identifier ();
3965 /* Return true iff FN is a thread_local wrapper function. */
3968 decl_tls_wrapper_p (const tree fn
)
3970 if (TREE_CODE (fn
) != FUNCTION_DECL
)
3972 tree name
= DECL_NAME (fn
);
3973 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
3974 strlen (TLS_WRAPPER_PREFIX
)) == 0;
3977 /* Return an identifier for the name of a temporary variable used to
3978 initialize a static reference. This isn't part of the ABI, but we might
3979 as well call them something readable. */
3981 static GTY(()) int temp_count
;
3984 mangle_ref_init_variable (const tree variable
)
3986 start_mangling (variable
);
3987 write_string ("_ZGR");
3988 write_name (variable
, /*ignore_local_scope=*/0);
3989 /* Avoid name clashes with aggregate initialization of multiple
3990 references at once. */
3991 write_unsigned_number (temp_count
++);
3992 return finish_mangling_get_identifier ();
3996 /* Foreign language type mangling section. */
3998 /* How to write the type codes for the integer Java type. */
4001 write_java_integer_type_codes (const tree type
)
4003 if (type
== java_int_type_node
)
4005 else if (type
== java_short_type_node
)
4007 else if (type
== java_byte_type_node
)
4009 else if (type
== java_char_type_node
)
4011 else if (type
== java_long_type_node
)
4013 else if (type
== java_boolean_type_node
)
4019 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
4020 function generates a mangled name for the vtable map variable of
4021 the class type. For example, if the class type is
4022 "std::bad_exception", the mangled name for the class is
4023 "St13bad_exception". This function would generate the name
4024 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
4025 "_VTV<std::bad_exception>::__vtable_map". */
4029 get_mangled_vtable_map_var_name (tree class_type
)
4031 char *var_name
= NULL
;
4032 const char *prefix
= "_ZN4_VTVI";
4033 const char *postfix
= "E12__vtable_mapE";
4035 gcc_assert (TREE_CODE (class_type
) == RECORD_TYPE
);
4037 tree class_id
= DECL_ASSEMBLER_NAME (TYPE_NAME (class_type
));
4038 unsigned int len
= strlen (IDENTIFIER_POINTER (class_id
)) +
4040 strlen (postfix
) + 1;
4042 var_name
= (char *) xmalloc (len
);
4044 sprintf (var_name
, "%s%s%s", prefix
, IDENTIFIER_POINTER (class_id
), postfix
);
4049 #include "gt-cp-mangle.h"