1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009
3 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"
61 /* Debugging support. */
63 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
65 #define DEBUG_MANGLE 0
68 /* Macros for tracing the write_* functions. */
70 # define MANGLE_TRACE(FN, INPUT) \
71 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
72 # define MANGLE_TRACE_TREE(FN, NODE) \
73 fprintf (stderr, " %-24s: %-24s (%p)\n", \
74 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
76 # define MANGLE_TRACE(FN, INPUT)
77 # define MANGLE_TRACE_TREE(FN, NODE)
80 /* Nonzero if NODE is a class template-id. We can't rely on
81 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
82 that hard to distinguish A<T> from A, where A<T> is the type as
83 instantiated outside of the template, and A is the type used
84 without parameters inside the template. */
85 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
86 (TYPE_LANG_SPECIFIC (NODE) != NULL \
87 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
88 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
89 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
91 /* Things we only need one of. This module is not reentrant. */
92 typedef struct GTY(()) globals {
93 /* An array of the current substitution candidates, in the order
95 VEC(tree,gc) *substitutions;
97 /* The entity that is being mangled. */
98 tree GTY ((skip)) entity;
100 /* True if the mangling will be different in a future version of the
102 bool need_abi_warning;
105 static GTY (()) globals G;
107 /* The obstack on which we build mangled names. */
108 static struct obstack *mangle_obstack;
110 /* The obstack on which we build mangled names that are not going to
111 be IDENTIFIER_NODEs. */
112 static struct obstack name_obstack;
114 /* The first object on the name_obstack; we use this to free memory
115 allocated on the name_obstack. */
116 static void *name_base;
118 /* Indices into subst_identifiers. These are identifiers used in
119 special substitution rules. */
127 SUBID_BASIC_IOSTREAM,
130 substitution_identifier_index_t;
132 /* For quick substitution checks, look up these common identifiers
134 static GTY(()) tree subst_identifiers[SUBID_MAX];
136 /* Single-letter codes for builtin integer types, defined in
137 <builtin-type>. These are indexed by integer_type_kind values. */
139 integer_type_codes[itk_none] =
142 'a', /* itk_signed_char */
143 'h', /* itk_unsigned_char */
145 't', /* itk_unsigned_short */
147 'j', /* itk_unsigned_int */
149 'm', /* itk_unsigned_long */
150 'x', /* itk_long_long */
151 'y' /* itk_unsigned_long_long */
154 static int decl_is_template_id (const tree, tree* const);
156 /* Functions for handling substitutions. */
158 static inline tree canonicalize_for_substitution (tree);
159 static void add_substitution (tree);
160 static inline int is_std_substitution (const tree,
161 const substitution_identifier_index_t);
162 static inline int is_std_substitution_char (const tree,
163 const substitution_identifier_index_t);
164 static int find_substitution (tree);
165 static void mangle_call_offset (const tree, const tree);
167 /* Functions for emitting mangled representations of things. */
169 static void write_mangled_name (const tree, bool);
170 static void write_encoding (const tree);
171 static void write_name (tree, const int);
172 static void write_unscoped_name (const tree);
173 static void write_unscoped_template_name (const tree);
174 static void write_nested_name (const tree);
175 static void write_prefix (const tree);
176 static void write_template_prefix (const tree);
177 static void write_unqualified_name (const tree);
178 static void write_conversion_operator_name (const tree);
179 static void write_source_name (tree);
180 static void write_unnamed_type_name (const tree);
181 static void write_closure_type_name (const tree);
182 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
184 static void write_number (unsigned HOST_WIDE_INT, const int,
186 static void write_compact_number (int num);
187 static void write_integer_cst (const tree);
188 static void write_real_cst (const tree);
189 static void write_identifier (const char *);
190 static void write_special_name_constructor (const tree);
191 static void write_special_name_destructor (const tree);
192 static void write_type (tree);
193 static int write_CV_qualifiers_for_type (const tree);
194 static void write_builtin_type (tree);
195 static void write_function_type (const tree);
196 static void write_bare_function_type (const tree, const int, const tree);
197 static void write_method_parms (tree, const int, const tree);
198 static void write_class_enum_type (const tree);
199 static void write_template_args (tree);
200 static void write_expression (tree);
201 static void write_template_arg_literal (const tree);
202 static void write_template_arg (tree);
203 static void write_template_template_arg (const tree);
204 static void write_array_type (const tree);
205 static void write_pointer_to_member_type (const tree);
206 static void write_template_param (const tree);
207 static void write_template_template_param (const tree);
208 static void write_substitution (const int);
209 static int discriminator_for_local_entity (tree);
210 static int discriminator_for_string_literal (tree, tree);
211 static void write_discriminator (const int);
212 static void write_local_name (tree, const tree, const tree);
213 static void dump_substitution_candidates (void);
214 static tree mangle_decl_string (const tree);
215 static int local_class_index (tree);
217 /* Control functions. */
219 static inline void start_mangling (const tree);
220 static inline const char *finish_mangling (const bool);
221 static tree mangle_special_for_type (const tree, const char *);
223 /* Foreign language functions. */
225 static void write_java_integer_type_codes (const tree);
227 /* Append a single character to the end of the mangled
229 #define write_char(CHAR) \
230 obstack_1grow (mangle_obstack, (CHAR))
232 /* Append a sized buffer to the end of the mangled representation. */
233 #define write_chars(CHAR, LEN) \
234 obstack_grow (mangle_obstack, (CHAR), (LEN))
236 /* Append a NUL-terminated string to the end of the mangled
238 #define write_string(STRING) \
239 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
241 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
242 same purpose (context, which may be a type) and value (template
243 decl). See write_template_prefix for more information on what this
245 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
246 (TREE_CODE (NODE1) == TREE_LIST \
247 && TREE_CODE (NODE2) == TREE_LIST \
248 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
249 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
250 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
251 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
253 /* Write out an unsigned quantity in base 10. */
254 #define write_unsigned_number(NUMBER) \
255 write_number ((NUMBER), /*unsigned_p=*/1, 10)
257 /* If DECL is a template instance, return nonzero and, if
258 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
259 Otherwise return zero. */
262 decl_is_template_id (const tree decl, tree* const template_info)
264 if (TREE_CODE (decl) == TYPE_DECL)
266 /* TYPE_DECLs are handled specially. Look at its type to decide
267 if this is a template instantiation. */
268 const tree type = TREE_TYPE (decl);
270 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
272 if (template_info != NULL)
273 /* For a templated TYPE_DECL, the template info is hanging
275 *template_info = TYPE_TEMPLATE_INFO (type);
281 /* Check if this is a primary template. */
282 if (DECL_LANG_SPECIFIC (decl) != NULL
283 && DECL_USE_TEMPLATE (decl)
284 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
285 && TREE_CODE (decl) != TEMPLATE_DECL)
287 if (template_info != NULL)
288 /* For most templated decls, the template info is hanging
290 *template_info = DECL_TEMPLATE_INFO (decl);
295 /* It's not a template id. */
299 /* Produce debugging output of current substitution candidates. */
302 dump_substitution_candidates (void)
307 fprintf (stderr, " ++ substitutions ");
308 for (i = 0; VEC_iterate (tree, G.substitutions, i, el); ++i)
310 const char *name = "???";
313 fprintf (stderr, " ");
315 name = IDENTIFIER_POINTER (DECL_NAME (el));
316 else if (TREE_CODE (el) == TREE_LIST)
317 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
318 else if (TYPE_NAME (el))
319 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
320 fprintf (stderr, " S%d_ = ", i - 1);
322 (CP_TYPE_RESTRICT_P (el)
323 || CP_TYPE_VOLATILE_P (el)
324 || CP_TYPE_CONST_P (el)))
325 fprintf (stderr, "CV-");
326 fprintf (stderr, "%s (%s at %p)\n",
327 name, tree_code_name[TREE_CODE (el)], (void *) el);
331 /* Both decls and types can be substitution candidates, but sometimes
332 they refer to the same thing. For instance, a TYPE_DECL and
333 RECORD_TYPE for the same class refer to the same thing, and should
334 be treated accordingly in substitutions. This function returns a
335 canonicalized tree node representing NODE that is used when adding
336 and substitution candidates and finding matches. */
339 canonicalize_for_substitution (tree node)
341 /* For a TYPE_DECL, use the type instead. */
342 if (TREE_CODE (node) == TYPE_DECL)
343 node = TREE_TYPE (node);
345 && TYPE_CANONICAL (node) != node
346 && TYPE_MAIN_VARIANT (node) != node)
347 /* Here we want to strip the topmost typedef only.
348 We need to do that so is_std_substitution can do proper
350 node = cp_build_qualified_type (TYPE_MAIN_VARIANT (node),
351 cp_type_quals (node));
355 /* Add NODE as a substitution candidate. NODE must not already be on
356 the list of candidates. */
359 add_substitution (tree node)
364 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
365 tree_code_name[TREE_CODE (node)], (void *) node);
367 /* Get the canonicalized substitution candidate for NODE. */
368 c = canonicalize_for_substitution (node);
369 if (DEBUG_MANGLE && c != node)
370 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
371 tree_code_name[TREE_CODE (node)], (void *) node);
375 /* Make sure NODE isn't already a candidate. */
380 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++)
382 gcc_assert (!(DECL_P (node) && node == candidate));
383 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
384 && same_type_p (node, candidate)));
387 #endif /* ENABLE_CHECKING */
389 /* Put the decl onto the varray of substitution candidates. */
390 VEC_safe_push (tree, gc, G.substitutions, node);
393 dump_substitution_candidates ();
396 /* Helper function for find_substitution. Returns nonzero if NODE,
397 which may be a decl or a CLASS_TYPE, is a template-id with template
398 name of substitution_index[INDEX] in the ::std namespace. */
401 is_std_substitution (const tree node,
402 const substitution_identifier_index_t index)
409 type = TREE_TYPE (node);
412 else if (CLASS_TYPE_P (node))
415 decl = TYPE_NAME (node);
418 /* These are not the droids you're looking for. */
421 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
422 && TYPE_LANG_SPECIFIC (type)
423 && TYPE_TEMPLATE_INFO (type)
424 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
425 == subst_identifiers[index]));
428 /* Helper function for find_substitution. Returns nonzero if NODE,
429 which may be a decl or a CLASS_TYPE, is the template-id
430 ::std::identifier<char>, where identifier is
431 substitution_index[INDEX]. */
434 is_std_substitution_char (const tree node,
435 const substitution_identifier_index_t index)
438 /* Check NODE's name is ::std::identifier. */
439 if (!is_std_substitution (node, index))
441 /* Figure out its template args. */
443 args = DECL_TI_ARGS (node);
444 else if (CLASS_TYPE_P (node))
445 args = CLASSTYPE_TI_ARGS (node);
447 /* Oops, not a template. */
449 /* NODE's template arg list should be <char>. */
451 TREE_VEC_LENGTH (args) == 1
452 && TREE_VEC_ELT (args, 0) == char_type_node;
455 /* Check whether a substitution should be used to represent NODE in
458 First, check standard special-case substitutions.
460 <substitution> ::= St
467 # ::std::basic_string
470 # ::std::basic_string<char,
471 ::std::char_traits<char>,
472 ::std::allocator<char> >
475 # ::std::basic_istream<char, ::std::char_traits<char> >
478 # ::std::basic_ostream<char, ::std::char_traits<char> >
481 # ::std::basic_iostream<char, ::std::char_traits<char> >
483 Then examine the stack of currently available substitution
484 candidates for entities appearing earlier in the same mangling
486 If a substitution is found, write its mangled representation and
487 return nonzero. If none is found, just return zero. */
490 find_substitution (tree node)
493 const int size = VEC_length (tree, G.substitutions);
498 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
499 tree_code_name[TREE_CODE (node)], (void *) node);
501 /* Obtain the canonicalized substitution representation for NODE.
502 This is what we'll compare against. */
503 node = canonicalize_for_substitution (node);
505 /* Check for builtin substitutions. */
507 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
508 type = TYPE_P (node) ? node : TREE_TYPE (node);
510 /* Check for std::allocator. */
512 && is_std_substitution (decl, SUBID_ALLOCATOR)
513 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
519 /* Check for std::basic_string. */
520 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
524 /* If this is a type (i.e. a fully-qualified template-id),
526 std::basic_string <char,
527 std::char_traits<char>,
528 std::allocator<char> > . */
529 if (cp_type_quals (type) == TYPE_UNQUALIFIED
530 && CLASSTYPE_USE_TEMPLATE (type))
532 tree args = CLASSTYPE_TI_ARGS (type);
533 if (TREE_VEC_LENGTH (args) == 3
534 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
535 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
537 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
546 /* Substitute for the template name only if this isn't a type. */
553 /* Check for basic_{i,o,io}stream. */
555 && cp_type_quals (type) == TYPE_UNQUALIFIED
556 && CLASS_TYPE_P (type)
557 && CLASSTYPE_USE_TEMPLATE (type)
558 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
560 /* First, check for the template
561 args <char, std::char_traits<char> > . */
562 tree args = CLASSTYPE_TI_ARGS (type);
563 if (TREE_VEC_LENGTH (args) == 2
564 && TYPE_P (TREE_VEC_ELT (args, 0))
565 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
566 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
569 /* Got them. Is this basic_istream? */
570 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
575 /* Or basic_ostream? */
576 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
581 /* Or basic_iostream? */
582 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
590 /* Check for namespace std. */
591 if (decl && DECL_NAMESPACE_STD_P (decl))
597 /* Now check the list of available substitutions for this mangling
599 for (i = 0; i < size; ++i)
601 tree candidate = VEC_index (tree, G.substitutions, i);
602 /* NODE is a matched to a candidate if it's the same decl node or
603 if it's the same type. */
604 if (decl == candidate
605 || (TYPE_P (candidate) && type && TYPE_P (type)
606 && same_type_p (type, candidate))
607 || NESTED_TEMPLATE_MATCH (node, candidate))
609 write_substitution (i);
614 /* No substitution found. */
619 /* TOP_LEVEL is true, if this is being called at outermost level of
620 mangling. It should be false when mangling a decl appearing in an
621 expression within some other mangling.
623 <mangled-name> ::= _Z <encoding> */
626 write_mangled_name (const tree decl, bool top_level)
628 MANGLE_TRACE_TREE ("mangled-name", decl);
630 if (/* The names of `extern "C"' functions are not mangled. */
631 DECL_EXTERN_C_FUNCTION_P (decl)
632 /* But overloaded operator names *are* mangled. */
633 && !DECL_OVERLOADED_OPERATOR_P (decl))
638 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
641 /* The standard notes: "The <encoding> of an extern "C"
642 function is treated like global-scope data, i.e. as its
643 <source-name> without a type." We cannot write
644 overloaded operators that way though, because it contains
645 characters invalid in assembler. */
646 if (abi_version_at_least (2))
649 G.need_abi_warning = true;
650 write_source_name (DECL_NAME (decl));
653 else if (TREE_CODE (decl) == VAR_DECL
654 /* The names of non-static global variables aren't mangled. */
655 && DECL_EXTERNAL_LINKAGE_P (decl)
656 && (CP_DECL_CONTEXT (decl) == global_namespace
657 /* And neither are `extern "C"' variables. */
658 || DECL_EXTERN_C_P (decl)))
660 if (top_level || abi_version_at_least (2))
664 G.need_abi_warning = true;
672 write_encoding (decl);
673 if (DECL_LANG_SPECIFIC (decl)
674 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
675 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
676 /* We need a distinct mangled name for these entities, but
677 we should never actually output it. So, we append some
678 characters the assembler won't like. */
679 write_string (" *INTERNAL* ");
683 /* <encoding> ::= <function name> <bare-function-type>
687 write_encoding (const tree decl)
689 MANGLE_TRACE_TREE ("encoding", decl);
691 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
693 /* For overloaded operators write just the mangled name
694 without arguments. */
695 if (DECL_OVERLOADED_OPERATOR_P (decl))
696 write_name (decl, /*ignore_local_scope=*/0);
698 write_source_name (DECL_NAME (decl));
702 write_name (decl, /*ignore_local_scope=*/0);
703 if (TREE_CODE (decl) == FUNCTION_DECL)
708 if (decl_is_template_id (decl, NULL))
710 fn_type = get_mostly_instantiated_function_type (decl);
711 /* FN_TYPE will not have parameter types for in-charge or
712 VTT parameters. Therefore, we pass NULL_TREE to
713 write_bare_function_type -- otherwise, it will get
714 confused about which artificial parameters to skip. */
719 fn_type = TREE_TYPE (decl);
723 write_bare_function_type (fn_type,
724 (!DECL_CONSTRUCTOR_P (decl)
725 && !DECL_DESTRUCTOR_P (decl)
726 && !DECL_CONV_FN_P (decl)
727 && decl_is_template_id (decl, NULL)),
732 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
733 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
736 decl_mangling_context (tree decl)
738 if (TREE_CODE (decl) == TYPE_DECL
739 && LAMBDA_TYPE_P (TREE_TYPE (decl)))
741 tree extra = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl));
745 else if (TREE_CODE (decl) == TYPE_DECL
746 && TREE_CODE (TREE_TYPE (decl)) == TEMPLATE_TYPE_PARM)
747 /* template type parms have no mangling context. */
749 return CP_DECL_CONTEXT (decl);
752 /* <name> ::= <unscoped-name>
753 ::= <unscoped-template-name> <template-args>
757 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
758 called from <local-name>, which mangles the enclosing scope
759 elsewhere and then uses this function to mangle just the part
760 underneath the function scope. So don't use the <local-name>
761 production, to avoid an infinite recursion. */
764 write_name (tree decl, const int ignore_local_scope)
768 MANGLE_TRACE_TREE ("name", decl);
770 if (TREE_CODE (decl) == TYPE_DECL)
772 /* In case this is a typedef, fish out the corresponding
773 TYPE_DECL for the main variant. */
774 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
777 context = decl_mangling_context (decl);
779 /* A decl in :: or ::std scope is treated specially. The former is
780 mangled using <unscoped-name> or <unscoped-template-name>, the
781 latter with a special substitution. Also, a name that is
782 directly in a local function scope is also mangled with
783 <unscoped-name> rather than a full <nested-name>. */
785 || context == global_namespace
786 || DECL_NAMESPACE_STD_P (context)
787 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
790 /* Is this a template instance? */
791 if (decl_is_template_id (decl, &template_info))
793 /* Yes: use <unscoped-template-name>. */
794 write_unscoped_template_name (TI_TEMPLATE (template_info));
795 write_template_args (TI_ARGS (template_info));
798 /* Everything else gets an <unqualified-name>. */
799 write_unscoped_name (decl);
803 /* Handle local names, unless we asked not to (that is, invoked
804 under <local-name>, to handle only the part of the name under
806 if (!ignore_local_scope)
808 /* Scan up the list of scope context, looking for a
809 function. If we find one, this entity is in local
810 function scope. local_entity tracks context one scope
811 level down, so it will contain the element that's
812 directly in that function's scope, either decl or one of
813 its enclosing scopes. */
814 tree local_entity = decl;
815 while (context != NULL && context != global_namespace)
817 /* Make sure we're always dealing with decls. */
818 if (context != NULL && TYPE_P (context))
819 context = TYPE_NAME (context);
820 /* Is this a function? */
821 if (TREE_CODE (context) == FUNCTION_DECL
822 || TREE_CODE (context) == PARM_DECL)
824 /* Yes, we have local scope. Use the <local-name>
825 production for the innermost function scope. */
826 write_local_name (context, local_entity, decl);
829 /* Up one scope level. */
830 local_entity = context;
831 context = decl_mangling_context (context);
834 /* No local scope found? Fall through to <nested-name>. */
837 /* Other decls get a <nested-name> to encode their scope. */
838 write_nested_name (decl);
842 /* <unscoped-name> ::= <unqualified-name>
843 ::= St <unqualified-name> # ::std:: */
846 write_unscoped_name (const tree decl)
848 tree context = CP_DECL_CONTEXT (decl);
850 MANGLE_TRACE_TREE ("unscoped-name", decl);
852 /* Is DECL in ::std? */
853 if (DECL_NAMESPACE_STD_P (context))
856 write_unqualified_name (decl);
860 /* If not, it should be either in the global namespace, or directly
861 in a local function scope. */
862 gcc_assert (context == global_namespace
864 || TREE_CODE (context) == FUNCTION_DECL);
866 write_unqualified_name (decl);
870 /* <unscoped-template-name> ::= <unscoped-name>
871 ::= <substitution> */
874 write_unscoped_template_name (const tree decl)
876 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
878 if (find_substitution (decl))
880 write_unscoped_name (decl);
881 add_substitution (decl);
884 /* Write the nested name, including CV-qualifiers, of DECL.
886 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
887 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
889 <CV-qualifiers> ::= [r] [V] [K] */
892 write_nested_name (const tree decl)
896 MANGLE_TRACE_TREE ("nested-name", decl);
900 /* Write CV-qualifiers, if this is a member function. */
901 if (TREE_CODE (decl) == FUNCTION_DECL
902 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
904 if (DECL_VOLATILE_MEMFUNC_P (decl))
906 if (DECL_CONST_MEMFUNC_P (decl))
910 /* Is this a template instance? */
911 if (decl_is_template_id (decl, &template_info))
913 /* Yes, use <template-prefix>. */
914 write_template_prefix (decl);
915 write_template_args (TI_ARGS (template_info));
917 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
919 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
920 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
922 write_template_prefix (decl);
923 write_template_args (TREE_OPERAND (name, 1));
927 write_prefix (CP_DECL_CONTEXT (decl));
928 write_unqualified_name (decl);
933 /* No, just use <prefix> */
934 write_prefix (DECL_CONTEXT (decl));
935 write_unqualified_name (decl);
940 /* <prefix> ::= <prefix> <unqualified-name>
942 ::= <template-prefix> <template-args>
944 ::= <substitution> */
947 write_prefix (const tree node)
950 /* Non-NULL if NODE represents a template-id. */
951 tree template_info = NULL;
954 || node == global_namespace)
957 MANGLE_TRACE_TREE ("prefix", node);
959 if (find_substitution (node))
964 /* If this is a function or parm decl, that means we've hit function
965 scope, so this prefix must be for a local name. In this
966 case, we're under the <local-name> production, which encodes
967 the enclosing function scope elsewhere. So don't continue
969 if (TREE_CODE (node) == FUNCTION_DECL
970 || TREE_CODE (node) == PARM_DECL)
974 decl_is_template_id (decl, &template_info);
978 /* Node is a type. */
979 decl = TYPE_NAME (node);
980 if (CLASSTYPE_TEMPLATE_ID_P (node))
981 template_info = TYPE_TEMPLATE_INFO (node);
984 /* In G++ 3.2, the name of the template parameter was used. */
985 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
986 && !abi_version_at_least (2))
987 G.need_abi_warning = true;
989 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
990 && abi_version_at_least (2))
991 write_template_param (node);
992 else if (template_info != NULL)
995 write_template_prefix (decl);
996 write_template_args (TI_ARGS (template_info));
998 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1000 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1001 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1003 write_template_prefix (decl);
1004 write_template_args (TREE_OPERAND (name, 1));
1008 write_prefix (CP_DECL_CONTEXT (decl));
1009 write_unqualified_name (decl);
1013 /* Not templated. */
1015 write_prefix (decl_mangling_context (decl));
1016 write_unqualified_name (decl);
1017 if (TREE_CODE (decl) == VAR_DECL
1018 || TREE_CODE (decl) == FIELD_DECL)
1020 /* <data-member-prefix> := <member source-name> M */
1026 add_substitution (node);
1029 /* <template-prefix> ::= <prefix> <template component>
1030 ::= <template-param>
1031 ::= <substitution> */
1034 write_template_prefix (const tree node)
1036 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1037 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1038 tree context = CP_DECL_CONTEXT (decl);
1043 MANGLE_TRACE_TREE ("template-prefix", node);
1045 /* Find the template decl. */
1046 if (decl_is_template_id (decl, &template_info))
1047 templ = TI_TEMPLATE (template_info);
1048 else if (TREE_CODE (type) == TYPENAME_TYPE)
1049 /* For a typename type, all we have is the name. */
1050 templ = DECL_NAME (decl);
1053 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
1055 templ = TYPE_TI_TEMPLATE (type);
1058 /* For a member template, though, the template name for the
1059 innermost name must have all the outer template levels
1060 instantiated. For instance, consider
1062 template<typename T> struct Outer {
1063 template<typename U> struct Inner {};
1066 The template name for `Inner' in `Outer<int>::Inner<float>' is
1067 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1068 levels separately, so there's no TEMPLATE_DECL available for this
1069 (there's only `Outer<T>::Inner<U>').
1071 In order to get the substitutions right, we create a special
1072 TREE_LIST to represent the substitution candidate for a nested
1073 template. The TREE_PURPOSE is the template's context, fully
1074 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1077 So, for the example above, `Outer<int>::Inner' is represented as a
1078 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1079 and whose value is `Outer<T>::Inner<U>'. */
1080 if (TYPE_P (context))
1081 substitution = build_tree_list (context, templ);
1083 substitution = templ;
1085 if (find_substitution (substitution))
1088 /* In G++ 3.2, the name of the template template parameter was used. */
1089 if (TREE_TYPE (templ)
1090 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1091 && !abi_version_at_least (2))
1092 G.need_abi_warning = true;
1094 if (TREE_TYPE (templ)
1095 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1096 && abi_version_at_least (2))
1097 write_template_param (TREE_TYPE (templ));
1100 write_prefix (context);
1101 write_unqualified_name (decl);
1104 add_substitution (substitution);
1107 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1108 mangled through special entry points.
1110 <unqualified-name> ::= <operator-name>
1113 ::= <unnamed-type-name>
1114 ::= <local-source-name>
1116 <local-source-name> ::= L <source-name> <discriminator> */
1119 write_unqualified_id (tree identifier)
1121 if (IDENTIFIER_TYPENAME_P (identifier))
1122 write_conversion_operator_name (TREE_TYPE (identifier));
1123 else if (IDENTIFIER_OPNAME_P (identifier))
1126 const char *mangled_name = NULL;
1128 /* Unfortunately, there is no easy way to go from the
1129 name of the operator back to the corresponding tree
1131 for (i = 0; i < MAX_TREE_CODES; ++i)
1132 if (operator_name_info[i].identifier == identifier)
1134 /* The ABI says that we prefer binary operator
1135 names to unary operator names. */
1136 if (operator_name_info[i].arity == 2)
1138 mangled_name = operator_name_info[i].mangled_name;
1141 else if (!mangled_name)
1142 mangled_name = operator_name_info[i].mangled_name;
1144 else if (assignment_operator_name_info[i].identifier
1148 = assignment_operator_name_info[i].mangled_name;
1151 write_string (mangled_name);
1154 write_source_name (identifier);
1158 write_unqualified_name (const tree decl)
1160 MANGLE_TRACE_TREE ("unqualified-name", decl);
1162 if (TREE_CODE (decl) == IDENTIFIER_NODE)
1164 write_unqualified_id (decl);
1168 if (DECL_NAME (decl) == NULL_TREE)
1170 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl));
1171 write_source_name (DECL_ASSEMBLER_NAME (decl));
1174 else if (DECL_DECLARES_FUNCTION_P (decl))
1177 if (DECL_CONSTRUCTOR_P (decl))
1178 write_special_name_constructor (decl);
1179 else if (DECL_DESTRUCTOR_P (decl))
1180 write_special_name_destructor (decl);
1181 else if (DECL_CONV_FN_P (decl))
1183 /* Conversion operator. Handle it right here.
1184 <operator> ::= cv <type> */
1186 if (decl_is_template_id (decl, NULL))
1189 fn_type = get_mostly_instantiated_function_type (decl);
1190 type = TREE_TYPE (fn_type);
1193 type = DECL_CONV_FN_TYPE (decl);
1194 write_conversion_operator_name (type);
1196 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1198 operator_name_info_t *oni;
1199 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1200 oni = assignment_operator_name_info;
1202 oni = operator_name_info;
1204 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1213 if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1214 && DECL_NAMESPACE_SCOPE_P (decl)
1215 && decl_linkage (decl) == lk_internal)
1217 MANGLE_TRACE_TREE ("local-source-name", decl);
1219 write_source_name (DECL_NAME (decl));
1220 /* The default discriminator is 1, and that's all we ever use,
1221 so there's no code to output one here. */
1225 tree type = TREE_TYPE (decl);
1227 if (TREE_CODE (decl) == TYPE_DECL
1228 && TYPE_ANONYMOUS_P (type))
1229 write_unnamed_type_name (type);
1230 else if (TREE_CODE (decl) == TYPE_DECL
1231 && LAMBDA_TYPE_P (type))
1232 write_closure_type_name (type);
1234 write_source_name (DECL_NAME (decl));
1238 /* Write the unqualified-name for a conversion operator to TYPE. */
1241 write_conversion_operator_name (const tree type)
1243 write_string ("cv");
1247 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1249 <source-name> ::= </length/ number> <identifier> */
1252 write_source_name (tree identifier)
1254 MANGLE_TRACE_TREE ("source-name", identifier);
1256 /* Never write the whole template-id name including the template
1257 arguments; we only want the template name. */
1258 if (IDENTIFIER_TEMPLATE (identifier))
1259 identifier = IDENTIFIER_TEMPLATE (identifier);
1261 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1262 write_identifier (IDENTIFIER_POINTER (identifier));
1265 /* Encode 0 as _, and 1+ as n-1_. */
1268 write_compact_number (int num)
1271 write_unsigned_number (num - 1);
1275 /* Return how many unnamed types precede TYPE in its enclosing class. */
1278 nested_anon_class_index (tree type)
1281 tree member = TYPE_FIELDS (TYPE_CONTEXT (type));
1282 for (; member; member = TREE_CHAIN (member))
1283 if (DECL_IMPLICIT_TYPEDEF_P (member))
1285 tree memtype = TREE_TYPE (member);
1286 if (memtype == type)
1288 else if (TYPE_ANONYMOUS_P (memtype))
1295 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1298 write_unnamed_type_name (const tree type __attribute__ ((__unused__)))
1301 MANGLE_TRACE_TREE ("unnamed-type-name", type);
1303 if (TYPE_FUNCTION_SCOPE_P (type))
1304 discriminator = local_class_index (type);
1305 else if (TYPE_CLASS_SCOPE_P (type))
1306 discriminator = nested_anon_class_index (type);
1309 gcc_assert (no_linkage_check (type, /*relaxed_p=*/true));
1310 /* Just use the old mangling at namespace scope. */
1311 write_source_name (TYPE_IDENTIFIER (type));
1315 write_string ("Ut");
1316 write_compact_number (discriminator);
1319 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1320 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1323 write_closure_type_name (const tree type)
1325 tree fn = lambda_function (type);
1326 tree lambda = CLASSTYPE_LAMBDA_EXPR (type);
1327 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
1329 MANGLE_TRACE_TREE ("closure-type-name", type);
1331 write_string ("Ul");
1332 write_method_parms (parms, /*method_p=*/1, fn);
1334 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda));
1337 /* Convert NUMBER to ascii using base BASE and generating at least
1338 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1339 into which to store the characters. Returns the number of
1340 characters generated (these will be layed out in advance of where
1344 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1345 char *buffer, const unsigned int min_digits)
1347 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1348 unsigned digits = 0;
1352 unsigned HOST_WIDE_INT d = number / base;
1354 *--buffer = base_digits[number - d * base];
1358 while (digits < min_digits)
1360 *--buffer = base_digits[0];
1366 /* Non-terminal <number>.
1368 <number> ::= [n] </decimal integer/> */
1371 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1372 const unsigned int base)
1374 char buffer[sizeof (HOST_WIDE_INT) * 8];
1377 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1380 number = -((HOST_WIDE_INT) number);
1382 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1383 write_chars (buffer + sizeof (buffer) - count, count);
1386 /* Write out an integral CST in decimal. Most numbers are small, and
1387 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1388 bigger than that, which we must deal with. */
1391 write_integer_cst (const tree cst)
1393 int sign = tree_int_cst_sgn (cst);
1395 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1397 /* A bignum. We do this in chunks, each of which fits in a
1399 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1400 unsigned HOST_WIDE_INT chunk;
1401 unsigned chunk_digits;
1402 char *ptr = buffer + sizeof (buffer);
1407 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1412 if (sizeof (HOST_WIDE_INT) >= 8)
1414 /* It is at least 64 bits, so 10^18 is representable. */
1419 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1420 base = build_int_cstu (type, chunk);
1421 n = build_int_cst_wide (type,
1422 TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1427 n = fold_build1_loc (input_location, NEGATE_EXPR, type, n);
1431 tree d = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, n, base);
1432 tree tmp = fold_build2_loc (input_location, MULT_EXPR, type, d, base);
1435 done = integer_zerop (d);
1436 tmp = fold_build2_loc (input_location, MINUS_EXPR, type, n, tmp);
1437 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1438 done ? 1 : chunk_digits);
1444 write_chars (ptr, count);
1449 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1456 write_unsigned_number (low);
1460 /* Write out a floating-point literal.
1462 "Floating-point literals are encoded using the bit pattern of the
1463 target processor's internal representation of that number, as a
1464 fixed-length lowercase hexadecimal string, high-order bytes first
1465 (even if the target processor would store low-order bytes first).
1466 The "n" prefix is not used for floating-point literals; the sign
1467 bit is encoded with the rest of the number.
1469 Here are some examples, assuming the IEEE standard representation
1470 for floating point numbers. (Spaces are for readability, not
1471 part of the encoding.)
1474 -1.0f Lf bf80 0000 E
1475 1.17549435e-38f Lf 0080 0000 E
1476 1.40129846e-45f Lf 0000 0001 E
1477 0.0f Lf 0000 0000 E"
1479 Caller is responsible for the Lx and the E. */
1481 write_real_cst (const tree value)
1483 if (abi_version_at_least (2))
1485 long target_real[4]; /* largest supported float */
1486 char buffer[9]; /* eight hex digits in a 32-bit number */
1489 tree type = TREE_TYPE (value);
1490 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1492 real_to_target (target_real, &TREE_REAL_CST (value),
1495 /* The value in target_real is in the target word order,
1496 so we must write it out backward if that happens to be
1497 little-endian. write_number cannot be used, it will
1498 produce uppercase. */
1499 if (FLOAT_WORDS_BIG_ENDIAN)
1500 i = 0, limit = words, dir = 1;
1502 i = words - 1, limit = -1, dir = -1;
1504 for (; i != limit; i += dir)
1506 sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
1507 write_chars (buffer, 8);
1512 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1513 literally. Note that compatibility with 3.2 is impossible,
1514 because the old floating-point emulator used a different
1515 format for REAL_VALUE_TYPE. */
1517 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1518 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1521 G.need_abi_warning = 1;
1525 /* Non-terminal <identifier>.
1527 <identifier> ::= </unqualified source code identifier> */
1530 write_identifier (const char *identifier)
1532 MANGLE_TRACE ("identifier", identifier);
1533 write_string (identifier);
1536 /* Handle constructor productions of non-terminal <special-name>.
1537 CTOR is a constructor FUNCTION_DECL.
1539 <special-name> ::= C1 # complete object constructor
1540 ::= C2 # base object constructor
1541 ::= C3 # complete object allocating constructor
1543 Currently, allocating constructors are never used.
1545 We also need to provide mangled names for the maybe-in-charge
1546 constructor, so we treat it here too. mangle_decl_string will
1547 append *INTERNAL* to that, to make sure we never emit it. */
1550 write_special_name_constructor (const tree ctor)
1552 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1553 write_string ("C2");
1556 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1557 /* Even though we don't ever emit a definition of
1558 the old-style destructor, we still have to
1559 consider entities (like static variables) nested
1561 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor));
1562 write_string ("C1");
1566 /* Handle destructor productions of non-terminal <special-name>.
1567 DTOR is a destructor FUNCTION_DECL.
1569 <special-name> ::= D0 # deleting (in-charge) destructor
1570 ::= D1 # complete object (in-charge) destructor
1571 ::= D2 # base object (not-in-charge) destructor
1573 We also need to provide mangled names for the maybe-incharge
1574 destructor, so we treat it here too. mangle_decl_string will
1575 append *INTERNAL* to that, to make sure we never emit it. */
1578 write_special_name_destructor (const tree dtor)
1580 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1581 write_string ("D0");
1582 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1583 write_string ("D2");
1586 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1587 /* Even though we don't ever emit a definition of
1588 the old-style destructor, we still have to
1589 consider entities (like static variables) nested
1591 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor));
1592 write_string ("D1");
1596 /* Scan the vector of local classes and return how many others with the
1597 same name (or same no name) and context precede ENTITY. */
1600 local_class_index (tree entity)
1602 int ix, discriminator = 0;
1603 tree name = (TYPE_ANONYMOUS_P (entity) ? NULL_TREE
1604 : TYPE_IDENTIFIER (entity));
1605 tree ctx = TYPE_CONTEXT (entity);
1606 for (ix = 0; ; ix++)
1608 tree type = VEC_index (tree, local_classes, ix);
1610 return discriminator;
1611 if (TYPE_CONTEXT (type) == ctx
1612 && (name ? TYPE_IDENTIFIER (type) == name
1613 : TYPE_ANONYMOUS_P (type)))
1619 /* Return the discriminator for ENTITY appearing inside
1620 FUNCTION. The discriminator is the lexical ordinal of VAR among
1621 entities with the same name in the same FUNCTION. */
1624 discriminator_for_local_entity (tree entity)
1626 if (DECL_DISCRIMINATOR_P (entity))
1628 if (DECL_DISCRIMINATOR_SET_P (entity))
1629 return DECL_DISCRIMINATOR (entity);
1631 /* The first entity with a particular name doesn't get
1632 DECL_DISCRIMINATOR set up. */
1635 else if (TREE_CODE (entity) == TYPE_DECL)
1637 /* Scan the list of local classes. */
1638 entity = TREE_TYPE (entity);
1640 /* Lambdas and unnamed types have their own discriminators. */
1641 if (LAMBDA_TYPE_P (entity) || TYPE_ANONYMOUS_P (entity))
1644 return local_class_index (entity);
1650 /* Return the discriminator for STRING, a string literal used inside
1651 FUNCTION. The discriminator is the lexical ordinal of STRING among
1652 string literals used in FUNCTION. */
1655 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1656 tree string ATTRIBUTE_UNUSED)
1658 /* For now, we don't discriminate amongst string literals. */
1662 /* <discriminator> := _ <number>
1664 The discriminator is used only for the second and later occurrences
1665 of the same name within a single function. In this case <number> is
1666 n - 2, if this is the nth occurrence, in lexical order. */
1669 write_discriminator (const int discriminator)
1671 /* If discriminator is zero, don't write anything. Otherwise... */
1672 if (discriminator > 0)
1675 write_unsigned_number (discriminator - 1);
1679 /* Mangle the name of a function-scope entity. FUNCTION is the
1680 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1681 default argument scope. ENTITY is the decl for the entity itself.
1682 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1683 either ENTITY itself or an enclosing scope of ENTITY.
1685 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1686 := Z <function encoding> E s [<discriminator>]
1687 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1690 write_local_name (tree function, const tree local_entity,
1693 tree parm = NULL_TREE;
1695 MANGLE_TRACE_TREE ("local-name", entity);
1697 if (TREE_CODE (function) == PARM_DECL)
1700 function = DECL_CONTEXT (parm);
1704 write_encoding (function);
1707 /* For this purpose, parameters are numbered from right-to-left. */
1712 for (t = DECL_ARGUMENTS (function); t; t = TREE_CHAIN (t))
1720 write_compact_number (i - 1);
1723 if (TREE_CODE (entity) == STRING_CST)
1726 write_discriminator (discriminator_for_string_literal (function,
1731 /* Now the <entity name>. Let write_name know its being called
1732 from <local-name>, so it doesn't try to process the enclosing
1733 function scope again. */
1734 write_name (entity, /*ignore_local_scope=*/1);
1735 write_discriminator (discriminator_for_local_entity (local_entity));
1739 /* Non-terminals <type> and <CV-qualifier>.
1741 <type> ::= <builtin-type>
1743 ::= <class-enum-type>
1745 ::= <pointer-to-member-type>
1746 ::= <template-param>
1749 ::= P <type> # pointer-to
1750 ::= R <type> # reference-to
1751 ::= C <type> # complex pair (C 2000)
1752 ::= G <type> # imaginary (C 2000) [not supported]
1753 ::= U <source-name> <type> # vendor extended type qualifier
1757 <type> ::= RR <type> # rvalue reference-to
1758 <type> ::= Dt <expression> # decltype of an id-expression or
1759 # class member access
1760 <type> ::= DT <expression> # decltype of an expression
1761 <type> ::= Dn # decltype of nullptr
1763 TYPE is a type node. */
1766 write_type (tree type)
1768 /* This gets set to nonzero if TYPE turns out to be a (possibly
1769 CV-qualified) builtin type. */
1770 int is_builtin_type = 0;
1772 MANGLE_TRACE_TREE ("type", type);
1774 if (type == error_mark_node)
1777 if (find_substitution (type))
1780 /* According to the C++ ABI, some library classes are passed the
1781 same as the scalar type of their single member and use the same
1783 if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
1784 type = TREE_TYPE (first_field (type));
1786 if (write_CV_qualifiers_for_type (type) > 0)
1787 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1788 mangle the unqualified type. The recursive call is needed here
1789 since both the qualified and unqualified types are substitution
1791 write_type (TYPE_MAIN_VARIANT (type));
1792 else if (TREE_CODE (type) == ARRAY_TYPE)
1793 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1794 so that the cv-qualification of the element type is available
1795 in write_array_type. */
1796 write_array_type (type);
1799 tree type_orig = type;
1801 /* See through any typedefs. */
1802 type = TYPE_MAIN_VARIANT (type);
1804 if (TYPE_PTRMEM_P (type))
1805 write_pointer_to_member_type (type);
1808 /* Handle any target-specific fundamental types. */
1809 const char *target_mangling
1810 = targetm.mangle_type (type_orig);
1812 if (target_mangling)
1814 write_string (target_mangling);
1815 /* Add substitutions for types other than fundamental
1817 if (TREE_CODE (type) != VOID_TYPE
1818 && TREE_CODE (type) != INTEGER_TYPE
1819 && TREE_CODE (type) != REAL_TYPE
1820 && TREE_CODE (type) != BOOLEAN_TYPE)
1821 add_substitution (type);
1825 switch (TREE_CODE (type))
1829 case INTEGER_TYPE: /* Includes wchar_t. */
1831 case FIXED_POINT_TYPE:
1833 /* If this is a typedef, TYPE may not be one of
1834 the standard builtin type nodes, but an alias of one. Use
1835 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1836 write_builtin_type (TYPE_MAIN_VARIANT (type));
1843 write_type (TREE_TYPE (type));
1848 write_function_type (type);
1854 /* A pointer-to-member function is represented as a special
1855 RECORD_TYPE, so check for this first. */
1856 if (TYPE_PTRMEMFUNC_P (type))
1857 write_pointer_to_member_type (type);
1859 write_class_enum_type (type);
1863 case UNBOUND_CLASS_TEMPLATE:
1864 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1865 ordinary nested names. */
1866 write_nested_name (TYPE_STUB_DECL (type));
1871 write_type (TREE_TYPE (type));
1874 case REFERENCE_TYPE:
1875 if (TYPE_REF_IS_RVALUE (type))
1879 write_type (TREE_TYPE (type));
1882 case TEMPLATE_TYPE_PARM:
1883 case TEMPLATE_PARM_INDEX:
1884 write_template_param (type);
1887 case TEMPLATE_TEMPLATE_PARM:
1888 write_template_template_param (type);
1891 case BOUND_TEMPLATE_TEMPLATE_PARM:
1892 write_template_template_param (type);
1894 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1898 if (abi_version_at_least (4))
1900 write_string ("Dv");
1901 /* Non-constant vector size would be encoded with
1902 _ expression, but we don't support that yet. */
1903 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type));
1908 G.need_abi_warning = 1;
1909 write_string ("U8__vector");
1911 write_type (TREE_TYPE (type));
1914 case TYPE_PACK_EXPANSION:
1915 write_string ("Dp");
1916 write_type (PACK_EXPANSION_PATTERN (type));
1920 /* These shouldn't make it into mangling. */
1921 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type)
1922 && !DECLTYPE_FOR_LAMBDA_RETURN (type));
1925 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
1929 ++cp_unevaluated_operand;
1930 write_expression (DECLTYPE_TYPE_EXPR (type));
1931 --cp_unevaluated_operand;
1936 sorry ("mangling typeof, use decltype instead");
1940 if (NULLPTR_TYPE_P (type))
1942 write_string ("Dn");
1945 /* else fall through. */
1953 /* Types other than builtin types are substitution candidates. */
1954 if (!is_builtin_type)
1955 add_substitution (type);
1958 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1959 CV-qualifiers written for TYPE.
1961 <CV-qualifiers> ::= [r] [V] [K] */
1964 write_CV_qualifiers_for_type (const tree type)
1966 int num_qualifiers = 0;
1968 /* The order is specified by:
1970 "In cases where multiple order-insensitive qualifiers are
1971 present, they should be ordered 'K' (closest to the base type),
1972 'V', 'r', and 'U' (farthest from the base type) ..."
1974 Note that we do not use cp_type_quals below; given "const
1975 int[3]", the "const" is emitted with the "int", not with the
1977 cp_cv_quals quals = TYPE_QUALS (type);
1979 if (quals & TYPE_QUAL_RESTRICT)
1984 if (quals & TYPE_QUAL_VOLATILE)
1989 if (quals & TYPE_QUAL_CONST)
1995 return num_qualifiers;
1998 /* Non-terminal <builtin-type>.
2000 <builtin-type> ::= v # void
2005 ::= h # unsigned char
2007 ::= t # unsigned short
2009 ::= j # unsigned int
2011 ::= m # unsigned long
2012 ::= x # long long, __int64
2013 ::= y # unsigned long long, __int64
2015 ::= o # unsigned __int128
2018 ::= e # long double, __float80
2019 ::= g # __float128 [not supported]
2020 ::= u <source-name> # vendor extended type */
2023 write_builtin_type (tree type)
2025 if (TYPE_CANONICAL (type))
2026 type = TYPE_CANONICAL (type);
2028 switch (TREE_CODE (type))
2039 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2040 isn't in integer_type_nodes. */
2041 if (type == wchar_type_node)
2043 else if (type == char16_type_node)
2044 write_string ("Ds");
2045 else if (type == char32_type_node)
2046 write_string ("Di");
2047 else if (TYPE_FOR_JAVA (type))
2048 write_java_integer_type_codes (type);
2052 /* Assume TYPE is one of the shared integer type nodes. Find
2053 it in the array of these nodes. */
2055 for (itk = 0; itk < itk_none; ++itk)
2056 if (type == integer_types[itk])
2058 /* Print the corresponding single-letter code. */
2059 write_char (integer_type_codes[itk]);
2063 if (itk == itk_none)
2065 tree t = c_common_type_for_mode (TYPE_MODE (type),
2066 TYPE_UNSIGNED (type));
2073 if (TYPE_PRECISION (type) == 128)
2074 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
2077 /* Allow for cases where TYPE is not one of the shared
2078 integer type nodes and write a "vendor extended builtin
2079 type" with a name the form intN or uintN, respectively.
2080 Situations like this can happen if you have an
2081 __attribute__((__mode__(__SI__))) type and use exotic
2082 switches like '-mint8' on AVR. Of course, this is
2083 undefined by the C++ ABI (and '-mint8' is not even
2084 Standard C conforming), but when using such special
2085 options you're pretty much in nowhere land anyway. */
2087 char prec[11]; /* up to ten digits for an unsigned */
2089 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
2090 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
2091 write_char ('u'); /* "vendor extended builtin type" */
2092 write_unsigned_number (strlen (prefix) + strlen (prec));
2093 write_string (prefix);
2094 write_string (prec);
2101 if (type == float_type_node
2102 || type == java_float_type_node)
2104 else if (type == double_type_node
2105 || type == java_double_type_node)
2107 else if (type == long_double_type_node)
2109 else if (type == dfloat32_type_node)
2110 write_string ("Df");
2111 else if (type == dfloat64_type_node)
2112 write_string ("Dd");
2113 else if (type == dfloat128_type_node)
2114 write_string ("De");
2119 case FIXED_POINT_TYPE:
2120 write_string ("DF");
2121 if (GET_MODE_IBIT (TYPE_MODE (type)) > 0)
2122 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type)));
2123 if (type == fract_type_node
2124 || type == sat_fract_type_node
2125 || type == accum_type_node
2126 || type == sat_accum_type_node)
2128 else if (type == unsigned_fract_type_node
2129 || type == sat_unsigned_fract_type_node
2130 || type == unsigned_accum_type_node
2131 || type == sat_unsigned_accum_type_node)
2133 else if (type == short_fract_type_node
2134 || type == sat_short_fract_type_node
2135 || type == short_accum_type_node
2136 || type == sat_short_accum_type_node)
2138 else if (type == unsigned_short_fract_type_node
2139 || type == sat_unsigned_short_fract_type_node
2140 || type == unsigned_short_accum_type_node
2141 || type == sat_unsigned_short_accum_type_node)
2143 else if (type == long_fract_type_node
2144 || type == sat_long_fract_type_node
2145 || type == long_accum_type_node
2146 || type == sat_long_accum_type_node)
2148 else if (type == unsigned_long_fract_type_node
2149 || type == sat_unsigned_long_fract_type_node
2150 || type == unsigned_long_accum_type_node
2151 || type == sat_unsigned_long_accum_type_node)
2153 else if (type == long_long_fract_type_node
2154 || type == sat_long_long_fract_type_node
2155 || type == long_long_accum_type_node
2156 || type == sat_long_long_accum_type_node)
2158 else if (type == unsigned_long_long_fract_type_node
2159 || type == sat_unsigned_long_long_fract_type_node
2160 || type == unsigned_long_long_accum_type_node
2161 || type == sat_unsigned_long_long_accum_type_node)
2164 sorry ("mangling unknown fixed point type");
2165 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type)));
2166 if (TYPE_SATURATING (type))
2177 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2178 METHOD_TYPE. The return type is mangled before the parameter
2181 <function-type> ::= F [Y] <bare-function-type> E */
2184 write_function_type (const tree type)
2186 MANGLE_TRACE_TREE ("function-type", type);
2188 /* For a pointer to member function, the function type may have
2189 cv-qualifiers, indicating the quals for the artificial 'this'
2191 if (TREE_CODE (type) == METHOD_TYPE)
2193 /* The first parameter must be a POINTER_TYPE pointing to the
2194 `this' parameter. */
2195 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
2196 write_CV_qualifiers_for_type (this_type);
2200 /* We don't track whether or not a type is `extern "C"'. Note that
2201 you can have an `extern "C"' function that does not have
2202 `extern "C"' type, and vice versa:
2204 extern "C" typedef void function_t();
2205 function_t f; // f has C++ linkage, but its type is
2208 typedef void function_t();
2209 extern "C" function_t f; // Vice versa.
2212 write_bare_function_type (type, /*include_return_type_p=*/1,
2217 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2218 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2219 is mangled before the parameter types. If non-NULL, DECL is
2220 FUNCTION_DECL for the function whose type is being emitted.
2222 If DECL is a member of a Java type, then a literal 'J'
2223 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2226 <bare-function-type> ::= [J]</signature/ type>+ */
2229 write_bare_function_type (const tree type, const int include_return_type_p,
2234 MANGLE_TRACE_TREE ("bare-function-type", type);
2236 /* Detect Java methods and emit special encoding. */
2238 && DECL_FUNCTION_MEMBER_P (decl)
2239 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
2240 && !DECL_CONSTRUCTOR_P (decl)
2241 && !DECL_DESTRUCTOR_P (decl)
2242 && !DECL_CONV_FN_P (decl))
2252 /* Mangle the return type, if requested. */
2253 if (include_return_type_p || java_method_p)
2254 write_type (TREE_TYPE (type));
2256 /* Now mangle the types of the arguments. */
2257 write_method_parms (TYPE_ARG_TYPES (type),
2258 TREE_CODE (type) == METHOD_TYPE,
2262 /* Write the mangled representation of a method parameter list of
2263 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2264 considered a non-static method, and the this parameter is omitted.
2265 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2266 parameters are being emitted. */
2269 write_method_parms (tree parm_types, const int method_p, const tree decl)
2271 tree first_parm_type;
2272 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
2274 /* Assume this parameter type list is variable-length. If it ends
2275 with a void type, then it's not. */
2278 /* If this is a member function, skip the first arg, which is the
2280 "Member functions do not encode the type of their implicit this
2283 Similarly, there's no need to mangle artificial parameters, like
2284 the VTT parameters for constructors and destructors. */
2287 parm_types = TREE_CHAIN (parm_types);
2288 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
2290 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
2292 parm_types = TREE_CHAIN (parm_types);
2293 parm_decl = TREE_CHAIN (parm_decl);
2297 for (first_parm_type = parm_types;
2299 parm_types = TREE_CHAIN (parm_types))
2301 tree parm = TREE_VALUE (parm_types);
2302 if (parm == void_type_node)
2304 /* "Empty parameter lists, whether declared as () or
2305 conventionally as (void), are encoded with a void parameter
2307 if (parm_types == first_parm_type)
2309 /* If the parm list is terminated with a void type, it's
2312 /* A void type better be the last one. */
2313 gcc_assert (TREE_CHAIN (parm_types) == NULL);
2320 /* <builtin-type> ::= z # ellipsis */
2324 /* <class-enum-type> ::= <name> */
2327 write_class_enum_type (const tree type)
2329 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
2332 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2335 <template-args> ::= I <template-arg>* E */
2338 write_template_args (tree args)
2343 MANGLE_TRACE_TREE ("template-args", args);
2348 length = TREE_VEC_LENGTH (args);
2350 if (args && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
2352 /* We have nested template args. We want the innermost template
2354 args = TREE_VEC_ELT (args, length - 1);
2355 length = TREE_VEC_LENGTH (args);
2357 for (i = 0; i < length; ++i)
2358 write_template_arg (TREE_VEC_ELT (args, i));
2365 <unqualified-name> <template-args>
2366 part of SCOPE_REF or COMPONENT_REF mangling. */
2369 write_member_name (tree member)
2371 if (TREE_CODE (member) == IDENTIFIER_NODE)
2372 write_unqualified_id (member);
2373 else if (DECL_P (member))
2374 write_unqualified_name (member);
2375 else if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2377 tree name = TREE_OPERAND (member, 0);
2378 if (TREE_CODE (name) == OVERLOAD)
2379 name = OVL_FUNCTION (name);
2380 write_member_name (name);
2381 write_template_args (TREE_OPERAND (member, 1));
2384 write_expression (member);
2387 /* <expression> ::= <unary operator-name> <expression>
2388 ::= <binary operator-name> <expression> <expression>
2391 <expr-primary> ::= <template-param>
2392 ::= L <type> <value number> E # literal
2393 ::= L <mangled-name> E # external name
2394 ::= st <type> # sizeof
2395 ::= sr <type> <unqualified-name> # dependent name
2396 ::= sr <type> <unqualified-name> <template-args> */
2399 write_expression (tree expr)
2401 enum tree_code code = TREE_CODE (expr);
2403 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2404 is converted (via qualification conversions) to another
2406 while (TREE_CODE (expr) == NOP_EXPR
2407 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2409 expr = TREE_OPERAND (expr, 0);
2410 code = TREE_CODE (expr);
2413 if (code == BASELINK)
2415 expr = BASELINK_FUNCTIONS (expr);
2416 code = TREE_CODE (expr);
2419 /* Handle pointers-to-members by making them look like expression
2421 if (code == PTRMEM_CST)
2423 expr = build_nt (ADDR_EXPR,
2424 build_qualified_name (/*type=*/NULL_TREE,
2425 PTRMEM_CST_CLASS (expr),
2426 PTRMEM_CST_MEMBER (expr),
2427 /*template_p=*/false));
2428 code = TREE_CODE (expr);
2431 /* Handle template parameters. */
2432 if (code == TEMPLATE_TYPE_PARM
2433 || code == TEMPLATE_TEMPLATE_PARM
2434 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2435 || code == TEMPLATE_PARM_INDEX)
2436 write_template_param (expr);
2437 /* Handle literals. */
2438 else if (TREE_CODE_CLASS (code) == tcc_constant
2439 || (abi_version_at_least (2) && code == CONST_DECL))
2440 write_template_arg_literal (expr);
2441 else if (code == PARM_DECL)
2443 /* A function parameter used in a late-specified return type. */
2444 int index = DECL_PARM_INDEX (expr);
2445 gcc_assert (index >= 1);
2446 write_string ("fp");
2447 write_compact_number (index - 1);
2449 else if (DECL_P (expr))
2451 /* G++ 3.2 incorrectly mangled non-type template arguments of
2452 enumeration type using their names. */
2453 if (code == CONST_DECL)
2454 G.need_abi_warning = 1;
2456 write_mangled_name (expr, false);
2459 else if (TREE_CODE (expr) == SIZEOF_EXPR
2460 && TYPE_P (TREE_OPERAND (expr, 0)))
2462 write_string ("st");
2463 write_type (TREE_OPERAND (expr, 0));
2465 else if (TREE_CODE (expr) == ALIGNOF_EXPR
2466 && TYPE_P (TREE_OPERAND (expr, 0)))
2468 write_string ("at");
2469 write_type (TREE_OPERAND (expr, 0));
2471 else if (TREE_CODE (expr) == SCOPE_REF)
2473 tree scope = TREE_OPERAND (expr, 0);
2474 tree member = TREE_OPERAND (expr, 1);
2476 if (!abi_version_at_least (2))
2478 write_string ("sr");
2480 /* G++ 3.2 incorrectly put out both the "sr" code and
2481 the nested name of the qualified name. */
2482 G.need_abi_warning = 1;
2483 write_encoding (member);
2486 /* If the MEMBER is a real declaration, then the qualifying
2487 scope was not dependent. Ideally, we would not have a
2488 SCOPE_REF in those cases, but sometimes we do. If the second
2489 argument is a DECL, then the name must not have been
2491 else if (DECL_P (member))
2492 write_expression (member);
2495 write_string ("sr");
2497 write_member_name (member);
2500 else if (TREE_CODE (expr) == INDIRECT_REF
2501 && TREE_TYPE (TREE_OPERAND (expr, 0))
2502 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2504 write_expression (TREE_OPERAND (expr, 0));
2506 else if (TREE_CODE (expr) == IDENTIFIER_NODE)
2508 /* An operator name appearing as a dependent name needs to be
2509 specially marked to disambiguate between a use of the operator
2510 name and a use of the operator in an expression. */
2511 if (IDENTIFIER_OPNAME_P (expr))
2512 write_string ("on");
2513 write_unqualified_id (expr);
2515 else if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
2517 tree fn = TREE_OPERAND (expr, 0);
2518 if (is_overloaded_fn (fn))
2519 fn = DECL_NAME (get_first_fn (fn));
2520 if (IDENTIFIER_OPNAME_P (fn))
2521 write_string ("on");
2522 write_unqualified_id (fn);
2523 write_template_args (TREE_OPERAND (expr, 1));
2530 /* When we bind a variable or function to a non-type template
2531 argument with reference type, we create an ADDR_EXPR to show
2532 the fact that the entity's address has been taken. But, we
2533 don't actually want to output a mangling code for the `&'. */
2534 if (TREE_CODE (expr) == ADDR_EXPR
2536 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2538 expr = TREE_OPERAND (expr, 0);
2541 write_expression (expr);
2545 code = TREE_CODE (expr);
2548 if (code == COMPONENT_REF)
2550 tree ob = TREE_OPERAND (expr, 0);
2552 if (TREE_CODE (ob) == ARROW_EXPR)
2554 write_string (operator_name_info[(int)code].mangled_name);
2555 ob = TREE_OPERAND (ob, 0);
2558 write_string ("dt");
2560 write_expression (ob);
2561 write_member_name (TREE_OPERAND (expr, 1));
2565 /* If it wasn't any of those, recursively expand the expression. */
2566 name = operator_name_info[(int) code].mangled_name;
2569 sorry ("mangling %C", code);
2573 write_string (name);
2579 tree fn = CALL_EXPR_FN (expr);
2581 if (TREE_CODE (fn) == ADDR_EXPR)
2582 fn = TREE_OPERAND (fn, 0);
2584 /* Mangle a dependent name as the name, not whatever happens to
2585 be the first function in the overload set. */
2586 if ((TREE_CODE (fn) == FUNCTION_DECL
2587 || TREE_CODE (fn) == OVERLOAD)
2588 && type_dependent_expression_p_push (expr))
2589 fn = DECL_NAME (get_first_fn (fn));
2591 write_expression (fn);
2594 for (i = 0; i < call_expr_nargs (expr); ++i)
2595 write_expression (CALL_EXPR_ARG (expr, i));
2600 write_type (TREE_TYPE (expr));
2601 if (list_length (TREE_OPERAND (expr, 0)) == 1)
2602 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2605 tree args = TREE_OPERAND (expr, 0);
2607 for (; args; args = TREE_CHAIN (args))
2608 write_expression (TREE_VALUE (args));
2613 /* FIXME these should have a distinct mangling. */
2614 case STATIC_CAST_EXPR:
2615 case CONST_CAST_EXPR:
2616 write_type (TREE_TYPE (expr));
2617 write_expression (TREE_OPERAND (expr, 0));
2621 sorry ("mangling new-expression");
2625 /* In the middle-end, some expressions have more operands than
2626 they do in templates (and mangling). */
2629 case PREINCREMENT_EXPR:
2630 case PREDECREMENT_EXPR:
2631 case POSTINCREMENT_EXPR:
2632 case POSTDECREMENT_EXPR:
2641 len = TREE_OPERAND_LENGTH (expr);
2645 for (i = 0; i < len; ++i)
2647 tree operand = TREE_OPERAND (expr, i);
2648 /* As a GNU extension, the middle operand of a
2649 conditional may be omitted. Since expression
2650 manglings are supposed to represent the input token
2651 stream, there's no good way to mangle such an
2652 expression without extending the C++ ABI. */
2653 if (code == COND_EXPR && i == 1 && !operand)
2655 error ("omitted middle operand to %<?:%> operand "
2656 "cannot be mangled");
2659 write_expression (operand);
2665 /* Literal subcase of non-terminal <template-arg>.
2667 "Literal arguments, e.g. "A<42L>", are encoded with their type
2668 and value. Negative integer values are preceded with "n"; for
2669 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2670 encoded as 0, true as 1." */
2673 write_template_arg_literal (const tree value)
2676 write_type (TREE_TYPE (value));
2678 switch (TREE_CODE (value))
2681 write_integer_cst (DECL_INITIAL (value));
2685 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
2686 || integer_zerop (value) || integer_onep (value));
2687 write_integer_cst (value);
2691 write_real_cst (value);
2701 /* Non-terminal <template-arg>.
2703 <template-arg> ::= <type> # type
2704 ::= L <type> </value/ number> E # literal
2705 ::= LZ <name> E # external name
2706 ::= X <expression> E # expression */
2709 write_template_arg (tree node)
2711 enum tree_code code = TREE_CODE (node);
2713 MANGLE_TRACE_TREE ("template-arg", node);
2715 /* A template template parameter's argument list contains TREE_LIST
2716 nodes of which the value field is the actual argument. */
2717 if (code == TREE_LIST)
2719 node = TREE_VALUE (node);
2720 /* If it's a decl, deal with its type instead. */
2723 node = TREE_TYPE (node);
2724 code = TREE_CODE (node);
2728 if (TREE_CODE (node) == NOP_EXPR
2729 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
2731 /* Template parameters can be of reference type. To maintain
2732 internal consistency, such arguments use a conversion from
2733 address of object to reference type. */
2734 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
2735 if (abi_version_at_least (2))
2736 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
2738 G.need_abi_warning = 1;
2741 if (ARGUMENT_PACK_P (node))
2743 /* Expand the template argument pack. */
2744 tree args = ARGUMENT_PACK_ARGS (node);
2745 int i, length = TREE_VEC_LENGTH (args);
2747 for (i = 0; i < length; ++i)
2748 write_template_arg (TREE_VEC_ELT (args, i));
2751 else if (TYPE_P (node))
2753 else if (code == TEMPLATE_DECL)
2754 /* A template appearing as a template arg is a template template arg. */
2755 write_template_template_arg (node);
2756 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
2757 || (abi_version_at_least (2) && code == CONST_DECL))
2758 write_template_arg_literal (node);
2759 else if (DECL_P (node))
2761 /* Until ABI version 2, non-type template arguments of
2762 enumeration type were mangled using their names. */
2763 if (code == CONST_DECL && !abi_version_at_least (2))
2764 G.need_abi_warning = 1;
2766 /* Until ABI version 3, the underscore before the mangled name
2767 was incorrectly omitted. */
2768 if (!abi_version_at_least (3))
2770 G.need_abi_warning = 1;
2774 write_string ("_Z");
2775 write_encoding (node);
2780 /* Template arguments may be expressions. */
2782 write_expression (node);
2787 /* <template-template-arg>
2789 ::= <substitution> */
2792 write_template_template_arg (const tree decl)
2794 MANGLE_TRACE_TREE ("template-template-arg", decl);
2796 if (find_substitution (decl))
2798 write_name (decl, /*ignore_local_scope=*/0);
2799 add_substitution (decl);
2803 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2805 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2806 ::= A <expression> _ </element/ type>
2808 "Array types encode the dimension (number of elements) and the
2809 element type. For variable length arrays, the dimension (but not
2810 the '_' separator) is omitted." */
2813 write_array_type (const tree type)
2816 if (TYPE_DOMAIN (type))
2821 index_type = TYPE_DOMAIN (type);
2822 /* The INDEX_TYPE gives the upper and lower bounds of the
2824 max = TYPE_MAX_VALUE (index_type);
2825 if (TREE_CODE (max) == INTEGER_CST)
2827 /* The ABI specifies that we should mangle the number of
2828 elements in the array, not the largest allowed index. */
2829 max = size_binop (PLUS_EXPR, max, size_one_node);
2830 write_unsigned_number (tree_low_cst (max, 1));
2834 max = TREE_OPERAND (max, 0);
2835 if (!abi_version_at_least (2))
2837 /* value_dependent_expression_p presumes nothing is
2838 dependent when PROCESSING_TEMPLATE_DECL is zero. */
2839 ++processing_template_decl;
2840 if (!value_dependent_expression_p (max))
2841 G.need_abi_warning = 1;
2842 --processing_template_decl;
2844 write_expression (max);
2849 write_type (TREE_TYPE (type));
2852 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2853 variables. TYPE is a pointer-to-member POINTER_TYPE.
2855 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2858 write_pointer_to_member_type (const tree type)
2861 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2862 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2865 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2866 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2867 TEMPLATE_PARM_INDEX.
2869 <template-param> ::= T </parameter/ number> _ */
2872 write_template_param (const tree parm)
2876 MANGLE_TRACE_TREE ("template-parm", parm);
2878 switch (TREE_CODE (parm))
2880 case TEMPLATE_TYPE_PARM:
2881 case TEMPLATE_TEMPLATE_PARM:
2882 case BOUND_TEMPLATE_TEMPLATE_PARM:
2883 parm_index = TEMPLATE_TYPE_IDX (parm);
2886 case TEMPLATE_PARM_INDEX:
2887 parm_index = TEMPLATE_PARM_IDX (parm);
2895 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2896 earliest template param denoted by `_'. */
2897 write_compact_number (parm_index);
2900 /* <template-template-param>
2901 ::= <template-param>
2902 ::= <substitution> */
2905 write_template_template_param (const tree parm)
2907 tree templ = NULL_TREE;
2909 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2910 template template parameter. The substitution candidate here is
2911 only the template. */
2912 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2915 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2916 if (find_substitution (templ))
2920 /* <template-param> encodes only the template parameter position,
2921 not its template arguments, which is fine here. */
2922 write_template_param (parm);
2924 add_substitution (templ);
2927 /* Non-terminal <substitution>.
2929 <substitution> ::= S <seq-id> _
2933 write_substitution (const int seq_id)
2935 MANGLE_TRACE ("substitution", "");
2939 write_number (seq_id - 1, /*unsigned=*/1, 36);
2943 /* Start mangling ENTITY. */
2946 start_mangling (const tree entity)
2949 G.need_abi_warning = false;
2950 obstack_free (&name_obstack, name_base);
2951 mangle_obstack = &name_obstack;
2952 name_base = obstack_alloc (&name_obstack, 0);
2955 /* Done with mangling. If WARN is true, and the name of G.entity will
2956 be mangled differently in a future version of the ABI, issue a
2960 finish_mangling_internal (const bool warn)
2962 if (warn_abi && warn && G.need_abi_warning)
2963 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
2967 /* Clear all the substitutions. */
2968 VEC_truncate (tree, G.substitutions, 0);
2970 /* Null-terminate the string. */
2975 /* Like finish_mangling_internal, but return the mangled string. */
2977 static inline const char *
2978 finish_mangling (const bool warn)
2980 finish_mangling_internal (warn);
2981 return (const char *) obstack_finish (mangle_obstack);
2984 /* Like finish_mangling_internal, but return an identifier. */
2987 finish_mangling_get_identifier (const bool warn)
2989 finish_mangling_internal (warn);
2990 /* Don't obstack_finish here, and the next start_mangling will
2991 remove the identifier. */
2992 return get_identifier ((const char *) obstack_base (mangle_obstack));
2995 /* Initialize data structures for mangling. */
3000 gcc_obstack_init (&name_obstack);
3001 name_base = obstack_alloc (&name_obstack, 0);
3002 G.substitutions = NULL;
3004 /* Cache these identifiers for quick comparison when checking for
3005 standard substitutions. */
3006 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
3007 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
3008 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
3009 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
3010 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
3011 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
3014 /* Generate the mangled name of DECL. */
3017 mangle_decl_string (const tree decl)
3020 location_t saved_loc = input_location;
3021 tree saved_fn = NULL_TREE;
3022 bool template_p = false;
3024 if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
3026 struct tinst_level *tl = current_instantiation ();
3027 if (!tl || tl->decl != decl)
3030 saved_fn = current_function_decl;
3031 push_tinst_level (decl);
3032 current_function_decl = NULL_TREE;
3035 input_location = DECL_SOURCE_LOCATION (decl);
3037 start_mangling (decl);
3039 if (TREE_CODE (decl) == TYPE_DECL)
3040 write_type (TREE_TYPE (decl));
3042 write_mangled_name (decl, true);
3044 result = finish_mangling_get_identifier (/*warn=*/true);
3046 fprintf (stderr, "mangle_decl_string = '%s'\n\n",
3047 IDENTIFIER_POINTER (result));
3052 current_function_decl = saved_fn;
3054 input_location = saved_loc;
3059 /* Create an identifier for the external mangled name of DECL. */
3062 mangle_decl (const tree decl)
3064 tree id = mangle_decl_string (decl);
3065 id = targetm.mangle_decl_assembler_name (decl, id);
3066 SET_DECL_ASSEMBLER_NAME (decl, id);
3068 if (G.need_abi_warning)
3070 #ifdef ASM_OUTPUT_DEF
3071 /* If the mangling will change in the future, emit an alias with the
3072 future mangled name for forward-compatibility. */
3077 SET_IDENTIFIER_GLOBAL_VALUE (id, decl);
3078 if (IDENTIFIER_GLOBAL_VALUE (id) != decl)
3079 inform (DECL_SOURCE_LOCATION (decl), "-fabi-version=4 (or =0) "
3080 "avoids this error with a change in vector mangling");
3082 #ifdef ASM_OUTPUT_DEF
3083 save_ver = flag_abi_version;
3084 flag_abi_version = 0;
3085 id2 = mangle_decl_string (decl);
3086 id2 = targetm.mangle_decl_assembler_name (decl, id2);
3087 flag_abi_version = save_ver;
3089 alias = make_alias_for (decl, id2);
3090 DECL_IGNORED_P (alias) = 1;
3091 TREE_PUBLIC (alias) = TREE_PUBLIC (decl);
3092 DECL_VISIBILITY (alias) = DECL_VISIBILITY (decl);
3093 if (vague_linkage_p (decl))
3094 DECL_WEAK (alias) = 1;
3095 if (TREE_CODE (decl) == FUNCTION_DECL)
3096 cgraph_same_body_alias (alias, decl);
3098 varpool_extra_name_alias (alias, decl);
3103 /* Generate the mangled representation of TYPE. */
3106 mangle_type_string (const tree type)
3110 start_mangling (type);
3112 result = finish_mangling (/*warn=*/false);
3114 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
3118 /* Create an identifier for the mangled name of a special component
3119 for belonging to TYPE. CODE is the ABI-specified code for this
3123 mangle_special_for_type (const tree type, const char *code)
3127 /* We don't have an actual decl here for the special component, so
3128 we can't just process the <encoded-name>. Instead, fake it. */
3129 start_mangling (type);
3131 /* Start the mangling. */
3132 write_string ("_Z");
3133 write_string (code);
3137 result = finish_mangling_get_identifier (/*warn=*/false);
3140 fprintf (stderr, "mangle_special_for_type = %s\n\n",
3141 IDENTIFIER_POINTER (result));
3146 /* Create an identifier for the mangled representation of the typeinfo
3147 structure for TYPE. */
3150 mangle_typeinfo_for_type (const tree type)
3152 return mangle_special_for_type (type, "TI");
3155 /* Create an identifier for the mangled name of the NTBS containing
3156 the mangled name of TYPE. */
3159 mangle_typeinfo_string_for_type (const tree type)
3161 return mangle_special_for_type (type, "TS");
3164 /* Create an identifier for the mangled name of the vtable for TYPE. */
3167 mangle_vtbl_for_type (const tree type)
3169 return mangle_special_for_type (type, "TV");
3172 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3175 mangle_vtt_for_type (const tree type)
3177 return mangle_special_for_type (type, "TT");
3180 /* Return an identifier for a construction vtable group. TYPE is
3181 the most derived class in the hierarchy; BINFO is the base
3182 subobject for which this construction vtable group will be used.
3184 This mangling isn't part of the ABI specification; in the ABI
3185 specification, the vtable group is dumped in the same COMDAT as the
3186 main vtable, and is referenced only from that vtable, so it doesn't
3187 need an external name. For binary formats without COMDAT sections,
3188 though, we need external names for the vtable groups.
3190 We use the production
3192 <special-name> ::= CT <type> <offset number> _ <base type> */
3195 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
3199 start_mangling (type);
3201 write_string ("_Z");
3202 write_string ("TC");
3204 write_integer_cst (BINFO_OFFSET (binfo));
3206 write_type (BINFO_TYPE (binfo));
3208 result = finish_mangling_get_identifier (/*warn=*/false);
3210 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n",
3211 IDENTIFIER_POINTER (result));
3215 /* Mangle a this pointer or result pointer adjustment.
3217 <call-offset> ::= h <fixed offset number> _
3218 ::= v <fixed offset number> _ <virtual offset number> _ */
3221 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
3223 write_char (virtual_offset ? 'v' : 'h');
3225 /* For either flavor, write the fixed offset. */
3226 write_integer_cst (fixed_offset);
3229 /* For a virtual thunk, add the virtual offset. */
3232 write_integer_cst (virtual_offset);
3237 /* Return an identifier for the mangled name of a this-adjusting or
3238 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3239 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3240 is a virtual thunk, and it is the vtbl offset in
3241 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3242 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3243 thunk itself. A covariant thunk name always includes the adjustment
3244 for the this pointer, even if there is none.
3246 <special-name> ::= T <call-offset> <base encoding>
3247 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3251 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
3252 tree virtual_offset)
3256 start_mangling (fn_decl);
3258 write_string ("_Z");
3261 if (!this_adjusting)
3263 /* Covariant thunk with no this adjustment */
3265 mangle_call_offset (integer_zero_node, NULL_TREE);
3266 mangle_call_offset (fixed_offset, virtual_offset);
3268 else if (!DECL_THUNK_P (fn_decl))
3269 /* Plain this adjusting thunk. */
3270 mangle_call_offset (fixed_offset, virtual_offset);
3273 /* This adjusting thunk to covariant thunk. */
3275 mangle_call_offset (fixed_offset, virtual_offset);
3276 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
3277 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
3279 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
3280 mangle_call_offset (fixed_offset, virtual_offset);
3281 fn_decl = THUNK_TARGET (fn_decl);
3285 write_encoding (fn_decl);
3287 result = finish_mangling_get_identifier (/*warn=*/false);
3289 fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result));
3293 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3294 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3297 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
3299 /* Hash a node (VAL1) in the table. */
3302 hash_type (const void *val)
3304 return (hashval_t) TYPE_UID (TREE_TYPE ((const_tree) val));
3307 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3310 compare_type (const void *val1, const void *val2)
3312 return TREE_TYPE ((const_tree) val1) == (const_tree) val2;
3315 /* Return an identifier for the mangled unqualified name for a
3316 conversion operator to TYPE. This mangling is not specified by the
3317 ABI spec; it is only used internally. */
3320 mangle_conv_op_name_for_type (const tree type)
3325 if (type == error_mark_node)
3326 return error_mark_node;
3328 if (conv_type_names == NULL)
3329 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
3331 slot = htab_find_slot_with_hash (conv_type_names, type,
3332 (hashval_t) TYPE_UID (type), INSERT);
3333 identifier = (tree)*slot;
3338 /* Create a unique name corresponding to TYPE. */
3339 sprintf (buffer, "operator %lu",
3340 (unsigned long) htab_elements (conv_type_names));
3341 identifier = get_identifier (buffer);
3344 /* Hang TYPE off the identifier so it can be found easily later
3345 when performing conversions. */
3346 TREE_TYPE (identifier) = type;
3348 /* Set bits on the identifier so we know later it's a conversion. */
3349 IDENTIFIER_OPNAME_P (identifier) = 1;
3350 IDENTIFIER_TYPENAME_P (identifier) = 1;
3356 /* Return an identifier for the name of an initialization guard
3357 variable for indicated VARIABLE. */
3360 mangle_guard_variable (const tree variable)
3362 start_mangling (variable);
3363 write_string ("_ZGV");
3364 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
3365 /* The name of a guard variable for a reference temporary should refer
3366 to the reference, not the temporary. */
3367 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
3369 write_name (variable, /*ignore_local_scope=*/0);
3370 return finish_mangling_get_identifier (/*warn=*/false);
3373 /* Return an identifier for the name of a temporary variable used to
3374 initialize a static reference. This isn't part of the ABI, but we might
3375 as well call them something readable. */
3378 mangle_ref_init_variable (const tree variable)
3380 start_mangling (variable);
3381 write_string ("_ZGR");
3382 write_name (variable, /*ignore_local_scope=*/0);
3383 return finish_mangling_get_identifier (/*warn=*/false);
3387 /* Foreign language type mangling section. */
3389 /* How to write the type codes for the integer Java type. */
3392 write_java_integer_type_codes (const tree type)
3394 if (type == java_int_type_node)
3396 else if (type == java_short_type_node)
3398 else if (type == java_byte_type_node)
3400 else if (type == java_char_type_node)
3402 else if (type == java_long_type_node)
3404 else if (type == java_boolean_type_node)
3410 #include "gt-cp-mangle.h"