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 ()
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 accordinginly 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_CONV_FN_P (decl))
996 /* Conversion operator. Handle it right here.
997 <operator> ::= cv <type> */
999 if (decl_is_template_id (decl, NULL))
1001 tree fn_type = get_mostly_instantiated_function_type (decl);
1002 type = TREE_TYPE (fn_type);
1005 type = DECL_CONV_FN_TYPE (decl);
1006 write_conversion_operator_name (type);
1008 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1010 operator_name_info_t *oni;
1011 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1012 oni = assignment_operator_name_info;
1014 oni = operator_name_info;
1016 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1019 write_source_name (DECL_NAME (decl));
1022 /* Write the unqualified-name for a conversion operator to TYPE. */
1025 write_conversion_operator_name (const tree type)
1027 write_string ("cv");
1031 /* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1033 <source-name> ::= </length/ number> <identifier> */
1036 write_source_name (tree identifier)
1038 MANGLE_TRACE_TREE ("source-name", identifier);
1040 /* Never write the whole template-id name including the template
1041 arguments; we only want the template name. */
1042 if (IDENTIFIER_TEMPLATE (identifier))
1043 identifier = IDENTIFIER_TEMPLATE (identifier);
1045 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1046 write_identifier (IDENTIFIER_POINTER (identifier));
1049 /* Convert NUMBER to ascii using base BASE and generating at least
1050 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1051 into which to store the characters. Returns the number of
1052 characters generated (these will be layed out in advance of where
1056 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1057 char *buffer, const unsigned int min_digits)
1059 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1060 unsigned digits = 0;
1064 unsigned HOST_WIDE_INT d = number / base;
1066 *--buffer = base_digits[number - d * base];
1070 while (digits < min_digits)
1072 *--buffer = base_digits[0];
1078 /* Non-terminal <number>.
1080 <number> ::= [n] </decimal integer/> */
1083 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1084 const unsigned int base)
1086 char buffer[sizeof (HOST_WIDE_INT) * 8];
1089 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1092 number = -((HOST_WIDE_INT) number);
1094 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1095 write_chars (buffer + sizeof (buffer) - count, count);
1098 /* Write out an integral CST in decimal. Most numbers are small, and
1099 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1100 bigger than that, which we must deal with. */
1103 write_integer_cst (const tree cst)
1105 int sign = tree_int_cst_sgn (cst);
1107 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1109 /* A bignum. We do this in chunks, each of which fits in a
1111 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1112 unsigned HOST_WIDE_INT chunk;
1113 unsigned chunk_digits;
1114 char *ptr = buffer + sizeof (buffer);
1119 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1124 if (sizeof (HOST_WIDE_INT) >= 8)
1126 /* It is at least 64 bits, so 10^18 is representable. */
1131 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1132 base = build_int_2 (chunk, 0);
1133 n = build_int_2 (TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1134 TREE_TYPE (n) = TREE_TYPE (base) = type;
1139 n = fold (build1 (NEGATE_EXPR, type, n));
1143 tree d = fold (build (FLOOR_DIV_EXPR, type, n, base));
1144 tree tmp = fold (build (MULT_EXPR, type, d, base));
1147 done = integer_zerop (d);
1148 tmp = fold (build (MINUS_EXPR, type, n, tmp));
1149 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1150 done ? 1 : chunk_digits);
1156 write_chars (ptr, count);
1161 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1168 write_unsigned_number (low);
1172 /* Write out a floating-point literal.
1174 "Floating-point literals are encoded using the bit pattern of the
1175 target processor's internal representation of that number, as a
1176 fixed-length lowercase hexadecimal string, high-order bytes first
1177 (even if the target processor would store low-order bytes first).
1178 The "n" prefix is not used for floating-point literals; the sign
1179 bit is encoded with the rest of the number.
1181 Here are some examples, assuming the IEEE standard representation
1182 for floating point numbers. (Spaces are for readability, not
1183 part of the encoding.)
1186 -1.0f Lf bf80 0000 E
1187 1.17549435e-38f Lf 0080 0000 E
1188 1.40129846e-45f Lf 0000 0001 E
1189 0.0f Lf 0000 0000 E"
1191 Caller is responsible for the Lx and the E. */
1193 write_real_cst (const tree value)
1195 if (abi_version_at_least (2))
1197 long target_real[4]; /* largest supported float */
1198 char buffer[9]; /* eight hex digits in a 32-bit number */
1201 tree type = TREE_TYPE (value);
1202 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1204 real_to_target (target_real, &TREE_REAL_CST (value),
1207 /* The value in target_real is in the target word order,
1208 so we must write it out backward if that happens to be
1209 little-endian. write_number cannot be used, it will
1210 produce uppercase. */
1211 if (FLOAT_WORDS_BIG_ENDIAN)
1212 i = 0, limit = words, dir = 1;
1214 i = words - 1, limit = -1, dir = -1;
1216 for (; i != limit; i += dir)
1218 sprintf (buffer, "%08lx", target_real[i]);
1219 write_chars (buffer, 8);
1224 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1225 literally. Note that compatibility with 3.2 is impossible,
1226 because the old floating-point emulator used a different
1227 format for REAL_VALUE_TYPE. */
1229 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1230 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1233 G.need_abi_warning = 1;
1237 /* Non-terminal <identifier>.
1239 <identifier> ::= </unqualified source code identifier> */
1242 write_identifier (const char *identifier)
1244 MANGLE_TRACE ("identifier", identifier);
1245 write_string (identifier);
1248 /* Handle constructor productions of non-terminal <special-name>.
1249 CTOR is a constructor FUNCTION_DECL.
1251 <special-name> ::= C1 # complete object constructor
1252 ::= C2 # base object constructor
1253 ::= C3 # complete object allocating constructor
1255 Currently, allocating constructors are never used.
1257 We also need to provide mangled names for the maybe-in-charge
1258 constructor, so we treat it here too. mangle_decl_string will
1259 append *INTERNAL* to that, to make sure we never emit it. */
1262 write_special_name_constructor (const tree ctor)
1264 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1265 /* Even though we don't ever emit a definition of the
1266 old-style destructor, we still have to consider entities
1267 (like static variables) nested inside it. */
1268 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
1269 write_string ("C1");
1270 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1271 write_string ("C2");
1276 /* Handle destructor productions of non-terminal <special-name>.
1277 DTOR is a destructor FUNCTION_DECL.
1279 <special-name> ::= D0 # deleting (in-charge) destructor
1280 ::= D1 # complete object (in-charge) destructor
1281 ::= D2 # base object (not-in-charge) destructor
1283 We also need to provide mangled names for the maybe-incharge
1284 destructor, so we treat it here too. mangle_decl_string will
1285 append *INTERNAL* to that, to make sure we never emit it. */
1288 write_special_name_destructor (const tree dtor)
1290 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1291 write_string ("D0");
1292 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1293 /* Even though we don't ever emit a definition of the
1294 old-style destructor, we still have to consider entities
1295 (like static variables) nested inside it. */
1296 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
1297 write_string ("D1");
1298 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1299 write_string ("D2");
1304 /* Return the discriminator for ENTITY appearing inside
1305 FUNCTION. The discriminator is the lexical ordinal of VAR among
1306 entities with the same name in the same FUNCTION. */
1309 discriminator_for_local_entity (tree entity)
1313 /* Assume this is the only local entity with this name. */
1314 int discriminator = 0;
1316 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1317 discriminator = DECL_DISCRIMINATOR (entity);
1318 else if (TREE_CODE (entity) == TYPE_DECL)
1320 /* Scan the list of local classes. */
1321 entity = TREE_TYPE (entity);
1322 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1323 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1324 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1328 return discriminator;
1331 /* Return the discriminator for STRING, a string literal used inside
1332 FUNCTION. The disciminator is the lexical ordinal of STRING among
1333 string literals used in FUNCTION. */
1336 discriminator_for_string_literal (function, string)
1337 tree function ATTRIBUTE_UNUSED;
1338 tree string ATTRIBUTE_UNUSED;
1340 /* For now, we don't discriminate amongst string literals. */
1344 /* <discriminator> := _ <number>
1346 The discriminator is used only for the second and later occurrences
1347 of the same name within a single function. In this case <number> is
1348 n - 2, if this is the nth occurrence, in lexical order. */
1351 write_discriminator (const int discriminator)
1353 /* If discriminator is zero, don't write anything. Otherwise... */
1354 if (discriminator > 0)
1357 write_unsigned_number (discriminator - 1);
1361 /* Mangle the name of a function-scope entity. FUNCTION is the
1362 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1363 the entity itself. LOCAL_ENTITY is the entity that's directly
1364 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1367 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1368 := Z <function encoding> E s [<discriminator>] */
1371 write_local_name (const tree function, const tree local_entity,
1374 MANGLE_TRACE_TREE ("local-name", entity);
1377 write_encoding (function);
1379 if (TREE_CODE (entity) == STRING_CST)
1382 write_discriminator (discriminator_for_string_literal (function,
1387 /* Now the <entity name>. Let write_name know its being called
1388 from <local-name>, so it doesn't try to process the enclosing
1389 function scope again. */
1390 write_name (entity, /*ignore_local_scope=*/1);
1391 write_discriminator (discriminator_for_local_entity (local_entity));
1395 /* Non-terminals <type> and <CV-qualifier>.
1397 <type> ::= <builtin-type>
1399 ::= <class-enum-type>
1401 ::= <pointer-to-member-type>
1402 ::= <template-param>
1405 ::= P <type> # pointer-to
1406 ::= R <type> # reference-to
1407 ::= C <type> # complex pair (C 2000)
1408 ::= G <type> # imaginary (C 2000) [not supported]
1409 ::= U <source-name> <type> # vendor extended type qualifier
1411 TYPE is a type node. */
1414 write_type (tree type)
1416 /* This gets set to nonzero if TYPE turns out to be a (possibly
1417 CV-qualified) builtin type. */
1418 int is_builtin_type = 0;
1420 MANGLE_TRACE_TREE ("type", type);
1422 if (type == error_mark_node)
1425 if (find_substitution (type))
1428 if (write_CV_qualifiers_for_type (type) > 0)
1429 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1430 mangle the unqualified type. The recursive call is needed here
1431 since both the qualified and uqualified types are substitution
1433 write_type (TYPE_MAIN_VARIANT (type));
1434 else if (TREE_CODE (type) == ARRAY_TYPE)
1435 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1436 so that the cv-qualification of the element type is available
1437 in write_array_type. */
1438 write_array_type (type);
1441 /* See through any typedefs. */
1442 type = TYPE_MAIN_VARIANT (type);
1444 switch (TREE_CODE (type))
1448 case INTEGER_TYPE: /* Includes wchar_t. */
1450 /* If this is a typedef, TYPE may not be one of
1451 the standard builtin type nodes, but an alias of one. Use
1452 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1453 write_builtin_type (TYPE_MAIN_VARIANT (type));
1459 write_type (TREE_TYPE (type));
1464 write_function_type (type);
1470 /* A pointer-to-member function is represented as a special
1471 RECORD_TYPE, so check for this first. */
1472 if (TYPE_PTRMEMFUNC_P (type))
1473 write_pointer_to_member_type (type);
1475 write_class_enum_type (type);
1479 case UNBOUND_CLASS_TEMPLATE:
1480 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1481 ordinary nested names. */
1482 write_nested_name (TYPE_STUB_DECL (type));
1486 /* A pointer-to-member variable is represented by a POINTER_TYPE
1487 to an OFFSET_TYPE, so check for this first. */
1488 if (TYPE_PTRMEM_P (type))
1489 write_pointer_to_member_type (type);
1493 write_type (TREE_TYPE (type));
1497 case REFERENCE_TYPE:
1499 write_type (TREE_TYPE (type));
1502 case TEMPLATE_TYPE_PARM:
1503 case TEMPLATE_PARM_INDEX:
1504 write_template_param (type);
1507 case TEMPLATE_TEMPLATE_PARM:
1508 write_template_template_param (type);
1511 case BOUND_TEMPLATE_TEMPLATE_PARM:
1512 write_template_template_param (type);
1514 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1518 write_pointer_to_member_type (build_pointer_type (type));
1522 write_string ("U8__vector");
1523 write_type (TREE_TYPE (type));
1531 /* Types other than builtin types are substitution candidates. */
1532 if (!is_builtin_type)
1533 add_substitution (type);
1536 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1537 CV-qualifiers written for TYPE.
1539 <CV-qualifiers> ::= [r] [V] [K] */
1542 write_CV_qualifiers_for_type (const tree type)
1544 int num_qualifiers = 0;
1546 /* The order is specified by:
1548 "In cases where multiple order-insensitive qualifiers are
1549 present, they should be ordered 'K' (closest to the base type),
1550 'V', 'r', and 'U' (farthest from the base type) ..."
1552 Note that we do not use cp_type_quals below; given "const
1553 int[3]", the "const" is emitted with the "int", not with the
1556 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1561 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1566 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1572 return num_qualifiers;
1575 /* Non-terminal <builtin-type>.
1577 <builtin-type> ::= v # void
1582 ::= h # unsigned char
1584 ::= t # unsigned short
1586 ::= j # unsigned int
1588 ::= m # unsigned long
1589 ::= x # long long, __int64
1590 ::= y # unsigned long long, __int64
1592 ::= o # unsigned __int128
1595 ::= e # long double, __float80
1596 ::= g # __float128 [not supported]
1597 ::= u <source-name> # vendor extended type */
1600 write_builtin_type (tree type)
1602 switch (TREE_CODE (type))
1613 /* If this is size_t, get the underlying int type. */
1614 if (TYPE_IS_SIZETYPE (type))
1615 type = TYPE_DOMAIN (type);
1617 /* TYPE may still be wchar_t, since that isn't in
1618 integer_type_nodes. */
1619 if (type == wchar_type_node)
1621 else if (TYPE_FOR_JAVA (type))
1622 write_java_integer_type_codes (type);
1626 /* Assume TYPE is one of the shared integer type nodes. Find
1627 it in the array of these nodes. */
1629 for (itk = 0; itk < itk_none; ++itk)
1630 if (type == integer_types[itk])
1632 /* Print the corresponding single-letter code. */
1633 write_char (integer_type_codes[itk]);
1637 if (itk == itk_none)
1639 tree t = c_common_type_for_mode (TYPE_MODE (type),
1640 TREE_UNSIGNED (type));
1643 if (TYPE_PRECISION (type) == 128)
1644 write_char (TREE_UNSIGNED (type) ? 'o' : 'n');
1646 /* Couldn't find this type. */
1659 if (type == float_type_node
1660 || type == java_float_type_node)
1662 else if (type == double_type_node
1663 || type == java_double_type_node)
1665 else if (type == long_double_type_node)
1676 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1677 METHOD_TYPE. The return type is mangled before the parameter
1680 <function-type> ::= F [Y] <bare-function-type> E */
1683 write_function_type (const tree type)
1685 MANGLE_TRACE_TREE ("function-type", type);
1687 /* For a pointer to member function, the function type may have
1688 cv-qualifiers, indicating the quals for the artificial 'this'
1690 if (TREE_CODE (type) == METHOD_TYPE)
1692 /* The first parameter must be a POINTER_TYPE pointing to the
1693 `this' parameter. */
1694 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1695 write_CV_qualifiers_for_type (this_type);
1699 /* We don't track whether or not a type is `extern "C"'. Note that
1700 you can have an `extern "C"' function that does not have
1701 `extern "C"' type, and vice versa:
1703 extern "C" typedef void function_t();
1704 function_t f; // f has C++ linkage, but its type is
1707 typedef void function_t();
1708 extern "C" function_t f; // Vice versa.
1711 write_bare_function_type (type, /*include_return_type_p=*/1,
1716 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1717 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1718 is mangled before the parameter types. If non-NULL, DECL is
1719 FUNCTION_DECL for the function whose type is being emitted.
1721 <bare-function-type> ::= </signature/ type>+ */
1724 write_bare_function_type (const tree type, const int include_return_type_p,
1727 MANGLE_TRACE_TREE ("bare-function-type", type);
1729 /* Mangle the return type, if requested. */
1730 if (include_return_type_p)
1731 write_type (TREE_TYPE (type));
1733 /* Now mangle the types of the arguments. */
1734 write_method_parms (TYPE_ARG_TYPES (type),
1735 TREE_CODE (type) == METHOD_TYPE,
1739 /* Write the mangled representation of a method parameter list of
1740 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1741 considered a non-static method, and the this parameter is omitted.
1742 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1743 parameters are being emitted. */
1746 write_method_parms (tree parm_types, const int method_p, const tree decl)
1748 tree first_parm_type;
1749 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1751 /* Assume this parameter type list is variable-length. If it ends
1752 with a void type, then it's not. */
1755 /* If this is a member function, skip the first arg, which is the
1757 "Member functions do not encode the type of their implicit this
1760 Similarly, there's no need to mangle artificial parameters, like
1761 the VTT parameters for constructors and destructors. */
1764 parm_types = TREE_CHAIN (parm_types);
1765 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1767 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1769 parm_types = TREE_CHAIN (parm_types);
1770 parm_decl = TREE_CHAIN (parm_decl);
1774 for (first_parm_type = parm_types;
1776 parm_types = TREE_CHAIN (parm_types))
1778 tree parm = TREE_VALUE (parm_types);
1779 if (parm == void_type_node)
1781 /* "Empty parameter lists, whether declared as () or
1782 conventionally as (void), are encoded with a void parameter
1784 if (parm_types == first_parm_type)
1786 /* If the parm list is terminated with a void type, it's
1789 /* A void type better be the last one. */
1790 my_friendly_assert (TREE_CHAIN (parm_types) == NULL, 20000523);
1797 /* <builtin-type> ::= z # ellipsis */
1801 /* <class-enum-type> ::= <name> */
1804 write_class_enum_type (const tree type)
1806 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1809 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1812 <template-args> ::= I <template-arg>+ E */
1815 write_template_args (tree args)
1817 MANGLE_TRACE_TREE ("template-args", args);
1821 if (TREE_CODE (args) == TREE_VEC)
1824 int length = TREE_VEC_LENGTH (args);
1825 my_friendly_assert (length > 0, 20000422);
1827 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1829 /* We have nested template args. We want the innermost template
1831 args = TREE_VEC_ELT (args, length - 1);
1832 length = TREE_VEC_LENGTH (args);
1834 for (i = 0; i < length; ++i)
1835 write_template_arg (TREE_VEC_ELT (args, i));
1839 my_friendly_assert (TREE_CODE (args) == TREE_LIST, 20021014);
1843 write_template_arg (TREE_VALUE (args));
1844 args = TREE_CHAIN (args);
1851 /* <expression> ::= <unary operator-name> <expression>
1852 ::= <binary operator-name> <expression> <expression>
1855 <expr-primary> ::= <template-param>
1856 ::= L <type> <value number> E # literal
1857 ::= L <mangled-name> E # external name
1858 ::= sr <type> <unqualified-name>
1859 ::= sr <type> <unqualified-name> <template-args> */
1862 write_expression (tree expr)
1864 enum tree_code code;
1866 code = TREE_CODE (expr);
1868 /* Handle pointers-to-members by making them look like expression
1870 if (code == PTRMEM_CST)
1872 expr = build_nt (ADDR_EXPR,
1873 build_nt (SCOPE_REF,
1874 PTRMEM_CST_CLASS (expr),
1875 PTRMEM_CST_MEMBER (expr)));
1876 code = TREE_CODE (expr);
1879 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1880 is converted (via qualification conversions) to another
1882 while (TREE_CODE (expr) == NOP_EXPR
1883 || TREE_CODE (expr) == NON_LVALUE_EXPR)
1885 expr = TREE_OPERAND (expr, 0);
1886 code = TREE_CODE (expr);
1889 /* Handle template parameters. */
1890 if (code == TEMPLATE_TYPE_PARM
1891 || code == TEMPLATE_TEMPLATE_PARM
1892 || code == BOUND_TEMPLATE_TEMPLATE_PARM
1893 || code == TEMPLATE_PARM_INDEX)
1894 write_template_param (expr);
1895 /* Handle literals. */
1896 else if (TREE_CODE_CLASS (code) == 'c'
1897 || (abi_version_at_least (2) && code == CONST_DECL))
1898 write_template_arg_literal (expr);
1899 else if (DECL_P (expr))
1901 /* G++ 3.2 incorrectly mangled non-type template arguments of
1902 enumeration type using their names. */
1903 if (code == CONST_DECL)
1904 G.need_abi_warning = 1;
1906 write_mangled_name (expr);
1909 else if (TREE_CODE (expr) == SIZEOF_EXPR
1910 && TYPE_P (TREE_OPERAND (expr, 0)))
1912 write_string ("st");
1913 write_type (TREE_OPERAND (expr, 0));
1915 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
1917 tree scope = TREE_OPERAND (expr, 0);
1918 tree member = TREE_OPERAND (expr, 1);
1920 /* If the MEMBER is a real declaration, then the qualifying
1921 scope was not dependent. Ideally, we would not have a
1922 SCOPE_REF in those cases, but sometimes we do. If the second
1923 argument is a DECL, then the name must not have been
1925 if (DECL_P (member))
1926 write_expression (member);
1931 write_string ("sr");
1933 /* If MEMBER is a template-id, separate the template
1934 from the arguments. */
1935 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
1937 template_args = TREE_OPERAND (member, 1);
1938 member = TREE_OPERAND (member, 0);
1939 if (TREE_CODE (member) == LOOKUP_EXPR)
1940 member = TREE_OPERAND (member, 0);
1943 template_args = NULL_TREE;
1944 /* Write out the name of the MEMBER. */
1945 if (IDENTIFIER_TYPENAME_P (member))
1946 write_conversion_operator_name (TREE_TYPE (member));
1947 else if (IDENTIFIER_OPNAME_P (member))
1950 const char *mangled_name = NULL;
1952 /* Unfortunately, there is no easy way to go from the
1953 name of the operator back to the corresponding tree
1955 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
1956 if (operator_name_info[i].identifier == member)
1958 /* The ABI says that we prefer binary operator
1959 names to unary operator names. */
1960 if (operator_name_info[i].arity == 2)
1962 mangled_name = operator_name_info[i].mangled_name;
1965 else if (!mangled_name)
1966 mangled_name = operator_name_info[i].mangled_name;
1968 else if (assignment_operator_name_info[i].identifier
1972 = assignment_operator_name_info[i].mangled_name;
1975 write_string (mangled_name);
1978 write_source_name (member);
1979 /* Write out the template arguments. */
1981 write_template_args (template_args);
1988 /* When we bind a variable or function to a non-type template
1989 argument with reference type, we create an ADDR_EXPR to show
1990 the fact that the entity's address has been taken. But, we
1991 don't actually want to output a mangling code for the `&'. */
1992 if (TREE_CODE (expr) == ADDR_EXPR
1994 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
1996 expr = TREE_OPERAND (expr, 0);
1999 write_expression (expr);
2003 code = TREE_CODE (expr);
2006 /* If it wasn't any of those, recursively expand the expression. */
2007 write_string (operator_name_info[(int) code].mangled_name);
2012 write_type (TREE_TYPE (expr));
2013 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2016 case STATIC_CAST_EXPR:
2017 case CONST_CAST_EXPR:
2018 write_type (TREE_TYPE (expr));
2019 write_expression (TREE_OPERAND (expr, 0));
2023 /* Handle pointers-to-members specially. */
2025 write_type (TREE_OPERAND (expr, 0));
2026 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2027 write_source_name (TREE_OPERAND (expr, 1));
2030 /* G++ 3.2 incorrectly put out both the "sr" code and
2031 the nested name of the qualified name. */
2032 G.need_abi_warning = 1;
2033 write_encoding (TREE_OPERAND (expr, 1));
2038 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
2039 write_expression (TREE_OPERAND (expr, i));
2044 /* Literal subcase of non-terminal <template-arg>.
2046 "Literal arguments, e.g. "A<42L>", are encoded with their type
2047 and value. Negative integer values are preceded with "n"; for
2048 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2049 encoded as 0, true as 1." */
2052 write_template_arg_literal (const tree value)
2054 tree type = TREE_TYPE (value);
2058 if (TREE_CODE (value) == CONST_DECL)
2059 write_integer_cst (DECL_INITIAL (value));
2060 else if (TREE_CODE (value) == INTEGER_CST)
2062 if (same_type_p (type, boolean_type_node))
2064 if (value == boolean_false_node || integer_zerop (value))
2065 write_unsigned_number (0);
2066 else if (value == boolean_true_node)
2067 write_unsigned_number (1);
2072 write_integer_cst (value);
2074 else if (TREE_CODE (value) == REAL_CST)
2075 write_real_cst (value);
2082 /* Non-terminal <tempalate-arg>.
2084 <template-arg> ::= <type> # type
2085 ::= L <type> </value/ number> E # literal
2086 ::= LZ <name> E # external name
2087 ::= X <expression> E # expression */
2090 write_template_arg (tree node)
2092 enum tree_code code = TREE_CODE (node);
2094 MANGLE_TRACE_TREE ("template-arg", node);
2096 /* A template template paramter's argument list contains TREE_LIST
2097 nodes of which the value field is the the actual argument. */
2098 if (code == TREE_LIST)
2100 node = TREE_VALUE (node);
2101 /* If it's a decl, deal with its type instead. */
2104 node = TREE_TYPE (node);
2105 code = TREE_CODE (node);
2111 else if (code == TEMPLATE_DECL)
2112 /* A template appearing as a template arg is a template template arg. */
2113 write_template_template_arg (node);
2114 else if ((TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
2115 || (abi_version_at_least (2) && code == CONST_DECL))
2116 write_template_arg_literal (node);
2117 else if (DECL_P (node))
2119 /* G++ 3.2 incorrectly mangled non-type template arguments of
2120 enumeration type using their names. */
2121 if (code == CONST_DECL)
2122 G.need_abi_warning = 1;
2125 write_encoding (node);
2130 /* Template arguments may be expressions. */
2132 write_expression (node);
2137 /* <template-template-arg>
2139 ::= <substitution> */
2142 write_template_template_arg (const tree decl)
2144 MANGLE_TRACE_TREE ("template-template-arg", decl);
2146 if (find_substitution (decl))
2148 write_name (decl, /*ignore_local_scope=*/0);
2149 add_substitution (decl);
2153 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2155 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2156 ::= A <expression> _ </element/ type>
2158 "Array types encode the dimension (number of elements) and the
2159 element type. For variable length arrays, the dimension (but not
2160 the '_' separator) is omitted." */
2163 write_array_type (const tree type)
2166 if (TYPE_DOMAIN (type))
2171 index_type = TYPE_DOMAIN (type);
2172 /* The INDEX_TYPE gives the upper and lower bounds of the
2174 max = TYPE_MAX_VALUE (index_type);
2175 if (TREE_CODE (max) == INTEGER_CST)
2177 /* The ABI specifies that we should mangle the number of
2178 elements in the array, not the largest allowed index. */
2179 max = size_binop (PLUS_EXPR, max, size_one_node);
2180 write_unsigned_number (tree_low_cst (max, 1));
2183 write_expression (TREE_OPERAND (max, 0));
2186 write_type (TREE_TYPE (type));
2189 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2190 variables. TYPE is a pointer-to-member POINTER_TYPE.
2192 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2195 write_pointer_to_member_type (const tree type)
2198 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2199 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2202 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2203 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2204 TEMPLATE_PARM_INDEX.
2206 <template-param> ::= T </parameter/ number> _
2208 If we are internally mangling then we distinguish level and, for
2209 non-type parms, type too. The mangling appends
2211 </level/ number> _ </non-type type/ type> _
2213 This is used by mangle_conv_op_name_for_type. */
2216 write_template_param (const tree parm)
2220 tree parm_type = NULL_TREE;
2222 MANGLE_TRACE_TREE ("template-parm", parm);
2224 switch (TREE_CODE (parm))
2226 case TEMPLATE_TYPE_PARM:
2227 case TEMPLATE_TEMPLATE_PARM:
2228 case BOUND_TEMPLATE_TEMPLATE_PARM:
2229 parm_index = TEMPLATE_TYPE_IDX (parm);
2230 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2233 case TEMPLATE_PARM_INDEX:
2234 parm_index = TEMPLATE_PARM_IDX (parm);
2235 parm_level = TEMPLATE_PARM_LEVEL (parm);
2236 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2244 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2245 earliest template param denoted by `_'. */
2247 write_unsigned_number (parm_index - 1);
2251 /* <template-template-param>
2252 ::= <template-param>
2253 ::= <substitution> */
2256 write_template_template_param (const tree parm)
2258 tree template = NULL_TREE;
2260 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2261 template template parameter. The substitution candidate here is
2262 only the template. */
2263 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2266 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2267 if (find_substitution (template))
2271 /* <template-param> encodes only the template parameter position,
2272 not its template arguments, which is fine here. */
2273 write_template_param (parm);
2275 add_substitution (template);
2278 /* Non-terminal <substitution>.
2280 <substitution> ::= S <seq-id> _
2284 write_substitution (const int seq_id)
2286 MANGLE_TRACE ("substitution", "");
2290 write_number (seq_id - 1, /*unsigned=*/1, 36);
2294 /* Start mangling ENTITY. */
2297 start_mangling (const tree entity)
2300 G.need_abi_warning = false;
2301 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
2302 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
2305 /* Done with mangling. Return the generated mangled name. If WARN is
2306 true, and the name of G.entity will be mangled differently in a
2307 future version of the ABI, issue a warning. */
2309 static inline const char *
2310 finish_mangling (const bool warn)
2312 if (warn_abi && warn && G.need_abi_warning)
2313 warning ("the mangled name of `%D' will change in a future "
2317 /* Clear all the substitutions. */
2318 G.substitutions = 0;
2320 /* Null-terminate the string. */
2323 return (const char *) obstack_base (&G.name_obstack);
2326 /* Initialize data structures for mangling. */
2331 gcc_obstack_init (&G.name_obstack);
2333 /* Cache these identifiers for quick comparison when checking for
2334 standard substitutions. */
2335 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2336 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2337 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2338 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2339 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2340 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2343 /* Generate the mangled name of DECL. */
2346 mangle_decl_string (const tree decl)
2350 start_mangling (decl);
2352 if (TREE_CODE (decl) == TYPE_DECL)
2353 write_type (TREE_TYPE (decl));
2354 else if (/* The names of `extern "C"' functions are not mangled. */
2355 (DECL_EXTERN_C_FUNCTION_P (decl)
2356 /* But overloaded operator names *are* mangled. */
2357 && !DECL_OVERLOADED_OPERATOR_P (decl))
2358 /* The names of global variables aren't mangled either. */
2359 || (TREE_CODE (decl) == VAR_DECL
2360 && CP_DECL_CONTEXT (decl) == global_namespace)
2361 /* And neither are `extern "C"' variables. */
2362 || (TREE_CODE (decl) == VAR_DECL
2363 && DECL_EXTERN_C_P (decl)))
2364 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
2367 write_mangled_name (decl);
2368 if (DECL_LANG_SPECIFIC (decl)
2369 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
2370 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
2371 /* We need a distinct mangled name for these entities, but
2372 we should never actually output it. So, we append some
2373 characters the assembler won't like. */
2374 write_string (" *INTERNAL* ");
2377 result = finish_mangling (/*warn=*/true);
2379 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2383 /* Create an identifier for the external mangled name of DECL. */
2386 mangle_decl (const tree decl)
2388 tree id = get_identifier (mangle_decl_string (decl));
2390 SET_DECL_ASSEMBLER_NAME (decl, id);
2393 /* Generate the mangled representation of TYPE. */
2396 mangle_type_string (const tree type)
2400 start_mangling (type);
2402 result = finish_mangling (/*warn=*/false);
2404 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2408 /* Create an identifier for the mangled representation of TYPE. */
2411 mangle_type (const tree type)
2413 return get_identifier (mangle_type_string (type));
2416 /* Create an identifier for the mangled name of a special component
2417 for belonging to TYPE. CODE is the ABI-specified code for this
2421 mangle_special_for_type (const tree type, const char *code)
2425 /* We don't have an actual decl here for the special component, so
2426 we can't just process the <encoded-name>. Instead, fake it. */
2427 start_mangling (type);
2429 /* Start the mangling. */
2430 write_string ("_Z");
2431 write_string (code);
2435 result = finish_mangling (/*warn=*/false);
2438 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2440 return get_identifier (result);
2443 /* Create an identifier for the mangled representation of the typeinfo
2444 structure for TYPE. */
2447 mangle_typeinfo_for_type (const tree type)
2449 return mangle_special_for_type (type, "TI");
2452 /* Create an identifier for the mangled name of the NTBS containing
2453 the mangled name of TYPE. */
2456 mangle_typeinfo_string_for_type (const tree type)
2458 return mangle_special_for_type (type, "TS");
2461 /* Create an identifier for the mangled name of the vtable for TYPE. */
2464 mangle_vtbl_for_type (const tree type)
2466 return mangle_special_for_type (type, "TV");
2469 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2472 mangle_vtt_for_type (const tree type)
2474 return mangle_special_for_type (type, "TT");
2477 /* Return an identifier for a construction vtable group. TYPE is
2478 the most derived class in the hierarchy; BINFO is the base
2479 subobject for which this construction vtable group will be used.
2481 This mangling isn't part of the ABI specification; in the ABI
2482 specification, the vtable group is dumped in the same COMDAT as the
2483 main vtable, and is referenced only from that vtable, so it doesn't
2484 need an external name. For binary formats without COMDAT sections,
2485 though, we need external names for the vtable groups.
2487 We use the production
2489 <special-name> ::= CT <type> <offset number> _ <base type> */
2492 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2496 start_mangling (type);
2498 write_string ("_Z");
2499 write_string ("TC");
2501 write_integer_cst (BINFO_OFFSET (binfo));
2503 write_type (BINFO_TYPE (binfo));
2505 result = finish_mangling (/*warn=*/false);
2507 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2508 return get_identifier (result);
2511 /* Mangle a this pointer or result pointer adjustment.
2513 <call-offset> ::= h <fixed offset number> _
2514 ::= v <fixed offset number> _ <virtual offset number> _ */
2517 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2519 write_char (virtual_offset ? 'v' : 'h');
2521 /* For either flavor, write the fixed offset. */
2522 write_integer_cst (fixed_offset);
2525 /* For a virtual thunk, add the virtual offset. */
2528 write_integer_cst (virtual_offset);
2533 /* Return an identifier for the mangled name of a this-adjusting or
2534 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2535 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2536 is a virtual thunk, and it is the vtbl offset in
2537 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2538 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2539 thunk itself. A covariant thunk name always includes the adjustment
2540 for the this pointer, even if there is none.
2542 <special-name> ::= T <call-offset> <base encoding>
2543 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2548 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2549 tree virtual_offset)
2553 start_mangling (fn_decl);
2555 write_string ("_Z");
2558 if (!this_adjusting)
2560 /* Covariant thunk with no this adjustment */
2562 mangle_call_offset (integer_zero_node, NULL_TREE);
2563 mangle_call_offset (fixed_offset, virtual_offset);
2565 else if (!DECL_THUNK_P (fn_decl))
2566 /* Plain this adjusting thunk. */
2567 mangle_call_offset (fixed_offset, virtual_offset);
2570 /* This adjusting thunk to covariant thunk. */
2572 mangle_call_offset (fixed_offset, virtual_offset);
2573 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2574 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2576 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2577 mangle_call_offset (fixed_offset, virtual_offset);
2578 fn_decl = THUNK_TARGET (fn_decl);
2582 write_encoding (fn_decl);
2584 result = finish_mangling (/*warn=*/false);
2586 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2587 return get_identifier (result);
2590 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2591 operator to TYPE. The nodes are TREE_LISTs whose TREE_PURPOSE is
2592 the TYPE and whose TREE_VALUE is the IDENTIFIER. */
2594 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
2596 /* Hash a node (VAL1) in the table. */
2599 hash_type (const void *val)
2601 return htab_hash_pointer (TREE_PURPOSE ((tree) val));
2604 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2607 compare_type (const void *val1, const void *val2)
2609 return TREE_PURPOSE ((tree) val1) == (tree) val2;
2612 /* Return an identifier for the mangled unqualified name for a
2613 conversion operator to TYPE. This mangling is not specified by the
2614 ABI spec; it is only used internally. */
2617 mangle_conv_op_name_for_type (const tree type)
2623 if (conv_type_names == NULL)
2624 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
2626 slot = htab_find_slot_with_hash (conv_type_names, type,
2627 htab_hash_pointer (type), INSERT);
2629 return TREE_VALUE ((tree) *slot);
2631 /* Create a unique name corresponding to TYPE. */
2632 sprintf (buffer, "operator %lu",
2633 (unsigned long) htab_elements (conv_type_names));
2634 identifier = get_identifier (buffer);
2635 *slot = build_tree_list (type, identifier);
2637 /* Set bits on the identifier so we know later it's a conversion. */
2638 IDENTIFIER_OPNAME_P (identifier) = 1;
2639 IDENTIFIER_TYPENAME_P (identifier) = 1;
2640 /* Hang TYPE off the identifier so it can be found easily later when
2641 performing conversions. */
2642 TREE_TYPE (identifier) = type;
2647 /* Return an identifier for the name of an initialization guard
2648 variable for indicated VARIABLE. */
2651 mangle_guard_variable (const tree variable)
2653 start_mangling (variable);
2654 write_string ("_ZGV");
2655 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2656 /* The name of a guard variable for a reference temporary should refer
2657 to the reference, not the temporary. */
2658 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2660 write_name (variable, /*ignore_local_scope=*/0);
2661 return get_identifier (finish_mangling (/*warn=*/false));
2664 /* Return an identifier for the name of a temporary variable used to
2665 initialize a static reference. This isn't part of the ABI, but we might
2666 as well call them something readable. */
2669 mangle_ref_init_variable (const tree variable)
2671 start_mangling (variable);
2672 write_string ("_ZGR");
2673 write_name (variable, /*ignore_local_scope=*/0);
2674 return get_identifier (finish_mangling (/*warn=*/false));
2678 /* Foreign language type mangling section. */
2680 /* How to write the type codes for the integer Java type. */
2683 write_java_integer_type_codes (const tree type)
2685 if (type == java_int_type_node)
2687 else if (type == java_short_type_node)
2689 else if (type == java_byte_type_node)
2691 else if (type == java_char_type_node)
2693 else if (type == java_long_type_node)
2695 else if (type == java_boolean_type_node)
2701 #include "gt-cp-mangle.h"