1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000-2014 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"
52 #include "stor-layout.h"
53 #include "stringpool.h"
62 /* Debugging support. */
64 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
66 #define DEBUG_MANGLE 0
69 /* Macros for tracing the write_* functions. */
71 # define MANGLE_TRACE(FN, INPUT) \
72 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
73 # define MANGLE_TRACE_TREE(FN, NODE) \
74 fprintf (stderr, " %-24s: %-24s (%p)\n", \
75 (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE))
77 # define MANGLE_TRACE(FN, INPUT)
78 # define MANGLE_TRACE_TREE(FN, NODE)
81 /* Nonzero if NODE is a class template-id. We can't rely on
82 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
83 that hard to distinguish A<T> from A, where A<T> is the type as
84 instantiated outside of the template, and A is the type used
85 without parameters inside the template. */
86 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
87 (TYPE_LANG_SPECIFIC (NODE) != NULL \
88 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
89 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
90 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
92 /* Things we only need one of. This module is not reentrant. */
93 typedef struct GTY(()) globals {
94 /* An array of the current substitution candidates, in the order
96 vec<tree, va_gc> *substitutions;
98 /* The entity that is being mangled. */
99 tree GTY ((skip)) entity;
101 /* How many parameter scopes we are inside. */
104 /* True if the mangling will be different in a future version of the
106 bool need_abi_warning;
109 static GTY (()) globals G;
111 /* The obstack on which we build mangled names. */
112 static struct obstack *mangle_obstack;
114 /* The obstack on which we build mangled names that are not going to
115 be IDENTIFIER_NODEs. */
116 static struct obstack name_obstack;
118 /* The first object on the name_obstack; we use this to free memory
119 allocated on the name_obstack. */
120 static void *name_base;
122 /* Indices into subst_identifiers. These are identifiers used in
123 special substitution rules. */
131 SUBID_BASIC_IOSTREAM,
134 substitution_identifier_index_t;
136 /* For quick substitution checks, look up these common identifiers
138 static GTY(()) tree subst_identifiers[SUBID_MAX];
140 /* Single-letter codes for builtin integer types, defined in
141 <builtin-type>. These are indexed by integer_type_kind values. */
143 integer_type_codes[itk_none] =
146 'a', /* itk_signed_char */
147 'h', /* itk_unsigned_char */
149 't', /* itk_unsigned_short */
151 'j', /* itk_unsigned_int */
153 'm', /* itk_unsigned_long */
154 'x', /* itk_long_long */
155 'y', /* itk_unsigned_long_long */
156 'n', /* itk_int128 */
157 'o', /* itk_unsigned_int128 */
160 static int decl_is_template_id (const tree, tree* const);
162 /* Functions for handling substitutions. */
164 static inline tree canonicalize_for_substitution (tree);
165 static void add_substitution (tree);
166 static inline int is_std_substitution (const tree,
167 const substitution_identifier_index_t);
168 static inline int is_std_substitution_char (const tree,
169 const substitution_identifier_index_t);
170 static int find_substitution (tree);
171 static void mangle_call_offset (const tree, const tree);
173 /* Functions for emitting mangled representations of things. */
175 static void write_mangled_name (const tree, bool);
176 static void write_encoding (const tree);
177 static void write_name (tree, const int);
178 static void write_abi_tags (tree);
179 static void write_unscoped_name (const tree);
180 static void write_unscoped_template_name (const tree);
181 static void write_nested_name (const tree);
182 static void write_prefix (const tree);
183 static void write_template_prefix (const tree);
184 static void write_unqualified_name (tree);
185 static void write_conversion_operator_name (const tree);
186 static void write_source_name (tree);
187 static void write_literal_operator_name (tree);
188 static void write_unnamed_type_name (const tree);
189 static void write_closure_type_name (const tree);
190 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
192 static void write_number (unsigned HOST_WIDE_INT, const int,
194 static void write_compact_number (int num);
195 static void write_integer_cst (const tree);
196 static void write_real_cst (const tree);
197 static void write_identifier (const char *);
198 static void write_special_name_constructor (const tree);
199 static void write_special_name_destructor (const tree);
200 static void write_type (tree);
201 static int write_CV_qualifiers_for_type (const tree);
202 static void write_builtin_type (tree);
203 static void write_function_type (const tree);
204 static void write_bare_function_type (const tree, const int, const tree);
205 static void write_method_parms (tree, const int, const tree);
206 static void write_class_enum_type (const tree);
207 static void write_template_args (tree);
208 static void write_expression (tree);
209 static void write_template_arg_literal (const tree);
210 static void write_template_arg (tree);
211 static void write_template_template_arg (const tree);
212 static void write_array_type (const tree);
213 static void write_pointer_to_member_type (const tree);
214 static void write_template_param (const tree);
215 static void write_template_template_param (const tree);
216 static void write_substitution (const int);
217 static int discriminator_for_local_entity (tree);
218 static int discriminator_for_string_literal (tree, tree);
219 static void write_discriminator (const int);
220 static void write_local_name (tree, const tree, const tree);
221 static void dump_substitution_candidates (void);
222 static tree mangle_decl_string (const tree);
223 static int local_class_index (tree);
225 /* Control functions. */
227 static inline void start_mangling (const tree);
228 static inline const char *finish_mangling (const bool);
229 static tree mangle_special_for_type (const tree, const char *);
231 /* Foreign language functions. */
233 static void write_java_integer_type_codes (const tree);
235 /* Append a single character to the end of the mangled
237 #define write_char(CHAR) \
238 obstack_1grow (mangle_obstack, (CHAR))
240 /* Append a sized buffer to the end of the mangled representation. */
241 #define write_chars(CHAR, LEN) \
242 obstack_grow (mangle_obstack, (CHAR), (LEN))
244 /* Append a NUL-terminated string to the end of the mangled
246 #define write_string(STRING) \
247 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
249 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
250 same purpose (context, which may be a type) and value (template
251 decl). See write_template_prefix for more information on what this
253 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
254 (TREE_CODE (NODE1) == TREE_LIST \
255 && TREE_CODE (NODE2) == TREE_LIST \
256 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
257 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
258 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
259 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
261 /* Write out an unsigned quantity in base 10. */
262 #define write_unsigned_number(NUMBER) \
263 write_number ((NUMBER), /*unsigned_p=*/1, 10)
265 /* If DECL is a template instance, return nonzero and, if
266 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
267 Otherwise return zero. */
270 decl_is_template_id (const tree decl, tree* const template_info)
272 if (TREE_CODE (decl) == TYPE_DECL)
274 /* TYPE_DECLs are handled specially. Look at its type to decide
275 if this is a template instantiation. */
276 const tree type = TREE_TYPE (decl);
278 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
280 if (template_info != NULL)
281 /* For a templated TYPE_DECL, the template info is hanging
283 *template_info = TYPE_TEMPLATE_INFO (type);
289 /* Check if this is a primary template. */
290 if (DECL_LANG_SPECIFIC (decl) != NULL
291 && DECL_USE_TEMPLATE (decl)
292 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
293 && TREE_CODE (decl) != TEMPLATE_DECL)
295 if (template_info != NULL)
296 /* For most templated decls, the template info is hanging
298 *template_info = DECL_TEMPLATE_INFO (decl);
303 /* It's not a template id. */
307 /* Produce debugging output of current substitution candidates. */
310 dump_substitution_candidates (void)
315 fprintf (stderr, " ++ substitutions ");
316 FOR_EACH_VEC_ELT (*G.substitutions, i, el)
318 const char *name = "???";
321 fprintf (stderr, " ");
323 name = IDENTIFIER_POINTER (DECL_NAME (el));
324 else if (TREE_CODE (el) == TREE_LIST)
325 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
326 else if (TYPE_NAME (el))
327 name = TYPE_NAME_STRING (el);
328 fprintf (stderr, " S%d_ = ", i - 1);
330 (CP_TYPE_RESTRICT_P (el)
331 || CP_TYPE_VOLATILE_P (el)
332 || CP_TYPE_CONST_P (el)))
333 fprintf (stderr, "CV-");
334 fprintf (stderr, "%s (%s at %p)\n",
335 name, get_tree_code_name (TREE_CODE (el)), (void *) el);
339 /* Both decls and types can be substitution candidates, but sometimes
340 they refer to the same thing. For instance, a TYPE_DECL and
341 RECORD_TYPE for the same class refer to the same thing, and should
342 be treated accordingly in substitutions. This function returns a
343 canonicalized tree node representing NODE that is used when adding
344 and substitution candidates and finding matches. */
347 canonicalize_for_substitution (tree node)
349 /* For a TYPE_DECL, use the type instead. */
350 if (TREE_CODE (node) == TYPE_DECL)
351 node = TREE_TYPE (node);
353 && TYPE_CANONICAL (node) != node
354 && TYPE_MAIN_VARIANT (node) != node)
357 /* Here we want to strip the topmost typedef only.
358 We need to do that so is_std_substitution can do proper
360 if (TREE_CODE (node) == FUNCTION_TYPE)
361 /* Use build_qualified_type and TYPE_QUALS here to preserve
362 the old buggy mangling of attribute noreturn with abi<5. */
363 node = build_qualified_type (TYPE_MAIN_VARIANT (node),
366 node = cp_build_qualified_type (TYPE_MAIN_VARIANT (node),
367 cp_type_quals (node));
368 if (TREE_CODE (node) == FUNCTION_TYPE
369 || TREE_CODE (node) == METHOD_TYPE)
370 node = build_ref_qualified_type (node, type_memfn_rqual (orig));
375 /* Add NODE as a substitution candidate. NODE must not already be on
376 the list of candidates. */
379 add_substitution (tree node)
384 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
385 get_tree_code_name (TREE_CODE (node)), (void *) node);
387 /* Get the canonicalized substitution candidate for NODE. */
388 c = canonicalize_for_substitution (node);
389 if (DEBUG_MANGLE && c != node)
390 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
391 get_tree_code_name (TREE_CODE (node)), (void *) node);
395 /* Make sure NODE isn't already a candidate. */
400 FOR_EACH_VEC_SAFE_ELT (G.substitutions, i, candidate)
402 gcc_assert (!(DECL_P (node) && node == candidate));
403 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
404 && same_type_p (node, candidate)));
407 #endif /* ENABLE_CHECKING */
409 /* Put the decl onto the varray of substitution candidates. */
410 vec_safe_push (G.substitutions, node);
413 dump_substitution_candidates ();
416 /* Helper function for find_substitution. Returns nonzero if NODE,
417 which may be a decl or a CLASS_TYPE, is a template-id with template
418 name of substitution_index[INDEX] in the ::std namespace. */
421 is_std_substitution (const tree node,
422 const substitution_identifier_index_t index)
429 type = TREE_TYPE (node);
432 else if (CLASS_TYPE_P (node))
435 decl = TYPE_NAME (node);
438 /* These are not the droids you're looking for. */
441 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
442 && TYPE_LANG_SPECIFIC (type)
443 && TYPE_TEMPLATE_INFO (type)
444 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
445 == subst_identifiers[index]));
448 /* Helper function for find_substitution. Returns nonzero if NODE,
449 which may be a decl or a CLASS_TYPE, is the template-id
450 ::std::identifier<char>, where identifier is
451 substitution_index[INDEX]. */
454 is_std_substitution_char (const tree node,
455 const substitution_identifier_index_t index)
458 /* Check NODE's name is ::std::identifier. */
459 if (!is_std_substitution (node, index))
461 /* Figure out its template args. */
463 args = DECL_TI_ARGS (node);
464 else if (CLASS_TYPE_P (node))
465 args = CLASSTYPE_TI_ARGS (node);
467 /* Oops, not a template. */
469 /* NODE's template arg list should be <char>. */
471 TREE_VEC_LENGTH (args) == 1
472 && TREE_VEC_ELT (args, 0) == char_type_node;
475 /* Check whether a substitution should be used to represent NODE in
478 First, check standard special-case substitutions.
480 <substitution> ::= St
487 # ::std::basic_string
490 # ::std::basic_string<char,
491 ::std::char_traits<char>,
492 ::std::allocator<char> >
495 # ::std::basic_istream<char, ::std::char_traits<char> >
498 # ::std::basic_ostream<char, ::std::char_traits<char> >
501 # ::std::basic_iostream<char, ::std::char_traits<char> >
503 Then examine the stack of currently available substitution
504 candidates for entities appearing earlier in the same mangling
506 If a substitution is found, write its mangled representation and
507 return nonzero. If none is found, just return zero. */
510 find_substitution (tree node)
513 const int size = vec_safe_length (G.substitutions);
518 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
519 get_tree_code_name (TREE_CODE (node)), (void *) node);
521 /* Obtain the canonicalized substitution representation for NODE.
522 This is what we'll compare against. */
523 node = canonicalize_for_substitution (node);
525 /* Check for builtin substitutions. */
527 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
528 type = TYPE_P (node) ? node : TREE_TYPE (node);
530 /* Check for std::allocator. */
532 && is_std_substitution (decl, SUBID_ALLOCATOR)
533 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
539 /* Check for std::basic_string. */
540 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
544 /* If this is a type (i.e. a fully-qualified template-id),
546 std::basic_string <char,
547 std::char_traits<char>,
548 std::allocator<char> > . */
549 if (cp_type_quals (type) == TYPE_UNQUALIFIED
550 && CLASSTYPE_USE_TEMPLATE (type))
552 tree args = CLASSTYPE_TI_ARGS (type);
553 if (TREE_VEC_LENGTH (args) == 3
554 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
555 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
557 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
566 /* Substitute for the template name only if this isn't a type. */
573 /* Check for basic_{i,o,io}stream. */
575 && cp_type_quals (type) == TYPE_UNQUALIFIED
576 && CLASS_TYPE_P (type)
577 && CLASSTYPE_USE_TEMPLATE (type)
578 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
580 /* First, check for the template
581 args <char, std::char_traits<char> > . */
582 tree args = CLASSTYPE_TI_ARGS (type);
583 if (TREE_VEC_LENGTH (args) == 2
584 && TYPE_P (TREE_VEC_ELT (args, 0))
585 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
586 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
589 /* Got them. Is this basic_istream? */
590 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
595 /* Or basic_ostream? */
596 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
601 /* Or basic_iostream? */
602 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
610 /* Check for namespace std. */
611 if (decl && DECL_NAMESPACE_STD_P (decl))
617 /* Now check the list of available substitutions for this mangling
619 for (i = 0; i < size; ++i)
621 tree candidate = (*G.substitutions)[i];
622 /* NODE is a matched to a candidate if it's the same decl node or
623 if it's the same type. */
624 if (decl == candidate
625 || (TYPE_P (candidate) && type && TYPE_P (node)
626 && same_type_p (type, candidate))
627 || NESTED_TEMPLATE_MATCH (node, candidate))
629 write_substitution (i);
634 /* No substitution found. */
639 /* TOP_LEVEL is true, if this is being called at outermost level of
640 mangling. It should be false when mangling a decl appearing in an
641 expression within some other mangling.
643 <mangled-name> ::= _Z <encoding> */
646 write_mangled_name (const tree decl, bool top_level)
648 MANGLE_TRACE_TREE ("mangled-name", decl);
650 if (/* The names of `extern "C"' functions are not mangled. */
651 DECL_EXTERN_C_FUNCTION_P (decl)
652 /* But overloaded operator names *are* mangled. */
653 && !DECL_OVERLOADED_OPERATOR_P (decl))
658 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
661 /* The standard notes: "The <encoding> of an extern "C"
662 function is treated like global-scope data, i.e. as its
663 <source-name> without a type." We cannot write
664 overloaded operators that way though, because it contains
665 characters invalid in assembler. */
666 if (abi_version_at_least (2))
669 G.need_abi_warning = true;
670 write_source_name (DECL_NAME (decl));
673 else if (VAR_P (decl)
674 /* The names of non-static global variables aren't mangled. */
675 && DECL_EXTERNAL_LINKAGE_P (decl)
676 && (CP_DECL_CONTEXT (decl) == global_namespace
677 /* And neither are `extern "C"' variables. */
678 || DECL_EXTERN_C_P (decl)))
680 if (top_level || abi_version_at_least (2))
684 G.need_abi_warning = true;
692 write_encoding (decl);
696 /* <encoding> ::= <function name> <bare-function-type>
700 write_encoding (const tree decl)
702 MANGLE_TRACE_TREE ("encoding", decl);
704 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
706 /* For overloaded operators write just the mangled name
707 without arguments. */
708 if (DECL_OVERLOADED_OPERATOR_P (decl))
709 write_name (decl, /*ignore_local_scope=*/0);
711 write_source_name (DECL_NAME (decl));
715 write_name (decl, /*ignore_local_scope=*/0);
716 if (TREE_CODE (decl) == FUNCTION_DECL)
721 if (decl_is_template_id (decl, NULL))
723 fn_type = get_mostly_instantiated_function_type (decl);
724 /* FN_TYPE will not have parameter types for in-charge or
725 VTT parameters. Therefore, we pass NULL_TREE to
726 write_bare_function_type -- otherwise, it will get
727 confused about which artificial parameters to skip. */
732 fn_type = TREE_TYPE (decl);
736 write_bare_function_type (fn_type,
737 (!DECL_CONSTRUCTOR_P (decl)
738 && !DECL_DESTRUCTOR_P (decl)
739 && !DECL_CONV_FN_P (decl)
740 && decl_is_template_id (decl, NULL)),
745 /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
746 or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
749 decl_mangling_context (tree decl)
751 tree tcontext = targetm.cxx.decl_mangling_context (decl);
753 if (tcontext != NULL_TREE)
756 if (TREE_CODE (decl) == TYPE_DECL
757 && LAMBDA_TYPE_P (TREE_TYPE (decl)))
759 tree extra = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl));
763 else if (TREE_CODE (decl) == TYPE_DECL
764 && TREE_CODE (TREE_TYPE (decl)) == TEMPLATE_TYPE_PARM)
765 /* template type parms have no mangling context. */
767 return CP_DECL_CONTEXT (decl);
770 /* <name> ::= <unscoped-name>
771 ::= <unscoped-template-name> <template-args>
775 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
776 called from <local-name>, which mangles the enclosing scope
777 elsewhere and then uses this function to mangle just the part
778 underneath the function scope. So don't use the <local-name>
779 production, to avoid an infinite recursion. */
782 write_name (tree decl, const int ignore_local_scope)
786 MANGLE_TRACE_TREE ("name", decl);
788 if (TREE_CODE (decl) == TYPE_DECL)
790 /* In case this is a typedef, fish out the corresponding
791 TYPE_DECL for the main variant. */
792 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
795 context = decl_mangling_context (decl);
797 gcc_assert (context != NULL_TREE);
799 /* A decl in :: or ::std scope is treated specially. The former is
800 mangled using <unscoped-name> or <unscoped-template-name>, the
801 latter with a special substitution. Also, a name that is
802 directly in a local function scope is also mangled with
803 <unscoped-name> rather than a full <nested-name>. */
804 if (context == global_namespace
805 || DECL_NAMESPACE_STD_P (context)
806 || (ignore_local_scope
807 && (TREE_CODE (context) == FUNCTION_DECL
808 || (abi_version_at_least (7)
809 && TREE_CODE (context) == PARM_DECL))))
812 /* Is this a template instance? */
813 if (decl_is_template_id (decl, &template_info))
815 /* Yes: use <unscoped-template-name>. */
816 write_unscoped_template_name (TI_TEMPLATE (template_info));
817 write_template_args (TI_ARGS (template_info));
820 /* Everything else gets an <unqualified-name>. */
821 write_unscoped_name (decl);
825 /* Handle local names, unless we asked not to (that is, invoked
826 under <local-name>, to handle only the part of the name under
828 if (!ignore_local_scope)
830 /* Scan up the list of scope context, looking for a
831 function. If we find one, this entity is in local
832 function scope. local_entity tracks context one scope
833 level down, so it will contain the element that's
834 directly in that function's scope, either decl or one of
835 its enclosing scopes. */
836 tree local_entity = decl;
837 while (context != global_namespace)
839 /* Make sure we're always dealing with decls. */
840 if (TYPE_P (context))
841 context = TYPE_NAME (context);
842 /* Is this a function? */
843 if (TREE_CODE (context) == FUNCTION_DECL
844 || TREE_CODE (context) == PARM_DECL)
846 /* Yes, we have local scope. Use the <local-name>
847 production for the innermost function scope. */
848 write_local_name (context, local_entity, decl);
851 /* Up one scope level. */
852 local_entity = context;
853 context = decl_mangling_context (context);
856 /* No local scope found? Fall through to <nested-name>. */
859 /* Other decls get a <nested-name> to encode their scope. */
860 write_nested_name (decl);
864 /* <unscoped-name> ::= <unqualified-name>
865 ::= St <unqualified-name> # ::std:: */
868 write_unscoped_name (const tree decl)
870 tree context = decl_mangling_context (decl);
872 MANGLE_TRACE_TREE ("unscoped-name", decl);
874 /* Is DECL in ::std? */
875 if (DECL_NAMESPACE_STD_P (context))
878 write_unqualified_name (decl);
882 /* If not, it should be either in the global namespace, or directly
883 in a local function scope. A lambda can also be mangled in the
884 scope of a default argument. */
885 gcc_assert (context == global_namespace
886 || TREE_CODE (context) == PARM_DECL
887 || TREE_CODE (context) == FUNCTION_DECL);
889 write_unqualified_name (decl);
893 /* <unscoped-template-name> ::= <unscoped-name>
894 ::= <substitution> */
897 write_unscoped_template_name (const tree decl)
899 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
901 if (find_substitution (decl))
903 write_unscoped_name (decl);
904 add_substitution (decl);
907 /* Write the nested name, including CV-qualifiers, of DECL.
909 <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
910 ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
912 <ref-qualifier> ::= R # & ref-qualifier
913 ::= O # && ref-qualifier
914 <CV-qualifiers> ::= [r] [V] [K] */
917 write_nested_name (const tree decl)
921 MANGLE_TRACE_TREE ("nested-name", decl);
925 /* Write CV-qualifiers, if this is a member function. */
926 if (TREE_CODE (decl) == FUNCTION_DECL
927 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
929 if (DECL_VOLATILE_MEMFUNC_P (decl))
931 if (DECL_CONST_MEMFUNC_P (decl))
933 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl)))
935 if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl)))
942 /* Is this a template instance? */
943 if (decl_is_template_id (decl, &template_info))
945 /* Yes, use <template-prefix>. */
946 write_template_prefix (decl);
947 write_template_args (TI_ARGS (template_info));
949 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
951 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
952 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
954 write_template_prefix (decl);
955 write_template_args (TREE_OPERAND (name, 1));
959 write_prefix (decl_mangling_context (decl));
960 write_unqualified_name (decl);
965 /* No, just use <prefix> */
966 write_prefix (decl_mangling_context (decl));
967 write_unqualified_name (decl);
972 /* <prefix> ::= <prefix> <unqualified-name>
974 ::= <template-prefix> <template-args>
977 ::= <substitution> */
980 write_prefix (const tree node)
983 /* Non-NULL if NODE represents a template-id. */
984 tree template_info = NULL;
987 || node == global_namespace)
990 MANGLE_TRACE_TREE ("prefix", node);
992 if (TREE_CODE (node) == DECLTYPE_TYPE)
998 if (find_substitution (node))
1003 /* If this is a function or parm decl, that means we've hit function
1004 scope, so this prefix must be for a local name. In this
1005 case, we're under the <local-name> production, which encodes
1006 the enclosing function scope elsewhere. So don't continue
1008 if (TREE_CODE (node) == FUNCTION_DECL
1009 || TREE_CODE (node) == PARM_DECL)
1013 decl_is_template_id (decl, &template_info);
1017 /* Node is a type. */
1018 decl = TYPE_NAME (node);
1019 if (CLASSTYPE_TEMPLATE_ID_P (node))
1020 template_info = TYPE_TEMPLATE_INFO (node);
1023 /* In G++ 3.2, the name of the template parameter was used. */
1024 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
1025 && !abi_version_at_least (2))
1026 G.need_abi_warning = true;
1028 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
1029 && abi_version_at_least (2))
1030 write_template_param (node);
1031 else if (template_info != NULL)
1034 write_template_prefix (decl);
1035 write_template_args (TI_ARGS (template_info));
1037 else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1039 tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1040 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1042 write_template_prefix (decl);
1043 write_template_args (TREE_OPERAND (name, 1));
1047 write_prefix (decl_mangling_context (decl));
1048 write_unqualified_name (decl);
1052 /* Not templated. */
1054 write_prefix (decl_mangling_context (decl));
1055 write_unqualified_name (decl);
1057 || TREE_CODE (decl) == FIELD_DECL)
1059 /* <data-member-prefix> := <member source-name> M */
1065 add_substitution (node);
1068 /* <template-prefix> ::= <prefix> <template component>
1069 ::= <template-param>
1070 ::= <substitution> */
1073 write_template_prefix (const tree node)
1075 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1076 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1077 tree context = decl_mangling_context (decl);
1082 MANGLE_TRACE_TREE ("template-prefix", node);
1084 /* Find the template decl. */
1085 if (decl_is_template_id (decl, &template_info))
1086 templ = TI_TEMPLATE (template_info);
1087 else if (TREE_CODE (type) == TYPENAME_TYPE)
1088 /* For a typename type, all we have is the name. */
1089 templ = DECL_NAME (decl);
1092 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
1094 templ = TYPE_TI_TEMPLATE (type);
1097 /* For a member template, though, the template name for the
1098 innermost name must have all the outer template levels
1099 instantiated. For instance, consider
1101 template<typename T> struct Outer {
1102 template<typename U> struct Inner {};
1105 The template name for `Inner' in `Outer<int>::Inner<float>' is
1106 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1107 levels separately, so there's no TEMPLATE_DECL available for this
1108 (there's only `Outer<T>::Inner<U>').
1110 In order to get the substitutions right, we create a special
1111 TREE_LIST to represent the substitution candidate for a nested
1112 template. The TREE_PURPOSE is the template's context, fully
1113 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1116 So, for the example above, `Outer<int>::Inner' is represented as a
1117 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1118 and whose value is `Outer<T>::Inner<U>'. */
1119 if (TYPE_P (context))
1120 substitution = build_tree_list (context, templ);
1122 substitution = templ;
1124 if (find_substitution (substitution))
1127 /* In G++ 3.2, the name of the template template parameter was used. */
1128 if (TREE_TYPE (templ)
1129 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1130 && !abi_version_at_least (2))
1131 G.need_abi_warning = true;
1133 if (TREE_TYPE (templ)
1134 && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM
1135 && abi_version_at_least (2))
1136 write_template_param (TREE_TYPE (templ));
1139 write_prefix (context);
1140 write_unqualified_name (decl);
1143 add_substitution (substitution);
1146 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1147 mangled through special entry points.
1149 <unqualified-name> ::= <operator-name>
1152 ::= <unnamed-type-name>
1153 ::= <local-source-name>
1155 <local-source-name> ::= L <source-name> <discriminator> */
1158 write_unqualified_id (tree identifier)
1160 if (IDENTIFIER_TYPENAME_P (identifier))
1161 write_conversion_operator_name (TREE_TYPE (identifier));
1162 else if (IDENTIFIER_OPNAME_P (identifier))
1165 const char *mangled_name = NULL;
1167 /* Unfortunately, there is no easy way to go from the
1168 name of the operator back to the corresponding tree
1170 for (i = 0; i < MAX_TREE_CODES; ++i)
1171 if (operator_name_info[i].identifier == identifier)
1173 /* The ABI says that we prefer binary operator
1174 names to unary operator names. */
1175 if (operator_name_info[i].arity == 2)
1177 mangled_name = operator_name_info[i].mangled_name;
1180 else if (!mangled_name)
1181 mangled_name = operator_name_info[i].mangled_name;
1183 else if (assignment_operator_name_info[i].identifier
1187 = assignment_operator_name_info[i].mangled_name;
1190 write_string (mangled_name);
1192 else if (UDLIT_OPER_P (identifier))
1193 write_literal_operator_name (identifier);
1195 write_source_name (identifier);
1199 write_unqualified_name (tree decl)
1201 MANGLE_TRACE_TREE ("unqualified-name", decl);
1203 if (identifier_p (decl))
1205 write_unqualified_id (decl);
1211 if (DECL_NAME (decl) == NULL_TREE)
1214 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl));
1215 write_source_name (DECL_ASSEMBLER_NAME (decl));
1217 else if (DECL_DECLARES_FUNCTION_P (decl))
1220 if (DECL_CONSTRUCTOR_P (decl))
1221 write_special_name_constructor (decl);
1222 else if (DECL_DESTRUCTOR_P (decl))
1223 write_special_name_destructor (decl);
1224 else if (DECL_CONV_FN_P (decl))
1226 /* Conversion operator. Handle it right here.
1227 <operator> ::= cv <type> */
1229 if (decl_is_template_id (decl, NULL))
1232 fn_type = get_mostly_instantiated_function_type (decl);
1233 type = TREE_TYPE (fn_type);
1235 else if (FNDECL_USED_AUTO (decl))
1236 type = (DECL_STRUCT_FUNCTION (decl)->language
1237 ->x_auto_return_pattern);
1239 type = DECL_CONV_FN_TYPE (decl);
1240 write_conversion_operator_name (type);
1242 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1244 operator_name_info_t *oni;
1245 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1246 oni = assignment_operator_name_info;
1248 oni = operator_name_info;
1250 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1252 else if (UDLIT_OPER_P (DECL_NAME (decl)))
1253 write_literal_operator_name (DECL_NAME (decl));
1260 else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1261 && DECL_NAMESPACE_SCOPE_P (decl)
1262 && decl_linkage (decl) == lk_internal)
1264 MANGLE_TRACE_TREE ("local-source-name", decl);
1266 write_source_name (DECL_NAME (decl));
1267 /* The default discriminator is 1, and that's all we ever use,
1268 so there's no code to output one here. */
1272 tree type = TREE_TYPE (decl);
1274 if (TREE_CODE (decl) == TYPE_DECL
1275 && TYPE_ANONYMOUS_P (type))
1276 write_unnamed_type_name (type);
1277 else if (TREE_CODE (decl) == TYPE_DECL
1278 && LAMBDA_TYPE_P (type))
1279 write_closure_type_name (type);
1281 write_source_name (DECL_NAME (decl));
1284 /* We use the ABI tags from the primary template, ignoring tags on any
1285 specializations. This is necessary because C++ doesn't require a
1286 specialization to be declared before it is used unless the use
1287 requires a complete type, but we need to get the tags right on
1288 incomplete types as well. */
1289 if (tree tmpl = most_general_template (decl))
1290 decl = DECL_TEMPLATE_RESULT (tmpl);
1291 /* Don't crash on an unbound class template. */
1294 tree attrs = (TREE_CODE (decl) == TYPE_DECL
1295 ? TYPE_ATTRIBUTES (TREE_TYPE (decl))
1296 : DECL_ATTRIBUTES (decl));
1297 write_abi_tags (lookup_attribute ("abi_tag", attrs));
1301 /* Write the unqualified-name for a conversion operator to TYPE. */
1304 write_conversion_operator_name (const tree type)
1306 write_string ("cv");
1310 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1312 <source-name> ::= </length/ number> <identifier> */
1315 write_source_name (tree identifier)
1317 MANGLE_TRACE_TREE ("source-name", identifier);
1319 /* Never write the whole template-id name including the template
1320 arguments; we only want the template name. */
1321 if (IDENTIFIER_TEMPLATE (identifier))
1322 identifier = IDENTIFIER_TEMPLATE (identifier);
1324 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1325 write_identifier (IDENTIFIER_POINTER (identifier));
1328 /* Compare two TREE_STRINGs like strcmp. */
1331 tree_string_cmp (const void *p1, const void *p2)
1335 tree s1 = *(const tree*)p1;
1336 tree s2 = *(const tree*)p2;
1337 return strcmp (TREE_STRING_POINTER (s1),
1338 TREE_STRING_POINTER (s2));
1341 /* ID is the name of a function or type with abi_tags attribute TAGS.
1342 Write out the name, suitably decorated. */
1345 write_abi_tags (tree tags)
1347 if (tags == NULL_TREE)
1350 tags = TREE_VALUE (tags);
1352 vec<tree, va_gc> * vec = make_tree_vector();
1354 for (tree t = tags; t; t = TREE_CHAIN (t))
1356 if (ABI_TAG_IMPLICIT (t))
1358 tree str = TREE_VALUE (t);
1359 vec_safe_push (vec, str);
1362 vec->qsort (tree_string_cmp);
1364 unsigned i; tree str;
1365 FOR_EACH_VEC_ELT (*vec, i, str)
1368 write_unsigned_number (TREE_STRING_LENGTH (str) - 1);
1369 write_identifier (TREE_STRING_POINTER (str));
1372 release_tree_vector (vec);
1375 /* Write a user-defined literal operator.
1376 ::= li <source-name> # "" <source-name>
1377 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1380 write_literal_operator_name (tree identifier)
1382 const char* suffix = UDLIT_OP_SUFFIX (identifier);
1383 write_identifier (UDLIT_OP_MANGLED_PREFIX);
1384 write_unsigned_number (strlen (suffix));
1385 write_identifier (suffix);
1388 /* Encode 0 as _, and 1+ as n-1_. */
1391 write_compact_number (int num)
1394 write_unsigned_number (num - 1);
1398 /* Return how many unnamed types precede TYPE in its enclosing class. */
1401 nested_anon_class_index (tree type)
1404 tree member = TYPE_FIELDS (TYPE_CONTEXT (type));
1405 for (; member; member = DECL_CHAIN (member))
1406 if (DECL_IMPLICIT_TYPEDEF_P (member))
1408 tree memtype = TREE_TYPE (member);
1409 if (memtype == type)
1411 else if (TYPE_ANONYMOUS_P (memtype))
1418 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1421 write_unnamed_type_name (const tree type)
1424 MANGLE_TRACE_TREE ("unnamed-type-name", type);
1426 if (TYPE_FUNCTION_SCOPE_P (type))
1427 discriminator = local_class_index (type);
1428 else if (TYPE_CLASS_SCOPE_P (type))
1429 discriminator = nested_anon_class_index (type);
1432 gcc_assert (no_linkage_check (type, /*relaxed_p=*/true));
1433 /* Just use the old mangling at namespace scope. */
1434 write_source_name (TYPE_IDENTIFIER (type));
1438 write_string ("Ut");
1439 write_compact_number (discriminator);
1442 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1443 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1446 write_closure_type_name (const tree type)
1448 tree fn = lambda_function (type);
1449 tree lambda = CLASSTYPE_LAMBDA_EXPR (type);
1450 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
1452 MANGLE_TRACE_TREE ("closure-type-name", type);
1454 write_string ("Ul");
1455 write_method_parms (parms, /*method_p=*/1, fn);
1457 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda));
1460 /* Convert NUMBER to ascii using base BASE and generating at least
1461 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1462 into which to store the characters. Returns the number of
1463 characters generated (these will be laid out in advance of where
1467 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1468 char *buffer, const unsigned int min_digits)
1470 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1471 unsigned digits = 0;
1475 unsigned HOST_WIDE_INT d = number / base;
1477 *--buffer = base_digits[number - d * base];
1481 while (digits < min_digits)
1483 *--buffer = base_digits[0];
1489 /* Non-terminal <number>.
1491 <number> ::= [n] </decimal integer/> */
1494 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1495 const unsigned int base)
1497 char buffer[sizeof (HOST_WIDE_INT) * 8];
1500 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1503 number = -((HOST_WIDE_INT) number);
1505 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1506 write_chars (buffer + sizeof (buffer) - count, count);
1509 /* Write out an integral CST in decimal. Most numbers are small, and
1510 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1511 bigger than that, which we must deal with. */
1514 write_integer_cst (const tree cst)
1516 int sign = tree_int_cst_sgn (cst);
1517 widest_int abs_value = wi::abs (wi::to_widest (cst));
1518 if (!wi::fits_uhwi_p (abs_value))
1520 /* A bignum. We do this in chunks, each of which fits in a
1522 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1523 unsigned HOST_WIDE_INT chunk;
1524 unsigned chunk_digits;
1525 char *ptr = buffer + sizeof (buffer);
1530 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1535 if (sizeof (HOST_WIDE_INT) >= 8)
1537 /* It is at least 64 bits, so 10^18 is representable. */
1542 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1543 base = build_int_cstu (type, chunk);
1544 n = wide_int_to_tree (type, cst);
1549 n = fold_build1_loc (input_location, NEGATE_EXPR, type, n);
1553 tree d = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, n, base);
1554 tree tmp = fold_build2_loc (input_location, MULT_EXPR, type, d, base);
1557 done = integer_zerop (d);
1558 tmp = fold_build2_loc (input_location, MINUS_EXPR, type, n, tmp);
1559 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1560 done ? 1 : chunk_digits);
1566 write_chars (ptr, count);
1573 write_unsigned_number (abs_value.to_uhwi ());
1577 /* Write out a floating-point literal.
1579 "Floating-point literals are encoded using the bit pattern of the
1580 target processor's internal representation of that number, as a
1581 fixed-length lowercase hexadecimal string, high-order bytes first
1582 (even if the target processor would store low-order bytes first).
1583 The "n" prefix is not used for floating-point literals; the sign
1584 bit is encoded with the rest of the number.
1586 Here are some examples, assuming the IEEE standard representation
1587 for floating point numbers. (Spaces are for readability, not
1588 part of the encoding.)
1591 -1.0f Lf bf80 0000 E
1592 1.17549435e-38f Lf 0080 0000 E
1593 1.40129846e-45f Lf 0000 0001 E
1594 0.0f Lf 0000 0000 E"
1596 Caller is responsible for the Lx and the E. */
1598 write_real_cst (const tree value)
1600 if (abi_version_at_least (2))
1602 long target_real[4]; /* largest supported float */
1603 char buffer[9]; /* eight hex digits in a 32-bit number */
1606 tree type = TREE_TYPE (value);
1607 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1609 real_to_target (target_real, &TREE_REAL_CST (value),
1612 /* The value in target_real is in the target word order,
1613 so we must write it out backward if that happens to be
1614 little-endian. write_number cannot be used, it will
1615 produce uppercase. */
1616 if (FLOAT_WORDS_BIG_ENDIAN)
1617 i = 0, limit = words, dir = 1;
1619 i = words - 1, limit = -1, dir = -1;
1621 for (; i != limit; i += dir)
1623 sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
1624 write_chars (buffer, 8);
1629 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1630 literally. Note that compatibility with 3.2 is impossible,
1631 because the old floating-point emulator used a different
1632 format for REAL_VALUE_TYPE. */
1634 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1635 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1638 G.need_abi_warning = 1;
1642 /* Non-terminal <identifier>.
1644 <identifier> ::= </unqualified source code identifier> */
1647 write_identifier (const char *identifier)
1649 MANGLE_TRACE ("identifier", identifier);
1650 write_string (identifier);
1653 /* Handle constructor productions of non-terminal <special-name>.
1654 CTOR is a constructor FUNCTION_DECL.
1656 <special-name> ::= C1 # complete object constructor
1657 ::= C2 # base object constructor
1658 ::= C3 # complete object allocating constructor
1660 Currently, allocating constructors are never used. */
1663 write_special_name_constructor (const tree ctor)
1665 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1666 write_string ("C2");
1667 /* This is the old-style "[unified]" constructor.
1668 In some cases, we may emit this function and call
1669 it from the clones in order to share code and save space. */
1670 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
1671 write_string ("C4");
1674 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor));
1675 write_string ("C1");
1679 /* Handle destructor productions of non-terminal <special-name>.
1680 DTOR is a destructor FUNCTION_DECL.
1682 <special-name> ::= D0 # deleting (in-charge) destructor
1683 ::= D1 # complete object (in-charge) destructor
1684 ::= D2 # base object (not-in-charge) destructor */
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");
1693 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
1694 /* This is the old-style "[unified]" destructor.
1695 In some cases, we may emit this function and call
1696 it from the clones in order to share code and save space. */
1697 write_string ("D4");
1700 gcc_assert (DECL_COMPLETE_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)
1901 t = build_ref_qualified_type (t, type_memfn_rqual (type));
1902 if (abi_version_at_least (8))
1903 /* Avoid adding the unqualified function type as a substitution. */
1904 write_function_type (t);
1911 else if (TREE_CODE (type) == ARRAY_TYPE)
1912 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1913 so that the cv-qualification of the element type is available
1914 in write_array_type. */
1915 write_array_type (type);
1918 tree type_orig = type;
1920 /* See through any typedefs. */
1921 type = TYPE_MAIN_VARIANT (type);
1922 if (TREE_CODE (type) == FUNCTION_TYPE
1923 || TREE_CODE (type) == METHOD_TYPE)
1924 type = build_ref_qualified_type (type, type_memfn_rqual (type_orig));
1926 /* According to the C++ ABI, some library classes are passed the
1927 same as the scalar type of their single member and use the same
1929 if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
1930 type = TREE_TYPE (first_field (type));
1932 if (TYPE_PTRDATAMEM_P (type))
1933 write_pointer_to_member_type (type);
1936 /* Handle any target-specific fundamental types. */
1937 const char *target_mangling
1938 = targetm.mangle_type (type_orig);
1940 if (target_mangling)
1942 write_string (target_mangling);
1943 /* Add substitutions for types other than fundamental
1945 if (!VOID_TYPE_P (type)
1946 && TREE_CODE (type) != INTEGER_TYPE
1947 && TREE_CODE (type) != REAL_TYPE
1948 && TREE_CODE (type) != BOOLEAN_TYPE)
1949 add_substitution (type);
1953 switch (TREE_CODE (type))
1957 case INTEGER_TYPE: /* Includes wchar_t. */
1959 case FIXED_POINT_TYPE:
1961 /* If this is a typedef, TYPE may not be one of
1962 the standard builtin type nodes, but an alias of one. Use
1963 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1964 write_builtin_type (TYPE_MAIN_VARIANT (type));
1971 write_type (TREE_TYPE (type));
1976 write_function_type (type);
1982 /* A pointer-to-member function is represented as a special
1983 RECORD_TYPE, so check for this first. */
1984 if (TYPE_PTRMEMFUNC_P (type))
1985 write_pointer_to_member_type (type);
1987 write_class_enum_type (type);
1991 case UNBOUND_CLASS_TEMPLATE:
1992 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1993 ordinary nested names. */
1994 write_nested_name (TYPE_STUB_DECL (type));
1998 case REFERENCE_TYPE:
1999 if (TYPE_PTR_P (type))
2001 else if (TYPE_REF_IS_RVALUE (type))
2006 tree target = TREE_TYPE (type);
2007 /* Attribute const/noreturn are not reflected in mangling.
2008 We strip them here rather than at a lower level because
2009 a typedef or template argument can have function type
2010 with function-cv-quals (that use the same representation),
2011 but you can't have a pointer/reference to such a type. */
2012 if (abi_version_at_least (5)
2013 && TREE_CODE (target) == FUNCTION_TYPE)
2014 target = build_qualified_type (target, TYPE_UNQUALIFIED);
2015 write_type (target);
2019 case TEMPLATE_TYPE_PARM:
2022 if (AUTO_IS_DECLTYPE (type))
2023 write_identifier ("Dc");
2025 write_identifier ("Da");
2029 /* else fall through. */
2030 case TEMPLATE_PARM_INDEX:
2031 write_template_param (type);
2034 case TEMPLATE_TEMPLATE_PARM:
2035 write_template_template_param (type);
2038 case BOUND_TEMPLATE_TEMPLATE_PARM:
2039 write_template_template_param (type);
2041 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
2045 if (abi_version_at_least (4))
2047 write_string ("Dv");
2048 /* Non-constant vector size would be encoded with
2049 _ expression, but we don't support that yet. */
2050 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type));
2055 G.need_abi_warning = 1;
2056 write_string ("U8__vector");
2058 write_type (TREE_TYPE (type));
2061 case TYPE_PACK_EXPANSION:
2062 write_string ("Dp");
2063 write_type (PACK_EXPANSION_PATTERN (type));
2067 /* These shouldn't make it into mangling. */
2068 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type)
2069 && !DECLTYPE_FOR_LAMBDA_PROXY (type));
2071 /* In ABI <5, we stripped decltype of a plain decl. */
2072 if (!abi_version_at_least (5)
2073 && DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
2075 tree expr = DECLTYPE_TYPE_EXPR (type);
2076 tree etype = NULL_TREE;
2077 switch (TREE_CODE (expr))
2084 case TEMPLATE_PARM_INDEX:
2085 etype = TREE_TYPE (expr);
2092 if (etype && !type_uses_auto (etype))
2094 G.need_abi_warning = 1;
2101 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
2105 ++cp_unevaluated_operand;
2106 write_expression (DECLTYPE_TYPE_EXPR (type));
2107 --cp_unevaluated_operand;
2112 write_string ("Dn");
2113 if (abi_version_at_least (7))
2118 sorry ("mangling typeof, use decltype instead");
2121 case UNDERLYING_TYPE:
2122 sorry ("mangling __underlying_type");
2134 /* Types other than builtin types are substitution candidates. */
2135 if (!is_builtin_type)
2136 add_substitution (type);
2139 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2140 CV-qualifiers written for TYPE.
2142 <CV-qualifiers> ::= [r] [V] [K] */
2145 write_CV_qualifiers_for_type (const tree type)
2147 int num_qualifiers = 0;
2149 /* The order is specified by:
2151 "In cases where multiple order-insensitive qualifiers are
2152 present, they should be ordered 'K' (closest to the base type),
2153 'V', 'r', and 'U' (farthest from the base type) ..."
2155 Note that we do not use cp_type_quals below; given "const
2156 int[3]", the "const" is emitted with the "int", not with the
2158 cp_cv_quals quals = TYPE_QUALS (type);
2160 if (quals & TYPE_QUAL_RESTRICT)
2165 if (quals & TYPE_QUAL_VOLATILE)
2170 if (quals & TYPE_QUAL_CONST)
2176 return num_qualifiers;
2179 /* Non-terminal <builtin-type>.
2181 <builtin-type> ::= v # void
2186 ::= h # unsigned char
2188 ::= t # unsigned short
2190 ::= j # unsigned int
2192 ::= m # unsigned long
2193 ::= x # long long, __int64
2194 ::= y # unsigned long long, __int64
2196 ::= o # unsigned __int128
2199 ::= e # long double, __float80
2200 ::= g # __float128 [not supported]
2201 ::= u <source-name> # vendor extended type */
2204 write_builtin_type (tree type)
2206 if (TYPE_CANONICAL (type))
2207 type = TYPE_CANONICAL (type);
2209 switch (TREE_CODE (type))
2220 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2221 isn't in integer_type_nodes. */
2222 if (type == wchar_type_node)
2224 else if (type == char16_type_node)
2225 write_string ("Ds");
2226 else if (type == char32_type_node)
2227 write_string ("Di");
2228 else if (TYPE_FOR_JAVA (type))
2229 write_java_integer_type_codes (type);
2233 /* Assume TYPE is one of the shared integer type nodes. Find
2234 it in the array of these nodes. */
2236 for (itk = 0; itk < itk_none; ++itk)
2237 if (integer_types[itk] != NULL_TREE
2238 && type == integer_types[itk])
2240 /* Print the corresponding single-letter code. */
2241 write_char (integer_type_codes[itk]);
2245 if (itk == itk_none)
2247 tree t = c_common_type_for_mode (TYPE_MODE (type),
2248 TYPE_UNSIGNED (type));
2255 if (TYPE_PRECISION (type) == 128)
2256 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
2259 /* Allow for cases where TYPE is not one of the shared
2260 integer type nodes and write a "vendor extended builtin
2261 type" with a name the form intN or uintN, respectively.
2262 Situations like this can happen if you have an
2263 __attribute__((__mode__(__SI__))) type and use exotic
2264 switches like '-mint8' on AVR. Of course, this is
2265 undefined by the C++ ABI (and '-mint8' is not even
2266 Standard C conforming), but when using such special
2267 options you're pretty much in nowhere land anyway. */
2269 char prec[11]; /* up to ten digits for an unsigned */
2271 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
2272 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
2273 write_char ('u'); /* "vendor extended builtin type" */
2274 write_unsigned_number (strlen (prefix) + strlen (prec));
2275 write_string (prefix);
2276 write_string (prec);
2283 if (type == float_type_node
2284 || type == java_float_type_node)
2286 else if (type == double_type_node
2287 || type == java_double_type_node)
2289 else if (type == long_double_type_node)
2291 else if (type == dfloat32_type_node)
2292 write_string ("Df");
2293 else if (type == dfloat64_type_node)
2294 write_string ("Dd");
2295 else if (type == dfloat128_type_node)
2296 write_string ("De");
2301 case FIXED_POINT_TYPE:
2302 write_string ("DF");
2303 if (GET_MODE_IBIT (TYPE_MODE (type)) > 0)
2304 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type)));
2305 if (type == fract_type_node
2306 || type == sat_fract_type_node
2307 || type == accum_type_node
2308 || type == sat_accum_type_node)
2310 else if (type == unsigned_fract_type_node
2311 || type == sat_unsigned_fract_type_node
2312 || type == unsigned_accum_type_node
2313 || type == sat_unsigned_accum_type_node)
2315 else if (type == short_fract_type_node
2316 || type == sat_short_fract_type_node
2317 || type == short_accum_type_node
2318 || type == sat_short_accum_type_node)
2320 else if (type == unsigned_short_fract_type_node
2321 || type == sat_unsigned_short_fract_type_node
2322 || type == unsigned_short_accum_type_node
2323 || type == sat_unsigned_short_accum_type_node)
2325 else if (type == long_fract_type_node
2326 || type == sat_long_fract_type_node
2327 || type == long_accum_type_node
2328 || type == sat_long_accum_type_node)
2330 else if (type == unsigned_long_fract_type_node
2331 || type == sat_unsigned_long_fract_type_node
2332 || type == unsigned_long_accum_type_node
2333 || type == sat_unsigned_long_accum_type_node)
2335 else if (type == long_long_fract_type_node
2336 || type == sat_long_long_fract_type_node
2337 || type == long_long_accum_type_node
2338 || type == sat_long_long_accum_type_node)
2340 else if (type == unsigned_long_long_fract_type_node
2341 || type == sat_unsigned_long_long_fract_type_node
2342 || type == unsigned_long_long_accum_type_node
2343 || type == sat_unsigned_long_long_accum_type_node)
2346 sorry ("mangling unknown fixed point type");
2347 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type)));
2348 if (TYPE_SATURATING (type))
2359 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2360 METHOD_TYPE. The return type is mangled before the parameter
2363 <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
2366 write_function_type (const tree type)
2368 MANGLE_TRACE_TREE ("function-type", type);
2370 /* For a pointer to member function, the function type may have
2371 cv-qualifiers, indicating the quals for the artificial 'this'
2373 if (TREE_CODE (type) == METHOD_TYPE)
2375 /* The first parameter must be a POINTER_TYPE pointing to the
2376 `this' parameter. */
2377 tree this_type = class_of_this_parm (type);
2378 write_CV_qualifiers_for_type (this_type);
2382 /* We don't track whether or not a type is `extern "C"'. Note that
2383 you can have an `extern "C"' function that does not have
2384 `extern "C"' type, and vice versa:
2386 extern "C" typedef void function_t();
2387 function_t f; // f has C++ linkage, but its type is
2390 typedef void function_t();
2391 extern "C" function_t f; // Vice versa.
2394 write_bare_function_type (type, /*include_return_type_p=*/1,
2396 if (FUNCTION_REF_QUALIFIED (type))
2398 if (FUNCTION_RVALUE_QUALIFIED (type))
2406 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2407 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2408 is mangled before the parameter types. If non-NULL, DECL is
2409 FUNCTION_DECL for the function whose type is being emitted.
2411 If DECL is a member of a Java type, then a literal 'J'
2412 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2415 <bare-function-type> ::= [J]</signature/ type>+ */
2418 write_bare_function_type (const tree type, const int include_return_type_p,
2423 MANGLE_TRACE_TREE ("bare-function-type", type);
2425 /* Detect Java methods and emit special encoding. */
2427 && DECL_FUNCTION_MEMBER_P (decl)
2428 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
2429 && !DECL_CONSTRUCTOR_P (decl)
2430 && !DECL_DESTRUCTOR_P (decl)
2431 && !DECL_CONV_FN_P (decl))
2441 /* Mangle the return type, if requested. */
2442 if (include_return_type_p || java_method_p)
2443 write_type (TREE_TYPE (type));
2445 /* Now mangle the types of the arguments. */
2447 write_method_parms (TYPE_ARG_TYPES (type),
2448 TREE_CODE (type) == METHOD_TYPE,
2453 /* Write the mangled representation of a method parameter list of
2454 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2455 considered a non-static method, and the this parameter is omitted.
2456 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2457 parameters are being emitted. */
2460 write_method_parms (tree parm_types, const int method_p, const tree decl)
2462 tree first_parm_type;
2463 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
2465 /* Assume this parameter type list is variable-length. If it ends
2466 with a void type, then it's not. */
2469 /* If this is a member function, skip the first arg, which is the
2471 "Member functions do not encode the type of their implicit this
2474 Similarly, there's no need to mangle artificial parameters, like
2475 the VTT parameters for constructors and destructors. */
2478 parm_types = TREE_CHAIN (parm_types);
2479 parm_decl = parm_decl ? DECL_CHAIN (parm_decl) : NULL_TREE;
2481 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
2483 parm_types = TREE_CHAIN (parm_types);
2484 parm_decl = DECL_CHAIN (parm_decl);
2488 for (first_parm_type = parm_types;
2490 parm_types = TREE_CHAIN (parm_types))
2492 tree parm = TREE_VALUE (parm_types);
2493 if (parm == void_type_node)
2495 /* "Empty parameter lists, whether declared as () or
2496 conventionally as (void), are encoded with a void parameter
2498 if (parm_types == first_parm_type)
2500 /* If the parm list is terminated with a void type, it's
2503 /* A void type better be the last one. */
2504 gcc_assert (TREE_CHAIN (parm_types) == NULL);
2511 /* <builtin-type> ::= z # ellipsis */
2515 /* <class-enum-type> ::= <name> */
2518 write_class_enum_type (const tree type)
2520 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
2523 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2526 <template-args> ::= I <template-arg>* E */
2529 write_template_args (tree args)
2534 MANGLE_TRACE_TREE ("template-args", args);
2539 length = TREE_VEC_LENGTH (args);
2541 if (args && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
2543 /* We have nested template args. We want the innermost template
2545 args = TREE_VEC_ELT (args, length - 1);
2546 length = TREE_VEC_LENGTH (args);
2548 for (i = 0; i < length; ++i)
2549 write_template_arg (TREE_VEC_ELT (args, i));
2556 <unqualified-name> <template-args>
2557 part of SCOPE_REF or COMPONENT_REF mangling. */
2560 write_member_name (tree member)
2562 if (identifier_p (member))
2563 write_unqualified_id (member);
2564 else if (DECL_P (member))
2565 write_unqualified_name (member);
2566 else if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2568 tree name = TREE_OPERAND (member, 0);
2569 if (TREE_CODE (name) == OVERLOAD)
2570 name = OVL_FUNCTION (name);
2571 write_member_name (name);
2572 write_template_args (TREE_OPERAND (member, 1));
2575 write_expression (member);
2578 /* <expression> ::= <unary operator-name> <expression>
2579 ::= <binary operator-name> <expression> <expression>
2582 <expr-primary> ::= <template-param>
2583 ::= L <type> <value number> E # literal
2584 ::= L <mangled-name> E # external name
2585 ::= st <type> # sizeof
2586 ::= sr <type> <unqualified-name> # dependent name
2587 ::= sr <type> <unqualified-name> <template-args> */
2590 write_expression (tree expr)
2592 enum tree_code code = TREE_CODE (expr);
2594 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2595 is converted (via qualification conversions) to another
2597 while (TREE_CODE (expr) == NOP_EXPR
2598 /* Parentheses aren't mangled. */
2599 || code == PAREN_EXPR
2600 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2602 expr = TREE_OPERAND (expr, 0);
2603 code = TREE_CODE (expr);
2606 if (code == BASELINK
2607 && (!type_unknown_p (expr)
2608 || !BASELINK_QUALIFIED_P (expr)))
2610 expr = BASELINK_FUNCTIONS (expr);
2611 code = TREE_CODE (expr);
2614 /* Handle pointers-to-members by making them look like expression
2616 if (code == PTRMEM_CST)
2618 expr = build_nt (ADDR_EXPR,
2619 build_qualified_name (/*type=*/NULL_TREE,
2620 PTRMEM_CST_CLASS (expr),
2621 PTRMEM_CST_MEMBER (expr),
2622 /*template_p=*/false));
2623 code = TREE_CODE (expr);
2626 /* Handle template parameters. */
2627 if (code == TEMPLATE_TYPE_PARM
2628 || code == TEMPLATE_TEMPLATE_PARM
2629 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2630 || code == TEMPLATE_PARM_INDEX)
2631 write_template_param (expr);
2632 /* Handle literals. */
2633 else if (TREE_CODE_CLASS (code) == tcc_constant
2634 || (abi_version_at_least (2) && code == CONST_DECL))
2635 write_template_arg_literal (expr);
2636 else if (code == PARM_DECL && DECL_ARTIFICIAL (expr))
2638 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr))));
2639 write_string ("fpT");
2641 else if (code == PARM_DECL)
2643 /* A function parameter used in a late-specified return type. */
2644 int index = DECL_PARM_INDEX (expr);
2645 int level = DECL_PARM_LEVEL (expr);
2646 int delta = G.parm_depth - level + 1;
2647 gcc_assert (index >= 1);
2651 if (abi_version_at_least (5))
2653 /* Let L be the number of function prototype scopes from the
2654 innermost one (in which the parameter reference occurs) up
2655 to (and including) the one containing the declaration of
2656 the referenced parameter. If the parameter declaration
2657 clause of the innermost function prototype scope has been
2658 completely seen, it is not counted (in that case -- which
2659 is perhaps the most common -- L can be zero). */
2661 write_unsigned_number (delta - 1);
2664 G.need_abi_warning = true;
2667 write_compact_number (index - 1);
2669 else if (DECL_P (expr))
2671 /* G++ 3.2 incorrectly mangled non-type template arguments of
2672 enumeration type using their names. */
2673 if (code == CONST_DECL)
2674 G.need_abi_warning = 1;
2676 write_mangled_name (expr, false);
2679 else if (TREE_CODE (expr) == SIZEOF_EXPR
2680 && SIZEOF_EXPR_TYPE_P (expr))
2682 write_string ("st");
2683 write_type (TREE_TYPE (TREE_OPERAND (expr, 0)));
2685 else if (TREE_CODE (expr) == SIZEOF_EXPR
2686 && TYPE_P (TREE_OPERAND (expr, 0)))
2688 write_string ("st");
2689 write_type (TREE_OPERAND (expr, 0));
2691 else if (TREE_CODE (expr) == ALIGNOF_EXPR
2692 && TYPE_P (TREE_OPERAND (expr, 0)))
2694 write_string ("at");
2695 write_type (TREE_OPERAND (expr, 0));
2697 else if (code == SCOPE_REF
2698 || code == BASELINK)
2701 if (code == SCOPE_REF)
2703 scope = TREE_OPERAND (expr, 0);
2704 member = TREE_OPERAND (expr, 1);
2708 scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (expr));
2709 member = BASELINK_FUNCTIONS (expr);
2712 if (!abi_version_at_least (2) && DECL_P (member))
2714 write_string ("sr");
2716 /* G++ 3.2 incorrectly put out both the "sr" code and
2717 the nested name of the qualified name. */
2718 G.need_abi_warning = 1;
2719 write_encoding (member);
2722 /* If the MEMBER is a real declaration, then the qualifying
2723 scope was not dependent. Ideally, we would not have a
2724 SCOPE_REF in those cases, but sometimes we do. If the second
2725 argument is a DECL, then the name must not have been
2727 else if (DECL_P (member))
2728 write_expression (member);
2731 write_string ("sr");
2733 write_member_name (member);
2736 else if (INDIRECT_REF_P (expr)
2737 && TREE_TYPE (TREE_OPERAND (expr, 0))
2738 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2740 write_expression (TREE_OPERAND (expr, 0));
2742 else if (identifier_p (expr))
2744 /* An operator name appearing as a dependent name needs to be
2745 specially marked to disambiguate between a use of the operator
2746 name and a use of the operator in an expression. */
2747 if (IDENTIFIER_OPNAME_P (expr))
2748 write_string ("on");
2749 write_unqualified_id (expr);
2751 else if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
2753 tree fn = TREE_OPERAND (expr, 0);
2754 if (is_overloaded_fn (fn))
2755 fn = DECL_NAME (get_first_fn (fn));
2756 if (IDENTIFIER_OPNAME_P (fn))
2757 write_string ("on");
2758 write_unqualified_id (fn);
2759 write_template_args (TREE_OPERAND (expr, 1));
2761 else if (TREE_CODE (expr) == MODOP_EXPR)
2763 enum tree_code subop = TREE_CODE (TREE_OPERAND (expr, 1));
2764 const char *name = (assignment_operator_name_info[(int) subop]
2766 write_string (name);
2767 write_expression (TREE_OPERAND (expr, 0));
2768 write_expression (TREE_OPERAND (expr, 2));
2770 else if (code == NEW_EXPR || code == VEC_NEW_EXPR)
2772 /* ::= [gs] nw <expression>* _ <type> E
2773 ::= [gs] nw <expression>* _ <type> <initializer>
2774 ::= [gs] na <expression>* _ <type> E
2775 ::= [gs] na <expression>* _ <type> <initializer>
2776 <initializer> ::= pi <expression>* E */
2777 tree placement = TREE_OPERAND (expr, 0);
2778 tree type = TREE_OPERAND (expr, 1);
2779 tree nelts = TREE_OPERAND (expr, 2);
2780 tree init = TREE_OPERAND (expr, 3);
2783 gcc_assert (code == NEW_EXPR);
2784 if (TREE_OPERAND (expr, 2))
2785 code = VEC_NEW_EXPR;
2787 if (NEW_EXPR_USE_GLOBAL (expr))
2788 write_string ("gs");
2790 write_string (operator_name_info[(int) code].mangled_name);
2792 for (t = placement; t; t = TREE_CHAIN (t))
2793 write_expression (TREE_VALUE (t));
2800 ++processing_template_decl;
2801 domain = compute_array_index_type (NULL_TREE, nelts,
2802 tf_warning_or_error);
2803 type = build_cplus_array_type (type, domain);
2804 --processing_template_decl;
2808 if (init && TREE_CODE (init) == TREE_LIST
2809 && TREE_CODE (TREE_VALUE (init)) == CONSTRUCTOR
2810 && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init)))
2811 write_expression (TREE_VALUE (init));
2815 write_string ("pi");
2816 if (init && init != void_zero_node)
2817 for (t = init; t; t = TREE_CHAIN (t))
2818 write_expression (TREE_VALUE (t));
2822 else if (code == DELETE_EXPR || code == VEC_DELETE_EXPR)
2824 gcc_assert (code == DELETE_EXPR);
2825 if (DELETE_EXPR_USE_VEC (expr))
2826 code = VEC_DELETE_EXPR;
2828 if (DELETE_EXPR_USE_GLOBAL (expr))
2829 write_string ("gs");
2831 write_string (operator_name_info[(int) code].mangled_name);
2833 write_expression (TREE_OPERAND (expr, 0));
2835 else if (code == THROW_EXPR)
2837 tree op = TREE_OPERAND (expr, 0);
2840 write_string ("tw");
2841 write_expression (op);
2844 write_string ("tr");
2846 else if (code == CONSTRUCTOR)
2848 vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (expr);
2849 unsigned i; tree val;
2851 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
2852 write_string ("il");
2855 write_string ("tl");
2856 write_type (TREE_TYPE (expr));
2858 FOR_EACH_CONSTRUCTOR_VALUE (elts, i, val)
2859 write_expression (val);
2862 else if (dependent_name (expr))
2864 write_unqualified_id (dependent_name (expr));
2871 /* When we bind a variable or function to a non-type template
2872 argument with reference type, we create an ADDR_EXPR to show
2873 the fact that the entity's address has been taken. But, we
2874 don't actually want to output a mangling code for the `&'. */
2875 if (TREE_CODE (expr) == ADDR_EXPR
2877 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2879 expr = TREE_OPERAND (expr, 0);
2882 write_expression (expr);
2886 code = TREE_CODE (expr);
2889 if (code == COMPONENT_REF)
2891 tree ob = TREE_OPERAND (expr, 0);
2893 if (TREE_CODE (ob) == ARROW_EXPR)
2895 write_string (operator_name_info[(int)code].mangled_name);
2896 ob = TREE_OPERAND (ob, 0);
2899 write_string ("dt");
2901 write_expression (ob);
2902 write_member_name (TREE_OPERAND (expr, 1));
2906 /* If it wasn't any of those, recursively expand the expression. */
2907 name = operator_name_info[(int) code].mangled_name;
2909 /* We used to mangle const_cast and static_cast like a C cast. */
2910 if (!abi_version_at_least (6)
2911 && (code == CONST_CAST_EXPR
2912 || code == STATIC_CAST_EXPR))
2914 name = operator_name_info[CAST_EXPR].mangled_name;
2915 G.need_abi_warning = 1;
2923 error ("use of built-in trait %qE in function signature; "
2924 "use library traits instead", expr);
2928 sorry ("mangling %C", code);
2934 write_string (name);
2940 tree fn = CALL_EXPR_FN (expr);
2942 if (TREE_CODE (fn) == ADDR_EXPR)
2943 fn = TREE_OPERAND (fn, 0);
2945 /* Mangle a dependent name as the name, not whatever happens to
2946 be the first function in the overload set. */
2947 if ((TREE_CODE (fn) == FUNCTION_DECL
2948 || TREE_CODE (fn) == OVERLOAD)
2949 && type_dependent_expression_p_push (expr))
2950 fn = DECL_NAME (get_first_fn (fn));
2952 write_expression (fn);
2955 for (i = 0; i < call_expr_nargs (expr); ++i)
2956 write_expression (CALL_EXPR_ARG (expr, i));
2961 write_type (TREE_TYPE (expr));
2962 if (list_length (TREE_OPERAND (expr, 0)) == 1)
2963 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2966 tree args = TREE_OPERAND (expr, 0);
2968 for (; args; args = TREE_CHAIN (args))
2969 write_expression (TREE_VALUE (args));
2974 case DYNAMIC_CAST_EXPR:
2975 case REINTERPRET_CAST_EXPR:
2976 case STATIC_CAST_EXPR:
2977 case CONST_CAST_EXPR:
2978 write_type (TREE_TYPE (expr));
2979 write_expression (TREE_OPERAND (expr, 0));
2982 case PREINCREMENT_EXPR:
2983 case PREDECREMENT_EXPR:
2984 if (abi_version_at_least (6))
2987 G.need_abi_warning = 1;
2991 /* In the middle-end, some expressions have more operands than
2992 they do in templates (and mangling). */
2993 len = cp_tree_operand_length (expr);
2995 for (i = 0; i < len; ++i)
2997 tree operand = TREE_OPERAND (expr, i);
2998 /* As a GNU extension, the middle operand of a
2999 conditional may be omitted. Since expression
3000 manglings are supposed to represent the input token
3001 stream, there's no good way to mangle such an
3002 expression without extending the C++ ABI. */
3003 if (code == COND_EXPR && i == 1 && !operand)
3005 error ("omitted middle operand to %<?:%> operand "
3006 "cannot be mangled");
3009 write_expression (operand);
3015 /* Literal subcase of non-terminal <template-arg>.
3017 "Literal arguments, e.g. "A<42L>", are encoded with their type
3018 and value. Negative integer values are preceded with "n"; for
3019 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
3020 encoded as 0, true as 1." */
3023 write_template_arg_literal (const tree value)
3026 write_type (TREE_TYPE (value));
3028 /* Write a null member pointer value as (type)0, regardless of its
3029 real representation. */
3030 if (null_member_pointer_value_p (value))
3031 write_integer_cst (integer_zero_node);
3033 switch (TREE_CODE (value))
3036 write_integer_cst (DECL_INITIAL (value));
3040 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
3041 || integer_zerop (value) || integer_onep (value));
3042 write_integer_cst (value);
3046 write_real_cst (value);
3050 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST
3051 && TREE_CODE (TREE_IMAGPART (value)) == INTEGER_CST)
3053 write_integer_cst (TREE_REALPART (value));
3055 write_integer_cst (TREE_IMAGPART (value));
3057 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST
3058 && TREE_CODE (TREE_IMAGPART (value)) == REAL_CST)
3060 write_real_cst (TREE_REALPART (value));
3062 write_real_cst (TREE_IMAGPART (value));
3069 sorry ("string literal in function template signature");
3079 /* Non-terminal <template-arg>.
3081 <template-arg> ::= <type> # type
3082 ::= L <type> </value/ number> E # literal
3083 ::= LZ <name> E # external name
3084 ::= X <expression> E # expression */
3087 write_template_arg (tree node)
3089 enum tree_code code = TREE_CODE (node);
3091 MANGLE_TRACE_TREE ("template-arg", node);
3093 /* A template template parameter's argument list contains TREE_LIST
3094 nodes of which the value field is the actual argument. */
3095 if (code == TREE_LIST)
3097 node = TREE_VALUE (node);
3098 /* If it's a decl, deal with its type instead. */
3101 node = TREE_TYPE (node);
3102 code = TREE_CODE (node);
3106 if (TREE_CODE (node) == NOP_EXPR
3107 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
3109 /* Template parameters can be of reference type. To maintain
3110 internal consistency, such arguments use a conversion from
3111 address of object to reference type. */
3112 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
3113 if (abi_version_at_least (2))
3114 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
3116 G.need_abi_warning = 1;
3119 if (TREE_CODE (node) == BASELINK
3120 && !type_unknown_p (node))
3122 if (abi_version_at_least (6))
3123 node = BASELINK_FUNCTIONS (node);
3125 /* We wrongly wrapped a class-scope function in X/E. */
3126 G.need_abi_warning = 1;
3129 if (ARGUMENT_PACK_P (node))
3131 /* Expand the template argument pack. */
3132 tree args = ARGUMENT_PACK_ARGS (node);
3133 int i, length = TREE_VEC_LENGTH (args);
3134 if (abi_version_at_least (6))
3139 G.need_abi_warning = 1;
3141 for (i = 0; i < length; ++i)
3142 write_template_arg (TREE_VEC_ELT (args, i));
3145 else if (TYPE_P (node))
3147 else if (code == TEMPLATE_DECL)
3148 /* A template appearing as a template arg is a template template arg. */
3149 write_template_template_arg (node);
3150 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
3151 || (abi_version_at_least (2) && code == CONST_DECL)
3152 || null_member_pointer_value_p (node))
3153 write_template_arg_literal (node);
3154 else if (DECL_P (node))
3156 /* Until ABI version 2, non-type template arguments of
3157 enumeration type were mangled using their names. */
3158 if (code == CONST_DECL && !abi_version_at_least (2))
3159 G.need_abi_warning = 1;
3161 /* Until ABI version 3, the underscore before the mangled name
3162 was incorrectly omitted. */
3163 if (!abi_version_at_least (3))
3165 G.need_abi_warning = 1;
3169 write_string ("_Z");
3170 write_encoding (node);
3175 /* Template arguments may be expressions. */
3177 write_expression (node);
3182 /* <template-template-arg>
3184 ::= <substitution> */
3187 write_template_template_arg (const tree decl)
3189 MANGLE_TRACE_TREE ("template-template-arg", decl);
3191 if (find_substitution (decl))
3193 write_name (decl, /*ignore_local_scope=*/0);
3194 add_substitution (decl);
3198 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3200 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3201 ::= A <expression> _ </element/ type>
3203 "Array types encode the dimension (number of elements) and the
3204 element type. For variable length arrays, the dimension (but not
3205 the '_' separator) is omitted." */
3208 write_array_type (const tree type)
3211 if (TYPE_DOMAIN (type))
3216 index_type = TYPE_DOMAIN (type);
3217 /* The INDEX_TYPE gives the upper and lower bounds of the
3219 max = TYPE_MAX_VALUE (index_type);
3220 if (TREE_CODE (max) == INTEGER_CST)
3222 /* The ABI specifies that we should mangle the number of
3223 elements in the array, not the largest allowed index. */
3224 offset_int wmax = wi::to_offset (max) + 1;
3225 /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
3226 number of elements as zero. */
3227 wmax = wi::zext (wmax, TYPE_PRECISION (TREE_TYPE (max)));
3228 gcc_assert (wi::fits_uhwi_p (wmax));
3229 write_unsigned_number (wmax.to_uhwi ());
3233 max = TREE_OPERAND (max, 0);
3234 if (!abi_version_at_least (2))
3236 /* value_dependent_expression_p presumes nothing is
3237 dependent when PROCESSING_TEMPLATE_DECL is zero. */
3238 ++processing_template_decl;
3239 if (!value_dependent_expression_p (max))
3240 G.need_abi_warning = 1;
3241 --processing_template_decl;
3243 write_expression (max);
3248 write_type (TREE_TYPE (type));
3251 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3252 variables. TYPE is a pointer-to-member POINTER_TYPE.
3254 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3257 write_pointer_to_member_type (const tree type)
3260 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
3261 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
3264 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3265 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3266 TEMPLATE_PARM_INDEX.
3268 <template-param> ::= T </parameter/ number> _ */
3271 write_template_param (const tree parm)
3275 MANGLE_TRACE_TREE ("template-parm", parm);
3277 switch (TREE_CODE (parm))
3279 case TEMPLATE_TYPE_PARM:
3280 case TEMPLATE_TEMPLATE_PARM:
3281 case BOUND_TEMPLATE_TEMPLATE_PARM:
3282 parm_index = TEMPLATE_TYPE_IDX (parm);
3285 case TEMPLATE_PARM_INDEX:
3286 parm_index = TEMPLATE_PARM_IDX (parm);
3294 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3295 earliest template param denoted by `_'. */
3296 write_compact_number (parm_index);
3299 /* <template-template-param>
3300 ::= <template-param>
3301 ::= <substitution> */
3304 write_template_template_param (const tree parm)
3306 tree templ = NULL_TREE;
3308 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3309 template template parameter. The substitution candidate here is
3310 only the template. */
3311 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
3314 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
3315 if (find_substitution (templ))
3319 /* <template-param> encodes only the template parameter position,
3320 not its template arguments, which is fine here. */
3321 write_template_param (parm);
3323 add_substitution (templ);
3326 /* Non-terminal <substitution>.
3328 <substitution> ::= S <seq-id> _
3332 write_substitution (const int seq_id)
3334 MANGLE_TRACE ("substitution", "");
3338 write_number (seq_id - 1, /*unsigned=*/1, 36);
3342 /* Start mangling ENTITY. */
3345 start_mangling (const tree entity)
3348 G.need_abi_warning = false;
3349 obstack_free (&name_obstack, name_base);
3350 mangle_obstack = &name_obstack;
3351 name_base = obstack_alloc (&name_obstack, 0);
3354 /* Done with mangling. If WARN is true, and the name of G.entity will
3355 be mangled differently in a future version of the ABI, issue a
3359 finish_mangling_internal (const bool warn)
3361 if (warn_abi && warn && G.need_abi_warning)
3362 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
3366 /* Clear all the substitutions. */
3367 vec_safe_truncate (G.substitutions, 0);
3369 /* Null-terminate the string. */
3374 /* Like finish_mangling_internal, but return the mangled string. */
3376 static inline const char *
3377 finish_mangling (const bool warn)
3379 finish_mangling_internal (warn);
3380 return (const char *) obstack_finish (mangle_obstack);
3383 /* Like finish_mangling_internal, but return an identifier. */
3386 finish_mangling_get_identifier (const bool warn)
3388 finish_mangling_internal (warn);
3389 /* Don't obstack_finish here, and the next start_mangling will
3390 remove the identifier. */
3391 return get_identifier ((const char *) obstack_base (mangle_obstack));
3394 /* Initialize data structures for mangling. */
3399 gcc_obstack_init (&name_obstack);
3400 name_base = obstack_alloc (&name_obstack, 0);
3401 vec_alloc (G.substitutions, 0);
3403 /* Cache these identifiers for quick comparison when checking for
3404 standard substitutions. */
3405 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
3406 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
3407 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
3408 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
3409 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
3410 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
3413 /* Generate the mangled name of DECL. */
3416 mangle_decl_string (const tree decl)
3419 location_t saved_loc = input_location;
3420 tree saved_fn = NULL_TREE;
3421 bool template_p = false;
3423 /* We shouldn't be trying to mangle an uninstantiated template. */
3424 gcc_assert (!type_dependent_expression_p (decl));
3426 if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
3428 struct tinst_level *tl = current_instantiation ();
3429 if ((!tl || tl->decl != decl)
3430 && push_tinst_level (decl))
3433 saved_fn = current_function_decl;
3434 current_function_decl = NULL_TREE;
3437 input_location = DECL_SOURCE_LOCATION (decl);
3439 start_mangling (decl);
3441 if (TREE_CODE (decl) == TYPE_DECL)
3442 write_type (TREE_TYPE (decl));
3444 write_mangled_name (decl, true);
3446 result = finish_mangling_get_identifier (/*warn=*/true);
3448 fprintf (stderr, "mangle_decl_string = '%s'\n\n",
3449 IDENTIFIER_POINTER (result));
3454 current_function_decl = saved_fn;
3456 input_location = saved_loc;
3461 /* Return an identifier for the external mangled name of DECL. */
3464 get_mangled_id (tree decl)
3466 tree id = mangle_decl_string (decl);
3467 return targetm.mangle_decl_assembler_name (decl, id);
3470 /* Create an identifier for the external mangled name of DECL. */
3473 mangle_decl (const tree decl)
3478 /* Don't bother mangling uninstantiated templates. */
3479 ++processing_template_decl;
3480 if (TREE_CODE (decl) == TYPE_DECL)
3481 dep = dependent_type_p (TREE_TYPE (decl));
3483 dep = (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3484 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl)));
3485 --processing_template_decl;
3489 id = get_mangled_id (decl);
3490 SET_DECL_ASSEMBLER_NAME (decl, id);
3492 if (G.need_abi_warning
3493 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3494 && TREE_CODE (decl) != TYPE_DECL
3495 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)
3496 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
3498 #ifdef ASM_OUTPUT_DEF
3499 /* If the mangling will change in the future, emit an alias with the
3500 future mangled name for forward-compatibility. */
3505 SET_IDENTIFIER_GLOBAL_VALUE (id, decl);
3506 if (IDENTIFIER_GLOBAL_VALUE (id) != decl)
3507 inform (DECL_SOURCE_LOCATION (decl), "-fabi-version=6 (or =0) "
3508 "avoids this error with a change in mangling");
3510 #ifdef ASM_OUTPUT_DEF
3511 save_ver = flag_abi_version;
3512 flag_abi_version = 0;
3513 id2 = mangle_decl_string (decl);
3514 id2 = targetm.mangle_decl_assembler_name (decl, id2);
3515 flag_abi_version = save_ver;
3517 alias = make_alias_for (decl, id2);
3518 DECL_IGNORED_P (alias) = 1;
3519 TREE_PUBLIC (alias) = TREE_PUBLIC (decl);
3520 DECL_VISIBILITY (alias) = DECL_VISIBILITY (decl);
3521 if (vague_linkage_p (decl))
3522 DECL_WEAK (alias) = 1;
3523 if (TREE_CODE (decl) == FUNCTION_DECL)
3524 cgraph_same_body_alias (cgraph_get_create_node (decl), alias, decl);
3526 varpool_extra_name_alias (alias, decl);
3531 /* Generate the mangled representation of TYPE. */
3534 mangle_type_string (const tree type)
3538 start_mangling (type);
3540 result = finish_mangling (/*warn=*/false);
3542 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
3546 /* Create an identifier for the mangled name of a special component
3547 for belonging to TYPE. CODE is the ABI-specified code for this
3551 mangle_special_for_type (const tree type, const char *code)
3555 /* We don't have an actual decl here for the special component, so
3556 we can't just process the <encoded-name>. Instead, fake it. */
3557 start_mangling (type);
3559 /* Start the mangling. */
3560 write_string ("_Z");
3561 write_string (code);
3565 result = finish_mangling_get_identifier (/*warn=*/false);
3568 fprintf (stderr, "mangle_special_for_type = %s\n\n",
3569 IDENTIFIER_POINTER (result));
3574 /* Create an identifier for the mangled representation of the typeinfo
3575 structure for TYPE. */
3578 mangle_typeinfo_for_type (const tree type)
3580 return mangle_special_for_type (type, "TI");
3583 /* Create an identifier for the mangled name of the NTBS containing
3584 the mangled name of TYPE. */
3587 mangle_typeinfo_string_for_type (const tree type)
3589 return mangle_special_for_type (type, "TS");
3592 /* Create an identifier for the mangled name of the vtable for TYPE. */
3595 mangle_vtbl_for_type (const tree type)
3597 return mangle_special_for_type (type, "TV");
3600 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3603 mangle_vtt_for_type (const tree type)
3605 return mangle_special_for_type (type, "TT");
3608 /* Return an identifier for a construction vtable group. TYPE is
3609 the most derived class in the hierarchy; BINFO is the base
3610 subobject for which this construction vtable group will be used.
3612 This mangling isn't part of the ABI specification; in the ABI
3613 specification, the vtable group is dumped in the same COMDAT as the
3614 main vtable, and is referenced only from that vtable, so it doesn't
3615 need an external name. For binary formats without COMDAT sections,
3616 though, we need external names for the vtable groups.
3618 We use the production
3620 <special-name> ::= CT <type> <offset number> _ <base type> */
3623 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
3627 start_mangling (type);
3629 write_string ("_Z");
3630 write_string ("TC");
3632 write_integer_cst (BINFO_OFFSET (binfo));
3634 write_type (BINFO_TYPE (binfo));
3636 result = finish_mangling_get_identifier (/*warn=*/false);
3638 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n",
3639 IDENTIFIER_POINTER (result));
3643 /* Mangle a this pointer or result pointer adjustment.
3645 <call-offset> ::= h <fixed offset number> _
3646 ::= v <fixed offset number> _ <virtual offset number> _ */
3649 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
3651 write_char (virtual_offset ? 'v' : 'h');
3653 /* For either flavor, write the fixed offset. */
3654 write_integer_cst (fixed_offset);
3657 /* For a virtual thunk, add the virtual offset. */
3660 write_integer_cst (virtual_offset);
3665 /* Return an identifier for the mangled name of a this-adjusting or
3666 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3667 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3668 is a virtual thunk, and it is the vtbl offset in
3669 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3670 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3671 thunk itself. A covariant thunk name always includes the adjustment
3672 for the this pointer, even if there is none.
3674 <special-name> ::= T <call-offset> <base encoding>
3675 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3679 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
3680 tree virtual_offset)
3684 start_mangling (fn_decl);
3686 write_string ("_Z");
3689 if (!this_adjusting)
3691 /* Covariant thunk with no this adjustment */
3693 mangle_call_offset (integer_zero_node, NULL_TREE);
3694 mangle_call_offset (fixed_offset, virtual_offset);
3696 else if (!DECL_THUNK_P (fn_decl))
3697 /* Plain this adjusting thunk. */
3698 mangle_call_offset (fixed_offset, virtual_offset);
3701 /* This adjusting thunk to covariant thunk. */
3703 mangle_call_offset (fixed_offset, virtual_offset);
3704 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
3705 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
3707 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
3708 mangle_call_offset (fixed_offset, virtual_offset);
3709 fn_decl = THUNK_TARGET (fn_decl);
3713 write_encoding (fn_decl);
3715 result = finish_mangling_get_identifier (/*warn=*/false);
3717 fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result));
3721 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3722 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3725 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
3727 /* Hash a node (VAL1) in the table. */
3730 hash_type (const void *val)
3732 return (hashval_t) TYPE_UID (TREE_TYPE ((const_tree) val));
3735 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3738 compare_type (const void *val1, const void *val2)
3740 return TREE_TYPE ((const_tree) val1) == (const_tree) val2;
3743 /* Return an identifier for the mangled unqualified name for a
3744 conversion operator to TYPE. This mangling is not specified by the
3745 ABI spec; it is only used internally. */
3748 mangle_conv_op_name_for_type (const tree type)
3753 if (type == error_mark_node)
3754 return error_mark_node;
3756 if (conv_type_names == NULL)
3757 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
3759 slot = htab_find_slot_with_hash (conv_type_names, type,
3760 (hashval_t) TYPE_UID (type), INSERT);
3761 identifier = (tree)*slot;
3766 /* Create a unique name corresponding to TYPE. */
3767 sprintf (buffer, "operator %lu",
3768 (unsigned long) htab_elements (conv_type_names));
3769 identifier = get_identifier (buffer);
3772 /* Hang TYPE off the identifier so it can be found easily later
3773 when performing conversions. */
3774 TREE_TYPE (identifier) = type;
3776 /* Set bits on the identifier so we know later it's a conversion. */
3777 IDENTIFIER_OPNAME_P (identifier) = 1;
3778 IDENTIFIER_TYPENAME_P (identifier) = 1;
3784 /* Write out the appropriate string for this variable when generating
3785 another mangled name based on this one. */
3788 write_guarded_var_name (const tree variable)
3790 if (DECL_NAME (variable)
3791 && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
3792 /* The name of a guard variable for a reference temporary should refer
3793 to the reference, not the temporary. */
3794 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
3796 write_name (variable, /*ignore_local_scope=*/0);
3799 /* Return an identifier for the name of an initialization guard
3800 variable for indicated VARIABLE. */
3803 mangle_guard_variable (const tree variable)
3805 start_mangling (variable);
3806 write_string ("_ZGV");
3807 write_guarded_var_name (variable);
3808 return finish_mangling_get_identifier (/*warn=*/false);
3811 /* Return an identifier for the name of a thread_local initialization
3812 function for VARIABLE. */
3815 mangle_tls_init_fn (const tree variable)
3817 start_mangling (variable);
3818 write_string ("_ZTH");
3819 write_guarded_var_name (variable);
3820 return finish_mangling_get_identifier (/*warn=*/false);
3823 /* Return an identifier for the name of a thread_local wrapper
3824 function for VARIABLE. */
3826 #define TLS_WRAPPER_PREFIX "_ZTW"
3829 mangle_tls_wrapper_fn (const tree variable)
3831 start_mangling (variable);
3832 write_string (TLS_WRAPPER_PREFIX);
3833 write_guarded_var_name (variable);
3834 return finish_mangling_get_identifier (/*warn=*/false);
3837 /* Return true iff FN is a thread_local wrapper function. */
3840 decl_tls_wrapper_p (const tree fn)
3842 if (TREE_CODE (fn) != FUNCTION_DECL)
3844 tree name = DECL_NAME (fn);
3845 return strncmp (IDENTIFIER_POINTER (name), TLS_WRAPPER_PREFIX,
3846 strlen (TLS_WRAPPER_PREFIX)) == 0;
3849 /* Return an identifier for the name of a temporary variable used to
3850 initialize a static reference. This isn't part of the ABI, but we might
3851 as well call them something readable. */
3853 static GTY(()) int temp_count;
3856 mangle_ref_init_variable (const tree variable)
3858 start_mangling (variable);
3859 write_string ("_ZGR");
3860 write_name (variable, /*ignore_local_scope=*/0);
3861 /* Avoid name clashes with aggregate initialization of multiple
3862 references at once. */
3863 write_unsigned_number (temp_count++);
3864 return finish_mangling_get_identifier (/*warn=*/false);
3868 /* Foreign language type mangling section. */
3870 /* How to write the type codes for the integer Java type. */
3873 write_java_integer_type_codes (const tree type)
3875 if (type == java_int_type_node)
3877 else if (type == java_short_type_node)
3879 else if (type == java_byte_type_node)
3881 else if (type == java_char_type_node)
3883 else if (type == java_long_type_node)
3885 else if (type == java_boolean_type_node)
3891 /* Given a CLASS_TYPE, such as a record for std::bad_exception this
3892 function generates a mangled name for the vtable map variable of
3893 the class type. For example, if the class type is
3894 "std::bad_exception", the mangled name for the class is
3895 "St13bad_exception". This function would generate the name
3896 "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
3897 "_VTV<std::bad_exception>::__vtable_map". */
3901 get_mangled_vtable_map_var_name (tree class_type)
3903 char *var_name = NULL;
3904 const char *prefix = "_ZN4_VTVI";
3905 const char *postfix = "E12__vtable_mapE";
3907 gcc_assert (TREE_CODE (class_type) == RECORD_TYPE);
3909 tree class_id = DECL_ASSEMBLER_NAME (TYPE_NAME (class_type));
3910 unsigned int len = strlen (IDENTIFIER_POINTER (class_id)) +
3912 strlen (postfix) + 1;
3914 var_name = (char *) xmalloc (len);
3916 sprintf (var_name, "%s%s%s", prefix, IDENTIFIER_POINTER (class_id), postfix);
3921 #include "gt-cp-mangle.h"