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 /* We are mangling an internal symbol. It is important to keep those
106 involving template parmeters distinct by distinguishing their level
107 and, for non-type parms, their type. */
108 bool internal_mangling_p;
110 /* True if the mangling will be different in a future version of the
112 bool need_abi_warning;
115 /* Indices into subst_identifiers. These are identifiers used in
116 special substitution rules. */
124 SUBID_BASIC_IOSTREAM,
127 substitution_identifier_index_t;
129 /* For quick substitution checks, look up these common identifiers
131 static GTY(()) tree subst_identifiers[SUBID_MAX];
133 /* Single-letter codes for builtin integer types, defined in
134 <builtin-type>. These are indexed by integer_type_kind values. */
136 integer_type_codes[itk_none] =
139 'a', /* itk_signed_char */
140 'h', /* itk_unsigned_char */
142 't', /* itk_unsigned_short */
144 'j', /* itk_unsigned_int */
146 'm', /* itk_unsigned_long */
147 'x', /* itk_long_long */
148 'y' /* itk_unsigned_long_long */
151 static int decl_is_template_id (const tree, tree* const);
153 /* Functions for handling substitutions. */
155 static inline tree canonicalize_for_substitution (tree);
156 static void add_substitution (tree);
157 static inline int is_std_substitution (const tree,
158 const substitution_identifier_index_t);
159 static inline int is_std_substitution_char (const tree,
160 const substitution_identifier_index_t);
161 static int find_substitution (tree);
162 static void mangle_call_offset (const tree, const tree);
164 /* Functions for emitting mangled representations of things. */
166 static void write_mangled_name (const tree);
167 static void write_encoding (const tree);
168 static void write_name (tree, const int);
169 static void write_unscoped_name (const tree);
170 static void write_unscoped_template_name (const tree);
171 static void write_nested_name (const tree);
172 static void write_prefix (const tree);
173 static void write_template_prefix (const tree);
174 static void write_unqualified_name (const tree);
175 static void write_conversion_operator_name (const tree);
176 static void write_source_name (tree);
177 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
179 static void write_number (unsigned HOST_WIDE_INT, const int,
181 static void write_integer_cst (const tree);
182 static void write_real_cst (const tree);
183 static void write_identifier (const char *);
184 static void write_special_name_constructor (const tree);
185 static void write_special_name_destructor (const tree);
186 static void write_type (tree);
187 static int write_CV_qualifiers_for_type (const tree);
188 static void write_builtin_type (tree);
189 static void write_function_type (const tree);
190 static void write_bare_function_type (const tree, const int, const tree);
191 static void write_method_parms (tree, const int, const tree);
192 static void write_class_enum_type (const tree);
193 static void write_template_args (tree);
194 static void write_expression (tree);
195 static void write_template_arg_literal (const tree);
196 static void write_template_arg (tree);
197 static void write_template_template_arg (const tree);
198 static void write_array_type (const tree);
199 static void write_pointer_to_member_type (const tree);
200 static void write_template_param (const tree);
201 static void write_template_template_param (const tree);
202 static void write_substitution (const int);
203 static int discriminator_for_local_entity (tree);
204 static int discriminator_for_string_literal (tree, tree);
205 static void write_discriminator (const int);
206 static void write_local_name (const tree, const tree, const tree);
207 static void dump_substitution_candidates (void);
208 static const char *mangle_decl_string (const tree);
210 /* Control functions. */
212 static inline void start_mangling (const tree);
213 static inline const char *finish_mangling (const bool);
214 static tree mangle_special_for_type (const tree, const char *);
216 /* Foreign language functions. */
218 static void write_java_integer_type_codes (const tree);
220 /* Append a single character to the end of the mangled
222 #define write_char(CHAR) \
223 obstack_1grow (&G.name_obstack, (CHAR))
225 /* Append a sized buffer to the end of the mangled representation. */
226 #define write_chars(CHAR, LEN) \
227 obstack_grow (&G.name_obstack, (CHAR), (LEN))
229 /* Append a NUL-terminated string to the end of the mangled
231 #define write_string(STRING) \
232 obstack_grow (&G.name_obstack, (STRING), strlen (STRING))
234 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
235 same purpose (context, which may be a type) and value (template
236 decl). See write_template_prefix for more information on what this
238 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
239 (TREE_CODE (NODE1) == TREE_LIST \
240 && TREE_CODE (NODE2) == TREE_LIST \
241 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
242 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2)))\
243 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
244 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
246 /* Write out an unsigned quantity in base 10. */
247 #define write_unsigned_number(NUMBER) \
248 write_number ((NUMBER), /*unsigned_p=*/1, 10)
250 /* If DECL is a template instance, return nonzero and, if
251 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
252 Otherwise return zero. */
255 decl_is_template_id (const tree decl, tree* const template_info)
257 if (TREE_CODE (decl) == TYPE_DECL)
259 /* TYPE_DECLs are handled specially. Look at its type to decide
260 if this is a template instantiation. */
261 const tree type = TREE_TYPE (decl);
263 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
265 if (template_info != NULL)
266 /* For a templated TYPE_DECL, the template info is hanging
268 *template_info = TYPE_TEMPLATE_INFO (type);
274 /* Check if this is a primary template. */
275 if (DECL_LANG_SPECIFIC (decl) != NULL
276 && DECL_USE_TEMPLATE (decl)
277 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
278 && TREE_CODE (decl) != TEMPLATE_DECL)
280 if (template_info != NULL)
281 /* For most templated decls, the template info is hanging
283 *template_info = DECL_TEMPLATE_INFO (decl);
288 /* It's not a template id. */
292 /* Produce debugging output of current substitution candidates. */
295 dump_substitution_candidates ()
299 fprintf (stderr, " ++ substitutions ");
300 for (i = 0; i < VARRAY_ACTIVE_SIZE (G.substitutions); ++i)
302 tree el = VARRAY_TREE (G.substitutions, i);
303 const char *name = "???";
306 fprintf (stderr, " ");
308 name = IDENTIFIER_POINTER (DECL_NAME (el));
309 else if (TREE_CODE (el) == TREE_LIST)
310 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
311 else if (TYPE_NAME (el))
312 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
313 fprintf (stderr, " S%d_ = ", i - 1);
315 (CP_TYPE_RESTRICT_P (el)
316 || CP_TYPE_VOLATILE_P (el)
317 || CP_TYPE_CONST_P (el)))
318 fprintf (stderr, "CV-");
319 fprintf (stderr, "%s (%s at %p)\n",
320 name, tree_code_name[TREE_CODE (el)], (void *) el);
324 /* Both decls and types can be substitution candidates, but sometimes
325 they refer to the same thing. For instance, a TYPE_DECL and
326 RECORD_TYPE for the same class refer to the same thing, and should
327 be treated accordinginly in substitutions. This function returns a
328 canonicalized tree node representing NODE that is used when adding
329 and substitution candidates and finding matches. */
332 canonicalize_for_substitution (tree node)
334 /* For a TYPE_DECL, use the type instead. */
335 if (TREE_CODE (node) == TYPE_DECL)
336 node = TREE_TYPE (node);
338 node = canonical_type_variant (node);
343 /* Add NODE as a substitution candidate. NODE must not already be on
344 the list of candidates. */
347 add_substitution (tree node)
352 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
353 tree_code_name[TREE_CODE (node)], (void *) node);
355 /* Get the canonicalized substitution candidate for NODE. */
356 c = canonicalize_for_substitution (node);
357 if (DEBUG_MANGLE && c != node)
358 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
359 tree_code_name[TREE_CODE (node)], (void *) node);
363 /* Make sure NODE isn't already a candidate. */
366 for (i = VARRAY_ACTIVE_SIZE (G.substitutions); --i >= 0; )
368 const tree candidate = VARRAY_TREE (G.substitutions, i);
370 && node == candidate)
372 && TYPE_P (candidate)
373 && same_type_p (node, candidate)))
377 #endif /* ENABLE_CHECKING */
379 /* Put the decl onto the varray of substitution candidates. */
380 VARRAY_PUSH_TREE (G.substitutions, node);
383 dump_substitution_candidates ();
386 /* Helper function for find_substitution. Returns nonzero if NODE,
387 which may be a decl or a CLASS_TYPE, is a template-id with template
388 name of substitution_index[INDEX] in the ::std namespace. */
391 is_std_substitution (const tree node,
392 const substitution_identifier_index_t index)
399 type = TREE_TYPE (node);
402 else if (CLASS_TYPE_P (node))
405 decl = TYPE_NAME (node);
408 /* These are not the droids you're looking for. */
411 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
412 && TYPE_LANG_SPECIFIC (type)
413 && TYPE_TEMPLATE_INFO (type)
414 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
415 == subst_identifiers[index]));
418 /* Helper function for find_substitution. Returns nonzero if NODE,
419 which may be a decl or a CLASS_TYPE, is the template-id
420 ::std::identifier<char>, where identifier is
421 substitution_index[INDEX]. */
424 is_std_substitution_char (const tree node,
425 const substitution_identifier_index_t index)
428 /* Check NODE's name is ::std::identifier. */
429 if (!is_std_substitution (node, index))
431 /* Figure out its template args. */
433 args = DECL_TI_ARGS (node);
434 else if (CLASS_TYPE_P (node))
435 args = CLASSTYPE_TI_ARGS (node);
437 /* Oops, not a template. */
439 /* NODE's template arg list should be <char>. */
441 TREE_VEC_LENGTH (args) == 1
442 && TREE_VEC_ELT (args, 0) == char_type_node;
445 /* Check whether a substitution should be used to represent NODE in
448 First, check standard special-case substitutions.
450 <substitution> ::= St
457 # ::std::basic_string
460 # ::std::basic_string<char,
461 ::std::char_traits<char>,
462 ::std::allocator<char> >
465 # ::std::basic_istream<char, ::std::char_traits<char> >
468 # ::std::basic_ostream<char, ::std::char_traits<char> >
471 # ::std::basic_iostream<char, ::std::char_traits<char> >
473 Then examine the stack of currently available substitution
474 candidates for entities appearing earlier in the same mangling
476 If a substitution is found, write its mangled representation and
477 return nonzero. If none is found, just return zero. */
480 find_substitution (tree node)
483 const int size = VARRAY_ACTIVE_SIZE (G.substitutions);
488 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
489 tree_code_name[TREE_CODE (node)], (void *) node);
491 /* Obtain the canonicalized substitution representation for NODE.
492 This is what we'll compare against. */
493 node = canonicalize_for_substitution (node);
495 /* Check for builtin substitutions. */
497 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
498 type = TYPE_P (node) ? node : TREE_TYPE (node);
500 /* Check for std::allocator. */
502 && is_std_substitution (decl, SUBID_ALLOCATOR)
503 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
509 /* Check for std::basic_string. */
510 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
514 /* If this is a type (i.e. a fully-qualified template-id),
516 std::basic_string <char,
517 std::char_traits<char>,
518 std::allocator<char> > . */
519 if (cp_type_quals (type) == TYPE_UNQUALIFIED
520 && CLASSTYPE_USE_TEMPLATE (type))
522 tree args = CLASSTYPE_TI_ARGS (type);
523 if (TREE_VEC_LENGTH (args) == 3
524 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
525 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
527 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
536 /* Substitute for the template name only if this isn't a type. */
543 /* Check for basic_{i,o,io}stream. */
545 && cp_type_quals (type) == TYPE_UNQUALIFIED
546 && CLASS_TYPE_P (type)
547 && CLASSTYPE_USE_TEMPLATE (type)
548 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
550 /* First, check for the template
551 args <char, std::char_traits<char> > . */
552 tree args = CLASSTYPE_TI_ARGS (type);
553 if (TREE_VEC_LENGTH (args) == 2
554 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
555 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
558 /* Got them. Is this basic_istream? */
559 tree name = DECL_NAME (CLASSTYPE_TI_TEMPLATE (type));
560 if (name == subst_identifiers[SUBID_BASIC_ISTREAM])
565 /* Or basic_ostream? */
566 else if (name == subst_identifiers[SUBID_BASIC_OSTREAM])
571 /* Or basic_iostream? */
572 else if (name == subst_identifiers[SUBID_BASIC_IOSTREAM])
580 /* Check for namespace std. */
581 if (decl && DECL_NAMESPACE_STD_P (decl))
587 /* Now check the list of available substitutions for this mangling
589 for (i = 0; i < size; ++i)
591 tree candidate = VARRAY_TREE (G.substitutions, i);
592 /* NODE is a matched to a candidate if it's the same decl node or
593 if it's the same type. */
594 if (decl == candidate
595 || (TYPE_P (candidate) && type && TYPE_P (type)
596 && same_type_p (type, candidate))
597 || NESTED_TEMPLATE_MATCH (node, candidate))
599 write_substitution (i);
604 /* No substitution found. */
609 /* <mangled-name> ::= _Z <encoding> */
612 write_mangled_name (const tree decl)
614 MANGLE_TRACE_TREE ("mangled-name", decl);
616 if (DECL_LANG_SPECIFIC (decl)
617 && DECL_EXTERN_C_FUNCTION_P (decl)
618 && ! DECL_OVERLOADED_OPERATOR_P (decl))
619 /* The standard notes:
620 "The <encoding> of an extern "C" function is treated like
621 global-scope data, i.e. as its <source-name> without a type."
622 We cannot write overloaded operators that way though,
623 because it contains characters invalid in assembler. */
624 write_source_name (DECL_NAME (decl));
626 /* C++ name; needs to be mangled. */
629 write_encoding (decl);
633 /* <encoding> ::= <function name> <bare-function-type>
637 write_encoding (const tree decl)
639 MANGLE_TRACE_TREE ("encoding", decl);
641 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
643 /* For overloaded operators write just the mangled name
644 without arguments. */
645 if (DECL_OVERLOADED_OPERATOR_P (decl))
646 write_name (decl, /*ignore_local_scope=*/0);
648 write_source_name (DECL_NAME (decl));
652 write_name (decl, /*ignore_local_scope=*/0);
653 if (TREE_CODE (decl) == FUNCTION_DECL)
657 if (decl_is_template_id (decl, NULL))
658 fn_type = get_mostly_instantiated_function_type (decl);
660 fn_type = TREE_TYPE (decl);
662 write_bare_function_type (fn_type,
663 (!DECL_CONSTRUCTOR_P (decl)
664 && !DECL_DESTRUCTOR_P (decl)
665 && !DECL_CONV_FN_P (decl)
666 && decl_is_template_id (decl, NULL)),
671 /* <name> ::= <unscoped-name>
672 ::= <unscoped-template-name> <template-args>
676 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
677 called from <local-name>, which mangles the enclosing scope
678 elsewhere and then uses this function to mangle just the part
679 underneath the function scope. So don't use the <local-name>
680 production, to avoid an infinite recursion. */
683 write_name (tree decl, const int ignore_local_scope)
687 MANGLE_TRACE_TREE ("name", decl);
689 if (TREE_CODE (decl) == TYPE_DECL)
691 /* In case this is a typedef, fish out the corresponding
692 TYPE_DECL for the main variant. */
693 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
694 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
697 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
699 /* A decl in :: or ::std scope is treated specially. The former is
700 mangled using <unscoped-name> or <unscoped-template-name>, the
701 latter with a special substitution. Also, a name that is
702 directly in a local function scope is also mangled with
703 <unscoped-name> rather than a full <nested-name>. */
705 || context == global_namespace
706 || DECL_NAMESPACE_STD_P (context)
707 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
710 /* Is this a template instance? */
711 if (decl_is_template_id (decl, &template_info))
713 /* Yes: use <unscoped-template-name>. */
714 write_unscoped_template_name (TI_TEMPLATE (template_info));
715 write_template_args (TI_ARGS (template_info));
718 /* Everything else gets an <unqualified-name>. */
719 write_unscoped_name (decl);
723 /* Handle local names, unless we asked not to (that is, invoked
724 under <local-name>, to handle only the part of the name under
726 if (!ignore_local_scope)
728 /* Scan up the list of scope context, looking for a
729 function. If we find one, this entity is in local
730 function scope. local_entity tracks context one scope
731 level down, so it will contain the element that's
732 directly in that function's scope, either decl or one of
733 its enclosing scopes. */
734 tree local_entity = decl;
735 while (context != NULL && context != global_namespace)
737 /* Make sure we're always dealing with decls. */
738 if (context != NULL && TYPE_P (context))
739 context = TYPE_NAME (context);
740 /* Is this a function? */
741 if (TREE_CODE (context) == FUNCTION_DECL)
743 /* Yes, we have local scope. Use the <local-name>
744 production for the innermost function scope. */
745 write_local_name (context, local_entity, decl);
748 /* Up one scope level. */
749 local_entity = context;
750 context = CP_DECL_CONTEXT (context);
753 /* No local scope found? Fall through to <nested-name>. */
756 /* Other decls get a <nested-name> to encode their scope. */
757 write_nested_name (decl);
761 /* <unscoped-name> ::= <unqualified-name>
762 ::= St <unqualified-name> # ::std:: */
765 write_unscoped_name (const tree decl)
767 tree context = CP_DECL_CONTEXT (decl);
769 MANGLE_TRACE_TREE ("unscoped-name", decl);
771 /* Is DECL in ::std? */
772 if (DECL_NAMESPACE_STD_P (context))
775 write_unqualified_name (decl);
777 /* If not, it should be either in the global namespace, or directly
778 in a local function scope. */
779 else if (context == global_namespace
781 || TREE_CODE (context) == FUNCTION_DECL)
782 write_unqualified_name (decl);
787 /* <unscoped-template-name> ::= <unscoped-name>
788 ::= <substitution> */
791 write_unscoped_template_name (const tree decl)
793 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
795 if (find_substitution (decl))
797 write_unscoped_name (decl);
798 add_substitution (decl);
801 /* Write the nested name, including CV-qualifiers, of DECL.
803 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
804 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
806 <CV-qualifiers> ::= [r] [V] [K] */
809 write_nested_name (const tree decl)
813 MANGLE_TRACE_TREE ("nested-name", decl);
817 /* Write CV-qualifiers, if this is a member function. */
818 if (TREE_CODE (decl) == FUNCTION_DECL
819 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
821 if (DECL_VOLATILE_MEMFUNC_P (decl))
823 if (DECL_CONST_MEMFUNC_P (decl))
827 /* Is this a template instance? */
828 if (decl_is_template_id (decl, &template_info))
830 /* Yes, use <template-prefix>. */
831 write_template_prefix (decl);
832 write_template_args (TI_ARGS (template_info));
836 /* No, just use <prefix> */
837 write_prefix (DECL_CONTEXT (decl));
838 write_unqualified_name (decl);
843 /* <prefix> ::= <prefix> <unqualified-name>
845 ::= <template-prefix> <template-args>
847 ::= <substitution> */
850 write_prefix (const tree node)
853 /* Non-NULL if NODE represents a template-id. */
854 tree template_info = NULL;
856 MANGLE_TRACE_TREE ("prefix", node);
859 || node == global_namespace)
862 if (find_substitution (node))
867 /* If this is a function decl, that means we've hit function
868 scope, so this prefix must be for a local name. In this
869 case, we're under the <local-name> production, which encodes
870 the enclosing function scope elsewhere. So don't continue
872 if (TREE_CODE (node) == FUNCTION_DECL)
876 decl_is_template_id (decl, &template_info);
880 /* Node is a type. */
881 decl = TYPE_NAME (node);
882 if (CLASSTYPE_TEMPLATE_ID_P (node))
883 template_info = TYPE_TEMPLATE_INFO (node);
886 /* In G++ 3.2, the name of the template parameter was used. */
887 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
888 && !abi_version_at_least (2))
889 G.need_abi_warning = true;
891 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
892 && abi_version_at_least (2))
893 write_template_param (node);
894 else if (template_info != NULL)
897 write_template_prefix (decl);
898 write_template_args (TI_ARGS (template_info));
903 write_prefix (CP_DECL_CONTEXT (decl));
904 write_unqualified_name (decl);
907 add_substitution (node);
910 /* <template-prefix> ::= <prefix> <template component>
912 ::= <substitution> */
915 write_template_prefix (const tree node)
917 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
918 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
919 tree context = CP_DECL_CONTEXT (decl);
924 MANGLE_TRACE_TREE ("template-prefix", node);
926 /* Find the template decl. */
927 if (decl_is_template_id (decl, &template_info))
928 template = TI_TEMPLATE (template_info);
929 else if (CLASSTYPE_TEMPLATE_ID_P (type))
930 template = TYPE_TI_TEMPLATE (type);
932 /* Oops, not a template. */
935 /* For a member template, though, the template name for the
936 innermost name must have all the outer template levels
937 instantiated. For instance, consider
939 template<typename T> struct Outer {
940 template<typename U> struct Inner {};
943 The template name for `Inner' in `Outer<int>::Inner<float>' is
944 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
945 levels separately, so there's no TEMPLATE_DECL available for this
946 (there's only `Outer<T>::Inner<U>').
948 In order to get the substitutions right, we create a special
949 TREE_LIST to represent the substitution candidate for a nested
950 template. The TREE_PURPOSE is the template's context, fully
951 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
954 So, for the example above, `Outer<int>::Inner' is represented as a
955 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
956 and whose value is `Outer<T>::Inner<U>'. */
957 if (TYPE_P (context))
958 substitution = build_tree_list (context, template);
960 substitution = template;
962 if (find_substitution (substitution))
965 /* In G++ 3.2, the name of the template template parameter was used. */
966 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
967 && !abi_version_at_least (2))
968 G.need_abi_warning = true;
970 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
971 && abi_version_at_least (2))
972 write_template_param (TREE_TYPE (template));
975 write_prefix (context);
976 write_unqualified_name (decl);
979 add_substitution (substitution);
982 /* We don't need to handle thunks, vtables, or VTTs here. Those are
983 mangled through special entry points.
985 <unqualified-name> ::= <operator-name>
990 write_unqualified_name (const tree decl)
992 MANGLE_TRACE_TREE ("unqualified-name", decl);
994 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
995 write_special_name_constructor (decl);
996 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
997 write_special_name_destructor (decl);
998 else if (DECL_CONV_FN_P (decl))
1000 /* Conversion operator. Handle it right here.
1001 <operator> ::= cv <type> */
1003 if (decl_is_template_id (decl, NULL))
1005 tree fn_type = get_mostly_instantiated_function_type (decl);
1006 type = TREE_TYPE (fn_type);
1009 type = TREE_TYPE (DECL_NAME (decl));
1010 write_conversion_operator_name (type);
1012 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1014 operator_name_info_t *oni;
1015 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1016 oni = assignment_operator_name_info;
1018 oni = operator_name_info;
1020 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1023 write_source_name (DECL_NAME (decl));
1026 /* Write the unqualified-name for a conversion operator to TYPE. */
1029 write_conversion_operator_name (const tree type)
1031 write_string ("cv");
1035 /* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1037 <source-name> ::= </length/ number> <identifier> */
1040 write_source_name (tree identifier)
1042 MANGLE_TRACE_TREE ("source-name", identifier);
1044 /* Never write the whole template-id name including the template
1045 arguments; we only want the template name. */
1046 if (IDENTIFIER_TEMPLATE (identifier))
1047 identifier = IDENTIFIER_TEMPLATE (identifier);
1049 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1050 write_identifier (IDENTIFIER_POINTER (identifier));
1053 /* Convert NUMBER to ascii using base BASE and generating at least
1054 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1055 into which to store the characters. Returns the number of
1056 characters generated (these will be layed out in advance of where
1060 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1061 char *buffer, const unsigned int min_digits)
1063 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1064 unsigned digits = 0;
1068 unsigned HOST_WIDE_INT d = number / base;
1070 *--buffer = base_digits[number - d * base];
1074 while (digits < min_digits)
1076 *--buffer = base_digits[0];
1082 /* Non-terminal <number>.
1084 <number> ::= [n] </decimal integer/> */
1087 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1088 const unsigned int base)
1090 char buffer[sizeof (HOST_WIDE_INT) * 8];
1093 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1096 number = -((HOST_WIDE_INT) number);
1098 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1099 write_chars (buffer + sizeof (buffer) - count, count);
1102 /* Write out an integral CST in decimal. Most numbers are small, and
1103 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1104 bigger than that, which we must deal with. */
1107 write_integer_cst (const tree cst)
1109 int sign = tree_int_cst_sgn (cst);
1111 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1113 /* A bignum. We do this in chunks, each of which fits in a
1115 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1116 unsigned HOST_WIDE_INT chunk;
1117 unsigned chunk_digits;
1118 char *ptr = buffer + sizeof (buffer);
1123 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1128 if (sizeof (HOST_WIDE_INT) >= 8)
1130 /* It is at least 64 bits, so 10^18 is representable. */
1135 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1136 base = build_int_2 (chunk, 0);
1137 n = build_int_2 (TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1138 TREE_TYPE (n) = TREE_TYPE (base) = type;
1143 n = fold (build1 (NEGATE_EXPR, type, n));
1147 tree d = fold (build (FLOOR_DIV_EXPR, type, n, base));
1148 tree tmp = fold (build (MULT_EXPR, type, d, base));
1151 done = integer_zerop (d);
1152 tmp = fold (build (MINUS_EXPR, type, n, tmp));
1153 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1154 done ? 1 : chunk_digits);
1160 write_chars (ptr, count);
1165 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1172 write_unsigned_number (low);
1176 /* Write out a floating-point literal.
1178 "Floating-point literals are encoded using the bit pattern of the
1179 target processor's internal representation of that number, as a
1180 fixed-length lowercase hexadecimal string, high-order bytes first
1181 (even if the target processor would store low-order bytes first).
1182 The "n" prefix is not used for floating-point literals; the sign
1183 bit is encoded with the rest of the number.
1185 Here are some examples, assuming the IEEE standard representation
1186 for floating point numbers. (Spaces are for readability, not
1187 part of the encoding.)
1190 -1.0f Lf bf80 0000 E
1191 1.17549435e-38f Lf 0080 0000 E
1192 1.40129846e-45f Lf 0000 0001 E
1193 0.0f Lf 0000 0000 E"
1195 Caller is responsible for the Lx and the E. */
1197 write_real_cst (const tree value)
1199 if (abi_version_at_least (2))
1201 long target_real[4]; /* largest supported float */
1202 char buffer[9]; /* eight hex digits in a 32-bit number */
1205 tree type = TREE_TYPE (value);
1206 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1208 real_to_target (target_real, &TREE_REAL_CST (value),
1211 /* The value in target_real is in the target word order,
1212 so we must write it out backward if that happens to be
1213 little-endian. write_number cannot be used, it will
1214 produce uppercase. */
1215 if (FLOAT_WORDS_BIG_ENDIAN)
1216 i = 0, limit = words, dir = 1;
1218 i = words - 1, limit = -1, dir = -1;
1220 for (; i != limit; i += dir)
1222 sprintf (buffer, "%08lx", target_real[i]);
1223 write_chars (buffer, 8);
1228 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1229 literally. Note that compatibility with 3.2 is impossible,
1230 because the old floating-point emulator used a different
1231 format for REAL_VALUE_TYPE. */
1233 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1234 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1237 G.need_abi_warning = 1;
1241 /* Non-terminal <identifier>.
1243 <identifier> ::= </unqualified source code identifier> */
1246 write_identifier (const char *identifier)
1248 MANGLE_TRACE ("identifier", identifier);
1249 write_string (identifier);
1252 /* Handle constructor productions of non-terminal <special-name>.
1253 CTOR is a constructor FUNCTION_DECL.
1255 <special-name> ::= C1 # complete object constructor
1256 ::= C2 # base object constructor
1257 ::= C3 # complete object allocating constructor
1259 Currently, allocating constructors are never used.
1261 We also need to provide mangled names for the maybe-in-charge
1262 constructor, so we treat it here too. mangle_decl_string will
1263 append *INTERNAL* to that, to make sure we never emit it. */
1266 write_special_name_constructor (const tree ctor)
1268 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1269 /* Even though we don't ever emit a definition of the
1270 old-style destructor, we still have to consider entities
1271 (like static variables) nested inside it. */
1272 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
1273 write_string ("C1");
1274 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1275 write_string ("C2");
1280 /* Handle destructor productions of non-terminal <special-name>.
1281 DTOR is a destructor FUNCTION_DECL.
1283 <special-name> ::= D0 # deleting (in-charge) destructor
1284 ::= D1 # complete object (in-charge) destructor
1285 ::= D2 # base object (not-in-charge) destructor
1287 We also need to provide mangled names for the maybe-incharge
1288 destructor, so we treat it here too. mangle_decl_string will
1289 append *INTERNAL* to that, to make sure we never emit it. */
1292 write_special_name_destructor (const tree dtor)
1294 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1295 write_string ("D0");
1296 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1297 /* Even though we don't ever emit a definition of the
1298 old-style destructor, we still have to consider entities
1299 (like static variables) nested inside it. */
1300 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
1301 write_string ("D1");
1302 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1303 write_string ("D2");
1308 /* Return the discriminator for ENTITY appearing inside
1309 FUNCTION. The discriminator is the lexical ordinal of VAR among
1310 entities with the same name in the same FUNCTION. */
1313 discriminator_for_local_entity (tree entity)
1317 /* Assume this is the only local entity with this name. */
1318 int discriminator = 0;
1320 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1321 discriminator = DECL_DISCRIMINATOR (entity);
1322 else if (TREE_CODE (entity) == TYPE_DECL)
1324 /* Scan the list of local classes. */
1325 entity = TREE_TYPE (entity);
1326 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1327 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1328 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1332 return discriminator;
1335 /* Return the discriminator for STRING, a string literal used inside
1336 FUNCTION. The disciminator is the lexical ordinal of STRING among
1337 string literals used in FUNCTION. */
1340 discriminator_for_string_literal (function, string)
1341 tree function ATTRIBUTE_UNUSED;
1342 tree string ATTRIBUTE_UNUSED;
1344 /* For now, we don't discriminate amongst string literals. */
1348 /* <discriminator> := _ <number>
1350 The discriminator is used only for the second and later occurrences
1351 of the same name within a single function. In this case <number> is
1352 n - 2, if this is the nth occurrence, in lexical order. */
1355 write_discriminator (const int discriminator)
1357 /* If discriminator is zero, don't write anything. Otherwise... */
1358 if (discriminator > 0)
1361 write_unsigned_number (discriminator - 1);
1365 /* Mangle the name of a function-scope entity. FUNCTION is the
1366 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1367 the entity itself. LOCAL_ENTITY is the entity that's directly
1368 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1371 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1372 := Z <function encoding> E s [<discriminator>] */
1375 write_local_name (const tree function, const tree local_entity,
1378 MANGLE_TRACE_TREE ("local-name", entity);
1381 write_encoding (function);
1383 if (TREE_CODE (entity) == STRING_CST)
1386 write_discriminator (discriminator_for_string_literal (function,
1391 /* Now the <entity name>. Let write_name know its being called
1392 from <local-name>, so it doesn't try to process the enclosing
1393 function scope again. */
1394 write_name (entity, /*ignore_local_scope=*/1);
1395 write_discriminator (discriminator_for_local_entity (local_entity));
1399 /* Non-terminals <type> and <CV-qualifier>.
1401 <type> ::= <builtin-type>
1403 ::= <class-enum-type>
1405 ::= <pointer-to-member-type>
1406 ::= <template-param>
1409 ::= P <type> # pointer-to
1410 ::= R <type> # reference-to
1411 ::= C <type> # complex pair (C 2000)
1412 ::= G <type> # imaginary (C 2000) [not supported]
1413 ::= U <source-name> <type> # vendor extended type qualifier
1415 TYPE is a type node. */
1418 write_type (tree type)
1420 /* This gets set to nonzero if TYPE turns out to be a (possibly
1421 CV-qualified) builtin type. */
1422 int is_builtin_type = 0;
1424 MANGLE_TRACE_TREE ("type", type);
1426 if (type == error_mark_node)
1429 if (find_substitution (type))
1432 if (write_CV_qualifiers_for_type (type) > 0)
1433 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1434 mangle the unqualified type. The recursive call is needed here
1435 since both the qualified and uqualified types are substitution
1437 write_type (TYPE_MAIN_VARIANT (type));
1438 else if (TREE_CODE (type) == ARRAY_TYPE)
1439 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1440 so that the cv-qualification of the element type is available
1441 in write_array_type. */
1442 write_array_type (type);
1445 /* See through any typedefs. */
1446 type = TYPE_MAIN_VARIANT (type);
1448 switch (TREE_CODE (type))
1452 case INTEGER_TYPE: /* Includes wchar_t. */
1454 /* If this is a typedef, TYPE may not be one of
1455 the standard builtin type nodes, but an alias of one. Use
1456 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1457 write_builtin_type (TYPE_MAIN_VARIANT (type));
1463 write_type (TREE_TYPE (type));
1468 write_function_type (type);
1474 /* A pointer-to-member function is represented as a special
1475 RECORD_TYPE, so check for this first. */
1476 if (TYPE_PTRMEMFUNC_P (type))
1477 write_pointer_to_member_type (type);
1479 write_class_enum_type (type);
1483 case UNBOUND_CLASS_TEMPLATE:
1484 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1485 ordinary nested names. */
1486 write_nested_name (TYPE_STUB_DECL (type));
1490 /* A pointer-to-member variable is represented by a POINTER_TYPE
1491 to an OFFSET_TYPE, so check for this first. */
1492 if (TYPE_PTRMEM_P (type))
1493 write_pointer_to_member_type (type);
1497 write_type (TREE_TYPE (type));
1501 case REFERENCE_TYPE:
1503 write_type (TREE_TYPE (type));
1506 case TEMPLATE_TYPE_PARM:
1507 case TEMPLATE_PARM_INDEX:
1508 write_template_param (type);
1511 case TEMPLATE_TEMPLATE_PARM:
1512 write_template_template_param (type);
1515 case BOUND_TEMPLATE_TEMPLATE_PARM:
1516 write_template_template_param (type);
1518 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1522 write_pointer_to_member_type (build_pointer_type (type));
1526 write_string ("U8__vector");
1527 write_type (TREE_TYPE (type));
1535 /* Types other than builtin types are substitution candidates. */
1536 if (!is_builtin_type)
1537 add_substitution (type);
1540 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1541 CV-qualifiers written for TYPE.
1543 <CV-qualifiers> ::= [r] [V] [K] */
1546 write_CV_qualifiers_for_type (const tree type)
1548 int num_qualifiers = 0;
1550 /* The order is specified by:
1552 "In cases where multiple order-insensitive qualifiers are
1553 present, they should be ordered 'K' (closest to the base type),
1554 'V', 'r', and 'U' (farthest from the base type) ..."
1556 Note that we do not use cp_type_quals below; given "const
1557 int[3]", the "const" is emitted with the "int", not with the
1560 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1565 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1570 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1576 return num_qualifiers;
1579 /* Non-terminal <builtin-type>.
1581 <builtin-type> ::= v # void
1586 ::= h # unsigned char
1588 ::= t # unsigned short
1590 ::= j # unsigned int
1592 ::= m # unsigned long
1593 ::= x # long long, __int64
1594 ::= y # unsigned long long, __int64
1596 ::= o # unsigned __int128
1599 ::= e # long double, __float80
1600 ::= g # __float128 [not supported]
1601 ::= u <source-name> # vendor extended type */
1604 write_builtin_type (tree type)
1606 switch (TREE_CODE (type))
1617 /* If this is size_t, get the underlying int type. */
1618 if (TYPE_IS_SIZETYPE (type))
1619 type = TYPE_DOMAIN (type);
1621 /* TYPE may still be wchar_t, since that isn't in
1622 integer_type_nodes. */
1623 if (type == wchar_type_node)
1625 else if (TYPE_FOR_JAVA (type))
1626 write_java_integer_type_codes (type);
1630 /* Assume TYPE is one of the shared integer type nodes. Find
1631 it in the array of these nodes. */
1633 for (itk = 0; itk < itk_none; ++itk)
1634 if (type == integer_types[itk])
1636 /* Print the corresponding single-letter code. */
1637 write_char (integer_type_codes[itk]);
1641 if (itk == itk_none)
1643 tree t = c_common_type_for_mode (TYPE_MODE (type),
1644 TREE_UNSIGNED (type));
1647 if (TYPE_PRECISION (type) == 128)
1648 write_char (TREE_UNSIGNED (type) ? 'o' : 'n');
1650 /* Couldn't find this type. */
1663 if (type == float_type_node
1664 || type == java_float_type_node)
1666 else if (type == double_type_node
1667 || type == java_double_type_node)
1669 else if (type == long_double_type_node)
1680 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1681 METHOD_TYPE. The return type is mangled before the parameter
1684 <function-type> ::= F [Y] <bare-function-type> E */
1687 write_function_type (const tree type)
1689 MANGLE_TRACE_TREE ("function-type", type);
1691 /* For a pointer to member function, the function type may have
1692 cv-qualifiers, indicating the quals for the artificial 'this'
1694 if (TREE_CODE (type) == METHOD_TYPE)
1696 /* The first parameter must be a POINTER_TYPE pointing to the
1697 `this' parameter. */
1698 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1699 write_CV_qualifiers_for_type (this_type);
1703 /* We don't track whether or not a type is `extern "C"'. Note that
1704 you can have an `extern "C"' function that does not have
1705 `extern "C"' type, and vice versa:
1707 extern "C" typedef void function_t();
1708 function_t f; // f has C++ linkage, but its type is
1711 typedef void function_t();
1712 extern "C" function_t f; // Vice versa.
1715 write_bare_function_type (type, /*include_return_type_p=*/1,
1720 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1721 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1722 is mangled before the parameter types. If non-NULL, DECL is
1723 FUNCTION_DECL for the function whose type is being emitted.
1725 <bare-function-type> ::= </signature/ type>+ */
1728 write_bare_function_type (const tree type, const int include_return_type_p,
1731 MANGLE_TRACE_TREE ("bare-function-type", type);
1733 /* Mangle the return type, if requested. */
1734 if (include_return_type_p)
1735 write_type (TREE_TYPE (type));
1737 /* Now mangle the types of the arguments. */
1738 write_method_parms (TYPE_ARG_TYPES (type),
1739 TREE_CODE (type) == METHOD_TYPE,
1743 /* Write the mangled representation of a method parameter list of
1744 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1745 considered a non-static method, and the this parameter is omitted.
1746 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1747 parameters are being emitted. */
1750 write_method_parms (tree parm_types, const int method_p, const tree decl)
1752 tree first_parm_type;
1753 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1755 /* Assume this parameter type list is variable-length. If it ends
1756 with a void type, then it's not. */
1759 /* If this is a member function, skip the first arg, which is the
1761 "Member functions do not encode the type of their implicit this
1764 Similarly, there's no need to mangle artificial parameters, like
1765 the VTT parameters for constructors and destructors. */
1768 parm_types = TREE_CHAIN (parm_types);
1769 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1771 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1773 parm_types = TREE_CHAIN (parm_types);
1774 parm_decl = TREE_CHAIN (parm_decl);
1778 for (first_parm_type = parm_types;
1780 parm_types = TREE_CHAIN (parm_types))
1782 tree parm = TREE_VALUE (parm_types);
1783 if (parm == void_type_node)
1785 /* "Empty parameter lists, whether declared as () or
1786 conventionally as (void), are encoded with a void parameter
1788 if (parm_types == first_parm_type)
1790 /* If the parm list is terminated with a void type, it's
1793 /* A void type better be the last one. */
1794 my_friendly_assert (TREE_CHAIN (parm_types) == NULL, 20000523);
1801 /* <builtin-type> ::= z # ellipsis */
1805 /* <class-enum-type> ::= <name> */
1808 write_class_enum_type (const tree type)
1810 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1813 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1816 <template-args> ::= I <template-arg>+ E */
1819 write_template_args (tree args)
1821 MANGLE_TRACE_TREE ("template-args", args);
1825 if (TREE_CODE (args) == TREE_VEC)
1828 int length = TREE_VEC_LENGTH (args);
1829 my_friendly_assert (length > 0, 20000422);
1831 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1833 /* We have nested template args. We want the innermost template
1835 args = TREE_VEC_ELT (args, length - 1);
1836 length = TREE_VEC_LENGTH (args);
1838 for (i = 0; i < length; ++i)
1839 write_template_arg (TREE_VEC_ELT (args, i));
1843 my_friendly_assert (TREE_CODE (args) == TREE_LIST, 20021014);
1847 write_template_arg (TREE_VALUE (args));
1848 args = TREE_CHAIN (args);
1855 /* <expression> ::= <unary operator-name> <expression>
1856 ::= <binary operator-name> <expression> <expression>
1859 <expr-primary> ::= <template-param>
1860 ::= L <type> <value number> E # literal
1861 ::= L <mangled-name> E # external name
1862 ::= sr <type> <unqualified-name>
1863 ::= sr <type> <unqualified-name> <template-args> */
1866 write_expression (tree expr)
1868 enum tree_code code;
1870 code = TREE_CODE (expr);
1872 /* Handle pointers-to-members by making them look like expression
1874 if (code == PTRMEM_CST)
1876 expr = build_nt (ADDR_EXPR,
1877 build_nt (SCOPE_REF,
1878 PTRMEM_CST_CLASS (expr),
1879 PTRMEM_CST_MEMBER (expr)));
1880 code = TREE_CODE (expr);
1883 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1884 is converted (via qualification conversions) to another
1886 while (TREE_CODE (expr) == NOP_EXPR
1887 || TREE_CODE (expr) == NON_LVALUE_EXPR)
1889 expr = TREE_OPERAND (expr, 0);
1890 code = TREE_CODE (expr);
1893 /* Handle template parameters. */
1894 if (code == TEMPLATE_TYPE_PARM
1895 || code == TEMPLATE_TEMPLATE_PARM
1896 || code == BOUND_TEMPLATE_TEMPLATE_PARM
1897 || code == TEMPLATE_PARM_INDEX)
1898 write_template_param (expr);
1899 /* Handle literals. */
1900 else if (TREE_CODE_CLASS (code) == 'c'
1901 || (abi_version_at_least (2) && code == CONST_DECL))
1902 write_template_arg_literal (expr);
1903 else if (DECL_P (expr))
1905 /* G++ 3.2 incorrectly mangled non-type template arguments of
1906 enumeration type using their names. */
1907 if (code == CONST_DECL)
1908 G.need_abi_warning = 1;
1910 write_mangled_name (expr);
1913 else if (TREE_CODE (expr) == SIZEOF_EXPR
1914 && TYPE_P (TREE_OPERAND (expr, 0)))
1916 write_string ("st");
1917 write_type (TREE_OPERAND (expr, 0));
1919 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
1921 tree scope = TREE_OPERAND (expr, 0);
1922 tree member = TREE_OPERAND (expr, 1);
1924 /* If the MEMBER is a real declaration, then the qualifying
1925 scope was not dependent. Ideally, we would not have a
1926 SCOPE_REF in those cases, but sometimes we do. If the second
1927 argument is a DECL, then the name must not have been
1929 if (DECL_P (member))
1930 write_expression (member);
1935 write_string ("sr");
1937 /* If MEMBER is a template-id, separate the template
1938 from the arguments. */
1939 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
1941 template_args = TREE_OPERAND (member, 1);
1942 member = TREE_OPERAND (member, 0);
1943 if (TREE_CODE (member) == LOOKUP_EXPR)
1944 member = TREE_OPERAND (member, 0);
1947 template_args = NULL_TREE;
1948 /* Write out the name of the MEMBER. */
1949 if (IDENTIFIER_TYPENAME_P (member))
1950 write_conversion_operator_name (TREE_TYPE (member));
1951 else if (IDENTIFIER_OPNAME_P (member))
1954 const char *mangled_name = NULL;
1956 /* Unfortunately, there is no easy way to go from the
1957 name of the operator back to the corresponding tree
1959 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
1960 if (operator_name_info[i].identifier == member)
1962 /* The ABI says that we prefer binary operator
1963 names to unary operator names. */
1964 if (operator_name_info[i].arity == 2)
1966 mangled_name = operator_name_info[i].mangled_name;
1969 else if (!mangled_name)
1970 mangled_name = operator_name_info[i].mangled_name;
1972 else if (assignment_operator_name_info[i].identifier
1976 = assignment_operator_name_info[i].mangled_name;
1979 write_string (mangled_name);
1982 write_source_name (member);
1983 /* Write out the template arguments. */
1985 write_template_args (template_args);
1992 /* When we bind a variable or function to a non-type template
1993 argument with reference type, we create an ADDR_EXPR to show
1994 the fact that the entity's address has been taken. But, we
1995 don't actually want to output a mangling code for the `&'. */
1996 if (TREE_CODE (expr) == ADDR_EXPR
1998 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2000 expr = TREE_OPERAND (expr, 0);
2003 write_expression (expr);
2007 code = TREE_CODE (expr);
2010 /* If it wasn't any of those, recursively expand the expression. */
2011 write_string (operator_name_info[(int) code].mangled_name);
2016 write_type (TREE_TYPE (expr));
2017 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2020 case STATIC_CAST_EXPR:
2021 case CONST_CAST_EXPR:
2022 write_type (TREE_TYPE (expr));
2023 write_expression (TREE_OPERAND (expr, 0));
2027 /* Handle pointers-to-members specially. */
2029 write_type (TREE_OPERAND (expr, 0));
2030 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2031 write_source_name (TREE_OPERAND (expr, 1));
2034 /* G++ 3.2 incorrectly put out both the "sr" code and
2035 the nested name of the qualified name. */
2036 G.need_abi_warning = 1;
2037 write_encoding (TREE_OPERAND (expr, 1));
2042 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
2043 write_expression (TREE_OPERAND (expr, i));
2048 /* Literal subcase of non-terminal <template-arg>.
2050 "Literal arguments, e.g. "A<42L>", are encoded with their type
2051 and value. Negative integer values are preceded with "n"; for
2052 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2053 encoded as 0, true as 1." */
2056 write_template_arg_literal (const tree value)
2058 tree type = TREE_TYPE (value);
2062 if (TREE_CODE (value) == CONST_DECL)
2063 write_integer_cst (DECL_INITIAL (value));
2064 else if (TREE_CODE (value) == INTEGER_CST)
2066 if (same_type_p (type, boolean_type_node))
2068 if (value == boolean_false_node || integer_zerop (value))
2069 write_unsigned_number (0);
2070 else if (value == boolean_true_node)
2071 write_unsigned_number (1);
2076 write_integer_cst (value);
2078 else if (TREE_CODE (value) == REAL_CST)
2079 write_real_cst (value);
2086 /* Non-terminal <tempalate-arg>.
2088 <template-arg> ::= <type> # type
2089 ::= L <type> </value/ number> E # literal
2090 ::= LZ <name> E # external name
2091 ::= X <expression> E # expression */
2094 write_template_arg (tree node)
2096 enum tree_code code = TREE_CODE (node);
2098 MANGLE_TRACE_TREE ("template-arg", node);
2100 /* A template template paramter's argument list contains TREE_LIST
2101 nodes of which the value field is the the actual argument. */
2102 if (code == TREE_LIST)
2104 node = TREE_VALUE (node);
2105 /* If it's a decl, deal with its type instead. */
2108 node = TREE_TYPE (node);
2109 code = TREE_CODE (node);
2115 else if (code == TEMPLATE_DECL)
2116 /* A template appearing as a template arg is a template template arg. */
2117 write_template_template_arg (node);
2118 else if ((TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
2119 || (abi_version_at_least (2) && code == CONST_DECL))
2120 write_template_arg_literal (node);
2121 else if (DECL_P (node))
2123 /* G++ 3.2 incorrectly mangled non-type template arguments of
2124 enumeration type using their names. */
2125 if (code == CONST_DECL)
2126 G.need_abi_warning = 1;
2129 write_encoding (node);
2134 /* Template arguments may be expressions. */
2136 write_expression (node);
2141 /* <template-template-arg>
2143 ::= <substitution> */
2146 write_template_template_arg (const tree decl)
2148 MANGLE_TRACE_TREE ("template-template-arg", decl);
2150 if (find_substitution (decl))
2152 write_name (decl, /*ignore_local_scope=*/0);
2153 add_substitution (decl);
2157 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2159 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2160 ::= A <expression> _ </element/ type>
2162 "Array types encode the dimension (number of elements) and the
2163 element type. For variable length arrays, the dimension (but not
2164 the '_' separator) is omitted." */
2167 write_array_type (const tree type)
2170 if (TYPE_DOMAIN (type))
2175 index_type = TYPE_DOMAIN (type);
2176 /* The INDEX_TYPE gives the upper and lower bounds of the
2178 max = TYPE_MAX_VALUE (index_type);
2179 if (TREE_CODE (max) == INTEGER_CST)
2181 /* The ABI specifies that we should mangle the number of
2182 elements in the array, not the largest allowed index. */
2183 max = size_binop (PLUS_EXPR, max, size_one_node);
2184 write_unsigned_number (tree_low_cst (max, 1));
2187 write_expression (TREE_OPERAND (max, 0));
2190 write_type (TREE_TYPE (type));
2193 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2194 variables. TYPE is a pointer-to-member POINTER_TYPE.
2196 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2199 write_pointer_to_member_type (const tree type)
2202 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2203 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2206 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2207 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2208 TEMPLATE_PARM_INDEX.
2210 <template-param> ::= T </parameter/ number> _
2212 If we are internally mangling then we distinguish level and, for
2213 non-type parms, type too. The mangling appends
2215 </level/ number> _ </non-type type/ type> _
2217 This is used by mangle_conv_op_name_for_type. */
2220 write_template_param (const tree parm)
2224 tree parm_type = NULL_TREE;
2226 MANGLE_TRACE_TREE ("template-parm", parm);
2228 switch (TREE_CODE (parm))
2230 case TEMPLATE_TYPE_PARM:
2231 case TEMPLATE_TEMPLATE_PARM:
2232 case BOUND_TEMPLATE_TEMPLATE_PARM:
2233 parm_index = TEMPLATE_TYPE_IDX (parm);
2234 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2237 case TEMPLATE_PARM_INDEX:
2238 parm_index = TEMPLATE_PARM_IDX (parm);
2239 parm_level = TEMPLATE_PARM_LEVEL (parm);
2240 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2248 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2249 earliest template param denoted by `_'. */
2251 write_unsigned_number (parm_index - 1);
2253 if (G.internal_mangling_p)
2256 write_unsigned_number (parm_level - 1);
2259 write_type (parm_type);
2264 /* <template-template-param>
2265 ::= <template-param>
2266 ::= <substitution> */
2269 write_template_template_param (const tree parm)
2271 tree template = NULL_TREE;
2273 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2274 template template parameter. The substitution candidate here is
2275 only the template. */
2276 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2279 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2280 if (find_substitution (template))
2284 /* <template-param> encodes only the template parameter position,
2285 not its template arguments, which is fine here. */
2286 write_template_param (parm);
2288 add_substitution (template);
2291 /* Non-terminal <substitution>.
2293 <substitution> ::= S <seq-id> _
2297 write_substitution (const int seq_id)
2299 MANGLE_TRACE ("substitution", "");
2303 write_number (seq_id - 1, /*unsigned=*/1, 36);
2307 /* Start mangling ENTITY. */
2310 start_mangling (const tree entity)
2313 G.need_abi_warning = false;
2314 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
2315 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
2318 /* Done with mangling. Return the generated mangled name. If WARN is
2319 true, and the name of G.entity will be mangled differently in a
2320 future version of the ABI, issue a warning. */
2322 static inline const char *
2323 finish_mangling (const bool warn)
2325 if (warn_abi && warn && G.need_abi_warning)
2326 warning ("the mangled name of `%D' will change in a future "
2330 /* Clear all the substitutions. */
2331 G.substitutions = 0;
2333 /* Null-terminate the string. */
2336 return (const char *) obstack_base (&G.name_obstack);
2339 /* Initialize data structures for mangling. */
2344 gcc_obstack_init (&G.name_obstack);
2346 /* Cache these identifiers for quick comparison when checking for
2347 standard substitutions. */
2348 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2349 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2350 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2351 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2352 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2353 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2356 /* Generate the mangled name of DECL. */
2359 mangle_decl_string (const tree decl)
2363 start_mangling (decl);
2365 if (TREE_CODE (decl) == TYPE_DECL)
2366 write_type (TREE_TYPE (decl));
2367 else if (/* The names of `extern "C"' functions are not mangled. */
2368 (DECL_EXTERN_C_FUNCTION_P (decl)
2369 /* But overloaded operator names *are* mangled. */
2370 && !DECL_OVERLOADED_OPERATOR_P (decl))
2371 /* The names of global variables aren't mangled either. */
2372 || (TREE_CODE (decl) == VAR_DECL
2373 && CP_DECL_CONTEXT (decl) == global_namespace)
2374 /* And neither are `extern "C"' variables. */
2375 || (TREE_CODE (decl) == VAR_DECL
2376 && DECL_EXTERN_C_P (decl)))
2377 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
2380 write_mangled_name (decl);
2381 if (DECL_LANG_SPECIFIC (decl)
2382 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
2383 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
2384 /* We need a distinct mangled name for these entities, but
2385 we should never actually output it. So, we append some
2386 characters the assembler won't like. */
2387 write_string (" *INTERNAL* ");
2390 result = finish_mangling (/*warn=*/true);
2392 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2396 /* Create an identifier for the external mangled name of DECL. */
2399 mangle_decl (const tree decl)
2401 tree id = get_identifier (mangle_decl_string (decl));
2403 SET_DECL_ASSEMBLER_NAME (decl, id);
2406 /* Generate the mangled representation of TYPE. */
2409 mangle_type_string (const tree type)
2413 start_mangling (type);
2415 result = finish_mangling (/*warn=*/false);
2417 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2421 /* Create an identifier for the mangled representation of TYPE. */
2424 mangle_type (const tree type)
2426 return get_identifier (mangle_type_string (type));
2429 /* Create an identifier for the mangled name of a special component
2430 for belonging to TYPE. CODE is the ABI-specified code for this
2434 mangle_special_for_type (const tree type, const char *code)
2438 /* We don't have an actual decl here for the special component, so
2439 we can't just process the <encoded-name>. Instead, fake it. */
2440 start_mangling (type);
2442 /* Start the mangling. */
2443 write_string ("_Z");
2444 write_string (code);
2448 result = finish_mangling (/*warn=*/false);
2451 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2453 return get_identifier (result);
2456 /* Create an identifier for the mangled representation of the typeinfo
2457 structure for TYPE. */
2460 mangle_typeinfo_for_type (const tree type)
2462 return mangle_special_for_type (type, "TI");
2465 /* Create an identifier for the mangled name of the NTBS containing
2466 the mangled name of TYPE. */
2469 mangle_typeinfo_string_for_type (const tree type)
2471 return mangle_special_for_type (type, "TS");
2474 /* Create an identifier for the mangled name of the vtable for TYPE. */
2477 mangle_vtbl_for_type (const tree type)
2479 return mangle_special_for_type (type, "TV");
2482 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2485 mangle_vtt_for_type (const tree type)
2487 return mangle_special_for_type (type, "TT");
2490 /* Return an identifier for a construction vtable group. TYPE is
2491 the most derived class in the hierarchy; BINFO is the base
2492 subobject for which this construction vtable group will be used.
2494 This mangling isn't part of the ABI specification; in the ABI
2495 specification, the vtable group is dumped in the same COMDAT as the
2496 main vtable, and is referenced only from that vtable, so it doesn't
2497 need an external name. For binary formats without COMDAT sections,
2498 though, we need external names for the vtable groups.
2500 We use the production
2502 <special-name> ::= CT <type> <offset number> _ <base type> */
2505 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2509 start_mangling (type);
2511 write_string ("_Z");
2512 write_string ("TC");
2514 write_integer_cst (BINFO_OFFSET (binfo));
2516 write_type (BINFO_TYPE (binfo));
2518 result = finish_mangling (/*warn=*/false);
2520 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2521 return get_identifier (result);
2524 /* Mangle a this pointer or result pointer adjustment.
2526 <call-offset> ::= h <fixed offset number> _
2527 ::= v <fixed offset number> _ <virtual offset number> _ */
2530 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2532 write_char (virtual_offset ? 'v' : 'h');
2534 /* For either flavor, write the fixed offset. */
2535 write_integer_cst (fixed_offset);
2538 /* For a virtual thunk, add the virtual offset. */
2541 write_integer_cst (virtual_offset);
2546 /* Return an identifier for the mangled name of a this-adjusting or
2547 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2548 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2549 is a virtual thunk, and it is the vtbl offset in
2550 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2551 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2552 thunk itself. A covariant thunk name always includes the adjustment
2553 for the this pointer, even if there is none.
2555 <special-name> ::= T <call-offset> <base encoding>
2556 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2561 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2562 tree virtual_offset)
2566 start_mangling (fn_decl);
2568 write_string ("_Z");
2571 if (!this_adjusting)
2573 /* Covariant thunk with no this adjustment */
2575 mangle_call_offset (integer_zero_node, NULL_TREE);
2576 mangle_call_offset (fixed_offset, virtual_offset);
2578 else if (!DECL_THUNK_P (fn_decl))
2579 /* Plain this adjusting thunk. */
2580 mangle_call_offset (fixed_offset, virtual_offset);
2583 /* This adjusting thunk to covariant thunk. */
2585 mangle_call_offset (fixed_offset, virtual_offset);
2586 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2587 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2589 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2590 mangle_call_offset (fixed_offset, virtual_offset);
2591 fn_decl = THUNK_TARGET (fn_decl);
2595 write_encoding (fn_decl);
2597 result = finish_mangling (/*warn=*/false);
2599 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2600 return get_identifier (result);
2603 /* Return an identifier for the mangled unqualified name for a
2604 conversion operator to TYPE. This mangling is not specified by the
2605 ABI spec; it is only used internally. */
2608 mangle_conv_op_name_for_type (const tree type)
2611 const char *mangled_type;
2614 /* Build the internal mangling for TYPE. */
2615 G.internal_mangling_p = true;
2616 mangled_type = mangle_type_string (type);
2617 G.internal_mangling_p = false;
2619 /* Allocate a temporary buffer for the complete name. */
2620 op_name = concat ("operator ", mangled_type, NULL);
2621 /* Find or create an identifier. */
2622 identifier = get_identifier (op_name);
2623 /* Done with the temporary buffer. */
2626 /* It had better be a unique mangling for the type. */
2627 if (IDENTIFIER_TYPENAME_P (identifier)
2628 && !same_type_p (type, TREE_TYPE (identifier)))
2630 /* In G++ 3.2, the name mangling scheme was ambiguous. In later
2631 versions of the ABI, this problem has been fixed. */
2632 if (abi_version_at_least (2))
2634 error ("due to a defect in the G++ 3.2 ABI, G++ has assigned the "
2635 "same mangled name to two different types");
2638 /* Set bits on the identifier so we know later it's a conversion. */
2639 IDENTIFIER_OPNAME_P (identifier) = 1;
2640 IDENTIFIER_TYPENAME_P (identifier) = 1;
2641 /* Hang TYPE off the identifier so it can be found easily later when
2642 performing conversions. */
2643 TREE_TYPE (identifier) = type;
2648 /* Return an identifier for the name of an initialization guard
2649 variable for indicated VARIABLE. */
2652 mangle_guard_variable (const tree variable)
2654 start_mangling (variable);
2655 write_string ("_ZGV");
2656 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2657 /* The name of a guard variable for a reference temporary should refer
2658 to the reference, not the temporary. */
2659 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2661 write_name (variable, /*ignore_local_scope=*/0);
2662 return get_identifier (finish_mangling (/*warn=*/false));
2665 /* Return an identifier for the name of a temporary variable used to
2666 initialize a static reference. This isn't part of the ABI, but we might
2667 as well call them something readable. */
2670 mangle_ref_init_variable (const tree variable)
2672 start_mangling (variable);
2673 write_string ("_ZGR");
2674 write_name (variable, /*ignore_local_scope=*/0);
2675 return get_identifier (finish_mangling (/*warn=*/false));
2679 /* Foreign language type mangling section. */
2681 /* How to write the type codes for the integer Java type. */
2684 write_java_integer_type_codes (const tree type)
2686 if (type == java_int_type_node)
2688 else if (type == java_short_type_node)
2690 else if (type == java_byte_type_node)
2692 else if (type == java_char_type_node)
2694 else if (type == java_long_type_node)
2696 else if (type == java_boolean_type_node)
2702 #include "gt-cp-mangle.h"