1 /* Name mangling for the new standard C++ ABI.
2 Copyright (C) 2000 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
58 /* Debugging support. */
60 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
62 #define DEBUG_MANGLE 0
65 /* Macros for tracing the write_* functions. */
67 # define MANGLE_TRACE(FN, INPUT) \
68 fprintf (stderr, " %-24s: %-24s\n", FN, INPUT)
69 # define MANGLE_TRACE_TREE(FN, NODE) \
70 fprintf (stderr, " %-24s: %-24s (%p)\n", \
71 FN, tree_code_name[TREE_CODE (NODE)], (void *) NODE)
73 # define MANGLE_TRACE(FN, INPUT)
74 # define MANGLE_TRACE_TREE(FN, NODE)
77 /* Non-zero if NODE is a template-id. */
78 #define DECL_TEMPLATE_ID_P(NODE) \
79 (DECL_LANG_SPECIFIC (NODE) != NULL \
80 && DECL_USE_TEMPLATE (NODE) \
81 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (NODE)))
83 /* Non-zero if NODE is a class template-id. */
84 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
85 (TYPE_LANG_SPECIFIC (NODE) != NULL \
86 && CLASSTYPE_USE_TEMPLATE (NODE) \
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 /* The current innermost template args. */
98 /* An array of the current substitution candidates, in the order
100 varray_type substitutions;
103 /* Indices into subst_identifiers. These are identifiers used in
104 special substitution rules. */
112 SUBID_BASIC_IOSTREAM,
115 substitution_identifier_index_t;
117 /* For quick substitution checks, look up these common identifiers
119 static tree subst_identifiers[SUBID_MAX];
121 /* Single-letter codes for builtin integer types, defined in
122 <builtin-type>. These are indexed by integer_type_kind values. */
124 integer_type_codes[itk_none] =
127 'a', /* itk_signed_char */
128 'h', /* itk_unsigned_char */
130 't', /* itk_unsigned_short */
132 'j', /* itk_unsigned_int */
134 'm', /* itk_unsigned_long */
135 'x', /* itk_long_long */
136 'y' /* itk_unsigned_long_long */
139 /* Functions for handling substitutions. */
141 static inline tree canonicalize_for_substitution PARAMS ((tree));
142 static void add_substitution PARAMS ((tree));
143 static inline int is_std_substitution PARAMS ((tree, substitution_identifier_index_t));
144 static inline int is_std_substitution_char PARAMS ((tree, substitution_identifier_index_t));
145 static int find_substitution PARAMS ((tree));
147 /* Functions for emitting mangled representations of things. */
149 static void write_mangled_name PARAMS ((tree));
150 static void write_encoding PARAMS ((tree));
151 static void write_name PARAMS ((tree));
152 static void write_unscoped_name PARAMS ((tree));
153 static void write_unscoped_template_name PARAMS ((tree));
154 static void write_nested_name PARAMS ((tree));
155 static void write_prefix PARAMS ((tree));
156 static void write_template_prefix PARAMS ((tree));
157 static void write_component PARAMS ((tree));
158 static void write_unqualified_name PARAMS ((tree));
159 static void write_source_name PARAMS ((tree));
160 static void write_number PARAMS ((unsigned HOST_WIDE_INT, int,
162 static void write_integer_cst PARAMS ((tree));
163 static void write_identifier PARAMS ((char *));
164 static void write_special_name_constructor PARAMS ((tree));
165 static void write_special_name_destructor PARAMS ((tree));
166 static void write_type PARAMS ((tree));
167 static int write_CV_qualifiers_for_type PARAMS ((tree));
168 static void write_builtin_type PARAMS ((tree));
169 static void write_function_type PARAMS ((tree, int));
170 static void write_bare_function_type PARAMS ((tree, int));
171 static void write_method_parms PARAMS ((tree, int));
172 static void write_class_enum_type PARAMS ((tree));
173 static void write_template_args PARAMS ((tree));
174 static void write_expression PARAMS ((tree));
175 static void write_template_arg_literal PARAMS ((tree));
176 static void write_template_arg PARAMS ((tree));
177 static void write_template_template_arg PARAMS ((tree));
178 static void write_array_type PARAMS ((tree));
179 static void write_pointer_to_member_type PARAMS ((tree));
180 static void write_template_param PARAMS ((tree));
181 static void write_template_template_param PARAMS ((tree));
182 static void write_substitution PARAMS ((int));
183 static int discriminator_for_local_entity PARAMS ((tree));
184 static int discriminator_for_string_literal PARAMS ((tree, tree));
185 static void write_discriminator PARAMS ((int));
186 static void write_local_name PARAMS ((tree, tree));
187 static void dump_substitution_candidates PARAMS ((void));
188 static const char *mangle_decl_string PARAMS ((tree));
190 /* Control functions. */
192 static inline void start_mangling PARAMS ((void));
193 static inline const char *finish_mangling PARAMS ((void));
194 static tree mangle_special_for_type PARAMS ((tree, const char *));
196 /* Append a single character to the end of the mangled
198 #define write_char(CHAR) \
199 obstack_1grow (&G.name_obstack, (CHAR))
201 /* Append a NUL-terminated string to the end of the mangled
203 #define write_string(STRING) \
204 obstack_grow (&G.name_obstack, (STRING), strlen (STRING))
206 /* Return the position at which the next character will be appended to
207 the mangled representation. */
208 #define mangled_position() \
209 obstack_object_size (&G.name_obstack)
211 /* Non-zero if NODE1__ and NODE2__ are both TREE_LIST nodes and have
212 the same purpose (context, which may be a type) and value (template
213 decl). See write_template_prefix for more information on what this
215 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
216 (TREE_CODE (NODE1) == TREE_LIST \
217 && TREE_CODE (NODE2) == TREE_LIST \
218 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
219 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2)))\
220 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
221 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
223 /* Write out a signed quantity in base 10. */
224 #define write_signed_number(NUMBER) \
225 write_number (NUMBER, /*unsigned_p=*/0, 10)
227 /* Write out an unsigned quantity in base 10. */
228 #define write_unsigned_number(NUMBER) \
229 write_number (NUMBER, /*unsigned_p=*/1, 10)
231 /* Produce debugging output of current substitution candidates. */
234 dump_substitution_candidates ()
238 fprintf (stderr, " ++ substitutions ");
239 for (i = 0; i < VARRAY_ACTIVE_SIZE (G.substitutions); ++i)
241 tree el = VARRAY_TREE (G.substitutions, i);
242 const char *name = "???";
245 fprintf (stderr, " ");
247 name = IDENTIFIER_POINTER (DECL_NAME (el));
248 else if (TREE_CODE (el) == TREE_LIST)
249 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
250 else if (TYPE_NAME (el))
251 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
252 fprintf (stderr, " S%d_ = ", i - 1);
254 (CP_TYPE_RESTRICT_P (el)
255 || CP_TYPE_VOLATILE_P (el)
256 || CP_TYPE_CONST_P (el)))
257 fprintf (stderr, "CV-");
258 fprintf (stderr, "%s (%s at %p)\n",
259 name, tree_code_name[TREE_CODE (el)], (void *) el);
263 /* Both decls and types can be substitution candidates, but sometimes
264 they refer to the same thing. For instance, a TYPE_DECL and
265 RECORD_TYPE for the same class refer to the same thing, and should
266 be treated accordinginly in substitutions. This function returns a
267 canonicalized tree node representing NODE that is used when adding
268 and substitution candidates and finding matches. */
271 canonicalize_for_substitution (node)
274 /* For a TYPE_DECL, use the type instead. */
275 if (TREE_CODE (node) == TYPE_DECL)
276 node = TREE_TYPE (node);
281 /* Add NODE as a substitution candidate. NODE must not already be on
282 the list of candidates. */
285 add_substitution (node)
291 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
292 tree_code_name[TREE_CODE (node)], (void *) node);
294 /* Get the canonicalized substitution candidate for NODE. */
295 c = canonicalize_for_substitution (node);
296 if (DEBUG_MANGLE && c != node)
297 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
298 tree_code_name[TREE_CODE (node)], (void *) node);
302 /* Make sure NODE isn't already a candidate. */
305 for (i = VARRAY_ACTIVE_SIZE (G.substitutions); --i >= 0; )
307 tree candidate = VARRAY_TREE (G.substitutions, i);
309 && node == candidate)
311 && TYPE_P (candidate)
312 && same_type_p (node, candidate)))
313 my_friendly_abort (20000524);
316 #endif /* ENABLE_CHECKING */
318 /* Put the decl onto the varray of substitution candidates. */
319 VARRAY_PUSH_TREE (G.substitutions, node);
322 dump_substitution_candidates ();
325 /* Helper function for find_substitution. Returns non-zero if NODE,
326 which may be a decl or a CLASS_TYPE, is a template-id with template
327 name of substitution_index[INDEX] in the ::std namespace. */
330 is_std_substitution (node, index)
332 substitution_identifier_index_t index;
339 type = TREE_TYPE (node);
342 else if (CLASS_TYPE_P (node))
345 decl = TYPE_NAME (node);
348 /* These are not the droids you're looking for. */
352 DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
353 && TYPE_LANG_SPECIFIC (type)
354 && CLASSTYPE_USE_TEMPLATE (type)
355 && (DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
356 == subst_identifiers[index]);
359 /* Helper function for find_substitution. Returns non-zero if NODE,
360 which may be a decl or a CLASS_TYPE, is the template-id
361 ::std::identifier<char>, where identifier is
362 substitution_index[INDEX]. */
365 is_std_substitution_char (node, index)
367 substitution_identifier_index_t index;
370 /* Check NODE's name is ::std::identifier. */
371 if (!is_std_substitution (node, index))
373 /* Figure out its template args. */
375 args = DECL_TI_ARGS (node);
376 else if (CLASS_TYPE_P (node))
377 args = CLASSTYPE_TI_ARGS (node);
379 /* Oops, not a template. */
381 /* NODE's template arg list should be <char>. */
383 TREE_VEC_LENGTH (args) == 1
384 && TREE_VEC_ELT (args, 0) == char_type_node;
387 /* Check whether a substitution should be used to represent NODE in
390 First, check standard special-case substitutions.
392 <substitution> ::= St
399 # ::std::basic_string
402 # ::std::basic_string<char,
403 ::std::char_traits<char>,
404 ::std::allocator<char> >
407 # ::std::basic_istream<char, ::std::char_traits<char> >
410 # ::std::basic_ostream<char, ::std::char_traits<char> >
413 # ::std::basic_iostream<char, ::std::char_traits<char> >
415 Then examine the stack of currently available substitution
416 candidates for entities appearing earlier in the same mangling
418 If a substitution is found, write its mangled representation and
419 return non-zero. If none is found, just return zero. */
422 find_substitution (node)
426 int size = VARRAY_ACTIVE_SIZE (G.substitutions);
431 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
432 tree_code_name[TREE_CODE (node)], (void *) node);
434 /* Obtain the canonicalized substitution representation for NODE.
435 This is what we'll compare against. */
436 node = canonicalize_for_substitution (node);
438 /* Check for builtin substitutions. */
440 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
441 type = TYPE_P (node) ? node : TREE_TYPE (node);
443 /* Check for std::allocator. */
444 if (decl && is_std_substitution (decl, SUBID_ALLOCATOR))
450 /* Check for std::basic_string. */
451 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
455 /* If this is a type (i.e. a fully-qualified template-id),
457 std::basic_string <char,
458 std::char_traits<char>,
459 std::allocator<char> > . */
460 if (CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED
461 && CLASSTYPE_USE_TEMPLATE (type))
463 tree args = CLASSTYPE_TI_ARGS (type);
464 if (TREE_VEC_LENGTH (args) == 3
465 && TREE_VEC_ELT (args, 0) == char_type_node
466 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
468 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
477 /* Substitute for the template name only if this isn't a type. */
484 /* Check for basic_{i,o,io}stream. */
486 && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED
487 && CLASS_TYPE_P (type)
488 && CLASSTYPE_USE_TEMPLATE (type)
489 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
491 /* First, check for the template
492 args <char, std::char_traits<char> > . */
493 tree args = CLASSTYPE_TI_ARGS (type);
494 if (TREE_VEC_LENGTH (args) == 2
495 && TREE_VEC_ELT (args, 0) == char_type_node
496 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
499 /* Got them. Is this basic_istream? */
500 tree name = DECL_NAME (CLASSTYPE_TI_TEMPLATE (type));
501 if (name == subst_identifiers[SUBID_BASIC_ISTREAM])
506 /* Or basic_ostream? */
507 else if (name == subst_identifiers[SUBID_BASIC_OSTREAM])
512 /* Or basic_iostream? */
513 else if (name == subst_identifiers[SUBID_BASIC_IOSTREAM])
521 /* Check for namespace std. */
522 if (decl && DECL_NAMESPACE_STD_P (decl))
528 /* Now check the list of available substitutions for this mangling
530 for (i = 0; i < size; ++i)
532 tree candidate = VARRAY_TREE (G.substitutions, i);
533 /* NODE is a matched to a candidate if it's the same decl node or
534 if it's the same type. */
535 if (decl == candidate
536 || (TYPE_P (candidate) && type && TYPE_P (type)
537 && same_type_p (type, candidate))
538 || NESTED_TEMPLATE_MATCH (node, candidate))
540 write_substitution (i);
545 /* No substitution found. */
550 /* <mangled-name> ::= _Z <encoding> */
553 write_mangled_name (decl)
556 MANGLE_TRACE_TREE ("mangled-name", decl);
558 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
559 /* The standard notes:
560 "The <encoding> of an extern "C" function is treated like
561 global-scope data, i.e. as its <source-name> without a type." */
562 write_source_name (DECL_NAME (decl));
564 /* C++ name; needs to be mangled. */
567 write_encoding (decl);
571 /* <encoding> ::= <function name> <bare-function-type>
573 ::= <substitution> */
576 write_encoding (decl)
579 MANGLE_TRACE_TREE ("encoding", decl);
581 if (find_substitution (decl))
584 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
586 write_source_name (DECL_NAME (decl));
591 if (TREE_CODE (decl) == FUNCTION_DECL)
595 if (DECL_TEMPLATE_ID_P (decl))
596 fn_type = get_mostly_instantiated_function_type (decl, NULL, NULL);
598 fn_type = TREE_TYPE (decl);
600 write_bare_function_type (fn_type, DECL_TEMPLATE_ID_P (decl));
603 add_substitution (decl);
606 /* <name> ::= <unscoped-name>
607 ::= <unscoped-template-name> <template-args>
617 context = CP_DECL_CONTEXT (decl);
619 MANGLE_TRACE_TREE ("name", decl);
621 /* Decls in :: or ::std scope are treated specially. */
622 if (context == global_namespace || DECL_NAMESPACE_STD_P (context))
624 if (decl && DECL_TEMPLATE_ID_P (decl))
626 /* Templated decls get an <unqualified-template-name>. */
627 write_unscoped_template_name (DECL_TI_TEMPLATE (decl));
628 write_template_args (DECL_TI_ARGS (decl));
630 else if (TREE_CODE (decl) == TYPE_DECL
631 && CLASSTYPE_TEMPLATE_ID_P (TREE_TYPE (decl)))
635 /* Templated decls get an <unqualified-template-name>. */
636 type = TREE_TYPE (decl);
637 write_unscoped_template_name (TYPE_TI_TEMPLATE (type));
638 write_template_args (TYPE_TI_ARGS (type));
641 /* Everything else gets an <unqualified-name>. */
642 write_unscoped_name (decl);
644 /* Handle local names. */
645 else if (TREE_CODE (context) == FUNCTION_DECL)
646 write_local_name (context, decl);
647 /* Other decls get a <nested-name> to encode their scope. */
649 write_nested_name (decl);
652 /* <unscoped-name> ::= <unqualified-name>
653 ::= St <unqualified-name> # ::std:: */
656 write_unscoped_name (decl)
659 tree context = CP_DECL_CONTEXT (decl);
661 MANGLE_TRACE_TREE ("unscoped-name", decl);
663 /* Is DECL in ::std? */
664 if (DECL_NAMESPACE_STD_P (context))
667 write_unqualified_name (decl);
669 /* If not, it should be in the global namespace. */
670 else if (context == global_namespace || context == NULL)
671 write_unqualified_name (decl);
673 my_friendly_abort (20000521);
676 /* <unscoped-template-name> ::= <unscoped-name>
677 ::= <substitution> */
680 write_unscoped_template_name (decl)
683 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
685 if (find_substitution (decl))
687 write_unscoped_name (decl);
688 add_substitution (decl);
691 /* Write the nested name, including CV-qualifiers, of DECL.
693 <nested-name> ::= N [<CV-qualifiers>] <prefix> <component> E
694 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
696 <CV-qualifiers> ::= [r] [V] [K] */
699 write_nested_name (decl)
702 MANGLE_TRACE_TREE ("nested-name", decl);
706 /* Write CV-qualifiers, if this is a member function. */
707 if (TREE_CODE (decl) == FUNCTION_DECL
708 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
710 if (DECL_VOLATILE_MEMFUNC_P (decl))
712 if (DECL_CONST_MEMFUNC_P (decl))
716 if (DECL_TEMPLATE_ID_P (decl))
718 write_template_prefix (decl);
719 write_template_args (DECL_TI_ARGS (decl));
721 else if (CLASSTYPE_TEMPLATE_ID_P (TREE_TYPE (decl)))
723 write_template_prefix (decl);
724 write_template_args (CLASSTYPE_TI_ARGS (TREE_TYPE (decl)));
728 write_prefix (DECL_CONTEXT (decl));
729 write_component (decl);
734 /* <prefix> ::= <prefix> <component>
735 ::= <template-prefix> <template-args>
737 ::= <substitution> */
748 || node == global_namespace)
751 MANGLE_TRACE_TREE ("prefix", node);
753 decl = DECL_P (node) ? node : TYPE_NAME (node);
754 type = DECL_P (node) ? TREE_TYPE (node) : node;
755 context = CP_DECL_CONTEXT (decl);
757 if (find_substitution (node))
760 /* Check if this is a template-id. For a template member, the
761 template info will be hanging off the decl. */
762 if (DECL_TEMPLATE_ID_P (decl))
764 write_template_prefix (decl);
765 write_template_args (DECL_TI_ARGS (decl));
767 /* For a template class, the template info will be hanging off the
769 else if (type && CLASSTYPE_TEMPLATE_ID_P (type))
771 write_template_prefix (type);
772 write_template_args (CLASSTYPE_TI_ARGS (type));
777 write_prefix (context);
778 write_component (decl);
781 add_substitution (node);
784 /* <template-prefix> ::= <prefix> <template component>
787 Names of templates are substitution candidates. For a nested
788 template, though, the template name for the innermost name must
789 have all the outer template levels instantiated. For instance,
792 template<typename T> struct Outer
794 template<typename U> struct Inner {};
797 The template name for `Inner' in `Outer<int>::Inner<float>' is
798 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
799 levels separately, so there's no TEMPLATE_DECL available for this
800 (there's only `Outer<T>::Inner<U>').
802 In order to get the substitutions right, we create a special
803 TREE_LIST to represent the substitution candidate for a nested
804 template. The TREE_PURPOSE is the tempate's context, fully
805 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
808 So, for the example above, `Inner' is represented as a substitution
809 candidate by a TREE_LIST whose purpose is `Outer<int>' and whose
810 value is `Outer<T>::Inner<U>'. */
813 write_template_prefix (node)
816 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
817 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
818 tree context = CP_DECL_CONTEXT (decl);
822 MANGLE_TRACE_TREE ("template-prefix", node);
824 /* Find the template decl. */
825 if (DECL_TEMPLATE_ID_P (decl))
826 template = DECL_TI_TEMPLATE (decl);
827 else if (CLASSTYPE_TEMPLATE_ID_P (type))
828 template = CLASSTYPE_TI_TEMPLATE (type);
830 /* Oops, not a template. */
831 my_friendly_abort (20000524);
833 /* Build the substitution candidate TREE_LIST. */
834 substitution = build_tree_list (context, template);
836 if (find_substitution (substitution))
839 write_prefix (context);
840 write_component (decl);
842 add_substitution (substitution);
845 /* <component> ::= <unqualified-name>
849 write_component (decl)
852 MANGLE_TRACE_TREE ("component", decl);
854 switch (TREE_CODE (decl))
862 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
863 write_local_name (CP_DECL_CONTEXT (decl), decl);
865 write_unqualified_name (decl);
869 my_friendly_abort (2000509);
873 /* We don't need to handle thunks, vtables, or VTTs here. Those are
874 mangled through special entry points.
876 <unqualified-name> ::= <operator-name>
881 write_unqualified_name (decl)
884 MANGLE_TRACE_TREE ("unqualified-name", decl);
886 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
887 write_special_name_constructor (decl);
888 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
889 write_special_name_destructor (decl);
890 else if (DECL_CONV_FN_P (decl))
892 /* Conversion operator. Handle it right here.
893 <operator> ::= cv <type> */
895 write_type (TREE_TYPE (DECL_NAME (decl)));
897 else if (DECL_OVERLOADED_OPERATOR_P (decl))
899 operator_name_info_t *oni;
900 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
901 oni = assignment_operator_name_info;
903 oni = operator_name_info;
905 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
908 write_source_name (DECL_NAME (decl));
911 /* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
913 <source-name> ::= </length/ number> <identifier> */
916 write_source_name (identifier)
919 MANGLE_TRACE_TREE ("source-name", identifier);
921 /* Never write the whole template-id name including the template
922 arguments; we only want the template name. */
923 if (IDENTIFIER_TEMPLATE (identifier))
924 identifier = IDENTIFIER_TEMPLATE (identifier);
926 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
927 write_identifier (IDENTIFIER_POINTER (identifier));
930 /* Non-terminal <number>.
932 <number> ::= [n] </decimal integer/> */
935 write_number (number, unsigned_p, base)
936 unsigned HOST_WIDE_INT number;
940 static const char digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
941 unsigned HOST_WIDE_INT n;
942 unsigned HOST_WIDE_INT m = 1;
944 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
947 number = -((HOST_WIDE_INT) number);
950 /* Figure out how many digits there are. */
958 /* Write them out. */
961 int digit = number / m;
962 write_char (digits[digit]);
967 my_friendly_assert (number == 0, 20000407);
970 /* Write out an integeral CST in decimal. */
973 write_integer_cst (cst)
976 if (tree_int_cst_sgn (cst) >= 0)
978 if (TREE_INT_CST_HIGH (cst) != 0)
979 sorry ("mangling very large integers");
980 write_unsigned_number (TREE_INT_CST_LOW (cst));
983 write_signed_number (tree_low_cst (cst, 0));
986 /* Non-terminal <identifier>.
988 <identifier> ::= </unqualified source code identifier> */
991 write_identifier (identifier)
994 MANGLE_TRACE ("identifier", identifier);
995 write_string (identifier);
998 /* Handle constructor productions of non-terminal <special-name>.
999 CTOR is a constructor FUNCTION_DECL.
1001 <special-name> ::= C1 # complete object constructor
1002 ::= C2 # base object constructor
1003 ::= C3 # complete object allocating constructor
1004 ::= C4 # base object allocating constructor
1006 Currently, allocating constructors are never used.
1008 We also need to provide unique mangled names (which should never be
1009 exported) for the constructor that takes an in-charge parameter,
1010 and for a constructor whose name is the same as its class's name.
1011 We use "C*INTERNAL*" for these. */
1014 write_special_name_constructor (ctor)
1017 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor))
1018 write_string ("C1");
1019 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1020 write_string ("C2");
1022 write_string ("C*INTERNAL*");
1025 /* Handle destructor productions of non-terminal <special-name>.
1026 DTOR is a denstructor FUNCTION_DECL.
1028 <special-name> ::= D0 # deleting (in-charge) destructor
1029 ::= D1 # complete object (in-charge) destructor
1030 ::= D2 # base object (not-in-charge) destructor
1032 We also need to provide unique mngled names for old-ABI
1033 destructors, sometimes. These should only be used internally. We
1034 use "D*INTERNAL*" for these. */
1037 write_special_name_destructor (dtor)
1040 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1041 write_string ("D0");
1042 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor))
1043 write_string ("D1");
1044 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1045 write_string ("D2");
1047 /* Old-ABI destructor. */
1048 write_string ("D*INTERNAL*");
1051 /* Return the discriminator for ENTITY appearing inside
1052 FUNCTION. The discriminator is the lexical ordinal of VAR among
1053 entities with the same name in the same FUNCTION. */
1056 discriminator_for_local_entity (entity)
1062 /* Assume this is the only local entity with this name. */
1065 /* For now, we don't discriminate amongst local variables. */
1066 if (TREE_CODE (entity) != TYPE_DECL)
1069 /* Scan the list of local classes. */
1070 entity = TREE_TYPE (entity);
1071 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1072 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1073 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1076 return discriminator;
1079 /* Return the discriminator for STRING, a string literal used inside
1080 FUNCTION. The disciminator is the lexical ordinal of STRING among
1081 string literals used in FUNCTION. */
1084 discriminator_for_string_literal (function, string)
1085 tree function ATTRIBUTE_UNUSED;
1086 tree string ATTRIBUTE_UNUSED;
1088 /* For now, we don't discriminate amongst string literals. */
1092 /* <discriminator> := _ <number>
1094 The discriminator is used only for the second and later occurrences
1095 of the same name within a single function. In this case <number> is
1096 n - 2, if this is the nth occurrence, in lexical order. */
1099 write_discriminator (discriminator)
1102 /* If discriminator is zero, don't write anything. Otherwise... */
1103 if (discriminator > 0)
1106 /* The number is omitted for discriminator == 1. Beyond 1, the
1107 numbering starts at 0. */
1108 if (discriminator > 1)
1109 write_unsigned_number (discriminator - 2);
1113 /* Mangle the name of a function-scope entity. FUNCTION is the
1114 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1117 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1118 := Z <function encoding> E s [<discriminator>] */
1121 write_local_name (function, entity)
1125 MANGLE_TRACE_TREE ("local-name", entity);
1128 write_encoding (function);
1130 if (TREE_CODE (entity) == STRING_CST)
1133 write_discriminator (discriminator_for_string_literal (function,
1138 write_unqualified_name (entity);
1139 write_discriminator (discriminator_for_local_entity (entity));
1143 /* Non-terminals <type> and <CV-qualifier>.
1145 <type> ::= <builtin-type>
1147 ::= <class-enum-type>
1149 ::= <pointer-to-member-type>
1150 ::= <template-param>
1153 ::= P <type> # pointer-to
1154 ::= R <type> # reference-to
1155 ::= C <type> # complex pair (C 2000) [not supported]
1156 ::= G <type> # imaginary (C 2000) [not supported]
1157 ::= U <source-name> <type> # vendor extended type qualifier
1160 TYPE is a type node. */
1166 /* This gets set to non-zero if TYPE turns out to be a (possibly
1167 CV-qualified) builtin type. */
1168 int is_builtin_type = 0;
1170 MANGLE_TRACE_TREE ("type", type);
1172 if (find_substitution (type))
1175 if (write_CV_qualifiers_for_type (type) > 0)
1176 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1177 mangle the unqualified type. The recursive call is needed here
1178 since both the qualified and uqualified types are substitution
1180 write_type (TYPE_MAIN_VARIANT (type));
1183 /* See through any typedefs. */
1184 type = TYPE_MAIN_VARIANT (type);
1186 switch (TREE_CODE (type))
1190 case INTEGER_TYPE: /* Includes wchar_t. */
1192 /* If this is a typedef, TYPE may not be one of
1193 the standard builtin type nodes, but an alias of one. Use
1194 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1195 write_builtin_type (TYPE_MAIN_VARIANT (type));
1201 write_type (TREE_TYPE (type));
1206 write_function_type (type, 1);
1212 /* A pointer-to-member function is represented as a special
1213 RECORD_TYPE, so check for this first. */
1214 if (TYPE_PTRMEMFUNC_P (type))
1215 write_pointer_to_member_type (type);
1217 write_class_enum_type (type);
1221 /* We handle TYPENAME_TYPEs like ordinary nested names. */
1222 write_nested_name (TYPE_STUB_DECL (type));
1226 write_array_type (type);
1230 /* A pointer-to-member variable is represented by a POINTER_TYPE
1231 to an OFFSET_TYPE, so check for this first. */
1232 if (TYPE_PTRMEM_P (type))
1233 write_pointer_to_member_type (type);
1237 write_type (TREE_TYPE (type));
1241 case REFERENCE_TYPE:
1243 write_type (TREE_TYPE (type));
1246 case TEMPLATE_TYPE_PARM:
1247 case TEMPLATE_PARM_INDEX:
1248 write_template_param (type);
1251 case TEMPLATE_TEMPLATE_PARM:
1252 write_template_template_param (type);
1253 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type))
1255 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1259 write_pointer_to_member_type (build_pointer_type (type));
1263 my_friendly_abort (20000409);
1267 /* Types other than builtin types are substitution candidates. */
1268 if (!is_builtin_type)
1269 add_substitution (type);
1272 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1273 CV-qualifiers written for TYPE.
1275 <CV-qualifiers> ::= [r] [V] [K] */
1278 write_CV_qualifiers_for_type (type)
1281 int num_qualifiers = 0;
1283 /* The order is specified by:
1285 "In cases where multiple order-insensitive qualifiers are
1286 present, they should be ordered 'K' (closest to the base type),
1287 'V', 'r', and 'U' (farthest from the base type) ..." */
1289 if (CP_TYPE_RESTRICT_P (type))
1294 if (CP_TYPE_VOLATILE_P (type))
1299 if (CP_TYPE_CONST_P (type))
1305 return num_qualifiers;
1308 /* Non-terminal <builtin-type>.
1310 <builtin-type> ::= v # void
1315 ::= h # unsigned char
1317 ::= t # unsigned short
1319 ::= j # unsigned int
1321 ::= m # unsigned long
1322 ::= x # long long, __int64
1323 ::= y # unsigned long long, __int64
1324 ::= n # __int128 [not supported]
1325 ::= o # unsigned __int128 [not supported]
1328 ::= e # long double, __float80
1329 ::= g # __float128 [not supported] */
1332 write_builtin_type (type)
1335 switch (TREE_CODE (type))
1346 /* If this is size_t, get the underlying int type. */
1347 if (TYPE_IS_SIZETYPE (type))
1348 type = TYPE_DOMAIN (type);
1350 /* TYPE may still be wchar_t, since that isn't in
1351 integer_type_nodes. */
1352 if (type == wchar_type_node)
1357 /* Assume TYPE is one of the shared integer type nodes. Find
1358 it in the array of these nodes. */
1359 for (itk = 0; itk < itk_none; ++itk)
1360 if (type == integer_types[itk])
1362 /* Print the corresponding single-letter code. */
1363 write_char (integer_type_codes[itk]);
1367 if (itk == itk_none)
1368 /* Couldn't find this type. */
1369 my_friendly_abort (20000408);
1374 if (type == float_type_node)
1376 else if (type == double_type_node)
1378 else if (type == long_double_type_node)
1381 my_friendly_abort (20000409);
1385 my_friendly_abort (20000509);
1389 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1390 METHOD_TYPE. If INCLUDE_RETURN_TYPE is non-zero, the return type
1391 is mangled before the parameter types.
1393 <function-type> ::= F [Y] <bare-function-type> E */
1396 write_function_type (type, include_return_type)
1398 int include_return_type;
1400 MANGLE_TRACE_TREE ("function-type", type);
1403 /* We don't track whether or not a type is `extern "C"'. Note that
1404 you can have an `extern "C"' function that does not have
1405 `extern "C"' type, and vice versa:
1407 extern "C" typedef void function_t();
1408 function_t f; // f has C++ linkage, but its type is
1411 typedef void function_t();
1412 extern "C" function_t f; // Vice versa.
1415 write_bare_function_type (type, include_return_type);
1419 /* Non-terminal <bare-function-type>. NODE is a FUNCTION_DECL or a
1420 METHOD_TYPE. If INCLUDE_RETURN_TYPE is non-zero, the return value
1421 is mangled before the parameter types.
1423 <bare-function-type> ::= </signature/ type>+ */
1426 write_bare_function_type (type, include_return_type_p)
1428 int include_return_type_p;
1430 MANGLE_TRACE_TREE ("bare-function-type", type);
1432 /* Mangle the return type, if requested. */
1433 if (include_return_type_p)
1434 write_type (TREE_TYPE (type));
1436 /* Now mangle the types of the arguments. */
1437 write_method_parms (TYPE_ARG_TYPES (type),
1438 TREE_CODE (type) == METHOD_TYPE);
1441 /* Write the mangled representation of a method parameter list of
1442 types given in PARM_LIST. If METHOD_P is non-zero, the function is
1443 considered a non-static method, and the this parameter is omitted.
1444 If VARARGS_P is non-zero, an additional token designating varargs
1448 write_method_parms (parm_list, method_p)
1453 /* Assume this parameter type list is variable-length. If it ends
1454 with a void type, then it's not. */
1457 /* If this is a member function, skip the first arg, which is the
1459 "Member functions do not encode the type of their implicit this
1462 parm_list = TREE_CHAIN (parm_list);
1464 for (first_parm = parm_list;
1466 parm_list = TREE_CHAIN (parm_list))
1468 tree parm = TREE_VALUE (parm_list);
1470 if (same_type_p (parm, void_type_node))
1472 /* "Empty parameter lists, whether declared as () or
1473 conventionally as (void), are encoded with a void parameter
1475 if (parm_list == first_parm)
1477 /* If the parm list is terminated with a void type, it's
1480 /* A void type better be the last one. */
1481 my_friendly_assert (TREE_CHAIN (parm_list) == NULL, 20000523);
1488 /* <builtin-type> ::= z # ellipsis */
1492 /* <class-enum-type> ::= <name> */
1495 write_class_enum_type (type)
1498 write_name (TYPE_NAME (type));
1501 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1504 <template-args> ::= I <template-arg>+ E */
1507 write_template_args (args)
1511 int length = TREE_VEC_LENGTH (args);
1513 MANGLE_TRACE_TREE ("template-args", args);
1515 my_friendly_assert (length > 0, 20000422);
1517 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1519 /* We have nested template args. We want the innermost template
1521 args = TREE_VEC_ELT (args, length - 1);
1522 length = TREE_VEC_LENGTH (args);
1526 for (i = 0; i < length; ++i)
1527 write_template_arg (TREE_VEC_ELT (args, i));
1531 /* <expression> ::= <unary operator-name> <expression>
1532 ::= <binary operator-name> <expression> <expression>
1535 <expr-primary> ::= <template-param>
1536 ::= L <type> <value number> E # literal
1537 ::= L <mangled-name> E # external name */
1540 write_expression (expr)
1543 enum tree_code code;
1545 code = TREE_CODE (expr);
1547 /* Handle pointers-to-members by making them look like expression
1549 if (code == PTRMEM_CST)
1551 expr = build_nt (ADDR_EXPR,
1552 build_nt (SCOPE_REF,
1553 PTRMEM_CST_CLASS (expr),
1554 PTRMEM_CST_MEMBER (expr)));
1555 code = TREE_CODE (expr);
1558 /* Handle template parameters. */
1559 if (code == TEMPLATE_TYPE_PARM
1560 || code == TEMPLATE_TEMPLATE_PARM
1561 || code == TEMPLATE_PARM_INDEX)
1562 write_template_param (expr);
1563 /* Handle literals. */
1564 else if (TREE_CODE_CLASS (code) == 'c')
1565 write_template_arg_literal (expr);
1566 else if (DECL_P (expr))
1569 write_mangled_name (expr);
1576 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1577 is converted (via qualification conversions) to another
1579 while (TREE_CODE (expr) == NOP_EXPR)
1581 expr = TREE_OPERAND (expr, 0);
1582 code = TREE_CODE (expr);
1585 /* When we bind a variable or function to a non-type template
1586 argument with reference type, we create an ADDR_EXPR to show
1587 the fact that the entity's address has been taken. But, we
1588 don't actually want to output a mangling code for the `&'. */
1589 if (TREE_CODE (expr) == ADDR_EXPR
1591 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
1593 expr = TREE_OPERAND (expr, 0);
1596 write_expression (expr);
1600 code = TREE_CODE (expr);
1603 /* If it wasn't any of those, recursively expand the expression. */
1604 write_string (operator_name_info[(int) code].mangled_name);
1606 /* Handle pointers-to-members specially. */
1607 if (code == SCOPE_REF)
1609 write_type (TREE_OPERAND (expr, 0));
1610 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
1611 write_source_name (TREE_OPERAND (expr, 1));
1613 write_encoding (TREE_OPERAND (expr, 1));
1616 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
1617 write_expression (TREE_OPERAND (expr, i));
1621 /* Literal subcase of non-terminal <template-arg>.
1623 "Literal arguments, e.g. "A<42L>", are encoded with their type
1624 and value. Negative integer values are preceded with "n"; for
1625 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
1626 encoded as 0, true as 1. If floating-point arguments are accepted
1627 as an extension, their values should be encoded using a
1628 fixed-length lowercase hexadecimal string corresponding to the
1629 internal representation (IEEE on IA-64), high-order bytes first,
1630 without leading zeroes. For example: "Lfbff000000E" is -1.0f." */
1633 write_template_arg_literal (value)
1636 tree type = TREE_TYPE (value);
1640 if (TREE_CODE (value) == CONST_DECL)
1641 write_integer_cst (DECL_INITIAL (value));
1642 else if (TREE_CODE (value) == INTEGER_CST)
1644 if (same_type_p (type, boolean_type_node))
1646 if (value == boolean_false_node || integer_zerop (value))
1647 write_unsigned_number (0);
1648 else if (value == boolean_true_node)
1649 write_unsigned_number (1);
1651 my_friendly_abort (20000412);
1654 write_integer_cst (value);
1656 else if (TREE_CODE (value) == REAL_CST)
1658 #ifdef CROSS_COMPILE
1659 static int explained;
1663 sorry ("real-valued template parameters when cross-compiling");
1668 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1669 write_number (((unsigned char *)
1670 &TREE_REAL_CST (value))[i],
1676 my_friendly_abort (20000412);
1681 /* Non-terminal <tempalate-arg>.
1683 <template-arg> ::= <type> # type
1684 ::= L <type> </value/ number> E # literal
1685 ::= LZ <name> E # external name
1686 ::= X <expression> E # expression */
1689 write_template_arg (node)
1692 enum tree_code code = TREE_CODE (node);
1694 MANGLE_TRACE_TREE ("template-arg", node);
1696 /* A template template paramter's argument list contains TREE_LIST
1697 nodes of which the value field is the the actual argument. */
1698 if (code == TREE_LIST)
1700 node = TREE_VALUE (node);
1701 /* If it's a decl, deal with its type instead. */
1704 node = TREE_TYPE (node);
1705 code = TREE_CODE (node);
1711 else if (code == TEMPLATE_DECL)
1712 /* A template appearing as a template arg is a template template arg. */
1713 write_template_template_arg (node);
1714 else if (DECL_P (node))
1718 write_encoding (node);
1721 else if (TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
1722 write_template_arg_literal (node);
1725 /* Template arguments may be expressions. */
1727 write_expression (node);
1732 /* <template-template-arg>
1734 ::= <substitution> */
1737 write_template_template_arg (tree decl)
1739 MANGLE_TRACE_TREE ("template-template-arg", decl);
1741 if (find_substitution (decl))
1744 add_substitution (decl);
1748 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
1750 <array-type> ::= A [</dimension/ number>] _ </element/ type>
1752 "Array types encode the dimension (number of elements) and the
1753 element type. For variable length arrays, the dimension (but not
1754 the '_' separator) is omitted." */
1757 write_array_type (type)
1761 if (TYPE_DOMAIN (type))
1766 index_type = TYPE_DOMAIN (type);
1767 /* The INDEX_TYPE gives the upper and lower bounds of the
1769 max = TYPE_MAX_VALUE (index_type);
1770 if (TREE_CODE (max) == INTEGER_CST)
1771 write_unsigned_number (tree_low_cst (max, 1));
1773 write_expression (TREE_OPERAND (max, 0));
1776 write_type (TREE_TYPE (type));
1779 /* Non-terminal <pointer-to-member-type> for pointer-to-member
1780 variables. TYPE is a pointer-to-member POINTER_TYPE.
1782 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
1785 write_pointer_to_member_type (type)
1789 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
1790 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
1793 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
1794 TEMPLATE_TEMPLATE_PARM, or a TEMPLATE_PARM_INDEX.
1796 <template-param> ::= T </parameter/ number> _ */
1799 write_template_param (parm)
1804 MANGLE_TRACE_TREE ("template-parm", parm);
1806 switch (TREE_CODE (parm))
1808 case TEMPLATE_TYPE_PARM:
1809 case TEMPLATE_TEMPLATE_PARM:
1810 parm_index = TEMPLATE_TYPE_IDX (parm);
1813 case TEMPLATE_PARM_INDEX:
1814 parm_index = TEMPLATE_PARM_IDX (parm);
1818 my_friendly_abort (20000523);
1822 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
1823 earliest template param denoted by `_'. */
1825 write_unsigned_number (parm_index - 1);
1829 /* <template-template-param>
1830 ::= <template-param>
1831 ::= <substitution> */
1834 write_template_template_param (parm)
1837 tree template = NULL_TREE;
1839 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
1840 template template parameter. The substitution candidate here is
1841 only the template. */
1842 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm))
1845 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
1846 if (find_substitution (template))
1850 /* <template-param> encodes only the template parameter position,
1851 not its template arguments, which is fine here. */
1852 write_template_param (parm);
1854 add_substitution (template);
1857 /* Non-terminal <substitution>.
1859 <substitution> ::= S <seq-id> _
1863 write_substitution (seq_id)
1866 MANGLE_TRACE ("substitution", "");
1870 write_number (seq_id - 1, /*unsigned=*/1, 36);
1874 /* Start mangling a new name or type. */
1879 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
1882 /* Done with mangling. Return the generated mangled name. */
1884 static inline const char *
1887 /* Clear all the substitutions. */
1888 VARRAY_POP_ALL (G.substitutions);
1890 /* Null-terminate the string. */
1893 return (const char *) obstack_base (&G.name_obstack);
1896 /* Initialize data structures for mangling. */
1901 gcc_obstack_init (&G.name_obstack);
1902 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
1904 /* Cache these identifiers for quick comparison when checking for
1905 standard substitutions. */
1906 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
1907 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
1908 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
1909 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
1910 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
1911 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
1914 /* Generate the mangled name of DECL. */
1917 mangle_decl_string (decl)
1924 if (TREE_CODE (decl) == TYPE_DECL)
1925 write_type (TREE_TYPE (decl));
1927 write_mangled_name (decl);
1929 result = finish_mangling ();
1931 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
1935 /* Create an identifier for the external mangled name of DECL. */
1941 return get_identifier (mangle_decl_string (decl));
1944 /* Generate the mangled representation of TYPE. */
1947 mangle_type_string (type)
1954 result = finish_mangling ();
1956 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
1960 /* Create an identifier for the mangled representation of TYPE. */
1966 return get_identifier (mangle_type_string (type));
1969 /* Create an identifier for the mangled name of a special component
1970 for belonging to TYPE. CODE is the ABI-specified code for this
1974 mangle_special_for_type (type, code)
1980 /* We don't have an actual decl here for the special component, so
1981 we can't just process the <encoded-name>. Instead, fake it. */
1984 /* Start the mangling. */
1985 write_string ("_Z");
1986 write_string (code);
1990 result = finish_mangling ();
1993 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
1995 return get_identifier (result);
1998 /* Create an identifier for the mangled representation of the typeinfo
1999 structure for TYPE. */
2002 mangle_typeinfo_for_type (type)
2005 return mangle_special_for_type (type, "TI");
2008 /* Create an identifier for the mangled name of the NTBS containing
2009 the mangled name of TYPE. */
2012 mangle_typeinfo_string_for_type (type)
2015 return mangle_special_for_type (type, "TS");
2018 /* Create an identifier for the mangled name of the vtable for TYPE. */
2021 mangle_vtbl_for_type (type)
2024 return mangle_special_for_type (type, "TV");
2027 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2030 mangle_vtt_for_type (type)
2033 return mangle_special_for_type (type, "TT");
2036 /* Return an identifier for a construction vtable group. TYPE is
2037 the most derived class in the hierarchy; BINFO is the base
2038 subobject for which this construction vtable group will be used.
2040 This mangling isn't part of the ABI specification; in the ABI
2041 specification, the vtable group is dumped in the same COMDAT as the
2042 main vtable, and is referenced only from that vtable, so it doesn't
2043 need an external name. For binary formats without COMDAT sections,
2044 though, we need external names for the vtable groups.
2046 We use the production
2048 <special-name> ::= CT <type> <offset number> _ <base type> */
2051 mangle_ctor_vtbl_for_type (type, binfo)
2059 write_string ("_Z");
2060 write_string ("TC");
2062 write_integer_cst (BINFO_OFFSET (binfo));
2064 write_type (BINFO_TYPE (binfo));
2066 result = finish_mangling ();
2068 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2069 return get_identifier (result);
2072 /* Return an identifier for the mangled name of a thunk to FN_DECL.
2073 OFFSET is the initial adjustment to this used to find the vptr. If
2074 VCALL_OFFSET is non-zero, this is a virtual thunk, and it is the
2075 vtbl offset in bytes.
2077 <special-name> ::= Th <offset number> _ <base encoding>
2078 ::= Tv <offset number> _ <vcall offset number> _
2083 mangle_thunk (fn_decl, offset, vcall_offset)
2092 write_string ("_Z");
2093 /* The <special-name> for virtual thunks is Tv, for non-virtual
2096 if (vcall_offset != 0)
2101 /* For either flavor, write the offset to this. */
2102 write_signed_number (offset);
2105 /* For a virtual thunk, add the vcall offset. */
2106 if (vcall_offset != 0)
2108 /* Virtual thunk. Write the vcall offset and base type name. */
2109 write_signed_number (vcall_offset);
2114 write_encoding (fn_decl);
2116 result = finish_mangling ();
2118 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2119 return get_identifier (result);
2122 /* Return an identifier for the mangled unqualified name for a
2123 conversion operator to TYPE. This mangling is not specified by the
2124 ABI spec; it is only used internally.
2126 For compatibility with existing conversion operator mechanisms,
2127 the mangled form is `__op<type>' where <type> is the mangled
2128 representation of TYPE.
2130 FIXME: Though identifiers with starting with __op are reserved for
2131 the implementation, it would eventually be nice to use inaccessible
2132 names for these operators. */
2135 mangle_conv_op_name_for_type (type)
2140 /* Build the mangling for TYPE. */
2141 const char *mangled_type = mangle_type_string (type);
2142 /* Allocate a temporary buffer for the complete name. */
2143 char *op_name = (char *) xmalloc (strlen (OPERATOR_TYPENAME_FORMAT)
2144 + strlen (mangled_type) + 1);
2145 /* Assemble the mangling. */
2146 strcpy (op_name, OPERATOR_TYPENAME_FORMAT);
2147 strcat (op_name, mangled_type);
2148 /* Find or create an identifier. */
2149 identifier = get_identifier (op_name);
2150 /* Done with the temporary buffer. */
2152 /* Set bits on the identifier so we know later it's a conversion. */
2153 IDENTIFIER_OPNAME_P (identifier) = 1;
2154 IDENTIFIER_TYPENAME_P (identifier) = 1;
2155 /* Hang TYPE off the identifier so it can be found easily later when
2156 performing conversions. */
2157 TREE_TYPE (identifier) = type;
2162 /* Return an identifier for the name of an initialization guard
2163 variable for indicated VARIABLE. */
2166 mangle_guard_variable (variable)
2170 write_string ("_ZGV");
2171 write_name (variable);
2172 return get_identifier (finish_mangling ());