1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007
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 /* An incomplete mangled name. There will be no NUL terminator. If
121 there is no incomplete mangled name, this variable is NULL. */
122 static char *partially_mangled_name;
124 /* The number of characters in the PARTIALLY_MANGLED_NAME. */
125 static size_t partially_mangled_name_len;
127 /* Indices into subst_identifiers. These are identifiers used in
128 special substitution rules. */
136 SUBID_BASIC_IOSTREAM,
139 substitution_identifier_index_t;
141 /* For quick substitution checks, look up these common identifiers
143 static GTY(()) tree subst_identifiers[SUBID_MAX];
145 /* Single-letter codes for builtin integer types, defined in
146 <builtin-type>. These are indexed by integer_type_kind values. */
148 integer_type_codes[itk_none] =
151 'a', /* itk_signed_char */
152 'h', /* itk_unsigned_char */
154 't', /* itk_unsigned_short */
156 'j', /* itk_unsigned_int */
158 'm', /* itk_unsigned_long */
159 'x', /* itk_long_long */
160 'y' /* itk_unsigned_long_long */
163 static int decl_is_template_id (const tree, tree* const);
165 /* Functions for handling substitutions. */
167 static inline tree canonicalize_for_substitution (tree);
168 static void add_substitution (tree);
169 static inline int is_std_substitution (const tree,
170 const substitution_identifier_index_t);
171 static inline int is_std_substitution_char (const tree,
172 const substitution_identifier_index_t);
173 static int find_substitution (tree);
174 static void mangle_call_offset (const tree, const tree);
176 /* Functions for emitting mangled representations of things. */
178 static void write_mangled_name (const tree, bool);
179 static void write_encoding (const tree);
180 static void write_name (tree, const int);
181 static void write_unscoped_name (const tree);
182 static void write_unscoped_template_name (const tree);
183 static void write_nested_name (const tree);
184 static void write_prefix (const tree);
185 static void write_template_prefix (const tree);
186 static void write_unqualified_name (const tree);
187 static void write_conversion_operator_name (const tree);
188 static void write_source_name (tree);
189 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
191 static void write_number (unsigned HOST_WIDE_INT, const int,
193 static void write_integer_cst (const tree);
194 static void write_real_cst (const tree);
195 static void write_identifier (const char *);
196 static void write_special_name_constructor (const tree);
197 static void write_special_name_destructor (const tree);
198 static void write_type (tree);
199 static int write_CV_qualifiers_for_type (const tree);
200 static void write_builtin_type (tree);
201 static void write_function_type (const tree);
202 static void write_bare_function_type (const tree, const int, const tree);
203 static void write_method_parms (tree, const int, const tree);
204 static void write_class_enum_type (const tree);
205 static void write_template_args (tree);
206 static void write_expression (tree);
207 static void write_template_arg_literal (const tree);
208 static void write_template_arg (tree);
209 static void write_template_template_arg (const tree);
210 static void write_array_type (const tree);
211 static void write_pointer_to_member_type (const tree);
212 static void write_template_param (const tree);
213 static void write_template_template_param (const tree);
214 static void write_substitution (const int);
215 static int discriminator_for_local_entity (tree);
216 static int discriminator_for_string_literal (tree, tree);
217 static void write_discriminator (const int);
218 static void write_local_name (const tree, const tree, const tree);
219 static void dump_substitution_candidates (void);
220 static const char *mangle_decl_string (const tree);
222 /* Control functions. */
224 static inline void start_mangling (const tree, bool);
225 static inline const char *finish_mangling (const bool);
226 static tree mangle_special_for_type (const tree, const char *);
228 /* Foreign language functions. */
230 static void write_java_integer_type_codes (const tree);
232 /* Append a single character to the end of the mangled
234 #define write_char(CHAR) \
235 obstack_1grow (mangle_obstack, (CHAR))
237 /* Append a sized buffer to the end of the mangled representation. */
238 #define write_chars(CHAR, LEN) \
239 obstack_grow (mangle_obstack, (CHAR), (LEN))
241 /* Append a NUL-terminated string to the end of the mangled
243 #define write_string(STRING) \
244 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
246 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
247 same purpose (context, which may be a type) and value (template
248 decl). See write_template_prefix for more information on what this
250 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
251 (TREE_CODE (NODE1) == TREE_LIST \
252 && TREE_CODE (NODE2) == TREE_LIST \
253 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
254 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
255 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
256 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
258 /* Write out an unsigned quantity in base 10. */
259 #define write_unsigned_number(NUMBER) \
260 write_number ((NUMBER), /*unsigned_p=*/1, 10)
262 /* Save the current (incomplete) mangled name and release the obstack
263 storage holding it. This function should be used during mangling
264 when making a call that could result in a call to get_identifier,
265 as such a call will clobber the same obstack being used for
266 mangling. This function may not be called twice without an
267 intervening call to restore_partially_mangled_name. */
270 save_partially_mangled_name (void)
272 if (mangle_obstack == &ident_hash->stack)
274 gcc_assert (!partially_mangled_name);
275 partially_mangled_name_len = obstack_object_size (mangle_obstack);
276 partially_mangled_name = XNEWVEC (char, partially_mangled_name_len);
277 memcpy (partially_mangled_name, obstack_base (mangle_obstack),
278 partially_mangled_name_len);
279 obstack_free (mangle_obstack, obstack_finish (mangle_obstack));
283 /* Restore the incomplete mangled name saved with
284 save_partially_mangled_name. */
287 restore_partially_mangled_name (void)
289 if (partially_mangled_name)
291 obstack_grow (mangle_obstack, partially_mangled_name,
292 partially_mangled_name_len);
293 free (partially_mangled_name);
294 partially_mangled_name = NULL;
298 /* If DECL is a template instance, return nonzero and, if
299 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
300 Otherwise return zero. */
303 decl_is_template_id (const tree decl, tree* const template_info)
305 if (TREE_CODE (decl) == TYPE_DECL)
307 /* TYPE_DECLs are handled specially. Look at its type to decide
308 if this is a template instantiation. */
309 const tree type = TREE_TYPE (decl);
311 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
313 if (template_info != NULL)
314 /* For a templated TYPE_DECL, the template info is hanging
316 *template_info = TYPE_TEMPLATE_INFO (type);
322 /* Check if this is a primary template. */
323 if (DECL_LANG_SPECIFIC (decl) != NULL
324 && DECL_USE_TEMPLATE (decl)
325 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
326 && TREE_CODE (decl) != TEMPLATE_DECL)
328 if (template_info != NULL)
329 /* For most templated decls, the template info is hanging
331 *template_info = DECL_TEMPLATE_INFO (decl);
336 /* It's not a template id. */
340 /* Produce debugging output of current substitution candidates. */
343 dump_substitution_candidates (void)
348 fprintf (stderr, " ++ substitutions ");
349 for (i = 0; VEC_iterate (tree, G.substitutions, i, el); ++i)
351 const char *name = "???";
354 fprintf (stderr, " ");
356 name = IDENTIFIER_POINTER (DECL_NAME (el));
357 else if (TREE_CODE (el) == TREE_LIST)
358 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
359 else if (TYPE_NAME (el))
360 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
361 fprintf (stderr, " S%d_ = ", i - 1);
363 (CP_TYPE_RESTRICT_P (el)
364 || CP_TYPE_VOLATILE_P (el)
365 || CP_TYPE_CONST_P (el)))
366 fprintf (stderr, "CV-");
367 fprintf (stderr, "%s (%s at %p)\n",
368 name, tree_code_name[TREE_CODE (el)], (void *) el);
372 /* Both decls and types can be substitution candidates, but sometimes
373 they refer to the same thing. For instance, a TYPE_DECL and
374 RECORD_TYPE for the same class refer to the same thing, and should
375 be treated accordingly in substitutions. This function returns a
376 canonicalized tree node representing NODE that is used when adding
377 and substitution candidates and finding matches. */
380 canonicalize_for_substitution (tree node)
382 /* For a TYPE_DECL, use the type instead. */
383 if (TREE_CODE (node) == TYPE_DECL)
384 node = TREE_TYPE (node);
386 node = canonical_type_variant (node);
391 /* Add NODE as a substitution candidate. NODE must not already be on
392 the list of candidates. */
395 add_substitution (tree node)
400 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
401 tree_code_name[TREE_CODE (node)], (void *) node);
403 /* Get the canonicalized substitution candidate for NODE. */
404 c = canonicalize_for_substitution (node);
405 if (DEBUG_MANGLE && c != node)
406 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
407 tree_code_name[TREE_CODE (node)], (void *) node);
411 /* Make sure NODE isn't already a candidate. */
416 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++)
418 gcc_assert (!(DECL_P (node) && node == candidate));
419 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
420 && same_type_p (node, candidate)));
423 #endif /* ENABLE_CHECKING */
425 /* Put the decl onto the varray of substitution candidates. */
426 VEC_safe_push (tree, gc, G.substitutions, node);
429 dump_substitution_candidates ();
432 /* Helper function for find_substitution. Returns nonzero if NODE,
433 which may be a decl or a CLASS_TYPE, is a template-id with template
434 name of substitution_index[INDEX] in the ::std namespace. */
437 is_std_substitution (const tree node,
438 const substitution_identifier_index_t index)
445 type = TREE_TYPE (node);
448 else if (CLASS_TYPE_P (node))
451 decl = TYPE_NAME (node);
454 /* These are not the droids you're looking for. */
457 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
458 && TYPE_LANG_SPECIFIC (type)
459 && TYPE_TEMPLATE_INFO (type)
460 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
461 == subst_identifiers[index]));
464 /* Helper function for find_substitution. Returns nonzero if NODE,
465 which may be a decl or a CLASS_TYPE, is the template-id
466 ::std::identifier<char>, where identifier is
467 substitution_index[INDEX]. */
470 is_std_substitution_char (const tree node,
471 const substitution_identifier_index_t index)
474 /* Check NODE's name is ::std::identifier. */
475 if (!is_std_substitution (node, index))
477 /* Figure out its template args. */
479 args = DECL_TI_ARGS (node);
480 else if (CLASS_TYPE_P (node))
481 args = CLASSTYPE_TI_ARGS (node);
483 /* Oops, not a template. */
485 /* NODE's template arg list should be <char>. */
487 TREE_VEC_LENGTH (args) == 1
488 && TREE_VEC_ELT (args, 0) == char_type_node;
491 /* Check whether a substitution should be used to represent NODE in
494 First, check standard special-case substitutions.
496 <substitution> ::= St
503 # ::std::basic_string
506 # ::std::basic_string<char,
507 ::std::char_traits<char>,
508 ::std::allocator<char> >
511 # ::std::basic_istream<char, ::std::char_traits<char> >
514 # ::std::basic_ostream<char, ::std::char_traits<char> >
517 # ::std::basic_iostream<char, ::std::char_traits<char> >
519 Then examine the stack of currently available substitution
520 candidates for entities appearing earlier in the same mangling
522 If a substitution is found, write its mangled representation and
523 return nonzero. If none is found, just return zero. */
526 find_substitution (tree node)
529 const int size = VEC_length (tree, G.substitutions);
534 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
535 tree_code_name[TREE_CODE (node)], (void *) node);
537 /* Obtain the canonicalized substitution representation for NODE.
538 This is what we'll compare against. */
539 node = canonicalize_for_substitution (node);
541 /* Check for builtin substitutions. */
543 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
544 type = TYPE_P (node) ? node : TREE_TYPE (node);
546 /* Check for std::allocator. */
548 && is_std_substitution (decl, SUBID_ALLOCATOR)
549 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
555 /* Check for std::basic_string. */
556 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
560 /* If this is a type (i.e. a fully-qualified template-id),
562 std::basic_string <char,
563 std::char_traits<char>,
564 std::allocator<char> > . */
565 if (cp_type_quals (type) == TYPE_UNQUALIFIED
566 && CLASSTYPE_USE_TEMPLATE (type))
568 tree args = CLASSTYPE_TI_ARGS (type);
569 if (TREE_VEC_LENGTH (args) == 3
570 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
571 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
573 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
582 /* Substitute for the template name only if this isn't a type. */
589 /* Check for basic_{i,o,io}stream. */
591 && cp_type_quals (type) == TYPE_UNQUALIFIED
592 && CLASS_TYPE_P (type)
593 && CLASSTYPE_USE_TEMPLATE (type)
594 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
596 /* First, check for the template
597 args <char, std::char_traits<char> > . */
598 tree args = CLASSTYPE_TI_ARGS (type);
599 if (TREE_VEC_LENGTH (args) == 2
600 && TYPE_P (TREE_VEC_ELT (args, 0))
601 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
602 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
605 /* Got them. Is this basic_istream? */
606 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
611 /* Or basic_ostream? */
612 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
617 /* Or basic_iostream? */
618 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
626 /* Check for namespace std. */
627 if (decl && DECL_NAMESPACE_STD_P (decl))
633 /* Now check the list of available substitutions for this mangling
635 for (i = 0; i < size; ++i)
637 tree candidate = VEC_index (tree, G.substitutions, i);
638 /* NODE is a matched to a candidate if it's the same decl node or
639 if it's the same type. */
640 if (decl == candidate
641 || (TYPE_P (candidate) && type && TYPE_P (type)
642 && same_type_p (type, candidate))
643 || NESTED_TEMPLATE_MATCH (node, candidate))
645 write_substitution (i);
650 /* No substitution found. */
655 /* TOP_LEVEL is true, if this is being called at outermost level of
656 mangling. It should be false when mangling a decl appearing in an
657 expression within some other mangling.
659 <mangled-name> ::= _Z <encoding> */
662 write_mangled_name (const tree decl, bool top_level)
664 MANGLE_TRACE_TREE ("mangled-name", decl);
666 if (/* The names of `extern "C"' functions are not mangled. */
667 DECL_EXTERN_C_FUNCTION_P (decl)
668 /* But overloaded operator names *are* mangled. */
669 && !DECL_OVERLOADED_OPERATOR_P (decl))
674 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
677 /* The standard notes: "The <encoding> of an extern "C"
678 function is treated like global-scope data, i.e. as its
679 <source-name> without a type." We cannot write
680 overloaded operators that way though, because it contains
681 characters invalid in assembler. */
682 if (abi_version_at_least (2))
685 G.need_abi_warning = true;
686 write_source_name (DECL_NAME (decl));
689 else if (TREE_CODE (decl) == VAR_DECL
690 /* The names of non-static global variables aren't mangled. */
691 && DECL_EXTERNAL_LINKAGE_P (decl)
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>
1090 ::= <local-source-name>
1092 <local-source-name> ::= L <source-name> <discriminator> */
1095 write_unqualified_name (const tree decl)
1097 MANGLE_TRACE_TREE ("unqualified-name", decl);
1099 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
1100 write_special_name_constructor (decl);
1101 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
1102 write_special_name_destructor (decl);
1103 else if (DECL_NAME (decl) == NULL_TREE)
1104 write_source_name (DECL_ASSEMBLER_NAME (decl));
1105 else if (DECL_CONV_FN_P (decl))
1107 /* Conversion operator. Handle it right here.
1108 <operator> ::= cv <type> */
1110 if (decl_is_template_id (decl, NULL))
1113 save_partially_mangled_name ();
1114 fn_type = get_mostly_instantiated_function_type (decl);
1115 restore_partially_mangled_name ();
1116 type = TREE_TYPE (fn_type);
1119 type = DECL_CONV_FN_TYPE (decl);
1120 write_conversion_operator_name (type);
1122 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1124 operator_name_info_t *oni;
1125 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1126 oni = assignment_operator_name_info;
1128 oni = operator_name_info;
1130 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1132 else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1133 && DECL_NAMESPACE_SCOPE_P (decl)
1134 && decl_linkage (decl) == lk_internal)
1136 MANGLE_TRACE_TREE ("local-source-name", decl);
1138 write_source_name (DECL_NAME (decl));
1139 /* The default discriminator is 1, and that's all we ever use,
1140 so there's no code to output one here. */
1143 write_source_name (DECL_NAME (decl));
1146 /* Write the unqualified-name for a conversion operator to TYPE. */
1149 write_conversion_operator_name (const tree type)
1151 write_string ("cv");
1155 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1157 <source-name> ::= </length/ number> <identifier> */
1160 write_source_name (tree identifier)
1162 MANGLE_TRACE_TREE ("source-name", identifier);
1164 /* Never write the whole template-id name including the template
1165 arguments; we only want the template name. */
1166 if (IDENTIFIER_TEMPLATE (identifier))
1167 identifier = IDENTIFIER_TEMPLATE (identifier);
1169 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1170 write_identifier (IDENTIFIER_POINTER (identifier));
1173 /* Convert NUMBER to ascii using base BASE and generating at least
1174 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1175 into which to store the characters. Returns the number of
1176 characters generated (these will be layed out in advance of where
1180 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1181 char *buffer, const unsigned int min_digits)
1183 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1184 unsigned digits = 0;
1188 unsigned HOST_WIDE_INT d = number / base;
1190 *--buffer = base_digits[number - d * base];
1194 while (digits < min_digits)
1196 *--buffer = base_digits[0];
1202 /* Non-terminal <number>.
1204 <number> ::= [n] </decimal integer/> */
1207 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1208 const unsigned int base)
1210 char buffer[sizeof (HOST_WIDE_INT) * 8];
1213 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1216 number = -((HOST_WIDE_INT) number);
1218 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1219 write_chars (buffer + sizeof (buffer) - count, count);
1222 /* Write out an integral CST in decimal. Most numbers are small, and
1223 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1224 bigger than that, which we must deal with. */
1227 write_integer_cst (const tree cst)
1229 int sign = tree_int_cst_sgn (cst);
1231 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1233 /* A bignum. We do this in chunks, each of which fits in a
1235 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1236 unsigned HOST_WIDE_INT chunk;
1237 unsigned chunk_digits;
1238 char *ptr = buffer + sizeof (buffer);
1243 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1248 if (sizeof (HOST_WIDE_INT) >= 8)
1250 /* It is at least 64 bits, so 10^18 is representable. */
1255 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1256 base = build_int_cstu (type, chunk);
1257 n = build_int_cst_wide (type,
1258 TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1263 n = fold_build1 (NEGATE_EXPR, type, n);
1267 tree d = fold_build2 (FLOOR_DIV_EXPR, type, n, base);
1268 tree tmp = fold_build2 (MULT_EXPR, type, d, base);
1271 done = integer_zerop (d);
1272 tmp = fold_build2 (MINUS_EXPR, type, n, tmp);
1273 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1274 done ? 1 : chunk_digits);
1280 write_chars (ptr, count);
1285 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1292 write_unsigned_number (low);
1296 /* Write out a floating-point literal.
1298 "Floating-point literals are encoded using the bit pattern of the
1299 target processor's internal representation of that number, as a
1300 fixed-length lowercase hexadecimal string, high-order bytes first
1301 (even if the target processor would store low-order bytes first).
1302 The "n" prefix is not used for floating-point literals; the sign
1303 bit is encoded with the rest of the number.
1305 Here are some examples, assuming the IEEE standard representation
1306 for floating point numbers. (Spaces are for readability, not
1307 part of the encoding.)
1310 -1.0f Lf bf80 0000 E
1311 1.17549435e-38f Lf 0080 0000 E
1312 1.40129846e-45f Lf 0000 0001 E
1313 0.0f Lf 0000 0000 E"
1315 Caller is responsible for the Lx and the E. */
1317 write_real_cst (const tree value)
1319 if (abi_version_at_least (2))
1321 long target_real[4]; /* largest supported float */
1322 char buffer[9]; /* eight hex digits in a 32-bit number */
1325 tree type = TREE_TYPE (value);
1326 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1328 real_to_target (target_real, &TREE_REAL_CST (value),
1331 /* The value in target_real is in the target word order,
1332 so we must write it out backward if that happens to be
1333 little-endian. write_number cannot be used, it will
1334 produce uppercase. */
1335 if (FLOAT_WORDS_BIG_ENDIAN)
1336 i = 0, limit = words, dir = 1;
1338 i = words - 1, limit = -1, dir = -1;
1340 for (; i != limit; i += dir)
1342 sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
1343 write_chars (buffer, 8);
1348 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1349 literally. Note that compatibility with 3.2 is impossible,
1350 because the old floating-point emulator used a different
1351 format for REAL_VALUE_TYPE. */
1353 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1354 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1357 G.need_abi_warning = 1;
1361 /* Non-terminal <identifier>.
1363 <identifier> ::= </unqualified source code identifier> */
1366 write_identifier (const char *identifier)
1368 MANGLE_TRACE ("identifier", identifier);
1369 write_string (identifier);
1372 /* Handle constructor productions of non-terminal <special-name>.
1373 CTOR is a constructor FUNCTION_DECL.
1375 <special-name> ::= C1 # complete object constructor
1376 ::= C2 # base object constructor
1377 ::= C3 # complete object allocating constructor
1379 Currently, allocating constructors are never used.
1381 We also need to provide mangled names for the maybe-in-charge
1382 constructor, so we treat it here too. mangle_decl_string will
1383 append *INTERNAL* to that, to make sure we never emit it. */
1386 write_special_name_constructor (const tree ctor)
1388 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1389 write_string ("C2");
1392 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1393 /* Even though we don't ever emit a definition of
1394 the old-style destructor, we still have to
1395 consider entities (like static variables) nested
1397 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor));
1398 write_string ("C1");
1402 /* Handle destructor productions of non-terminal <special-name>.
1403 DTOR is a destructor FUNCTION_DECL.
1405 <special-name> ::= D0 # deleting (in-charge) destructor
1406 ::= D1 # complete object (in-charge) destructor
1407 ::= D2 # base object (not-in-charge) destructor
1409 We also need to provide mangled names for the maybe-incharge
1410 destructor, so we treat it here too. mangle_decl_string will
1411 append *INTERNAL* to that, to make sure we never emit it. */
1414 write_special_name_destructor (const tree dtor)
1416 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1417 write_string ("D0");
1418 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1419 write_string ("D2");
1422 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1423 /* Even though we don't ever emit a definition of
1424 the old-style destructor, we still have to
1425 consider entities (like static variables) nested
1427 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor));
1428 write_string ("D1");
1432 /* Return the discriminator for ENTITY appearing inside
1433 FUNCTION. The discriminator is the lexical ordinal of VAR among
1434 entities with the same name in the same FUNCTION. */
1437 discriminator_for_local_entity (tree entity)
1439 /* Assume this is the only local entity with this name. */
1440 int discriminator = 0;
1442 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1443 discriminator = DECL_DISCRIMINATOR (entity);
1444 else if (TREE_CODE (entity) == TYPE_DECL)
1448 /* Scan the list of local classes. */
1449 entity = TREE_TYPE (entity);
1450 for (ix = 0; ; ix++)
1452 tree type = VEC_index (tree, local_classes, ix);
1455 if (TYPE_IDENTIFIER (type) == TYPE_IDENTIFIER (entity)
1456 && TYPE_CONTEXT (type) == TYPE_CONTEXT (entity))
1461 return discriminator;
1464 /* Return the discriminator for STRING, a string literal used inside
1465 FUNCTION. The discriminator is the lexical ordinal of STRING among
1466 string literals used in FUNCTION. */
1469 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1470 tree string ATTRIBUTE_UNUSED)
1472 /* For now, we don't discriminate amongst string literals. */
1476 /* <discriminator> := _ <number>
1478 The discriminator is used only for the second and later occurrences
1479 of the same name within a single function. In this case <number> is
1480 n - 2, if this is the nth occurrence, in lexical order. */
1483 write_discriminator (const int discriminator)
1485 /* If discriminator is zero, don't write anything. Otherwise... */
1486 if (discriminator > 0)
1489 write_unsigned_number (discriminator - 1);
1493 /* Mangle the name of a function-scope entity. FUNCTION is the
1494 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1495 the entity itself. LOCAL_ENTITY is the entity that's directly
1496 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1499 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1500 := Z <function encoding> E s [<discriminator>] */
1503 write_local_name (const tree function, const tree local_entity,
1506 MANGLE_TRACE_TREE ("local-name", entity);
1509 write_encoding (function);
1511 if (TREE_CODE (entity) == STRING_CST)
1514 write_discriminator (discriminator_for_string_literal (function,
1519 /* Now the <entity name>. Let write_name know its being called
1520 from <local-name>, so it doesn't try to process the enclosing
1521 function scope again. */
1522 write_name (entity, /*ignore_local_scope=*/1);
1523 write_discriminator (discriminator_for_local_entity (local_entity));
1527 /* Non-terminals <type> and <CV-qualifier>.
1529 <type> ::= <builtin-type>
1531 ::= <class-enum-type>
1533 ::= <pointer-to-member-type>
1534 ::= <template-param>
1537 ::= P <type> # pointer-to
1538 ::= R <type> # reference-to
1539 ::= C <type> # complex pair (C 2000)
1540 ::= G <type> # imaginary (C 2000) [not supported]
1541 ::= U <source-name> <type> # vendor extended type qualifier
1545 <type> ::= RR <type> # rvalue reference-to
1546 <type> ::= Dt <expression> # decltype of an id-expression or
1547 # class member access
1548 <type> ::= DT <expression> # decltype of an expression
1550 TYPE is a type node. */
1553 write_type (tree type)
1555 /* This gets set to nonzero if TYPE turns out to be a (possibly
1556 CV-qualified) builtin type. */
1557 int is_builtin_type = 0;
1559 MANGLE_TRACE_TREE ("type", type);
1561 if (type == error_mark_node)
1564 if (find_substitution (type))
1567 if (write_CV_qualifiers_for_type (type) > 0)
1568 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1569 mangle the unqualified type. The recursive call is needed here
1570 since both the qualified and unqualified types are substitution
1572 write_type (TYPE_MAIN_VARIANT (type));
1573 else if (TREE_CODE (type) == ARRAY_TYPE)
1574 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1575 so that the cv-qualification of the element type is available
1576 in write_array_type. */
1577 write_array_type (type);
1580 tree type_orig = type;
1582 /* See through any typedefs. */
1583 type = TYPE_MAIN_VARIANT (type);
1585 if (TYPE_PTRMEM_P (type))
1586 write_pointer_to_member_type (type);
1589 /* Handle any target-specific fundamental types. */
1590 const char *target_mangling
1591 = targetm.mangle_type (type_orig);
1593 if (target_mangling)
1595 write_string (target_mangling);
1599 switch (TREE_CODE (type))
1603 case INTEGER_TYPE: /* Includes wchar_t. */
1606 /* If this is a typedef, TYPE may not be one of
1607 the standard builtin type nodes, but an alias of one. Use
1608 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1609 write_builtin_type (TYPE_MAIN_VARIANT (type));
1616 write_type (TREE_TYPE (type));
1621 write_function_type (type);
1627 /* A pointer-to-member function is represented as a special
1628 RECORD_TYPE, so check for this first. */
1629 if (TYPE_PTRMEMFUNC_P (type))
1630 write_pointer_to_member_type (type);
1632 write_class_enum_type (type);
1636 case UNBOUND_CLASS_TEMPLATE:
1637 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1638 ordinary nested names. */
1639 write_nested_name (TYPE_STUB_DECL (type));
1644 write_type (TREE_TYPE (type));
1647 case REFERENCE_TYPE:
1648 if (TYPE_REF_IS_RVALUE (type))
1651 write_type (TREE_TYPE (type));
1654 case TEMPLATE_TYPE_PARM:
1655 case TEMPLATE_PARM_INDEX:
1656 write_template_param (type);
1659 case TEMPLATE_TEMPLATE_PARM:
1660 write_template_template_param (type);
1663 case BOUND_TEMPLATE_TEMPLATE_PARM:
1664 write_template_template_param (type);
1666 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1670 write_string ("U8__vector");
1671 write_type (TREE_TYPE (type));
1674 case TYPE_PACK_EXPANSION:
1675 write_string ("U10__variadic");
1676 write_type (PACK_EXPANSION_PATTERN (type));
1681 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
1685 write_expression (DECLTYPE_TYPE_EXPR (type));
1695 /* Types other than builtin types are substitution candidates. */
1696 if (!is_builtin_type)
1697 add_substitution (type);
1700 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1701 CV-qualifiers written for TYPE.
1703 <CV-qualifiers> ::= [r] [V] [K] */
1706 write_CV_qualifiers_for_type (const tree type)
1708 int num_qualifiers = 0;
1710 /* The order is specified by:
1712 "In cases where multiple order-insensitive qualifiers are
1713 present, they should be ordered 'K' (closest to the base type),
1714 'V', 'r', and 'U' (farthest from the base type) ..."
1716 Note that we do not use cp_type_quals below; given "const
1717 int[3]", the "const" is emitted with the "int", not with the
1720 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1725 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1730 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1736 return num_qualifiers;
1739 /* Non-terminal <builtin-type>.
1741 <builtin-type> ::= v # void
1746 ::= h # unsigned char
1748 ::= t # unsigned short
1750 ::= j # unsigned int
1752 ::= m # unsigned long
1753 ::= x # long long, __int64
1754 ::= y # unsigned long long, __int64
1756 ::= o # unsigned __int128
1759 ::= e # long double, __float80
1760 ::= g # __float128 [not supported]
1761 ::= u <source-name> # vendor extended type */
1764 write_builtin_type (tree type)
1766 switch (TREE_CODE (type))
1777 /* TYPE may still be wchar_t, since that isn't in
1778 integer_type_nodes. */
1779 if (type == wchar_type_node)
1781 else if (TYPE_FOR_JAVA (type))
1782 write_java_integer_type_codes (type);
1786 /* Assume TYPE is one of the shared integer type nodes. Find
1787 it in the array of these nodes. */
1789 for (itk = 0; itk < itk_none; ++itk)
1790 if (type == integer_types[itk])
1792 /* Print the corresponding single-letter code. */
1793 write_char (integer_type_codes[itk]);
1797 if (itk == itk_none)
1799 tree t = c_common_type_for_mode (TYPE_MODE (type),
1800 TYPE_UNSIGNED (type));
1807 if (TYPE_PRECISION (type) == 128)
1808 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
1811 /* Allow for cases where TYPE is not one of the shared
1812 integer type nodes and write a "vendor extended builtin
1813 type" with a name the form intN or uintN, respectively.
1814 Situations like this can happen if you have an
1815 __attribute__((__mode__(__SI__))) type and use exotic
1816 switches like '-mint8' on AVR. Of course, this is
1817 undefined by the C++ ABI (and '-mint8' is not even
1818 Standard C conforming), but when using such special
1819 options you're pretty much in nowhere land anyway. */
1821 char prec[11]; /* up to ten digits for an unsigned */
1823 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
1824 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
1825 write_char ('u'); /* "vendor extended builtin type" */
1826 write_unsigned_number (strlen (prefix) + strlen (prec));
1827 write_string (prefix);
1828 write_string (prec);
1835 if (type == float_type_node
1836 || type == java_float_type_node)
1838 else if (type == double_type_node
1839 || type == java_double_type_node)
1841 else if (type == long_double_type_node)
1852 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1853 METHOD_TYPE. The return type is mangled before the parameter
1856 <function-type> ::= F [Y] <bare-function-type> E */
1859 write_function_type (const tree type)
1861 MANGLE_TRACE_TREE ("function-type", type);
1863 /* For a pointer to member function, the function type may have
1864 cv-qualifiers, indicating the quals for the artificial 'this'
1866 if (TREE_CODE (type) == METHOD_TYPE)
1868 /* The first parameter must be a POINTER_TYPE pointing to the
1869 `this' parameter. */
1870 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1871 write_CV_qualifiers_for_type (this_type);
1875 /* We don't track whether or not a type is `extern "C"'. Note that
1876 you can have an `extern "C"' function that does not have
1877 `extern "C"' type, and vice versa:
1879 extern "C" typedef void function_t();
1880 function_t f; // f has C++ linkage, but its type is
1883 typedef void function_t();
1884 extern "C" function_t f; // Vice versa.
1887 write_bare_function_type (type, /*include_return_type_p=*/1,
1892 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1893 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1894 is mangled before the parameter types. If non-NULL, DECL is
1895 FUNCTION_DECL for the function whose type is being emitted.
1897 If DECL is a member of a Java type, then a literal 'J'
1898 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
1901 <bare-function-type> ::= [J]</signature/ type>+ */
1904 write_bare_function_type (const tree type, const int include_return_type_p,
1909 MANGLE_TRACE_TREE ("bare-function-type", type);
1911 /* Detect Java methods and emit special encoding. */
1913 && DECL_FUNCTION_MEMBER_P (decl)
1914 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
1915 && !DECL_CONSTRUCTOR_P (decl)
1916 && !DECL_DESTRUCTOR_P (decl)
1917 && !DECL_CONV_FN_P (decl))
1927 /* Mangle the return type, if requested. */
1928 if (include_return_type_p || java_method_p)
1929 write_type (TREE_TYPE (type));
1931 /* Now mangle the types of the arguments. */
1932 write_method_parms (TYPE_ARG_TYPES (type),
1933 TREE_CODE (type) == METHOD_TYPE,
1937 /* Write the mangled representation of a method parameter list of
1938 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1939 considered a non-static method, and the this parameter is omitted.
1940 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1941 parameters are being emitted. */
1944 write_method_parms (tree parm_types, const int method_p, const tree decl)
1946 tree first_parm_type;
1947 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1949 /* Assume this parameter type list is variable-length. If it ends
1950 with a void type, then it's not. */
1953 /* If this is a member function, skip the first arg, which is the
1955 "Member functions do not encode the type of their implicit this
1958 Similarly, there's no need to mangle artificial parameters, like
1959 the VTT parameters for constructors and destructors. */
1962 parm_types = TREE_CHAIN (parm_types);
1963 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1965 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1967 parm_types = TREE_CHAIN (parm_types);
1968 parm_decl = TREE_CHAIN (parm_decl);
1972 for (first_parm_type = parm_types;
1974 parm_types = TREE_CHAIN (parm_types))
1976 tree parm = TREE_VALUE (parm_types);
1977 if (parm == void_type_node)
1979 /* "Empty parameter lists, whether declared as () or
1980 conventionally as (void), are encoded with a void parameter
1982 if (parm_types == first_parm_type)
1984 /* If the parm list is terminated with a void type, it's
1987 /* A void type better be the last one. */
1988 gcc_assert (TREE_CHAIN (parm_types) == NULL);
1995 /* <builtin-type> ::= z # ellipsis */
1999 /* <class-enum-type> ::= <name> */
2002 write_class_enum_type (const tree type)
2004 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
2007 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2010 <template-args> ::= I <template-arg>+ E */
2013 write_template_args (tree args)
2016 int length = TREE_VEC_LENGTH (args);
2018 MANGLE_TRACE_TREE ("template-args", args);
2022 gcc_assert (length > 0);
2024 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
2026 /* We have nested template args. We want the innermost template
2028 args = TREE_VEC_ELT (args, length - 1);
2029 length = TREE_VEC_LENGTH (args);
2031 for (i = 0; i < length; ++i)
2032 write_template_arg (TREE_VEC_ELT (args, i));
2037 /* <expression> ::= <unary operator-name> <expression>
2038 ::= <binary operator-name> <expression> <expression>
2041 <expr-primary> ::= <template-param>
2042 ::= L <type> <value number> E # literal
2043 ::= L <mangled-name> E # external name
2044 ::= sr <type> <unqualified-name>
2045 ::= sr <type> <unqualified-name> <template-args> */
2048 write_expression (tree expr)
2050 enum tree_code code;
2052 code = TREE_CODE (expr);
2054 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2055 is converted (via qualification conversions) to another
2057 while (TREE_CODE (expr) == NOP_EXPR
2058 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2060 expr = TREE_OPERAND (expr, 0);
2061 code = TREE_CODE (expr);
2064 if (code == BASELINK)
2066 expr = BASELINK_FUNCTIONS (expr);
2067 code = TREE_CODE (expr);
2070 /* Handle pointers-to-members by making them look like expression
2072 if (code == PTRMEM_CST)
2074 expr = build_nt (ADDR_EXPR,
2075 build_qualified_name (/*type=*/NULL_TREE,
2076 PTRMEM_CST_CLASS (expr),
2077 PTRMEM_CST_MEMBER (expr),
2078 /*template_p=*/false));
2079 code = TREE_CODE (expr);
2082 /* Handle template parameters. */
2083 if (code == TEMPLATE_TYPE_PARM
2084 || code == TEMPLATE_TEMPLATE_PARM
2085 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2086 || code == TEMPLATE_PARM_INDEX)
2087 write_template_param (expr);
2088 /* Handle literals. */
2089 else if (TREE_CODE_CLASS (code) == tcc_constant
2090 || (abi_version_at_least (2) && code == CONST_DECL))
2091 write_template_arg_literal (expr);
2092 else if (DECL_P (expr))
2094 /* G++ 3.2 incorrectly mangled non-type template arguments of
2095 enumeration type using their names. */
2096 if (code == CONST_DECL)
2097 G.need_abi_warning = 1;
2099 write_mangled_name (expr, false);
2102 else if (TREE_CODE (expr) == SIZEOF_EXPR
2103 && TYPE_P (TREE_OPERAND (expr, 0)))
2105 write_string ("st");
2106 write_type (TREE_OPERAND (expr, 0));
2108 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
2110 tree scope = TREE_OPERAND (expr, 0);
2111 tree member = TREE_OPERAND (expr, 1);
2113 /* If the MEMBER is a real declaration, then the qualifying
2114 scope was not dependent. Ideally, we would not have a
2115 SCOPE_REF in those cases, but sometimes we do. If the second
2116 argument is a DECL, then the name must not have been
2118 if (DECL_P (member))
2119 write_expression (member);
2124 write_string ("sr");
2126 /* If MEMBER is a template-id, separate the template
2127 from the arguments. */
2128 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2130 template_args = TREE_OPERAND (member, 1);
2131 member = TREE_OPERAND (member, 0);
2134 template_args = NULL_TREE;
2135 /* Write out the name of the MEMBER. */
2136 if (IDENTIFIER_TYPENAME_P (member))
2137 write_conversion_operator_name (TREE_TYPE (member));
2138 else if (IDENTIFIER_OPNAME_P (member))
2141 const char *mangled_name = NULL;
2143 /* Unfortunately, there is no easy way to go from the
2144 name of the operator back to the corresponding tree
2146 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
2147 if (operator_name_info[i].identifier == member)
2149 /* The ABI says that we prefer binary operator
2150 names to unary operator names. */
2151 if (operator_name_info[i].arity == 2)
2153 mangled_name = operator_name_info[i].mangled_name;
2156 else if (!mangled_name)
2157 mangled_name = operator_name_info[i].mangled_name;
2159 else if (assignment_operator_name_info[i].identifier
2163 = assignment_operator_name_info[i].mangled_name;
2166 write_string (mangled_name);
2169 write_source_name (member);
2170 /* Write out the template arguments. */
2172 write_template_args (template_args);
2179 /* When we bind a variable or function to a non-type template
2180 argument with reference type, we create an ADDR_EXPR to show
2181 the fact that the entity's address has been taken. But, we
2182 don't actually want to output a mangling code for the `&'. */
2183 if (TREE_CODE (expr) == ADDR_EXPR
2185 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2187 expr = TREE_OPERAND (expr, 0);
2190 write_expression (expr);
2194 code = TREE_CODE (expr);
2197 /* If it wasn't any of those, recursively expand the expression. */
2198 write_string (operator_name_info[(int) code].mangled_name);
2203 sorry ("call_expr cannot be mangled due to a defect in the C++ ABI");
2207 write_type (TREE_TYPE (expr));
2208 /* There is no way to mangle a zero-operand cast like
2210 if (!TREE_OPERAND (expr, 0))
2211 sorry ("zero-operand casts cannot be mangled due to a defect "
2214 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2217 case STATIC_CAST_EXPR:
2218 case CONST_CAST_EXPR:
2219 write_type (TREE_TYPE (expr));
2220 write_expression (TREE_OPERAND (expr, 0));
2224 /* Handle pointers-to-members specially. */
2226 write_type (TREE_OPERAND (expr, 0));
2227 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2228 write_source_name (TREE_OPERAND (expr, 1));
2229 else if (TREE_CODE (TREE_OPERAND (expr, 1)) == TEMPLATE_ID_EXPR)
2234 template_id = TREE_OPERAND (expr, 1);
2235 name = TREE_OPERAND (template_id, 0);
2236 /* FIXME: What about operators? */
2237 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
2238 write_source_name (TREE_OPERAND (template_id, 0));
2239 write_template_args (TREE_OPERAND (template_id, 1));
2243 /* G++ 3.2 incorrectly put out both the "sr" code and
2244 the nested name of the qualified name. */
2245 G.need_abi_warning = 1;
2246 write_encoding (TREE_OPERAND (expr, 1));
2251 for (i = 0; i < TREE_OPERAND_LENGTH (expr); ++i)
2253 tree operand = TREE_OPERAND (expr, i);
2254 /* As a GNU extension, the middle operand of a
2255 conditional may be omitted. Since expression
2256 manglings are supposed to represent the input token
2257 stream, there's no good way to mangle such an
2258 expression without extending the C++ ABI. */
2259 if (code == COND_EXPR && i == 1 && !operand)
2261 error ("omitted middle operand to %<?:%> operand "
2262 "cannot be mangled");
2265 write_expression (operand);
2271 /* Literal subcase of non-terminal <template-arg>.
2273 "Literal arguments, e.g. "A<42L>", are encoded with their type
2274 and value. Negative integer values are preceded with "n"; for
2275 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2276 encoded as 0, true as 1." */
2279 write_template_arg_literal (const tree value)
2282 write_type (TREE_TYPE (value));
2284 switch (TREE_CODE (value))
2287 write_integer_cst (DECL_INITIAL (value));
2291 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
2292 || integer_zerop (value) || integer_onep (value));
2293 write_integer_cst (value);
2297 write_real_cst (value);
2307 /* Non-terminal <template-arg>.
2309 <template-arg> ::= <type> # type
2310 ::= L <type> </value/ number> E # literal
2311 ::= LZ <name> E # external name
2312 ::= X <expression> E # expression */
2315 write_template_arg (tree node)
2317 enum tree_code code = TREE_CODE (node);
2319 MANGLE_TRACE_TREE ("template-arg", node);
2321 /* A template template parameter's argument list contains TREE_LIST
2322 nodes of which the value field is the actual argument. */
2323 if (code == TREE_LIST)
2325 node = TREE_VALUE (node);
2326 /* If it's a decl, deal with its type instead. */
2329 node = TREE_TYPE (node);
2330 code = TREE_CODE (node);
2334 if (TREE_CODE (node) == NOP_EXPR
2335 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
2337 /* Template parameters can be of reference type. To maintain
2338 internal consistency, such arguments use a conversion from
2339 address of object to reference type. */
2340 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
2341 if (abi_version_at_least (2))
2342 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
2344 G.need_abi_warning = 1;
2347 if (ARGUMENT_PACK_P (node))
2349 /* Expand the template argument pack. */
2350 tree args = ARGUMENT_PACK_ARGS (node);
2351 int i, length = TREE_VEC_LENGTH (args);
2352 for (i = 0; i < length; ++i)
2353 write_template_arg (TREE_VEC_ELT (args, i));
2355 else if (TYPE_P (node))
2357 else if (code == TEMPLATE_DECL)
2358 /* A template appearing as a template arg is a template template arg. */
2359 write_template_template_arg (node);
2360 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
2361 || (abi_version_at_least (2) && code == CONST_DECL))
2362 write_template_arg_literal (node);
2363 else if (DECL_P (node))
2365 /* Until ABI version 2, non-type template arguments of
2366 enumeration type were mangled using their names. */
2367 if (code == CONST_DECL && !abi_version_at_least (2))
2368 G.need_abi_warning = 1;
2370 /* Until ABI version 3, the underscore before the mangled name
2371 was incorrectly omitted. */
2372 if (!abi_version_at_least (3))
2374 G.need_abi_warning = 1;
2378 write_string ("_Z");
2379 write_encoding (node);
2384 /* Template arguments may be expressions. */
2386 write_expression (node);
2391 /* <template-template-arg>
2393 ::= <substitution> */
2396 write_template_template_arg (const tree decl)
2398 MANGLE_TRACE_TREE ("template-template-arg", decl);
2400 if (find_substitution (decl))
2402 write_name (decl, /*ignore_local_scope=*/0);
2403 add_substitution (decl);
2407 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2409 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2410 ::= A <expression> _ </element/ type>
2412 "Array types encode the dimension (number of elements) and the
2413 element type. For variable length arrays, the dimension (but not
2414 the '_' separator) is omitted." */
2417 write_array_type (const tree type)
2420 if (TYPE_DOMAIN (type))
2425 index_type = TYPE_DOMAIN (type);
2426 /* The INDEX_TYPE gives the upper and lower bounds of the
2428 max = TYPE_MAX_VALUE (index_type);
2429 if (TREE_CODE (max) == INTEGER_CST)
2431 /* The ABI specifies that we should mangle the number of
2432 elements in the array, not the largest allowed index. */
2433 max = size_binop (PLUS_EXPR, max, size_one_node);
2434 write_unsigned_number (tree_low_cst (max, 1));
2438 max = TREE_OPERAND (max, 0);
2439 if (!abi_version_at_least (2))
2441 /* value_dependent_expression_p presumes nothing is
2442 dependent when PROCESSING_TEMPLATE_DECL is zero. */
2443 ++processing_template_decl;
2444 if (!value_dependent_expression_p (max))
2445 G.need_abi_warning = 1;
2446 --processing_template_decl;
2448 write_expression (max);
2453 write_type (TREE_TYPE (type));
2456 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2457 variables. TYPE is a pointer-to-member POINTER_TYPE.
2459 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2462 write_pointer_to_member_type (const tree type)
2465 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2466 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2469 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2470 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2471 TEMPLATE_PARM_INDEX.
2473 <template-param> ::= T </parameter/ number> _ */
2476 write_template_param (const tree parm)
2480 tree parm_type = NULL_TREE;
2482 MANGLE_TRACE_TREE ("template-parm", parm);
2484 switch (TREE_CODE (parm))
2486 case TEMPLATE_TYPE_PARM:
2487 case TEMPLATE_TEMPLATE_PARM:
2488 case BOUND_TEMPLATE_TEMPLATE_PARM:
2489 parm_index = TEMPLATE_TYPE_IDX (parm);
2490 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2493 case TEMPLATE_PARM_INDEX:
2494 parm_index = TEMPLATE_PARM_IDX (parm);
2495 parm_level = TEMPLATE_PARM_LEVEL (parm);
2496 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2504 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2505 earliest template param denoted by `_'. */
2507 write_unsigned_number (parm_index - 1);
2511 /* <template-template-param>
2512 ::= <template-param>
2513 ::= <substitution> */
2516 write_template_template_param (const tree parm)
2518 tree template = NULL_TREE;
2520 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2521 template template parameter. The substitution candidate here is
2522 only the template. */
2523 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2526 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2527 if (find_substitution (template))
2531 /* <template-param> encodes only the template parameter position,
2532 not its template arguments, which is fine here. */
2533 write_template_param (parm);
2535 add_substitution (template);
2538 /* Non-terminal <substitution>.
2540 <substitution> ::= S <seq-id> _
2544 write_substitution (const int seq_id)
2546 MANGLE_TRACE ("substitution", "");
2550 write_number (seq_id - 1, /*unsigned=*/1, 36);
2554 /* Start mangling ENTITY. */
2557 start_mangling (const tree entity, const bool ident_p)
2560 G.need_abi_warning = false;
2563 obstack_free (&name_obstack, name_base);
2564 mangle_obstack = &name_obstack;
2565 name_base = obstack_alloc (&name_obstack, 0);
2568 mangle_obstack = &ident_hash->stack;
2571 /* Done with mangling. Return the generated mangled name. If WARN is
2572 true, and the name of G.entity will be mangled differently in a
2573 future version of the ABI, issue a warning. */
2575 static inline const char *
2576 finish_mangling (const bool warn)
2578 if (warn_abi && warn && G.need_abi_warning)
2579 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
2583 /* Clear all the substitutions. */
2584 VEC_truncate (tree, G.substitutions, 0);
2586 /* Null-terminate the string. */
2589 return (const char *) obstack_finish (mangle_obstack);
2592 /* Initialize data structures for mangling. */
2597 gcc_obstack_init (&name_obstack);
2598 name_base = obstack_alloc (&name_obstack, 0);
2599 G.substitutions = NULL;
2601 /* Cache these identifiers for quick comparison when checking for
2602 standard substitutions. */
2603 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2604 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2605 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2606 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2607 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2608 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2611 /* Generate the mangled name of DECL. */
2614 mangle_decl_string (const tree decl)
2618 start_mangling (decl, /*ident_p=*/true);
2620 if (TREE_CODE (decl) == TYPE_DECL)
2621 write_type (TREE_TYPE (decl));
2623 write_mangled_name (decl, true);
2625 result = finish_mangling (/*warn=*/true);
2627 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2631 /* Like get_identifier, except that NAME is assumed to have been
2632 allocated on the obstack used by the identifier hash table. */
2635 get_identifier_nocopy (const char *name)
2637 hashnode ht_node = ht_lookup (ident_hash, (const unsigned char *) name,
2638 strlen (name), HT_ALLOCED);
2639 return HT_IDENT_TO_GCC_IDENT (ht_node);
2642 /* Create an identifier for the external mangled name of DECL. */
2645 mangle_decl (const tree decl)
2647 tree id = get_identifier_nocopy (mangle_decl_string (decl));
2648 id = targetm.mangle_decl_assembler_name (decl, id);
2649 SET_DECL_ASSEMBLER_NAME (decl, id);
2652 /* Generate the mangled representation of TYPE. */
2655 mangle_type_string (const tree type)
2659 start_mangling (type, /*ident_p=*/false);
2661 result = finish_mangling (/*warn=*/false);
2663 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2667 /* Create an identifier for the mangled name of a special component
2668 for belonging to TYPE. CODE is the ABI-specified code for this
2672 mangle_special_for_type (const tree type, const char *code)
2676 /* We don't have an actual decl here for the special component, so
2677 we can't just process the <encoded-name>. Instead, fake it. */
2678 start_mangling (type, /*ident_p=*/true);
2680 /* Start the mangling. */
2681 write_string ("_Z");
2682 write_string (code);
2686 result = finish_mangling (/*warn=*/false);
2689 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2691 return get_identifier_nocopy (result);
2694 /* Create an identifier for the mangled representation of the typeinfo
2695 structure for TYPE. */
2698 mangle_typeinfo_for_type (const tree type)
2700 return mangle_special_for_type (type, "TI");
2703 /* Create an identifier for the mangled name of the NTBS containing
2704 the mangled name of TYPE. */
2707 mangle_typeinfo_string_for_type (const tree type)
2709 return mangle_special_for_type (type, "TS");
2712 /* Create an identifier for the mangled name of the vtable for TYPE. */
2715 mangle_vtbl_for_type (const tree type)
2717 return mangle_special_for_type (type, "TV");
2720 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2723 mangle_vtt_for_type (const tree type)
2725 return mangle_special_for_type (type, "TT");
2728 /* Return an identifier for a construction vtable group. TYPE is
2729 the most derived class in the hierarchy; BINFO is the base
2730 subobject for which this construction vtable group will be used.
2732 This mangling isn't part of the ABI specification; in the ABI
2733 specification, the vtable group is dumped in the same COMDAT as the
2734 main vtable, and is referenced only from that vtable, so it doesn't
2735 need an external name. For binary formats without COMDAT sections,
2736 though, we need external names for the vtable groups.
2738 We use the production
2740 <special-name> ::= CT <type> <offset number> _ <base type> */
2743 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2747 start_mangling (type, /*ident_p=*/true);
2749 write_string ("_Z");
2750 write_string ("TC");
2752 write_integer_cst (BINFO_OFFSET (binfo));
2754 write_type (BINFO_TYPE (binfo));
2756 result = finish_mangling (/*warn=*/false);
2758 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2759 return get_identifier_nocopy (result);
2762 /* Mangle a this pointer or result pointer adjustment.
2764 <call-offset> ::= h <fixed offset number> _
2765 ::= v <fixed offset number> _ <virtual offset number> _ */
2768 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2770 write_char (virtual_offset ? 'v' : 'h');
2772 /* For either flavor, write the fixed offset. */
2773 write_integer_cst (fixed_offset);
2776 /* For a virtual thunk, add the virtual offset. */
2779 write_integer_cst (virtual_offset);
2784 /* Return an identifier for the mangled name of a this-adjusting or
2785 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2786 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2787 is a virtual thunk, and it is the vtbl offset in
2788 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2789 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2790 thunk itself. A covariant thunk name always includes the adjustment
2791 for the this pointer, even if there is none.
2793 <special-name> ::= T <call-offset> <base encoding>
2794 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2798 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2799 tree virtual_offset)
2803 start_mangling (fn_decl, /*ident_p=*/true);
2805 write_string ("_Z");
2808 if (!this_adjusting)
2810 /* Covariant thunk with no this adjustment */
2812 mangle_call_offset (integer_zero_node, NULL_TREE);
2813 mangle_call_offset (fixed_offset, virtual_offset);
2815 else if (!DECL_THUNK_P (fn_decl))
2816 /* Plain this adjusting thunk. */
2817 mangle_call_offset (fixed_offset, virtual_offset);
2820 /* This adjusting thunk to covariant thunk. */
2822 mangle_call_offset (fixed_offset, virtual_offset);
2823 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2824 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2826 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2827 mangle_call_offset (fixed_offset, virtual_offset);
2828 fn_decl = THUNK_TARGET (fn_decl);
2832 write_encoding (fn_decl);
2834 result = finish_mangling (/*warn=*/false);
2836 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2837 return get_identifier_nocopy (result);
2840 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2841 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
2844 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
2846 /* Hash a node (VAL1) in the table. */
2849 hash_type (const void *val)
2851 return (hashval_t) TYPE_UID (TREE_TYPE ((const_tree) val));
2854 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2857 compare_type (const void *val1, const void *val2)
2859 return TREE_TYPE ((const_tree) val1) == (const_tree) val2;
2862 /* Return an identifier for the mangled unqualified name for a
2863 conversion operator to TYPE. This mangling is not specified by the
2864 ABI spec; it is only used internally. */
2867 mangle_conv_op_name_for_type (const tree type)
2872 if (type == error_mark_node)
2873 return error_mark_node;
2875 if (conv_type_names == NULL)
2876 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
2878 slot = htab_find_slot_with_hash (conv_type_names, type,
2879 (hashval_t) TYPE_UID (type), INSERT);
2880 identifier = (tree)*slot;
2885 /* Create a unique name corresponding to TYPE. */
2886 sprintf (buffer, "operator %lu",
2887 (unsigned long) htab_elements (conv_type_names));
2888 identifier = get_identifier (buffer);
2891 /* Hang TYPE off the identifier so it can be found easily later
2892 when performing conversions. */
2893 TREE_TYPE (identifier) = type;
2895 /* Set bits on the identifier so we know later it's a conversion. */
2896 IDENTIFIER_OPNAME_P (identifier) = 1;
2897 IDENTIFIER_TYPENAME_P (identifier) = 1;
2903 /* Return an identifier for the name of an initialization guard
2904 variable for indicated VARIABLE. */
2907 mangle_guard_variable (const tree variable)
2909 start_mangling (variable, /*ident_p=*/true);
2910 write_string ("_ZGV");
2911 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2912 /* The name of a guard variable for a reference temporary should refer
2913 to the reference, not the temporary. */
2914 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2916 write_name (variable, /*ignore_local_scope=*/0);
2917 return get_identifier_nocopy (finish_mangling (/*warn=*/false));
2920 /* Return an identifier for the name of a temporary variable used to
2921 initialize a static reference. This isn't part of the ABI, but we might
2922 as well call them something readable. */
2925 mangle_ref_init_variable (const tree variable)
2927 start_mangling (variable, /*ident_p=*/true);
2928 write_string ("_ZGR");
2929 write_name (variable, /*ignore_local_scope=*/0);
2930 return get_identifier_nocopy (finish_mangling (/*warn=*/false));
2934 /* Foreign language type mangling section. */
2936 /* How to write the type codes for the integer Java type. */
2939 write_java_integer_type_codes (const tree type)
2941 if (type == java_int_type_node)
2943 else if (type == java_short_type_node)
2945 else if (type == java_byte_type_node)
2947 else if (type == java_char_type_node)
2949 else if (type == java_long_type_node)
2951 else if (type == java_boolean_type_node)
2957 #include "gt-cp-mangle.h"