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 class template-id. We can't rely on
78 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
79 that hard to distinguish A<T> from A, where A<T> is the type as
80 instantiated outside of the template, and A is the type used
81 without parameters inside the template. The logic here is
82 historical magic that apparently produces the right result. */
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)) \
87 || (TREE_CODE (CP_DECL_CONTEXT (CLASSTYPE_TI_TEMPLATE (NODE))) \
90 /* Things we only need one of. This module is not reentrant. */
93 /* The name in which we're building the mangled name. */
94 struct obstack name_obstack;
96 /* An array of the current substitution candidates, in the order
98 varray_type substitutions;
101 /* Indices into subst_identifiers. These are identifiers used in
102 special substitution rules. */
110 SUBID_BASIC_IOSTREAM,
113 substitution_identifier_index_t;
115 /* For quick substitution checks, look up these common identifiers
117 static tree subst_identifiers[SUBID_MAX];
119 /* Single-letter codes for builtin integer types, defined in
120 <builtin-type>. These are indexed by integer_type_kind values. */
122 integer_type_codes[itk_none] =
125 'a', /* itk_signed_char */
126 'h', /* itk_unsigned_char */
128 't', /* itk_unsigned_short */
130 'j', /* itk_unsigned_int */
132 'm', /* itk_unsigned_long */
133 'x', /* itk_long_long */
134 'y' /* itk_unsigned_long_long */
137 static int decl_is_template_id PARAMS ((tree, tree*));
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));
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 the
212 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 /* If DECL is a template instance, return non-zero and, if
232 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
233 Otherwise return zero. */
236 decl_is_template_id (decl, template_info)
240 if (TREE_CODE (decl) == TYPE_DECL)
242 /* TYPE_DECLs are handled specially. Look at its type to decide
243 if this is a template instantiation. */
244 tree type = TREE_TYPE (decl);
246 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
248 if (template_info != NULL)
249 /* For a templated TYPE_DECL, the template info is hanging
251 *template_info = CLASSTYPE_TEMPLATE_INFO (type);
257 /* Check if this is a primary template. */
258 if (DECL_LANG_SPECIFIC (decl) != NULL
259 && DECL_USE_TEMPLATE (decl)
260 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
261 && TREE_CODE (decl) != TEMPLATE_DECL)
263 if (template_info != NULL)
264 /* For most templated decls, the template info is hanging
266 *template_info = DECL_TEMPLATE_INFO (decl);
271 /* It's not a template id. */
275 /* Produce debugging output of current substitution candidates. */
278 dump_substitution_candidates ()
282 fprintf (stderr, " ++ substitutions ");
283 for (i = 0; i < VARRAY_ACTIVE_SIZE (G.substitutions); ++i)
285 tree el = VARRAY_TREE (G.substitutions, i);
286 const char *name = "???";
289 fprintf (stderr, " ");
291 name = IDENTIFIER_POINTER (DECL_NAME (el));
292 else if (TREE_CODE (el) == TREE_LIST)
293 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
294 else if (TYPE_NAME (el))
295 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
296 fprintf (stderr, " S%d_ = ", i - 1);
298 (CP_TYPE_RESTRICT_P (el)
299 || CP_TYPE_VOLATILE_P (el)
300 || CP_TYPE_CONST_P (el)))
301 fprintf (stderr, "CV-");
302 fprintf (stderr, "%s (%s at %p)\n",
303 name, tree_code_name[TREE_CODE (el)], (void *) el);
307 /* Both decls and types can be substitution candidates, but sometimes
308 they refer to the same thing. For instance, a TYPE_DECL and
309 RECORD_TYPE for the same class refer to the same thing, and should
310 be treated accordinginly in substitutions. This function returns a
311 canonicalized tree node representing NODE that is used when adding
312 and substitution candidates and finding matches. */
315 canonicalize_for_substitution (node)
318 /* For a TYPE_DECL, use the type instead. */
319 if (TREE_CODE (node) == TYPE_DECL)
320 node = TREE_TYPE (node);
322 node = canonical_type_variant (node);
327 /* Add NODE as a substitution candidate. NODE must not already be on
328 the list of candidates. */
331 add_substitution (node)
337 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
338 tree_code_name[TREE_CODE (node)], (void *) node);
340 /* Get the canonicalized substitution candidate for NODE. */
341 c = canonicalize_for_substitution (node);
342 if (DEBUG_MANGLE && c != node)
343 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
344 tree_code_name[TREE_CODE (node)], (void *) node);
348 /* Make sure NODE isn't already a candidate. */
351 for (i = VARRAY_ACTIVE_SIZE (G.substitutions); --i >= 0; )
353 tree candidate = VARRAY_TREE (G.substitutions, i);
355 && node == candidate)
357 && TYPE_P (candidate)
358 && same_type_p (node, candidate)))
359 my_friendly_abort (20000524);
362 #endif /* ENABLE_CHECKING */
364 /* Put the decl onto the varray of substitution candidates. */
365 VARRAY_PUSH_TREE (G.substitutions, node);
368 dump_substitution_candidates ();
371 /* Helper function for find_substitution. Returns non-zero if NODE,
372 which may be a decl or a CLASS_TYPE, is a template-id with template
373 name of substitution_index[INDEX] in the ::std namespace. */
376 is_std_substitution (node, index)
378 substitution_identifier_index_t index;
385 type = TREE_TYPE (node);
388 else if (CLASS_TYPE_P (node))
391 decl = TYPE_NAME (node);
394 /* These are not the droids you're looking for. */
397 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
398 && TYPE_LANG_SPECIFIC (type)
399 && CLASSTYPE_TEMPLATE_INFO (type)
400 && (DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
401 == subst_identifiers[index]));
404 /* Helper function for find_substitution. Returns non-zero if NODE,
405 which may be a decl or a CLASS_TYPE, is the template-id
406 ::std::identifier<char>, where identifier is
407 substitution_index[INDEX]. */
410 is_std_substitution_char (node, index)
412 substitution_identifier_index_t index;
415 /* Check NODE's name is ::std::identifier. */
416 if (!is_std_substitution (node, index))
418 /* Figure out its template args. */
420 args = DECL_TI_ARGS (node);
421 else if (CLASS_TYPE_P (node))
422 args = CLASSTYPE_TI_ARGS (node);
424 /* Oops, not a template. */
426 /* NODE's template arg list should be <char>. */
428 TREE_VEC_LENGTH (args) == 1
429 && TREE_VEC_ELT (args, 0) == char_type_node;
432 /* Check whether a substitution should be used to represent NODE in
435 First, check standard special-case substitutions.
437 <substitution> ::= St
444 # ::std::basic_string
447 # ::std::basic_string<char,
448 ::std::char_traits<char>,
449 ::std::allocator<char> >
452 # ::std::basic_istream<char, ::std::char_traits<char> >
455 # ::std::basic_ostream<char, ::std::char_traits<char> >
458 # ::std::basic_iostream<char, ::std::char_traits<char> >
460 Then examine the stack of currently available substitution
461 candidates for entities appearing earlier in the same mangling
463 If a substitution is found, write its mangled representation and
464 return non-zero. If none is found, just return zero. */
467 find_substitution (node)
471 int size = VARRAY_ACTIVE_SIZE (G.substitutions);
476 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
477 tree_code_name[TREE_CODE (node)], (void *) node);
479 /* Obtain the canonicalized substitution representation for NODE.
480 This is what we'll compare against. */
481 node = canonicalize_for_substitution (node);
483 /* Check for builtin substitutions. */
485 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
486 type = TYPE_P (node) ? node : TREE_TYPE (node);
488 /* Check for std::allocator. */
490 && is_std_substitution (decl, SUBID_ALLOCATOR)
491 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
497 /* Check for std::basic_string. */
498 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
502 /* If this is a type (i.e. a fully-qualified template-id),
504 std::basic_string <char,
505 std::char_traits<char>,
506 std::allocator<char> > . */
507 if (CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED
508 && CLASSTYPE_USE_TEMPLATE (type))
510 tree args = CLASSTYPE_TI_ARGS (type);
511 if (TREE_VEC_LENGTH (args) == 3
512 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
513 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
515 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
524 /* Substitute for the template name only if this isn't a type. */
531 /* Check for basic_{i,o,io}stream. */
533 && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED
534 && CLASS_TYPE_P (type)
535 && CLASSTYPE_USE_TEMPLATE (type)
536 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
538 /* First, check for the template
539 args <char, std::char_traits<char> > . */
540 tree args = CLASSTYPE_TI_ARGS (type);
541 if (TREE_VEC_LENGTH (args) == 2
542 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
543 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
546 /* Got them. Is this basic_istream? */
547 tree name = DECL_NAME (CLASSTYPE_TI_TEMPLATE (type));
548 if (name == subst_identifiers[SUBID_BASIC_ISTREAM])
553 /* Or basic_ostream? */
554 else if (name == subst_identifiers[SUBID_BASIC_OSTREAM])
559 /* Or basic_iostream? */
560 else if (name == subst_identifiers[SUBID_BASIC_IOSTREAM])
568 /* Check for namespace std. */
569 if (decl && DECL_NAMESPACE_STD_P (decl))
575 /* Now check the list of available substitutions for this mangling
577 for (i = 0; i < size; ++i)
579 tree candidate = VARRAY_TREE (G.substitutions, i);
580 /* NODE is a matched to a candidate if it's the same decl node or
581 if it's the same type. */
582 if (decl == candidate
583 || (TYPE_P (candidate) && type && TYPE_P (type)
584 && same_type_p (type, candidate))
585 || NESTED_TEMPLATE_MATCH (node, candidate))
587 write_substitution (i);
592 /* No substitution found. */
597 /* <mangled-name> ::= _Z <encoding> */
600 write_mangled_name (decl)
603 MANGLE_TRACE_TREE ("mangled-name", decl);
605 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
606 /* The standard notes:
607 "The <encoding> of an extern "C" function is treated like
608 global-scope data, i.e. as its <source-name> without a type." */
609 write_source_name (DECL_NAME (decl));
611 /* C++ name; needs to be mangled. */
614 write_encoding (decl);
618 /* <encoding> ::= <function name> <bare-function-type>
622 write_encoding (decl)
625 MANGLE_TRACE_TREE ("encoding", decl);
627 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
629 write_source_name (DECL_NAME (decl));
634 if (TREE_CODE (decl) == FUNCTION_DECL)
638 if (decl_is_template_id (decl, NULL))
639 fn_type = get_mostly_instantiated_function_type (decl, NULL, NULL);
641 fn_type = TREE_TYPE (decl);
643 write_bare_function_type (fn_type,
644 (!DECL_CONSTRUCTOR_P (decl)
645 && !DECL_DESTRUCTOR_P (decl)
646 && !DECL_CONV_FN_P (decl)
647 && decl_is_template_id (decl, NULL)));
651 /* <name> ::= <unscoped-name>
652 ::= <unscoped-template-name> <template-args>
662 MANGLE_TRACE_TREE ("name", decl);
664 if (TREE_CODE (decl) == TYPE_DECL)
666 /* In case this is a typedef, fish out the corresponding
667 TYPE_DECL for the main variant. */
668 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
669 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
672 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
674 /* Decls in :: or ::std scope are treated specially. */
676 || context == global_namespace
677 || DECL_NAMESPACE_STD_P (context))
680 /* Is this a template instance? */
681 if (decl_is_template_id (decl, &template_info))
683 /* Yes: use <unscoped-template-name>. */
684 write_unscoped_template_name (TI_TEMPLATE (template_info));
685 write_template_args (TI_ARGS (template_info));
688 /* Everything else gets an <unqualified-name>. */
689 write_unscoped_name (decl);
691 /* Handle local names. */
692 else if (TREE_CODE (context) == FUNCTION_DECL)
693 write_local_name (context, decl);
694 /* Other decls get a <nested-name> to encode their scope. */
696 write_nested_name (decl);
699 /* <unscoped-name> ::= <unqualified-name>
700 ::= St <unqualified-name> # ::std:: */
703 write_unscoped_name (decl)
706 tree context = CP_DECL_CONTEXT (decl);
708 MANGLE_TRACE_TREE ("unscoped-name", decl);
710 /* Is DECL in ::std? */
711 if (DECL_NAMESPACE_STD_P (context))
714 write_unqualified_name (decl);
716 /* If not, it should be in the global namespace. */
717 else if (context == global_namespace || context == NULL)
718 write_unqualified_name (decl);
720 my_friendly_abort (20000521);
723 /* <unscoped-template-name> ::= <unscoped-name>
724 ::= <substitution> */
727 write_unscoped_template_name (decl)
730 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
732 if (find_substitution (decl))
734 write_unscoped_name (decl);
735 add_substitution (decl);
738 /* Write the nested name, including CV-qualifiers, of DECL.
740 <nested-name> ::= N [<CV-qualifiers>] <prefix> <component> E
741 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
743 <CV-qualifiers> ::= [r] [V] [K] */
746 write_nested_name (decl)
751 MANGLE_TRACE_TREE ("nested-name", decl);
755 /* Write CV-qualifiers, if this is a member function. */
756 if (TREE_CODE (decl) == FUNCTION_DECL
757 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
759 if (DECL_VOLATILE_MEMFUNC_P (decl))
761 if (DECL_CONST_MEMFUNC_P (decl))
765 /* Is this a template instance? */
766 if (decl_is_template_id (decl, &template_info))
768 /* Yes, use <template-prefix>. */
769 write_template_prefix (decl);
770 write_template_args (TI_ARGS (template_info));
774 /* No, just use <prefix> */
775 write_prefix (DECL_CONTEXT (decl));
776 write_component (decl);
781 /* <prefix> ::= <prefix> <component>
782 ::= <template-prefix> <template-args>
784 ::= <substitution> */
791 /* Non-NULL if NODE represents a template-id. */
792 tree template_info = NULL;
794 MANGLE_TRACE_TREE ("prefix", node);
797 || node == global_namespace)
800 if (find_substitution (node))
804 /* Node is a decl. */
807 decl_is_template_id (decl, &template_info);
810 /* Node is a type. */
812 decl = TYPE_NAME (node);
813 if (CLASSTYPE_TEMPLATE_ID_P (node))
814 template_info = CLASSTYPE_TEMPLATE_INFO (node);
817 if (template_info != NULL)
820 write_template_prefix (decl);
821 write_template_args (TI_ARGS (template_info));
826 write_prefix (CP_DECL_CONTEXT (decl));
827 write_component (decl);
830 add_substitution (node);
833 /* <template-prefix> ::= <prefix> <template component>
834 ::= <substitution> */
837 write_template_prefix (node)
840 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
841 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
842 tree context = CP_DECL_CONTEXT (decl);
847 MANGLE_TRACE_TREE ("template-prefix", node);
849 /* Find the template decl. */
850 if (decl_is_template_id (decl, &template_info))
851 template = TI_TEMPLATE (template_info);
852 else if (CLASSTYPE_TEMPLATE_ID_P (type))
853 template = CLASSTYPE_TI_TEMPLATE (type);
855 /* Oops, not a template. */
856 my_friendly_abort (20000524);
858 /* For a member template, though, the template name for the
859 innermost name must have all the outer template levels
860 instantiated. For instance, consider
862 template<typename T> struct Outer {
863 template<typename U> struct Inner {};
866 The template name for `Inner' in `Outer<int>::Inner<float>' is
867 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
868 levels separately, so there's no TEMPLATE_DECL available for this
869 (there's only `Outer<T>::Inner<U>').
871 In order to get the substitutions right, we create a special
872 TREE_LIST to represent the substitution candidate for a nested
873 template. The TREE_PURPOSE is the template's context, fully
874 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
877 So, for the example above, `Outer<int>::Inner' is represented as a
878 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
879 and whose value is `Outer<T>::Inner<U>'. */
880 if (TYPE_P (context))
881 substitution = build_tree_list (context, template);
883 substitution = template;
885 if (find_substitution (substitution))
888 write_prefix (context);
889 write_component (decl);
891 add_substitution (substitution);
894 /* <component> ::= <unqualified-name>
898 write_component (decl)
901 MANGLE_TRACE_TREE ("component", decl);
903 switch (TREE_CODE (decl))
911 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
912 write_local_name (CP_DECL_CONTEXT (decl), decl);
914 write_unqualified_name (decl);
918 my_friendly_abort (2000509);
922 /* We don't need to handle thunks, vtables, or VTTs here. Those are
923 mangled through special entry points.
925 <unqualified-name> ::= <operator-name>
930 write_unqualified_name (decl)
933 MANGLE_TRACE_TREE ("unqualified-name", decl);
935 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
936 write_special_name_constructor (decl);
937 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
938 write_special_name_destructor (decl);
939 else if (DECL_CONV_FN_P (decl))
941 /* Conversion operator. Handle it right here.
942 <operator> ::= cv <type> */
944 write_type (TREE_TYPE (DECL_NAME (decl)));
946 else if (DECL_OVERLOADED_OPERATOR_P (decl))
948 operator_name_info_t *oni;
949 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
950 oni = assignment_operator_name_info;
952 oni = operator_name_info;
954 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
957 write_source_name (DECL_NAME (decl));
960 /* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
962 <source-name> ::= </length/ number> <identifier> */
965 write_source_name (identifier)
968 MANGLE_TRACE_TREE ("source-name", identifier);
970 /* Never write the whole template-id name including the template
971 arguments; we only want the template name. */
972 if (IDENTIFIER_TEMPLATE (identifier))
973 identifier = IDENTIFIER_TEMPLATE (identifier);
975 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
976 write_identifier (IDENTIFIER_POINTER (identifier));
979 /* Non-terminal <number>.
981 <number> ::= [n] </decimal integer/> */
984 write_number (number, unsigned_p, base)
985 unsigned HOST_WIDE_INT number;
989 static const char digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
990 unsigned HOST_WIDE_INT n;
991 unsigned HOST_WIDE_INT m = 1;
993 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
996 number = -((HOST_WIDE_INT) number);
999 /* Figure out how many digits there are. */
1007 /* Write them out. */
1010 int digit = number / m;
1011 write_char (digits[digit]);
1012 number -= digit * m;
1016 my_friendly_assert (number == 0, 20000407);
1019 /* Write out an integeral CST in decimal. */
1022 write_integer_cst (cst)
1025 if (tree_int_cst_sgn (cst) >= 0)
1027 if (TREE_INT_CST_HIGH (cst) != 0)
1028 sorry ("mangling very large integers");
1029 write_unsigned_number (TREE_INT_CST_LOW (cst));
1032 write_signed_number (tree_low_cst (cst, 0));
1035 /* Non-terminal <identifier>.
1037 <identifier> ::= </unqualified source code identifier> */
1040 write_identifier (identifier)
1043 MANGLE_TRACE ("identifier", identifier);
1044 write_string (identifier);
1047 /* Handle constructor productions of non-terminal <special-name>.
1048 CTOR is a constructor FUNCTION_DECL.
1050 <special-name> ::= C1 # complete object constructor
1051 ::= C2 # base object constructor
1052 ::= C3 # complete object allocating constructor
1054 Currently, allocating constructors are never used.
1056 We also need to provide unique mangled names (which should never be
1057 exported) for the constructor that takes an in-charge parameter,
1058 and for a constructor whose name is the same as its class's name.
1059 We use "C*INTERNAL*" for these. */
1062 write_special_name_constructor (ctor)
1065 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor))
1066 write_string ("C1");
1067 else if (DECL_BASE_CONSTRUCTOR_P (ctor))
1068 write_string ("C2");
1070 write_string ("C*INTERNAL*");
1073 /* Handle destructor productions of non-terminal <special-name>.
1074 DTOR is a denstructor FUNCTION_DECL.
1076 <special-name> ::= D0 # deleting (in-charge) destructor
1077 ::= D1 # complete object (in-charge) destructor
1078 ::= D2 # base object (not-in-charge) destructor
1080 We also need to provide unique mngled names for old-ABI
1081 destructors, sometimes. These should only be used internally. We
1082 use "D*INTERNAL*" for these. */
1085 write_special_name_destructor (dtor)
1088 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1089 write_string ("D0");
1090 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor))
1091 write_string ("D1");
1092 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1093 write_string ("D2");
1095 /* Old-ABI destructor. */
1096 write_string ("D*INTERNAL*");
1099 /* Return the discriminator for ENTITY appearing inside
1100 FUNCTION. The discriminator is the lexical ordinal of VAR among
1101 entities with the same name in the same FUNCTION. */
1104 discriminator_for_local_entity (entity)
1110 /* Assume this is the only local entity with this name. */
1113 /* For now, we don't discriminate amongst local variables. */
1114 if (TREE_CODE (entity) != TYPE_DECL)
1117 /* Scan the list of local classes. */
1118 entity = TREE_TYPE (entity);
1119 for (type = &VARRAY_TREE (local_classes, 0); *type != entity; ++type)
1120 if (TYPE_IDENTIFIER (*type) == TYPE_IDENTIFIER (entity)
1121 && TYPE_CONTEXT (*type) == TYPE_CONTEXT (entity))
1124 return discriminator;
1127 /* Return the discriminator for STRING, a string literal used inside
1128 FUNCTION. The disciminator is the lexical ordinal of STRING among
1129 string literals used in FUNCTION. */
1132 discriminator_for_string_literal (function, string)
1133 tree function ATTRIBUTE_UNUSED;
1134 tree string ATTRIBUTE_UNUSED;
1136 /* For now, we don't discriminate amongst string literals. */
1140 /* <discriminator> := _ <number>
1142 The discriminator is used only for the second and later occurrences
1143 of the same name within a single function. In this case <number> is
1144 n - 2, if this is the nth occurrence, in lexical order. */
1147 write_discriminator (discriminator)
1150 /* If discriminator is zero, don't write anything. Otherwise... */
1151 if (discriminator > 0)
1154 /* The number is omitted for discriminator == 1. Beyond 1, the
1155 numbering starts at 0. */
1156 if (discriminator > 1)
1157 write_unsigned_number (discriminator - 2);
1161 /* Mangle the name of a function-scope entity. FUNCTION is the
1162 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1165 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1166 := Z <function encoding> E s [<discriminator>] */
1169 write_local_name (function, entity)
1173 MANGLE_TRACE_TREE ("local-name", entity);
1176 write_encoding (function);
1178 if (TREE_CODE (entity) == STRING_CST)
1181 write_discriminator (discriminator_for_string_literal (function,
1186 write_unqualified_name (entity);
1187 write_discriminator (discriminator_for_local_entity (entity));
1191 /* Non-terminals <type> and <CV-qualifier>.
1193 <type> ::= <builtin-type>
1195 ::= <class-enum-type>
1197 ::= <pointer-to-member-type>
1198 ::= <template-param>
1201 ::= P <type> # pointer-to
1202 ::= R <type> # reference-to
1203 ::= C <type> # complex pair (C 2000) [not supported]
1204 ::= G <type> # imaginary (C 2000) [not supported]
1205 ::= U <source-name> <type> # vendor extended type qualifier
1208 TYPE is a type node. */
1214 /* This gets set to non-zero if TYPE turns out to be a (possibly
1215 CV-qualified) builtin type. */
1216 int is_builtin_type = 0;
1218 MANGLE_TRACE_TREE ("type", type);
1220 if (find_substitution (type))
1223 if (write_CV_qualifiers_for_type (type) > 0)
1224 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1225 mangle the unqualified type. The recursive call is needed here
1226 since both the qualified and uqualified types are substitution
1228 write_type (TYPE_MAIN_VARIANT (type));
1231 /* See through any typedefs. */
1232 type = TYPE_MAIN_VARIANT (type);
1234 switch (TREE_CODE (type))
1238 case INTEGER_TYPE: /* Includes wchar_t. */
1240 /* If this is a typedef, TYPE may not be one of
1241 the standard builtin type nodes, but an alias of one. Use
1242 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1243 write_builtin_type (TYPE_MAIN_VARIANT (type));
1249 write_type (TREE_TYPE (type));
1254 write_function_type (type);
1260 /* A pointer-to-member function is represented as a special
1261 RECORD_TYPE, so check for this first. */
1262 if (TYPE_PTRMEMFUNC_P (type))
1263 write_pointer_to_member_type (type);
1265 write_class_enum_type (type);
1269 /* We handle TYPENAME_TYPEs like ordinary nested names. */
1270 write_nested_name (TYPE_STUB_DECL (type));
1274 write_array_type (type);
1278 /* A pointer-to-member variable is represented by a POINTER_TYPE
1279 to an OFFSET_TYPE, so check for this first. */
1280 if (TYPE_PTRMEM_P (type))
1281 write_pointer_to_member_type (type);
1285 write_type (TREE_TYPE (type));
1289 case REFERENCE_TYPE:
1291 write_type (TREE_TYPE (type));
1294 case TEMPLATE_TYPE_PARM:
1295 case TEMPLATE_PARM_INDEX:
1296 write_template_param (type);
1299 case TEMPLATE_TEMPLATE_PARM:
1300 write_template_template_param (type);
1301 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type))
1303 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1307 write_pointer_to_member_type (build_pointer_type (type));
1311 my_friendly_abort (20000409);
1315 /* Types other than builtin types are substitution candidates. */
1316 if (!is_builtin_type)
1317 add_substitution (type);
1320 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1321 CV-qualifiers written for TYPE.
1323 <CV-qualifiers> ::= [r] [V] [K] */
1326 write_CV_qualifiers_for_type (type)
1329 int num_qualifiers = 0;
1331 /* The order is specified by:
1333 "In cases where multiple order-insensitive qualifiers are
1334 present, they should be ordered 'K' (closest to the base type),
1335 'V', 'r', and 'U' (farthest from the base type) ..." */
1337 if (CP_TYPE_RESTRICT_P (type))
1342 if (CP_TYPE_VOLATILE_P (type))
1347 if (CP_TYPE_CONST_P (type))
1353 return num_qualifiers;
1356 /* Non-terminal <builtin-type>.
1358 <builtin-type> ::= v # void
1363 ::= h # unsigned char
1365 ::= t # unsigned short
1367 ::= j # unsigned int
1369 ::= m # unsigned long
1370 ::= x # long long, __int64
1371 ::= y # unsigned long long, __int64
1372 ::= n # __int128 [not supported]
1373 ::= o # unsigned __int128 [not supported]
1376 ::= e # long double, __float80
1377 ::= g # __float128 [not supported] */
1380 write_builtin_type (type)
1383 switch (TREE_CODE (type))
1394 /* If this is size_t, get the underlying int type. */
1395 if (TYPE_IS_SIZETYPE (type))
1396 type = TYPE_DOMAIN (type);
1398 /* TYPE may still be wchar_t, since that isn't in
1399 integer_type_nodes. */
1400 if (type == wchar_type_node)
1405 /* Assume TYPE is one of the shared integer type nodes. Find
1406 it in the array of these nodes. */
1407 for (itk = 0; itk < itk_none; ++itk)
1408 if (type == integer_types[itk])
1410 /* Print the corresponding single-letter code. */
1411 write_char (integer_type_codes[itk]);
1415 if (itk == itk_none)
1416 /* Couldn't find this type. */
1417 my_friendly_abort (20000408);
1422 if (type == float_type_node)
1424 else if (type == double_type_node)
1426 else if (type == long_double_type_node)
1429 my_friendly_abort (20000409);
1433 my_friendly_abort (20000509);
1437 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1438 METHOD_TYPE. The return type is mangled before the parameter
1441 <function-type> ::= F [Y] <bare-function-type> E */
1444 write_function_type (type)
1447 MANGLE_TRACE_TREE ("function-type", type);
1450 /* We don't track whether or not a type is `extern "C"'. Note that
1451 you can have an `extern "C"' function that does not have
1452 `extern "C"' type, and vice versa:
1454 extern "C" typedef void function_t();
1455 function_t f; // f has C++ linkage, but its type is
1458 typedef void function_t();
1459 extern "C" function_t f; // Vice versa.
1462 write_bare_function_type (type, /*include_return_type_p=*/1);
1466 /* Non-terminal <bare-function-type>. NODE is a FUNCTION_DECL or a
1467 METHOD_TYPE. If INCLUDE_RETURN_TYPE is non-zero, the return value
1468 is mangled before the parameter types.
1470 <bare-function-type> ::= </signature/ type>+ */
1473 write_bare_function_type (type, include_return_type_p)
1475 int include_return_type_p;
1477 MANGLE_TRACE_TREE ("bare-function-type", type);
1479 /* Mangle the return type, if requested. */
1480 if (include_return_type_p)
1481 write_type (TREE_TYPE (type));
1483 /* Now mangle the types of the arguments. */
1484 write_method_parms (TYPE_ARG_TYPES (type),
1485 TREE_CODE (type) == METHOD_TYPE);
1488 /* Write the mangled representation of a method parameter list of
1489 types given in PARM_LIST. If METHOD_P is non-zero, the function is
1490 considered a non-static method, and the this parameter is omitted. */
1493 write_method_parms (parm_list, method_p)
1498 /* Assume this parameter type list is variable-length. If it ends
1499 with a void type, then it's not. */
1502 /* If this is a member function, skip the first arg, which is the
1504 "Member functions do not encode the type of their implicit this
1507 parm_list = TREE_CHAIN (parm_list);
1509 for (first_parm = parm_list;
1511 parm_list = TREE_CHAIN (parm_list))
1513 tree parm = TREE_VALUE (parm_list);
1515 if (parm == void_type_node)
1517 /* "Empty parameter lists, whether declared as () or
1518 conventionally as (void), are encoded with a void parameter
1520 if (parm_list == first_parm)
1522 /* If the parm list is terminated with a void type, it's
1525 /* A void type better be the last one. */
1526 my_friendly_assert (TREE_CHAIN (parm_list) == NULL, 20000523);
1533 /* <builtin-type> ::= z # ellipsis */
1537 /* <class-enum-type> ::= <name> */
1540 write_class_enum_type (type)
1543 write_name (TYPE_NAME (type));
1546 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1549 <template-args> ::= I <template-arg>+ E */
1552 write_template_args (args)
1556 int length = TREE_VEC_LENGTH (args);
1558 MANGLE_TRACE_TREE ("template-args", args);
1560 my_friendly_assert (length > 0, 20000422);
1562 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
1564 /* We have nested template args. We want the innermost template
1566 args = TREE_VEC_ELT (args, length - 1);
1567 length = TREE_VEC_LENGTH (args);
1571 for (i = 0; i < length; ++i)
1572 write_template_arg (TREE_VEC_ELT (args, i));
1576 /* <expression> ::= <unary operator-name> <expression>
1577 ::= <binary operator-name> <expression> <expression>
1580 <expr-primary> ::= <template-param>
1581 ::= L <type> <value number> E # literal
1582 ::= L <mangled-name> E # external name */
1585 write_expression (expr)
1588 enum tree_code code;
1590 code = TREE_CODE (expr);
1592 /* Handle pointers-to-members by making them look like expression
1594 if (code == PTRMEM_CST)
1596 expr = build_nt (ADDR_EXPR,
1597 build_nt (SCOPE_REF,
1598 PTRMEM_CST_CLASS (expr),
1599 PTRMEM_CST_MEMBER (expr)));
1600 code = TREE_CODE (expr);
1603 /* Handle template parameters. */
1604 if (code == TEMPLATE_TYPE_PARM
1605 || code == TEMPLATE_TEMPLATE_PARM
1606 || code == TEMPLATE_PARM_INDEX)
1607 write_template_param (expr);
1608 /* Handle literals. */
1609 else if (TREE_CODE_CLASS (code) == 'c')
1610 write_template_arg_literal (expr);
1611 else if (DECL_P (expr))
1614 write_mangled_name (expr);
1621 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1622 is converted (via qualification conversions) to another
1624 while (TREE_CODE (expr) == NOP_EXPR)
1626 expr = TREE_OPERAND (expr, 0);
1627 code = TREE_CODE (expr);
1630 /* When we bind a variable or function to a non-type template
1631 argument with reference type, we create an ADDR_EXPR to show
1632 the fact that the entity's address has been taken. But, we
1633 don't actually want to output a mangling code for the `&'. */
1634 if (TREE_CODE (expr) == ADDR_EXPR
1636 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
1638 expr = TREE_OPERAND (expr, 0);
1641 write_expression (expr);
1645 code = TREE_CODE (expr);
1648 /* If it wasn't any of those, recursively expand the expression. */
1649 write_string (operator_name_info[(int) code].mangled_name);
1651 /* Handle pointers-to-members specially. */
1652 if (code == SCOPE_REF)
1654 write_type (TREE_OPERAND (expr, 0));
1655 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
1656 write_source_name (TREE_OPERAND (expr, 1));
1658 write_encoding (TREE_OPERAND (expr, 1));
1661 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
1662 write_expression (TREE_OPERAND (expr, i));
1666 /* Literal subcase of non-terminal <template-arg>.
1668 "Literal arguments, e.g. "A<42L>", are encoded with their type
1669 and value. Negative integer values are preceded with "n"; for
1670 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
1671 encoded as 0, true as 1. If floating-point arguments are accepted
1672 as an extension, their values should be encoded using a
1673 fixed-length lowercase hexadecimal string corresponding to the
1674 internal representation (IEEE on IA-64), high-order bytes first,
1675 without leading zeroes. For example: "Lfbff000000E" is -1.0f." */
1678 write_template_arg_literal (value)
1681 tree type = TREE_TYPE (value);
1685 if (TREE_CODE (value) == CONST_DECL)
1686 write_integer_cst (DECL_INITIAL (value));
1687 else if (TREE_CODE (value) == INTEGER_CST)
1689 if (same_type_p (type, boolean_type_node))
1691 if (value == boolean_false_node || integer_zerop (value))
1692 write_unsigned_number (0);
1693 else if (value == boolean_true_node)
1694 write_unsigned_number (1);
1696 my_friendly_abort (20000412);
1699 write_integer_cst (value);
1701 else if (TREE_CODE (value) == REAL_CST)
1703 #ifdef CROSS_COMPILE
1704 static int explained;
1708 sorry ("real-valued template parameters when cross-compiling");
1713 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1714 write_number (((unsigned char *)
1715 &TREE_REAL_CST (value))[i],
1721 my_friendly_abort (20000412);
1726 /* Non-terminal <tempalate-arg>.
1728 <template-arg> ::= <type> # type
1729 ::= L <type> </value/ number> E # literal
1730 ::= LZ <name> E # external name
1731 ::= X <expression> E # expression */
1734 write_template_arg (node)
1737 enum tree_code code = TREE_CODE (node);
1739 MANGLE_TRACE_TREE ("template-arg", node);
1741 /* A template template paramter's argument list contains TREE_LIST
1742 nodes of which the value field is the the actual argument. */
1743 if (code == TREE_LIST)
1745 node = TREE_VALUE (node);
1746 /* If it's a decl, deal with its type instead. */
1749 node = TREE_TYPE (node);
1750 code = TREE_CODE (node);
1756 else if (code == TEMPLATE_DECL)
1757 /* A template appearing as a template arg is a template template arg. */
1758 write_template_template_arg (node);
1759 else if (DECL_P (node))
1763 write_encoding (node);
1766 else if (TREE_CODE_CLASS (code) == 'c' && code != PTRMEM_CST)
1767 write_template_arg_literal (node);
1770 /* Template arguments may be expressions. */
1772 write_expression (node);
1777 /* <template-template-arg>
1779 ::= <substitution> */
1782 write_template_template_arg (tree decl)
1784 MANGLE_TRACE_TREE ("template-template-arg", decl);
1786 if (find_substitution (decl))
1789 add_substitution (decl);
1793 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
1795 <array-type> ::= A [</dimension/ number>] _ </element/ type>
1796 ::= A <expression> _ </element/ type>
1798 "Array types encode the dimension (number of elements) and the
1799 element type. For variable length arrays, the dimension (but not
1800 the '_' separator) is omitted." */
1803 write_array_type (type)
1807 if (TYPE_DOMAIN (type))
1812 index_type = TYPE_DOMAIN (type);
1813 /* The INDEX_TYPE gives the upper and lower bounds of the
1815 max = TYPE_MAX_VALUE (index_type);
1816 if (TREE_CODE (max) == INTEGER_CST)
1818 /* The ABI specifies that we should mangle the number of
1819 elements in the array, not the largest allowed index. */
1820 max = size_binop (PLUS_EXPR, max, size_one_node);
1821 write_unsigned_number (tree_low_cst (max, 1));
1824 write_expression (TREE_OPERAND (max, 0));
1827 write_type (TREE_TYPE (type));
1830 /* Non-terminal <pointer-to-member-type> for pointer-to-member
1831 variables. TYPE is a pointer-to-member POINTER_TYPE.
1833 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
1836 write_pointer_to_member_type (type)
1840 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
1841 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
1844 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
1845 TEMPLATE_TEMPLATE_PARM, or a TEMPLATE_PARM_INDEX.
1847 <template-param> ::= T </parameter/ number> _ */
1850 write_template_param (parm)
1855 MANGLE_TRACE_TREE ("template-parm", parm);
1857 switch (TREE_CODE (parm))
1859 case TEMPLATE_TYPE_PARM:
1860 case TEMPLATE_TEMPLATE_PARM:
1861 parm_index = TEMPLATE_TYPE_IDX (parm);
1864 case TEMPLATE_PARM_INDEX:
1865 parm_index = TEMPLATE_PARM_IDX (parm);
1869 my_friendly_abort (20000523);
1873 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
1874 earliest template param denoted by `_'. */
1876 write_unsigned_number (parm_index - 1);
1880 /* <template-template-param>
1881 ::= <template-param>
1882 ::= <substitution> */
1885 write_template_template_param (parm)
1888 tree template = NULL_TREE;
1890 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
1891 template template parameter. The substitution candidate here is
1892 only the template. */
1893 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm))
1896 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
1897 if (find_substitution (template))
1901 /* <template-param> encodes only the template parameter position,
1902 not its template arguments, which is fine here. */
1903 write_template_param (parm);
1905 add_substitution (template);
1908 /* Non-terminal <substitution>.
1910 <substitution> ::= S <seq-id> _
1914 write_substitution (seq_id)
1917 MANGLE_TRACE ("substitution", "");
1921 write_number (seq_id - 1, /*unsigned=*/1, 36);
1925 /* Start mangling a new name or type. */
1930 obstack_free (&G.name_obstack, obstack_base (&G.name_obstack));
1933 /* Done with mangling. Return the generated mangled name. */
1935 static inline const char *
1938 /* Clear all the substitutions. */
1939 VARRAY_POP_ALL (G.substitutions);
1941 /* Null-terminate the string. */
1944 return (const char *) obstack_base (&G.name_obstack);
1947 /* Initialize data structures for mangling. */
1952 gcc_obstack_init (&G.name_obstack);
1953 VARRAY_TREE_INIT (G.substitutions, 1, "mangling substitutions");
1955 /* Cache these identifiers for quick comparison when checking for
1956 standard substitutions. */
1957 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
1958 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
1959 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
1960 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
1961 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
1962 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
1965 /* Generate the mangled name of DECL. */
1968 mangle_decl_string (decl)
1975 if (TREE_CODE (decl) == TYPE_DECL)
1976 write_type (TREE_TYPE (decl));
1978 write_mangled_name (decl);
1980 result = finish_mangling ();
1982 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
1986 /* Create an identifier for the external mangled name of DECL. */
1992 return get_identifier (mangle_decl_string (decl));
1995 /* Generate the mangled representation of TYPE. */
1998 mangle_type_string (type)
2005 result = finish_mangling ();
2007 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2011 /* Create an identifier for the mangled representation of TYPE. */
2017 return get_identifier (mangle_type_string (type));
2020 /* Create an identifier for the mangled name of a special component
2021 for belonging to TYPE. CODE is the ABI-specified code for this
2025 mangle_special_for_type (type, code)
2031 /* We don't have an actual decl here for the special component, so
2032 we can't just process the <encoded-name>. Instead, fake it. */
2035 /* Start the mangling. */
2036 write_string ("_Z");
2037 write_string (code);
2041 result = finish_mangling ();
2044 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2046 return get_identifier (result);
2049 /* Create an identifier for the mangled representation of the typeinfo
2050 structure for TYPE. */
2053 mangle_typeinfo_for_type (type)
2056 return mangle_special_for_type (type, "TI");
2059 /* Create an identifier for the mangled name of the NTBS containing
2060 the mangled name of TYPE. */
2063 mangle_typeinfo_string_for_type (type)
2066 return mangle_special_for_type (type, "TS");
2069 /* Create an identifier for the mangled name of the vtable for TYPE. */
2072 mangle_vtbl_for_type (type)
2075 return mangle_special_for_type (type, "TV");
2078 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2081 mangle_vtt_for_type (type)
2084 return mangle_special_for_type (type, "TT");
2087 /* Return an identifier for a construction vtable group. TYPE is
2088 the most derived class in the hierarchy; BINFO is the base
2089 subobject for which this construction vtable group will be used.
2091 This mangling isn't part of the ABI specification; in the ABI
2092 specification, the vtable group is dumped in the same COMDAT as the
2093 main vtable, and is referenced only from that vtable, so it doesn't
2094 need an external name. For binary formats without COMDAT sections,
2095 though, we need external names for the vtable groups.
2097 We use the production
2099 <special-name> ::= CT <type> <offset number> _ <base type> */
2102 mangle_ctor_vtbl_for_type (type, binfo)
2110 write_string ("_Z");
2111 write_string ("TC");
2113 write_integer_cst (BINFO_OFFSET (binfo));
2115 write_type (BINFO_TYPE (binfo));
2117 result = finish_mangling ();
2119 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2120 return get_identifier (result);
2123 /* Return an identifier for the mangled name of a thunk to FN_DECL.
2124 OFFSET is the initial adjustment to this used to find the vptr. If
2125 VCALL_OFFSET is non-NULL, this is a virtual thunk, and it is the
2126 vtbl offset in bytes.
2128 <special-name> ::= Th <offset number> _ <base encoding>
2129 ::= Tv <offset number> _ <vcall offset number> _
2134 mangle_thunk (fn_decl, offset, vcall_offset)
2143 write_string ("_Z");
2144 /* The <special-name> for virtual thunks is Tv, for non-virtual
2147 if (vcall_offset != 0)
2152 /* For either flavor, write the offset to this. */
2153 write_integer_cst (offset);
2156 /* For a virtual thunk, add the vcall offset. */
2159 /* Virtual thunk. Write the vcall offset and base type name. */
2160 write_integer_cst (vcall_offset);
2165 write_encoding (fn_decl);
2167 result = finish_mangling ();
2169 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2170 return get_identifier (result);
2173 /* Return an identifier for the mangled unqualified name for a
2174 conversion operator to TYPE. This mangling is not specified by the
2175 ABI spec; it is only used internally.
2177 For compatibility with existing conversion operator mechanisms,
2178 the mangled form is `__op<type>' where <type> is the mangled
2179 representation of TYPE.
2181 FIXME: Though identifiers with starting with __op are reserved for
2182 the implementation, it would eventually be nice to use inaccessible
2183 names for these operators. */
2186 mangle_conv_op_name_for_type (type)
2191 /* Build the mangling for TYPE. */
2192 const char *mangled_type = mangle_type_string (type);
2193 /* Allocate a temporary buffer for the complete name. */
2194 char *op_name = (char *) xmalloc (strlen (OPERATOR_TYPENAME_FORMAT)
2195 + strlen (mangled_type) + 1);
2196 /* Assemble the mangling. */
2197 strcpy (op_name, OPERATOR_TYPENAME_FORMAT);
2198 strcat (op_name, mangled_type);
2199 /* Find or create an identifier. */
2200 identifier = get_identifier (op_name);
2201 /* Done with the temporary buffer. */
2203 /* Set bits on the identifier so we know later it's a conversion. */
2204 IDENTIFIER_OPNAME_P (identifier) = 1;
2205 IDENTIFIER_TYPENAME_P (identifier) = 1;
2206 /* Hang TYPE off the identifier so it can be found easily later when
2207 performing conversions. */
2208 TREE_TYPE (identifier) = type;
2213 /* Return an identifier for the name of an initialization guard
2214 variable for indicated VARIABLE. */
2217 mangle_guard_variable (variable)
2221 write_string ("_ZGV");
2222 write_name (variable);
2223 return get_identifier (finish_mangling ());