1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000-2013 Free Software Foundation, Inc.
3 Written by Alex Samuel <samuel@codesourcery.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file implements mangling of C++ names according to the IA64
22 C++ ABI specification. A mangled name encodes a function or
23 variable's name, scope, type, and/or template arguments into a text
24 identifier. This identifier is used as the function's or
25 variable's linkage name, to preserve compatibility between C++'s
26 language features (templates, scoping, and overloading) and C
29 Additionally, g++ uses mangled names internally. To support this,
30 mangling of types is allowed, even though the mangled name of a
31 type should not appear by itself as an exported name. Ditto for
32 uninstantiated templates.
34 The primary entry point for this module is mangle_decl, which
35 returns an identifier containing the mangled name for a decl.
36 Additional entry points are provided to build mangled names of
37 particular constructs when the appropriate decl for that construct
38 is not available. These are:
40 mangle_typeinfo_for_type: typeinfo data
41 mangle_typeinfo_string_for_type: typeinfo type name
42 mangle_vtbl_for_type: virtual table data
43 mangle_vtt_for_type: VTT data
44 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
45 mangle_thunk: thunk function or entry */
49 #include "coretypes.h"
59 /* Debugging support. */
61 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
63 #define DEBUG_MANGLE 0
66 /* Macros for tracing the write_* functions. */
68 # define MANGLE_TRACE(FN, INPUT) \
69 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
70 # define MANGLE_TRACE_TREE(FN, NODE) \
71 fprintf (stderr, " %-24s: %-24s (%p)\n", \
72 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
74 # define MANGLE_TRACE(FN, INPUT)
75 # define MANGLE_TRACE_TREE(FN, NODE)
78 /* Nonzero if NODE is a class template-id. We can't rely on
79 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
80 that hard to distinguish A<T> from A, where A<T> is the type as
81 instantiated outside of the template, and A is the type used
82 without parameters inside the template. */
83 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
84 (TYPE_LANG_SPECIFIC (NODE) != NULL \
85 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
86 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
87 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
89 /* Things we only need one of. This module is not reentrant. */
90 typedef struct GTY(()) globals {
91 /* An array of the current substitution candidates, in the order
93 vec<tree, va_gc> *substitutions;
95 /* The entity that is being mangled. */
96 tree GTY ((skip)) entity;
98 /* How many parameter scopes we are inside. */
101 /* True if the mangling will be different in a future version of the
103 bool need_abi_warning;
106 static GTY (()) globals G;
108 /* The obstack on which we build mangled names. */
109 static struct obstack *mangle_obstack;
111 /* The obstack on which we build mangled names that are not going to
112 be IDENTIFIER_NODEs. */
113 static struct obstack name_obstack;
115 /* The first object on the name_obstack; we use this to free memory
116 allocated on the name_obstack. */
117 static void *name_base;
119 /* Indices into subst_identifiers. These are identifiers used in
120 special substitution rules. */
128 SUBID_BASIC_IOSTREAM,
131 substitution_identifier_index_t;
133 /* For quick substitution checks, look up these common identifiers
135 static GTY(()) tree subst_identifiers[SUBID_MAX];
137 /* Single-letter codes for builtin integer types, defined in
138 <builtin-type>. These are indexed by integer_type_kind values. */
140 integer_type_codes[itk_none] =
143 'a', /* itk_signed_char */
144 'h', /* itk_unsigned_char */
146 't', /* itk_unsigned_short */
148 'j', /* itk_unsigned_int */
150 'm', /* itk_unsigned_long */
151 'x', /* itk_long_long */
152 'y', /* itk_unsigned_long_long */
153 'n', /* itk_int128 */
154 'o', /* itk_unsigned_int128 */
157 static int decl_is_template_id (const tree, tree* const);
159 /* Functions for handling substitutions. */
161 static inline tree canonicalize_for_substitution (tree);
162 static void add_substitution (tree);
163 static inline int is_std_substitution (const tree,
164 const substitution_identifier_index_t);
165 static inline int is_std_substitution_char (const tree,
166 const substitution_identifier_index_t);
167 static int find_substitution (tree);
168 static void mangle_call_offset (const tree, const tree);
170 /* Functions for emitting mangled representations of things. */
172 static void write_mangled_name (const tree, bool);
173 static void write_encoding (const tree);
174 static void write_name (tree, const int);
175 static void write_abi_tags (tree);
176 static void write_unscoped_name (const tree);
177 static void write_unscoped_template_name (const tree);
178 static void write_nested_name (const tree);
179 static void write_prefix (const tree);
180 static void write_template_prefix (const tree);
181 static void write_unqualified_name (const tree);
182 static void write_conversion_operator_name (const tree);
183 static void write_source_name (tree);
184 static void write_literal_operator_name (tree);
185 static void write_unnamed_type_name (const tree);
186 static void write_closure_type_name (const tree);
187 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
189 static void write_number (unsigned HOST_WIDE_INT, const int,
191 static void write_compact_number (int num);
192 static void write_integer_cst (const tree);
193 static void write_real_cst (const tree);
194 static void write_identifier (const char *);
195 static void write_special_name_constructor (const tree);
196 static void write_special_name_destructor (const tree);
197 static void write_type (tree);
198 static int write_CV_qualifiers_for_type (const tree);
199 static void write_builtin_type (tree);
200 static void write_function_type (const tree);
201 static void write_bare_function_type (const tree, const int, const tree);
202 static void write_method_parms (tree, const int, const tree);
203 static void write_class_enum_type (const tree);
204 static void write_template_args (tree);
205 static void write_expression (tree);
206 static void write_template_arg_literal (const tree);
207 static void write_template_arg (tree);
208 static void write_template_template_arg (const tree);
209 static void write_array_type (const tree);
210 static void write_pointer_to_member_type (const tree);
211 static void write_template_param (const tree);
212 static void write_template_template_param (const tree);
213 static void write_substitution (const int);
214 static int discriminator_for_local_entity (tree);
215 static int discriminator_for_string_literal (tree, tree);
216 static void write_discriminator (const int);
217 static void write_local_name (tree, const tree, const tree);
218 static void dump_substitution_candidates (void);
219 static tree mangle_decl_string (const tree);
220 static int local_class_index (tree);
222 /* Control functions. */
224 static inline void start_mangling (const tree);
225 static inline const char *finish_mangling (const bool);
226 static tree mangle_special_for_type (const tree, const char *);
228 /* Foreign language functions. */
230 static void write_java_integer_type_codes (const tree);
232 /* Append a single character to the end of the mangled
234 #define write_char(CHAR) \
235 obstack_1grow (mangle_obstack, (CHAR))
237 /* Append a sized buffer to the end of the mangled representation. */
238 #define write_chars(CHAR, LEN) \
239 obstack_grow (mangle_obstack, (CHAR), (LEN))
241 /* Append a NUL-terminated string to the end of the mangled
243 #define write_string(STRING) \
244 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
246 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
247 same purpose (context, which may be a type) and value (template
248 decl). See write_template_prefix for more information on what this
250 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
251 (TREE_CODE (NODE1) == TREE_LIST \
252 && TREE_CODE (NODE2) == TREE_LIST \
253 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
254 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
255 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
256 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
258 /* Write out an unsigned quantity in base 10. */
259 #define write_unsigned_number(NUMBER) \
260 write_number ((NUMBER), /*unsigned_p=*/1, 10)
262 /* If DECL is a template instance, return nonzero and, if
263 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
264 Otherwise return zero. */
267 decl_is_template_id (const tree decl, tree* const template_info)
269 if (TREE_CODE (decl) == TYPE_DECL)
271 /* TYPE_DECLs are handled specially. Look at its type to decide
272 if this is a template instantiation. */
273 const tree type = TREE_TYPE (decl);
275 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
277 if (template_info != NULL)
278 /* For a templated TYPE_DECL, the template info is hanging
280 *template_info = TYPE_TEMPLATE_INFO (type);
286 /* Check if this is a primary template. */
287 if (DECL_LANG_SPECIFIC (decl) != NULL
288 && DECL_USE_TEMPLATE (decl)
289 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
290 && TREE_CODE (decl) != TEMPLATE_DECL)
292 if (template_info != NULL)
293 /* For most templated decls, the template info is hanging
295 *template_info = DECL_TEMPLATE_INFO (decl);
300 /* It's not a template id. */
304 /* Produce debugging output of current substitution candidates. */
307 dump_substitution_candidates (void)
312 fprintf (stderr, " ++ substitutions ");
313 FOR_EACH_VEC_ELT (*G.substitutions, i, el)
315 const char *name = "???";
318 fprintf (stderr, " ");
320 name = IDENTIFIER_POINTER (DECL_NAME (el));
321 else if (TREE_CODE (el) == TREE_LIST)
322 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
323 else if (TYPE_NAME (el))
324 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
325 fprintf (stderr, " S%d_ = ", i - 1);
327 (CP_TYPE_RESTRICT_P (el)
328 || CP_TYPE_VOLATILE_P (el)
329 || CP_TYPE_CONST_P (el)))
330 fprintf (stderr, "CV-");
331 fprintf (stderr, "%s (%s at %p)\n",
332 name, tree_code_name[TREE_CODE (el)], (void *) el);
336 /* Both decls and types can be substitution candidates, but sometimes
337 they refer to the same thing. For instance, a TYPE_DECL and
338 RECORD_TYPE for the same class refer to the same thing, and should
339 be treated accordingly in substitutions. This function returns a
340 canonicalized tree node representing NODE that is used when adding
341 and substitution candidates and finding matches. */
344 canonicalize_for_substitution (tree node)
346 /* For a TYPE_DECL, use the type instead. */
347 if (TREE_CODE (node) == TYPE_DECL)
348 node = TREE_TYPE (node);
350 && TYPE_CANONICAL (node) != node
351 && TYPE_MAIN_VARIANT (node) != node)
354 /* Here we want to strip the topmost typedef only.
355 We need to do that so is_std_substitution can do proper
357 if (TREE_CODE (node) == FUNCTION_TYPE)
358 /* Use build_qualified_type and TYPE_QUALS here to preserve
359 the old buggy mangling of attribute noreturn with abi<5. */
360 node = build_qualified_type (TYPE_MAIN_VARIANT (node),
363 node = cp_build_qualified_type (TYPE_MAIN_VARIANT (node),
364 cp_type_quals (node));
365 if (TREE_CODE (node) == FUNCTION_TYPE
366 || TREE_CODE (node) == METHOD_TYPE)
367 node = build_ref_qualified_type (node, type_memfn_rqual (orig));
372 /* Add NODE as a substitution candidate. NODE must not already be on
373 the list of candidates. */
376 add_substitution (tree node)
381 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
382 tree_code_name[TREE_CODE (node)], (void *) node);
384 /* Get the canonicalized substitution candidate for NODE. */
385 c = canonicalize_for_substitution (node);
386 if (DEBUG_MANGLE && c != node)
387 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
388 tree_code_name[TREE_CODE (node)], (void *) node);
392 /* Make sure NODE isn't already a candidate. */
397 FOR_EACH_VEC_SAFE_ELT (G.substitutions, i, candidate)
399 gcc_assert (!(DECL_P (node) && node == candidate));
400 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
401 && same_type_p (node, candidate)));
404 #endif /* ENABLE_CHECKING */
406 /* Put the decl onto the varray of substitution candidates. */
407 vec_safe_push (G.substitutions, node);
410 dump_substitution_candidates ();
413 /* Helper function for find_substitution. Returns nonzero if NODE,
414 which may be a decl or a CLASS_TYPE, is a template-id with template
415 name of substitution_index[INDEX] in the ::std namespace. */
418 is_std_substitution (const tree node,
419 const substitution_identifier_index_t index)
426 type = TREE_TYPE (node);
429 else if (CLASS_TYPE_P (node))
432 decl = TYPE_NAME (node);
435 /* These are not the droids you're looking for. */
438 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
439 && TYPE_LANG_SPECIFIC (type)
440 && TYPE_TEMPLATE_INFO (type)
441 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
442 == subst_identifiers[index]));
445 /* Helper function for find_substitution. Returns nonzero if NODE,
446 which may be a decl or a CLASS_TYPE, is the template-id
447 ::std::identifier<char>, where identifier is
448 substitution_index[INDEX]. */
451 is_std_substitution_char (const tree node,
452 const substitution_identifier_index_t index)
455 /* Check NODE's name is ::std::identifier. */
456 if (!is_std_substitution (node, index))
458 /* Figure out its template args. */
460 args = DECL_TI_ARGS (node);
461 else if (CLASS_TYPE_P (node))
462 args = CLASSTYPE_TI_ARGS (node);
464 /* Oops, not a template. */
466 /* NODE's template arg list should be <char>. */
468 TREE_VEC_LENGTH (args) == 1
469 && TREE_VEC_ELT (args, 0) == char_type_node;
472 /* Check whether a substitution should be used to represent NODE in
475 First, check standard special-case substitutions.
477 <substitution> ::= St
484 # ::std::basic_string
487 # ::std::basic_string<char,
488 ::std::char_traits<char>,
489 ::std::allocator<char> >
492 # ::std::basic_istream<char, ::std::char_traits<char> >
495 # ::std::basic_ostream<char, ::std::char_traits<char> >
498 # ::std::basic_iostream<char, ::std::char_traits<char> >
500 Then examine the stack of currently available substitution
501 candidates for entities appearing earlier in the same mangling
503 If a substitution is found, write its mangled representation and
504 return nonzero. If none is found, just return zero. */
507 find_substitution (tree node)
510 const int size = vec_safe_length (G.substitutions);
515 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
516 tree_code_name[TREE_CODE (node)], (void *) node);
518 /* Obtain the canonicalized substitution representation for NODE.
519 This is what we'll compare against. */
520 node = canonicalize_for_substitution (node);
522 /* Check for builtin substitutions. */
524 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
525 type = TYPE_P (node) ? node : TREE_TYPE (node);
527 /* Check for std::allocator. */
529 && is_std_substitution (decl, SUBID_ALLOCATOR)
530 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
536 /* Check for std::basic_string. */
537 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
541 /* If this is a type (i.e. a fully-qualified template-id),
543 std::basic_string <char,
544 std::char_traits<char>,
545 std::allocator<char> > . */
546 if (cp_type_quals (type) == TYPE_UNQUALIFIED
547 && CLASSTYPE_USE_TEMPLATE (type))
549 tree args = CLASSTYPE_TI_ARGS (type);
550 if (TREE_VEC_LENGTH (args) == 3
551 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
552 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
554 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
563 /* Substitute for the template name only if this isn't a type. */
570 /* Check for basic_{i,o,io}stream. */
572 && cp_type_quals (type) == TYPE_UNQUALIFIED
573 && CLASS_TYPE_P (type)
574 && CLASSTYPE_USE_TEMPLATE (type)
575 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
577 /* First, check for the template
578 args <char, std::char_traits<char> > . */
579 tree args = CLASSTYPE_TI_ARGS (type);
580 if (TREE_VEC_LENGTH (args) == 2
581 && TYPE_P (TREE_VEC_ELT (args, 0))
582 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
583 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
586 /* Got them. Is this basic_istream? */
587 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
592 /* Or basic_ostream? */
593 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
598 /* Or basic_iostream? */
599 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
607 /* Check for namespace std. */
608 if (decl && DECL_NAMESPACE_STD_P (decl))
614 /* Now check the list of available substitutions for this mangling
616 for (i = 0; i < size; ++i)
618 tree candidate = (*G.substitutions)[i];
619 /* NODE is a matched to a candidate if it's the same decl node or
620 if it's the same type. */
621 if (decl == candidate
622 || (TYPE_P (candidate) && type && TYPE_P (node)
623 && same_type_p (type, candidate))
624 || NESTED_TEMPLATE_MATCH (node, candidate))
626 write_substitution (i);
631 /* No substitution found. */
636 /* TOP_LEVEL is true, if this is being called at outermost level of
637 mangling. It should be false when mangling a decl appearing in an
638 expression within some other mangling.
640 <mangled-name> ::= _Z <encoding> */
643 write_mangled_name (const tree decl, bool top_level)
645 MANGLE_TRACE_TREE ("mangled-name", decl);
647 if (/* The names of `extern "C"' functions are not mangled. */
648 DECL_EXTERN_C_FUNCTION_P (decl)
649 /* But overloaded operator names *are* mangled. */
650 && !DECL_OVERLOADED_OPERATOR_P (decl))
655 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
658 /* The standard notes: "The <encoding> of an extern "C"
659 function is treated like global-scope data, i.e. as its
660 <source-name> without a type." We cannot write
661 overloaded operators that way though, because it contains
662 characters invalid in assembler. */
663 if (abi_version_at_least (2))
666 G.need_abi_warning = true;
667 write_source_name (DECL_NAME (decl));
670 else if (TREE_CODE (decl) == VAR_DECL
671 /* The names of non-static global variables aren't mangled. */
672 && DECL_EXTERNAL_LINKAGE_P (decl)
673 && (CP_DECL_CONTEXT (decl) == global_namespace
674 /* And neither are `extern "C"' variables. */
675 || DECL_EXTERN_C_P (decl)))
677 if (top_level || abi_version_at_least (2))
681 G.need_abi_warning = true;
689 write_encoding (decl);
690 if (DECL_LANG_SPECIFIC (decl)
691 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
692 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
693 /* We need a distinct mangled name for these entities, but
694 we should never actually output it. So, we append some
695 characters the assembler won't like. */
696 write_string (" *INTERNAL* ");
700 /* <encoding> ::= <function name> <bare-function-type>
704 write_encoding (const tree decl)
706 MANGLE_TRACE_TREE ("encoding", decl);
708 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
710 /* For overloaded operators write just the mangled name
711 without arguments. */
712 if (DECL_OVERLOADED_OPERATOR_P (decl))
713 write_name (decl, /*ignore_local_scope=*/0);
715 write_source_name (DECL_NAME (decl));
719 write_name (decl, /*ignore_local_scope=*/0);
720 if (TREE_CODE (decl) == FUNCTION_DECL)
725 if (decl_is_template_id (decl, NULL))
727 fn_type = get_mostly_instantiated_function_type (decl);
728 /* FN_TYPE will not have parameter types for in-charge or
729 VTT parameters. Therefore, we pass NULL_TREE to
730 write_bare_function_type -- otherwise, it will get
731 confused about which artificial parameters to skip. */
736 fn_type = TREE_TYPE (decl);
740 write_bare_function_type (fn_type,
741 (!DECL_CONSTRUCTOR_P (decl)
742 && !DECL_DESTRUCTOR_P (decl)
743 && !DECL_CONV_FN_P (decl)
744 && decl_is_template_id (decl, NULL)),
749 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
750 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
753 decl_mangling_context (tree decl)
755 tree tcontext = targetm.cxx.decl_mangling_context (decl);
757 if (tcontext != NULL_TREE)
760 if (TREE_CODE (decl) == TYPE_DECL
761 && LAMBDA_TYPE_P (TREE_TYPE (decl)))
763 tree extra = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl));
767 else if (TREE_CODE (decl) == TYPE_DECL
768 && TREE_CODE (TREE_TYPE (decl)) == TEMPLATE_TYPE_PARM)
769 /* template type parms have no mangling context. */
771 return CP_DECL_CONTEXT (decl);
774 /* <name> ::= <unscoped-name>
775 ::= <unscoped-template-name> <template-args>
779 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
780 called from <local-name>, which mangles the enclosing scope
781 elsewhere and then uses this function to mangle just the part
782 underneath the function scope. So don't use the <local-name>
783 production, to avoid an infinite recursion. */
786 write_name (tree decl, const int ignore_local_scope)
790 MANGLE_TRACE_TREE ("name", decl);
792 if (TREE_CODE (decl) == TYPE_DECL)
794 /* In case this is a typedef, fish out the corresponding
795 TYPE_DECL for the main variant. */
796 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
799 context = decl_mangling_context (decl);
801 /* A decl in :: or ::std scope is treated specially. The former is
802 mangled using <unscoped-name> or <unscoped-template-name>, the
803 latter with a special substitution. Also, a name that is
804 directly in a local function scope is also mangled with
805 <unscoped-name> rather than a full <nested-name>. */
807 || context == global_namespace
808 || DECL_NAMESPACE_STD_P (context)
809 || (ignore_local_scope
810 && (TREE_CODE (context) == FUNCTION_DECL
811 || (abi_version_at_least (7)
812 && TREE_CODE (context) == PARM_DECL))))
815 /* Is this a template instance? */
816 if (decl_is_template_id (decl, &template_info))
818 /* Yes: use <unscoped-template-name>. */
819 write_unscoped_template_name (TI_TEMPLATE (template_info));
820 write_template_args (TI_ARGS (template_info));
823 /* Everything else gets an <unqualified-name>. */
824 write_unscoped_name (decl);
828 /* Handle local names, unless we asked not to (that is, invoked
829 under <local-name>, to handle only the part of the name under
831 if (!ignore_local_scope)
833 /* Scan up the list of scope context, looking for a
834 function. If we find one, this entity is in local
835 function scope. local_entity tracks context one scope
836 level down, so it will contain the element that's
837 directly in that function's scope, either decl or one of
838 its enclosing scopes. */
839 tree local_entity = decl;
840 while (context != NULL && context != global_namespace)
842 /* Make sure we're always dealing with decls. */
843 if (context != NULL && TYPE_P (context))
844 context = TYPE_NAME (context);
845 /* Is this a function? */
846 if (TREE_CODE (context) == FUNCTION_DECL
847 || TREE_CODE (context) == PARM_DECL)
849 /* Yes, we have local scope. Use the <local-name>
850 production for the innermost function scope. */
851 write_local_name (context, local_entity, decl);
854 /* Up one scope level. */
855 local_entity = context;
856 context = decl_mangling_context (context);
859 /* No local scope found? Fall through to <nested-name>. */
862 /* Other decls get a <nested-name> to encode their scope. */
863 write_nested_name (decl);
867 /* <unscoped-name> ::= <unqualified-name>
868 ::= St <unqualified-name> # ::std:: */
871 write_unscoped_name (const tree decl)
873 tree context = decl_mangling_context (decl);
875 MANGLE_TRACE_TREE ("unscoped-name", decl);
877 /* Is DECL in ::std? */
878 if (DECL_NAMESPACE_STD_P (context))
881 write_unqualified_name (decl);
885 /* If not, it should be either in the global namespace, or directly
886 in a local function scope. */
887 gcc_assert (context == global_namespace
889 || TREE_CODE (context) == FUNCTION_DECL);
891 write_unqualified_name (decl);
895 /* <unscoped-template-name> ::= <unscoped-name>
896 ::= <substitution> */
899 write_unscoped_template_name (const tree decl)
901 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
903 if (find_substitution (decl))
905 write_unscoped_name (decl);
906 add_substitution (decl);
909 /* Write the nested name, including CV-qualifiers, of DECL.
911 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
912 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
914 <ref-qualifier> ::= R # & ref-qualifier
915 ::= O # && ref-qualifier
916 <CV-qualifiers> ::= [r] [V] [K] */
919 write_nested_name (const tree decl)
923 MANGLE_TRACE_TREE ("nested-name", decl);
927 /* Write CV-qualifiers, if this is a member function. */
928 if (TREE_CODE (decl) == FUNCTION_DECL
929 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
931 if (DECL_VOLATILE_MEMFUNC_P (decl))
933 if (DECL_CONST_MEMFUNC_P (decl))
935 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl)))
937 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl)))
944 /* Is this a template instance? */
945 if (decl_is_template_id (decl, &template_info))
947 /* Yes, use <template-prefix>. */
948 write_template_prefix (decl);
949 write_template_args (TI_ARGS (template_info));
951 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
953 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
954 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
956 write_template_prefix (decl);
957 write_template_args (TREE_OPERAND (name, 1));
961 write_prefix (decl_mangling_context (decl));
962 write_unqualified_name (decl);
967 /* No, just use <prefix> */
968 write_prefix (decl_mangling_context (decl));
969 write_unqualified_name (decl);
974 /* <prefix> ::= <prefix> <unqualified-name>
976 ::= <template-prefix> <template-args>
979 ::= <substitution> */
982 write_prefix (const tree node)
985 /* Non-NULL if NODE represents a template-id. */
986 tree template_info = NULL;
989 || node == global_namespace)
992 MANGLE_TRACE_TREE ("prefix", node);
994 if (TREE_CODE (node) == DECLTYPE_TYPE)
1000 if (find_substitution (node))
1005 /* If this is a function or parm decl, that means we've hit function
1006 scope, so this prefix must be for a local name. In this
1007 case, we're under the <local-name> production, which encodes
1008 the enclosing function scope elsewhere. So don't continue
1010 if (TREE_CODE (node) == FUNCTION_DECL
1011 || TREE_CODE (node) == PARM_DECL)
1015 decl_is_template_id (decl, &template_info);
1019 /* Node is a type. */
1020 decl = TYPE_NAME (node);
1021 if (CLASSTYPE_TEMPLATE_ID_P (node))
1022 template_info = TYPE_TEMPLATE_INFO (node);
1025 /* In G++ 3.2, the name of the template parameter was used. */
1026 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
1027 && !abi_version_at_least (2))
1028 G.need_abi_warning = true;
1030 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
1031 && abi_version_at_least (2))
1032 write_template_param (node);
1033 else if (template_info != NULL)
1036 write_template_prefix (decl);
1037 write_template_args (TI_ARGS (template_info));
1039 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1041 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1042 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1044 write_template_prefix (decl);
1045 write_template_args (TREE_OPERAND (name, 1));
1049 write_prefix (decl_mangling_context (decl));
1050 write_unqualified_name (decl);
1054 /* Not templated. */
1056 write_prefix (decl_mangling_context (decl));
1057 write_unqualified_name (decl);
1058 if (TREE_CODE (decl) == VAR_DECL
1059 || TREE_CODE (decl) == FIELD_DECL)
1061 /* <data-member-prefix> := <member source-name> M */
1067 add_substitution (node);
1070 /* <template-prefix> ::= <prefix> <template component>
1071 ::= <template-param>
1072 ::= <substitution> */
1075 write_template_prefix (const tree node)
1077 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1078 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1079 tree context = decl_mangling_context (decl);
1084 MANGLE_TRACE_TREE ("template-prefix", node);
1086 /* Find the template decl. */
1087 if (decl_is_template_id (decl, &template_info))
1088 templ = TI_TEMPLATE (template_info);
1089 else if (TREE_CODE (type) == TYPENAME_TYPE)
1090 /* For a typename type, all we have is the name. */
1091 templ = DECL_NAME (decl);
1094 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
1096 templ = TYPE_TI_TEMPLATE (type);
1099 /* For a member template, though, the template name for the
1100 innermost name must have all the outer template levels
1101 instantiated. For instance, consider
1103 template<typename T> struct Outer {
1104 template<typename U> struct Inner {};
1107 The template name for `Inner' in `Outer<int>::Inner<float>' is
1108 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1109 levels separately, so there's no TEMPLATE_DECL available for this
1110 (there's only `Outer<T>::Inner<U>').
1112 In order to get the substitutions right, we create a special
1113 TREE_LIST to represent the substitution candidate for a nested
1114 template. The TREE_PURPOSE is the template's context, fully
1115 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1118 So, for the example above, `Outer<int>::Inner' is represented as a
1119 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1120 and whose value is `Outer<T>::Inner<U>'. */
1121 if (TYPE_P (context))
1122 substitution = build_tree_list (context, templ);
1124 substitution = templ;
1126 if (find_substitution (substitution))
1129 /* In G++ 3.2, the name of the template template parameter was used. */
1130 if (TREE_TYPE (templ)
1131 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1132 && !abi_version_at_least (2))
1133 G.need_abi_warning = true;
1135 if (TREE_TYPE (templ)
1136 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1137 && abi_version_at_least (2))
1138 write_template_param (TREE_TYPE (templ));
1141 write_prefix (context);
1142 write_unqualified_name (decl);
1145 add_substitution (substitution);
1148 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1149 mangled through special entry points.
1151 <unqualified-name> ::= <operator-name>
1154 ::= <unnamed-type-name>
1155 ::= <local-source-name>
1157 <local-source-name> ::= L <source-name> <discriminator> */
1160 write_unqualified_id (tree identifier)
1162 if (IDENTIFIER_TYPENAME_P (identifier))
1163 write_conversion_operator_name (TREE_TYPE (identifier));
1164 else if (IDENTIFIER_OPNAME_P (identifier))
1167 const char *mangled_name = NULL;
1169 /* Unfortunately, there is no easy way to go from the
1170 name of the operator back to the corresponding tree
1172 for (i = 0; i < MAX_TREE_CODES; ++i)
1173 if (operator_name_info[i].identifier == identifier)
1175 /* The ABI says that we prefer binary operator
1176 names to unary operator names. */
1177 if (operator_name_info[i].arity == 2)
1179 mangled_name = operator_name_info[i].mangled_name;
1182 else if (!mangled_name)
1183 mangled_name = operator_name_info[i].mangled_name;
1185 else if (assignment_operator_name_info[i].identifier
1189 = assignment_operator_name_info[i].mangled_name;
1192 write_string (mangled_name);
1194 else if (UDLIT_OPER_P (identifier))
1195 write_literal_operator_name (identifier);
1197 write_source_name (identifier);
1201 write_unqualified_name (const tree decl)
1203 MANGLE_TRACE_TREE ("unqualified-name", decl);
1205 if (TREE_CODE (decl) == IDENTIFIER_NODE)
1207 write_unqualified_id (decl);
1213 if (DECL_NAME (decl) == NULL_TREE)
1216 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl));
1217 write_source_name (DECL_ASSEMBLER_NAME (decl));
1219 else if (DECL_DECLARES_FUNCTION_P (decl))
1222 if (DECL_CONSTRUCTOR_P (decl))
1223 write_special_name_constructor (decl);
1224 else if (DECL_DESTRUCTOR_P (decl))
1225 write_special_name_destructor (decl);
1226 else if (DECL_CONV_FN_P (decl))
1228 /* Conversion operator. Handle it right here.
1229 <operator> ::= cv <type> */
1231 if (decl_is_template_id (decl, NULL))
1234 fn_type = get_mostly_instantiated_function_type (decl);
1235 type = TREE_TYPE (fn_type);
1238 type = DECL_CONV_FN_TYPE (decl);
1239 write_conversion_operator_name (type);
1241 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1243 operator_name_info_t *oni;
1244 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1245 oni = assignment_operator_name_info;
1247 oni = operator_name_info;
1249 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1251 else if (UDLIT_OPER_P (DECL_NAME (decl)))
1252 write_literal_operator_name (DECL_NAME (decl));
1259 else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1260 && DECL_NAMESPACE_SCOPE_P (decl)
1261 && decl_linkage (decl) == lk_internal)
1263 MANGLE_TRACE_TREE ("local-source-name", decl);
1265 write_source_name (DECL_NAME (decl));
1266 /* The default discriminator is 1, and that's all we ever use,
1267 so there's no code to output one here. */
1271 tree type = TREE_TYPE (decl);
1273 if (TREE_CODE (decl) == TYPE_DECL
1274 && TYPE_ANONYMOUS_P (type))
1275 write_unnamed_type_name (type);
1276 else if (TREE_CODE (decl) == TYPE_DECL
1277 && LAMBDA_TYPE_P (type))
1278 write_closure_type_name (type);
1280 write_source_name (DECL_NAME (decl));
1283 tree attrs = (TREE_CODE (decl) == TYPE_DECL
1284 ? TYPE_ATTRIBUTES (TREE_TYPE (decl))
1285 : DECL_ATTRIBUTES (decl));
1286 write_abi_tags (lookup_attribute ("abi_tag", attrs));
1289 /* Write the unqualified-name for a conversion operator to TYPE. */
1292 write_conversion_operator_name (const tree type)
1294 write_string ("cv");
1298 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1300 <source-name> ::= </length/ number> <identifier> */
1303 write_source_name (tree identifier)
1305 MANGLE_TRACE_TREE ("source-name", identifier);
1307 /* Never write the whole template-id name including the template
1308 arguments; we only want the template name. */
1309 if (IDENTIFIER_TEMPLATE (identifier))
1310 identifier = IDENTIFIER_TEMPLATE (identifier);
1312 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1313 write_identifier (IDENTIFIER_POINTER (identifier));
1316 /* Compare two TREE_STRINGs like strcmp. */
1319 tree_string_cmp (const void *p1, const void *p2)
1323 tree s1 = *(const tree*)p1;
1324 tree s2 = *(const tree*)p2;
1325 return strcmp (TREE_STRING_POINTER (s1),
1326 TREE_STRING_POINTER (s2));
1329 /* ID is the name of a function or type with abi_tags attribute TAGS.
1330 Write out the name, suitably decorated. */
1333 write_abi_tags (tree tags)
1335 if (tags == NULL_TREE)
1338 tags = TREE_VALUE (tags);
1340 vec<tree, va_gc> * vec = make_tree_vector();
1342 for (tree t = tags; t; t = TREE_CHAIN (t))
1344 tree str = TREE_VALUE (t);
1345 vec_safe_push (vec, str);
1348 vec->qsort (tree_string_cmp);
1350 unsigned i; tree str;
1351 FOR_EACH_VEC_ELT (*vec, i, str)
1354 write_unsigned_number (TREE_STRING_LENGTH (str) - 1);
1355 write_identifier (TREE_STRING_POINTER (str));
1358 release_tree_vector (vec);
1361 /* Write a user-defined literal operator.
1362 ::= li <source-name> # "" <source-name>
1363 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1366 write_literal_operator_name (tree identifier)
1368 const char* suffix = UDLIT_OP_SUFFIX (identifier);
1369 write_identifier (UDLIT_OP_MANGLED_PREFIX);
1370 write_unsigned_number (strlen (suffix));
1371 write_identifier (suffix);
1374 /* Encode 0 as _, and 1+ as n-1_. */
1377 write_compact_number (int num)
1380 write_unsigned_number (num - 1);
1384 /* Return how many unnamed types precede TYPE in its enclosing class. */
1387 nested_anon_class_index (tree type)
1390 tree member = TYPE_FIELDS (TYPE_CONTEXT (type));
1391 for (; member; member = DECL_CHAIN (member))
1392 if (DECL_IMPLICIT_TYPEDEF_P (member))
1394 tree memtype = TREE_TYPE (member);
1395 if (memtype == type)
1397 else if (TYPE_ANONYMOUS_P (memtype))
1404 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1407 write_unnamed_type_name (const tree type)
1410 MANGLE_TRACE_TREE ("unnamed-type-name", type);
1412 if (TYPE_FUNCTION_SCOPE_P (type))
1413 discriminator = local_class_index (type);
1414 else if (TYPE_CLASS_SCOPE_P (type))
1415 discriminator = nested_anon_class_index (type);
1418 gcc_assert (no_linkage_check (type, /*relaxed_p=*/true));
1419 /* Just use the old mangling at namespace scope. */
1420 write_source_name (TYPE_IDENTIFIER (type));
1424 write_string ("Ut");
1425 write_compact_number (discriminator);
1428 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1429 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1432 write_closure_type_name (const tree type)
1434 tree fn = lambda_function (type);
1435 tree lambda = CLASSTYPE_LAMBDA_EXPR (type);
1436 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
1438 MANGLE_TRACE_TREE ("closure-type-name", type);
1440 write_string ("Ul");
1441 write_method_parms (parms, /*method_p=*/1, fn);
1443 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda));
1446 /* Convert NUMBER to ascii using base BASE and generating at least
1447 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1448 into which to store the characters. Returns the number of
1449 characters generated (these will be layed out in advance of where
1453 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1454 char *buffer, const unsigned int min_digits)
1456 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1457 unsigned digits = 0;
1461 unsigned HOST_WIDE_INT d = number / base;
1463 *--buffer = base_digits[number - d * base];
1467 while (digits < min_digits)
1469 *--buffer = base_digits[0];
1475 /* Non-terminal <number>.
1477 <number> ::= [n] </decimal integer/> */
1480 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1481 const unsigned int base)
1483 char buffer[sizeof (HOST_WIDE_INT) * 8];
1486 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1489 number = -((HOST_WIDE_INT) number);
1491 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1492 write_chars (buffer + sizeof (buffer) - count, count);
1495 /* Write out an integral CST in decimal. Most numbers are small, and
1496 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1497 bigger than that, which we must deal with. */
1500 write_integer_cst (const tree cst)
1502 int sign = tree_int_cst_sgn (cst);
1504 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1506 /* A bignum. We do this in chunks, each of which fits in a
1508 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1509 unsigned HOST_WIDE_INT chunk;
1510 unsigned chunk_digits;
1511 char *ptr = buffer + sizeof (buffer);
1516 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1521 if (sizeof (HOST_WIDE_INT) >= 8)
1523 /* It is at least 64 bits, so 10^18 is representable. */
1528 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1529 base = build_int_cstu (type, chunk);
1530 n = build_int_cst_wide (type,
1531 TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1536 n = fold_build1_loc (input_location, NEGATE_EXPR, type, n);
1540 tree d = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, n, base);
1541 tree tmp = fold_build2_loc (input_location, MULT_EXPR, type, d, base);
1544 done = integer_zerop (d);
1545 tmp = fold_build2_loc (input_location, MINUS_EXPR, type, n, tmp);
1546 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1547 done ? 1 : chunk_digits);
1553 write_chars (ptr, count);
1558 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1565 write_unsigned_number (low);
1569 /* Write out a floating-point literal.
1571 "Floating-point literals are encoded using the bit pattern of the
1572 target processor's internal representation of that number, as a
1573 fixed-length lowercase hexadecimal string, high-order bytes first
1574 (even if the target processor would store low-order bytes first).
1575 The "n" prefix is not used for floating-point literals; the sign
1576 bit is encoded with the rest of the number.
1578 Here are some examples, assuming the IEEE standard representation
1579 for floating point numbers. (Spaces are for readability, not
1580 part of the encoding.)
1583 -1.0f Lf bf80 0000 E
1584 1.17549435e-38f Lf 0080 0000 E
1585 1.40129846e-45f Lf 0000 0001 E
1586 0.0f Lf 0000 0000 E"
1588 Caller is responsible for the Lx and the E. */
1590 write_real_cst (const tree value)
1592 if (abi_version_at_least (2))
1594 long target_real[4]; /* largest supported float */
1595 char buffer[9]; /* eight hex digits in a 32-bit number */
1598 tree type = TREE_TYPE (value);
1599 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1601 real_to_target (target_real, &TREE_REAL_CST (value),
1604 /* The value in target_real is in the target word order,
1605 so we must write it out backward if that happens to be
1606 little-endian. write_number cannot be used, it will
1607 produce uppercase. */
1608 if (FLOAT_WORDS_BIG_ENDIAN)
1609 i = 0, limit = words, dir = 1;
1611 i = words - 1, limit = -1, dir = -1;
1613 for (; i != limit; i += dir)
1615 sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
1616 write_chars (buffer, 8);
1621 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1622 literally. Note that compatibility with 3.2 is impossible,
1623 because the old floating-point emulator used a different
1624 format for REAL_VALUE_TYPE. */
1626 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1627 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1630 G.need_abi_warning = 1;
1634 /* Non-terminal <identifier>.
1636 <identifier> ::= </unqualified source code identifier> */
1639 write_identifier (const char *identifier)
1641 MANGLE_TRACE ("identifier", identifier);
1642 write_string (identifier);
1645 /* Handle constructor productions of non-terminal <special-name>.
1646 CTOR is a constructor FUNCTION_DECL.
1648 <special-name> ::= C1 # complete object constructor
1649 ::= C2 # base object constructor
1650 ::= C3 # complete object allocating constructor
1652 Currently, allocating constructors are never used.
1654 We also need to provide mangled names for the maybe-in-charge
1655 constructor, so we treat it here too. mangle_decl_string will
1656 append *INTERNAL* to that, to make sure we never emit it. */
1659 write_special_name_constructor (const tree ctor)
1661 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1662 write_string ("C2");
1665 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1666 /* Even though we don't ever emit a definition of
1667 the old-style destructor, we still have to
1668 consider entities (like static variables) nested
1670 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor));
1671 write_string ("C1");
1675 /* Handle destructor productions of non-terminal <special-name>.
1676 DTOR is a destructor FUNCTION_DECL.
1678 <special-name> ::= D0 # deleting (in-charge) destructor
1679 ::= D1 # complete object (in-charge) destructor
1680 ::= D2 # base object (not-in-charge) destructor
1682 We also need to provide mangled names for the maybe-incharge
1683 destructor, so we treat it here too. mangle_decl_string will
1684 append *INTERNAL* to that, to make sure we never emit it. */
1687 write_special_name_destructor (const tree dtor)
1689 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1690 write_string ("D0");
1691 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1692 write_string ("D2");
1695 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1696 /* Even though we don't ever emit a definition of
1697 the old-style destructor, we still have to
1698 consider entities (like static variables) nested
1700 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor));
1701 write_string ("D1");
1705 /* Scan the vector of local classes and return how many others with the
1706 same name (or same no name) and context precede ENTITY. */
1709 local_class_index (tree entity)
1711 int ix, discriminator = 0;
1712 tree name = (TYPE_ANONYMOUS_P (entity) ? NULL_TREE
1713 : TYPE_IDENTIFIER (entity));
1714 tree ctx = TYPE_CONTEXT (entity);
1715 for (ix = 0; ; ix++)
1717 tree type = (*local_classes)[ix];
1719 return discriminator;
1720 if (TYPE_CONTEXT (type) == ctx
1721 && (name ? TYPE_IDENTIFIER (type) == name
1722 : TYPE_ANONYMOUS_P (type)))
1728 /* Return the discriminator for ENTITY appearing inside
1729 FUNCTION. The discriminator is the lexical ordinal of VAR among
1730 entities with the same name in the same FUNCTION. */
1733 discriminator_for_local_entity (tree entity)
1735 if (DECL_DISCRIMINATOR_P (entity))
1737 if (DECL_DISCRIMINATOR_SET_P (entity))
1738 return DECL_DISCRIMINATOR (entity);
1740 /* The first entity with a particular name doesn't get
1741 DECL_DISCRIMINATOR set up. */
1744 else if (TREE_CODE (entity) == TYPE_DECL)
1746 /* Scan the list of local classes. */
1747 entity = TREE_TYPE (entity);
1749 /* Lambdas and unnamed types have their own discriminators. */
1750 if (LAMBDA_TYPE_P (entity) || TYPE_ANONYMOUS_P (entity))
1753 return local_class_index (entity);
1759 /* Return the discriminator for STRING, a string literal used inside
1760 FUNCTION. The discriminator is the lexical ordinal of STRING among
1761 string literals used in FUNCTION. */
1764 discriminator_for_string_literal (tree /*function*/,
1767 /* For now, we don't discriminate amongst string literals. */
1771 /* <discriminator> := _ <number>
1773 The discriminator is used only for the second and later occurrences
1774 of the same name within a single function. In this case <number> is
1775 n - 2, if this is the nth occurrence, in lexical order. */
1778 write_discriminator (const int discriminator)
1780 /* If discriminator is zero, don't write anything. Otherwise... */
1781 if (discriminator > 0)
1784 write_unsigned_number (discriminator - 1);
1788 /* Mangle the name of a function-scope entity. FUNCTION is the
1789 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1790 default argument scope. ENTITY is the decl for the entity itself.
1791 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1792 either ENTITY itself or an enclosing scope of ENTITY.
1794 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1795 := Z <function encoding> E s [<discriminator>]
1796 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1799 write_local_name (tree function, const tree local_entity,
1802 tree parm = NULL_TREE;
1804 MANGLE_TRACE_TREE ("local-name", entity);
1806 if (TREE_CODE (function) == PARM_DECL)
1809 function = DECL_CONTEXT (parm);
1813 write_encoding (function);
1816 /* For this purpose, parameters are numbered from right-to-left. */
1821 for (t = DECL_ARGUMENTS (function); t; t = DECL_CHAIN (t))
1829 write_compact_number (i - 1);
1832 if (TREE_CODE (entity) == STRING_CST)
1835 write_discriminator (discriminator_for_string_literal (function,
1840 /* Now the <entity name>. Let write_name know its being called
1841 from <local-name>, so it doesn't try to process the enclosing
1842 function scope again. */
1843 write_name (entity, /*ignore_local_scope=*/1);
1844 write_discriminator (discriminator_for_local_entity (local_entity));
1848 /* Non-terminals <type> and <CV-qualifier>.
1850 <type> ::= <builtin-type>
1852 ::= <class-enum-type>
1854 ::= <pointer-to-member-type>
1855 ::= <template-param>
1858 ::= P <type> # pointer-to
1859 ::= R <type> # reference-to
1860 ::= C <type> # complex pair (C 2000)
1861 ::= G <type> # imaginary (C 2000) [not supported]
1862 ::= U <source-name> <type> # vendor extended type qualifier
1866 <type> ::= RR <type> # rvalue reference-to
1867 <type> ::= Dt <expression> # decltype of an id-expression or
1868 # class member access
1869 <type> ::= DT <expression> # decltype of an expression
1870 <type> ::= Dn # decltype of nullptr
1872 TYPE is a type node. */
1875 write_type (tree type)
1877 /* This gets set to nonzero if TYPE turns out to be a (possibly
1878 CV-qualified) builtin type. */
1879 int is_builtin_type = 0;
1881 MANGLE_TRACE_TREE ("type", type);
1883 if (type == error_mark_node)
1886 type = canonicalize_for_substitution (type);
1887 if (find_substitution (type))
1891 if (write_CV_qualifiers_for_type (type) > 0)
1892 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1893 mangle the unqualified type. The recursive call is needed here
1894 since both the qualified and unqualified types are substitution
1897 tree t = TYPE_MAIN_VARIANT (type);
1898 if (TREE_CODE (t) == FUNCTION_TYPE
1899 || TREE_CODE (t) == METHOD_TYPE)
1900 t = build_ref_qualified_type (t, type_memfn_rqual (type));
1903 else if (TREE_CODE (type) == ARRAY_TYPE)
1904 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1905 so that the cv-qualification of the element type is available
1906 in write_array_type. */
1907 write_array_type (type);
1910 tree type_orig = type;
1912 /* See through any typedefs. */
1913 type = TYPE_MAIN_VARIANT (type);
1914 if (TREE_CODE (type) == FUNCTION_TYPE
1915 || TREE_CODE (type) == METHOD_TYPE)
1916 type = build_ref_qualified_type (type, type_memfn_rqual (type_orig));
1918 /* According to the C++ ABI, some library classes are passed the
1919 same as the scalar type of their single member and use the same
1921 if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
1922 type = TREE_TYPE (first_field (type));
1924 if (TYPE_PTRDATAMEM_P (type))
1925 write_pointer_to_member_type (type);
1928 /* Handle any target-specific fundamental types. */
1929 const char *target_mangling
1930 = targetm.mangle_type (type_orig);
1932 if (target_mangling)
1934 write_string (target_mangling);
1935 /* Add substitutions for types other than fundamental
1937 if (TREE_CODE (type) != VOID_TYPE
1938 && TREE_CODE (type) != INTEGER_TYPE
1939 && TREE_CODE (type) != REAL_TYPE
1940 && TREE_CODE (type) != BOOLEAN_TYPE)
1941 add_substitution (type);
1945 switch (TREE_CODE (type))
1949 case INTEGER_TYPE: /* Includes wchar_t. */
1951 case FIXED_POINT_TYPE:
1953 /* If this is a typedef, TYPE may not be one of
1954 the standard builtin type nodes, but an alias of one. Use
1955 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1956 write_builtin_type (TYPE_MAIN_VARIANT (type));
1963 write_type (TREE_TYPE (type));
1968 write_function_type (type);
1974 /* A pointer-to-member function is represented as a special
1975 RECORD_TYPE, so check for this first. */
1976 if (TYPE_PTRMEMFUNC_P (type))
1977 write_pointer_to_member_type (type);
1979 write_class_enum_type (type);
1983 case UNBOUND_CLASS_TEMPLATE:
1984 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1985 ordinary nested names. */
1986 write_nested_name (TYPE_STUB_DECL (type));
1990 case REFERENCE_TYPE:
1991 if (TREE_CODE (type) == POINTER_TYPE)
1993 else if (TYPE_REF_IS_RVALUE (type))
1998 tree target = TREE_TYPE (type);
1999 /* Attribute const/noreturn are not reflected in mangling.
2000 We strip them here rather than at a lower level because
2001 a typedef or template argument can have function type
2002 with function-cv-quals (that use the same representation),
2003 but you can't have a pointer/reference to such a type. */
2004 if (abi_version_at_least (5)
2005 && TREE_CODE (target) == FUNCTION_TYPE)
2006 target = build_qualified_type (target, TYPE_UNQUALIFIED);
2007 write_type (target);
2011 case TEMPLATE_TYPE_PARM:
2014 write_identifier ("Da");
2018 /* else fall through. */
2019 case TEMPLATE_PARM_INDEX:
2020 write_template_param (type);
2023 case TEMPLATE_TEMPLATE_PARM:
2024 write_template_template_param (type);
2027 case BOUND_TEMPLATE_TEMPLATE_PARM:
2028 write_template_template_param (type);
2030 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
2034 if (abi_version_at_least (4))
2036 write_string ("Dv");
2037 /* Non-constant vector size would be encoded with
2038 _ expression, but we don't support that yet. */
2039 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type));
2044 G.need_abi_warning = 1;
2045 write_string ("U8__vector");
2047 write_type (TREE_TYPE (type));
2050 case TYPE_PACK_EXPANSION:
2051 write_string ("Dp");
2052 write_type (PACK_EXPANSION_PATTERN (type));
2056 /* These shouldn't make it into mangling. */
2057 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type)
2058 && !DECLTYPE_FOR_LAMBDA_PROXY (type));
2060 /* In ABI <5, we stripped decltype of a plain decl. */
2061 if (!abi_version_at_least (5)
2062 && DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
2064 tree expr = DECLTYPE_TYPE_EXPR (type);
2065 tree etype = NULL_TREE;
2066 switch (TREE_CODE (expr))
2073 case TEMPLATE_PARM_INDEX:
2074 etype = TREE_TYPE (expr);
2081 if (etype && !type_uses_auto (etype))
2083 G.need_abi_warning = 1;
2090 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
2094 ++cp_unevaluated_operand;
2095 write_expression (DECLTYPE_TYPE_EXPR (type));
2096 --cp_unevaluated_operand;
2101 write_string ("Dn");
2102 if (abi_version_at_least (7))
2107 sorry ("mangling typeof, use decltype instead");
2110 case UNDERLYING_TYPE:
2111 sorry ("mangling __underlying_type");
2123 /* Types other than builtin types are substitution candidates. */
2124 if (!is_builtin_type)
2125 add_substitution (type);
2128 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2129 CV-qualifiers written for TYPE.
2131 <CV-qualifiers> ::= [r] [V] [K] */
2134 write_CV_qualifiers_for_type (const tree type)
2136 int num_qualifiers = 0;
2138 /* The order is specified by:
2140 "In cases where multiple order-insensitive qualifiers are
2141 present, they should be ordered 'K' (closest to the base type),
2142 'V', 'r', and 'U' (farthest from the base type) ..."
2144 Note that we do not use cp_type_quals below; given "const
2145 int[3]", the "const" is emitted with the "int", not with the
2147 cp_cv_quals quals = TYPE_QUALS (type);
2149 if (quals & TYPE_QUAL_RESTRICT)
2154 if (quals & TYPE_QUAL_VOLATILE)
2159 if (quals & TYPE_QUAL_CONST)
2165 return num_qualifiers;
2168 /* Non-terminal <builtin-type>.
2170 <builtin-type> ::= v # void
2175 ::= h # unsigned char
2177 ::= t # unsigned short
2179 ::= j # unsigned int
2181 ::= m # unsigned long
2182 ::= x # long long, __int64
2183 ::= y # unsigned long long, __int64
2185 ::= o # unsigned __int128
2188 ::= e # long double, __float80
2189 ::= g # __float128 [not supported]
2190 ::= u <source-name> # vendor extended type */
2193 write_builtin_type (tree type)
2195 if (TYPE_CANONICAL (type))
2196 type = TYPE_CANONICAL (type);
2198 switch (TREE_CODE (type))
2209 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2210 isn't in integer_type_nodes. */
2211 if (type == wchar_type_node)
2213 else if (type == char16_type_node)
2214 write_string ("Ds");
2215 else if (type == char32_type_node)
2216 write_string ("Di");
2217 else if (TYPE_FOR_JAVA (type))
2218 write_java_integer_type_codes (type);
2222 /* Assume TYPE is one of the shared integer type nodes. Find
2223 it in the array of these nodes. */
2225 for (itk = 0; itk < itk_none; ++itk)
2226 if (integer_types[itk] != NULL_TREE
2227 && type == integer_types[itk])
2229 /* Print the corresponding single-letter code. */
2230 write_char (integer_type_codes[itk]);
2234 if (itk == itk_none)
2236 tree t = c_common_type_for_mode (TYPE_MODE (type),
2237 TYPE_UNSIGNED (type));
2244 if (TYPE_PRECISION (type) == 128)
2245 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
2248 /* Allow for cases where TYPE is not one of the shared
2249 integer type nodes and write a "vendor extended builtin
2250 type" with a name the form intN or uintN, respectively.
2251 Situations like this can happen if you have an
2252 __attribute__((__mode__(__SI__))) type and use exotic
2253 switches like '-mint8' on AVR. Of course, this is
2254 undefined by the C++ ABI (and '-mint8' is not even
2255 Standard C conforming), but when using such special
2256 options you're pretty much in nowhere land anyway. */
2258 char prec[11]; /* up to ten digits for an unsigned */
2260 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
2261 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
2262 write_char ('u'); /* "vendor extended builtin type" */
2263 write_unsigned_number (strlen (prefix) + strlen (prec));
2264 write_string (prefix);
2265 write_string (prec);
2272 if (type == float_type_node
2273 || type == java_float_type_node)
2275 else if (type == double_type_node
2276 || type == java_double_type_node)
2278 else if (type == long_double_type_node)
2280 else if (type == dfloat32_type_node)
2281 write_string ("Df");
2282 else if (type == dfloat64_type_node)
2283 write_string ("Dd");
2284 else if (type == dfloat128_type_node)
2285 write_string ("De");
2290 case FIXED_POINT_TYPE:
2291 write_string ("DF");
2292 if (GET_MODE_IBIT (TYPE_MODE (type)) > 0)
2293 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type)));
2294 if (type == fract_type_node
2295 || type == sat_fract_type_node
2296 || type == accum_type_node
2297 || type == sat_accum_type_node)
2299 else if (type == unsigned_fract_type_node
2300 || type == sat_unsigned_fract_type_node
2301 || type == unsigned_accum_type_node
2302 || type == sat_unsigned_accum_type_node)
2304 else if (type == short_fract_type_node
2305 || type == sat_short_fract_type_node
2306 || type == short_accum_type_node
2307 || type == sat_short_accum_type_node)
2309 else if (type == unsigned_short_fract_type_node
2310 || type == sat_unsigned_short_fract_type_node
2311 || type == unsigned_short_accum_type_node
2312 || type == sat_unsigned_short_accum_type_node)
2314 else if (type == long_fract_type_node
2315 || type == sat_long_fract_type_node
2316 || type == long_accum_type_node
2317 || type == sat_long_accum_type_node)
2319 else if (type == unsigned_long_fract_type_node
2320 || type == sat_unsigned_long_fract_type_node
2321 || type == unsigned_long_accum_type_node
2322 || type == sat_unsigned_long_accum_type_node)
2324 else if (type == long_long_fract_type_node
2325 || type == sat_long_long_fract_type_node
2326 || type == long_long_accum_type_node
2327 || type == sat_long_long_accum_type_node)
2329 else if (type == unsigned_long_long_fract_type_node
2330 || type == sat_unsigned_long_long_fract_type_node
2331 || type == unsigned_long_long_accum_type_node
2332 || type == sat_unsigned_long_long_accum_type_node)
2335 sorry ("mangling unknown fixed point type");
2336 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type)));
2337 if (TYPE_SATURATING (type))
2348 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2349 METHOD_TYPE. The return type is mangled before the parameter
2352 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2355 write_function_type (const tree type)
2357 MANGLE_TRACE_TREE ("function-type", type);
2359 /* For a pointer to member function, the function type may have
2360 cv-qualifiers, indicating the quals for the artificial 'this'
2362 if (TREE_CODE (type) == METHOD_TYPE)
2364 /* The first parameter must be a POINTER_TYPE pointing to the
2365 `this' parameter. */
2366 tree this_type = class_of_this_parm (type);
2367 write_CV_qualifiers_for_type (this_type);
2371 /* We don't track whether or not a type is `extern "C"'. Note that
2372 you can have an `extern "C"' function that does not have
2373 `extern "C"' type, and vice versa:
2375 extern "C" typedef void function_t();
2376 function_t f; // f has C++ linkage, but its type is
2379 typedef void function_t();
2380 extern "C" function_t f; // Vice versa.
2383 write_bare_function_type (type, /*include_return_type_p=*/1,
2385 if (FUNCTION_REF_QUALIFIED (type))
2387 if (FUNCTION_RVALUE_QUALIFIED (type))
2395 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2396 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2397 is mangled before the parameter types. If non-NULL, DECL is
2398 FUNCTION_DECL for the function whose type is being emitted.
2400 If DECL is a member of a Java type, then a literal 'J'
2401 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2404 <bare-function-type> ::= [J]</signature/ type>+ */
2407 write_bare_function_type (const tree type, const int include_return_type_p,
2412 MANGLE_TRACE_TREE ("bare-function-type", type);
2414 /* Detect Java methods and emit special encoding. */
2416 && DECL_FUNCTION_MEMBER_P (decl)
2417 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
2418 && !DECL_CONSTRUCTOR_P (decl)
2419 && !DECL_DESTRUCTOR_P (decl)
2420 && !DECL_CONV_FN_P (decl))
2430 /* Mangle the return type, if requested. */
2431 if (include_return_type_p || java_method_p)
2432 write_type (TREE_TYPE (type));
2434 /* Now mangle the types of the arguments. */
2436 write_method_parms (TYPE_ARG_TYPES (type),
2437 TREE_CODE (type) == METHOD_TYPE,
2442 /* Write the mangled representation of a method parameter list of
2443 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2444 considered a non-static method, and the this parameter is omitted.
2445 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2446 parameters are being emitted. */
2449 write_method_parms (tree parm_types, const int method_p, const tree decl)
2451 tree first_parm_type;
2452 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
2454 /* Assume this parameter type list is variable-length. If it ends
2455 with a void type, then it's not. */
2458 /* If this is a member function, skip the first arg, which is the
2460 "Member functions do not encode the type of their implicit this
2463 Similarly, there's no need to mangle artificial parameters, like
2464 the VTT parameters for constructors and destructors. */
2467 parm_types = TREE_CHAIN (parm_types);
2468 parm_decl = parm_decl ? DECL_CHAIN (parm_decl) : NULL_TREE;
2470 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
2472 parm_types = TREE_CHAIN (parm_types);
2473 parm_decl = DECL_CHAIN (parm_decl);
2477 for (first_parm_type = parm_types;
2479 parm_types = TREE_CHAIN (parm_types))
2481 tree parm = TREE_VALUE (parm_types);
2482 if (parm == void_type_node)
2484 /* "Empty parameter lists, whether declared as () or
2485 conventionally as (void), are encoded with a void parameter
2487 if (parm_types == first_parm_type)
2489 /* If the parm list is terminated with a void type, it's
2492 /* A void type better be the last one. */
2493 gcc_assert (TREE_CHAIN (parm_types) == NULL);
2500 /* <builtin-type> ::= z # ellipsis */
2504 /* <class-enum-type> ::= <name> */
2507 write_class_enum_type (const tree type)
2509 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
2512 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2515 <template-args> ::= I <template-arg>* E */
2518 write_template_args (tree args)
2523 MANGLE_TRACE_TREE ("template-args", args);
2528 length = TREE_VEC_LENGTH (args);
2530 if (args && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
2532 /* We have nested template args. We want the innermost template
2534 args = TREE_VEC_ELT (args, length - 1);
2535 length = TREE_VEC_LENGTH (args);
2537 for (i = 0; i < length; ++i)
2538 write_template_arg (TREE_VEC_ELT (args, i));
2545 <unqualified-name> <template-args>
2546 part of SCOPE_REF or COMPONENT_REF mangling. */
2549 write_member_name (tree member)
2551 if (TREE_CODE (member) == IDENTIFIER_NODE)
2552 write_unqualified_id (member);
2553 else if (DECL_P (member))
2554 write_unqualified_name (member);
2555 else if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2557 tree name = TREE_OPERAND (member, 0);
2558 if (TREE_CODE (name) == OVERLOAD)
2559 name = OVL_FUNCTION (name);
2560 write_member_name (name);
2561 write_template_args (TREE_OPERAND (member, 1));
2564 write_expression (member);
2567 /* <expression> ::= <unary operator-name> <expression>
2568 ::= <binary operator-name> <expression> <expression>
2571 <expr-primary> ::= <template-param>
2572 ::= L <type> <value number> E # literal
2573 ::= L <mangled-name> E # external name
2574 ::= st <type> # sizeof
2575 ::= sr <type> <unqualified-name> # dependent name
2576 ::= sr <type> <unqualified-name> <template-args> */
2579 write_expression (tree expr)
2581 enum tree_code code = TREE_CODE (expr);
2583 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2584 is converted (via qualification conversions) to another
2586 while (TREE_CODE (expr) == NOP_EXPR
2587 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2589 expr = TREE_OPERAND (expr, 0);
2590 code = TREE_CODE (expr);
2593 if (code == BASELINK
2594 && (!type_unknown_p (expr)
2595 || !BASELINK_QUALIFIED_P (expr)))
2597 expr = BASELINK_FUNCTIONS (expr);
2598 code = TREE_CODE (expr);
2601 /* Handle pointers-to-members by making them look like expression
2603 if (code == PTRMEM_CST)
2605 expr = build_nt (ADDR_EXPR,
2606 build_qualified_name (/*type=*/NULL_TREE,
2607 PTRMEM_CST_CLASS (expr),
2608 PTRMEM_CST_MEMBER (expr),
2609 /*template_p=*/false));
2610 code = TREE_CODE (expr);
2613 /* Handle template parameters. */
2614 if (code == TEMPLATE_TYPE_PARM
2615 || code == TEMPLATE_TEMPLATE_PARM
2616 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2617 || code == TEMPLATE_PARM_INDEX)
2618 write_template_param (expr);
2619 /* Handle literals. */
2620 else if (TREE_CODE_CLASS (code) == tcc_constant
2621 || (abi_version_at_least (2) && code == CONST_DECL))
2622 write_template_arg_literal (expr);
2623 else if (code == PARM_DECL && DECL_ARTIFICIAL (expr))
2625 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr))));
2626 write_string ("fpT");
2628 else if (code == PARM_DECL)
2630 /* A function parameter used in a late-specified return type. */
2631 int index = DECL_PARM_INDEX (expr);
2632 int level = DECL_PARM_LEVEL (expr);
2633 int delta = G.parm_depth - level + 1;
2634 gcc_assert (index >= 1);
2638 if (abi_version_at_least (5))
2640 /* Let L be the number of function prototype scopes from the
2641 innermost one (in which the parameter reference occurs) up
2642 to (and including) the one containing the declaration of
2643 the referenced parameter. If the parameter declaration
2644 clause of the innermost function prototype scope has been
2645 completely seen, it is not counted (in that case -- which
2646 is perhaps the most common -- L can be zero). */
2648 write_unsigned_number (delta - 1);
2651 G.need_abi_warning = true;
2654 write_compact_number (index - 1);
2656 else if (DECL_P (expr))
2658 /* G++ 3.2 incorrectly mangled non-type template arguments of
2659 enumeration type using their names. */
2660 if (code == CONST_DECL)
2661 G.need_abi_warning = 1;
2663 write_mangled_name (expr, false);
2666 else if (TREE_CODE (expr) == SIZEOF_EXPR
2667 && SIZEOF_EXPR_TYPE_P (expr))
2669 write_string ("st");
2670 write_type (TREE_TYPE (TREE_OPERAND (expr, 0)));
2672 else if (TREE_CODE (expr) == SIZEOF_EXPR
2673 && TYPE_P (TREE_OPERAND (expr, 0)))
2675 write_string ("st");
2676 write_type (TREE_OPERAND (expr, 0));
2678 else if (TREE_CODE (expr) == ALIGNOF_EXPR
2679 && TYPE_P (TREE_OPERAND (expr, 0)))
2681 write_string ("at");
2682 write_type (TREE_OPERAND (expr, 0));
2684 else if (code == SCOPE_REF
2685 || code == BASELINK)
2688 if (code == SCOPE_REF)
2690 scope = TREE_OPERAND (expr, 0);
2691 member = TREE_OPERAND (expr, 1);
2695 scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (expr));
2696 member = BASELINK_FUNCTIONS (expr);
2699 if (!abi_version_at_least (2) && DECL_P (member))
2701 write_string ("sr");
2703 /* G++ 3.2 incorrectly put out both the "sr" code and
2704 the nested name of the qualified name. */
2705 G.need_abi_warning = 1;
2706 write_encoding (member);
2709 /* If the MEMBER is a real declaration, then the qualifying
2710 scope was not dependent. Ideally, we would not have a
2711 SCOPE_REF in those cases, but sometimes we do. If the second
2712 argument is a DECL, then the name must not have been
2714 else if (DECL_P (member))
2715 write_expression (member);
2718 write_string ("sr");
2720 write_member_name (member);
2723 else if (TREE_CODE (expr) == INDIRECT_REF
2724 && TREE_TYPE (TREE_OPERAND (expr, 0))
2725 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2727 write_expression (TREE_OPERAND (expr, 0));
2729 else if (TREE_CODE (expr) == IDENTIFIER_NODE)
2731 /* An operator name appearing as a dependent name needs to be
2732 specially marked to disambiguate between a use of the operator
2733 name and a use of the operator in an expression. */
2734 if (IDENTIFIER_OPNAME_P (expr))
2735 write_string ("on");
2736 write_unqualified_id (expr);
2738 else if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
2740 tree fn = TREE_OPERAND (expr, 0);
2741 if (is_overloaded_fn (fn))
2742 fn = DECL_NAME (get_first_fn (fn));
2743 if (IDENTIFIER_OPNAME_P (fn))
2744 write_string ("on");
2745 write_unqualified_id (fn);
2746 write_template_args (TREE_OPERAND (expr, 1));
2748 else if (TREE_CODE (expr) == MODOP_EXPR)
2750 enum tree_code subop = TREE_CODE (TREE_OPERAND (expr, 1));
2751 const char *name = (assignment_operator_name_info[(int) subop]
2753 write_string (name);
2754 write_expression (TREE_OPERAND (expr, 0));
2755 write_expression (TREE_OPERAND (expr, 2));
2757 else if (code == NEW_EXPR || code == VEC_NEW_EXPR)
2759 /* ::= [gs] nw <expression>* _ <type> E
2760 ::= [gs] nw <expression>* _ <type> <initializer>
2761 ::= [gs] na <expression>* _ <type> E
2762 ::= [gs] na <expression>* _ <type> <initializer>
2763 <initializer> ::= pi <expression>* E */
2764 tree placement = TREE_OPERAND (expr, 0);
2765 tree type = TREE_OPERAND (expr, 1);
2766 tree nelts = TREE_OPERAND (expr, 2);
2767 tree init = TREE_OPERAND (expr, 3);
2770 gcc_assert (code == NEW_EXPR);
2771 if (TREE_OPERAND (expr, 2))
2772 code = VEC_NEW_EXPR;
2774 if (NEW_EXPR_USE_GLOBAL (expr))
2775 write_string ("gs");
2777 write_string (operator_name_info[(int) code].mangled_name);
2779 for (t = placement; t; t = TREE_CHAIN (t))
2780 write_expression (TREE_VALUE (t));
2787 ++processing_template_decl;
2788 domain = compute_array_index_type (NULL_TREE, nelts,
2789 tf_warning_or_error);
2790 type = build_cplus_array_type (type, domain);
2791 --processing_template_decl;
2795 if (init && TREE_CODE (init) == TREE_LIST
2796 && TREE_CODE (TREE_VALUE (init)) == CONSTRUCTOR
2797 && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init)))
2798 write_expression (TREE_VALUE (init));
2802 write_string ("pi");
2803 if (init && init != void_zero_node)
2804 for (t = init; t; t = TREE_CHAIN (t))
2805 write_expression (TREE_VALUE (t));
2809 else if (code == DELETE_EXPR || code == VEC_DELETE_EXPR)
2811 gcc_assert (code == DELETE_EXPR);
2812 if (DELETE_EXPR_USE_VEC (expr))
2813 code = VEC_DELETE_EXPR;
2815 if (DELETE_EXPR_USE_GLOBAL (expr))
2816 write_string ("gs");
2818 write_string (operator_name_info[(int) code].mangled_name);
2820 write_expression (TREE_OPERAND (expr, 0));
2822 else if (code == THROW_EXPR)
2824 tree op = TREE_OPERAND (expr, 0);
2827 write_string ("tw");
2828 write_expression (op);
2831 write_string ("tr");
2833 else if (code == CONSTRUCTOR)
2835 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (expr);
2836 unsigned i; tree val;
2838 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
2839 write_string ("il");
2842 write_string ("tl");
2843 write_type (TREE_TYPE (expr));
2845 FOR_EACH_CONSTRUCTOR_VALUE (elts, i, val)
2846 write_expression (val);
2849 else if (dependent_name (expr))
2851 write_unqualified_id (dependent_name (expr));
2858 /* When we bind a variable or function to a non-type template
2859 argument with reference type, we create an ADDR_EXPR to show
2860 the fact that the entity's address has been taken. But, we
2861 don't actually want to output a mangling code for the `&'. */
2862 if (TREE_CODE (expr) == ADDR_EXPR
2864 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2866 expr = TREE_OPERAND (expr, 0);
2869 write_expression (expr);
2873 code = TREE_CODE (expr);
2876 if (code == COMPONENT_REF)
2878 tree ob = TREE_OPERAND (expr, 0);
2880 if (TREE_CODE (ob) == ARROW_EXPR)
2882 write_string (operator_name_info[(int)code].mangled_name);
2883 ob = TREE_OPERAND (ob, 0);
2886 write_string ("dt");
2888 write_expression (ob);
2889 write_member_name (TREE_OPERAND (expr, 1));
2893 /* If it wasn't any of those, recursively expand the expression. */
2894 name = operator_name_info[(int) code].mangled_name;
2896 /* We used to mangle const_cast and static_cast like a C cast. */
2897 if (!abi_version_at_least (6)
2898 && (code == CONST_CAST_EXPR
2899 || code == STATIC_CAST_EXPR))
2901 name = operator_name_info[CAST_EXPR].mangled_name;
2902 G.need_abi_warning = 1;
2910 error ("use of built-in trait %qE in function signature; "
2911 "use library traits instead", expr);
2915 sorry ("mangling %C", code);
2921 write_string (name);
2927 tree fn = CALL_EXPR_FN (expr);
2929 if (TREE_CODE (fn) == ADDR_EXPR)
2930 fn = TREE_OPERAND (fn, 0);
2932 /* Mangle a dependent name as the name, not whatever happens to
2933 be the first function in the overload set. */
2934 if ((TREE_CODE (fn) == FUNCTION_DECL
2935 || TREE_CODE (fn) == OVERLOAD)
2936 && type_dependent_expression_p_push (expr))
2937 fn = DECL_NAME (get_first_fn (fn));
2939 write_expression (fn);
2942 for (i = 0; i < call_expr_nargs (expr); ++i)
2943 write_expression (CALL_EXPR_ARG (expr, i));
2948 write_type (TREE_TYPE (expr));
2949 if (list_length (TREE_OPERAND (expr, 0)) == 1)
2950 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2953 tree args = TREE_OPERAND (expr, 0);
2955 for (; args; args = TREE_CHAIN (args))
2956 write_expression (TREE_VALUE (args));
2961 case DYNAMIC_CAST_EXPR:
2962 case REINTERPRET_CAST_EXPR:
2963 case STATIC_CAST_EXPR:
2964 case CONST_CAST_EXPR:
2965 write_type (TREE_TYPE (expr));
2966 write_expression (TREE_OPERAND (expr, 0));
2969 case PREINCREMENT_EXPR:
2970 case PREDECREMENT_EXPR:
2971 if (abi_version_at_least (6))
2974 G.need_abi_warning = 1;
2978 /* In the middle-end, some expressions have more operands than
2979 they do in templates (and mangling). */
2980 len = cp_tree_operand_length (expr);
2982 for (i = 0; i < len; ++i)
2984 tree operand = TREE_OPERAND (expr, i);
2985 /* As a GNU extension, the middle operand of a
2986 conditional may be omitted. Since expression
2987 manglings are supposed to represent the input token
2988 stream, there's no good way to mangle such an
2989 expression without extending the C++ ABI. */
2990 if (code == COND_EXPR && i == 1 && !operand)
2992 error ("omitted middle operand to %<?:%> operand "
2993 "cannot be mangled");
2996 write_expression (operand);
3002 /* Literal subcase of non-terminal <template-arg>.
3004 "Literal arguments, e.g. "A<42L>", are encoded with their type
3005 and value. Negative integer values are preceded with "n"; for
3006 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3007 encoded as 0, true as 1." */
3010 write_template_arg_literal (const tree value)
3013 write_type (TREE_TYPE (value));
3015 /* Write a null member pointer value as (type)0, regardless of its
3016 real representation. */
3017 if (null_member_pointer_value_p (value))
3018 write_integer_cst (integer_zero_node);
3020 switch (TREE_CODE (value))
3023 write_integer_cst (DECL_INITIAL (value));
3027 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
3028 || integer_zerop (value) || integer_onep (value));
3029 write_integer_cst (value);
3033 write_real_cst (value);
3037 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST
3038 && TREE_CODE (TREE_IMAGPART (value)) == INTEGER_CST)
3040 write_integer_cst (TREE_REALPART (value));
3042 write_integer_cst (TREE_IMAGPART (value));
3044 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST
3045 && TREE_CODE (TREE_IMAGPART (value)) == REAL_CST)
3047 write_real_cst (TREE_REALPART (value));
3049 write_real_cst (TREE_IMAGPART (value));
3056 sorry ("string literal in function template signature");
3066 /* Non-terminal <template-arg>.
3068 <template-arg> ::= <type> # type
3069 ::= L <type> </value/ number> E # literal
3070 ::= LZ <name> E # external name
3071 ::= X <expression> E # expression */
3074 write_template_arg (tree node)
3076 enum tree_code code = TREE_CODE (node);
3078 MANGLE_TRACE_TREE ("template-arg", node);
3080 /* A template template parameter's argument list contains TREE_LIST
3081 nodes of which the value field is the actual argument. */
3082 if (code == TREE_LIST)
3084 node = TREE_VALUE (node);
3085 /* If it's a decl, deal with its type instead. */
3088 node = TREE_TYPE (node);
3089 code = TREE_CODE (node);
3093 if (TREE_CODE (node) == NOP_EXPR
3094 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
3096 /* Template parameters can be of reference type. To maintain
3097 internal consistency, such arguments use a conversion from
3098 address of object to reference type. */
3099 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
3100 if (abi_version_at_least (2))
3101 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
3103 G.need_abi_warning = 1;
3106 if (TREE_CODE (node) == BASELINK
3107 && !type_unknown_p (node))
3109 if (abi_version_at_least (6))
3110 node = BASELINK_FUNCTIONS (node);
3112 /* We wrongly wrapped a class-scope function in X/E. */
3113 G.need_abi_warning = 1;
3116 if (ARGUMENT_PACK_P (node))
3118 /* Expand the template argument pack. */
3119 tree args = ARGUMENT_PACK_ARGS (node);
3120 int i, length = TREE_VEC_LENGTH (args);
3121 if (abi_version_at_least (6))
3126 G.need_abi_warning = 1;
3128 for (i = 0; i < length; ++i)
3129 write_template_arg (TREE_VEC_ELT (args, i));
3132 else if (TYPE_P (node))
3134 else if (code == TEMPLATE_DECL)
3135 /* A template appearing as a template arg is a template template arg. */
3136 write_template_template_arg (node);
3137 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
3138 || (abi_version_at_least (2) && code == CONST_DECL)
3139 || null_member_pointer_value_p (node))
3140 write_template_arg_literal (node);
3141 else if (DECL_P (node))
3143 /* Until ABI version 2, non-type template arguments of
3144 enumeration type were mangled using their names. */
3145 if (code == CONST_DECL && !abi_version_at_least (2))
3146 G.need_abi_warning = 1;
3148 /* Until ABI version 3, the underscore before the mangled name
3149 was incorrectly omitted. */
3150 if (!abi_version_at_least (3))
3152 G.need_abi_warning = 1;
3156 write_string ("_Z");
3157 write_encoding (node);
3162 /* Template arguments may be expressions. */
3164 write_expression (node);
3169 /* <template-template-arg>
3171 ::= <substitution> */
3174 write_template_template_arg (const tree decl)
3176 MANGLE_TRACE_TREE ("template-template-arg", decl);
3178 if (find_substitution (decl))
3180 write_name (decl, /*ignore_local_scope=*/0);
3181 add_substitution (decl);
3185 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3187 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3188 ::= A <expression> _ </element/ type>
3190 "Array types encode the dimension (number of elements) and the
3191 element type. For variable length arrays, the dimension (but not
3192 the '_' separator) is omitted." */
3195 write_array_type (const tree type)
3198 if (TYPE_DOMAIN (type))
3203 index_type = TYPE_DOMAIN (type);
3204 /* The INDEX_TYPE gives the upper and lower bounds of the
3206 max = TYPE_MAX_VALUE (index_type);
3207 if (TREE_CODE (max) == INTEGER_CST)
3209 /* The ABI specifies that we should mangle the number of
3210 elements in the array, not the largest allowed index. */
3211 double_int dmax = tree_to_double_int (max) + double_int_one;
3212 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3213 number of elements as zero. */
3214 dmax = dmax.zext (TYPE_PRECISION (TREE_TYPE (max)));
3215 gcc_assert (dmax.fits_uhwi ());
3216 write_unsigned_number (dmax.low);
3220 max = TREE_OPERAND (max, 0);
3221 if (!abi_version_at_least (2))
3223 /* value_dependent_expression_p presumes nothing is
3224 dependent when PROCESSING_TEMPLATE_DECL is zero. */
3225 ++processing_template_decl;
3226 if (!value_dependent_expression_p (max))
3227 G.need_abi_warning = 1;
3228 --processing_template_decl;
3230 write_expression (max);
3235 write_type (TREE_TYPE (type));
3238 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3239 variables. TYPE is a pointer-to-member POINTER_TYPE.
3241 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3244 write_pointer_to_member_type (const tree type)
3247 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
3248 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
3251 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3252 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3253 TEMPLATE_PARM_INDEX.
3255 <template-param> ::= T </parameter/ number> _ */
3258 write_template_param (const tree parm)
3262 MANGLE_TRACE_TREE ("template-parm", parm);
3264 switch (TREE_CODE (parm))
3266 case TEMPLATE_TYPE_PARM:
3267 case TEMPLATE_TEMPLATE_PARM:
3268 case BOUND_TEMPLATE_TEMPLATE_PARM:
3269 parm_index = TEMPLATE_TYPE_IDX (parm);
3272 case TEMPLATE_PARM_INDEX:
3273 parm_index = TEMPLATE_PARM_IDX (parm);
3281 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3282 earliest template param denoted by `_'. */
3283 write_compact_number (parm_index);
3286 /* <template-template-param>
3287 ::= <template-param>
3288 ::= <substitution> */
3291 write_template_template_param (const tree parm)
3293 tree templ = NULL_TREE;
3295 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3296 template template parameter. The substitution candidate here is
3297 only the template. */
3298 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
3301 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
3302 if (find_substitution (templ))
3306 /* <template-param> encodes only the template parameter position,
3307 not its template arguments, which is fine here. */
3308 write_template_param (parm);
3310 add_substitution (templ);
3313 /* Non-terminal <substitution>.
3315 <substitution> ::= S <seq-id> _
3319 write_substitution (const int seq_id)
3321 MANGLE_TRACE ("substitution", "");
3325 write_number (seq_id - 1, /*unsigned=*/1, 36);
3329 /* Start mangling ENTITY. */
3332 start_mangling (const tree entity)
3335 G.need_abi_warning = false;
3336 obstack_free (&name_obstack, name_base);
3337 mangle_obstack = &name_obstack;
3338 name_base = obstack_alloc (&name_obstack, 0);
3341 /* Done with mangling. If WARN is true, and the name of G.entity will
3342 be mangled differently in a future version of the ABI, issue a
3346 finish_mangling_internal (const bool warn)
3348 if (warn_abi && warn && G.need_abi_warning)
3349 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
3353 /* Clear all the substitutions. */
3354 vec_safe_truncate (G.substitutions, 0);
3356 /* Null-terminate the string. */
3361 /* Like finish_mangling_internal, but return the mangled string. */
3363 static inline const char *
3364 finish_mangling (const bool warn)
3366 finish_mangling_internal (warn);
3367 return (const char *) obstack_finish (mangle_obstack);
3370 /* Like finish_mangling_internal, but return an identifier. */
3373 finish_mangling_get_identifier (const bool warn)
3375 finish_mangling_internal (warn);
3376 /* Don't obstack_finish here, and the next start_mangling will
3377 remove the identifier. */
3378 return get_identifier ((const char *) obstack_base (mangle_obstack));
3381 /* Initialize data structures for mangling. */
3386 gcc_obstack_init (&name_obstack);
3387 name_base = obstack_alloc (&name_obstack, 0);
3388 vec_alloc (G.substitutions, 0);
3390 /* Cache these identifiers for quick comparison when checking for
3391 standard substitutions. */
3392 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
3393 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
3394 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
3395 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
3396 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
3397 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
3400 /* Generate the mangled name of DECL. */
3403 mangle_decl_string (const tree decl)
3406 location_t saved_loc = input_location;
3407 tree saved_fn = NULL_TREE;
3408 bool template_p = false;
3410 /* We shouldn't be trying to mangle an uninstantiated template. */
3411 gcc_assert (!type_dependent_expression_p (decl));
3413 if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
3415 struct tinst_level *tl = current_instantiation ();
3416 if ((!tl || tl->decl != decl)
3417 && push_tinst_level (decl))
3420 saved_fn = current_function_decl;
3421 current_function_decl = NULL_TREE;
3424 input_location = DECL_SOURCE_LOCATION (decl);
3426 start_mangling (decl);
3428 if (TREE_CODE (decl) == TYPE_DECL)
3429 write_type (TREE_TYPE (decl));
3431 write_mangled_name (decl, true);
3433 result = finish_mangling_get_identifier (/*warn=*/true);
3435 fprintf (stderr, "mangle_decl_string = '%s'\n\n",
3436 IDENTIFIER_POINTER (result));
3441 current_function_decl = saved_fn;
3443 input_location = saved_loc;
3448 /* Return an identifier for the external mangled name of DECL. */
3451 get_mangled_id (tree decl)
3453 tree id = mangle_decl_string (decl);
3454 return targetm.mangle_decl_assembler_name (decl, id);
3457 /* Create an identifier for the external mangled name of DECL. */
3460 mangle_decl (const tree decl)
3465 /* Don't bother mangling uninstantiated templates. */
3466 ++processing_template_decl;
3467 if (TREE_CODE (decl) == TYPE_DECL)
3468 dep = dependent_type_p (TREE_TYPE (decl));
3470 dep = (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3471 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl)));
3472 --processing_template_decl;
3476 id = get_mangled_id (decl);
3477 SET_DECL_ASSEMBLER_NAME (decl, id);
3479 if (G.need_abi_warning
3480 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3481 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)
3482 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
3484 #ifdef ASM_OUTPUT_DEF
3485 /* If the mangling will change in the future, emit an alias with the
3486 future mangled name for forward-compatibility. */
3491 SET_IDENTIFIER_GLOBAL_VALUE (id, decl);
3492 if (IDENTIFIER_GLOBAL_VALUE (id) != decl)
3493 inform (DECL_SOURCE_LOCATION (decl), "-fabi-version=6 (or =0) "
3494 "avoids this error with a change in mangling");
3496 #ifdef ASM_OUTPUT_DEF
3497 save_ver = flag_abi_version;
3498 flag_abi_version = 0;
3499 id2 = mangle_decl_string (decl);
3500 id2 = targetm.mangle_decl_assembler_name (decl, id2);
3501 flag_abi_version = save_ver;
3503 alias = make_alias_for (decl, id2);
3504 DECL_IGNORED_P (alias) = 1;
3505 TREE_PUBLIC (alias) = TREE_PUBLIC (decl);
3506 DECL_VISIBILITY (alias) = DECL_VISIBILITY (decl);
3507 if (vague_linkage_p (decl))
3508 DECL_WEAK (alias) = 1;
3509 if (TREE_CODE (decl) == FUNCTION_DECL)
3510 cgraph_same_body_alias (cgraph_get_create_node (decl), alias, decl);
3512 varpool_extra_name_alias (alias, decl);
3517 /* Generate the mangled representation of TYPE. */
3520 mangle_type_string (const tree type)
3524 start_mangling (type);
3526 result = finish_mangling (/*warn=*/false);
3528 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
3532 /* Create an identifier for the mangled name of a special component
3533 for belonging to TYPE. CODE is the ABI-specified code for this
3537 mangle_special_for_type (const tree type, const char *code)
3541 /* We don't have an actual decl here for the special component, so
3542 we can't just process the <encoded-name>. Instead, fake it. */
3543 start_mangling (type);
3545 /* Start the mangling. */
3546 write_string ("_Z");
3547 write_string (code);
3551 result = finish_mangling_get_identifier (/*warn=*/false);
3554 fprintf (stderr, "mangle_special_for_type = %s\n\n",
3555 IDENTIFIER_POINTER (result));
3560 /* Create an identifier for the mangled representation of the typeinfo
3561 structure for TYPE. */
3564 mangle_typeinfo_for_type (const tree type)
3566 return mangle_special_for_type (type, "TI");
3569 /* Create an identifier for the mangled name of the NTBS containing
3570 the mangled name of TYPE. */
3573 mangle_typeinfo_string_for_type (const tree type)
3575 return mangle_special_for_type (type, "TS");
3578 /* Create an identifier for the mangled name of the vtable for TYPE. */
3581 mangle_vtbl_for_type (const tree type)
3583 return mangle_special_for_type (type, "TV");
3586 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3589 mangle_vtt_for_type (const tree type)
3591 return mangle_special_for_type (type, "TT");
3594 /* Return an identifier for a construction vtable group. TYPE is
3595 the most derived class in the hierarchy; BINFO is the base
3596 subobject for which this construction vtable group will be used.
3598 This mangling isn't part of the ABI specification; in the ABI
3599 specification, the vtable group is dumped in the same COMDAT as the
3600 main vtable, and is referenced only from that vtable, so it doesn't
3601 need an external name. For binary formats without COMDAT sections,
3602 though, we need external names for the vtable groups.
3604 We use the production
3606 <special-name> ::= CT <type> <offset number> _ <base type> */
3609 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
3613 start_mangling (type);
3615 write_string ("_Z");
3616 write_string ("TC");
3618 write_integer_cst (BINFO_OFFSET (binfo));
3620 write_type (BINFO_TYPE (binfo));
3622 result = finish_mangling_get_identifier (/*warn=*/false);
3624 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n",
3625 IDENTIFIER_POINTER (result));
3629 /* Mangle a this pointer or result pointer adjustment.
3631 <call-offset> ::= h <fixed offset number> _
3632 ::= v <fixed offset number> _ <virtual offset number> _ */
3635 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
3637 write_char (virtual_offset ? 'v' : 'h');
3639 /* For either flavor, write the fixed offset. */
3640 write_integer_cst (fixed_offset);
3643 /* For a virtual thunk, add the virtual offset. */
3646 write_integer_cst (virtual_offset);
3651 /* Return an identifier for the mangled name of a this-adjusting or
3652 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3653 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3654 is a virtual thunk, and it is the vtbl offset in
3655 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3656 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3657 thunk itself. A covariant thunk name always includes the adjustment
3658 for the this pointer, even if there is none.
3660 <special-name> ::= T <call-offset> <base encoding>
3661 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3665 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
3666 tree virtual_offset)
3670 start_mangling (fn_decl);
3672 write_string ("_Z");
3675 if (!this_adjusting)
3677 /* Covariant thunk with no this adjustment */
3679 mangle_call_offset (integer_zero_node, NULL_TREE);
3680 mangle_call_offset (fixed_offset, virtual_offset);
3682 else if (!DECL_THUNK_P (fn_decl))
3683 /* Plain this adjusting thunk. */
3684 mangle_call_offset (fixed_offset, virtual_offset);
3687 /* This adjusting thunk to covariant thunk. */
3689 mangle_call_offset (fixed_offset, virtual_offset);
3690 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
3691 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
3693 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
3694 mangle_call_offset (fixed_offset, virtual_offset);
3695 fn_decl = THUNK_TARGET (fn_decl);
3699 write_encoding (fn_decl);
3701 result = finish_mangling_get_identifier (/*warn=*/false);
3703 fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result));
3707 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3708 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3711 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
3713 /* Hash a node (VAL1) in the table. */
3716 hash_type (const void *val)
3718 return (hashval_t) TYPE_UID (TREE_TYPE ((const_tree) val));
3721 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3724 compare_type (const void *val1, const void *val2)
3726 return TREE_TYPE ((const_tree) val1) == (const_tree) val2;
3729 /* Return an identifier for the mangled unqualified name for a
3730 conversion operator to TYPE. This mangling is not specified by the
3731 ABI spec; it is only used internally. */
3734 mangle_conv_op_name_for_type (const tree type)
3739 if (type == error_mark_node)
3740 return error_mark_node;
3742 if (conv_type_names == NULL)
3743 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
3745 slot = htab_find_slot_with_hash (conv_type_names, type,
3746 (hashval_t) TYPE_UID (type), INSERT);
3747 identifier = (tree)*slot;
3752 /* Create a unique name corresponding to TYPE. */
3753 sprintf (buffer, "operator %lu",
3754 (unsigned long) htab_elements (conv_type_names));
3755 identifier = get_identifier (buffer);
3758 /* Hang TYPE off the identifier so it can be found easily later
3759 when performing conversions. */
3760 TREE_TYPE (identifier) = type;
3762 /* Set bits on the identifier so we know later it's a conversion. */
3763 IDENTIFIER_OPNAME_P (identifier) = 1;
3764 IDENTIFIER_TYPENAME_P (identifier) = 1;
3770 /* Write out the appropriate string for this variable when generating
3771 another mangled name based on this one. */
3774 write_guarded_var_name (const tree variable)
3776 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
3777 /* The name of a guard variable for a reference temporary should refer
3778 to the reference, not the temporary. */
3779 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
3781 write_name (variable, /*ignore_local_scope=*/0);
3784 /* Return an identifier for the name of an initialization guard
3785 variable for indicated VARIABLE. */
3788 mangle_guard_variable (const tree variable)
3790 start_mangling (variable);
3791 write_string ("_ZGV");
3792 write_guarded_var_name (variable);
3793 return finish_mangling_get_identifier (/*warn=*/false);
3796 /* Return an identifier for the name of a thread_local initialization
3797 function for VARIABLE. */
3800 mangle_tls_init_fn (const tree variable)
3802 start_mangling (variable);
3803 write_string ("_ZTH");
3804 write_guarded_var_name (variable);
3805 return finish_mangling_get_identifier (/*warn=*/false);
3808 /* Return an identifier for the name of a thread_local wrapper
3809 function for VARIABLE. */
3811 #define TLS_WRAPPER_PREFIX "_ZTW"
3814 mangle_tls_wrapper_fn (const tree variable)
3816 start_mangling (variable);
3817 write_string (TLS_WRAPPER_PREFIX);
3818 write_guarded_var_name (variable);
3819 return finish_mangling_get_identifier (/*warn=*/false);
3822 /* Return true iff FN is a thread_local wrapper function. */
3825 decl_tls_wrapper_p (const tree fn)
3827 if (TREE_CODE (fn) != FUNCTION_DECL)
3829 tree name = DECL_NAME (fn);
3830 return strncmp (IDENTIFIER_POINTER (name), TLS_WRAPPER_PREFIX,
3831 strlen (TLS_WRAPPER_PREFIX)) == 0;
3834 /* Return an identifier for the name of a temporary variable used to
3835 initialize a static reference. This isn't part of the ABI, but we might
3836 as well call them something readable. */
3838 static GTY(()) int temp_count;
3841 mangle_ref_init_variable (const tree variable)
3843 start_mangling (variable);
3844 write_string ("_ZGR");
3845 write_name (variable, /*ignore_local_scope=*/0);
3846 /* Avoid name clashes with aggregate initialization of multiple
3847 references at once. */
3848 write_unsigned_number (temp_count++);
3849 return finish_mangling_get_identifier (/*warn=*/false);
3853 /* Foreign language type mangling section. */
3855 /* How to write the type codes for the integer Java type. */
3858 write_java_integer_type_codes (const tree type)
3860 if (type == java_int_type_node)
3862 else if (type == java_short_type_node)
3864 else if (type == java_byte_type_node)
3866 else if (type == java_char_type_node)
3868 else if (type == java_long_type_node)
3870 else if (type == java_boolean_type_node)
3876 #include "gt-cp-mangle.h"