1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
3 Written by Alex Samuel <sameul@codesourcery.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file implements mangling of C++ names according to the IA64
23 C++ ABI specification. A mangled name encodes a function or
24 variable's name, scope, type, and/or template arguments into a text
25 identifier. This identifier is used as the function's or
26 variable's linkage name, to preserve compatibility between C++'s
27 language features (templates, scoping, and overloading) and C
30 Additionally, g++ uses mangled names internally. To support this,
31 mangling of types is allowed, even though the mangled name of a
32 type should not appear by itself as an exported name. Ditto for
33 uninstantiated templates.
35 The primary entry point for this module is mangle_decl, which
36 returns an identifier containing the mangled name for a decl.
37 Additional entry points are provided to build mangled names of
38 particular constructs when the appropriate decl for that construct
39 is not available. These are:
41 mangle_typeinfo_for_type: typeinfo data
42 mangle_typeinfo_string_for_type: typeinfo type name
43 mangle_vtbl_for_type: virtual table data
44 mangle_vtt_for_type: VTT data
45 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
46 mangle_thunk: thunk function or entry
52 #include "coretypes.h"
62 /* Debugging support. */
64 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
66 #define DEBUG_MANGLE 0
69 /* Macros for tracing the write_* functions. */
71 # define MANGLE_TRACE(FN, INPUT) \
72 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
73 # define MANGLE_TRACE_TREE(FN, NODE) \
74 fprintf (stderr, " %-24s: %-24s (%p)\n", \
75 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
77 # define MANGLE_TRACE(FN, INPUT)
78 # define MANGLE_TRACE_TREE(FN, NODE)
81 /* Nonzero if NODE is a class template-id. We can't rely on
82 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
83 that hard to distinguish A<T> from A, where A<T> is the type as
84 instantiated outside of the template, and A is the type used
85 without parameters inside the template. */
86 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
87 (TYPE_LANG_SPECIFIC (NODE) != NULL \
88 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
89 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
90 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
92 /* Things we only need one of. This module is not reentrant. */
95 /* The name in which we're building the mangled name. */
96 struct obstack name_obstack
;
98 /* An array of the current substitution candidates, in the order
100 varray_type substitutions
;
102 /* The entity that is being mangled. */
105 /* True if the mangling will be different in a future version of the
107 bool need_abi_warning
;
110 /* Indices into subst_identifiers. These are identifiers used in
111 special substitution rules. */
119 SUBID_BASIC_IOSTREAM
,
122 substitution_identifier_index_t
;
124 /* For quick substitution checks, look up these common identifiers
126 static GTY(()) tree subst_identifiers
[SUBID_MAX
];
128 /* Single-letter codes for builtin integer types, defined in
129 <builtin-type>. These are indexed by integer_type_kind values. */
131 integer_type_codes
[itk_none
] =
134 'a', /* itk_signed_char */
135 'h', /* itk_unsigned_char */
137 't', /* itk_unsigned_short */
139 'j', /* itk_unsigned_int */
141 'm', /* itk_unsigned_long */
142 'x', /* itk_long_long */
143 'y' /* itk_unsigned_long_long */
146 static int decl_is_template_id (const tree
, tree
* const);
148 /* Functions for handling substitutions. */
150 static inline tree
canonicalize_for_substitution (tree
);
151 static void add_substitution (tree
);
152 static inline int is_std_substitution (const tree
,
153 const substitution_identifier_index_t
);
154 static inline int is_std_substitution_char (const tree
,
155 const substitution_identifier_index_t
);
156 static int find_substitution (tree
);
157 static void mangle_call_offset (const tree
, const tree
);
159 /* Functions for emitting mangled representations of things. */
161 static void write_mangled_name (const tree
);
162 static void write_encoding (const tree
);
163 static void write_name (tree
, const int);
164 static void write_unscoped_name (const tree
);
165 static void write_unscoped_template_name (const tree
);
166 static void write_nested_name (const tree
);
167 static void write_prefix (const tree
);
168 static void write_template_prefix (const tree
);
169 static void write_unqualified_name (const tree
);
170 static void write_conversion_operator_name (const tree
);
171 static void write_source_name (tree
);
172 static int hwint_to_ascii (unsigned HOST_WIDE_INT
, const unsigned int, char *,
174 static void write_number (unsigned HOST_WIDE_INT
, const int,
176 static void write_integer_cst (const tree
);
177 static void write_real_cst (const tree
);
178 static void write_identifier (const char *);
179 static void write_special_name_constructor (const tree
);
180 static void write_special_name_destructor (const tree
);
181 static void write_type (tree
);
182 static int write_CV_qualifiers_for_type (const tree
);
183 static void write_builtin_type (tree
);
184 static void write_function_type (const tree
);
185 static void write_bare_function_type (const tree
, const int, const tree
);
186 static void write_method_parms (tree
, const int, const tree
);
187 static void write_class_enum_type (const tree
);
188 static void write_template_args (tree
);
189 static void write_expression (tree
);
190 static void write_template_arg_literal (const tree
);
191 static void write_template_arg (tree
);
192 static void write_template_template_arg (const tree
);
193 static void write_array_type (const tree
);
194 static void write_pointer_to_member_type (const tree
);
195 static void write_template_param (const tree
);
196 static void write_template_template_param (const tree
);
197 static void write_substitution (const int);
198 static int discriminator_for_local_entity (tree
);
199 static int discriminator_for_string_literal (tree
, tree
);
200 static void write_discriminator (const int);
201 static void write_local_name (const tree
, const tree
, const tree
);
202 static void dump_substitution_candidates (void);
203 static const char *mangle_decl_string (const tree
);
205 /* Control functions. */
207 static inline void start_mangling (const tree
);
208 static inline const char *finish_mangling (const bool);
209 static tree
mangle_special_for_type (const tree
, const char *);
211 /* Foreign language functions. */
213 static void write_java_integer_type_codes (const tree
);
215 /* Append a single character to the end of the mangled
217 #define write_char(CHAR) \
218 obstack_1grow (&G.name_obstack, (CHAR))
220 /* Append a sized buffer to the end of the mangled representation. */
221 #define write_chars(CHAR, LEN) \
222 obstack_grow (&G.name_obstack, (CHAR), (LEN))
224 /* Append a NUL-terminated string to the end of the mangled
226 #define write_string(STRING) \
227 obstack_grow (&G.name_obstack, (STRING), strlen (STRING))
229 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
230 same purpose (context, which may be a type) and value (template
231 decl). See write_template_prefix for more information on what this
233 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
234 (TREE_CODE (NODE1) == TREE_LIST \
235 && TREE_CODE (NODE2) == TREE_LIST \
236 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
237 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2)))\
238 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
239 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
241 /* Write out an unsigned quantity in base 10. */
242 #define write_unsigned_number(NUMBER) \
243 write_number ((NUMBER), /*unsigned_p=*/1, 10)
245 /* If DECL is a template instance, return nonzero and, if
246 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
247 Otherwise return zero. */
250 decl_is_template_id (const tree decl
, tree
* const template_info
)
252 if (TREE_CODE (decl
) == TYPE_DECL
)
254 /* TYPE_DECLs are handled specially. Look at its type to decide
255 if this is a template instantiation. */
256 const tree type
= TREE_TYPE (decl
);
258 if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_ID_P (type
))
260 if (template_info
!= NULL
)
261 /* For a templated TYPE_DECL, the template info is hanging
263 *template_info
= TYPE_TEMPLATE_INFO (type
);
269 /* Check if this is a primary template. */
270 if (DECL_LANG_SPECIFIC (decl
) != NULL
271 && DECL_USE_TEMPLATE (decl
)
272 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
))
273 && TREE_CODE (decl
) != TEMPLATE_DECL
)
275 if (template_info
!= NULL
)
276 /* For most templated decls, the template info is hanging
278 *template_info
= DECL_TEMPLATE_INFO (decl
);
283 /* It's not a template id. */
287 /* Produce debugging output of current substitution candidates. */
290 dump_substitution_candidates ()
294 fprintf (stderr
, " ++ substitutions ");
295 for (i
= 0; i
< VARRAY_ACTIVE_SIZE (G
.substitutions
); ++i
)
297 tree el
= VARRAY_TREE (G
.substitutions
, i
);
298 const char *name
= "???";
301 fprintf (stderr
, " ");
303 name
= IDENTIFIER_POINTER (DECL_NAME (el
));
304 else if (TREE_CODE (el
) == TREE_LIST
)
305 name
= IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el
)));
306 else if (TYPE_NAME (el
))
307 name
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el
)));
308 fprintf (stderr
, " S%d_ = ", i
- 1);
310 (CP_TYPE_RESTRICT_P (el
)
311 || CP_TYPE_VOLATILE_P (el
)
312 || CP_TYPE_CONST_P (el
)))
313 fprintf (stderr
, "CV-");
314 fprintf (stderr
, "%s (%s at %p)\n",
315 name
, tree_code_name
[TREE_CODE (el
)], (void *) el
);
319 /* Both decls and types can be substitution candidates, but sometimes
320 they refer to the same thing. For instance, a TYPE_DECL and
321 RECORD_TYPE for the same class refer to the same thing, and should
322 be treated accordinginly in substitutions. This function returns a
323 canonicalized tree node representing NODE that is used when adding
324 and substitution candidates and finding matches. */
327 canonicalize_for_substitution (tree node
)
329 /* For a TYPE_DECL, use the type instead. */
330 if (TREE_CODE (node
) == TYPE_DECL
)
331 node
= TREE_TYPE (node
);
333 node
= canonical_type_variant (node
);
338 /* Add NODE as a substitution candidate. NODE must not already be on
339 the list of candidates. */
342 add_substitution (tree node
)
347 fprintf (stderr
, " ++ add_substitution (%s at %10p)\n",
348 tree_code_name
[TREE_CODE (node
)], (void *) node
);
350 /* Get the canonicalized substitution candidate for NODE. */
351 c
= canonicalize_for_substitution (node
);
352 if (DEBUG_MANGLE
&& c
!= node
)
353 fprintf (stderr
, " ++ using candidate (%s at %10p)\n",
354 tree_code_name
[TREE_CODE (node
)], (void *) node
);
358 /* Make sure NODE isn't already a candidate. */
361 for (i
= VARRAY_ACTIVE_SIZE (G
.substitutions
); --i
>= 0; )
363 const tree candidate
= VARRAY_TREE (G
.substitutions
, i
);
365 && node
== candidate
)
367 && TYPE_P (candidate
)
368 && same_type_p (node
, candidate
)))
372 #endif /* ENABLE_CHECKING */
374 /* Put the decl onto the varray of substitution candidates. */
375 VARRAY_PUSH_TREE (G
.substitutions
, node
);
378 dump_substitution_candidates ();
381 /* Helper function for find_substitution. Returns nonzero if NODE,
382 which may be a decl or a CLASS_TYPE, is a template-id with template
383 name of substitution_index[INDEX] in the ::std namespace. */
386 is_std_substitution (const tree node
,
387 const substitution_identifier_index_t index
)
394 type
= TREE_TYPE (node
);
397 else if (CLASS_TYPE_P (node
))
400 decl
= TYPE_NAME (node
);
403 /* These are not the droids you're looking for. */
406 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl
))
407 && TYPE_LANG_SPECIFIC (type
)
408 && TYPE_TEMPLATE_INFO (type
)
409 && (DECL_NAME (TYPE_TI_TEMPLATE (type
))
410 == subst_identifiers
[index
]));
413 /* Helper function for find_substitution. Returns nonzero if NODE,
414 which may be a decl or a CLASS_TYPE, is the template-id
415 ::std::identifier<char>, where identifier is
416 substitution_index[INDEX]. */
419 is_std_substitution_char (const tree node
,
420 const substitution_identifier_index_t index
)
423 /* Check NODE's name is ::std::identifier. */
424 if (!is_std_substitution (node
, index
))
426 /* Figure out its template args. */
428 args
= DECL_TI_ARGS (node
);
429 else if (CLASS_TYPE_P (node
))
430 args
= CLASSTYPE_TI_ARGS (node
);
432 /* Oops, not a template. */
434 /* NODE's template arg list should be <char>. */
436 TREE_VEC_LENGTH (args
) == 1
437 && TREE_VEC_ELT (args
, 0) == char_type_node
;
440 /* Check whether a substitution should be used to represent NODE in
443 First, check standard special-case substitutions.
445 <substitution> ::= St
452 # ::std::basic_string
455 # ::std::basic_string<char,
456 ::std::char_traits<char>,
457 ::std::allocator<char> >
460 # ::std::basic_istream<char, ::std::char_traits<char> >
463 # ::std::basic_ostream<char, ::std::char_traits<char> >
466 # ::std::basic_iostream<char, ::std::char_traits<char> >
468 Then examine the stack of currently available substitution
469 candidates for entities appearing earlier in the same mangling
471 If a substitution is found, write its mangled representation and
472 return nonzero. If none is found, just return zero. */
475 find_substitution (tree node
)
478 const int size
= VARRAY_ACTIVE_SIZE (G
.substitutions
);
483 fprintf (stderr
, " ++ find_substitution (%s at %p)\n",
484 tree_code_name
[TREE_CODE (node
)], (void *) node
);
486 /* Obtain the canonicalized substitution representation for NODE.
487 This is what we'll compare against. */
488 node
= canonicalize_for_substitution (node
);
490 /* Check for builtin substitutions. */
492 decl
= TYPE_P (node
) ? TYPE_NAME (node
) : node
;
493 type
= TYPE_P (node
) ? node
: TREE_TYPE (node
);
495 /* Check for std::allocator. */
497 && is_std_substitution (decl
, SUBID_ALLOCATOR
)
498 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl
)))
504 /* Check for std::basic_string. */
505 if (decl
&& is_std_substitution (decl
, SUBID_BASIC_STRING
))
509 /* If this is a type (i.e. a fully-qualified template-id),
511 std::basic_string <char,
512 std::char_traits<char>,
513 std::allocator<char> > . */
514 if (cp_type_quals (type
) == TYPE_UNQUALIFIED
515 && CLASSTYPE_USE_TEMPLATE (type
))
517 tree args
= CLASSTYPE_TI_ARGS (type
);
518 if (TREE_VEC_LENGTH (args
) == 3
519 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
520 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
522 && is_std_substitution_char (TREE_VEC_ELT (args
, 2),
531 /* Substitute for the template name only if this isn't a type. */
538 /* Check for basic_{i,o,io}stream. */
540 && cp_type_quals (type
) == TYPE_UNQUALIFIED
541 && CLASS_TYPE_P (type
)
542 && CLASSTYPE_USE_TEMPLATE (type
)
543 && CLASSTYPE_TEMPLATE_INFO (type
) != NULL
)
545 /* First, check for the template
546 args <char, std::char_traits<char> > . */
547 tree args
= CLASSTYPE_TI_ARGS (type
);
548 if (TREE_VEC_LENGTH (args
) == 2
549 && same_type_p (TREE_VEC_ELT (args
, 0), char_type_node
)
550 && is_std_substitution_char (TREE_VEC_ELT (args
, 1),
553 /* Got them. Is this basic_istream? */
554 tree name
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
555 if (name
== subst_identifiers
[SUBID_BASIC_ISTREAM
])
560 /* Or basic_ostream? */
561 else if (name
== subst_identifiers
[SUBID_BASIC_OSTREAM
])
566 /* Or basic_iostream? */
567 else if (name
== subst_identifiers
[SUBID_BASIC_IOSTREAM
])
575 /* Check for namespace std. */
576 if (decl
&& DECL_NAMESPACE_STD_P (decl
))
582 /* Now check the list of available substitutions for this mangling
584 for (i
= 0; i
< size
; ++i
)
586 tree candidate
= VARRAY_TREE (G
.substitutions
, i
);
587 /* NODE is a matched to a candidate if it's the same decl node or
588 if it's the same type. */
589 if (decl
== candidate
590 || (TYPE_P (candidate
) && type
&& TYPE_P (type
)
591 && same_type_p (type
, candidate
))
592 || NESTED_TEMPLATE_MATCH (node
, candidate
))
594 write_substitution (i
);
599 /* No substitution found. */
604 /* <mangled-name> ::= _Z <encoding> */
607 write_mangled_name (const tree decl
)
609 MANGLE_TRACE_TREE ("mangled-name", decl
);
611 if (DECL_LANG_SPECIFIC (decl
)
612 && DECL_EXTERN_C_FUNCTION_P (decl
)
613 && ! DECL_OVERLOADED_OPERATOR_P (decl
))
614 /* The standard notes:
615 "The <encoding> of an extern "C" function is treated like
616 global-scope data, i.e. as its <source-name> without a type."
617 We cannot write overloaded operators that way though,
618 because it contains characters invalid in assembler. */
619 write_source_name (DECL_NAME (decl
));
621 /* C++ name; needs to be mangled. */
624 write_encoding (decl
);
628 /* <encoding> ::= <function name> <bare-function-type>
632 write_encoding (const tree decl
)
634 MANGLE_TRACE_TREE ("encoding", decl
);
636 if (DECL_LANG_SPECIFIC (decl
) && DECL_EXTERN_C_FUNCTION_P (decl
))
638 /* For overloaded operators write just the mangled name
639 without arguments. */
640 if (DECL_OVERLOADED_OPERATOR_P (decl
))
641 write_name (decl
, /*ignore_local_scope=*/0);
643 write_source_name (DECL_NAME (decl
));
647 write_name (decl
, /*ignore_local_scope=*/0);
648 if (TREE_CODE (decl
) == FUNCTION_DECL
)
652 if (decl_is_template_id (decl
, NULL
))
653 fn_type
= get_mostly_instantiated_function_type (decl
);
655 fn_type
= TREE_TYPE (decl
);
657 write_bare_function_type (fn_type
,
658 (!DECL_CONSTRUCTOR_P (decl
)
659 && !DECL_DESTRUCTOR_P (decl
)
660 && !DECL_CONV_FN_P (decl
)
661 && decl_is_template_id (decl
, NULL
)),
666 /* <name> ::= <unscoped-name>
667 ::= <unscoped-template-name> <template-args>
671 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
672 called from <local-name>, which mangles the enclosing scope
673 elsewhere and then uses this function to mangle just the part
674 underneath the function scope. So don't use the <local-name>
675 production, to avoid an infinite recursion. */
678 write_name (tree decl
, const int ignore_local_scope
)
682 MANGLE_TRACE_TREE ("name", decl
);
684 if (TREE_CODE (decl
) == TYPE_DECL
)
686 /* In case this is a typedef, fish out the corresponding
687 TYPE_DECL for the main variant. */
688 decl
= TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
689 context
= TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl
)));
692 context
= (DECL_CONTEXT (decl
) == NULL
) ? NULL
: CP_DECL_CONTEXT (decl
);
694 /* A decl in :: or ::std scope is treated specially. The former is
695 mangled using <unscoped-name> or <unscoped-template-name>, the
696 latter with a special substitution. Also, a name that is
697 directly in a local function scope is also mangled with
698 <unscoped-name> rather than a full <nested-name>. */
700 || context
== global_namespace
701 || DECL_NAMESPACE_STD_P (context
)
702 || (ignore_local_scope
&& TREE_CODE (context
) == FUNCTION_DECL
))
705 /* Is this a template instance? */
706 if (decl_is_template_id (decl
, &template_info
))
708 /* Yes: use <unscoped-template-name>. */
709 write_unscoped_template_name (TI_TEMPLATE (template_info
));
710 write_template_args (TI_ARGS (template_info
));
713 /* Everything else gets an <unqualified-name>. */
714 write_unscoped_name (decl
);
718 /* Handle local names, unless we asked not to (that is, invoked
719 under <local-name>, to handle only the part of the name under
721 if (!ignore_local_scope
)
723 /* Scan up the list of scope context, looking for a
724 function. If we find one, this entity is in local
725 function scope. local_entity tracks context one scope
726 level down, so it will contain the element that's
727 directly in that function's scope, either decl or one of
728 its enclosing scopes. */
729 tree local_entity
= decl
;
730 while (context
!= NULL
&& context
!= global_namespace
)
732 /* Make sure we're always dealing with decls. */
733 if (context
!= NULL
&& TYPE_P (context
))
734 context
= TYPE_NAME (context
);
735 /* Is this a function? */
736 if (TREE_CODE (context
) == FUNCTION_DECL
)
738 /* Yes, we have local scope. Use the <local-name>
739 production for the innermost function scope. */
740 write_local_name (context
, local_entity
, decl
);
743 /* Up one scope level. */
744 local_entity
= context
;
745 context
= CP_DECL_CONTEXT (context
);
748 /* No local scope found? Fall through to <nested-name>. */
751 /* Other decls get a <nested-name> to encode their scope. */
752 write_nested_name (decl
);
756 /* <unscoped-name> ::= <unqualified-name>
757 ::= St <unqualified-name> # ::std:: */
760 write_unscoped_name (const tree decl
)
762 tree context
= CP_DECL_CONTEXT (decl
);
764 MANGLE_TRACE_TREE ("unscoped-name", decl
);
766 /* Is DECL in ::std? */
767 if (DECL_NAMESPACE_STD_P (context
))
770 write_unqualified_name (decl
);
772 /* If not, it should be either in the global namespace, or directly
773 in a local function scope. */
774 else if (context
== global_namespace
776 || TREE_CODE (context
) == FUNCTION_DECL
)
777 write_unqualified_name (decl
);
782 /* <unscoped-template-name> ::= <unscoped-name>
783 ::= <substitution> */
786 write_unscoped_template_name (const tree decl
)
788 MANGLE_TRACE_TREE ("unscoped-template-name", decl
);
790 if (find_substitution (decl
))
792 write_unscoped_name (decl
);
793 add_substitution (decl
);
796 /* Write the nested name, including CV-qualifiers, of DECL.
798 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
799 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
801 <CV-qualifiers> ::= [r] [V] [K] */
804 write_nested_name (const tree decl
)
808 MANGLE_TRACE_TREE ("nested-name", decl
);
812 /* Write CV-qualifiers, if this is a member function. */
813 if (TREE_CODE (decl
) == FUNCTION_DECL
814 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
816 if (DECL_VOLATILE_MEMFUNC_P (decl
))
818 if (DECL_CONST_MEMFUNC_P (decl
))
822 /* Is this a template instance? */
823 if (decl_is_template_id (decl
, &template_info
))
825 /* Yes, use <template-prefix>. */
826 write_template_prefix (decl
);
827 write_template_args (TI_ARGS (template_info
));
831 /* No, just use <prefix> */
832 write_prefix (DECL_CONTEXT (decl
));
833 write_unqualified_name (decl
);
838 /* <prefix> ::= <prefix> <unqualified-name>
840 ::= <template-prefix> <template-args>
842 ::= <substitution> */
845 write_prefix (const tree node
)
848 /* Non-NULL if NODE represents a template-id. */
849 tree template_info
= NULL
;
851 MANGLE_TRACE_TREE ("prefix", node
);
854 || node
== global_namespace
)
857 if (find_substitution (node
))
862 /* If this is a function decl, that means we've hit function
863 scope, so this prefix must be for a local name. In this
864 case, we're under the <local-name> production, which encodes
865 the enclosing function scope elsewhere. So don't continue
867 if (TREE_CODE (node
) == FUNCTION_DECL
)
871 decl_is_template_id (decl
, &template_info
);
875 /* Node is a type. */
876 decl
= TYPE_NAME (node
);
877 if (CLASSTYPE_TEMPLATE_ID_P (node
))
878 template_info
= TYPE_TEMPLATE_INFO (node
);
881 /* In G++ 3.2, the name of the template parameter was used. */
882 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
883 && !abi_version_at_least (2))
884 G
.need_abi_warning
= true;
886 if (TREE_CODE (node
) == TEMPLATE_TYPE_PARM
887 && abi_version_at_least (2))
888 write_template_param (node
);
889 else if (template_info
!= NULL
)
892 write_template_prefix (decl
);
893 write_template_args (TI_ARGS (template_info
));
898 write_prefix (CP_DECL_CONTEXT (decl
));
899 write_unqualified_name (decl
);
902 add_substitution (node
);
905 /* <template-prefix> ::= <prefix> <template component>
907 ::= <substitution> */
910 write_template_prefix (const tree node
)
912 tree decl
= DECL_P (node
) ? node
: TYPE_NAME (node
);
913 tree type
= DECL_P (node
) ? TREE_TYPE (node
) : node
;
914 tree context
= CP_DECL_CONTEXT (decl
);
919 MANGLE_TRACE_TREE ("template-prefix", node
);
921 /* Find the template decl. */
922 if (decl_is_template_id (decl
, &template_info
))
923 template = TI_TEMPLATE (template_info
);
924 else if (CLASSTYPE_TEMPLATE_ID_P (type
))
925 template = TYPE_TI_TEMPLATE (type
);
927 /* Oops, not a template. */
930 /* For a member template, though, the template name for the
931 innermost name must have all the outer template levels
932 instantiated. For instance, consider
934 template<typename T> struct Outer {
935 template<typename U> struct Inner {};
938 The template name for `Inner' in `Outer<int>::Inner<float>' is
939 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
940 levels separately, so there's no TEMPLATE_DECL available for this
941 (there's only `Outer<T>::Inner<U>').
943 In order to get the substitutions right, we create a special
944 TREE_LIST to represent the substitution candidate for a nested
945 template. The TREE_PURPOSE is the template's context, fully
946 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
949 So, for the example above, `Outer<int>::Inner' is represented as a
950 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
951 and whose value is `Outer<T>::Inner<U>'. */
952 if (TYPE_P (context
))
953 substitution
= build_tree_list (context
, template);
955 substitution
= template;
957 if (find_substitution (substitution
))
960 /* In G++ 3.2, the name of the template template parameter was used. */
961 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
962 && !abi_version_at_least (2))
963 G
.need_abi_warning
= true;
965 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
966 && abi_version_at_least (2))
967 write_template_param (TREE_TYPE (template));
970 write_prefix (context
);
971 write_unqualified_name (decl
);
974 add_substitution (substitution
);
977 /* We don't need to handle thunks, vtables, or VTTs here. Those are
978 mangled through special entry points.
980 <unqualified-name> ::= <operator-name>
985 write_unqualified_name (const tree decl
)
987 MANGLE_TRACE_TREE ("unqualified-name", decl
);
989 if (DECL_LANG_SPECIFIC (decl
) != NULL
&& DECL_CONSTRUCTOR_P (decl
))
990 write_special_name_constructor (decl
);
991 else if (DECL_LANG_SPECIFIC (decl
) != NULL
&& DECL_DESTRUCTOR_P (decl
))
992 write_special_name_destructor (decl
);
993 else if (DECL_CONV_FN_P (decl
))
995 /* Conversion operator. Handle it right here.
996 <operator> ::= cv <type> */
998 if (decl_is_template_id (decl
, NULL
))
1000 tree fn_type
= get_mostly_instantiated_function_type (decl
);
1001 type
= TREE_TYPE (fn_type
);
1004 type
= DECL_CONV_FN_TYPE (decl
);
1005 write_conversion_operator_name (type
);
1007 else if (DECL_OVERLOADED_OPERATOR_P (decl
))
1009 operator_name_info_t
*oni
;
1010 if (DECL_ASSIGNMENT_OPERATOR_P (decl
))
1011 oni
= assignment_operator_name_info
;
1013 oni
= operator_name_info
;
1015 write_string (oni
[DECL_OVERLOADED_OPERATOR_P (decl
)].mangled_name
);
1018 write_source_name (DECL_NAME (decl
));
1021 /* Write the unqualified-name for a conversion operator to TYPE. */
1024 write_conversion_operator_name (const tree type
)
1026 write_string ("cv");
1030 /* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1032 <source-name> ::= </length/ number> <identifier> */
1035 write_source_name (tree identifier
)
1037 MANGLE_TRACE_TREE ("source-name", identifier
);
1039 /* Never write the whole template-id name including the template
1040 arguments; we only want the template name. */
1041 if (IDENTIFIER_TEMPLATE (identifier
))
1042 identifier
= IDENTIFIER_TEMPLATE (identifier
);
1044 write_unsigned_number (IDENTIFIER_LENGTH (identifier
));
1045 write_identifier (IDENTIFIER_POINTER (identifier
));
1048 /* Convert NUMBER to ascii using base BASE and generating at least
1049 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1050 into which to store the characters. Returns the number of
1051 characters generated (these will be layed out in advance of where
1055 hwint_to_ascii (unsigned HOST_WIDE_INT number
, const unsigned int base
,
1056 char *buffer
, const unsigned int min_digits
)
1058 static const char base_digits
[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1059 unsigned digits
= 0;
1063 unsigned HOST_WIDE_INT d
= number
/ base
;
1065 *--buffer
= base_digits
[number
- d
* base
];
1069 while (digits
< min_digits
)
1071 *--buffer
= base_digits
[0];
1077 /* Non-terminal <number>.
1079 <number> ::= [n] </decimal integer/> */
1082 write_number (unsigned HOST_WIDE_INT number
, const int unsigned_p
,
1083 const unsigned int base
)
1085 char buffer
[sizeof (HOST_WIDE_INT
) * 8];
1088 if (!unsigned_p
&& (HOST_WIDE_INT
) number
< 0)
1091 number
= -((HOST_WIDE_INT
) number
);
1093 count
= hwint_to_ascii (number
, base
, buffer
+ sizeof (buffer
), 1);
1094 write_chars (buffer
+ sizeof (buffer
) - count
, count
);
1097 /* Write out an integral CST in decimal. Most numbers are small, and
1098 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1099 bigger than that, which we must deal with. */
1102 write_integer_cst (const tree cst
)
1104 int sign
= tree_int_cst_sgn (cst
);
1106 if (TREE_INT_CST_HIGH (cst
) + (sign
< 0))
1108 /* A bignum. We do this in chunks, each of which fits in a
1110 char buffer
[sizeof (HOST_WIDE_INT
) * 8 * 2];
1111 unsigned HOST_WIDE_INT chunk
;
1112 unsigned chunk_digits
;
1113 char *ptr
= buffer
+ sizeof (buffer
);
1118 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1123 if (sizeof (HOST_WIDE_INT
) >= 8)
1125 /* It is at least 64 bits, so 10^18 is representable. */
1130 type
= c_common_signed_or_unsigned_type (1, TREE_TYPE (cst
));
1131 base
= build_int_2 (chunk
, 0);
1132 n
= build_int_2 (TREE_INT_CST_LOW (cst
), TREE_INT_CST_HIGH (cst
));
1133 TREE_TYPE (n
) = TREE_TYPE (base
) = type
;
1138 n
= fold (build1 (NEGATE_EXPR
, type
, n
));
1142 tree d
= fold (build (FLOOR_DIV_EXPR
, type
, n
, base
));
1143 tree tmp
= fold (build (MULT_EXPR
, type
, d
, base
));
1146 done
= integer_zerop (d
);
1147 tmp
= fold (build (MINUS_EXPR
, type
, n
, tmp
));
1148 c
= hwint_to_ascii (TREE_INT_CST_LOW (tmp
), 10, ptr
,
1149 done
? 1 : chunk_digits
);
1155 write_chars (ptr
, count
);
1160 unsigned HOST_WIDE_INT low
= TREE_INT_CST_LOW (cst
);
1167 write_unsigned_number (low
);
1171 /* Write out a floating-point literal.
1173 "Floating-point literals are encoded using the bit pattern of the
1174 target processor's internal representation of that number, as a
1175 fixed-length lowercase hexadecimal string, high-order bytes first
1176 (even if the target processor would store low-order bytes first).
1177 The "n" prefix is not used for floating-point literals; the sign
1178 bit is encoded with the rest of the number.
1180 Here are some examples, assuming the IEEE standard representation
1181 for floating point numbers. (Spaces are for readability, not
1182 part of the encoding.)
1185 -1.0f Lf bf80 0000 E
1186 1.17549435e-38f Lf 0080 0000 E
1187 1.40129846e-45f Lf 0000 0001 E
1188 0.0f Lf 0000 0000 E"
1190 Caller is responsible for the Lx and the E. */
1192 write_real_cst (const tree value
)
1194 if (abi_version_at_least (2))
1196 long target_real
[4]; /* largest supported float */
1197 char buffer
[9]; /* eight hex digits in a 32-bit number */
1200 tree type
= TREE_TYPE (value
);
1201 int words
= GET_MODE_BITSIZE (TYPE_MODE (type
)) / 32;
1203 real_to_target (target_real
, &TREE_REAL_CST (value
),
1206 /* The value in target_real is in the target word order,
1207 so we must write it out backward if that happens to be
1208 little-endian. write_number cannot be used, it will
1209 produce uppercase. */
1210 if (FLOAT_WORDS_BIG_ENDIAN
)
1211 i
= 0, limit
= words
, dir
= 1;
1213 i
= words
- 1, limit
= -1, dir
= -1;
1215 for (; i
!= limit
; i
+= dir
)
1217 sprintf (buffer
, "%08lx", target_real
[i
]);
1218 write_chars (buffer
, 8);
1223 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1224 literally. Note that compatibility with 3.2 is impossible,
1225 because the old floating-point emulator used a different
1226 format for REAL_VALUE_TYPE. */
1228 for (i
= 0; i
< sizeof (TREE_REAL_CST (value
)); ++i
)
1229 write_number (((unsigned char *) &TREE_REAL_CST (value
))[i
],
1232 G
.need_abi_warning
= 1;
1236 /* Non-terminal <identifier>.
1238 <identifier> ::= </unqualified source code identifier> */
1241 write_identifier (const char *identifier
)
1243 MANGLE_TRACE ("identifier", identifier
);
1244 write_string (identifier
);
1247 /* Handle constructor productions of non-terminal <special-name>.
1248 CTOR is a constructor FUNCTION_DECL.
1250 <special-name> ::= C1 # complete object constructor
1251 ::= C2 # base object constructor
1252 ::= C3 # complete object allocating constructor
1254 Currently, allocating constructors are never used.
1256 We also need to provide mangled names for the maybe-in-charge
1257 constructor, so we treat it here too. mangle_decl_string will
1258 append *INTERNAL* to that, to make sure we never emit it. */
1261 write_special_name_constructor (const tree ctor
)
1263 if (DECL_COMPLETE_CONSTRUCTOR_P (ctor
)
1264 /* Even though we don't ever emit a definition of the
1265 old-style destructor, we still have to consider entities
1266 (like static variables) nested inside it. */
1267 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor
))
1268 write_string ("C1");
1269 else if (DECL_BASE_CONSTRUCTOR_P (ctor
))
1270 write_string ("C2");
1275 /* Handle destructor productions of non-terminal <special-name>.
1276 DTOR is a destructor FUNCTION_DECL.
1278 <special-name> ::= D0 # deleting (in-charge) destructor
1279 ::= D1 # complete object (in-charge) destructor
1280 ::= D2 # base object (not-in-charge) destructor
1282 We also need to provide mangled names for the maybe-incharge
1283 destructor, so we treat it here too. mangle_decl_string will
1284 append *INTERNAL* to that, to make sure we never emit it. */
1287 write_special_name_destructor (const tree dtor
)
1289 if (DECL_DELETING_DESTRUCTOR_P (dtor
))
1290 write_string ("D0");
1291 else if (DECL_COMPLETE_DESTRUCTOR_P (dtor
)
1292 /* Even though we don't ever emit a definition of the
1293 old-style destructor, we still have to consider entities
1294 (like static variables) nested inside it. */
1295 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor
))
1296 write_string ("D1");
1297 else if (DECL_BASE_DESTRUCTOR_P (dtor
))
1298 write_string ("D2");
1303 /* Return the discriminator for ENTITY appearing inside
1304 FUNCTION. The discriminator is the lexical ordinal of VAR among
1305 entities with the same name in the same FUNCTION. */
1308 discriminator_for_local_entity (tree entity
)
1312 /* Assume this is the only local entity with this name. */
1313 int discriminator
= 0;
1315 if (DECL_DISCRIMINATOR_P (entity
) && DECL_LANG_SPECIFIC (entity
))
1316 discriminator
= DECL_DISCRIMINATOR (entity
);
1317 else if (TREE_CODE (entity
) == TYPE_DECL
)
1319 /* Scan the list of local classes. */
1320 entity
= TREE_TYPE (entity
);
1321 for (type
= &VARRAY_TREE (local_classes
, 0); *type
!= entity
; ++type
)
1322 if (TYPE_IDENTIFIER (*type
) == TYPE_IDENTIFIER (entity
)
1323 && TYPE_CONTEXT (*type
) == TYPE_CONTEXT (entity
))
1327 return discriminator
;
1330 /* Return the discriminator for STRING, a string literal used inside
1331 FUNCTION. The disciminator is the lexical ordinal of STRING among
1332 string literals used in FUNCTION. */
1335 discriminator_for_string_literal (function
, string
)
1336 tree function ATTRIBUTE_UNUSED
;
1337 tree string ATTRIBUTE_UNUSED
;
1339 /* For now, we don't discriminate amongst string literals. */
1343 /* <discriminator> := _ <number>
1345 The discriminator is used only for the second and later occurrences
1346 of the same name within a single function. In this case <number> is
1347 n - 2, if this is the nth occurrence, in lexical order. */
1350 write_discriminator (const int discriminator
)
1352 /* If discriminator is zero, don't write anything. Otherwise... */
1353 if (discriminator
> 0)
1356 write_unsigned_number (discriminator
- 1);
1360 /* Mangle the name of a function-scope entity. FUNCTION is the
1361 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1362 the entity itself. LOCAL_ENTITY is the entity that's directly
1363 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1366 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1367 := Z <function encoding> E s [<discriminator>] */
1370 write_local_name (const tree function
, const tree local_entity
,
1373 MANGLE_TRACE_TREE ("local-name", entity
);
1376 write_encoding (function
);
1378 if (TREE_CODE (entity
) == STRING_CST
)
1381 write_discriminator (discriminator_for_string_literal (function
,
1386 /* Now the <entity name>. Let write_name know its being called
1387 from <local-name>, so it doesn't try to process the enclosing
1388 function scope again. */
1389 write_name (entity
, /*ignore_local_scope=*/1);
1390 write_discriminator (discriminator_for_local_entity (local_entity
));
1394 /* Non-terminals <type> and <CV-qualifier>.
1396 <type> ::= <builtin-type>
1398 ::= <class-enum-type>
1400 ::= <pointer-to-member-type>
1401 ::= <template-param>
1404 ::= P <type> # pointer-to
1405 ::= R <type> # reference-to
1406 ::= C <type> # complex pair (C 2000)
1407 ::= G <type> # imaginary (C 2000) [not supported]
1408 ::= U <source-name> <type> # vendor extended type qualifier
1410 TYPE is a type node. */
1413 write_type (tree type
)
1415 /* This gets set to nonzero if TYPE turns out to be a (possibly
1416 CV-qualified) builtin type. */
1417 int is_builtin_type
= 0;
1419 MANGLE_TRACE_TREE ("type", type
);
1421 if (type
== error_mark_node
)
1424 if (find_substitution (type
))
1427 if (write_CV_qualifiers_for_type (type
) > 0)
1428 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1429 mangle the unqualified type. The recursive call is needed here
1430 since both the qualified and uqualified types are substitution
1432 write_type (TYPE_MAIN_VARIANT (type
));
1433 else if (TREE_CODE (type
) == ARRAY_TYPE
)
1434 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1435 so that the cv-qualification of the element type is available
1436 in write_array_type. */
1437 write_array_type (type
);
1440 /* See through any typedefs. */
1441 type
= TYPE_MAIN_VARIANT (type
);
1443 switch (TREE_CODE (type
))
1447 case INTEGER_TYPE
: /* Includes wchar_t. */
1449 /* If this is a typedef, TYPE may not be one of
1450 the standard builtin type nodes, but an alias of one. Use
1451 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1452 write_builtin_type (TYPE_MAIN_VARIANT (type
));
1458 write_type (TREE_TYPE (type
));
1463 write_function_type (type
);
1469 /* A pointer-to-member function is represented as a special
1470 RECORD_TYPE, so check for this first. */
1471 if (TYPE_PTRMEMFUNC_P (type
))
1472 write_pointer_to_member_type (type
);
1474 write_class_enum_type (type
);
1478 case UNBOUND_CLASS_TEMPLATE
:
1479 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1480 ordinary nested names. */
1481 write_nested_name (TYPE_STUB_DECL (type
));
1485 /* A pointer-to-member variable is represented by a POINTER_TYPE
1486 to an OFFSET_TYPE, so check for this first. */
1487 if (TYPE_PTRMEM_P (type
))
1488 write_pointer_to_member_type (type
);
1492 write_type (TREE_TYPE (type
));
1496 case REFERENCE_TYPE
:
1498 write_type (TREE_TYPE (type
));
1501 case TEMPLATE_TYPE_PARM
:
1502 case TEMPLATE_PARM_INDEX
:
1503 write_template_param (type
);
1506 case TEMPLATE_TEMPLATE_PARM
:
1507 write_template_template_param (type
);
1510 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1511 write_template_template_param (type
);
1513 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type
)));
1517 write_pointer_to_member_type (build_pointer_type (type
));
1521 write_string ("U8__vector");
1522 write_type (TREE_TYPE (type
));
1530 /* Types other than builtin types are substitution candidates. */
1531 if (!is_builtin_type
)
1532 add_substitution (type
);
1535 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1536 CV-qualifiers written for TYPE.
1538 <CV-qualifiers> ::= [r] [V] [K] */
1541 write_CV_qualifiers_for_type (const tree type
)
1543 int num_qualifiers
= 0;
1545 /* The order is specified by:
1547 "In cases where multiple order-insensitive qualifiers are
1548 present, they should be ordered 'K' (closest to the base type),
1549 'V', 'r', and 'U' (farthest from the base type) ..."
1551 Note that we do not use cp_type_quals below; given "const
1552 int[3]", the "const" is emitted with the "int", not with the
1555 if (TYPE_QUALS (type
) & TYPE_QUAL_RESTRICT
)
1560 if (TYPE_QUALS (type
) & TYPE_QUAL_VOLATILE
)
1565 if (TYPE_QUALS (type
) & TYPE_QUAL_CONST
)
1571 return num_qualifiers
;
1574 /* Non-terminal <builtin-type>.
1576 <builtin-type> ::= v # void
1581 ::= h # unsigned char
1583 ::= t # unsigned short
1585 ::= j # unsigned int
1587 ::= m # unsigned long
1588 ::= x # long long, __int64
1589 ::= y # unsigned long long, __int64
1591 ::= o # unsigned __int128
1594 ::= e # long double, __float80
1595 ::= g # __float128 [not supported]
1596 ::= u <source-name> # vendor extended type */
1599 write_builtin_type (tree type
)
1601 switch (TREE_CODE (type
))
1612 /* If this is size_t, get the underlying int type. */
1613 if (TYPE_IS_SIZETYPE (type
))
1614 type
= TYPE_DOMAIN (type
);
1616 /* TYPE may still be wchar_t, since that isn't in
1617 integer_type_nodes. */
1618 if (type
== wchar_type_node
)
1620 else if (TYPE_FOR_JAVA (type
))
1621 write_java_integer_type_codes (type
);
1625 /* Assume TYPE is one of the shared integer type nodes. Find
1626 it in the array of these nodes. */
1628 for (itk
= 0; itk
< itk_none
; ++itk
)
1629 if (type
== integer_types
[itk
])
1631 /* Print the corresponding single-letter code. */
1632 write_char (integer_type_codes
[itk
]);
1636 if (itk
== itk_none
)
1638 tree t
= c_common_type_for_mode (TYPE_MODE (type
),
1639 TREE_UNSIGNED (type
));
1642 if (TYPE_PRECISION (type
) == 128)
1643 write_char (TREE_UNSIGNED (type
) ? 'o' : 'n');
1645 /* Couldn't find this type. */
1658 if (type
== float_type_node
1659 || type
== java_float_type_node
)
1661 else if (type
== double_type_node
1662 || type
== java_double_type_node
)
1664 else if (type
== long_double_type_node
)
1675 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1676 METHOD_TYPE. The return type is mangled before the parameter
1679 <function-type> ::= F [Y] <bare-function-type> E */
1682 write_function_type (const tree type
)
1684 MANGLE_TRACE_TREE ("function-type", type
);
1686 /* For a pointer to member function, the function type may have
1687 cv-qualifiers, indicating the quals for the artificial 'this'
1689 if (TREE_CODE (type
) == METHOD_TYPE
)
1691 /* The first parameter must be a POINTER_TYPE pointing to the
1692 `this' parameter. */
1693 tree this_type
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
1694 write_CV_qualifiers_for_type (this_type
);
1698 /* We don't track whether or not a type is `extern "C"'. Note that
1699 you can have an `extern "C"' function that does not have
1700 `extern "C"' type, and vice versa:
1702 extern "C" typedef void function_t();
1703 function_t f; // f has C++ linkage, but its type is
1706 typedef void function_t();
1707 extern "C" function_t f; // Vice versa.
1710 write_bare_function_type (type
, /*include_return_type_p=*/1,
1715 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1716 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1717 is mangled before the parameter types. If non-NULL, DECL is
1718 FUNCTION_DECL for the function whose type is being emitted.
1720 <bare-function-type> ::= </signature/ type>+ */
1723 write_bare_function_type (const tree type
, const int include_return_type_p
,
1726 MANGLE_TRACE_TREE ("bare-function-type", type
);
1728 /* Mangle the return type, if requested. */
1729 if (include_return_type_p
)
1730 write_type (TREE_TYPE (type
));
1732 /* Now mangle the types of the arguments. */
1733 write_method_parms (TYPE_ARG_TYPES (type
),
1734 TREE_CODE (type
) == METHOD_TYPE
,
1738 /* Write the mangled representation of a method parameter list of
1739 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1740 considered a non-static method, and the this parameter is omitted.
1741 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1742 parameters are being emitted. */
1745 write_method_parms (tree parm_types
, const int method_p
, const tree decl
)
1747 tree first_parm_type
;
1748 tree parm_decl
= decl
? DECL_ARGUMENTS (decl
) : NULL_TREE
;
1750 /* Assume this parameter type list is variable-length. If it ends
1751 with a void type, then it's not. */
1754 /* If this is a member function, skip the first arg, which is the
1756 "Member functions do not encode the type of their implicit this
1759 Similarly, there's no need to mangle artificial parameters, like
1760 the VTT parameters for constructors and destructors. */
1763 parm_types
= TREE_CHAIN (parm_types
);
1764 parm_decl
= parm_decl
? TREE_CHAIN (parm_decl
) : NULL_TREE
;
1766 while (parm_decl
&& DECL_ARTIFICIAL (parm_decl
))
1768 parm_types
= TREE_CHAIN (parm_types
);
1769 parm_decl
= TREE_CHAIN (parm_decl
);
1773 for (first_parm_type
= parm_types
;
1775 parm_types
= TREE_CHAIN (parm_types
))
1777 tree parm
= TREE_VALUE (parm_types
);
1778 if (parm
== void_type_node
)
1780 /* "Empty parameter lists, whether declared as () or
1781 conventionally as (void), are encoded with a void parameter
1783 if (parm_types
== first_parm_type
)
1785 /* If the parm list is terminated with a void type, it's
1788 /* A void type better be the last one. */
1789 my_friendly_assert (TREE_CHAIN (parm_types
) == NULL
, 20000523);
1796 /* <builtin-type> ::= z # ellipsis */
1800 /* <class-enum-type> ::= <name> */
1803 write_class_enum_type (const tree type
)
1805 write_name (TYPE_NAME (type
), /*ignore_local_scope=*/0);
1808 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1811 <template-args> ::= I <template-arg>+ E */
1814 write_template_args (tree args
)
1816 MANGLE_TRACE_TREE ("template-args", args
);
1820 if (TREE_CODE (args
) == TREE_VEC
)
1823 int length
= TREE_VEC_LENGTH (args
);
1824 my_friendly_assert (length
> 0, 20000422);
1826 if (TREE_CODE (TREE_VEC_ELT (args
, 0)) == TREE_VEC
)
1828 /* We have nested template args. We want the innermost template
1830 args
= TREE_VEC_ELT (args
, length
- 1);
1831 length
= TREE_VEC_LENGTH (args
);
1833 for (i
= 0; i
< length
; ++i
)
1834 write_template_arg (TREE_VEC_ELT (args
, i
));
1838 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 20021014);
1842 write_template_arg (TREE_VALUE (args
));
1843 args
= TREE_CHAIN (args
);
1850 /* <expression> ::= <unary operator-name> <expression>
1851 ::= <binary operator-name> <expression> <expression>
1854 <expr-primary> ::= <template-param>
1855 ::= L <type> <value number> E # literal
1856 ::= L <mangled-name> E # external name
1857 ::= sr <type> <unqualified-name>
1858 ::= sr <type> <unqualified-name> <template-args> */
1861 write_expression (tree expr
)
1863 enum tree_code code
;
1865 code
= TREE_CODE (expr
);
1867 /* Handle pointers-to-members by making them look like expression
1869 if (code
== PTRMEM_CST
)
1871 expr
= build_nt (ADDR_EXPR
,
1872 build_nt (SCOPE_REF
,
1873 PTRMEM_CST_CLASS (expr
),
1874 PTRMEM_CST_MEMBER (expr
)));
1875 code
= TREE_CODE (expr
);
1878 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
1879 is converted (via qualification conversions) to another
1881 while (TREE_CODE (expr
) == NOP_EXPR
1882 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1884 expr
= TREE_OPERAND (expr
, 0);
1885 code
= TREE_CODE (expr
);
1888 /* Handle template parameters. */
1889 if (code
== TEMPLATE_TYPE_PARM
1890 || code
== TEMPLATE_TEMPLATE_PARM
1891 || code
== BOUND_TEMPLATE_TEMPLATE_PARM
1892 || code
== TEMPLATE_PARM_INDEX
)
1893 write_template_param (expr
);
1894 /* Handle literals. */
1895 else if (TREE_CODE_CLASS (code
) == 'c'
1896 || (abi_version_at_least (2) && code
== CONST_DECL
))
1897 write_template_arg_literal (expr
);
1898 else if (DECL_P (expr
))
1900 /* G++ 3.2 incorrectly mangled non-type template arguments of
1901 enumeration type using their names. */
1902 if (code
== CONST_DECL
)
1903 G
.need_abi_warning
= 1;
1905 write_mangled_name (expr
);
1908 else if (TREE_CODE (expr
) == SIZEOF_EXPR
1909 && TYPE_P (TREE_OPERAND (expr
, 0)))
1911 write_string ("st");
1912 write_type (TREE_OPERAND (expr
, 0));
1914 else if (abi_version_at_least (2) && TREE_CODE (expr
) == SCOPE_REF
)
1916 tree scope
= TREE_OPERAND (expr
, 0);
1917 tree member
= TREE_OPERAND (expr
, 1);
1919 /* If the MEMBER is a real declaration, then the qualifying
1920 scope was not dependent. Ideally, we would not have a
1921 SCOPE_REF in those cases, but sometimes we do. If the second
1922 argument is a DECL, then the name must not have been
1924 if (DECL_P (member
))
1925 write_expression (member
);
1930 write_string ("sr");
1932 /* If MEMBER is a template-id, separate the template
1933 from the arguments. */
1934 if (TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
1936 template_args
= TREE_OPERAND (member
, 1);
1937 member
= TREE_OPERAND (member
, 0);
1938 if (TREE_CODE (member
) == LOOKUP_EXPR
)
1939 member
= TREE_OPERAND (member
, 0);
1942 template_args
= NULL_TREE
;
1943 /* Write out the name of the MEMBER. */
1944 if (IDENTIFIER_TYPENAME_P (member
))
1945 write_conversion_operator_name (TREE_TYPE (member
));
1946 else if (IDENTIFIER_OPNAME_P (member
))
1949 const char *mangled_name
= NULL
;
1951 /* Unfortunately, there is no easy way to go from the
1952 name of the operator back to the corresponding tree
1954 for (i
= 0; i
< LAST_CPLUS_TREE_CODE
; ++i
)
1955 if (operator_name_info
[i
].identifier
== member
)
1957 /* The ABI says that we prefer binary operator
1958 names to unary operator names. */
1959 if (operator_name_info
[i
].arity
== 2)
1961 mangled_name
= operator_name_info
[i
].mangled_name
;
1964 else if (!mangled_name
)
1965 mangled_name
= operator_name_info
[i
].mangled_name
;
1967 else if (assignment_operator_name_info
[i
].identifier
1971 = assignment_operator_name_info
[i
].mangled_name
;
1974 write_string (mangled_name
);
1977 write_source_name (member
);
1978 /* Write out the template arguments. */
1980 write_template_args (template_args
);
1987 /* When we bind a variable or function to a non-type template
1988 argument with reference type, we create an ADDR_EXPR to show
1989 the fact that the entity's address has been taken. But, we
1990 don't actually want to output a mangling code for the `&'. */
1991 if (TREE_CODE (expr
) == ADDR_EXPR
1993 && TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
)
1995 expr
= TREE_OPERAND (expr
, 0);
1998 write_expression (expr
);
2002 code
= TREE_CODE (expr
);
2005 /* If it wasn't any of those, recursively expand the expression. */
2006 write_string (operator_name_info
[(int) code
].mangled_name
);
2011 write_type (TREE_TYPE (expr
));
2012 write_expression (TREE_VALUE (TREE_OPERAND (expr
, 0)));
2015 case STATIC_CAST_EXPR
:
2016 case CONST_CAST_EXPR
:
2017 write_type (TREE_TYPE (expr
));
2018 write_expression (TREE_OPERAND (expr
, 0));
2022 /* Handle pointers-to-members specially. */
2024 write_type (TREE_OPERAND (expr
, 0));
2025 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == IDENTIFIER_NODE
)
2026 write_source_name (TREE_OPERAND (expr
, 1));
2029 /* G++ 3.2 incorrectly put out both the "sr" code and
2030 the nested name of the qualified name. */
2031 G
.need_abi_warning
= 1;
2032 write_encoding (TREE_OPERAND (expr
, 1));
2037 for (i
= 0; i
< TREE_CODE_LENGTH (code
); ++i
)
2038 write_expression (TREE_OPERAND (expr
, i
));
2043 /* Literal subcase of non-terminal <template-arg>.
2045 "Literal arguments, e.g. "A<42L>", are encoded with their type
2046 and value. Negative integer values are preceded with "n"; for
2047 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2048 encoded as 0, true as 1." */
2051 write_template_arg_literal (const tree value
)
2053 tree type
= TREE_TYPE (value
);
2057 if (TREE_CODE (value
) == CONST_DECL
)
2058 write_integer_cst (DECL_INITIAL (value
));
2059 else if (TREE_CODE (value
) == INTEGER_CST
)
2061 if (same_type_p (type
, boolean_type_node
))
2063 if (value
== boolean_false_node
|| integer_zerop (value
))
2064 write_unsigned_number (0);
2065 else if (value
== boolean_true_node
)
2066 write_unsigned_number (1);
2071 write_integer_cst (value
);
2073 else if (TREE_CODE (value
) == REAL_CST
)
2074 write_real_cst (value
);
2081 /* Non-terminal <tempalate-arg>.
2083 <template-arg> ::= <type> # type
2084 ::= L <type> </value/ number> E # literal
2085 ::= LZ <name> E # external name
2086 ::= X <expression> E # expression */
2089 write_template_arg (tree node
)
2091 enum tree_code code
= TREE_CODE (node
);
2093 MANGLE_TRACE_TREE ("template-arg", node
);
2095 /* A template template paramter's argument list contains TREE_LIST
2096 nodes of which the value field is the the actual argument. */
2097 if (code
== TREE_LIST
)
2099 node
= TREE_VALUE (node
);
2100 /* If it's a decl, deal with its type instead. */
2103 node
= TREE_TYPE (node
);
2104 code
= TREE_CODE (node
);
2110 else if (code
== TEMPLATE_DECL
)
2111 /* A template appearing as a template arg is a template template arg. */
2112 write_template_template_arg (node
);
2113 else if ((TREE_CODE_CLASS (code
) == 'c' && code
!= PTRMEM_CST
)
2114 || (abi_version_at_least (2) && code
== CONST_DECL
))
2115 write_template_arg_literal (node
);
2116 else if (DECL_P (node
))
2118 /* G++ 3.2 incorrectly mangled non-type template arguments of
2119 enumeration type using their names. */
2120 if (code
== CONST_DECL
)
2121 G
.need_abi_warning
= 1;
2124 write_encoding (node
);
2129 /* Template arguments may be expressions. */
2131 write_expression (node
);
2136 /* <template-template-arg>
2138 ::= <substitution> */
2141 write_template_template_arg (const tree decl
)
2143 MANGLE_TRACE_TREE ("template-template-arg", decl
);
2145 if (find_substitution (decl
))
2147 write_name (decl
, /*ignore_local_scope=*/0);
2148 add_substitution (decl
);
2152 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2154 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2155 ::= A <expression> _ </element/ type>
2157 "Array types encode the dimension (number of elements) and the
2158 element type. For variable length arrays, the dimension (but not
2159 the '_' separator) is omitted." */
2162 write_array_type (const tree type
)
2165 if (TYPE_DOMAIN (type
))
2170 index_type
= TYPE_DOMAIN (type
);
2171 /* The INDEX_TYPE gives the upper and lower bounds of the
2173 max
= TYPE_MAX_VALUE (index_type
);
2174 if (TREE_CODE (max
) == INTEGER_CST
)
2176 /* The ABI specifies that we should mangle the number of
2177 elements in the array, not the largest allowed index. */
2178 max
= size_binop (PLUS_EXPR
, max
, size_one_node
);
2179 write_unsigned_number (tree_low_cst (max
, 1));
2182 write_expression (TREE_OPERAND (max
, 0));
2185 write_type (TREE_TYPE (type
));
2188 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2189 variables. TYPE is a pointer-to-member POINTER_TYPE.
2191 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2194 write_pointer_to_member_type (const tree type
)
2197 write_type (TYPE_PTRMEM_CLASS_TYPE (type
));
2198 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
2201 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2202 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2203 TEMPLATE_PARM_INDEX.
2205 <template-param> ::= T </parameter/ number> _
2207 If we are internally mangling then we distinguish level and, for
2208 non-type parms, type too. The mangling appends
2210 </level/ number> _ </non-type type/ type> _
2212 This is used by mangle_conv_op_name_for_type. */
2215 write_template_param (const tree parm
)
2219 tree parm_type
= NULL_TREE
;
2221 MANGLE_TRACE_TREE ("template-parm", parm
);
2223 switch (TREE_CODE (parm
))
2225 case TEMPLATE_TYPE_PARM
:
2226 case TEMPLATE_TEMPLATE_PARM
:
2227 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2228 parm_index
= TEMPLATE_TYPE_IDX (parm
);
2229 parm_level
= TEMPLATE_TYPE_LEVEL (parm
);
2232 case TEMPLATE_PARM_INDEX
:
2233 parm_index
= TEMPLATE_PARM_IDX (parm
);
2234 parm_level
= TEMPLATE_PARM_LEVEL (parm
);
2235 parm_type
= TREE_TYPE (TEMPLATE_PARM_DECL (parm
));
2243 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2244 earliest template param denoted by `_'. */
2246 write_unsigned_number (parm_index
- 1);
2250 /* <template-template-param>
2251 ::= <template-param>
2252 ::= <substitution> */
2255 write_template_template_param (const tree parm
)
2257 tree
template = NULL_TREE
;
2259 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2260 template template parameter. The substitution candidate here is
2261 only the template. */
2262 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
2265 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
));
2266 if (find_substitution (template))
2270 /* <template-param> encodes only the template parameter position,
2271 not its template arguments, which is fine here. */
2272 write_template_param (parm
);
2274 add_substitution (template);
2277 /* Non-terminal <substitution>.
2279 <substitution> ::= S <seq-id> _
2283 write_substitution (const int seq_id
)
2285 MANGLE_TRACE ("substitution", "");
2289 write_number (seq_id
- 1, /*unsigned=*/1, 36);
2293 /* Start mangling ENTITY. */
2296 start_mangling (const tree entity
)
2299 G
.need_abi_warning
= false;
2300 VARRAY_TREE_INIT (G
.substitutions
, 1, "mangling substitutions");
2301 obstack_free (&G
.name_obstack
, obstack_base (&G
.name_obstack
));
2304 /* Done with mangling. Return the generated mangled name. If WARN is
2305 true, and the name of G.entity will be mangled differently in a
2306 future version of the ABI, issue a warning. */
2308 static inline const char *
2309 finish_mangling (const bool warn
)
2311 if (warn_abi
&& warn
&& G
.need_abi_warning
)
2312 warning ("the mangled name of `%D' will change in a future "
2316 /* Clear all the substitutions. */
2317 G
.substitutions
= 0;
2319 /* Null-terminate the string. */
2322 return (const char *) obstack_base (&G
.name_obstack
);
2325 /* Initialize data structures for mangling. */
2330 gcc_obstack_init (&G
.name_obstack
);
2332 /* Cache these identifiers for quick comparison when checking for
2333 standard substitutions. */
2334 subst_identifiers
[SUBID_ALLOCATOR
] = get_identifier ("allocator");
2335 subst_identifiers
[SUBID_BASIC_STRING
] = get_identifier ("basic_string");
2336 subst_identifiers
[SUBID_CHAR_TRAITS
] = get_identifier ("char_traits");
2337 subst_identifiers
[SUBID_BASIC_ISTREAM
] = get_identifier ("basic_istream");
2338 subst_identifiers
[SUBID_BASIC_OSTREAM
] = get_identifier ("basic_ostream");
2339 subst_identifiers
[SUBID_BASIC_IOSTREAM
] = get_identifier ("basic_iostream");
2342 /* Generate the mangled name of DECL. */
2345 mangle_decl_string (const tree decl
)
2349 start_mangling (decl
);
2351 if (TREE_CODE (decl
) == TYPE_DECL
)
2352 write_type (TREE_TYPE (decl
));
2353 else if (/* The names of `extern "C"' functions are not mangled. */
2354 (DECL_EXTERN_C_FUNCTION_P (decl
)
2355 /* But overloaded operator names *are* mangled. */
2356 && !DECL_OVERLOADED_OPERATOR_P (decl
))
2357 /* The names of global variables aren't mangled either. */
2358 || (TREE_CODE (decl
) == VAR_DECL
2359 && CP_DECL_CONTEXT (decl
) == global_namespace
)
2360 /* And neither are `extern "C"' variables. */
2361 || (TREE_CODE (decl
) == VAR_DECL
2362 && DECL_EXTERN_C_P (decl
)))
2363 write_string (IDENTIFIER_POINTER (DECL_NAME (decl
)));
2366 write_mangled_name (decl
);
2367 if (DECL_LANG_SPECIFIC (decl
)
2368 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
)
2369 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
)))
2370 /* We need a distinct mangled name for these entities, but
2371 we should never actually output it. So, we append some
2372 characters the assembler won't like. */
2373 write_string (" *INTERNAL* ");
2376 result
= finish_mangling (/*warn=*/true);
2378 fprintf (stderr
, "mangle_decl_string = '%s'\n\n", result
);
2382 /* Create an identifier for the external mangled name of DECL. */
2385 mangle_decl (const tree decl
)
2387 tree id
= get_identifier (mangle_decl_string (decl
));
2389 SET_DECL_ASSEMBLER_NAME (decl
, id
);
2392 /* Generate the mangled representation of TYPE. */
2395 mangle_type_string (const tree type
)
2399 start_mangling (type
);
2401 result
= finish_mangling (/*warn=*/false);
2403 fprintf (stderr
, "mangle_type_string = '%s'\n\n", result
);
2407 /* Create an identifier for the mangled representation of TYPE. */
2410 mangle_type (const tree type
)
2412 return get_identifier (mangle_type_string (type
));
2415 /* Create an identifier for the mangled name of a special component
2416 for belonging to TYPE. CODE is the ABI-specified code for this
2420 mangle_special_for_type (const tree type
, const char *code
)
2424 /* We don't have an actual decl here for the special component, so
2425 we can't just process the <encoded-name>. Instead, fake it. */
2426 start_mangling (type
);
2428 /* Start the mangling. */
2429 write_string ("_Z");
2430 write_string (code
);
2434 result
= finish_mangling (/*warn=*/false);
2437 fprintf (stderr
, "mangle_special_for_type = %s\n\n", result
);
2439 return get_identifier (result
);
2442 /* Create an identifier for the mangled representation of the typeinfo
2443 structure for TYPE. */
2446 mangle_typeinfo_for_type (const tree type
)
2448 return mangle_special_for_type (type
, "TI");
2451 /* Create an identifier for the mangled name of the NTBS containing
2452 the mangled name of TYPE. */
2455 mangle_typeinfo_string_for_type (const tree type
)
2457 return mangle_special_for_type (type
, "TS");
2460 /* Create an identifier for the mangled name of the vtable for TYPE. */
2463 mangle_vtbl_for_type (const tree type
)
2465 return mangle_special_for_type (type
, "TV");
2468 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2471 mangle_vtt_for_type (const tree type
)
2473 return mangle_special_for_type (type
, "TT");
2476 /* Return an identifier for a construction vtable group. TYPE is
2477 the most derived class in the hierarchy; BINFO is the base
2478 subobject for which this construction vtable group will be used.
2480 This mangling isn't part of the ABI specification; in the ABI
2481 specification, the vtable group is dumped in the same COMDAT as the
2482 main vtable, and is referenced only from that vtable, so it doesn't
2483 need an external name. For binary formats without COMDAT sections,
2484 though, we need external names for the vtable groups.
2486 We use the production
2488 <special-name> ::= CT <type> <offset number> _ <base type> */
2491 mangle_ctor_vtbl_for_type (const tree type
, const tree binfo
)
2495 start_mangling (type
);
2497 write_string ("_Z");
2498 write_string ("TC");
2500 write_integer_cst (BINFO_OFFSET (binfo
));
2502 write_type (BINFO_TYPE (binfo
));
2504 result
= finish_mangling (/*warn=*/false);
2506 fprintf (stderr
, "mangle_ctor_vtbl_for_type = %s\n\n", result
);
2507 return get_identifier (result
);
2510 /* Mangle a this pointer or result pointer adjustment.
2512 <call-offset> ::= h <fixed offset number> _
2513 ::= v <fixed offset number> _ <virtual offset number> _ */
2516 mangle_call_offset (const tree fixed_offset
, const tree virtual_offset
)
2518 write_char (virtual_offset
? 'v' : 'h');
2520 /* For either flavor, write the fixed offset. */
2521 write_integer_cst (fixed_offset
);
2524 /* For a virtual thunk, add the virtual offset. */
2527 write_integer_cst (virtual_offset
);
2532 /* Return an identifier for the mangled name of a this-adjusting or
2533 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2534 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2535 is a virtual thunk, and it is the vtbl offset in
2536 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2537 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2538 thunk itself. A covariant thunk name always includes the adjustment
2539 for the this pointer, even if there is none.
2541 <special-name> ::= T <call-offset> <base encoding>
2542 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2547 mangle_thunk (tree fn_decl
, const int this_adjusting
, tree fixed_offset
,
2548 tree virtual_offset
)
2552 start_mangling (fn_decl
);
2554 write_string ("_Z");
2557 if (!this_adjusting
)
2559 /* Covariant thunk with no this adjustment */
2561 mangle_call_offset (integer_zero_node
, NULL_TREE
);
2562 mangle_call_offset (fixed_offset
, virtual_offset
);
2564 else if (!DECL_THUNK_P (fn_decl
))
2565 /* Plain this adjusting thunk. */
2566 mangle_call_offset (fixed_offset
, virtual_offset
);
2569 /* This adjusting thunk to covariant thunk. */
2571 mangle_call_offset (fixed_offset
, virtual_offset
);
2572 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn_decl
));
2573 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn_decl
);
2575 virtual_offset
= BINFO_VPTR_FIELD (virtual_offset
);
2576 mangle_call_offset (fixed_offset
, virtual_offset
);
2577 fn_decl
= THUNK_TARGET (fn_decl
);
2581 write_encoding (fn_decl
);
2583 result
= finish_mangling (/*warn=*/false);
2585 fprintf (stderr
, "mangle_thunk = %s\n\n", result
);
2586 return get_identifier (result
);
2589 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2590 operator to TYPE. The nodes are TREE_LISTs whose TREE_PURPOSE is
2591 the TYPE and whose TREE_VALUE is the IDENTIFIER. */
2593 static GTY ((param_is (union tree_node
))) htab_t conv_type_names
;
2595 /* Hash a node (VAL1) in the table. */
2598 hash_type (const void *val
)
2600 return htab_hash_pointer (TREE_PURPOSE ((tree
) val
));
2603 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2606 compare_type (const void *val1
, const void *val2
)
2608 return TREE_PURPOSE ((tree
) val1
) == (tree
) val2
;
2611 /* Return an identifier for the mangled unqualified name for a
2612 conversion operator to TYPE. This mangling is not specified by the
2613 ABI spec; it is only used internally. */
2616 mangle_conv_op_name_for_type (const tree type
)
2622 if (conv_type_names
== NULL
)
2623 conv_type_names
= htab_create_ggc (31, &hash_type
, &compare_type
, NULL
);
2625 slot
= htab_find_slot_with_hash (conv_type_names
, type
,
2626 htab_hash_pointer (type
), INSERT
);
2628 return TREE_VALUE ((tree
) *slot
);
2630 /* Create a unique name corresponding to TYPE. */
2631 sprintf (buffer
, "operator %lu",
2632 (unsigned long) htab_elements (conv_type_names
));
2633 identifier
= get_identifier (buffer
);
2634 *slot
= build_tree_list (type
, identifier
);
2636 /* Set bits on the identifier so we know later it's a conversion. */
2637 IDENTIFIER_OPNAME_P (identifier
) = 1;
2638 IDENTIFIER_TYPENAME_P (identifier
) = 1;
2639 /* Hang TYPE off the identifier so it can be found easily later when
2640 performing conversions. */
2641 TREE_TYPE (identifier
) = type
;
2646 /* Return an identifier for the name of an initialization guard
2647 variable for indicated VARIABLE. */
2650 mangle_guard_variable (const tree variable
)
2652 start_mangling (variable
);
2653 write_string ("_ZGV");
2654 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable
)), "_ZGR", 4) == 0)
2655 /* The name of a guard variable for a reference temporary should refer
2656 to the reference, not the temporary. */
2657 write_string (IDENTIFIER_POINTER (DECL_NAME (variable
)) + 4);
2659 write_name (variable
, /*ignore_local_scope=*/0);
2660 return get_identifier (finish_mangling (/*warn=*/false));
2663 /* Return an identifier for the name of a temporary variable used to
2664 initialize a static reference. This isn't part of the ABI, but we might
2665 as well call them something readable. */
2668 mangle_ref_init_variable (const tree variable
)
2670 start_mangling (variable
);
2671 write_string ("_ZGR");
2672 write_name (variable
, /*ignore_local_scope=*/0);
2673 return get_identifier (finish_mangling (/*warn=*/false));
2677 /* Foreign language type mangling section. */
2679 /* How to write the type codes for the integer Java type. */
2682 write_java_integer_type_codes (const tree type
)
2684 if (type
== java_int_type_node
)
2686 else if (type
== java_short_type_node
)
2688 else if (type
== java_byte_type_node
)
2690 else if (type
== java_char_type_node
)
2692 else if (type
== java_long_type_node
)
2694 else if (type
== java_boolean_type_node
)
2700 #include "gt-cp-mangle.h"