1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010,
3 2011 Free Software Foundation, Inc.
4 Written by Alex Samuel <samuel@codesourcery.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file implements mangling of C++ names according to the IA64
23 C++ ABI specification. A mangled name encodes a function or
24 variable's name, scope, type, and/or template arguments into a text
25 identifier. This identifier is used as the function's or
26 variable's linkage name, to preserve compatibility between C++'s
27 language features (templates, scoping, and overloading) and C
30 Additionally, g++ uses mangled names internally. To support this,
31 mangling of types is allowed, even though the mangled name of a
32 type should not appear by itself as an exported name. Ditto for
33 uninstantiated templates.
35 The primary entry point for this module is mangle_decl, which
36 returns an identifier containing the mangled name for a decl.
37 Additional entry points are provided to build mangled names of
38 particular constructs when the appropriate decl for that construct
39 is not available. These are:
41 mangle_typeinfo_for_type: typeinfo data
42 mangle_typeinfo_string_for_type: typeinfo type name
43 mangle_vtbl_for_type: virtual table data
44 mangle_vtt_for_type: VTT data
45 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
46 mangle_thunk: thunk function or entry */
50 #include "coretypes.h"
60 /* Debugging support. */
62 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
64 #define DEBUG_MANGLE 0
67 /* Macros for tracing the write_* functions. */
69 # define MANGLE_TRACE(FN, INPUT) \
70 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
71 # define MANGLE_TRACE_TREE(FN, NODE) \
72 fprintf (stderr, " %-24s: %-24s (%p)\n", \
73 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
75 # define MANGLE_TRACE(FN, INPUT)
76 # define MANGLE_TRACE_TREE(FN, NODE)
79 /* Nonzero if NODE is a class template-id. We can't rely on
80 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
81 that hard to distinguish A<T> from A, where A<T> is the type as
82 instantiated outside of the template, and A is the type used
83 without parameters inside the template. */
84 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
85 (TYPE_LANG_SPECIFIC (NODE) != NULL \
86 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
87 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
88 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
90 /* Things we only need one of. This module is not reentrant. */
91 typedef struct GTY(()) globals
{
92 /* An array of the current substitution candidates, in the order
94 VEC(tree
,gc
) *substitutions
;
96 /* The entity that is being mangled. */
97 tree
GTY ((skip
)) entity
;
99 /* How many parameter scopes we are inside. */
102 /* True if the mangling will be different in a future version of the
104 bool need_abi_warning
;
107 static GTY (()) globals G
;
109 /* The obstack on which we build mangled names. */
110 static struct obstack
*mangle_obstack
;
112 /* The obstack on which we build mangled names that are not going to
113 be IDENTIFIER_NODEs. */
114 static struct obstack name_obstack
;
116 /* The first object on the name_obstack; we use this to free memory
117 allocated on the name_obstack. */
118 static void *name_base
;
120 /* Indices into subst_identifiers. These are identifiers used in
121 special substitution rules. */
129 SUBID_BASIC_IOSTREAM
,
132 substitution_identifier_index_t
;
134 /* For quick substitution checks, look up these common identifiers
136 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
138 /* Single-letter codes for builtin integer types, defined in
139 <builtin-type>. These are indexed by integer_type_kind values. */
141 integer_type_codes
[itk_none
] =
144 'a', /* itk_signed_char */
145 'h', /* itk_unsigned_char */
147 't', /* itk_unsigned_short */
149 'j', /* itk_unsigned_int */
151 'm', /* itk_unsigned_long */
152 'x', /* itk_long_long */
153 'y', /* itk_unsigned_long_long */
154 'n', /* itk_int128 */
155 'o', /* itk_unsigned_int128 */
158 static int decl_is_template_id (const tree
, tree
* const);
160 /* Functions for handling substitutions. */
162 static inline tree
canonicalize_for_substitution (tree
);
163 static void add_substitution (tree
);
164 static inline int is_std_substitution (const tree
,
165 const substitution_identifier_index_t
);
166 static inline int is_std_substitution_char (const tree
,
167 const substitution_identifier_index_t
);
168 static int find_substitution (tree
);
169 static void mangle_call_offset (const tree
, const tree
);
171 /* Functions for emitting mangled representations of things. */
173 static void write_mangled_name (const tree
, bool);
174 static void write_encoding (const tree
);
175 static void write_name (tree
, const int);
176 static void write_unscoped_name (const tree
);
177 static void write_unscoped_template_name (const tree
);
178 static void write_nested_name (const tree
);
179 static void write_prefix (const tree
);
180 static void write_template_prefix (const tree
);
181 static void write_unqualified_name (const tree
);
182 static void write_conversion_operator_name (const tree
);
183 static void write_source_name (tree
);
184 static void write_literal_operator_name (tree
);
185 static void write_unnamed_type_name (const tree
);
186 static void write_closure_type_name (const tree
);
187 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
189 static void write_number (unsigned HOST_WIDE_INT
, const int,
191 static void write_compact_number (int num
);
192 static void write_integer_cst (const tree
);
193 static void write_real_cst (const tree
);
194 static void write_identifier (const char *);
195 static void write_special_name_constructor (const tree
);
196 static void write_special_name_destructor (const tree
);
197 static void write_type (tree
);
198 static int write_CV_qualifiers_for_type (const tree
);
199 static void write_builtin_type (tree
);
200 static void write_function_type (const tree
);
201 static void write_bare_function_type (const tree
, const int, const tree
);
202 static void write_method_parms (tree
, const int, const tree
);
203 static void write_class_enum_type (const tree
);
204 static void write_template_args (tree
);
205 static void write_expression (tree
);
206 static void write_template_arg_literal (const tree
);
207 static void write_template_arg (tree
);
208 static void write_template_template_arg (const tree
);
209 static void write_array_type (const tree
);
210 static void write_pointer_to_member_type (const tree
);
211 static void write_template_param (const tree
);
212 static void write_template_template_param (const tree
);
213 static void write_substitution (const int);
214 static int discriminator_for_local_entity (tree
);
215 static int discriminator_for_string_literal (tree
, tree
);
216 static void write_discriminator (const int);
217 static void write_local_name (tree
, const tree
, const tree
);
218 static void dump_substitution_candidates (void);
219 static tree
mangle_decl_string (const tree
);
220 static int local_class_index (tree
);
222 /* Control functions. */
224 static inline void start_mangling (const tree
);
225 static inline const char *finish_mangling (const bool);
226 static tree
mangle_special_for_type (const tree
, const char *);
228 /* Foreign language functions. */
230 static void write_java_integer_type_codes (const tree
);
232 /* Append a single character to the end of the mangled
234 #define write_char(CHAR) \
235 obstack_1grow (mangle_obstack, (CHAR))
237 /* Append a sized buffer to the end of the mangled representation. */
238 #define write_chars(CHAR, LEN) \
239 obstack_grow (mangle_obstack, (CHAR), (LEN))
241 /* Append a NUL-terminated string to the end of the mangled
243 #define write_string(STRING) \
244 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
246 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
247 same purpose (context, which may be a type) and value (template
248 decl). See write_template_prefix for more information on what this
250 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
251 (TREE_CODE (NODE1) == TREE_LIST \
252 && TREE_CODE (NODE2) == TREE_LIST \
253 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
254 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
255 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
256 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
258 /* Write out an unsigned quantity in base 10. */
259 #define write_unsigned_number(NUMBER) \
260 write_number ((NUMBER), /*unsigned_p=*/1, 10)
262 /* If DECL is a template instance, return nonzero and, if
263 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
264 Otherwise return zero. */
267 decl_is_template_id (const tree decl
, tree
* const template_info
)
269 if (TREE_CODE (decl
) == TYPE_DECL
)
271 /* TYPE_DECLs are handled specially. Look at its type to decide
272 if this is a template instantiation. */
273 const tree type
= TREE_TYPE (decl
);
275 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
277 if (template_info
!= NULL
)
278 /* For a templated TYPE_DECL, the template info is hanging
280 *template_info
= TYPE_TEMPLATE_INFO (type
);
286 /* Check if this is a primary template. */
287 if (DECL_LANG_SPECIFIC (decl
) != NULL
288 && DECL_USE_TEMPLATE (decl
)
289 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
290 && TREE_CODE (decl
) != TEMPLATE_DECL
)
292 if (template_info
!= NULL
)
293 /* For most templated decls, the template info is hanging
295 *template_info
= DECL_TEMPLATE_INFO (decl
);
300 /* It's not a template id. */
304 /* Produce debugging output of current substitution candidates. */
307 dump_substitution_candidates (void)
312 fprintf (stderr
, " ++ substitutions ");
313 FOR_EACH_VEC_ELT (tree
, G
.substitutions
, i
, el
)
315 const char *name
= "???";
318 fprintf (stderr
, " ");
320 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
321 else if (TREE_CODE (el
) == TREE_LIST
)
322 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
323 else if (TYPE_NAME (el
))
324 name
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el
)));
325 fprintf (stderr
, " S%d_ = ", i
- 1);
327 (CP_TYPE_RESTRICT_P (el
)
328 || CP_TYPE_VOLATILE_P (el
)
329 || CP_TYPE_CONST_P (el
)))
330 fprintf (stderr
, "CV-");
331 fprintf (stderr
, "%s (%s at %p)\n",
332 name
, tree_code_name
[TREE_CODE (el
)], (void *) el
);
336 /* Both decls and types can be substitution candidates, but sometimes
337 they refer to the same thing. For instance, a TYPE_DECL and
338 RECORD_TYPE for the same class refer to the same thing, and should
339 be treated accordingly in substitutions. This function returns a
340 canonicalized tree node representing NODE that is used when adding
341 and substitution candidates and finding matches. */
344 canonicalize_for_substitution (tree node
)
346 /* For a TYPE_DECL, use the type instead. */
347 if (TREE_CODE (node
) == TYPE_DECL
)
348 node
= TREE_TYPE (node
);
350 && TYPE_CANONICAL (node
) != node
351 && TYPE_MAIN_VARIANT (node
) != node
)
353 /* Here we want to strip the topmost typedef only.
354 We need to do that so is_std_substitution can do proper
356 if (TREE_CODE (node
) == FUNCTION_TYPE
)
357 /* Use build_qualified_type and TYPE_QUALS here to preserve
358 the old buggy mangling of attribute noreturn with abi<5. */
359 node
= build_qualified_type (TYPE_MAIN_VARIANT (node
),
362 node
= cp_build_qualified_type (TYPE_MAIN_VARIANT (node
),
363 cp_type_quals (node
));
368 /* Add NODE as a substitution candidate. NODE must not already be on
369 the list of candidates. */
372 add_substitution (tree node
)
377 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
378 tree_code_name
[TREE_CODE (node
)], (void *) node
);
380 /* Get the canonicalized substitution candidate for NODE. */
381 c
= canonicalize_for_substitution (node
);
382 if (DEBUG_MANGLE
&& c
!= node
)
383 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
384 tree_code_name
[TREE_CODE (node
)], (void *) node
);
388 /* Make sure NODE isn't already a candidate. */
393 FOR_EACH_VEC_ELT (tree
, G
.substitutions
, i
, candidate
)
395 gcc_assert (!(DECL_P (node
) && node
== candidate
));
396 gcc_assert (!(TYPE_P (node
) && TYPE_P (candidate
)
397 && same_type_p (node
, candidate
)));
400 #endif /* ENABLE_CHECKING */
402 /* Put the decl onto the varray of substitution candidates. */
403 VEC_safe_push (tree
, gc
, G
.substitutions
, node
);
406 dump_substitution_candidates ();
409 /* Helper function for find_substitution. Returns nonzero if NODE,
410 which may be a decl or a CLASS_TYPE, is a template-id with template
411 name of substitution_index[INDEX] in the ::std namespace. */
414 is_std_substitution (const tree node
,
415 const substitution_identifier_index_t index
)
422 type
= TREE_TYPE (node
);
425 else if (CLASS_TYPE_P (node
))
428 decl
= TYPE_NAME (node
);
431 /* These are not the droids you're looking for. */
434 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
435 && TYPE_LANG_SPECIFIC (type
)
436 && TYPE_TEMPLATE_INFO (type
)
437 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
438 == subst_identifiers
[index
]));
441 /* Helper function for find_substitution. Returns nonzero if NODE,
442 which may be a decl or a CLASS_TYPE, is the template-id
443 ::std::identifier<char>, where identifier is
444 substitution_index[INDEX]. */
447 is_std_substitution_char (const tree node
,
448 const substitution_identifier_index_t index
)
451 /* Check NODE's name is ::std::identifier. */
452 if (!is_std_substitution (node
, index
))
454 /* Figure out its template args. */
456 args
= DECL_TI_ARGS (node
);
457 else if (CLASS_TYPE_P (node
))
458 args
= CLASSTYPE_TI_ARGS (node
);
460 /* Oops, not a template. */
462 /* NODE's template arg list should be <char>. */
464 TREE_VEC_LENGTH (args
) == 1
465 && TREE_VEC_ELT (args
, 0) == char_type_node
;
468 /* Check whether a substitution should be used to represent NODE in
471 First, check standard special-case substitutions.
473 <substitution> ::= St
480 # ::std::basic_string
483 # ::std::basic_string<char,
484 ::std::char_traits<char>,
485 ::std::allocator<char> >
488 # ::std::basic_istream<char, ::std::char_traits<char> >
491 # ::std::basic_ostream<char, ::std::char_traits<char> >
494 # ::std::basic_iostream<char, ::std::char_traits<char> >
496 Then examine the stack of currently available substitution
497 candidates for entities appearing earlier in the same mangling
499 If a substitution is found, write its mangled representation and
500 return nonzero. If none is found, just return zero. */
503 find_substitution (tree node
)
506 const int size
= VEC_length (tree
, G
.substitutions
);
511 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
512 tree_code_name
[TREE_CODE (node
)], (void *) node
);
514 /* Obtain the canonicalized substitution representation for NODE.
515 This is what we'll compare against. */
516 node
= canonicalize_for_substitution (node
);
518 /* Check for builtin substitutions. */
520 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
521 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
523 /* Check for std::allocator. */
525 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
526 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
532 /* Check for std::basic_string. */
533 if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
537 /* If this is a type (i.e. a fully-qualified template-id),
539 std::basic_string <char,
540 std::char_traits<char>,
541 std::allocator<char> > . */
542 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
543 && CLASSTYPE_USE_TEMPLATE (type
))
545 tree args
= CLASSTYPE_TI_ARGS (type
);
546 if (TREE_VEC_LENGTH (args
) == 3
547 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
548 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
550 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
559 /* Substitute for the template name only if this isn't a type. */
566 /* Check for basic_{i,o,io}stream. */
568 && cp_type_quals (type
) == TYPE_UNQUALIFIED
569 && CLASS_TYPE_P (type
)
570 && CLASSTYPE_USE_TEMPLATE (type
)
571 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
573 /* First, check for the template
574 args <char, std::char_traits<char> > . */
575 tree args
= CLASSTYPE_TI_ARGS (type
);
576 if (TREE_VEC_LENGTH (args
) == 2
577 && TYPE_P (TREE_VEC_ELT (args
, 0))
578 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
579 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
582 /* Got them. Is this basic_istream? */
583 if (is_std_substitution (decl
, SUBID_BASIC_ISTREAM
))
588 /* Or basic_ostream? */
589 else if (is_std_substitution (decl
, SUBID_BASIC_OSTREAM
))
594 /* Or basic_iostream? */
595 else if (is_std_substitution (decl
, SUBID_BASIC_IOSTREAM
))
603 /* Check for namespace std. */
604 if (decl
&& DECL_NAMESPACE_STD_P (decl
))
610 /* Now check the list of available substitutions for this mangling
612 for (i
= 0; i
< size
; ++i
)
614 tree candidate
= VEC_index (tree
, G
.substitutions
, i
);
615 /* NODE is a matched to a candidate if it's the same decl node or
616 if it's the same type. */
617 if (decl
== candidate
618 || (TYPE_P (candidate
) && type
&& TYPE_P (node
)
619 && same_type_p (type
, candidate
))
620 || NESTED_TEMPLATE_MATCH (node
, candidate
))
622 write_substitution (i
);
627 /* No substitution found. */
632 /* TOP_LEVEL is true, if this is being called at outermost level of
633 mangling. It should be false when mangling a decl appearing in an
634 expression within some other mangling.
636 <mangled-name> ::= _Z <encoding> */
639 write_mangled_name (const tree decl
, bool top_level
)
641 MANGLE_TRACE_TREE ("mangled-name", decl
);
643 if (/* The names of `extern "C"' functions are not mangled. */
644 DECL_EXTERN_C_FUNCTION_P (decl
)
645 /* But overloaded operator names *are* mangled. */
646 && !DECL_OVERLOADED_OPERATOR_P (decl
))
651 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
654 /* The standard notes: "The <encoding> of an extern "C"
655 function is treated like global-scope data, i.e. as its
656 <source-name> without a type." We cannot write
657 overloaded operators that way though, because it contains
658 characters invalid in assembler. */
659 if (abi_version_at_least (2))
662 G
.need_abi_warning
= true;
663 write_source_name (DECL_NAME (decl
));
666 else if (TREE_CODE (decl
) == VAR_DECL
667 /* The names of non-static global variables aren't mangled. */
668 && DECL_EXTERNAL_LINKAGE_P (decl
)
669 && (CP_DECL_CONTEXT (decl
) == global_namespace
670 /* And neither are `extern "C"' variables. */
671 || DECL_EXTERN_C_P (decl
)))
673 if (top_level
|| abi_version_at_least (2))
677 G
.need_abi_warning
= true;
685 write_encoding (decl
);
686 if (DECL_LANG_SPECIFIC (decl
)
687 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
)
688 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)))
689 /* We need a distinct mangled name for these entities, but
690 we should never actually output it. So, we append some
691 characters the assembler won't like. */
692 write_string (" *INTERNAL* ");
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 /* A decl in :: or ::std scope is treated specially. The former is
798 mangled using <unscoped-name> or <unscoped-template-name>, the
799 latter with a special substitution. Also, a name that is
800 directly in a local function scope is also mangled with
801 <unscoped-name> rather than a full <nested-name>. */
803 || context
== global_namespace
804 || DECL_NAMESPACE_STD_P (context
)
805 || (ignore_local_scope
&& TREE_CODE (context
) == FUNCTION_DECL
))
808 /* Is this a template instance? */
809 if (decl_is_template_id (decl
, &template_info
))
811 /* Yes: use <unscoped-template-name>. */
812 write_unscoped_template_name (TI_TEMPLATE (template_info
));
813 write_template_args (TI_ARGS (template_info
));
816 /* Everything else gets an <unqualified-name>. */
817 write_unscoped_name (decl
);
821 /* Handle local names, unless we asked not to (that is, invoked
822 under <local-name>, to handle only the part of the name under
824 if (!ignore_local_scope
)
826 /* Scan up the list of scope context, looking for a
827 function. If we find one, this entity is in local
828 function scope. local_entity tracks context one scope
829 level down, so it will contain the element that's
830 directly in that function's scope, either decl or one of
831 its enclosing scopes. */
832 tree local_entity
= decl
;
833 while (context
!= NULL
&& context
!= global_namespace
)
835 /* Make sure we're always dealing with decls. */
836 if (context
!= NULL
&& TYPE_P (context
))
837 context
= TYPE_NAME (context
);
838 /* Is this a function? */
839 if (TREE_CODE (context
) == FUNCTION_DECL
840 || TREE_CODE (context
) == PARM_DECL
)
842 /* Yes, we have local scope. Use the <local-name>
843 production for the innermost function scope. */
844 write_local_name (context
, local_entity
, decl
);
847 /* Up one scope level. */
848 local_entity
= context
;
849 context
= decl_mangling_context (context
);
852 /* No local scope found? Fall through to <nested-name>. */
855 /* Other decls get a <nested-name> to encode their scope. */
856 write_nested_name (decl
);
860 /* <unscoped-name> ::= <unqualified-name>
861 ::= St <unqualified-name> # ::std:: */
864 write_unscoped_name (const tree decl
)
866 tree context
= decl_mangling_context (decl
);
868 MANGLE_TRACE_TREE ("unscoped-name", decl
);
870 /* Is DECL in ::std? */
871 if (DECL_NAMESPACE_STD_P (context
))
874 write_unqualified_name (decl
);
878 /* If not, it should be either in the global namespace, or directly
879 in a local function scope. */
880 gcc_assert (context
== global_namespace
882 || TREE_CODE (context
) == FUNCTION_DECL
);
884 write_unqualified_name (decl
);
888 /* <unscoped-template-name> ::= <unscoped-name>
889 ::= <substitution> */
892 write_unscoped_template_name (const tree decl
)
894 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
896 if (find_substitution (decl
))
898 write_unscoped_name (decl
);
899 add_substitution (decl
);
902 /* Write the nested name, including CV-qualifiers, of DECL.
904 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
905 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
907 <CV-qualifiers> ::= [r] [V] [K] */
910 write_nested_name (const tree decl
)
914 MANGLE_TRACE_TREE ("nested-name", decl
);
918 /* Write CV-qualifiers, if this is a member function. */
919 if (TREE_CODE (decl
) == FUNCTION_DECL
920 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
922 if (DECL_VOLATILE_MEMFUNC_P (decl
))
924 if (DECL_CONST_MEMFUNC_P (decl
))
928 /* Is this a template instance? */
929 if (decl_is_template_id (decl
, &template_info
))
931 /* Yes, use <template-prefix>. */
932 write_template_prefix (decl
);
933 write_template_args (TI_ARGS (template_info
));
935 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
937 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
938 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
940 write_template_prefix (decl
);
941 write_template_args (TREE_OPERAND (name
, 1));
945 write_prefix (decl_mangling_context (decl
));
946 write_unqualified_name (decl
);
951 /* No, just use <prefix> */
952 write_prefix (decl_mangling_context (decl
));
953 write_unqualified_name (decl
);
958 /* <prefix> ::= <prefix> <unqualified-name>
960 ::= <template-prefix> <template-args>
963 ::= <substitution> */
966 write_prefix (const tree node
)
969 /* Non-NULL if NODE represents a template-id. */
970 tree template_info
= NULL
;
973 || node
== global_namespace
)
976 MANGLE_TRACE_TREE ("prefix", node
);
978 if (TREE_CODE (node
) == DECLTYPE_TYPE
)
984 if (find_substitution (node
))
989 /* If this is a function or parm decl, that means we've hit function
990 scope, so this prefix must be for a local name. In this
991 case, we're under the <local-name> production, which encodes
992 the enclosing function scope elsewhere. So don't continue
994 if (TREE_CODE (node
) == FUNCTION_DECL
995 || TREE_CODE (node
) == PARM_DECL
)
999 decl_is_template_id (decl
, &template_info
);
1003 /* Node is a type. */
1004 decl
= TYPE_NAME (node
);
1005 if (CLASSTYPE_TEMPLATE_ID_P (node
))
1006 template_info
= TYPE_TEMPLATE_INFO (node
);
1009 /* In G++ 3.2, the name of the template parameter was used. */
1010 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
1011 && !abi_version_at_least (2))
1012 G
.need_abi_warning
= true;
1014 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
1015 && abi_version_at_least (2))
1016 write_template_param (node
);
1017 else if (template_info
!= NULL
)
1020 write_template_prefix (decl
);
1021 write_template_args (TI_ARGS (template_info
));
1023 else if (TREE_CODE (TREE_TYPE (decl
)) == TYPENAME_TYPE
)
1025 tree name
= TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl
));
1026 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1028 write_template_prefix (decl
);
1029 write_template_args (TREE_OPERAND (name
, 1));
1033 write_prefix (decl_mangling_context (decl
));
1034 write_unqualified_name (decl
);
1038 /* Not templated. */
1040 write_prefix (decl_mangling_context (decl
));
1041 write_unqualified_name (decl
);
1042 if (TREE_CODE (decl
) == VAR_DECL
1043 || TREE_CODE (decl
) == FIELD_DECL
)
1045 /* <data-member-prefix> := <member source-name> M */
1051 add_substitution (node
);
1054 /* <template-prefix> ::= <prefix> <template component>
1055 ::= <template-param>
1056 ::= <substitution> */
1059 write_template_prefix (const tree node
)
1061 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
1062 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
1063 tree context
= decl_mangling_context (decl
);
1068 MANGLE_TRACE_TREE ("template-prefix", node
);
1070 /* Find the template decl. */
1071 if (decl_is_template_id (decl
, &template_info
))
1072 templ
= TI_TEMPLATE (template_info
);
1073 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
1074 /* For a typename type, all we have is the name. */
1075 templ
= DECL_NAME (decl
);
1078 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type
));
1080 templ
= TYPE_TI_TEMPLATE (type
);
1083 /* For a member template, though, the template name for the
1084 innermost name must have all the outer template levels
1085 instantiated. For instance, consider
1087 template<typename T> struct Outer {
1088 template<typename U> struct Inner {};
1091 The template name for `Inner' in `Outer<int>::Inner<float>' is
1092 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1093 levels separately, so there's no TEMPLATE_DECL available for this
1094 (there's only `Outer<T>::Inner<U>').
1096 In order to get the substitutions right, we create a special
1097 TREE_LIST to represent the substitution candidate for a nested
1098 template. The TREE_PURPOSE is the template's context, fully
1099 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1102 So, for the example above, `Outer<int>::Inner' is represented as a
1103 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1104 and whose value is `Outer<T>::Inner<U>'. */
1105 if (TYPE_P (context
))
1106 substitution
= build_tree_list (context
, templ
);
1108 substitution
= templ
;
1110 if (find_substitution (substitution
))
1113 /* In G++ 3.2, the name of the template template parameter was used. */
1114 if (TREE_TYPE (templ
)
1115 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
1116 && !abi_version_at_least (2))
1117 G
.need_abi_warning
= true;
1119 if (TREE_TYPE (templ
)
1120 && TREE_CODE (TREE_TYPE (templ
)) == TEMPLATE_TEMPLATE_PARM
1121 && abi_version_at_least (2))
1122 write_template_param (TREE_TYPE (templ
));
1125 write_prefix (context
);
1126 write_unqualified_name (decl
);
1129 add_substitution (substitution
);
1132 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1133 mangled through special entry points.
1135 <unqualified-name> ::= <operator-name>
1138 ::= <unnamed-type-name>
1139 ::= <local-source-name>
1141 <local-source-name> ::= L <source-name> <discriminator> */
1144 write_unqualified_id (tree identifier
)
1146 if (IDENTIFIER_TYPENAME_P (identifier
))
1147 write_conversion_operator_name (TREE_TYPE (identifier
));
1148 else if (IDENTIFIER_OPNAME_P (identifier
))
1151 const char *mangled_name
= NULL
;
1153 /* Unfortunately, there is no easy way to go from the
1154 name of the operator back to the corresponding tree
1156 for (i
= 0; i
< MAX_TREE_CODES
; ++i
)
1157 if (operator_name_info
[i
].identifier
== identifier
)
1159 /* The ABI says that we prefer binary operator
1160 names to unary operator names. */
1161 if (operator_name_info
[i
].arity
== 2)
1163 mangled_name
= operator_name_info
[i
].mangled_name
;
1166 else if (!mangled_name
)
1167 mangled_name
= operator_name_info
[i
].mangled_name
;
1169 else if (assignment_operator_name_info
[i
].identifier
1173 = assignment_operator_name_info
[i
].mangled_name
;
1176 write_string (mangled_name
);
1178 else if (UDLIT_OPER_P (identifier
))
1179 write_literal_operator_name (identifier
);
1181 write_source_name (identifier
);
1185 write_unqualified_name (const tree decl
)
1187 MANGLE_TRACE_TREE ("unqualified-name", decl
);
1189 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
1191 write_unqualified_id (decl
);
1195 if (DECL_NAME (decl
) == NULL_TREE
)
1197 gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl
));
1198 write_source_name (DECL_ASSEMBLER_NAME (decl
));
1201 else if (DECL_DECLARES_FUNCTION_P (decl
))
1204 if (DECL_CONSTRUCTOR_P (decl
))
1205 write_special_name_constructor (decl
);
1206 else if (DECL_DESTRUCTOR_P (decl
))
1207 write_special_name_destructor (decl
);
1208 else if (DECL_CONV_FN_P (decl
))
1210 /* Conversion operator. Handle it right here.
1211 <operator> ::= cv <type> */
1213 if (decl_is_template_id (decl
, NULL
))
1216 fn_type
= get_mostly_instantiated_function_type (decl
);
1217 type
= TREE_TYPE (fn_type
);
1220 type
= DECL_CONV_FN_TYPE (decl
);
1221 write_conversion_operator_name (type
);
1223 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1225 operator_name_info_t
*oni
;
1226 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1227 oni
= assignment_operator_name_info
;
1229 oni
= operator_name_info
;
1231 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1233 else if (UDLIT_OPER_P (DECL_NAME (decl
)))
1234 write_literal_operator_name (DECL_NAME (decl
));
1242 if (VAR_OR_FUNCTION_DECL_P (decl
) && ! TREE_PUBLIC (decl
)
1243 && DECL_NAMESPACE_SCOPE_P (decl
)
1244 && decl_linkage (decl
) == lk_internal
)
1246 MANGLE_TRACE_TREE ("local-source-name", decl
);
1248 write_source_name (DECL_NAME (decl
));
1249 /* The default discriminator is 1, and that's all we ever use,
1250 so there's no code to output one here. */
1254 tree type
= TREE_TYPE (decl
);
1256 if (TREE_CODE (decl
) == TYPE_DECL
1257 && TYPE_ANONYMOUS_P (type
))
1258 write_unnamed_type_name (type
);
1259 else if (TREE_CODE (decl
) == TYPE_DECL
1260 && LAMBDA_TYPE_P (type
))
1261 write_closure_type_name (type
);
1263 write_source_name (DECL_NAME (decl
));
1267 /* Write the unqualified-name for a conversion operator to TYPE. */
1270 write_conversion_operator_name (const tree type
)
1272 write_string ("cv");
1276 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1278 <source-name> ::= </length/ number> <identifier> */
1281 write_source_name (tree identifier
)
1283 MANGLE_TRACE_TREE ("source-name", identifier
);
1285 /* Never write the whole template-id name including the template
1286 arguments; we only want the template name. */
1287 if (IDENTIFIER_TEMPLATE (identifier
))
1288 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1290 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1291 write_identifier (IDENTIFIER_POINTER (identifier
));
1294 /* Write a user-defined literal operator.
1295 ::= li <source-name> # "" <source-name>
1296 IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1299 write_literal_operator_name (tree identifier
)
1301 const char* suffix
= UDLIT_OP_SUFFIX (identifier
);
1302 write_identifier (UDLIT_OP_MANGLED_PREFIX
);
1303 write_unsigned_number (strlen (suffix
));
1304 write_identifier (suffix
);
1307 /* Encode 0 as _, and 1+ as n-1_. */
1310 write_compact_number (int num
)
1313 write_unsigned_number (num
- 1);
1317 /* Return how many unnamed types precede TYPE in its enclosing class. */
1320 nested_anon_class_index (tree type
)
1323 tree member
= TYPE_FIELDS (TYPE_CONTEXT (type
));
1324 for (; member
; member
= DECL_CHAIN (member
))
1325 if (DECL_IMPLICIT_TYPEDEF_P (member
))
1327 tree memtype
= TREE_TYPE (member
);
1328 if (memtype
== type
)
1330 else if (TYPE_ANONYMOUS_P (memtype
))
1337 /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1340 write_unnamed_type_name (const tree type ATTRIBUTE_UNUSED
)
1343 MANGLE_TRACE_TREE ("unnamed-type-name", type
);
1345 if (TYPE_FUNCTION_SCOPE_P (type
))
1346 discriminator
= local_class_index (type
);
1347 else if (TYPE_CLASS_SCOPE_P (type
))
1348 discriminator
= nested_anon_class_index (type
);
1351 gcc_assert (no_linkage_check (type
, /*relaxed_p=*/true));
1352 /* Just use the old mangling at namespace scope. */
1353 write_source_name (TYPE_IDENTIFIER (type
));
1357 write_string ("Ut");
1358 write_compact_number (discriminator
);
1361 /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
1362 <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
1365 write_closure_type_name (const tree type
)
1367 tree fn
= lambda_function (type
);
1368 tree lambda
= CLASSTYPE_LAMBDA_EXPR (type
);
1369 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1371 MANGLE_TRACE_TREE ("closure-type-name", type
);
1373 write_string ("Ul");
1374 write_method_parms (parms
, /*method_p=*/1, fn
);
1376 write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda
));
1379 /* Convert NUMBER to ascii using base BASE and generating at least
1380 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1381 into which to store the characters. Returns the number of
1382 characters generated (these will be layed out in advance of where
1386 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1387 char *buffer
, const unsigned int min_digits
)
1389 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1390 unsigned digits
= 0;
1394 unsigned HOST_WIDE_INT d
= number
/ base
;
1396 *--buffer
= base_digits
[number
- d
* base
];
1400 while (digits
< min_digits
)
1402 *--buffer
= base_digits
[0];
1408 /* Non-terminal <number>.
1410 <number> ::= [n] </decimal integer/> */
1413 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1414 const unsigned int base
)
1416 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1419 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1422 number
= -((HOST_WIDE_INT
) number
);
1424 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1425 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1428 /* Write out an integral CST in decimal. Most numbers are small, and
1429 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1430 bigger than that, which we must deal with. */
1433 write_integer_cst (const tree cst
)
1435 int sign
= tree_int_cst_sgn (cst
);
1437 if (TREE_INT_CST_HIGH (cst
) + (sign
< 0))
1439 /* A bignum. We do this in chunks, each of which fits in a
1441 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1442 unsigned HOST_WIDE_INT chunk
;
1443 unsigned chunk_digits
;
1444 char *ptr
= buffer
+ sizeof (buffer
);
1449 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1454 if (sizeof (HOST_WIDE_INT
) >= 8)
1456 /* It is at least 64 bits, so 10^18 is representable. */
1461 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1462 base
= build_int_cstu (type
, chunk
);
1463 n
= build_int_cst_wide (type
,
1464 TREE_INT_CST_LOW (cst
), TREE_INT_CST_HIGH (cst
));
1469 n
= fold_build1_loc (input_location
, NEGATE_EXPR
, type
, n
);
1473 tree d
= fold_build2_loc (input_location
, FLOOR_DIV_EXPR
, type
, n
, base
);
1474 tree tmp
= fold_build2_loc (input_location
, MULT_EXPR
, type
, d
, base
);
1477 done
= integer_zerop (d
);
1478 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, type
, n
, tmp
);
1479 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1480 done
? 1 : chunk_digits
);
1486 write_chars (ptr
, count
);
1491 unsigned HOST_WIDE_INT low
= TREE_INT_CST_LOW (cst
);
1498 write_unsigned_number (low
);
1502 /* Write out a floating-point literal.
1504 "Floating-point literals are encoded using the bit pattern of the
1505 target processor's internal representation of that number, as a
1506 fixed-length lowercase hexadecimal string, high-order bytes first
1507 (even if the target processor would store low-order bytes first).
1508 The "n" prefix is not used for floating-point literals; the sign
1509 bit is encoded with the rest of the number.
1511 Here are some examples, assuming the IEEE standard representation
1512 for floating point numbers. (Spaces are for readability, not
1513 part of the encoding.)
1516 -1.0f Lf bf80 0000 E
1517 1.17549435e-38f Lf 0080 0000 E
1518 1.40129846e-45f Lf 0000 0001 E
1519 0.0f Lf 0000 0000 E"
1521 Caller is responsible for the Lx and the E. */
1523 write_real_cst (const tree value
)
1525 if (abi_version_at_least (2))
1527 long target_real
[4]; /* largest supported float */
1528 char buffer
[9]; /* eight hex digits in a 32-bit number */
1531 tree type
= TREE_TYPE (value
);
1532 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1534 real_to_target (target_real
, &TREE_REAL_CST (value
),
1537 /* The value in target_real is in the target word order,
1538 so we must write it out backward if that happens to be
1539 little-endian. write_number cannot be used, it will
1540 produce uppercase. */
1541 if (FLOAT_WORDS_BIG_ENDIAN
)
1542 i
= 0, limit
= words
, dir
= 1;
1544 i
= words
- 1, limit
= -1, dir
= -1;
1546 for (; i
!= limit
; i
+= dir
)
1548 sprintf (buffer
, "%08lx", (unsigned long) target_real
[i
]);
1549 write_chars (buffer
, 8);
1554 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1555 literally. Note that compatibility with 3.2 is impossible,
1556 because the old floating-point emulator used a different
1557 format for REAL_VALUE_TYPE. */
1559 for (i
= 0; i
< sizeof (TREE_REAL_CST (value
)); ++i
)
1560 write_number (((unsigned char *) &TREE_REAL_CST (value
))[i
],
1563 G
.need_abi_warning
= 1;
1567 /* Non-terminal <identifier>.
1569 <identifier> ::= </unqualified source code identifier> */
1572 write_identifier (const char *identifier
)
1574 MANGLE_TRACE ("identifier", identifier
);
1575 write_string (identifier
);
1578 /* Handle constructor productions of non-terminal <special-name>.
1579 CTOR is a constructor FUNCTION_DECL.
1581 <special-name> ::= C1 # complete object constructor
1582 ::= C2 # base object constructor
1583 ::= C3 # complete object allocating constructor
1585 Currently, allocating constructors are never used.
1587 We also need to provide mangled names for the maybe-in-charge
1588 constructor, so we treat it here too. mangle_decl_string will
1589 append *INTERNAL* to that, to make sure we never emit it. */
1592 write_special_name_constructor (const tree ctor
)
1594 if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1595 write_string ("C2");
1598 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor
)
1599 /* Even though we don't ever emit a definition of
1600 the old-style destructor, we still have to
1601 consider entities (like static variables) nested
1603 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
));
1604 write_string ("C1");
1608 /* Handle destructor productions of non-terminal <special-name>.
1609 DTOR is a destructor FUNCTION_DECL.
1611 <special-name> ::= D0 # deleting (in-charge) destructor
1612 ::= D1 # complete object (in-charge) destructor
1613 ::= D2 # base object (not-in-charge) destructor
1615 We also need to provide mangled names for the maybe-incharge
1616 destructor, so we treat it here too. mangle_decl_string will
1617 append *INTERNAL* to that, to make sure we never emit it. */
1620 write_special_name_destructor (const tree dtor
)
1622 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1623 write_string ("D0");
1624 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1625 write_string ("D2");
1628 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor
)
1629 /* Even though we don't ever emit a definition of
1630 the old-style destructor, we still have to
1631 consider entities (like static variables) nested
1633 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
));
1634 write_string ("D1");
1638 /* Scan the vector of local classes and return how many others with the
1639 same name (or same no name) and context precede ENTITY. */
1642 local_class_index (tree entity
)
1644 int ix
, discriminator
= 0;
1645 tree name
= (TYPE_ANONYMOUS_P (entity
) ? NULL_TREE
1646 : TYPE_IDENTIFIER (entity
));
1647 tree ctx
= TYPE_CONTEXT (entity
);
1648 for (ix
= 0; ; ix
++)
1650 tree type
= VEC_index (tree
, local_classes
, ix
);
1652 return discriminator
;
1653 if (TYPE_CONTEXT (type
) == ctx
1654 && (name
? TYPE_IDENTIFIER (type
) == name
1655 : TYPE_ANONYMOUS_P (type
)))
1661 /* Return the discriminator for ENTITY appearing inside
1662 FUNCTION. The discriminator is the lexical ordinal of VAR among
1663 entities with the same name in the same FUNCTION. */
1666 discriminator_for_local_entity (tree entity
)
1668 if (DECL_DISCRIMINATOR_P (entity
))
1670 if (DECL_DISCRIMINATOR_SET_P (entity
))
1671 return DECL_DISCRIMINATOR (entity
);
1673 /* The first entity with a particular name doesn't get
1674 DECL_DISCRIMINATOR set up. */
1677 else if (TREE_CODE (entity
) == TYPE_DECL
)
1679 /* Scan the list of local classes. */
1680 entity
= TREE_TYPE (entity
);
1682 /* Lambdas and unnamed types have their own discriminators. */
1683 if (LAMBDA_TYPE_P (entity
) || TYPE_ANONYMOUS_P (entity
))
1686 return local_class_index (entity
);
1692 /* Return the discriminator for STRING, a string literal used inside
1693 FUNCTION. The discriminator is the lexical ordinal of STRING among
1694 string literals used in FUNCTION. */
1697 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED
,
1698 tree string ATTRIBUTE_UNUSED
)
1700 /* For now, we don't discriminate amongst string literals. */
1704 /* <discriminator> := _ <number>
1706 The discriminator is used only for the second and later occurrences
1707 of the same name within a single function. In this case <number> is
1708 n - 2, if this is the nth occurrence, in lexical order. */
1711 write_discriminator (const int discriminator
)
1713 /* If discriminator is zero, don't write anything. Otherwise... */
1714 if (discriminator
> 0)
1717 write_unsigned_number (discriminator
- 1);
1721 /* Mangle the name of a function-scope entity. FUNCTION is the
1722 FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
1723 default argument scope. ENTITY is the decl for the entity itself.
1724 LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
1725 either ENTITY itself or an enclosing scope of ENTITY.
1727 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1728 := Z <function encoding> E s [<discriminator>]
1729 := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
1732 write_local_name (tree function
, const tree local_entity
,
1735 tree parm
= NULL_TREE
;
1737 MANGLE_TRACE_TREE ("local-name", entity
);
1739 if (TREE_CODE (function
) == PARM_DECL
)
1742 function
= DECL_CONTEXT (parm
);
1746 write_encoding (function
);
1749 /* For this purpose, parameters are numbered from right-to-left. */
1754 for (t
= DECL_ARGUMENTS (function
); t
; t
= DECL_CHAIN (t
))
1762 write_compact_number (i
- 1);
1765 if (TREE_CODE (entity
) == STRING_CST
)
1768 write_discriminator (discriminator_for_string_literal (function
,
1773 /* Now the <entity name>. Let write_name know its being called
1774 from <local-name>, so it doesn't try to process the enclosing
1775 function scope again. */
1776 write_name (entity
, /*ignore_local_scope=*/1);
1777 write_discriminator (discriminator_for_local_entity (local_entity
));
1781 /* Non-terminals <type> and <CV-qualifier>.
1783 <type> ::= <builtin-type>
1785 ::= <class-enum-type>
1787 ::= <pointer-to-member-type>
1788 ::= <template-param>
1791 ::= P <type> # pointer-to
1792 ::= R <type> # reference-to
1793 ::= C <type> # complex pair (C 2000)
1794 ::= G <type> # imaginary (C 2000) [not supported]
1795 ::= U <source-name> <type> # vendor extended type qualifier
1799 <type> ::= RR <type> # rvalue reference-to
1800 <type> ::= Dt <expression> # decltype of an id-expression or
1801 # class member access
1802 <type> ::= DT <expression> # decltype of an expression
1803 <type> ::= Dn # decltype of nullptr
1805 TYPE is a type node. */
1808 write_type (tree type
)
1810 /* This gets set to nonzero if TYPE turns out to be a (possibly
1811 CV-qualified) builtin type. */
1812 int is_builtin_type
= 0;
1814 MANGLE_TRACE_TREE ("type", type
);
1816 if (type
== error_mark_node
)
1819 type
= canonicalize_for_substitution (type
);
1820 if (find_substitution (type
))
1824 if (write_CV_qualifiers_for_type (type
) > 0)
1825 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1826 mangle the unqualified type. The recursive call is needed here
1827 since both the qualified and unqualified types are substitution
1829 write_type (TYPE_MAIN_VARIANT (type
));
1830 else if (TREE_CODE (type
) == ARRAY_TYPE
)
1831 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1832 so that the cv-qualification of the element type is available
1833 in write_array_type. */
1834 write_array_type (type
);
1837 tree type_orig
= type
;
1839 /* See through any typedefs. */
1840 type
= TYPE_MAIN_VARIANT (type
);
1842 /* According to the C++ ABI, some library classes are passed the
1843 same as the scalar type of their single member and use the same
1845 if (TREE_CODE (type
) == RECORD_TYPE
&& TYPE_TRANSPARENT_AGGR (type
))
1846 type
= TREE_TYPE (first_field (type
));
1848 if (TYPE_PTRDATAMEM_P (type
))
1849 write_pointer_to_member_type (type
);
1852 /* Handle any target-specific fundamental types. */
1853 const char *target_mangling
1854 = targetm
.mangle_type (type_orig
);
1856 if (target_mangling
)
1858 write_string (target_mangling
);
1859 /* Add substitutions for types other than fundamental
1861 if (TREE_CODE (type
) != VOID_TYPE
1862 && TREE_CODE (type
) != INTEGER_TYPE
1863 && TREE_CODE (type
) != REAL_TYPE
1864 && TREE_CODE (type
) != BOOLEAN_TYPE
)
1865 add_substitution (type
);
1869 switch (TREE_CODE (type
))
1873 case INTEGER_TYPE
: /* Includes wchar_t. */
1875 case FIXED_POINT_TYPE
:
1877 /* If this is a typedef, TYPE may not be one of
1878 the standard builtin type nodes, but an alias of one. Use
1879 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1880 write_builtin_type (TYPE_MAIN_VARIANT (type
));
1887 write_type (TREE_TYPE (type
));
1892 write_function_type (type
);
1898 /* A pointer-to-member function is represented as a special
1899 RECORD_TYPE, so check for this first. */
1900 if (TYPE_PTRMEMFUNC_P (type
))
1901 write_pointer_to_member_type (type
);
1903 write_class_enum_type (type
);
1907 case UNBOUND_CLASS_TEMPLATE
:
1908 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1909 ordinary nested names. */
1910 write_nested_name (TYPE_STUB_DECL (type
));
1914 case REFERENCE_TYPE
:
1915 if (TREE_CODE (type
) == POINTER_TYPE
)
1917 else if (TYPE_REF_IS_RVALUE (type
))
1922 tree target
= TREE_TYPE (type
);
1923 /* Attribute const/noreturn are not reflected in mangling.
1924 We strip them here rather than at a lower level because
1925 a typedef or template argument can have function type
1926 with function-cv-quals (that use the same representation),
1927 but you can't have a pointer/reference to such a type. */
1928 if (abi_version_at_least (5)
1929 && TREE_CODE (target
) == FUNCTION_TYPE
)
1930 target
= build_qualified_type (target
, TYPE_UNQUALIFIED
);
1931 write_type (target
);
1935 case TEMPLATE_TYPE_PARM
:
1938 write_identifier ("Da");
1942 /* else fall through. */
1943 case TEMPLATE_PARM_INDEX
:
1944 write_template_param (type
);
1947 case TEMPLATE_TEMPLATE_PARM
:
1948 write_template_template_param (type
);
1951 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1952 write_template_template_param (type
);
1954 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
1958 if (abi_version_at_least (4))
1960 write_string ("Dv");
1961 /* Non-constant vector size would be encoded with
1962 _ expression, but we don't support that yet. */
1963 write_unsigned_number (TYPE_VECTOR_SUBPARTS (type
));
1968 G
.need_abi_warning
= 1;
1969 write_string ("U8__vector");
1971 write_type (TREE_TYPE (type
));
1974 case TYPE_PACK_EXPANSION
:
1975 write_string ("Dp");
1976 write_type (PACK_EXPANSION_PATTERN (type
));
1980 /* These shouldn't make it into mangling. */
1981 gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type
)
1982 && !DECLTYPE_FOR_LAMBDA_PROXY (type
));
1984 /* In ABI <5, we stripped decltype of a plain decl. */
1985 if (!abi_version_at_least (5)
1986 && DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
1988 tree expr
= DECLTYPE_TYPE_EXPR (type
);
1989 tree etype
= NULL_TREE
;
1990 switch (TREE_CODE (expr
))
1997 case TEMPLATE_PARM_INDEX
:
1998 etype
= TREE_TYPE (expr
);
2005 if (etype
&& !type_uses_auto (etype
))
2007 G
.need_abi_warning
= 1;
2014 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
))
2018 ++cp_unevaluated_operand
;
2019 write_expression (DECLTYPE_TYPE_EXPR (type
));
2020 --cp_unevaluated_operand
;
2025 write_string ("Dn");
2026 if (abi_version_at_least (7))
2031 sorry ("mangling typeof, use decltype instead");
2034 case UNDERLYING_TYPE
:
2035 sorry ("mangling __underlying_type");
2047 /* Types other than builtin types are substitution candidates. */
2048 if (!is_builtin_type
)
2049 add_substitution (type
);
2052 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2053 CV-qualifiers written for TYPE.
2055 <CV-qualifiers> ::= [r] [V] [K] */
2058 write_CV_qualifiers_for_type (const tree type
)
2060 int num_qualifiers
= 0;
2062 /* The order is specified by:
2064 "In cases where multiple order-insensitive qualifiers are
2065 present, they should be ordered 'K' (closest to the base type),
2066 'V', 'r', and 'U' (farthest from the base type) ..."
2068 Note that we do not use cp_type_quals below; given "const
2069 int[3]", the "const" is emitted with the "int", not with the
2071 cp_cv_quals quals
= TYPE_QUALS (type
);
2073 if (quals
& TYPE_QUAL_RESTRICT
)
2078 if (quals
& TYPE_QUAL_VOLATILE
)
2083 if (quals
& TYPE_QUAL_CONST
)
2089 return num_qualifiers
;
2092 /* Non-terminal <builtin-type>.
2094 <builtin-type> ::= v # void
2099 ::= h # unsigned char
2101 ::= t # unsigned short
2103 ::= j # unsigned int
2105 ::= m # unsigned long
2106 ::= x # long long, __int64
2107 ::= y # unsigned long long, __int64
2109 ::= o # unsigned __int128
2112 ::= e # long double, __float80
2113 ::= g # __float128 [not supported]
2114 ::= u <source-name> # vendor extended type */
2117 write_builtin_type (tree type
)
2119 if (TYPE_CANONICAL (type
))
2120 type
= TYPE_CANONICAL (type
);
2122 switch (TREE_CODE (type
))
2133 /* TYPE may still be wchar_t, char16_t, or char32_t, since that
2134 isn't in integer_type_nodes. */
2135 if (type
== wchar_type_node
)
2137 else if (type
== char16_type_node
)
2138 write_string ("Ds");
2139 else if (type
== char32_type_node
)
2140 write_string ("Di");
2141 else if (TYPE_FOR_JAVA (type
))
2142 write_java_integer_type_codes (type
);
2146 /* Assume TYPE is one of the shared integer type nodes. Find
2147 it in the array of these nodes. */
2149 for (itk
= 0; itk
< itk_none
; ++itk
)
2150 if (integer_types
[itk
] != NULL_TREE
2151 && type
== integer_types
[itk
])
2153 /* Print the corresponding single-letter code. */
2154 write_char (integer_type_codes
[itk
]);
2158 if (itk
== itk_none
)
2160 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
2161 TYPE_UNSIGNED (type
));
2168 if (TYPE_PRECISION (type
) == 128)
2169 write_char (TYPE_UNSIGNED (type
) ? 'o' : 'n');
2172 /* Allow for cases where TYPE is not one of the shared
2173 integer type nodes and write a "vendor extended builtin
2174 type" with a name the form intN or uintN, respectively.
2175 Situations like this can happen if you have an
2176 __attribute__((__mode__(__SI__))) type and use exotic
2177 switches like '-mint8' on AVR. Of course, this is
2178 undefined by the C++ ABI (and '-mint8' is not even
2179 Standard C conforming), but when using such special
2180 options you're pretty much in nowhere land anyway. */
2182 char prec
[11]; /* up to ten digits for an unsigned */
2184 prefix
= TYPE_UNSIGNED (type
) ? "uint" : "int";
2185 sprintf (prec
, "%u", (unsigned) TYPE_PRECISION (type
));
2186 write_char ('u'); /* "vendor extended builtin type" */
2187 write_unsigned_number (strlen (prefix
) + strlen (prec
));
2188 write_string (prefix
);
2189 write_string (prec
);
2196 if (type
== float_type_node
2197 || type
== java_float_type_node
)
2199 else if (type
== double_type_node
2200 || type
== java_double_type_node
)
2202 else if (type
== long_double_type_node
)
2204 else if (type
== dfloat32_type_node
)
2205 write_string ("Df");
2206 else if (type
== dfloat64_type_node
)
2207 write_string ("Dd");
2208 else if (type
== dfloat128_type_node
)
2209 write_string ("De");
2214 case FIXED_POINT_TYPE
:
2215 write_string ("DF");
2216 if (GET_MODE_IBIT (TYPE_MODE (type
)) > 0)
2217 write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type
)));
2218 if (type
== fract_type_node
2219 || type
== sat_fract_type_node
2220 || type
== accum_type_node
2221 || type
== sat_accum_type_node
)
2223 else if (type
== unsigned_fract_type_node
2224 || type
== sat_unsigned_fract_type_node
2225 || type
== unsigned_accum_type_node
2226 || type
== sat_unsigned_accum_type_node
)
2228 else if (type
== short_fract_type_node
2229 || type
== sat_short_fract_type_node
2230 || type
== short_accum_type_node
2231 || type
== sat_short_accum_type_node
)
2233 else if (type
== unsigned_short_fract_type_node
2234 || type
== sat_unsigned_short_fract_type_node
2235 || type
== unsigned_short_accum_type_node
2236 || type
== sat_unsigned_short_accum_type_node
)
2238 else if (type
== long_fract_type_node
2239 || type
== sat_long_fract_type_node
2240 || type
== long_accum_type_node
2241 || type
== sat_long_accum_type_node
)
2243 else if (type
== unsigned_long_fract_type_node
2244 || type
== sat_unsigned_long_fract_type_node
2245 || type
== unsigned_long_accum_type_node
2246 || type
== sat_unsigned_long_accum_type_node
)
2248 else if (type
== long_long_fract_type_node
2249 || type
== sat_long_long_fract_type_node
2250 || type
== long_long_accum_type_node
2251 || type
== sat_long_long_accum_type_node
)
2253 else if (type
== unsigned_long_long_fract_type_node
2254 || type
== sat_unsigned_long_long_fract_type_node
2255 || type
== unsigned_long_long_accum_type_node
2256 || type
== sat_unsigned_long_long_accum_type_node
)
2259 sorry ("mangling unknown fixed point type");
2260 write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type
)));
2261 if (TYPE_SATURATING (type
))
2272 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
2273 METHOD_TYPE. The return type is mangled before the parameter
2276 <function-type> ::= F [Y] <bare-function-type> E */
2279 write_function_type (const tree type
)
2281 MANGLE_TRACE_TREE ("function-type", type
);
2283 /* For a pointer to member function, the function type may have
2284 cv-qualifiers, indicating the quals for the artificial 'this'
2286 if (TREE_CODE (type
) == METHOD_TYPE
)
2288 /* The first parameter must be a POINTER_TYPE pointing to the
2289 `this' parameter. */
2290 tree this_type
= class_of_this_parm (type
);
2291 write_CV_qualifiers_for_type (this_type
);
2295 /* We don't track whether or not a type is `extern "C"'. Note that
2296 you can have an `extern "C"' function that does not have
2297 `extern "C"' type, and vice versa:
2299 extern "C" typedef void function_t();
2300 function_t f; // f has C++ linkage, but its type is
2303 typedef void function_t();
2304 extern "C" function_t f; // Vice versa.
2307 write_bare_function_type (type
, /*include_return_type_p=*/1,
2312 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
2313 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
2314 is mangled before the parameter types. If non-NULL, DECL is
2315 FUNCTION_DECL for the function whose type is being emitted.
2317 If DECL is a member of a Java type, then a literal 'J'
2318 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
2321 <bare-function-type> ::= [J]</signature/ type>+ */
2324 write_bare_function_type (const tree type
, const int include_return_type_p
,
2329 MANGLE_TRACE_TREE ("bare-function-type", type
);
2331 /* Detect Java methods and emit special encoding. */
2333 && DECL_FUNCTION_MEMBER_P (decl
)
2334 && TYPE_FOR_JAVA (DECL_CONTEXT (decl
))
2335 && !DECL_CONSTRUCTOR_P (decl
)
2336 && !DECL_DESTRUCTOR_P (decl
)
2337 && !DECL_CONV_FN_P (decl
))
2347 /* Mangle the return type, if requested. */
2348 if (include_return_type_p
|| java_method_p
)
2349 write_type (TREE_TYPE (type
));
2351 /* Now mangle the types of the arguments. */
2353 write_method_parms (TYPE_ARG_TYPES (type
),
2354 TREE_CODE (type
) == METHOD_TYPE
,
2359 /* Write the mangled representation of a method parameter list of
2360 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
2361 considered a non-static method, and the this parameter is omitted.
2362 If non-NULL, DECL is the FUNCTION_DECL for the function whose
2363 parameters are being emitted. */
2366 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
2368 tree first_parm_type
;
2369 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
2371 /* Assume this parameter type list is variable-length. If it ends
2372 with a void type, then it's not. */
2375 /* If this is a member function, skip the first arg, which is the
2377 "Member functions do not encode the type of their implicit this
2380 Similarly, there's no need to mangle artificial parameters, like
2381 the VTT parameters for constructors and destructors. */
2384 parm_types
= TREE_CHAIN (parm_types
);
2385 parm_decl
= parm_decl
? DECL_CHAIN (parm_decl
) : NULL_TREE
;
2387 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
2389 parm_types
= TREE_CHAIN (parm_types
);
2390 parm_decl
= DECL_CHAIN (parm_decl
);
2394 for (first_parm_type
= parm_types
;
2396 parm_types
= TREE_CHAIN (parm_types
))
2398 tree parm
= TREE_VALUE (parm_types
);
2399 if (parm
== void_type_node
)
2401 /* "Empty parameter lists, whether declared as () or
2402 conventionally as (void), are encoded with a void parameter
2404 if (parm_types
== first_parm_type
)
2406 /* If the parm list is terminated with a void type, it's
2409 /* A void type better be the last one. */
2410 gcc_assert (TREE_CHAIN (parm_types
) == NULL
);
2417 /* <builtin-type> ::= z # ellipsis */
2421 /* <class-enum-type> ::= <name> */
2424 write_class_enum_type (const tree type
)
2426 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
2429 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
2432 <template-args> ::= I <template-arg>* E */
2435 write_template_args (tree args
)
2440 MANGLE_TRACE_TREE ("template-args", args
);
2445 length
= TREE_VEC_LENGTH (args
);
2447 if (args
&& TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
2449 /* We have nested template args. We want the innermost template
2451 args
= TREE_VEC_ELT (args
, length
- 1);
2452 length
= TREE_VEC_LENGTH (args
);
2454 for (i
= 0; i
< length
; ++i
)
2455 write_template_arg (TREE_VEC_ELT (args
, i
));
2462 <unqualified-name> <template-args>
2463 part of SCOPE_REF or COMPONENT_REF mangling. */
2466 write_member_name (tree member
)
2468 if (TREE_CODE (member
) == IDENTIFIER_NODE
)
2469 write_unqualified_id (member
);
2470 else if (DECL_P (member
))
2471 write_unqualified_name (member
);
2472 else if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
2474 tree name
= TREE_OPERAND (member
, 0);
2475 if (TREE_CODE (name
) == OVERLOAD
)
2476 name
= OVL_FUNCTION (name
);
2477 write_member_name (name
);
2478 write_template_args (TREE_OPERAND (member
, 1));
2481 write_expression (member
);
2484 /* <expression> ::= <unary operator-name> <expression>
2485 ::= <binary operator-name> <expression> <expression>
2488 <expr-primary> ::= <template-param>
2489 ::= L <type> <value number> E # literal
2490 ::= L <mangled-name> E # external name
2491 ::= st <type> # sizeof
2492 ::= sr <type> <unqualified-name> # dependent name
2493 ::= sr <type> <unqualified-name> <template-args> */
2496 write_expression (tree expr
)
2498 enum tree_code code
= TREE_CODE (expr
);
2500 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2501 is converted (via qualification conversions) to another
2503 while (TREE_CODE (expr
) == NOP_EXPR
2504 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2506 expr
= TREE_OPERAND (expr
, 0);
2507 code
= TREE_CODE (expr
);
2510 if (code
== BASELINK
2511 && (!type_unknown_p (expr
)
2512 || !BASELINK_QUALIFIED_P (expr
)))
2514 expr
= BASELINK_FUNCTIONS (expr
);
2515 code
= TREE_CODE (expr
);
2518 /* Handle pointers-to-members by making them look like expression
2520 if (code
== PTRMEM_CST
)
2522 expr
= build_nt (ADDR_EXPR
,
2523 build_qualified_name (/*type=*/NULL_TREE
,
2524 PTRMEM_CST_CLASS (expr
),
2525 PTRMEM_CST_MEMBER (expr
),
2526 /*template_p=*/false));
2527 code
= TREE_CODE (expr
);
2530 /* Handle template parameters. */
2531 if (code
== TEMPLATE_TYPE_PARM
2532 || code
== TEMPLATE_TEMPLATE_PARM
2533 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
2534 || code
== TEMPLATE_PARM_INDEX
)
2535 write_template_param (expr
);
2536 /* Handle literals. */
2537 else if (TREE_CODE_CLASS (code
) == tcc_constant
2538 || (abi_version_at_least (2) && code
== CONST_DECL
))
2539 write_template_arg_literal (expr
);
2540 else if (code
== PARM_DECL
&& DECL_ARTIFICIAL (expr
))
2542 gcc_assert (!strcmp ("this", IDENTIFIER_POINTER (DECL_NAME (expr
))));
2543 write_string ("fpT");
2545 else if (code
== PARM_DECL
)
2547 /* A function parameter used in a late-specified return type. */
2548 int index
= DECL_PARM_INDEX (expr
);
2549 int level
= DECL_PARM_LEVEL (expr
);
2550 int delta
= G
.parm_depth
- level
+ 1;
2551 gcc_assert (index
>= 1);
2555 if (abi_version_at_least (5))
2557 /* Let L be the number of function prototype scopes from the
2558 innermost one (in which the parameter reference occurs) up
2559 to (and including) the one containing the declaration of
2560 the referenced parameter. If the parameter declaration
2561 clause of the innermost function prototype scope has been
2562 completely seen, it is not counted (in that case -- which
2563 is perhaps the most common -- L can be zero). */
2565 write_unsigned_number (delta
- 1);
2568 G
.need_abi_warning
= true;
2571 write_compact_number (index
- 1);
2573 else if (DECL_P (expr
))
2575 /* G++ 3.2 incorrectly mangled non-type template arguments of
2576 enumeration type using their names. */
2577 if (code
== CONST_DECL
)
2578 G
.need_abi_warning
= 1;
2580 write_mangled_name (expr
, false);
2583 else if (TREE_CODE (expr
) == SIZEOF_EXPR
2584 && TYPE_P (TREE_OPERAND (expr
, 0)))
2586 write_string ("st");
2587 write_type (TREE_OPERAND (expr
, 0));
2589 else if (TREE_CODE (expr
) == ALIGNOF_EXPR
2590 && TYPE_P (TREE_OPERAND (expr
, 0)))
2592 write_string ("at");
2593 write_type (TREE_OPERAND (expr
, 0));
2595 else if (code
== SCOPE_REF
2596 || code
== BASELINK
)
2599 if (code
== SCOPE_REF
)
2601 scope
= TREE_OPERAND (expr
, 0);
2602 member
= TREE_OPERAND (expr
, 1);
2606 scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (expr
));
2607 member
= BASELINK_FUNCTIONS (expr
);
2610 if (!abi_version_at_least (2) && DECL_P (member
))
2612 write_string ("sr");
2614 /* G++ 3.2 incorrectly put out both the "sr" code and
2615 the nested name of the qualified name. */
2616 G
.need_abi_warning
= 1;
2617 write_encoding (member
);
2620 /* If the MEMBER is a real declaration, then the qualifying
2621 scope was not dependent. Ideally, we would not have a
2622 SCOPE_REF in those cases, but sometimes we do. If the second
2623 argument is a DECL, then the name must not have been
2625 else if (DECL_P (member
))
2626 write_expression (member
);
2629 write_string ("sr");
2631 write_member_name (member
);
2634 else if (TREE_CODE (expr
) == INDIRECT_REF
2635 && TREE_TYPE (TREE_OPERAND (expr
, 0))
2636 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2638 write_expression (TREE_OPERAND (expr
, 0));
2640 else if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
2642 /* An operator name appearing as a dependent name needs to be
2643 specially marked to disambiguate between a use of the operator
2644 name and a use of the operator in an expression. */
2645 if (IDENTIFIER_OPNAME_P (expr
))
2646 write_string ("on");
2647 write_unqualified_id (expr
);
2649 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
2651 tree fn
= TREE_OPERAND (expr
, 0);
2652 if (is_overloaded_fn (fn
))
2653 fn
= DECL_NAME (get_first_fn (fn
));
2654 if (IDENTIFIER_OPNAME_P (fn
))
2655 write_string ("on");
2656 write_unqualified_id (fn
);
2657 write_template_args (TREE_OPERAND (expr
, 1));
2659 else if (TREE_CODE (expr
) == MODOP_EXPR
)
2661 enum tree_code subop
= TREE_CODE (TREE_OPERAND (expr
, 1));
2662 const char *name
= (assignment_operator_name_info
[(int) subop
]
2664 write_string (name
);
2665 write_expression (TREE_OPERAND (expr
, 0));
2666 write_expression (TREE_OPERAND (expr
, 2));
2668 else if (code
== NEW_EXPR
|| code
== VEC_NEW_EXPR
)
2670 /* ::= [gs] nw <expression>* _ <type> E
2671 ::= [gs] nw <expression>* _ <type> <initializer>
2672 ::= [gs] na <expression>* _ <type> E
2673 ::= [gs] na <expression>* _ <type> <initializer>
2674 <initializer> ::= pi <expression>* E */
2675 tree placement
= TREE_OPERAND (expr
, 0);
2676 tree type
= TREE_OPERAND (expr
, 1);
2677 tree nelts
= TREE_OPERAND (expr
, 2);
2678 tree init
= TREE_OPERAND (expr
, 3);
2681 gcc_assert (code
== NEW_EXPR
);
2682 if (TREE_OPERAND (expr
, 2))
2683 code
= VEC_NEW_EXPR
;
2685 if (NEW_EXPR_USE_GLOBAL (expr
))
2686 write_string ("gs");
2688 write_string (operator_name_info
[(int) code
].mangled_name
);
2690 for (t
= placement
; t
; t
= TREE_CHAIN (t
))
2691 write_expression (TREE_VALUE (t
));
2698 ++processing_template_decl
;
2699 domain
= compute_array_index_type (NULL_TREE
, nelts
,
2700 tf_warning_or_error
);
2701 type
= build_cplus_array_type (type
, domain
);
2702 --processing_template_decl
;
2706 if (init
&& TREE_CODE (init
) == TREE_LIST
2707 && TREE_CODE (TREE_VALUE (init
)) == CONSTRUCTOR
2708 && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init
)))
2709 write_expression (TREE_VALUE (init
));
2713 write_string ("pi");
2714 if (init
&& init
!= void_zero_node
)
2715 for (t
= init
; t
; t
= TREE_CHAIN (t
))
2716 write_expression (TREE_VALUE (t
));
2720 else if (code
== DELETE_EXPR
|| code
== VEC_DELETE_EXPR
)
2722 gcc_assert (code
== DELETE_EXPR
);
2723 if (DELETE_EXPR_USE_VEC (expr
))
2724 code
= VEC_DELETE_EXPR
;
2726 if (DELETE_EXPR_USE_GLOBAL (expr
))
2727 write_string ("gs");
2729 write_string (operator_name_info
[(int) code
].mangled_name
);
2731 write_expression (TREE_OPERAND (expr
, 0));
2733 else if (code
== THROW_EXPR
)
2735 tree op
= TREE_OPERAND (expr
, 0);
2738 write_string ("tw");
2739 write_expression (op
);
2742 write_string ("tr");
2744 else if (code
== CONSTRUCTOR
)
2746 VEC(constructor_elt
,gc
)* elts
= CONSTRUCTOR_ELTS (expr
);
2747 unsigned i
; tree val
;
2749 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
2750 write_string ("il");
2753 write_string ("tl");
2754 write_type (TREE_TYPE (expr
));
2756 FOR_EACH_CONSTRUCTOR_VALUE (elts
, i
, val
)
2757 write_expression (val
);
2760 else if (dependent_name (expr
))
2762 write_unqualified_id (dependent_name (expr
));
2769 /* When we bind a variable or function to a non-type template
2770 argument with reference type, we create an ADDR_EXPR to show
2771 the fact that the entity's address has been taken. But, we
2772 don't actually want to output a mangling code for the `&'. */
2773 if (TREE_CODE (expr
) == ADDR_EXPR
2775 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
2777 expr
= TREE_OPERAND (expr
, 0);
2780 write_expression (expr
);
2784 code
= TREE_CODE (expr
);
2787 if (code
== COMPONENT_REF
)
2789 tree ob
= TREE_OPERAND (expr
, 0);
2791 if (TREE_CODE (ob
) == ARROW_EXPR
)
2793 write_string (operator_name_info
[(int)code
].mangled_name
);
2794 ob
= TREE_OPERAND (ob
, 0);
2797 write_string ("dt");
2799 write_expression (ob
);
2800 write_member_name (TREE_OPERAND (expr
, 1));
2804 /* If it wasn't any of those, recursively expand the expression. */
2805 name
= operator_name_info
[(int) code
].mangled_name
;
2807 /* We used to mangle const_cast and static_cast like a C cast. */
2808 if (!abi_version_at_least (6)
2809 && (code
== CONST_CAST_EXPR
2810 || code
== STATIC_CAST_EXPR
))
2812 name
= operator_name_info
[CAST_EXPR
].mangled_name
;
2813 G
.need_abi_warning
= 1;
2821 error ("use of built-in trait %qE in function signature; "
2822 "use library traits instead", expr
);
2826 sorry ("mangling %C", code
);
2832 write_string (name
);
2838 tree fn
= CALL_EXPR_FN (expr
);
2840 if (TREE_CODE (fn
) == ADDR_EXPR
)
2841 fn
= TREE_OPERAND (fn
, 0);
2843 /* Mangle a dependent name as the name, not whatever happens to
2844 be the first function in the overload set. */
2845 if ((TREE_CODE (fn
) == FUNCTION_DECL
2846 || TREE_CODE (fn
) == OVERLOAD
)
2847 && type_dependent_expression_p_push (expr
))
2848 fn
= DECL_NAME (get_first_fn (fn
));
2850 write_expression (fn
);
2853 for (i
= 0; i
< call_expr_nargs (expr
); ++i
)
2854 write_expression (CALL_EXPR_ARG (expr
, i
));
2859 write_type (TREE_TYPE (expr
));
2860 if (list_length (TREE_OPERAND (expr
, 0)) == 1)
2861 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
2864 tree args
= TREE_OPERAND (expr
, 0);
2866 for (; args
; args
= TREE_CHAIN (args
))
2867 write_expression (TREE_VALUE (args
));
2872 case DYNAMIC_CAST_EXPR
:
2873 case REINTERPRET_CAST_EXPR
:
2874 case STATIC_CAST_EXPR
:
2875 case CONST_CAST_EXPR
:
2876 write_type (TREE_TYPE (expr
));
2877 write_expression (TREE_OPERAND (expr
, 0));
2880 case PREINCREMENT_EXPR
:
2881 case PREDECREMENT_EXPR
:
2882 if (abi_version_at_least (6))
2885 G
.need_abi_warning
= 1;
2889 /* In the middle-end, some expressions have more operands than
2890 they do in templates (and mangling). */
2891 len
= cp_tree_operand_length (expr
);
2893 for (i
= 0; i
< len
; ++i
)
2895 tree operand
= TREE_OPERAND (expr
, i
);
2896 /* As a GNU extension, the middle operand of a
2897 conditional may be omitted. Since expression
2898 manglings are supposed to represent the input token
2899 stream, there's no good way to mangle such an
2900 expression without extending the C++ ABI. */
2901 if (code
== COND_EXPR
&& i
== 1 && !operand
)
2903 error ("omitted middle operand to %<?:%> operand "
2904 "cannot be mangled");
2907 write_expression (operand
);
2913 /* Literal subcase of non-terminal <template-arg>.
2915 "Literal arguments, e.g. "A<42L>", are encoded with their type
2916 and value. Negative integer values are preceded with "n"; for
2917 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2918 encoded as 0, true as 1." */
2921 write_template_arg_literal (const tree value
)
2924 write_type (TREE_TYPE (value
));
2926 /* Write a null member pointer value as (type)0, regardless of its
2927 real representation. */
2928 if (null_member_pointer_value_p (value
))
2929 write_integer_cst (integer_zero_node
);
2931 switch (TREE_CODE (value
))
2934 write_integer_cst (DECL_INITIAL (value
));
2938 gcc_assert (!same_type_p (TREE_TYPE (value
), boolean_type_node
)
2939 || integer_zerop (value
) || integer_onep (value
));
2940 write_integer_cst (value
);
2944 write_real_cst (value
);
2948 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
2949 && TREE_CODE (TREE_IMAGPART (value
)) == INTEGER_CST
)
2951 write_integer_cst (TREE_REALPART (value
));
2953 write_integer_cst (TREE_IMAGPART (value
));
2955 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
2956 && TREE_CODE (TREE_IMAGPART (value
)) == REAL_CST
)
2958 write_real_cst (TREE_REALPART (value
));
2960 write_real_cst (TREE_IMAGPART (value
));
2967 sorry ("string literal in function template signature");
2977 /* Non-terminal <template-arg>.
2979 <template-arg> ::= <type> # type
2980 ::= L <type> </value/ number> E # literal
2981 ::= LZ <name> E # external name
2982 ::= X <expression> E # expression */
2985 write_template_arg (tree node
)
2987 enum tree_code code
= TREE_CODE (node
);
2989 MANGLE_TRACE_TREE ("template-arg", node
);
2991 /* A template template parameter's argument list contains TREE_LIST
2992 nodes of which the value field is the actual argument. */
2993 if (code
== TREE_LIST
)
2995 node
= TREE_VALUE (node
);
2996 /* If it's a decl, deal with its type instead. */
2999 node
= TREE_TYPE (node
);
3000 code
= TREE_CODE (node
);
3004 if (TREE_CODE (node
) == NOP_EXPR
3005 && TREE_CODE (TREE_TYPE (node
)) == REFERENCE_TYPE
)
3007 /* Template parameters can be of reference type. To maintain
3008 internal consistency, such arguments use a conversion from
3009 address of object to reference type. */
3010 gcc_assert (TREE_CODE (TREE_OPERAND (node
, 0)) == ADDR_EXPR
);
3011 if (abi_version_at_least (2))
3012 node
= TREE_OPERAND (TREE_OPERAND (node
, 0), 0);
3014 G
.need_abi_warning
= 1;
3017 if (TREE_CODE (node
) == BASELINK
3018 && !type_unknown_p (node
))
3020 if (abi_version_at_least (6))
3021 node
= BASELINK_FUNCTIONS (node
);
3023 /* We wrongly wrapped a class-scope function in X/E. */
3024 G
.need_abi_warning
= 1;
3027 if (ARGUMENT_PACK_P (node
))
3029 /* Expand the template argument pack. */
3030 tree args
= ARGUMENT_PACK_ARGS (node
);
3031 int i
, length
= TREE_VEC_LENGTH (args
);
3032 if (abi_version_at_least (6))
3037 G
.need_abi_warning
= 1;
3039 for (i
= 0; i
< length
; ++i
)
3040 write_template_arg (TREE_VEC_ELT (args
, i
));
3043 else if (TYPE_P (node
))
3045 else if (code
== TEMPLATE_DECL
)
3046 /* A template appearing as a template arg is a template template arg. */
3047 write_template_template_arg (node
);
3048 else if ((TREE_CODE_CLASS (code
) == tcc_constant
&& code
!= PTRMEM_CST
)
3049 || (abi_version_at_least (2) && code
== CONST_DECL
)
3050 || null_member_pointer_value_p (node
))
3051 write_template_arg_literal (node
);
3052 else if (DECL_P (node
))
3054 /* Until ABI version 2, non-type template arguments of
3055 enumeration type were mangled using their names. */
3056 if (code
== CONST_DECL
&& !abi_version_at_least (2))
3057 G
.need_abi_warning
= 1;
3059 /* Until ABI version 3, the underscore before the mangled name
3060 was incorrectly omitted. */
3061 if (!abi_version_at_least (3))
3063 G
.need_abi_warning
= 1;
3067 write_string ("_Z");
3068 write_encoding (node
);
3073 /* Template arguments may be expressions. */
3075 write_expression (node
);
3080 /* <template-template-arg>
3082 ::= <substitution> */
3085 write_template_template_arg (const tree decl
)
3087 MANGLE_TRACE_TREE ("template-template-arg", decl
);
3089 if (find_substitution (decl
))
3091 write_name (decl
, /*ignore_local_scope=*/0);
3092 add_substitution (decl
);
3096 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
3098 <array-type> ::= A [</dimension/ number>] _ </element/ type>
3099 ::= A <expression> _ </element/ type>
3101 "Array types encode the dimension (number of elements) and the
3102 element type. For variable length arrays, the dimension (but not
3103 the '_' separator) is omitted." */
3106 write_array_type (const tree type
)
3109 if (TYPE_DOMAIN (type
))
3114 index_type
= TYPE_DOMAIN (type
);
3115 /* The INDEX_TYPE gives the upper and lower bounds of the
3117 max
= TYPE_MAX_VALUE (index_type
);
3118 if (TREE_CODE (max
) == INTEGER_CST
)
3120 /* The ABI specifies that we should mangle the number of
3121 elements in the array, not the largest allowed index. */
3123 = double_int_add (tree_to_double_int (max
), double_int_one
);
3124 gcc_assert (double_int_fits_in_uhwi_p (dmax
));
3125 write_unsigned_number (dmax
.low
);
3129 max
= TREE_OPERAND (max
, 0);
3130 if (!abi_version_at_least (2))
3132 /* value_dependent_expression_p presumes nothing is
3133 dependent when PROCESSING_TEMPLATE_DECL is zero. */
3134 ++processing_template_decl
;
3135 if (!value_dependent_expression_p (max
))
3136 G
.need_abi_warning
= 1;
3137 --processing_template_decl
;
3139 write_expression (max
);
3144 write_type (TREE_TYPE (type
));
3147 /* Non-terminal <pointer-to-member-type> for pointer-to-member
3148 variables. TYPE is a pointer-to-member POINTER_TYPE.
3150 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
3153 write_pointer_to_member_type (const tree type
)
3156 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
3157 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
3160 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
3161 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
3162 TEMPLATE_PARM_INDEX.
3164 <template-param> ::= T </parameter/ number> _ */
3167 write_template_param (const tree parm
)
3171 MANGLE_TRACE_TREE ("template-parm", parm
);
3173 switch (TREE_CODE (parm
))
3175 case TEMPLATE_TYPE_PARM
:
3176 case TEMPLATE_TEMPLATE_PARM
:
3177 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3178 parm_index
= TEMPLATE_TYPE_IDX (parm
);
3181 case TEMPLATE_PARM_INDEX
:
3182 parm_index
= TEMPLATE_PARM_IDX (parm
);
3190 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
3191 earliest template param denoted by `_'. */
3192 write_compact_number (parm_index
);
3195 /* <template-template-param>
3196 ::= <template-param>
3197 ::= <substitution> */
3200 write_template_template_param (const tree parm
)
3202 tree templ
= NULL_TREE
;
3204 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
3205 template template parameter. The substitution candidate here is
3206 only the template. */
3207 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
3210 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
3211 if (find_substitution (templ
))
3215 /* <template-param> encodes only the template parameter position,
3216 not its template arguments, which is fine here. */
3217 write_template_param (parm
);
3219 add_substitution (templ
);
3222 /* Non-terminal <substitution>.
3224 <substitution> ::= S <seq-id> _
3228 write_substitution (const int seq_id
)
3230 MANGLE_TRACE ("substitution", "");
3234 write_number (seq_id
- 1, /*unsigned=*/1, 36);
3238 /* Start mangling ENTITY. */
3241 start_mangling (const tree entity
)
3244 G
.need_abi_warning
= false;
3245 obstack_free (&name_obstack
, name_base
);
3246 mangle_obstack
= &name_obstack
;
3247 name_base
= obstack_alloc (&name_obstack
, 0);
3250 /* Done with mangling. If WARN is true, and the name of G.entity will
3251 be mangled differently in a future version of the ABI, issue a
3255 finish_mangling_internal (const bool warn
)
3257 if (warn_abi
&& warn
&& G
.need_abi_warning
)
3258 warning (OPT_Wabi
, "the mangled name of %qD will change in a future "
3262 /* Clear all the substitutions. */
3263 VEC_truncate (tree
, G
.substitutions
, 0);
3265 /* Null-terminate the string. */
3270 /* Like finish_mangling_internal, but return the mangled string. */
3272 static inline const char *
3273 finish_mangling (const bool warn
)
3275 finish_mangling_internal (warn
);
3276 return (const char *) obstack_finish (mangle_obstack
);
3279 /* Like finish_mangling_internal, but return an identifier. */
3282 finish_mangling_get_identifier (const bool warn
)
3284 finish_mangling_internal (warn
);
3285 /* Don't obstack_finish here, and the next start_mangling will
3286 remove the identifier. */
3287 return get_identifier ((const char *) obstack_base (mangle_obstack
));
3290 /* Initialize data structures for mangling. */
3295 gcc_obstack_init (&name_obstack
);
3296 name_base
= obstack_alloc (&name_obstack
, 0);
3297 G
.substitutions
= NULL
;
3299 /* Cache these identifiers for quick comparison when checking for
3300 standard substitutions. */
3301 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
3302 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
3303 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
3304 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
3305 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
3306 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
3309 /* Generate the mangled name of DECL. */
3312 mangle_decl_string (const tree decl
)
3315 location_t saved_loc
= input_location
;
3316 tree saved_fn
= NULL_TREE
;
3317 bool template_p
= false;
3319 /* We shouldn't be trying to mangle an uninstantiated template. */
3320 gcc_assert (!type_dependent_expression_p (decl
));
3322 if (DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3324 struct tinst_level
*tl
= current_instantiation ();
3325 if ((!tl
|| tl
->decl
!= decl
)
3326 && push_tinst_level (decl
))
3329 saved_fn
= current_function_decl
;
3330 current_function_decl
= NULL_TREE
;
3333 input_location
= DECL_SOURCE_LOCATION (decl
);
3335 start_mangling (decl
);
3337 if (TREE_CODE (decl
) == TYPE_DECL
)
3338 write_type (TREE_TYPE (decl
));
3340 write_mangled_name (decl
, true);
3342 result
= finish_mangling_get_identifier (/*warn=*/true);
3344 fprintf (stderr
, "mangle_decl_string = '%s'\n\n",
3345 IDENTIFIER_POINTER (result
));
3350 current_function_decl
= saved_fn
;
3352 input_location
= saved_loc
;
3357 /* Return an identifier for the external mangled name of DECL. */
3360 get_mangled_id (tree decl
)
3362 tree id
= mangle_decl_string (decl
);
3363 return targetm
.mangle_decl_assembler_name (decl
, id
);
3366 /* Create an identifier for the external mangled name of DECL. */
3369 mangle_decl (const tree decl
)
3374 /* Don't bother mangling uninstantiated templates. */
3375 ++processing_template_decl
;
3376 if (TREE_CODE (decl
) == TYPE_DECL
)
3377 dep
= dependent_type_p (TREE_TYPE (decl
));
3379 dep
= (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
3380 && any_dependent_template_arguments_p (DECL_TI_ARGS (decl
)));
3381 --processing_template_decl
;
3385 id
= get_mangled_id (decl
);
3386 SET_DECL_ASSEMBLER_NAME (decl
, id
);
3388 if (G
.need_abi_warning
3389 /* Don't do this for a fake symbol we aren't going to emit anyway. */
3390 && !DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)
3391 && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3393 #ifdef ASM_OUTPUT_DEF
3394 /* If the mangling will change in the future, emit an alias with the
3395 future mangled name for forward-compatibility. */
3400 SET_IDENTIFIER_GLOBAL_VALUE (id
, decl
);
3401 if (IDENTIFIER_GLOBAL_VALUE (id
) != decl
)
3402 inform (DECL_SOURCE_LOCATION (decl
), "-fabi-version=6 (or =0) "
3403 "avoids this error with a change in mangling");
3405 #ifdef ASM_OUTPUT_DEF
3406 save_ver
= flag_abi_version
;
3407 flag_abi_version
= 0;
3408 id2
= mangle_decl_string (decl
);
3409 id2
= targetm
.mangle_decl_assembler_name (decl
, id2
);
3410 flag_abi_version
= save_ver
;
3412 alias
= make_alias_for (decl
, id2
);
3413 DECL_IGNORED_P (alias
) = 1;
3414 TREE_PUBLIC (alias
) = TREE_PUBLIC (decl
);
3415 DECL_VISIBILITY (alias
) = DECL_VISIBILITY (decl
);
3416 if (vague_linkage_p (decl
))
3417 DECL_WEAK (alias
) = 1;
3418 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3419 cgraph_same_body_alias (cgraph_get_create_node (decl
), alias
, decl
);
3421 varpool_extra_name_alias (alias
, decl
);
3426 /* Generate the mangled representation of TYPE. */
3429 mangle_type_string (const tree type
)
3433 start_mangling (type
);
3435 result
= finish_mangling (/*warn=*/false);
3437 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
3441 /* Create an identifier for the mangled name of a special component
3442 for belonging to TYPE. CODE is the ABI-specified code for this
3446 mangle_special_for_type (const tree type
, const char *code
)
3450 /* We don't have an actual decl here for the special component, so
3451 we can't just process the <encoded-name>. Instead, fake it. */
3452 start_mangling (type
);
3454 /* Start the mangling. */
3455 write_string ("_Z");
3456 write_string (code
);
3460 result
= finish_mangling_get_identifier (/*warn=*/false);
3463 fprintf (stderr
, "mangle_special_for_type = %s\n\n",
3464 IDENTIFIER_POINTER (result
));
3469 /* Create an identifier for the mangled representation of the typeinfo
3470 structure for TYPE. */
3473 mangle_typeinfo_for_type (const tree type
)
3475 return mangle_special_for_type (type
, "TI");
3478 /* Create an identifier for the mangled name of the NTBS containing
3479 the mangled name of TYPE. */
3482 mangle_typeinfo_string_for_type (const tree type
)
3484 return mangle_special_for_type (type
, "TS");
3487 /* Create an identifier for the mangled name of the vtable for TYPE. */
3490 mangle_vtbl_for_type (const tree type
)
3492 return mangle_special_for_type (type
, "TV");
3495 /* Returns an identifier for the mangled name of the VTT for TYPE. */
3498 mangle_vtt_for_type (const tree type
)
3500 return mangle_special_for_type (type
, "TT");
3503 /* Return an identifier for a construction vtable group. TYPE is
3504 the most derived class in the hierarchy; BINFO is the base
3505 subobject for which this construction vtable group will be used.
3507 This mangling isn't part of the ABI specification; in the ABI
3508 specification, the vtable group is dumped in the same COMDAT as the
3509 main vtable, and is referenced only from that vtable, so it doesn't
3510 need an external name. For binary formats without COMDAT sections,
3511 though, we need external names for the vtable groups.
3513 We use the production
3515 <special-name> ::= CT <type> <offset number> _ <base type> */
3518 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
3522 start_mangling (type
);
3524 write_string ("_Z");
3525 write_string ("TC");
3527 write_integer_cst (BINFO_OFFSET (binfo
));
3529 write_type (BINFO_TYPE (binfo
));
3531 result
= finish_mangling_get_identifier (/*warn=*/false);
3533 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n",
3534 IDENTIFIER_POINTER (result
));
3538 /* Mangle a this pointer or result pointer adjustment.
3540 <call-offset> ::= h <fixed offset number> _
3541 ::= v <fixed offset number> _ <virtual offset number> _ */
3544 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
3546 write_char (virtual_offset
? 'v' : 'h');
3548 /* For either flavor, write the fixed offset. */
3549 write_integer_cst (fixed_offset
);
3552 /* For a virtual thunk, add the virtual offset. */
3555 write_integer_cst (virtual_offset
);
3560 /* Return an identifier for the mangled name of a this-adjusting or
3561 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
3562 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
3563 is a virtual thunk, and it is the vtbl offset in
3564 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
3565 zero for a covariant thunk. Note, that FN_DECL might be a covariant
3566 thunk itself. A covariant thunk name always includes the adjustment
3567 for the this pointer, even if there is none.
3569 <special-name> ::= T <call-offset> <base encoding>
3570 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
3574 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
3575 tree virtual_offset
)
3579 start_mangling (fn_decl
);
3581 write_string ("_Z");
3584 if (!this_adjusting
)
3586 /* Covariant thunk with no this adjustment */
3588 mangle_call_offset (integer_zero_node
, NULL_TREE
);
3589 mangle_call_offset (fixed_offset
, virtual_offset
);
3591 else if (!DECL_THUNK_P (fn_decl
))
3592 /* Plain this adjusting thunk. */
3593 mangle_call_offset (fixed_offset
, virtual_offset
);
3596 /* This adjusting thunk to covariant thunk. */
3598 mangle_call_offset (fixed_offset
, virtual_offset
);
3599 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
3600 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
3602 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
3603 mangle_call_offset (fixed_offset
, virtual_offset
);
3604 fn_decl
= THUNK_TARGET (fn_decl
);
3608 write_encoding (fn_decl
);
3610 result
= finish_mangling_get_identifier (/*warn=*/false);
3612 fprintf (stderr
, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result
));
3616 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
3617 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
3620 static GTY ((param_is (union tree_node
))) htab_t conv_type_names
;
3622 /* Hash a node (VAL1) in the table. */
3625 hash_type (const void *val
)
3627 return (hashval_t
) TYPE_UID (TREE_TYPE ((const_tree
) val
));
3630 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
3633 compare_type (const void *val1
, const void *val2
)
3635 return TREE_TYPE ((const_tree
) val1
) == (const_tree
) val2
;
3638 /* Return an identifier for the mangled unqualified name for a
3639 conversion operator to TYPE. This mangling is not specified by the
3640 ABI spec; it is only used internally. */
3643 mangle_conv_op_name_for_type (const tree type
)
3648 if (type
== error_mark_node
)
3649 return error_mark_node
;
3651 if (conv_type_names
== NULL
)
3652 conv_type_names
= htab_create_ggc (31, &hash_type
, &compare_type
, NULL
);
3654 slot
= htab_find_slot_with_hash (conv_type_names
, type
,
3655 (hashval_t
) TYPE_UID (type
), INSERT
);
3656 identifier
= (tree
)*slot
;
3661 /* Create a unique name corresponding to TYPE. */
3662 sprintf (buffer
, "operator %lu",
3663 (unsigned long) htab_elements (conv_type_names
));
3664 identifier
= get_identifier (buffer
);
3667 /* Hang TYPE off the identifier so it can be found easily later
3668 when performing conversions. */
3669 TREE_TYPE (identifier
) = type
;
3671 /* Set bits on the identifier so we know later it's a conversion. */
3672 IDENTIFIER_OPNAME_P (identifier
) = 1;
3673 IDENTIFIER_TYPENAME_P (identifier
) = 1;
3679 /* Return an identifier for the name of an initialization guard
3680 variable for indicated VARIABLE. */
3683 mangle_guard_variable (const tree variable
)
3685 start_mangling (variable
);
3686 write_string ("_ZGV");
3687 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
3688 /* The name of a guard variable for a reference temporary should refer
3689 to the reference, not the temporary. */
3690 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
3692 write_name (variable
, /*ignore_local_scope=*/0);
3693 return finish_mangling_get_identifier (/*warn=*/false);
3696 /* Return an identifier for the name of a temporary variable used to
3697 initialize a static reference. This isn't part of the ABI, but we might
3698 as well call them something readable. */
3700 static GTY(()) int temp_count
;
3703 mangle_ref_init_variable (const tree variable
)
3705 start_mangling (variable
);
3706 write_string ("_ZGR");
3707 write_name (variable
, /*ignore_local_scope=*/0);
3708 /* Avoid name clashes with aggregate initialization of multiple
3709 references at once. */
3710 write_unsigned_number (temp_count
++);
3711 return finish_mangling_get_identifier (/*warn=*/false);
3715 /* Foreign language type mangling section. */
3717 /* How to write the type codes for the integer Java type. */
3720 write_java_integer_type_codes (const tree type
)
3722 if (type
== java_int_type_node
)
3724 else if (type
== java_short_type_node
)
3726 else if (type
== java_byte_type_node
)
3728 else if (type
== java_char_type_node
)
3730 else if (type
== java_long_type_node
)
3732 else if (type
== java_boolean_type_node
)
3738 #include "gt-cp-mangle.h"