1 /* Name mangling for the 3.0 C++ ABI.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005
3 Free Software Foundation, Inc.
4 Written by Alex Samuel <[email protected]>
5
6 This file is part of GCC.
7
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 2, or (at your option)
11 any later version.
12
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.
17
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
21 02110-1301, USA. */
22
23 /* This file implements mangling of C++ names according to the IA64
24 C++ ABI specification. A mangled name encodes a function or
25 variable's name, scope, type, and/or template arguments into a text
26 identifier. This identifier is used as the function's or
27 variable's linkage name, to preserve compatibility between C++'s
28 language features (templates, scoping, and overloading) and C
29 linkers.
30
31 Additionally, g++ uses mangled names internally. To support this,
32 mangling of types is allowed, even though the mangled name of a
33 type should not appear by itself as an exported name. Ditto for
34 uninstantiated templates.
35
36 The primary entry point for this module is mangle_decl, which
37 returns an identifier containing the mangled name for a decl.
38 Additional entry points are provided to build mangled names of
39 particular constructs when the appropriate decl for that construct
40 is not available. These are:
41
42 mangle_typeinfo_for_type: typeinfo data
43 mangle_typeinfo_string_for_type: typeinfo type name
44 mangle_vtbl_for_type: virtual table data
45 mangle_vtt_for_type: VTT data
46 mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
47 mangle_thunk: thunk function or entry */
48
49 #include "config.h"
50 #include "system.h"
51 #include "coretypes.h"
52 #include "tm.h"
53 #include "tree.h"
54 #include "tm_p.h"
55 #include "cp-tree.h"
56 #include "real.h"
57 #include "obstack.h"
58 #include "toplev.h"
59 #include "varray.h"
60 #include "flags.h"
61 #include "target.h"
62
63 /* Debugging support. */
64
65 /* Define DEBUG_MANGLE to enable very verbose trace messages. */
66 #ifndef DEBUG_MANGLE
67 #define DEBUG_MANGLE 0
68 #endif
69
70 /* Macros for tracing the write_* functions. */
71 #if DEBUG_MANGLE
72 # define MANGLE_TRACE(FN, INPUT) \
73 fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
74 # define MANGLE_TRACE_TREE(FN, NODE) \
75 fprintf (stderr, " %-24s: %-24s (%p)\n", \
76 (FN), tree_code_name[TREE_CODE (NODE)], (void *) (NODE))
77 #else
78 # define MANGLE_TRACE(FN, INPUT)
79 # define MANGLE_TRACE_TREE(FN, NODE)
80 #endif
81
82 /* Nonzero if NODE is a class template-id. We can't rely on
83 CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
84 that hard to distinguish A<T> from A, where A<T> is the type as
85 instantiated outside of the template, and A is the type used
86 without parameters inside the template. */
87 #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
88 (TYPE_LANG_SPECIFIC (NODE) != NULL \
89 && (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
90 || (CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
91 && (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))))
92
93 /* Things we only need one of. This module is not reentrant. */
94 typedef struct globals GTY(())
95 {
96 /* An array of the current substitution candidates, in the order
97 we've seen them. */
98 VEC(tree,gc) *substitutions;
99
100 /* The entity that is being mangled. */
101 tree GTY ((skip)) entity;
102
103 /* True if the mangling will be different in a future version of the
104 ABI. */
105 bool need_abi_warning;
106 } globals;
107
108 static GTY (()) globals G;
109
110 /* The obstack on which we build mangled names. */
111 static struct obstack *mangle_obstack;
112
113 /* The obstack on which we build mangled names that are not going to
114 be IDENTIFIER_NODEs. */
115 static struct obstack name_obstack;
116
117 /* The first object on the name_obstack; we use this to free memory
118 allocated on the name_obstack. */
119 static void *name_base;
120
121 /* An incomplete mangled name. There will be no NUL terminator. If
122 there is no incomplete mangled name, this variable is NULL. */
123 static char *partially_mangled_name;
124
125 /* The number of characters in the PARTIALLY_MANGLED_NAME. */
126 static size_t partially_mangled_name_len;
127
128 /* Indices into subst_identifiers. These are identifiers used in
129 special substitution rules. */
130 typedef enum
131 {
132 SUBID_ALLOCATOR,
133 SUBID_BASIC_STRING,
134 SUBID_CHAR_TRAITS,
135 SUBID_BASIC_ISTREAM,
136 SUBID_BASIC_OSTREAM,
137 SUBID_BASIC_IOSTREAM,
138 SUBID_MAX
139 }
140 substitution_identifier_index_t;
141
142 /* For quick substitution checks, look up these common identifiers
143 once only. */
144 static GTY(()) tree subst_identifiers[SUBID_MAX];
145
146 /* Single-letter codes for builtin integer types, defined in
147 <builtin-type>. These are indexed by integer_type_kind values. */
148 static const char
149 integer_type_codes[itk_none] =
150 {
151 'c', /* itk_char */
152 'a', /* itk_signed_char */
153 'h', /* itk_unsigned_char */
154 's', /* itk_short */
155 't', /* itk_unsigned_short */
156 'i', /* itk_int */
157 'j', /* itk_unsigned_int */
158 'l', /* itk_long */
159 'm', /* itk_unsigned_long */
160 'x', /* itk_long_long */
161 'y' /* itk_unsigned_long_long */
162 };
163
164 static int decl_is_template_id (const tree, tree* const);
165
166 /* Functions for handling substitutions. */
167
168 static inline tree canonicalize_for_substitution (tree);
169 static void add_substitution (tree);
170 static inline int is_std_substitution (const tree,
171 const substitution_identifier_index_t);
172 static inline int is_std_substitution_char (const tree,
173 const substitution_identifier_index_t);
174 static int find_substitution (tree);
175 static void mangle_call_offset (const tree, const tree);
176
177 /* Functions for emitting mangled representations of things. */
178
179 static void write_mangled_name (const tree, bool);
180 static void write_encoding (const tree);
181 static void write_name (tree, const int);
182 static void write_unscoped_name (const tree);
183 static void write_unscoped_template_name (const tree);
184 static void write_nested_name (const tree);
185 static void write_prefix (const tree);
186 static void write_template_prefix (const tree);
187 static void write_unqualified_name (const tree);
188 static void write_conversion_operator_name (const tree);
189 static void write_source_name (tree);
190 static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
191 const unsigned int);
192 static void write_number (unsigned HOST_WIDE_INT, const int,
193 const unsigned int);
194 static void write_integer_cst (const tree);
195 static void write_real_cst (const tree);
196 static void write_identifier (const char *);
197 static void write_special_name_constructor (const tree);
198 static void write_special_name_destructor (const tree);
199 static void write_type (tree);
200 static int write_CV_qualifiers_for_type (const tree);
201 static void write_builtin_type (tree);
202 static void write_function_type (const tree);
203 static void write_bare_function_type (const tree, const int, const tree);
204 static void write_method_parms (tree, const int, const tree);
205 static void write_class_enum_type (const tree);
206 static void write_template_args (tree);
207 static void write_expression (tree);
208 static void write_template_arg_literal (const tree);
209 static void write_template_arg (tree);
210 static void write_template_template_arg (const tree);
211 static void write_array_type (const tree);
212 static void write_pointer_to_member_type (const tree);
213 static void write_template_param (const tree);
214 static void write_template_template_param (const tree);
215 static void write_substitution (const int);
216 static int discriminator_for_local_entity (tree);
217 static int discriminator_for_string_literal (tree, tree);
218 static void write_discriminator (const int);
219 static void write_local_name (const tree, const tree, const tree);
220 static void dump_substitution_candidates (void);
221 static const char *mangle_decl_string (const tree);
222
223 /* Control functions. */
224
225 static inline void start_mangling (const tree, bool);
226 static inline const char *finish_mangling (const bool);
227 static tree mangle_special_for_type (const tree, const char *);
228
229 /* Foreign language functions. */
230
231 static void write_java_integer_type_codes (const tree);
232
233 /* Append a single character to the end of the mangled
234 representation. */
235 #define write_char(CHAR) \
236 obstack_1grow (mangle_obstack, (CHAR))
237
238 /* Append a sized buffer to the end of the mangled representation. */
239 #define write_chars(CHAR, LEN) \
240 obstack_grow (mangle_obstack, (CHAR), (LEN))
241
242 /* Append a NUL-terminated string to the end of the mangled
243 representation. */
244 #define write_string(STRING) \
245 obstack_grow (mangle_obstack, (STRING), strlen (STRING))
246
247 /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
248 same purpose (context, which may be a type) and value (template
249 decl). See write_template_prefix for more information on what this
250 is used for. */
251 #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
252 (TREE_CODE (NODE1) == TREE_LIST \
253 && TREE_CODE (NODE2) == TREE_LIST \
254 && ((TYPE_P (TREE_PURPOSE (NODE1)) \
255 && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
256 || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
257 && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
258
259 /* Write out an unsigned quantity in base 10. */
260 #define write_unsigned_number(NUMBER) \
261 write_number ((NUMBER), /*unsigned_p=*/1, 10)
262
263 /* Save the current (incomplete) mangled name and release the obstack
264 storage holding it. This function should be used during mangling
265 when making a call that could result in a call to get_identifier,
266 as such a call will clobber the same obstack being used for
267 mangling. This function may not be called twice without an
268 intervening call to restore_partially_mangled_name. */
269
270 static void
save_partially_mangled_name(void)271 save_partially_mangled_name (void)
272 {
273 if (mangle_obstack == &ident_hash->stack)
274 {
275 gcc_assert (!partially_mangled_name);
276 partially_mangled_name_len = obstack_object_size (mangle_obstack);
277 partially_mangled_name = XNEWVEC (char, partially_mangled_name_len);
278 memcpy (partially_mangled_name, obstack_base (mangle_obstack),
279 partially_mangled_name_len);
280 obstack_free (mangle_obstack, obstack_finish (mangle_obstack));
281 }
282 }
283
284 /* Restore the incomplete mangled name saved with
285 save_partially_mangled_name. */
286
287 static void
restore_partially_mangled_name(void)288 restore_partially_mangled_name (void)
289 {
290 if (partially_mangled_name)
291 {
292 obstack_grow (mangle_obstack, partially_mangled_name,
293 partially_mangled_name_len);
294 free (partially_mangled_name);
295 partially_mangled_name = NULL;
296 }
297 }
298
299 /* If DECL is a template instance, return nonzero and, if
300 TEMPLATE_INFO is non-NULL, set *TEMPLATE_INFO to its template info.
301 Otherwise return zero. */
302
303 static int
decl_is_template_id(const tree decl,tree * const template_info)304 decl_is_template_id (const tree decl, tree* const template_info)
305 {
306 if (TREE_CODE (decl) == TYPE_DECL)
307 {
308 /* TYPE_DECLs are handled specially. Look at its type to decide
309 if this is a template instantiation. */
310 const tree type = TREE_TYPE (decl);
311
312 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
313 {
314 if (template_info != NULL)
315 /* For a templated TYPE_DECL, the template info is hanging
316 off the type. */
317 *template_info = TYPE_TEMPLATE_INFO (type);
318 return 1;
319 }
320 }
321 else
322 {
323 /* Check if this is a primary template. */
324 if (DECL_LANG_SPECIFIC (decl) != NULL
325 && DECL_USE_TEMPLATE (decl)
326 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl))
327 && TREE_CODE (decl) != TEMPLATE_DECL)
328 {
329 if (template_info != NULL)
330 /* For most templated decls, the template info is hanging
331 off the decl. */
332 *template_info = DECL_TEMPLATE_INFO (decl);
333 return 1;
334 }
335 }
336
337 /* It's not a template id. */
338 return 0;
339 }
340
341 /* Produce debugging output of current substitution candidates. */
342
343 static void
dump_substitution_candidates(void)344 dump_substitution_candidates (void)
345 {
346 unsigned i;
347 tree el;
348
349 fprintf (stderr, " ++ substitutions ");
350 for (i = 0; VEC_iterate (tree, G.substitutions, i, el); ++i)
351 {
352 const char *name = "???";
353
354 if (i > 0)
355 fprintf (stderr, " ");
356 if (DECL_P (el))
357 name = IDENTIFIER_POINTER (DECL_NAME (el));
358 else if (TREE_CODE (el) == TREE_LIST)
359 name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
360 else if (TYPE_NAME (el))
361 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (el)));
362 fprintf (stderr, " S%d_ = ", i - 1);
363 if (TYPE_P (el) &&
364 (CP_TYPE_RESTRICT_P (el)
365 || CP_TYPE_VOLATILE_P (el)
366 || CP_TYPE_CONST_P (el)))
367 fprintf (stderr, "CV-");
368 fprintf (stderr, "%s (%s at %p)\n",
369 name, tree_code_name[TREE_CODE (el)], (void *) el);
370 }
371 }
372
373 /* Both decls and types can be substitution candidates, but sometimes
374 they refer to the same thing. For instance, a TYPE_DECL and
375 RECORD_TYPE for the same class refer to the same thing, and should
376 be treated accordingly in substitutions. This function returns a
377 canonicalized tree node representing NODE that is used when adding
378 and substitution candidates and finding matches. */
379
380 static inline tree
canonicalize_for_substitution(tree node)381 canonicalize_for_substitution (tree node)
382 {
383 /* For a TYPE_DECL, use the type instead. */
384 if (TREE_CODE (node) == TYPE_DECL)
385 node = TREE_TYPE (node);
386 if (TYPE_P (node))
387 node = canonical_type_variant (node);
388
389 return node;
390 }
391
392 /* Add NODE as a substitution candidate. NODE must not already be on
393 the list of candidates. */
394
395 static void
add_substitution(tree node)396 add_substitution (tree node)
397 {
398 tree c;
399
400 if (DEBUG_MANGLE)
401 fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
402 tree_code_name[TREE_CODE (node)], (void *) node);
403
404 /* Get the canonicalized substitution candidate for NODE. */
405 c = canonicalize_for_substitution (node);
406 if (DEBUG_MANGLE && c != node)
407 fprintf (stderr, " ++ using candidate (%s at %10p)\n",
408 tree_code_name[TREE_CODE (node)], (void *) node);
409 node = c;
410
411 #if ENABLE_CHECKING
412 /* Make sure NODE isn't already a candidate. */
413 {
414 int i;
415 tree candidate;
416
417 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++)
418 {
419 gcc_assert (!(DECL_P (node) && node == candidate));
420 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
421 && same_type_p (node, candidate)));
422 }
423 }
424 #endif /* ENABLE_CHECKING */
425
426 /* Put the decl onto the varray of substitution candidates. */
427 VEC_safe_push (tree, gc, G.substitutions, node);
428
429 if (DEBUG_MANGLE)
430 dump_substitution_candidates ();
431 }
432
433 /* Helper function for find_substitution. Returns nonzero if NODE,
434 which may be a decl or a CLASS_TYPE, is a template-id with template
435 name of substitution_index[INDEX] in the ::std namespace. */
436
437 static inline int
is_std_substitution(const tree node,const substitution_identifier_index_t index)438 is_std_substitution (const tree node,
439 const substitution_identifier_index_t index)
440 {
441 tree type = NULL;
442 tree decl = NULL;
443
444 if (DECL_P (node))
445 {
446 type = TREE_TYPE (node);
447 decl = node;
448 }
449 else if (CLASS_TYPE_P (node))
450 {
451 type = node;
452 decl = TYPE_NAME (node);
453 }
454 else
455 /* These are not the droids you're looking for. */
456 return 0;
457
458 return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl))
459 && TYPE_LANG_SPECIFIC (type)
460 && TYPE_TEMPLATE_INFO (type)
461 && (DECL_NAME (TYPE_TI_TEMPLATE (type))
462 == subst_identifiers[index]));
463 }
464
465 /* Helper function for find_substitution. Returns nonzero if NODE,
466 which may be a decl or a CLASS_TYPE, is the template-id
467 ::std::identifier<char>, where identifier is
468 substitution_index[INDEX]. */
469
470 static inline int
is_std_substitution_char(const tree node,const substitution_identifier_index_t index)471 is_std_substitution_char (const tree node,
472 const substitution_identifier_index_t index)
473 {
474 tree args;
475 /* Check NODE's name is ::std::identifier. */
476 if (!is_std_substitution (node, index))
477 return 0;
478 /* Figure out its template args. */
479 if (DECL_P (node))
480 args = DECL_TI_ARGS (node);
481 else if (CLASS_TYPE_P (node))
482 args = CLASSTYPE_TI_ARGS (node);
483 else
484 /* Oops, not a template. */
485 return 0;
486 /* NODE's template arg list should be <char>. */
487 return
488 TREE_VEC_LENGTH (args) == 1
489 && TREE_VEC_ELT (args, 0) == char_type_node;
490 }
491
492 /* Check whether a substitution should be used to represent NODE in
493 the mangling.
494
495 First, check standard special-case substitutions.
496
497 <substitution> ::= St
498 # ::std
499
500 ::= Sa
501 # ::std::allocator
502
503 ::= Sb
504 # ::std::basic_string
505
506 ::= Ss
507 # ::std::basic_string<char,
508 ::std::char_traits<char>,
509 ::std::allocator<char> >
510
511 ::= Si
512 # ::std::basic_istream<char, ::std::char_traits<char> >
513
514 ::= So
515 # ::std::basic_ostream<char, ::std::char_traits<char> >
516
517 ::= Sd
518 # ::std::basic_iostream<char, ::std::char_traits<char> >
519
520 Then examine the stack of currently available substitution
521 candidates for entities appearing earlier in the same mangling
522
523 If a substitution is found, write its mangled representation and
524 return nonzero. If none is found, just return zero. */
525
526 static int
find_substitution(tree node)527 find_substitution (tree node)
528 {
529 int i;
530 const int size = VEC_length (tree, G.substitutions);
531 tree decl;
532 tree type;
533
534 if (DEBUG_MANGLE)
535 fprintf (stderr, " ++ find_substitution (%s at %p)\n",
536 tree_code_name[TREE_CODE (node)], (void *) node);
537
538 /* Obtain the canonicalized substitution representation for NODE.
539 This is what we'll compare against. */
540 node = canonicalize_for_substitution (node);
541
542 /* Check for builtin substitutions. */
543
544 decl = TYPE_P (node) ? TYPE_NAME (node) : node;
545 type = TYPE_P (node) ? node : TREE_TYPE (node);
546
547 /* Check for std::allocator. */
548 if (decl
549 && is_std_substitution (decl, SUBID_ALLOCATOR)
550 && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
551 {
552 write_string ("Sa");
553 return 1;
554 }
555
556 /* Check for std::basic_string. */
557 if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
558 {
559 if (TYPE_P (node))
560 {
561 /* If this is a type (i.e. a fully-qualified template-id),
562 check for
563 std::basic_string <char,
564 std::char_traits<char>,
565 std::allocator<char> > . */
566 if (cp_type_quals (type) == TYPE_UNQUALIFIED
567 && CLASSTYPE_USE_TEMPLATE (type))
568 {
569 tree args = CLASSTYPE_TI_ARGS (type);
570 if (TREE_VEC_LENGTH (args) == 3
571 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
572 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
573 SUBID_CHAR_TRAITS)
574 && is_std_substitution_char (TREE_VEC_ELT (args, 2),
575 SUBID_ALLOCATOR))
576 {
577 write_string ("Ss");
578 return 1;
579 }
580 }
581 }
582 else
583 /* Substitute for the template name only if this isn't a type. */
584 {
585 write_string ("Sb");
586 return 1;
587 }
588 }
589
590 /* Check for basic_{i,o,io}stream. */
591 if (TYPE_P (node)
592 && cp_type_quals (type) == TYPE_UNQUALIFIED
593 && CLASS_TYPE_P (type)
594 && CLASSTYPE_USE_TEMPLATE (type)
595 && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
596 {
597 /* First, check for the template
598 args <char, std::char_traits<char> > . */
599 tree args = CLASSTYPE_TI_ARGS (type);
600 if (TREE_VEC_LENGTH (args) == 2
601 && TYPE_P (TREE_VEC_ELT (args, 0))
602 && same_type_p (TREE_VEC_ELT (args, 0), char_type_node)
603 && is_std_substitution_char (TREE_VEC_ELT (args, 1),
604 SUBID_CHAR_TRAITS))
605 {
606 /* Got them. Is this basic_istream? */
607 if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
608 {
609 write_string ("Si");
610 return 1;
611 }
612 /* Or basic_ostream? */
613 else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
614 {
615 write_string ("So");
616 return 1;
617 }
618 /* Or basic_iostream? */
619 else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
620 {
621 write_string ("Sd");
622 return 1;
623 }
624 }
625 }
626
627 /* Check for namespace std. */
628 if (decl && DECL_NAMESPACE_STD_P (decl))
629 {
630 write_string ("St");
631 return 1;
632 }
633
634 /* Now check the list of available substitutions for this mangling
635 operation. */
636 for (i = 0; i < size; ++i)
637 {
638 tree candidate = VEC_index (tree, G.substitutions, i);
639 /* NODE is a matched to a candidate if it's the same decl node or
640 if it's the same type. */
641 if (decl == candidate
642 || (TYPE_P (candidate) && type && TYPE_P (type)
643 && same_type_p (type, candidate))
644 || NESTED_TEMPLATE_MATCH (node, candidate))
645 {
646 write_substitution (i);
647 return 1;
648 }
649 }
650
651 /* No substitution found. */
652 return 0;
653 }
654
655
656 /* TOP_LEVEL is true, if this is being called at outermost level of
657 mangling. It should be false when mangling a decl appearing in an
658 expression within some other mangling.
659
660 <mangled-name> ::= _Z <encoding> */
661
662 static void
write_mangled_name(const tree decl,bool top_level)663 write_mangled_name (const tree decl, bool top_level)
664 {
665 MANGLE_TRACE_TREE ("mangled-name", decl);
666
667 if (/* The names of `extern "C"' functions are not mangled. */
668 DECL_EXTERN_C_FUNCTION_P (decl)
669 /* But overloaded operator names *are* mangled. */
670 && !DECL_OVERLOADED_OPERATOR_P (decl))
671 {
672 unmangled_name:;
673
674 if (top_level)
675 write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
676 else
677 {
678 /* The standard notes: "The <encoding> of an extern "C"
679 function is treated like global-scope data, i.e. as its
680 <source-name> without a type." We cannot write
681 overloaded operators that way though, because it contains
682 characters invalid in assembler. */
683 if (abi_version_at_least (2))
684 write_string ("_Z");
685 else
686 G.need_abi_warning = true;
687 write_source_name (DECL_NAME (decl));
688 }
689 }
690 else if (TREE_CODE (decl) == VAR_DECL
691 /* The names of non-static global variables aren't mangled. */
692 && DECL_EXTERNAL_LINKAGE_P (decl)
693 && (CP_DECL_CONTEXT (decl) == global_namespace
694 /* And neither are `extern "C"' variables. */
695 || DECL_EXTERN_C_P (decl)))
696 {
697 if (top_level || abi_version_at_least (2))
698 goto unmangled_name;
699 else
700 {
701 G.need_abi_warning = true;
702 goto mangled_name;
703 }
704 }
705 else
706 {
707 mangled_name:;
708 write_string ("_Z");
709 write_encoding (decl);
710 if (DECL_LANG_SPECIFIC (decl)
711 && (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)
712 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)))
713 /* We need a distinct mangled name for these entities, but
714 we should never actually output it. So, we append some
715 characters the assembler won't like. */
716 write_string (" *INTERNAL* ");
717 }
718 }
719
720 /* <encoding> ::= <function name> <bare-function-type>
721 ::= <data name> */
722
723 static void
write_encoding(const tree decl)724 write_encoding (const tree decl)
725 {
726 MANGLE_TRACE_TREE ("encoding", decl);
727
728 if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
729 {
730 /* For overloaded operators write just the mangled name
731 without arguments. */
732 if (DECL_OVERLOADED_OPERATOR_P (decl))
733 write_name (decl, /*ignore_local_scope=*/0);
734 else
735 write_source_name (DECL_NAME (decl));
736 return;
737 }
738
739 write_name (decl, /*ignore_local_scope=*/0);
740 if (TREE_CODE (decl) == FUNCTION_DECL)
741 {
742 tree fn_type;
743 tree d;
744
745 if (decl_is_template_id (decl, NULL))
746 {
747 save_partially_mangled_name ();
748 fn_type = get_mostly_instantiated_function_type (decl);
749 restore_partially_mangled_name ();
750 /* FN_TYPE will not have parameter types for in-charge or
751 VTT parameters. Therefore, we pass NULL_TREE to
752 write_bare_function_type -- otherwise, it will get
753 confused about which artificial parameters to skip. */
754 d = NULL_TREE;
755 }
756 else
757 {
758 fn_type = TREE_TYPE (decl);
759 d = decl;
760 }
761
762 write_bare_function_type (fn_type,
763 (!DECL_CONSTRUCTOR_P (decl)
764 && !DECL_DESTRUCTOR_P (decl)
765 && !DECL_CONV_FN_P (decl)
766 && decl_is_template_id (decl, NULL)),
767 d);
768 }
769 }
770
771 /* <name> ::= <unscoped-name>
772 ::= <unscoped-template-name> <template-args>
773 ::= <nested-name>
774 ::= <local-name>
775
776 If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
777 called from <local-name>, which mangles the enclosing scope
778 elsewhere and then uses this function to mangle just the part
779 underneath the function scope. So don't use the <local-name>
780 production, to avoid an infinite recursion. */
781
782 static void
write_name(tree decl,const int ignore_local_scope)783 write_name (tree decl, const int ignore_local_scope)
784 {
785 tree context;
786
787 MANGLE_TRACE_TREE ("name", decl);
788
789 if (TREE_CODE (decl) == TYPE_DECL)
790 {
791 /* In case this is a typedef, fish out the corresponding
792 TYPE_DECL for the main variant. */
793 decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
794 context = TYPE_CONTEXT (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
795 }
796 else
797 context = (DECL_CONTEXT (decl) == NULL) ? NULL : CP_DECL_CONTEXT (decl);
798
799 /* A decl in :: or ::std scope is treated specially. The former is
800 mangled using <unscoped-name> or <unscoped-template-name>, the
801 latter with a special substitution. Also, a name that is
802 directly in a local function scope is also mangled with
803 <unscoped-name> rather than a full <nested-name>. */
804 if (context == NULL
805 || context == global_namespace
806 || DECL_NAMESPACE_STD_P (context)
807 || (ignore_local_scope && TREE_CODE (context) == FUNCTION_DECL))
808 {
809 tree template_info;
810 /* Is this a template instance? */
811 if (decl_is_template_id (decl, &template_info))
812 {
813 /* Yes: use <unscoped-template-name>. */
814 write_unscoped_template_name (TI_TEMPLATE (template_info));
815 write_template_args (TI_ARGS (template_info));
816 }
817 else
818 /* Everything else gets an <unqualified-name>. */
819 write_unscoped_name (decl);
820 }
821 else
822 {
823 /* Handle local names, unless we asked not to (that is, invoked
824 under <local-name>, to handle only the part of the name under
825 the local scope). */
826 if (!ignore_local_scope)
827 {
828 /* Scan up the list of scope context, looking for a
829 function. If we find one, this entity is in local
830 function scope. local_entity tracks context one scope
831 level down, so it will contain the element that's
832 directly in that function's scope, either decl or one of
833 its enclosing scopes. */
834 tree local_entity = decl;
835 while (context != NULL && context != global_namespace)
836 {
837 /* Make sure we're always dealing with decls. */
838 if (context != NULL && TYPE_P (context))
839 context = TYPE_NAME (context);
840 /* Is this a function? */
841 if (TREE_CODE (context) == FUNCTION_DECL)
842 {
843 /* Yes, we have local scope. Use the <local-name>
844 production for the innermost function scope. */
845 write_local_name (context, local_entity, decl);
846 return;
847 }
848 /* Up one scope level. */
849 local_entity = context;
850 context = CP_DECL_CONTEXT (context);
851 }
852
853 /* No local scope found? Fall through to <nested-name>. */
854 }
855
856 /* Other decls get a <nested-name> to encode their scope. */
857 write_nested_name (decl);
858 }
859 }
860
861 /* <unscoped-name> ::= <unqualified-name>
862 ::= St <unqualified-name> # ::std:: */
863
864 static void
write_unscoped_name(const tree decl)865 write_unscoped_name (const tree decl)
866 {
867 tree context = CP_DECL_CONTEXT (decl);
868
869 MANGLE_TRACE_TREE ("unscoped-name", decl);
870
871 /* Is DECL in ::std? */
872 if (DECL_NAMESPACE_STD_P (context))
873 {
874 write_string ("St");
875 write_unqualified_name (decl);
876 }
877 else
878 {
879 /* If not, it should be either in the global namespace, or directly
880 in a local function scope. */
881 gcc_assert (context == global_namespace
882 || context == NULL
883 || TREE_CODE (context) == FUNCTION_DECL);
884
885 write_unqualified_name (decl);
886 }
887 }
888
889 /* <unscoped-template-name> ::= <unscoped-name>
890 ::= <substitution> */
891
892 static void
write_unscoped_template_name(const tree decl)893 write_unscoped_template_name (const tree decl)
894 {
895 MANGLE_TRACE_TREE ("unscoped-template-name", decl);
896
897 if (find_substitution (decl))
898 return;
899 write_unscoped_name (decl);
900 add_substitution (decl);
901 }
902
903 /* Write the nested name, including CV-qualifiers, of DECL.
904
905 <nested-name> ::= N [<CV-qualifiers>] <prefix> <unqualified-name> E
906 ::= N [<CV-qualifiers>] <template-prefix> <template-args> E
907
908 <CV-qualifiers> ::= [r] [V] [K] */
909
910 static void
write_nested_name(const tree decl)911 write_nested_name (const tree decl)
912 {
913 tree template_info;
914
915 MANGLE_TRACE_TREE ("nested-name", decl);
916
917 write_char ('N');
918
919 /* Write CV-qualifiers, if this is a member function. */
920 if (TREE_CODE (decl) == FUNCTION_DECL
921 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
922 {
923 if (DECL_VOLATILE_MEMFUNC_P (decl))
924 write_char ('V');
925 if (DECL_CONST_MEMFUNC_P (decl))
926 write_char ('K');
927 }
928
929 /* Is this a template instance? */
930 if (decl_is_template_id (decl, &template_info))
931 {
932 /* Yes, use <template-prefix>. */
933 write_template_prefix (decl);
934 write_template_args (TI_ARGS (template_info));
935 }
936 else
937 {
938 /* No, just use <prefix> */
939 write_prefix (DECL_CONTEXT (decl));
940 write_unqualified_name (decl);
941 }
942 write_char ('E');
943 }
944
945 /* <prefix> ::= <prefix> <unqualified-name>
946 ::= <template-param>
947 ::= <template-prefix> <template-args>
948 ::= # empty
949 ::= <substitution> */
950
951 static void
write_prefix(const tree node)952 write_prefix (const tree node)
953 {
954 tree decl;
955 /* Non-NULL if NODE represents a template-id. */
956 tree template_info = NULL;
957
958 MANGLE_TRACE_TREE ("prefix", node);
959
960 if (node == NULL
961 || node == global_namespace)
962 return;
963
964 if (find_substitution (node))
965 return;
966
967 if (DECL_P (node))
968 {
969 /* If this is a function decl, that means we've hit function
970 scope, so this prefix must be for a local name. In this
971 case, we're under the <local-name> production, which encodes
972 the enclosing function scope elsewhere. So don't continue
973 here. */
974 if (TREE_CODE (node) == FUNCTION_DECL)
975 return;
976
977 decl = node;
978 decl_is_template_id (decl, &template_info);
979 }
980 else
981 {
982 /* Node is a type. */
983 decl = TYPE_NAME (node);
984 if (CLASSTYPE_TEMPLATE_ID_P (node))
985 template_info = TYPE_TEMPLATE_INFO (node);
986 }
987
988 /* In G++ 3.2, the name of the template parameter was used. */
989 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
990 && !abi_version_at_least (2))
991 G.need_abi_warning = true;
992
993 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
994 && abi_version_at_least (2))
995 write_template_param (node);
996 else if (template_info != NULL)
997 /* Templated. */
998 {
999 write_template_prefix (decl);
1000 write_template_args (TI_ARGS (template_info));
1001 }
1002 else
1003 /* Not templated. */
1004 {
1005 write_prefix (CP_DECL_CONTEXT (decl));
1006 write_unqualified_name (decl);
1007 }
1008
1009 add_substitution (node);
1010 }
1011
1012 /* <template-prefix> ::= <prefix> <template component>
1013 ::= <template-param>
1014 ::= <substitution> */
1015
1016 static void
write_template_prefix(const tree node)1017 write_template_prefix (const tree node)
1018 {
1019 tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1020 tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1021 tree context = CP_DECL_CONTEXT (decl);
1022 tree template_info;
1023 tree template;
1024 tree substitution;
1025
1026 MANGLE_TRACE_TREE ("template-prefix", node);
1027
1028 /* Find the template decl. */
1029 if (decl_is_template_id (decl, &template_info))
1030 template = TI_TEMPLATE (template_info);
1031 else
1032 {
1033 gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
1034
1035 template = TYPE_TI_TEMPLATE (type);
1036 }
1037
1038 /* For a member template, though, the template name for the
1039 innermost name must have all the outer template levels
1040 instantiated. For instance, consider
1041
1042 template<typename T> struct Outer {
1043 template<typename U> struct Inner {};
1044 };
1045
1046 The template name for `Inner' in `Outer<int>::Inner<float>' is
1047 `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1048 levels separately, so there's no TEMPLATE_DECL available for this
1049 (there's only `Outer<T>::Inner<U>').
1050
1051 In order to get the substitutions right, we create a special
1052 TREE_LIST to represent the substitution candidate for a nested
1053 template. The TREE_PURPOSE is the template's context, fully
1054 instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1055 template.
1056
1057 So, for the example above, `Outer<int>::Inner' is represented as a
1058 substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1059 and whose value is `Outer<T>::Inner<U>'. */
1060 if (TYPE_P (context))
1061 substitution = build_tree_list (context, template);
1062 else
1063 substitution = template;
1064
1065 if (find_substitution (substitution))
1066 return;
1067
1068 /* In G++ 3.2, the name of the template template parameter was used. */
1069 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
1070 && !abi_version_at_least (2))
1071 G.need_abi_warning = true;
1072
1073 if (TREE_CODE (TREE_TYPE (template)) == TEMPLATE_TEMPLATE_PARM
1074 && abi_version_at_least (2))
1075 write_template_param (TREE_TYPE (template));
1076 else
1077 {
1078 write_prefix (context);
1079 write_unqualified_name (decl);
1080 }
1081
1082 add_substitution (substitution);
1083 }
1084
1085 /* We don't need to handle thunks, vtables, or VTTs here. Those are
1086 mangled through special entry points.
1087
1088 <unqualified-name> ::= <operator-name>
1089 ::= <special-name>
1090 ::= <source-name>
1091 ::= <local-source-name>
1092
1093 <local-source-name> ::= L <source-name> <discriminator> */
1094
1095 static void
write_unqualified_name(const tree decl)1096 write_unqualified_name (const tree decl)
1097 {
1098 MANGLE_TRACE_TREE ("unqualified-name", decl);
1099
1100 if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_CONSTRUCTOR_P (decl))
1101 write_special_name_constructor (decl);
1102 else if (DECL_LANG_SPECIFIC (decl) != NULL && DECL_DESTRUCTOR_P (decl))
1103 write_special_name_destructor (decl);
1104 else if (DECL_NAME (decl) == NULL_TREE)
1105 write_source_name (DECL_ASSEMBLER_NAME (decl));
1106 else if (DECL_CONV_FN_P (decl))
1107 {
1108 /* Conversion operator. Handle it right here.
1109 <operator> ::= cv <type> */
1110 tree type;
1111 if (decl_is_template_id (decl, NULL))
1112 {
1113 tree fn_type;
1114 save_partially_mangled_name ();
1115 fn_type = get_mostly_instantiated_function_type (decl);
1116 restore_partially_mangled_name ();
1117 type = TREE_TYPE (fn_type);
1118 }
1119 else
1120 type = DECL_CONV_FN_TYPE (decl);
1121 write_conversion_operator_name (type);
1122 }
1123 else if (DECL_OVERLOADED_OPERATOR_P (decl))
1124 {
1125 operator_name_info_t *oni;
1126 if (DECL_ASSIGNMENT_OPERATOR_P (decl))
1127 oni = assignment_operator_name_info;
1128 else
1129 oni = operator_name_info;
1130
1131 write_string (oni[DECL_OVERLOADED_OPERATOR_P (decl)].mangled_name);
1132 }
1133 else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1134 && DECL_NAMESPACE_SCOPE_P (decl)
1135 && decl_linkage (decl) == lk_internal)
1136 {
1137 MANGLE_TRACE_TREE ("local-source-name", decl);
1138 write_char ('L');
1139 write_source_name (DECL_NAME (decl));
1140 /* The default discriminator is 1, and that's all we ever use,
1141 so there's no code to output one here. */
1142 }
1143 else
1144 write_source_name (DECL_NAME (decl));
1145 }
1146
1147 /* Write the unqualified-name for a conversion operator to TYPE. */
1148
1149 static void
write_conversion_operator_name(const tree type)1150 write_conversion_operator_name (const tree type)
1151 {
1152 write_string ("cv");
1153 write_type (type);
1154 }
1155
1156 /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1157
1158 <source-name> ::= </length/ number> <identifier> */
1159
1160 static void
write_source_name(tree identifier)1161 write_source_name (tree identifier)
1162 {
1163 MANGLE_TRACE_TREE ("source-name", identifier);
1164
1165 /* Never write the whole template-id name including the template
1166 arguments; we only want the template name. */
1167 if (IDENTIFIER_TEMPLATE (identifier))
1168 identifier = IDENTIFIER_TEMPLATE (identifier);
1169
1170 write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1171 write_identifier (IDENTIFIER_POINTER (identifier));
1172 }
1173
1174 /* Convert NUMBER to ascii using base BASE and generating at least
1175 MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
1176 into which to store the characters. Returns the number of
1177 characters generated (these will be layed out in advance of where
1178 BUFFER points). */
1179
1180 static int
hwint_to_ascii(unsigned HOST_WIDE_INT number,const unsigned int base,char * buffer,const unsigned int min_digits)1181 hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
1182 char *buffer, const unsigned int min_digits)
1183 {
1184 static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
1185 unsigned digits = 0;
1186
1187 while (number)
1188 {
1189 unsigned HOST_WIDE_INT d = number / base;
1190
1191 *--buffer = base_digits[number - d * base];
1192 digits++;
1193 number = d;
1194 }
1195 while (digits < min_digits)
1196 {
1197 *--buffer = base_digits[0];
1198 digits++;
1199 }
1200 return digits;
1201 }
1202
1203 /* Non-terminal <number>.
1204
1205 <number> ::= [n] </decimal integer/> */
1206
1207 static void
write_number(unsigned HOST_WIDE_INT number,const int unsigned_p,const unsigned int base)1208 write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
1209 const unsigned int base)
1210 {
1211 char buffer[sizeof (HOST_WIDE_INT) * 8];
1212 unsigned count = 0;
1213
1214 if (!unsigned_p && (HOST_WIDE_INT) number < 0)
1215 {
1216 write_char ('n');
1217 number = -((HOST_WIDE_INT) number);
1218 }
1219 count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
1220 write_chars (buffer + sizeof (buffer) - count, count);
1221 }
1222
1223 /* Write out an integral CST in decimal. Most numbers are small, and
1224 representable in a HOST_WIDE_INT. Occasionally we'll have numbers
1225 bigger than that, which we must deal with. */
1226
1227 static inline void
write_integer_cst(const tree cst)1228 write_integer_cst (const tree cst)
1229 {
1230 int sign = tree_int_cst_sgn (cst);
1231
1232 if (TREE_INT_CST_HIGH (cst) + (sign < 0))
1233 {
1234 /* A bignum. We do this in chunks, each of which fits in a
1235 HOST_WIDE_INT. */
1236 char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
1237 unsigned HOST_WIDE_INT chunk;
1238 unsigned chunk_digits;
1239 char *ptr = buffer + sizeof (buffer);
1240 unsigned count = 0;
1241 tree n, base, type;
1242 int done;
1243
1244 /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
1245 representable. */
1246 chunk = 1000000000;
1247 chunk_digits = 9;
1248
1249 if (sizeof (HOST_WIDE_INT) >= 8)
1250 {
1251 /* It is at least 64 bits, so 10^18 is representable. */
1252 chunk_digits = 18;
1253 chunk *= chunk;
1254 }
1255
1256 type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
1257 base = build_int_cstu (type, chunk);
1258 n = build_int_cst_wide (type,
1259 TREE_INT_CST_LOW (cst), TREE_INT_CST_HIGH (cst));
1260
1261 if (sign < 0)
1262 {
1263 write_char ('n');
1264 n = fold_build1 (NEGATE_EXPR, type, n);
1265 }
1266 do
1267 {
1268 tree d = fold_build2 (FLOOR_DIV_EXPR, type, n, base);
1269 tree tmp = fold_build2 (MULT_EXPR, type, d, base);
1270 unsigned c;
1271
1272 done = integer_zerop (d);
1273 tmp = fold_build2 (MINUS_EXPR, type, n, tmp);
1274 c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
1275 done ? 1 : chunk_digits);
1276 ptr -= c;
1277 count += c;
1278 n = d;
1279 }
1280 while (!done);
1281 write_chars (ptr, count);
1282 }
1283 else
1284 {
1285 /* A small num. */
1286 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (cst);
1287
1288 if (sign < 0)
1289 {
1290 write_char ('n');
1291 low = -low;
1292 }
1293 write_unsigned_number (low);
1294 }
1295 }
1296
1297 /* Write out a floating-point literal.
1298
1299 "Floating-point literals are encoded using the bit pattern of the
1300 target processor's internal representation of that number, as a
1301 fixed-length lowercase hexadecimal string, high-order bytes first
1302 (even if the target processor would store low-order bytes first).
1303 The "n" prefix is not used for floating-point literals; the sign
1304 bit is encoded with the rest of the number.
1305
1306 Here are some examples, assuming the IEEE standard representation
1307 for floating point numbers. (Spaces are for readability, not
1308 part of the encoding.)
1309
1310 1.0f Lf 3f80 0000 E
1311 -1.0f Lf bf80 0000 E
1312 1.17549435e-38f Lf 0080 0000 E
1313 1.40129846e-45f Lf 0000 0001 E
1314 0.0f Lf 0000 0000 E"
1315
1316 Caller is responsible for the Lx and the E. */
1317 static void
write_real_cst(const tree value)1318 write_real_cst (const tree value)
1319 {
1320 if (abi_version_at_least (2))
1321 {
1322 long target_real[4]; /* largest supported float */
1323 char buffer[9]; /* eight hex digits in a 32-bit number */
1324 int i, limit, dir;
1325
1326 tree type = TREE_TYPE (value);
1327 int words = GET_MODE_BITSIZE (TYPE_MODE (type)) / 32;
1328
1329 real_to_target (target_real, &TREE_REAL_CST (value),
1330 TYPE_MODE (type));
1331
1332 /* The value in target_real is in the target word order,
1333 so we must write it out backward if that happens to be
1334 little-endian. write_number cannot be used, it will
1335 produce uppercase. */
1336 if (FLOAT_WORDS_BIG_ENDIAN)
1337 i = 0, limit = words, dir = 1;
1338 else
1339 i = words - 1, limit = -1, dir = -1;
1340
1341 for (; i != limit; i += dir)
1342 {
1343 sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
1344 write_chars (buffer, 8);
1345 }
1346 }
1347 else
1348 {
1349 /* In G++ 3.3 and before the REAL_VALUE_TYPE was written out
1350 literally. Note that compatibility with 3.2 is impossible,
1351 because the old floating-point emulator used a different
1352 format for REAL_VALUE_TYPE. */
1353 size_t i;
1354 for (i = 0; i < sizeof (TREE_REAL_CST (value)); ++i)
1355 write_number (((unsigned char *) &TREE_REAL_CST (value))[i],
1356 /*unsigned_p*/ 1,
1357 /*base*/ 16);
1358 G.need_abi_warning = 1;
1359 }
1360 }
1361
1362 /* Non-terminal <identifier>.
1363
1364 <identifier> ::= </unqualified source code identifier> */
1365
1366 static void
write_identifier(const char * identifier)1367 write_identifier (const char *identifier)
1368 {
1369 MANGLE_TRACE ("identifier", identifier);
1370 write_string (identifier);
1371 }
1372
1373 /* Handle constructor productions of non-terminal <special-name>.
1374 CTOR is a constructor FUNCTION_DECL.
1375
1376 <special-name> ::= C1 # complete object constructor
1377 ::= C2 # base object constructor
1378 ::= C3 # complete object allocating constructor
1379
1380 Currently, allocating constructors are never used.
1381
1382 We also need to provide mangled names for the maybe-in-charge
1383 constructor, so we treat it here too. mangle_decl_string will
1384 append *INTERNAL* to that, to make sure we never emit it. */
1385
1386 static void
write_special_name_constructor(const tree ctor)1387 write_special_name_constructor (const tree ctor)
1388 {
1389 if (DECL_BASE_CONSTRUCTOR_P (ctor))
1390 write_string ("C2");
1391 else
1392 {
1393 gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)
1394 /* Even though we don't ever emit a definition of
1395 the old-style destructor, we still have to
1396 consider entities (like static variables) nested
1397 inside it. */
1398 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor));
1399 write_string ("C1");
1400 }
1401 }
1402
1403 /* Handle destructor productions of non-terminal <special-name>.
1404 DTOR is a destructor FUNCTION_DECL.
1405
1406 <special-name> ::= D0 # deleting (in-charge) destructor
1407 ::= D1 # complete object (in-charge) destructor
1408 ::= D2 # base object (not-in-charge) destructor
1409
1410 We also need to provide mangled names for the maybe-incharge
1411 destructor, so we treat it here too. mangle_decl_string will
1412 append *INTERNAL* to that, to make sure we never emit it. */
1413
1414 static void
write_special_name_destructor(const tree dtor)1415 write_special_name_destructor (const tree dtor)
1416 {
1417 if (DECL_DELETING_DESTRUCTOR_P (dtor))
1418 write_string ("D0");
1419 else if (DECL_BASE_DESTRUCTOR_P (dtor))
1420 write_string ("D2");
1421 else
1422 {
1423 gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)
1424 /* Even though we don't ever emit a definition of
1425 the old-style destructor, we still have to
1426 consider entities (like static variables) nested
1427 inside it. */
1428 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor));
1429 write_string ("D1");
1430 }
1431 }
1432
1433 /* Return the discriminator for ENTITY appearing inside
1434 FUNCTION. The discriminator is the lexical ordinal of VAR among
1435 entities with the same name in the same FUNCTION. */
1436
1437 static int
discriminator_for_local_entity(tree entity)1438 discriminator_for_local_entity (tree entity)
1439 {
1440 /* Assume this is the only local entity with this name. */
1441 int discriminator = 0;
1442
1443 if (DECL_DISCRIMINATOR_P (entity) && DECL_LANG_SPECIFIC (entity))
1444 discriminator = DECL_DISCRIMINATOR (entity);
1445 else if (TREE_CODE (entity) == TYPE_DECL)
1446 {
1447 int ix;
1448
1449 /* Scan the list of local classes. */
1450 entity = TREE_TYPE (entity);
1451 for (ix = 0; ; ix++)
1452 {
1453 tree type = VEC_index (tree, local_classes, ix);
1454 if (type == entity)
1455 break;
1456 if (TYPE_IDENTIFIER (type) == TYPE_IDENTIFIER (entity)
1457 && TYPE_CONTEXT (type) == TYPE_CONTEXT (entity))
1458 ++discriminator;
1459 }
1460 }
1461
1462 return discriminator;
1463 }
1464
1465 /* Return the discriminator for STRING, a string literal used inside
1466 FUNCTION. The discriminator is the lexical ordinal of STRING among
1467 string literals used in FUNCTION. */
1468
1469 static int
discriminator_for_string_literal(tree function ATTRIBUTE_UNUSED,tree string ATTRIBUTE_UNUSED)1470 discriminator_for_string_literal (tree function ATTRIBUTE_UNUSED,
1471 tree string ATTRIBUTE_UNUSED)
1472 {
1473 /* For now, we don't discriminate amongst string literals. */
1474 return 0;
1475 }
1476
1477 /* <discriminator> := _ <number>
1478
1479 The discriminator is used only for the second and later occurrences
1480 of the same name within a single function. In this case <number> is
1481 n - 2, if this is the nth occurrence, in lexical order. */
1482
1483 static void
write_discriminator(const int discriminator)1484 write_discriminator (const int discriminator)
1485 {
1486 /* If discriminator is zero, don't write anything. Otherwise... */
1487 if (discriminator > 0)
1488 {
1489 write_char ('_');
1490 write_unsigned_number (discriminator - 1);
1491 }
1492 }
1493
1494 /* Mangle the name of a function-scope entity. FUNCTION is the
1495 FUNCTION_DECL for the enclosing function. ENTITY is the decl for
1496 the entity itself. LOCAL_ENTITY is the entity that's directly
1497 scoped in FUNCTION_DECL, either ENTITY itself or an enclosing scope
1498 of ENTITY.
1499
1500 <local-name> := Z <function encoding> E <entity name> [<discriminator>]
1501 := Z <function encoding> E s [<discriminator>] */
1502
1503 static void
write_local_name(const tree function,const tree local_entity,const tree entity)1504 write_local_name (const tree function, const tree local_entity,
1505 const tree entity)
1506 {
1507 MANGLE_TRACE_TREE ("local-name", entity);
1508
1509 write_char ('Z');
1510 write_encoding (function);
1511 write_char ('E');
1512 if (TREE_CODE (entity) == STRING_CST)
1513 {
1514 write_char ('s');
1515 write_discriminator (discriminator_for_string_literal (function,
1516 entity));
1517 }
1518 else
1519 {
1520 /* Now the <entity name>. Let write_name know its being called
1521 from <local-name>, so it doesn't try to process the enclosing
1522 function scope again. */
1523 write_name (entity, /*ignore_local_scope=*/1);
1524 write_discriminator (discriminator_for_local_entity (local_entity));
1525 }
1526 }
1527
1528 /* Non-terminals <type> and <CV-qualifier>.
1529
1530 <type> ::= <builtin-type>
1531 ::= <function-type>
1532 ::= <class-enum-type>
1533 ::= <array-type>
1534 ::= <pointer-to-member-type>
1535 ::= <template-param>
1536 ::= <substitution>
1537 ::= <CV-qualifier>
1538 ::= P <type> # pointer-to
1539 ::= R <type> # reference-to
1540 ::= C <type> # complex pair (C 2000)
1541 ::= G <type> # imaginary (C 2000) [not supported]
1542 ::= U <source-name> <type> # vendor extended type qualifier
1543
1544 TYPE is a type node. */
1545
1546 static void
write_type(tree type)1547 write_type (tree type)
1548 {
1549 /* This gets set to nonzero if TYPE turns out to be a (possibly
1550 CV-qualified) builtin type. */
1551 int is_builtin_type = 0;
1552
1553 MANGLE_TRACE_TREE ("type", type);
1554
1555 if (type == error_mark_node)
1556 return;
1557
1558 if (find_substitution (type))
1559 return;
1560
1561 if (write_CV_qualifiers_for_type (type) > 0)
1562 /* If TYPE was CV-qualified, we just wrote the qualifiers; now
1563 mangle the unqualified type. The recursive call is needed here
1564 since both the qualified and unqualified types are substitution
1565 candidates. */
1566 write_type (TYPE_MAIN_VARIANT (type));
1567 else if (TREE_CODE (type) == ARRAY_TYPE)
1568 /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
1569 so that the cv-qualification of the element type is available
1570 in write_array_type. */
1571 write_array_type (type);
1572 else
1573 {
1574 /* See through any typedefs. */
1575 type = TYPE_MAIN_VARIANT (type);
1576
1577 if (TYPE_PTRMEM_P (type))
1578 write_pointer_to_member_type (type);
1579 else switch (TREE_CODE (type))
1580 {
1581 case VOID_TYPE:
1582 case BOOLEAN_TYPE:
1583 case INTEGER_TYPE: /* Includes wchar_t. */
1584 case REAL_TYPE:
1585 {
1586 /* Handle any target-specific fundamental types. */
1587 const char *target_mangling
1588 = targetm.mangle_fundamental_type (type);
1589
1590 if (target_mangling)
1591 {
1592 write_string (target_mangling);
1593 return;
1594 }
1595
1596 /* If this is a typedef, TYPE may not be one of
1597 the standard builtin type nodes, but an alias of one. Use
1598 TYPE_MAIN_VARIANT to get to the underlying builtin type. */
1599 write_builtin_type (TYPE_MAIN_VARIANT (type));
1600 ++is_builtin_type;
1601 break;
1602 }
1603
1604 case COMPLEX_TYPE:
1605 write_char ('C');
1606 write_type (TREE_TYPE (type));
1607 break;
1608
1609 case FUNCTION_TYPE:
1610 case METHOD_TYPE:
1611 write_function_type (type);
1612 break;
1613
1614 case UNION_TYPE:
1615 case RECORD_TYPE:
1616 case ENUMERAL_TYPE:
1617 /* A pointer-to-member function is represented as a special
1618 RECORD_TYPE, so check for this first. */
1619 if (TYPE_PTRMEMFUNC_P (type))
1620 write_pointer_to_member_type (type);
1621 else
1622 write_class_enum_type (type);
1623 break;
1624
1625 case TYPENAME_TYPE:
1626 case UNBOUND_CLASS_TEMPLATE:
1627 /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
1628 ordinary nested names. */
1629 write_nested_name (TYPE_STUB_DECL (type));
1630 break;
1631
1632 case POINTER_TYPE:
1633 write_char ('P');
1634 write_type (TREE_TYPE (type));
1635 break;
1636
1637 /* APPLE LOCAL begin blocks 6040305 */
1638 case BLOCK_POINTER_TYPE:
1639 write_string ("U13block_pointer");
1640 write_type (TREE_TYPE (type));
1641 break;
1642 /* APPLE LOCAL end blocks 6040305 */
1643
1644 case REFERENCE_TYPE:
1645 write_char ('R');
1646 write_type (TREE_TYPE (type));
1647 break;
1648
1649 case TEMPLATE_TYPE_PARM:
1650 case TEMPLATE_PARM_INDEX:
1651 write_template_param (type);
1652 break;
1653
1654 case TEMPLATE_TEMPLATE_PARM:
1655 write_template_template_param (type);
1656 break;
1657
1658 case BOUND_TEMPLATE_TEMPLATE_PARM:
1659 write_template_template_param (type);
1660 write_template_args
1661 (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
1662 break;
1663
1664 case VECTOR_TYPE:
1665 write_string ("U8__vector");
1666 write_type (TREE_TYPE (type));
1667 break;
1668
1669 default:
1670 gcc_unreachable ();
1671 }
1672 }
1673
1674 /* Types other than builtin types are substitution candidates. */
1675 if (!is_builtin_type)
1676 add_substitution (type);
1677 }
1678
1679 /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
1680 CV-qualifiers written for TYPE.
1681
1682 <CV-qualifiers> ::= [r] [V] [K] */
1683
1684 static int
write_CV_qualifiers_for_type(const tree type)1685 write_CV_qualifiers_for_type (const tree type)
1686 {
1687 int num_qualifiers = 0;
1688
1689 /* The order is specified by:
1690
1691 "In cases where multiple order-insensitive qualifiers are
1692 present, they should be ordered 'K' (closest to the base type),
1693 'V', 'r', and 'U' (farthest from the base type) ..."
1694
1695 Note that we do not use cp_type_quals below; given "const
1696 int[3]", the "const" is emitted with the "int", not with the
1697 array. */
1698
1699 if (TYPE_QUALS (type) & TYPE_QUAL_RESTRICT)
1700 {
1701 write_char ('r');
1702 ++num_qualifiers;
1703 }
1704 if (TYPE_QUALS (type) & TYPE_QUAL_VOLATILE)
1705 {
1706 write_char ('V');
1707 ++num_qualifiers;
1708 }
1709 if (TYPE_QUALS (type) & TYPE_QUAL_CONST)
1710 {
1711 write_char ('K');
1712 ++num_qualifiers;
1713 }
1714
1715 return num_qualifiers;
1716 }
1717
1718 /* Non-terminal <builtin-type>.
1719
1720 <builtin-type> ::= v # void
1721 ::= b # bool
1722 ::= w # wchar_t
1723 ::= c # char
1724 ::= a # signed char
1725 ::= h # unsigned char
1726 ::= s # short
1727 ::= t # unsigned short
1728 ::= i # int
1729 ::= j # unsigned int
1730 ::= l # long
1731 ::= m # unsigned long
1732 ::= x # long long, __int64
1733 ::= y # unsigned long long, __int64
1734 ::= n # __int128
1735 ::= o # unsigned __int128
1736 ::= f # float
1737 ::= d # double
1738 ::= e # long double, __float80
1739 ::= g # __float128 [not supported]
1740 ::= u <source-name> # vendor extended type */
1741
1742 static void
write_builtin_type(tree type)1743 write_builtin_type (tree type)
1744 {
1745 switch (TREE_CODE (type))
1746 {
1747 case VOID_TYPE:
1748 write_char ('v');
1749 break;
1750
1751 case BOOLEAN_TYPE:
1752 write_char ('b');
1753 break;
1754
1755 case INTEGER_TYPE:
1756 /* If this is size_t, get the underlying int type. */
1757 if (TYPE_IS_SIZETYPE (type))
1758 type = TYPE_DOMAIN (type);
1759
1760 /* TYPE may still be wchar_t, since that isn't in
1761 integer_type_nodes. */
1762 if (type == wchar_type_node)
1763 write_char ('w');
1764 else if (TYPE_FOR_JAVA (type))
1765 write_java_integer_type_codes (type);
1766 else
1767 {
1768 size_t itk;
1769 /* Assume TYPE is one of the shared integer type nodes. Find
1770 it in the array of these nodes. */
1771 iagain:
1772 for (itk = 0; itk < itk_none; ++itk)
1773 if (type == integer_types[itk])
1774 {
1775 /* Print the corresponding single-letter code. */
1776 write_char (integer_type_codes[itk]);
1777 break;
1778 }
1779
1780 if (itk == itk_none)
1781 {
1782 tree t = c_common_type_for_mode (TYPE_MODE (type),
1783 TYPE_UNSIGNED (type));
1784 if (type != t)
1785 {
1786 type = t;
1787 goto iagain;
1788 }
1789
1790 if (TYPE_PRECISION (type) == 128)
1791 write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
1792 else
1793 {
1794 /* Allow for cases where TYPE is not one of the shared
1795 integer type nodes and write a "vendor extended builtin
1796 type" with a name the form intN or uintN, respectively.
1797 Situations like this can happen if you have an
1798 __attribute__((__mode__(__SI__))) type and use exotic
1799 switches like '-mint8' on AVR. Of course, this is
1800 undefined by the C++ ABI (and '-mint8' is not even
1801 Standard C conforming), but when using such special
1802 options you're pretty much in nowhere land anyway. */
1803 const char *prefix;
1804 char prec[11]; /* up to ten digits for an unsigned */
1805
1806 prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
1807 sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
1808 write_char ('u'); /* "vendor extended builtin type" */
1809 write_unsigned_number (strlen (prefix) + strlen (prec));
1810 write_string (prefix);
1811 write_string (prec);
1812 }
1813 }
1814 }
1815 break;
1816
1817 case REAL_TYPE:
1818 if (type == float_type_node
1819 || type == java_float_type_node)
1820 write_char ('f');
1821 else if (type == double_type_node
1822 || type == java_double_type_node)
1823 write_char ('d');
1824 else if (type == long_double_type_node)
1825 write_char ('e');
1826 else
1827 gcc_unreachable ();
1828 break;
1829
1830 default:
1831 gcc_unreachable ();
1832 }
1833 }
1834
1835 /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
1836 METHOD_TYPE. The return type is mangled before the parameter
1837 types.
1838
1839 <function-type> ::= F [Y] <bare-function-type> E */
1840
1841 static void
write_function_type(const tree type)1842 write_function_type (const tree type)
1843 {
1844 MANGLE_TRACE_TREE ("function-type", type);
1845
1846 /* For a pointer to member function, the function type may have
1847 cv-qualifiers, indicating the quals for the artificial 'this'
1848 parameter. */
1849 if (TREE_CODE (type) == METHOD_TYPE)
1850 {
1851 /* The first parameter must be a POINTER_TYPE pointing to the
1852 `this' parameter. */
1853 tree this_type = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
1854 write_CV_qualifiers_for_type (this_type);
1855 }
1856
1857 write_char ('F');
1858 /* We don't track whether or not a type is `extern "C"'. Note that
1859 you can have an `extern "C"' function that does not have
1860 `extern "C"' type, and vice versa:
1861
1862 extern "C" typedef void function_t();
1863 function_t f; // f has C++ linkage, but its type is
1864 // `extern "C"'
1865
1866 typedef void function_t();
1867 extern "C" function_t f; // Vice versa.
1868
1869 See [dcl.link]. */
1870 write_bare_function_type (type, /*include_return_type_p=*/1,
1871 /*decl=*/NULL);
1872 write_char ('E');
1873 }
1874
1875 /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
1876 METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
1877 is mangled before the parameter types. If non-NULL, DECL is
1878 FUNCTION_DECL for the function whose type is being emitted.
1879
1880 If DECL is a member of a Java type, then a literal 'J'
1881 is output and the return type is mangled as if INCLUDE_RETURN_TYPE
1882 were nonzero.
1883
1884 <bare-function-type> ::= [J]</signature/ type>+ */
1885
1886 static void
write_bare_function_type(const tree type,const int include_return_type_p,const tree decl)1887 write_bare_function_type (const tree type, const int include_return_type_p,
1888 const tree decl)
1889 {
1890 int java_method_p;
1891
1892 MANGLE_TRACE_TREE ("bare-function-type", type);
1893
1894 /* Detect Java methods and emit special encoding. */
1895 if (decl != NULL
1896 && DECL_FUNCTION_MEMBER_P (decl)
1897 && TYPE_FOR_JAVA (DECL_CONTEXT (decl))
1898 && !DECL_CONSTRUCTOR_P (decl)
1899 && !DECL_DESTRUCTOR_P (decl)
1900 && !DECL_CONV_FN_P (decl))
1901 {
1902 java_method_p = 1;
1903 write_char ('J');
1904 }
1905 else
1906 {
1907 java_method_p = 0;
1908 }
1909
1910 /* Mangle the return type, if requested. */
1911 if (include_return_type_p || java_method_p)
1912 write_type (TREE_TYPE (type));
1913
1914 /* Now mangle the types of the arguments. */
1915 write_method_parms (TYPE_ARG_TYPES (type),
1916 TREE_CODE (type) == METHOD_TYPE,
1917 decl);
1918 }
1919
1920 /* Write the mangled representation of a method parameter list of
1921 types given in PARM_TYPES. If METHOD_P is nonzero, the function is
1922 considered a non-static method, and the this parameter is omitted.
1923 If non-NULL, DECL is the FUNCTION_DECL for the function whose
1924 parameters are being emitted. */
1925
1926 static void
write_method_parms(tree parm_types,const int method_p,const tree decl)1927 write_method_parms (tree parm_types, const int method_p, const tree decl)
1928 {
1929 tree first_parm_type;
1930 tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
1931
1932 /* Assume this parameter type list is variable-length. If it ends
1933 with a void type, then it's not. */
1934 int varargs_p = 1;
1935
1936 /* If this is a member function, skip the first arg, which is the
1937 this pointer.
1938 "Member functions do not encode the type of their implicit this
1939 parameter."
1940
1941 Similarly, there's no need to mangle artificial parameters, like
1942 the VTT parameters for constructors and destructors. */
1943 if (method_p)
1944 {
1945 parm_types = TREE_CHAIN (parm_types);
1946 parm_decl = parm_decl ? TREE_CHAIN (parm_decl) : NULL_TREE;
1947
1948 while (parm_decl && DECL_ARTIFICIAL (parm_decl))
1949 {
1950 parm_types = TREE_CHAIN (parm_types);
1951 parm_decl = TREE_CHAIN (parm_decl);
1952 }
1953 }
1954
1955 for (first_parm_type = parm_types;
1956 parm_types;
1957 parm_types = TREE_CHAIN (parm_types))
1958 {
1959 tree parm = TREE_VALUE (parm_types);
1960 if (parm == void_type_node)
1961 {
1962 /* "Empty parameter lists, whether declared as () or
1963 conventionally as (void), are encoded with a void parameter
1964 (v)." */
1965 if (parm_types == first_parm_type)
1966 write_type (parm);
1967 /* If the parm list is terminated with a void type, it's
1968 fixed-length. */
1969 varargs_p = 0;
1970 /* A void type better be the last one. */
1971 gcc_assert (TREE_CHAIN (parm_types) == NULL);
1972 }
1973 else
1974 write_type (parm);
1975 }
1976
1977 if (varargs_p)
1978 /* <builtin-type> ::= z # ellipsis */
1979 write_char ('z');
1980 }
1981
1982 /* <class-enum-type> ::= <name> */
1983
1984 static void
write_class_enum_type(const tree type)1985 write_class_enum_type (const tree type)
1986 {
1987 write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
1988 }
1989
1990 /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
1991 arguments.
1992
1993 <template-args> ::= I <template-arg>+ E */
1994
1995 static void
write_template_args(tree args)1996 write_template_args (tree args)
1997 {
1998 int i;
1999 int length = TREE_VEC_LENGTH (args);
2000
2001 MANGLE_TRACE_TREE ("template-args", args);
2002
2003 write_char ('I');
2004
2005 gcc_assert (length > 0);
2006
2007 if (TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
2008 {
2009 /* We have nested template args. We want the innermost template
2010 argument list. */
2011 args = TREE_VEC_ELT (args, length - 1);
2012 length = TREE_VEC_LENGTH (args);
2013 }
2014 for (i = 0; i < length; ++i)
2015 write_template_arg (TREE_VEC_ELT (args, i));
2016
2017 write_char ('E');
2018 }
2019
2020 /* <expression> ::= <unary operator-name> <expression>
2021 ::= <binary operator-name> <expression> <expression>
2022 ::= <expr-primary>
2023
2024 <expr-primary> ::= <template-param>
2025 ::= L <type> <value number> E # literal
2026 ::= L <mangled-name> E # external name
2027 ::= sr <type> <unqualified-name>
2028 ::= sr <type> <unqualified-name> <template-args> */
2029
2030 static void
write_expression(tree expr)2031 write_expression (tree expr)
2032 {
2033 enum tree_code code;
2034
2035 code = TREE_CODE (expr);
2036
2037 /* Skip NOP_EXPRs. They can occur when (say) a pointer argument
2038 is converted (via qualification conversions) to another
2039 type. */
2040 while (TREE_CODE (expr) == NOP_EXPR
2041 || TREE_CODE (expr) == NON_LVALUE_EXPR)
2042 {
2043 expr = TREE_OPERAND (expr, 0);
2044 code = TREE_CODE (expr);
2045 }
2046
2047 if (code == BASELINK)
2048 {
2049 expr = BASELINK_FUNCTIONS (expr);
2050 code = TREE_CODE (expr);
2051 }
2052
2053 /* Handle pointers-to-members by making them look like expression
2054 nodes. */
2055 if (code == PTRMEM_CST)
2056 {
2057 expr = build_nt (ADDR_EXPR,
2058 build_qualified_name (/*type=*/NULL_TREE,
2059 PTRMEM_CST_CLASS (expr),
2060 PTRMEM_CST_MEMBER (expr),
2061 /*template_p=*/false));
2062 code = TREE_CODE (expr);
2063 }
2064
2065 /* Handle template parameters. */
2066 if (code == TEMPLATE_TYPE_PARM
2067 || code == TEMPLATE_TEMPLATE_PARM
2068 || code == BOUND_TEMPLATE_TEMPLATE_PARM
2069 || code == TEMPLATE_PARM_INDEX)
2070 write_template_param (expr);
2071 /* Handle literals. */
2072 else if (TREE_CODE_CLASS (code) == tcc_constant
2073 || (abi_version_at_least (2) && code == CONST_DECL))
2074 write_template_arg_literal (expr);
2075 else if (DECL_P (expr))
2076 {
2077 /* G++ 3.2 incorrectly mangled non-type template arguments of
2078 enumeration type using their names. */
2079 if (code == CONST_DECL)
2080 G.need_abi_warning = 1;
2081 write_char ('L');
2082 write_mangled_name (expr, false);
2083 write_char ('E');
2084 }
2085 else if (TREE_CODE (expr) == SIZEOF_EXPR
2086 && TYPE_P (TREE_OPERAND (expr, 0)))
2087 {
2088 write_string ("st");
2089 write_type (TREE_OPERAND (expr, 0));
2090 }
2091 else if (abi_version_at_least (2) && TREE_CODE (expr) == SCOPE_REF)
2092 {
2093 tree scope = TREE_OPERAND (expr, 0);
2094 tree member = TREE_OPERAND (expr, 1);
2095
2096 /* If the MEMBER is a real declaration, then the qualifying
2097 scope was not dependent. Ideally, we would not have a
2098 SCOPE_REF in those cases, but sometimes we do. If the second
2099 argument is a DECL, then the name must not have been
2100 dependent. */
2101 if (DECL_P (member))
2102 write_expression (member);
2103 else
2104 {
2105 tree template_args;
2106
2107 write_string ("sr");
2108 write_type (scope);
2109 /* If MEMBER is a template-id, separate the template
2110 from the arguments. */
2111 if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
2112 {
2113 template_args = TREE_OPERAND (member, 1);
2114 member = TREE_OPERAND (member, 0);
2115 }
2116 else
2117 template_args = NULL_TREE;
2118 /* Write out the name of the MEMBER. */
2119 if (IDENTIFIER_TYPENAME_P (member))
2120 write_conversion_operator_name (TREE_TYPE (member));
2121 else if (IDENTIFIER_OPNAME_P (member))
2122 {
2123 int i;
2124 const char *mangled_name = NULL;
2125
2126 /* Unfortunately, there is no easy way to go from the
2127 name of the operator back to the corresponding tree
2128 code. */
2129 for (i = 0; i < LAST_CPLUS_TREE_CODE; ++i)
2130 if (operator_name_info[i].identifier == member)
2131 {
2132 /* The ABI says that we prefer binary operator
2133 names to unary operator names. */
2134 if (operator_name_info[i].arity == 2)
2135 {
2136 mangled_name = operator_name_info[i].mangled_name;
2137 break;
2138 }
2139 else if (!mangled_name)
2140 mangled_name = operator_name_info[i].mangled_name;
2141 }
2142 else if (assignment_operator_name_info[i].identifier
2143 == member)
2144 {
2145 mangled_name
2146 = assignment_operator_name_info[i].mangled_name;
2147 break;
2148 }
2149 write_string (mangled_name);
2150 }
2151 else
2152 write_source_name (member);
2153 /* Write out the template arguments. */
2154 if (template_args)
2155 write_template_args (template_args);
2156 }
2157 }
2158 else
2159 {
2160 int i;
2161
2162 /* When we bind a variable or function to a non-type template
2163 argument with reference type, we create an ADDR_EXPR to show
2164 the fact that the entity's address has been taken. But, we
2165 don't actually want to output a mangling code for the `&'. */
2166 if (TREE_CODE (expr) == ADDR_EXPR
2167 && TREE_TYPE (expr)
2168 && TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE)
2169 {
2170 expr = TREE_OPERAND (expr, 0);
2171 if (DECL_P (expr))
2172 {
2173 write_expression (expr);
2174 return;
2175 }
2176
2177 code = TREE_CODE (expr);
2178 }
2179
2180 /* If it wasn't any of those, recursively expand the expression. */
2181 write_string (operator_name_info[(int) code].mangled_name);
2182
2183 switch (code)
2184 {
2185 case CALL_EXPR:
2186 sorry ("call_expr cannot be mangled due to a defect in the C++ ABI");
2187 break;
2188
2189 case CAST_EXPR:
2190 write_type (TREE_TYPE (expr));
2191 /* There is no way to mangle a zero-operand cast like
2192 "T()". */
2193 if (!TREE_OPERAND (expr, 0))
2194 sorry ("zero-operand casts cannot be mangled due to a defect "
2195 "in the C++ ABI");
2196 else
2197 write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
2198 break;
2199
2200 case STATIC_CAST_EXPR:
2201 case CONST_CAST_EXPR:
2202 write_type (TREE_TYPE (expr));
2203 write_expression (TREE_OPERAND (expr, 0));
2204 break;
2205
2206
2207 /* Handle pointers-to-members specially. */
2208 case SCOPE_REF:
2209 write_type (TREE_OPERAND (expr, 0));
2210 if (TREE_CODE (TREE_OPERAND (expr, 1)) == IDENTIFIER_NODE)
2211 write_source_name (TREE_OPERAND (expr, 1));
2212 else if (TREE_CODE (TREE_OPERAND (expr, 1)) == TEMPLATE_ID_EXPR)
2213 {
2214 tree template_id;
2215 tree name;
2216
2217 template_id = TREE_OPERAND (expr, 1);
2218 name = TREE_OPERAND (template_id, 0);
2219 /* FIXME: What about operators? */
2220 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
2221 write_source_name (TREE_OPERAND (template_id, 0));
2222 write_template_args (TREE_OPERAND (template_id, 1));
2223 }
2224 else
2225 {
2226 /* G++ 3.2 incorrectly put out both the "sr" code and
2227 the nested name of the qualified name. */
2228 G.need_abi_warning = 1;
2229 write_encoding (TREE_OPERAND (expr, 1));
2230 }
2231 break;
2232
2233 default:
2234 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
2235 {
2236 tree operand = TREE_OPERAND (expr, i);
2237 /* As a GNU extension, the middle operand of a
2238 conditional may be omitted. Since expression
2239 manglings are supposed to represent the input token
2240 stream, there's no good way to mangle such an
2241 expression without extending the C++ ABI. */
2242 if (code == COND_EXPR && i == 1 && !operand)
2243 {
2244 error ("omitted middle operand to %<?:%> operand "
2245 "cannot be mangled");
2246 continue;
2247 }
2248 write_expression (operand);
2249 }
2250 }
2251 }
2252 }
2253
2254 /* Literal subcase of non-terminal <template-arg>.
2255
2256 "Literal arguments, e.g. "A<42L>", are encoded with their type
2257 and value. Negative integer values are preceded with "n"; for
2258 example, "A<-42L>" becomes "1AILln42EE". The bool value false is
2259 encoded as 0, true as 1." */
2260
2261 static void
write_template_arg_literal(const tree value)2262 write_template_arg_literal (const tree value)
2263 {
2264 write_char ('L');
2265 write_type (TREE_TYPE (value));
2266
2267 switch (TREE_CODE (value))
2268 {
2269 case CONST_DECL:
2270 write_integer_cst (DECL_INITIAL (value));
2271 break;
2272
2273 case INTEGER_CST:
2274 gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
2275 || integer_zerop (value) || integer_onep (value));
2276 write_integer_cst (value);
2277 break;
2278
2279 case REAL_CST:
2280 write_real_cst (value);
2281 break;
2282
2283 default:
2284 gcc_unreachable ();
2285 }
2286
2287 write_char ('E');
2288 }
2289
2290 /* Non-terminal <template-arg>.
2291
2292 <template-arg> ::= <type> # type
2293 ::= L <type> </value/ number> E # literal
2294 ::= LZ <name> E # external name
2295 ::= X <expression> E # expression */
2296
2297 static void
write_template_arg(tree node)2298 write_template_arg (tree node)
2299 {
2300 enum tree_code code = TREE_CODE (node);
2301
2302 MANGLE_TRACE_TREE ("template-arg", node);
2303
2304 /* A template template parameter's argument list contains TREE_LIST
2305 nodes of which the value field is the actual argument. */
2306 if (code == TREE_LIST)
2307 {
2308 node = TREE_VALUE (node);
2309 /* If it's a decl, deal with its type instead. */
2310 if (DECL_P (node))
2311 {
2312 node = TREE_TYPE (node);
2313 code = TREE_CODE (node);
2314 }
2315 }
2316
2317 if (TREE_CODE (node) == NOP_EXPR
2318 && TREE_CODE (TREE_TYPE (node)) == REFERENCE_TYPE)
2319 {
2320 /* Template parameters can be of reference type. To maintain
2321 internal consistency, such arguments use a conversion from
2322 address of object to reference type. */
2323 gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
2324 if (abi_version_at_least (2))
2325 node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
2326 else
2327 G.need_abi_warning = 1;
2328 }
2329
2330 if (TYPE_P (node))
2331 write_type (node);
2332 else if (code == TEMPLATE_DECL)
2333 /* A template appearing as a template arg is a template template arg. */
2334 write_template_template_arg (node);
2335 else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
2336 || (abi_version_at_least (2) && code == CONST_DECL))
2337 write_template_arg_literal (node);
2338 else if (DECL_P (node))
2339 {
2340 /* Until ABI version 2, non-type template arguments of
2341 enumeration type were mangled using their names. */
2342 if (code == CONST_DECL && !abi_version_at_least (2))
2343 G.need_abi_warning = 1;
2344 write_char ('L');
2345 /* Until ABI version 3, the underscore before the mangled name
2346 was incorrectly omitted. */
2347 if (!abi_version_at_least (3))
2348 {
2349 G.need_abi_warning = 1;
2350 write_char ('Z');
2351 }
2352 else
2353 write_string ("_Z");
2354 write_encoding (node);
2355 write_char ('E');
2356 }
2357 else
2358 {
2359 /* Template arguments may be expressions. */
2360 write_char ('X');
2361 write_expression (node);
2362 write_char ('E');
2363 }
2364 }
2365
2366 /* <template-template-arg>
2367 ::= <name>
2368 ::= <substitution> */
2369
2370 static void
write_template_template_arg(const tree decl)2371 write_template_template_arg (const tree decl)
2372 {
2373 MANGLE_TRACE_TREE ("template-template-arg", decl);
2374
2375 if (find_substitution (decl))
2376 return;
2377 write_name (decl, /*ignore_local_scope=*/0);
2378 add_substitution (decl);
2379 }
2380
2381
2382 /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
2383
2384 <array-type> ::= A [</dimension/ number>] _ </element/ type>
2385 ::= A <expression> _ </element/ type>
2386
2387 "Array types encode the dimension (number of elements) and the
2388 element type. For variable length arrays, the dimension (but not
2389 the '_' separator) is omitted." */
2390
2391 static void
write_array_type(const tree type)2392 write_array_type (const tree type)
2393 {
2394 write_char ('A');
2395 if (TYPE_DOMAIN (type))
2396 {
2397 tree index_type;
2398 tree max;
2399
2400 index_type = TYPE_DOMAIN (type);
2401 /* The INDEX_TYPE gives the upper and lower bounds of the
2402 array. */
2403 max = TYPE_MAX_VALUE (index_type);
2404 if (TREE_CODE (max) == INTEGER_CST)
2405 {
2406 /* The ABI specifies that we should mangle the number of
2407 elements in the array, not the largest allowed index. */
2408 max = size_binop (PLUS_EXPR, max, size_one_node);
2409 write_unsigned_number (tree_low_cst (max, 1));
2410 }
2411 else
2412 {
2413 max = TREE_OPERAND (max, 0);
2414 if (!abi_version_at_least (2))
2415 {
2416 /* value_dependent_expression_p presumes nothing is
2417 dependent when PROCESSING_TEMPLATE_DECL is zero. */
2418 ++processing_template_decl;
2419 if (!value_dependent_expression_p (max))
2420 G.need_abi_warning = 1;
2421 --processing_template_decl;
2422 }
2423 write_expression (max);
2424 }
2425
2426 }
2427 write_char ('_');
2428 write_type (TREE_TYPE (type));
2429 }
2430
2431 /* Non-terminal <pointer-to-member-type> for pointer-to-member
2432 variables. TYPE is a pointer-to-member POINTER_TYPE.
2433
2434 <pointer-to-member-type> ::= M </class/ type> </member/ type> */
2435
2436 static void
write_pointer_to_member_type(const tree type)2437 write_pointer_to_member_type (const tree type)
2438 {
2439 write_char ('M');
2440 write_type (TYPE_PTRMEM_CLASS_TYPE (type));
2441 write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
2442 }
2443
2444 /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
2445 TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
2446 TEMPLATE_PARM_INDEX.
2447
2448 <template-param> ::= T </parameter/ number> _ */
2449
2450 static void
write_template_param(const tree parm)2451 write_template_param (const tree parm)
2452 {
2453 int parm_index;
2454 int parm_level;
2455 tree parm_type = NULL_TREE;
2456
2457 MANGLE_TRACE_TREE ("template-parm", parm);
2458
2459 switch (TREE_CODE (parm))
2460 {
2461 case TEMPLATE_TYPE_PARM:
2462 case TEMPLATE_TEMPLATE_PARM:
2463 case BOUND_TEMPLATE_TEMPLATE_PARM:
2464 parm_index = TEMPLATE_TYPE_IDX (parm);
2465 parm_level = TEMPLATE_TYPE_LEVEL (parm);
2466 break;
2467
2468 case TEMPLATE_PARM_INDEX:
2469 parm_index = TEMPLATE_PARM_IDX (parm);
2470 parm_level = TEMPLATE_PARM_LEVEL (parm);
2471 parm_type = TREE_TYPE (TEMPLATE_PARM_DECL (parm));
2472 break;
2473
2474 default:
2475 gcc_unreachable ();
2476 }
2477
2478 write_char ('T');
2479 /* NUMBER as it appears in the mangling is (-1)-indexed, with the
2480 earliest template param denoted by `_'. */
2481 if (parm_index > 0)
2482 write_unsigned_number (parm_index - 1);
2483 write_char ('_');
2484 }
2485
2486 /* <template-template-param>
2487 ::= <template-param>
2488 ::= <substitution> */
2489
2490 static void
write_template_template_param(const tree parm)2491 write_template_template_param (const tree parm)
2492 {
2493 tree template = NULL_TREE;
2494
2495 /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
2496 template template parameter. The substitution candidate here is
2497 only the template. */
2498 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
2499 {
2500 template
2501 = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
2502 if (find_substitution (template))
2503 return;
2504 }
2505
2506 /* <template-param> encodes only the template parameter position,
2507 not its template arguments, which is fine here. */
2508 write_template_param (parm);
2509 if (template)
2510 add_substitution (template);
2511 }
2512
2513 /* Non-terminal <substitution>.
2514
2515 <substitution> ::= S <seq-id> _
2516 ::= S_ */
2517
2518 static void
write_substitution(const int seq_id)2519 write_substitution (const int seq_id)
2520 {
2521 MANGLE_TRACE ("substitution", "");
2522
2523 write_char ('S');
2524 if (seq_id > 0)
2525 write_number (seq_id - 1, /*unsigned=*/1, 36);
2526 write_char ('_');
2527 }
2528
2529 /* Start mangling ENTITY. */
2530
2531 static inline void
start_mangling(const tree entity,const bool ident_p)2532 start_mangling (const tree entity, const bool ident_p)
2533 {
2534 G.entity = entity;
2535 G.need_abi_warning = false;
2536 if (!ident_p)
2537 {
2538 obstack_free (&name_obstack, name_base);
2539 mangle_obstack = &name_obstack;
2540 name_base = obstack_alloc (&name_obstack, 0);
2541 }
2542 else
2543 mangle_obstack = &ident_hash->stack;
2544 }
2545
2546 /* Done with mangling. Return the generated mangled name. If WARN is
2547 true, and the name of G.entity will be mangled differently in a
2548 future version of the ABI, issue a warning. */
2549
2550 static inline const char *
finish_mangling(const bool warn)2551 finish_mangling (const bool warn)
2552 {
2553 if (warn_abi && warn && G.need_abi_warning)
2554 warning (OPT_Wabi, "the mangled name of %qD will change in a future "
2555 "version of GCC",
2556 G.entity);
2557
2558 /* Clear all the substitutions. */
2559 VEC_truncate (tree, G.substitutions, 0);
2560
2561 /* Null-terminate the string. */
2562 write_char ('\0');
2563
2564 return (const char *) obstack_finish (mangle_obstack);
2565 }
2566
2567 /* Initialize data structures for mangling. */
2568
2569 void
init_mangle(void)2570 init_mangle (void)
2571 {
2572 gcc_obstack_init (&name_obstack);
2573 name_base = obstack_alloc (&name_obstack, 0);
2574 G.substitutions = NULL;
2575
2576 /* Cache these identifiers for quick comparison when checking for
2577 standard substitutions. */
2578 subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
2579 subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
2580 subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
2581 subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
2582 subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
2583 subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
2584 }
2585
2586 /* Generate the mangled name of DECL. */
2587
2588 static const char *
mangle_decl_string(const tree decl)2589 mangle_decl_string (const tree decl)
2590 {
2591 const char *result;
2592
2593 start_mangling (decl, /*ident_p=*/true);
2594
2595 if (TREE_CODE (decl) == TYPE_DECL)
2596 write_type (TREE_TYPE (decl));
2597 else
2598 write_mangled_name (decl, true);
2599
2600 result = finish_mangling (/*warn=*/true);
2601 if (DEBUG_MANGLE)
2602 fprintf (stderr, "mangle_decl_string = '%s'\n\n", result);
2603 return result;
2604 }
2605
2606 /* Like get_identifier, except that NAME is assumed to have been
2607 allocated on the obstack used by the identifier hash table. */
2608
2609 static inline tree
get_identifier_nocopy(const char * name)2610 get_identifier_nocopy (const char *name)
2611 {
2612 hashnode ht_node = ht_lookup (ident_hash, (const unsigned char *) name,
2613 strlen (name), HT_ALLOCED);
2614 return HT_IDENT_TO_GCC_IDENT (ht_node);
2615 }
2616
2617 /* Create an identifier for the external mangled name of DECL. */
2618
2619 void
mangle_decl(const tree decl)2620 mangle_decl (const tree decl)
2621 {
2622 SET_DECL_ASSEMBLER_NAME (decl,
2623 get_identifier_nocopy (mangle_decl_string (decl)));
2624 }
2625
2626 /* Generate the mangled representation of TYPE. */
2627
2628 const char *
mangle_type_string(const tree type)2629 mangle_type_string (const tree type)
2630 {
2631 const char *result;
2632
2633 start_mangling (type, /*ident_p=*/false);
2634 write_type (type);
2635 result = finish_mangling (/*warn=*/false);
2636 if (DEBUG_MANGLE)
2637 fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
2638 return result;
2639 }
2640
2641 /* Create an identifier for the mangled name of a special component
2642 for belonging to TYPE. CODE is the ABI-specified code for this
2643 component. */
2644
2645 static tree
mangle_special_for_type(const tree type,const char * code)2646 mangle_special_for_type (const tree type, const char *code)
2647 {
2648 const char *result;
2649
2650 /* We don't have an actual decl here for the special component, so
2651 we can't just process the <encoded-name>. Instead, fake it. */
2652 start_mangling (type, /*ident_p=*/true);
2653
2654 /* Start the mangling. */
2655 write_string ("_Z");
2656 write_string (code);
2657
2658 /* Add the type. */
2659 write_type (type);
2660 result = finish_mangling (/*warn=*/false);
2661
2662 if (DEBUG_MANGLE)
2663 fprintf (stderr, "mangle_special_for_type = %s\n\n", result);
2664
2665 return get_identifier_nocopy (result);
2666 }
2667
2668 /* Create an identifier for the mangled representation of the typeinfo
2669 structure for TYPE. */
2670
2671 tree
mangle_typeinfo_for_type(const tree type)2672 mangle_typeinfo_for_type (const tree type)
2673 {
2674 return mangle_special_for_type (type, "TI");
2675 }
2676
2677 /* Create an identifier for the mangled name of the NTBS containing
2678 the mangled name of TYPE. */
2679
2680 tree
mangle_typeinfo_string_for_type(const tree type)2681 mangle_typeinfo_string_for_type (const tree type)
2682 {
2683 return mangle_special_for_type (type, "TS");
2684 }
2685
2686 /* Create an identifier for the mangled name of the vtable for TYPE. */
2687
2688 tree
mangle_vtbl_for_type(const tree type)2689 mangle_vtbl_for_type (const tree type)
2690 {
2691 return mangle_special_for_type (type, "TV");
2692 }
2693
2694 /* Returns an identifier for the mangled name of the VTT for TYPE. */
2695
2696 tree
mangle_vtt_for_type(const tree type)2697 mangle_vtt_for_type (const tree type)
2698 {
2699 return mangle_special_for_type (type, "TT");
2700 }
2701
2702 /* Return an identifier for a construction vtable group. TYPE is
2703 the most derived class in the hierarchy; BINFO is the base
2704 subobject for which this construction vtable group will be used.
2705
2706 This mangling isn't part of the ABI specification; in the ABI
2707 specification, the vtable group is dumped in the same COMDAT as the
2708 main vtable, and is referenced only from that vtable, so it doesn't
2709 need an external name. For binary formats without COMDAT sections,
2710 though, we need external names for the vtable groups.
2711
2712 We use the production
2713
2714 <special-name> ::= CT <type> <offset number> _ <base type> */
2715
2716 tree
mangle_ctor_vtbl_for_type(const tree type,const tree binfo)2717 mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
2718 {
2719 const char *result;
2720
2721 start_mangling (type, /*ident_p=*/true);
2722
2723 write_string ("_Z");
2724 write_string ("TC");
2725 write_type (type);
2726 write_integer_cst (BINFO_OFFSET (binfo));
2727 write_char ('_');
2728 write_type (BINFO_TYPE (binfo));
2729
2730 result = finish_mangling (/*warn=*/false);
2731 if (DEBUG_MANGLE)
2732 fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", result);
2733 return get_identifier_nocopy (result);
2734 }
2735
2736 /* Mangle a this pointer or result pointer adjustment.
2737
2738 <call-offset> ::= h <fixed offset number> _
2739 ::= v <fixed offset number> _ <virtual offset number> _ */
2740
2741 static void
mangle_call_offset(const tree fixed_offset,const tree virtual_offset)2742 mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
2743 {
2744 write_char (virtual_offset ? 'v' : 'h');
2745
2746 /* For either flavor, write the fixed offset. */
2747 write_integer_cst (fixed_offset);
2748 write_char ('_');
2749
2750 /* For a virtual thunk, add the virtual offset. */
2751 if (virtual_offset)
2752 {
2753 write_integer_cst (virtual_offset);
2754 write_char ('_');
2755 }
2756 }
2757
2758 /* Return an identifier for the mangled name of a this-adjusting or
2759 covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
2760 to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
2761 is a virtual thunk, and it is the vtbl offset in
2762 bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
2763 zero for a covariant thunk. Note, that FN_DECL might be a covariant
2764 thunk itself. A covariant thunk name always includes the adjustment
2765 for the this pointer, even if there is none.
2766
2767 <special-name> ::= T <call-offset> <base encoding>
2768 ::= Tc <this_adjust call-offset> <result_adjust call-offset>
2769 <base encoding> */
2770
2771 tree
mangle_thunk(tree fn_decl,const int this_adjusting,tree fixed_offset,tree virtual_offset)2772 mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
2773 tree virtual_offset)
2774 {
2775 const char *result;
2776
2777 start_mangling (fn_decl, /*ident_p=*/true);
2778
2779 write_string ("_Z");
2780 write_char ('T');
2781
2782 if (!this_adjusting)
2783 {
2784 /* Covariant thunk with no this adjustment */
2785 write_char ('c');
2786 mangle_call_offset (integer_zero_node, NULL_TREE);
2787 mangle_call_offset (fixed_offset, virtual_offset);
2788 }
2789 else if (!DECL_THUNK_P (fn_decl))
2790 /* Plain this adjusting thunk. */
2791 mangle_call_offset (fixed_offset, virtual_offset);
2792 else
2793 {
2794 /* This adjusting thunk to covariant thunk. */
2795 write_char ('c');
2796 mangle_call_offset (fixed_offset, virtual_offset);
2797 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
2798 virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
2799 if (virtual_offset)
2800 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
2801 mangle_call_offset (fixed_offset, virtual_offset);
2802 fn_decl = THUNK_TARGET (fn_decl);
2803 }
2804
2805 /* Scoped name. */
2806 write_encoding (fn_decl);
2807
2808 result = finish_mangling (/*warn=*/false);
2809 if (DEBUG_MANGLE)
2810 fprintf (stderr, "mangle_thunk = %s\n\n", result);
2811 return get_identifier_nocopy (result);
2812 }
2813
2814 /* This hash table maps TYPEs to the IDENTIFIER for a conversion
2815 operator to TYPE. The nodes are IDENTIFIERs whose TREE_TYPE is the
2816 TYPE. */
2817
2818 static GTY ((param_is (union tree_node))) htab_t conv_type_names;
2819
2820 /* Hash a node (VAL1) in the table. */
2821
2822 static hashval_t
hash_type(const void * val)2823 hash_type (const void *val)
2824 {
2825 return (hashval_t) TYPE_UID (TREE_TYPE ((tree) val));
2826 }
2827
2828 /* Compare VAL1 (a node in the table) with VAL2 (a TYPE). */
2829
2830 static int
compare_type(const void * val1,const void * val2)2831 compare_type (const void *val1, const void *val2)
2832 {
2833 return TREE_TYPE ((tree) val1) == (tree) val2;
2834 }
2835
2836 /* Return an identifier for the mangled unqualified name for a
2837 conversion operator to TYPE. This mangling is not specified by the
2838 ABI spec; it is only used internally. */
2839
2840 tree
mangle_conv_op_name_for_type(const tree type)2841 mangle_conv_op_name_for_type (const tree type)
2842 {
2843 void **slot;
2844 tree identifier;
2845
2846 if (type == error_mark_node)
2847 return error_mark_node;
2848
2849 if (conv_type_names == NULL)
2850 conv_type_names = htab_create_ggc (31, &hash_type, &compare_type, NULL);
2851
2852 slot = htab_find_slot_with_hash (conv_type_names, type,
2853 (hashval_t) TYPE_UID (type), INSERT);
2854 identifier = (tree)*slot;
2855 if (!identifier)
2856 {
2857 char buffer[64];
2858
2859 /* Create a unique name corresponding to TYPE. */
2860 sprintf (buffer, "operator %lu",
2861 (unsigned long) htab_elements (conv_type_names));
2862 identifier = get_identifier (buffer);
2863 *slot = identifier;
2864
2865 /* Hang TYPE off the identifier so it can be found easily later
2866 when performing conversions. */
2867 TREE_TYPE (identifier) = type;
2868
2869 /* Set bits on the identifier so we know later it's a conversion. */
2870 IDENTIFIER_OPNAME_P (identifier) = 1;
2871 IDENTIFIER_TYPENAME_P (identifier) = 1;
2872 }
2873
2874 return identifier;
2875 }
2876
2877 /* Return an identifier for the name of an initialization guard
2878 variable for indicated VARIABLE. */
2879
2880 tree
mangle_guard_variable(const tree variable)2881 mangle_guard_variable (const tree variable)
2882 {
2883 start_mangling (variable, /*ident_p=*/true);
2884 write_string ("_ZGV");
2885 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0)
2886 /* The name of a guard variable for a reference temporary should refer
2887 to the reference, not the temporary. */
2888 write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
2889 else
2890 write_name (variable, /*ignore_local_scope=*/0);
2891 return get_identifier_nocopy (finish_mangling (/*warn=*/false));
2892 }
2893
2894 /* Return an identifier for the name of a temporary variable used to
2895 initialize a static reference. This isn't part of the ABI, but we might
2896 as well call them something readable. */
2897
2898 tree
mangle_ref_init_variable(const tree variable)2899 mangle_ref_init_variable (const tree variable)
2900 {
2901 start_mangling (variable, /*ident_p=*/true);
2902 write_string ("_ZGR");
2903 write_name (variable, /*ignore_local_scope=*/0);
2904 return get_identifier_nocopy (finish_mangling (/*warn=*/false));
2905 }
2906
2907
2908 /* Foreign language type mangling section. */
2909
2910 /* How to write the type codes for the integer Java type. */
2911
2912 static void
write_java_integer_type_codes(const tree type)2913 write_java_integer_type_codes (const tree type)
2914 {
2915 if (type == java_int_type_node)
2916 write_char ('i');
2917 else if (type == java_short_type_node)
2918 write_char ('s');
2919 else if (type == java_byte_type_node)
2920 write_char ('c');
2921 else if (type == java_char_type_node)
2922 write_char ('w');
2923 else if (type == java_long_type_node)
2924 write_char ('x');
2925 else if (type == java_boolean_type_node)
2926 write_char ('b');
2927 else
2928 gcc_unreachable ();
2929 }
2930
2931 #include "gt-cp-mangle.h"
2932