1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008
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 globals GTY(())
95 /* An array of the current substitution candidates, in the order
97 VEC(tree,gc) *substitutions;
99 /* The entity that is being mangled. */
100 tree GTY ((skip)) entity;
102 /* True if the mangling will be different in a future version of the
104 bool need_abi_warning;
107 static GTY (()) globals G;
109 /* The obstack on which we build mangled names. */
110 static struct obstack *mangle_obstack;
112 /* The obstack on which we build mangled names that are not going to
113 be IDENTIFIER_NODEs. */
114 static struct obstack name_obstack;
116 /* The first object on the name_obstack; we use this to free memory
117 allocated on the name_obstack. */
118 static void *name_base;
120 /* Indices into subst_identifiers. These are identifiers used in
121 special substitution rules. */
129 SUBID_BASIC_IOSTREAM,
132 substitution_identifier_index_t;
134 /* For quick substitution checks, look up these common identifiers
136 static GTY(()) tree subst_identifiers[SUBID_MAX];
138 /* Single-letter codes for builtin integer types, defined in
139 <builtin-type>. These are indexed by integer_type_kind values. */
141 integer_type_codes[itk_none] =
144 'a', /* itk_signed_char */
145 'h', /* itk_unsigned_char */
147 't', /* itk_unsigned_short */
149 'j', /* itk_unsigned_int */
151 'm', /* itk_unsigned_long */
152 'x', /* itk_long_long */
153 'y' /* itk_unsigned_long_long */
156 static int decl_is_template_id (const tree, tree* const);
158 /* Functions for handling substitutions. */
160 static inline tree canonicalize_for_substitution (tree);
161 static void add_substitution (tree);
162 static inline int is_std_substitution (const tree,
163 const substitution_identifier_index_t);
164 static inline int is_std_substitution_char (const tree,
165 const substitution_identifier_index_t);
166 static int find_substitution (tree);
167 static void mangle_call_offset (const tree, const tree);
169 /* Functions for emitting mangled representations of things. */
171 static void write_mangled_name (const tree, bool);
172 static void write_encoding (const tree);
173 static void write_name (tree, const int);
174 static void write_unscoped_name (const tree);
175 static void write_unscoped_template_name (const tree);
176 static void write_nested_name (const tree);
177 static void write_prefix (const tree);
178 static void write_template_prefix (const tree);
179 static void write_unqualified_name (const tree);
180 static void write_conversion_operator_name (const tree);
181 static void write_source_name (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_integer_cst (const tree);
187 static void write_real_cst (const tree);
188 static void write_identifier (const char *);
189 static void write_special_name_constructor (const tree);
190 static void write_special_name_destructor (const tree);
191 static void write_type (tree);
192 static int write_CV_qualifiers_for_type (const tree);
193 static void write_builtin_type (tree);
194 static void write_function_type (const tree);
195 static void write_bare_function_type (const tree, const int, const tree);
196 static void write_method_parms (tree, const int, const tree);
197 static void write_class_enum_type (const tree);
198 static void write_template_args (tree);
199 static void write_expression (tree);
200 static void write_template_arg_literal (const tree);
201 static void write_template_arg (tree);
202 static void write_template_template_arg (const tree);
203 static void write_array_type (const tree);
204 static void write_pointer_to_member_type (const tree);
205 static void write_template_param (const tree);
206 static void write_template_template_param (const tree);
207 static void write_substitution (const int);
208 static int discriminator_for_local_entity (tree);
209 static int discriminator_for_string_literal (tree, tree);
210 static void write_discriminator (const int);
211 static void write_local_name (const tree, const tree, const tree);
212 static void dump_substitution_candidates (void);
213 static tree mangle_decl_string (const tree);
215 /* Control functions. */
217 static inline void start_mangling (const tree);
218 static inline const char *finish_mangling (const bool);
219 static tree mangle_special_for_type (const tree, const char *);
221 /* Foreign language functions. */
223 static void write_java_integer_type_codes (const tree);
225 /* Append a single character to the end of the mangled
227 #define write_char(CHAR) \
228 obstack_1grow (mangle_obstack, (CHAR))
230 /* Append a sized buffer to the end of the mangled representation. */
231 #define write_chars(CHAR, LEN) \
232 obstack_grow (mangle_obstack, (CHAR), (LEN))
234 /* Append a NUL-terminated string to the end of the mangled
236 #define write_string(STRING) \
237 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
239 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
240 same purpose (context, which may be a type) and value (template
241 decl). See write_template_prefix for more information on what this
243 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
244 (TREE_CODE (NODE1) == TREE_LIST \
245 && TREE_CODE (NODE2) == TREE_LIST \
246 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
247 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
248 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
249 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
251 /* Write out an unsigned quantity in base 10. */
252 #define write_unsigned_number(NUMBER) \
253 write_number ((NUMBER), /*unsigned_p=*/1, 10)
255 /* If DECL is a template instance, return nonzero and, if
256 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
257 Otherwise return zero. */
260 decl_is_template_id (const tree decl, tree* const template_info)
262 if (TREE_CODE (decl) == TYPE_DECL)
264 /* TYPE_DECLs are handled specially. Look at its type to decide
265 if this is a template instantiation. */
266 const tree type = TREE_TYPE (decl);
268 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
270 if (template_info != NULL)
271 /* For a templated TYPE_DECL, the template info is hanging
273 *template_info = TYPE_TEMPLATE_INFO (type);
279 /* Check if this is a primary template. */
280 if (DECL_LANG_SPECIFIC (decl) != NULL
281 && DECL_USE_TEMPLATE (decl)
282 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
283 && TREE_CODE (decl) != TEMPLATE_DECL)
285 if (template_info != NULL)
286 /* For most templated decls, the template info is hanging
288 *template_info = DECL_TEMPLATE_INFO (decl);
293 /* It's not a template id. */
297 /* Produce debugging output of current substitution candidates. */
300 dump_substitution_candidates (void)
305 fprintf (stderr, " ++ substitutions ");
306 for (i = 0; VEC_iterate (tree, G.substitutions, i, el); ++i)
308 const char *name = "???";
311 fprintf (stderr, " ");
313 name = IDENTIFIER_POINTER (DECL_NAME (el));
314 else if (TREE_CODE (el) == TREE_LIST)
315 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
316 else if (TYPE_NAME (el))
317 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
318 fprintf (stderr, " S%d_ = ", i - 1);
320 (CP_TYPE_RESTRICT_P (el)
321 || CP_TYPE_VOLATILE_P (el)
322 || CP_TYPE_CONST_P (el)))
323 fprintf (stderr, "CV-");
324 fprintf (stderr, "%s (%s at %p)\n",
325 name, tree_code_name[TREE_CODE (el)], (void *) el);
329 /* Both decls and types can be substitution candidates, but sometimes
330 they refer to the same thing. For instance, a TYPE_DECL and
331 RECORD_TYPE for the same class refer to the same thing, and should
332 be treated accordingly in substitutions. This function returns a
333 canonicalized tree node representing NODE that is used when adding
334 and substitution candidates and finding matches. */
337 canonicalize_for_substitution (tree node)
339 /* For a TYPE_DECL, use the type instead. */
340 if (TREE_CODE (node) == TYPE_DECL)
341 node = TREE_TYPE (node);
343 node = canonical_type_variant (node);
348 /* Add NODE as a substitution candidate. NODE must not already be on
349 the list of candidates. */
352 add_substitution (tree node)
357 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
358 tree_code_name[TREE_CODE (node)], (void *) node);
360 /* Get the canonicalized substitution candidate for NODE. */
361 c = canonicalize_for_substitution (node);
362 if (DEBUG_MANGLE && c != node)
363 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
364 tree_code_name[TREE_CODE (node)], (void *) node);
368 /* Make sure NODE isn't already a candidate. */
373 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++)
375 gcc_assert (!(DECL_P (node) && node == candidate));
376 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
377 && same_type_p (node, candidate)));
380 #endif /* ENABLE_CHECKING */
382 /* Put the decl onto the varray of substitution candidates. */
383 VEC_safe_push (tree, gc, G.substitutions, node);
386 dump_substitution_candidates ();
389 /* Helper function for find_substitution. Returns nonzero if NODE,
390 which may be a decl or a CLASS_TYPE, is a template-id with template
391 name of substitution_index[INDEX] in the ::std namespace. */
394 is_std_substitution (const tree node,
395 const substitution_identifier_index_t index)
402 type = TREE_TYPE (node);
405 else if (CLASS_TYPE_P (node))
408 decl = TYPE_NAME (node);
411 /* These are not the droids you're looking for. */
414 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
415 && TYPE_LANG_SPECIFIC (type)
416 && TYPE_TEMPLATE_INFO (type)
417 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
418 == subst_identifiers[index]));
421 /* Helper function for find_substitution. Returns nonzero if NODE,
422 which may be a decl or a CLASS_TYPE, is the template-id
423 ::std::identifier<char>, where identifier is
424 substitution_index[INDEX]. */
427 is_std_substitution_char (const tree node,
428 const substitution_identifier_index_t index)
431 /* Check NODE's name is ::std::identifier. */
432 if (!is_std_substitution (node, index))
434 /* Figure out its template args. */
436 args = DECL_TI_ARGS (node);
437 else if (CLASS_TYPE_P (node))
438 args = CLASSTYPE_TI_ARGS (node);
440 /* Oops, not a template. */
442 /* NODE's template arg list should be <char>. */
444 TREE_VEC_LENGTH (args) == 1
445 && TREE_VEC_ELT (args, 0) == char_type_node;
448 /* Check whether a substitution should be used to represent NODE in
451 First, check standard special-case substitutions.
453 <substitution> ::= St
460 # ::std::basic_string
463 # ::std::basic_string<char,
464 ::std::char_traits<char>,
465 ::std::allocator<char> >
468 # ::std::basic_istream<char, ::std::char_traits<char> >
471 # ::std::basic_ostream<char, ::std::char_traits<char> >
474 # ::std::basic_iostream<char, ::std::char_traits<char> >
476 Then examine the stack of currently available substitution
477 candidates for entities appearing earlier in the same mangling
479 If a substitution is found, write its mangled representation and
480 return nonzero. If none is found, just return zero. */
483 find_substitution (tree node)
486 const int size = VEC_length (tree, G.substitutions);
491 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
492 tree_code_name[TREE_CODE (node)], (void *) node);
494 /* Obtain the canonicalized substitution representation for NODE.
495 This is what we'll compare against. */
496 node = canonicalize_for_substitution (node);
498 /* Check for builtin substitutions. */
500 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
501 type = TYPE_P (node) ? node : TREE_TYPE (node);
503 /* Check for std::allocator. */
505 && is_std_substitution (decl, SUBID_ALLOCATOR)
506 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
512 /* Check for std::basic_string. */
513 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
517 /* If this is a type (i.e. a fully-qualified template-id),
519 std::basic_string <char,
520 std::char_traits<char>,
521 std::allocator<char> > . */
522 if (cp_type_quals (type) == TYPE_UNQUALIFIED
523 && CLASSTYPE_USE_TEMPLATE (type))
525 tree args = CLASSTYPE_TI_ARGS (type);
526 if (TREE_VEC_LENGTH (args) == 3
527 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
528 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
530 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
539 /* Substitute for the template name only if this isn't a type. */
546 /* Check for basic_{i,o,io}stream. */
548 && cp_type_quals (type) == TYPE_UNQUALIFIED
549 && CLASS_TYPE_P (type)
550 && CLASSTYPE_USE_TEMPLATE (type)
551 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
553 /* First, check for the template
554 args <char, std::char_traits<char> > . */
555 tree args = CLASSTYPE_TI_ARGS (type);
556 if (TREE_VEC_LENGTH (args) == 2
557 && TYPE_P (TREE_VEC_ELT (args, 0))
558 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
559 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
562 /* Got them. Is this basic_istream? */
563 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
568 /* Or basic_ostream? */
569 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
574 /* Or basic_iostream? */
575 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
583 /* Check for namespace std. */
584 if (decl && DECL_NAMESPACE_STD_P (decl))
590 /* Now check the list of available substitutions for this mangling
592 for (i = 0; i < size; ++i)
594 tree candidate = VEC_index (tree, G.substitutions, i);
595 /* NODE is a matched to a candidate if it's the same decl node or
596 if it's the same type. */
597 if (decl == candidate
598 || (TYPE_P (candidate) && type && TYPE_P (type)
599 && same_type_p (type, candidate))
600 || NESTED_TEMPLATE_MATCH (node, candidate))
602 write_substitution (i);
607 /* No substitution found. */
612 /* TOP_LEVEL is true, if this is being called at outermost level of
613 mangling. It should be false when mangling a decl appearing in an
614 expression within some other mangling.
616 <mangled-name> ::= _Z <encoding> */
619 write_mangled_name (const tree decl, bool top_level)
621 MANGLE_TRACE_TREE ("mangled-name", decl);
623 if (/* The names of `extern "C"' functions are not mangled. */
624 DECL_EXTERN_C_FUNCTION_P (decl)
625 /* But overloaded operator names *are* mangled. */
626 && !DECL_OVERLOADED_OPERATOR_P (decl))
631 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
634 /* The standard notes: "The <encoding> of an extern "C"
635 function is treated like global-scope data, i.e. as its
636 <source-name> without a type." We cannot write
637 overloaded operators that way though, because it contains
638 characters invalid in assembler. */
639 if (abi_version_at_least (2))
642 G.need_abi_warning = true;
643 write_source_name (DECL_NAME (decl));
646 else if (TREE_CODE (decl) == VAR_DECL
647 /* The names of non-static global variables aren't mangled. */
648 && DECL_EXTERNAL_LINKAGE_P (decl)
649 && (CP_DECL_CONTEXT (decl) == global_namespace
650 /* And neither are `extern "C"' variables. */
651 || DECL_EXTERN_C_P (decl)))
653 if (top_level || abi_version_at_least (2))
657 G.need_abi_warning = true;
665 write_encoding (decl);
666 if (DECL_LANG_SPECIFIC (decl)
667 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
668 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
669 /* We need a distinct mangled name for these entities, but
670 we should never actually output it. So, we append some
671 characters the assembler won't like. */
672 write_string (" *INTERNAL* ");
676 /* <encoding> ::= <function name> <bare-function-type>
680 write_encoding (const tree decl)
682 MANGLE_TRACE_TREE ("encoding", decl);
684 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
686 /* For overloaded operators write just the mangled name
687 without arguments. */
688 if (DECL_OVERLOADED_OPERATOR_P (decl))
689 write_name (decl, /*ignore_local_scope=*/0);
691 write_source_name (DECL_NAME (decl));
695 write_name (decl, /*ignore_local_scope=*/0);
696 if (TREE_CODE (decl) == FUNCTION_DECL)
701 if (decl_is_template_id (decl, NULL))
703 fn_type = get_mostly_instantiated_function_type (decl);
704 /* FN_TYPE will not have parameter types for in-charge or
705 VTT parameters. Therefore, we pass NULL_TREE to
706 write_bare_function_type -- otherwise, it will get
707 confused about which artificial parameters to skip. */
712 fn_type = TREE_TYPE (decl);
716 write_bare_function_type (fn_type,
717 (!DECL_CONSTRUCTOR_P (decl)
718 && !DECL_DESTRUCTOR_P (decl)
719 && !DECL_CONV_FN_P (decl)
720 && decl_is_template_id (decl, NULL)),
725 /* <name> ::= <unscoped-name>
726 ::= <unscoped-template-name> <template-args>
730 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
731 called from <local-name>, which mangles the enclosing scope
732 elsewhere and then uses this function to mangle just the part
733 underneath the function scope. So don't use the <local-name>
734 production, to avoid an infinite recursion. */
737 write_name (tree decl, const int ignore_local_scope)
741 MANGLE_TRACE_TREE ("name", decl);
743 if (TREE_CODE (decl) == TYPE_DECL)
745 /* In case this is a typedef, fish out the corresponding
746 TYPE_DECL for the main variant. */
747 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
748 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
751 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
753 /* A decl in :: or ::std scope is treated specially. The former is
754 mangled using <unscoped-name> or <unscoped-template-name>, the
755 latter with a special substitution. Also, a name that is
756 directly in a local function scope is also mangled with
757 <unscoped-name> rather than a full <nested-name>. */
759 || context == global_namespace
760 || DECL_NAMESPACE_STD_P (context)
761 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
764 /* Is this a template instance? */
765 if (decl_is_template_id (decl, &template_info))
767 /* Yes: use <unscoped-template-name>. */
768 write_unscoped_template_name (TI_TEMPLATE (template_info));
769 write_template_args (TI_ARGS (template_info));
772 /* Everything else gets an <unqualified-name>. */
773 write_unscoped_name (decl);
777 /* Handle local names, unless we asked not to (that is, invoked
778 under <local-name>, to handle only the part of the name under
780 if (!ignore_local_scope)
782 /* Scan up the list of scope context, looking for a
783 function. If we find one, this entity is in local
784 function scope. local_entity tracks context one scope
785 level down, so it will contain the element that's
786 directly in that function's scope, either decl or one of
787 its enclosing scopes. */
788 tree local_entity = decl;
789 while (context != NULL && context != global_namespace)
791 /* Make sure we're always dealing with decls. */
792 if (context != NULL && TYPE_P (context))
793 context = TYPE_NAME (context);
794 /* Is this a function? */
795 if (TREE_CODE (context) == FUNCTION_DECL)
797 /* Yes, we have local scope. Use the <local-name>
798 production for the innermost function scope. */
799 write_local_name (context, local_entity, decl);
802 /* Up one scope level. */
803 local_entity = context;
804 context = CP_DECL_CONTEXT (context);
807 /* No local scope found? Fall through to <nested-name>. */
810 /* Other decls get a <nested-name> to encode their scope. */
811 write_nested_name (decl);
815 /* <unscoped-name> ::= <unqualified-name>
816 ::= St <unqualified-name> # ::std:: */
819 write_unscoped_name (const tree decl)
821 tree context = CP_DECL_CONTEXT (decl);
823 MANGLE_TRACE_TREE ("unscoped-name", decl);
825 /* Is DECL in ::std? */
826 if (DECL_NAMESPACE_STD_P (context))
829 write_unqualified_name (decl);
833 /* If not, it should be either in the global namespace, or directly
834 in a local function scope. */
835 gcc_assert (context == global_namespace
837 || TREE_CODE (context) == FUNCTION_DECL);
839 write_unqualified_name (decl);
843 /* <unscoped-template-name> ::= <unscoped-name>
844 ::= <substitution> */
847 write_unscoped_template_name (const tree decl)
849 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
851 if (find_substitution (decl))
853 write_unscoped_name (decl);
854 add_substitution (decl);
857 /* Write the nested name, including CV-qualifiers, of DECL.
859 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
860 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
862 <CV-qualifiers> ::= [r] [V] [K] */
865 write_nested_name (const tree decl)
869 MANGLE_TRACE_TREE ("nested-name", decl);
873 /* Write CV-qualifiers, if this is a member function. */
874 if (TREE_CODE (decl) == FUNCTION_DECL
875 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
877 if (DECL_VOLATILE_MEMFUNC_P (decl))
879 if (DECL_CONST_MEMFUNC_P (decl))
883 /* Is this a template instance? */
884 if (decl_is_template_id (decl, &template_info))
886 /* Yes, use <template-prefix>. */
887 write_template_prefix (decl);
888 write_template_args (TI_ARGS (template_info));
892 /* No, just use <prefix> */
893 write_prefix (DECL_CONTEXT (decl));
894 write_unqualified_name (decl);
899 /* <prefix> ::= <prefix> <unqualified-name>
901 ::= <template-prefix> <template-args>
903 ::= <substitution> */
906 write_prefix (const tree node)
909 /* Non-NULL if NODE represents a template-id. */
910 tree template_info = NULL;
912 MANGLE_TRACE_TREE ("prefix", node);
915 || node == global_namespace)
918 if (find_substitution (node))
923 /* If this is a function decl, that means we've hit function
924 scope, so this prefix must be for a local name. In this
925 case, we're under the <local-name> production, which encodes
926 the enclosing function scope elsewhere. So don't continue
928 if (TREE_CODE (node) == FUNCTION_DECL)
932 decl_is_template_id (decl, &template_info);
936 /* Node is a type. */
937 decl = TYPE_NAME (node);
938 if (CLASSTYPE_TEMPLATE_ID_P (node))
939 template_info = TYPE_TEMPLATE_INFO (node);
942 /* In G++ 3.2, the name of the template parameter was used. */
943 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
944 && !abi_version_at_least (2))
945 G.need_abi_warning = true;
947 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
948 && abi_version_at_least (2))
949 write_template_param (node);
950 else if (template_info != NULL)
953 write_template_prefix (decl);
954 write_template_args (TI_ARGS (template_info));
959 write_prefix (CP_DECL_CONTEXT (decl));
960 write_unqualified_name (decl);
963 add_substitution (node);
966 /* <template-prefix> ::= <prefix> <template component>
968 ::= <substitution> */
971 write_template_prefix (const tree node)
973 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
974 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
975 tree context = CP_DECL_CONTEXT (decl);
980 MANGLE_TRACE_TREE ("template-prefix", node);
982 /* Find the template decl. */
983 if (decl_is_template_id (decl, &template_info))
984 templ = TI_TEMPLATE (template_info);
987 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
989 templ = TYPE_TI_TEMPLATE (type);
992 /* For a member template, though, the template name for the
993 innermost name must have all the outer template levels
994 instantiated. For instance, consider
996 template<typename T> struct Outer {
997 template<typename U> struct Inner {};
1000 The template name for `Inner' in `Outer<int>::Inner<float>' is
1001 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1002 levels separately, so there's no TEMPLATE_DECL available for this
1003 (there's only `Outer<T>::Inner<U>').
1005 In order to get the substitutions right, we create a special
1006 TREE_LIST to represent the substitution candidate for a nested
1007 template. The TREE_PURPOSE is the template's context, fully
1008 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1011 So, for the example above, `Outer<int>::Inner' is represented as a
1012 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1013 and whose value is `Outer<T>::Inner<U>'. */
1014 if (TYPE_P (context))
1015 substitution = build_tree_list (context, templ);
1017 substitution = templ;
1019 if (find_substitution (substitution))
1022 /* In G++ 3.2, the name of the template template parameter was used. */
1023 if (TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1024 && !abi_version_at_least (2))
1025 G.need_abi_warning = true;
1027 if (TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1028 && abi_version_at_least (2))
1029 write_template_param (TREE_TYPE (templ));
1032 write_prefix (context);
1033 write_unqualified_name (decl);
1036 add_substitution (substitution);
1039 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1040 mangled through special entry points.
1042 <unqualified-name> ::= <operator-name>
1045 ::= <local-source-name>
1047 <local-source-name> ::= L <source-name> <discriminator> */
1050 write_unqualified_name (const tree decl)
1052 MANGLE_TRACE_TREE ("unqualified-name", decl);
1054 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
1055 write_special_name_constructor (decl);
1056 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
1057 write_special_name_destructor (decl);
1058 else if (DECL_NAME (decl) == NULL_TREE)
1060 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl));
1061 write_source_name (DECL_ASSEMBLER_NAME (decl));
1063 else if (DECL_CONV_FN_P (decl))
1065 /* Conversion operator. Handle it right here.
1066 <operator> ::= cv <type> */
1068 if (decl_is_template_id (decl, NULL))
1071 fn_type = get_mostly_instantiated_function_type (decl);
1072 type = TREE_TYPE (fn_type);
1075 type = DECL_CONV_FN_TYPE (decl);
1076 write_conversion_operator_name (type);
1078 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1080 operator_name_info_t *oni;
1081 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1082 oni = assignment_operator_name_info;
1084 oni = operator_name_info;
1086 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1088 else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1089 && DECL_NAMESPACE_SCOPE_P (decl)
1090 && decl_linkage (decl) == lk_internal)
1092 MANGLE_TRACE_TREE ("local-source-name", decl);
1094 write_source_name (DECL_NAME (decl));
1095 /* The default discriminator is 1, and that's all we ever use,
1096 so there's no code to output one here. */
1099 write_source_name (DECL_NAME (decl));
1102 /* Write the unqualified-name for a conversion operator to TYPE. */
1105 write_conversion_operator_name (const tree type)
1107 write_string ("cv");
1111 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1113 <source-name> ::= </length/ number> <identifier> */
1116 write_source_name (tree identifier)
1118 MANGLE_TRACE_TREE ("source-name", identifier);
1120 /* Never write the whole template-id name including the template
1121 arguments; we only want the template name. */
1122 if (IDENTIFIER_TEMPLATE (identifier))
1123 identifier = IDENTIFIER_TEMPLATE (identifier);
1125 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1126 write_identifier (IDENTIFIER_POINTER (identifier));
1129 /* Convert NUMBER to ascii using base BASE and generating at least
1130 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1131 into which to store the characters. Returns the number of
1132 characters generated (these will be layed out in advance of where
1136 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1137 char *buffer, const unsigned int min_digits)
1139 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1140 unsigned digits = 0;
1144 unsigned HOST_WIDE_INT d = number / base;
1146 *--buffer = base_digits[number - d * base];
1150 while (digits < min_digits)
1152 *--buffer = base_digits[0];
1158 /* Non-terminal <number>.
1160 <number> ::= [n] </decimal integer/> */
1163 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1164 const unsigned int base)
1166 char buffer[sizeof (HOST_WIDE_INT) * 8];
1169 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1172 number = -((HOST_WIDE_INT) number);
1174 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1175 write_chars (buffer + sizeof (buffer) - count, count);
1178 /* Write out an integral CST in decimal. Most numbers are small, and
1179 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1180 bigger than that, which we must deal with. */
1183 write_integer_cst (const tree cst)
1185 int sign = tree_int_cst_sgn (cst);
1187 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1189 /* A bignum. We do this in chunks, each of which fits in a
1191 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1192 unsigned HOST_WIDE_INT chunk;
1193 unsigned chunk_digits;
1194 char *ptr = buffer + sizeof (buffer);
1199 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1204 if (sizeof (HOST_WIDE_INT) >= 8)
1206 /* It is at least 64 bits, so 10^18 is representable. */
1211 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1212 base = build_int_cstu (type, chunk);
1213 n = build_int_cst_wide (type,
1214 TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1219 n = fold_build1 (NEGATE_EXPR, type, n);
1223 tree d = fold_build2 (FLOOR_DIV_EXPR, type, n, base);
1224 tree tmp = fold_build2 (MULT_EXPR, type, d, base);
1227 done = integer_zerop (d);
1228 tmp = fold_build2 (MINUS_EXPR, type, n, tmp);
1229 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1230 done ? 1 : chunk_digits);
1236 write_chars (ptr, count);
1241 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1248 write_unsigned_number (low);
1252 /* Write out a floating-point literal.
1254 "Floating-point literals are encoded using the bit pattern of the
1255 target processor's internal representation of that number, as a
1256 fixed-length lowercase hexadecimal string, high-order bytes first
1257 (even if the target processor would store low-order bytes first).
1258 The "n" prefix is not used for floating-point literals; the sign
1259 bit is encoded with the rest of the number.
1261 Here are some examples, assuming the IEEE standard representation
1262 for floating point numbers. (Spaces are for readability, not
1263 part of the encoding.)
1266 -1.0f Lf bf80 0000 E
1267 1.17549435e-38f Lf 0080 0000 E
1268 1.40129846e-45f Lf 0000 0001 E
1269 0.0f Lf 0000 0000 E"
1271 Caller is responsible for the Lx and the E. */
1273 write_real_cst (const tree value)
1275 if (abi_version_at_least (2))
1277 long target_real[4]; /* largest supported float */
1278 char buffer[9]; /* eight hex digits in a 32-bit number */
1281 tree type = TREE_TYPE (value);
1282 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1284 real_to_target (target_real, &TREE_REAL_CST (value),
1287 /* The value in target_real is in the target word order,
1288 so we must write it out backward if that happens to be
1289 little-endian. write_number cannot be used, it will
1290 produce uppercase. */
1291 if (FLOAT_WORDS_BIG_ENDIAN)
1292 i = 0, limit = words, dir = 1;
1294 i = words - 1, limit = -1, dir = -1;
1296 for (; i != limit; i += dir)
1298 sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
1299 write_chars (buffer, 8);
1304 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1305 literally. Note that compatibility with 3.2 is impossible,
1306 because the old floating-point emulator used a different
1307 format for REAL_VALUE_TYPE. */
1309 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1310 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1313 G.need_abi_warning = 1;
1317 /* Non-terminal <identifier>.
1319 <identifier> ::= </unqualified source code identifier> */
1322 write_identifier (const char *identifier)
1324 MANGLE_TRACE ("identifier", identifier);
1325 write_string (identifier);
1328 /* Handle constructor productions of non-terminal <special-name>.
1329 CTOR is a constructor FUNCTION_DECL.
1331 <special-name> ::= C1 # complete object constructor
1332 ::= C2 # base object constructor
1333 ::= C3 # complete object allocating constructor
1335 Currently, allocating constructors are never used.
1337 We also need to provide mangled names for the maybe-in-charge
1338 constructor, so we treat it here too. mangle_decl_string will
1339 append *INTERNAL* to that, to make sure we never emit it. */
1342 write_special_name_constructor (const tree ctor)
1344 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1345 write_string ("C2");
1348 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1349 /* Even though we don't ever emit a definition of
1350 the old-style destructor, we still have to
1351 consider entities (like static variables) nested
1353 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor));
1354 write_string ("C1");
1358 /* Handle destructor productions of non-terminal <special-name>.
1359 DTOR is a destructor FUNCTION_DECL.
1361 <special-name> ::= D0 # deleting (in-charge) destructor
1362 ::= D1 # complete object (in-charge) destructor
1363 ::= D2 # base object (not-in-charge) destructor
1365 We also need to provide mangled names for the maybe-incharge
1366 destructor, so we treat it here too. mangle_decl_string will
1367 append *INTERNAL* to that, to make sure we never emit it. */
1370 write_special_name_destructor (const tree dtor)
1372 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1373 write_string ("D0");
1374 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1375 write_string ("D2");
1378 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1379 /* Even though we don't ever emit a definition of
1380 the old-style destructor, we still have to
1381 consider entities (like static variables) nested
1383 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor));
1384 write_string ("D1");
1388 /* Return the discriminator for ENTITY appearing inside
1389 FUNCTION. The discriminator is the lexical ordinal of VAR among
1390 entities with the same name in the same FUNCTION. */
1393 discriminator_for_local_entity (tree entity)
1395 /* Assume this is the only local entity with this name. */
1396 int discriminator = 0;
1398 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1399 discriminator = DECL_DISCRIMINATOR (entity);
1400 else if (TREE_CODE (entity) == TYPE_DECL)
1404 /* Scan the list of local classes. */
1405 entity = TREE_TYPE (entity);
1406 for (ix = 0; ; ix++)
1408 tree type = VEC_index (tree, local_classes, ix);
1411 if (TYPE_IDENTIFIER (type) == TYPE_IDENTIFIER (entity)
1412 && TYPE_CONTEXT (type) == TYPE_CONTEXT (entity))
1417 return discriminator;
1420 /* Return the discriminator for STRING, a string literal used inside
1421 FUNCTION. The discriminator is the lexical ordinal of STRING among
1422 string literals used in FUNCTION. */
1425 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1426 tree string ATTRIBUTE_UNUSED)
1428 /* For now, we don't discriminate amongst string literals. */
1432 /* <discriminator> := _ <number>
1434 The discriminator is used only for the second and later occurrences
1435 of the same name within a single function. In this case <number> is
1436 n - 2, if this is the nth occurrence, in lexical order. */
1439 write_discriminator (const int discriminator)
1441 /* If discriminator is zero, don't write anything. Otherwise... */
1442 if (discriminator > 0)
1445 write_unsigned_number (discriminator - 1);
1449 /* Mangle the name of a function-scope entity. FUNCTION is the
1450 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1451 the entity itself. LOCAL_ENTITY is the entity that's directly
1452 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1455 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1456 := Z <function encoding> E s [<discriminator>] */
1459 write_local_name (const tree function, const tree local_entity,
1462 MANGLE_TRACE_TREE ("local-name", entity);
1465 write_encoding (function);
1467 if (TREE_CODE (entity) == STRING_CST)
1470 write_discriminator (discriminator_for_string_literal (function,
1475 /* Now the <entity name>. Let write_name know its being called
1476 from <local-name>, so it doesn't try to process the enclosing
1477 function scope again. */
1478 write_name (entity, /*ignore_local_scope=*/1);
1479 write_discriminator (discriminator_for_local_entity (local_entity));
1483 /* Non-terminals <type> and <CV-qualifier>.
1485 <type> ::= <builtin-type>
1487 ::= <class-enum-type>
1489 ::= <pointer-to-member-type>
1490 ::= <template-param>
1493 ::= P <type> # pointer-to
1494 ::= R <type> # reference-to
1495 ::= C <type> # complex pair (C 2000)
1496 ::= G <type> # imaginary (C 2000) [not supported]
1497 ::= U <source-name> <type> # vendor extended type qualifier
1501 <type> ::= RR <type> # rvalue reference-to
1502 <type> ::= Dt <expression> # decltype of an id-expression or
1503 # class member access
1504 <type> ::= DT <expression> # decltype of an expression
1506 TYPE is a type node. */
1509 write_type (tree type)
1511 /* This gets set to nonzero if TYPE turns out to be a (possibly
1512 CV-qualified) builtin type. */
1513 int is_builtin_type = 0;
1515 MANGLE_TRACE_TREE ("type", type);
1517 if (type == error_mark_node)
1520 if (find_substitution (type))
1523 if (write_CV_qualifiers_for_type (type) > 0)
1524 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1525 mangle the unqualified type. The recursive call is needed here
1526 since both the qualified and unqualified types are substitution
1528 write_type (TYPE_MAIN_VARIANT (type));
1529 else if (TREE_CODE (type) == ARRAY_TYPE)
1530 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1531 so that the cv-qualification of the element type is available
1532 in write_array_type. */
1533 write_array_type (type);
1536 tree type_orig = type;
1538 /* See through any typedefs. */
1539 type = TYPE_MAIN_VARIANT (type);
1541 if (TYPE_PTRMEM_P (type))
1542 write_pointer_to_member_type (type);
1545 /* Handle any target-specific fundamental types. */
1546 const char *target_mangling
1547 = targetm.mangle_type (type_orig);
1549 if (target_mangling)
1551 write_string (target_mangling);
1552 /* Add substitutions for types other than fundamental
1554 if (TREE_CODE (type) != VOID_TYPE
1555 && TREE_CODE (type) != INTEGER_TYPE
1556 && TREE_CODE (type) != REAL_TYPE
1557 && TREE_CODE (type) != BOOLEAN_TYPE)
1558 add_substitution (type);
1562 switch (TREE_CODE (type))
1566 case INTEGER_TYPE: /* Includes wchar_t. */
1569 /* If this is a typedef, TYPE may not be one of
1570 the standard builtin type nodes, but an alias of one. Use
1571 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1572 write_builtin_type (TYPE_MAIN_VARIANT (type));
1579 write_type (TREE_TYPE (type));
1584 write_function_type (type);
1590 /* A pointer-to-member function is represented as a special
1591 RECORD_TYPE, so check for this first. */
1592 if (TYPE_PTRMEMFUNC_P (type))
1593 write_pointer_to_member_type (type);
1595 write_class_enum_type (type);
1599 case UNBOUND_CLASS_TEMPLATE:
1600 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1601 ordinary nested names. */
1602 write_nested_name (TYPE_STUB_DECL (type));
1607 write_type (TREE_TYPE (type));
1610 case REFERENCE_TYPE:
1611 if (TYPE_REF_IS_RVALUE (type))
1615 write_type (TREE_TYPE (type));
1618 case TEMPLATE_TYPE_PARM:
1619 case TEMPLATE_PARM_INDEX:
1620 write_template_param (type);
1623 case TEMPLATE_TEMPLATE_PARM:
1624 write_template_template_param (type);
1627 case BOUND_TEMPLATE_TEMPLATE_PARM:
1628 write_template_template_param (type);
1630 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1634 write_string ("U8__vector");
1635 write_type (TREE_TYPE (type));
1638 case TYPE_PACK_EXPANSION:
1639 write_string ("U10__variadic");
1640 write_type (PACK_EXPANSION_PATTERN (type));
1645 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
1649 write_expression (DECLTYPE_TYPE_EXPR (type));
1654 sorry ("mangling typeof, use decltype instead");
1663 /* Types other than builtin types are substitution candidates. */
1664 if (!is_builtin_type)
1665 add_substitution (type);
1668 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1669 CV-qualifiers written for TYPE.
1671 <CV-qualifiers> ::= [r] [V] [K] */
1674 write_CV_qualifiers_for_type (const tree type)
1676 int num_qualifiers = 0;
1678 /* The order is specified by:
1680 "In cases where multiple order-insensitive qualifiers are
1681 present, they should be ordered 'K' (closest to the base type),
1682 'V', 'r', and 'U' (farthest from the base type) ..."
1684 Note that we do not use cp_type_quals below; given "const
1685 int[3]", the "const" is emitted with the "int", not with the
1688 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1693 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1698 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1704 return num_qualifiers;
1707 /* Non-terminal <builtin-type>.
1709 <builtin-type> ::= v # void
1714 ::= h # unsigned char
1716 ::= t # unsigned short
1718 ::= j # unsigned int
1720 ::= m # unsigned long
1721 ::= x # long long, __int64
1722 ::= y # unsigned long long, __int64
1724 ::= o # unsigned __int128
1727 ::= e # long double, __float80
1728 ::= g # __float128 [not supported]
1729 ::= u <source-name> # vendor extended type */
1732 write_builtin_type (tree type)
1734 if (TYPE_CANONICAL (type))
1735 type = TYPE_CANONICAL (type);
1737 switch (TREE_CODE (type))
1748 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
1749 isn't in integer_type_nodes. */
1750 if (type == wchar_type_node)
1752 else if (type == char16_type_node)
1753 write_string ("u8char16_t");
1754 else if (type == char32_type_node)
1755 write_string ("u8char32_t");
1756 else if (TYPE_FOR_JAVA (type))
1757 write_java_integer_type_codes (type);
1761 /* Assume TYPE is one of the shared integer type nodes. Find
1762 it in the array of these nodes. */
1764 for (itk = 0; itk < itk_none; ++itk)
1765 if (type == integer_types[itk])
1767 /* Print the corresponding single-letter code. */
1768 write_char (integer_type_codes[itk]);
1772 if (itk == itk_none)
1774 tree t = c_common_type_for_mode (TYPE_MODE (type),
1775 TYPE_UNSIGNED (type));
1782 if (TYPE_PRECISION (type) == 128)
1783 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
1786 /* Allow for cases where TYPE is not one of the shared
1787 integer type nodes and write a "vendor extended builtin
1788 type" with a name the form intN or uintN, respectively.
1789 Situations like this can happen if you have an
1790 __attribute__((__mode__(__SI__))) type and use exotic
1791 switches like '-mint8' on AVR. Of course, this is
1792 undefined by the C++ ABI (and '-mint8' is not even
1793 Standard C conforming), but when using such special
1794 options you're pretty much in nowhere land anyway. */
1796 char prec[11]; /* up to ten digits for an unsigned */
1798 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
1799 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
1800 write_char ('u'); /* "vendor extended builtin type" */
1801 write_unsigned_number (strlen (prefix) + strlen (prec));
1802 write_string (prefix);
1803 write_string (prec);
1810 if (type == float_type_node
1811 || type == java_float_type_node)
1813 else if (type == double_type_node
1814 || type == java_double_type_node)
1816 else if (type == long_double_type_node)
1827 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1828 METHOD_TYPE. The return type is mangled before the parameter
1831 <function-type> ::= F [Y] <bare-function-type> E */
1834 write_function_type (const tree type)
1836 MANGLE_TRACE_TREE ("function-type", type);
1838 /* For a pointer to member function, the function type may have
1839 cv-qualifiers, indicating the quals for the artificial 'this'
1841 if (TREE_CODE (type) == METHOD_TYPE)
1843 /* The first parameter must be a POINTER_TYPE pointing to the
1844 `this' parameter. */
1845 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1846 write_CV_qualifiers_for_type (this_type);
1850 /* We don't track whether or not a type is `extern "C"'. Note that
1851 you can have an `extern "C"' function that does not have
1852 `extern "C"' type, and vice versa:
1854 extern "C" typedef void function_t();
1855 function_t f; // f has C++ linkage, but its type is
1858 typedef void function_t();
1859 extern "C" function_t f; // Vice versa.
1862 write_bare_function_type (type, /*include_return_type_p=*/1,
1867 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1868 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1869 is mangled before the parameter types. If non-NULL, DECL is
1870 FUNCTION_DECL for the function whose type is being emitted.
1872 If DECL is a member of a Java type, then a literal 'J'
1873 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
1876 <bare-function-type> ::= [J]</signature/ type>+ */
1879 write_bare_function_type (const tree type, const int include_return_type_p,
1884 MANGLE_TRACE_TREE ("bare-function-type", type);
1886 /* Detect Java methods and emit special encoding. */
1888 && DECL_FUNCTION_MEMBER_P (decl)
1889 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
1890 && !DECL_CONSTRUCTOR_P (decl)
1891 && !DECL_DESTRUCTOR_P (decl)
1892 && !DECL_CONV_FN_P (decl))
1902 /* Mangle the return type, if requested. */
1903 if (include_return_type_p || java_method_p)
1904 write_type (TREE_TYPE (type));
1906 /* Now mangle the types of the arguments. */
1907 write_method_parms (TYPE_ARG_TYPES (type),
1908 TREE_CODE (type) == METHOD_TYPE,
1912 /* Write the mangled representation of a method parameter list of
1913 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1914 considered a non-static method, and the this parameter is omitted.
1915 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1916 parameters are being emitted. */
1919 write_method_parms (tree parm_types, const int method_p, const tree decl)
1921 tree first_parm_type;
1922 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1924 /* Assume this parameter type list is variable-length. If it ends
1925 with a void type, then it's not. */
1928 /* If this is a member function, skip the first arg, which is the
1930 "Member functions do not encode the type of their implicit this
1933 Similarly, there's no need to mangle artificial parameters, like
1934 the VTT parameters for constructors and destructors. */
1937 parm_types = TREE_CHAIN (parm_types);
1938 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1940 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1942 parm_types = TREE_CHAIN (parm_types);
1943 parm_decl = TREE_CHAIN (parm_decl);
1947 for (first_parm_type = parm_types;
1949 parm_types = TREE_CHAIN (parm_types))
1951 tree parm = TREE_VALUE (parm_types);
1952 if (parm == void_type_node)
1954 /* "Empty parameter lists, whether declared as () or
1955 conventionally as (void), are encoded with a void parameter
1957 if (parm_types == first_parm_type)
1959 /* If the parm list is terminated with a void type, it's
1962 /* A void type better be the last one. */
1963 gcc_assert (TREE_CHAIN (parm_types) == NULL);
1970 /* <builtin-type> ::= z # ellipsis */
1974 /* <class-enum-type> ::= <name> */
1977 write_class_enum_type (const tree type)
1979 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1982 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1985 <template-args> ::= I <template-arg>+ E */
1988 write_template_args (tree args)
1991 int length = TREE_VEC_LENGTH (args);
1993 MANGLE_TRACE_TREE ("template-args", args);
1997 gcc_assert (length > 0);
1999 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
2001 /* We have nested template args. We want the innermost template
2003 args = TREE_VEC_ELT (args, length - 1);
2004 length = TREE_VEC_LENGTH (args);
2006 for (i = 0; i < length; ++i)
2007 write_template_arg (TREE_VEC_ELT (args, i));
2012 /* <expression> ::= <unary operator-name> <expression>
2013 ::= <binary operator-name> <expression> <expression>
2016 <expr-primary> ::= <template-param>
2017 ::= L <type> <value number> E # literal
2018 ::= L <mangled-name> E # external name
2019 ::= sr <type> <unqualified-name>
2020 ::= sr <type> <unqualified-name> <template-args> */
2023 write_expression (tree expr)
2025 enum tree_code code;
2027 code = TREE_CODE (expr);
2029 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2030 is converted (via qualification conversions) to another
2032 while (TREE_CODE (expr) == NOP_EXPR
2033 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2035 expr = TREE_OPERAND (expr, 0);
2036 code = TREE_CODE (expr);
2039 if (code == BASELINK)
2041 expr = BASELINK_FUNCTIONS (expr);
2042 code = TREE_CODE (expr);
2045 /* Handle pointers-to-members by making them look like expression
2047 if (code == PTRMEM_CST)
2049 expr = build_nt (ADDR_EXPR,
2050 build_qualified_name (/*type=*/NULL_TREE,
2051 PTRMEM_CST_CLASS (expr),
2052 PTRMEM_CST_MEMBER (expr),
2053 /*template_p=*/false));
2054 code = TREE_CODE (expr);
2057 /* Handle template parameters. */
2058 if (code == TEMPLATE_TYPE_PARM
2059 || code == TEMPLATE_TEMPLATE_PARM
2060 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2061 || code == TEMPLATE_PARM_INDEX)
2062 write_template_param (expr);
2063 /* Handle literals. */
2064 else if (TREE_CODE_CLASS (code) == tcc_constant
2065 || (abi_version_at_least (2) && code == CONST_DECL))
2066 write_template_arg_literal (expr);
2067 else if (DECL_P (expr))
2069 /* G++ 3.2 incorrectly mangled non-type template arguments of
2070 enumeration type using their names. */
2071 if (code == CONST_DECL)
2072 G.need_abi_warning = 1;
2074 write_mangled_name (expr, false);
2077 else if (TREE_CODE (expr) == SIZEOF_EXPR
2078 && TYPE_P (TREE_OPERAND (expr, 0)))
2080 write_string ("st");
2081 write_type (TREE_OPERAND (expr, 0));
2083 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
2085 tree scope = TREE_OPERAND (expr, 0);
2086 tree member = TREE_OPERAND (expr, 1);
2088 /* If the MEMBER is a real declaration, then the qualifying
2089 scope was not dependent. Ideally, we would not have a
2090 SCOPE_REF in those cases, but sometimes we do. If the second
2091 argument is a DECL, then the name must not have been
2093 if (DECL_P (member))
2094 write_expression (member);
2099 write_string ("sr");
2101 /* If MEMBER is a template-id, separate the template
2102 from the arguments. */
2103 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2105 template_args = TREE_OPERAND (member, 1);
2106 member = TREE_OPERAND (member, 0);
2109 template_args = NULL_TREE;
2110 /* Write out the name of the MEMBER. */
2111 if (IDENTIFIER_TYPENAME_P (member))
2112 write_conversion_operator_name (TREE_TYPE (member));
2113 else if (IDENTIFIER_OPNAME_P (member))
2116 const char *mangled_name = NULL;
2118 /* Unfortunately, there is no easy way to go from the
2119 name of the operator back to the corresponding tree
2121 for (i = 0; i < MAX_TREE_CODES; ++i)
2122 if (operator_name_info[i].identifier == member)
2124 /* The ABI says that we prefer binary operator
2125 names to unary operator names. */
2126 if (operator_name_info[i].arity == 2)
2128 mangled_name = operator_name_info[i].mangled_name;
2131 else if (!mangled_name)
2132 mangled_name = operator_name_info[i].mangled_name;
2134 else if (assignment_operator_name_info[i].identifier
2138 = assignment_operator_name_info[i].mangled_name;
2141 write_string (mangled_name);
2144 write_source_name (member);
2145 /* Write out the template arguments. */
2147 write_template_args (template_args);
2154 /* When we bind a variable or function to a non-type template
2155 argument with reference type, we create an ADDR_EXPR to show
2156 the fact that the entity's address has been taken. But, we
2157 don't actually want to output a mangling code for the `&'. */
2158 if (TREE_CODE (expr) == ADDR_EXPR
2160 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2162 expr = TREE_OPERAND (expr, 0);
2165 write_expression (expr);
2169 code = TREE_CODE (expr);
2172 /* If it wasn't any of those, recursively expand the expression. */
2173 write_string (operator_name_info[(int) code].mangled_name);
2178 sorry ("call_expr cannot be mangled due to a defect in the C++ ABI");
2182 write_type (TREE_TYPE (expr));
2183 /* There is no way to mangle a zero-operand cast like
2185 if (!TREE_OPERAND (expr, 0))
2186 sorry ("zero-operand casts cannot be mangled due to a defect "
2189 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2192 case STATIC_CAST_EXPR:
2193 case CONST_CAST_EXPR:
2194 write_type (TREE_TYPE (expr));
2195 write_expression (TREE_OPERAND (expr, 0));
2199 /* Handle pointers-to-members specially. */
2201 write_type (TREE_OPERAND (expr, 0));
2202 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2203 write_source_name (TREE_OPERAND (expr, 1));
2204 else if (TREE_CODE (TREE_OPERAND (expr, 1)) == TEMPLATE_ID_EXPR)
2209 template_id = TREE_OPERAND (expr, 1);
2210 name = TREE_OPERAND (template_id, 0);
2211 /* FIXME: What about operators? */
2212 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
2213 write_source_name (TREE_OPERAND (template_id, 0));
2214 write_template_args (TREE_OPERAND (template_id, 1));
2218 /* G++ 3.2 incorrectly put out both the "sr" code and
2219 the nested name of the qualified name. */
2220 G.need_abi_warning = 1;
2221 write_encoding (TREE_OPERAND (expr, 1));
2226 for (i = 0; i < TREE_OPERAND_LENGTH (expr); ++i)
2228 tree operand = TREE_OPERAND (expr, i);
2229 /* As a GNU extension, the middle operand of a
2230 conditional may be omitted. Since expression
2231 manglings are supposed to represent the input token
2232 stream, there's no good way to mangle such an
2233 expression without extending the C++ ABI. */
2234 if (code == COND_EXPR && i == 1 && !operand)
2236 error ("omitted middle operand to %<?:%> operand "
2237 "cannot be mangled");
2240 write_expression (operand);
2246 /* Literal subcase of non-terminal <template-arg>.
2248 "Literal arguments, e.g. "A<42L>", are encoded with their type
2249 and value. Negative integer values are preceded with "n"; for
2250 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2251 encoded as 0, true as 1." */
2254 write_template_arg_literal (const tree value)
2257 write_type (TREE_TYPE (value));
2259 switch (TREE_CODE (value))
2262 write_integer_cst (DECL_INITIAL (value));
2266 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
2267 || integer_zerop (value) || integer_onep (value));
2268 write_integer_cst (value);
2272 write_real_cst (value);
2282 /* Non-terminal <template-arg>.
2284 <template-arg> ::= <type> # type
2285 ::= L <type> </value/ number> E # literal
2286 ::= LZ <name> E # external name
2287 ::= X <expression> E # expression */
2290 write_template_arg (tree node)
2292 enum tree_code code = TREE_CODE (node);
2294 MANGLE_TRACE_TREE ("template-arg", node);
2296 /* A template template parameter's argument list contains TREE_LIST
2297 nodes of which the value field is the actual argument. */
2298 if (code == TREE_LIST)
2300 node = TREE_VALUE (node);
2301 /* If it's a decl, deal with its type instead. */
2304 node = TREE_TYPE (node);
2305 code = TREE_CODE (node);
2309 if (TREE_CODE (node) == NOP_EXPR
2310 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
2312 /* Template parameters can be of reference type. To maintain
2313 internal consistency, such arguments use a conversion from
2314 address of object to reference type. */
2315 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
2316 if (abi_version_at_least (2))
2317 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
2319 G.need_abi_warning = 1;
2322 if (ARGUMENT_PACK_P (node))
2324 /* Expand the template argument pack. */
2325 tree args = ARGUMENT_PACK_ARGS (node);
2326 int i, length = TREE_VEC_LENGTH (args);
2327 for (i = 0; i < length; ++i)
2328 write_template_arg (TREE_VEC_ELT (args, i));
2330 else if (TYPE_P (node))
2332 else if (code == TEMPLATE_DECL)
2333 /* A template appearing as a template arg is a template template arg. */
2334 write_template_template_arg (node);
2335 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
2336 || (abi_version_at_least (2) && code == CONST_DECL))
2337 write_template_arg_literal (node);
2338 else if (DECL_P (node))
2340 /* Until ABI version 2, non-type template arguments of
2341 enumeration type were mangled using their names. */
2342 if (code == CONST_DECL && !abi_version_at_least (2))
2343 G.need_abi_warning = 1;
2345 /* Until ABI version 3, the underscore before the mangled name
2346 was incorrectly omitted. */
2347 if (!abi_version_at_least (3))
2349 G.need_abi_warning = 1;
2353 write_string ("_Z");
2354 write_encoding (node);
2359 /* Template arguments may be expressions. */
2361 write_expression (node);
2366 /* <template-template-arg>
2368 ::= <substitution> */
2371 write_template_template_arg (const tree decl)
2373 MANGLE_TRACE_TREE ("template-template-arg", decl);
2375 if (find_substitution (decl))
2377 write_name (decl, /*ignore_local_scope=*/0);
2378 add_substitution (decl);
2382 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2384 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2385 ::= A <expression> _ </element/ type>
2387 "Array types encode the dimension (number of elements) and the
2388 element type. For variable length arrays, the dimension (but not
2389 the '_' separator) is omitted." */
2392 write_array_type (const tree type)
2395 if (TYPE_DOMAIN (type))
2400 index_type = TYPE_DOMAIN (type);
2401 /* The INDEX_TYPE gives the upper and lower bounds of the
2403 max = TYPE_MAX_VALUE (index_type);
2404 if (TREE_CODE (max) == INTEGER_CST)
2406 /* The ABI specifies that we should mangle the number of
2407 elements in the array, not the largest allowed index. */
2408 max = size_binop (PLUS_EXPR, max, size_one_node);
2409 write_unsigned_number (tree_low_cst (max, 1));
2413 max = TREE_OPERAND (max, 0);
2414 if (!abi_version_at_least (2))
2416 /* value_dependent_expression_p presumes nothing is
2417 dependent when PROCESSING_TEMPLATE_DECL is zero. */
2418 ++processing_template_decl;
2419 if (!value_dependent_expression_p (max))
2420 G.need_abi_warning = 1;
2421 --processing_template_decl;
2423 write_expression (max);
2428 write_type (TREE_TYPE (type));
2431 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2432 variables. TYPE is a pointer-to-member POINTER_TYPE.
2434 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2437 write_pointer_to_member_type (const tree type)
2440 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2441 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2444 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2445 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2446 TEMPLATE_PARM_INDEX.
2448 <template-param> ::= T </parameter/ number> _ */
2451 write_template_param (const tree parm)
2455 tree parm_type = NULL_TREE;
2457 MANGLE_TRACE_TREE ("template-parm", parm);
2459 switch (TREE_CODE (parm))
2461 case TEMPLATE_TYPE_PARM:
2462 case TEMPLATE_TEMPLATE_PARM:
2463 case BOUND_TEMPLATE_TEMPLATE_PARM:
2464 parm_index = TEMPLATE_TYPE_IDX (parm);
2465 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2468 case TEMPLATE_PARM_INDEX:
2469 parm_index = TEMPLATE_PARM_IDX (parm);
2470 parm_level = TEMPLATE_PARM_LEVEL (parm);
2471 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2479 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2480 earliest template param denoted by `_'. */
2482 write_unsigned_number (parm_index - 1);
2486 /* <template-template-param>
2487 ::= <template-param>
2488 ::= <substitution> */
2491 write_template_template_param (const tree parm)
2493 tree templ = NULL_TREE;
2495 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2496 template template parameter. The substitution candidate here is
2497 only the template. */
2498 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2501 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2502 if (find_substitution (templ))
2506 /* <template-param> encodes only the template parameter position,
2507 not its template arguments, which is fine here. */
2508 write_template_param (parm);
2510 add_substitution (templ);
2513 /* Non-terminal <substitution>.
2515 <substitution> ::= S <seq-id> _
2519 write_substitution (const int seq_id)
2521 MANGLE_TRACE ("substitution", "");
2525 write_number (seq_id - 1, /*unsigned=*/1, 36);
2529 /* Start mangling ENTITY. */
2532 start_mangling (const tree entity)
2535 G.need_abi_warning = false;
2536 obstack_free (&name_obstack, name_base);
2537 mangle_obstack = &name_obstack;
2538 name_base = obstack_alloc (&name_obstack, 0);
2541 /* Done with mangling. If WARN is true, and the name of G.entity will
2542 be mangled differently in a future version of the ABI, issue a
2546 finish_mangling_internal (const bool warn)
2548 if (warn_abi && warn && G.need_abi_warning)
2549 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
2553 /* Clear all the substitutions. */
2554 VEC_truncate (tree, G.substitutions, 0);
2556 /* Null-terminate the string. */
2561 /* Like finish_mangling_internal, but return the mangled string. */
2563 static inline const char *
2564 finish_mangling (const bool warn)
2566 finish_mangling_internal (warn);
2567 return (const char *) obstack_finish (mangle_obstack);
2570 /* Like finish_mangling_internal, but return an identifier. */
2573 finish_mangling_get_identifier (const bool warn)
2575 finish_mangling_internal (warn);
2576 /* Don't obstack_finish here, and the next start_mangling will
2577 remove the identifier. */
2578 return get_identifier ((const char *) name_base);
2581 /* Initialize data structures for mangling. */
2586 gcc_obstack_init (&name_obstack);
2587 name_base = obstack_alloc (&name_obstack, 0);
2588 G.substitutions = NULL;
2590 /* Cache these identifiers for quick comparison when checking for
2591 standard substitutions. */
2592 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2593 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2594 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2595 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2596 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2597 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2600 /* Generate the mangled name of DECL. */
2603 mangle_decl_string (const tree decl)
2607 start_mangling (decl);
2609 if (TREE_CODE (decl) == TYPE_DECL)
2610 write_type (TREE_TYPE (decl));
2612 write_mangled_name (decl, true);
2614 result = finish_mangling_get_identifier (/*warn=*/true);
2616 fprintf (stderr, "mangle_decl_string = '%s'\n\n",
2617 IDENTIFIER_POINTER (result));
2621 /* Create an identifier for the external mangled name of DECL. */
2624 mangle_decl (const tree decl)
2626 tree id = mangle_decl_string (decl);
2627 id = targetm.mangle_decl_assembler_name (decl, id);
2628 SET_DECL_ASSEMBLER_NAME (decl, id);
2631 /* Generate the mangled representation of TYPE. */
2634 mangle_type_string (const tree type)
2638 start_mangling (type);
2640 result = finish_mangling (/*warn=*/false);
2642 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2646 /* Create an identifier for the mangled name of a special component
2647 for belonging to TYPE. CODE is the ABI-specified code for this
2651 mangle_special_for_type (const tree type, const char *code)
2655 /* We don't have an actual decl here for the special component, so
2656 we can't just process the <encoded-name>. Instead, fake it. */
2657 start_mangling (type);
2659 /* Start the mangling. */
2660 write_string ("_Z");
2661 write_string (code);
2665 result = finish_mangling_get_identifier (/*warn=*/false);
2668 fprintf (stderr, "mangle_special_for_type = %s\n\n",
2669 IDENTIFIER_POINTER (result));
2674 /* Create an identifier for the mangled representation of the typeinfo
2675 structure for TYPE. */
2678 mangle_typeinfo_for_type (const tree type)
2680 return mangle_special_for_type (type, "TI");
2683 /* Create an identifier for the mangled name of the NTBS containing
2684 the mangled name of TYPE. */
2687 mangle_typeinfo_string_for_type (const tree type)
2689 return mangle_special_for_type (type, "TS");
2692 /* Create an identifier for the mangled name of the vtable for TYPE. */
2695 mangle_vtbl_for_type (const tree type)
2697 return mangle_special_for_type (type, "TV");
2700 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2703 mangle_vtt_for_type (const tree type)
2705 return mangle_special_for_type (type, "TT");
2708 /* Return an identifier for a construction vtable group. TYPE is
2709 the most derived class in the hierarchy; BINFO is the base
2710 subobject for which this construction vtable group will be used.
2712 This mangling isn't part of the ABI specification; in the ABI
2713 specification, the vtable group is dumped in the same COMDAT as the
2714 main vtable, and is referenced only from that vtable, so it doesn't
2715 need an external name. For binary formats without COMDAT sections,
2716 though, we need external names for the vtable groups.
2718 We use the production
2720 <special-name> ::= CT <type> <offset number> _ <base type> */
2723 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2727 start_mangling (type);
2729 write_string ("_Z");
2730 write_string ("TC");
2732 write_integer_cst (BINFO_OFFSET (binfo));
2734 write_type (BINFO_TYPE (binfo));
2736 result = finish_mangling_get_identifier (/*warn=*/false);
2738 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n",
2739 IDENTIFIER_POINTER (result));
2743 /* Mangle a this pointer or result pointer adjustment.
2745 <call-offset> ::= h <fixed offset number> _
2746 ::= v <fixed offset number> _ <virtual offset number> _ */
2749 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2751 write_char (virtual_offset ? 'v' : 'h');
2753 /* For either flavor, write the fixed offset. */
2754 write_integer_cst (fixed_offset);
2757 /* For a virtual thunk, add the virtual offset. */
2760 write_integer_cst (virtual_offset);
2765 /* Return an identifier for the mangled name of a this-adjusting or
2766 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2767 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2768 is a virtual thunk, and it is the vtbl offset in
2769 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2770 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2771 thunk itself. A covariant thunk name always includes the adjustment
2772 for the this pointer, even if there is none.
2774 <special-name> ::= T <call-offset> <base encoding>
2775 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2779 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2780 tree virtual_offset)
2784 start_mangling (fn_decl);
2786 write_string ("_Z");
2789 if (!this_adjusting)
2791 /* Covariant thunk with no this adjustment */
2793 mangle_call_offset (integer_zero_node, NULL_TREE);
2794 mangle_call_offset (fixed_offset, virtual_offset);
2796 else if (!DECL_THUNK_P (fn_decl))
2797 /* Plain this adjusting thunk. */
2798 mangle_call_offset (fixed_offset, virtual_offset);
2801 /* This adjusting thunk to covariant thunk. */
2803 mangle_call_offset (fixed_offset, virtual_offset);
2804 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2805 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2807 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2808 mangle_call_offset (fixed_offset, virtual_offset);
2809 fn_decl = THUNK_TARGET (fn_decl);
2813 write_encoding (fn_decl);
2815 result = finish_mangling_get_identifier (/*warn=*/false);
2817 fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result));
2821 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2822 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
2825 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
2827 /* Hash a node (VAL1) in the table. */
2830 hash_type (const void *val)
2832 return (hashval_t) TYPE_UID (TREE_TYPE ((const_tree) val));
2835 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2838 compare_type (const void *val1, const void *val2)
2840 return TREE_TYPE ((const_tree) val1) == (const_tree) val2;
2843 /* Return an identifier for the mangled unqualified name for a
2844 conversion operator to TYPE. This mangling is not specified by the
2845 ABI spec; it is only used internally. */
2848 mangle_conv_op_name_for_type (const tree type)
2853 if (type == error_mark_node)
2854 return error_mark_node;
2856 if (conv_type_names == NULL)
2857 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
2859 slot = htab_find_slot_with_hash (conv_type_names, type,
2860 (hashval_t) TYPE_UID (type), INSERT);
2861 identifier = (tree)*slot;
2866 /* Create a unique name corresponding to TYPE. */
2867 sprintf (buffer, "operator %lu",
2868 (unsigned long) htab_elements (conv_type_names));
2869 identifier = get_identifier (buffer);
2872 /* Hang TYPE off the identifier so it can be found easily later
2873 when performing conversions. */
2874 TREE_TYPE (identifier) = type;
2876 /* Set bits on the identifier so we know later it's a conversion. */
2877 IDENTIFIER_OPNAME_P (identifier) = 1;
2878 IDENTIFIER_TYPENAME_P (identifier) = 1;
2884 /* Return an identifier for the name of an initialization guard
2885 variable for indicated VARIABLE. */
2888 mangle_guard_variable (const tree variable)
2890 start_mangling (variable);
2891 write_string ("_ZGV");
2892 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2893 /* The name of a guard variable for a reference temporary should refer
2894 to the reference, not the temporary. */
2895 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2897 write_name (variable, /*ignore_local_scope=*/0);
2898 return finish_mangling_get_identifier (/*warn=*/false);
2901 /* Return an identifier for the name of a temporary variable used to
2902 initialize a static reference. This isn't part of the ABI, but we might
2903 as well call them something readable. */
2906 mangle_ref_init_variable (const tree variable)
2908 start_mangling (variable);
2909 write_string ("_ZGR");
2910 write_name (variable, /*ignore_local_scope=*/0);
2911 return finish_mangling_get_identifier (/*warn=*/false);
2915 /* Foreign language type mangling section. */
2917 /* How to write the type codes for the integer Java type. */
2920 write_java_integer_type_codes (const tree type)
2922 if (type == java_int_type_node)
2924 else if (type == java_short_type_node)
2926 else if (type == java_byte_type_node)
2928 else if (type == java_char_type_node)
2930 else if (type == java_long_type_node)
2932 else if (type == java_boolean_type_node)
2938 #include "gt-cp-mangle.h"