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"
62 /* Debugging support. */
64 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
66 #define DEBUG_MANGLE 0
69 /* Macros for tracing the write_* functions. */
71 # define MANGLE_TRACE(FN, INPUT) \
72 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
73 # define MANGLE_TRACE_TREE(FN, NODE) \
74 fprintf (stderr, " %-24s: %-24s (%p)\n", \
75 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
77 # define MANGLE_TRACE(FN, INPUT)
78 # define MANGLE_TRACE_TREE(FN, NODE)
81 /* Nonzero if NODE is a class template-id. We can't rely on
82 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
83 that hard to distinguish A<T> from A, where A<T> is the type as
84 instantiated outside of the template, and A is the type used
85 without parameters inside the template. */
86 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
87 (TYPE_LANG_SPECIFIC (NODE) != NULL \
88 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
89 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
90 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
92 /* Things we only need one of. This module is not reentrant. */
93 typedef struct GTY(()) globals {
94 /* An array of the current substitution candidates, in the order
96 VEC(tree,gc) *substitutions;
98 /* The entity that is being mangled. */
99 tree GTY ((skip)) entity;
101 /* True if the mangling will be different in a future version of the
103 bool need_abi_warning;
106 static GTY (()) globals G;
108 /* The obstack on which we build mangled names. */
109 static struct obstack *mangle_obstack;
111 /* The obstack on which we build mangled names that are not going to
112 be IDENTIFIER_NODEs. */
113 static struct obstack name_obstack;
115 /* The first object on the name_obstack; we use this to free memory
116 allocated on the name_obstack. */
117 static void *name_base;
119 /* Indices into subst_identifiers. These are identifiers used in
120 special substitution rules. */
128 SUBID_BASIC_IOSTREAM,
131 substitution_identifier_index_t;
133 /* For quick substitution checks, look up these common identifiers
135 static GTY(()) tree subst_identifiers[SUBID_MAX];
137 /* Single-letter codes for builtin integer types, defined in
138 <builtin-type>. These are indexed by integer_type_kind values. */
140 integer_type_codes[itk_none] =
143 'a', /* itk_signed_char */
144 'h', /* itk_unsigned_char */
146 't', /* itk_unsigned_short */
148 'j', /* itk_unsigned_int */
150 'm', /* itk_unsigned_long */
151 'x', /* itk_long_long */
152 'y' /* itk_unsigned_long_long */
155 static int decl_is_template_id (const tree, tree* const);
157 /* Functions for handling substitutions. */
159 static inline tree canonicalize_for_substitution (tree);
160 static void add_substitution (tree);
161 static inline int is_std_substitution (const tree,
162 const substitution_identifier_index_t);
163 static inline int is_std_substitution_char (const tree,
164 const substitution_identifier_index_t);
165 static int find_substitution (tree);
166 static void mangle_call_offset (const tree, const tree);
168 /* Functions for emitting mangled representations of things. */
170 static void write_mangled_name (const tree, bool);
171 static void write_encoding (const tree);
172 static void write_name (tree, const int);
173 static void write_unscoped_name (const tree);
174 static void write_unscoped_template_name (const tree);
175 static void write_nested_name (const tree);
176 static void write_prefix (const tree);
177 static void write_template_prefix (const tree);
178 static void write_unqualified_name (const tree);
179 static void write_conversion_operator_name (const tree);
180 static void write_source_name (tree);
181 static void write_unnamed_type_name (const tree);
182 static void write_closure_type_name (const tree);
183 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
185 static void write_number (unsigned HOST_WIDE_INT, const int,
187 static void write_compact_number (int num);
188 static void write_integer_cst (const tree);
189 static void write_real_cst (const tree);
190 static void write_identifier (const char *);
191 static void write_special_name_constructor (const tree);
192 static void write_special_name_destructor (const tree);
193 static void write_type (tree);
194 static int write_CV_qualifiers_for_type (const tree);
195 static void write_builtin_type (tree);
196 static void write_function_type (const tree);
197 static void write_bare_function_type (const tree, const int, const tree);
198 static void write_method_parms (tree, const int, const tree);
199 static void write_class_enum_type (const tree);
200 static void write_template_args (tree);
201 static void write_expression (tree);
202 static void write_template_arg_literal (const tree);
203 static void write_template_arg (tree);
204 static void write_template_template_arg (const tree);
205 static void write_array_type (const tree);
206 static void write_pointer_to_member_type (const tree);
207 static void write_template_param (const tree);
208 static void write_template_template_param (const tree);
209 static void write_substitution (const int);
210 static int discriminator_for_local_entity (tree);
211 static int discriminator_for_string_literal (tree, tree);
212 static void write_discriminator (const int);
213 static void write_local_name (tree, const tree, const tree);
214 static void dump_substitution_candidates (void);
215 static tree mangle_decl_string (const tree);
216 static int local_class_index (tree);
218 /* Control functions. */
220 static inline void start_mangling (const tree);
221 static inline const char *finish_mangling (const bool);
222 static tree mangle_special_for_type (const tree, const char *);
224 /* Foreign language functions. */
226 static void write_java_integer_type_codes (const tree);
228 /* Append a single character to the end of the mangled
230 #define write_char(CHAR) \
231 obstack_1grow (mangle_obstack, (CHAR))
233 /* Append a sized buffer to the end of the mangled representation. */
234 #define write_chars(CHAR, LEN) \
235 obstack_grow (mangle_obstack, (CHAR), (LEN))
237 /* Append a NUL-terminated string to the end of the mangled
239 #define write_string(STRING) \
240 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
242 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
243 same purpose (context, which may be a type) and value (template
244 decl). See write_template_prefix for more information on what this
246 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
247 (TREE_CODE (NODE1) == TREE_LIST \
248 && TREE_CODE (NODE2) == TREE_LIST \
249 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
250 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
251 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
252 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
254 /* Write out an unsigned quantity in base 10. */
255 #define write_unsigned_number(NUMBER) \
256 write_number ((NUMBER), /*unsigned_p=*/1, 10)
258 /* If DECL is a template instance, return nonzero and, if
259 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
260 Otherwise return zero. */
263 decl_is_template_id (const tree decl, tree* const template_info)
265 if (TREE_CODE (decl) == TYPE_DECL)
267 /* TYPE_DECLs are handled specially. Look at its type to decide
268 if this is a template instantiation. */
269 const tree type = TREE_TYPE (decl);
271 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
273 if (template_info != NULL)
274 /* For a templated TYPE_DECL, the template info is hanging
276 *template_info = TYPE_TEMPLATE_INFO (type);
282 /* Check if this is a primary template. */
283 if (DECL_LANG_SPECIFIC (decl) != NULL
284 && DECL_USE_TEMPLATE (decl)
285 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
286 && TREE_CODE (decl) != TEMPLATE_DECL)
288 if (template_info != NULL)
289 /* For most templated decls, the template info is hanging
291 *template_info = DECL_TEMPLATE_INFO (decl);
296 /* It's not a template id. */
300 /* Produce debugging output of current substitution candidates. */
303 dump_substitution_candidates (void)
308 fprintf (stderr, " ++ substitutions ");
309 for (i = 0; VEC_iterate (tree, G.substitutions, i, el); ++i)
311 const char *name = "???";
314 fprintf (stderr, " ");
316 name = IDENTIFIER_POINTER (DECL_NAME (el));
317 else if (TREE_CODE (el) == TREE_LIST)
318 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
319 else if (TYPE_NAME (el))
320 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
321 fprintf (stderr, " S%d_ = ", i - 1);
323 (CP_TYPE_RESTRICT_P (el)
324 || CP_TYPE_VOLATILE_P (el)
325 || CP_TYPE_CONST_P (el)))
326 fprintf (stderr, "CV-");
327 fprintf (stderr, "%s (%s at %p)\n",
328 name, tree_code_name[TREE_CODE (el)], (void *) el);
332 /* Both decls and types can be substitution candidates, but sometimes
333 they refer to the same thing. For instance, a TYPE_DECL and
334 RECORD_TYPE for the same class refer to the same thing, and should
335 be treated accordingly in substitutions. This function returns a
336 canonicalized tree node representing NODE that is used when adding
337 and substitution candidates and finding matches. */
340 canonicalize_for_substitution (tree node)
342 /* For a TYPE_DECL, use the type instead. */
343 if (TREE_CODE (node) == TYPE_DECL)
344 node = TREE_TYPE (node);
346 && TYPE_CANONICAL (node) != node
347 && TYPE_MAIN_VARIANT (node) != node)
348 /* Here we want to strip the topmost typedef only.
349 We need to do that so is_std_substitution can do proper
351 node = cp_build_qualified_type (TYPE_MAIN_VARIANT (node),
352 cp_type_quals (node));
356 /* Add NODE as a substitution candidate. NODE must not already be on
357 the list of candidates. */
360 add_substitution (tree node)
365 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
366 tree_code_name[TREE_CODE (node)], (void *) node);
368 /* Get the canonicalized substitution candidate for NODE. */
369 c = canonicalize_for_substitution (node);
370 if (DEBUG_MANGLE && c != node)
371 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
372 tree_code_name[TREE_CODE (node)], (void *) node);
376 /* Make sure NODE isn't already a candidate. */
381 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++)
383 gcc_assert (!(DECL_P (node) && node == candidate));
384 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
385 && same_type_p (node, candidate)));
388 #endif /* ENABLE_CHECKING */
390 /* Put the decl onto the varray of substitution candidates. */
391 VEC_safe_push (tree, gc, G.substitutions, node);
394 dump_substitution_candidates ();
397 /* Helper function for find_substitution. Returns nonzero if NODE,
398 which may be a decl or a CLASS_TYPE, is a template-id with template
399 name of substitution_index[INDEX] in the ::std namespace. */
402 is_std_substitution (const tree node,
403 const substitution_identifier_index_t index)
410 type = TREE_TYPE (node);
413 else if (CLASS_TYPE_P (node))
416 decl = TYPE_NAME (node);
419 /* These are not the droids you're looking for. */
422 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
423 && TYPE_LANG_SPECIFIC (type)
424 && TYPE_TEMPLATE_INFO (type)
425 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
426 == subst_identifiers[index]));
429 /* Helper function for find_substitution. Returns nonzero if NODE,
430 which may be a decl or a CLASS_TYPE, is the template-id
431 ::std::identifier<char>, where identifier is
432 substitution_index[INDEX]. */
435 is_std_substitution_char (const tree node,
436 const substitution_identifier_index_t index)
439 /* Check NODE's name is ::std::identifier. */
440 if (!is_std_substitution (node, index))
442 /* Figure out its template args. */
444 args = DECL_TI_ARGS (node);
445 else if (CLASS_TYPE_P (node))
446 args = CLASSTYPE_TI_ARGS (node);
448 /* Oops, not a template. */
450 /* NODE's template arg list should be <char>. */
452 TREE_VEC_LENGTH (args) == 1
453 && TREE_VEC_ELT (args, 0) == char_type_node;
456 /* Check whether a substitution should be used to represent NODE in
459 First, check standard special-case substitutions.
461 <substitution> ::= St
468 # ::std::basic_string
471 # ::std::basic_string<char,
472 ::std::char_traits<char>,
473 ::std::allocator<char> >
476 # ::std::basic_istream<char, ::std::char_traits<char> >
479 # ::std::basic_ostream<char, ::std::char_traits<char> >
482 # ::std::basic_iostream<char, ::std::char_traits<char> >
484 Then examine the stack of currently available substitution
485 candidates for entities appearing earlier in the same mangling
487 If a substitution is found, write its mangled representation and
488 return nonzero. If none is found, just return zero. */
491 find_substitution (tree node)
494 const int size = VEC_length (tree, G.substitutions);
499 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
500 tree_code_name[TREE_CODE (node)], (void *) node);
502 /* Obtain the canonicalized substitution representation for NODE.
503 This is what we'll compare against. */
504 node = canonicalize_for_substitution (node);
506 /* Check for builtin substitutions. */
508 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
509 type = TYPE_P (node) ? node : TREE_TYPE (node);
511 /* Check for std::allocator. */
513 && is_std_substitution (decl, SUBID_ALLOCATOR)
514 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
520 /* Check for std::basic_string. */
521 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
525 /* If this is a type (i.e. a fully-qualified template-id),
527 std::basic_string <char,
528 std::char_traits<char>,
529 std::allocator<char> > . */
530 if (cp_type_quals (type) == TYPE_UNQUALIFIED
531 && CLASSTYPE_USE_TEMPLATE (type))
533 tree args = CLASSTYPE_TI_ARGS (type);
534 if (TREE_VEC_LENGTH (args) == 3
535 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
536 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
538 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
547 /* Substitute for the template name only if this isn't a type. */
554 /* Check for basic_{i,o,io}stream. */
556 && cp_type_quals (type) == TYPE_UNQUALIFIED
557 && CLASS_TYPE_P (type)
558 && CLASSTYPE_USE_TEMPLATE (type)
559 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
561 /* First, check for the template
562 args <char, std::char_traits<char> > . */
563 tree args = CLASSTYPE_TI_ARGS (type);
564 if (TREE_VEC_LENGTH (args) == 2
565 && TYPE_P (TREE_VEC_ELT (args, 0))
566 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
567 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
570 /* Got them. Is this basic_istream? */
571 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
576 /* Or basic_ostream? */
577 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
582 /* Or basic_iostream? */
583 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
591 /* Check for namespace std. */
592 if (decl && DECL_NAMESPACE_STD_P (decl))
598 /* Now check the list of available substitutions for this mangling
600 for (i = 0; i < size; ++i)
602 tree candidate = VEC_index (tree, G.substitutions, i);
603 /* NODE is a matched to a candidate if it's the same decl node or
604 if it's the same type. */
605 if (decl == candidate
606 || (TYPE_P (candidate) && type && TYPE_P (type)
607 && same_type_p (type, candidate))
608 || NESTED_TEMPLATE_MATCH (node, candidate))
610 write_substitution (i);
615 /* No substitution found. */
620 /* TOP_LEVEL is true, if this is being called at outermost level of
621 mangling. It should be false when mangling a decl appearing in an
622 expression within some other mangling.
624 <mangled-name> ::= _Z <encoding> */
627 write_mangled_name (const tree decl, bool top_level)
629 MANGLE_TRACE_TREE ("mangled-name", decl);
631 if (/* The names of `extern "C"' functions are not mangled. */
632 DECL_EXTERN_C_FUNCTION_P (decl)
633 /* But overloaded operator names *are* mangled. */
634 && !DECL_OVERLOADED_OPERATOR_P (decl))
639 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
642 /* The standard notes: "The <encoding> of an extern "C"
643 function is treated like global-scope data, i.e. as its
644 <source-name> without a type." We cannot write
645 overloaded operators that way though, because it contains
646 characters invalid in assembler. */
647 if (abi_version_at_least (2))
650 G.need_abi_warning = true;
651 write_source_name (DECL_NAME (decl));
654 else if (TREE_CODE (decl) == VAR_DECL
655 /* The names of non-static global variables aren't mangled. */
656 && DECL_EXTERNAL_LINKAGE_P (decl)
657 && (CP_DECL_CONTEXT (decl) == global_namespace
658 /* And neither are `extern "C"' variables. */
659 || DECL_EXTERN_C_P (decl)))
661 if (top_level || abi_version_at_least (2))
665 G.need_abi_warning = true;
673 write_encoding (decl);
674 if (DECL_LANG_SPECIFIC (decl)
675 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
676 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
677 /* We need a distinct mangled name for these entities, but
678 we should never actually output it. So, we append some
679 characters the assembler won't like. */
680 write_string (" *INTERNAL* ");
684 /* <encoding> ::= <function name> <bare-function-type>
688 write_encoding (const tree decl)
690 MANGLE_TRACE_TREE ("encoding", decl);
692 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
694 /* For overloaded operators write just the mangled name
695 without arguments. */
696 if (DECL_OVERLOADED_OPERATOR_P (decl))
697 write_name (decl, /*ignore_local_scope=*/0);
699 write_source_name (DECL_NAME (decl));
703 write_name (decl, /*ignore_local_scope=*/0);
704 if (TREE_CODE (decl) == FUNCTION_DECL)
709 if (decl_is_template_id (decl, NULL))
711 fn_type = get_mostly_instantiated_function_type (decl);
712 /* FN_TYPE will not have parameter types for in-charge or
713 VTT parameters. Therefore, we pass NULL_TREE to
714 write_bare_function_type -- otherwise, it will get
715 confused about which artificial parameters to skip. */
720 fn_type = TREE_TYPE (decl);
724 write_bare_function_type (fn_type,
725 (!DECL_CONSTRUCTOR_P (decl)
726 && !DECL_DESTRUCTOR_P (decl)
727 && !DECL_CONV_FN_P (decl)
728 && decl_is_template_id (decl, NULL)),
733 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
734 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
737 decl_mangling_context (tree decl)
739 if (TREE_CODE (decl) == TYPE_DECL
740 && LAMBDA_TYPE_P (TREE_TYPE (decl)))
742 tree extra = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl));
746 else if (TREE_CODE (decl) == TYPE_DECL
747 && TREE_CODE (TREE_TYPE (decl)) == TEMPLATE_TYPE_PARM)
748 /* template type parms have no mangling context. */
750 return CP_DECL_CONTEXT (decl);
753 /* <name> ::= <unscoped-name>
754 ::= <unscoped-template-name> <template-args>
758 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
759 called from <local-name>, which mangles the enclosing scope
760 elsewhere and then uses this function to mangle just the part
761 underneath the function scope. So don't use the <local-name>
762 production, to avoid an infinite recursion. */
765 write_name (tree decl, const int ignore_local_scope)
769 MANGLE_TRACE_TREE ("name", decl);
771 if (TREE_CODE (decl) == TYPE_DECL)
773 /* In case this is a typedef, fish out the corresponding
774 TYPE_DECL for the main variant. */
775 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
778 context = decl_mangling_context (decl);
780 /* A decl in :: or ::std scope is treated specially. The former is
781 mangled using <unscoped-name> or <unscoped-template-name>, the
782 latter with a special substitution. Also, a name that is
783 directly in a local function scope is also mangled with
784 <unscoped-name> rather than a full <nested-name>. */
786 || context == global_namespace
787 || DECL_NAMESPACE_STD_P (context)
788 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
791 /* Is this a template instance? */
792 if (decl_is_template_id (decl, &template_info))
794 /* Yes: use <unscoped-template-name>. */
795 write_unscoped_template_name (TI_TEMPLATE (template_info));
796 write_template_args (TI_ARGS (template_info));
799 /* Everything else gets an <unqualified-name>. */
800 write_unscoped_name (decl);
804 /* Handle local names, unless we asked not to (that is, invoked
805 under <local-name>, to handle only the part of the name under
807 if (!ignore_local_scope)
809 /* Scan up the list of scope context, looking for a
810 function. If we find one, this entity is in local
811 function scope. local_entity tracks context one scope
812 level down, so it will contain the element that's
813 directly in that function's scope, either decl or one of
814 its enclosing scopes. */
815 tree local_entity = decl;
816 while (context != NULL && context != global_namespace)
818 /* Make sure we're always dealing with decls. */
819 if (context != NULL && TYPE_P (context))
820 context = TYPE_NAME (context);
821 /* Is this a function? */
822 if (TREE_CODE (context) == FUNCTION_DECL
823 || TREE_CODE (context) == PARM_DECL)
825 /* Yes, we have local scope. Use the <local-name>
826 production for the innermost function scope. */
827 write_local_name (context, local_entity, decl);
830 /* Up one scope level. */
831 local_entity = context;
832 context = decl_mangling_context (context);
835 /* No local scope found? Fall through to <nested-name>. */
838 /* Other decls get a <nested-name> to encode their scope. */
839 write_nested_name (decl);
843 /* <unscoped-name> ::= <unqualified-name>
844 ::= St <unqualified-name> # ::std:: */
847 write_unscoped_name (const tree decl)
849 tree context = CP_DECL_CONTEXT (decl);
851 MANGLE_TRACE_TREE ("unscoped-name", decl);
853 /* Is DECL in ::std? */
854 if (DECL_NAMESPACE_STD_P (context))
857 write_unqualified_name (decl);
861 /* If not, it should be either in the global namespace, or directly
862 in a local function scope. */
863 gcc_assert (context == global_namespace
865 || TREE_CODE (context) == FUNCTION_DECL);
867 write_unqualified_name (decl);
871 /* <unscoped-template-name> ::= <unscoped-name>
872 ::= <substitution> */
875 write_unscoped_template_name (const tree decl)
877 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
879 if (find_substitution (decl))
881 write_unscoped_name (decl);
882 add_substitution (decl);
885 /* Write the nested name, including CV-qualifiers, of DECL.
887 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
888 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
890 <CV-qualifiers> ::= [r] [V] [K] */
893 write_nested_name (const tree decl)
897 MANGLE_TRACE_TREE ("nested-name", decl);
901 /* Write CV-qualifiers, if this is a member function. */
902 if (TREE_CODE (decl) == FUNCTION_DECL
903 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
905 if (DECL_VOLATILE_MEMFUNC_P (decl))
907 if (DECL_CONST_MEMFUNC_P (decl))
911 /* Is this a template instance? */
912 if (decl_is_template_id (decl, &template_info))
914 /* Yes, use <template-prefix>. */
915 write_template_prefix (decl);
916 write_template_args (TI_ARGS (template_info));
918 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
920 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
921 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
923 write_template_prefix (decl);
924 write_template_args (TREE_OPERAND (name, 1));
928 write_prefix (CP_DECL_CONTEXT (decl));
929 write_unqualified_name (decl);
934 /* No, just use <prefix> */
935 write_prefix (DECL_CONTEXT (decl));
936 write_unqualified_name (decl);
941 /* <prefix> ::= <prefix> <unqualified-name>
943 ::= <template-prefix> <template-args>
945 ::= <substitution> */
948 write_prefix (const tree node)
951 /* Non-NULL if NODE represents a template-id. */
952 tree template_info = NULL;
955 || node == global_namespace)
958 MANGLE_TRACE_TREE ("prefix", node);
960 if (find_substitution (node))
965 /* If this is a function or parm decl, that means we've hit function
966 scope, so this prefix must be for a local name. In this
967 case, we're under the <local-name> production, which encodes
968 the enclosing function scope elsewhere. So don't continue
970 if (TREE_CODE (node) == FUNCTION_DECL
971 || TREE_CODE (node) == PARM_DECL)
975 decl_is_template_id (decl, &template_info);
979 /* Node is a type. */
980 decl = TYPE_NAME (node);
981 if (CLASSTYPE_TEMPLATE_ID_P (node))
982 template_info = TYPE_TEMPLATE_INFO (node);
985 /* In G++ 3.2, the name of the template parameter was used. */
986 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
987 && !abi_version_at_least (2))
988 G.need_abi_warning = true;
990 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
991 && abi_version_at_least (2))
992 write_template_param (node);
993 else if (template_info != NULL)
996 write_template_prefix (decl);
997 write_template_args (TI_ARGS (template_info));
999 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1001 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1002 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1004 write_template_prefix (decl);
1005 write_template_args (TREE_OPERAND (name, 1));
1009 write_prefix (CP_DECL_CONTEXT (decl));
1010 write_unqualified_name (decl);
1014 /* Not templated. */
1016 write_prefix (decl_mangling_context (decl));
1017 write_unqualified_name (decl);
1018 if (TREE_CODE (decl) == VAR_DECL
1019 || TREE_CODE (decl) == FIELD_DECL)
1021 /* <data-member-prefix> := <member source-name> M */
1027 add_substitution (node);
1030 /* <template-prefix> ::= <prefix> <template component>
1031 ::= <template-param>
1032 ::= <substitution> */
1035 write_template_prefix (const tree node)
1037 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1038 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1039 tree context = CP_DECL_CONTEXT (decl);
1044 MANGLE_TRACE_TREE ("template-prefix", node);
1046 /* Find the template decl. */
1047 if (decl_is_template_id (decl, &template_info))
1048 templ = TI_TEMPLATE (template_info);
1049 else if (TREE_CODE (type) == TYPENAME_TYPE)
1050 /* For a typename type, all we have is the name. */
1051 templ = DECL_NAME (decl);
1054 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
1056 templ = TYPE_TI_TEMPLATE (type);
1059 /* For a member template, though, the template name for the
1060 innermost name must have all the outer template levels
1061 instantiated. For instance, consider
1063 template<typename T> struct Outer {
1064 template<typename U> struct Inner {};
1067 The template name for `Inner' in `Outer<int>::Inner<float>' is
1068 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1069 levels separately, so there's no TEMPLATE_DECL available for this
1070 (there's only `Outer<T>::Inner<U>').
1072 In order to get the substitutions right, we create a special
1073 TREE_LIST to represent the substitution candidate for a nested
1074 template. The TREE_PURPOSE is the template's context, fully
1075 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1078 So, for the example above, `Outer<int>::Inner' is represented as a
1079 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1080 and whose value is `Outer<T>::Inner<U>'. */
1081 if (TYPE_P (context))
1082 substitution = build_tree_list (context, templ);
1084 substitution = templ;
1086 if (find_substitution (substitution))
1089 /* In G++ 3.2, the name of the template template parameter was used. */
1090 if (TREE_TYPE (templ)
1091 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1092 && !abi_version_at_least (2))
1093 G.need_abi_warning = true;
1095 if (TREE_TYPE (templ)
1096 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1097 && abi_version_at_least (2))
1098 write_template_param (TREE_TYPE (templ));
1101 write_prefix (context);
1102 write_unqualified_name (decl);
1105 add_substitution (substitution);
1108 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1109 mangled through special entry points.
1111 <unqualified-name> ::= <operator-name>
1114 ::= <unnamed-type-name>
1115 ::= <local-source-name>
1117 <local-source-name> ::= L <source-name> <discriminator> */
1120 write_unqualified_name (const tree decl)
1122 MANGLE_TRACE_TREE ("unqualified-name", decl);
1124 if (DECL_NAME (decl) == NULL_TREE)
1126 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl));
1127 write_source_name (DECL_ASSEMBLER_NAME (decl));
1130 else if (DECL_DECLARES_FUNCTION_P (decl))
1133 if (DECL_CONSTRUCTOR_P (decl))
1134 write_special_name_constructor (decl);
1135 else if (DECL_DESTRUCTOR_P (decl))
1136 write_special_name_destructor (decl);
1137 else if (DECL_CONV_FN_P (decl))
1139 /* Conversion operator. Handle it right here.
1140 <operator> ::= cv <type> */
1142 if (decl_is_template_id (decl, NULL))
1145 fn_type = get_mostly_instantiated_function_type (decl);
1146 type = TREE_TYPE (fn_type);
1149 type = DECL_CONV_FN_TYPE (decl);
1150 write_conversion_operator_name (type);
1152 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1154 operator_name_info_t *oni;
1155 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1156 oni = assignment_operator_name_info;
1158 oni = operator_name_info;
1160 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1169 if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1170 && DECL_NAMESPACE_SCOPE_P (decl)
1171 && decl_linkage (decl) == lk_internal)
1173 MANGLE_TRACE_TREE ("local-source-name", decl);
1175 write_source_name (DECL_NAME (decl));
1176 /* The default discriminator is 1, and that's all we ever use,
1177 so there's no code to output one here. */
1181 tree type = TREE_TYPE (decl);
1183 if (TREE_CODE (decl) == TYPE_DECL
1184 && TYPE_ANONYMOUS_P (type))
1185 write_unnamed_type_name (type);
1186 else if (TREE_CODE (decl) == TYPE_DECL
1187 && LAMBDA_TYPE_P (type))
1188 write_closure_type_name (type);
1190 write_source_name (DECL_NAME (decl));
1194 /* Write the unqualified-name for a conversion operator to TYPE. */
1197 write_conversion_operator_name (const tree type)
1199 write_string ("cv");
1203 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1205 <source-name> ::= </length/ number> <identifier> */
1208 write_source_name (tree identifier)
1210 MANGLE_TRACE_TREE ("source-name", identifier);
1212 /* Never write the whole template-id name including the template
1213 arguments; we only want the template name. */
1214 if (IDENTIFIER_TEMPLATE (identifier))
1215 identifier = IDENTIFIER_TEMPLATE (identifier);
1217 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1218 write_identifier (IDENTIFIER_POINTER (identifier));
1221 /* Encode 0 as _, and 1+ as n-1_. */
1224 write_compact_number (int num)
1227 write_unsigned_number (num - 1);
1231 /* Return how many unnamed types precede TYPE in its enclosing class. */
1234 nested_anon_class_index (tree type)
1237 tree member = TYPE_FIELDS (TYPE_CONTEXT (type));
1238 for (; member; member = TREE_CHAIN (member))
1239 if (DECL_IMPLICIT_TYPEDEF_P (member))
1241 tree memtype = TREE_TYPE (member);
1242 if (memtype == type)
1244 else if (TYPE_ANONYMOUS_P (memtype))
1251 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1254 write_unnamed_type_name (const tree type __attribute__ ((__unused__)))
1257 MANGLE_TRACE_TREE ("unnamed-type-name", type);
1259 if (TYPE_FUNCTION_SCOPE_P (type))
1260 discriminator = local_class_index (type);
1261 else if (TYPE_CLASS_SCOPE_P (type))
1262 discriminator = nested_anon_class_index (type);
1265 gcc_assert (no_linkage_check (type, /*relaxed_p=*/true));
1266 /* Just use the old mangling at namespace scope. */
1267 write_source_name (TYPE_IDENTIFIER (type));
1271 write_string ("Ut");
1272 write_compact_number (discriminator);
1275 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1276 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1279 write_closure_type_name (const tree type)
1281 tree fn = lambda_function (type);
1282 tree lambda = CLASSTYPE_LAMBDA_EXPR (type);
1283 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
1285 MANGLE_TRACE_TREE ("closure-type-name", type);
1287 write_string ("Ul");
1288 write_method_parms (parms, DECL_NONSTATIC_MEMBER_FUNCTION_P (fn), fn);
1290 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda));
1293 /* Convert NUMBER to ascii using base BASE and generating at least
1294 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1295 into which to store the characters. Returns the number of
1296 characters generated (these will be layed out in advance of where
1300 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1301 char *buffer, const unsigned int min_digits)
1303 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1304 unsigned digits = 0;
1308 unsigned HOST_WIDE_INT d = number / base;
1310 *--buffer = base_digits[number - d * base];
1314 while (digits < min_digits)
1316 *--buffer = base_digits[0];
1322 /* Non-terminal <number>.
1324 <number> ::= [n] </decimal integer/> */
1327 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1328 const unsigned int base)
1330 char buffer[sizeof (HOST_WIDE_INT) * 8];
1333 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1336 number = -((HOST_WIDE_INT) number);
1338 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1339 write_chars (buffer + sizeof (buffer) - count, count);
1342 /* Write out an integral CST in decimal. Most numbers are small, and
1343 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1344 bigger than that, which we must deal with. */
1347 write_integer_cst (const tree cst)
1349 int sign = tree_int_cst_sgn (cst);
1351 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1353 /* A bignum. We do this in chunks, each of which fits in a
1355 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1356 unsigned HOST_WIDE_INT chunk;
1357 unsigned chunk_digits;
1358 char *ptr = buffer + sizeof (buffer);
1363 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1368 if (sizeof (HOST_WIDE_INT) >= 8)
1370 /* It is at least 64 bits, so 10^18 is representable. */
1375 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1376 base = build_int_cstu (type, chunk);
1377 n = build_int_cst_wide (type,
1378 TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1383 n = fold_build1_loc (input_location, NEGATE_EXPR, type, n);
1387 tree d = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, n, base);
1388 tree tmp = fold_build2_loc (input_location, MULT_EXPR, type, d, base);
1391 done = integer_zerop (d);
1392 tmp = fold_build2_loc (input_location, MINUS_EXPR, type, n, tmp);
1393 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1394 done ? 1 : chunk_digits);
1400 write_chars (ptr, count);
1405 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1412 write_unsigned_number (low);
1416 /* Write out a floating-point literal.
1418 "Floating-point literals are encoded using the bit pattern of the
1419 target processor's internal representation of that number, as a
1420 fixed-length lowercase hexadecimal string, high-order bytes first
1421 (even if the target processor would store low-order bytes first).
1422 The "n" prefix is not used for floating-point literals; the sign
1423 bit is encoded with the rest of the number.
1425 Here are some examples, assuming the IEEE standard representation
1426 for floating point numbers. (Spaces are for readability, not
1427 part of the encoding.)
1430 -1.0f Lf bf80 0000 E
1431 1.17549435e-38f Lf 0080 0000 E
1432 1.40129846e-45f Lf 0000 0001 E
1433 0.0f Lf 0000 0000 E"
1435 Caller is responsible for the Lx and the E. */
1437 write_real_cst (const tree value)
1439 if (abi_version_at_least (2))
1441 long target_real[4]; /* largest supported float */
1442 char buffer[9]; /* eight hex digits in a 32-bit number */
1445 tree type = TREE_TYPE (value);
1446 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1448 real_to_target (target_real, &TREE_REAL_CST (value),
1451 /* The value in target_real is in the target word order,
1452 so we must write it out backward if that happens to be
1453 little-endian. write_number cannot be used, it will
1454 produce uppercase. */
1455 if (FLOAT_WORDS_BIG_ENDIAN)
1456 i = 0, limit = words, dir = 1;
1458 i = words - 1, limit = -1, dir = -1;
1460 for (; i != limit; i += dir)
1462 sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
1463 write_chars (buffer, 8);
1468 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1469 literally. Note that compatibility with 3.2 is impossible,
1470 because the old floating-point emulator used a different
1471 format for REAL_VALUE_TYPE. */
1473 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1474 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1477 G.need_abi_warning = 1;
1481 /* Non-terminal <identifier>.
1483 <identifier> ::= </unqualified source code identifier> */
1486 write_identifier (const char *identifier)
1488 MANGLE_TRACE ("identifier", identifier);
1489 write_string (identifier);
1492 /* Handle constructor productions of non-terminal <special-name>.
1493 CTOR is a constructor FUNCTION_DECL.
1495 <special-name> ::= C1 # complete object constructor
1496 ::= C2 # base object constructor
1497 ::= C3 # complete object allocating constructor
1499 Currently, allocating constructors are never used.
1501 We also need to provide mangled names for the maybe-in-charge
1502 constructor, so we treat it here too. mangle_decl_string will
1503 append *INTERNAL* to that, to make sure we never emit it. */
1506 write_special_name_constructor (const tree ctor)
1508 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1509 write_string ("C2");
1512 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1513 /* Even though we don't ever emit a definition of
1514 the old-style destructor, we still have to
1515 consider entities (like static variables) nested
1517 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor));
1518 write_string ("C1");
1522 /* Handle destructor productions of non-terminal <special-name>.
1523 DTOR is a destructor FUNCTION_DECL.
1525 <special-name> ::= D0 # deleting (in-charge) destructor
1526 ::= D1 # complete object (in-charge) destructor
1527 ::= D2 # base object (not-in-charge) destructor
1529 We also need to provide mangled names for the maybe-incharge
1530 destructor, so we treat it here too. mangle_decl_string will
1531 append *INTERNAL* to that, to make sure we never emit it. */
1534 write_special_name_destructor (const tree dtor)
1536 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1537 write_string ("D0");
1538 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1539 write_string ("D2");
1542 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1543 /* Even though we don't ever emit a definition of
1544 the old-style destructor, we still have to
1545 consider entities (like static variables) nested
1547 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor));
1548 write_string ("D1");
1552 /* Scan the vector of local classes and return how many others with the
1553 same name (or same no name) and context precede ENTITY. */
1556 local_class_index (tree entity)
1558 int ix, discriminator = 0;
1559 tree name = (TYPE_ANONYMOUS_P (entity) ? NULL_TREE
1560 : TYPE_IDENTIFIER (entity));
1561 tree ctx = TYPE_CONTEXT (entity);
1562 for (ix = 0; ; ix++)
1564 tree type = VEC_index (tree, local_classes, ix);
1566 return discriminator;
1567 if (TYPE_CONTEXT (type) == ctx
1568 && (name ? TYPE_IDENTIFIER (type) == name
1569 : TYPE_ANONYMOUS_P (type)))
1575 /* Return the discriminator for ENTITY appearing inside
1576 FUNCTION. The discriminator is the lexical ordinal of VAR among
1577 entities with the same name in the same FUNCTION. */
1580 discriminator_for_local_entity (tree entity)
1582 if (DECL_DISCRIMINATOR_P (entity))
1584 if (DECL_DISCRIMINATOR_SET_P (entity))
1585 return DECL_DISCRIMINATOR (entity);
1587 /* The first entity with a particular name doesn't get
1588 DECL_DISCRIMINATOR set up. */
1591 else if (TREE_CODE (entity) == TYPE_DECL)
1593 /* Scan the list of local classes. */
1594 entity = TREE_TYPE (entity);
1596 /* Lambdas and unnamed types have their own discriminators. */
1597 if (LAMBDA_TYPE_P (entity) || TYPE_ANONYMOUS_P (entity))
1600 return local_class_index (entity);
1606 /* Return the discriminator for STRING, a string literal used inside
1607 FUNCTION. The discriminator is the lexical ordinal of STRING among
1608 string literals used in FUNCTION. */
1611 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1612 tree string ATTRIBUTE_UNUSED)
1614 /* For now, we don't discriminate amongst string literals. */
1618 /* <discriminator> := _ <number>
1620 The discriminator is used only for the second and later occurrences
1621 of the same name within a single function. In this case <number> is
1622 n - 2, if this is the nth occurrence, in lexical order. */
1625 write_discriminator (const int discriminator)
1627 /* If discriminator is zero, don't write anything. Otherwise... */
1628 if (discriminator > 0)
1631 write_unsigned_number (discriminator - 1);
1635 /* Mangle the name of a function-scope entity. FUNCTION is the
1636 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1637 default argument scope. ENTITY is the decl for the entity itself.
1638 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1639 either ENTITY itself or an enclosing scope of ENTITY.
1641 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1642 := Z <function encoding> E s [<discriminator>]
1643 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1646 write_local_name (tree function, const tree local_entity,
1649 tree parm = NULL_TREE;
1651 MANGLE_TRACE_TREE ("local-name", entity);
1653 if (TREE_CODE (function) == PARM_DECL)
1656 function = DECL_CONTEXT (parm);
1660 write_encoding (function);
1663 /* For this purpose, parameters are numbered from right-to-left. */
1668 for (t = DECL_ARGUMENTS (function); t; t = TREE_CHAIN (t))
1676 write_compact_number (i - 1);
1679 if (TREE_CODE (entity) == STRING_CST)
1682 write_discriminator (discriminator_for_string_literal (function,
1687 /* Now the <entity name>. Let write_name know its being called
1688 from <local-name>, so it doesn't try to process the enclosing
1689 function scope again. */
1690 write_name (entity, /*ignore_local_scope=*/1);
1691 write_discriminator (discriminator_for_local_entity (local_entity));
1695 /* Non-terminals <type> and <CV-qualifier>.
1697 <type> ::= <builtin-type>
1699 ::= <class-enum-type>
1701 ::= <pointer-to-member-type>
1702 ::= <template-param>
1705 ::= P <type> # pointer-to
1706 ::= R <type> # reference-to
1707 ::= C <type> # complex pair (C 2000)
1708 ::= G <type> # imaginary (C 2000) [not supported]
1709 ::= U <source-name> <type> # vendor extended type qualifier
1713 <type> ::= RR <type> # rvalue reference-to
1714 <type> ::= Dt <expression> # decltype of an id-expression or
1715 # class member access
1716 <type> ::= DT <expression> # decltype of an expression
1718 TYPE is a type node. */
1721 write_type (tree type)
1723 /* This gets set to nonzero if TYPE turns out to be a (possibly
1724 CV-qualified) builtin type. */
1725 int is_builtin_type = 0;
1727 MANGLE_TRACE_TREE ("type", type);
1729 if (type == error_mark_node)
1732 if (find_substitution (type))
1735 /* According to the C++ ABI, some library classes are passed the
1736 same as the scalar type of their single member and use the same
1738 if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
1739 type = TREE_TYPE (first_field (type));
1741 if (write_CV_qualifiers_for_type (type) > 0)
1742 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1743 mangle the unqualified type. The recursive call is needed here
1744 since both the qualified and unqualified types are substitution
1746 write_type (TYPE_MAIN_VARIANT (type));
1747 else if (TREE_CODE (type) == ARRAY_TYPE)
1748 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1749 so that the cv-qualification of the element type is available
1750 in write_array_type. */
1751 write_array_type (type);
1754 tree type_orig = type;
1756 /* See through any typedefs. */
1757 type = TYPE_MAIN_VARIANT (type);
1759 if (TYPE_PTRMEM_P (type))
1760 write_pointer_to_member_type (type);
1763 /* Handle any target-specific fundamental types. */
1764 const char *target_mangling
1765 = targetm.mangle_type (type_orig);
1767 if (target_mangling)
1769 write_string (target_mangling);
1770 /* Add substitutions for types other than fundamental
1772 if (TREE_CODE (type) != VOID_TYPE
1773 && TREE_CODE (type) != INTEGER_TYPE
1774 && TREE_CODE (type) != REAL_TYPE
1775 && TREE_CODE (type) != BOOLEAN_TYPE)
1776 add_substitution (type);
1780 switch (TREE_CODE (type))
1784 case INTEGER_TYPE: /* Includes wchar_t. */
1786 case FIXED_POINT_TYPE:
1788 /* If this is a typedef, TYPE may not be one of
1789 the standard builtin type nodes, but an alias of one. Use
1790 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1791 write_builtin_type (TYPE_MAIN_VARIANT (type));
1798 write_type (TREE_TYPE (type));
1803 write_function_type (type);
1809 /* A pointer-to-member function is represented as a special
1810 RECORD_TYPE, so check for this first. */
1811 if (TYPE_PTRMEMFUNC_P (type))
1812 write_pointer_to_member_type (type);
1814 write_class_enum_type (type);
1818 case UNBOUND_CLASS_TEMPLATE:
1819 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1820 ordinary nested names. */
1821 write_nested_name (TYPE_STUB_DECL (type));
1826 write_type (TREE_TYPE (type));
1829 case REFERENCE_TYPE:
1830 if (TYPE_REF_IS_RVALUE (type))
1834 write_type (TREE_TYPE (type));
1837 case TEMPLATE_TYPE_PARM:
1838 case TEMPLATE_PARM_INDEX:
1839 write_template_param (type);
1842 case TEMPLATE_TEMPLATE_PARM:
1843 write_template_template_param (type);
1846 case BOUND_TEMPLATE_TEMPLATE_PARM:
1847 write_template_template_param (type);
1849 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1853 if (abi_version_at_least (4))
1855 write_string ("Dv");
1856 /* Non-constant vector size would be encoded with
1857 _ expression, but we don't support that yet. */
1858 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type));
1862 write_string ("U8__vector");
1863 write_type (TREE_TYPE (type));
1866 case TYPE_PACK_EXPANSION:
1867 write_string ("Dp");
1868 write_type (PACK_EXPANSION_PATTERN (type));
1872 /* These shouldn't make it into mangling. */
1873 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type)
1874 && !DECLTYPE_FOR_LAMBDA_RETURN (type));
1877 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
1881 ++cp_unevaluated_operand;
1882 write_expression (DECLTYPE_TYPE_EXPR (type));
1883 --cp_unevaluated_operand;
1888 sorry ("mangling typeof, use decltype instead");
1897 /* Types other than builtin types are substitution candidates. */
1898 if (!is_builtin_type)
1899 add_substitution (type);
1902 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1903 CV-qualifiers written for TYPE.
1905 <CV-qualifiers> ::= [r] [V] [K] */
1908 write_CV_qualifiers_for_type (const tree type)
1910 int num_qualifiers = 0;
1912 /* The order is specified by:
1914 "In cases where multiple order-insensitive qualifiers are
1915 present, they should be ordered 'K' (closest to the base type),
1916 'V', 'r', and 'U' (farthest from the base type) ..."
1918 Note that we do not use cp_type_quals below; given "const
1919 int[3]", the "const" is emitted with the "int", not with the
1922 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1927 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1932 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1938 return num_qualifiers;
1941 /* Non-terminal <builtin-type>.
1943 <builtin-type> ::= v # void
1948 ::= h # unsigned char
1950 ::= t # unsigned short
1952 ::= j # unsigned int
1954 ::= m # unsigned long
1955 ::= x # long long, __int64
1956 ::= y # unsigned long long, __int64
1958 ::= o # unsigned __int128
1961 ::= e # long double, __float80
1962 ::= g # __float128 [not supported]
1963 ::= u <source-name> # vendor extended type */
1966 write_builtin_type (tree type)
1968 if (TYPE_CANONICAL (type))
1969 type = TYPE_CANONICAL (type);
1971 switch (TREE_CODE (type))
1982 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
1983 isn't in integer_type_nodes. */
1984 if (type == wchar_type_node)
1986 else if (type == char16_type_node)
1987 write_string ("Ds");
1988 else if (type == char32_type_node)
1989 write_string ("Di");
1990 else if (TYPE_FOR_JAVA (type))
1991 write_java_integer_type_codes (type);
1995 /* Assume TYPE is one of the shared integer type nodes. Find
1996 it in the array of these nodes. */
1998 for (itk = 0; itk < itk_none; ++itk)
1999 if (type == integer_types[itk])
2001 /* Print the corresponding single-letter code. */
2002 write_char (integer_type_codes[itk]);
2006 if (itk == itk_none)
2008 tree t = c_common_type_for_mode (TYPE_MODE (type),
2009 TYPE_UNSIGNED (type));
2016 if (TYPE_PRECISION (type) == 128)
2017 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
2020 /* Allow for cases where TYPE is not one of the shared
2021 integer type nodes and write a "vendor extended builtin
2022 type" with a name the form intN or uintN, respectively.
2023 Situations like this can happen if you have an
2024 __attribute__((__mode__(__SI__))) type and use exotic
2025 switches like '-mint8' on AVR. Of course, this is
2026 undefined by the C++ ABI (and '-mint8' is not even
2027 Standard C conforming), but when using such special
2028 options you're pretty much in nowhere land anyway. */
2030 char prec[11]; /* up to ten digits for an unsigned */
2032 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
2033 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
2034 write_char ('u'); /* "vendor extended builtin type" */
2035 write_unsigned_number (strlen (prefix) + strlen (prec));
2036 write_string (prefix);
2037 write_string (prec);
2044 if (type == float_type_node
2045 || type == java_float_type_node)
2047 else if (type == double_type_node
2048 || type == java_double_type_node)
2050 else if (type == long_double_type_node)
2052 else if (type == dfloat32_type_node)
2053 write_string ("Df");
2054 else if (type == dfloat64_type_node)
2055 write_string ("Dd");
2056 else if (type == dfloat128_type_node)
2057 write_string ("De");
2062 case FIXED_POINT_TYPE:
2063 write_string ("DF");
2064 if (GET_MODE_IBIT (TYPE_MODE (type)) > 0)
2065 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type)));
2066 if (type == fract_type_node
2067 || type == sat_fract_type_node
2068 || type == accum_type_node
2069 || type == sat_accum_type_node)
2071 else if (type == unsigned_fract_type_node
2072 || type == sat_unsigned_fract_type_node
2073 || type == unsigned_accum_type_node
2074 || type == sat_unsigned_accum_type_node)
2076 else if (type == short_fract_type_node
2077 || type == sat_short_fract_type_node
2078 || type == short_accum_type_node
2079 || type == sat_short_accum_type_node)
2081 else if (type == unsigned_short_fract_type_node
2082 || type == sat_unsigned_short_fract_type_node
2083 || type == unsigned_short_accum_type_node
2084 || type == sat_unsigned_short_accum_type_node)
2086 else if (type == long_fract_type_node
2087 || type == sat_long_fract_type_node
2088 || type == long_accum_type_node
2089 || type == sat_long_accum_type_node)
2091 else if (type == unsigned_long_fract_type_node
2092 || type == sat_unsigned_long_fract_type_node
2093 || type == unsigned_long_accum_type_node
2094 || type == sat_unsigned_long_accum_type_node)
2096 else if (type == long_long_fract_type_node
2097 || type == sat_long_long_fract_type_node
2098 || type == long_long_accum_type_node
2099 || type == sat_long_long_accum_type_node)
2101 else if (type == unsigned_long_long_fract_type_node
2102 || type == sat_unsigned_long_long_fract_type_node
2103 || type == unsigned_long_long_accum_type_node
2104 || type == sat_unsigned_long_long_accum_type_node)
2107 sorry ("mangling unknown fixed point type");
2108 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type)));
2109 if (TYPE_SATURATING (type))
2120 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2121 METHOD_TYPE. The return type is mangled before the parameter
2124 <function-type> ::= F [Y] <bare-function-type> E */
2127 write_function_type (const tree type)
2129 MANGLE_TRACE_TREE ("function-type", type);
2131 /* For a pointer to member function, the function type may have
2132 cv-qualifiers, indicating the quals for the artificial 'this'
2134 if (TREE_CODE (type) == METHOD_TYPE)
2136 /* The first parameter must be a POINTER_TYPE pointing to the
2137 `this' parameter. */
2138 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
2139 write_CV_qualifiers_for_type (this_type);
2143 /* We don't track whether or not a type is `extern "C"'. Note that
2144 you can have an `extern "C"' function that does not have
2145 `extern "C"' type, and vice versa:
2147 extern "C" typedef void function_t();
2148 function_t f; // f has C++ linkage, but its type is
2151 typedef void function_t();
2152 extern "C" function_t f; // Vice versa.
2155 write_bare_function_type (type, /*include_return_type_p=*/1,
2160 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2161 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2162 is mangled before the parameter types. If non-NULL, DECL is
2163 FUNCTION_DECL for the function whose type is being emitted.
2165 If DECL is a member of a Java type, then a literal 'J'
2166 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2169 <bare-function-type> ::= [J]</signature/ type>+ */
2172 write_bare_function_type (const tree type, const int include_return_type_p,
2177 MANGLE_TRACE_TREE ("bare-function-type", type);
2179 /* Detect Java methods and emit special encoding. */
2181 && DECL_FUNCTION_MEMBER_P (decl)
2182 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
2183 && !DECL_CONSTRUCTOR_P (decl)
2184 && !DECL_DESTRUCTOR_P (decl)
2185 && !DECL_CONV_FN_P (decl))
2195 /* Mangle the return type, if requested. */
2196 if (include_return_type_p || java_method_p)
2197 write_type (TREE_TYPE (type));
2199 /* Now mangle the types of the arguments. */
2200 write_method_parms (TYPE_ARG_TYPES (type),
2201 TREE_CODE (type) == METHOD_TYPE,
2205 /* Write the mangled representation of a method parameter list of
2206 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2207 considered a non-static method, and the this parameter is omitted.
2208 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2209 parameters are being emitted. */
2212 write_method_parms (tree parm_types, const int method_p, const tree decl)
2214 tree first_parm_type;
2215 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
2217 /* Assume this parameter type list is variable-length. If it ends
2218 with a void type, then it's not. */
2221 /* If this is a member function, skip the first arg, which is the
2223 "Member functions do not encode the type of their implicit this
2226 Similarly, there's no need to mangle artificial parameters, like
2227 the VTT parameters for constructors and destructors. */
2230 parm_types = TREE_CHAIN (parm_types);
2231 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
2233 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
2235 parm_types = TREE_CHAIN (parm_types);
2236 parm_decl = TREE_CHAIN (parm_decl);
2240 for (first_parm_type = parm_types;
2242 parm_types = TREE_CHAIN (parm_types))
2244 tree parm = TREE_VALUE (parm_types);
2245 if (parm == void_type_node)
2247 /* "Empty parameter lists, whether declared as () or
2248 conventionally as (void), are encoded with a void parameter
2250 if (parm_types == first_parm_type)
2252 /* If the parm list is terminated with a void type, it's
2255 /* A void type better be the last one. */
2256 gcc_assert (TREE_CHAIN (parm_types) == NULL);
2263 /* <builtin-type> ::= z # ellipsis */
2267 /* <class-enum-type> ::= <name> */
2270 write_class_enum_type (const tree type)
2272 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
2275 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2278 <template-args> ::= I <template-arg>* E */
2281 write_template_args (tree args)
2286 MANGLE_TRACE_TREE ("template-args", args);
2291 length = TREE_VEC_LENGTH (args);
2293 if (args && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
2295 /* We have nested template args. We want the innermost template
2297 args = TREE_VEC_ELT (args, length - 1);
2298 length = TREE_VEC_LENGTH (args);
2300 for (i = 0; i < length; ++i)
2301 write_template_arg (TREE_VEC_ELT (args, i));
2308 <unqualified-name> <template-args>
2309 part of SCOPE_REF or COMPONENT_REF mangling. */
2312 write_member_name (tree member)
2314 if (TREE_CODE (member) == IDENTIFIER_NODE)
2315 write_source_name (member);
2316 else if (DECL_P (member))
2317 write_unqualified_name (member);
2318 else if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2320 tree name = TREE_OPERAND (member, 0);
2321 if (TREE_CODE (name) == OVERLOAD)
2322 name = OVL_FUNCTION (name);
2323 write_member_name (name);
2324 write_template_args (TREE_OPERAND (member, 1));
2327 write_expression (member);
2330 /* <expression> ::= <unary operator-name> <expression>
2331 ::= <binary operator-name> <expression> <expression>
2334 <expr-primary> ::= <template-param>
2335 ::= L <type> <value number> E # literal
2336 ::= L <mangled-name> E # external name
2337 ::= st <type> # sizeof
2338 ::= sr <type> <unqualified-name> # dependent name
2339 ::= sr <type> <unqualified-name> <template-args> */
2342 write_expression (tree expr)
2344 enum tree_code code = TREE_CODE (expr);
2346 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2347 is converted (via qualification conversions) to another
2349 while (TREE_CODE (expr) == NOP_EXPR
2350 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2352 expr = TREE_OPERAND (expr, 0);
2353 code = TREE_CODE (expr);
2356 if (code == BASELINK)
2358 expr = BASELINK_FUNCTIONS (expr);
2359 code = TREE_CODE (expr);
2362 /* Handle pointers-to-members by making them look like expression
2364 if (code == PTRMEM_CST)
2366 expr = build_nt (ADDR_EXPR,
2367 build_qualified_name (/*type=*/NULL_TREE,
2368 PTRMEM_CST_CLASS (expr),
2369 PTRMEM_CST_MEMBER (expr),
2370 /*template_p=*/false));
2371 code = TREE_CODE (expr);
2374 /* Handle template parameters. */
2375 if (code == TEMPLATE_TYPE_PARM
2376 || code == TEMPLATE_TEMPLATE_PARM
2377 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2378 || code == TEMPLATE_PARM_INDEX)
2379 write_template_param (expr);
2380 /* Handle literals. */
2381 else if (TREE_CODE_CLASS (code) == tcc_constant
2382 || (abi_version_at_least (2) && code == CONST_DECL))
2383 write_template_arg_literal (expr);
2384 else if (code == PARM_DECL)
2386 /* A function parameter used in a late-specified return type. */
2387 int index = DECL_PARM_INDEX (expr);
2388 gcc_assert (index >= 1);
2389 write_string ("fp");
2390 write_compact_number (index - 1);
2392 else if (DECL_P (expr))
2394 /* G++ 3.2 incorrectly mangled non-type template arguments of
2395 enumeration type using their names. */
2396 if (code == CONST_DECL)
2397 G.need_abi_warning = 1;
2399 write_mangled_name (expr, false);
2402 else if (TREE_CODE (expr) == SIZEOF_EXPR
2403 && TYPE_P (TREE_OPERAND (expr, 0)))
2405 write_string ("st");
2406 write_type (TREE_OPERAND (expr, 0));
2408 else if (TREE_CODE (expr) == ALIGNOF_EXPR
2409 && TYPE_P (TREE_OPERAND (expr, 0)))
2411 write_string ("at");
2412 write_type (TREE_OPERAND (expr, 0));
2414 else if (TREE_CODE (expr) == SCOPE_REF)
2416 tree scope = TREE_OPERAND (expr, 0);
2417 tree member = TREE_OPERAND (expr, 1);
2419 if (!abi_version_at_least (2))
2421 write_string ("sr");
2423 /* G++ 3.2 incorrectly put out both the "sr" code and
2424 the nested name of the qualified name. */
2425 G.need_abi_warning = 1;
2426 write_encoding (member);
2429 /* If the MEMBER is a real declaration, then the qualifying
2430 scope was not dependent. Ideally, we would not have a
2431 SCOPE_REF in those cases, but sometimes we do. If the second
2432 argument is a DECL, then the name must not have been
2434 else if (DECL_P (member))
2435 write_expression (member);
2440 write_string ("sr");
2442 /* If MEMBER is a template-id, separate the template
2443 from the arguments. */
2444 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2446 template_args = TREE_OPERAND (member, 1);
2447 member = TREE_OPERAND (member, 0);
2450 template_args = NULL_TREE;
2451 /* Write out the name of the MEMBER. */
2452 if (IDENTIFIER_TYPENAME_P (member))
2453 write_conversion_operator_name (TREE_TYPE (member));
2454 else if (IDENTIFIER_OPNAME_P (member))
2457 const char *mangled_name = NULL;
2459 /* Unfortunately, there is no easy way to go from the
2460 name of the operator back to the corresponding tree
2462 for (i = 0; i < MAX_TREE_CODES; ++i)
2463 if (operator_name_info[i].identifier == member)
2465 /* The ABI says that we prefer binary operator
2466 names to unary operator names. */
2467 if (operator_name_info[i].arity == 2)
2469 mangled_name = operator_name_info[i].mangled_name;
2472 else if (!mangled_name)
2473 mangled_name = operator_name_info[i].mangled_name;
2475 else if (assignment_operator_name_info[i].identifier
2479 = assignment_operator_name_info[i].mangled_name;
2482 write_string (mangled_name);
2485 write_source_name (member);
2486 /* Write out the template arguments. */
2488 write_template_args (template_args);
2491 else if (TREE_CODE (expr) == INDIRECT_REF
2492 && TREE_TYPE (TREE_OPERAND (expr, 0))
2493 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2495 write_expression (TREE_OPERAND (expr, 0));
2502 /* When we bind a variable or function to a non-type template
2503 argument with reference type, we create an ADDR_EXPR to show
2504 the fact that the entity's address has been taken. But, we
2505 don't actually want to output a mangling code for the `&'. */
2506 if (TREE_CODE (expr) == ADDR_EXPR
2508 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2510 expr = TREE_OPERAND (expr, 0);
2513 write_expression (expr);
2517 code = TREE_CODE (expr);
2520 if (code == COMPONENT_REF)
2522 tree ob = TREE_OPERAND (expr, 0);
2524 if (TREE_CODE (ob) == ARROW_EXPR)
2526 write_string (operator_name_info[(int)code].mangled_name);
2527 ob = TREE_OPERAND (ob, 0);
2530 write_string ("dt");
2532 write_expression (ob);
2533 write_member_name (TREE_OPERAND (expr, 1));
2537 /* If it wasn't any of those, recursively expand the expression. */
2538 name = operator_name_info[(int) code].mangled_name;
2541 sorry ("mangling %C", code);
2545 write_string (name);
2551 tree fn = CALL_EXPR_FN (expr);
2553 if (TREE_CODE (fn) == ADDR_EXPR)
2554 fn = TREE_OPERAND (fn, 0);
2556 /* Mangle a dependent name as the name, not whatever happens to
2557 be the first function in the overload set. */
2558 if ((TREE_CODE (fn) == FUNCTION_DECL
2559 || TREE_CODE (fn) == OVERLOAD)
2560 && type_dependent_expression_p_push (expr))
2561 fn = DECL_NAME (get_first_fn (fn));
2563 if (TREE_CODE (fn) == IDENTIFIER_NODE)
2564 write_source_name (fn);
2566 write_expression (fn);
2569 for (i = 0; i < call_expr_nargs (expr); ++i)
2570 write_expression (CALL_EXPR_ARG (expr, i));
2575 write_type (TREE_TYPE (expr));
2576 if (list_length (TREE_OPERAND (expr, 0)) == 1)
2577 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2580 tree args = TREE_OPERAND (expr, 0);
2582 for (; args; args = TREE_CHAIN (args))
2583 write_expression (TREE_VALUE (args));
2588 /* FIXME these should have a distinct mangling. */
2589 case STATIC_CAST_EXPR:
2590 case CONST_CAST_EXPR:
2591 write_type (TREE_TYPE (expr));
2592 write_expression (TREE_OPERAND (expr, 0));
2596 sorry ("mangling new-expression");
2600 /* In the middle-end, some expressions have more operands than
2601 they do in templates (and mangling). */
2604 case PREINCREMENT_EXPR:
2605 case PREDECREMENT_EXPR:
2606 case POSTINCREMENT_EXPR:
2607 case POSTDECREMENT_EXPR:
2616 len = TREE_OPERAND_LENGTH (expr);
2620 for (i = 0; i < len; ++i)
2622 tree operand = TREE_OPERAND (expr, i);
2623 /* As a GNU extension, the middle operand of a
2624 conditional may be omitted. Since expression
2625 manglings are supposed to represent the input token
2626 stream, there's no good way to mangle such an
2627 expression without extending the C++ ABI. */
2628 if (code == COND_EXPR && i == 1 && !operand)
2630 error ("omitted middle operand to %<?:%> operand "
2631 "cannot be mangled");
2634 write_expression (operand);
2640 /* Literal subcase of non-terminal <template-arg>.
2642 "Literal arguments, e.g. "A<42L>", are encoded with their type
2643 and value. Negative integer values are preceded with "n"; for
2644 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2645 encoded as 0, true as 1." */
2648 write_template_arg_literal (const tree value)
2651 write_type (TREE_TYPE (value));
2653 switch (TREE_CODE (value))
2656 write_integer_cst (DECL_INITIAL (value));
2660 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
2661 || integer_zerop (value) || integer_onep (value));
2662 write_integer_cst (value);
2666 write_real_cst (value);
2676 /* Non-terminal <template-arg>.
2678 <template-arg> ::= <type> # type
2679 ::= L <type> </value/ number> E # literal
2680 ::= LZ <name> E # external name
2681 ::= X <expression> E # expression */
2684 write_template_arg (tree node)
2686 enum tree_code code = TREE_CODE (node);
2688 MANGLE_TRACE_TREE ("template-arg", node);
2690 /* A template template parameter's argument list contains TREE_LIST
2691 nodes of which the value field is the actual argument. */
2692 if (code == TREE_LIST)
2694 node = TREE_VALUE (node);
2695 /* If it's a decl, deal with its type instead. */
2698 node = TREE_TYPE (node);
2699 code = TREE_CODE (node);
2703 if (TREE_CODE (node) == NOP_EXPR
2704 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
2706 /* Template parameters can be of reference type. To maintain
2707 internal consistency, such arguments use a conversion from
2708 address of object to reference type. */
2709 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
2710 if (abi_version_at_least (2))
2711 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
2713 G.need_abi_warning = 1;
2716 if (ARGUMENT_PACK_P (node))
2718 /* Expand the template argument pack. */
2719 tree args = ARGUMENT_PACK_ARGS (node);
2720 int i, length = TREE_VEC_LENGTH (args);
2722 for (i = 0; i < length; ++i)
2723 write_template_arg (TREE_VEC_ELT (args, i));
2726 else if (TYPE_P (node))
2728 else if (code == TEMPLATE_DECL)
2729 /* A template appearing as a template arg is a template template arg. */
2730 write_template_template_arg (node);
2731 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
2732 || (abi_version_at_least (2) && code == CONST_DECL))
2733 write_template_arg_literal (node);
2734 else if (DECL_P (node))
2736 /* Until ABI version 2, non-type template arguments of
2737 enumeration type were mangled using their names. */
2738 if (code == CONST_DECL && !abi_version_at_least (2))
2739 G.need_abi_warning = 1;
2741 /* Until ABI version 3, the underscore before the mangled name
2742 was incorrectly omitted. */
2743 if (!abi_version_at_least (3))
2745 G.need_abi_warning = 1;
2749 write_string ("_Z");
2750 write_encoding (node);
2755 /* Template arguments may be expressions. */
2757 write_expression (node);
2762 /* <template-template-arg>
2764 ::= <substitution> */
2767 write_template_template_arg (const tree decl)
2769 MANGLE_TRACE_TREE ("template-template-arg", decl);
2771 if (find_substitution (decl))
2773 write_name (decl, /*ignore_local_scope=*/0);
2774 add_substitution (decl);
2778 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2780 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2781 ::= A <expression> _ </element/ type>
2783 "Array types encode the dimension (number of elements) and the
2784 element type. For variable length arrays, the dimension (but not
2785 the '_' separator) is omitted." */
2788 write_array_type (const tree type)
2791 if (TYPE_DOMAIN (type))
2796 index_type = TYPE_DOMAIN (type);
2797 /* The INDEX_TYPE gives the upper and lower bounds of the
2799 max = TYPE_MAX_VALUE (index_type);
2800 if (TREE_CODE (max) == INTEGER_CST)
2802 /* The ABI specifies that we should mangle the number of
2803 elements in the array, not the largest allowed index. */
2804 max = size_binop (PLUS_EXPR, max, size_one_node);
2805 write_unsigned_number (tree_low_cst (max, 1));
2809 max = TREE_OPERAND (max, 0);
2810 if (!abi_version_at_least (2))
2812 /* value_dependent_expression_p presumes nothing is
2813 dependent when PROCESSING_TEMPLATE_DECL is zero. */
2814 ++processing_template_decl;
2815 if (!value_dependent_expression_p (max))
2816 G.need_abi_warning = 1;
2817 --processing_template_decl;
2819 write_expression (max);
2824 write_type (TREE_TYPE (type));
2827 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2828 variables. TYPE is a pointer-to-member POINTER_TYPE.
2830 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2833 write_pointer_to_member_type (const tree type)
2836 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2837 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2840 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2841 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2842 TEMPLATE_PARM_INDEX.
2844 <template-param> ::= T </parameter/ number> _ */
2847 write_template_param (const tree parm)
2851 MANGLE_TRACE_TREE ("template-parm", parm);
2853 switch (TREE_CODE (parm))
2855 case TEMPLATE_TYPE_PARM:
2856 case TEMPLATE_TEMPLATE_PARM:
2857 case BOUND_TEMPLATE_TEMPLATE_PARM:
2858 parm_index = TEMPLATE_TYPE_IDX (parm);
2861 case TEMPLATE_PARM_INDEX:
2862 parm_index = TEMPLATE_PARM_IDX (parm);
2870 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2871 earliest template param denoted by `_'. */
2872 write_compact_number (parm_index);
2875 /* <template-template-param>
2876 ::= <template-param>
2877 ::= <substitution> */
2880 write_template_template_param (const tree parm)
2882 tree templ = NULL_TREE;
2884 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2885 template template parameter. The substitution candidate here is
2886 only the template. */
2887 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2890 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2891 if (find_substitution (templ))
2895 /* <template-param> encodes only the template parameter position,
2896 not its template arguments, which is fine here. */
2897 write_template_param (parm);
2899 add_substitution (templ);
2902 /* Non-terminal <substitution>.
2904 <substitution> ::= S <seq-id> _
2908 write_substitution (const int seq_id)
2910 MANGLE_TRACE ("substitution", "");
2914 write_number (seq_id - 1, /*unsigned=*/1, 36);
2918 /* Start mangling ENTITY. */
2921 start_mangling (const tree entity)
2924 G.need_abi_warning = false;
2925 obstack_free (&name_obstack, name_base);
2926 mangle_obstack = &name_obstack;
2927 name_base = obstack_alloc (&name_obstack, 0);
2930 /* Done with mangling. If WARN is true, and the name of G.entity will
2931 be mangled differently in a future version of the ABI, issue a
2935 finish_mangling_internal (const bool warn)
2937 if (warn_abi && warn && G.need_abi_warning)
2938 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
2942 /* Clear all the substitutions. */
2943 VEC_truncate (tree, G.substitutions, 0);
2945 /* Null-terminate the string. */
2950 /* Like finish_mangling_internal, but return the mangled string. */
2952 static inline const char *
2953 finish_mangling (const bool warn)
2955 finish_mangling_internal (warn);
2956 return (const char *) obstack_finish (mangle_obstack);
2959 /* Like finish_mangling_internal, but return an identifier. */
2962 finish_mangling_get_identifier (const bool warn)
2964 finish_mangling_internal (warn);
2965 /* Don't obstack_finish here, and the next start_mangling will
2966 remove the identifier. */
2967 return get_identifier ((const char *) obstack_base (mangle_obstack));
2970 /* Initialize data structures for mangling. */
2975 gcc_obstack_init (&name_obstack);
2976 name_base = obstack_alloc (&name_obstack, 0);
2977 G.substitutions = NULL;
2979 /* Cache these identifiers for quick comparison when checking for
2980 standard substitutions. */
2981 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2982 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2983 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2984 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2985 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2986 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2989 /* Generate the mangled name of DECL. */
2992 mangle_decl_string (const tree decl)
2996 start_mangling (decl);
2998 if (TREE_CODE (decl) == TYPE_DECL)
2999 write_type (TREE_TYPE (decl));
3001 write_mangled_name (decl, true);
3003 result = finish_mangling_get_identifier (/*warn=*/true);
3005 fprintf (stderr, "mangle_decl_string = '%s'\n\n",
3006 IDENTIFIER_POINTER (result));
3010 /* Create an identifier for the external mangled name of DECL. */
3013 mangle_decl (const tree decl)
3015 tree id = mangle_decl_string (decl);
3016 id = targetm.mangle_decl_assembler_name (decl, id);
3017 SET_DECL_ASSEMBLER_NAME (decl, id);
3020 /* Generate the mangled representation of TYPE. */
3023 mangle_type_string (const tree type)
3027 start_mangling (type);
3029 result = finish_mangling (/*warn=*/false);
3031 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
3035 /* Create an identifier for the mangled name of a special component
3036 for belonging to TYPE. CODE is the ABI-specified code for this
3040 mangle_special_for_type (const tree type, const char *code)
3044 /* We don't have an actual decl here for the special component, so
3045 we can't just process the <encoded-name>. Instead, fake it. */
3046 start_mangling (type);
3048 /* Start the mangling. */
3049 write_string ("_Z");
3050 write_string (code);
3054 result = finish_mangling_get_identifier (/*warn=*/false);
3057 fprintf (stderr, "mangle_special_for_type = %s\n\n",
3058 IDENTIFIER_POINTER (result));
3063 /* Create an identifier for the mangled representation of the typeinfo
3064 structure for TYPE. */
3067 mangle_typeinfo_for_type (const tree type)
3069 return mangle_special_for_type (type, "TI");
3072 /* Create an identifier for the mangled name of the NTBS containing
3073 the mangled name of TYPE. */
3076 mangle_typeinfo_string_for_type (const tree type)
3078 return mangle_special_for_type (type, "TS");
3081 /* Create an identifier for the mangled name of the vtable for TYPE. */
3084 mangle_vtbl_for_type (const tree type)
3086 return mangle_special_for_type (type, "TV");
3089 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3092 mangle_vtt_for_type (const tree type)
3094 return mangle_special_for_type (type, "TT");
3097 /* Return an identifier for a construction vtable group. TYPE is
3098 the most derived class in the hierarchy; BINFO is the base
3099 subobject for which this construction vtable group will be used.
3101 This mangling isn't part of the ABI specification; in the ABI
3102 specification, the vtable group is dumped in the same COMDAT as the
3103 main vtable, and is referenced only from that vtable, so it doesn't
3104 need an external name. For binary formats without COMDAT sections,
3105 though, we need external names for the vtable groups.
3107 We use the production
3109 <special-name> ::= CT <type> <offset number> _ <base type> */
3112 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
3116 start_mangling (type);
3118 write_string ("_Z");
3119 write_string ("TC");
3121 write_integer_cst (BINFO_OFFSET (binfo));
3123 write_type (BINFO_TYPE (binfo));
3125 result = finish_mangling_get_identifier (/*warn=*/false);
3127 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n",
3128 IDENTIFIER_POINTER (result));
3132 /* Mangle a this pointer or result pointer adjustment.
3134 <call-offset> ::= h <fixed offset number> _
3135 ::= v <fixed offset number> _ <virtual offset number> _ */
3138 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
3140 write_char (virtual_offset ? 'v' : 'h');
3142 /* For either flavor, write the fixed offset. */
3143 write_integer_cst (fixed_offset);
3146 /* For a virtual thunk, add the virtual offset. */
3149 write_integer_cst (virtual_offset);
3154 /* Return an identifier for the mangled name of a this-adjusting or
3155 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3156 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3157 is a virtual thunk, and it is the vtbl offset in
3158 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3159 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3160 thunk itself. A covariant thunk name always includes the adjustment
3161 for the this pointer, even if there is none.
3163 <special-name> ::= T <call-offset> <base encoding>
3164 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3168 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
3169 tree virtual_offset)
3173 start_mangling (fn_decl);
3175 write_string ("_Z");
3178 if (!this_adjusting)
3180 /* Covariant thunk with no this adjustment */
3182 mangle_call_offset (integer_zero_node, NULL_TREE);
3183 mangle_call_offset (fixed_offset, virtual_offset);
3185 else if (!DECL_THUNK_P (fn_decl))
3186 /* Plain this adjusting thunk. */
3187 mangle_call_offset (fixed_offset, virtual_offset);
3190 /* This adjusting thunk to covariant thunk. */
3192 mangle_call_offset (fixed_offset, virtual_offset);
3193 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
3194 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
3196 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
3197 mangle_call_offset (fixed_offset, virtual_offset);
3198 fn_decl = THUNK_TARGET (fn_decl);
3202 write_encoding (fn_decl);
3204 result = finish_mangling_get_identifier (/*warn=*/false);
3206 fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result));
3210 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3211 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3214 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
3216 /* Hash a node (VAL1) in the table. */
3219 hash_type (const void *val)
3221 return (hashval_t) TYPE_UID (TREE_TYPE ((const_tree) val));
3224 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3227 compare_type (const void *val1, const void *val2)
3229 return TREE_TYPE ((const_tree) val1) == (const_tree) val2;
3232 /* Return an identifier for the mangled unqualified name for a
3233 conversion operator to TYPE. This mangling is not specified by the
3234 ABI spec; it is only used internally. */
3237 mangle_conv_op_name_for_type (const tree type)
3242 if (type == error_mark_node)
3243 return error_mark_node;
3245 if (conv_type_names == NULL)
3246 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
3248 slot = htab_find_slot_with_hash (conv_type_names, type,
3249 (hashval_t) TYPE_UID (type), INSERT);
3250 identifier = (tree)*slot;
3255 /* Create a unique name corresponding to TYPE. */
3256 sprintf (buffer, "operator %lu",
3257 (unsigned long) htab_elements (conv_type_names));
3258 identifier = get_identifier (buffer);
3261 /* Hang TYPE off the identifier so it can be found easily later
3262 when performing conversions. */
3263 TREE_TYPE (identifier) = type;
3265 /* Set bits on the identifier so we know later it's a conversion. */
3266 IDENTIFIER_OPNAME_P (identifier) = 1;
3267 IDENTIFIER_TYPENAME_P (identifier) = 1;
3273 /* Return an identifier for the name of an initialization guard
3274 variable for indicated VARIABLE. */
3277 mangle_guard_variable (const tree variable)
3279 start_mangling (variable);
3280 write_string ("_ZGV");
3281 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
3282 /* The name of a guard variable for a reference temporary should refer
3283 to the reference, not the temporary. */
3284 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
3286 write_name (variable, /*ignore_local_scope=*/0);
3287 return finish_mangling_get_identifier (/*warn=*/false);
3290 /* Return an identifier for the name of a temporary variable used to
3291 initialize a static reference. This isn't part of the ABI, but we might
3292 as well call them something readable. */
3295 mangle_ref_init_variable (const tree variable)
3297 start_mangling (variable);
3298 write_string ("_ZGR");
3299 write_name (variable, /*ignore_local_scope=*/0);
3300 return finish_mangling_get_identifier (/*warn=*/false);
3304 /* Foreign language type mangling section. */
3306 /* How to write the type codes for the integer Java type. */
3309 write_java_integer_type_codes (const tree type)
3311 if (type == java_int_type_node)
3313 else if (type == java_short_type_node)
3315 else if (type == java_byte_type_node)
3317 else if (type == java_char_type_node)
3319 else if (type == java_long_type_node)
3321 else if (type == java_boolean_type_node)
3327 #include "gt-cp-mangle.h"