1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010,
3 2011, 2012 Free Software Foundation, Inc.
4 Written by Alex Samuel <samuel@codesourcery.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file implements mangling of C++ names according to the IA64
23 C++ ABI specification. A mangled name encodes a function or
24 variable's name, scope, type, and/or template arguments into a text
25 identifier. This identifier is used as the function's or
26 variable's linkage name, to preserve compatibility between C++'s
27 language features (templates, scoping, and overloading) and C
30 Additionally, g++ uses mangled names internally. To support this,
31 mangling of types is allowed, even though the mangled name of a
32 type should not appear by itself as an exported name. Ditto for
33 uninstantiated templates.
35 The primary entry point for this module is mangle_decl, which
36 returns an identifier containing the mangled name for a decl.
37 Additional entry points are provided to build mangled names of
38 particular constructs when the appropriate decl for that construct
39 is not available. These are:
41 mangle_typeinfo_for_type: typeinfo data
42 mangle_typeinfo_string_for_type: typeinfo type name
43 mangle_vtbl_for_type: virtual table data
44 mangle_vtt_for_type: VTT data
45 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
46 mangle_thunk: thunk function or entry */
50 #include "coretypes.h"
60 /* Debugging support. */
62 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
64 #define DEBUG_MANGLE 0
67 /* Macros for tracing the write_* functions. */
69 # define MANGLE_TRACE(FN, INPUT) \
70 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
71 # define MANGLE_TRACE_TREE(FN, NODE) \
72 fprintf (stderr, " %-24s: %-24s (%p)\n", \
73 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
75 # define MANGLE_TRACE(FN, INPUT)
76 # define MANGLE_TRACE_TREE(FN, NODE)
79 /* Nonzero if NODE is a class template-id. We can't rely on
80 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
81 that hard to distinguish A<T> from A, where A<T> is the type as
82 instantiated outside of the template, and A is the type used
83 without parameters inside the template. */
84 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
85 (TYPE_LANG_SPECIFIC (NODE) != NULL \
86 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
87 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
88 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
90 /* Things we only need one of. This module is not reentrant. */
91 typedef struct GTY(()) globals
{
92 /* An array of the current substitution candidates, in the order
94 VEC(tree
,gc
) *substitutions
;
96 /* The entity that is being mangled. */
97 tree
GTY ((skip
)) entity
;
99 /* How many parameter scopes we are inside. */
102 /* True if the mangling will be different in a future version of the
104 bool need_abi_warning
;
107 static GTY (()) globals G
;
109 /* The obstack on which we build mangled names. */
110 static struct obstack
*mangle_obstack
;
112 /* The obstack on which we build mangled names that are not going to
113 be IDENTIFIER_NODEs. */
114 static struct obstack name_obstack
;
116 /* The first object on the name_obstack; we use this to free memory
117 allocated on the name_obstack. */
118 static void *name_base
;
120 /* Indices into subst_identifiers. These are identifiers used in
121 special substitution rules. */
129 SUBID_BASIC_IOSTREAM
,
132 substitution_identifier_index_t
;
134 /* For quick substitution checks, look up these common identifiers
136 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
138 /* Single-letter codes for builtin integer types, defined in
139 <builtin-type>. These are indexed by integer_type_kind values. */
141 integer_type_codes
[itk_none
] =
144 'a', /* itk_signed_char */
145 'h', /* itk_unsigned_char */
147 't', /* itk_unsigned_short */
149 'j', /* itk_unsigned_int */
151 'm', /* itk_unsigned_long */
152 'x', /* itk_long_long */
153 'y', /* itk_unsigned_long_long */
154 'n', /* itk_int128 */
155 'o', /* itk_unsigned_int128 */
158 static int decl_is_template_id (const tree
, tree
* const);
160 /* Functions for handling substitutions. */
162 static inline tree
canonicalize_for_substitution (tree
);
163 static void add_substitution (tree
);
164 static inline int is_std_substitution (const tree
,
165 const substitution_identifier_index_t
);
166 static inline int is_std_substitution_char (const tree
,
167 const substitution_identifier_index_t
);
168 static int find_substitution (tree
);
169 static void mangle_call_offset (const tree
, const tree
);
171 /* Functions for emitting mangled representations of things. */
173 static void write_mangled_name (const tree
, bool);
174 static void write_encoding (const tree
);
175 static void write_name (tree
, const int);
176 static void write_abi_tags (tree
);
177 static void write_unscoped_name (const tree
);
178 static void write_unscoped_template_name (const tree
);
179 static void write_nested_name (const tree
);
180 static void write_prefix (const tree
);
181 static void write_template_prefix (const tree
);
182 static void write_unqualified_name (const tree
);
183 static void write_conversion_operator_name (const tree
);
184 static void write_source_name (tree
);
185 static void write_literal_operator_name (tree
);
186 static void write_unnamed_type_name (const tree
);
187 static void write_closure_type_name (const tree
);
188 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
190 static void write_number (unsigned HOST_WIDE_INT
, const int,
192 static void write_compact_number (int num
);
193 static void write_integer_cst (const tree
);
194 static void write_real_cst (const tree
);
195 static void write_identifier (const char *);
196 static void write_special_name_constructor (const tree
);
197 static void write_special_name_destructor (const tree
);
198 static void write_type (tree
);
199 static int write_CV_qualifiers_for_type (const tree
);
200 static void write_builtin_type (tree
);
201 static void write_function_type (const tree
);
202 static void write_bare_function_type (const tree
, const int, const tree
);
203 static void write_method_parms (tree
, const int, const tree
);
204 static void write_class_enum_type (const tree
);
205 static void write_template_args (tree
);
206 static void write_expression (tree
);
207 static void write_template_arg_literal (const tree
);
208 static void write_template_arg (tree
);
209 static void write_template_template_arg (const tree
);
210 static void write_array_type (const tree
);
211 static void write_pointer_to_member_type (const tree
);
212 static void write_template_param (const tree
);
213 static void write_template_template_param (const tree
);
214 static void write_substitution (const int);
215 static int discriminator_for_local_entity (tree
);
216 static int discriminator_for_string_literal (tree
, tree
);
217 static void write_discriminator (const int);
218 static void write_local_name (tree
, const tree
, const tree
);
219 static void dump_substitution_candidates (void);
220 static tree
mangle_decl_string (const tree
);
221 static int local_class_index (tree
);
223 /* Control functions. */
225 static inline void start_mangling (const tree
);
226 static inline const char *finish_mangling (const bool);
227 static tree
mangle_special_for_type (const tree
, const char *);
229 /* Foreign language functions. */
231 static void write_java_integer_type_codes (const tree
);
233 /* Append a single character to the end of the mangled
235 #define write_char(CHAR) \
236 obstack_1grow (mangle_obstack, (CHAR))
238 /* Append a sized buffer to the end of the mangled representation. */
239 #define write_chars(CHAR, LEN) \
240 obstack_grow (mangle_obstack, (CHAR), (LEN))
242 /* Append a NUL-terminated string to the end of the mangled
244 #define write_string(STRING) \
245 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
247 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
248 same purpose (context, which may be a type) and value (template
249 decl). See write_template_prefix for more information on what this
251 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
252 (TREE_CODE (NODE1) == TREE_LIST \
253 && TREE_CODE (NODE2) == TREE_LIST \
254 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
255 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
256 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
257 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
259 /* Write out an unsigned quantity in base 10. */
260 #define write_unsigned_number(NUMBER) \
261 write_number ((NUMBER), /*unsigned_p=*/1, 10)
263 /* If DECL is a template instance, return nonzero and, if
264 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
265 Otherwise return zero. */
268 decl_is_template_id (const tree decl
, tree
* const template_info
)
270 if (TREE_CODE (decl
) == TYPE_DECL
)
272 /* TYPE_DECLs are handled specially. Look at its type to decide
273 if this is a template instantiation. */
274 const tree type
= TREE_TYPE (decl
);
276 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
278 if (template_info
!= NULL
)
279 /* For a templated TYPE_DECL, the template info is hanging
281 *template_info
= TYPE_TEMPLATE_INFO (type
);
287 /* Check if this is a primary template. */
288 if (DECL_LANG_SPECIFIC (decl
) != NULL
289 && DECL_USE_TEMPLATE (decl
)
290 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
291 && TREE_CODE (decl
) != TEMPLATE_DECL
)
293 if (template_info
!= NULL
)
294 /* For most templated decls, the template info is hanging
296 *template_info
= DECL_TEMPLATE_INFO (decl
);
301 /* It's not a template id. */
305 /* Produce debugging output of current substitution candidates. */
308 dump_substitution_candidates (void)
313 fprintf (stderr
, " ++ substitutions ");
314 FOR_EACH_VEC_ELT (tree
, G
.substitutions
, i
, el
)
316 const char *name
= "???";
319 fprintf (stderr
, " ");
321 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
322 else if (TREE_CODE (el
) == TREE_LIST
)
323 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
324 else if (TYPE_NAME (el
))
325 name
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el
)));
326 fprintf (stderr
, " S%d_ = ", i
- 1);
328 (CP_TYPE_RESTRICT_P (el
)
329 || CP_TYPE_VOLATILE_P (el
)
330 || CP_TYPE_CONST_P (el
)))
331 fprintf (stderr
, "CV-");
332 fprintf (stderr
, "%s (%s at %p)\n",
333 name
, tree_code_name
[TREE_CODE (el
)], (void *) el
);
337 /* Both decls and types can be substitution candidates, but sometimes
338 they refer to the same thing. For instance, a TYPE_DECL and
339 RECORD_TYPE for the same class refer to the same thing, and should
340 be treated accordingly in substitutions. This function returns a
341 canonicalized tree node representing NODE that is used when adding
342 and substitution candidates and finding matches. */
345 canonicalize_for_substitution (tree node
)
347 /* For a TYPE_DECL, use the type instead. */
348 if (TREE_CODE (node
) == TYPE_DECL
)
349 node
= TREE_TYPE (node
);
351 && TYPE_CANONICAL (node
) != node
352 && TYPE_MAIN_VARIANT (node
) != node
)
354 /* Here we want to strip the topmost typedef only.
355 We need to do that so is_std_substitution can do proper
357 if (TREE_CODE (node
) == FUNCTION_TYPE
)
358 /* Use build_qualified_type and TYPE_QUALS here to preserve
359 the old buggy mangling of attribute noreturn with abi<5. */
360 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
363 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
364 cp_type_quals (node
));
369 /* Add NODE as a substitution candidate. NODE must not already be on
370 the list of candidates. */
373 add_substitution (tree node
)
378 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
379 tree_code_name
[TREE_CODE (node
)], (void *) node
);
381 /* Get the canonicalized substitution candidate for NODE. */
382 c
= canonicalize_for_substitution (node
);
383 if (DEBUG_MANGLE
&& c
!= node
)
384 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
385 tree_code_name
[TREE_CODE (node
)], (void *) node
);
389 /* Make sure NODE isn't already a candidate. */
394 FOR_EACH_VEC_ELT (tree
, G
.substitutions
, i
, candidate
)
396 gcc_assert (!(DECL_P (node
) && node
== candidate
));
397 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
398 && same_type_p (node
, candidate
)));
401 #endif /* ENABLE_CHECKING */
403 /* Put the decl onto the varray of substitution candidates. */
404 VEC_safe_push (tree
, gc
, G
.substitutions
, node
);
407 dump_substitution_candidates ();
410 /* Helper function for find_substitution. Returns nonzero if NODE,
411 which may be a decl or a CLASS_TYPE, is a template-id with template
412 name of substitution_index[INDEX] in the ::std namespace. */
415 is_std_substitution (const tree node
,
416 const substitution_identifier_index_t index
)
423 type
= TREE_TYPE (node
);
426 else if (CLASS_TYPE_P (node
))
429 decl
= TYPE_NAME (node
);
432 /* These are not the droids you're looking for. */
435 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
436 && TYPE_LANG_SPECIFIC (type
)
437 && TYPE_TEMPLATE_INFO (type
)
438 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
439 == subst_identifiers
[index
]));
442 /* Helper function for find_substitution. Returns nonzero if NODE,
443 which may be a decl or a CLASS_TYPE, is the template-id
444 ::std::identifier<char>, where identifier is
445 substitution_index[INDEX]. */
448 is_std_substitution_char (const tree node
,
449 const substitution_identifier_index_t index
)
452 /* Check NODE's name is ::std::identifier. */
453 if (!is_std_substitution (node
, index
))
455 /* Figure out its template args. */
457 args
= DECL_TI_ARGS (node
);
458 else if (CLASS_TYPE_P (node
))
459 args
= CLASSTYPE_TI_ARGS (node
);
461 /* Oops, not a template. */
463 /* NODE's template arg list should be <char>. */
465 TREE_VEC_LENGTH (args
) == 1
466 && TREE_VEC_ELT (args
, 0) == char_type_node
;
469 /* Check whether a substitution should be used to represent NODE in
472 First, check standard special-case substitutions.
474 <substitution> ::= St
481 # ::std::basic_string
484 # ::std::basic_string<char,
485 ::std::char_traits<char>,
486 ::std::allocator<char> >
489 # ::std::basic_istream<char, ::std::char_traits<char> >
492 # ::std::basic_ostream<char, ::std::char_traits<char> >
495 # ::std::basic_iostream<char, ::std::char_traits<char> >
497 Then examine the stack of currently available substitution
498 candidates for entities appearing earlier in the same mangling
500 If a substitution is found, write its mangled representation and
501 return nonzero. If none is found, just return zero. */
504 find_substitution (tree node
)
507 const int size
= VEC_length (tree
, G
.substitutions
);
512 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
513 tree_code_name
[TREE_CODE (node
)], (void *) node
);
515 /* Obtain the canonicalized substitution representation for NODE.
516 This is what we'll compare against. */
517 node
= canonicalize_for_substitution (node
);
519 /* Check for builtin substitutions. */
521 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
522 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
524 /* Check for std::allocator. */
526 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
527 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
533 /* Check for std::basic_string. */
534 if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
538 /* If this is a type (i.e. a fully-qualified template-id),
540 std::basic_string <char,
541 std::char_traits<char>,
542 std::allocator<char> > . */
543 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
544 && CLASSTYPE_USE_TEMPLATE (type
))
546 tree args
= CLASSTYPE_TI_ARGS (type
);
547 if (TREE_VEC_LENGTH (args
) == 3
548 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
549 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
551 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
560 /* Substitute for the template name only if this isn't a type. */
567 /* Check for basic_{i,o,io}stream. */
569 && cp_type_quals (type
) == TYPE_UNQUALIFIED
570 && CLASS_TYPE_P (type
)
571 && CLASSTYPE_USE_TEMPLATE (type
)
572 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
574 /* First, check for the template
575 args <char, std::char_traits<char> > . */
576 tree args
= CLASSTYPE_TI_ARGS (type
);
577 if (TREE_VEC_LENGTH (args
) == 2
578 && TYPE_P (TREE_VEC_ELT (args
, 0))
579 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
580 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
583 /* Got them. Is this basic_istream? */
584 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
589 /* Or basic_ostream? */
590 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
595 /* Or basic_iostream? */
596 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
604 /* Check for namespace std. */
605 if (decl
&& DECL_NAMESPACE_STD_P (decl
))
611 /* Now check the list of available substitutions for this mangling
613 for (i
= 0; i
< size
; ++i
)
615 tree candidate
= VEC_index (tree
, G
.substitutions
, i
);
616 /* NODE is a matched to a candidate if it's the same decl node or
617 if it's the same type. */
618 if (decl
== candidate
619 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
620 && same_type_p (type
, candidate
))
621 || NESTED_TEMPLATE_MATCH (node
, candidate
))
623 write_substitution (i
);
628 /* No substitution found. */
633 /* TOP_LEVEL is true, if this is being called at outermost level of
634 mangling. It should be false when mangling a decl appearing in an
635 expression within some other mangling.
637 <mangled-name> ::= _Z <encoding> */
640 write_mangled_name (const tree decl
, bool top_level
)
642 MANGLE_TRACE_TREE ("mangled-name", decl
);
644 if (/* The names of `extern "C"' functions are not mangled. */
645 DECL_EXTERN_C_FUNCTION_P (decl
)
646 /* But overloaded operator names *are* mangled. */
647 && !DECL_OVERLOADED_OPERATOR_P (decl
))
652 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
655 /* The standard notes: "The <encoding> of an extern "C"
656 function is treated like global-scope data, i.e. as its
657 <source-name> without a type." We cannot write
658 overloaded operators that way though, because it contains
659 characters invalid in assembler. */
660 if (abi_version_at_least (2))
663 G
.need_abi_warning
= true;
664 write_source_name (DECL_NAME (decl
));
667 else if (TREE_CODE (decl
) == VAR_DECL
668 /* The names of non-static global variables aren't mangled. */
669 && DECL_EXTERNAL_LINKAGE_P (decl
)
670 && (CP_DECL_CONTEXT (decl
) == global_namespace
671 /* And neither are `extern "C"' variables. */
672 || DECL_EXTERN_C_P (decl
)))
674 if (top_level
|| abi_version_at_least (2))
678 G
.need_abi_warning
= true;
686 write_encoding (decl
);
687 if (DECL_LANG_SPECIFIC (decl
)
688 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
)
689 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)))
690 /* We need a distinct mangled name for these entities, but
691 we should never actually output it. So, we append some
692 characters the assembler won't like. */
693 write_string (" *INTERNAL* ");
697 /* <encoding> ::= <function name> <bare-function-type>
701 write_encoding (const tree decl
)
703 MANGLE_TRACE_TREE ("encoding", decl
);
705 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
707 /* For overloaded operators write just the mangled name
708 without arguments. */
709 if (DECL_OVERLOADED_OPERATOR_P (decl
))
710 write_name (decl
, /*ignore_local_scope=*/0);
712 write_source_name (DECL_NAME (decl
));
716 write_name (decl
, /*ignore_local_scope=*/0);
717 if (TREE_CODE (decl
) == FUNCTION_DECL
)
722 if (decl_is_template_id (decl
, NULL
))
724 fn_type
= get_mostly_instantiated_function_type (decl
);
725 /* FN_TYPE will not have parameter types for in-charge or
726 VTT parameters. Therefore, we pass NULL_TREE to
727 write_bare_function_type -- otherwise, it will get
728 confused about which artificial parameters to skip. */
733 fn_type
= TREE_TYPE (decl
);
737 write_bare_function_type (fn_type
,
738 (!DECL_CONSTRUCTOR_P (decl
)
739 && !DECL_DESTRUCTOR_P (decl
)
740 && !DECL_CONV_FN_P (decl
)
741 && decl_is_template_id (decl
, NULL
)),
746 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
747 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
750 decl_mangling_context (tree decl
)
752 tree tcontext
= targetm
.cxx
.decl_mangling_context (decl
);
754 if (tcontext
!= NULL_TREE
)
757 if (TREE_CODE (decl
) == TYPE_DECL
758 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
760 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl
));
764 else if (TREE_CODE (decl
) == TYPE_DECL
765 && TREE_CODE (TREE_TYPE (decl
)) == TEMPLATE_TYPE_PARM
)
766 /* template type parms have no mangling context. */
768 return CP_DECL_CONTEXT (decl
);
771 /* <name> ::= <unscoped-name>
772 ::= <unscoped-template-name> <template-args>
776 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
777 called from <local-name>, which mangles the enclosing scope
778 elsewhere and then uses this function to mangle just the part
779 underneath the function scope. So don't use the <local-name>
780 production, to avoid an infinite recursion. */
783 write_name (tree decl
, const int ignore_local_scope
)
787 MANGLE_TRACE_TREE ("name", decl
);
789 if (TREE_CODE (decl
) == TYPE_DECL
)
791 /* In case this is a typedef, fish out the corresponding
792 TYPE_DECL for the main variant. */
793 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
796 context
= decl_mangling_context (decl
);
798 /* A decl in :: or ::std scope is treated specially. The former is
799 mangled using <unscoped-name> or <unscoped-template-name>, the
800 latter with a special substitution. Also, a name that is
801 directly in a local function scope is also mangled with
802 <unscoped-name> rather than a full <nested-name>. */
804 || context
== global_namespace
805 || DECL_NAMESPACE_STD_P (context
)
806 || (ignore_local_scope
&& TREE_CODE (context
) == FUNCTION_DECL
))
809 /* Is this a template instance? */
810 if (decl_is_template_id (decl
, &template_info
))
812 /* Yes: use <unscoped-template-name>. */
813 write_unscoped_template_name (TI_TEMPLATE (template_info
));
814 write_template_args (TI_ARGS (template_info
));
817 /* Everything else gets an <unqualified-name>. */
818 write_unscoped_name (decl
);
822 /* Handle local names, unless we asked not to (that is, invoked
823 under <local-name>, to handle only the part of the name under
825 if (!ignore_local_scope
)
827 /* Scan up the list of scope context, looking for a
828 function. If we find one, this entity is in local
829 function scope. local_entity tracks context one scope
830 level down, so it will contain the element that's
831 directly in that function's scope, either decl or one of
832 its enclosing scopes. */
833 tree local_entity
= decl
;
834 while (context
!= NULL
&& context
!= global_namespace
)
836 /* Make sure we're always dealing with decls. */
837 if (context
!= NULL
&& TYPE_P (context
))
838 context
= TYPE_NAME (context
);
839 /* Is this a function? */
840 if (TREE_CODE (context
) == FUNCTION_DECL
841 || TREE_CODE (context
) == PARM_DECL
)
843 /* Yes, we have local scope. Use the <local-name>
844 production for the innermost function scope. */
845 write_local_name (context
, local_entity
, decl
);
848 /* Up one scope level. */
849 local_entity
= context
;
850 context
= decl_mangling_context (context
);
853 /* No local scope found? Fall through to <nested-name>. */
856 /* Other decls get a <nested-name> to encode their scope. */
857 write_nested_name (decl
);
861 /* <unscoped-name> ::= <unqualified-name>
862 ::= St <unqualified-name> # ::std:: */
865 write_unscoped_name (const tree decl
)
867 tree context
= decl_mangling_context (decl
);
869 MANGLE_TRACE_TREE ("unscoped-name", decl
);
871 /* Is DECL in ::std? */
872 if (DECL_NAMESPACE_STD_P (context
))
875 write_unqualified_name (decl
);
879 /* If not, it should be either in the global namespace, or directly
880 in a local function scope. */
881 gcc_assert (context
== global_namespace
883 || TREE_CODE (context
) == FUNCTION_DECL
);
885 write_unqualified_name (decl
);
889 /* <unscoped-template-name> ::= <unscoped-name>
890 ::= <substitution> */
893 write_unscoped_template_name (const tree decl
)
895 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
897 if (find_substitution (decl
))
899 write_unscoped_name (decl
);
900 add_substitution (decl
);
903 /* Write the nested name, including CV-qualifiers, of DECL.
905 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
906 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
908 <CV-qualifiers> ::= [r] [V] [K] */
911 write_nested_name (const tree decl
)
915 MANGLE_TRACE_TREE ("nested-name", decl
);
919 /* Write CV-qualifiers, if this is a member function. */
920 if (TREE_CODE (decl
) == FUNCTION_DECL
921 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
923 if (DECL_VOLATILE_MEMFUNC_P (decl
))
925 if (DECL_CONST_MEMFUNC_P (decl
))
929 /* Is this a template instance? */
930 if (decl_is_template_id (decl
, &template_info
))
932 /* Yes, use <template-prefix>. */
933 write_template_prefix (decl
);
934 write_template_args (TI_ARGS (template_info
));
936 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
938 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
939 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
941 write_template_prefix (decl
);
942 write_template_args (TREE_OPERAND (name
, 1));
946 write_prefix (decl_mangling_context (decl
));
947 write_unqualified_name (decl
);
952 /* No, just use <prefix> */
953 write_prefix (decl_mangling_context (decl
));
954 write_unqualified_name (decl
);
959 /* <prefix> ::= <prefix> <unqualified-name>
961 ::= <template-prefix> <template-args>
964 ::= <substitution> */
967 write_prefix (const tree node
)
970 /* Non-NULL if NODE represents a template-id. */
971 tree template_info
= NULL
;
974 || node
== global_namespace
)
977 MANGLE_TRACE_TREE ("prefix", node
);
979 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
985 if (find_substitution (node
))
990 /* If this is a function or parm decl, that means we've hit function
991 scope, so this prefix must be for a local name. In this
992 case, we're under the <local-name> production, which encodes
993 the enclosing function scope elsewhere. So don't continue
995 if (TREE_CODE (node
) == FUNCTION_DECL
996 || TREE_CODE (node
) == PARM_DECL
)
1000 decl_is_template_id (decl
, &template_info
);
1004 /* Node is a type. */
1005 decl
= TYPE_NAME (node
);
1006 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1007 template_info
= TYPE_TEMPLATE_INFO (node
);
1010 /* In G++ 3.2, the name of the template parameter was used. */
1011 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
1012 && !abi_version_at_least (2))
1013 G
.need_abi_warning
= true;
1015 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
1016 && abi_version_at_least (2))
1017 write_template_param (node
);
1018 else if (template_info
!= NULL
)
1021 write_template_prefix (decl
);
1022 write_template_args (TI_ARGS (template_info
));
1024 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1026 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1027 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1029 write_template_prefix (decl
);
1030 write_template_args (TREE_OPERAND (name
, 1));
1034 write_prefix (decl_mangling_context (decl
));
1035 write_unqualified_name (decl
);
1039 /* Not templated. */
1041 write_prefix (decl_mangling_context (decl
));
1042 write_unqualified_name (decl
);
1043 if (TREE_CODE (decl
) == VAR_DECL
1044 || TREE_CODE (decl
) == FIELD_DECL
)
1046 /* <data-member-prefix> := <member source-name> M */
1052 add_substitution (node
);
1055 /* <template-prefix> ::= <prefix> <template component>
1056 ::= <template-param>
1057 ::= <substitution> */
1060 write_template_prefix (const tree node
)
1062 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1063 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1064 tree context
= decl_mangling_context (decl
);
1069 MANGLE_TRACE_TREE ("template-prefix", node
);
1071 /* Find the template decl. */
1072 if (decl_is_template_id (decl
, &template_info
))
1073 templ
= TI_TEMPLATE (template_info
);
1074 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1075 /* For a typename type, all we have is the name. */
1076 templ
= DECL_NAME (decl
);
1079 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1081 templ
= TYPE_TI_TEMPLATE (type
);
1084 /* For a member template, though, the template name for the
1085 innermost name must have all the outer template levels
1086 instantiated. For instance, consider
1088 template<typename T> struct Outer {
1089 template<typename U> struct Inner {};
1092 The template name for `Inner' in `Outer<int>::Inner<float>' is
1093 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1094 levels separately, so there's no TEMPLATE_DECL available for this
1095 (there's only `Outer<T>::Inner<U>').
1097 In order to get the substitutions right, we create a special
1098 TREE_LIST to represent the substitution candidate for a nested
1099 template. The TREE_PURPOSE is the template's context, fully
1100 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1103 So, for the example above, `Outer<int>::Inner' is represented as a
1104 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1105 and whose value is `Outer<T>::Inner<U>'. */
1106 if (TYPE_P (context
))
1107 substitution
= build_tree_list (context
, templ
);
1109 substitution
= templ
;
1111 if (find_substitution (substitution
))
1114 /* In G++ 3.2, the name of the template template parameter was used. */
1115 if (TREE_TYPE (templ
)
1116 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
1117 && !abi_version_at_least (2))
1118 G
.need_abi_warning
= true;
1120 if (TREE_TYPE (templ
)
1121 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
1122 && abi_version_at_least (2))
1123 write_template_param (TREE_TYPE (templ
));
1126 write_prefix (context
);
1127 write_unqualified_name (decl
);
1130 add_substitution (substitution
);
1133 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1134 mangled through special entry points.
1136 <unqualified-name> ::= <operator-name>
1139 ::= <unnamed-type-name>
1140 ::= <local-source-name>
1142 <local-source-name> ::= L <source-name> <discriminator> */
1145 write_unqualified_id (tree identifier
)
1147 if (IDENTIFIER_TYPENAME_P (identifier
))
1148 write_conversion_operator_name (TREE_TYPE (identifier
));
1149 else if (IDENTIFIER_OPNAME_P (identifier
))
1152 const char *mangled_name
= NULL
;
1154 /* Unfortunately, there is no easy way to go from the
1155 name of the operator back to the corresponding tree
1157 for (i
= 0; i
< MAX_TREE_CODES
; ++i
)
1158 if (operator_name_info
[i
].identifier
== identifier
)
1160 /* The ABI says that we prefer binary operator
1161 names to unary operator names. */
1162 if (operator_name_info
[i
].arity
== 2)
1164 mangled_name
= operator_name_info
[i
].mangled_name
;
1167 else if (!mangled_name
)
1168 mangled_name
= operator_name_info
[i
].mangled_name
;
1170 else if (assignment_operator_name_info
[i
].identifier
1174 = assignment_operator_name_info
[i
].mangled_name
;
1177 write_string (mangled_name
);
1179 else if (UDLIT_OPER_P (identifier
))
1180 write_literal_operator_name (identifier
);
1182 write_source_name (identifier
);
1186 write_unqualified_name (const tree decl
)
1188 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1190 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
1192 write_unqualified_id (decl
);
1198 if (DECL_NAME (decl
) == NULL_TREE
)
1201 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1202 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1204 else if (DECL_DECLARES_FUNCTION_P (decl
))
1207 if (DECL_CONSTRUCTOR_P (decl
))
1208 write_special_name_constructor (decl
);
1209 else if (DECL_DESTRUCTOR_P (decl
))
1210 write_special_name_destructor (decl
);
1211 else if (DECL_CONV_FN_P (decl
))
1213 /* Conversion operator. Handle it right here.
1214 <operator> ::= cv <type> */
1216 if (decl_is_template_id (decl
, NULL
))
1219 fn_type
= get_mostly_instantiated_function_type (decl
);
1220 type
= TREE_TYPE (fn_type
);
1223 type
= DECL_CONV_FN_TYPE (decl
);
1224 write_conversion_operator_name (type
);
1226 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1228 operator_name_info_t
*oni
;
1229 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1230 oni
= assignment_operator_name_info
;
1232 oni
= operator_name_info
;
1234 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1236 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1237 write_literal_operator_name (DECL_NAME (decl
));
1244 else if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1245 && DECL_NAMESPACE_SCOPE_P (decl
)
1246 && decl_linkage (decl
) == lk_internal
)
1248 MANGLE_TRACE_TREE ("local-source-name", decl
);
1250 write_source_name (DECL_NAME (decl
));
1251 /* The default discriminator is 1, and that's all we ever use,
1252 so there's no code to output one here. */
1256 tree type
= TREE_TYPE (decl
);
1258 if (TREE_CODE (decl
) == TYPE_DECL
1259 && TYPE_ANONYMOUS_P (type
))
1260 write_unnamed_type_name (type
);
1261 else if (TREE_CODE (decl
) == TYPE_DECL
1262 && LAMBDA_TYPE_P (type
))
1263 write_closure_type_name (type
);
1265 write_source_name (DECL_NAME (decl
));
1268 tree attrs
= (TREE_CODE (decl
) == TYPE_DECL
1269 ? TYPE_ATTRIBUTES (TREE_TYPE (decl
))
1270 : DECL_ATTRIBUTES (decl
));
1271 write_abi_tags (lookup_attribute ("abi_tag", attrs
));
1274 /* Write the unqualified-name for a conversion operator to TYPE. */
1277 write_conversion_operator_name (const tree type
)
1279 write_string ("cv");
1283 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1285 <source-name> ::= </length/ number> <identifier> */
1288 write_source_name (tree identifier
)
1290 MANGLE_TRACE_TREE ("source-name", identifier
);
1292 /* Never write the whole template-id name including the template
1293 arguments; we only want the template name. */
1294 if (IDENTIFIER_TEMPLATE (identifier
))
1295 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1297 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1298 write_identifier (IDENTIFIER_POINTER (identifier
));
1301 /* Compare two TREE_STRINGs like strcmp. */
1304 tree_string_cmp (const void *p1
, const void *p2
)
1308 tree s1
= *(const tree
*)p1
;
1309 tree s2
= *(const tree
*)p2
;
1310 return strcmp (TREE_STRING_POINTER (s1
),
1311 TREE_STRING_POINTER (s2
));
1314 /* ID is the name of a function or type with abi_tags attribute TAGS.
1315 Write out the name, suitably decorated. */
1318 write_abi_tags (tree tags
)
1320 if (tags
== NULL_TREE
)
1323 tags
= TREE_VALUE (tags
);
1325 VEC(tree
,gc
)* vec
= make_tree_vector();
1327 for (tree t
= tags
; t
; t
= TREE_CHAIN (t
))
1329 tree str
= TREE_VALUE (t
);
1330 VEC_safe_push (tree
, gc
, vec
, str
);
1333 VEC_qsort (tree
, vec
, tree_string_cmp
);
1335 unsigned i
; tree str
;
1336 FOR_EACH_VEC_ELT (tree
, vec
, i
, str
)
1339 write_unsigned_number (TREE_STRING_LENGTH (str
) - 1);
1340 write_identifier (TREE_STRING_POINTER (str
));
1343 release_tree_vector (vec
);
1346 /* Write a user-defined literal operator.
1347 ::= li <source-name> # "" <source-name>
1348 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1351 write_literal_operator_name (tree identifier
)
1353 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1354 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1355 write_unsigned_number (strlen (suffix
));
1356 write_identifier (suffix
);
1359 /* Encode 0 as _, and 1+ as n-1_. */
1362 write_compact_number (int num
)
1365 write_unsigned_number (num
- 1);
1369 /* Return how many unnamed types precede TYPE in its enclosing class. */
1372 nested_anon_class_index (tree type
)
1375 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1376 for (; member
; member
= DECL_CHAIN (member
))
1377 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1379 tree memtype
= TREE_TYPE (member
);
1380 if (memtype
== type
)
1382 else if (TYPE_ANONYMOUS_P (memtype
))
1389 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1392 write_unnamed_type_name (const tree type
)
1395 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1397 if (TYPE_FUNCTION_SCOPE_P (type
))
1398 discriminator
= local_class_index (type
);
1399 else if (TYPE_CLASS_SCOPE_P (type
))
1400 discriminator
= nested_anon_class_index (type
);
1403 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1404 /* Just use the old mangling at namespace scope. */
1405 write_source_name (TYPE_IDENTIFIER (type
));
1409 write_string ("Ut");
1410 write_compact_number (discriminator
);
1413 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1414 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1417 write_closure_type_name (const tree type
)
1419 tree fn
= lambda_function (type
);
1420 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1421 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1423 MANGLE_TRACE_TREE ("closure-type-name", type
);
1425 write_string ("Ul");
1426 write_method_parms (parms
, /*method_p=*/1, fn
);
1428 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1431 /* Convert NUMBER to ascii using base BASE and generating at least
1432 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1433 into which to store the characters. Returns the number of
1434 characters generated (these will be layed out in advance of where
1438 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1439 char *buffer
, const unsigned int min_digits
)
1441 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1442 unsigned digits
= 0;
1446 unsigned HOST_WIDE_INT d
= number
/ base
;
1448 *--buffer
= base_digits
[number
- d
* base
];
1452 while (digits
< min_digits
)
1454 *--buffer
= base_digits
[0];
1460 /* Non-terminal <number>.
1462 <number> ::= [n] </decimal integer/> */
1465 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1466 const unsigned int base
)
1468 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1471 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1474 number
= -((HOST_WIDE_INT
) number
);
1476 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1477 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1480 /* Write out an integral CST in decimal. Most numbers are small, and
1481 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1482 bigger than that, which we must deal with. */
1485 write_integer_cst (const tree cst
)
1487 int sign
= tree_int_cst_sgn (cst
);
1489 if (TREE_INT_CST_HIGH (cst
) + (sign
< 0))
1491 /* A bignum. We do this in chunks, each of which fits in a
1493 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1494 unsigned HOST_WIDE_INT chunk
;
1495 unsigned chunk_digits
;
1496 char *ptr
= buffer
+ sizeof (buffer
);
1501 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1506 if (sizeof (HOST_WIDE_INT
) >= 8)
1508 /* It is at least 64 bits, so 10^18 is representable. */
1513 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1514 base
= build_int_cstu (type
, chunk
);
1515 n
= build_int_cst_wide (type
,
1516 TREE_INT_CST_LOW (cst
), TREE_INT_CST_HIGH (cst
));
1521 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1525 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1526 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1529 done
= integer_zerop (d
);
1530 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1531 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1532 done
? 1 : chunk_digits
);
1538 write_chars (ptr
, count
);
1543 unsigned HOST_WIDE_INT low
= TREE_INT_CST_LOW (cst
);
1550 write_unsigned_number (low
);
1554 /* Write out a floating-point literal.
1556 "Floating-point literals are encoded using the bit pattern of the
1557 target processor's internal representation of that number, as a
1558 fixed-length lowercase hexadecimal string, high-order bytes first
1559 (even if the target processor would store low-order bytes first).
1560 The "n" prefix is not used for floating-point literals; the sign
1561 bit is encoded with the rest of the number.
1563 Here are some examples, assuming the IEEE standard representation
1564 for floating point numbers. (Spaces are for readability, not
1565 part of the encoding.)
1568 -1.0f Lf bf80 0000 E
1569 1.17549435e-38f Lf 0080 0000 E
1570 1.40129846e-45f Lf 0000 0001 E
1571 0.0f Lf 0000 0000 E"
1573 Caller is responsible for the Lx and the E. */
1575 write_real_cst (const tree value
)
1577 if (abi_version_at_least (2))
1579 long target_real
[4]; /* largest supported float */
1580 char buffer
[9]; /* eight hex digits in a 32-bit number */
1583 tree type
= TREE_TYPE (value
);
1584 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1586 real_to_target (target_real
, &TREE_REAL_CST (value
),
1589 /* The value in target_real is in the target word order,
1590 so we must write it out backward if that happens to be
1591 little-endian. write_number cannot be used, it will
1592 produce uppercase. */
1593 if (FLOAT_WORDS_BIG_ENDIAN
)
1594 i
= 0, limit
= words
, dir
= 1;
1596 i
= words
- 1, limit
= -1, dir
= -1;
1598 for (; i
!= limit
; i
+= dir
)
1600 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1601 write_chars (buffer
, 8);
1606 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1607 literally. Note that compatibility with 3.2 is impossible,
1608 because the old floating-point emulator used a different
1609 format for REAL_VALUE_TYPE. */
1611 for (i
= 0; i
< sizeof (TREE_REAL_CST (value
)); ++i
)
1612 write_number (((unsigned char *) &TREE_REAL_CST (value
))[i
],
1615 G
.need_abi_warning
= 1;
1619 /* Non-terminal <identifier>.
1621 <identifier> ::= </unqualified source code identifier> */
1624 write_identifier (const char *identifier
)
1626 MANGLE_TRACE ("identifier", identifier
);
1627 write_string (identifier
);
1630 /* Handle constructor productions of non-terminal <special-name>.
1631 CTOR is a constructor FUNCTION_DECL.
1633 <special-name> ::= C1 # complete object constructor
1634 ::= C2 # base object constructor
1635 ::= C3 # complete object allocating constructor
1637 Currently, allocating constructors are never used.
1639 We also need to provide mangled names for the maybe-in-charge
1640 constructor, so we treat it here too. mangle_decl_string will
1641 append *INTERNAL* to that, to make sure we never emit it. */
1644 write_special_name_constructor (const tree ctor
)
1646 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1647 write_string ("C2");
1650 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
)
1651 /* Even though we don't ever emit a definition of
1652 the old-style destructor, we still have to
1653 consider entities (like static variables) nested
1655 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
));
1656 write_string ("C1");
1660 /* Handle destructor productions of non-terminal <special-name>.
1661 DTOR is a destructor FUNCTION_DECL.
1663 <special-name> ::= D0 # deleting (in-charge) destructor
1664 ::= D1 # complete object (in-charge) destructor
1665 ::= D2 # base object (not-in-charge) destructor
1667 We also need to provide mangled names for the maybe-incharge
1668 destructor, so we treat it here too. mangle_decl_string will
1669 append *INTERNAL* to that, to make sure we never emit it. */
1672 write_special_name_destructor (const tree dtor
)
1674 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1675 write_string ("D0");
1676 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1677 write_string ("D2");
1680 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
)
1681 /* Even though we don't ever emit a definition of
1682 the old-style destructor, we still have to
1683 consider entities (like static variables) nested
1685 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
));
1686 write_string ("D1");
1690 /* Scan the vector of local classes and return how many others with the
1691 same name (or same no name) and context precede ENTITY. */
1694 local_class_index (tree entity
)
1696 int ix
, discriminator
= 0;
1697 tree name
= (TYPE_ANONYMOUS_P (entity
) ? NULL_TREE
1698 : TYPE_IDENTIFIER (entity
));
1699 tree ctx
= TYPE_CONTEXT (entity
);
1700 for (ix
= 0; ; ix
++)
1702 tree type
= VEC_index (tree
, local_classes
, ix
);
1704 return discriminator
;
1705 if (TYPE_CONTEXT (type
) == ctx
1706 && (name
? TYPE_IDENTIFIER (type
) == name
1707 : TYPE_ANONYMOUS_P (type
)))
1713 /* Return the discriminator for ENTITY appearing inside
1714 FUNCTION. The discriminator is the lexical ordinal of VAR among
1715 entities with the same name in the same FUNCTION. */
1718 discriminator_for_local_entity (tree entity
)
1720 if (DECL_DISCRIMINATOR_P (entity
))
1722 if (DECL_DISCRIMINATOR_SET_P (entity
))
1723 return DECL_DISCRIMINATOR (entity
);
1725 /* The first entity with a particular name doesn't get
1726 DECL_DISCRIMINATOR set up. */
1729 else if (TREE_CODE (entity
) == TYPE_DECL
)
1731 /* Scan the list of local classes. */
1732 entity
= TREE_TYPE (entity
);
1734 /* Lambdas and unnamed types have their own discriminators. */
1735 if (LAMBDA_TYPE_P (entity
) || TYPE_ANONYMOUS_P (entity
))
1738 return local_class_index (entity
);
1744 /* Return the discriminator for STRING, a string literal used inside
1745 FUNCTION. The discriminator is the lexical ordinal of STRING among
1746 string literals used in FUNCTION. */
1749 discriminator_for_string_literal (tree
/*function*/,
1752 /* For now, we don't discriminate amongst string literals. */
1756 /* <discriminator> := _ <number>
1758 The discriminator is used only for the second and later occurrences
1759 of the same name within a single function. In this case <number> is
1760 n - 2, if this is the nth occurrence, in lexical order. */
1763 write_discriminator (const int discriminator
)
1765 /* If discriminator is zero, don't write anything. Otherwise... */
1766 if (discriminator
> 0)
1769 write_unsigned_number (discriminator
- 1);
1773 /* Mangle the name of a function-scope entity. FUNCTION is the
1774 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1775 default argument scope. ENTITY is the decl for the entity itself.
1776 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1777 either ENTITY itself or an enclosing scope of ENTITY.
1779 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1780 := Z <function encoding> E s [<discriminator>]
1781 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1784 write_local_name (tree function
, const tree local_entity
,
1787 tree parm
= NULL_TREE
;
1789 MANGLE_TRACE_TREE ("local-name", entity
);
1791 if (TREE_CODE (function
) == PARM_DECL
)
1794 function
= DECL_CONTEXT (parm
);
1798 write_encoding (function
);
1801 /* For this purpose, parameters are numbered from right-to-left. */
1806 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1814 write_compact_number (i
- 1);
1817 if (TREE_CODE (entity
) == STRING_CST
)
1820 write_discriminator (discriminator_for_string_literal (function
,
1825 /* Now the <entity name>. Let write_name know its being called
1826 from <local-name>, so it doesn't try to process the enclosing
1827 function scope again. */
1828 write_name (entity
, /*ignore_local_scope=*/1);
1829 write_discriminator (discriminator_for_local_entity (local_entity
));
1833 /* Non-terminals <type> and <CV-qualifier>.
1835 <type> ::= <builtin-type>
1837 ::= <class-enum-type>
1839 ::= <pointer-to-member-type>
1840 ::= <template-param>
1843 ::= P <type> # pointer-to
1844 ::= R <type> # reference-to
1845 ::= C <type> # complex pair (C 2000)
1846 ::= G <type> # imaginary (C 2000) [not supported]
1847 ::= U <source-name> <type> # vendor extended type qualifier
1851 <type> ::= RR <type> # rvalue reference-to
1852 <type> ::= Dt <expression> # decltype of an id-expression or
1853 # class member access
1854 <type> ::= DT <expression> # decltype of an expression
1855 <type> ::= Dn # decltype of nullptr
1857 TYPE is a type node. */
1860 write_type (tree type
)
1862 /* This gets set to nonzero if TYPE turns out to be a (possibly
1863 CV-qualified) builtin type. */
1864 int is_builtin_type
= 0;
1866 MANGLE_TRACE_TREE ("type", type
);
1868 if (type
== error_mark_node
)
1871 type
= canonicalize_for_substitution (type
);
1872 if (find_substitution (type
))
1876 if (write_CV_qualifiers_for_type (type
) > 0)
1877 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1878 mangle the unqualified type. The recursive call is needed here
1879 since both the qualified and unqualified types are substitution
1881 write_type (TYPE_MAIN_VARIANT (type
));
1882 else if (TREE_CODE (type
) == ARRAY_TYPE
)
1883 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1884 so that the cv-qualification of the element type is available
1885 in write_array_type. */
1886 write_array_type (type
);
1889 tree type_orig
= type
;
1891 /* See through any typedefs. */
1892 type
= TYPE_MAIN_VARIANT (type
);
1894 /* According to the C++ ABI, some library classes are passed the
1895 same as the scalar type of their single member and use the same
1897 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
1898 type
= TREE_TYPE (first_field (type
));
1900 if (TYPE_PTRDATAMEM_P (type
))
1901 write_pointer_to_member_type (type
);
1904 /* Handle any target-specific fundamental types. */
1905 const char *target_mangling
1906 = targetm
.mangle_type (type_orig
);
1908 if (target_mangling
)
1910 write_string (target_mangling
);
1911 /* Add substitutions for types other than fundamental
1913 if (TREE_CODE (type
) != VOID_TYPE
1914 && TREE_CODE (type
) != INTEGER_TYPE
1915 && TREE_CODE (type
) != REAL_TYPE
1916 && TREE_CODE (type
) != BOOLEAN_TYPE
)
1917 add_substitution (type
);
1921 switch (TREE_CODE (type
))
1925 case INTEGER_TYPE
: /* Includes wchar_t. */
1927 case FIXED_POINT_TYPE
:
1929 /* If this is a typedef, TYPE may not be one of
1930 the standard builtin type nodes, but an alias of one. Use
1931 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1932 write_builtin_type (TYPE_MAIN_VARIANT (type
));
1939 write_type (TREE_TYPE (type
));
1944 write_function_type (type
);
1950 /* A pointer-to-member function is represented as a special
1951 RECORD_TYPE, so check for this first. */
1952 if (TYPE_PTRMEMFUNC_P (type
))
1953 write_pointer_to_member_type (type
);
1955 write_class_enum_type (type
);
1959 case UNBOUND_CLASS_TEMPLATE
:
1960 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1961 ordinary nested names. */
1962 write_nested_name (TYPE_STUB_DECL (type
));
1966 case REFERENCE_TYPE
:
1967 if (TREE_CODE (type
) == POINTER_TYPE
)
1969 else if (TYPE_REF_IS_RVALUE (type
))
1974 tree target
= TREE_TYPE (type
);
1975 /* Attribute const/noreturn are not reflected in mangling.
1976 We strip them here rather than at a lower level because
1977 a typedef or template argument can have function type
1978 with function-cv-quals (that use the same representation),
1979 but you can't have a pointer/reference to such a type. */
1980 if (abi_version_at_least (5)
1981 && TREE_CODE (target
) == FUNCTION_TYPE
)
1982 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
1983 write_type (target
);
1987 case TEMPLATE_TYPE_PARM
:
1990 write_identifier ("Da");
1994 /* else fall through. */
1995 case TEMPLATE_PARM_INDEX
:
1996 write_template_param (type
);
1999 case TEMPLATE_TEMPLATE_PARM
:
2000 write_template_template_param (type
);
2003 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2004 write_template_template_param (type
);
2006 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
2010 if (abi_version_at_least (4))
2012 write_string ("Dv");
2013 /* Non-constant vector size would be encoded with
2014 _ expression, but we don't support that yet. */
2015 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
2020 G
.need_abi_warning
= 1;
2021 write_string ("U8__vector");
2023 write_type (TREE_TYPE (type
));
2026 case TYPE_PACK_EXPANSION
:
2027 write_string ("Dp");
2028 write_type (PACK_EXPANSION_PATTERN (type
));
2032 /* These shouldn't make it into mangling. */
2033 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
2034 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
2036 /* In ABI <5, we stripped decltype of a plain decl. */
2037 if (!abi_version_at_least (5)
2038 && DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2040 tree expr
= DECLTYPE_TYPE_EXPR (type
);
2041 tree etype
= NULL_TREE
;
2042 switch (TREE_CODE (expr
))
2049 case TEMPLATE_PARM_INDEX
:
2050 etype
= TREE_TYPE (expr
);
2057 if (etype
&& !type_uses_auto (etype
))
2059 G
.need_abi_warning
= 1;
2066 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2070 ++cp_unevaluated_operand
;
2071 write_expression (DECLTYPE_TYPE_EXPR (type
));
2072 --cp_unevaluated_operand
;
2077 write_string ("Dn");
2078 if (abi_version_at_least (7))
2083 sorry ("mangling typeof, use decltype instead");
2086 case UNDERLYING_TYPE
:
2087 sorry ("mangling __underlying_type");
2099 /* Types other than builtin types are substitution candidates. */
2100 if (!is_builtin_type
)
2101 add_substitution (type
);
2104 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2105 CV-qualifiers written for TYPE.
2107 <CV-qualifiers> ::= [r] [V] [K] */
2110 write_CV_qualifiers_for_type (const tree type
)
2112 int num_qualifiers
= 0;
2114 /* The order is specified by:
2116 "In cases where multiple order-insensitive qualifiers are
2117 present, they should be ordered 'K' (closest to the base type),
2118 'V', 'r', and 'U' (farthest from the base type) ..."
2120 Note that we do not use cp_type_quals below; given "const
2121 int[3]", the "const" is emitted with the "int", not with the
2123 cp_cv_quals quals
= TYPE_QUALS (type
);
2125 if (quals
& TYPE_QUAL_RESTRICT
)
2130 if (quals
& TYPE_QUAL_VOLATILE
)
2135 if (quals
& TYPE_QUAL_CONST
)
2141 return num_qualifiers
;
2144 /* Non-terminal <builtin-type>.
2146 <builtin-type> ::= v # void
2151 ::= h # unsigned char
2153 ::= t # unsigned short
2155 ::= j # unsigned int
2157 ::= m # unsigned long
2158 ::= x # long long, __int64
2159 ::= y # unsigned long long, __int64
2161 ::= o # unsigned __int128
2164 ::= e # long double, __float80
2165 ::= g # __float128 [not supported]
2166 ::= u <source-name> # vendor extended type */
2169 write_builtin_type (tree type
)
2171 if (TYPE_CANONICAL (type
))
2172 type
= TYPE_CANONICAL (type
);
2174 switch (TREE_CODE (type
))
2185 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2186 isn't in integer_type_nodes. */
2187 if (type
== wchar_type_node
)
2189 else if (type
== char16_type_node
)
2190 write_string ("Ds");
2191 else if (type
== char32_type_node
)
2192 write_string ("Di");
2193 else if (TYPE_FOR_JAVA (type
))
2194 write_java_integer_type_codes (type
);
2198 /* Assume TYPE is one of the shared integer type nodes. Find
2199 it in the array of these nodes. */
2201 for (itk
= 0; itk
< itk_none
; ++itk
)
2202 if (integer_types
[itk
] != NULL_TREE
2203 && type
== integer_types
[itk
])
2205 /* Print the corresponding single-letter code. */
2206 write_char (integer_type_codes
[itk
]);
2210 if (itk
== itk_none
)
2212 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2213 TYPE_UNSIGNED (type
));
2220 if (TYPE_PRECISION (type
) == 128)
2221 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2224 /* Allow for cases where TYPE is not one of the shared
2225 integer type nodes and write a "vendor extended builtin
2226 type" with a name the form intN or uintN, respectively.
2227 Situations like this can happen if you have an
2228 __attribute__((__mode__(__SI__))) type and use exotic
2229 switches like '-mint8' on AVR. Of course, this is
2230 undefined by the C++ ABI (and '-mint8' is not even
2231 Standard C conforming), but when using such special
2232 options you're pretty much in nowhere land anyway. */
2234 char prec
[11]; /* up to ten digits for an unsigned */
2236 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2237 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2238 write_char ('u'); /* "vendor extended builtin type" */
2239 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2240 write_string (prefix
);
2241 write_string (prec
);
2248 if (type
== float_type_node
2249 || type
== java_float_type_node
)
2251 else if (type
== double_type_node
2252 || type
== java_double_type_node
)
2254 else if (type
== long_double_type_node
)
2256 else if (type
== dfloat32_type_node
)
2257 write_string ("Df");
2258 else if (type
== dfloat64_type_node
)
2259 write_string ("Dd");
2260 else if (type
== dfloat128_type_node
)
2261 write_string ("De");
2266 case FIXED_POINT_TYPE
:
2267 write_string ("DF");
2268 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2269 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2270 if (type
== fract_type_node
2271 || type
== sat_fract_type_node
2272 || type
== accum_type_node
2273 || type
== sat_accum_type_node
)
2275 else if (type
== unsigned_fract_type_node
2276 || type
== sat_unsigned_fract_type_node
2277 || type
== unsigned_accum_type_node
2278 || type
== sat_unsigned_accum_type_node
)
2280 else if (type
== short_fract_type_node
2281 || type
== sat_short_fract_type_node
2282 || type
== short_accum_type_node
2283 || type
== sat_short_accum_type_node
)
2285 else if (type
== unsigned_short_fract_type_node
2286 || type
== sat_unsigned_short_fract_type_node
2287 || type
== unsigned_short_accum_type_node
2288 || type
== sat_unsigned_short_accum_type_node
)
2290 else if (type
== long_fract_type_node
2291 || type
== sat_long_fract_type_node
2292 || type
== long_accum_type_node
2293 || type
== sat_long_accum_type_node
)
2295 else if (type
== unsigned_long_fract_type_node
2296 || type
== sat_unsigned_long_fract_type_node
2297 || type
== unsigned_long_accum_type_node
2298 || type
== sat_unsigned_long_accum_type_node
)
2300 else if (type
== long_long_fract_type_node
2301 || type
== sat_long_long_fract_type_node
2302 || type
== long_long_accum_type_node
2303 || type
== sat_long_long_accum_type_node
)
2305 else if (type
== unsigned_long_long_fract_type_node
2306 || type
== sat_unsigned_long_long_fract_type_node
2307 || type
== unsigned_long_long_accum_type_node
2308 || type
== sat_unsigned_long_long_accum_type_node
)
2311 sorry ("mangling unknown fixed point type");
2312 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2313 if (TYPE_SATURATING (type
))
2324 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2325 METHOD_TYPE. The return type is mangled before the parameter
2328 <function-type> ::= F [Y] <bare-function-type> E */
2331 write_function_type (const tree type
)
2333 MANGLE_TRACE_TREE ("function-type", type
);
2335 /* For a pointer to member function, the function type may have
2336 cv-qualifiers, indicating the quals for the artificial 'this'
2338 if (TREE_CODE (type
) == METHOD_TYPE
)
2340 /* The first parameter must be a POINTER_TYPE pointing to the
2341 `this' parameter. */
2342 tree this_type
= class_of_this_parm (type
);
2343 write_CV_qualifiers_for_type (this_type
);
2347 /* We don't track whether or not a type is `extern "C"'. Note that
2348 you can have an `extern "C"' function that does not have
2349 `extern "C"' type, and vice versa:
2351 extern "C" typedef void function_t();
2352 function_t f; // f has C++ linkage, but its type is
2355 typedef void function_t();
2356 extern "C" function_t f; // Vice versa.
2359 write_bare_function_type (type
, /*include_return_type_p=*/1,
2364 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2365 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2366 is mangled before the parameter types. If non-NULL, DECL is
2367 FUNCTION_DECL for the function whose type is being emitted.
2369 If DECL is a member of a Java type, then a literal 'J'
2370 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2373 <bare-function-type> ::= [J]</signature/ type>+ */
2376 write_bare_function_type (const tree type
, const int include_return_type_p
,
2381 MANGLE_TRACE_TREE ("bare-function-type", type
);
2383 /* Detect Java methods and emit special encoding. */
2385 && DECL_FUNCTION_MEMBER_P (decl
)
2386 && TYPE_FOR_JAVA (DECL_CONTEXT (decl
))
2387 && !DECL_CONSTRUCTOR_P (decl
)
2388 && !DECL_DESTRUCTOR_P (decl
)
2389 && !DECL_CONV_FN_P (decl
))
2399 /* Mangle the return type, if requested. */
2400 if (include_return_type_p
|| java_method_p
)
2401 write_type (TREE_TYPE (type
));
2403 /* Now mangle the types of the arguments. */
2405 write_method_parms (TYPE_ARG_TYPES (type
),
2406 TREE_CODE (type
) == METHOD_TYPE
,
2411 /* Write the mangled representation of a method parameter list of
2412 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2413 considered a non-static method, and the this parameter is omitted.
2414 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2415 parameters are being emitted. */
2418 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2420 tree first_parm_type
;
2421 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2423 /* Assume this parameter type list is variable-length. If it ends
2424 with a void type, then it's not. */
2427 /* If this is a member function, skip the first arg, which is the
2429 "Member functions do not encode the type of their implicit this
2432 Similarly, there's no need to mangle artificial parameters, like
2433 the VTT parameters for constructors and destructors. */
2436 parm_types
= TREE_CHAIN (parm_types
);
2437 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2439 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2441 parm_types
= TREE_CHAIN (parm_types
);
2442 parm_decl
= DECL_CHAIN (parm_decl
);
2446 for (first_parm_type
= parm_types
;
2448 parm_types
= TREE_CHAIN (parm_types
))
2450 tree parm
= TREE_VALUE (parm_types
);
2451 if (parm
== void_type_node
)
2453 /* "Empty parameter lists, whether declared as () or
2454 conventionally as (void), are encoded with a void parameter
2456 if (parm_types
== first_parm_type
)
2458 /* If the parm list is terminated with a void type, it's
2461 /* A void type better be the last one. */
2462 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2469 /* <builtin-type> ::= z # ellipsis */
2473 /* <class-enum-type> ::= <name> */
2476 write_class_enum_type (const tree type
)
2478 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2481 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2484 <template-args> ::= I <template-arg>* E */
2487 write_template_args (tree args
)
2492 MANGLE_TRACE_TREE ("template-args", args
);
2497 length
= TREE_VEC_LENGTH (args
);
2499 if (args
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2501 /* We have nested template args. We want the innermost template
2503 args
= TREE_VEC_ELT (args
, length
- 1);
2504 length
= TREE_VEC_LENGTH (args
);
2506 for (i
= 0; i
< length
; ++i
)
2507 write_template_arg (TREE_VEC_ELT (args
, i
));
2514 <unqualified-name> <template-args>
2515 part of SCOPE_REF or COMPONENT_REF mangling. */
2518 write_member_name (tree member
)
2520 if (TREE_CODE (member
) == IDENTIFIER_NODE
)
2521 write_unqualified_id (member
);
2522 else if (DECL_P (member
))
2523 write_unqualified_name (member
);
2524 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2526 tree name
= TREE_OPERAND (member
, 0);
2527 if (TREE_CODE (name
) == OVERLOAD
)
2528 name
= OVL_FUNCTION (name
);
2529 write_member_name (name
);
2530 write_template_args (TREE_OPERAND (member
, 1));
2533 write_expression (member
);
2536 /* <expression> ::= <unary operator-name> <expression>
2537 ::= <binary operator-name> <expression> <expression>
2540 <expr-primary> ::= <template-param>
2541 ::= L <type> <value number> E # literal
2542 ::= L <mangled-name> E # external name
2543 ::= st <type> # sizeof
2544 ::= sr <type> <unqualified-name> # dependent name
2545 ::= sr <type> <unqualified-name> <template-args> */
2548 write_expression (tree expr
)
2550 enum tree_code code
= TREE_CODE (expr
);
2552 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2553 is converted (via qualification conversions) to another
2555 while (TREE_CODE (expr
) == NOP_EXPR
2556 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2558 expr
= TREE_OPERAND (expr
, 0);
2559 code
= TREE_CODE (expr
);
2562 if (code
== BASELINK
2563 && (!type_unknown_p (expr
)
2564 || !BASELINK_QUALIFIED_P (expr
)))
2566 expr
= BASELINK_FUNCTIONS (expr
);
2567 code
= TREE_CODE (expr
);
2570 /* Handle pointers-to-members by making them look like expression
2572 if (code
== PTRMEM_CST
)
2574 expr
= build_nt (ADDR_EXPR
,
2575 build_qualified_name (/*type=*/NULL_TREE
,
2576 PTRMEM_CST_CLASS (expr
),
2577 PTRMEM_CST_MEMBER (expr
),
2578 /*template_p=*/false));
2579 code
= TREE_CODE (expr
);
2582 /* Handle template parameters. */
2583 if (code
== TEMPLATE_TYPE_PARM
2584 || code
== TEMPLATE_TEMPLATE_PARM
2585 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2586 || code
== TEMPLATE_PARM_INDEX
)
2587 write_template_param (expr
);
2588 /* Handle literals. */
2589 else if (TREE_CODE_CLASS (code
) == tcc_constant
2590 || (abi_version_at_least (2) && code
== CONST_DECL
))
2591 write_template_arg_literal (expr
);
2592 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2594 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr
))));
2595 write_string ("fpT");
2597 else if (code
== PARM_DECL
)
2599 /* A function parameter used in a late-specified return type. */
2600 int index
= DECL_PARM_INDEX (expr
);
2601 int level
= DECL_PARM_LEVEL (expr
);
2602 int delta
= G
.parm_depth
- level
+ 1;
2603 gcc_assert (index
>= 1);
2607 if (abi_version_at_least (5))
2609 /* Let L be the number of function prototype scopes from the
2610 innermost one (in which the parameter reference occurs) up
2611 to (and including) the one containing the declaration of
2612 the referenced parameter. If the parameter declaration
2613 clause of the innermost function prototype scope has been
2614 completely seen, it is not counted (in that case -- which
2615 is perhaps the most common -- L can be zero). */
2617 write_unsigned_number (delta
- 1);
2620 G
.need_abi_warning
= true;
2623 write_compact_number (index
- 1);
2625 else if (DECL_P (expr
))
2627 /* G++ 3.2 incorrectly mangled non-type template arguments of
2628 enumeration type using their names. */
2629 if (code
== CONST_DECL
)
2630 G
.need_abi_warning
= 1;
2632 write_mangled_name (expr
, false);
2635 else if (TREE_CODE (expr
) == SIZEOF_EXPR
2636 && SIZEOF_EXPR_TYPE_P (expr
))
2638 write_string ("st");
2639 write_type (TREE_TYPE (TREE_OPERAND (expr
, 0)));
2641 else if (TREE_CODE (expr
) == SIZEOF_EXPR
2642 && TYPE_P (TREE_OPERAND (expr
, 0)))
2644 write_string ("st");
2645 write_type (TREE_OPERAND (expr
, 0));
2647 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2648 && TYPE_P (TREE_OPERAND (expr
, 0)))
2650 write_string ("at");
2651 write_type (TREE_OPERAND (expr
, 0));
2653 else if (code
== SCOPE_REF
2654 || code
== BASELINK
)
2657 if (code
== SCOPE_REF
)
2659 scope
= TREE_OPERAND (expr
, 0);
2660 member
= TREE_OPERAND (expr
, 1);
2664 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
2665 member
= BASELINK_FUNCTIONS (expr
);
2668 if (!abi_version_at_least (2) && DECL_P (member
))
2670 write_string ("sr");
2672 /* G++ 3.2 incorrectly put out both the "sr" code and
2673 the nested name of the qualified name. */
2674 G
.need_abi_warning
= 1;
2675 write_encoding (member
);
2678 /* If the MEMBER is a real declaration, then the qualifying
2679 scope was not dependent. Ideally, we would not have a
2680 SCOPE_REF in those cases, but sometimes we do. If the second
2681 argument is a DECL, then the name must not have been
2683 else if (DECL_P (member
))
2684 write_expression (member
);
2687 write_string ("sr");
2689 write_member_name (member
);
2692 else if (TREE_CODE (expr
) == INDIRECT_REF
2693 && TREE_TYPE (TREE_OPERAND (expr
, 0))
2694 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2696 write_expression (TREE_OPERAND (expr
, 0));
2698 else if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
2700 /* An operator name appearing as a dependent name needs to be
2701 specially marked to disambiguate between a use of the operator
2702 name and a use of the operator in an expression. */
2703 if (IDENTIFIER_OPNAME_P (expr
))
2704 write_string ("on");
2705 write_unqualified_id (expr
);
2707 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
2709 tree fn
= TREE_OPERAND (expr
, 0);
2710 if (is_overloaded_fn (fn
))
2711 fn
= DECL_NAME (get_first_fn (fn
));
2712 if (IDENTIFIER_OPNAME_P (fn
))
2713 write_string ("on");
2714 write_unqualified_id (fn
);
2715 write_template_args (TREE_OPERAND (expr
, 1));
2717 else if (TREE_CODE (expr
) == MODOP_EXPR
)
2719 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
2720 const char *name
= (assignment_operator_name_info
[(int) subop
]
2722 write_string (name
);
2723 write_expression (TREE_OPERAND (expr
, 0));
2724 write_expression (TREE_OPERAND (expr
, 2));
2726 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
2728 /* ::= [gs] nw <expression>* _ <type> E
2729 ::= [gs] nw <expression>* _ <type> <initializer>
2730 ::= [gs] na <expression>* _ <type> E
2731 ::= [gs] na <expression>* _ <type> <initializer>
2732 <initializer> ::= pi <expression>* E */
2733 tree placement
= TREE_OPERAND (expr
, 0);
2734 tree type
= TREE_OPERAND (expr
, 1);
2735 tree nelts
= TREE_OPERAND (expr
, 2);
2736 tree init
= TREE_OPERAND (expr
, 3);
2739 gcc_assert (code
== NEW_EXPR
);
2740 if (TREE_OPERAND (expr
, 2))
2741 code
= VEC_NEW_EXPR
;
2743 if (NEW_EXPR_USE_GLOBAL (expr
))
2744 write_string ("gs");
2746 write_string (operator_name_info
[(int) code
].mangled_name
);
2748 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
2749 write_expression (TREE_VALUE (t
));
2756 ++processing_template_decl
;
2757 domain
= compute_array_index_type (NULL_TREE
, nelts
,
2758 tf_warning_or_error
);
2759 type
= build_cplus_array_type (type
, domain
);
2760 --processing_template_decl
;
2764 if (init
&& TREE_CODE (init
) == TREE_LIST
2765 && TREE_CODE (TREE_VALUE (init
)) == CONSTRUCTOR
2766 && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init
)))
2767 write_expression (TREE_VALUE (init
));
2771 write_string ("pi");
2772 if (init
&& init
!= void_zero_node
)
2773 for (t
= init
; t
; t
= TREE_CHAIN (t
))
2774 write_expression (TREE_VALUE (t
));
2778 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
2780 gcc_assert (code
== DELETE_EXPR
);
2781 if (DELETE_EXPR_USE_VEC (expr
))
2782 code
= VEC_DELETE_EXPR
;
2784 if (DELETE_EXPR_USE_GLOBAL (expr
))
2785 write_string ("gs");
2787 write_string (operator_name_info
[(int) code
].mangled_name
);
2789 write_expression (TREE_OPERAND (expr
, 0));
2791 else if (code
== THROW_EXPR
)
2793 tree op
= TREE_OPERAND (expr
, 0);
2796 write_string ("tw");
2797 write_expression (op
);
2800 write_string ("tr");
2802 else if (code
== CONSTRUCTOR
)
2804 VEC(constructor_elt
,gc
)* elts
= CONSTRUCTOR_ELTS (expr
);
2805 unsigned i
; tree val
;
2807 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
2808 write_string ("il");
2811 write_string ("tl");
2812 write_type (TREE_TYPE (expr
));
2814 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
2815 write_expression (val
);
2818 else if (dependent_name (expr
))
2820 write_unqualified_id (dependent_name (expr
));
2827 /* When we bind a variable or function to a non-type template
2828 argument with reference type, we create an ADDR_EXPR to show
2829 the fact that the entity's address has been taken. But, we
2830 don't actually want to output a mangling code for the `&'. */
2831 if (TREE_CODE (expr
) == ADDR_EXPR
2833 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
2835 expr
= TREE_OPERAND (expr
, 0);
2838 write_expression (expr
);
2842 code
= TREE_CODE (expr
);
2845 if (code
== COMPONENT_REF
)
2847 tree ob
= TREE_OPERAND (expr
, 0);
2849 if (TREE_CODE (ob
) == ARROW_EXPR
)
2851 write_string (operator_name_info
[(int)code
].mangled_name
);
2852 ob
= TREE_OPERAND (ob
, 0);
2855 write_string ("dt");
2857 write_expression (ob
);
2858 write_member_name (TREE_OPERAND (expr
, 1));
2862 /* If it wasn't any of those, recursively expand the expression. */
2863 name
= operator_name_info
[(int) code
].mangled_name
;
2865 /* We used to mangle const_cast and static_cast like a C cast. */
2866 if (!abi_version_at_least (6)
2867 && (code
== CONST_CAST_EXPR
2868 || code
== STATIC_CAST_EXPR
))
2870 name
= operator_name_info
[CAST_EXPR
].mangled_name
;
2871 G
.need_abi_warning
= 1;
2879 error ("use of built-in trait %qE in function signature; "
2880 "use library traits instead", expr
);
2884 sorry ("mangling %C", code
);
2890 write_string (name
);
2896 tree fn
= CALL_EXPR_FN (expr
);
2898 if (TREE_CODE (fn
) == ADDR_EXPR
)
2899 fn
= TREE_OPERAND (fn
, 0);
2901 /* Mangle a dependent name as the name, not whatever happens to
2902 be the first function in the overload set. */
2903 if ((TREE_CODE (fn
) == FUNCTION_DECL
2904 || TREE_CODE (fn
) == OVERLOAD
)
2905 && type_dependent_expression_p_push (expr
))
2906 fn
= DECL_NAME (get_first_fn (fn
));
2908 write_expression (fn
);
2911 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
2912 write_expression (CALL_EXPR_ARG (expr
, i
));
2917 write_type (TREE_TYPE (expr
));
2918 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
2919 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
2922 tree args
= TREE_OPERAND (expr
, 0);
2924 for (; args
; args
= TREE_CHAIN (args
))
2925 write_expression (TREE_VALUE (args
));
2930 case DYNAMIC_CAST_EXPR
:
2931 case REINTERPRET_CAST_EXPR
:
2932 case STATIC_CAST_EXPR
:
2933 case CONST_CAST_EXPR
:
2934 write_type (TREE_TYPE (expr
));
2935 write_expression (TREE_OPERAND (expr
, 0));
2938 case PREINCREMENT_EXPR
:
2939 case PREDECREMENT_EXPR
:
2940 if (abi_version_at_least (6))
2943 G
.need_abi_warning
= 1;
2947 /* In the middle-end, some expressions have more operands than
2948 they do in templates (and mangling). */
2949 len
= cp_tree_operand_length (expr
);
2951 for (i
= 0; i
< len
; ++i
)
2953 tree operand
= TREE_OPERAND (expr
, i
);
2954 /* As a GNU extension, the middle operand of a
2955 conditional may be omitted. Since expression
2956 manglings are supposed to represent the input token
2957 stream, there's no good way to mangle such an
2958 expression without extending the C++ ABI. */
2959 if (code
== COND_EXPR
&& i
== 1 && !operand
)
2961 error ("omitted middle operand to %<?:%> operand "
2962 "cannot be mangled");
2965 write_expression (operand
);
2971 /* Literal subcase of non-terminal <template-arg>.
2973 "Literal arguments, e.g. "A<42L>", are encoded with their type
2974 and value. Negative integer values are preceded with "n"; for
2975 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2976 encoded as 0, true as 1." */
2979 write_template_arg_literal (const tree value
)
2982 write_type (TREE_TYPE (value
));
2984 /* Write a null member pointer value as (type)0, regardless of its
2985 real representation. */
2986 if (null_member_pointer_value_p (value
))
2987 write_integer_cst (integer_zero_node
);
2989 switch (TREE_CODE (value
))
2992 write_integer_cst (DECL_INITIAL (value
));
2996 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
2997 || integer_zerop (value
) || integer_onep (value
));
2998 write_integer_cst (value
);
3002 write_real_cst (value
);
3006 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
3007 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
3009 write_integer_cst (TREE_REALPART (value
));
3011 write_integer_cst (TREE_IMAGPART (value
));
3013 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
3014 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
3016 write_real_cst (TREE_REALPART (value
));
3018 write_real_cst (TREE_IMAGPART (value
));
3025 sorry ("string literal in function template signature");
3035 /* Non-terminal <template-arg>.
3037 <template-arg> ::= <type> # type
3038 ::= L <type> </value/ number> E # literal
3039 ::= LZ <name> E # external name
3040 ::= X <expression> E # expression */
3043 write_template_arg (tree node
)
3045 enum tree_code code
= TREE_CODE (node
);
3047 MANGLE_TRACE_TREE ("template-arg", node
);
3049 /* A template template parameter's argument list contains TREE_LIST
3050 nodes of which the value field is the actual argument. */
3051 if (code
== TREE_LIST
)
3053 node
= TREE_VALUE (node
);
3054 /* If it's a decl, deal with its type instead. */
3057 node
= TREE_TYPE (node
);
3058 code
= TREE_CODE (node
);
3062 if (TREE_CODE (node
) == NOP_EXPR
3063 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3065 /* Template parameters can be of reference type. To maintain
3066 internal consistency, such arguments use a conversion from
3067 address of object to reference type. */
3068 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3069 if (abi_version_at_least (2))
3070 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3072 G
.need_abi_warning
= 1;
3075 if (TREE_CODE (node
) == BASELINK
3076 && !type_unknown_p (node
))
3078 if (abi_version_at_least (6))
3079 node
= BASELINK_FUNCTIONS (node
);
3081 /* We wrongly wrapped a class-scope function in X/E. */
3082 G
.need_abi_warning
= 1;
3085 if (ARGUMENT_PACK_P (node
))
3087 /* Expand the template argument pack. */
3088 tree args
= ARGUMENT_PACK_ARGS (node
);
3089 int i
, length
= TREE_VEC_LENGTH (args
);
3090 if (abi_version_at_least (6))
3095 G
.need_abi_warning
= 1;
3097 for (i
= 0; i
< length
; ++i
)
3098 write_template_arg (TREE_VEC_ELT (args
, i
));
3101 else if (TYPE_P (node
))
3103 else if (code
== TEMPLATE_DECL
)
3104 /* A template appearing as a template arg is a template template arg. */
3105 write_template_template_arg (node
);
3106 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3107 || (abi_version_at_least (2) && code
== CONST_DECL
)
3108 || null_member_pointer_value_p (node
))
3109 write_template_arg_literal (node
);
3110 else if (DECL_P (node
))
3112 /* Until ABI version 2, non-type template arguments of
3113 enumeration type were mangled using their names. */
3114 if (code
== CONST_DECL
&& !abi_version_at_least (2))
3115 G
.need_abi_warning
= 1;
3117 /* Until ABI version 3, the underscore before the mangled name
3118 was incorrectly omitted. */
3119 if (!abi_version_at_least (3))
3121 G
.need_abi_warning
= 1;
3125 write_string ("_Z");
3126 write_encoding (node
);
3131 /* Template arguments may be expressions. */
3133 write_expression (node
);
3138 /* <template-template-arg>
3140 ::= <substitution> */
3143 write_template_template_arg (const tree decl
)
3145 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3147 if (find_substitution (decl
))
3149 write_name (decl
, /*ignore_local_scope=*/0);
3150 add_substitution (decl
);
3154 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3156 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3157 ::= A <expression> _ </element/ type>
3159 "Array types encode the dimension (number of elements) and the
3160 element type. For variable length arrays, the dimension (but not
3161 the '_' separator) is omitted." */
3164 write_array_type (const tree type
)
3167 if (TYPE_DOMAIN (type
))
3172 index_type
= TYPE_DOMAIN (type
);
3173 /* The INDEX_TYPE gives the upper and lower bounds of the
3175 max
= TYPE_MAX_VALUE (index_type
);
3176 if (TREE_CODE (max
) == INTEGER_CST
)
3178 /* The ABI specifies that we should mangle the number of
3179 elements in the array, not the largest allowed index. */
3180 double_int dmax
= tree_to_double_int (max
) + double_int_one
;
3181 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3182 number of elements as zero. */
3183 dmax
= dmax
.zext (TYPE_PRECISION (TREE_TYPE (max
)));
3184 gcc_assert (dmax
.fits_uhwi ());
3185 write_unsigned_number (dmax
.low
);
3189 max
= TREE_OPERAND (max
, 0);
3190 if (!abi_version_at_least (2))
3192 /* value_dependent_expression_p presumes nothing is
3193 dependent when PROCESSING_TEMPLATE_DECL is zero. */
3194 ++processing_template_decl
;
3195 if (!value_dependent_expression_p (max
))
3196 G
.need_abi_warning
= 1;
3197 --processing_template_decl
;
3199 write_expression (max
);
3204 write_type (TREE_TYPE (type
));
3207 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3208 variables. TYPE is a pointer-to-member POINTER_TYPE.
3210 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3213 write_pointer_to_member_type (const tree type
)
3216 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3217 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3220 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3221 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3222 TEMPLATE_PARM_INDEX.
3224 <template-param> ::= T </parameter/ number> _ */
3227 write_template_param (const tree parm
)
3231 MANGLE_TRACE_TREE ("template-parm", parm
);
3233 switch (TREE_CODE (parm
))
3235 case TEMPLATE_TYPE_PARM
:
3236 case TEMPLATE_TEMPLATE_PARM
:
3237 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3238 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3241 case TEMPLATE_PARM_INDEX
:
3242 parm_index
= TEMPLATE_PARM_IDX (parm
);
3250 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3251 earliest template param denoted by `_'. */
3252 write_compact_number (parm_index
);
3255 /* <template-template-param>
3256 ::= <template-param>
3257 ::= <substitution> */
3260 write_template_template_param (const tree parm
)
3262 tree templ
= NULL_TREE
;
3264 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3265 template template parameter. The substitution candidate here is
3266 only the template. */
3267 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3270 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3271 if (find_substitution (templ
))
3275 /* <template-param> encodes only the template parameter position,
3276 not its template arguments, which is fine here. */
3277 write_template_param (parm
);
3279 add_substitution (templ
);
3282 /* Non-terminal <substitution>.
3284 <substitution> ::= S <seq-id> _
3288 write_substitution (const int seq_id
)
3290 MANGLE_TRACE ("substitution", "");
3294 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3298 /* Start mangling ENTITY. */
3301 start_mangling (const tree entity
)
3304 G
.need_abi_warning
= false;
3305 obstack_free (&name_obstack
, name_base
);
3306 mangle_obstack
= &name_obstack
;
3307 name_base
= obstack_alloc (&name_obstack
, 0);
3310 /* Done with mangling. If WARN is true, and the name of G.entity will
3311 be mangled differently in a future version of the ABI, issue a
3315 finish_mangling_internal (const bool warn
)
3317 if (warn_abi
&& warn
&& G
.need_abi_warning
)
3318 warning (OPT_Wabi
, "the mangled name of %qD will change in a future "
3322 /* Clear all the substitutions. */
3323 VEC_truncate (tree
, G
.substitutions
, 0);
3325 /* Null-terminate the string. */
3330 /* Like finish_mangling_internal, but return the mangled string. */
3332 static inline const char *
3333 finish_mangling (const bool warn
)
3335 finish_mangling_internal (warn
);
3336 return (const char *) obstack_finish (mangle_obstack
);
3339 /* Like finish_mangling_internal, but return an identifier. */
3342 finish_mangling_get_identifier (const bool warn
)
3344 finish_mangling_internal (warn
);
3345 /* Don't obstack_finish here, and the next start_mangling will
3346 remove the identifier. */
3347 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3350 /* Initialize data structures for mangling. */
3355 gcc_obstack_init (&name_obstack
);
3356 name_base
= obstack_alloc (&name_obstack
, 0);
3357 G
.substitutions
= NULL
;
3359 /* Cache these identifiers for quick comparison when checking for
3360 standard substitutions. */
3361 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3362 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3363 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3364 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3365 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3366 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3369 /* Generate the mangled name of DECL. */
3372 mangle_decl_string (const tree decl
)
3375 location_t saved_loc
= input_location
;
3376 tree saved_fn
= NULL_TREE
;
3377 bool template_p
= false;
3379 /* We shouldn't be trying to mangle an uninstantiated template. */
3380 gcc_assert (!type_dependent_expression_p (decl
));
3382 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3384 struct tinst_level
*tl
= current_instantiation ();
3385 if ((!tl
|| tl
->decl
!= decl
)
3386 && push_tinst_level (decl
))
3389 saved_fn
= current_function_decl
;
3390 current_function_decl
= NULL_TREE
;
3393 input_location
= DECL_SOURCE_LOCATION (decl
);
3395 start_mangling (decl
);
3397 if (TREE_CODE (decl
) == TYPE_DECL
)
3398 write_type (TREE_TYPE (decl
));
3400 write_mangled_name (decl
, true);
3402 result
= finish_mangling_get_identifier (/*warn=*/true);
3404 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3405 IDENTIFIER_POINTER (result
));
3410 current_function_decl
= saved_fn
;
3412 input_location
= saved_loc
;
3417 /* Return an identifier for the external mangled name of DECL. */
3420 get_mangled_id (tree decl
)
3422 tree id
= mangle_decl_string (decl
);
3423 return targetm
.mangle_decl_assembler_name (decl
, id
);
3426 /* Create an identifier for the external mangled name of DECL. */
3429 mangle_decl (const tree decl
)
3434 /* Don't bother mangling uninstantiated templates. */
3435 ++processing_template_decl
;
3436 if (TREE_CODE (decl
) == TYPE_DECL
)
3437 dep
= dependent_type_p (TREE_TYPE (decl
));
3439 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3440 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3441 --processing_template_decl
;
3445 id
= get_mangled_id (decl
);
3446 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3448 if (G
.need_abi_warning
3449 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3450 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3451 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3453 #ifdef ASM_OUTPUT_DEF
3454 /* If the mangling will change in the future, emit an alias with the
3455 future mangled name for forward-compatibility. */
3460 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3461 if (IDENTIFIER_GLOBAL_VALUE (id
) != decl
)
3462 inform (DECL_SOURCE_LOCATION (decl
), "-fabi-version=6 (or =0) "
3463 "avoids this error with a change in mangling");
3465 #ifdef ASM_OUTPUT_DEF
3466 save_ver
= flag_abi_version
;
3467 flag_abi_version
= 0;
3468 id2
= mangle_decl_string (decl
);
3469 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3470 flag_abi_version
= save_ver
;
3472 alias
= make_alias_for (decl
, id2
);
3473 DECL_IGNORED_P (alias
) = 1;
3474 TREE_PUBLIC (alias
) = TREE_PUBLIC (decl
);
3475 DECL_VISIBILITY (alias
) = DECL_VISIBILITY (decl
);
3476 if (vague_linkage_p (decl
))
3477 DECL_WEAK (alias
) = 1;
3478 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3479 cgraph_same_body_alias (cgraph_get_create_node (decl
), alias
, decl
);
3481 varpool_extra_name_alias (alias
, decl
);
3486 /* Generate the mangled representation of TYPE. */
3489 mangle_type_string (const tree type
)
3493 start_mangling (type
);
3495 result
= finish_mangling (/*warn=*/false);
3497 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3501 /* Create an identifier for the mangled name of a special component
3502 for belonging to TYPE. CODE is the ABI-specified code for this
3506 mangle_special_for_type (const tree type
, const char *code
)
3510 /* We don't have an actual decl here for the special component, so
3511 we can't just process the <encoded-name>. Instead, fake it. */
3512 start_mangling (type
);
3514 /* Start the mangling. */
3515 write_string ("_Z");
3516 write_string (code
);
3520 result
= finish_mangling_get_identifier (/*warn=*/false);
3523 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3524 IDENTIFIER_POINTER (result
));
3529 /* Create an identifier for the mangled representation of the typeinfo
3530 structure for TYPE. */
3533 mangle_typeinfo_for_type (const tree type
)
3535 return mangle_special_for_type (type
, "TI");
3538 /* Create an identifier for the mangled name of the NTBS containing
3539 the mangled name of TYPE. */
3542 mangle_typeinfo_string_for_type (const tree type
)
3544 return mangle_special_for_type (type
, "TS");
3547 /* Create an identifier for the mangled name of the vtable for TYPE. */
3550 mangle_vtbl_for_type (const tree type
)
3552 return mangle_special_for_type (type
, "TV");
3555 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3558 mangle_vtt_for_type (const tree type
)
3560 return mangle_special_for_type (type
, "TT");
3563 /* Return an identifier for a construction vtable group. TYPE is
3564 the most derived class in the hierarchy; BINFO is the base
3565 subobject for which this construction vtable group will be used.
3567 This mangling isn't part of the ABI specification; in the ABI
3568 specification, the vtable group is dumped in the same COMDAT as the
3569 main vtable, and is referenced only from that vtable, so it doesn't
3570 need an external name. For binary formats without COMDAT sections,
3571 though, we need external names for the vtable groups.
3573 We use the production
3575 <special-name> ::= CT <type> <offset number> _ <base type> */
3578 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
3582 start_mangling (type
);
3584 write_string ("_Z");
3585 write_string ("TC");
3587 write_integer_cst (BINFO_OFFSET (binfo
));
3589 write_type (BINFO_TYPE (binfo
));
3591 result
= finish_mangling_get_identifier (/*warn=*/false);
3593 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
3594 IDENTIFIER_POINTER (result
));
3598 /* Mangle a this pointer or result pointer adjustment.
3600 <call-offset> ::= h <fixed offset number> _
3601 ::= v <fixed offset number> _ <virtual offset number> _ */
3604 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
3606 write_char (virtual_offset
? 'v' : 'h');
3608 /* For either flavor, write the fixed offset. */
3609 write_integer_cst (fixed_offset
);
3612 /* For a virtual thunk, add the virtual offset. */
3615 write_integer_cst (virtual_offset
);
3620 /* Return an identifier for the mangled name of a this-adjusting or
3621 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3622 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3623 is a virtual thunk, and it is the vtbl offset in
3624 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3625 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3626 thunk itself. A covariant thunk name always includes the adjustment
3627 for the this pointer, even if there is none.
3629 <special-name> ::= T <call-offset> <base encoding>
3630 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3634 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
3635 tree virtual_offset
)
3639 start_mangling (fn_decl
);
3641 write_string ("_Z");
3644 if (!this_adjusting
)
3646 /* Covariant thunk with no this adjustment */
3648 mangle_call_offset (integer_zero_node
, NULL_TREE
);
3649 mangle_call_offset (fixed_offset
, virtual_offset
);
3651 else if (!DECL_THUNK_P (fn_decl
))
3652 /* Plain this adjusting thunk. */
3653 mangle_call_offset (fixed_offset
, virtual_offset
);
3656 /* This adjusting thunk to covariant thunk. */
3658 mangle_call_offset (fixed_offset
, virtual_offset
);
3659 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
3660 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
3662 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
3663 mangle_call_offset (fixed_offset
, virtual_offset
);
3664 fn_decl
= THUNK_TARGET (fn_decl
);
3668 write_encoding (fn_decl
);
3670 result
= finish_mangling_get_identifier (/*warn=*/false);
3672 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
3676 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3677 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3680 static GTY ((param_is (union tree_node
))) htab_t conv_type_names
;
3682 /* Hash a node (VAL1) in the table. */
3685 hash_type (const void *val
)
3687 return (hashval_t
) TYPE_UID (TREE_TYPE ((const_tree
) val
));
3690 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3693 compare_type (const void *val1
, const void *val2
)
3695 return TREE_TYPE ((const_tree
) val1
) == (const_tree
) val2
;
3698 /* Return an identifier for the mangled unqualified name for a
3699 conversion operator to TYPE. This mangling is not specified by the
3700 ABI spec; it is only used internally. */
3703 mangle_conv_op_name_for_type (const tree type
)
3708 if (type
== error_mark_node
)
3709 return error_mark_node
;
3711 if (conv_type_names
== NULL
)
3712 conv_type_names
= htab_create_ggc (31, &hash_type
, &compare_type
, NULL
);
3714 slot
= htab_find_slot_with_hash (conv_type_names
, type
,
3715 (hashval_t
) TYPE_UID (type
), INSERT
);
3716 identifier
= (tree
)*slot
;
3721 /* Create a unique name corresponding to TYPE. */
3722 sprintf (buffer
, "operator %lu",
3723 (unsigned long) htab_elements (conv_type_names
));
3724 identifier
= get_identifier (buffer
);
3727 /* Hang TYPE off the identifier so it can be found easily later
3728 when performing conversions. */
3729 TREE_TYPE (identifier
) = type
;
3731 /* Set bits on the identifier so we know later it's a conversion. */
3732 IDENTIFIER_OPNAME_P (identifier
) = 1;
3733 IDENTIFIER_TYPENAME_P (identifier
) = 1;
3739 /* Write out the appropriate string for this variable when generating
3740 another mangled name based on this one. */
3743 write_guarded_var_name (const tree variable
)
3745 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
3746 /* The name of a guard variable for a reference temporary should refer
3747 to the reference, not the temporary. */
3748 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
3750 write_name (variable
, /*ignore_local_scope=*/0);
3753 /* Return an identifier for the name of an initialization guard
3754 variable for indicated VARIABLE. */
3757 mangle_guard_variable (const tree variable
)
3759 start_mangling (variable
);
3760 write_string ("_ZGV");
3761 write_guarded_var_name (variable
);
3762 return finish_mangling_get_identifier (/*warn=*/false);
3765 /* Return an identifier for the name of a thread_local initialization
3766 function for VARIABLE. */
3769 mangle_tls_init_fn (const tree variable
)
3771 start_mangling (variable
);
3772 write_string ("_ZTH");
3773 write_guarded_var_name (variable
);
3774 return finish_mangling_get_identifier (/*warn=*/false);
3777 /* Return an identifier for the name of a thread_local wrapper
3778 function for VARIABLE. */
3780 #define TLS_WRAPPER_PREFIX "_ZTW"
3783 mangle_tls_wrapper_fn (const tree variable
)
3785 start_mangling (variable
);
3786 write_string (TLS_WRAPPER_PREFIX
);
3787 write_guarded_var_name (variable
);
3788 return finish_mangling_get_identifier (/*warn=*/false);
3791 /* Return true iff FN is a thread_local wrapper function. */
3794 decl_tls_wrapper_p (const tree fn
)
3796 if (TREE_CODE (fn
) != FUNCTION_DECL
)
3798 tree name
= DECL_NAME (fn
);
3799 return strncmp (IDENTIFIER_POINTER (name
), TLS_WRAPPER_PREFIX
,
3800 strlen (TLS_WRAPPER_PREFIX
)) == 0;
3803 /* Return an identifier for the name of a temporary variable used to
3804 initialize a static reference. This isn't part of the ABI, but we might
3805 as well call them something readable. */
3807 static GTY(()) int temp_count
;
3810 mangle_ref_init_variable (const tree variable
)
3812 start_mangling (variable
);
3813 write_string ("_ZGR");
3814 write_name (variable
, /*ignore_local_scope=*/0);
3815 /* Avoid name clashes with aggregate initialization of multiple
3816 references at once. */
3817 write_unsigned_number (temp_count
++);
3818 return finish_mangling_get_identifier (/*warn=*/false);
3822 /* Foreign language type mangling section. */
3824 /* How to write the type codes for the integer Java type. */
3827 write_java_integer_type_codes (const tree type
)
3829 if (type
== java_int_type_node
)
3831 else if (type
== java_short_type_node
)
3833 else if (type
== java_byte_type_node
)
3835 else if (type
== java_char_type_node
)
3837 else if (type
== java_long_type_node
)
3839 else if (type
== java_boolean_type_node
)
3845 #include "gt-cp-mangle.h"