1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc.
3 Written by Alex Samuel <sameul@codesourcery.com>
5 This file is part of GNU CC.
7 GNU CC 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 GNU CC 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 GNU CC; 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
59 /* Debugging support. */
61 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
63 #define DEBUG_MANGLE 0
66 /* Macros for tracing the write_* functions. */
68 # define MANGLE_TRACE(FN, INPUT) \
69 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
70 # define MANGLE_TRACE_TREE(FN, NODE) \
71 fprintf (stderr, " %-24s: %-24s (%p)\n", \
72 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
74 # define MANGLE_TRACE(FN, INPUT)
75 # define MANGLE_TRACE_TREE(FN, NODE)
78 /* Nonzero if NODE is a class template-id. We can't rely on
79 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
80 that hard to distinguish A<T> from A, where A<T> is the type as
81 instantiated outside of the template, and A is the type used
82 without parameters inside the template. */
83 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
84 (TYPE_LANG_SPECIFIC (NODE) != NULL \
85 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
86 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
87 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
89 /* Things we only need one of. This module is not reentrant. */
92 /* The name in which we're building the mangled name. */
93 struct obstack name_obstack;
95 /* An array of the current substitution candidates, in the order
97 varray_type substitutions;
99 /* The entity that is being mangled. */
102 /* We are mangling an internal symbol. It is important to keep those
103 involving template parmeters distinct by distinguishing their level
104 and, for non-type parms, their type. */
105 bool internal_mangling_p;
107 /* True if the mangling will be different in a future version of the
109 bool need_abi_warning;
112 /* Indices into subst_identifiers. These are identifiers used in
113 special substitution rules. */
121 SUBID_BASIC_IOSTREAM,
124 substitution_identifier_index_t;
126 /* For quick substitution checks, look up these common identifiers
128 static tree subst_identifiers[SUBID_MAX];
130 /* Single-letter codes for builtin integer types, defined in
131 <builtin-type>. These are indexed by integer_type_kind values. */
133 integer_type_codes[itk_none] =
136 'a', /* itk_signed_char */
137 'h', /* itk_unsigned_char */
139 't', /* itk_unsigned_short */
141 'j', /* itk_unsigned_int */
143 'm', /* itk_unsigned_long */
144 'x', /* itk_long_long */
145 'y' /* itk_unsigned_long_long */
148 static int decl_is_template_id PARAMS ((tree, tree*));
150 /* Functions for handling substitutions. */
152 static inline tree canonicalize_for_substitution PARAMS ((tree));
153 static void add_substitution PARAMS ((tree));
154 static inline int is_std_substitution PARAMS ((tree, substitution_identifier_index_t));
155 static inline int is_std_substitution_char PARAMS ((tree, substitution_identifier_index_t));
156 static int find_substitution PARAMS ((tree));
158 /* Functions for emitting mangled representations of things. */
160 static void write_mangled_name PARAMS ((tree));
161 static void write_encoding PARAMS ((tree));
162 static void write_name PARAMS ((tree, int));
163 static void write_unscoped_name PARAMS ((tree));
164 static void write_unscoped_template_name PARAMS ((tree));
165 static void write_nested_name PARAMS ((tree));
166 static void write_prefix PARAMS ((tree));
167 static void write_template_prefix PARAMS ((tree));
168 static void write_unqualified_name PARAMS ((tree));
169 static void write_conversion_operator_name (tree);
170 static void write_source_name PARAMS ((tree));
171 static int hwint_to_ascii PARAMS ((unsigned HOST_WIDE_INT, unsigned int, char *, unsigned));
172 static void write_number PARAMS ((unsigned HOST_WIDE_INT, int,
174 static void write_integer_cst PARAMS ((tree));
175 static void write_identifier PARAMS ((const char *));
176 static void write_special_name_constructor PARAMS ((tree));
177 static void write_special_name_destructor PARAMS ((tree));
178 static void write_type PARAMS ((tree));
179 static int write_CV_qualifiers_for_type PARAMS ((tree));
180 static void write_builtin_type PARAMS ((tree));
181 static void write_function_type PARAMS ((tree));
182 static void write_bare_function_type PARAMS ((tree, int, tree));
183 static void write_method_parms PARAMS ((tree, int, tree));
184 static void write_class_enum_type PARAMS ((tree));
185 static void write_template_args PARAMS ((tree));
186 static void write_expression PARAMS ((tree));
187 static void write_template_arg_literal PARAMS ((tree));
188 static void write_template_arg PARAMS ((tree));
189 static void write_template_template_arg PARAMS ((tree));
190 static void write_array_type PARAMS ((tree));
191 static void write_pointer_to_member_type PARAMS ((tree));
192 static void write_template_param PARAMS ((tree));
193 static void write_template_template_param PARAMS ((tree));
194 static void write_substitution PARAMS ((int));
195 static int discriminator_for_local_entity PARAMS ((tree));
196 static int discriminator_for_string_literal PARAMS ((tree, tree));
197 static void write_discriminator PARAMS ((int));
198 static void write_local_name PARAMS ((tree, tree, tree));
199 static void dump_substitution_candidates PARAMS ((void));
200 static const char *mangle_decl_string PARAMS ((tree));
202 /* Control functions. */
204 static inline void start_mangling (tree);
205 static inline const char *finish_mangling (bool);
206 static tree mangle_special_for_type PARAMS ((tree, const char *));
208 /* Foreign language functions. */
210 static void write_java_integer_type_codes PARAMS ((tree));
212 /* Append a single character to the end of the mangled
214 #define write_char(CHAR) \
215 obstack_1grow (&G.name_obstack, (CHAR))
217 /* Append a sized buffer to the end of the mangled representation. */
218 #define write_chars(CHAR, LEN) \
219 obstack_grow (&G.name_obstack, (CHAR), (LEN))
221 /* Append a NUL-terminated string to the end of the mangled
223 #define write_string(STRING) \
224 obstack_grow (&G.name_obstack, (STRING), strlen (STRING))
226 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
227 same purpose (context, which may be a type) and value (template
228 decl). See write_template_prefix for more information on what this
230 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
231 (TREE_CODE (NODE1) == TREE_LIST \
232 && TREE_CODE (NODE2) == TREE_LIST \
233 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
234 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2)))\
235 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
236 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
238 /* Write out an unsigned quantity in base 10. */
239 #define write_unsigned_number(NUMBER) \
240 write_number ((NUMBER), /*unsigned_p=*/1, 10)
242 /* If DECL is a template instance, return nonzero and, if
243 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
244 Otherwise return zero. */
247 decl_is_template_id (decl, template_info)
251 if (TREE_CODE (decl) == TYPE_DECL)
253 /* TYPE_DECLs are handled specially. Look at its type to decide
254 if this is a template instantiation. */
255 tree type = TREE_TYPE (decl);
257 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
259 if (template_info != NULL)
260 /* For a templated TYPE_DECL, the template info is hanging
262 *template_info = TYPE_TEMPLATE_INFO (type);
268 /* Check if this is a primary template. */
269 if (DECL_LANG_SPECIFIC (decl) != NULL
270 && DECL_USE_TEMPLATE (decl)
271 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
272 && TREE_CODE (decl) != TEMPLATE_DECL)
274 if (template_info != NULL)
275 /* For most templated decls, the template info is hanging
277 *template_info = DECL_TEMPLATE_INFO (decl);
282 /* It's not a template id. */
286 /* Produce debugging output of current substitution candidates. */
289 dump_substitution_candidates ()
293 fprintf (stderr, " ++ substitutions ");
294 for (i = 0; i < VARRAY_ACTIVE_SIZE (G.substitutions); ++i)
296 tree el = VARRAY_TREE (G.substitutions, i);
297 const char *name = "???";
300 fprintf (stderr, " ");
302 name = IDENTIFIER_POINTER (DECL_NAME (el));
303 else if (TREE_CODE (el) == TREE_LIST)
304 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
305 else if (TYPE_NAME (el))
306 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
307 fprintf (stderr, " S%d_ = ", i - 1);
309 (CP_TYPE_RESTRICT_P (el)
310 || CP_TYPE_VOLATILE_P (el)
311 || CP_TYPE_CONST_P (el)))
312 fprintf (stderr, "CV-");
313 fprintf (stderr, "%s (%s at %p)\n",
314 name, tree_code_name[TREE_CODE (el)], (void *) el);
318 /* Both decls and types can be substitution candidates, but sometimes
319 they refer to the same thing. For instance, a TYPE_DECL and
320 RECORD_TYPE for the same class refer to the same thing, and should
321 be treated accordinginly in substitutions. This function returns a
322 canonicalized tree node representing NODE that is used when adding
323 and substitution candidates and finding matches. */
326 canonicalize_for_substitution (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 (node)
348 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
349 tree_code_name[TREE_CODE (node)], (void *) node);
351 /* Get the canonicalized substitution candidate for NODE. */
352 c = canonicalize_for_substitution (node);
353 if (DEBUG_MANGLE && c != node)
354 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
355 tree_code_name[TREE_CODE (node)], (void *) node);
359 /* Make sure NODE isn't already a candidate. */
362 for (i = VARRAY_ACTIVE_SIZE (G.substitutions); --i >= 0; )
364 tree candidate = VARRAY_TREE (G.substitutions, i);
366 && node == candidate)
368 && TYPE_P (candidate)
369 && same_type_p (node, candidate)))
373 #endif /* ENABLE_CHECKING */
375 /* Put the decl onto the varray of substitution candidates. */
376 VARRAY_PUSH_TREE (G.substitutions, node);
379 dump_substitution_candidates ();
382 /* Helper function for find_substitution. Returns nonzero if NODE,
383 which may be a decl or a CLASS_TYPE, is a template-id with template
384 name of substitution_index[INDEX] in the ::std namespace. */
387 is_std_substitution (node, index)
389 substitution_identifier_index_t index;
396 type = TREE_TYPE (node);
399 else if (CLASS_TYPE_P (node))
402 decl = TYPE_NAME (node);
405 /* These are not the droids you're looking for. */
408 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
409 && TYPE_LANG_SPECIFIC (type)
410 && TYPE_TEMPLATE_INFO (type)
411 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
412 == subst_identifiers[index]));
415 /* Helper function for find_substitution. Returns nonzero if NODE,
416 which may be a decl or a CLASS_TYPE, is the template-id
417 ::std::identifier<char>, where identifier is
418 substitution_index[INDEX]. */
421 is_std_substitution_char (node, index)
423 substitution_identifier_index_t index;
426 /* Check NODE's name is ::std::identifier. */
427 if (!is_std_substitution (node, index))
429 /* Figure out its template args. */
431 args = DECL_TI_ARGS (node);
432 else if (CLASS_TYPE_P (node))
433 args = CLASSTYPE_TI_ARGS (node);
435 /* Oops, not a template. */
437 /* NODE's template arg list should be <char>. */
439 TREE_VEC_LENGTH (args) == 1
440 && TREE_VEC_ELT (args, 0) == char_type_node;
443 /* Check whether a substitution should be used to represent NODE in
446 First, check standard special-case substitutions.
448 <substitution> ::= St
455 # ::std::basic_string
458 # ::std::basic_string<char,
459 ::std::char_traits<char>,
460 ::std::allocator<char> >
463 # ::std::basic_istream<char, ::std::char_traits<char> >
466 # ::std::basic_ostream<char, ::std::char_traits<char> >
469 # ::std::basic_iostream<char, ::std::char_traits<char> >
471 Then examine the stack of currently available substitution
472 candidates for entities appearing earlier in the same mangling
474 If a substitution is found, write its mangled representation and
475 return nonzero. If none is found, just return zero. */
478 find_substitution (node)
482 int size = VARRAY_ACTIVE_SIZE (G.substitutions);
487 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
488 tree_code_name[TREE_CODE (node)], (void *) node);
490 /* Obtain the canonicalized substitution representation for NODE.
491 This is what we'll compare against. */
492 node = canonicalize_for_substitution (node);
494 /* Check for builtin substitutions. */
496 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
497 type = TYPE_P (node) ? node : TREE_TYPE (node);
499 /* Check for std::allocator. */
501 && is_std_substitution (decl, SUBID_ALLOCATOR)
502 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
508 /* Check for std::basic_string. */
509 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
513 /* If this is a type (i.e. a fully-qualified template-id),
515 std::basic_string <char,
516 std::char_traits<char>,
517 std::allocator<char> > . */
518 if (cp_type_quals (type) == TYPE_UNQUALIFIED
519 && CLASSTYPE_USE_TEMPLATE (type))
521 tree args = CLASSTYPE_TI_ARGS (type);
522 if (TREE_VEC_LENGTH (args) == 3
523 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
524 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
526 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
535 /* Substitute for the template name only if this isn't a type. */
542 /* Check for basic_{i,o,io}stream. */
544 && cp_type_quals (type) == TYPE_UNQUALIFIED
545 && CLASS_TYPE_P (type)
546 && CLASSTYPE_USE_TEMPLATE (type)
547 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
549 /* First, check for the template
550 args <char, std::char_traits<char> > . */
551 tree args = CLASSTYPE_TI_ARGS (type);
552 if (TREE_VEC_LENGTH (args) == 2
553 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
554 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
557 /* Got them. Is this basic_istream? */
558 tree name = DECL_NAME (CLASSTYPE_TI_TEMPLATE (type));
559 if (name == subst_identifiers[SUBID_BASIC_ISTREAM])
564 /* Or basic_ostream? */
565 else if (name == subst_identifiers[SUBID_BASIC_OSTREAM])
570 /* Or basic_iostream? */
571 else if (name == subst_identifiers[SUBID_BASIC_IOSTREAM])
579 /* Check for namespace std. */
580 if (decl && DECL_NAMESPACE_STD_P (decl))
586 /* Now check the list of available substitutions for this mangling
588 for (i = 0; i < size; ++i)
590 tree candidate = VARRAY_TREE (G.substitutions, i);
591 /* NODE is a matched to a candidate if it's the same decl node or
592 if it's the same type. */
593 if (decl == candidate
594 || (TYPE_P (candidate) && type && TYPE_P (type)
595 && same_type_p (type, candidate))
596 || NESTED_TEMPLATE_MATCH (node, candidate))
598 write_substitution (i);
603 /* No substitution found. */
608 /* <mangled-name> ::= _Z <encoding> */
611 write_mangled_name (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 (decl)
640 MANGLE_TRACE_TREE ("encoding", decl);
642 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
644 /* For overloaded operators write just the mangled name
645 without arguments. */
646 if (DECL_OVERLOADED_OPERATOR_P (decl))
647 write_name (decl, /*ignore_local_scope=*/0);
649 write_source_name (DECL_NAME (decl));
653 write_name (decl, /*ignore_local_scope=*/0);
654 if (TREE_CODE (decl) == FUNCTION_DECL)
658 if (decl_is_template_id (decl, NULL))
659 fn_type = get_mostly_instantiated_function_type (decl);
661 fn_type = TREE_TYPE (decl);
663 write_bare_function_type (fn_type,
664 (!DECL_CONSTRUCTOR_P (decl)
665 && !DECL_DESTRUCTOR_P (decl)
666 && !DECL_CONV_FN_P (decl)
667 && decl_is_template_id (decl, NULL)),
672 /* <name> ::= <unscoped-name>
673 ::= <unscoped-template-name> <template-args>
677 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
678 called from <local-name>, which mangles the enclosing scope
679 elsewhere and then uses this function to mangle just the part
680 underneath the function scope. So don't use the <local-name>
681 production, to avoid an infinite recursion. */
684 write_name (decl, ignore_local_scope)
686 int ignore_local_scope;
690 MANGLE_TRACE_TREE ("name", decl);
692 if (TREE_CODE (decl) == TYPE_DECL)
694 /* In case this is a typedef, fish out the corresponding
695 TYPE_DECL for the main variant. */
696 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
697 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
700 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
702 /* A decl in :: or ::std scope is treated specially. The former is
703 mangled using <unscoped-name> or <unscoped-template-name>, the
704 latter with a special substitution. Also, a name that is
705 directly in a local function scope is also mangled with
706 <unscoped-name> rather than a full <nested-name>. */
708 || context == global_namespace
709 || DECL_NAMESPACE_STD_P (context)
710 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
713 /* Is this a template instance? */
714 if (decl_is_template_id (decl, &template_info))
716 /* Yes: use <unscoped-template-name>. */
717 write_unscoped_template_name (TI_TEMPLATE (template_info));
718 write_template_args (TI_ARGS (template_info));
721 /* Everything else gets an <unqualified-name>. */
722 write_unscoped_name (decl);
726 /* Handle local names, unless we asked not to (that is, invoked
727 under <local-name>, to handle only the part of the name under
729 if (!ignore_local_scope)
731 /* Scan up the list of scope context, looking for a
732 function. If we find one, this entity is in local
733 function scope. local_entity tracks context one scope
734 level down, so it will contain the element that's
735 directly in that function's scope, either decl or one of
736 its enclosing scopes. */
737 tree local_entity = decl;
738 while (context != NULL && context != global_namespace)
740 /* Make sure we're always dealing with decls. */
741 if (context != NULL && TYPE_P (context))
742 context = TYPE_NAME (context);
743 /* Is this a function? */
744 if (TREE_CODE (context) == FUNCTION_DECL)
746 /* Yes, we have local scope. Use the <local-name>
747 production for the innermost function scope. */
748 write_local_name (context, local_entity, decl);
751 /* Up one scope level. */
752 local_entity = context;
753 context = CP_DECL_CONTEXT (context);
756 /* No local scope found? Fall through to <nested-name>. */
759 /* Other decls get a <nested-name> to encode their scope. */
760 write_nested_name (decl);
764 /* <unscoped-name> ::= <unqualified-name>
765 ::= St <unqualified-name> # ::std:: */
768 write_unscoped_name (decl)
771 tree context = CP_DECL_CONTEXT (decl);
773 MANGLE_TRACE_TREE ("unscoped-name", decl);
775 /* Is DECL in ::std? */
776 if (DECL_NAMESPACE_STD_P (context))
779 write_unqualified_name (decl);
781 /* If not, it should be either in the global namespace, or directly
782 in a local function scope. */
783 else if (context == global_namespace
785 || TREE_CODE (context) == FUNCTION_DECL)
786 write_unqualified_name (decl);
791 /* <unscoped-template-name> ::= <unscoped-name>
792 ::= <substitution> */
795 write_unscoped_template_name (decl)
798 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
800 if (find_substitution (decl))
802 write_unscoped_name (decl);
803 add_substitution (decl);
806 /* Write the nested name, including CV-qualifiers, of DECL.
808 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
809 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
811 <CV-qualifiers> ::= [r] [V] [K] */
814 write_nested_name (decl)
819 MANGLE_TRACE_TREE ("nested-name", decl);
823 /* Write CV-qualifiers, if this is a member function. */
824 if (TREE_CODE (decl) == FUNCTION_DECL
825 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
827 if (DECL_VOLATILE_MEMFUNC_P (decl))
829 if (DECL_CONST_MEMFUNC_P (decl))
833 /* Is this a template instance? */
834 if (decl_is_template_id (decl, &template_info))
836 /* Yes, use <template-prefix>. */
837 write_template_prefix (decl);
838 write_template_args (TI_ARGS (template_info));
842 /* No, just use <prefix> */
843 write_prefix (DECL_CONTEXT (decl));
844 write_unqualified_name (decl);
849 /* <prefix> ::= <prefix> <unqualified-name>
851 ::= <template-prefix> <template-args>
853 ::= <substitution> */
860 /* Non-NULL if NODE represents a template-id. */
861 tree template_info = NULL;
863 MANGLE_TRACE_TREE ("prefix", node);
866 || node == global_namespace)
869 if (find_substitution (node))
874 /* If this is a function decl, that means we've hit function
875 scope, so this prefix must be for a local name. In this
876 case, we're under the <local-name> production, which encodes
877 the enclosing function scope elsewhere. So don't continue
879 if (TREE_CODE (node) == FUNCTION_DECL)
883 decl_is_template_id (decl, &template_info);
887 /* Node is a type. */
888 decl = TYPE_NAME (node);
889 if (CLASSTYPE_TEMPLATE_ID_P (node))
890 template_info = TYPE_TEMPLATE_INFO (node);
893 /* In G++ 3.2, the name of the template parameter was used. */
894 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
895 && !abi_version_at_least (2))
896 G.need_abi_warning = true;
898 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
899 && abi_version_at_least (2))
900 write_template_param (node);
901 else if (template_info != NULL)
904 write_template_prefix (decl);
905 write_template_args (TI_ARGS (template_info));
910 write_prefix (CP_DECL_CONTEXT (decl));
911 write_unqualified_name (decl);
914 add_substitution (node);
917 /* <template-prefix> ::= <prefix> <template component>
919 ::= <substitution> */
922 write_template_prefix (node)
925 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
926 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
927 tree context = CP_DECL_CONTEXT (decl);
932 MANGLE_TRACE_TREE ("template-prefix", node);
934 /* Find the template decl. */
935 if (decl_is_template_id (decl, &template_info))
936 template = TI_TEMPLATE (template_info);
937 else if (CLASSTYPE_TEMPLATE_ID_P (type))
938 template = TYPE_TI_TEMPLATE (type);
940 /* Oops, not a template. */
943 /* For a member template, though, the template name for the
944 innermost name must have all the outer template levels
945 instantiated. For instance, consider
947 template<typename T> struct Outer {
948 template<typename U> struct Inner {};
951 The template name for `Inner' in `Outer<int>::Inner<float>' is
952 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
953 levels separately, so there's no TEMPLATE_DECL available for this
954 (there's only `Outer<T>::Inner<U>').
956 In order to get the substitutions right, we create a special
957 TREE_LIST to represent the substitution candidate for a nested
958 template. The TREE_PURPOSE is the template's context, fully
959 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
962 So, for the example above, `Outer<int>::Inner' is represented as a
963 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
964 and whose value is `Outer<T>::Inner<U>'. */
965 if (TYPE_P (context))
966 substitution = build_tree_list (context, template);
968 substitution = template;
970 if (find_substitution (substitution))
973 /* In G++ 3.2, the name of the template template parameter was used. */
974 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
975 && !abi_version_at_least (2))
976 G.need_abi_warning = true;
978 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
979 && abi_version_at_least (2))
980 write_template_param (TREE_TYPE (template));
983 write_prefix (context);
984 write_unqualified_name (decl);
987 add_substitution (substitution);
990 /* We don't need to handle thunks, vtables, or VTTs here. Those are
991 mangled through special entry points.
993 <unqualified-name> ::= <operator-name>
998 write_unqualified_name (decl)
1001 MANGLE_TRACE_TREE ("unqualified-name", decl);
1003 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
1004 write_special_name_constructor (decl);
1005 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
1006 write_special_name_destructor (decl);
1007 else if (DECL_CONV_FN_P (decl))
1009 /* Conversion operator. Handle it right here.
1010 <operator> ::= cv <type> */
1012 if (decl_is_template_id (decl, NULL))
1014 tree fn_type = get_mostly_instantiated_function_type (decl);
1015 type = TREE_TYPE (fn_type);
1018 type = TREE_TYPE (DECL_NAME (decl));
1019 write_conversion_operator_name (type);
1021 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1023 operator_name_info_t *oni;
1024 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1025 oni = assignment_operator_name_info;
1027 oni = operator_name_info;
1029 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1032 write_source_name (DECL_NAME (decl));
1035 /* Write the unqualified-name for a conversion operator to TYPE. */
1038 write_conversion_operator_name (tree type)
1040 write_string ("cv");
1044 /* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1046 <source-name> ::= </length/ number> <identifier> */
1049 write_source_name (identifier)
1052 MANGLE_TRACE_TREE ("source-name", identifier);
1054 /* Never write the whole template-id name including the template
1055 arguments; we only want the template name. */
1056 if (IDENTIFIER_TEMPLATE (identifier))
1057 identifier = IDENTIFIER_TEMPLATE (identifier);
1059 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1060 write_identifier (IDENTIFIER_POINTER (identifier));
1063 /* Convert NUMBER to ascii using base BASE and generating at least
1064 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1065 into which to store the characters. Returns the number of
1066 characters generated (these will be layed out in advance of where
1070 hwint_to_ascii (number, base, buffer, min_digits)
1071 unsigned HOST_WIDE_INT number;
1074 unsigned min_digits;
1076 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1077 unsigned digits = 0;
1081 unsigned HOST_WIDE_INT d = number / base;
1083 *--buffer = base_digits[number - d * base];
1087 while (digits < min_digits)
1089 *--buffer = base_digits[0];
1095 /* Non-terminal <number>.
1097 <number> ::= [n] </decimal integer/> */
1100 write_number (number, unsigned_p, base)
1101 unsigned HOST_WIDE_INT number;
1105 char buffer[sizeof (HOST_WIDE_INT) * 8];
1108 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1111 number = -((HOST_WIDE_INT) number);
1113 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1114 write_chars (buffer + sizeof (buffer) - count, count);
1117 /* Write out an integral CST in decimal. Most numbers are small, and
1118 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1119 bigger than that, which we must deal with. */
1122 write_integer_cst (cst)
1125 int sign = tree_int_cst_sgn (cst);
1127 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1129 /* A bignum. We do this in chunks, each of which fits in a
1131 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1132 unsigned HOST_WIDE_INT chunk;
1133 unsigned chunk_digits;
1134 char *ptr = buffer + sizeof (buffer);
1139 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1144 if (sizeof (HOST_WIDE_INT) >= 8)
1146 /* It is at least 64 bits, so 10^18 is representable. */
1151 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1152 base = build_int_2 (chunk, 0);
1153 n = build_int_2 (TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1154 TREE_TYPE (n) = TREE_TYPE (base) = type;
1159 n = fold (build1 (NEGATE_EXPR, type, n));
1163 tree d = fold (build (FLOOR_DIV_EXPR, type, n, base));
1164 tree tmp = fold (build (MULT_EXPR, type, d, base));
1167 done = integer_zerop (d);
1168 tmp = fold (build (MINUS_EXPR, type, n, tmp));
1169 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1170 done ? 1 : chunk_digits);
1176 write_chars (ptr, count);
1181 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1188 write_unsigned_number (low);
1192 /* Non-terminal <identifier>.
1194 <identifier> ::= </unqualified source code identifier> */
1197 write_identifier (identifier)
1198 const char *identifier;
1200 MANGLE_TRACE ("identifier", identifier);
1201 write_string (identifier);
1204 /* Handle constructor productions of non-terminal <special-name>.
1205 CTOR is a constructor FUNCTION_DECL.
1207 <special-name> ::= C1 # complete object constructor
1208 ::= C2 # base object constructor
1209 ::= C3 # complete object allocating constructor
1211 Currently, allocating constructors are never used.
1213 We also need to provide mangled names for the maybe-in-charge
1214 constructor, so we treat it here too. mangle_decl_string will
1215 append *INTERNAL* to that, to make sure we never emit it. */
1218 write_special_name_constructor (ctor)
1221 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1222 /* Even though we don't ever emit a definition of the
1223 old-style destructor, we still have to consider entities
1224 (like static variables) nested inside it. */
1225 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
1226 write_string ("C1");
1227 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1228 write_string ("C2");
1233 /* Handle destructor productions of non-terminal <special-name>.
1234 DTOR is a destructor FUNCTION_DECL.
1236 <special-name> ::= D0 # deleting (in-charge) destructor
1237 ::= D1 # complete object (in-charge) destructor
1238 ::= D2 # base object (not-in-charge) destructor
1240 We also need to provide mangled names for the maybe-incharge
1241 destructor, so we treat it here too. mangle_decl_string will
1242 append *INTERNAL* to that, to make sure we never emit it. */
1245 write_special_name_destructor (dtor)
1248 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1249 write_string ("D0");
1250 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1251 /* Even though we don't ever emit a definition of the
1252 old-style destructor, we still have to consider entities
1253 (like static variables) nested inside it. */
1254 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
1255 write_string ("D1");
1256 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1257 write_string ("D2");
1262 /* Return the discriminator for ENTITY appearing inside
1263 FUNCTION. The discriminator is the lexical ordinal of VAR among
1264 entities with the same name in the same FUNCTION. */
1267 discriminator_for_local_entity (entity)
1273 /* Assume this is the only local entity with this name. */
1276 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1277 discriminator = DECL_DISCRIMINATOR (entity);
1278 else if (TREE_CODE (entity) == TYPE_DECL)
1280 /* Scan the list of local classes. */
1281 entity = TREE_TYPE (entity);
1282 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1283 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1284 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1288 return discriminator;
1291 /* Return the discriminator for STRING, a string literal used inside
1292 FUNCTION. The disciminator is the lexical ordinal of STRING among
1293 string literals used in FUNCTION. */
1296 discriminator_for_string_literal (function, string)
1297 tree function ATTRIBUTE_UNUSED;
1298 tree string ATTRIBUTE_UNUSED;
1300 /* For now, we don't discriminate amongst string literals. */
1304 /* <discriminator> := _ <number>
1306 The discriminator is used only for the second and later occurrences
1307 of the same name within a single function. In this case <number> is
1308 n - 2, if this is the nth occurrence, in lexical order. */
1311 write_discriminator (discriminator)
1314 /* If discriminator is zero, don't write anything. Otherwise... */
1315 if (discriminator > 0)
1318 write_unsigned_number (discriminator - 1);
1322 /* Mangle the name of a function-scope entity. FUNCTION is the
1323 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1324 the entity itself. LOCAL_ENTITY is the entity that's directly
1325 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1328 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1329 := Z <function encoding> E s [<discriminator>] */
1332 write_local_name (function, local_entity, entity)
1337 MANGLE_TRACE_TREE ("local-name", entity);
1340 write_encoding (function);
1342 if (TREE_CODE (entity) == STRING_CST)
1345 write_discriminator (discriminator_for_string_literal (function,
1350 /* Now the <entity name>. Let write_name know its being called
1351 from <local-name>, so it doesn't try to process the enclosing
1352 function scope again. */
1353 write_name (entity, /*ignore_local_scope=*/1);
1354 write_discriminator (discriminator_for_local_entity (local_entity));
1358 /* Non-terminals <type> and <CV-qualifier>.
1360 <type> ::= <builtin-type>
1362 ::= <class-enum-type>
1364 ::= <pointer-to-member-type>
1365 ::= <template-param>
1368 ::= P <type> # pointer-to
1369 ::= R <type> # reference-to
1370 ::= C <type> # complex pair (C 2000)
1371 ::= G <type> # imaginary (C 2000) [not supported]
1372 ::= U <source-name> <type> # vendor extended type qualifier
1374 TYPE is a type node. */
1380 /* This gets set to nonzero if TYPE turns out to be a (possibly
1381 CV-qualified) builtin type. */
1382 int is_builtin_type = 0;
1384 MANGLE_TRACE_TREE ("type", type);
1386 if (type == error_mark_node)
1389 if (find_substitution (type))
1392 if (write_CV_qualifiers_for_type (type) > 0)
1393 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1394 mangle the unqualified type. The recursive call is needed here
1395 since both the qualified and uqualified types are substitution
1397 write_type (TYPE_MAIN_VARIANT (type));
1398 else if (TREE_CODE (type) == ARRAY_TYPE)
1399 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1400 so that the cv-qualification of the element type is available
1401 in write_array_type. */
1402 write_array_type (type);
1405 /* See through any typedefs. */
1406 type = TYPE_MAIN_VARIANT (type);
1408 switch (TREE_CODE (type))
1412 case INTEGER_TYPE: /* Includes wchar_t. */
1414 /* If this is a typedef, TYPE may not be one of
1415 the standard builtin type nodes, but an alias of one. Use
1416 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1417 write_builtin_type (TYPE_MAIN_VARIANT (type));
1423 write_type (TREE_TYPE (type));
1428 write_function_type (type);
1434 /* A pointer-to-member function is represented as a special
1435 RECORD_TYPE, so check for this first. */
1436 if (TYPE_PTRMEMFUNC_P (type))
1437 write_pointer_to_member_type (type);
1439 write_class_enum_type (type);
1443 case UNBOUND_CLASS_TEMPLATE:
1444 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1445 ordinary nested names. */
1446 write_nested_name (TYPE_STUB_DECL (type));
1450 /* A pointer-to-member variable is represented by a POINTER_TYPE
1451 to an OFFSET_TYPE, so check for this first. */
1452 if (TYPE_PTRMEM_P (type))
1453 write_pointer_to_member_type (type);
1457 write_type (TREE_TYPE (type));
1461 case REFERENCE_TYPE:
1463 write_type (TREE_TYPE (type));
1466 case TEMPLATE_TYPE_PARM:
1467 case TEMPLATE_PARM_INDEX:
1468 write_template_param (type);
1471 case TEMPLATE_TEMPLATE_PARM:
1472 write_template_template_param (type);
1475 case BOUND_TEMPLATE_TEMPLATE_PARM:
1476 write_template_template_param (type);
1478 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1482 write_pointer_to_member_type (build_pointer_type (type));
1486 write_string ("U8__vector");
1487 write_type (TREE_TYPE (type));
1495 /* Types other than builtin types are substitution candidates. */
1496 if (!is_builtin_type)
1497 add_substitution (type);
1500 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1501 CV-qualifiers written for TYPE.
1503 <CV-qualifiers> ::= [r] [V] [K] */
1506 write_CV_qualifiers_for_type (type)
1509 int num_qualifiers = 0;
1511 /* The order is specified by:
1513 "In cases where multiple order-insensitive qualifiers are
1514 present, they should be ordered 'K' (closest to the base type),
1515 'V', 'r', and 'U' (farthest from the base type) ..."
1517 Note that we do not use cp_type_quals below; given "const
1518 int[3]", the "const" is emitted with the "int", not with the
1521 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1526 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1531 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1537 return num_qualifiers;
1540 /* Non-terminal <builtin-type>.
1542 <builtin-type> ::= v # void
1547 ::= h # unsigned char
1549 ::= t # unsigned short
1551 ::= j # unsigned int
1553 ::= m # unsigned long
1554 ::= x # long long, __int64
1555 ::= y # unsigned long long, __int64
1557 ::= o # unsigned __int128
1560 ::= e # long double, __float80
1561 ::= g # __float128 [not supported]
1562 ::= u <source-name> # vendor extended type */
1565 write_builtin_type (type)
1568 switch (TREE_CODE (type))
1579 /* If this is size_t, get the underlying int type. */
1580 if (TYPE_IS_SIZETYPE (type))
1581 type = TYPE_DOMAIN (type);
1583 /* TYPE may still be wchar_t, since that isn't in
1584 integer_type_nodes. */
1585 if (type == wchar_type_node)
1587 else if (TYPE_FOR_JAVA (type))
1588 write_java_integer_type_codes (type);
1592 /* Assume TYPE is one of the shared integer type nodes. Find
1593 it in the array of these nodes. */
1595 for (itk = 0; itk < itk_none; ++itk)
1596 if (type == integer_types[itk])
1598 /* Print the corresponding single-letter code. */
1599 write_char (integer_type_codes[itk]);
1603 if (itk == itk_none)
1605 tree t = c_common_type_for_mode (TYPE_MODE (type),
1606 TREE_UNSIGNED (type));
1609 if (TYPE_PRECISION (type) == 128)
1610 write_char (TREE_UNSIGNED (type) ? 'o' : 'n');
1612 /* Couldn't find this type. */
1625 if (type == float_type_node
1626 || type == java_float_type_node)
1628 else if (type == double_type_node
1629 || type == java_double_type_node)
1631 else if (type == long_double_type_node)
1642 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1643 METHOD_TYPE. The return type is mangled before the parameter
1646 <function-type> ::= F [Y] <bare-function-type> E */
1649 write_function_type (type)
1652 MANGLE_TRACE_TREE ("function-type", type);
1654 /* For a pointer to member function, the function type may have
1655 cv-qualifiers, indicating the quals for the artificial 'this'
1657 if (TREE_CODE (type) == METHOD_TYPE)
1659 /* The first parameter must be a POINTER_TYPE pointing to the
1660 `this' parameter. */
1661 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1662 write_CV_qualifiers_for_type (this_type);
1666 /* We don't track whether or not a type is `extern "C"'. Note that
1667 you can have an `extern "C"' function that does not have
1668 `extern "C"' type, and vice versa:
1670 extern "C" typedef void function_t();
1671 function_t f; // f has C++ linkage, but its type is
1674 typedef void function_t();
1675 extern "C" function_t f; // Vice versa.
1678 write_bare_function_type (type, /*include_return_type_p=*/1,
1683 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1684 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1685 is mangled before the parameter types. If non-NULL, DECL is
1686 FUNCTION_DECL for the function whose type is being emitted.
1688 <bare-function-type> ::= </signature/ type>+ */
1691 write_bare_function_type (type, include_return_type_p, decl)
1693 int include_return_type_p;
1696 MANGLE_TRACE_TREE ("bare-function-type", type);
1698 /* Mangle the return type, if requested. */
1699 if (include_return_type_p)
1700 write_type (TREE_TYPE (type));
1702 /* Now mangle the types of the arguments. */
1703 write_method_parms (TYPE_ARG_TYPES (type),
1704 TREE_CODE (type) == METHOD_TYPE,
1708 /* Write the mangled representation of a method parameter list of
1709 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1710 considered a non-static method, and the this parameter is omitted.
1711 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1712 parameters are being emitted. */
1715 write_method_parms (parm_types, method_p, decl)
1720 tree first_parm_type;
1721 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1723 /* Assume this parameter type list is variable-length. If it ends
1724 with a void type, then it's not. */
1727 /* If this is a member function, skip the first arg, which is the
1729 "Member functions do not encode the type of their implicit this
1732 Similarly, there's no need to mangle artificial parameters, like
1733 the VTT parameters for constructors and destructors. */
1736 parm_types = TREE_CHAIN (parm_types);
1737 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1739 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1741 parm_types = TREE_CHAIN (parm_types);
1742 parm_decl = TREE_CHAIN (parm_decl);
1746 for (first_parm_type = parm_types;
1748 parm_types = TREE_CHAIN (parm_types))
1750 tree parm = TREE_VALUE (parm_types);
1751 if (parm == void_type_node)
1753 /* "Empty parameter lists, whether declared as () or
1754 conventionally as (void), are encoded with a void parameter
1756 if (parm_types == first_parm_type)
1758 /* If the parm list is terminated with a void type, it's
1761 /* A void type better be the last one. */
1762 my_friendly_assert (TREE_CHAIN (parm_types) == NULL, 20000523);
1769 /* <builtin-type> ::= z # ellipsis */
1773 /* <class-enum-type> ::= <name> */
1776 write_class_enum_type (type)
1779 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1782 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1785 <template-args> ::= I <template-arg>+ E */
1788 write_template_args (args)
1791 MANGLE_TRACE_TREE ("template-args", args);
1795 if (TREE_CODE (args) == TREE_VEC)
1798 int length = TREE_VEC_LENGTH (args);
1799 my_friendly_assert (length > 0, 20000422);
1801 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1803 /* We have nested template args. We want the innermost template
1805 args = TREE_VEC_ELT (args, length - 1);
1806 length = TREE_VEC_LENGTH (args);
1808 for (i = 0; i < length; ++i)
1809 write_template_arg (TREE_VEC_ELT (args, i));
1813 my_friendly_assert (TREE_CODE (args) == TREE_LIST, 20021014);
1817 write_template_arg (TREE_VALUE (args));
1818 args = TREE_CHAIN (args);
1825 /* <expression> ::= <unary operator-name> <expression>
1826 ::= <binary operator-name> <expression> <expression>
1829 <expr-primary> ::= <template-param>
1830 ::= L <type> <value number> E # literal
1831 ::= L <mangled-name> E # external name
1832 ::= sr <type> <unqualified-name>
1833 ::= sr <type> <unqualified-name> <template-args> */
1836 write_expression (expr)
1839 enum tree_code code;
1841 code = TREE_CODE (expr);
1843 /* Handle pointers-to-members by making them look like expression
1845 if (code == PTRMEM_CST)
1847 expr = build_nt (ADDR_EXPR,
1848 build_nt (SCOPE_REF,
1849 PTRMEM_CST_CLASS (expr),
1850 PTRMEM_CST_MEMBER (expr)));
1851 code = TREE_CODE (expr);
1854 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1855 is converted (via qualification conversions) to another
1857 while (TREE_CODE (expr) == NOP_EXPR
1858 || TREE_CODE (expr) == NON_LVALUE_EXPR)
1860 expr = TREE_OPERAND (expr, 0);
1861 code = TREE_CODE (expr);
1864 /* Handle template parameters. */
1865 if (code == TEMPLATE_TYPE_PARM
1866 || code == TEMPLATE_TEMPLATE_PARM
1867 || code == BOUND_TEMPLATE_TEMPLATE_PARM
1868 || code == TEMPLATE_PARM_INDEX)
1869 write_template_param (expr);
1870 /* Handle literals. */
1871 else if (TREE_CODE_CLASS (code) == 'c'
1872 || (abi_version_at_least (2) && code == CONST_DECL))
1873 write_template_arg_literal (expr);
1874 else if (DECL_P (expr))
1876 /* G++ 3.2 incorrectly mangled non-type template arguments of
1877 enumeration type using their names. */
1878 if (code == CONST_DECL)
1879 G.need_abi_warning = 1;
1881 write_mangled_name (expr);
1884 else if (TREE_CODE (expr) == SIZEOF_EXPR
1885 && TYPE_P (TREE_OPERAND (expr, 0)))
1887 write_string ("st");
1888 write_type (TREE_OPERAND (expr, 0));
1890 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
1892 tree scope = TREE_OPERAND (expr, 0);
1893 tree member = TREE_OPERAND (expr, 1);
1895 /* If the MEMBER is a real declaration, then the qualifying
1896 scope was not dependent. Ideally, we would not have a
1897 SCOPE_REF in those cases, but sometimes we do. If the second
1898 argument is a DECL, then the name must not have been
1900 if (DECL_P (member))
1901 write_expression (member);
1906 write_string ("sr");
1908 /* If MEMBER is a template-id, separate the template
1909 from the arguments. */
1910 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
1912 template_args = TREE_OPERAND (member, 1);
1913 member = TREE_OPERAND (member, 0);
1914 if (TREE_CODE (member) == LOOKUP_EXPR)
1915 member = TREE_OPERAND (member, 0);
1918 template_args = NULL_TREE;
1919 /* Write out the name of the MEMBER. */
1920 if (IDENTIFIER_TYPENAME_P (member))
1921 write_conversion_operator_name (TREE_TYPE (member));
1922 else if (IDENTIFIER_OPNAME_P (member))
1925 const char *mangled_name = NULL;
1927 /* Unfortunately, there is no easy way to go from the
1928 name of the operator back to the corresponding tree
1930 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
1931 if (operator_name_info[i].identifier == member)
1933 /* The ABI says that we prefer binary operator
1934 names to unary operator names. */
1935 if (operator_name_info[i].arity == 2)
1937 mangled_name = operator_name_info[i].mangled_name;
1940 else if (!mangled_name)
1941 mangled_name = operator_name_info[i].mangled_name;
1943 else if (assignment_operator_name_info[i].identifier
1947 = assignment_operator_name_info[i].mangled_name;
1950 write_string (mangled_name);
1953 write_source_name (member);
1954 /* Write out the template arguments. */
1956 write_template_args (template_args);
1963 /* When we bind a variable or function to a non-type template
1964 argument with reference type, we create an ADDR_EXPR to show
1965 the fact that the entity's address has been taken. But, we
1966 don't actually want to output a mangling code for the `&'. */
1967 if (TREE_CODE (expr) == ADDR_EXPR
1969 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
1971 expr = TREE_OPERAND (expr, 0);
1974 write_expression (expr);
1978 code = TREE_CODE (expr);
1981 /* If it wasn't any of those, recursively expand the expression. */
1982 write_string (operator_name_info[(int) code].mangled_name);
1987 write_type (TREE_TYPE (expr));
1988 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
1991 case STATIC_CAST_EXPR:
1992 case CONST_CAST_EXPR:
1993 write_type (TREE_TYPE (expr));
1994 write_expression (TREE_OPERAND (expr, 0));
1998 /* Handle pointers-to-members specially. */
2000 write_type (TREE_OPERAND (expr, 0));
2001 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2002 write_source_name (TREE_OPERAND (expr, 1));
2005 /* G++ 3.2 incorrectly put out both the "sr" code and
2006 the nested name of the qualified name. */
2007 G.need_abi_warning = 1;
2008 write_encoding (TREE_OPERAND (expr, 1));
2013 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
2014 write_expression (TREE_OPERAND (expr, i));
2019 /* Literal subcase of non-terminal <template-arg>.
2021 "Literal arguments, e.g. "A<42L>", are encoded with their type
2022 and value. Negative integer values are preceded with "n"; for
2023 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2024 encoded as 0, true as 1. If floating-point arguments are accepted
2025 as an extension, their values should be encoded using a
2026 fixed-length lowercase hexadecimal string corresponding to the
2027 internal representation (IEEE on IA-64), high-order bytes first,
2028 without leading zeroes. For example: "Lfbff000000E" is -1.0f." */
2031 write_template_arg_literal (value)
2034 tree type = TREE_TYPE (value);
2038 if (TREE_CODE (value) == CONST_DECL)
2039 write_integer_cst (DECL_INITIAL (value));
2040 else if (TREE_CODE (value) == INTEGER_CST)
2042 if (same_type_p (type, boolean_type_node))
2044 if (value == boolean_false_node || integer_zerop (value))
2045 write_unsigned_number (0);
2046 else if (value == boolean_true_node)
2047 write_unsigned_number (1);
2052 write_integer_cst (value);
2054 else if (TREE_CODE (value) == REAL_CST)
2056 #ifdef CROSS_COMPILE
2057 static int explained;
2061 sorry ("real-valued template parameters when cross-compiling");
2066 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
2067 write_number (((unsigned char *)
2068 &TREE_REAL_CST (value))[i],
2079 /* Non-terminal <tempalate-arg>.
2081 <template-arg> ::= <type> # type
2082 ::= L <type> </value/ number> E # literal
2083 ::= LZ <name> E # external name
2084 ::= X <expression> E # expression */
2087 write_template_arg (node)
2090 enum tree_code code = TREE_CODE (node);
2092 MANGLE_TRACE_TREE ("template-arg", node);
2094 /* A template template paramter's argument list contains TREE_LIST
2095 nodes of which the value field is the the actual argument. */
2096 if (code == TREE_LIST)
2098 node = TREE_VALUE (node);
2099 /* If it's a decl, deal with its type instead. */
2102 node = TREE_TYPE (node);
2103 code = TREE_CODE (node);
2109 else if (code == TEMPLATE_DECL)
2110 /* A template appearing as a template arg is a template template arg. */
2111 write_template_template_arg (node);
2112 else if ((TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
2113 || (abi_version_at_least (2) && code == CONST_DECL))
2114 write_template_arg_literal (node);
2115 else if (DECL_P (node))
2117 /* G++ 3.2 incorrectly mangled non-type template arguments of
2118 enumeration type using their names. */
2119 if (code == CONST_DECL)
2120 G.need_abi_warning = 1;
2123 write_encoding (node);
2128 /* Template arguments may be expressions. */
2130 write_expression (node);
2135 /* <template-template-arg>
2137 ::= <substitution> */
2140 write_template_template_arg (tree decl)
2142 MANGLE_TRACE_TREE ("template-template-arg", decl);
2144 if (find_substitution (decl))
2146 write_name (decl, /*ignore_local_scope=*/0);
2147 add_substitution (decl);
2151 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2153 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2154 ::= A <expression> _ </element/ type>
2156 "Array types encode the dimension (number of elements) and the
2157 element type. For variable length arrays, the dimension (but not
2158 the '_' separator) is omitted." */
2161 write_array_type (type)
2165 if (TYPE_DOMAIN (type))
2170 index_type = TYPE_DOMAIN (type);
2171 /* The INDEX_TYPE gives the upper and lower bounds of the
2173 max = TYPE_MAX_VALUE (index_type);
2174 if (TREE_CODE (max) == INTEGER_CST)
2176 /* The ABI specifies that we should mangle the number of
2177 elements in the array, not the largest allowed index. */
2178 max = size_binop (PLUS_EXPR, max, size_one_node);
2179 write_unsigned_number (tree_low_cst (max, 1));
2182 write_expression (TREE_OPERAND (max, 0));
2185 write_type (TREE_TYPE (type));
2188 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2189 variables. TYPE is a pointer-to-member POINTER_TYPE.
2191 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2194 write_pointer_to_member_type (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 (parm)
2221 tree parm_type = NULL_TREE;
2223 MANGLE_TRACE_TREE ("template-parm", parm);
2225 switch (TREE_CODE (parm))
2227 case TEMPLATE_TYPE_PARM:
2228 case TEMPLATE_TEMPLATE_PARM:
2229 case BOUND_TEMPLATE_TEMPLATE_PARM:
2230 parm_index = TEMPLATE_TYPE_IDX (parm);
2231 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2234 case TEMPLATE_PARM_INDEX:
2235 parm_index = TEMPLATE_PARM_IDX (parm);
2236 parm_level = TEMPLATE_PARM_LEVEL (parm);
2237 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2245 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2246 earliest template param denoted by `_'. */
2248 write_unsigned_number (parm_index - 1);
2250 if (G.internal_mangling_p)
2253 write_unsigned_number (parm_level - 1);
2256 write_type (parm_type);
2261 /* <template-template-param>
2262 ::= <template-param>
2263 ::= <substitution> */
2266 write_template_template_param (parm)
2269 tree template = NULL_TREE;
2271 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2272 template template parameter. The substitution candidate here is
2273 only the template. */
2274 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2277 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2278 if (find_substitution (template))
2282 /* <template-param> encodes only the template parameter position,
2283 not its template arguments, which is fine here. */
2284 write_template_param (parm);
2286 add_substitution (template);
2289 /* Non-terminal <substitution>.
2291 <substitution> ::= S <seq-id> _
2295 write_substitution (seq_id)
2298 MANGLE_TRACE ("substitution", "");
2302 write_number (seq_id - 1, /*unsigned=*/1, 36);
2306 /* Start mangling ENTITY. */
2309 start_mangling (tree entity)
2312 G.need_abi_warning = false;
2313 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
2314 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
2317 /* Done with mangling. Return the generated mangled name. If WARN is
2318 true, and the name of G.entity will be mangled differently in a
2319 future version of the ABI, issue a warning. */
2321 static inline const char *
2322 finish_mangling (bool warn)
2324 if (warn_abi && warn && G.need_abi_warning)
2325 warning ("the mangled name of `%D' will change in a future "
2329 /* Clear all the substitutions. */
2330 G.substitutions = 0;
2332 /* Null-terminate the string. */
2335 return (const char *) obstack_base (&G.name_obstack);
2338 /* Initialize data structures for mangling. */
2343 gcc_obstack_init (&G.name_obstack);
2345 /* Cache these identifiers for quick comparison when checking for
2346 standard substitutions. */
2347 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2348 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2349 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2350 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2351 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2352 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2355 /* Generate the mangled name of DECL. */
2358 mangle_decl_string (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. */
2402 tree id = get_identifier (mangle_decl_string (decl));
2404 SET_DECL_ASSEMBLER_NAME (decl, id);
2407 /* Generate the mangled representation of TYPE. */
2410 mangle_type_string (type)
2415 start_mangling (type);
2417 result = finish_mangling (/*warn=*/false);
2419 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2423 /* Create an identifier for the mangled representation of TYPE. */
2429 return get_identifier (mangle_type_string (type));
2432 /* Create an identifier for the mangled name of a special component
2433 for belonging to TYPE. CODE is the ABI-specified code for this
2437 mangle_special_for_type (type, code)
2443 /* We don't have an actual decl here for the special component, so
2444 we can't just process the <encoded-name>. Instead, fake it. */
2445 start_mangling (type);
2447 /* Start the mangling. */
2448 write_string ("_Z");
2449 write_string (code);
2453 result = finish_mangling (/*warn=*/false);
2456 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2458 return get_identifier (result);
2461 /* Create an identifier for the mangled representation of the typeinfo
2462 structure for TYPE. */
2465 mangle_typeinfo_for_type (type)
2468 return mangle_special_for_type (type, "TI");
2471 /* Create an identifier for the mangled name of the NTBS containing
2472 the mangled name of TYPE. */
2475 mangle_typeinfo_string_for_type (type)
2478 return mangle_special_for_type (type, "TS");
2481 /* Create an identifier for the mangled name of the vtable for TYPE. */
2484 mangle_vtbl_for_type (type)
2487 return mangle_special_for_type (type, "TV");
2490 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2493 mangle_vtt_for_type (type)
2496 return mangle_special_for_type (type, "TT");
2499 /* Return an identifier for a construction vtable group. TYPE is
2500 the most derived class in the hierarchy; BINFO is the base
2501 subobject for which this construction vtable group will be used.
2503 This mangling isn't part of the ABI specification; in the ABI
2504 specification, the vtable group is dumped in the same COMDAT as the
2505 main vtable, and is referenced only from that vtable, so it doesn't
2506 need an external name. For binary formats without COMDAT sections,
2507 though, we need external names for the vtable groups.
2509 We use the production
2511 <special-name> ::= CT <type> <offset number> _ <base type> */
2514 mangle_ctor_vtbl_for_type (type, binfo)
2520 start_mangling (type);
2522 write_string ("_Z");
2523 write_string ("TC");
2525 write_integer_cst (BINFO_OFFSET (binfo));
2527 write_type (BINFO_TYPE (binfo));
2529 result = finish_mangling (/*warn=*/false);
2531 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2532 return get_identifier (result);
2535 /* Return an identifier for the mangled name of a thunk to FN_DECL.
2536 OFFSET is the initial adjustment to this used to find the vptr. If
2537 VCALL_OFFSET is non-NULL, this is a virtual thunk, and it is the
2538 vtbl offset in bytes.
2540 <special-name> ::= Th <offset number> _ <base encoding>
2541 ::= Tv <offset number> _ <vcall offset number> _
2546 mangle_thunk (fn_decl, offset, vcall_offset)
2553 start_mangling (fn_decl);
2555 write_string ("_Z");
2556 /* The <special-name> for virtual thunks is Tv, for non-virtual
2559 if (vcall_offset != 0)
2564 /* For either flavor, write the offset to this. */
2565 write_integer_cst (offset);
2568 /* For a virtual thunk, add the vcall offset. */
2571 /* Virtual thunk. Write the vcall offset and base type name. */
2572 write_integer_cst (vcall_offset);
2577 write_encoding (fn_decl);
2579 result = finish_mangling (/*warn=*/false);
2581 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2582 return get_identifier (result);
2585 /* Return an identifier for the mangled unqualified name for a
2586 conversion operator to TYPE. This mangling is not specified by the
2587 ABI spec; it is only used internally. */
2590 mangle_conv_op_name_for_type (type)
2594 const char *mangled_type;
2597 /* Build the internal mangling for TYPE. */
2598 G.internal_mangling_p = true;
2599 mangled_type = mangle_type_string (type);
2600 G.internal_mangling_p = false;
2602 /* Allocate a temporary buffer for the complete name. */
2603 op_name = concat ("operator ", mangled_type, NULL);
2604 /* Find or create an identifier. */
2605 identifier = get_identifier (op_name);
2606 /* Done with the temporary buffer. */
2609 /* It had better be a unique mangling for the type. */
2610 my_friendly_assert (!IDENTIFIER_TYPENAME_P (identifier)
2611 || same_type_p (type, TREE_TYPE (identifier)),
2614 /* Set bits on the identifier so we know later it's a conversion. */
2615 IDENTIFIER_OPNAME_P (identifier) = 1;
2616 IDENTIFIER_TYPENAME_P (identifier) = 1;
2617 /* Hang TYPE off the identifier so it can be found easily later when
2618 performing conversions. */
2619 TREE_TYPE (identifier) = type;
2624 /* Return an identifier for the name of an initialization guard
2625 variable for indicated VARIABLE. */
2628 mangle_guard_variable (variable)
2631 start_mangling (variable);
2632 write_string ("_ZGV");
2633 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2634 /* The name of a guard variable for a reference temporary should refer
2635 to the reference, not the temporary. */
2636 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2638 write_name (variable, /*ignore_local_scope=*/0);
2639 return get_identifier (finish_mangling (/*warn=*/false));
2642 /* Return an identifier for the name of a temporary variable used to
2643 initialize a static reference. This isn't part of the ABI, but we might
2644 as well call them something readable. */
2647 mangle_ref_init_variable (variable)
2650 start_mangling (variable);
2651 write_string ("_ZGR");
2652 write_name (variable, /*ignore_local_scope=*/0);
2653 return get_identifier (finish_mangling (/*warn=*/false));
2657 /* Foreign language type mangling section. */
2659 /* How to write the type codes for the integer Java type. */
2662 write_java_integer_type_codes (type)
2665 if (type == java_int_type_node)
2667 else if (type == java_short_type_node)
2669 else if (type == java_byte_type_node)
2671 else if (type == java_char_type_node)
2673 else if (type == java_long_type_node)
2675 else if (type == java_boolean_type_node)