1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003 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"
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. */
95 /* The name in which we're building the mangled name. */
96 struct obstack name_obstack;
98 /* An array of the current substitution candidates, in the order
100 varray_type substitutions;
102 /* The entity that is being mangled. */
105 /* True if the mangling will be different in a future version of the
107 bool need_abi_warning;
110 /* Indices into subst_identifiers. These are identifiers used in
111 special substitution rules. */
119 SUBID_BASIC_IOSTREAM,
122 substitution_identifier_index_t;
124 /* For quick substitution checks, look up these common identifiers
126 static GTY(()) tree subst_identifiers[SUBID_MAX];
128 /* Single-letter codes for builtin integer types, defined in
129 <builtin-type>. These are indexed by integer_type_kind values. */
131 integer_type_codes[itk_none] =
134 'a', /* itk_signed_char */
135 'h', /* itk_unsigned_char */
137 't', /* itk_unsigned_short */
139 'j', /* itk_unsigned_int */
141 'm', /* itk_unsigned_long */
142 'x', /* itk_long_long */
143 'y' /* itk_unsigned_long_long */
146 static int decl_is_template_id (const tree, tree* const);
148 /* Functions for handling substitutions. */
150 static inline tree canonicalize_for_substitution (tree);
151 static void add_substitution (tree);
152 static inline int is_std_substitution (const tree,
153 const substitution_identifier_index_t);
154 static inline int is_std_substitution_char (const tree,
155 const substitution_identifier_index_t);
156 static int find_substitution (tree);
157 static void mangle_call_offset (const tree, const tree);
159 /* Functions for emitting mangled representations of things. */
161 static void write_mangled_name (const tree);
162 static void write_encoding (const tree);
163 static void write_name (tree, const int);
164 static void write_unscoped_name (const tree);
165 static void write_unscoped_template_name (const tree);
166 static void write_nested_name (const tree);
167 static void write_prefix (const tree);
168 static void write_template_prefix (const tree);
169 static void write_unqualified_name (const tree);
170 static void write_conversion_operator_name (const tree);
171 static void write_source_name (tree);
172 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
174 static void write_number (unsigned HOST_WIDE_INT, const int,
176 static void write_integer_cst (const tree);
177 static void write_real_cst (const tree);
178 static void write_identifier (const char *);
179 static void write_special_name_constructor (const tree);
180 static void write_special_name_destructor (const tree);
181 static void write_type (tree);
182 static int write_CV_qualifiers_for_type (const tree);
183 static void write_builtin_type (tree);
184 static void write_function_type (const tree);
185 static void write_bare_function_type (const tree, const int, const tree);
186 static void write_method_parms (tree, const int, const tree);
187 static void write_class_enum_type (const tree);
188 static void write_template_args (tree);
189 static void write_expression (tree);
190 static void write_template_arg_literal (const tree);
191 static void write_template_arg (tree);
192 static void write_template_template_arg (const tree);
193 static void write_array_type (const tree);
194 static void write_pointer_to_member_type (const tree);
195 static void write_template_param (const tree);
196 static void write_template_template_param (const tree);
197 static void write_substitution (const int);
198 static int discriminator_for_local_entity (tree);
199 static int discriminator_for_string_literal (tree, tree);
200 static void write_discriminator (const int);
201 static void write_local_name (const tree, const tree, const tree);
202 static void dump_substitution_candidates (void);
203 static const char *mangle_decl_string (const tree);
205 /* Control functions. */
207 static inline void start_mangling (const tree);
208 static inline const char *finish_mangling (const bool);
209 static tree mangle_special_for_type (const tree, const char *);
211 /* Foreign language functions. */
213 static void write_java_integer_type_codes (const tree);
215 /* Append a single character to the end of the mangled
217 #define write_char(CHAR) \
218 obstack_1grow (&G.name_obstack, (CHAR))
220 /* Append a sized buffer to the end of the mangled representation. */
221 #define write_chars(CHAR, LEN) \
222 obstack_grow (&G.name_obstack, (CHAR), (LEN))
224 /* Append a NUL-terminated string to the end of the mangled
226 #define write_string(STRING) \
227 obstack_grow (&G.name_obstack, (STRING), strlen (STRING))
229 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
230 same purpose (context, which may be a type) and value (template
231 decl). See write_template_prefix for more information on what this
233 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
234 (TREE_CODE (NODE1) == TREE_LIST \
235 && TREE_CODE (NODE2) == TREE_LIST \
236 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
237 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2)))\
238 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
239 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
241 /* Write out an unsigned quantity in base 10. */
242 #define write_unsigned_number(NUMBER) \
243 write_number ((NUMBER), /*unsigned_p=*/1, 10)
245 /* If DECL is a template instance, return nonzero and, if
246 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
247 Otherwise return zero. */
250 decl_is_template_id (const tree decl, tree* const template_info)
252 if (TREE_CODE (decl) == TYPE_DECL)
254 /* TYPE_DECLs are handled specially. Look at its type to decide
255 if this is a template instantiation. */
256 const tree type = TREE_TYPE (decl);
258 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
260 if (template_info != NULL)
261 /* For a templated TYPE_DECL, the template info is hanging
263 *template_info = TYPE_TEMPLATE_INFO (type);
269 /* Check if this is a primary template. */
270 if (DECL_LANG_SPECIFIC (decl) != NULL
271 && DECL_USE_TEMPLATE (decl)
272 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
273 && TREE_CODE (decl) != TEMPLATE_DECL)
275 if (template_info != NULL)
276 /* For most templated decls, the template info is hanging
278 *template_info = DECL_TEMPLATE_INFO (decl);
283 /* It's not a template id. */
287 /* Produce debugging output of current substitution candidates. */
290 dump_substitution_candidates (void)
294 fprintf (stderr, " ++ substitutions ");
295 for (i = 0; i < VARRAY_ACTIVE_SIZE (G.substitutions); ++i)
297 tree el = VARRAY_TREE (G.substitutions, i);
298 const char *name = "???";
301 fprintf (stderr, " ");
303 name = IDENTIFIER_POINTER (DECL_NAME (el));
304 else if (TREE_CODE (el) == TREE_LIST)
305 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
306 else if (TYPE_NAME (el))
307 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
308 fprintf (stderr, " S%d_ = ", i - 1);
310 (CP_TYPE_RESTRICT_P (el)
311 || CP_TYPE_VOLATILE_P (el)
312 || CP_TYPE_CONST_P (el)))
313 fprintf (stderr, "CV-");
314 fprintf (stderr, "%s (%s at %p)\n",
315 name, tree_code_name[TREE_CODE (el)], (void *) el);
319 /* Both decls and types can be substitution candidates, but sometimes
320 they refer to the same thing. For instance, a TYPE_DECL and
321 RECORD_TYPE for the same class refer to the same thing, and should
322 be treated accordingly in substitutions. This function returns a
323 canonicalized tree node representing NODE that is used when adding
324 and substitution candidates and finding matches. */
327 canonicalize_for_substitution (tree node)
329 /* For a TYPE_DECL, use the type instead. */
330 if (TREE_CODE (node) == TYPE_DECL)
331 node = TREE_TYPE (node);
333 node = canonical_type_variant (node);
338 /* Add NODE as a substitution candidate. NODE must not already be on
339 the list of candidates. */
342 add_substitution (tree node)
347 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
348 tree_code_name[TREE_CODE (node)], (void *) node);
350 /* Get the canonicalized substitution candidate for NODE. */
351 c = canonicalize_for_substitution (node);
352 if (DEBUG_MANGLE && c != node)
353 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
354 tree_code_name[TREE_CODE (node)], (void *) node);
358 /* Make sure NODE isn't already a candidate. */
361 for (i = VARRAY_ACTIVE_SIZE (G.substitutions); --i >= 0; )
363 const tree candidate = VARRAY_TREE (G.substitutions, i);
365 && node == candidate)
367 && TYPE_P (candidate)
368 && same_type_p (node, candidate)))
372 #endif /* ENABLE_CHECKING */
374 /* Put the decl onto the varray of substitution candidates. */
375 VARRAY_PUSH_TREE (G.substitutions, node);
378 dump_substitution_candidates ();
381 /* Helper function for find_substitution. Returns nonzero if NODE,
382 which may be a decl or a CLASS_TYPE, is a template-id with template
383 name of substitution_index[INDEX] in the ::std namespace. */
386 is_std_substitution (const tree node,
387 const substitution_identifier_index_t index)
394 type = TREE_TYPE (node);
397 else if (CLASS_TYPE_P (node))
400 decl = TYPE_NAME (node);
403 /* These are not the droids you're looking for. */
406 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
407 && TYPE_LANG_SPECIFIC (type)
408 && TYPE_TEMPLATE_INFO (type)
409 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
410 == subst_identifiers[index]));
413 /* Helper function for find_substitution. Returns nonzero if NODE,
414 which may be a decl or a CLASS_TYPE, is the template-id
415 ::std::identifier<char>, where identifier is
416 substitution_index[INDEX]. */
419 is_std_substitution_char (const tree node,
420 const substitution_identifier_index_t index)
423 /* Check NODE's name is ::std::identifier. */
424 if (!is_std_substitution (node, index))
426 /* Figure out its template args. */
428 args = DECL_TI_ARGS (node);
429 else if (CLASS_TYPE_P (node))
430 args = CLASSTYPE_TI_ARGS (node);
432 /* Oops, not a template. */
434 /* NODE's template arg list should be <char>. */
436 TREE_VEC_LENGTH (args) == 1
437 && TREE_VEC_ELT (args, 0) == char_type_node;
440 /* Check whether a substitution should be used to represent NODE in
443 First, check standard special-case substitutions.
445 <substitution> ::= St
452 # ::std::basic_string
455 # ::std::basic_string<char,
456 ::std::char_traits<char>,
457 ::std::allocator<char> >
460 # ::std::basic_istream<char, ::std::char_traits<char> >
463 # ::std::basic_ostream<char, ::std::char_traits<char> >
466 # ::std::basic_iostream<char, ::std::char_traits<char> >
468 Then examine the stack of currently available substitution
469 candidates for entities appearing earlier in the same mangling
471 If a substitution is found, write its mangled representation and
472 return nonzero. If none is found, just return zero. */
475 find_substitution (tree node)
478 const int size = VARRAY_ACTIVE_SIZE (G.substitutions);
483 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
484 tree_code_name[TREE_CODE (node)], (void *) node);
486 /* Obtain the canonicalized substitution representation for NODE.
487 This is what we'll compare against. */
488 node = canonicalize_for_substitution (node);
490 /* Check for builtin substitutions. */
492 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
493 type = TYPE_P (node) ? node : TREE_TYPE (node);
495 /* Check for std::allocator. */
497 && is_std_substitution (decl, SUBID_ALLOCATOR)
498 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
504 /* Check for std::basic_string. */
505 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
509 /* If this is a type (i.e. a fully-qualified template-id),
511 std::basic_string <char,
512 std::char_traits<char>,
513 std::allocator<char> > . */
514 if (cp_type_quals (type) == TYPE_UNQUALIFIED
515 && CLASSTYPE_USE_TEMPLATE (type))
517 tree args = CLASSTYPE_TI_ARGS (type);
518 if (TREE_VEC_LENGTH (args) == 3
519 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
520 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
522 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
531 /* Substitute for the template name only if this isn't a type. */
538 /* Check for basic_{i,o,io}stream. */
540 && cp_type_quals (type) == TYPE_UNQUALIFIED
541 && CLASS_TYPE_P (type)
542 && CLASSTYPE_USE_TEMPLATE (type)
543 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
545 /* First, check for the template
546 args <char, std::char_traits<char> > . */
547 tree args = CLASSTYPE_TI_ARGS (type);
548 if (TREE_VEC_LENGTH (args) == 2
549 && TYPE_P (TREE_VEC_ELT (args, 0))
550 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
551 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
554 /* Got them. Is this basic_istream? */
555 tree name = DECL_NAME (CLASSTYPE_TI_TEMPLATE (type));
556 if (name == subst_identifiers[SUBID_BASIC_ISTREAM])
561 /* Or basic_ostream? */
562 else if (name == subst_identifiers[SUBID_BASIC_OSTREAM])
567 /* Or basic_iostream? */
568 else if (name == subst_identifiers[SUBID_BASIC_IOSTREAM])
576 /* Check for namespace std. */
577 if (decl && DECL_NAMESPACE_STD_P (decl))
583 /* Now check the list of available substitutions for this mangling
585 for (i = 0; i < size; ++i)
587 tree candidate = VARRAY_TREE (G.substitutions, i);
588 /* NODE is a matched to a candidate if it's the same decl node or
589 if it's the same type. */
590 if (decl == candidate
591 || (TYPE_P (candidate) && type && TYPE_P (type)
592 && same_type_p (type, candidate))
593 || NESTED_TEMPLATE_MATCH (node, candidate))
595 write_substitution (i);
600 /* No substitution found. */
605 /* <mangled-name> ::= _Z <encoding> */
608 write_mangled_name (const tree decl)
610 MANGLE_TRACE_TREE ("mangled-name", decl);
612 if (DECL_LANG_SPECIFIC (decl)
613 && DECL_EXTERN_C_FUNCTION_P (decl)
614 && ! DECL_OVERLOADED_OPERATOR_P (decl))
615 /* The standard notes:
616 "The <encoding> of an extern "C" function is treated like
617 global-scope data, i.e. as its <source-name> without a type."
618 We cannot write overloaded operators that way though,
619 because it contains characters invalid in assembler. */
620 write_source_name (DECL_NAME (decl));
622 /* C++ name; needs to be mangled. */
625 write_encoding (decl);
629 /* <encoding> ::= <function name> <bare-function-type>
633 write_encoding (const tree decl)
635 MANGLE_TRACE_TREE ("encoding", decl);
637 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
639 /* For overloaded operators write just the mangled name
640 without arguments. */
641 if (DECL_OVERLOADED_OPERATOR_P (decl))
642 write_name (decl, /*ignore_local_scope=*/0);
644 write_source_name (DECL_NAME (decl));
648 write_name (decl, /*ignore_local_scope=*/0);
649 if (TREE_CODE (decl) == FUNCTION_DECL)
653 if (decl_is_template_id (decl, NULL))
654 fn_type = get_mostly_instantiated_function_type (decl);
656 fn_type = TREE_TYPE (decl);
658 write_bare_function_type (fn_type,
659 (!DECL_CONSTRUCTOR_P (decl)
660 && !DECL_DESTRUCTOR_P (decl)
661 && !DECL_CONV_FN_P (decl)
662 && decl_is_template_id (decl, NULL)),
667 /* <name> ::= <unscoped-name>
668 ::= <unscoped-template-name> <template-args>
672 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
673 called from <local-name>, which mangles the enclosing scope
674 elsewhere and then uses this function to mangle just the part
675 underneath the function scope. So don't use the <local-name>
676 production, to avoid an infinite recursion. */
679 write_name (tree decl, const int ignore_local_scope)
683 MANGLE_TRACE_TREE ("name", decl);
685 if (TREE_CODE (decl) == TYPE_DECL)
687 /* In case this is a typedef, fish out the corresponding
688 TYPE_DECL for the main variant. */
689 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
690 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
693 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
695 /* A decl in :: or ::std scope is treated specially. The former is
696 mangled using <unscoped-name> or <unscoped-template-name>, the
697 latter with a special substitution. Also, a name that is
698 directly in a local function scope is also mangled with
699 <unscoped-name> rather than a full <nested-name>. */
701 || context == global_namespace
702 || DECL_NAMESPACE_STD_P (context)
703 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
706 /* Is this a template instance? */
707 if (decl_is_template_id (decl, &template_info))
709 /* Yes: use <unscoped-template-name>. */
710 write_unscoped_template_name (TI_TEMPLATE (template_info));
711 write_template_args (TI_ARGS (template_info));
714 /* Everything else gets an <unqualified-name>. */
715 write_unscoped_name (decl);
719 /* Handle local names, unless we asked not to (that is, invoked
720 under <local-name>, to handle only the part of the name under
722 if (!ignore_local_scope)
724 /* Scan up the list of scope context, looking for a
725 function. If we find one, this entity is in local
726 function scope. local_entity tracks context one scope
727 level down, so it will contain the element that's
728 directly in that function's scope, either decl or one of
729 its enclosing scopes. */
730 tree local_entity = decl;
731 while (context != NULL && context != global_namespace)
733 /* Make sure we're always dealing with decls. */
734 if (context != NULL && TYPE_P (context))
735 context = TYPE_NAME (context);
736 /* Is this a function? */
737 if (TREE_CODE (context) == FUNCTION_DECL)
739 /* Yes, we have local scope. Use the <local-name>
740 production for the innermost function scope. */
741 write_local_name (context, local_entity, decl);
744 /* Up one scope level. */
745 local_entity = context;
746 context = CP_DECL_CONTEXT (context);
749 /* No local scope found? Fall through to <nested-name>. */
752 /* Other decls get a <nested-name> to encode their scope. */
753 write_nested_name (decl);
757 /* <unscoped-name> ::= <unqualified-name>
758 ::= St <unqualified-name> # ::std:: */
761 write_unscoped_name (const tree decl)
763 tree context = CP_DECL_CONTEXT (decl);
765 MANGLE_TRACE_TREE ("unscoped-name", decl);
767 /* Is DECL in ::std? */
768 if (DECL_NAMESPACE_STD_P (context))
771 write_unqualified_name (decl);
773 /* If not, it should be either in the global namespace, or directly
774 in a local function scope. */
775 else if (context == global_namespace
777 || TREE_CODE (context) == FUNCTION_DECL)
778 write_unqualified_name (decl);
783 /* <unscoped-template-name> ::= <unscoped-name>
784 ::= <substitution> */
787 write_unscoped_template_name (const tree decl)
789 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
791 if (find_substitution (decl))
793 write_unscoped_name (decl);
794 add_substitution (decl);
797 /* Write the nested name, including CV-qualifiers, of DECL.
799 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
800 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
802 <CV-qualifiers> ::= [r] [V] [K] */
805 write_nested_name (const tree decl)
809 MANGLE_TRACE_TREE ("nested-name", decl);
813 /* Write CV-qualifiers, if this is a member function. */
814 if (TREE_CODE (decl) == FUNCTION_DECL
815 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
817 if (DECL_VOLATILE_MEMFUNC_P (decl))
819 if (DECL_CONST_MEMFUNC_P (decl))
823 /* Is this a template instance? */
824 if (decl_is_template_id (decl, &template_info))
826 /* Yes, use <template-prefix>. */
827 write_template_prefix (decl);
828 write_template_args (TI_ARGS (template_info));
832 /* No, just use <prefix> */
833 write_prefix (DECL_CONTEXT (decl));
834 write_unqualified_name (decl);
839 /* <prefix> ::= <prefix> <unqualified-name>
841 ::= <template-prefix> <template-args>
843 ::= <substitution> */
846 write_prefix (const tree node)
849 /* Non-NULL if NODE represents a template-id. */
850 tree template_info = NULL;
852 MANGLE_TRACE_TREE ("prefix", node);
855 || node == global_namespace)
858 if (find_substitution (node))
863 /* If this is a function decl, that means we've hit function
864 scope, so this prefix must be for a local name. In this
865 case, we're under the <local-name> production, which encodes
866 the enclosing function scope elsewhere. So don't continue
868 if (TREE_CODE (node) == FUNCTION_DECL)
872 decl_is_template_id (decl, &template_info);
876 /* Node is a type. */
877 decl = TYPE_NAME (node);
878 if (CLASSTYPE_TEMPLATE_ID_P (node))
879 template_info = TYPE_TEMPLATE_INFO (node);
882 /* In G++ 3.2, the name of the template parameter was used. */
883 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
884 && !abi_version_at_least (2))
885 G.need_abi_warning = true;
887 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
888 && abi_version_at_least (2))
889 write_template_param (node);
890 else if (template_info != NULL)
893 write_template_prefix (decl);
894 write_template_args (TI_ARGS (template_info));
899 write_prefix (CP_DECL_CONTEXT (decl));
900 write_unqualified_name (decl);
903 add_substitution (node);
906 /* <template-prefix> ::= <prefix> <template component>
908 ::= <substitution> */
911 write_template_prefix (const tree node)
913 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
914 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
915 tree context = CP_DECL_CONTEXT (decl);
920 MANGLE_TRACE_TREE ("template-prefix", node);
922 /* Find the template decl. */
923 if (decl_is_template_id (decl, &template_info))
924 template = TI_TEMPLATE (template_info);
925 else if (CLASSTYPE_TEMPLATE_ID_P (type))
926 template = TYPE_TI_TEMPLATE (type);
928 /* Oops, not a template. */
931 /* For a member template, though, the template name for the
932 innermost name must have all the outer template levels
933 instantiated. For instance, consider
935 template<typename T> struct Outer {
936 template<typename U> struct Inner {};
939 The template name for `Inner' in `Outer<int>::Inner<float>' is
940 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
941 levels separately, so there's no TEMPLATE_DECL available for this
942 (there's only `Outer<T>::Inner<U>').
944 In order to get the substitutions right, we create a special
945 TREE_LIST to represent the substitution candidate for a nested
946 template. The TREE_PURPOSE is the template's context, fully
947 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
950 So, for the example above, `Outer<int>::Inner' is represented as a
951 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
952 and whose value is `Outer<T>::Inner<U>'. */
953 if (TYPE_P (context))
954 substitution = build_tree_list (context, template);
956 substitution = template;
958 if (find_substitution (substitution))
961 /* In G++ 3.2, the name of the template template parameter was used. */
962 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
963 && !abi_version_at_least (2))
964 G.need_abi_warning = true;
966 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
967 && abi_version_at_least (2))
968 write_template_param (TREE_TYPE (template));
971 write_prefix (context);
972 write_unqualified_name (decl);
975 add_substitution (substitution);
978 /* We don't need to handle thunks, vtables, or VTTs here. Those are
979 mangled through special entry points.
981 <unqualified-name> ::= <operator-name>
986 write_unqualified_name (const tree decl)
988 MANGLE_TRACE_TREE ("unqualified-name", decl);
990 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
991 write_special_name_constructor (decl);
992 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
993 write_special_name_destructor (decl);
994 else if (DECL_NAME (decl) == NULL_TREE)
995 write_source_name (DECL_ASSEMBLER_NAME (decl));
996 else if (DECL_CONV_FN_P (decl))
998 /* Conversion operator. Handle it right here.
999 <operator> ::= cv <type> */
1001 if (decl_is_template_id (decl, NULL))
1003 tree fn_type = get_mostly_instantiated_function_type (decl);
1004 type = TREE_TYPE (fn_type);
1007 type = DECL_CONV_FN_TYPE (decl);
1008 write_conversion_operator_name (type);
1010 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1012 operator_name_info_t *oni;
1013 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1014 oni = assignment_operator_name_info;
1016 oni = operator_name_info;
1018 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1021 write_source_name (DECL_NAME (decl));
1024 /* Write the unqualified-name for a conversion operator to TYPE. */
1027 write_conversion_operator_name (const tree type)
1029 write_string ("cv");
1033 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1035 <source-name> ::= </length/ number> <identifier> */
1038 write_source_name (tree identifier)
1040 MANGLE_TRACE_TREE ("source-name", identifier);
1042 /* Never write the whole template-id name including the template
1043 arguments; we only want the template name. */
1044 if (IDENTIFIER_TEMPLATE (identifier))
1045 identifier = IDENTIFIER_TEMPLATE (identifier);
1047 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1048 write_identifier (IDENTIFIER_POINTER (identifier));
1051 /* Convert NUMBER to ascii using base BASE and generating at least
1052 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1053 into which to store the characters. Returns the number of
1054 characters generated (these will be layed out in advance of where
1058 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1059 char *buffer, const unsigned int min_digits)
1061 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1062 unsigned digits = 0;
1066 unsigned HOST_WIDE_INT d = number / base;
1068 *--buffer = base_digits[number - d * base];
1072 while (digits < min_digits)
1074 *--buffer = base_digits[0];
1080 /* Non-terminal <number>.
1082 <number> ::= [n] </decimal integer/> */
1085 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1086 const unsigned int base)
1088 char buffer[sizeof (HOST_WIDE_INT) * 8];
1091 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1094 number = -((HOST_WIDE_INT) number);
1096 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1097 write_chars (buffer + sizeof (buffer) - count, count);
1100 /* Write out an integral CST in decimal. Most numbers are small, and
1101 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1102 bigger than that, which we must deal with. */
1105 write_integer_cst (const tree cst)
1107 int sign = tree_int_cst_sgn (cst);
1109 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1111 /* A bignum. We do this in chunks, each of which fits in a
1113 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1114 unsigned HOST_WIDE_INT chunk;
1115 unsigned chunk_digits;
1116 char *ptr = buffer + sizeof (buffer);
1121 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1126 if (sizeof (HOST_WIDE_INT) >= 8)
1128 /* It is at least 64 bits, so 10^18 is representable. */
1133 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1134 base = build_int_2 (chunk, 0);
1135 n = build_int_2 (TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1136 TREE_TYPE (n) = TREE_TYPE (base) = type;
1141 n = fold (build1 (NEGATE_EXPR, type, n));
1145 tree d = fold (build (FLOOR_DIV_EXPR, type, n, base));
1146 tree tmp = fold (build (MULT_EXPR, type, d, base));
1149 done = integer_zerop (d);
1150 tmp = fold (build (MINUS_EXPR, type, n, tmp));
1151 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1152 done ? 1 : chunk_digits);
1158 write_chars (ptr, count);
1163 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1170 write_unsigned_number (low);
1174 /* Write out a floating-point literal.
1176 "Floating-point literals are encoded using the bit pattern of the
1177 target processor's internal representation of that number, as a
1178 fixed-length lowercase hexadecimal string, high-order bytes first
1179 (even if the target processor would store low-order bytes first).
1180 The "n" prefix is not used for floating-point literals; the sign
1181 bit is encoded with the rest of the number.
1183 Here are some examples, assuming the IEEE standard representation
1184 for floating point numbers. (Spaces are for readability, not
1185 part of the encoding.)
1188 -1.0f Lf bf80 0000 E
1189 1.17549435e-38f Lf 0080 0000 E
1190 1.40129846e-45f Lf 0000 0001 E
1191 0.0f Lf 0000 0000 E"
1193 Caller is responsible for the Lx and the E. */
1195 write_real_cst (const tree value)
1197 if (abi_version_at_least (2))
1199 long target_real[4]; /* largest supported float */
1200 char buffer[9]; /* eight hex digits in a 32-bit number */
1203 tree type = TREE_TYPE (value);
1204 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1206 real_to_target (target_real, &TREE_REAL_CST (value),
1209 /* The value in target_real is in the target word order,
1210 so we must write it out backward if that happens to be
1211 little-endian. write_number cannot be used, it will
1212 produce uppercase. */
1213 if (FLOAT_WORDS_BIG_ENDIAN)
1214 i = 0, limit = words, dir = 1;
1216 i = words - 1, limit = -1, dir = -1;
1218 for (; i != limit; i += dir)
1220 sprintf (buffer, "%08lx", target_real[i]);
1221 write_chars (buffer, 8);
1226 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1227 literally. Note that compatibility with 3.2 is impossible,
1228 because the old floating-point emulator used a different
1229 format for REAL_VALUE_TYPE. */
1231 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1232 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1235 G.need_abi_warning = 1;
1239 /* Non-terminal <identifier>.
1241 <identifier> ::= </unqualified source code identifier> */
1244 write_identifier (const char *identifier)
1246 MANGLE_TRACE ("identifier", identifier);
1247 write_string (identifier);
1250 /* Handle constructor productions of non-terminal <special-name>.
1251 CTOR is a constructor FUNCTION_DECL.
1253 <special-name> ::= C1 # complete object constructor
1254 ::= C2 # base object constructor
1255 ::= C3 # complete object allocating constructor
1257 Currently, allocating constructors are never used.
1259 We also need to provide mangled names for the maybe-in-charge
1260 constructor, so we treat it here too. mangle_decl_string will
1261 append *INTERNAL* to that, to make sure we never emit it. */
1264 write_special_name_constructor (const tree ctor)
1266 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1267 /* Even though we don't ever emit a definition of the
1268 old-style destructor, we still have to consider entities
1269 (like static variables) nested inside it. */
1270 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
1271 write_string ("C1");
1272 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1273 write_string ("C2");
1278 /* Handle destructor productions of non-terminal <special-name>.
1279 DTOR is a destructor FUNCTION_DECL.
1281 <special-name> ::= D0 # deleting (in-charge) destructor
1282 ::= D1 # complete object (in-charge) destructor
1283 ::= D2 # base object (not-in-charge) destructor
1285 We also need to provide mangled names for the maybe-incharge
1286 destructor, so we treat it here too. mangle_decl_string will
1287 append *INTERNAL* to that, to make sure we never emit it. */
1290 write_special_name_destructor (const tree dtor)
1292 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1293 write_string ("D0");
1294 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1295 /* Even though we don't ever emit a definition of the
1296 old-style destructor, we still have to consider entities
1297 (like static variables) nested inside it. */
1298 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
1299 write_string ("D1");
1300 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1301 write_string ("D2");
1306 /* Return the discriminator for ENTITY appearing inside
1307 FUNCTION. The discriminator is the lexical ordinal of VAR among
1308 entities with the same name in the same FUNCTION. */
1311 discriminator_for_local_entity (tree entity)
1315 /* Assume this is the only local entity with this name. */
1316 int discriminator = 0;
1318 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1319 discriminator = DECL_DISCRIMINATOR (entity);
1320 else if (TREE_CODE (entity) == TYPE_DECL)
1322 /* Scan the list of local classes. */
1323 entity = TREE_TYPE (entity);
1324 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1325 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1326 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1330 return discriminator;
1333 /* Return the discriminator for STRING, a string literal used inside
1334 FUNCTION. The discriminator is the lexical ordinal of STRING among
1335 string literals used in FUNCTION. */
1338 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1339 tree string ATTRIBUTE_UNUSED)
1341 /* For now, we don't discriminate amongst string literals. */
1345 /* <discriminator> := _ <number>
1347 The discriminator is used only for the second and later occurrences
1348 of the same name within a single function. In this case <number> is
1349 n - 2, if this is the nth occurrence, in lexical order. */
1352 write_discriminator (const int discriminator)
1354 /* If discriminator is zero, don't write anything. Otherwise... */
1355 if (discriminator > 0)
1358 write_unsigned_number (discriminator - 1);
1362 /* Mangle the name of a function-scope entity. FUNCTION is the
1363 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1364 the entity itself. LOCAL_ENTITY is the entity that's directly
1365 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1368 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1369 := Z <function encoding> E s [<discriminator>] */
1372 write_local_name (const tree function, const tree local_entity,
1375 MANGLE_TRACE_TREE ("local-name", entity);
1378 write_encoding (function);
1380 if (TREE_CODE (entity) == STRING_CST)
1383 write_discriminator (discriminator_for_string_literal (function,
1388 /* Now the <entity name>. Let write_name know its being called
1389 from <local-name>, so it doesn't try to process the enclosing
1390 function scope again. */
1391 write_name (entity, /*ignore_local_scope=*/1);
1392 write_discriminator (discriminator_for_local_entity (local_entity));
1396 /* Non-terminals <type> and <CV-qualifier>.
1398 <type> ::= <builtin-type>
1400 ::= <class-enum-type>
1402 ::= <pointer-to-member-type>
1403 ::= <template-param>
1406 ::= P <type> # pointer-to
1407 ::= R <type> # reference-to
1408 ::= C <type> # complex pair (C 2000)
1409 ::= G <type> # imaginary (C 2000) [not supported]
1410 ::= U <source-name> <type> # vendor extended type qualifier
1412 TYPE is a type node. */
1415 write_type (tree type)
1417 /* This gets set to nonzero if TYPE turns out to be a (possibly
1418 CV-qualified) builtin type. */
1419 int is_builtin_type = 0;
1421 MANGLE_TRACE_TREE ("type", type);
1423 if (type == error_mark_node)
1426 if (find_substitution (type))
1429 if (write_CV_qualifiers_for_type (type) > 0)
1430 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1431 mangle the unqualified type. The recursive call is needed here
1432 since both the qualified and unqualified types are substitution
1434 write_type (TYPE_MAIN_VARIANT (type));
1435 else if (TREE_CODE (type) == ARRAY_TYPE)
1436 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1437 so that the cv-qualification of the element type is available
1438 in write_array_type. */
1439 write_array_type (type);
1442 /* See through any typedefs. */
1443 type = TYPE_MAIN_VARIANT (type);
1445 if (TYPE_PTRMEM_P (type))
1446 write_pointer_to_member_type (type);
1447 else switch (TREE_CODE (type))
1451 case INTEGER_TYPE: /* Includes wchar_t. */
1453 /* If this is a typedef, TYPE may not be one of
1454 the standard builtin type nodes, but an alias of one. Use
1455 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1456 write_builtin_type (TYPE_MAIN_VARIANT (type));
1462 write_type (TREE_TYPE (type));
1467 write_function_type (type);
1473 /* A pointer-to-member function is represented as a special
1474 RECORD_TYPE, so check for this first. */
1475 if (TYPE_PTRMEMFUNC_P (type))
1476 write_pointer_to_member_type (type);
1478 write_class_enum_type (type);
1482 case UNBOUND_CLASS_TEMPLATE:
1483 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1484 ordinary nested names. */
1485 write_nested_name (TYPE_STUB_DECL (type));
1490 write_type (TREE_TYPE (type));
1493 case REFERENCE_TYPE:
1495 write_type (TREE_TYPE (type));
1498 case TEMPLATE_TYPE_PARM:
1499 case TEMPLATE_PARM_INDEX:
1500 write_template_param (type);
1503 case TEMPLATE_TEMPLATE_PARM:
1504 write_template_template_param (type);
1507 case BOUND_TEMPLATE_TEMPLATE_PARM:
1508 write_template_template_param (type);
1510 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1514 write_string ("U8__vector");
1515 write_type (TREE_TYPE (type));
1523 /* Types other than builtin types are substitution candidates. */
1524 if (!is_builtin_type)
1525 add_substitution (type);
1528 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1529 CV-qualifiers written for TYPE.
1531 <CV-qualifiers> ::= [r] [V] [K] */
1534 write_CV_qualifiers_for_type (const tree type)
1536 int num_qualifiers = 0;
1538 /* The order is specified by:
1540 "In cases where multiple order-insensitive qualifiers are
1541 present, they should be ordered 'K' (closest to the base type),
1542 'V', 'r', and 'U' (farthest from the base type) ..."
1544 Note that we do not use cp_type_quals below; given "const
1545 int[3]", the "const" is emitted with the "int", not with the
1548 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1553 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1558 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1564 return num_qualifiers;
1567 /* Non-terminal <builtin-type>.
1569 <builtin-type> ::= v # void
1574 ::= h # unsigned char
1576 ::= t # unsigned short
1578 ::= j # unsigned int
1580 ::= m # unsigned long
1581 ::= x # long long, __int64
1582 ::= y # unsigned long long, __int64
1584 ::= o # unsigned __int128
1587 ::= e # long double, __float80
1588 ::= g # __float128 [not supported]
1589 ::= u <source-name> # vendor extended type */
1592 write_builtin_type (tree type)
1594 switch (TREE_CODE (type))
1605 /* If this is size_t, get the underlying int type. */
1606 if (TYPE_IS_SIZETYPE (type))
1607 type = TYPE_DOMAIN (type);
1609 /* TYPE may still be wchar_t, since that isn't in
1610 integer_type_nodes. */
1611 if (type == wchar_type_node)
1613 else if (TYPE_FOR_JAVA (type))
1614 write_java_integer_type_codes (type);
1618 /* Assume TYPE is one of the shared integer type nodes. Find
1619 it in the array of these nodes. */
1621 for (itk = 0; itk < itk_none; ++itk)
1622 if (type == integer_types[itk])
1624 /* Print the corresponding single-letter code. */
1625 write_char (integer_type_codes[itk]);
1629 if (itk == itk_none)
1631 tree t = c_common_type_for_mode (TYPE_MODE (type),
1632 TREE_UNSIGNED (type));
1635 if (TYPE_PRECISION (type) == 128)
1636 write_char (TREE_UNSIGNED (type) ? 'o' : 'n');
1638 /* Couldn't find this type. */
1651 if (type == float_type_node
1652 || type == java_float_type_node)
1654 else if (type == double_type_node
1655 || type == java_double_type_node)
1657 else if (type == long_double_type_node)
1668 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1669 METHOD_TYPE. The return type is mangled before the parameter
1672 <function-type> ::= F [Y] <bare-function-type> E */
1675 write_function_type (const tree type)
1677 MANGLE_TRACE_TREE ("function-type", type);
1679 /* For a pointer to member function, the function type may have
1680 cv-qualifiers, indicating the quals for the artificial 'this'
1682 if (TREE_CODE (type) == METHOD_TYPE)
1684 /* The first parameter must be a POINTER_TYPE pointing to the
1685 `this' parameter. */
1686 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1687 write_CV_qualifiers_for_type (this_type);
1691 /* We don't track whether or not a type is `extern "C"'. Note that
1692 you can have an `extern "C"' function that does not have
1693 `extern "C"' type, and vice versa:
1695 extern "C" typedef void function_t();
1696 function_t f; // f has C++ linkage, but its type is
1699 typedef void function_t();
1700 extern "C" function_t f; // Vice versa.
1703 write_bare_function_type (type, /*include_return_type_p=*/1,
1708 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1709 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1710 is mangled before the parameter types. If non-NULL, DECL is
1711 FUNCTION_DECL for the function whose type is being emitted.
1713 <bare-function-type> ::= </signature/ type>+ */
1716 write_bare_function_type (const tree type, const int include_return_type_p,
1719 MANGLE_TRACE_TREE ("bare-function-type", type);
1721 /* Mangle the return type, if requested. */
1722 if (include_return_type_p)
1723 write_type (TREE_TYPE (type));
1725 /* Now mangle the types of the arguments. */
1726 write_method_parms (TYPE_ARG_TYPES (type),
1727 TREE_CODE (type) == METHOD_TYPE,
1731 /* Write the mangled representation of a method parameter list of
1732 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1733 considered a non-static method, and the this parameter is omitted.
1734 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1735 parameters are being emitted. */
1738 write_method_parms (tree parm_types, const int method_p, const tree decl)
1740 tree first_parm_type;
1741 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1743 /* Assume this parameter type list is variable-length. If it ends
1744 with a void type, then it's not. */
1747 /* If this is a member function, skip the first arg, which is the
1749 "Member functions do not encode the type of their implicit this
1752 Similarly, there's no need to mangle artificial parameters, like
1753 the VTT parameters for constructors and destructors. */
1756 parm_types = TREE_CHAIN (parm_types);
1757 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1759 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1761 parm_types = TREE_CHAIN (parm_types);
1762 parm_decl = TREE_CHAIN (parm_decl);
1766 for (first_parm_type = parm_types;
1768 parm_types = TREE_CHAIN (parm_types))
1770 tree parm = TREE_VALUE (parm_types);
1771 if (parm == void_type_node)
1773 /* "Empty parameter lists, whether declared as () or
1774 conventionally as (void), are encoded with a void parameter
1776 if (parm_types == first_parm_type)
1778 /* If the parm list is terminated with a void type, it's
1781 /* A void type better be the last one. */
1782 my_friendly_assert (TREE_CHAIN (parm_types) == NULL, 20000523);
1789 /* <builtin-type> ::= z # ellipsis */
1793 /* <class-enum-type> ::= <name> */
1796 write_class_enum_type (const tree type)
1798 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1801 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1804 <template-args> ::= I <template-arg>+ E */
1807 write_template_args (tree args)
1809 MANGLE_TRACE_TREE ("template-args", args);
1813 if (TREE_CODE (args) == TREE_VEC)
1816 int length = TREE_VEC_LENGTH (args);
1817 my_friendly_assert (length > 0, 20000422);
1819 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1821 /* We have nested template args. We want the innermost template
1823 args = TREE_VEC_ELT (args, length - 1);
1824 length = TREE_VEC_LENGTH (args);
1826 for (i = 0; i < length; ++i)
1827 write_template_arg (TREE_VEC_ELT (args, i));
1831 my_friendly_assert (TREE_CODE (args) == TREE_LIST, 20021014);
1835 write_template_arg (TREE_VALUE (args));
1836 args = TREE_CHAIN (args);
1843 /* <expression> ::= <unary operator-name> <expression>
1844 ::= <binary operator-name> <expression> <expression>
1847 <expr-primary> ::= <template-param>
1848 ::= L <type> <value number> E # literal
1849 ::= L <mangled-name> E # external name
1850 ::= sr <type> <unqualified-name>
1851 ::= sr <type> <unqualified-name> <template-args> */
1854 write_expression (tree expr)
1856 enum tree_code code;
1858 code = TREE_CODE (expr);
1860 /* Handle pointers-to-members by making them look like expression
1862 if (code == PTRMEM_CST)
1864 expr = build_nt (ADDR_EXPR,
1865 build_nt (SCOPE_REF,
1866 PTRMEM_CST_CLASS (expr),
1867 PTRMEM_CST_MEMBER (expr)));
1868 code = TREE_CODE (expr);
1871 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1872 is converted (via qualification conversions) to another
1874 while (TREE_CODE (expr) == NOP_EXPR
1875 || TREE_CODE (expr) == NON_LVALUE_EXPR)
1877 expr = TREE_OPERAND (expr, 0);
1878 code = TREE_CODE (expr);
1881 /* Handle template parameters. */
1882 if (code == TEMPLATE_TYPE_PARM
1883 || code == TEMPLATE_TEMPLATE_PARM
1884 || code == BOUND_TEMPLATE_TEMPLATE_PARM
1885 || code == TEMPLATE_PARM_INDEX)
1886 write_template_param (expr);
1887 /* Handle literals. */
1888 else if (TREE_CODE_CLASS (code) == 'c'
1889 || (abi_version_at_least (2) && code == CONST_DECL))
1890 write_template_arg_literal (expr);
1891 else if (DECL_P (expr))
1893 /* G++ 3.2 incorrectly mangled non-type template arguments of
1894 enumeration type using their names. */
1895 if (code == CONST_DECL)
1896 G.need_abi_warning = 1;
1898 write_mangled_name (expr);
1901 else if (TREE_CODE (expr) == SIZEOF_EXPR
1902 && TYPE_P (TREE_OPERAND (expr, 0)))
1904 write_string ("st");
1905 write_type (TREE_OPERAND (expr, 0));
1907 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
1909 tree scope = TREE_OPERAND (expr, 0);
1910 tree member = TREE_OPERAND (expr, 1);
1912 /* If the MEMBER is a real declaration, then the qualifying
1913 scope was not dependent. Ideally, we would not have a
1914 SCOPE_REF in those cases, but sometimes we do. If the second
1915 argument is a DECL, then the name must not have been
1917 if (DECL_P (member))
1918 write_expression (member);
1923 write_string ("sr");
1925 /* If MEMBER is a template-id, separate the template
1926 from the arguments. */
1927 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
1929 template_args = TREE_OPERAND (member, 1);
1930 member = TREE_OPERAND (member, 0);
1933 template_args = NULL_TREE;
1934 /* Write out the name of the MEMBER. */
1935 if (IDENTIFIER_TYPENAME_P (member))
1936 write_conversion_operator_name (TREE_TYPE (member));
1937 else if (IDENTIFIER_OPNAME_P (member))
1940 const char *mangled_name = NULL;
1942 /* Unfortunately, there is no easy way to go from the
1943 name of the operator back to the corresponding tree
1945 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
1946 if (operator_name_info[i].identifier == member)
1948 /* The ABI says that we prefer binary operator
1949 names to unary operator names. */
1950 if (operator_name_info[i].arity == 2)
1952 mangled_name = operator_name_info[i].mangled_name;
1955 else if (!mangled_name)
1956 mangled_name = operator_name_info[i].mangled_name;
1958 else if (assignment_operator_name_info[i].identifier
1962 = assignment_operator_name_info[i].mangled_name;
1965 write_string (mangled_name);
1968 write_source_name (member);
1969 /* Write out the template arguments. */
1971 write_template_args (template_args);
1978 /* When we bind a variable or function to a non-type template
1979 argument with reference type, we create an ADDR_EXPR to show
1980 the fact that the entity's address has been taken. But, we
1981 don't actually want to output a mangling code for the `&'. */
1982 if (TREE_CODE (expr) == ADDR_EXPR
1984 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
1986 expr = TREE_OPERAND (expr, 0);
1989 write_expression (expr);
1993 code = TREE_CODE (expr);
1996 /* If it wasn't any of those, recursively expand the expression. */
1997 write_string (operator_name_info[(int) code].mangled_name);
2002 sorry ("call_expr cannot be mangled due to a defect in the C++ ABI");
2006 write_type (TREE_TYPE (expr));
2007 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2010 case STATIC_CAST_EXPR:
2011 case CONST_CAST_EXPR:
2012 write_type (TREE_TYPE (expr));
2013 write_expression (TREE_OPERAND (expr, 0));
2017 /* Handle pointers-to-members specially. */
2019 write_type (TREE_OPERAND (expr, 0));
2020 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2021 write_source_name (TREE_OPERAND (expr, 1));
2022 else if (TREE_CODE (TREE_OPERAND (expr, 1)) == TEMPLATE_ID_EXPR)
2027 template_id = TREE_OPERAND (expr, 1);
2028 name = TREE_OPERAND (template_id, 0);
2029 /* FIXME: What about operators? */
2030 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE,
2032 write_source_name (TREE_OPERAND (template_id, 0));
2033 write_template_args (TREE_OPERAND (template_id, 1));
2037 /* G++ 3.2 incorrectly put out both the "sr" code and
2038 the nested name of the qualified name. */
2039 G.need_abi_warning = 1;
2040 write_encoding (TREE_OPERAND (expr, 1));
2045 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
2047 tree operand = TREE_OPERAND (expr, i);
2048 /* As a GNU expression, the middle operand of a
2049 conditional may be omitted. Since expression
2050 manglings are supposed to represent the input token
2051 stream, there's no good way to mangle such an
2052 expression without extending the C++ ABI. */
2053 if (code == COND_EXPR && i == 1 && !operand)
2055 error ("omitted middle operand to `?:' operand "
2056 "cannot be mangled");
2059 write_expression (operand);
2065 /* Literal subcase of non-terminal <template-arg>.
2067 "Literal arguments, e.g. "A<42L>", are encoded with their type
2068 and value. Negative integer values are preceded with "n"; for
2069 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2070 encoded as 0, true as 1." */
2073 write_template_arg_literal (const tree value)
2075 tree type = TREE_TYPE (value);
2079 if (TREE_CODE (value) == CONST_DECL)
2080 write_integer_cst (DECL_INITIAL (value));
2081 else if (TREE_CODE (value) == INTEGER_CST)
2083 if (same_type_p (type, boolean_type_node))
2085 if (value == boolean_false_node || integer_zerop (value))
2086 write_unsigned_number (0);
2087 else if (value == boolean_true_node)
2088 write_unsigned_number (1);
2093 write_integer_cst (value);
2095 else if (TREE_CODE (value) == REAL_CST)
2096 write_real_cst (value);
2103 /* Non-terminal <tempalate-arg>.
2105 <template-arg> ::= <type> # type
2106 ::= L <type> </value/ number> E # literal
2107 ::= LZ <name> E # external name
2108 ::= X <expression> E # expression */
2111 write_template_arg (tree node)
2113 enum tree_code code = TREE_CODE (node);
2115 MANGLE_TRACE_TREE ("template-arg", node);
2117 /* A template template paramter's argument list contains TREE_LIST
2118 nodes of which the value field is the the actual argument. */
2119 if (code == TREE_LIST)
2121 node = TREE_VALUE (node);
2122 /* If it's a decl, deal with its type instead. */
2125 node = TREE_TYPE (node);
2126 code = TREE_CODE (node);
2132 else if (code == TEMPLATE_DECL)
2133 /* A template appearing as a template arg is a template template arg. */
2134 write_template_template_arg (node);
2135 else if ((TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
2136 || (abi_version_at_least (2) && code == CONST_DECL))
2137 write_template_arg_literal (node);
2138 else if (DECL_P (node))
2140 /* G++ 3.2 incorrectly mangled non-type template arguments of
2141 enumeration type using their names. */
2142 if (code == CONST_DECL)
2143 G.need_abi_warning = 1;
2146 write_encoding (node);
2151 /* Template arguments may be expressions. */
2153 write_expression (node);
2158 /* <template-template-arg>
2160 ::= <substitution> */
2163 write_template_template_arg (const tree decl)
2165 MANGLE_TRACE_TREE ("template-template-arg", decl);
2167 if (find_substitution (decl))
2169 write_name (decl, /*ignore_local_scope=*/0);
2170 add_substitution (decl);
2174 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2176 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2177 ::= A <expression> _ </element/ type>
2179 "Array types encode the dimension (number of elements) and the
2180 element type. For variable length arrays, the dimension (but not
2181 the '_' separator) is omitted." */
2184 write_array_type (const tree type)
2187 if (TYPE_DOMAIN (type))
2192 index_type = TYPE_DOMAIN (type);
2193 /* The INDEX_TYPE gives the upper and lower bounds of the
2195 max = TYPE_MAX_VALUE (index_type);
2196 if (TREE_CODE (max) == INTEGER_CST)
2198 /* The ABI specifies that we should mangle the number of
2199 elements in the array, not the largest allowed index. */
2200 max = size_binop (PLUS_EXPR, max, size_one_node);
2201 write_unsigned_number (tree_low_cst (max, 1));
2204 write_expression (TREE_OPERAND (max, 0));
2207 write_type (TREE_TYPE (type));
2210 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2211 variables. TYPE is a pointer-to-member POINTER_TYPE.
2213 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2216 write_pointer_to_member_type (const tree type)
2219 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2220 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2223 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2224 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2225 TEMPLATE_PARM_INDEX.
2227 <template-param> ::= T </parameter/ number> _ */
2230 write_template_param (const tree parm)
2234 tree parm_type = NULL_TREE;
2236 MANGLE_TRACE_TREE ("template-parm", parm);
2238 switch (TREE_CODE (parm))
2240 case TEMPLATE_TYPE_PARM:
2241 case TEMPLATE_TEMPLATE_PARM:
2242 case BOUND_TEMPLATE_TEMPLATE_PARM:
2243 parm_index = TEMPLATE_TYPE_IDX (parm);
2244 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2247 case TEMPLATE_PARM_INDEX:
2248 parm_index = TEMPLATE_PARM_IDX (parm);
2249 parm_level = TEMPLATE_PARM_LEVEL (parm);
2250 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2258 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2259 earliest template param denoted by `_'. */
2261 write_unsigned_number (parm_index - 1);
2265 /* <template-template-param>
2266 ::= <template-param>
2267 ::= <substitution> */
2270 write_template_template_param (const tree parm)
2272 tree template = NULL_TREE;
2274 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2275 template template parameter. The substitution candidate here is
2276 only the template. */
2277 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2280 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2281 if (find_substitution (template))
2285 /* <template-param> encodes only the template parameter position,
2286 not its template arguments, which is fine here. */
2287 write_template_param (parm);
2289 add_substitution (template);
2292 /* Non-terminal <substitution>.
2294 <substitution> ::= S <seq-id> _
2298 write_substitution (const int seq_id)
2300 MANGLE_TRACE ("substitution", "");
2304 write_number (seq_id - 1, /*unsigned=*/1, 36);
2308 /* Start mangling ENTITY. */
2311 start_mangling (const tree entity)
2314 G.need_abi_warning = false;
2315 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
2316 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
2319 /* Done with mangling. Return the generated mangled name. If WARN is
2320 true, and the name of G.entity will be mangled differently in a
2321 future version of the ABI, issue a warning. */
2323 static inline const char *
2324 finish_mangling (const bool warn)
2326 if (warn_abi && warn && G.need_abi_warning)
2327 warning ("the mangled name of `%D' will change in a future "
2331 /* Clear all the substitutions. */
2332 G.substitutions = 0;
2334 /* Null-terminate the string. */
2337 return (const char *) obstack_base (&G.name_obstack);
2340 /* Initialize data structures for mangling. */
2345 gcc_obstack_init (&G.name_obstack);
2347 /* Cache these identifiers for quick comparison when checking for
2348 standard substitutions. */
2349 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2350 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2351 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2352 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2353 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2354 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2357 /* Generate the mangled name of DECL. */
2360 mangle_decl_string (const tree decl)
2364 start_mangling (decl);
2366 if (TREE_CODE (decl) == TYPE_DECL)
2367 write_type (TREE_TYPE (decl));
2368 else if (/* The names of `extern "C"' functions are not mangled. */
2369 (DECL_EXTERN_C_FUNCTION_P (decl)
2370 /* But overloaded operator names *are* mangled. */
2371 && !DECL_OVERLOADED_OPERATOR_P (decl))
2372 /* The names of global variables aren't mangled either. */
2373 || (TREE_CODE (decl) == VAR_DECL
2374 && CP_DECL_CONTEXT (decl) == global_namespace)
2375 /* And neither are `extern "C"' variables. */
2376 || (TREE_CODE (decl) == VAR_DECL
2377 && DECL_EXTERN_C_P (decl)))
2378 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
2381 write_mangled_name (decl);
2382 if (DECL_LANG_SPECIFIC (decl)
2383 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
2384 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
2385 /* We need a distinct mangled name for these entities, but
2386 we should never actually output it. So, we append some
2387 characters the assembler won't like. */
2388 write_string (" *INTERNAL* ");
2391 result = finish_mangling (/*warn=*/true);
2393 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2397 /* Create an identifier for the external mangled name of DECL. */
2400 mangle_decl (const tree decl)
2402 tree id = get_identifier (mangle_decl_string (decl));
2404 SET_DECL_ASSEMBLER_NAME (decl, id);
2407 /* Generate the mangled representation of TYPE. */
2410 mangle_type_string (const tree type)
2414 start_mangling (type);
2416 result = finish_mangling (/*warn=*/false);
2418 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2422 /* Create an identifier for the mangled representation of TYPE. */
2425 mangle_type (const tree type)
2427 return get_identifier (mangle_type_string (type));
2430 /* Create an identifier for the mangled name of a special component
2431 for belonging to TYPE. CODE is the ABI-specified code for this
2435 mangle_special_for_type (const tree type, const char *code)
2439 /* We don't have an actual decl here for the special component, so
2440 we can't just process the <encoded-name>. Instead, fake it. */
2441 start_mangling (type);
2443 /* Start the mangling. */
2444 write_string ("_Z");
2445 write_string (code);
2449 result = finish_mangling (/*warn=*/false);
2452 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2454 return get_identifier (result);
2457 /* Create an identifier for the mangled representation of the typeinfo
2458 structure for TYPE. */
2461 mangle_typeinfo_for_type (const tree type)
2463 return mangle_special_for_type (type, "TI");
2466 /* Create an identifier for the mangled name of the NTBS containing
2467 the mangled name of TYPE. */
2470 mangle_typeinfo_string_for_type (const tree type)
2472 return mangle_special_for_type (type, "TS");
2475 /* Create an identifier for the mangled name of the vtable for TYPE. */
2478 mangle_vtbl_for_type (const tree type)
2480 return mangle_special_for_type (type, "TV");
2483 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2486 mangle_vtt_for_type (const tree type)
2488 return mangle_special_for_type (type, "TT");
2491 /* Return an identifier for a construction vtable group. TYPE is
2492 the most derived class in the hierarchy; BINFO is the base
2493 subobject for which this construction vtable group will be used.
2495 This mangling isn't part of the ABI specification; in the ABI
2496 specification, the vtable group is dumped in the same COMDAT as the
2497 main vtable, and is referenced only from that vtable, so it doesn't
2498 need an external name. For binary formats without COMDAT sections,
2499 though, we need external names for the vtable groups.
2501 We use the production
2503 <special-name> ::= CT <type> <offset number> _ <base type> */
2506 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2510 start_mangling (type);
2512 write_string ("_Z");
2513 write_string ("TC");
2515 write_integer_cst (BINFO_OFFSET (binfo));
2517 write_type (BINFO_TYPE (binfo));
2519 result = finish_mangling (/*warn=*/false);
2521 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2522 return get_identifier (result);
2525 /* Mangle a this pointer or result pointer adjustment.
2527 <call-offset> ::= h <fixed offset number> _
2528 ::= v <fixed offset number> _ <virtual offset number> _ */
2531 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2533 write_char (virtual_offset ? 'v' : 'h');
2535 /* For either flavor, write the fixed offset. */
2536 write_integer_cst (fixed_offset);
2539 /* For a virtual thunk, add the virtual offset. */
2542 write_integer_cst (virtual_offset);
2547 /* Return an identifier for the mangled name of a this-adjusting or
2548 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2549 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2550 is a virtual thunk, and it is the vtbl offset in
2551 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2552 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2553 thunk itself. A covariant thunk name always includes the adjustment
2554 for the this pointer, even if there is none.
2556 <special-name> ::= T <call-offset> <base encoding>
2557 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2562 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2563 tree virtual_offset)
2567 start_mangling (fn_decl);
2569 write_string ("_Z");
2572 if (!this_adjusting)
2574 /* Covariant thunk with no this adjustment */
2576 mangle_call_offset (integer_zero_node, NULL_TREE);
2577 mangle_call_offset (fixed_offset, virtual_offset);
2579 else if (!DECL_THUNK_P (fn_decl))
2580 /* Plain this adjusting thunk. */
2581 mangle_call_offset (fixed_offset, virtual_offset);
2584 /* This adjusting thunk to covariant thunk. */
2586 mangle_call_offset (fixed_offset, virtual_offset);
2587 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2588 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2590 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2591 mangle_call_offset (fixed_offset, virtual_offset);
2592 fn_decl = THUNK_TARGET (fn_decl);
2596 write_encoding (fn_decl);
2598 result = finish_mangling (/*warn=*/false);
2600 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2601 return get_identifier (result);
2604 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2605 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
2608 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
2610 /* Hash a node (VAL1) in the table. */
2613 hash_type (const void *val)
2615 return (hashval_t) TYPE_UID (TREE_TYPE ((tree) val));
2618 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2621 compare_type (const void *val1, const void *val2)
2623 return TREE_TYPE ((tree) val1) == (tree) val2;
2626 /* Return an identifier for the mangled unqualified name for a
2627 conversion operator to TYPE. This mangling is not specified by the
2628 ABI spec; it is only used internally. */
2631 mangle_conv_op_name_for_type (const tree type)
2636 if (conv_type_names == NULL)
2637 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
2639 slot = htab_find_slot_with_hash (conv_type_names, type,
2640 (hashval_t) TYPE_UID (type), INSERT);
2641 identifier = (tree)*slot;
2646 /* Create a unique name corresponding to TYPE. */
2647 sprintf (buffer, "operator %lu",
2648 (unsigned long) htab_elements (conv_type_names));
2649 identifier = get_identifier (buffer);
2652 /* Hang TYPE off the identifier so it can be found easily later
2653 when performing conversions. */
2654 TREE_TYPE (identifier) = type;
2656 /* Set bits on the identifier so we know later it's a conversion. */
2657 IDENTIFIER_OPNAME_P (identifier) = 1;
2658 IDENTIFIER_TYPENAME_P (identifier) = 1;
2664 /* Return an identifier for the name of an initialization guard
2665 variable for indicated VARIABLE. */
2668 mangle_guard_variable (const tree variable)
2670 start_mangling (variable);
2671 write_string ("_ZGV");
2672 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2673 /* The name of a guard variable for a reference temporary should refer
2674 to the reference, not the temporary. */
2675 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2677 write_name (variable, /*ignore_local_scope=*/0);
2678 return get_identifier (finish_mangling (/*warn=*/false));
2681 /* Return an identifier for the name of a temporary variable used to
2682 initialize a static reference. This isn't part of the ABI, but we might
2683 as well call them something readable. */
2686 mangle_ref_init_variable (const tree variable)
2688 start_mangling (variable);
2689 write_string ("_ZGR");
2690 write_name (variable, /*ignore_local_scope=*/0);
2691 return get_identifier (finish_mangling (/*warn=*/false));
2695 /* Foreign language type mangling section. */
2697 /* How to write the type codes for the integer Java type. */
2700 write_java_integer_type_codes (const tree type)
2702 if (type == java_int_type_node)
2704 else if (type == java_short_type_node)
2706 else if (type == java_byte_type_node)
2708 else if (type == java_char_type_node)
2710 else if (type == java_long_type_node)
2712 else if (type == java_boolean_type_node)
2718 #include "gt-cp-mangle.h"