1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
3 Written by Alex Samuel <sameul@codesourcery.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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
52 #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. */
96 /* The name in which we're building the mangled name. */
97 struct obstack name_obstack;
99 /* An array of the current substitution candidates, in the order
101 varray_type substitutions;
103 /* The entity that is being mangled. */
106 /* True if the mangling will be different in a future version of the
108 bool need_abi_warning;
111 /* Indices into subst_identifiers. These are identifiers used in
112 special substitution rules. */
120 SUBID_BASIC_IOSTREAM,
123 substitution_identifier_index_t;
125 /* For quick substitution checks, look up these common identifiers
127 static GTY(()) tree subst_identifiers[SUBID_MAX];
129 /* Single-letter codes for builtin integer types, defined in
130 <builtin-type>. These are indexed by integer_type_kind values. */
132 integer_type_codes[itk_none] =
135 'a', /* itk_signed_char */
136 'h', /* itk_unsigned_char */
138 't', /* itk_unsigned_short */
140 'j', /* itk_unsigned_int */
142 'm', /* itk_unsigned_long */
143 'x', /* itk_long_long */
144 'y' /* itk_unsigned_long_long */
147 static int decl_is_template_id (const tree, tree* const);
149 /* Functions for handling substitutions. */
151 static inline tree canonicalize_for_substitution (tree);
152 static void add_substitution (tree);
153 static inline int is_std_substitution (const tree,
154 const substitution_identifier_index_t);
155 static inline int is_std_substitution_char (const tree,
156 const substitution_identifier_index_t);
157 static int find_substitution (tree);
158 static void mangle_call_offset (const tree, const tree);
160 /* Functions for emitting mangled representations of things. */
162 static void write_mangled_name (const tree, bool);
163 static void write_encoding (const tree);
164 static void write_name (tree, const int);
165 static void write_unscoped_name (const tree);
166 static void write_unscoped_template_name (const tree);
167 static void write_nested_name (const tree);
168 static void write_prefix (const tree);
169 static void write_template_prefix (const tree);
170 static void write_unqualified_name (const tree);
171 static void write_conversion_operator_name (const tree);
172 static void write_source_name (tree);
173 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
175 static void write_number (unsigned HOST_WIDE_INT, const int,
177 static void write_integer_cst (const tree);
178 static void write_real_cst (const tree);
179 static void write_identifier (const char *);
180 static void write_special_name_constructor (const tree);
181 static void write_special_name_destructor (const tree);
182 static void write_type (tree);
183 static int write_CV_qualifiers_for_type (const tree);
184 static void write_builtin_type (tree);
185 static void write_function_type (const tree);
186 static void write_bare_function_type (const tree, const int, const tree);
187 static void write_method_parms (tree, const int, const tree);
188 static void write_class_enum_type (const tree);
189 static void write_template_args (tree);
190 static void write_expression (tree);
191 static void write_template_arg_literal (const tree);
192 static void write_template_arg (tree);
193 static void write_template_template_arg (const tree);
194 static void write_array_type (const tree);
195 static void write_pointer_to_member_type (const tree);
196 static void write_template_param (const tree);
197 static void write_template_template_param (const tree);
198 static void write_substitution (const int);
199 static int discriminator_for_local_entity (tree);
200 static int discriminator_for_string_literal (tree, tree);
201 static void write_discriminator (const int);
202 static void write_local_name (const tree, const tree, const tree);
203 static void dump_substitution_candidates (void);
204 static const char *mangle_decl_string (const tree);
206 /* Control functions. */
208 static inline void start_mangling (const tree);
209 static inline const char *finish_mangling (const bool);
210 static tree mangle_special_for_type (const tree, const char *);
212 /* Foreign language functions. */
214 static void write_java_integer_type_codes (const tree);
216 /* Append a single character to the end of the mangled
218 #define write_char(CHAR) \
219 obstack_1grow (&G.name_obstack, (CHAR))
221 /* Append a sized buffer to the end of the mangled representation. */
222 #define write_chars(CHAR, LEN) \
223 obstack_grow (&G.name_obstack, (CHAR), (LEN))
225 /* Append a NUL-terminated string to the end of the mangled
227 #define write_string(STRING) \
228 obstack_grow (&G.name_obstack, (STRING), strlen (STRING))
230 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
231 same purpose (context, which may be a type) and value (template
232 decl). See write_template_prefix for more information on what this
234 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
235 (TREE_CODE (NODE1) == TREE_LIST \
236 && TREE_CODE (NODE2) == TREE_LIST \
237 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
238 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2)))\
239 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
240 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
242 /* Write out an unsigned quantity in base 10. */
243 #define write_unsigned_number(NUMBER) \
244 write_number ((NUMBER), /*unsigned_p=*/1, 10)
246 /* If DECL is a template instance, return nonzero and, if
247 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
248 Otherwise return zero. */
251 decl_is_template_id (const tree decl, tree* const template_info)
253 if (TREE_CODE (decl) == TYPE_DECL)
255 /* TYPE_DECLs are handled specially. Look at its type to decide
256 if this is a template instantiation. */
257 const tree type = TREE_TYPE (decl);
259 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
261 if (template_info != NULL)
262 /* For a templated TYPE_DECL, the template info is hanging
264 *template_info = TYPE_TEMPLATE_INFO (type);
270 /* Check if this is a primary template. */
271 if (DECL_LANG_SPECIFIC (decl) != NULL
272 && DECL_USE_TEMPLATE (decl)
273 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
274 && TREE_CODE (decl) != TEMPLATE_DECL)
276 if (template_info != NULL)
277 /* For most templated decls, the template info is hanging
279 *template_info = DECL_TEMPLATE_INFO (decl);
284 /* It's not a template id. */
288 /* Produce debugging output of current substitution candidates. */
291 dump_substitution_candidates (void)
295 fprintf (stderr, " ++ substitutions ");
296 for (i = 0; i < VARRAY_ACTIVE_SIZE (G.substitutions); ++i)
298 tree el = VARRAY_TREE (G.substitutions, i);
299 const char *name = "???";
302 fprintf (stderr, " ");
304 name = IDENTIFIER_POINTER (DECL_NAME (el));
305 else if (TREE_CODE (el) == TREE_LIST)
306 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
307 else if (TYPE_NAME (el))
308 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
309 fprintf (stderr, " S%d_ = ", i - 1);
311 (CP_TYPE_RESTRICT_P (el)
312 || CP_TYPE_VOLATILE_P (el)
313 || CP_TYPE_CONST_P (el)))
314 fprintf (stderr, "CV-");
315 fprintf (stderr, "%s (%s at %p)\n",
316 name, tree_code_name[TREE_CODE (el)], (void *) el);
320 /* Both decls and types can be substitution candidates, but sometimes
321 they refer to the same thing. For instance, a TYPE_DECL and
322 RECORD_TYPE for the same class refer to the same thing, and should
323 be treated accordingly in substitutions. This function returns a
324 canonicalized tree node representing NODE that is used when adding
325 and substitution candidates and finding matches. */
328 canonicalize_for_substitution (tree node)
330 /* For a TYPE_DECL, use the type instead. */
331 if (TREE_CODE (node) == TYPE_DECL)
332 node = TREE_TYPE (node);
334 node = canonical_type_variant (node);
339 /* Add NODE as a substitution candidate. NODE must not already be on
340 the list of candidates. */
343 add_substitution (tree node)
348 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
349 tree_code_name[TREE_CODE (node)], (void *) node);
351 /* Get the canonicalized substitution candidate for NODE. */
352 c = canonicalize_for_substitution (node);
353 if (DEBUG_MANGLE && c != node)
354 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
355 tree_code_name[TREE_CODE (node)], (void *) node);
359 /* Make sure NODE isn't already a candidate. */
362 for (i = VARRAY_ACTIVE_SIZE (G.substitutions); --i >= 0; )
364 const tree candidate = VARRAY_TREE (G.substitutions, i);
366 && node == candidate)
368 && TYPE_P (candidate)
369 && same_type_p (node, candidate)))
373 #endif /* ENABLE_CHECKING */
375 /* Put the decl onto the varray of substitution candidates. */
376 VARRAY_PUSH_TREE (G.substitutions, node);
379 dump_substitution_candidates ();
382 /* Helper function for find_substitution. Returns nonzero if NODE,
383 which may be a decl or a CLASS_TYPE, is a template-id with template
384 name of substitution_index[INDEX] in the ::std namespace. */
387 is_std_substitution (const tree node,
388 const substitution_identifier_index_t index)
395 type = TREE_TYPE (node);
398 else if (CLASS_TYPE_P (node))
401 decl = TYPE_NAME (node);
404 /* These are not the droids you're looking for. */
407 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
408 && TYPE_LANG_SPECIFIC (type)
409 && TYPE_TEMPLATE_INFO (type)
410 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
411 == subst_identifiers[index]));
414 /* Helper function for find_substitution. Returns nonzero if NODE,
415 which may be a decl or a CLASS_TYPE, is the template-id
416 ::std::identifier<char>, where identifier is
417 substitution_index[INDEX]. */
420 is_std_substitution_char (const tree node,
421 const substitution_identifier_index_t index)
424 /* Check NODE's name is ::std::identifier. */
425 if (!is_std_substitution (node, index))
427 /* Figure out its template args. */
429 args = DECL_TI_ARGS (node);
430 else if (CLASS_TYPE_P (node))
431 args = CLASSTYPE_TI_ARGS (node);
433 /* Oops, not a template. */
435 /* NODE's template arg list should be <char>. */
437 TREE_VEC_LENGTH (args) == 1
438 && TREE_VEC_ELT (args, 0) == char_type_node;
441 /* Check whether a substitution should be used to represent NODE in
444 First, check standard special-case substitutions.
446 <substitution> ::= St
453 # ::std::basic_string
456 # ::std::basic_string<char,
457 ::std::char_traits<char>,
458 ::std::allocator<char> >
461 # ::std::basic_istream<char, ::std::char_traits<char> >
464 # ::std::basic_ostream<char, ::std::char_traits<char> >
467 # ::std::basic_iostream<char, ::std::char_traits<char> >
469 Then examine the stack of currently available substitution
470 candidates for entities appearing earlier in the same mangling
472 If a substitution is found, write its mangled representation and
473 return nonzero. If none is found, just return zero. */
476 find_substitution (tree node)
479 const int size = VARRAY_ACTIVE_SIZE (G.substitutions);
484 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
485 tree_code_name[TREE_CODE (node)], (void *) node);
487 /* Obtain the canonicalized substitution representation for NODE.
488 This is what we'll compare against. */
489 node = canonicalize_for_substitution (node);
491 /* Check for builtin substitutions. */
493 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
494 type = TYPE_P (node) ? node : TREE_TYPE (node);
496 /* Check for std::allocator. */
498 && is_std_substitution (decl, SUBID_ALLOCATOR)
499 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
505 /* Check for std::basic_string. */
506 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
510 /* If this is a type (i.e. a fully-qualified template-id),
512 std::basic_string <char,
513 std::char_traits<char>,
514 std::allocator<char> > . */
515 if (cp_type_quals (type) == TYPE_UNQUALIFIED
516 && CLASSTYPE_USE_TEMPLATE (type))
518 tree args = CLASSTYPE_TI_ARGS (type);
519 if (TREE_VEC_LENGTH (args) == 3
520 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
521 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
523 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
532 /* Substitute for the template name only if this isn't a type. */
539 /* Check for basic_{i,o,io}stream. */
541 && cp_type_quals (type) == TYPE_UNQUALIFIED
542 && CLASS_TYPE_P (type)
543 && CLASSTYPE_USE_TEMPLATE (type)
544 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
546 /* First, check for the template
547 args <char, std::char_traits<char> > . */
548 tree args = CLASSTYPE_TI_ARGS (type);
549 if (TREE_VEC_LENGTH (args) == 2
550 && TYPE_P (TREE_VEC_ELT (args, 0))
551 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
552 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
555 /* Got them. Is this basic_istream? */
556 tree name = DECL_NAME (CLASSTYPE_TI_TEMPLATE (type));
557 if (name == subst_identifiers[SUBID_BASIC_ISTREAM])
562 /* Or basic_ostream? */
563 else if (name == subst_identifiers[SUBID_BASIC_OSTREAM])
568 /* Or basic_iostream? */
569 else if (name == subst_identifiers[SUBID_BASIC_IOSTREAM])
577 /* Check for namespace std. */
578 if (decl && DECL_NAMESPACE_STD_P (decl))
584 /* Now check the list of available substitutions for this mangling
586 for (i = 0; i < size; ++i)
588 tree candidate = VARRAY_TREE (G.substitutions, i);
589 /* NODE is a matched to a candidate if it's the same decl node or
590 if it's the same type. */
591 if (decl == candidate
592 || (TYPE_P (candidate) && type && TYPE_P (type)
593 && same_type_p (type, candidate))
594 || NESTED_TEMPLATE_MATCH (node, candidate))
596 write_substitution (i);
601 /* No substitution found. */
606 /* TOP_LEVEL is true, if this is being called at outermost level of
607 mangling. It should be false when mangling a decl appearing in an
608 expression within some other mangling.
610 <mangled-name> ::= _Z <encoding> */
613 write_mangled_name (const tree decl, bool top_level)
615 MANGLE_TRACE_TREE ("mangled-name", decl);
617 if (/* The names of `extern "C"' functions are not mangled. */
618 DECL_EXTERN_C_FUNCTION_P (decl)
619 /* But overloaded operator names *are* mangled. */
620 && !DECL_OVERLOADED_OPERATOR_P (decl))
625 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
628 /* The standard notes: "The <encoding> of an extern "C"
629 function is treated like global-scope data, i.e. as its
630 <source-name> without a type." We cannot write
631 overloaded operators that way though, because it contains
632 characters invalid in assembler. */
633 if (abi_version_at_least (2))
636 G.need_abi_warning = true;
637 write_source_name (DECL_NAME (decl));
640 else if (TREE_CODE (decl) == VAR_DECL
641 /* The names of global variables aren't mangled. */
642 && (CP_DECL_CONTEXT (decl) == global_namespace
643 /* And neither are `extern "C"' variables. */
644 || DECL_EXTERN_C_P (decl)))
646 if (top_level || abi_version_at_least (2))
650 G.need_abi_warning = true;
658 write_encoding (decl);
659 if (DECL_LANG_SPECIFIC (decl)
660 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
661 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
662 /* We need a distinct mangled name for these entities, but
663 we should never actually output it. So, we append some
664 characters the assembler won't like. */
665 write_string (" *INTERNAL* ");
669 /* <encoding> ::= <function name> <bare-function-type>
673 write_encoding (const tree decl)
675 MANGLE_TRACE_TREE ("encoding", decl);
677 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
679 /* For overloaded operators write just the mangled name
680 without arguments. */
681 if (DECL_OVERLOADED_OPERATOR_P (decl))
682 write_name (decl, /*ignore_local_scope=*/0);
684 write_source_name (DECL_NAME (decl));
688 write_name (decl, /*ignore_local_scope=*/0);
689 if (TREE_CODE (decl) == FUNCTION_DECL)
694 if (decl_is_template_id (decl, NULL))
696 fn_type = get_mostly_instantiated_function_type (decl);
697 /* FN_TYPE will not have parameter types for in-charge or
698 VTT parameters. Therefore, we pass NULL_TREE to
699 write_bare_function_type -- otherwise, it will get
700 confused about which artificial parameters to skip. */
705 fn_type = TREE_TYPE (decl);
709 write_bare_function_type (fn_type,
710 (!DECL_CONSTRUCTOR_P (decl)
711 && !DECL_DESTRUCTOR_P (decl)
712 && !DECL_CONV_FN_P (decl)
713 && decl_is_template_id (decl, NULL)),
718 /* <name> ::= <unscoped-name>
719 ::= <unscoped-template-name> <template-args>
723 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
724 called from <local-name>, which mangles the enclosing scope
725 elsewhere and then uses this function to mangle just the part
726 underneath the function scope. So don't use the <local-name>
727 production, to avoid an infinite recursion. */
730 write_name (tree decl, const int ignore_local_scope)
734 MANGLE_TRACE_TREE ("name", decl);
736 if (TREE_CODE (decl) == TYPE_DECL)
738 /* In case this is a typedef, fish out the corresponding
739 TYPE_DECL for the main variant. */
740 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
741 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
744 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
746 /* A decl in :: or ::std scope is treated specially. The former is
747 mangled using <unscoped-name> or <unscoped-template-name>, the
748 latter with a special substitution. Also, a name that is
749 directly in a local function scope is also mangled with
750 <unscoped-name> rather than a full <nested-name>. */
752 || context == global_namespace
753 || DECL_NAMESPACE_STD_P (context)
754 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
757 /* Is this a template instance? */
758 if (decl_is_template_id (decl, &template_info))
760 /* Yes: use <unscoped-template-name>. */
761 write_unscoped_template_name (TI_TEMPLATE (template_info));
762 write_template_args (TI_ARGS (template_info));
765 /* Everything else gets an <unqualified-name>. */
766 write_unscoped_name (decl);
770 /* Handle local names, unless we asked not to (that is, invoked
771 under <local-name>, to handle only the part of the name under
773 if (!ignore_local_scope)
775 /* Scan up the list of scope context, looking for a
776 function. If we find one, this entity is in local
777 function scope. local_entity tracks context one scope
778 level down, so it will contain the element that's
779 directly in that function's scope, either decl or one of
780 its enclosing scopes. */
781 tree local_entity = decl;
782 while (context != NULL && context != global_namespace)
784 /* Make sure we're always dealing with decls. */
785 if (context != NULL && TYPE_P (context))
786 context = TYPE_NAME (context);
787 /* Is this a function? */
788 if (TREE_CODE (context) == FUNCTION_DECL)
790 /* Yes, we have local scope. Use the <local-name>
791 production for the innermost function scope. */
792 write_local_name (context, local_entity, decl);
795 /* Up one scope level. */
796 local_entity = context;
797 context = CP_DECL_CONTEXT (context);
800 /* No local scope found? Fall through to <nested-name>. */
803 /* Other decls get a <nested-name> to encode their scope. */
804 write_nested_name (decl);
808 /* <unscoped-name> ::= <unqualified-name>
809 ::= St <unqualified-name> # ::std:: */
812 write_unscoped_name (const tree decl)
814 tree context = CP_DECL_CONTEXT (decl);
816 MANGLE_TRACE_TREE ("unscoped-name", decl);
818 /* Is DECL in ::std? */
819 if (DECL_NAMESPACE_STD_P (context))
822 write_unqualified_name (decl);
824 /* If not, it should be either in the global namespace, or directly
825 in a local function scope. */
826 else if (context == global_namespace
828 || TREE_CODE (context) == FUNCTION_DECL)
829 write_unqualified_name (decl);
834 /* <unscoped-template-name> ::= <unscoped-name>
835 ::= <substitution> */
838 write_unscoped_template_name (const tree decl)
840 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
842 if (find_substitution (decl))
844 write_unscoped_name (decl);
845 add_substitution (decl);
848 /* Write the nested name, including CV-qualifiers, of DECL.
850 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
851 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
853 <CV-qualifiers> ::= [r] [V] [K] */
856 write_nested_name (const tree decl)
860 MANGLE_TRACE_TREE ("nested-name", decl);
864 /* Write CV-qualifiers, if this is a member function. */
865 if (TREE_CODE (decl) == FUNCTION_DECL
866 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
868 if (DECL_VOLATILE_MEMFUNC_P (decl))
870 if (DECL_CONST_MEMFUNC_P (decl))
874 /* Is this a template instance? */
875 if (decl_is_template_id (decl, &template_info))
877 /* Yes, use <template-prefix>. */
878 write_template_prefix (decl);
879 write_template_args (TI_ARGS (template_info));
883 /* No, just use <prefix> */
884 write_prefix (DECL_CONTEXT (decl));
885 write_unqualified_name (decl);
890 /* <prefix> ::= <prefix> <unqualified-name>
892 ::= <template-prefix> <template-args>
894 ::= <substitution> */
897 write_prefix (const tree node)
900 /* Non-NULL if NODE represents a template-id. */
901 tree template_info = NULL;
903 MANGLE_TRACE_TREE ("prefix", node);
906 || node == global_namespace)
909 if (find_substitution (node))
914 /* If this is a function decl, that means we've hit function
915 scope, so this prefix must be for a local name. In this
916 case, we're under the <local-name> production, which encodes
917 the enclosing function scope elsewhere. So don't continue
919 if (TREE_CODE (node) == FUNCTION_DECL)
923 decl_is_template_id (decl, &template_info);
927 /* Node is a type. */
928 decl = TYPE_NAME (node);
929 if (CLASSTYPE_TEMPLATE_ID_P (node))
930 template_info = TYPE_TEMPLATE_INFO (node);
933 /* In G++ 3.2, the name of the template parameter was used. */
934 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
935 && !abi_version_at_least (2))
936 G.need_abi_warning = true;
938 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
939 && abi_version_at_least (2))
940 write_template_param (node);
941 else if (template_info != NULL)
944 write_template_prefix (decl);
945 write_template_args (TI_ARGS (template_info));
950 write_prefix (CP_DECL_CONTEXT (decl));
951 write_unqualified_name (decl);
954 add_substitution (node);
957 /* <template-prefix> ::= <prefix> <template component>
959 ::= <substitution> */
962 write_template_prefix (const tree node)
964 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
965 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
966 tree context = CP_DECL_CONTEXT (decl);
971 MANGLE_TRACE_TREE ("template-prefix", node);
973 /* Find the template decl. */
974 if (decl_is_template_id (decl, &template_info))
975 template = TI_TEMPLATE (template_info);
976 else if (CLASSTYPE_TEMPLATE_ID_P (type))
977 template = TYPE_TI_TEMPLATE (type);
979 /* Oops, not a template. */
982 /* For a member template, though, the template name for the
983 innermost name must have all the outer template levels
984 instantiated. For instance, consider
986 template<typename T> struct Outer {
987 template<typename U> struct Inner {};
990 The template name for `Inner' in `Outer<int>::Inner<float>' is
991 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
992 levels separately, so there's no TEMPLATE_DECL available for this
993 (there's only `Outer<T>::Inner<U>').
995 In order to get the substitutions right, we create a special
996 TREE_LIST to represent the substitution candidate for a nested
997 template. The TREE_PURPOSE is the template's context, fully
998 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1001 So, for the example above, `Outer<int>::Inner' is represented as a
1002 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1003 and whose value is `Outer<T>::Inner<U>'. */
1004 if (TYPE_P (context))
1005 substitution = build_tree_list (context, template);
1007 substitution = template;
1009 if (find_substitution (substitution))
1012 /* In G++ 3.2, the name of the template template parameter was used. */
1013 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
1014 && !abi_version_at_least (2))
1015 G.need_abi_warning = true;
1017 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
1018 && abi_version_at_least (2))
1019 write_template_param (TREE_TYPE (template));
1022 write_prefix (context);
1023 write_unqualified_name (decl);
1026 add_substitution (substitution);
1029 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1030 mangled through special entry points.
1032 <unqualified-name> ::= <operator-name>
1034 ::= <source-name> */
1037 write_unqualified_name (const tree decl)
1039 MANGLE_TRACE_TREE ("unqualified-name", decl);
1041 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
1042 write_special_name_constructor (decl);
1043 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
1044 write_special_name_destructor (decl);
1045 else if (DECL_NAME (decl) == NULL_TREE)
1046 write_source_name (DECL_ASSEMBLER_NAME (decl));
1047 else if (DECL_CONV_FN_P (decl))
1049 /* Conversion operator. Handle it right here.
1050 <operator> ::= cv <type> */
1052 if (decl_is_template_id (decl, NULL))
1054 tree fn_type = get_mostly_instantiated_function_type (decl);
1055 type = TREE_TYPE (fn_type);
1058 type = DECL_CONV_FN_TYPE (decl);
1059 write_conversion_operator_name (type);
1061 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1063 operator_name_info_t *oni;
1064 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1065 oni = assignment_operator_name_info;
1067 oni = operator_name_info;
1069 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1072 write_source_name (DECL_NAME (decl));
1075 /* Write the unqualified-name for a conversion operator to TYPE. */
1078 write_conversion_operator_name (const tree type)
1080 write_string ("cv");
1084 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1086 <source-name> ::= </length/ number> <identifier> */
1089 write_source_name (tree identifier)
1091 MANGLE_TRACE_TREE ("source-name", identifier);
1093 /* Never write the whole template-id name including the template
1094 arguments; we only want the template name. */
1095 if (IDENTIFIER_TEMPLATE (identifier))
1096 identifier = IDENTIFIER_TEMPLATE (identifier);
1098 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1099 write_identifier (IDENTIFIER_POINTER (identifier));
1102 /* Convert NUMBER to ascii using base BASE and generating at least
1103 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1104 into which to store the characters. Returns the number of
1105 characters generated (these will be layed out in advance of where
1109 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1110 char *buffer, const unsigned int min_digits)
1112 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1113 unsigned digits = 0;
1117 unsigned HOST_WIDE_INT d = number / base;
1119 *--buffer = base_digits[number - d * base];
1123 while (digits < min_digits)
1125 *--buffer = base_digits[0];
1131 /* Non-terminal <number>.
1133 <number> ::= [n] </decimal integer/> */
1136 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1137 const unsigned int base)
1139 char buffer[sizeof (HOST_WIDE_INT) * 8];
1142 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1145 number = -((HOST_WIDE_INT) number);
1147 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1148 write_chars (buffer + sizeof (buffer) - count, count);
1151 /* Write out an integral CST in decimal. Most numbers are small, and
1152 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1153 bigger than that, which we must deal with. */
1156 write_integer_cst (const tree cst)
1158 int sign = tree_int_cst_sgn (cst);
1160 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1162 /* A bignum. We do this in chunks, each of which fits in a
1164 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1165 unsigned HOST_WIDE_INT chunk;
1166 unsigned chunk_digits;
1167 char *ptr = buffer + sizeof (buffer);
1172 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1177 if (sizeof (HOST_WIDE_INT) >= 8)
1179 /* It is at least 64 bits, so 10^18 is representable. */
1184 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1185 base = build_int_2 (chunk, 0);
1186 n = build_int_2 (TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1187 TREE_TYPE (n) = TREE_TYPE (base) = type;
1192 n = fold (build1 (NEGATE_EXPR, type, n));
1196 tree d = fold (build (FLOOR_DIV_EXPR, type, n, base));
1197 tree tmp = fold (build (MULT_EXPR, type, d, base));
1200 done = integer_zerop (d);
1201 tmp = fold (build (MINUS_EXPR, type, n, tmp));
1202 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1203 done ? 1 : chunk_digits);
1209 write_chars (ptr, count);
1214 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1221 write_unsigned_number (low);
1225 /* Write out a floating-point literal.
1227 "Floating-point literals are encoded using the bit pattern of the
1228 target processor's internal representation of that number, as a
1229 fixed-length lowercase hexadecimal string, high-order bytes first
1230 (even if the target processor would store low-order bytes first).
1231 The "n" prefix is not used for floating-point literals; the sign
1232 bit is encoded with the rest of the number.
1234 Here are some examples, assuming the IEEE standard representation
1235 for floating point numbers. (Spaces are for readability, not
1236 part of the encoding.)
1239 -1.0f Lf bf80 0000 E
1240 1.17549435e-38f Lf 0080 0000 E
1241 1.40129846e-45f Lf 0000 0001 E
1242 0.0f Lf 0000 0000 E"
1244 Caller is responsible for the Lx and the E. */
1246 write_real_cst (const tree value)
1248 if (abi_version_at_least (2))
1250 long target_real[4]; /* largest supported float */
1251 char buffer[9]; /* eight hex digits in a 32-bit number */
1254 tree type = TREE_TYPE (value);
1255 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1257 real_to_target (target_real, &TREE_REAL_CST (value),
1260 /* The value in target_real is in the target word order,
1261 so we must write it out backward if that happens to be
1262 little-endian. write_number cannot be used, it will
1263 produce uppercase. */
1264 if (FLOAT_WORDS_BIG_ENDIAN)
1265 i = 0, limit = words, dir = 1;
1267 i = words - 1, limit = -1, dir = -1;
1269 for (; i != limit; i += dir)
1271 sprintf (buffer, "%08lx", target_real[i]);
1272 write_chars (buffer, 8);
1277 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1278 literally. Note that compatibility with 3.2 is impossible,
1279 because the old floating-point emulator used a different
1280 format for REAL_VALUE_TYPE. */
1282 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1283 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1286 G.need_abi_warning = 1;
1290 /* Non-terminal <identifier>.
1292 <identifier> ::= </unqualified source code identifier> */
1295 write_identifier (const char *identifier)
1297 MANGLE_TRACE ("identifier", identifier);
1298 write_string (identifier);
1301 /* Handle constructor productions of non-terminal <special-name>.
1302 CTOR is a constructor FUNCTION_DECL.
1304 <special-name> ::= C1 # complete object constructor
1305 ::= C2 # base object constructor
1306 ::= C3 # complete object allocating constructor
1308 Currently, allocating constructors are never used.
1310 We also need to provide mangled names for the maybe-in-charge
1311 constructor, so we treat it here too. mangle_decl_string will
1312 append *INTERNAL* to that, to make sure we never emit it. */
1315 write_special_name_constructor (const tree ctor)
1317 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1318 /* Even though we don't ever emit a definition of the
1319 old-style destructor, we still have to consider entities
1320 (like static variables) nested inside it. */
1321 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
1322 write_string ("C1");
1323 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1324 write_string ("C2");
1329 /* Handle destructor productions of non-terminal <special-name>.
1330 DTOR is a destructor FUNCTION_DECL.
1332 <special-name> ::= D0 # deleting (in-charge) destructor
1333 ::= D1 # complete object (in-charge) destructor
1334 ::= D2 # base object (not-in-charge) destructor
1336 We also need to provide mangled names for the maybe-incharge
1337 destructor, so we treat it here too. mangle_decl_string will
1338 append *INTERNAL* to that, to make sure we never emit it. */
1341 write_special_name_destructor (const tree dtor)
1343 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1344 write_string ("D0");
1345 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1346 /* Even though we don't ever emit a definition of the
1347 old-style destructor, we still have to consider entities
1348 (like static variables) nested inside it. */
1349 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
1350 write_string ("D1");
1351 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1352 write_string ("D2");
1357 /* Return the discriminator for ENTITY appearing inside
1358 FUNCTION. The discriminator is the lexical ordinal of VAR among
1359 entities with the same name in the same FUNCTION. */
1362 discriminator_for_local_entity (tree entity)
1366 /* Assume this is the only local entity with this name. */
1367 int discriminator = 0;
1369 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1370 discriminator = DECL_DISCRIMINATOR (entity);
1371 else if (TREE_CODE (entity) == TYPE_DECL)
1373 /* Scan the list of local classes. */
1374 entity = TREE_TYPE (entity);
1375 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1376 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1377 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1381 return discriminator;
1384 /* Return the discriminator for STRING, a string literal used inside
1385 FUNCTION. The discriminator is the lexical ordinal of STRING among
1386 string literals used in FUNCTION. */
1389 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1390 tree string ATTRIBUTE_UNUSED)
1392 /* For now, we don't discriminate amongst string literals. */
1396 /* <discriminator> := _ <number>
1398 The discriminator is used only for the second and later occurrences
1399 of the same name within a single function. In this case <number> is
1400 n - 2, if this is the nth occurrence, in lexical order. */
1403 write_discriminator (const int discriminator)
1405 /* If discriminator is zero, don't write anything. Otherwise... */
1406 if (discriminator > 0)
1409 write_unsigned_number (discriminator - 1);
1413 /* Mangle the name of a function-scope entity. FUNCTION is the
1414 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1415 the entity itself. LOCAL_ENTITY is the entity that's directly
1416 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1419 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1420 := Z <function encoding> E s [<discriminator>] */
1423 write_local_name (const tree function, const tree local_entity,
1426 MANGLE_TRACE_TREE ("local-name", entity);
1429 write_encoding (function);
1431 if (TREE_CODE (entity) == STRING_CST)
1434 write_discriminator (discriminator_for_string_literal (function,
1439 /* Now the <entity name>. Let write_name know its being called
1440 from <local-name>, so it doesn't try to process the enclosing
1441 function scope again. */
1442 write_name (entity, /*ignore_local_scope=*/1);
1443 write_discriminator (discriminator_for_local_entity (local_entity));
1447 /* Non-terminals <type> and <CV-qualifier>.
1449 <type> ::= <builtin-type>
1451 ::= <class-enum-type>
1453 ::= <pointer-to-member-type>
1454 ::= <template-param>
1457 ::= P <type> # pointer-to
1458 ::= R <type> # reference-to
1459 ::= C <type> # complex pair (C 2000)
1460 ::= G <type> # imaginary (C 2000) [not supported]
1461 ::= U <source-name> <type> # vendor extended type qualifier
1463 TYPE is a type node. */
1466 write_type (tree type)
1468 /* This gets set to nonzero if TYPE turns out to be a (possibly
1469 CV-qualified) builtin type. */
1470 int is_builtin_type = 0;
1472 MANGLE_TRACE_TREE ("type", type);
1474 if (type == error_mark_node)
1477 if (find_substitution (type))
1480 if (write_CV_qualifiers_for_type (type) > 0)
1481 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1482 mangle the unqualified type. The recursive call is needed here
1483 since both the qualified and unqualified types are substitution
1485 write_type (TYPE_MAIN_VARIANT (type));
1486 else if (TREE_CODE (type) == ARRAY_TYPE)
1487 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1488 so that the cv-qualification of the element type is available
1489 in write_array_type. */
1490 write_array_type (type);
1493 /* See through any typedefs. */
1494 type = TYPE_MAIN_VARIANT (type);
1496 if (TYPE_PTRMEM_P (type))
1497 write_pointer_to_member_type (type);
1498 else switch (TREE_CODE (type))
1502 case INTEGER_TYPE: /* Includes wchar_t. */
1504 /* If this is a typedef, TYPE may not be one of
1505 the standard builtin type nodes, but an alias of one. Use
1506 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1507 write_builtin_type (TYPE_MAIN_VARIANT (type));
1513 write_type (TREE_TYPE (type));
1518 write_function_type (type);
1524 /* A pointer-to-member function is represented as a special
1525 RECORD_TYPE, so check for this first. */
1526 if (TYPE_PTRMEMFUNC_P (type))
1527 write_pointer_to_member_type (type);
1529 write_class_enum_type (type);
1533 case UNBOUND_CLASS_TEMPLATE:
1534 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1535 ordinary nested names. */
1536 write_nested_name (TYPE_STUB_DECL (type));
1541 write_type (TREE_TYPE (type));
1544 case REFERENCE_TYPE:
1546 write_type (TREE_TYPE (type));
1549 case TEMPLATE_TYPE_PARM:
1550 case TEMPLATE_PARM_INDEX:
1551 write_template_param (type);
1554 case TEMPLATE_TEMPLATE_PARM:
1555 write_template_template_param (type);
1558 case BOUND_TEMPLATE_TEMPLATE_PARM:
1559 write_template_template_param (type);
1561 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1565 write_string ("U8__vector");
1566 write_type (TREE_TYPE (type));
1574 /* Types other than builtin types are substitution candidates. */
1575 if (!is_builtin_type)
1576 add_substitution (type);
1579 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1580 CV-qualifiers written for TYPE.
1582 <CV-qualifiers> ::= [r] [V] [K] */
1585 write_CV_qualifiers_for_type (const tree type)
1587 int num_qualifiers = 0;
1589 /* The order is specified by:
1591 "In cases where multiple order-insensitive qualifiers are
1592 present, they should be ordered 'K' (closest to the base type),
1593 'V', 'r', and 'U' (farthest from the base type) ..."
1595 Note that we do not use cp_type_quals below; given "const
1596 int[3]", the "const" is emitted with the "int", not with the
1599 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1604 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1609 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1615 return num_qualifiers;
1618 /* Non-terminal <builtin-type>.
1620 <builtin-type> ::= v # void
1625 ::= h # unsigned char
1627 ::= t # unsigned short
1629 ::= j # unsigned int
1631 ::= m # unsigned long
1632 ::= x # long long, __int64
1633 ::= y # unsigned long long, __int64
1635 ::= o # unsigned __int128
1638 ::= e # long double, __float80
1639 ::= g # __float128 [not supported]
1640 ::= u <source-name> # vendor extended type */
1643 write_builtin_type (tree type)
1645 switch (TREE_CODE (type))
1656 /* If this is size_t, get the underlying int type. */
1657 if (TYPE_IS_SIZETYPE (type))
1658 type = TYPE_DOMAIN (type);
1660 /* TYPE may still be wchar_t, since that isn't in
1661 integer_type_nodes. */
1662 if (type == wchar_type_node)
1664 else if (TYPE_FOR_JAVA (type))
1665 write_java_integer_type_codes (type);
1669 /* Assume TYPE is one of the shared integer type nodes. Find
1670 it in the array of these nodes. */
1672 for (itk = 0; itk < itk_none; ++itk)
1673 if (type == integer_types[itk])
1675 /* Print the corresponding single-letter code. */
1676 write_char (integer_type_codes[itk]);
1680 if (itk == itk_none)
1682 tree t = c_common_type_for_mode (TYPE_MODE (type),
1683 TREE_UNSIGNED (type));
1686 if (TYPE_PRECISION (type) == 128)
1687 write_char (TREE_UNSIGNED (type) ? 'o' : 'n');
1689 /* Couldn't find this type. */
1702 if (type == float_type_node
1703 || type == java_float_type_node)
1705 else if (type == double_type_node
1706 || type == java_double_type_node)
1708 else if (type == long_double_type_node)
1719 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1720 METHOD_TYPE. The return type is mangled before the parameter
1723 <function-type> ::= F [Y] <bare-function-type> E */
1726 write_function_type (const tree type)
1728 MANGLE_TRACE_TREE ("function-type", type);
1730 /* For a pointer to member function, the function type may have
1731 cv-qualifiers, indicating the quals for the artificial 'this'
1733 if (TREE_CODE (type) == METHOD_TYPE)
1735 /* The first parameter must be a POINTER_TYPE pointing to the
1736 `this' parameter. */
1737 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1738 write_CV_qualifiers_for_type (this_type);
1742 /* We don't track whether or not a type is `extern "C"'. Note that
1743 you can have an `extern "C"' function that does not have
1744 `extern "C"' type, and vice versa:
1746 extern "C" typedef void function_t();
1747 function_t f; // f has C++ linkage, but its type is
1750 typedef void function_t();
1751 extern "C" function_t f; // Vice versa.
1754 write_bare_function_type (type, /*include_return_type_p=*/1,
1759 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1760 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1761 is mangled before the parameter types. If non-NULL, DECL is
1762 FUNCTION_DECL for the function whose type is being emitted.
1764 <bare-function-type> ::= </signature/ type>+ */
1767 write_bare_function_type (const tree type, const int include_return_type_p,
1770 MANGLE_TRACE_TREE ("bare-function-type", type);
1772 /* Mangle the return type, if requested. */
1773 if (include_return_type_p)
1774 write_type (TREE_TYPE (type));
1776 /* Now mangle the types of the arguments. */
1777 write_method_parms (TYPE_ARG_TYPES (type),
1778 TREE_CODE (type) == METHOD_TYPE,
1782 /* Write the mangled representation of a method parameter list of
1783 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1784 considered a non-static method, and the this parameter is omitted.
1785 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1786 parameters are being emitted. */
1789 write_method_parms (tree parm_types, const int method_p, const tree decl)
1791 tree first_parm_type;
1792 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1794 /* Assume this parameter type list is variable-length. If it ends
1795 with a void type, then it's not. */
1798 /* If this is a member function, skip the first arg, which is the
1800 "Member functions do not encode the type of their implicit this
1803 Similarly, there's no need to mangle artificial parameters, like
1804 the VTT parameters for constructors and destructors. */
1807 parm_types = TREE_CHAIN (parm_types);
1808 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1810 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1812 parm_types = TREE_CHAIN (parm_types);
1813 parm_decl = TREE_CHAIN (parm_decl);
1817 for (first_parm_type = parm_types;
1819 parm_types = TREE_CHAIN (parm_types))
1821 tree parm = TREE_VALUE (parm_types);
1822 if (parm == void_type_node)
1824 /* "Empty parameter lists, whether declared as () or
1825 conventionally as (void), are encoded with a void parameter
1827 if (parm_types == first_parm_type)
1829 /* If the parm list is terminated with a void type, it's
1832 /* A void type better be the last one. */
1833 my_friendly_assert (TREE_CHAIN (parm_types) == NULL, 20000523);
1840 /* <builtin-type> ::= z # ellipsis */
1844 /* <class-enum-type> ::= <name> */
1847 write_class_enum_type (const tree type)
1849 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1852 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1855 <template-args> ::= I <template-arg>+ E */
1858 write_template_args (tree args)
1861 int length = TREE_VEC_LENGTH (args);
1863 MANGLE_TRACE_TREE ("template-args", args);
1867 my_friendly_assert (length > 0, 20000422);
1869 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1871 /* We have nested template args. We want the innermost template
1873 args = TREE_VEC_ELT (args, length - 1);
1874 length = TREE_VEC_LENGTH (args);
1876 for (i = 0; i < length; ++i)
1877 write_template_arg (TREE_VEC_ELT (args, i));
1882 /* <expression> ::= <unary operator-name> <expression>
1883 ::= <binary operator-name> <expression> <expression>
1886 <expr-primary> ::= <template-param>
1887 ::= L <type> <value number> E # literal
1888 ::= L <mangled-name> E # external name
1889 ::= sr <type> <unqualified-name>
1890 ::= sr <type> <unqualified-name> <template-args> */
1893 write_expression (tree expr)
1895 enum tree_code code;
1897 code = TREE_CODE (expr);
1899 /* Handle pointers-to-members by making them look like expression
1901 if (code == PTRMEM_CST)
1903 expr = build_nt (ADDR_EXPR,
1904 build_nt (SCOPE_REF,
1905 PTRMEM_CST_CLASS (expr),
1906 PTRMEM_CST_MEMBER (expr)));
1907 code = TREE_CODE (expr);
1910 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1911 is converted (via qualification conversions) to another
1913 while (TREE_CODE (expr) == NOP_EXPR
1914 || TREE_CODE (expr) == NON_LVALUE_EXPR)
1916 expr = TREE_OPERAND (expr, 0);
1917 code = TREE_CODE (expr);
1920 /* Handle template parameters. */
1921 if (code == TEMPLATE_TYPE_PARM
1922 || code == TEMPLATE_TEMPLATE_PARM
1923 || code == BOUND_TEMPLATE_TEMPLATE_PARM
1924 || code == TEMPLATE_PARM_INDEX)
1925 write_template_param (expr);
1926 /* Handle literals. */
1927 else if (TREE_CODE_CLASS (code) == 'c'
1928 || (abi_version_at_least (2) && code == CONST_DECL))
1929 write_template_arg_literal (expr);
1930 else if (DECL_P (expr))
1932 /* G++ 3.2 incorrectly mangled non-type template arguments of
1933 enumeration type using their names. */
1934 if (code == CONST_DECL)
1935 G.need_abi_warning = 1;
1937 write_mangled_name (expr, false);
1940 else if (TREE_CODE (expr) == SIZEOF_EXPR
1941 && TYPE_P (TREE_OPERAND (expr, 0)))
1943 write_string ("st");
1944 write_type (TREE_OPERAND (expr, 0));
1946 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
1948 tree scope = TREE_OPERAND (expr, 0);
1949 tree member = TREE_OPERAND (expr, 1);
1951 /* If the MEMBER is a real declaration, then the qualifying
1952 scope was not dependent. Ideally, we would not have a
1953 SCOPE_REF in those cases, but sometimes we do. If the second
1954 argument is a DECL, then the name must not have been
1956 if (DECL_P (member))
1957 write_expression (member);
1962 write_string ("sr");
1964 /* If MEMBER is a template-id, separate the template
1965 from the arguments. */
1966 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
1968 template_args = TREE_OPERAND (member, 1);
1969 member = TREE_OPERAND (member, 0);
1972 template_args = NULL_TREE;
1973 /* Write out the name of the MEMBER. */
1974 if (IDENTIFIER_TYPENAME_P (member))
1975 write_conversion_operator_name (TREE_TYPE (member));
1976 else if (IDENTIFIER_OPNAME_P (member))
1979 const char *mangled_name = NULL;
1981 /* Unfortunately, there is no easy way to go from the
1982 name of the operator back to the corresponding tree
1984 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
1985 if (operator_name_info[i].identifier == member)
1987 /* The ABI says that we prefer binary operator
1988 names to unary operator names. */
1989 if (operator_name_info[i].arity == 2)
1991 mangled_name = operator_name_info[i].mangled_name;
1994 else if (!mangled_name)
1995 mangled_name = operator_name_info[i].mangled_name;
1997 else if (assignment_operator_name_info[i].identifier
2001 = assignment_operator_name_info[i].mangled_name;
2004 write_string (mangled_name);
2007 write_source_name (member);
2008 /* Write out the template arguments. */
2010 write_template_args (template_args);
2017 /* When we bind a variable or function to a non-type template
2018 argument with reference type, we create an ADDR_EXPR to show
2019 the fact that the entity's address has been taken. But, we
2020 don't actually want to output a mangling code for the `&'. */
2021 if (TREE_CODE (expr) == ADDR_EXPR
2023 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2025 expr = TREE_OPERAND (expr, 0);
2028 write_expression (expr);
2032 code = TREE_CODE (expr);
2035 /* If it wasn't any of those, recursively expand the expression. */
2036 write_string (operator_name_info[(int) code].mangled_name);
2041 sorry ("call_expr cannot be mangled due to a defect in the C++ ABI");
2045 write_type (TREE_TYPE (expr));
2046 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2049 case STATIC_CAST_EXPR:
2050 case CONST_CAST_EXPR:
2051 write_type (TREE_TYPE (expr));
2052 write_expression (TREE_OPERAND (expr, 0));
2056 /* Handle pointers-to-members specially. */
2058 write_type (TREE_OPERAND (expr, 0));
2059 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2060 write_source_name (TREE_OPERAND (expr, 1));
2061 else if (TREE_CODE (TREE_OPERAND (expr, 1)) == TEMPLATE_ID_EXPR)
2066 template_id = TREE_OPERAND (expr, 1);
2067 name = TREE_OPERAND (template_id, 0);
2068 /* FIXME: What about operators? */
2069 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE,
2071 write_source_name (TREE_OPERAND (template_id, 0));
2072 write_template_args (TREE_OPERAND (template_id, 1));
2076 /* G++ 3.2 incorrectly put out both the "sr" code and
2077 the nested name of the qualified name. */
2078 G.need_abi_warning = 1;
2079 write_encoding (TREE_OPERAND (expr, 1));
2084 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
2086 tree operand = TREE_OPERAND (expr, i);
2087 /* As a GNU expression, the middle operand of a
2088 conditional may be omitted. Since expression
2089 manglings are supposed to represent the input token
2090 stream, there's no good way to mangle such an
2091 expression without extending the C++ ABI. */
2092 if (code == COND_EXPR && i == 1 && !operand)
2094 error ("omitted middle operand to `?:' operand "
2095 "cannot be mangled");
2098 write_expression (operand);
2104 /* Literal subcase of non-terminal <template-arg>.
2106 "Literal arguments, e.g. "A<42L>", are encoded with their type
2107 and value. Negative integer values are preceded with "n"; for
2108 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2109 encoded as 0, true as 1." */
2112 write_template_arg_literal (const tree value)
2114 tree type = TREE_TYPE (value);
2118 if (TREE_CODE (value) == CONST_DECL)
2119 write_integer_cst (DECL_INITIAL (value));
2120 else if (TREE_CODE (value) == INTEGER_CST)
2122 if (same_type_p (type, boolean_type_node))
2124 if (integer_zerop (value))
2125 write_unsigned_number (0);
2126 else if (integer_onep (value))
2127 write_unsigned_number (1);
2132 write_integer_cst (value);
2134 else if (TREE_CODE (value) == REAL_CST)
2135 write_real_cst (value);
2142 /* Non-terminal <tempalate-arg>.
2144 <template-arg> ::= <type> # type
2145 ::= L <type> </value/ number> E # literal
2146 ::= LZ <name> E # external name
2147 ::= X <expression> E # expression */
2150 write_template_arg (tree node)
2152 enum tree_code code = TREE_CODE (node);
2154 MANGLE_TRACE_TREE ("template-arg", node);
2156 /* A template template parameter's argument list contains TREE_LIST
2157 nodes of which the value field is the the actual argument. */
2158 if (code == TREE_LIST)
2160 node = TREE_VALUE (node);
2161 /* If it's a decl, deal with its type instead. */
2164 node = TREE_TYPE (node);
2165 code = TREE_CODE (node);
2169 if (TREE_CODE (node) == NOP_EXPR
2170 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
2172 /* Template parameters can be of reference type. To maintain
2173 internal consistency, such arguments use a conversion from
2174 address of object to reference type. */
2175 my_friendly_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR,
2177 if (abi_version_at_least (2))
2178 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
2180 G.need_abi_warning = 1;
2185 else if (code == TEMPLATE_DECL)
2186 /* A template appearing as a template arg is a template template arg. */
2187 write_template_template_arg (node);
2188 else if ((TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
2189 || (abi_version_at_least (2) && code == CONST_DECL))
2190 write_template_arg_literal (node);
2191 else if (DECL_P (node))
2193 /* G++ 3.2 incorrectly mangled non-type template arguments of
2194 enumeration type using their names. */
2195 if (code == CONST_DECL)
2196 G.need_abi_warning = 1;
2199 write_encoding (node);
2204 /* Template arguments may be expressions. */
2206 write_expression (node);
2211 /* <template-template-arg>
2213 ::= <substitution> */
2216 write_template_template_arg (const tree decl)
2218 MANGLE_TRACE_TREE ("template-template-arg", decl);
2220 if (find_substitution (decl))
2222 write_name (decl, /*ignore_local_scope=*/0);
2223 add_substitution (decl);
2227 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2229 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2230 ::= A <expression> _ </element/ type>
2232 "Array types encode the dimension (number of elements) and the
2233 element type. For variable length arrays, the dimension (but not
2234 the '_' separator) is omitted." */
2237 write_array_type (const tree type)
2240 if (TYPE_DOMAIN (type))
2245 index_type = TYPE_DOMAIN (type);
2246 /* The INDEX_TYPE gives the upper and lower bounds of the
2248 max = TYPE_MAX_VALUE (index_type);
2249 if (TREE_CODE (max) == INTEGER_CST)
2251 /* The ABI specifies that we should mangle the number of
2252 elements in the array, not the largest allowed index. */
2253 max = size_binop (PLUS_EXPR, max, size_one_node);
2254 write_unsigned_number (tree_low_cst (max, 1));
2258 max = TREE_OPERAND (max, 0);
2259 if (!abi_version_at_least (2))
2261 /* value_dependent_expression_p presumes nothing is
2262 dependent when PROCESSING_TEMPLATE_DECL is zero. */
2263 ++processing_template_decl;
2264 if (!value_dependent_expression_p (max))
2265 G.need_abi_warning = 1;
2266 --processing_template_decl;
2268 write_expression (max);
2273 write_type (TREE_TYPE (type));
2276 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2277 variables. TYPE is a pointer-to-member POINTER_TYPE.
2279 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2282 write_pointer_to_member_type (const tree type)
2285 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2286 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2289 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2290 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2291 TEMPLATE_PARM_INDEX.
2293 <template-param> ::= T </parameter/ number> _ */
2296 write_template_param (const tree parm)
2300 tree parm_type = NULL_TREE;
2302 MANGLE_TRACE_TREE ("template-parm", parm);
2304 switch (TREE_CODE (parm))
2306 case TEMPLATE_TYPE_PARM:
2307 case TEMPLATE_TEMPLATE_PARM:
2308 case BOUND_TEMPLATE_TEMPLATE_PARM:
2309 parm_index = TEMPLATE_TYPE_IDX (parm);
2310 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2313 case TEMPLATE_PARM_INDEX:
2314 parm_index = TEMPLATE_PARM_IDX (parm);
2315 parm_level = TEMPLATE_PARM_LEVEL (parm);
2316 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2324 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2325 earliest template param denoted by `_'. */
2327 write_unsigned_number (parm_index - 1);
2331 /* <template-template-param>
2332 ::= <template-param>
2333 ::= <substitution> */
2336 write_template_template_param (const tree parm)
2338 tree template = NULL_TREE;
2340 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2341 template template parameter. The substitution candidate here is
2342 only the template. */
2343 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2346 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2347 if (find_substitution (template))
2351 /* <template-param> encodes only the template parameter position,
2352 not its template arguments, which is fine here. */
2353 write_template_param (parm);
2355 add_substitution (template);
2358 /* Non-terminal <substitution>.
2360 <substitution> ::= S <seq-id> _
2364 write_substitution (const int seq_id)
2366 MANGLE_TRACE ("substitution", "");
2370 write_number (seq_id - 1, /*unsigned=*/1, 36);
2374 /* Start mangling ENTITY. */
2377 start_mangling (const tree entity)
2380 G.need_abi_warning = false;
2381 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
2382 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
2385 /* Done with mangling. Return the generated mangled name. If WARN is
2386 true, and the name of G.entity will be mangled differently in a
2387 future version of the ABI, issue a warning. */
2389 static inline const char *
2390 finish_mangling (const bool warn)
2392 if (warn_abi && warn && G.need_abi_warning)
2393 warning ("the mangled name of `%D' will change in a future "
2397 /* Clear all the substitutions. */
2398 G.substitutions = 0;
2400 /* Null-terminate the string. */
2403 return (const char *) obstack_base (&G.name_obstack);
2406 /* Initialize data structures for mangling. */
2411 gcc_obstack_init (&G.name_obstack);
2413 /* Cache these identifiers for quick comparison when checking for
2414 standard substitutions. */
2415 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2416 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2417 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2418 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2419 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2420 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2423 /* Generate the mangled name of DECL. */
2426 mangle_decl_string (const tree decl)
2430 start_mangling (decl);
2432 if (TREE_CODE (decl) == TYPE_DECL)
2433 write_type (TREE_TYPE (decl));
2435 write_mangled_name (decl, true);
2437 result = finish_mangling (/*warn=*/true);
2439 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2443 /* Create an identifier for the external mangled name of DECL. */
2446 mangle_decl (const tree decl)
2448 tree id = get_identifier (mangle_decl_string (decl));
2450 SET_DECL_ASSEMBLER_NAME (decl, id);
2453 /* Generate the mangled representation of TYPE. */
2456 mangle_type_string (const tree type)
2460 start_mangling (type);
2462 result = finish_mangling (/*warn=*/false);
2464 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2468 /* Create an identifier for the mangled representation of TYPE. */
2471 mangle_type (const tree type)
2473 return get_identifier (mangle_type_string (type));
2476 /* Create an identifier for the mangled name of a special component
2477 for belonging to TYPE. CODE is the ABI-specified code for this
2481 mangle_special_for_type (const tree type, const char *code)
2485 /* We don't have an actual decl here for the special component, so
2486 we can't just process the <encoded-name>. Instead, fake it. */
2487 start_mangling (type);
2489 /* Start the mangling. */
2490 write_string ("_Z");
2491 write_string (code);
2495 result = finish_mangling (/*warn=*/false);
2498 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2500 return get_identifier (result);
2503 /* Create an identifier for the mangled representation of the typeinfo
2504 structure for TYPE. */
2507 mangle_typeinfo_for_type (const tree type)
2509 return mangle_special_for_type (type, "TI");
2512 /* Create an identifier for the mangled name of the NTBS containing
2513 the mangled name of TYPE. */
2516 mangle_typeinfo_string_for_type (const tree type)
2518 return mangle_special_for_type (type, "TS");
2521 /* Create an identifier for the mangled name of the vtable for TYPE. */
2524 mangle_vtbl_for_type (const tree type)
2526 return mangle_special_for_type (type, "TV");
2529 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2532 mangle_vtt_for_type (const tree type)
2534 return mangle_special_for_type (type, "TT");
2537 /* Return an identifier for a construction vtable group. TYPE is
2538 the most derived class in the hierarchy; BINFO is the base
2539 subobject for which this construction vtable group will be used.
2541 This mangling isn't part of the ABI specification; in the ABI
2542 specification, the vtable group is dumped in the same COMDAT as the
2543 main vtable, and is referenced only from that vtable, so it doesn't
2544 need an external name. For binary formats without COMDAT sections,
2545 though, we need external names for the vtable groups.
2547 We use the production
2549 <special-name> ::= CT <type> <offset number> _ <base type> */
2552 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2556 start_mangling (type);
2558 write_string ("_Z");
2559 write_string ("TC");
2561 write_integer_cst (BINFO_OFFSET (binfo));
2563 write_type (BINFO_TYPE (binfo));
2565 result = finish_mangling (/*warn=*/false);
2567 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2568 return get_identifier (result);
2571 /* Mangle a this pointer or result pointer adjustment.
2573 <call-offset> ::= h <fixed offset number> _
2574 ::= v <fixed offset number> _ <virtual offset number> _ */
2577 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2579 write_char (virtual_offset ? 'v' : 'h');
2581 /* For either flavor, write the fixed offset. */
2582 write_integer_cst (fixed_offset);
2585 /* For a virtual thunk, add the virtual offset. */
2588 write_integer_cst (virtual_offset);
2593 /* Return an identifier for the mangled name of a this-adjusting or
2594 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2595 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2596 is a virtual thunk, and it is the vtbl offset in
2597 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2598 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2599 thunk itself. A covariant thunk name always includes the adjustment
2600 for the this pointer, even if there is none.
2602 <special-name> ::= T <call-offset> <base encoding>
2603 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2608 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2609 tree virtual_offset)
2613 start_mangling (fn_decl);
2615 write_string ("_Z");
2618 if (!this_adjusting)
2620 /* Covariant thunk with no this adjustment */
2622 mangle_call_offset (integer_zero_node, NULL_TREE);
2623 mangle_call_offset (fixed_offset, virtual_offset);
2625 else if (!DECL_THUNK_P (fn_decl))
2626 /* Plain this adjusting thunk. */
2627 mangle_call_offset (fixed_offset, virtual_offset);
2630 /* This adjusting thunk to covariant thunk. */
2632 mangle_call_offset (fixed_offset, virtual_offset);
2633 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2634 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2636 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2637 mangle_call_offset (fixed_offset, virtual_offset);
2638 fn_decl = THUNK_TARGET (fn_decl);
2642 write_encoding (fn_decl);
2644 result = finish_mangling (/*warn=*/false);
2646 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2647 return get_identifier (result);
2650 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2651 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
2654 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
2656 /* Hash a node (VAL1) in the table. */
2659 hash_type (const void *val)
2661 return (hashval_t) TYPE_UID (TREE_TYPE ((tree) val));
2664 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2667 compare_type (const void *val1, const void *val2)
2669 return TREE_TYPE ((tree) val1) == (tree) val2;
2672 /* Return an identifier for the mangled unqualified name for a
2673 conversion operator to TYPE. This mangling is not specified by the
2674 ABI spec; it is only used internally. */
2677 mangle_conv_op_name_for_type (const tree type)
2682 if (conv_type_names == NULL)
2683 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
2685 slot = htab_find_slot_with_hash (conv_type_names, type,
2686 (hashval_t) TYPE_UID (type), INSERT);
2687 identifier = (tree)*slot;
2692 /* Create a unique name corresponding to TYPE. */
2693 sprintf (buffer, "operator %lu",
2694 (unsigned long) htab_elements (conv_type_names));
2695 identifier = get_identifier (buffer);
2698 /* Hang TYPE off the identifier so it can be found easily later
2699 when performing conversions. */
2700 TREE_TYPE (identifier) = type;
2702 /* Set bits on the identifier so we know later it's a conversion. */
2703 IDENTIFIER_OPNAME_P (identifier) = 1;
2704 IDENTIFIER_TYPENAME_P (identifier) = 1;
2710 /* Return an identifier for the name of an initialization guard
2711 variable for indicated VARIABLE. */
2714 mangle_guard_variable (const tree variable)
2716 start_mangling (variable);
2717 write_string ("_ZGV");
2718 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2719 /* The name of a guard variable for a reference temporary should refer
2720 to the reference, not the temporary. */
2721 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2723 write_name (variable, /*ignore_local_scope=*/0);
2724 return get_identifier (finish_mangling (/*warn=*/false));
2727 /* Return an identifier for the name of a temporary variable used to
2728 initialize a static reference. This isn't part of the ABI, but we might
2729 as well call them something readable. */
2732 mangle_ref_init_variable (const tree variable)
2734 start_mangling (variable);
2735 write_string ("_ZGR");
2736 write_name (variable, /*ignore_local_scope=*/0);
2737 return get_identifier (finish_mangling (/*warn=*/false));
2741 /* Foreign language type mangling section. */
2743 /* How to write the type codes for the integer Java type. */
2746 write_java_integer_type_codes (const tree type)
2748 if (type == java_int_type_node)
2750 else if (type == java_short_type_node)
2752 else if (type == java_byte_type_node)
2754 else if (type == java_char_type_node)
2756 else if (type == java_long_type_node)
2758 else if (type == java_boolean_type_node)
2764 #include "gt-cp-mangle.h"