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 /* Non-zero 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 && CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
86 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))
88 /* Things we only need one of. This module is not reentrant. */
91 /* The name in which we're building the mangled name. */
92 struct obstack name_obstack;
94 /* An array of the current substitution candidates, in the order
96 varray_type substitutions;
98 /* We are mangling an internal symbol. It is important to keep those
99 involving template parmeters distinct by distinguishing their level
100 and, for non-type parms, their type. */
101 bool internal_mangling_p;
104 /* Indices into subst_identifiers. These are identifiers used in
105 special substitution rules. */
113 SUBID_BASIC_IOSTREAM,
116 substitution_identifier_index_t;
118 /* For quick substitution checks, look up these common identifiers
120 static tree subst_identifiers[SUBID_MAX];
122 /* Single-letter codes for builtin integer types, defined in
123 <builtin-type>. These are indexed by integer_type_kind values. */
125 integer_type_codes[itk_none] =
128 'a', /* itk_signed_char */
129 'h', /* itk_unsigned_char */
131 't', /* itk_unsigned_short */
133 'j', /* itk_unsigned_int */
135 'm', /* itk_unsigned_long */
136 'x', /* itk_long_long */
137 'y' /* itk_unsigned_long_long */
140 static int decl_is_template_id PARAMS ((tree, tree*));
142 /* Functions for handling substitutions. */
144 static inline tree canonicalize_for_substitution PARAMS ((tree));
145 static void add_substitution PARAMS ((tree));
146 static inline int is_std_substitution PARAMS ((tree, substitution_identifier_index_t));
147 static inline int is_std_substitution_char PARAMS ((tree, substitution_identifier_index_t));
148 static int find_substitution PARAMS ((tree));
150 /* Functions for emitting mangled representations of things. */
152 static void write_mangled_name PARAMS ((tree));
153 static void write_encoding PARAMS ((tree));
154 static void write_name PARAMS ((tree, int));
155 static void write_unscoped_name PARAMS ((tree));
156 static void write_unscoped_template_name PARAMS ((tree));
157 static void write_nested_name PARAMS ((tree));
158 static void write_prefix PARAMS ((tree));
159 static void write_template_prefix PARAMS ((tree));
160 static void write_unqualified_name PARAMS ((tree));
161 static void write_source_name PARAMS ((tree));
162 static int hwint_to_ascii PARAMS ((unsigned HOST_WIDE_INT, unsigned int, char *, unsigned));
163 static void write_number PARAMS ((unsigned HOST_WIDE_INT, int,
165 static void write_integer_cst PARAMS ((tree));
166 static void write_identifier PARAMS ((const char *));
167 static void write_special_name_constructor PARAMS ((tree));
168 static void write_special_name_destructor PARAMS ((tree));
169 static void write_type PARAMS ((tree));
170 static int write_CV_qualifiers_for_type PARAMS ((tree));
171 static void write_builtin_type PARAMS ((tree));
172 static void write_function_type PARAMS ((tree));
173 static void write_bare_function_type PARAMS ((tree, int, tree));
174 static void write_method_parms PARAMS ((tree, int, tree));
175 static void write_class_enum_type PARAMS ((tree));
176 static void write_template_args PARAMS ((tree));
177 static void write_expression PARAMS ((tree));
178 static void write_template_arg_literal PARAMS ((tree));
179 static void write_template_arg PARAMS ((tree));
180 static void write_template_template_arg PARAMS ((tree));
181 static void write_array_type PARAMS ((tree));
182 static void write_pointer_to_member_type PARAMS ((tree));
183 static void write_template_param PARAMS ((tree));
184 static void write_template_template_param PARAMS ((tree));
185 static void write_substitution PARAMS ((int));
186 static int discriminator_for_local_entity PARAMS ((tree));
187 static int discriminator_for_string_literal PARAMS ((tree, tree));
188 static void write_discriminator PARAMS ((int));
189 static void write_local_name PARAMS ((tree, tree, tree));
190 static void dump_substitution_candidates PARAMS ((void));
191 static const char *mangle_decl_string PARAMS ((tree));
193 /* Control functions. */
195 static inline void start_mangling PARAMS ((void));
196 static inline const char *finish_mangling PARAMS ((void));
197 static tree mangle_special_for_type PARAMS ((tree, const char *));
199 /* Foreign language functions. */
201 static void write_java_integer_type_codes PARAMS ((tree));
203 /* Append a single character to the end of the mangled
205 #define write_char(CHAR) \
206 obstack_1grow (&G.name_obstack, (CHAR))
208 /* Append a sized buffer to the end of the mangled representation. */
209 #define write_chars(CHAR, LEN) \
210 obstack_grow (&G.name_obstack, (CHAR), (LEN))
212 /* Append a NUL-terminated string to the end of the mangled
214 #define write_string(STRING) \
215 obstack_grow (&G.name_obstack, (STRING), strlen (STRING))
217 /* Return the position at which the next character will be appended to
218 the mangled representation. */
219 #define mangled_position() \
220 obstack_object_size (&G.name_obstack)
222 /* Non-zero if NODE1 and NODE2 are both TREE_LIST nodes and have the
223 same purpose (context, which may be a type) and value (template
224 decl). See write_template_prefix for more information on what this
226 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
227 (TREE_CODE (NODE1) == TREE_LIST \
228 && TREE_CODE (NODE2) == TREE_LIST \
229 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
230 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2)))\
231 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
232 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
234 /* Write out a signed quantity in base 10. */
235 #define write_signed_number(NUMBER) \
236 write_number ((NUMBER), /*unsigned_p=*/0, 10)
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 non-zero 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 = CLASSTYPE_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 non-zero 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 && CLASSTYPE_TEMPLATE_INFO (type)
411 && (DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
412 == subst_identifiers[index]));
415 /* Helper function for find_substitution. Returns non-zero 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 non-zero. 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, NULL, NULL);
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 non-zero, 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>>
850 ::= <template-prefix> <template-args>
852 ::= <substitution> */
859 /* Non-NULL if NODE represents a template-id. */
860 tree template_info = NULL;
862 MANGLE_TRACE_TREE ("prefix", node);
865 || node == global_namespace)
868 if (find_substitution (node))
872 /* Node is a decl. */
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);
886 /* Node is a type. */
888 decl = TYPE_NAME (node);
889 if (CLASSTYPE_TEMPLATE_ID_P (node))
890 template_info = CLASSTYPE_TEMPLATE_INFO (node);
893 if (template_info != NULL)
896 write_template_prefix (decl);
897 write_template_args (TI_ARGS (template_info));
902 write_prefix (CP_DECL_CONTEXT (decl));
903 write_unqualified_name (decl);
906 add_substitution (node);
909 /* <template-prefix> ::= <prefix> <template component>
910 ::= <substitution> */
913 write_template_prefix (node)
916 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
917 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
918 tree context = CP_DECL_CONTEXT (decl);
923 MANGLE_TRACE_TREE ("template-prefix", node);
925 /* Find the template decl. */
926 if (decl_is_template_id (decl, &template_info))
927 template = TI_TEMPLATE (template_info);
928 else if (CLASSTYPE_TEMPLATE_ID_P (type))
929 template = CLASSTYPE_TI_TEMPLATE (type);
931 /* Oops, not a template. */
934 /* For a member template, though, the template name for the
935 innermost name must have all the outer template levels
936 instantiated. For instance, consider
938 template<typename T> struct Outer {
939 template<typename U> struct Inner {};
942 The template name for `Inner' in `Outer<int>::Inner<float>' is
943 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
944 levels separately, so there's no TEMPLATE_DECL available for this
945 (there's only `Outer<T>::Inner<U>').
947 In order to get the substitutions right, we create a special
948 TREE_LIST to represent the substitution candidate for a nested
949 template. The TREE_PURPOSE is the template's context, fully
950 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
953 So, for the example above, `Outer<int>::Inner' is represented as a
954 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
955 and whose value is `Outer<T>::Inner<U>'. */
956 if (TYPE_P (context))
957 substitution = build_tree_list (context, template);
959 substitution = template;
961 if (find_substitution (substitution))
964 write_prefix (context);
965 write_unqualified_name (decl);
967 add_substitution (substitution);
970 /* We don't need to handle thunks, vtables, or VTTs here. Those are
971 mangled through special entry points.
973 <unqualified-name> ::= <operator-name>
978 write_unqualified_name (decl)
981 MANGLE_TRACE_TREE ("unqualified-name", decl);
983 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
984 write_special_name_constructor (decl);
985 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
986 write_special_name_destructor (decl);
987 else if (DECL_CONV_FN_P (decl))
989 /* Conversion operator. Handle it right here.
990 <operator> ::= cv <type> */
992 if (decl_is_template_id (decl, NULL))
994 tree fn_type = get_mostly_instantiated_function_type (decl, NULL,
996 type = TREE_TYPE (fn_type);
999 type = TREE_TYPE (DECL_NAME (decl));
1000 write_string ("cv");
1003 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1005 operator_name_info_t *oni;
1006 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1007 oni = assignment_operator_name_info;
1009 oni = operator_name_info;
1011 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1014 write_source_name (DECL_NAME (decl));
1017 /* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1019 <source-name> ::= </length/ number> <identifier> */
1022 write_source_name (identifier)
1025 MANGLE_TRACE_TREE ("source-name", identifier);
1027 /* Never write the whole template-id name including the template
1028 arguments; we only want the template name. */
1029 if (IDENTIFIER_TEMPLATE (identifier))
1030 identifier = IDENTIFIER_TEMPLATE (identifier);
1032 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1033 write_identifier (IDENTIFIER_POINTER (identifier));
1036 /* Convert NUMBER to ascii using base BASE and generating at least
1037 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1038 into which to store the characters. Returns the number of
1039 characters generated (these will be layed out in advance of where
1043 hwint_to_ascii (number, base, buffer, min_digits)
1044 unsigned HOST_WIDE_INT number;
1047 unsigned min_digits;
1049 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1050 unsigned digits = 0;
1054 unsigned HOST_WIDE_INT d = number / base;
1056 *--buffer = base_digits[number - d * base];
1060 while (digits < min_digits)
1062 *--buffer = base_digits[0];
1068 /* Non-terminal <number>.
1070 <number> ::= [n] </decimal integer/> */
1073 write_number (number, unsigned_p, base)
1074 unsigned HOST_WIDE_INT number;
1078 char buffer[sizeof (HOST_WIDE_INT) * 8];
1081 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1084 number = -((HOST_WIDE_INT) number);
1086 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1087 write_chars (buffer + sizeof (buffer) - count, count);
1090 /* Write out an integral CST in decimal. Most numbers are small, and
1091 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1092 bigger than that, which we must deal with. */
1095 write_integer_cst (cst)
1098 int sign = tree_int_cst_sgn (cst);
1100 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1102 /* A bignum. We do this in chunks, each of which fits in a
1104 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1105 unsigned HOST_WIDE_INT chunk;
1106 unsigned chunk_digits;
1107 char *ptr = buffer + sizeof (buffer);
1112 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1117 if (sizeof (HOST_WIDE_INT) >= 8)
1119 /* It is at least 64 bits, so 10^18 is representable. */
1124 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1125 base = build_int_2 (chunk, 0);
1126 n = build_int_2 (TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1127 TREE_TYPE (n) = TREE_TYPE (base) = type;
1132 n = fold (build1 (NEGATE_EXPR, type, n));
1136 tree d = fold (build (FLOOR_DIV_EXPR, type, n, base));
1137 tree tmp = fold (build (MULT_EXPR, type, d, base));
1140 done = integer_zerop (d);
1141 tmp = fold (build (MINUS_EXPR, type, n, tmp));
1142 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1143 done ? 1 : chunk_digits);
1149 write_chars (ptr, count);
1154 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1161 write_unsigned_number (low);
1165 /* Non-terminal <identifier>.
1167 <identifier> ::= </unqualified source code identifier> */
1170 write_identifier (identifier)
1171 const char *identifier;
1173 MANGLE_TRACE ("identifier", identifier);
1174 write_string (identifier);
1177 /* Handle constructor productions of non-terminal <special-name>.
1178 CTOR is a constructor FUNCTION_DECL.
1180 <special-name> ::= C1 # complete object constructor
1181 ::= C2 # base object constructor
1182 ::= C3 # complete object allocating constructor
1184 Currently, allocating constructors are never used.
1186 We also need to provide mangled names for the maybe-in-charge
1187 constructor, so we treat it here too. mangle_decl_string will
1188 append *INTERNAL* to that, to make sure we never emit it. */
1191 write_special_name_constructor (ctor)
1194 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1195 /* Even though we don't ever emit a definition of the
1196 old-style destructor, we still have to consider entities
1197 (like static variables) nested inside it. */
1198 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
1199 write_string ("C1");
1200 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1201 write_string ("C2");
1206 /* Handle destructor productions of non-terminal <special-name>.
1207 DTOR is a destructor FUNCTION_DECL.
1209 <special-name> ::= D0 # deleting (in-charge) destructor
1210 ::= D1 # complete object (in-charge) destructor
1211 ::= D2 # base object (not-in-charge) destructor
1213 We also need to provide mangled names for the maybe-incharge
1214 destructor, 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_destructor (dtor)
1221 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1222 write_string ("D0");
1223 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1224 /* Even though we don't ever emit a definition of the
1225 old-style destructor, we still have to consider entities
1226 (like static variables) nested inside it. */
1227 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
1228 write_string ("D1");
1229 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1230 write_string ("D2");
1235 /* Return the discriminator for ENTITY appearing inside
1236 FUNCTION. The discriminator is the lexical ordinal of VAR among
1237 entities with the same name in the same FUNCTION. */
1240 discriminator_for_local_entity (entity)
1246 /* Assume this is the only local entity with this name. */
1249 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1250 discriminator = DECL_DISCRIMINATOR (entity);
1251 else if (TREE_CODE (entity) == TYPE_DECL)
1253 /* Scan the list of local classes. */
1254 entity = TREE_TYPE (entity);
1255 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1256 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1257 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1261 return discriminator;
1264 /* Return the discriminator for STRING, a string literal used inside
1265 FUNCTION. The disciminator is the lexical ordinal of STRING among
1266 string literals used in FUNCTION. */
1269 discriminator_for_string_literal (function, string)
1270 tree function ATTRIBUTE_UNUSED;
1271 tree string ATTRIBUTE_UNUSED;
1273 /* For now, we don't discriminate amongst string literals. */
1277 /* <discriminator> := _ <number>
1279 The discriminator is used only for the second and later occurrences
1280 of the same name within a single function. In this case <number> is
1281 n - 2, if this is the nth occurrence, in lexical order. */
1284 write_discriminator (discriminator)
1287 /* If discriminator is zero, don't write anything. Otherwise... */
1288 if (discriminator > 0)
1291 write_unsigned_number (discriminator - 1);
1295 /* Mangle the name of a function-scope entity. FUNCTION is the
1296 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1297 the entity itself. LOCAL_ENTITY is the entity that's directly
1298 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1301 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1302 := Z <function encoding> E s [<discriminator>] */
1305 write_local_name (function, local_entity, entity)
1310 MANGLE_TRACE_TREE ("local-name", entity);
1313 write_encoding (function);
1315 if (TREE_CODE (entity) == STRING_CST)
1318 write_discriminator (discriminator_for_string_literal (function,
1323 /* Now the <entity name>. Let write_name know its being called
1324 from <local-name>, so it doesn't try to process the enclosing
1325 function scope again. */
1326 write_name (entity, /*ignore_local_scope=*/1);
1327 write_discriminator (discriminator_for_local_entity (local_entity));
1331 /* Non-terminals <type> and <CV-qualifier>.
1333 <type> ::= <builtin-type>
1335 ::= <class-enum-type>
1337 ::= <pointer-to-member-type>
1338 ::= <template-param>
1341 ::= P <type> # pointer-to
1342 ::= R <type> # reference-to
1343 ::= C <type> # complex pair (C 2000)
1344 ::= G <type> # imaginary (C 2000) [not supported]
1345 ::= U <source-name> <type> # vendor extended type qualifier
1347 TYPE is a type node. */
1353 /* This gets set to non-zero if TYPE turns out to be a (possibly
1354 CV-qualified) builtin type. */
1355 int is_builtin_type = 0;
1357 MANGLE_TRACE_TREE ("type", type);
1359 if (type == error_mark_node)
1362 if (find_substitution (type))
1365 if (write_CV_qualifiers_for_type (type) > 0)
1366 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1367 mangle the unqualified type. The recursive call is needed here
1368 since both the qualified and uqualified types are substitution
1370 write_type (TYPE_MAIN_VARIANT (type));
1371 else if (TREE_CODE (type) == ARRAY_TYPE)
1372 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1373 so that the cv-qualification of the element type is available
1374 in write_array_type. */
1375 write_array_type (type);
1378 /* See through any typedefs. */
1379 type = TYPE_MAIN_VARIANT (type);
1381 switch (TREE_CODE (type))
1385 case INTEGER_TYPE: /* Includes wchar_t. */
1387 /* If this is a typedef, TYPE may not be one of
1388 the standard builtin type nodes, but an alias of one. Use
1389 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1390 write_builtin_type (TYPE_MAIN_VARIANT (type));
1396 write_type (TREE_TYPE (type));
1401 write_function_type (type);
1407 /* A pointer-to-member function is represented as a special
1408 RECORD_TYPE, so check for this first. */
1409 if (TYPE_PTRMEMFUNC_P (type))
1410 write_pointer_to_member_type (type);
1412 write_class_enum_type (type);
1416 case UNBOUND_CLASS_TEMPLATE:
1417 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1418 ordinary nested names. */
1419 write_nested_name (TYPE_STUB_DECL (type));
1423 /* A pointer-to-member variable is represented by a POINTER_TYPE
1424 to an OFFSET_TYPE, so check for this first. */
1425 if (TYPE_PTRMEM_P (type))
1426 write_pointer_to_member_type (type);
1430 write_type (TREE_TYPE (type));
1434 case REFERENCE_TYPE:
1436 write_type (TREE_TYPE (type));
1439 case TEMPLATE_TYPE_PARM:
1440 case TEMPLATE_PARM_INDEX:
1441 write_template_param (type);
1444 case TEMPLATE_TEMPLATE_PARM:
1445 write_template_template_param (type);
1448 case BOUND_TEMPLATE_TEMPLATE_PARM:
1449 write_template_template_param (type);
1451 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1455 write_pointer_to_member_type (build_pointer_type (type));
1459 write_string ("U8__vector");
1460 write_type (TREE_TYPE (type));
1468 /* Types other than builtin types are substitution candidates. */
1469 if (!is_builtin_type)
1470 add_substitution (type);
1473 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1474 CV-qualifiers written for TYPE.
1476 <CV-qualifiers> ::= [r] [V] [K] */
1479 write_CV_qualifiers_for_type (type)
1482 int num_qualifiers = 0;
1484 /* The order is specified by:
1486 "In cases where multiple order-insensitive qualifiers are
1487 present, they should be ordered 'K' (closest to the base type),
1488 'V', 'r', and 'U' (farthest from the base type) ..."
1490 Note that we do not use cp_type_quals below; given "const
1491 int[3]", the "const" is emitted with the "int", not with the
1494 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1499 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1504 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1510 return num_qualifiers;
1513 /* Non-terminal <builtin-type>.
1515 <builtin-type> ::= v # void
1520 ::= h # unsigned char
1522 ::= t # unsigned short
1524 ::= j # unsigned int
1526 ::= m # unsigned long
1527 ::= x # long long, __int64
1528 ::= y # unsigned long long, __int64
1530 ::= o # unsigned __int128
1533 ::= e # long double, __float80
1534 ::= g # __float128 [not supported]
1535 ::= u <source-name> # vendor extended type */
1538 write_builtin_type (type)
1541 switch (TREE_CODE (type))
1552 /* If this is size_t, get the underlying int type. */
1553 if (TYPE_IS_SIZETYPE (type))
1554 type = TYPE_DOMAIN (type);
1556 /* TYPE may still be wchar_t, since that isn't in
1557 integer_type_nodes. */
1558 if (type == wchar_type_node)
1560 else if (TYPE_FOR_JAVA (type))
1561 write_java_integer_type_codes (type);
1565 /* Assume TYPE is one of the shared integer type nodes. Find
1566 it in the array of these nodes. */
1568 for (itk = 0; itk < itk_none; ++itk)
1569 if (type == integer_types[itk])
1571 /* Print the corresponding single-letter code. */
1572 write_char (integer_type_codes[itk]);
1576 if (itk == itk_none)
1578 tree t = c_common_type_for_mode (TYPE_MODE (type),
1579 TREE_UNSIGNED (type));
1582 if (TYPE_PRECISION (type) == 128)
1583 write_char (TREE_UNSIGNED (type) ? 'o' : 'n');
1585 /* Couldn't find this type. */
1598 if (type == float_type_node
1599 || type == java_float_type_node)
1601 else if (type == double_type_node
1602 || type == java_double_type_node)
1604 else if (type == long_double_type_node)
1615 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1616 METHOD_TYPE. The return type is mangled before the parameter
1619 <function-type> ::= F [Y] <bare-function-type> E */
1622 write_function_type (type)
1625 MANGLE_TRACE_TREE ("function-type", type);
1627 /* For a pointer to member function, the function type may have
1628 cv-qualifiers, indicating the quals for the artificial 'this'
1630 if (TREE_CODE (type) == METHOD_TYPE)
1632 /* The first parameter must be a POINTER_TYPE pointing to the
1633 `this' parameter. */
1634 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1635 write_CV_qualifiers_for_type (this_type);
1639 /* We don't track whether or not a type is `extern "C"'. Note that
1640 you can have an `extern "C"' function that does not have
1641 `extern "C"' type, and vice versa:
1643 extern "C" typedef void function_t();
1644 function_t f; // f has C++ linkage, but its type is
1647 typedef void function_t();
1648 extern "C" function_t f; // Vice versa.
1651 write_bare_function_type (type, /*include_return_type_p=*/1,
1656 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1657 METHOD_TYPE. If INCLUDE_RETURN_TYPE is non-zero, the return value
1658 is mangled before the parameter types. If non-NULL, DECL is
1659 FUNCTION_DECL for the function whose type is being emitted.
1661 <bare-function-type> ::= </signature/ type>+ */
1664 write_bare_function_type (type, include_return_type_p, decl)
1666 int include_return_type_p;
1669 MANGLE_TRACE_TREE ("bare-function-type", type);
1671 /* Mangle the return type, if requested. */
1672 if (include_return_type_p)
1673 write_type (TREE_TYPE (type));
1675 /* Now mangle the types of the arguments. */
1676 write_method_parms (TYPE_ARG_TYPES (type),
1677 TREE_CODE (type) == METHOD_TYPE,
1681 /* Write the mangled representation of a method parameter list of
1682 types given in PARM_TYPES. If METHOD_P is non-zero, the function is
1683 considered a non-static method, and the this parameter is omitted.
1684 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1685 parameters are being emitted. */
1688 write_method_parms (parm_types, method_p, decl)
1693 tree first_parm_type;
1694 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1696 /* Assume this parameter type list is variable-length. If it ends
1697 with a void type, then it's not. */
1700 /* If this is a member function, skip the first arg, which is the
1702 "Member functions do not encode the type of their implicit this
1705 Similarly, there's no need to mangle artificial parameters, like
1706 the VTT parameters for constructors and destructors. */
1709 parm_types = TREE_CHAIN (parm_types);
1710 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1712 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1714 parm_types = TREE_CHAIN (parm_types);
1715 parm_decl = TREE_CHAIN (parm_decl);
1719 for (first_parm_type = parm_types;
1721 parm_types = TREE_CHAIN (parm_types))
1723 tree parm = TREE_VALUE (parm_types);
1724 if (parm == void_type_node)
1726 /* "Empty parameter lists, whether declared as () or
1727 conventionally as (void), are encoded with a void parameter
1729 if (parm_types == first_parm_type)
1731 /* If the parm list is terminated with a void type, it's
1734 /* A void type better be the last one. */
1735 my_friendly_assert (TREE_CHAIN (parm_types) == NULL, 20000523);
1742 /* <builtin-type> ::= z # ellipsis */
1746 /* <class-enum-type> ::= <name> */
1749 write_class_enum_type (type)
1752 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1755 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1758 <template-args> ::= I <template-arg>+ E */
1761 write_template_args (args)
1765 int length = TREE_VEC_LENGTH (args);
1767 MANGLE_TRACE_TREE ("template-args", args);
1769 my_friendly_assert (length > 0, 20000422);
1771 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1773 /* We have nested template args. We want the innermost template
1775 args = TREE_VEC_ELT (args, length - 1);
1776 length = TREE_VEC_LENGTH (args);
1780 for (i = 0; i < length; ++i)
1781 write_template_arg (TREE_VEC_ELT (args, i));
1785 /* <expression> ::= <unary operator-name> <expression>
1786 ::= <binary operator-name> <expression> <expression>
1789 <expr-primary> ::= <template-param>
1790 ::= L <type> <value number> E # literal
1791 ::= L <mangled-name> E # external name */
1794 write_expression (expr)
1797 enum tree_code code;
1799 code = TREE_CODE (expr);
1801 /* Handle pointers-to-members by making them look like expression
1803 if (code == PTRMEM_CST)
1805 expr = build_nt (ADDR_EXPR,
1806 build_nt (SCOPE_REF,
1807 PTRMEM_CST_CLASS (expr),
1808 PTRMEM_CST_MEMBER (expr)));
1809 code = TREE_CODE (expr);
1812 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1813 is converted (via qualification conversions) to another
1815 while (TREE_CODE (expr) == NOP_EXPR
1816 || TREE_CODE (expr) == NON_LVALUE_EXPR)
1818 expr = TREE_OPERAND (expr, 0);
1819 code = TREE_CODE (expr);
1822 /* Handle template parameters. */
1823 if (code == TEMPLATE_TYPE_PARM
1824 || code == TEMPLATE_TEMPLATE_PARM
1825 || code == BOUND_TEMPLATE_TEMPLATE_PARM
1826 || code == TEMPLATE_PARM_INDEX)
1827 write_template_param (expr);
1828 /* Handle literals. */
1829 else if (TREE_CODE_CLASS (code) == 'c')
1830 write_template_arg_literal (expr);
1831 else if (DECL_P (expr))
1834 write_mangled_name (expr);
1837 else if (TREE_CODE (expr) == SIZEOF_EXPR
1838 && TYPE_P (TREE_OPERAND (expr, 0)))
1840 write_string ("st");
1841 write_type (TREE_OPERAND (expr, 0));
1847 /* When we bind a variable or function to a non-type template
1848 argument with reference type, we create an ADDR_EXPR to show
1849 the fact that the entity's address has been taken. But, we
1850 don't actually want to output a mangling code for the `&'. */
1851 if (TREE_CODE (expr) == ADDR_EXPR
1853 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
1855 expr = TREE_OPERAND (expr, 0);
1858 write_expression (expr);
1862 code = TREE_CODE (expr);
1865 /* If it wasn't any of those, recursively expand the expression. */
1866 write_string (operator_name_info[(int) code].mangled_name);
1871 write_type (TREE_TYPE (expr));
1872 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
1875 case STATIC_CAST_EXPR:
1876 case CONST_CAST_EXPR:
1877 write_type (TREE_TYPE (expr));
1878 write_expression (TREE_OPERAND (expr, 0));
1882 /* Handle pointers-to-members specially. */
1884 write_type (TREE_OPERAND (expr, 0));
1885 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
1886 write_source_name (TREE_OPERAND (expr, 1));
1888 write_encoding (TREE_OPERAND (expr, 1));
1892 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
1893 write_expression (TREE_OPERAND (expr, i));
1898 /* Literal subcase of non-terminal <template-arg>.
1900 "Literal arguments, e.g. "A<42L>", are encoded with their type
1901 and value. Negative integer values are preceded with "n"; for
1902 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
1903 encoded as 0, true as 1. If floating-point arguments are accepted
1904 as an extension, their values should be encoded using a
1905 fixed-length lowercase hexadecimal string corresponding to the
1906 internal representation (IEEE on IA-64), high-order bytes first,
1907 without leading zeroes. For example: "Lfbff000000E" is -1.0f." */
1910 write_template_arg_literal (value)
1913 tree type = TREE_TYPE (value);
1917 if (TREE_CODE (value) == CONST_DECL)
1918 write_integer_cst (DECL_INITIAL (value));
1919 else if (TREE_CODE (value) == INTEGER_CST)
1921 if (same_type_p (type, boolean_type_node))
1923 if (value == boolean_false_node || integer_zerop (value))
1924 write_unsigned_number (0);
1925 else if (value == boolean_true_node)
1926 write_unsigned_number (1);
1931 write_integer_cst (value);
1933 else if (TREE_CODE (value) == REAL_CST)
1935 #ifdef CROSS_COMPILE
1936 static int explained;
1940 sorry ("real-valued template parameters when cross-compiling");
1945 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1946 write_number (((unsigned char *)
1947 &TREE_REAL_CST (value))[i],
1958 /* Non-terminal <tempalate-arg>.
1960 <template-arg> ::= <type> # type
1961 ::= L <type> </value/ number> E # literal
1962 ::= LZ <name> E # external name
1963 ::= X <expression> E # expression */
1966 write_template_arg (node)
1969 enum tree_code code = TREE_CODE (node);
1971 MANGLE_TRACE_TREE ("template-arg", node);
1973 /* A template template paramter's argument list contains TREE_LIST
1974 nodes of which the value field is the the actual argument. */
1975 if (code == TREE_LIST)
1977 node = TREE_VALUE (node);
1978 /* If it's a decl, deal with its type instead. */
1981 node = TREE_TYPE (node);
1982 code = TREE_CODE (node);
1988 else if (code == TEMPLATE_DECL)
1989 /* A template appearing as a template arg is a template template arg. */
1990 write_template_template_arg (node);
1991 else if (DECL_P (node))
1995 write_encoding (node);
1998 else if (TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
1999 write_template_arg_literal (node);
2002 /* Template arguments may be expressions. */
2004 write_expression (node);
2009 /* <template-template-arg>
2011 ::= <substitution> */
2014 write_template_template_arg (tree decl)
2016 MANGLE_TRACE_TREE ("template-template-arg", decl);
2018 if (find_substitution (decl))
2020 write_name (decl, /*ignore_local_scope=*/0);
2021 add_substitution (decl);
2025 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2027 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2028 ::= A <expression> _ </element/ type>
2030 "Array types encode the dimension (number of elements) and the
2031 element type. For variable length arrays, the dimension (but not
2032 the '_' separator) is omitted." */
2035 write_array_type (type)
2039 if (TYPE_DOMAIN (type))
2044 index_type = TYPE_DOMAIN (type);
2045 /* The INDEX_TYPE gives the upper and lower bounds of the
2047 max = TYPE_MAX_VALUE (index_type);
2048 if (TREE_CODE (max) == INTEGER_CST)
2050 /* The ABI specifies that we should mangle the number of
2051 elements in the array, not the largest allowed index. */
2052 max = size_binop (PLUS_EXPR, max, size_one_node);
2053 write_unsigned_number (tree_low_cst (max, 1));
2056 write_expression (TREE_OPERAND (max, 0));
2059 write_type (TREE_TYPE (type));
2062 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2063 variables. TYPE is a pointer-to-member POINTER_TYPE.
2065 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2068 write_pointer_to_member_type (type)
2072 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2073 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2076 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2077 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2078 TEMPLATE_PARM_INDEX.
2080 <template-param> ::= T </parameter/ number> _
2082 If we are internally mangling then we distinguish level and, for
2083 non-type parms, type too. The mangling appends
2085 </level/ number> _ </non-type type/ type> _
2087 This is used by mangle_conv_op_name_for_type. */
2090 write_template_param (parm)
2095 tree parm_type = NULL_TREE;
2097 MANGLE_TRACE_TREE ("template-parm", parm);
2099 switch (TREE_CODE (parm))
2101 case TEMPLATE_TYPE_PARM:
2102 case TEMPLATE_TEMPLATE_PARM:
2103 case BOUND_TEMPLATE_TEMPLATE_PARM:
2104 parm_index = TEMPLATE_TYPE_IDX (parm);
2105 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2108 case TEMPLATE_PARM_INDEX:
2109 parm_index = TEMPLATE_PARM_IDX (parm);
2110 parm_level = TEMPLATE_PARM_LEVEL (parm);
2111 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2119 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2120 earliest template param denoted by `_'. */
2122 write_unsigned_number (parm_index - 1);
2124 if (G.internal_mangling_p)
2127 write_unsigned_number (parm_level - 1);
2130 write_type (parm_type);
2135 /* <template-template-param>
2136 ::= <template-param>
2137 ::= <substitution> */
2140 write_template_template_param (parm)
2143 tree template = NULL_TREE;
2145 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2146 template template parameter. The substitution candidate here is
2147 only the template. */
2148 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2151 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2152 if (find_substitution (template))
2156 /* <template-param> encodes only the template parameter position,
2157 not its template arguments, which is fine here. */
2158 write_template_param (parm);
2160 add_substitution (template);
2163 /* Non-terminal <substitution>.
2165 <substitution> ::= S <seq-id> _
2169 write_substitution (seq_id)
2172 MANGLE_TRACE ("substitution", "");
2176 write_number (seq_id - 1, /*unsigned=*/1, 36);
2180 /* Start mangling a new name or type. */
2185 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
2186 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
2189 /* Done with mangling. Return the generated mangled name. */
2191 static inline const char *
2194 /* Clear all the substitutions. */
2195 G.substitutions = 0;
2197 /* Null-terminate the string. */
2200 return (const char *) obstack_base (&G.name_obstack);
2203 /* Initialize data structures for mangling. */
2208 gcc_obstack_init (&G.name_obstack);
2210 /* Cache these identifiers for quick comparison when checking for
2211 standard substitutions. */
2212 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2213 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2214 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2215 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2216 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2217 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2220 /* Generate the mangled name of DECL. */
2223 mangle_decl_string (decl)
2230 if (TREE_CODE (decl) == TYPE_DECL)
2231 write_type (TREE_TYPE (decl));
2232 else if (/* The names of `extern "C"' functions are not mangled. */
2233 (DECL_EXTERN_C_FUNCTION_P (decl)
2234 /* But overloaded operator names *are* mangled. */
2235 && !DECL_OVERLOADED_OPERATOR_P (decl))
2236 /* The names of global variables aren't mangled either. */
2237 || (TREE_CODE (decl) == VAR_DECL
2238 && CP_DECL_CONTEXT (decl) == global_namespace)
2239 /* And neither are `extern "C"' variables. */
2240 || (TREE_CODE (decl) == VAR_DECL
2241 && DECL_EXTERN_C_P (decl)))
2242 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
2245 write_mangled_name (decl);
2246 if (DECL_LANG_SPECIFIC (decl)
2247 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
2248 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
2249 /* We need a distinct mangled name for these entities, but
2250 we should never actually output it. So, we append some
2251 characters the assembler won't like. */
2252 write_string (" *INTERNAL* ");
2255 result = finish_mangling ();
2257 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2261 /* Create an identifier for the external mangled name of DECL. */
2267 tree id = get_identifier (mangle_decl_string (decl));
2269 SET_DECL_ASSEMBLER_NAME (decl, id);
2272 /* Generate the mangled representation of TYPE. */
2275 mangle_type_string (type)
2282 result = finish_mangling ();
2284 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2288 /* Create an identifier for the mangled representation of TYPE. */
2294 return get_identifier (mangle_type_string (type));
2297 /* Create an identifier for the mangled name of a special component
2298 for belonging to TYPE. CODE is the ABI-specified code for this
2302 mangle_special_for_type (type, code)
2308 /* We don't have an actual decl here for the special component, so
2309 we can't just process the <encoded-name>. Instead, fake it. */
2312 /* Start the mangling. */
2313 write_string ("_Z");
2314 write_string (code);
2318 result = finish_mangling ();
2321 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2323 return get_identifier (result);
2326 /* Create an identifier for the mangled representation of the typeinfo
2327 structure for TYPE. */
2330 mangle_typeinfo_for_type (type)
2333 return mangle_special_for_type (type, "TI");
2336 /* Create an identifier for the mangled name of the NTBS containing
2337 the mangled name of TYPE. */
2340 mangle_typeinfo_string_for_type (type)
2343 return mangle_special_for_type (type, "TS");
2346 /* Create an identifier for the mangled name of the vtable for TYPE. */
2349 mangle_vtbl_for_type (type)
2352 return mangle_special_for_type (type, "TV");
2355 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2358 mangle_vtt_for_type (type)
2361 return mangle_special_for_type (type, "TT");
2364 /* Return an identifier for a construction vtable group. TYPE is
2365 the most derived class in the hierarchy; BINFO is the base
2366 subobject for which this construction vtable group will be used.
2368 This mangling isn't part of the ABI specification; in the ABI
2369 specification, the vtable group is dumped in the same COMDAT as the
2370 main vtable, and is referenced only from that vtable, so it doesn't
2371 need an external name. For binary formats without COMDAT sections,
2372 though, we need external names for the vtable groups.
2374 We use the production
2376 <special-name> ::= CT <type> <offset number> _ <base type> */
2379 mangle_ctor_vtbl_for_type (type, binfo)
2387 write_string ("_Z");
2388 write_string ("TC");
2390 write_integer_cst (BINFO_OFFSET (binfo));
2392 write_type (BINFO_TYPE (binfo));
2394 result = finish_mangling ();
2396 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2397 return get_identifier (result);
2400 /* Return an identifier for the mangled name of a thunk to FN_DECL.
2401 OFFSET is the initial adjustment to this used to find the vptr. If
2402 VCALL_OFFSET is non-NULL, this is a virtual thunk, and it is the
2403 vtbl offset in bytes.
2405 <special-name> ::= Th <offset number> _ <base encoding>
2406 ::= Tv <offset number> _ <vcall offset number> _
2411 mangle_thunk (fn_decl, offset, vcall_offset)
2420 write_string ("_Z");
2421 /* The <special-name> for virtual thunks is Tv, for non-virtual
2424 if (vcall_offset != 0)
2429 /* For either flavor, write the offset to this. */
2430 write_integer_cst (offset);
2433 /* For a virtual thunk, add the vcall offset. */
2436 /* Virtual thunk. Write the vcall offset and base type name. */
2437 write_integer_cst (vcall_offset);
2442 write_encoding (fn_decl);
2444 result = finish_mangling ();
2446 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2447 return get_identifier (result);
2450 /* Return an identifier for the mangled unqualified name for a
2451 conversion operator to TYPE. This mangling is not specified by the
2452 ABI spec; it is only used internally. */
2455 mangle_conv_op_name_for_type (type)
2459 const char *mangled_type;
2462 /* Build the internal mangling for TYPE. */
2463 G.internal_mangling_p = true;
2464 mangled_type = mangle_type_string (type);
2465 G.internal_mangling_p = false;
2467 /* Allocate a temporary buffer for the complete name. */
2468 op_name = concat ("operator ", mangled_type, NULL);
2469 /* Find or create an identifier. */
2470 identifier = get_identifier (op_name);
2471 /* Done with the temporary buffer. */
2474 /* It had better be a unique mangling for the type. */
2475 my_friendly_assert (!IDENTIFIER_TYPENAME_P (identifier)
2476 || same_type_p (type, TREE_TYPE (identifier)),
2479 /* Set bits on the identifier so we know later it's a conversion. */
2480 IDENTIFIER_OPNAME_P (identifier) = 1;
2481 IDENTIFIER_TYPENAME_P (identifier) = 1;
2482 /* Hang TYPE off the identifier so it can be found easily later when
2483 performing conversions. */
2484 TREE_TYPE (identifier) = type;
2489 /* Return an identifier for the name of an initialization guard
2490 variable for indicated VARIABLE. */
2493 mangle_guard_variable (variable)
2497 write_string ("_ZGV");
2498 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2499 /* The name of a guard variable for a reference temporary should refer
2500 to the reference, not the temporary. */
2501 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2503 write_name (variable, /*ignore_local_scope=*/0);
2504 return get_identifier (finish_mangling ());
2507 /* Return an identifier for the name of a temporary variable used to
2508 initialize a static reference. This isn't part of the ABI, but we might
2509 as well call them something readable. */
2512 mangle_ref_init_variable (variable)
2516 write_string ("_ZGR");
2517 write_name (variable, /*ignore_local_scope=*/0);
2518 return get_identifier (finish_mangling ());
2522 /* Foreign language type mangling section. */
2524 /* How to write the type codes for the integer Java type. */
2527 write_java_integer_type_codes (type)
2530 if (type == java_int_type_node)
2532 else if (type == java_short_type_node)
2534 else if (type == java_byte_type_node)
2536 else if (type == java_char_type_node)
2538 else if (type == java_long_type_node)
2540 else if (type == java_boolean_type_node)