1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005
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 2, 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 COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This file implements mangling of C++ names according to the IA64
24 C++ ABI specification. A mangled name encodes a function or
25 variable's name, scope, type, and/or template arguments into a text
26 identifier. This identifier is used as the function's or
27 variable's linkage name, to preserve compatibility between C++'s
28 language features (templates, scoping, and overloading) and C
31 Additionally, g++ uses mangled names internally. To support this,
32 mangling of types is allowed, even though the mangled name of a
33 type should not appear by itself as an exported name. Ditto for
34 uninstantiated templates.
36 The primary entry point for this module is mangle_decl, which
37 returns an identifier containing the mangled name for a decl.
38 Additional entry points are provided to build mangled names of
39 particular constructs when the appropriate decl for that construct
40 is not available. These are:
42 mangle_typeinfo_for_type: typeinfo data
43 mangle_typeinfo_string_for_type: typeinfo type name
44 mangle_vtbl_for_type: virtual table data
45 mangle_vtt_for_type: VTT data
46 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
47 mangle_thunk: thunk function or entry */
51 #include "coretypes.h"
63 /* Debugging support. */
65 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
67 #define DEBUG_MANGLE 0
70 /* Macros for tracing the write_* functions. */
72 # define MANGLE_TRACE(FN, INPUT) \
73 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
74 # define MANGLE_TRACE_TREE(FN, NODE) \
75 fprintf (stderr, " %-24s: %-24s (%p)\n", \
76 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
78 # define MANGLE_TRACE(FN, INPUT)
79 # define MANGLE_TRACE_TREE(FN, NODE)
82 /* Nonzero if NODE is a class template-id. We can't rely on
83 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
84 that hard to distinguish A<T> from A, where A<T> is the type as
85 instantiated outside of the template, and A is the type used
86 without parameters inside the template. */
87 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
88 (TYPE_LANG_SPECIFIC (NODE) != NULL \
89 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
90 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
91 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
93 /* Things we only need one of. This module is not reentrant. */
94 typedef struct globals GTY(())
96 /* An array of the current substitution candidates, in the order
98 VEC(tree,gc) *substitutions;
100 /* The entity that is being mangled. */
101 tree GTY ((skip)) entity;
103 /* True if the mangling will be different in a future version of the
105 bool need_abi_warning;
108 static GTY (()) globals G;
110 /* The obstack on which we build mangled names. */
111 static struct obstack *mangle_obstack;
113 /* The obstack on which we build mangled names that are not going to
114 be IDENTIFIER_NODEs. */
115 static struct obstack name_obstack;
117 /* The first object on the name_obstack; we use this to free memory
118 allocated on the name_obstack. */
119 static void *name_base;
121 /* An incomplete mangled name. There will be no NUL terminator. If
122 there is no incomplete mangled name, this variable is NULL. */
123 static char *partially_mangled_name;
125 /* The number of characters in the PARTIALLY_MANGLED_NAME. */
126 static size_t partially_mangled_name_len;
128 /* Indices into subst_identifiers. These are identifiers used in
129 special substitution rules. */
137 SUBID_BASIC_IOSTREAM,
140 substitution_identifier_index_t;
142 /* For quick substitution checks, look up these common identifiers
144 static GTY(()) tree subst_identifiers[SUBID_MAX];
146 /* Single-letter codes for builtin integer types, defined in
147 <builtin-type>. These are indexed by integer_type_kind values. */
149 integer_type_codes[itk_none] =
152 'a', /* itk_signed_char */
153 'h', /* itk_unsigned_char */
155 't', /* itk_unsigned_short */
157 'j', /* itk_unsigned_int */
159 'm', /* itk_unsigned_long */
160 'x', /* itk_long_long */
161 'y' /* itk_unsigned_long_long */
164 static int decl_is_template_id (const tree, tree* const);
166 /* Functions for handling substitutions. */
168 static inline tree canonicalize_for_substitution (tree);
169 static void add_substitution (tree);
170 static inline int is_std_substitution (const tree,
171 const substitution_identifier_index_t);
172 static inline int is_std_substitution_char (const tree,
173 const substitution_identifier_index_t);
174 static int find_substitution (tree);
175 static void mangle_call_offset (const tree, const tree);
177 /* Functions for emitting mangled representations of things. */
179 static void write_mangled_name (const tree, bool);
180 static void write_encoding (const tree);
181 static void write_name (tree, const int);
182 static void write_unscoped_name (const tree);
183 static void write_unscoped_template_name (const tree);
184 static void write_nested_name (const tree);
185 static void write_prefix (const tree);
186 static void write_template_prefix (const tree);
187 static void write_unqualified_name (const tree);
188 static void write_conversion_operator_name (const tree);
189 static void write_source_name (tree);
190 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
192 static void write_number (unsigned HOST_WIDE_INT, const int,
194 static void write_integer_cst (const tree);
195 static void write_real_cst (const tree);
196 static void write_identifier (const char *);
197 static void write_special_name_constructor (const tree);
198 static void write_special_name_destructor (const tree);
199 static void write_type (tree);
200 static int write_CV_qualifiers_for_type (const tree);
201 static void write_builtin_type (tree);
202 static void write_function_type (const tree);
203 static void write_bare_function_type (const tree, const int, const tree);
204 static void write_method_parms (tree, const int, const tree);
205 static void write_class_enum_type (const tree);
206 static void write_template_args (tree);
207 static void write_expression (tree);
208 static void write_template_arg_literal (const tree);
209 static void write_template_arg (tree);
210 static void write_template_template_arg (const tree);
211 static void write_array_type (const tree);
212 static void write_pointer_to_member_type (const tree);
213 static void write_template_param (const tree);
214 static void write_template_template_param (const tree);
215 static void write_substitution (const int);
216 static int discriminator_for_local_entity (tree);
217 static int discriminator_for_string_literal (tree, tree);
218 static void write_discriminator (const int);
219 static void write_local_name (const tree, const tree, const tree);
220 static void dump_substitution_candidates (void);
221 static const char *mangle_decl_string (const tree);
223 /* Control functions. */
225 static inline void start_mangling (const tree, bool);
226 static inline const char *finish_mangling (const bool);
227 static tree mangle_special_for_type (const tree, const char *);
229 /* Foreign language functions. */
231 static void write_java_integer_type_codes (const tree);
233 /* Append a single character to the end of the mangled
235 #define write_char(CHAR) \
236 obstack_1grow (mangle_obstack, (CHAR))
238 /* Append a sized buffer to the end of the mangled representation. */
239 #define write_chars(CHAR, LEN) \
240 obstack_grow (mangle_obstack, (CHAR), (LEN))
242 /* Append a NUL-terminated string to the end of the mangled
244 #define write_string(STRING) \
245 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
247 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
248 same purpose (context, which may be a type) and value (template
249 decl). See write_template_prefix for more information on what this
251 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
252 (TREE_CODE (NODE1) == TREE_LIST \
253 && TREE_CODE (NODE2) == TREE_LIST \
254 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
255 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
256 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
257 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
259 /* Write out an unsigned quantity in base 10. */
260 #define write_unsigned_number(NUMBER) \
261 write_number ((NUMBER), /*unsigned_p=*/1, 10)
263 /* Save the current (incomplete) mangled name and release the obstack
264 storage holding it. This function should be used during mangling
265 when making a call that could result in a call to get_identifier,
266 as such a call will clobber the same obstack being used for
267 mangling. This function may not be called twice without an
268 intervening call to restore_partially_mangled_name. */
271 save_partially_mangled_name (void)
273 if (mangle_obstack == &ident_hash->stack)
275 gcc_assert (!partially_mangled_name);
276 partially_mangled_name_len = obstack_object_size (mangle_obstack);
277 partially_mangled_name = XNEWVEC (char, partially_mangled_name_len);
278 memcpy (partially_mangled_name, obstack_base (mangle_obstack),
279 partially_mangled_name_len);
280 obstack_free (mangle_obstack, obstack_finish (mangle_obstack));
284 /* Restore the incomplete mangled name saved with
285 save_partially_mangled_name. */
288 restore_partially_mangled_name (void)
290 if (partially_mangled_name)
292 obstack_grow (mangle_obstack, partially_mangled_name,
293 partially_mangled_name_len);
294 free (partially_mangled_name);
295 partially_mangled_name = NULL;
299 /* If DECL is a template instance, return nonzero and, if
300 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
301 Otherwise return zero. */
304 decl_is_template_id (const tree decl, tree* const template_info)
306 if (TREE_CODE (decl) == TYPE_DECL)
308 /* TYPE_DECLs are handled specially. Look at its type to decide
309 if this is a template instantiation. */
310 const tree type = TREE_TYPE (decl);
312 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
314 if (template_info != NULL)
315 /* For a templated TYPE_DECL, the template info is hanging
317 *template_info = TYPE_TEMPLATE_INFO (type);
323 /* Check if this is a primary template. */
324 if (DECL_LANG_SPECIFIC (decl) != NULL
325 && DECL_USE_TEMPLATE (decl)
326 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
327 && TREE_CODE (decl) != TEMPLATE_DECL)
329 if (template_info != NULL)
330 /* For most templated decls, the template info is hanging
332 *template_info = DECL_TEMPLATE_INFO (decl);
337 /* It's not a template id. */
341 /* Produce debugging output of current substitution candidates. */
344 dump_substitution_candidates (void)
349 fprintf (stderr, " ++ substitutions ");
350 for (i = 0; VEC_iterate (tree, G.substitutions, i, el); ++i)
352 const char *name = "???";
355 fprintf (stderr, " ");
357 name = IDENTIFIER_POINTER (DECL_NAME (el));
358 else if (TREE_CODE (el) == TREE_LIST)
359 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
360 else if (TYPE_NAME (el))
361 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
362 fprintf (stderr, " S%d_ = ", i - 1);
364 (CP_TYPE_RESTRICT_P (el)
365 || CP_TYPE_VOLATILE_P (el)
366 || CP_TYPE_CONST_P (el)))
367 fprintf (stderr, "CV-");
368 fprintf (stderr, "%s (%s at %p)\n",
369 name, tree_code_name[TREE_CODE (el)], (void *) el);
373 /* Both decls and types can be substitution candidates, but sometimes
374 they refer to the same thing. For instance, a TYPE_DECL and
375 RECORD_TYPE for the same class refer to the same thing, and should
376 be treated accordingly in substitutions. This function returns a
377 canonicalized tree node representing NODE that is used when adding
378 and substitution candidates and finding matches. */
381 canonicalize_for_substitution (tree node)
383 /* For a TYPE_DECL, use the type instead. */
384 if (TREE_CODE (node) == TYPE_DECL)
385 node = TREE_TYPE (node);
387 node = canonical_type_variant (node);
392 /* Add NODE as a substitution candidate. NODE must not already be on
393 the list of candidates. */
396 add_substitution (tree node)
401 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
402 tree_code_name[TREE_CODE (node)], (void *) node);
404 /* Get the canonicalized substitution candidate for NODE. */
405 c = canonicalize_for_substitution (node);
406 if (DEBUG_MANGLE && c != node)
407 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
408 tree_code_name[TREE_CODE (node)], (void *) node);
412 /* Make sure NODE isn't already a candidate. */
417 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++)
419 gcc_assert (!(DECL_P (node) && node == candidate));
420 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
421 && same_type_p (node, candidate)));
424 #endif /* ENABLE_CHECKING */
426 /* Put the decl onto the varray of substitution candidates. */
427 VEC_safe_push (tree, gc, G.substitutions, node);
430 dump_substitution_candidates ();
433 /* Helper function for find_substitution. Returns nonzero if NODE,
434 which may be a decl or a CLASS_TYPE, is a template-id with template
435 name of substitution_index[INDEX] in the ::std namespace. */
438 is_std_substitution (const tree node,
439 const substitution_identifier_index_t index)
446 type = TREE_TYPE (node);
449 else if (CLASS_TYPE_P (node))
452 decl = TYPE_NAME (node);
455 /* These are not the droids you're looking for. */
458 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
459 && TYPE_LANG_SPECIFIC (type)
460 && TYPE_TEMPLATE_INFO (type)
461 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
462 == subst_identifiers[index]));
465 /* Helper function for find_substitution. Returns nonzero if NODE,
466 which may be a decl or a CLASS_TYPE, is the template-id
467 ::std::identifier<char>, where identifier is
468 substitution_index[INDEX]. */
471 is_std_substitution_char (const tree node,
472 const substitution_identifier_index_t index)
475 /* Check NODE's name is ::std::identifier. */
476 if (!is_std_substitution (node, index))
478 /* Figure out its template args. */
480 args = DECL_TI_ARGS (node);
481 else if (CLASS_TYPE_P (node))
482 args = CLASSTYPE_TI_ARGS (node);
484 /* Oops, not a template. */
486 /* NODE's template arg list should be <char>. */
488 TREE_VEC_LENGTH (args) == 1
489 && TREE_VEC_ELT (args, 0) == char_type_node;
492 /* Check whether a substitution should be used to represent NODE in
495 First, check standard special-case substitutions.
497 <substitution> ::= St
504 # ::std::basic_string
507 # ::std::basic_string<char,
508 ::std::char_traits<char>,
509 ::std::allocator<char> >
512 # ::std::basic_istream<char, ::std::char_traits<char> >
515 # ::std::basic_ostream<char, ::std::char_traits<char> >
518 # ::std::basic_iostream<char, ::std::char_traits<char> >
520 Then examine the stack of currently available substitution
521 candidates for entities appearing earlier in the same mangling
523 If a substitution is found, write its mangled representation and
524 return nonzero. If none is found, just return zero. */
527 find_substitution (tree node)
530 const int size = VEC_length (tree, G.substitutions);
535 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
536 tree_code_name[TREE_CODE (node)], (void *) node);
538 /* Obtain the canonicalized substitution representation for NODE.
539 This is what we'll compare against. */
540 node = canonicalize_for_substitution (node);
542 /* Check for builtin substitutions. */
544 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
545 type = TYPE_P (node) ? node : TREE_TYPE (node);
547 /* Check for std::allocator. */
549 && is_std_substitution (decl, SUBID_ALLOCATOR)
550 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
556 /* Check for std::basic_string. */
557 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
561 /* If this is a type (i.e. a fully-qualified template-id),
563 std::basic_string <char,
564 std::char_traits<char>,
565 std::allocator<char> > . */
566 if (cp_type_quals (type) == TYPE_UNQUALIFIED
567 && CLASSTYPE_USE_TEMPLATE (type))
569 tree args = CLASSTYPE_TI_ARGS (type);
570 if (TREE_VEC_LENGTH (args) == 3
571 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
572 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
574 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
583 /* Substitute for the template name only if this isn't a type. */
590 /* Check for basic_{i,o,io}stream. */
592 && cp_type_quals (type) == TYPE_UNQUALIFIED
593 && CLASS_TYPE_P (type)
594 && CLASSTYPE_USE_TEMPLATE (type)
595 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
597 /* First, check for the template
598 args <char, std::char_traits<char> > . */
599 tree args = CLASSTYPE_TI_ARGS (type);
600 if (TREE_VEC_LENGTH (args) == 2
601 && TYPE_P (TREE_VEC_ELT (args, 0))
602 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
603 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
606 /* Got them. Is this basic_istream? */
607 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
612 /* Or basic_ostream? */
613 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
618 /* Or basic_iostream? */
619 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
627 /* Check for namespace std. */
628 if (decl && DECL_NAMESPACE_STD_P (decl))
634 /* Now check the list of available substitutions for this mangling
636 for (i = 0; i < size; ++i)
638 tree candidate = VEC_index (tree, G.substitutions, i);
639 /* NODE is a matched to a candidate if it's the same decl node or
640 if it's the same type. */
641 if (decl == candidate
642 || (TYPE_P (candidate) && type && TYPE_P (type)
643 && same_type_p (type, candidate))
644 || NESTED_TEMPLATE_MATCH (node, candidate))
646 write_substitution (i);
651 /* No substitution found. */
656 /* TOP_LEVEL is true, if this is being called at outermost level of
657 mangling. It should be false when mangling a decl appearing in an
658 expression within some other mangling.
660 <mangled-name> ::= _Z <encoding> */
663 write_mangled_name (const tree decl, bool top_level)
665 MANGLE_TRACE_TREE ("mangled-name", decl);
667 if (/* The names of `extern "C"' functions are not mangled. */
668 DECL_EXTERN_C_FUNCTION_P (decl)
669 /* But overloaded operator names *are* mangled. */
670 && !DECL_OVERLOADED_OPERATOR_P (decl))
675 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
678 /* The standard notes: "The <encoding> of an extern "C"
679 function is treated like global-scope data, i.e. as its
680 <source-name> without a type." We cannot write
681 overloaded operators that way though, because it contains
682 characters invalid in assembler. */
683 if (abi_version_at_least (2))
686 G.need_abi_warning = true;
687 write_source_name (DECL_NAME (decl));
690 else if (TREE_CODE (decl) == VAR_DECL
691 /* The names of global variables aren't mangled. */
692 && (CP_DECL_CONTEXT (decl) == global_namespace
693 /* And neither are `extern "C"' variables. */
694 || DECL_EXTERN_C_P (decl)))
696 if (top_level || abi_version_at_least (2))
700 G.need_abi_warning = true;
708 write_encoding (decl);
709 if (DECL_LANG_SPECIFIC (decl)
710 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
711 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
712 /* We need a distinct mangled name for these entities, but
713 we should never actually output it. So, we append some
714 characters the assembler won't like. */
715 write_string (" *INTERNAL* ");
719 /* <encoding> ::= <function name> <bare-function-type>
723 write_encoding (const tree decl)
725 MANGLE_TRACE_TREE ("encoding", decl);
727 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
729 /* For overloaded operators write just the mangled name
730 without arguments. */
731 if (DECL_OVERLOADED_OPERATOR_P (decl))
732 write_name (decl, /*ignore_local_scope=*/0);
734 write_source_name (DECL_NAME (decl));
738 write_name (decl, /*ignore_local_scope=*/0);
739 if (TREE_CODE (decl) == FUNCTION_DECL)
744 if (decl_is_template_id (decl, NULL))
746 save_partially_mangled_name ();
747 fn_type = get_mostly_instantiated_function_type (decl);
748 restore_partially_mangled_name ();
749 /* FN_TYPE will not have parameter types for in-charge or
750 VTT parameters. Therefore, we pass NULL_TREE to
751 write_bare_function_type -- otherwise, it will get
752 confused about which artificial parameters to skip. */
757 fn_type = TREE_TYPE (decl);
761 write_bare_function_type (fn_type,
762 (!DECL_CONSTRUCTOR_P (decl)
763 && !DECL_DESTRUCTOR_P (decl)
764 && !DECL_CONV_FN_P (decl)
765 && decl_is_template_id (decl, NULL)),
770 /* <name> ::= <unscoped-name>
771 ::= <unscoped-template-name> <template-args>
775 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
776 called from <local-name>, which mangles the enclosing scope
777 elsewhere and then uses this function to mangle just the part
778 underneath the function scope. So don't use the <local-name>
779 production, to avoid an infinite recursion. */
782 write_name (tree decl, const int ignore_local_scope)
786 MANGLE_TRACE_TREE ("name", decl);
788 if (TREE_CODE (decl) == TYPE_DECL)
790 /* In case this is a typedef, fish out the corresponding
791 TYPE_DECL for the main variant. */
792 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
793 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
796 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
798 /* A decl in :: or ::std scope is treated specially. The former is
799 mangled using <unscoped-name> or <unscoped-template-name>, the
800 latter with a special substitution. Also, a name that is
801 directly in a local function scope is also mangled with
802 <unscoped-name> rather than a full <nested-name>. */
804 || context == global_namespace
805 || DECL_NAMESPACE_STD_P (context)
806 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
809 /* Is this a template instance? */
810 if (decl_is_template_id (decl, &template_info))
812 /* Yes: use <unscoped-template-name>. */
813 write_unscoped_template_name (TI_TEMPLATE (template_info));
814 write_template_args (TI_ARGS (template_info));
817 /* Everything else gets an <unqualified-name>. */
818 write_unscoped_name (decl);
822 /* Handle local names, unless we asked not to (that is, invoked
823 under <local-name>, to handle only the part of the name under
825 if (!ignore_local_scope)
827 /* Scan up the list of scope context, looking for a
828 function. If we find one, this entity is in local
829 function scope. local_entity tracks context one scope
830 level down, so it will contain the element that's
831 directly in that function's scope, either decl or one of
832 its enclosing scopes. */
833 tree local_entity = decl;
834 while (context != NULL && context != global_namespace)
836 /* Make sure we're always dealing with decls. */
837 if (context != NULL && TYPE_P (context))
838 context = TYPE_NAME (context);
839 /* Is this a function? */
840 if (TREE_CODE (context) == FUNCTION_DECL)
842 /* Yes, we have local scope. Use the <local-name>
843 production for the innermost function scope. */
844 write_local_name (context, local_entity, decl);
847 /* Up one scope level. */
848 local_entity = context;
849 context = CP_DECL_CONTEXT (context);
852 /* No local scope found? Fall through to <nested-name>. */
855 /* Other decls get a <nested-name> to encode their scope. */
856 write_nested_name (decl);
860 /* <unscoped-name> ::= <unqualified-name>
861 ::= St <unqualified-name> # ::std:: */
864 write_unscoped_name (const tree decl)
866 tree context = CP_DECL_CONTEXT (decl);
868 MANGLE_TRACE_TREE ("unscoped-name", decl);
870 /* Is DECL in ::std? */
871 if (DECL_NAMESPACE_STD_P (context))
874 write_unqualified_name (decl);
878 /* If not, it should be either in the global namespace, or directly
879 in a local function scope. */
880 gcc_assert (context == global_namespace
882 || TREE_CODE (context) == FUNCTION_DECL);
884 write_unqualified_name (decl);
888 /* <unscoped-template-name> ::= <unscoped-name>
889 ::= <substitution> */
892 write_unscoped_template_name (const tree decl)
894 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
896 if (find_substitution (decl))
898 write_unscoped_name (decl);
899 add_substitution (decl);
902 /* Write the nested name, including CV-qualifiers, of DECL.
904 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
905 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
907 <CV-qualifiers> ::= [r] [V] [K] */
910 write_nested_name (const tree decl)
914 MANGLE_TRACE_TREE ("nested-name", decl);
918 /* Write CV-qualifiers, if this is a member function. */
919 if (TREE_CODE (decl) == FUNCTION_DECL
920 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
922 if (DECL_VOLATILE_MEMFUNC_P (decl))
924 if (DECL_CONST_MEMFUNC_P (decl))
928 /* Is this a template instance? */
929 if (decl_is_template_id (decl, &template_info))
931 /* Yes, use <template-prefix>. */
932 write_template_prefix (decl);
933 write_template_args (TI_ARGS (template_info));
937 /* No, just use <prefix> */
938 write_prefix (DECL_CONTEXT (decl));
939 write_unqualified_name (decl);
944 /* <prefix> ::= <prefix> <unqualified-name>
946 ::= <template-prefix> <template-args>
948 ::= <substitution> */
951 write_prefix (const tree node)
954 /* Non-NULL if NODE represents a template-id. */
955 tree template_info = NULL;
957 MANGLE_TRACE_TREE ("prefix", node);
960 || node == global_namespace)
963 if (find_substitution (node))
968 /* If this is a function decl, that means we've hit function
969 scope, so this prefix must be for a local name. In this
970 case, we're under the <local-name> production, which encodes
971 the enclosing function scope elsewhere. So don't continue
973 if (TREE_CODE (node) == FUNCTION_DECL)
977 decl_is_template_id (decl, &template_info);
981 /* Node is a type. */
982 decl = TYPE_NAME (node);
983 if (CLASSTYPE_TEMPLATE_ID_P (node))
984 template_info = TYPE_TEMPLATE_INFO (node);
987 /* In G++ 3.2, the name of the template parameter was used. */
988 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
989 && !abi_version_at_least (2))
990 G.need_abi_warning = true;
992 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
993 && abi_version_at_least (2))
994 write_template_param (node);
995 else if (template_info != NULL)
998 write_template_prefix (decl);
999 write_template_args (TI_ARGS (template_info));
1002 /* Not templated. */
1004 write_prefix (CP_DECL_CONTEXT (decl));
1005 write_unqualified_name (decl);
1008 add_substitution (node);
1011 /* <template-prefix> ::= <prefix> <template component>
1012 ::= <template-param>
1013 ::= <substitution> */
1016 write_template_prefix (const tree node)
1018 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1019 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1020 tree context = CP_DECL_CONTEXT (decl);
1025 MANGLE_TRACE_TREE ("template-prefix", node);
1027 /* Find the template decl. */
1028 if (decl_is_template_id (decl, &template_info))
1029 template = TI_TEMPLATE (template_info);
1032 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
1034 template = TYPE_TI_TEMPLATE (type);
1037 /* For a member template, though, the template name for the
1038 innermost name must have all the outer template levels
1039 instantiated. For instance, consider
1041 template<typename T> struct Outer {
1042 template<typename U> struct Inner {};
1045 The template name for `Inner' in `Outer<int>::Inner<float>' is
1046 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1047 levels separately, so there's no TEMPLATE_DECL available for this
1048 (there's only `Outer<T>::Inner<U>').
1050 In order to get the substitutions right, we create a special
1051 TREE_LIST to represent the substitution candidate for a nested
1052 template. The TREE_PURPOSE is the template's context, fully
1053 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1056 So, for the example above, `Outer<int>::Inner' is represented as a
1057 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1058 and whose value is `Outer<T>::Inner<U>'. */
1059 if (TYPE_P (context))
1060 substitution = build_tree_list (context, template);
1062 substitution = template;
1064 if (find_substitution (substitution))
1067 /* In G++ 3.2, the name of the template template parameter was used. */
1068 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
1069 && !abi_version_at_least (2))
1070 G.need_abi_warning = true;
1072 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
1073 && abi_version_at_least (2))
1074 write_template_param (TREE_TYPE (template));
1077 write_prefix (context);
1078 write_unqualified_name (decl);
1081 add_substitution (substitution);
1084 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1085 mangled through special entry points.
1087 <unqualified-name> ::= <operator-name>
1089 ::= <source-name> */
1092 write_unqualified_name (const tree decl)
1094 MANGLE_TRACE_TREE ("unqualified-name", decl);
1096 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
1097 write_special_name_constructor (decl);
1098 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
1099 write_special_name_destructor (decl);
1100 else if (DECL_NAME (decl) == NULL_TREE)
1101 write_source_name (DECL_ASSEMBLER_NAME (decl));
1102 else if (DECL_CONV_FN_P (decl))
1104 /* Conversion operator. Handle it right here.
1105 <operator> ::= cv <type> */
1107 if (decl_is_template_id (decl, NULL))
1110 save_partially_mangled_name ();
1111 fn_type = get_mostly_instantiated_function_type (decl);
1112 restore_partially_mangled_name ();
1113 type = TREE_TYPE (fn_type);
1116 type = DECL_CONV_FN_TYPE (decl);
1117 write_conversion_operator_name (type);
1119 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1121 operator_name_info_t *oni;
1122 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1123 oni = assignment_operator_name_info;
1125 oni = operator_name_info;
1127 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1130 write_source_name (DECL_NAME (decl));
1133 /* Write the unqualified-name for a conversion operator to TYPE. */
1136 write_conversion_operator_name (const tree type)
1138 write_string ("cv");
1142 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1144 <source-name> ::= </length/ number> <identifier> */
1147 write_source_name (tree identifier)
1149 MANGLE_TRACE_TREE ("source-name", identifier);
1151 /* Never write the whole template-id name including the template
1152 arguments; we only want the template name. */
1153 if (IDENTIFIER_TEMPLATE (identifier))
1154 identifier = IDENTIFIER_TEMPLATE (identifier);
1156 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1157 write_identifier (IDENTIFIER_POINTER (identifier));
1160 /* Convert NUMBER to ascii using base BASE and generating at least
1161 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1162 into which to store the characters. Returns the number of
1163 characters generated (these will be layed out in advance of where
1167 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1168 char *buffer, const unsigned int min_digits)
1170 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1171 unsigned digits = 0;
1175 unsigned HOST_WIDE_INT d = number / base;
1177 *--buffer = base_digits[number - d * base];
1181 while (digits < min_digits)
1183 *--buffer = base_digits[0];
1189 /* Non-terminal <number>.
1191 <number> ::= [n] </decimal integer/> */
1194 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1195 const unsigned int base)
1197 char buffer[sizeof (HOST_WIDE_INT) * 8];
1200 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1203 number = -((HOST_WIDE_INT) number);
1205 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1206 write_chars (buffer + sizeof (buffer) - count, count);
1209 /* Write out an integral CST in decimal. Most numbers are small, and
1210 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1211 bigger than that, which we must deal with. */
1214 write_integer_cst (const tree cst)
1216 int sign = tree_int_cst_sgn (cst);
1218 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1220 /* A bignum. We do this in chunks, each of which fits in a
1222 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1223 unsigned HOST_WIDE_INT chunk;
1224 unsigned chunk_digits;
1225 char *ptr = buffer + sizeof (buffer);
1230 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1235 if (sizeof (HOST_WIDE_INT) >= 8)
1237 /* It is at least 64 bits, so 10^18 is representable. */
1242 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1243 base = build_int_cstu (type, chunk);
1244 n = build_int_cst_wide (type,
1245 TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1250 n = fold_build1 (NEGATE_EXPR, type, n);
1254 tree d = fold_build2 (FLOOR_DIV_EXPR, type, n, base);
1255 tree tmp = fold_build2 (MULT_EXPR, type, d, base);
1258 done = integer_zerop (d);
1259 tmp = fold_build2 (MINUS_EXPR, type, n, tmp);
1260 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1261 done ? 1 : chunk_digits);
1267 write_chars (ptr, count);
1272 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1279 write_unsigned_number (low);
1283 /* Write out a floating-point literal.
1285 "Floating-point literals are encoded using the bit pattern of the
1286 target processor's internal representation of that number, as a
1287 fixed-length lowercase hexadecimal string, high-order bytes first
1288 (even if the target processor would store low-order bytes first).
1289 The "n" prefix is not used for floating-point literals; the sign
1290 bit is encoded with the rest of the number.
1292 Here are some examples, assuming the IEEE standard representation
1293 for floating point numbers. (Spaces are for readability, not
1294 part of the encoding.)
1297 -1.0f Lf bf80 0000 E
1298 1.17549435e-38f Lf 0080 0000 E
1299 1.40129846e-45f Lf 0000 0001 E
1300 0.0f Lf 0000 0000 E"
1302 Caller is responsible for the Lx and the E. */
1304 write_real_cst (const tree value)
1306 if (abi_version_at_least (2))
1308 long target_real[4]; /* largest supported float */
1309 char buffer[9]; /* eight hex digits in a 32-bit number */
1312 tree type = TREE_TYPE (value);
1313 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1315 real_to_target (target_real, &TREE_REAL_CST (value),
1318 /* The value in target_real is in the target word order,
1319 so we must write it out backward if that happens to be
1320 little-endian. write_number cannot be used, it will
1321 produce uppercase. */
1322 if (FLOAT_WORDS_BIG_ENDIAN)
1323 i = 0, limit = words, dir = 1;
1325 i = words - 1, limit = -1, dir = -1;
1327 for (; i != limit; i += dir)
1329 sprintf (buffer, "%08lx", target_real[i]);
1330 write_chars (buffer, 8);
1335 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1336 literally. Note that compatibility with 3.2 is impossible,
1337 because the old floating-point emulator used a different
1338 format for REAL_VALUE_TYPE. */
1340 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1341 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1344 G.need_abi_warning = 1;
1348 /* Non-terminal <identifier>.
1350 <identifier> ::= </unqualified source code identifier> */
1353 write_identifier (const char *identifier)
1355 MANGLE_TRACE ("identifier", identifier);
1356 write_string (identifier);
1359 /* Handle constructor productions of non-terminal <special-name>.
1360 CTOR is a constructor FUNCTION_DECL.
1362 <special-name> ::= C1 # complete object constructor
1363 ::= C2 # base object constructor
1364 ::= C3 # complete object allocating constructor
1366 Currently, allocating constructors are never used.
1368 We also need to provide mangled names for the maybe-in-charge
1369 constructor, so we treat it here too. mangle_decl_string will
1370 append *INTERNAL* to that, to make sure we never emit it. */
1373 write_special_name_constructor (const tree ctor)
1375 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1376 write_string ("C2");
1379 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1380 /* Even though we don't ever emit a definition of
1381 the old-style destructor, we still have to
1382 consider entities (like static variables) nested
1384 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor));
1385 write_string ("C1");
1389 /* Handle destructor productions of non-terminal <special-name>.
1390 DTOR is a destructor FUNCTION_DECL.
1392 <special-name> ::= D0 # deleting (in-charge) destructor
1393 ::= D1 # complete object (in-charge) destructor
1394 ::= D2 # base object (not-in-charge) destructor
1396 We also need to provide mangled names for the maybe-incharge
1397 destructor, so we treat it here too. mangle_decl_string will
1398 append *INTERNAL* to that, to make sure we never emit it. */
1401 write_special_name_destructor (const tree dtor)
1403 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1404 write_string ("D0");
1405 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1406 write_string ("D2");
1409 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1410 /* Even though we don't ever emit a definition of
1411 the old-style destructor, we still have to
1412 consider entities (like static variables) nested
1414 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor));
1415 write_string ("D1");
1419 /* Return the discriminator for ENTITY appearing inside
1420 FUNCTION. The discriminator is the lexical ordinal of VAR among
1421 entities with the same name in the same FUNCTION. */
1424 discriminator_for_local_entity (tree entity)
1426 /* Assume this is the only local entity with this name. */
1427 int discriminator = 0;
1429 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1430 discriminator = DECL_DISCRIMINATOR (entity);
1431 else if (TREE_CODE (entity) == TYPE_DECL)
1435 /* Scan the list of local classes. */
1436 entity = TREE_TYPE (entity);
1437 for (ix = 0; ; ix++)
1439 tree type = VEC_index (tree, local_classes, ix);
1442 if (TYPE_IDENTIFIER (type) == TYPE_IDENTIFIER (entity)
1443 && TYPE_CONTEXT (type) == TYPE_CONTEXT (entity))
1448 return discriminator;
1451 /* Return the discriminator for STRING, a string literal used inside
1452 FUNCTION. The discriminator is the lexical ordinal of STRING among
1453 string literals used in FUNCTION. */
1456 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1457 tree string ATTRIBUTE_UNUSED)
1459 /* For now, we don't discriminate amongst string literals. */
1463 /* <discriminator> := _ <number>
1465 The discriminator is used only for the second and later occurrences
1466 of the same name within a single function. In this case <number> is
1467 n - 2, if this is the nth occurrence, in lexical order. */
1470 write_discriminator (const int discriminator)
1472 /* If discriminator is zero, don't write anything. Otherwise... */
1473 if (discriminator > 0)
1476 write_unsigned_number (discriminator - 1);
1480 /* Mangle the name of a function-scope entity. FUNCTION is the
1481 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1482 the entity itself. LOCAL_ENTITY is the entity that's directly
1483 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1486 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1487 := Z <function encoding> E s [<discriminator>] */
1490 write_local_name (const tree function, const tree local_entity,
1493 MANGLE_TRACE_TREE ("local-name", entity);
1496 write_encoding (function);
1498 if (TREE_CODE (entity) == STRING_CST)
1501 write_discriminator (discriminator_for_string_literal (function,
1506 /* Now the <entity name>. Let write_name know its being called
1507 from <local-name>, so it doesn't try to process the enclosing
1508 function scope again. */
1509 write_name (entity, /*ignore_local_scope=*/1);
1510 write_discriminator (discriminator_for_local_entity (local_entity));
1514 /* Non-terminals <type> and <CV-qualifier>.
1516 <type> ::= <builtin-type>
1518 ::= <class-enum-type>
1520 ::= <pointer-to-member-type>
1521 ::= <template-param>
1524 ::= P <type> # pointer-to
1525 ::= R <type> # reference-to
1526 ::= C <type> # complex pair (C 2000)
1527 ::= G <type> # imaginary (C 2000) [not supported]
1528 ::= U <source-name> <type> # vendor extended type qualifier
1530 TYPE is a type node. */
1533 write_type (tree type)
1535 /* This gets set to nonzero if TYPE turns out to be a (possibly
1536 CV-qualified) builtin type. */
1537 int is_builtin_type = 0;
1539 MANGLE_TRACE_TREE ("type", type);
1541 if (type == error_mark_node)
1544 if (find_substitution (type))
1547 if (write_CV_qualifiers_for_type (type) > 0)
1548 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1549 mangle the unqualified type. The recursive call is needed here
1550 since both the qualified and unqualified types are substitution
1552 write_type (TYPE_MAIN_VARIANT (type));
1553 else if (TREE_CODE (type) == ARRAY_TYPE)
1554 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1555 so that the cv-qualification of the element type is available
1556 in write_array_type. */
1557 write_array_type (type);
1560 /* See through any typedefs. */
1561 type = TYPE_MAIN_VARIANT (type);
1563 if (TYPE_PTRMEM_P (type))
1564 write_pointer_to_member_type (type);
1565 else switch (TREE_CODE (type))
1569 case INTEGER_TYPE: /* Includes wchar_t. */
1572 /* Handle any target-specific fundamental types. */
1573 const char *target_mangling
1574 = targetm.mangle_fundamental_type (type);
1576 if (target_mangling)
1578 write_string (target_mangling);
1582 /* If this is a typedef, TYPE may not be one of
1583 the standard builtin type nodes, but an alias of one. Use
1584 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1585 write_builtin_type (TYPE_MAIN_VARIANT (type));
1592 write_type (TREE_TYPE (type));
1597 write_function_type (type);
1603 /* A pointer-to-member function is represented as a special
1604 RECORD_TYPE, so check for this first. */
1605 if (TYPE_PTRMEMFUNC_P (type))
1606 write_pointer_to_member_type (type);
1608 write_class_enum_type (type);
1612 case UNBOUND_CLASS_TEMPLATE:
1613 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1614 ordinary nested names. */
1615 write_nested_name (TYPE_STUB_DECL (type));
1620 write_type (TREE_TYPE (type));
1623 case REFERENCE_TYPE:
1625 write_type (TREE_TYPE (type));
1628 case TEMPLATE_TYPE_PARM:
1629 case TEMPLATE_PARM_INDEX:
1630 write_template_param (type);
1633 case TEMPLATE_TEMPLATE_PARM:
1634 write_template_template_param (type);
1637 case BOUND_TEMPLATE_TEMPLATE_PARM:
1638 write_template_template_param (type);
1640 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1644 write_string ("U8__vector");
1645 write_type (TREE_TYPE (type));
1648 case TYPE_PACK_EXPANSION:
1649 write_string ("U10__variadic");
1650 write_type (PACK_EXPANSION_PATTERN (type));
1658 /* Types other than builtin types are substitution candidates. */
1659 if (!is_builtin_type)
1660 add_substitution (type);
1663 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1664 CV-qualifiers written for TYPE.
1666 <CV-qualifiers> ::= [r] [V] [K] */
1669 write_CV_qualifiers_for_type (const tree type)
1671 int num_qualifiers = 0;
1673 /* The order is specified by:
1675 "In cases where multiple order-insensitive qualifiers are
1676 present, they should be ordered 'K' (closest to the base type),
1677 'V', 'r', and 'U' (farthest from the base type) ..."
1679 Note that we do not use cp_type_quals below; given "const
1680 int[3]", the "const" is emitted with the "int", not with the
1683 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1688 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1693 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1699 return num_qualifiers;
1702 /* Non-terminal <builtin-type>.
1704 <builtin-type> ::= v # void
1709 ::= h # unsigned char
1711 ::= t # unsigned short
1713 ::= j # unsigned int
1715 ::= m # unsigned long
1716 ::= x # long long, __int64
1717 ::= y # unsigned long long, __int64
1719 ::= o # unsigned __int128
1722 ::= e # long double, __float80
1723 ::= g # __float128 [not supported]
1724 ::= u <source-name> # vendor extended type */
1727 write_builtin_type (tree type)
1729 switch (TREE_CODE (type))
1740 /* TYPE may still be wchar_t, since that isn't in
1741 integer_type_nodes. */
1742 if (type == wchar_type_node)
1744 else if (TYPE_FOR_JAVA (type))
1745 write_java_integer_type_codes (type);
1749 /* Assume TYPE is one of the shared integer type nodes. Find
1750 it in the array of these nodes. */
1752 for (itk = 0; itk < itk_none; ++itk)
1753 if (type == integer_types[itk])
1755 /* Print the corresponding single-letter code. */
1756 write_char (integer_type_codes[itk]);
1760 if (itk == itk_none)
1762 tree t = c_common_type_for_mode (TYPE_MODE (type),
1763 TYPE_UNSIGNED (type));
1770 if (TYPE_PRECISION (type) == 128)
1771 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
1774 /* Allow for cases where TYPE is not one of the shared
1775 integer type nodes and write a "vendor extended builtin
1776 type" with a name the form intN or uintN, respectively.
1777 Situations like this can happen if you have an
1778 __attribute__((__mode__(__SI__))) type and use exotic
1779 switches like '-mint8' on AVR. Of course, this is
1780 undefined by the C++ ABI (and '-mint8' is not even
1781 Standard C conforming), but when using such special
1782 options you're pretty much in nowhere land anyway. */
1784 char prec[11]; /* up to ten digits for an unsigned */
1786 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
1787 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
1788 write_char ('u'); /* "vendor extended builtin type" */
1789 write_unsigned_number (strlen (prefix) + strlen (prec));
1790 write_string (prefix);
1791 write_string (prec);
1798 if (type == float_type_node
1799 || type == java_float_type_node)
1801 else if (type == double_type_node
1802 || type == java_double_type_node)
1804 else if (type == long_double_type_node)
1815 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1816 METHOD_TYPE. The return type is mangled before the parameter
1819 <function-type> ::= F [Y] <bare-function-type> E */
1822 write_function_type (const tree type)
1824 MANGLE_TRACE_TREE ("function-type", type);
1826 /* For a pointer to member function, the function type may have
1827 cv-qualifiers, indicating the quals for the artificial 'this'
1829 if (TREE_CODE (type) == METHOD_TYPE)
1831 /* The first parameter must be a POINTER_TYPE pointing to the
1832 `this' parameter. */
1833 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1834 write_CV_qualifiers_for_type (this_type);
1838 /* We don't track whether or not a type is `extern "C"'. Note that
1839 you can have an `extern "C"' function that does not have
1840 `extern "C"' type, and vice versa:
1842 extern "C" typedef void function_t();
1843 function_t f; // f has C++ linkage, but its type is
1846 typedef void function_t();
1847 extern "C" function_t f; // Vice versa.
1850 write_bare_function_type (type, /*include_return_type_p=*/1,
1855 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1856 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1857 is mangled before the parameter types. If non-NULL, DECL is
1858 FUNCTION_DECL for the function whose type is being emitted.
1860 If DECL is a member of a Java type, then a literal 'J'
1861 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
1864 <bare-function-type> ::= [J]</signature/ type>+ */
1867 write_bare_function_type (const tree type, const int include_return_type_p,
1872 MANGLE_TRACE_TREE ("bare-function-type", type);
1874 /* Detect Java methods and emit special encoding. */
1876 && DECL_FUNCTION_MEMBER_P (decl)
1877 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
1878 && !DECL_CONSTRUCTOR_P (decl)
1879 && !DECL_DESTRUCTOR_P (decl)
1880 && !DECL_CONV_FN_P (decl))
1890 /* Mangle the return type, if requested. */
1891 if (include_return_type_p || java_method_p)
1892 write_type (TREE_TYPE (type));
1894 /* Now mangle the types of the arguments. */
1895 write_method_parms (TYPE_ARG_TYPES (type),
1896 TREE_CODE (type) == METHOD_TYPE,
1900 /* Write the mangled representation of a method parameter list of
1901 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1902 considered a non-static method, and the this parameter is omitted.
1903 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1904 parameters are being emitted. */
1907 write_method_parms (tree parm_types, const int method_p, const tree decl)
1909 tree first_parm_type;
1910 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1912 /* Assume this parameter type list is variable-length. If it ends
1913 with a void type, then it's not. */
1916 /* If this is a member function, skip the first arg, which is the
1918 "Member functions do not encode the type of their implicit this
1921 Similarly, there's no need to mangle artificial parameters, like
1922 the VTT parameters for constructors and destructors. */
1925 parm_types = TREE_CHAIN (parm_types);
1926 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1928 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1930 parm_types = TREE_CHAIN (parm_types);
1931 parm_decl = TREE_CHAIN (parm_decl);
1935 for (first_parm_type = parm_types;
1937 parm_types = TREE_CHAIN (parm_types))
1939 tree parm = TREE_VALUE (parm_types);
1940 if (parm == void_type_node)
1942 /* "Empty parameter lists, whether declared as () or
1943 conventionally as (void), are encoded with a void parameter
1945 if (parm_types == first_parm_type)
1947 /* If the parm list is terminated with a void type, it's
1950 /* A void type better be the last one. */
1951 gcc_assert (TREE_CHAIN (parm_types) == NULL);
1958 /* <builtin-type> ::= z # ellipsis */
1962 /* <class-enum-type> ::= <name> */
1965 write_class_enum_type (const tree type)
1967 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1970 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1973 <template-args> ::= I <template-arg>+ E */
1976 write_template_args (tree args)
1979 int length = TREE_VEC_LENGTH (args);
1981 MANGLE_TRACE_TREE ("template-args", args);
1985 gcc_assert (length > 0);
1987 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1989 /* We have nested template args. We want the innermost template
1991 args = TREE_VEC_ELT (args, length - 1);
1992 length = TREE_VEC_LENGTH (args);
1994 for (i = 0; i < length; ++i)
1995 write_template_arg (TREE_VEC_ELT (args, i));
2000 /* <expression> ::= <unary operator-name> <expression>
2001 ::= <binary operator-name> <expression> <expression>
2004 <expr-primary> ::= <template-param>
2005 ::= L <type> <value number> E # literal
2006 ::= L <mangled-name> E # external name
2007 ::= sr <type> <unqualified-name>
2008 ::= sr <type> <unqualified-name> <template-args> */
2011 write_expression (tree expr)
2013 enum tree_code code;
2015 code = TREE_CODE (expr);
2017 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2018 is converted (via qualification conversions) to another
2020 while (TREE_CODE (expr) == NOP_EXPR
2021 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2023 expr = TREE_OPERAND (expr, 0);
2024 code = TREE_CODE (expr);
2027 if (code == BASELINK)
2029 expr = BASELINK_FUNCTIONS (expr);
2030 code = TREE_CODE (expr);
2033 /* Handle pointers-to-members by making them look like expression
2035 if (code == PTRMEM_CST)
2037 expr = build_nt (ADDR_EXPR,
2038 build_qualified_name (/*type=*/NULL_TREE,
2039 PTRMEM_CST_CLASS (expr),
2040 PTRMEM_CST_MEMBER (expr),
2041 /*template_p=*/false));
2042 code = TREE_CODE (expr);
2045 /* Handle template parameters. */
2046 if (code == TEMPLATE_TYPE_PARM
2047 || code == TEMPLATE_TEMPLATE_PARM
2048 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2049 || code == TEMPLATE_PARM_INDEX)
2050 write_template_param (expr);
2051 /* Handle literals. */
2052 else if (TREE_CODE_CLASS (code) == tcc_constant
2053 || (abi_version_at_least (2) && code == CONST_DECL))
2054 write_template_arg_literal (expr);
2055 else if (DECL_P (expr))
2057 /* G++ 3.2 incorrectly mangled non-type template arguments of
2058 enumeration type using their names. */
2059 if (code == CONST_DECL)
2060 G.need_abi_warning = 1;
2062 write_mangled_name (expr, false);
2065 else if (TREE_CODE (expr) == SIZEOF_EXPR
2066 && TYPE_P (TREE_OPERAND (expr, 0)))
2068 write_string ("st");
2069 write_type (TREE_OPERAND (expr, 0));
2071 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
2073 tree scope = TREE_OPERAND (expr, 0);
2074 tree member = TREE_OPERAND (expr, 1);
2076 /* If the MEMBER is a real declaration, then the qualifying
2077 scope was not dependent. Ideally, we would not have a
2078 SCOPE_REF in those cases, but sometimes we do. If the second
2079 argument is a DECL, then the name must not have been
2081 if (DECL_P (member))
2082 write_expression (member);
2087 write_string ("sr");
2089 /* If MEMBER is a template-id, separate the template
2090 from the arguments. */
2091 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2093 template_args = TREE_OPERAND (member, 1);
2094 member = TREE_OPERAND (member, 0);
2097 template_args = NULL_TREE;
2098 /* Write out the name of the MEMBER. */
2099 if (IDENTIFIER_TYPENAME_P (member))
2100 write_conversion_operator_name (TREE_TYPE (member));
2101 else if (IDENTIFIER_OPNAME_P (member))
2104 const char *mangled_name = NULL;
2106 /* Unfortunately, there is no easy way to go from the
2107 name of the operator back to the corresponding tree
2109 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
2110 if (operator_name_info[i].identifier == member)
2112 /* The ABI says that we prefer binary operator
2113 names to unary operator names. */
2114 if (operator_name_info[i].arity == 2)
2116 mangled_name = operator_name_info[i].mangled_name;
2119 else if (!mangled_name)
2120 mangled_name = operator_name_info[i].mangled_name;
2122 else if (assignment_operator_name_info[i].identifier
2126 = assignment_operator_name_info[i].mangled_name;
2129 write_string (mangled_name);
2132 write_source_name (member);
2133 /* Write out the template arguments. */
2135 write_template_args (template_args);
2142 /* When we bind a variable or function to a non-type template
2143 argument with reference type, we create an ADDR_EXPR to show
2144 the fact that the entity's address has been taken. But, we
2145 don't actually want to output a mangling code for the `&'. */
2146 if (TREE_CODE (expr) == ADDR_EXPR
2148 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2150 expr = TREE_OPERAND (expr, 0);
2153 write_expression (expr);
2157 code = TREE_CODE (expr);
2160 /* If it wasn't any of those, recursively expand the expression. */
2161 write_string (operator_name_info[(int) code].mangled_name);
2166 sorry ("call_expr cannot be mangled due to a defect in the C++ ABI");
2170 write_type (TREE_TYPE (expr));
2171 /* There is no way to mangle a zero-operand cast like
2173 if (!TREE_OPERAND (expr, 0))
2174 sorry ("zero-operand casts cannot be mangled due to a defect "
2177 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2180 case STATIC_CAST_EXPR:
2181 case CONST_CAST_EXPR:
2182 write_type (TREE_TYPE (expr));
2183 write_expression (TREE_OPERAND (expr, 0));
2187 /* Handle pointers-to-members specially. */
2189 write_type (TREE_OPERAND (expr, 0));
2190 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2191 write_source_name (TREE_OPERAND (expr, 1));
2192 else if (TREE_CODE (TREE_OPERAND (expr, 1)) == TEMPLATE_ID_EXPR)
2197 template_id = TREE_OPERAND (expr, 1);
2198 name = TREE_OPERAND (template_id, 0);
2199 /* FIXME: What about operators? */
2200 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
2201 write_source_name (TREE_OPERAND (template_id, 0));
2202 write_template_args (TREE_OPERAND (template_id, 1));
2206 /* G++ 3.2 incorrectly put out both the "sr" code and
2207 the nested name of the qualified name. */
2208 G.need_abi_warning = 1;
2209 write_encoding (TREE_OPERAND (expr, 1));
2214 for (i = 0; i < TREE_OPERAND_LENGTH (expr); ++i)
2216 tree operand = TREE_OPERAND (expr, i);
2217 /* As a GNU extension, the middle operand of a
2218 conditional may be omitted. Since expression
2219 manglings are supposed to represent the input token
2220 stream, there's no good way to mangle such an
2221 expression without extending the C++ ABI. */
2222 if (code == COND_EXPR && i == 1 && !operand)
2224 error ("omitted middle operand to %<?:%> operand "
2225 "cannot be mangled");
2228 write_expression (operand);
2234 /* Literal subcase of non-terminal <template-arg>.
2236 "Literal arguments, e.g. "A<42L>", are encoded with their type
2237 and value. Negative integer values are preceded with "n"; for
2238 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2239 encoded as 0, true as 1." */
2242 write_template_arg_literal (const tree value)
2245 write_type (TREE_TYPE (value));
2247 switch (TREE_CODE (value))
2250 write_integer_cst (DECL_INITIAL (value));
2254 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
2255 || integer_zerop (value) || integer_onep (value));
2256 write_integer_cst (value);
2260 write_real_cst (value);
2270 /* Non-terminal <template-arg>.
2272 <template-arg> ::= <type> # type
2273 ::= L <type> </value/ number> E # literal
2274 ::= LZ <name> E # external name
2275 ::= X <expression> E # expression */
2278 write_template_arg (tree node)
2280 enum tree_code code = TREE_CODE (node);
2282 MANGLE_TRACE_TREE ("template-arg", node);
2284 /* A template template parameter's argument list contains TREE_LIST
2285 nodes of which the value field is the actual argument. */
2286 if (code == TREE_LIST)
2288 node = TREE_VALUE (node);
2289 /* If it's a decl, deal with its type instead. */
2292 node = TREE_TYPE (node);
2293 code = TREE_CODE (node);
2297 if (TREE_CODE (node) == NOP_EXPR
2298 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
2300 /* Template parameters can be of reference type. To maintain
2301 internal consistency, such arguments use a conversion from
2302 address of object to reference type. */
2303 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
2304 if (abi_version_at_least (2))
2305 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
2307 G.need_abi_warning = 1;
2310 if (ARGUMENT_PACK_P (node))
2312 /* Expand the template argument pack. */
2313 tree args = ARGUMENT_PACK_ARGS (node);
2314 int i, length = TREE_VEC_LENGTH (args);
2315 for (i = 0; i < length; ++i)
2316 write_template_arg (TREE_VEC_ELT (args, i));
2318 else if (TYPE_P (node))
2320 else if (code == TEMPLATE_DECL)
2321 /* A template appearing as a template arg is a template template arg. */
2322 write_template_template_arg (node);
2323 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
2324 || (abi_version_at_least (2) && code == CONST_DECL))
2325 write_template_arg_literal (node);
2326 else if (DECL_P (node))
2328 /* Until ABI version 2, non-type template arguments of
2329 enumeration type were mangled using their names. */
2330 if (code == CONST_DECL && !abi_version_at_least (2))
2331 G.need_abi_warning = 1;
2333 /* Until ABI version 3, the underscore before the mangled name
2334 was incorrectly omitted. */
2335 if (!abi_version_at_least (3))
2337 G.need_abi_warning = 1;
2341 write_string ("_Z");
2342 write_encoding (node);
2347 /* Template arguments may be expressions. */
2349 write_expression (node);
2354 /* <template-template-arg>
2356 ::= <substitution> */
2359 write_template_template_arg (const tree decl)
2361 MANGLE_TRACE_TREE ("template-template-arg", decl);
2363 if (find_substitution (decl))
2365 write_name (decl, /*ignore_local_scope=*/0);
2366 add_substitution (decl);
2370 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2372 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2373 ::= A <expression> _ </element/ type>
2375 "Array types encode the dimension (number of elements) and the
2376 element type. For variable length arrays, the dimension (but not
2377 the '_' separator) is omitted." */
2380 write_array_type (const tree type)
2383 if (TYPE_DOMAIN (type))
2388 index_type = TYPE_DOMAIN (type);
2389 /* The INDEX_TYPE gives the upper and lower bounds of the
2391 max = TYPE_MAX_VALUE (index_type);
2392 if (TREE_CODE (max) == INTEGER_CST)
2394 /* The ABI specifies that we should mangle the number of
2395 elements in the array, not the largest allowed index. */
2396 max = size_binop (PLUS_EXPR, max, size_one_node);
2397 write_unsigned_number (tree_low_cst (max, 1));
2401 max = TREE_OPERAND (max, 0);
2402 if (!abi_version_at_least (2))
2404 /* value_dependent_expression_p presumes nothing is
2405 dependent when PROCESSING_TEMPLATE_DECL is zero. */
2406 ++processing_template_decl;
2407 if (!value_dependent_expression_p (max))
2408 G.need_abi_warning = 1;
2409 --processing_template_decl;
2411 write_expression (max);
2416 write_type (TREE_TYPE (type));
2419 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2420 variables. TYPE is a pointer-to-member POINTER_TYPE.
2422 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2425 write_pointer_to_member_type (const tree type)
2428 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2429 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2432 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2433 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2434 TEMPLATE_PARM_INDEX.
2436 <template-param> ::= T </parameter/ number> _ */
2439 write_template_param (const tree parm)
2443 tree parm_type = NULL_TREE;
2445 MANGLE_TRACE_TREE ("template-parm", parm);
2447 switch (TREE_CODE (parm))
2449 case TEMPLATE_TYPE_PARM:
2450 case TEMPLATE_TEMPLATE_PARM:
2451 case BOUND_TEMPLATE_TEMPLATE_PARM:
2452 parm_index = TEMPLATE_TYPE_IDX (parm);
2453 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2456 case TEMPLATE_PARM_INDEX:
2457 parm_index = TEMPLATE_PARM_IDX (parm);
2458 parm_level = TEMPLATE_PARM_LEVEL (parm);
2459 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2467 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2468 earliest template param denoted by `_'. */
2470 write_unsigned_number (parm_index - 1);
2474 /* <template-template-param>
2475 ::= <template-param>
2476 ::= <substitution> */
2479 write_template_template_param (const tree parm)
2481 tree template = NULL_TREE;
2483 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2484 template template parameter. The substitution candidate here is
2485 only the template. */
2486 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2489 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2490 if (find_substitution (template))
2494 /* <template-param> encodes only the template parameter position,
2495 not its template arguments, which is fine here. */
2496 write_template_param (parm);
2498 add_substitution (template);
2501 /* Non-terminal <substitution>.
2503 <substitution> ::= S <seq-id> _
2507 write_substitution (const int seq_id)
2509 MANGLE_TRACE ("substitution", "");
2513 write_number (seq_id - 1, /*unsigned=*/1, 36);
2517 /* Start mangling ENTITY. */
2520 start_mangling (const tree entity, const bool ident_p)
2523 G.need_abi_warning = false;
2526 obstack_free (&name_obstack, name_base);
2527 mangle_obstack = &name_obstack;
2528 name_base = obstack_alloc (&name_obstack, 0);
2531 mangle_obstack = &ident_hash->stack;
2534 /* Done with mangling. Return the generated mangled name. If WARN is
2535 true, and the name of G.entity will be mangled differently in a
2536 future version of the ABI, issue a warning. */
2538 static inline const char *
2539 finish_mangling (const bool warn)
2541 if (warn_abi && warn && G.need_abi_warning)
2542 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
2546 /* Clear all the substitutions. */
2547 VEC_truncate (tree, G.substitutions, 0);
2549 /* Null-terminate the string. */
2552 return (const char *) obstack_finish (mangle_obstack);
2555 /* Initialize data structures for mangling. */
2560 gcc_obstack_init (&name_obstack);
2561 name_base = obstack_alloc (&name_obstack, 0);
2562 G.substitutions = NULL;
2564 /* Cache these identifiers for quick comparison when checking for
2565 standard substitutions. */
2566 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2567 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2568 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2569 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2570 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2571 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2574 /* Generate the mangled name of DECL. */
2577 mangle_decl_string (const tree decl)
2581 start_mangling (decl, /*ident_p=*/true);
2583 if (TREE_CODE (decl) == TYPE_DECL)
2584 write_type (TREE_TYPE (decl));
2586 write_mangled_name (decl, true);
2588 result = finish_mangling (/*warn=*/true);
2590 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2594 /* Like get_identifier, except that NAME is assumed to have been
2595 allocated on the obstack used by the identifier hash table. */
2598 get_identifier_nocopy (const char *name)
2600 hashnode ht_node = ht_lookup (ident_hash, (const unsigned char *) name,
2601 strlen (name), HT_ALLOCED);
2602 return HT_IDENT_TO_GCC_IDENT (ht_node);
2605 /* Create an identifier for the external mangled name of DECL. */
2608 mangle_decl (const tree decl)
2610 SET_DECL_ASSEMBLER_NAME (decl,
2611 get_identifier_nocopy (mangle_decl_string (decl)));
2614 /* Generate the mangled representation of TYPE. */
2617 mangle_type_string (const tree type)
2621 start_mangling (type, /*ident_p=*/false);
2623 result = finish_mangling (/*warn=*/false);
2625 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2629 /* Create an identifier for the mangled name of a special component
2630 for belonging to TYPE. CODE is the ABI-specified code for this
2634 mangle_special_for_type (const tree type, const char *code)
2638 /* We don't have an actual decl here for the special component, so
2639 we can't just process the <encoded-name>. Instead, fake it. */
2640 start_mangling (type, /*ident_p=*/true);
2642 /* Start the mangling. */
2643 write_string ("_Z");
2644 write_string (code);
2648 result = finish_mangling (/*warn=*/false);
2651 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2653 return get_identifier_nocopy (result);
2656 /* Create an identifier for the mangled representation of the typeinfo
2657 structure for TYPE. */
2660 mangle_typeinfo_for_type (const tree type)
2662 return mangle_special_for_type (type, "TI");
2665 /* Create an identifier for the mangled name of the NTBS containing
2666 the mangled name of TYPE. */
2669 mangle_typeinfo_string_for_type (const tree type)
2671 return mangle_special_for_type (type, "TS");
2674 /* Create an identifier for the mangled name of the vtable for TYPE. */
2677 mangle_vtbl_for_type (const tree type)
2679 return mangle_special_for_type (type, "TV");
2682 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2685 mangle_vtt_for_type (const tree type)
2687 return mangle_special_for_type (type, "TT");
2690 /* Return an identifier for a construction vtable group. TYPE is
2691 the most derived class in the hierarchy; BINFO is the base
2692 subobject for which this construction vtable group will be used.
2694 This mangling isn't part of the ABI specification; in the ABI
2695 specification, the vtable group is dumped in the same COMDAT as the
2696 main vtable, and is referenced only from that vtable, so it doesn't
2697 need an external name. For binary formats without COMDAT sections,
2698 though, we need external names for the vtable groups.
2700 We use the production
2702 <special-name> ::= CT <type> <offset number> _ <base type> */
2705 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2709 start_mangling (type, /*ident_p=*/true);
2711 write_string ("_Z");
2712 write_string ("TC");
2714 write_integer_cst (BINFO_OFFSET (binfo));
2716 write_type (BINFO_TYPE (binfo));
2718 result = finish_mangling (/*warn=*/false);
2720 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2721 return get_identifier_nocopy (result);
2724 /* Mangle a this pointer or result pointer adjustment.
2726 <call-offset> ::= h <fixed offset number> _
2727 ::= v <fixed offset number> _ <virtual offset number> _ */
2730 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2732 write_char (virtual_offset ? 'v' : 'h');
2734 /* For either flavor, write the fixed offset. */
2735 write_integer_cst (fixed_offset);
2738 /* For a virtual thunk, add the virtual offset. */
2741 write_integer_cst (virtual_offset);
2746 /* Return an identifier for the mangled name of a this-adjusting or
2747 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2748 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2749 is a virtual thunk, and it is the vtbl offset in
2750 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2751 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2752 thunk itself. A covariant thunk name always includes the adjustment
2753 for the this pointer, even if there is none.
2755 <special-name> ::= T <call-offset> <base encoding>
2756 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2760 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2761 tree virtual_offset)
2765 start_mangling (fn_decl, /*ident_p=*/true);
2767 write_string ("_Z");
2770 if (!this_adjusting)
2772 /* Covariant thunk with no this adjustment */
2774 mangle_call_offset (integer_zero_node, NULL_TREE);
2775 mangle_call_offset (fixed_offset, virtual_offset);
2777 else if (!DECL_THUNK_P (fn_decl))
2778 /* Plain this adjusting thunk. */
2779 mangle_call_offset (fixed_offset, virtual_offset);
2782 /* This adjusting thunk to covariant thunk. */
2784 mangle_call_offset (fixed_offset, virtual_offset);
2785 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2786 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2788 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2789 mangle_call_offset (fixed_offset, virtual_offset);
2790 fn_decl = THUNK_TARGET (fn_decl);
2794 write_encoding (fn_decl);
2796 result = finish_mangling (/*warn=*/false);
2798 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2799 return get_identifier_nocopy (result);
2802 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2803 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
2806 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
2808 /* Hash a node (VAL1) in the table. */
2811 hash_type (const void *val)
2813 return (hashval_t) TYPE_UID (TREE_TYPE ((tree) val));
2816 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2819 compare_type (const void *val1, const void *val2)
2821 return TREE_TYPE ((tree) val1) == (tree) val2;
2824 /* Return an identifier for the mangled unqualified name for a
2825 conversion operator to TYPE. This mangling is not specified by the
2826 ABI spec; it is only used internally. */
2829 mangle_conv_op_name_for_type (const tree type)
2834 if (type == error_mark_node)
2835 return error_mark_node;
2837 if (conv_type_names == NULL)
2838 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
2840 slot = htab_find_slot_with_hash (conv_type_names, type,
2841 (hashval_t) TYPE_UID (type), INSERT);
2842 identifier = (tree)*slot;
2847 /* Create a unique name corresponding to TYPE. */
2848 sprintf (buffer, "operator %lu",
2849 (unsigned long) htab_elements (conv_type_names));
2850 identifier = get_identifier (buffer);
2853 /* Hang TYPE off the identifier so it can be found easily later
2854 when performing conversions. */
2855 TREE_TYPE (identifier) = type;
2857 /* Set bits on the identifier so we know later it's a conversion. */
2858 IDENTIFIER_OPNAME_P (identifier) = 1;
2859 IDENTIFIER_TYPENAME_P (identifier) = 1;
2865 /* Return an identifier for the name of an initialization guard
2866 variable for indicated VARIABLE. */
2869 mangle_guard_variable (const tree variable)
2871 start_mangling (variable, /*ident_p=*/true);
2872 write_string ("_ZGV");
2873 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2874 /* The name of a guard variable for a reference temporary should refer
2875 to the reference, not the temporary. */
2876 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2878 write_name (variable, /*ignore_local_scope=*/0);
2879 return get_identifier_nocopy (finish_mangling (/*warn=*/false));
2882 /* Return an identifier for the name of a temporary variable used to
2883 initialize a static reference. This isn't part of the ABI, but we might
2884 as well call them something readable. */
2887 mangle_ref_init_variable (const tree variable)
2889 start_mangling (variable, /*ident_p=*/true);
2890 write_string ("_ZGR");
2891 write_name (variable, /*ignore_local_scope=*/0);
2892 return get_identifier_nocopy (finish_mangling (/*warn=*/false));
2896 /* Foreign language type mangling section. */
2898 /* How to write the type codes for the integer Java type. */
2901 write_java_integer_type_codes (const tree type)
2903 if (type == java_int_type_node)
2905 else if (type == java_short_type_node)
2907 else if (type == java_byte_type_node)
2909 else if (type == java_char_type_node)
2911 else if (type == java_long_type_node)
2913 else if (type == java_boolean_type_node)
2919 #include "gt-cp-mangle.h"