Line data Source code
1 : /* Name mangling for the 3.0 C++ ABI.
2 : Copyright (C) 2000-2026 Free Software Foundation, Inc.
3 : Written by Alex Samuel <samuel@codesourcery.com>
4 :
5 : This file is part of GCC.
6 :
7 : GCC is free software; you can redistribute it and/or modify it
8 : under the terms of the GNU General Public License as published by
9 : the Free Software Foundation; either version 3, or (at your option)
10 : any later version.
11 :
12 : GCC is distributed in the hope that it will be useful, but
13 : WITHOUT ANY WARRANTY; without even the implied warranty of
14 : MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 : General Public License for more details.
16 :
17 : You should have received a copy of the GNU General Public License
18 : along with GCC; see the file COPYING3. If not see
19 : <http://www.gnu.org/licenses/>. */
20 :
21 : /* This file implements mangling of C++ names according to the IA64
22 : C++ ABI specification. A mangled name encodes a function or
23 : variable's name, scope, type, and/or template arguments into a text
24 : identifier. This identifier is used as the function's or
25 : variable's linkage name, to preserve compatibility between C++'s
26 : language features (templates, scoping, and overloading) and C
27 : linkers.
28 :
29 : Additionally, g++ uses mangled names internally. To support this,
30 : mangling of types is allowed, even though the mangled name of a
31 : type should not appear by itself as an exported name. Ditto for
32 : uninstantiated templates.
33 :
34 : The primary entry point for this module is mangle_decl, which
35 : returns an identifier containing the mangled name for a decl.
36 : Additional entry points are provided to build mangled names of
37 : particular constructs when the appropriate decl for that construct
38 : is not available. These are:
39 :
40 : mangle_typeinfo_for_type: typeinfo data
41 : mangle_typeinfo_string_for_type: typeinfo type name
42 : mangle_vtbl_for_type: virtual table data
43 : mangle_vtt_for_type: VTT data
44 : mangle_ctor_vtbl_for_type: `C-in-B' constructor virtual table data
45 : mangle_thunk: thunk function or entry */
46 :
47 : #include "config.h"
48 : #include "system.h"
49 : #include "coretypes.h"
50 : #include "target.h"
51 : #include "vtable-verify.h"
52 : #include "cp-tree.h"
53 : #include "stringpool.h"
54 : #include "cgraph.h"
55 : #include "stor-layout.h"
56 : #include "flags.h"
57 : #include "attribs.h"
58 : #include "contracts.h"
59 :
60 : /* Debugging support. */
61 :
62 : /* Define DEBUG_MANGLE to enable very verbose trace messages. */
63 : #ifndef DEBUG_MANGLE
64 : #define DEBUG_MANGLE 0
65 : #endif
66 :
67 : /* Macros for tracing the write_* functions. */
68 : #if DEBUG_MANGLE
69 : # define MANGLE_TRACE(FN, INPUT) \
70 : fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT))
71 : # define MANGLE_TRACE_TREE(FN, NODE) \
72 : fprintf (stderr, " %-24s: %-24s (%p)\n", \
73 : (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE))
74 : #else
75 : # define MANGLE_TRACE(FN, INPUT)
76 : # define MANGLE_TRACE_TREE(FN, NODE)
77 : #endif
78 :
79 : /* Nonzero if NODE is a class template-id. We can't rely on
80 : CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser
81 : that hard to distinguish A<T> from A, where A<T> is the type as
82 : instantiated outside of the template, and A is the type used
83 : without parameters inside the template. */
84 : #define CLASSTYPE_TEMPLATE_ID_P(NODE) \
85 : (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
86 : || (CLASS_TYPE_P (NODE) \
87 : && CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \
88 : && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE))))
89 :
90 : /* For deciding whether to set G.need_abi_warning, we need to consider both
91 : warn_abi_version and flag_abi_compat_version. */
92 : #define abi_warn_or_compat_version_crosses(N) \
93 : (abi_version_crosses (N) || abi_compat_version_crosses (N))
94 :
95 : /* And sometimes we can simplify the code path if we don't need to worry about
96 : previous ABIs. */
97 : #define abi_flag_at_least(flag,N) (flag == 0 || flag >= N)
98 : #define any_abi_below(N) \
99 : (!abi_version_at_least (N) \
100 : || !abi_flag_at_least (warn_abi_version, (N)) \
101 : || !abi_flag_at_least (flag_abi_compat_version, (N)))
102 :
103 : /* Things we only need one of. This module is not reentrant. */
104 : struct GTY(()) globals {
105 : /* An array of the current substitution candidates, in the order
106 : we've seen them. Contains NULLS, which correspond to module
107 : substitutions. */
108 : vec<tree, va_gc> *substitutions;
109 :
110 : /* The entity that is being mangled. */
111 : tree GTY ((skip)) entity;
112 :
113 : /* How many parameter scopes we are inside. */
114 : int parm_depth;
115 :
116 : /* True if the mangling will be different in a future version of the
117 : ABI. */
118 : bool need_abi_warning;
119 :
120 : /* True if the mangling will be different in C++17 mode. */
121 : bool need_cxx17_warning;
122 :
123 : /* True if we mangled a module name. */
124 : bool mod;
125 : };
126 :
127 : static GTY (()) globals G;
128 :
129 : /* The obstack on which we build mangled names. */
130 : static struct obstack *mangle_obstack;
131 :
132 : /* The obstack on which we build mangled names that are not going to
133 : be IDENTIFIER_NODEs. */
134 : static struct obstack name_obstack;
135 :
136 : /* The first object on the name_obstack; we use this to free memory
137 : allocated on the name_obstack. */
138 : static void *name_base;
139 :
140 : /* Indices into subst_identifiers. These are identifiers used in
141 : special substitution rules. */
142 : typedef enum
143 : {
144 : SUBID_ALLOCATOR,
145 : SUBID_BASIC_STRING,
146 : SUBID_CHAR_TRAITS,
147 : SUBID_BASIC_ISTREAM,
148 : SUBID_BASIC_OSTREAM,
149 : SUBID_BASIC_IOSTREAM,
150 : SUBID_MAX
151 : }
152 : substitution_identifier_index_t;
153 :
154 : /* For quick substitution checks, look up these common identifiers
155 : once only. */
156 : static GTY(()) tree subst_identifiers[SUBID_MAX];
157 :
158 : /* Single-letter codes for builtin integer types, defined in
159 : <builtin-type>. These are indexed by integer_type_kind values. */
160 : static const char
161 : integer_type_codes[itk_none] =
162 : {
163 : 'c', /* itk_char */
164 : 'a', /* itk_signed_char */
165 : 'h', /* itk_unsigned_char */
166 : 's', /* itk_short */
167 : 't', /* itk_unsigned_short */
168 : 'i', /* itk_int */
169 : 'j', /* itk_unsigned_int */
170 : 'l', /* itk_long */
171 : 'm', /* itk_unsigned_long */
172 : 'x', /* itk_long_long */
173 : 'y', /* itk_unsigned_long_long */
174 : /* __intN types are handled separately */
175 : '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0'
176 : };
177 :
178 : static tree maybe_template_info (const tree);
179 :
180 : /* Functions for handling substitutions. */
181 :
182 : static inline tree canonicalize_for_substitution (tree);
183 : static void add_substitution (tree);
184 : static inline bool is_std_substitution (const tree,
185 : const substitution_identifier_index_t);
186 : static inline bool is_std_substitution_char (const tree,
187 : const substitution_identifier_index_t);
188 : static int find_substitution (tree);
189 : static void mangle_call_offset (const tree, const tree);
190 :
191 : /* Functions for emitting mangled representations of things. */
192 :
193 : static void write_mangled_name (const tree, bool);
194 : static void write_encoding (const tree);
195 : static void write_name (tree, const int);
196 : static void write_abi_tags (tree);
197 : static void write_unscoped_name (const tree);
198 : static void write_unscoped_template_name (const tree);
199 : static void write_nested_name (const tree);
200 : static void write_prefix (const tree);
201 : static void write_template_prefix (const tree);
202 : static void write_unqualified_name (tree);
203 : static void write_conversion_operator_name (const tree);
204 : static void write_source_name (tree);
205 : static void write_literal_operator_name (tree);
206 : static void write_unnamed_type_name (const tree);
207 : static void write_unnamed_enum_name (const tree);
208 : static void write_closure_type_name (const tree);
209 : static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *,
210 : const unsigned int);
211 : static void write_number (unsigned HOST_WIDE_INT, const int,
212 : const unsigned int);
213 : static void write_compact_number (int num);
214 : static void write_integer_cst (const tree);
215 : static void write_real_cst (const tree);
216 : static void write_identifier (const char *);
217 : static void write_special_name_constructor (const tree);
218 : static void write_special_name_destructor (const tree);
219 : static void write_type (tree);
220 : static int write_CV_qualifiers_for_type (const tree);
221 : static void write_builtin_type (tree);
222 : static void write_function_type (const tree);
223 : static void write_bare_function_type (const tree, const int, const tree);
224 : static void write_method_parms (tree, const int, const tree);
225 : static void write_class_enum_type (const tree);
226 : static void write_template_args (tree, tree = NULL_TREE);
227 : static void write_expression (tree);
228 : static void write_template_arg_literal (const tree);
229 : static void write_template_arg (tree);
230 : static void write_template_template_arg (const tree);
231 : static void write_array_type (const tree);
232 : static void write_pointer_to_member_type (const tree);
233 : static void write_template_param (const tree);
234 : static void write_template_template_param (const tree);
235 : static void write_substitution (const int);
236 : static int discriminator_for_local_entity (tree);
237 : static int discriminator_for_string_literal (tree, tree);
238 : static void write_discriminator (const int);
239 : static void write_local_name (tree, const tree, const tree);
240 : static void dump_substitution_candidates (void);
241 : static tree mangle_decl_string (const tree);
242 : static void maybe_check_abi_tags (tree, tree = NULL_TREE, int = 10);
243 : static void write_splice (tree);
244 :
245 : /* Control functions. */
246 :
247 : static inline void start_mangling (const tree);
248 : static tree mangle_special_for_type (const tree, const char *);
249 :
250 : /* Append a single character to the end of the mangled
251 : representation. */
252 : #define write_char(CHAR) \
253 : obstack_1grow (mangle_obstack, (CHAR))
254 :
255 : /* Append a sized buffer to the end of the mangled representation. */
256 : #define write_chars(CHAR, LEN) \
257 : obstack_grow (mangle_obstack, (CHAR), (LEN))
258 :
259 : /* Append a NUL-terminated string to the end of the mangled
260 : representation. */
261 : #define write_string(STRING) \
262 : obstack_grow (mangle_obstack, (STRING), strlen (STRING))
263 :
264 : /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the
265 : same purpose (context, which may be a type) and value (template
266 : decl). See write_template_prefix for more information on what this
267 : is used for. */
268 : #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \
269 : (TREE_CODE (NODE1) == TREE_LIST \
270 : && TREE_CODE (NODE2) == TREE_LIST \
271 : && ((TYPE_P (TREE_PURPOSE (NODE1)) \
272 : && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \
273 : || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \
274 : && TREE_VALUE (NODE1) == TREE_VALUE (NODE2))
275 :
276 : /* Write out an unsigned quantity in base 10. */
277 : #define write_unsigned_number(NUMBER) \
278 : write_number ((NUMBER), /*unsigned_p=*/1, 10)
279 :
280 : /* Check for -fabi-version dependent mangling and also set the need_abi_warning
281 : flag as appropriate. */
282 :
283 : static bool
284 14604234 : abi_check (int ver)
285 : {
286 72853484 : if (abi_warn_or_compat_version_crosses (ver))
287 89012 : G.need_abi_warning = true;
288 14604234 : return abi_version_at_least (ver);
289 : }
290 :
291 : /* If DECL is a template instance (including the uninstantiated template
292 : itself), return its TEMPLATE_INFO. Otherwise return NULL. */
293 :
294 : static tree
295 1415715594 : maybe_template_info (const tree decl)
296 : {
297 1415715594 : if (TREE_CODE (decl) == TYPE_DECL)
298 : {
299 : /* TYPE_DECLs are handled specially. Look at its type to decide
300 : if this is a template instantiation. */
301 540108951 : const tree type = TREE_TYPE (decl);
302 :
303 540108951 : if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
304 429849667 : return TYPE_TEMPLATE_INFO (type);
305 : }
306 : else
307 : {
308 : /* Check if the template is a primary template. */
309 875606643 : if (DECL_LANG_SPECIFIC (decl) != NULL
310 874295357 : && VAR_OR_FUNCTION_DECL_P (decl)
311 743778390 : && DECL_TEMPLATE_INFO (decl)
312 1457472624 : && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)))
313 89434985 : return DECL_TEMPLATE_INFO (decl);
314 : }
315 :
316 : /* It's not a template id. */
317 : return NULL_TREE;
318 : }
319 :
320 : /* Produce debugging output of current substitution candidates. */
321 :
322 : static void
323 0 : dump_substitution_candidates (void)
324 : {
325 0 : unsigned i;
326 0 : tree el;
327 :
328 0 : fprintf (stderr, " ++ substitutions ");
329 0 : FOR_EACH_VEC_ELT (*G.substitutions, i, el)
330 : {
331 0 : const char *name = "???";
332 :
333 0 : if (i > 0)
334 0 : fprintf (stderr, " ");
335 0 : if (!el)
336 : name = "module";
337 0 : else if (DECL_P (el))
338 0 : name = IDENTIFIER_POINTER (DECL_NAME (el));
339 0 : else if (TREE_CODE (el) == TREE_LIST)
340 0 : name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el)));
341 0 : else if (TYPE_NAME (el))
342 0 : name = TYPE_NAME_STRING (el);
343 0 : fprintf (stderr, " S%d_ = ", i - 1);
344 0 : if (el)
345 : {
346 0 : if (TYPE_P (el) &&
347 0 : (CP_TYPE_RESTRICT_P (el)
348 0 : || CP_TYPE_VOLATILE_P (el)
349 0 : || CP_TYPE_CONST_P (el)))
350 0 : fprintf (stderr, "CV-");
351 0 : fprintf (stderr, "%s (%s at %p)",
352 0 : name, get_tree_code_name (TREE_CODE (el)), (void *) el);
353 : }
354 0 : fprintf (stderr, "\n");
355 : }
356 0 : }
357 :
358 : /* <exception-spec> ::=
359 : Do -- non-throwing exception specification
360 : DO <expression> E -- computed (instantiation-dependent) noexcept
361 : Dw <type>* E -- throw (types) */
362 :
363 : static void
364 3317964 : write_exception_spec (tree spec)
365 : {
366 :
367 3317964 : if (!spec || spec == noexcept_false_spec)
368 : /* Nothing. */
369 : return;
370 :
371 37550 : if (!flag_noexcept_type)
372 : {
373 17 : G.need_cxx17_warning = true;
374 17 : return;
375 : }
376 :
377 37533 : if (spec == noexcept_true_spec || spec == empty_except_spec)
378 37518 : write_string ("Do");
379 15 : else if (tree expr = TREE_PURPOSE (spec))
380 : {
381 : /* noexcept (expr) */
382 15 : gcc_assert (uses_template_parms (expr));
383 15 : write_string ("DO");
384 15 : write_expression (expr);
385 15 : write_char ('E');
386 : }
387 : else
388 : {
389 : /* throw (type-list) */
390 0 : write_string ("Dw");
391 0 : for (tree t = spec; t; t = TREE_CHAIN (t))
392 0 : write_type (TREE_VALUE (t));
393 0 : write_char ('E');
394 : }
395 : }
396 :
397 : /* Both decls and types can be substitution candidates, but sometimes
398 : they refer to the same thing. For instance, a TYPE_DECL and
399 : RECORD_TYPE for the same class refer to the same thing, and should
400 : be treated accordingly in substitutions. This function returns a
401 : canonicalized tree node representing NODE that is used when adding
402 : and substitution candidates and finding matches. */
403 :
404 : static inline tree
405 4964570698 : canonicalize_for_substitution (tree node)
406 : {
407 : /* For a TYPE_DECL, use the type instead. */
408 4964570698 : if (TREE_CODE (node) == TYPE_DECL)
409 5086 : node = TREE_TYPE (node);
410 4964570698 : if (TYPE_P (node)
411 3649155330 : && TYPE_CANONICAL (node) != node
412 5376747816 : && TYPE_MAIN_VARIANT (node) != node)
413 : {
414 117220008 : tree orig = node;
415 : /* Here we want to strip the topmost typedef only.
416 : We need to do that so is_std_substitution can do proper
417 : name matching. */
418 117220008 : if (TREE_CODE (node) == FUNCTION_TYPE)
419 : /* Use build_qualified_type and TYPE_QUALS here to preserve
420 : the old buggy mangling of attribute noreturn with abi<5. */
421 28480 : node = build_qualified_type (TYPE_MAIN_VARIANT (node),
422 28480 : TYPE_QUALS (node));
423 : else
424 117191528 : node = cp_build_qualified_type (TYPE_MAIN_VARIANT (node),
425 : cp_type_quals (node));
426 117220008 : if (FUNC_OR_METHOD_TYPE_P (node))
427 : {
428 28489 : node = build_ref_qualified_type (node, type_memfn_rqual (orig));
429 28489 : tree r = canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig));
430 28489 : if (flag_noexcept_type)
431 28445 : node = build_exception_variant (node, r);
432 : else
433 : /* Set the warning flag if appropriate. */
434 44 : write_exception_spec (r);
435 : }
436 : }
437 4964570698 : return node;
438 : }
439 :
440 : /* Add NODE as a substitution candidate. NODE must not already be on
441 : the list of candidates. */
442 :
443 : static void
444 1287077597 : add_substitution (tree node)
445 : {
446 1287077597 : tree c;
447 :
448 1287077597 : if (DEBUG_MANGLE)
449 : fprintf (stderr, " ++ add_substitution (%s at %10p)\n",
450 : get_tree_code_name (TREE_CODE (node)), (void *) node);
451 :
452 : /* Get the canonicalized substitution candidate for NODE. */
453 1287077597 : c = canonicalize_for_substitution (node);
454 1287077597 : if (DEBUG_MANGLE && c != node)
455 : fprintf (stderr, " ++ using candidate (%s at %10p)\n",
456 : get_tree_code_name (TREE_CODE (node)), (void *) node);
457 1287077597 : node = c;
458 :
459 : /* Make sure NODE isn't already a candidate. */
460 1287077597 : if (flag_checking)
461 : {
462 : int i;
463 : tree candidate;
464 :
465 6672427273 : FOR_EACH_VEC_SAFE_ELT (G.substitutions, i, candidate)
466 5385349792 : if (candidate)
467 : {
468 5385342272 : gcc_assert (!(DECL_P (node) && node == candidate));
469 5385342272 : gcc_assert (!(TYPE_P (node) && TYPE_P (candidate)
470 : && same_type_p (node, candidate)));
471 : }
472 : }
473 :
474 : /* Put the decl onto the varray of substitution candidates. */
475 1287077597 : vec_safe_push (G.substitutions, node);
476 :
477 1287077597 : if (DEBUG_MANGLE)
478 : dump_substitution_candidates ();
479 1287077597 : }
480 :
481 : /* Helper function for find_substitution. Returns nonzero if NODE,
482 : which may be a class or a class template, is a template-id with template
483 : name of substitution_index[INDEX] in the ::std namespace, with
484 : global module attachment. */
485 :
486 : static bool
487 4356496014 : is_std_substitution (const tree node,
488 : const substitution_identifier_index_t index)
489 : {
490 4356496014 : tree type = NULL_TREE;
491 4356496014 : tree decl = NULL_TREE;
492 :
493 8688051511 : auto std_substitution_p = [&] (tree decl, tree type)
494 : {
495 4331555497 : if (!DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl)))
496 : return false;
497 :
498 1673830605 : if (!(TYPE_LANG_SPECIFIC (type) && TYPE_TEMPLATE_INFO (type)))
499 : return false;
500 :
501 1244603347 : tree tmpl = TYPE_TI_TEMPLATE (type);
502 1244603347 : if (DECL_NAME (tmpl) != subst_identifiers[index])
503 : return false;
504 :
505 148523026 : if (modules_p () && get_originating_module (tmpl, true) >= 0)
506 27 : return false;
507 :
508 : return true;
509 4356496014 : };
510 :
511 4356496014 : if (TREE_CODE (node) == TYPE_DECL || DECL_CLASS_TEMPLATE_P (node))
512 : {
513 3442725744 : type = TREE_TYPE (node);
514 3442725744 : decl = node;
515 : }
516 913770270 : else if (CLASS_TYPE_P (node))
517 : {
518 4898398 : type = node;
519 4898398 : decl = TYPE_NAME (node);
520 : }
521 : else
522 : {
523 : /* We used to accept all _DECL nodes in this function but now we
524 : only accept classes or class templates. Verify that we don't
525 : return false for something that used to yield true. */
526 908871872 : gcc_checking_assert (!DECL_P (node)
527 : || !std_substitution_p (node, TREE_TYPE (node)));
528 : /* These are not the droids you're looking for. */
529 : return false;
530 : }
531 :
532 3447624142 : return std_substitution_p (decl, type);
533 : }
534 :
535 : /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T,
536 : which can be a decl or type. */
537 :
538 : static tree
539 1909904632 : get_abi_tags (tree t)
540 : {
541 1909904632 : if (!t || TREE_CODE (t) == NAMESPACE_DECL)
542 : return NULL_TREE;
543 :
544 1780255973 : if (DECL_P (t) && DECL_DECLARES_TYPE_P (t))
545 478632760 : t = TREE_TYPE (t);
546 :
547 1780255973 : if (TREE_CODE (t) == TEMPLATE_DECL && DECL_TEMPLATE_RESULT (t))
548 : {
549 17603484 : tree tags = get_abi_tags (DECL_TEMPLATE_RESULT (t));
550 : /* We used to overlook abi_tag on function and variable templates. */
551 17603484 : if (tags && abi_check (19))
552 10 : return tags;
553 : else
554 : return NULL_TREE;
555 : }
556 :
557 1762652489 : tree attrs;
558 1762652489 : if (TYPE_P (t))
559 1532501425 : attrs = TYPE_ATTRIBUTES (t);
560 : else
561 230151064 : attrs = DECL_ATTRIBUTES (t);
562 :
563 1762652489 : tree tags = lookup_attribute ("abi_tag", attrs);
564 1762652489 : if (tags)
565 12214832 : tags = TREE_VALUE (tags);
566 : return tags;
567 : }
568 :
569 : /* Helper function for find_substitution. Returns nonzero if NODE,
570 : which may be a decl or a CLASS_TYPE, is the template-id
571 : ::std::identifier<char>, where identifier is
572 : substitution_index[INDEX]. */
573 :
574 : static bool
575 6983048 : is_std_substitution_char (const tree node,
576 : const substitution_identifier_index_t index)
577 : {
578 6983048 : tree args;
579 : /* Check NODE's name is ::std::identifier. */
580 6983048 : if (!is_std_substitution (node, index))
581 : return 0;
582 : /* Figure out its template args. */
583 4421818 : if (DECL_P (node))
584 0 : args = DECL_TI_ARGS (node);
585 4421818 : else if (CLASS_TYPE_P (node))
586 4421818 : args = CLASSTYPE_TI_ARGS (node);
587 : else
588 : /* Oops, not a template. */
589 : return 0;
590 : /* NODE's template arg list should be <char>. */
591 4421818 : return
592 4421818 : TREE_VEC_LENGTH (args) == 1
593 4421818 : && TREE_VEC_ELT (args, 0) == char_type_node;
594 : }
595 :
596 : /* Check whether a substitution should be used to represent NODE in
597 : the mangling.
598 :
599 : First, check standard special-case substitutions.
600 :
601 : <substitution> ::= St
602 : # ::std
603 :
604 : ::= Sa
605 : # ::std::allocator
606 :
607 : ::= Sb
608 : # ::std::basic_string
609 :
610 : ::= Ss
611 : # ::std::basic_string<char,
612 : ::std::char_traits<char>,
613 : ::std::allocator<char> >
614 :
615 : ::= Si
616 : # ::std::basic_istream<char, ::std::char_traits<char> >
617 :
618 : ::= So
619 : # ::std::basic_ostream<char, ::std::char_traits<char> >
620 :
621 : ::= Sd
622 : # ::std::basic_iostream<char, ::std::char_traits<char> >
623 :
624 : Then examine the stack of currently available substitution
625 : candidates for entities appearing earlier in the same mangling
626 :
627 : If a substitution is found, write its mangled representation and
628 : return nonzero. If none is found, just return zero. */
629 :
630 : static int
631 2371128242 : find_substitution (tree node)
632 : {
633 2371128242 : int i;
634 2371128242 : const int size = vec_safe_length (G.substitutions);
635 2371128242 : tree decl;
636 2371128242 : tree type;
637 2371128242 : const char *abbr = NULL;
638 :
639 2371128242 : if (DEBUG_MANGLE)
640 : fprintf (stderr, " ++ find_substitution (%s at %p)\n",
641 : get_tree_code_name (TREE_CODE (node)), (void *) node);
642 :
643 : /* Obtain the canonicalized substitution representation for NODE.
644 : This is what we'll compare against. */
645 2371128242 : node = canonicalize_for_substitution (node);
646 :
647 : /* Check for builtin substitutions. */
648 :
649 2371128242 : decl = TYPE_P (node) ? TYPE_NAME (node) : node;
650 2371128242 : type = TYPE_P (node) ? node : TREE_TYPE (node);
651 :
652 : /* Check for std::allocator. */
653 2371128242 : if (decl
654 2201459690 : && is_std_substitution (decl, SUBID_ALLOCATOR)
655 2514119835 : && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
656 : abbr = "Sa";
657 :
658 : /* Check for std::basic_string. */
659 2305719762 : else if (decl && is_std_substitution (decl, SUBID_BASIC_STRING))
660 : {
661 155877 : if (TYPE_P (node))
662 : {
663 : /* If this is a type (i.e. a fully-qualified template-id),
664 : check for
665 : std::basic_string <char,
666 : std::char_traits<char>,
667 : std::allocator<char> > . */
668 108764 : if (cp_type_quals (type) == TYPE_UNQUALIFIED
669 108764 : && CLASSTYPE_USE_TEMPLATE (type))
670 : {
671 97215 : tree args = CLASSTYPE_TI_ARGS (type);
672 97215 : if (TREE_VEC_LENGTH (args) == 3
673 97197 : && template_args_equal (TREE_VEC_ELT (args, 0), char_type_node)
674 39521 : && is_std_substitution_char (TREE_VEC_ELT (args, 1),
675 : SUBID_CHAR_TRAITS)
676 136725 : && is_std_substitution_char (TREE_VEC_ELT (args, 2),
677 : SUBID_ALLOCATOR))
678 : abbr = "Ss";
679 : }
680 : }
681 : else
682 : /* Substitute for the template name only if this isn't a type. */
683 : abbr = "Sb";
684 : }
685 :
686 : /* Check for basic_{i,o,io}stream. */
687 2305563885 : else if (TYPE_P (node)
688 1532125290 : && cp_type_quals (type) == TYPE_UNQUALIFIED
689 1444160351 : && CLASS_TYPE_P (type)
690 608376197 : && CLASSTYPE_USE_TEMPLATE (type)
691 2754250059 : && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
692 : {
693 : /* First, check for the template
694 : args <char, std::char_traits<char> > . */
695 448686174 : tree args = CLASSTYPE_TI_ARGS (type);
696 448686174 : if (TREE_VEC_LENGTH (args) == 2
697 140248529 : && template_args_equal (TREE_VEC_ELT (args, 0), char_type_node)
698 455590191 : && is_std_substitution_char (TREE_VEC_ELT (args, 1),
699 : SUBID_CHAR_TRAITS))
700 : {
701 : /* Got them. Is this basic_istream? */
702 4342793 : if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
703 : abbr = "Si";
704 : /* Or basic_ostream? */
705 4030597 : else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
706 : abbr = "So";
707 : /* Or basic_iostream? */
708 3628676 : else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
709 2140944311 : abbr = "Sd";
710 : }
711 : }
712 :
713 : /* Check for namespace std. */
714 1856877711 : else if (decl && DECL_NAMESPACE_STD_P (decl))
715 : {
716 230183931 : write_string ("St");
717 230183931 : return 1;
718 : }
719 :
720 2140944311 : tree tags = NULL_TREE;
721 2140944311 : if (OVERLOAD_TYPE_P (node) || DECL_CLASS_TEMPLATE_P (node))
722 1053868665 : tags = get_abi_tags (type);
723 : /* Now check the list of available substitutions for this mangling
724 : operation. */
725 2140944311 : if (!abbr || tags)
726 9289016201 : for (i = 0; i < size; ++i)
727 7396351309 : if (tree candidate = (*G.substitutions)[i])
728 : {
729 : /* NODE is a matched to a candidate if it's the same decl node or
730 : if it's the same type. */
731 7396341203 : if (decl == candidate
732 7333175297 : || (TYPE_P (candidate) && type && TYPE_P (node)
733 3233232734 : && same_type_p (type, candidate))
734 14611882321 : || NESTED_TEMPLATE_MATCH (node, candidate))
735 : {
736 181830614 : write_substitution (i);
737 181830614 : return 1;
738 : }
739 : }
740 :
741 1892664892 : if (!abbr)
742 : /* No substitution found. */
743 : return 0;
744 :
745 66448811 : write_string (abbr);
746 66448811 : if (tags)
747 : {
748 : /* If there are ABI tags on the abbreviation, it becomes
749 : a substitution candidate. */
750 6 : write_abi_tags (tags);
751 6 : add_substitution (node);
752 : }
753 : return 1;
754 : }
755 :
756 : /* Returns whether DECL's symbol name should be the plain unqualified-id
757 : rather than a more complicated mangled name. */
758 :
759 : static bool
760 224988557 : unmangled_name_p (const tree decl)
761 : {
762 224988557 : if (TREE_CODE (decl) == FUNCTION_DECL)
763 : {
764 : /* The names of `extern "C"' functions are not mangled. */
765 190754178 : return (DECL_EXTERN_C_FUNCTION_P (decl)
766 : /* But overloaded operator names *are* mangled. */
767 2295155 : && !DECL_OVERLOADED_OPERATOR_P (decl));
768 : }
769 34234379 : else if (VAR_P (decl))
770 : {
771 : /* extern "C" declarations aren't mangled. */
772 34230996 : if (DECL_NAMESPACE_SCOPE_P (decl) && DECL_EXTERN_C_P (decl))
773 : return true;
774 :
775 : /* static variables are mangled. */
776 34016813 : if (!DECL_EXTERNAL_LINKAGE_P (decl))
777 : return false;
778 :
779 : /* Other variables at non-global scope are mangled. */
780 33798308 : if (CP_DECL_CONTEXT (decl) != global_namespace)
781 : return false;
782 :
783 : /* Variable template instantiations are mangled. */
784 124682 : if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
785 123278 : && variable_template_p (DECL_TI_TEMPLATE (decl)))
786 : return false;
787 :
788 : /* Declarations with ABI tags are mangled. */
789 113954 : if (get_abi_tags (decl))
790 : return false;
791 :
792 : // Declarations attached to a named module are mangled
793 113608 : if (modules_p () && get_originating_module (decl, true) >= 0)
794 118 : return false;
795 :
796 : /* The names of non-static global variables aren't mangled. */
797 : return true;
798 : }
799 :
800 : return false;
801 : }
802 :
803 : /* TOP_LEVEL is true, if this is being called at outermost level of
804 : mangling. It should be false when mangling a decl appearing in an
805 : expression within some other mangling.
806 :
807 : <mangled-name> ::= _Z <encoding> */
808 :
809 : static void
810 224988557 : write_mangled_name (const tree decl, bool top_level)
811 : {
812 224988557 : MANGLE_TRACE_TREE ("mangled-name", decl);
813 :
814 224988557 : check_abi_tags (decl);
815 :
816 224988557 : if (unmangled_name_p (decl))
817 : {
818 2622825 : if (top_level)
819 2622538 : write_string (IDENTIFIER_POINTER (DECL_NAME (decl)));
820 : else
821 : {
822 : /* The standard notes: "The <encoding> of an extern "C"
823 : function is treated like global-scope data, i.e. as its
824 : <source-name> without a type." We cannot write
825 : overloaded operators that way though, because it contains
826 : characters invalid in assembler. */
827 287 : write_string ("_Z");
828 287 : write_source_name (DECL_NAME (decl));
829 : }
830 : }
831 : else
832 : {
833 222365732 : write_string ("_Z");
834 222365732 : write_encoding (decl);
835 : }
836 :
837 : /* If this is a coroutine helper, then append an appropriate string to
838 : identify which. */
839 224988557 : if (tree ramp = DECL_RAMP_FN (decl))
840 : {
841 3052 : if (DECL_ACTOR_FN (ramp) == decl)
842 1526 : write_string (JOIN_STR "actor");
843 1526 : else if (DECL_DESTROY_FN (ramp) == decl)
844 1526 : write_string (JOIN_STR "destroy");
845 : else
846 0 : gcc_unreachable ();
847 : }
848 224988557 : }
849 :
850 : /* Returns true if the return type of DECL is part of its signature, and
851 : therefore its mangling. */
852 :
853 : bool
854 382121057 : mangle_return_type_p (tree decl)
855 : {
856 382121057 : return (!DECL_CONSTRUCTOR_P (decl)
857 320714135 : && !DECL_DESTRUCTOR_P (decl)
858 306228894 : && !DECL_CONV_FN_P (decl)
859 685536918 : && maybe_template_info (decl));
860 : }
861 :
862 : /* <constraint-expression> ::= <expression> */
863 :
864 : static void
865 3295645 : write_constraint_expression (tree expr)
866 : {
867 0 : write_expression (expr);
868 0 : }
869 :
870 : /* Mangle a requires-clause following a template-head, if any.
871 :
872 : Q <constraint_expression> E */
873 :
874 : static void
875 425052848 : write_tparms_constraints (tree constraints)
876 : {
877 : /* In a declaration with shorthand constraints in the template-head, followed
878 : by a requires-clause, followed by shorthand constraints in the
879 : function-parameter-list, the full constraints will be some && with the
880 : parameter constraints on the RHS, around an && with the requires-clause on
881 : the RHS. Find the requires-clause, if any.
882 :
883 : This logic relies on the && and ... from combine_constraint_expressions,
884 : finish_shorthand_constraint, and convert_generic_types_to_packs having
885 : UNKNOWN_LOCATION. If they need to have an actual location, we could move
886 : to using a TREE_LANG_FLAG. */
887 425052848 : if (constraints && abi_check (19))
888 : {
889 : tree probe = constraints;
890 : while (probe
891 348373 : && !cp_expr_location (probe)
892 384933 : && TREE_CODE (probe) == TRUTH_ANDIF_EXPR)
893 : {
894 372 : tree op1 = TREE_OPERAND (probe, 1);
895 715 : probe = (cp_expr_location (op1) ? op1
896 343 : : TREE_OPERAND (probe, 0));
897 : }
898 348001 : if (probe && cp_expr_location (probe))
899 : {
900 311813 : write_char ('Q');
901 311813 : write_constraint_expression (probe);
902 : }
903 : }
904 425052848 : }
905 :
906 : /* <type-constraint> ::= <name> */
907 :
908 : static void
909 145019 : write_type_constraint (tree cnst)
910 : {
911 145019 : if (!cnst)
912 : return;
913 :
914 145019 : gcc_checking_assert (TREE_CODE (cnst) == TEMPLATE_ID_EXPR);
915 :
916 145019 : tree concept_decl = get_concept_check_template (cnst);
917 145019 : write_name (concept_decl, 0);
918 145019 : tree args = TREE_OPERAND (cnst, 1);
919 145019 : if (TREE_VEC_LENGTH (args) > 1)
920 : {
921 52873 : TEMPLATE_ARGS_TYPE_CONSTRAINT_P (args) = true;
922 52873 : write_template_args (args);
923 : }
924 : }
925 :
926 : /* <encoding> ::= <function name> <bare-function-type>
927 : ::= <data name> */
928 :
929 : static void
930 228009250 : write_encoding (const tree decl)
931 : {
932 228009250 : MANGLE_TRACE_TREE ("encoding", decl);
933 :
934 228009250 : if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl))
935 : {
936 : /* For overloaded operators write just the mangled name
937 : without arguments. */
938 11037 : if (DECL_OVERLOADED_OPERATOR_P (decl))
939 3 : write_name (decl, /*ignore_local_scope=*/0);
940 : else
941 11034 : write_source_name (DECL_NAME (decl));
942 : return;
943 : }
944 :
945 227998213 : write_name (decl, /*ignore_local_scope=*/0);
946 227998213 : if (TREE_CODE (decl) == FUNCTION_DECL)
947 : {
948 194091304 : tree fn_type;
949 194091304 : tree d;
950 :
951 194091304 : if (maybe_template_info (decl))
952 : {
953 17399545 : fn_type = get_mostly_instantiated_function_type (decl);
954 : /* FN_TYPE will not have parameter types for in-charge or
955 : VTT parameters. Therefore, we pass NULL_TREE to
956 : write_bare_function_type -- otherwise, it will get
957 : confused about which artificial parameters to skip. */
958 17399545 : d = NULL_TREE;
959 : }
960 : else
961 : {
962 176691759 : fn_type = TREE_TYPE (decl);
963 176691759 : d = decl;
964 : }
965 :
966 194091304 : write_bare_function_type (fn_type,
967 194091304 : mangle_return_type_p (decl),
968 : d);
969 :
970 194091304 : if (tree c = get_trailing_function_requirements (decl))
971 3003316 : if (abi_check (19))
972 : {
973 2983826 : ++G.parm_depth;
974 2983826 : write_char ('Q');
975 2983826 : write_constraint_expression (c);
976 2983826 : --G.parm_depth;
977 : }
978 : }
979 : }
980 :
981 : /* Interface to substitution and identifier mangling, used by the
982 : module name mangler. */
983 :
984 : void
985 425 : mangle_module_substitution (int v)
986 : {
987 425 : write_substitution (v - 1);
988 425 : }
989 :
990 : int
991 8542 : mangle_module_component (tree comp, bool partition_p)
992 : {
993 8542 : write_char ('W');
994 8542 : if (partition_p)
995 220 : write_char ('P');
996 8542 : write_source_name (comp);
997 :
998 : // Module substitutions use the same number-space as entity
999 : // substitutions, but are orthogonal.
1000 8542 : vec_safe_push (G.substitutions, NULL_TREE);
1001 8542 : return G.substitutions->length ();
1002 : }
1003 :
1004 : /* If the outermost non-namespace context (including DECL itself) is
1005 : a module-linkage decl, mangle the module information. For module
1006 : global initializers we need to include the partition part.
1007 :
1008 : <module-name> ::= <module-sub>
1009 : || <subst>
1010 : || <module-name> <module-sub>
1011 : <module-sub> :: W [P] <unqualified-name>
1012 : */
1013 :
1014 : static void
1015 8291 : write_module (int m, bool include_partition)
1016 : {
1017 8291 : G.mod = true;
1018 0 : mangle_module (m, include_partition);
1019 0 : }
1020 :
1021 : static void
1022 1819851 : maybe_write_module (tree decl)
1023 : {
1024 1819851 : if (!DECL_NAMESPACE_SCOPE_P (decl))
1025 : return;
1026 :
1027 1294200 : if (!TREE_PUBLIC (STRIP_TEMPLATE (decl)))
1028 : return;
1029 :
1030 1285245 : if (TREE_CODE (decl) == NAMESPACE_DECL)
1031 : return;
1032 :
1033 974111 : int m = get_originating_module (decl, true);
1034 974111 : if (m >= 0)
1035 6222 : write_module (m, false);
1036 : }
1037 :
1038 : /* Lambdas can have a bit more context for mangling, specifically VAR_DECL
1039 : or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */
1040 :
1041 : static tree
1042 2112433789 : decl_mangling_context (tree decl)
1043 : {
1044 2112433937 : tree tcontext = targetm.cxx.decl_mangling_context (decl);
1045 :
1046 2112433937 : if (tcontext != NULL_TREE)
1047 : return tcontext;
1048 :
1049 2112433937 : if (TREE_CODE (decl) == TEMPLATE_DECL
1050 2112433937 : && DECL_TEMPLATE_RESULT (decl))
1051 : decl = DECL_TEMPLATE_RESULT (decl);
1052 :
1053 2112433937 : if (TREE_CODE (decl) == TYPE_DECL
1054 3108078261 : && LAMBDA_TYPE_P (TREE_TYPE (decl)))
1055 : {
1056 6073368 : tree extra = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl));
1057 6073368 : if (extra)
1058 : return extra;
1059 6081 : tcontext = CP_DECL_CONTEXT (decl);
1060 6251 : if (LAMBDA_TYPE_P (tcontext))
1061 : /* Lambda type context means this lambda appears between the
1062 : lambda-introducer and the open brace of another lambda (c++/119175).
1063 : That isn't a real scope; look further into the enclosing scope. */
1064 60 : return decl_mangling_context (TYPE_NAME (tcontext));
1065 : }
1066 2106360569 : else if (template_type_parameter_p (decl))
1067 : /* template type parms have no mangling context. */
1068 : return NULL_TREE;
1069 :
1070 2106365604 : tcontext = CP_DECL_CONTEXT (decl);
1071 :
1072 2106365604 : if (member_like_constrained_friend_p (decl))
1073 90064 : tcontext = DECL_FRIEND_CONTEXT (decl);
1074 :
1075 : /* Ignore the artificial declare reduction functions. */
1076 2106365604 : if (tcontext
1077 2106365604 : && TREE_CODE (tcontext) == FUNCTION_DECL
1078 2112327202 : && DECL_OMP_DECLARE_REDUCTION_P (tcontext))
1079 : return decl_mangling_context (tcontext);
1080 :
1081 : return tcontext;
1082 : }
1083 :
1084 : /* <name> ::= <unscoped-name>
1085 : ::= <unscoped-template-name> <template-args>
1086 : ::= <nested-name>
1087 : ::= <local-name>
1088 :
1089 : If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is
1090 : called from <local-name>, which mangles the enclosing scope
1091 : elsewhere and then uses this function to mangle just the part
1092 : underneath the function scope. So don't use the <local-name>
1093 : production, to avoid an infinite recursion. */
1094 :
1095 : static void
1096 562941656 : write_name (tree decl, const int ignore_local_scope)
1097 : {
1098 562941656 : tree context;
1099 :
1100 562941656 : MANGLE_TRACE_TREE ("name", decl);
1101 :
1102 562941656 : if (TREE_CODE (decl) == TYPE_DECL)
1103 : {
1104 : /* In case this is a typedef, fish out the corresponding
1105 : TYPE_DECL for the main variant. */
1106 330333992 : decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
1107 : }
1108 :
1109 562941656 : context = decl_mangling_context (decl);
1110 :
1111 562941656 : gcc_assert (context != NULL_TREE);
1112 :
1113 2814227339 : if (abi_warn_or_compat_version_crosses (7)
1114 160059 : && ignore_local_scope
1115 40 : && TREE_CODE (context) == PARM_DECL)
1116 0 : G.need_abi_warning = 1;
1117 :
1118 : /* A decl in :: or ::std scope is treated specially. The former is
1119 : mangled using <unscoped-name> or <unscoped-template-name>, the
1120 : latter with a special substitution. Also, a name that is
1121 : directly in a local function scope is also mangled with
1122 : <unscoped-name> rather than a full <nested-name>. */
1123 562941656 : if (context == global_namespace
1124 551035654 : || DECL_NAMESPACE_STD_P (context)
1125 327866860 : || (ignore_local_scope
1126 5151215 : && (TREE_CODE (context) == FUNCTION_DECL
1127 3563477 : || (abi_version_at_least (7)
1128 3563477 : && TREE_CODE (context) == PARM_DECL))))
1129 : {
1130 : /* Is this a template instance? */
1131 236662564 : if (tree info = maybe_template_info (decl))
1132 : {
1133 : /* Yes: use <unscoped-template-name>. */
1134 197398839 : write_unscoped_template_name (TI_TEMPLATE (info));
1135 : /* Pass down the parms of a function template in case we need to
1136 : mangle them; we don't mangle the parms of a non-overloadable
1137 : template. */
1138 197398839 : tree parms = (TREE_CODE (decl) == FUNCTION_DECL
1139 202373172 : ? DECL_TEMPLATE_PARMS (TI_TEMPLATE (info))
1140 4974333 : : NULL_TREE);
1141 197398839 : write_template_args (TI_ARGS (info), parms);
1142 : }
1143 : else
1144 : /* Everything else gets an <unqualified-name>. */
1145 39263725 : write_unscoped_name (decl);
1146 : }
1147 : else
1148 : {
1149 : /* Handle local names, unless we asked not to (that is, invoked
1150 : under <local-name>, to handle only the part of the name under
1151 : the local scope). */
1152 326279092 : if (!ignore_local_scope)
1153 : {
1154 : /* Scan up the list of scope context, looking for a
1155 : function. If we find one, this entity is in local
1156 : function scope. local_entity tracks context one scope
1157 : level down, so it will contain the element that's
1158 : directly in that function's scope, either decl or one of
1159 : its enclosing scopes. */
1160 : tree local_entity = decl;
1161 1029549953 : while (context != global_namespace)
1162 : {
1163 : /* Make sure we're always dealing with decls. */
1164 711985523 : if (TYPE_P (context))
1165 225864002 : context = TYPE_NAME (context);
1166 : /* Is this a function? */
1167 711985523 : if (TREE_CODE (context) == FUNCTION_DECL
1168 706834674 : || TREE_CODE (context) == PARM_DECL)
1169 : {
1170 : /* Yes, we have local scope. Use the <local-name>
1171 : production for the innermost function scope. */
1172 5151215 : write_local_name (context, local_entity, decl);
1173 5151215 : return;
1174 : }
1175 : /* Up one scope level. */
1176 706834308 : local_entity = context;
1177 706834308 : context = decl_mangling_context (context);
1178 : }
1179 :
1180 : /* No local scope found? Fall through to <nested-name>. */
1181 : }
1182 :
1183 : /* Other decls get a <nested-name> to encode their scope. */
1184 321127877 : write_nested_name (decl);
1185 : }
1186 : }
1187 :
1188 : /* <unscoped-name> ::= <unqualified-name>
1189 : ::= St <unqualified-name> # ::std:: */
1190 :
1191 : static void
1192 168703336 : write_unscoped_name (const tree decl)
1193 : {
1194 168703336 : tree context = decl_mangling_context (decl);
1195 :
1196 168703336 : MANGLE_TRACE_TREE ("unscoped-name", decl);
1197 :
1198 : /* Is DECL in ::std? */
1199 168703336 : if (DECL_NAMESPACE_STD_P (context))
1200 : {
1201 158163218 : write_string ("St");
1202 158163218 : write_unqualified_name (decl);
1203 : }
1204 : else
1205 : {
1206 : /* If not, it should be either in the global namespace, or directly
1207 : in a local function scope. A lambda can also be mangled in the
1208 : scope of a default argument. */
1209 10540118 : gcc_assert (context == global_namespace
1210 : || TREE_CODE (context) == PARM_DECL
1211 : || TREE_CODE (context) == FUNCTION_DECL);
1212 :
1213 10540118 : write_unqualified_name (decl);
1214 : }
1215 168703336 : }
1216 :
1217 : /* <unscoped-template-name> ::= <unscoped-name>
1218 : ::= <substitution> */
1219 :
1220 : static void
1221 197398839 : write_unscoped_template_name (const tree decl)
1222 : {
1223 197398839 : MANGLE_TRACE_TREE ("unscoped-template-name", decl);
1224 :
1225 197398839 : if (find_substitution (decl))
1226 : return;
1227 129439611 : write_unscoped_name (decl);
1228 129439611 : add_substitution (decl);
1229 : }
1230 :
1231 : /* Write the nested name, including CV-qualifiers, of DECL.
1232 :
1233 : <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E
1234 : ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E
1235 :
1236 : <ref-qualifier> ::= R # & ref-qualifier
1237 : ::= O # && ref-qualifier
1238 : <CV-qualifiers> ::= [r] [V] [K] */
1239 :
1240 : static void
1241 323848687 : write_nested_name (const tree decl)
1242 : {
1243 323848687 : MANGLE_TRACE_TREE ("nested-name", decl);
1244 :
1245 323848687 : write_char ('N');
1246 :
1247 : /* Write CV-qualifiers, if this is an iobj member function. */
1248 323848687 : if (TREE_CODE (decl) == FUNCTION_DECL
1249 323848687 : && DECL_IOBJ_MEMBER_FUNCTION_P (decl))
1250 : {
1251 153231387 : if (DECL_VOLATILE_MEMFUNC_P (decl))
1252 8875919 : write_char ('V');
1253 153231387 : if (DECL_CONST_MEMFUNC_P (decl))
1254 46597050 : write_char ('K');
1255 153231387 : if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl)))
1256 : {
1257 155400 : if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl)))
1258 96993 : write_char ('O');
1259 : else
1260 58407 : write_char ('R');
1261 : }
1262 : }
1263 141657250 : else if (DECL_DECLARES_FUNCTION_P (decl)
1264 170617300 : && DECL_XOBJ_MEMBER_FUNCTION_P (decl))
1265 5459 : write_char ('H');
1266 :
1267 : /* Is this a template instance? */
1268 323848687 : if (tree info = maybe_template_info (decl))
1269 : {
1270 : /* Yes, use <template-prefix>. */
1271 55917267 : write_template_prefix (decl);
1272 55917267 : write_template_args (TI_ARGS (info));
1273 : }
1274 267931420 : else if ((!abi_version_at_least (10) || TREE_CODE (decl) == TYPE_DECL)
1275 346916555 : && TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1276 : {
1277 2720807 : tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1278 2720807 : if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1279 : {
1280 50603 : write_template_prefix (decl);
1281 50603 : write_template_args (TREE_OPERAND (name, 1));
1282 : }
1283 : else
1284 : {
1285 2670204 : write_prefix (decl_mangling_context (decl));
1286 2670204 : write_unqualified_name (decl);
1287 : }
1288 : }
1289 : else
1290 : {
1291 : /* No, just use <prefix> */
1292 265210613 : write_prefix (decl_mangling_context (decl));
1293 265210613 : write_unqualified_name (decl);
1294 : }
1295 323848687 : write_char ('E');
1296 323848687 : }
1297 :
1298 : /* <prefix> ::= <prefix> <unqualified-name>
1299 : ::= <template-param>
1300 : ::= <template-prefix> <template-args>
1301 : ::= <decltype>
1302 : ::= # empty
1303 : ::= <substitution>
1304 : ::= <splice> # C++26 dependent splice [proposed] */
1305 :
1306 : static void
1307 667795626 : write_prefix (const tree node)
1308 : {
1309 667795626 : tree decl;
1310 :
1311 667795626 : if (node == NULL
1312 667795626 : || node == global_namespace)
1313 : return;
1314 :
1315 643758571 : MANGLE_TRACE_TREE ("prefix", node);
1316 :
1317 643758571 : if (TREE_CODE (node) == DECLTYPE_TYPE
1318 643758463 : || TREE_CODE (node) == TRAIT_TYPE)
1319 : {
1320 111 : write_type (node);
1321 111 : return;
1322 : }
1323 :
1324 643758460 : if (TREE_CODE (node) == SPLICE_SCOPE)
1325 : {
1326 10 : write_splice (node);
1327 10 : return;
1328 : }
1329 :
1330 643758450 : if (find_substitution (node))
1331 : return;
1332 :
1333 353679568 : tree template_info = NULL_TREE;
1334 353679568 : if (DECL_P (node))
1335 : {
1336 : /* If this is a function or parm decl, that means we've hit function
1337 : scope, so this prefix must be for a local name. In this
1338 : case, we're under the <local-name> production, which encodes
1339 : the enclosing function scope elsewhere. So don't continue
1340 : here. */
1341 133280765 : if (TREE_CODE (node) == FUNCTION_DECL
1342 129718292 : || TREE_CODE (node) == PARM_DECL)
1343 : return;
1344 :
1345 129717956 : decl = node;
1346 129717956 : template_info = maybe_template_info (decl);
1347 : }
1348 : else
1349 : {
1350 : /* Node is a type. */
1351 220398803 : decl = TYPE_NAME (node);
1352 : /* The DECL might not point at the node. */
1353 220398803 : if (CLASSTYPE_TEMPLATE_ID_P (node))
1354 166675847 : template_info = TYPE_TEMPLATE_INFO (node);
1355 : }
1356 :
1357 350116759 : if (TREE_CODE (node) == TEMPLATE_TYPE_PARM)
1358 12412 : write_template_param (node);
1359 350104347 : else if (template_info)
1360 : /* Templated. */
1361 : {
1362 166718166 : write_template_prefix (decl);
1363 166718166 : write_template_args (TI_ARGS (template_info));
1364 : }
1365 183386181 : else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1366 : {
1367 138205 : tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1368 138205 : if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1369 : {
1370 119527 : write_template_prefix (decl);
1371 119527 : write_template_args (TREE_OPERAND (name, 1));
1372 : }
1373 : else
1374 : {
1375 18678 : write_prefix (decl_mangling_context (decl));
1376 18678 : write_unqualified_name (decl);
1377 : }
1378 : }
1379 : else
1380 : /* Not templated. */
1381 : {
1382 183247976 : write_prefix (decl_mangling_context (decl));
1383 183247976 : write_unqualified_name (decl);
1384 183247976 : if (VAR_P (decl)
1385 183247976 : || TREE_CODE (decl) == FIELD_DECL)
1386 : {
1387 : /* <data-member-prefix> := <member source-name> M */
1388 26840 : write_char ('M');
1389 :
1390 : /* Before ABI 18, we did not count these as substitution
1391 : candidates. This leads to incorrect demanglings (and
1392 : ABI divergence to other compilers). */
1393 26840 : if (!abi_check (18))
1394 : return;
1395 : }
1396 : }
1397 :
1398 350116627 : add_substitution (node);
1399 : }
1400 :
1401 : /* <template-prefix> ::= <prefix> <template component>
1402 : ::= <template-param>
1403 : ::= <substitution> */
1404 :
1405 : static void
1406 222805563 : write_template_prefix (const tree node)
1407 : {
1408 222805563 : tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1409 222805563 : tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1410 222805563 : tree context = decl_mangling_context (decl);
1411 222805563 : tree templ;
1412 222805563 : tree substitution;
1413 :
1414 222805563 : MANGLE_TRACE_TREE ("template-prefix", node);
1415 :
1416 : /* Find the template decl. */
1417 222805563 : if (tree info = maybe_template_info (decl))
1418 222634447 : templ = TI_TEMPLATE (info);
1419 171116 : else if (TREE_CODE (type) == TYPENAME_TYPE)
1420 : /* For a typename type, all we have is the name. */
1421 170130 : templ = DECL_NAME (decl);
1422 : else
1423 : {
1424 986 : gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type));
1425 :
1426 986 : templ = TYPE_TI_TEMPLATE (type);
1427 : }
1428 :
1429 : /* For a member template, though, the template name for the
1430 : innermost name must have all the outer template levels
1431 : instantiated. For instance, consider
1432 :
1433 : template<typename T> struct Outer {
1434 : template<typename U> struct Inner {};
1435 : };
1436 :
1437 : The template name for `Inner' in `Outer<int>::Inner<float>' is
1438 : `Outer<int>::Inner<U>'. In g++, we don't instantiate the template
1439 : levels separately, so there's no TEMPLATE_DECL available for this
1440 : (there's only `Outer<T>::Inner<U>').
1441 :
1442 : In order to get the substitutions right, we create a special
1443 : TREE_LIST to represent the substitution candidate for a nested
1444 : template. The TREE_PURPOSE is the template's context, fully
1445 : instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner
1446 : template.
1447 :
1448 : So, for the example above, `Outer<int>::Inner' is represented as a
1449 : substitution candidate by a TREE_LIST whose purpose is `Outer<int>'
1450 : and whose value is `Outer<T>::Inner<U>'. */
1451 222805563 : if (context && TYPE_P (context))
1452 11435748 : substitution = build_tree_list (context, templ);
1453 : else
1454 : substitution = templ;
1455 :
1456 222805563 : if (find_substitution (substitution))
1457 : return;
1458 :
1459 216648483 : if (TREE_TYPE (templ)
1460 216648483 : && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM)
1461 986 : write_template_param (TREE_TYPE (templ));
1462 : else
1463 : {
1464 216647497 : write_prefix (context);
1465 216647497 : write_unqualified_name (decl);
1466 : }
1467 :
1468 216648483 : add_substitution (substitution);
1469 : }
1470 :
1471 : /* "For the purposes of mangling, the name of an anonymous union is considered
1472 : to be the name of the first named data member found by a pre-order,
1473 : depth-first, declaration-order walk of the data members of the anonymous
1474 : union. If there is no such data member (i.e., if all of the data members in
1475 : the union are unnamed), then there is no way for a program to refer to the
1476 : anonymous union, and there is therefore no need to mangle its name." */
1477 :
1478 : static tree
1479 51 : anon_aggr_naming_decl (tree type)
1480 : {
1481 51 : tree field = next_aggregate_field (TYPE_FIELDS (type));
1482 102 : for (; field; field = next_aggregate_field (DECL_CHAIN (field)))
1483 : {
1484 21 : if (DECL_NAME (field))
1485 : return field;
1486 0 : if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1487 0 : if (tree sub = anon_aggr_naming_decl (TREE_TYPE (field)))
1488 : return sub;
1489 : }
1490 : return NULL_TREE;
1491 : }
1492 :
1493 : /* We don't need to handle thunks, vtables, or VTTs here. Those are
1494 : mangled through special entry points.
1495 :
1496 : <unqualified-name> ::= [<module-name>] <operator-name>
1497 : ::= <special-name>
1498 : ::= [<module-name>] <source-name>
1499 : ::= [<module-name>] <unnamed-type-name>
1500 : ::= <local-source-name>
1501 : ::= F <source-name> # member-like constrained friend
1502 :
1503 : <local-source-name> ::= L <source-name> <discriminator> */
1504 :
1505 : static void
1506 5026602 : write_unqualified_id (tree identifier)
1507 : {
1508 5026602 : if (IDENTIFIER_CONV_OP_P (identifier))
1509 15 : write_conversion_operator_name (TREE_TYPE (identifier));
1510 5026587 : else if (IDENTIFIER_OVL_OP_P (identifier))
1511 : {
1512 54015 : const ovl_op_info_t *ovl_op = IDENTIFIER_OVL_OP_INFO (identifier);
1513 54015 : write_string (ovl_op->mangled_name);
1514 54015 : }
1515 4972572 : else if (UDLIT_OPER_P (identifier))
1516 0 : write_literal_operator_name (identifier);
1517 : else
1518 4972572 : write_source_name (identifier);
1519 5026602 : }
1520 :
1521 : static void
1522 836502202 : write_unqualified_name (tree decl)
1523 : {
1524 836502202 : MANGLE_TRACE_TREE ("unqualified-name", decl);
1525 :
1526 836502202 : if (modules_p ())
1527 1819851 : maybe_write_module (decl);
1528 :
1529 836502202 : if (identifier_p (decl))
1530 : {
1531 0 : write_unqualified_id (decl);
1532 0 : return;
1533 : }
1534 :
1535 836502202 : bool found = false;
1536 :
1537 836502202 : if (DECL_NAME (decl) == NULL_TREE
1538 836502202 : && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
1539 21 : decl = anon_aggr_naming_decl (TREE_TYPE (decl));
1540 836502181 : else if (DECL_NAME (decl) == NULL_TREE)
1541 : {
1542 11799 : found = true;
1543 11799 : gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl));
1544 11799 : write_source_name (DECL_ASSEMBLER_NAME (decl));
1545 : }
1546 836490382 : else if (DECL_DECLARES_FUNCTION_P (decl))
1547 : {
1548 194090764 : found = true;
1549 :
1550 : /* A constrained hidden friend is mangled like a member function, with
1551 : the name prefixed by 'F'. */
1552 194090764 : if (member_like_constrained_friend_p (decl))
1553 22516 : write_char ('F');
1554 :
1555 388181528 : if (DECL_CONSTRUCTOR_P (decl))
1556 30818072 : write_special_name_constructor (decl);
1557 163272692 : else if (DECL_DESTRUCTOR_P (decl))
1558 7486747 : write_special_name_destructor (decl);
1559 155785945 : else if (DECL_CONV_FN_P (decl))
1560 : {
1561 : /* Conversion operator. Handle it right here.
1562 : <operator> ::= cv <type> */
1563 2807756 : tree type;
1564 2807756 : if (maybe_template_info (decl))
1565 : {
1566 601 : tree fn_type;
1567 601 : fn_type = get_mostly_instantiated_function_type (decl);
1568 601 : type = TREE_TYPE (fn_type);
1569 : }
1570 2807155 : else if (FNDECL_USED_AUTO (decl))
1571 60 : type = DECL_SAVED_AUTO_RETURN_TYPE (decl);
1572 : else
1573 2807095 : type = DECL_CONV_FN_TYPE (decl);
1574 2807756 : write_conversion_operator_name (type);
1575 : }
1576 152978189 : else if (DECL_OVERLOADED_OPERATOR_P (decl))
1577 : {
1578 34977426 : tree t;
1579 34977426 : if (!(t = DECL_RAMP_FN (decl)))
1580 34977034 : t = decl;
1581 34977426 : const char *mangled_name
1582 34977426 : = (ovl_op_info[DECL_ASSIGNMENT_OPERATOR_P (t)]
1583 34977426 : [DECL_OVERLOADED_OPERATOR_CODE_RAW (t)].mangled_name);
1584 34977426 : write_string (mangled_name);
1585 : }
1586 118000763 : else if (UDLIT_OPER_P (DECL_NAME (decl)))
1587 308459 : write_literal_operator_name (DECL_NAME (decl));
1588 : else
1589 : found = false;
1590 : }
1591 :
1592 76410280 : if (found)
1593 : /* OK */;
1594 760091943 : else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1595 124970 : && DECL_NAMESPACE_SCOPE_P (decl)
1596 760163450 : && decl_linkage (decl) == lk_internal)
1597 : {
1598 60173 : MANGLE_TRACE_TREE ("local-source-name", decl);
1599 60173 : write_char ('L');
1600 60173 : write_source_name (DECL_NAME (decl));
1601 : /* The default discriminator is 1, and that's all we ever use,
1602 : so there's no code to output one here. */
1603 : }
1604 : else
1605 : {
1606 760031770 : tree type = TREE_TYPE (decl);
1607 :
1608 760031770 : if (TREE_CODE (decl) == TYPE_DECL
1609 760031770 : && enum_with_enumerator_for_linkage_p (type))
1610 20 : write_unnamed_enum_name (type);
1611 1128333350 : else if (TREE_CODE (decl) == TYPE_DECL && TYPE_UNNAMED_P (type))
1612 1532 : write_unnamed_type_name (type);
1613 1101502951 : else if (TREE_CODE (decl) == TYPE_DECL && LAMBDA_TYPE_P (type))
1614 2365875 : write_closure_type_name (type);
1615 : else
1616 757664343 : write_source_name (DECL_NAME (decl));
1617 : }
1618 :
1619 : /* We use the ABI tags from the primary class template, ignoring tags on any
1620 : specializations. This is necessary because C++ doesn't require a
1621 : specialization to be declared before it is used unless the use requires a
1622 : complete type, but we need to get the tags right on incomplete types as
1623 : well. */
1624 836502202 : if (tree tmpl = most_general_template (decl))
1625 : {
1626 492146309 : tree res = DECL_TEMPLATE_RESULT (tmpl);
1627 492146309 : if (res == NULL_TREE)
1628 : /* UNBOUND_CLASS_TEMPLATE. */;
1629 492146306 : else if (DECL_DECLARES_TYPE_P (decl))
1630 : decl = res;
1631 170287627 : else if (any_abi_below (11))
1632 : {
1633 : /* ABI v10 implicit tags on the template. */
1634 81578 : tree mtags = missing_abi_tags (res);
1635 : /* Explicit tags on the template. */
1636 81578 : tree ttags = get_abi_tags (res);
1637 : /* Tags on the instantiation. */
1638 81578 : tree dtags = get_abi_tags (decl);
1639 :
1640 81656 : if (mtags && abi_warn_or_compat_version_crosses (10))
1641 6 : G.need_abi_warning = 1;
1642 :
1643 : /* Add the v10 tags to the explicit tags now. */
1644 81578 : mtags = chainon (mtags, ttags);
1645 :
1646 81578 : if (!G.need_abi_warning
1647 163058 : && abi_warn_or_compat_version_crosses (11)
1648 163062 : && !equal_abi_tags (dtags, mtags, /*ignore_inherited_p=*/false))
1649 6 : G.need_abi_warning = 1;
1650 :
1651 81578 : if (!abi_version_at_least (10))
1652 : /* In abi <10, we only got the explicit tags. */
1653 : decl = res;
1654 911 : else if (flag_abi_version == 10)
1655 : {
1656 : /* In ABI 10, we want explicit and implicit tags. */
1657 72 : write_abi_tags (mtags);
1658 72 : return;
1659 : }
1660 : }
1661 : }
1662 :
1663 836502130 : tree tags = get_abi_tags (decl);
1664 189116673 : if (TREE_CODE (decl) == FUNCTION_DECL && DECL_CONV_FN_P (decl)
1665 839309886 : && any_abi_below (11))
1666 2731 : if (tree mtags = missing_abi_tags (decl))
1667 : {
1668 9 : if (!abi_check (11))
1669 6 : tags = chainon (mtags, tags);
1670 : }
1671 836502130 : write_abi_tags (tags);
1672 : }
1673 :
1674 : /* Write the unqualified-name for a conversion operator to TYPE. */
1675 :
1676 : static void
1677 2807771 : write_conversion_operator_name (const tree type)
1678 : {
1679 2807771 : write_string ("cv");
1680 2807771 : write_type (type);
1681 2807771 : }
1682 :
1683 : /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1684 :
1685 : <source-name> ::= </length/ number> <identifier> */
1686 :
1687 : static void
1688 762729139 : write_source_name (tree identifier)
1689 : {
1690 762729139 : MANGLE_TRACE_TREE ("source-name", identifier);
1691 :
1692 762729139 : write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1693 762729139 : write_identifier (IDENTIFIER_POINTER (identifier));
1694 762729139 : }
1695 :
1696 : /* Compare two TREE_STRINGs like strcmp. */
1697 :
1698 : static int
1699 306 : tree_string_cmp (const void *p1, const void *p2)
1700 : {
1701 306 : if (p1 == p2)
1702 : return 0;
1703 306 : tree s1 = *(const tree*)p1;
1704 306 : tree s2 = *(const tree*)p2;
1705 306 : return strcmp (TREE_STRING_POINTER (s1),
1706 306 : TREE_STRING_POINTER (s2));
1707 : }
1708 :
1709 : /* Return the TREE_LIST of TAGS as a sorted VEC. */
1710 :
1711 : static vec<tree, va_gc> *
1712 506078 : sorted_abi_tags (tree tags, bool ignore_inherited_p)
1713 : {
1714 506078 : vec<tree, va_gc> * vec = make_tree_vector();
1715 :
1716 849254 : for (tree t = tags; t; t = TREE_CHAIN (t))
1717 : {
1718 343176 : if (ABI_TAG_NOT_MANGLED (t)
1719 343176 : || (ignore_inherited_p && ABI_TAG_INHERITED (t)))
1720 6 : continue;
1721 343170 : tree str = TREE_VALUE (t);
1722 343170 : vec_safe_push (vec, str);
1723 : }
1724 :
1725 506078 : vec->qsort (tree_string_cmp);
1726 :
1727 506078 : return vec;
1728 : }
1729 :
1730 : /* ID is the name of a function or type with abi_tags attribute TAGS.
1731 : Write out the name, suitably decorated. */
1732 :
1733 : static void
1734 836502238 : write_abi_tags (tree tags)
1735 : {
1736 836502238 : if (tags == NULL_TREE)
1737 836502238 : return;
1738 :
1739 343044 : vec<tree, va_gc> * vec = sorted_abi_tags (tags, /*ignore_inherited_p=*/false);
1740 :
1741 343044 : unsigned i; tree str;
1742 1029159 : FOR_EACH_VEC_ELT (*vec, i, str)
1743 : {
1744 343071 : write_string ("B");
1745 343071 : write_unsigned_number (TREE_STRING_LENGTH (str) - 1);
1746 343071 : write_identifier (TREE_STRING_POINTER (str));
1747 : }
1748 :
1749 343044 : release_tree_vector (vec);
1750 : }
1751 :
1752 : /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */
1753 :
1754 : bool
1755 81517 : equal_abi_tags (tree t1, tree t2, bool ignore_inherited_p)
1756 : {
1757 81517 : releasing_vec v1 = sorted_abi_tags (t1, ignore_inherited_p);
1758 81517 : releasing_vec v2 = sorted_abi_tags (t2, ignore_inherited_p);
1759 :
1760 81517 : unsigned len1 = v1->length();
1761 81517 : if (len1 != v2->length())
1762 : return false;
1763 81511 : for (unsigned i = 0; i < len1; ++i)
1764 21 : if (strcmp (TREE_STRING_POINTER (v1[i]),
1765 21 : TREE_STRING_POINTER (v2[i])) != 0)
1766 : return false;
1767 : return true;
1768 81517 : }
1769 :
1770 : /* Write a user-defined literal operator.
1771 : ::= li <source-name> # "" <source-name>
1772 : IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */
1773 :
1774 : static void
1775 308459 : write_literal_operator_name (tree identifier)
1776 : {
1777 308459 : const char* suffix = UDLIT_OP_SUFFIX (identifier);
1778 308459 : write_identifier (UDLIT_OP_MANGLED_PREFIX);
1779 308459 : write_unsigned_number (strlen (suffix));
1780 308459 : write_identifier (suffix);
1781 308459 : }
1782 :
1783 : /* Encode 0 as _, and 1+ as n-1_. */
1784 :
1785 : static void
1786 32135975 : write_compact_number (int num)
1787 : {
1788 32135975 : gcc_checking_assert (num >= 0);
1789 32135975 : if (num > 0)
1790 12440550 : write_unsigned_number (num - 1);
1791 32135975 : write_char ('_');
1792 32135975 : }
1793 :
1794 : /* Return how many unnamed types precede TYPE in its enclosing class. */
1795 :
1796 : static int
1797 833 : nested_anon_class_index (tree type)
1798 : {
1799 833 : int index = 0;
1800 833 : tree member = TYPE_FIELDS (TYPE_CONTEXT (type));
1801 22253 : for (; member; member = DECL_CHAIN (member))
1802 22253 : if (DECL_IMPLICIT_TYPEDEF_P (member))
1803 : {
1804 1293 : tree memtype = TREE_TYPE (member);
1805 1293 : if (memtype == type)
1806 : return index;
1807 1124 : else if (TYPE_UNNAMED_P (memtype))
1808 204 : ++index;
1809 : }
1810 :
1811 0 : if (seen_error ())
1812 : return -1;
1813 :
1814 0 : gcc_unreachable ();
1815 : }
1816 :
1817 : /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */
1818 :
1819 : static void
1820 1532 : write_unnamed_type_name (const tree type)
1821 : {
1822 1532 : int discriminator;
1823 1532 : MANGLE_TRACE_TREE ("unnamed-type-name", type);
1824 :
1825 1532 : if (TYPE_FUNCTION_SCOPE_P (type))
1826 358 : discriminator = discriminator_for_local_entity (TYPE_NAME (type));
1827 1174 : else if (TYPE_CLASS_SCOPE_P (type))
1828 833 : discriminator = nested_anon_class_index (type);
1829 : else
1830 : {
1831 341 : gcc_assert (no_linkage_check (type, /*relaxed_p=*/true));
1832 : /* Just use the old mangling at namespace scope. */
1833 341 : write_source_name (TYPE_IDENTIFIER (type));
1834 341 : return;
1835 : }
1836 :
1837 1191 : write_string ("Ut");
1838 1191 : write_compact_number (discriminator);
1839 : }
1840 :
1841 : /* <unnamed-enum-name> ::= Ue <underlying type> <enumerator source-name> */
1842 :
1843 : static void
1844 20 : write_unnamed_enum_name (const tree type)
1845 : {
1846 20 : MANGLE_TRACE_TREE ("unnamed-enum-name", type);
1847 20 : write_string ("Ue");
1848 20 : write_type (ENUM_UNDERLYING_TYPE (type));
1849 20 : write_source_name (DECL_NAME (TREE_VALUE (TYPE_VALUES (type))));
1850 20 : }
1851 :
1852 : /* ABI issue #47: if a function template parameter is not "natural" for its
1853 : argument we must mangle the parameter. */
1854 :
1855 : static bool
1856 8608264 : template_parm_natural_p (tree arg, tree parm)
1857 : {
1858 8608264 : tree decl = TREE_VALUE (parm);
1859 :
1860 : /* A template parameter is "natural" if: */
1861 :
1862 8608264 : if (template_parameter_pack_p (decl))
1863 : {
1864 841748 : tree args = ARGUMENT_PACK_ARGS (arg);
1865 841748 : if (TREE_VEC_LENGTH (args) == 0)
1866 : {
1867 : #if 0
1868 : /* the argument is an empty pack and the parameter is an
1869 : unconstrained template type parameter pack; */
1870 : if (TREE_CODE (decl) != TYPE_DECL)
1871 : return false;
1872 : #else
1873 : /* Defer changing the mangling of C++11 code like
1874 : template <int i> int max();
1875 : template <int i, int j, int... rest> int max(); */
1876 : return true;
1877 : #endif
1878 : }
1879 : else
1880 : /* the argument is a non-empty pack and a non-pack variant of the
1881 : parameter would be natural for the first element of the pack; */
1882 659298 : arg = TREE_VEC_ELT (args, 0);
1883 : }
1884 :
1885 : /* the argument is a template and the parameter has the exact
1886 : same template head; */
1887 8425814 : if (TREE_CODE (decl) == TEMPLATE_DECL)
1888 9140 : return template_heads_equivalent_p (arg, decl);
1889 :
1890 : /* the argument is a type and the parameter is unconstrained; or */
1891 8416674 : else if (TREE_CODE (decl) == TYPE_DECL)
1892 7386265 : return !TEMPLATE_PARM_CONSTRAINTS (parm);
1893 :
1894 : /* the argument is a non-type template argument and the declared parameter
1895 : type neither is instantiation dependent nor contains deduced types. */
1896 1030409 : else if (TREE_CODE (decl) == PARM_DECL)
1897 : {
1898 : #if 0
1899 : return !uses_template_parms (TREE_TYPE (decl));
1900 : #else
1901 : /* Defer changing the mangling of C++98 code like
1902 : template <class T, T V> .... */
1903 1030409 : return !type_uses_auto (TREE_TYPE (decl));
1904 : #endif
1905 : }
1906 :
1907 0 : gcc_unreachable ();
1908 : }
1909 :
1910 : /* Used for lambda template head and non-natural function template parameters.
1911 :
1912 : <template-param-decl> ::= Ty # template type parameter
1913 : ::= Tk <type-constraint> # constrained type parameter
1914 : ::= Tn <type> # template non-type parameter
1915 : ::= Tt <template-param-decl>* [Q <constraint-expression] E # ttp
1916 : ::= Tp <non-pack template-param-decl> # template parameter pack */
1917 :
1918 : static void
1919 114602 : write_template_param_decl (tree parm)
1920 : {
1921 114602 : tree decl = TREE_VALUE (parm);
1922 :
1923 114602 : if (template_parameter_pack_p (decl))
1924 41221 : write_string ("Tp");
1925 :
1926 114602 : switch (TREE_CODE (decl))
1927 : {
1928 48069 : case PARM_DECL:
1929 48069 : {
1930 48069 : write_string ("Tn");
1931 :
1932 48069 : tree type = TREE_TYPE (decl);
1933 : /* TODO: We need to also mangle constrained auto*, auto&, etc, but
1934 : it's not clear how. See finish_constrained_parameter. */
1935 48069 : if (tree c = (is_auto (type)
1936 52366 : ? TEMPLATE_PARM_CONSTRAINTS (parm)
1937 4297 : : NULL_TREE))
1938 : {
1939 22 : if (TREE_CODE (c) == UNARY_LEFT_FOLD_EXPR)
1940 : {
1941 3 : c = FOLD_EXPR_PACK (c);
1942 3 : c = PACK_EXPANSION_PATTERN (c);
1943 : }
1944 22 : if (AUTO_IS_DECLTYPE (type))
1945 0 : write_string ("DK");
1946 : else
1947 22 : write_string ("Dk");
1948 22 : write_type_constraint (c);
1949 : }
1950 : else
1951 48047 : write_type (type);
1952 : }
1953 : break;
1954 :
1955 351 : case TEMPLATE_DECL:
1956 351 : {
1957 351 : write_string ("Tt");
1958 351 : tree parms = DECL_INNERMOST_TEMPLATE_PARMS (decl);
1959 812 : for (tree node : tree_vec_range (parms))
1960 461 : write_template_param_decl (node);
1961 351 : write_char ('E');
1962 : }
1963 351 : break;
1964 :
1965 66182 : case TYPE_DECL:
1966 66182 : if (tree c = TEMPLATE_PARM_CONSTRAINTS (parm))
1967 : {
1968 36535 : if (TREE_CODE (c) == UNARY_LEFT_FOLD_EXPR)
1969 : {
1970 70 : c = FOLD_EXPR_PACK (c);
1971 70 : c = PACK_EXPANSION_PATTERN (c);
1972 : }
1973 36535 : if (TREE_CODE (decl) == TYPE_DECL)
1974 : {
1975 36535 : write_string ("Tk");
1976 36535 : write_type_constraint (c);
1977 : }
1978 : }
1979 : else
1980 29647 : write_string ("Ty");
1981 : break;
1982 :
1983 0 : default:
1984 0 : gcc_unreachable ();
1985 : }
1986 114602 : }
1987 :
1988 : // A template head, for templated lambdas.
1989 : // New in ABI=18. Returns true iff we emitted anything -- used for ABI
1990 : // version warning.
1991 :
1992 : static bool
1993 516479 : write_closure_template_head (tree tmpl)
1994 : {
1995 516479 : bool any = false;
1996 :
1997 : // We only need one level of template parms
1998 516479 : tree parms = DECL_TEMPLATE_PARMS (tmpl);
1999 516479 : tree inner = INNERMOST_TEMPLATE_PARMS (parms);
2000 :
2001 589865 : for (int ix = 0, len = TREE_VEC_LENGTH (inner); ix != len; ix++)
2002 : {
2003 534867 : tree parm = TREE_VEC_ELT (inner, ix);
2004 534867 : if (parm == error_mark_node)
2005 0 : continue;
2006 :
2007 534867 : if (DECL_IMPLICIT_TEMPLATE_PARM_P (TREE_VALUE (parm)))
2008 : // A synthetic parm, we're done.
2009 : break;
2010 :
2011 73386 : any = true;
2012 73386 : if (abi_version_at_least (18))
2013 73146 : write_template_param_decl (parm);
2014 : }
2015 :
2016 516479 : write_tparms_constraints (TEMPLATE_PARMS_CONSTRAINTS (parms));
2017 :
2018 516479 : return any;
2019 : }
2020 :
2021 : /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
2022 : <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */
2023 :
2024 : static void
2025 2365875 : write_closure_type_name (const tree type)
2026 : {
2027 2365875 : tree fn = lambda_function (type);
2028 2365875 : tree lambda = CLASSTYPE_LAMBDA_EXPR (type);
2029 2365875 : tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
2030 :
2031 2365875 : MANGLE_TRACE_TREE ("closure-type-name", type);
2032 :
2033 2365875 : write_string ("Ul");
2034 :
2035 2365875 : if (auto ti = maybe_template_info (fn))
2036 516479 : if (write_closure_template_head (TI_TEMPLATE (ti)))
2037 : // If there were any explicit template parms, we may need to
2038 : // issue a mangling diagnostic.
2039 360490 : if (abi_warn_or_compat_version_crosses (18))
2040 198 : G.need_abi_warning = true;
2041 :
2042 2365875 : write_method_parms (parms, TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE, fn);
2043 2365875 : write_char ('E');
2044 2365875 : if ((LAMBDA_EXPR_SCOPE_SIG_DISCRIMINATOR (lambda)
2045 2365875 : != LAMBDA_EXPR_SCOPE_ONLY_DISCRIMINATOR (lambda))
2046 3205799 : && abi_warn_or_compat_version_crosses (18))
2047 288 : G.need_abi_warning = true;
2048 4731750 : write_compact_number (abi_version_at_least (18)
2049 2365353 : ? LAMBDA_EXPR_SCOPE_SIG_DISCRIMINATOR (lambda)
2050 522 : : LAMBDA_EXPR_SCOPE_ONLY_DISCRIMINATOR (lambda));
2051 2365875 : }
2052 :
2053 : /* Convert NUMBER to ascii using base BASE and generating at least
2054 : MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
2055 : into which to store the characters. Returns the number of
2056 : characters generated (these will be laid out in advance of where
2057 : BUFFER points). */
2058 :
2059 : static int
2060 1031559916 : hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
2061 : char *buffer, const unsigned int min_digits)
2062 : {
2063 1031559916 : static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
2064 1031559916 : unsigned digits = 0;
2065 :
2066 2566169945 : while (number)
2067 : {
2068 1534610029 : unsigned HOST_WIDE_INT d = number / base;
2069 :
2070 1534610029 : *--buffer = base_digits[number - d * base];
2071 1534610029 : digits++;
2072 1534610029 : number = d;
2073 : }
2074 1086323297 : while (digits < min_digits)
2075 : {
2076 54763381 : *--buffer = base_digits[0];
2077 54763381 : digits++;
2078 : }
2079 1031559916 : return digits;
2080 : }
2081 :
2082 : /* Non-terminal <number>.
2083 :
2084 : <number> ::= [n] </decimal integer/> */
2085 :
2086 : static void
2087 1031559616 : write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
2088 : const unsigned int base)
2089 : {
2090 1031559616 : char buffer[sizeof (HOST_WIDE_INT) * 8];
2091 1031559616 : unsigned count = 0;
2092 :
2093 1031559616 : if (!unsigned_p && (HOST_WIDE_INT) number < 0)
2094 : {
2095 0 : write_char ('n');
2096 0 : number = -((HOST_WIDE_INT) number);
2097 : }
2098 1031559616 : count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
2099 1031559616 : write_chars (buffer + sizeof (buffer) - count, count);
2100 1031559616 : }
2101 :
2102 : /* Write out an integral CST in decimal. Most numbers are small, and
2103 : representable in a HOST_WIDE_INT. Occasionally we'll have numbers
2104 : bigger than that, which we must deal with. */
2105 :
2106 : static inline void
2107 96885794 : write_integer_cst (const tree cst)
2108 : {
2109 96885794 : int sign = tree_int_cst_sgn (cst);
2110 96885794 : widest_int abs_value = wi::abs (wi::to_widest (cst));
2111 96885794 : if (!wi::fits_uhwi_p (abs_value))
2112 : {
2113 : /* A bignum. We do this in chunks, each of which fits in a
2114 : HOST_WIDE_INT. */
2115 100 : char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
2116 100 : unsigned HOST_WIDE_INT chunk;
2117 100 : unsigned chunk_digits;
2118 100 : char *ptr = buffer + sizeof (buffer);
2119 100 : unsigned count = 0;
2120 100 : tree n, base, type;
2121 100 : int done;
2122 :
2123 : /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
2124 : representable. */
2125 100 : chunk = 1000000000;
2126 100 : chunk_digits = 9;
2127 :
2128 100 : if (sizeof (HOST_WIDE_INT) >= 8)
2129 : {
2130 : /* It is at least 64 bits, so 10^18 is representable. */
2131 100 : chunk_digits = 18;
2132 100 : chunk *= chunk;
2133 : }
2134 :
2135 100 : type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
2136 100 : base = build_int_cstu (type, chunk);
2137 100 : n = wide_int_to_tree (type, wi::to_wide (cst));
2138 :
2139 100 : if (sign < 0)
2140 : {
2141 0 : write_char ('n');
2142 0 : n = fold_build1_loc (input_location, NEGATE_EXPR, type, n);
2143 : }
2144 300 : do
2145 : {
2146 300 : tree d = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, n, base);
2147 300 : tree tmp = fold_build2_loc (input_location, MULT_EXPR, type, d, base);
2148 300 : unsigned c;
2149 :
2150 300 : done = integer_zerop (d);
2151 300 : tmp = fold_build2_loc (input_location, MINUS_EXPR, type, n, tmp);
2152 400 : c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
2153 : done ? 1 : chunk_digits);
2154 300 : ptr -= c;
2155 300 : count += c;
2156 300 : n = d;
2157 : }
2158 300 : while (!done);
2159 100 : write_chars (ptr, count);
2160 : }
2161 : else
2162 : {
2163 : /* A small num. */
2164 96885694 : if (sign < 0)
2165 497411 : write_char ('n');
2166 96885694 : write_unsigned_number (abs_value.to_uhwi ());
2167 : }
2168 96885794 : }
2169 :
2170 : /* Write out a floating-point literal.
2171 :
2172 : "Floating-point literals are encoded using the bit pattern of the
2173 : target processor's internal representation of that number, as a
2174 : fixed-length lowercase hexadecimal string, high-order bytes first
2175 : (even if the target processor would store low-order bytes first).
2176 : The "n" prefix is not used for floating-point literals; the sign
2177 : bit is encoded with the rest of the number.
2178 :
2179 : Here are some examples, assuming the IEEE standard representation
2180 : for floating point numbers. (Spaces are for readability, not
2181 : part of the encoding.)
2182 :
2183 : 1.0f Lf 3f80 0000 E
2184 : -1.0f Lf bf80 0000 E
2185 : 1.17549435e-38f Lf 0080 0000 E
2186 : 1.40129846e-45f Lf 0000 0001 E
2187 : 0.0f Lf 0000 0000 E"
2188 :
2189 : Caller is responsible for the Lx and the E. */
2190 : static void
2191 2549 : write_real_cst (const tree value)
2192 : {
2193 2549 : long target_real[4]; /* largest supported float */
2194 : /* Buffer for eight hex digits in a 32-bit number but big enough
2195 : even for 64-bit long to avoid warnings. */
2196 2549 : char buffer[17];
2197 2549 : int i, limit, dir;
2198 :
2199 2549 : tree type = TREE_TYPE (value);
2200 2549 : int bits = GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type));
2201 2549 : int words = bits / 32;
2202 :
2203 2549 : real_to_target (target_real, &TREE_REAL_CST (value),
2204 2549 : TYPE_MODE (type));
2205 :
2206 2549 : if (words == 0)
2207 : {
2208 : /* _Float16 and std::bfloat16_t are the only supported types smaller than
2209 : 32 bits. */
2210 382 : gcc_assert (bits == 16);
2211 382 : sprintf (buffer, "%04lx", (unsigned long) target_real[0]);
2212 382 : write_chars (buffer, 4);
2213 382 : return;
2214 : }
2215 :
2216 2167 : gcc_assert (bits % 32 == 0);
2217 :
2218 : /* The value in target_real is in the target word order,
2219 : so we must write it out backward if that happens to be
2220 : little-endian. write_number cannot be used, it will
2221 : produce uppercase. */
2222 2167 : if (FLOAT_WORDS_BIG_ENDIAN)
2223 : i = 0, limit = words, dir = 1;
2224 : else
2225 2167 : i = words - 1, limit = -1, dir = -1;
2226 :
2227 2195 : if (GET_MODE_PRECISION (SCALAR_FLOAT_TYPE_MODE (type)) == 80
2228 2167 : && abi_check (21))
2229 : {
2230 : /* For -fabi-version=21 and above mangle
2231 : Intel/Motorola extended format 1.0L as
2232 : 3fff8000000000000000
2233 : rather than the previous
2234 : 0000000000003fff8000000000000000 (x86_64)
2235 : 00003fff8000000000000000 (ia32)
2236 : 3fff00008000000000000000 (m68k -mc68020)
2237 : i.e. without any embedded padding bits. */
2238 30 : if (words == 4)
2239 : i += dir;
2240 : else
2241 0 : gcc_assert (words == 3);
2242 30 : unsigned long val = (unsigned long) target_real[i];
2243 30 : if (REAL_MODE_FORMAT (SCALAR_FLOAT_TYPE_MODE (type))->signbit_ro == 95)
2244 0 : val >>= 16;
2245 30 : sprintf (buffer, "%04lx", val);
2246 30 : write_chars (buffer, 4);
2247 30 : i += dir;
2248 : }
2249 :
2250 6033 : for (; i != limit; i += dir)
2251 : {
2252 3866 : sprintf (buffer, "%08lx", (unsigned long) target_real[i]);
2253 3866 : write_chars (buffer, 8);
2254 : }
2255 : }
2256 :
2257 : /* Non-terminal <identifier>.
2258 :
2259 : <identifier> ::= </unqualified source code identifier> */
2260 :
2261 : static void
2262 764428880 : write_identifier (const char *identifier)
2263 : {
2264 764428880 : MANGLE_TRACE ("identifier", identifier);
2265 764428880 : write_string (identifier);
2266 764428880 : }
2267 :
2268 : /* Handle constructor productions of non-terminal <special-name>.
2269 : CTOR is a constructor FUNCTION_DECL.
2270 :
2271 : <special-name> ::= C1 # complete object constructor
2272 : ::= C2 # base object constructor
2273 : ::= C3 # complete object allocating constructor
2274 :
2275 : Currently, allocating constructors are never used. */
2276 :
2277 : static void
2278 30818072 : write_special_name_constructor (const tree ctor)
2279 : {
2280 30818072 : write_char ('C');
2281 30818072 : bool new_inh = (flag_new_inheriting_ctors
2282 61620417 : && DECL_INHERITED_CTOR (ctor));
2283 162648 : if (new_inh)
2284 162648 : write_char ('I');
2285 30818072 : if (DECL_BASE_CONSTRUCTOR_P (ctor))
2286 6354844 : write_char ('2');
2287 : /* This is the old-style "[unified]" constructor.
2288 : In some cases, we may emit this function and call
2289 : it from the clones in order to share code and save space. */
2290 24463228 : else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
2291 18111887 : write_char ('4');
2292 : else
2293 : {
2294 6351341 : gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor));
2295 6351341 : write_char ('1');
2296 : }
2297 30818072 : if (new_inh)
2298 325296 : write_type (DECL_INHERITED_CTOR_BASE (ctor));
2299 30818072 : }
2300 :
2301 : /* Handle destructor productions of non-terminal <special-name>.
2302 : DTOR is a destructor FUNCTION_DECL.
2303 :
2304 : <special-name> ::= D0 # deleting (in-charge) destructor
2305 : ::= D1 # complete object (in-charge) destructor
2306 : ::= D2 # base object (not-in-charge) destructor */
2307 :
2308 : static void
2309 7486747 : write_special_name_destructor (const tree dtor)
2310 : {
2311 7486747 : if (DECL_DELETING_DESTRUCTOR_P (dtor))
2312 632284 : write_string ("D0");
2313 6854463 : else if (DECL_BASE_DESTRUCTOR_P (dtor))
2314 1633692 : write_string ("D2");
2315 5220771 : else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor))
2316 : /* This is the old-style "[unified]" destructor.
2317 : In some cases, we may emit this function and call
2318 : it from the clones in order to share code and save space. */
2319 2979970 : write_string ("D4");
2320 : else
2321 : {
2322 2240801 : gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor));
2323 2240801 : write_string ("D1");
2324 : }
2325 7486747 : }
2326 :
2327 : /* Return the discriminator for ENTITY appearing inside
2328 : FUNCTION. The discriminator is the lexical ordinal of VAR or TYPE among
2329 : entities with the same name and kind in the same FUNCTION. */
2330 :
2331 : static int
2332 2857479 : discriminator_for_local_entity (tree entity)
2333 : {
2334 2857479 : if (!DECL_LANG_SPECIFIC (entity))
2335 : {
2336 : /* Some decls, like __FUNCTION__, don't need a discriminator. */
2337 31984 : gcc_checking_assert (DECL_ARTIFICIAL (entity));
2338 : return 0;
2339 : }
2340 5505522 : else if (tree disc = DECL_DISCRIMINATOR (entity))
2341 511 : return TREE_INT_CST_LOW (disc);
2342 : else
2343 : /* The first entity with a particular name doesn't get
2344 : DECL_DISCRIMINATOR set up. */
2345 : return 0;
2346 : }
2347 :
2348 : /* Return the discriminator for STRING, a string literal used inside
2349 : FUNCTION. The discriminator is the lexical ordinal of STRING among
2350 : string literals used in FUNCTION. */
2351 :
2352 : static int
2353 0 : discriminator_for_string_literal (tree /*function*/,
2354 : tree /*string*/)
2355 : {
2356 : /* For now, we don't discriminate amongst string literals. */
2357 0 : return 0;
2358 : }
2359 :
2360 : /* <discriminator> := _ <number> # when number < 10
2361 : := __ <number> _ # when number >= 10
2362 :
2363 : The discriminator is used only for the second and later occurrences
2364 : of the same name within a single function. In this case <number> is
2365 : n - 2, if this is the nth occurrence, in lexical order. */
2366 :
2367 : static void
2368 2857121 : write_discriminator (const int discriminator)
2369 : {
2370 : /* If discriminator is zero, don't write anything. Otherwise... */
2371 2857121 : if (discriminator > 0)
2372 : {
2373 478 : write_char ('_');
2374 478 : if (discriminator - 1 >= 10)
2375 : {
2376 6 : if (abi_check (11))
2377 6 : write_char ('_');
2378 : }
2379 478 : write_unsigned_number (discriminator - 1);
2380 478 : if (abi_version_at_least (11) && discriminator - 1 >= 10)
2381 6 : write_char ('_');
2382 : }
2383 2857121 : }
2384 :
2385 : /* Mangle the name of a function-scope entity. FUNCTION is the
2386 : FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in
2387 : default argument scope. ENTITY is the decl for the entity itself.
2388 : LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL,
2389 : either ENTITY itself or an enclosing scope of ENTITY.
2390 :
2391 : <local-name> := Z <function encoding> E <entity name> [<discriminator>]
2392 : := Z <function encoding> E s [<discriminator>]
2393 : := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */
2394 :
2395 : static void
2396 5151215 : write_local_name (tree function, const tree local_entity,
2397 : const tree entity)
2398 : {
2399 5151215 : tree parm = NULL_TREE;
2400 :
2401 5151215 : MANGLE_TRACE_TREE ("local-name", entity);
2402 :
2403 5151215 : if (TREE_CODE (function) == PARM_DECL)
2404 : {
2405 366 : parm = function;
2406 366 : function = DECL_CONTEXT (parm);
2407 : }
2408 :
2409 5151215 : write_char ('Z');
2410 5151215 : write_encoding (function);
2411 5151215 : write_char ('E');
2412 :
2413 : /* For this purpose, parameters are numbered from right-to-left. */
2414 5151215 : if (parm)
2415 : {
2416 366 : int i = list_length (parm);
2417 366 : write_char ('d');
2418 366 : write_compact_number (i - 1);
2419 : }
2420 :
2421 5151215 : if (TREE_CODE (entity) == STRING_CST)
2422 : {
2423 0 : write_char ('s');
2424 0 : write_discriminator (discriminator_for_string_literal (function,
2425 : entity));
2426 : }
2427 : else
2428 : {
2429 : /* Now the <entity name>. Let write_name know its being called
2430 : from <local-name>, so it doesn't try to process the enclosing
2431 : function scope again. */
2432 5151215 : write_name (entity, /*ignore_local_scope=*/1);
2433 5151215 : if (DECL_DISCRIMINATOR_P (local_entity)
2434 15275518 : && !(TREE_CODE (local_entity) == TYPE_DECL
2435 14920677 : && TYPE_ANON_P (TREE_TYPE (local_entity))))
2436 2856854 : write_discriminator (discriminator_for_local_entity (local_entity));
2437 : }
2438 5151215 : }
2439 :
2440 : /* Non-terminals <type> and <CV-qualifier>.
2441 :
2442 : <type> ::= <builtin-type>
2443 : ::= <function-type>
2444 : ::= <class-enum-type>
2445 : ::= <array-type>
2446 : ::= <pointer-to-member-type>
2447 : ::= <template-param>
2448 : ::= <substitution>
2449 : ::= <CV-qualifier>
2450 : ::= P <type> # pointer-to
2451 : ::= R <type> # reference-to
2452 : ::= C <type> # complex pair (C 2000)
2453 : ::= G <type> # imaginary (C 2000) [not supported]
2454 : ::= U <source-name> <type> # vendor extended type qualifier
2455 :
2456 : C++11 extensions
2457 :
2458 : <type> ::= RR <type> # rvalue reference-to
2459 : <type> ::= Dt <expression> # decltype of an id-expression or
2460 : # class member access
2461 : <type> ::= DT <expression> # decltype of an expression
2462 : <type> ::= Dn # decltype of nullptr
2463 : <type> ::= Dm # decltype of ^^int
2464 : <type> ::= <splice> # C++26 dependent splice [proposed]
2465 :
2466 : TYPE is a type node. */
2467 :
2468 : static void
2469 1306364865 : write_type (tree type)
2470 : {
2471 : /* This gets set to nonzero if TYPE turns out to be a (possibly
2472 : CV-qualified) builtin type. */
2473 1306364874 : int is_builtin_type = 0;
2474 :
2475 1306364874 : MANGLE_TRACE_TREE ("type", type);
2476 :
2477 1306364874 : if (type == error_mark_node)
2478 : return;
2479 :
2480 1306364859 : type = canonicalize_for_substitution (type);
2481 1306364859 : if (find_substitution (type))
2482 : return;
2483 :
2484 :
2485 1192179425 : if (write_CV_qualifiers_for_type (type) > 0)
2486 : /* If TYPE was CV-qualified, we just wrote the qualifiers; now
2487 : mangle the unqualified type. The recursive call is needed here
2488 : since both the qualified and unqualified types are substitution
2489 : candidates. */
2490 : {
2491 84170331 : tree t = TYPE_MAIN_VARIANT (type);
2492 84170331 : if (TYPE_ATTRIBUTES (t) && !OVERLOAD_TYPE_P (t))
2493 : {
2494 99 : tree attrs = NULL_TREE;
2495 99 : if (tx_safe_fn_type_p (type))
2496 3 : attrs = tree_cons (get_identifier ("transaction_safe"),
2497 : NULL_TREE, attrs);
2498 99 : t = cp_build_type_attribute_variant (t, attrs);
2499 : }
2500 84170331 : gcc_assert (t != type);
2501 84170331 : if (FUNC_OR_METHOD_TYPE_P (t))
2502 : {
2503 6725 : t = build_ref_qualified_type (t, type_memfn_rqual (type));
2504 6725 : if (flag_noexcept_type)
2505 : {
2506 6704 : tree r = TYPE_RAISES_EXCEPTIONS (type);
2507 6704 : t = build_exception_variant (t, r);
2508 : }
2509 6725 : if (abi_version_at_least (8)
2510 6749 : || type == TYPE_MAIN_VARIANT (type))
2511 : /* Avoid adding the unqualified function type as a substitution. */
2512 6701 : write_function_type (t);
2513 : else
2514 24 : write_type (t);
2515 33508 : if (abi_warn_or_compat_version_crosses (8))
2516 39 : G.need_abi_warning = 1;
2517 : }
2518 : else
2519 84163606 : write_type (t);
2520 : }
2521 1108009094 : else if (TREE_CODE (type) == ARRAY_TYPE)
2522 : /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here
2523 : so that the cv-qualification of the element type is available
2524 : in write_array_type. */
2525 1577649 : write_array_type (type);
2526 : else
2527 : {
2528 1106431445 : tree type_orig = type;
2529 :
2530 : /* See through any typedefs. */
2531 1106431445 : type = TYPE_MAIN_VARIANT (type);
2532 1106431445 : if (FUNC_OR_METHOD_TYPE_P (type))
2533 3311219 : type = cxx_copy_lang_qualifiers (type, type_orig);
2534 :
2535 : /* According to the C++ ABI, some library classes are passed the
2536 : same as the scalar type of their single member and use the same
2537 : mangling. */
2538 1106431445 : if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
2539 16206 : type = TREE_TYPE (first_field (type));
2540 :
2541 1106431445 : if (TYPE_PTRDATAMEM_P (type))
2542 17082 : write_pointer_to_member_type (type);
2543 : else
2544 : {
2545 : /* Handle any target-specific fundamental types. */
2546 1106414363 : const char *target_mangling
2547 1106414363 : = targetm.mangle_type (type_orig);
2548 :
2549 1106414363 : if (target_mangling)
2550 : {
2551 9858134 : write_string (target_mangling);
2552 : /* Add substitutions for types other than fundamental
2553 : types. */
2554 9858134 : if (!VOID_TYPE_P (type)
2555 : && TREE_CODE (type) != INTEGER_TYPE
2556 : && TREE_CODE (type) != REAL_TYPE
2557 : && TREE_CODE (type) != BOOLEAN_TYPE)
2558 0 : add_substitution (type);
2559 : return;
2560 : }
2561 :
2562 1096556229 : switch (TREE_CODE (type))
2563 : {
2564 590398091 : case VOID_TYPE:
2565 590398091 : case BOOLEAN_TYPE:
2566 590398091 : case INTEGER_TYPE: /* Includes wchar_t. */
2567 590398091 : case REAL_TYPE:
2568 590398091 : case FIXED_POINT_TYPE:
2569 590398091 : {
2570 : /* If this is a typedef, TYPE may not be one of
2571 : the standard builtin type nodes, but an alias of one. Use
2572 : TYPE_MAIN_VARIANT to get to the underlying builtin type. */
2573 590398091 : write_builtin_type (TYPE_MAIN_VARIANT (type));
2574 590398091 : ++is_builtin_type;
2575 : }
2576 590398091 : break;
2577 :
2578 689866 : case COMPLEX_TYPE:
2579 689866 : write_char ('C');
2580 689866 : write_type (TREE_TYPE (type));
2581 689866 : break;
2582 :
2583 3311219 : case FUNCTION_TYPE:
2584 3311219 : case METHOD_TYPE:
2585 3311219 : write_function_type (type);
2586 3311219 : break;
2587 :
2588 329191014 : case UNION_TYPE:
2589 329191014 : case RECORD_TYPE:
2590 329191014 : case ENUMERAL_TYPE:
2591 : /* A pointer-to-member function is represented as a special
2592 : RECORD_TYPE, so check for this first. */
2593 329191014 : if (TYPE_PTRMEMFUNC_P (type))
2594 268657 : write_pointer_to_member_type (type);
2595 : else
2596 328922357 : write_class_enum_type (type);
2597 : break;
2598 :
2599 2720810 : case TYPENAME_TYPE:
2600 2720810 : case UNBOUND_CLASS_TEMPLATE:
2601 : /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2602 : ordinary nested names. */
2603 2720810 : write_nested_name (TYPE_STUB_DECL (type));
2604 2720810 : break;
2605 :
2606 135940014 : case POINTER_TYPE:
2607 135940014 : case REFERENCE_TYPE:
2608 135940014 : if (TYPE_PTR_P (type))
2609 58552345 : write_char ('P');
2610 77387669 : else if (TYPE_REF_IS_RVALUE (type))
2611 13000028 : write_char ('O');
2612 : else
2613 64387641 : write_char ('R');
2614 135940014 : {
2615 135940014 : tree target = TREE_TYPE (type);
2616 : /* Attribute const/noreturn are not reflected in mangling.
2617 : We strip them here rather than at a lower level because
2618 : a typedef or template argument can have function type
2619 : with function-cv-quals (that use the same representation),
2620 : but you can't have a pointer/reference to such a type. */
2621 135940014 : if (TREE_CODE (target) == FUNCTION_TYPE)
2622 : {
2623 11377980 : if (abi_warn_or_compat_version_crosses (5)
2624 2275950 : && TYPE_QUALS (target) != TYPE_UNQUALIFIED)
2625 3 : G.need_abi_warning = 1;
2626 2275944 : if (abi_version_at_least (5))
2627 2275515 : target = build_qualified_type (target, TYPE_UNQUALIFIED);
2628 : }
2629 135940014 : write_type (target);
2630 : }
2631 135940014 : break;
2632 :
2633 29315702 : case TEMPLATE_TYPE_PARM:
2634 29315702 : if (is_auto (type))
2635 : {
2636 739785 : if (template_placeholder_p (type)
2637 739785 : && abi_check (19))
2638 : {
2639 : /* ABI #109: placeholder is mangled as its template. */
2640 33 : type = CLASS_PLACEHOLDER_TEMPLATE (type);
2641 33 : if (find_substitution (type))
2642 : return;
2643 33 : write_name (type, 0);
2644 33 : break;
2645 : }
2646 739752 : if (AUTO_IS_DECLTYPE (type))
2647 22768 : write_identifier ("Dc");
2648 : else
2649 716984 : write_identifier ("Da");
2650 : ++is_builtin_type;
2651 : break;
2652 : }
2653 : /* fall through. */
2654 28575917 : case TEMPLATE_PARM_INDEX:
2655 28575917 : write_template_param (type);
2656 28575917 : break;
2657 :
2658 93 : case TEMPLATE_TEMPLATE_PARM:
2659 93 : write_template_template_param (type);
2660 93 : break;
2661 :
2662 536 : case BOUND_TEMPLATE_TEMPLATE_PARM:
2663 536 : write_template_template_param (type);
2664 536 : write_template_args
2665 536 : (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type)));
2666 536 : break;
2667 :
2668 35207 : case VECTOR_TYPE:
2669 35207 : if (abi_version_at_least (4))
2670 : {
2671 35192 : write_string ("Dv");
2672 : /* Non-constant vector size would be encoded with
2673 : _ expression, but we don't support that yet. */
2674 35192 : write_unsigned_number (TYPE_VECTOR_SUBPARTS (type)
2675 : .to_constant ());
2676 35192 : write_char ('_');
2677 35192 : }
2678 : else
2679 15 : write_string ("U8__vector");
2680 175990 : if (abi_warn_or_compat_version_crosses (4))
2681 15 : G.need_abi_warning = 1;
2682 35207 : write_type (TREE_TYPE (type));
2683 35207 : break;
2684 :
2685 3475291 : case TYPE_PACK_EXPANSION:
2686 3475291 : write_string ("Dp");
2687 3475291 : write_type (PACK_EXPANSION_PATTERN (type));
2688 3475291 : break;
2689 :
2690 449948 : case DECLTYPE_TYPE:
2691 : /* These shouldn't make it into mangling. */
2692 449948 : gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type)
2693 : && !DECLTYPE_FOR_LAMBDA_PROXY (type));
2694 :
2695 : /* In ABI <5, we stripped decltype of a plain decl. */
2696 449948 : if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
2697 : {
2698 559 : tree expr = DECLTYPE_TYPE_EXPR (type);
2699 559 : tree etype = NULL_TREE;
2700 559 : switch (TREE_CODE (expr))
2701 : {
2702 119 : case VAR_DECL:
2703 119 : case PARM_DECL:
2704 119 : case RESULT_DECL:
2705 119 : case FUNCTION_DECL:
2706 119 : case CONST_DECL:
2707 119 : case TEMPLATE_PARM_INDEX:
2708 119 : etype = TREE_TYPE (expr);
2709 119 : break;
2710 :
2711 : default:
2712 : break;
2713 : }
2714 :
2715 119 : if (etype && !type_uses_auto (etype))
2716 : {
2717 117 : if (!abi_check (5))
2718 : {
2719 : write_type (etype);
2720 : return;
2721 : }
2722 : }
2723 : }
2724 :
2725 449939 : write_char ('D');
2726 449939 : if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
2727 550 : write_char ('t');
2728 : else
2729 449389 : write_char ('T');
2730 449939 : ++cp_unevaluated_operand;
2731 449939 : write_expression (DECLTYPE_TYPE_EXPR (type));
2732 449939 : --cp_unevaluated_operand;
2733 449939 : write_char ('E');
2734 449939 : break;
2735 :
2736 804179 : case NULLPTR_TYPE:
2737 804179 : write_string ("Dn");
2738 804179 : if (abi_check (7))
2739 : ++is_builtin_type;
2740 : break;
2741 :
2742 224158 : case META_TYPE:
2743 224158 : write_string ("Dm");
2744 224158 : ++is_builtin_type;
2745 224158 : break;
2746 :
2747 48 : case SPLICE_SCOPE:
2748 48 : write_splice (type);
2749 48 : break;
2750 :
2751 3 : case TYPEOF_TYPE:
2752 3 : sorry ("mangling %<typeof%>, use %<decltype%> instead");
2753 3 : break;
2754 :
2755 21 : case TRAIT_TYPE:
2756 21 : error ("use of built-in trait %qT in function signature; "
2757 : "use library traits instead", type);
2758 21 : break;
2759 :
2760 29 : case PACK_INDEX_TYPE:
2761 : /* https://github.com/itanium-cxx-abi/cxx-abi/issues/175. */
2762 29 : write_string ("Dy");
2763 29 : if (TREE_CODE (PACK_INDEX_PACK (type)) == TREE_VEC)
2764 : {
2765 6 : write_char ('J');
2766 40 : for (int i = 0; i < TREE_VEC_LENGTH (PACK_INDEX_PACK (type));
2767 : ++i)
2768 14 : write_template_arg (TREE_VEC_ELT (PACK_INDEX_PACK (type),
2769 : i));
2770 6 : write_char ('E');
2771 : }
2772 : else
2773 : /* Dy rather than DyDp. */
2774 23 : write_type (PACK_EXPANSION_PATTERN (PACK_INDEX_PACK (type)));
2775 29 : write_expression (PACK_INDEX_INDEX (type));
2776 29 : break;
2777 :
2778 0 : case LANG_TYPE:
2779 : /* fall through. */
2780 :
2781 0 : default:
2782 0 : gcc_unreachable ();
2783 : }
2784 : }
2785 : }
2786 :
2787 : /* Types other than builtin types are substitution candidates. */
2788 1181510417 : if (!is_builtin_type)
2789 590155104 : add_substitution (type);
2790 : }
2791 :
2792 : /* qsort callback for sorting a vector of attribute entries. */
2793 :
2794 : static int
2795 0 : attr_strcmp (const void *p1, const void *p2)
2796 : {
2797 0 : tree a1 = *(const tree*)p1;
2798 0 : tree a2 = *(const tree*)p2;
2799 :
2800 0 : const attribute_spec *as1 = lookup_attribute_spec (get_attribute_name (a1));
2801 0 : const attribute_spec *as2 = lookup_attribute_spec (get_attribute_name (a2));
2802 :
2803 0 : return strcmp (as1->name, as2->name);
2804 : }
2805 :
2806 : /* Return true if we should mangle a type attribute with name NAME. */
2807 :
2808 : static bool
2809 12538 : mangle_type_attribute_p (tree name)
2810 : {
2811 12538 : const attribute_spec *as = lookup_attribute_spec (name);
2812 12538 : if (!as || !as->affects_type_identity)
2813 : return false;
2814 :
2815 : /* Skip internal-only attributes, which are distinguished from others
2816 : by having a space. At present, all internal-only attributes that
2817 : affect type identity are target-specific and are handled by
2818 : targetm.mangle_type instead.
2819 :
2820 : Another reason to do this is that a space isn't a valid identifier
2821 : character for most file formats. */
2822 57 : if (strchr (IDENTIFIER_POINTER (name), ' '))
2823 : return false;
2824 :
2825 : /* The following attributes are mangled specially. */
2826 57 : if (is_attribute_p ("transaction_safe", name))
2827 : return false;
2828 33 : if (is_attribute_p ("abi_tag", name))
2829 0 : return false;
2830 :
2831 : return true;
2832 : }
2833 :
2834 : /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of
2835 : CV-qualifiers written for TYPE.
2836 :
2837 : <CV-qualifiers> ::= [r] [V] [K] */
2838 :
2839 : static int
2840 1192448082 : write_CV_qualifiers_for_type (const tree type)
2841 : {
2842 1192448082 : int num_qualifiers = 0;
2843 :
2844 : /* The order is specified by:
2845 :
2846 : "In cases where multiple order-insensitive qualifiers are
2847 : present, they should be ordered 'K' (closest to the base type),
2848 : 'V', 'r', and 'U' (farthest from the base type) ..." */
2849 :
2850 : /* Mangle attributes that affect type identity as extended qualifiers.
2851 :
2852 : We don't do this with classes and enums because their attributes
2853 : are part of their definitions, not something added on. */
2854 :
2855 1192448082 : if (!OVERLOAD_TYPE_P (type))
2856 : {
2857 827628340 : auto_vec<tree> vec;
2858 827640878 : for (tree a = TYPE_ATTRIBUTES (type); a; a = TREE_CHAIN (a))
2859 12538 : if (mangle_type_attribute_p (get_attribute_name (a)))
2860 33 : vec.safe_push (a);
2861 4137381477 : if (abi_warn_or_compat_version_crosses (10) && !vec.is_empty ())
2862 0 : G.need_abi_warning = true;
2863 827628340 : if (abi_version_at_least (10))
2864 : {
2865 827379683 : vec.qsort (attr_strcmp);
2866 827628406 : while (!vec.is_empty())
2867 : {
2868 33 : tree a = vec.pop();
2869 33 : const attribute_spec *as
2870 33 : = lookup_attribute_spec (get_attribute_name (a));
2871 :
2872 33 : write_char ('U');
2873 33 : write_unsigned_number (strlen (as->name));
2874 33 : write_string (as->name);
2875 33 : if (TREE_VALUE (a))
2876 : {
2877 3 : write_char ('I');
2878 6 : for (tree args = TREE_VALUE (a); args;
2879 3 : args = TREE_CHAIN (args))
2880 : {
2881 3 : tree arg = TREE_VALUE (args);
2882 3 : write_template_arg (arg);
2883 : }
2884 3 : write_char ('E');
2885 : }
2886 :
2887 33 : ++num_qualifiers;
2888 : }
2889 : }
2890 827628340 : }
2891 :
2892 : /* Note that we do not use cp_type_quals below; given "const
2893 : int[3]", the "const" is emitted with the "int", not with the
2894 : array. */
2895 1192448082 : cp_cv_quals quals = TYPE_QUALS (type);
2896 :
2897 1192448082 : if (quals & TYPE_QUAL_RESTRICT)
2898 : {
2899 43 : write_char ('r');
2900 43 : ++num_qualifiers;
2901 : }
2902 1192448082 : if (quals & TYPE_QUAL_VOLATILE)
2903 : {
2904 550863 : write_char ('V');
2905 550863 : ++num_qualifiers;
2906 : }
2907 1192448082 : if (quals & TYPE_QUAL_CONST)
2908 : {
2909 84099834 : write_char ('K');
2910 84099834 : ++num_qualifiers;
2911 : }
2912 :
2913 1192448082 : return num_qualifiers;
2914 : }
2915 :
2916 : /* Non-terminal <builtin-type>.
2917 :
2918 : <builtin-type> ::= v # void
2919 : ::= b # bool
2920 : ::= w # wchar_t
2921 : ::= c # char
2922 : ::= a # signed char
2923 : ::= h # unsigned char
2924 : ::= s # short
2925 : ::= t # unsigned short
2926 : ::= i # int
2927 : ::= j # unsigned int
2928 : ::= l # long
2929 : ::= m # unsigned long
2930 : ::= x # long long, __int64
2931 : ::= y # unsigned long long, __int64
2932 : ::= n # __int128
2933 : ::= o # unsigned __int128
2934 : ::= f # float
2935 : ::= d # double
2936 : ::= e # long double, __float80
2937 : ::= g # __float128 [not supported]
2938 : ::= u <source-name> # vendor extended type */
2939 :
2940 : static void
2941 590398091 : write_builtin_type (tree type)
2942 : {
2943 590398091 : if (TYPE_CANONICAL (type))
2944 590398091 : type = TYPE_CANONICAL (type);
2945 :
2946 590398091 : switch (TREE_CODE (type))
2947 : {
2948 79621733 : case VOID_TYPE:
2949 79621733 : write_char ('v');
2950 79621733 : break;
2951 :
2952 50584382 : case BOOLEAN_TYPE:
2953 50584382 : write_char ('b');
2954 50584382 : break;
2955 :
2956 441633586 : case INTEGER_TYPE:
2957 : /* TYPE may still be wchar_t, char8_t, char16_t, or char32_t, since that
2958 : isn't in integer_type_nodes. */
2959 441633586 : if (type == wchar_type_node)
2960 44354483 : write_char ('w');
2961 397279103 : else if (type == char8_type_node)
2962 23389487 : write_string ("Du");
2963 373889616 : else if (type == char16_type_node)
2964 23139097 : write_string ("Ds");
2965 350750519 : else if (type == char32_type_node)
2966 25813495 : write_string ("Di");
2967 : else
2968 : {
2969 324937038 : size_t itk;
2970 : /* Assume TYPE is one of the shared integer type nodes. Find
2971 : it in the array of these nodes. */
2972 324937024 : iagain:
2973 2062384306 : for (itk = 0; itk < itk_none; ++itk)
2974 2060810790 : if (integer_types[itk] != NULL_TREE
2975 2051369694 : && integer_type_codes[itk] != '\0'
2976 2048222662 : && type == integer_types[itk])
2977 : {
2978 : /* Print the corresponding single-letter code. */
2979 323363522 : write_char (integer_type_codes[itk]);
2980 323363522 : break;
2981 : }
2982 :
2983 324937038 : if (itk == itk_none)
2984 : {
2985 1573516 : tree t = c_common_type_for_mode (TYPE_MODE (type),
2986 1573516 : TYPE_UNSIGNED (type));
2987 1573516 : if (type != t)
2988 : {
2989 14 : type = t;
2990 14 : goto iagain;
2991 : }
2992 :
2993 1573502 : if (TYPE_PRECISION (type) == 128)
2994 2202861 : write_char (TYPE_UNSIGNED (type) ? 'o' : 'n');
2995 : else
2996 : {
2997 : /* Allow for cases where TYPE is not one of the shared
2998 : integer type nodes and write a "vendor extended builtin
2999 : type" with a name the form intN or uintN, respectively.
3000 : Situations like this can happen if you have an
3001 : __attribute__((__mode__(__SI__))) type and use exotic
3002 : switches like '-mint8' on AVR. Of course, this is
3003 : undefined by the C++ ABI (and '-mint8' is not even
3004 : Standard C conforming), but when using such special
3005 : options you're pretty much in nowhere land anyway. */
3006 0 : const char *prefix;
3007 0 : char prec[11]; /* up to ten digits for an unsigned */
3008 :
3009 0 : prefix = TYPE_UNSIGNED (type) ? "uint" : "int";
3010 0 : sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type));
3011 0 : write_char ('u'); /* "vendor extended builtin type" */
3012 0 : write_unsigned_number (strlen (prefix) + strlen (prec));
3013 0 : write_string (prefix);
3014 0 : write_string (prec);
3015 : }
3016 : }
3017 : }
3018 : break;
3019 :
3020 18558390 : case REAL_TYPE:
3021 18558390 : if (type == float_type_node)
3022 6030859 : write_char ('f');
3023 12527531 : else if (type == double_type_node)
3024 10048062 : write_char ('d');
3025 2479469 : else if (type == long_double_type_node)
3026 0 : write_char ('e');
3027 2479469 : else if (type == dfloat32_type_node)
3028 6152 : write_string ("Df");
3029 2473317 : else if (type == dfloat64_type_node)
3030 6041 : write_string ("Dd");
3031 2467276 : else if (type == dfloat128_type_node)
3032 6008 : write_string ("De");
3033 2461268 : else if (type == float16_type_node)
3034 0 : write_string ("DF16_");
3035 2461268 : else if (type == float32_type_node)
3036 813209 : write_string ("DF32_");
3037 1648059 : else if (type == float64_type_node)
3038 814953 : write_string ("DF64_");
3039 833106 : else if (type == float128_type_node)
3040 773518 : write_string ("DF128_");
3041 59588 : else if (type == float32x_type_node)
3042 29794 : write_string ("DF32x");
3043 29794 : else if (type == float64x_type_node)
3044 29794 : write_string ("DF64x");
3045 0 : else if (type == float128x_type_node)
3046 0 : write_string ("DF128x");
3047 0 : else if (type == bfloat16_type_node)
3048 0 : write_string ("DF16b");
3049 : else
3050 0 : gcc_unreachable ();
3051 : break;
3052 :
3053 0 : default:
3054 0 : gcc_unreachable ();
3055 : }
3056 590398091 : }
3057 :
3058 : /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or
3059 : METHOD_TYPE. The return type is mangled before the parameter
3060 : types.
3061 :
3062 : <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */
3063 :
3064 : static void
3065 3317920 : write_function_type (const tree type)
3066 : {
3067 3317920 : MANGLE_TRACE_TREE ("function-type", type);
3068 :
3069 : /* For a pointer to member function, the function type may have
3070 : cv-qualifiers, indicating the quals for the artificial 'this'
3071 : parameter. */
3072 3317920 : if (TREE_CODE (type) == METHOD_TYPE)
3073 : {
3074 : /* The first parameter must be a POINTER_TYPE pointing to the
3075 : `this' parameter. */
3076 268657 : tree this_type = class_of_this_parm (type);
3077 268657 : write_CV_qualifiers_for_type (this_type);
3078 : }
3079 :
3080 3317920 : write_exception_spec (TYPE_RAISES_EXCEPTIONS (type));
3081 :
3082 3317920 : if (tx_safe_fn_type_p (type))
3083 24 : write_string ("Dx");
3084 :
3085 3317920 : write_char ('F');
3086 : /* We don't track whether or not a type is `extern "C"'. Note that
3087 : you can have an `extern "C"' function that does not have
3088 : `extern "C"' type, and vice versa:
3089 :
3090 : extern "C" typedef void function_t();
3091 : function_t f; // f has C++ linkage, but its type is
3092 : // `extern "C"'
3093 :
3094 : typedef void function_t();
3095 : extern "C" function_t f; // Vice versa.
3096 :
3097 : See [dcl.link]. */
3098 3317920 : write_bare_function_type (type, /*include_return_type_p=*/1,
3099 : /*decl=*/NULL);
3100 3317920 : if (FUNCTION_REF_QUALIFIED (type))
3101 : {
3102 2156 : if (FUNCTION_RVALUE_QUALIFIED (type))
3103 865 : write_char ('O');
3104 : else
3105 1291 : write_char ('R');
3106 : }
3107 3317920 : write_char ('E');
3108 3317920 : }
3109 :
3110 : /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or
3111 : METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value
3112 : is mangled before the parameter types. If non-NULL, DECL is
3113 : FUNCTION_DECL for the function whose type is being emitted. */
3114 :
3115 : static void
3116 197409224 : write_bare_function_type (const tree type, const int include_return_type_p,
3117 : const tree decl)
3118 : {
3119 197409224 : MANGLE_TRACE_TREE ("bare-function-type", type);
3120 :
3121 : /* Mangle the return type, if requested. */
3122 197409224 : if (include_return_type_p)
3123 17729053 : write_type (TREE_TYPE (type));
3124 :
3125 : /* Now mangle the types of the arguments. */
3126 197409224 : ++G.parm_depth;
3127 197409224 : write_method_parms (TYPE_ARG_TYPES (type),
3128 197409224 : TREE_CODE (type) == METHOD_TYPE,
3129 : decl);
3130 197409224 : --G.parm_depth;
3131 197409224 : }
3132 :
3133 : /* Write the mangled representation of a method parameter list of
3134 : types given in PARM_TYPES. If METHOD_P is nonzero, the function is
3135 : considered a non-static method, and the this parameter is omitted.
3136 : If non-NULL, DECL is the FUNCTION_DECL for the function whose
3137 : parameters are being emitted. */
3138 :
3139 : static void
3140 199775099 : write_method_parms (tree parm_types, const int method_p, const tree decl)
3141 : {
3142 199775099 : tree first_parm_type;
3143 378832733 : tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE;
3144 :
3145 : /* Assume this parameter type list is variable-length. If it ends
3146 : with a void type, then it's not. */
3147 199775099 : int varargs_p = 1;
3148 :
3149 : /* If this is a member function, skip the first arg, which is the
3150 : this pointer.
3151 : "Member functions do not encode the type of their implicit this
3152 : parameter."
3153 :
3154 : Similarly, there's no need to mangle artificial parameters, like
3155 : the VTT parameters for constructors and destructors. */
3156 199775099 : if (method_p)
3157 : {
3158 155863277 : parm_types = TREE_CHAIN (parm_types);
3159 155863277 : parm_decl = parm_decl ? DECL_CHAIN (parm_decl) : NULL_TREE;
3160 :
3161 155906153 : while (parm_decl && DECL_ARTIFICIAL (parm_decl))
3162 : {
3163 42876 : parm_types = TREE_CHAIN (parm_types);
3164 42876 : parm_decl = DECL_CHAIN (parm_decl);
3165 : }
3166 :
3167 155863277 : if (decl && ctor_omit_inherited_parms (decl))
3168 : /* Bring back parameters omitted from an inherited ctor. */
3169 54 : parm_types = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl));
3170 : }
3171 :
3172 199775099 : for (first_parm_type = parm_types;
3173 624969310 : parm_types;
3174 425194211 : parm_types = TREE_CHAIN (parm_types))
3175 : {
3176 425194211 : tree parm = TREE_VALUE (parm_types);
3177 425194211 : if (parm == void_type_node)
3178 : {
3179 : /* "Empty parameter lists, whether declared as () or
3180 : conventionally as (void), are encoded with a void parameter
3181 : (v)." */
3182 199729745 : if (parm_types == first_parm_type)
3183 66904795 : write_type (parm);
3184 : /* If the parm list is terminated with a void type, it's
3185 : fixed-length. */
3186 199729745 : varargs_p = 0;
3187 : /* A void type better be the last one. */
3188 199729745 : gcc_assert (TREE_CHAIN (parm_types) == NULL);
3189 : }
3190 : else
3191 225464466 : write_type (parm);
3192 : }
3193 :
3194 199775099 : if (varargs_p)
3195 : /* <builtin-type> ::= z # ellipsis */
3196 45354 : write_char ('z');
3197 199775099 : }
3198 :
3199 : /* <class-enum-type> ::= <name> */
3200 :
3201 : static void
3202 328922357 : write_class_enum_type (const tree type)
3203 : {
3204 328922357 : write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
3205 328922357 : }
3206 :
3207 : /* Mangle a requirement REQ in a requires-expression. */
3208 :
3209 : static void
3210 561893 : write_requirement (tree req)
3211 : {
3212 561893 : tree op = TREE_OPERAND (req, 0);
3213 :
3214 561893 : switch (tree_code code = TREE_CODE (req))
3215 : {
3216 : /* # simple-requirement or compound-requirement
3217 : <requirement> ::= X <expression> [ N ] [ R <type-constraint> ]
3218 : X <expression> C <expression>
3219 : [ R <type-constraint> ] */
3220 561460 : case SIMPLE_REQ:
3221 561460 : case COMPOUND_REQ:
3222 561460 : write_char ('X');
3223 561460 : write_expression (op);
3224 561460 : if (code == SIMPLE_REQ)
3225 : break;
3226 108477 : if (operand_equal_p (TREE_OPERAND (req, 2), boolean_true_node))
3227 15 : write_char ('N');
3228 108462 : else if (TREE_OPERAND (req, 2) != error_mark_node
3229 108462 : && !operand_equal_p (TREE_OPERAND (req, 2), boolean_false_node))
3230 : {
3231 6 : write_char ('C');
3232 6 : write_expression (TREE_OPERAND (req, 2));
3233 : }
3234 108477 : if (tree constr = TREE_OPERAND (req, 1))
3235 : {
3236 108462 : write_char ('R');
3237 108462 : write_type_constraint (PLACEHOLDER_TYPE_CONSTRAINTS (constr));
3238 : }
3239 : break;
3240 :
3241 : /* <requirement> ::= T <type> # type-requirement */
3242 427 : case TYPE_REQ:
3243 427 : write_char ('T');
3244 427 : write_type (op);
3245 427 : break;
3246 :
3247 : /* <requirement> ::= Q <constraint-expression> # nested-requirement */
3248 6 : case NESTED_REQ:
3249 6 : write_char ('Q');
3250 6 : write_constraint_expression (op);
3251 6 : break;
3252 :
3253 0 : default:
3254 0 : gcc_unreachable ();
3255 : }
3256 561893 : }
3257 :
3258 : /* # requires { ... }
3259 : <expression> ::= rq <requirement>+ E
3260 : # requires (...) { ... }
3261 : <expression> ::= rQ <bare-function-type> _ <requirement>+ E */
3262 :
3263 : static void
3264 533986 : write_requires_expr (tree expr)
3265 : {
3266 533986 : tree parms = REQUIRES_EXPR_PARMS (expr);
3267 533986 : if (parms)
3268 : {
3269 91656 : write_string ("rQ");
3270 91656 : ++G.parm_depth;
3271 183761 : for (; parms; parms = DECL_CHAIN (parms))
3272 92105 : write_type (cv_unqualified (TREE_TYPE (parms)));
3273 91656 : --G.parm_depth;
3274 91656 : write_char ('_');
3275 : }
3276 : else
3277 442330 : write_string ("rq");
3278 :
3279 1095879 : for (tree reqs = REQUIRES_EXPR_REQS (expr); reqs;
3280 561893 : reqs = TREE_CHAIN (reqs))
3281 561893 : write_requirement (TREE_VALUE (reqs));
3282 :
3283 533986 : write_char ('E');
3284 533986 : }
3285 :
3286 : /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
3287 : arguments.
3288 :
3289 : <template-args> ::= I <template-arg>* [Q <constraint-expr>] E */
3290 :
3291 : static void
3292 424536369 : write_template_args (tree args, tree parms /*= NULL_TREE*/)
3293 : {
3294 424536369 : int i;
3295 424536369 : int length = 0;
3296 :
3297 424536369 : MANGLE_TRACE_TREE ("template-args", args);
3298 :
3299 424536369 : write_char ('I');
3300 :
3301 424536369 : if (args)
3302 424536369 : length = TREE_VEC_LENGTH (args);
3303 :
3304 424536369 : tree constraints = NULL_TREE;
3305 424536369 : if (parms)
3306 : {
3307 4974333 : constraints = TEMPLATE_PARMS_CONSTRAINTS (parms);
3308 4974333 : parms = INNERMOST_TEMPLATE_PARMS (parms);
3309 : }
3310 :
3311 424536369 : if (args && length && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
3312 : {
3313 : /* We have nested template args. We want the innermost template
3314 : argument list. */
3315 6235920 : args = TREE_VEC_ELT (args, length - 1);
3316 6235920 : length = TREE_VEC_LENGTH (args);
3317 : }
3318 424536369 : if (TEMPLATE_ARGS_TYPE_CONSTRAINT_P (args))
3319 : /* Skip the constrained type. */
3320 : i = 1;
3321 : else
3322 424483496 : i = 0;
3323 424536369 : bool implicit_parm_scope = false;
3324 1180041186 : for (; i < length; ++i)
3325 : {
3326 755504817 : tree arg = TREE_VEC_ELT (args, i);
3327 755504817 : if (parms)
3328 : {
3329 8608264 : tree parm = TREE_VEC_ELT (parms, i);
3330 8608264 : tree decl = TREE_VALUE (parm);
3331 8608264 : if (DECL_IMPLICIT_TEMPLATE_PARM_P (decl)
3332 8608264 : && !implicit_parm_scope)
3333 : {
3334 : /* The rest of the template parameters are based on generic
3335 : function parameters, so any expressions in their
3336 : type-constraints are in parameter scope. */
3337 9653 : implicit_parm_scope = true;
3338 9653 : ++G.parm_depth;
3339 : }
3340 8608264 : if (!template_parm_natural_p (arg, parm)
3341 8608264 : && abi_check (19))
3342 40995 : write_template_param_decl (parm);
3343 : }
3344 755504817 : write_template_arg (arg);
3345 : }
3346 424536369 : if (implicit_parm_scope)
3347 9653 : --G.parm_depth;
3348 :
3349 424536369 : write_tparms_constraints (constraints);
3350 :
3351 424536369 : write_char ('E');
3352 424536369 : }
3353 :
3354 : /* Write out the
3355 : <unqualified-name>
3356 : <unqualified-name> <template-args>
3357 : part of SCOPE_REF or COMPONENT_REF mangling. */
3358 :
3359 : static void
3360 512743 : write_member_name (tree member)
3361 : {
3362 512743 : if (identifier_p (member))
3363 : {
3364 373974 : if (IDENTIFIER_ANY_OP_P (member))
3365 : {
3366 54011 : if (abi_check (11))
3367 53987 : write_string ("on");
3368 : }
3369 373974 : write_unqualified_id (member);
3370 : }
3371 138769 : else if (DECL_P (member))
3372 : {
3373 1296 : if (ANON_AGGR_TYPE_P (TREE_TYPE (member)))
3374 : ;
3375 1290 : else if (DECL_OVERLOADED_OPERATOR_P (member))
3376 : {
3377 15 : if (abi_check (16))
3378 9 : write_string ("on");
3379 : }
3380 1296 : write_unqualified_name (member);
3381 : }
3382 137473 : else if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
3383 : {
3384 271 : tree name = TREE_OPERAND (member, 0);
3385 271 : name = OVL_FIRST (name);
3386 271 : write_member_name (name);
3387 271 : write_template_args (TREE_OPERAND (member, 1));
3388 : }
3389 : else
3390 137202 : write_expression (member);
3391 512743 : }
3392 :
3393 : /* EXPR is a base COMPONENT_REF; write the minimized base conversion path for
3394 : converting to BASE, or just the conversion of EXPR if BASE is null.
3395 :
3396 : "Given a fully explicit base path P := C_n -> ... -> C_0, the minimized base
3397 : path Min(P) is defined as follows: let C_i be the last element for which the
3398 : conversion to C_0 is unambiguous; if that element is C_n, the minimized path
3399 : is C_n -> C_0; otherwise, the minimized path is Min(C_n -> ... -> C_i) ->
3400 : C_0."
3401 :
3402 : We mangle the conversion to C_i if it's different from C_n. */
3403 :
3404 : static bool
3405 199822 : write_base_ref (tree expr, tree base = NULL_TREE)
3406 : {
3407 199822 : if (TREE_CODE (expr) != COMPONENT_REF)
3408 : return false;
3409 :
3410 199816 : tree field = TREE_OPERAND (expr, 1);
3411 :
3412 199816 : if (TREE_CODE (field) != FIELD_DECL || !DECL_FIELD_IS_BASE (field))
3413 : return false;
3414 :
3415 18 : tree object = TREE_OPERAND (expr, 0);
3416 :
3417 18 : tree binfo = NULL_TREE;
3418 18 : if (base)
3419 : {
3420 9 : tree cur = TREE_TYPE (object);
3421 9 : binfo = lookup_base (cur, base, ba_unique, NULL, tf_none);
3422 : }
3423 : else
3424 : /* We're at the end of the base conversion chain, so it can't be
3425 : ambiguous. */
3426 9 : base = TREE_TYPE (field);
3427 :
3428 18 : if (binfo == error_mark_node)
3429 : {
3430 : /* cur->base is ambiguous, so make the conversion to
3431 : last explicit, expressed as a cast (last&)object. */
3432 3 : tree last = TREE_TYPE (expr);
3433 3 : write_string (OVL_OP_INFO (false, CAST_EXPR)->mangled_name);
3434 3 : write_type (build_reference_type (last));
3435 3 : write_expression (object);
3436 : }
3437 15 : else if (write_base_ref (object, base))
3438 : /* cur->base is unambiguous, but we had another base conversion
3439 : underneath and wrote it out. */;
3440 : else
3441 : /* No more base conversions, just write out the object. */
3442 6 : write_expression (object);
3443 :
3444 : return true;
3445 : }
3446 :
3447 : /* The number of elements spanned by a RANGE_EXPR. */
3448 :
3449 : unsigned HOST_WIDE_INT
3450 24 : range_expr_nelts (tree expr)
3451 : {
3452 24 : tree lo = TREE_OPERAND (expr, 0);
3453 24 : tree hi = TREE_OPERAND (expr, 1);
3454 24 : return tree_to_uhwi (hi) - tree_to_uhwi (lo) + 1;
3455 : }
3456 :
3457 : /* <expression> ::= <unary operator-name> <expression>
3458 : ::= <binary operator-name> <expression> <expression>
3459 : ::= <expr-primary>
3460 :
3461 : <expr-primary> ::= <template-param>
3462 : ::= L <type> <value number> E # literal
3463 : ::= L <mangled-name> E # external name
3464 : ::= st <type> # sizeof
3465 : ::= sr <type> <unqualified-name> # dependent name
3466 : ::= sr <type> <unqualified-name> <template-args>
3467 : ::= L Dm <value reflection> E # C++26 reflection
3468 : # value [proposed]
3469 : ::= <splice> # C++26 dependent splice [proposed] */
3470 :
3471 : static void
3472 12632590 : write_expression (tree expr)
3473 : {
3474 13069266 : enum tree_code code = TREE_CODE (expr);
3475 :
3476 13069266 : if (TREE_CODE (expr) == TARGET_EXPR)
3477 : {
3478 0 : expr = TARGET_EXPR_INITIAL (expr);
3479 0 : code = TREE_CODE (expr);
3480 : }
3481 :
3482 : /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
3483 : argument is converted (via qualification conversions) to another type. */
3484 13637732 : while (CONVERT_EXPR_CODE_P (code)
3485 13515425 : || code == IMPLICIT_CONV_EXPR
3486 13515293 : || location_wrapper_p (expr)
3487 : /* Parentheses aren't mangled. */
3488 13069632 : || code == PAREN_EXPR
3489 13069632 : || code == NON_LVALUE_EXPR
3490 26707364 : || (code == VIEW_CONVERT_EXPR
3491 366 : && TREE_CODE (TREE_OPERAND (expr, 0)) == TEMPLATE_PARM_INDEX))
3492 : {
3493 568466 : expr = TREE_OPERAND (expr, 0);
3494 568466 : code = TREE_CODE (expr);
3495 : }
3496 :
3497 13069266 : if (code == BASELINK
3498 13069266 : && (!type_unknown_p (expr)
3499 770202 : || !BASELINK_QUALIFIED_P (expr)))
3500 : {
3501 787455 : expr = BASELINK_FUNCTIONS (expr);
3502 787455 : code = TREE_CODE (expr);
3503 : }
3504 :
3505 : /* Handle pointers-to-members by making them look like expression
3506 : nodes. */
3507 13069266 : if (code == PTRMEM_CST)
3508 : {
3509 7790 : expr = build_nt (ADDR_EXPR,
3510 : build_qualified_name (/*type=*/NULL_TREE,
3511 3895 : PTRMEM_CST_CLASS (expr),
3512 3895 : PTRMEM_CST_MEMBER (expr),
3513 : /*template_p=*/false));
3514 3895 : code = TREE_CODE (expr);
3515 : }
3516 :
3517 : /* Handle template parameters. */
3518 13069266 : if (code == TEMPLATE_TYPE_PARM
3519 13069266 : || code == TEMPLATE_TEMPLATE_PARM
3520 13069266 : || code == BOUND_TEMPLATE_TEMPLATE_PARM
3521 13065260 : || code == TEMPLATE_PARM_INDEX)
3522 787595 : write_template_param (expr);
3523 : /* Handle literals. */
3524 12281671 : else if (TREE_CODE_CLASS (code) == tcc_constant
3525 11898624 : || code == CONST_DECL
3526 11898624 : || code == REFLECT_EXPR)
3527 407633 : write_template_arg_literal (expr);
3528 11874038 : else if (code == EXCESS_PRECISION_EXPR
3529 11874038 : && TREE_CODE (TREE_OPERAND (expr, 0)) == REAL_CST)
3530 0 : write_template_arg_literal (fold_convert (TREE_TYPE (expr),
3531 : TREE_OPERAND (expr, 0)));
3532 11874038 : else if (code == PARM_DECL && DECL_ARTIFICIAL (expr))
3533 : {
3534 121374 : gcc_assert (id_equal (DECL_NAME (expr), "this"));
3535 121374 : write_string ("fpT");
3536 : }
3537 11752664 : else if (code == PARM_DECL)
3538 : {
3539 : /* A function parameter used in a late-specified return type. */
3540 361405 : int index = DECL_PARM_INDEX (expr);
3541 361405 : int level = DECL_PARM_LEVEL (expr);
3542 361405 : int delta = G.parm_depth - level + 1;
3543 361405 : gcc_assert (index >= 1);
3544 361405 : write_char ('f');
3545 361405 : if (delta != 0)
3546 : {
3547 173120 : gcc_checking_assert (delta > 0);
3548 173120 : if (abi_check (5))
3549 : {
3550 : /* Let L be the number of function prototype scopes from the
3551 : innermost one (in which the parameter reference occurs) up
3552 : to (and including) the one containing the declaration of
3553 : the referenced parameter. If the parameter declaration
3554 : clause of the innermost function prototype scope has been
3555 : completely seen, it is not counted (in that case -- which
3556 : is perhaps the most common -- L can be zero). */
3557 173117 : write_char ('L');
3558 173117 : write_unsigned_number (delta - 1);
3559 : }
3560 : }
3561 361405 : write_char ('p');
3562 361405 : write_compact_number (index - 1);
3563 : }
3564 11391259 : else if (DECL_P (expr))
3565 : {
3566 378207 : write_char ('L');
3567 378207 : write_mangled_name (expr, false);
3568 378207 : write_char ('E');
3569 : }
3570 11013052 : else if (TREE_CODE (expr) == SIZEOF_EXPR)
3571 : {
3572 6706 : tree op = TREE_OPERAND (expr, 0);
3573 :
3574 6706 : if (PACK_EXPANSION_P (op))
3575 : {
3576 5454 : sizeof_pack:
3577 5457 : if (abi_check (11))
3578 : {
3579 : /* sZ rather than szDp. */
3580 5448 : write_string ("sZ");
3581 5448 : write_expression (PACK_EXPANSION_PATTERN (op));
3582 : return;
3583 : }
3584 : }
3585 :
3586 1261 : if (SIZEOF_EXPR_TYPE_P (expr))
3587 : {
3588 0 : write_string ("st");
3589 0 : write_type (TREE_TYPE (op));
3590 : }
3591 1261 : else if (ARGUMENT_PACK_P (op))
3592 : {
3593 15 : tree args = ARGUMENT_PACK_ARGS (op);
3594 15 : int length = TREE_VEC_LENGTH (args);
3595 15 : if (abi_check (10))
3596 : {
3597 : /* Before v19 we wrongly mangled all single pack expansions with
3598 : sZ, but now only for expressions, as types ICEd (95298). */
3599 12 : if (length == 1)
3600 : {
3601 9 : tree arg = TREE_VEC_ELT (args, 0);
3602 9 : if (TREE_CODE (arg) == EXPR_PACK_EXPANSION
3603 9 : && !abi_check (19))
3604 : {
3605 3 : op = arg;
3606 3 : goto sizeof_pack;
3607 : }
3608 : }
3609 :
3610 : /* sP <template-arg>* E # sizeof...(T), size of a captured
3611 : template parameter pack from an alias template */
3612 9 : write_string ("sP");
3613 24 : for (int i = 0; i < length; ++i)
3614 15 : write_template_arg (TREE_VEC_ELT (args, i));
3615 9 : write_char ('E');
3616 : }
3617 : else
3618 : {
3619 : /* In GCC 5 we represented this sizeof wrong, with the effect
3620 : that we mangled it as the last element of the pack. */
3621 3 : tree arg = TREE_VEC_ELT (args, length-1);
3622 3 : if (TYPE_P (op))
3623 : {
3624 3 : write_string ("st");
3625 3 : write_type (arg);
3626 : }
3627 : else
3628 : {
3629 0 : write_string ("sz");
3630 0 : write_expression (arg);
3631 : }
3632 : }
3633 : }
3634 1246 : else if (TYPE_P (TREE_OPERAND (expr, 0)))
3635 : {
3636 1122 : write_string ("st");
3637 1122 : write_type (TREE_OPERAND (expr, 0));
3638 : }
3639 : else
3640 124 : goto normal_expr;
3641 : }
3642 11006346 : else if (code == PACK_INDEX_EXPR)
3643 : {
3644 : /* https://github.com/itanium-cxx-abi/cxx-abi/issues/175. */
3645 37 : write_string ("sy");
3646 37 : if (TREE_CODE (PACK_INDEX_PACK (expr)) == TREE_VEC)
3647 : {
3648 2 : write_char ('J');
3649 20 : for (int i = 0; i < TREE_VEC_LENGTH (PACK_INDEX_PACK (expr));
3650 : ++i)
3651 8 : write_template_arg (TREE_VEC_ELT (PACK_INDEX_PACK (expr), i));
3652 2 : write_char ('E');
3653 : }
3654 : else
3655 : /* sy rather than sysp. */
3656 35 : write_expression (PACK_EXPANSION_PATTERN (PACK_INDEX_PACK (expr)));
3657 37 : write_expression (PACK_INDEX_INDEX (expr));
3658 : }
3659 11006309 : else if (TREE_CODE (expr) == ALIGNOF_EXPR)
3660 : {
3661 36 : if (!ALIGNOF_EXPR_STD_P (expr))
3662 : {
3663 24 : if (abi_check (16))
3664 : {
3665 : /* We used to mangle __alignof__ like alignof. */
3666 18 : write_string ("u11__alignof__");
3667 18 : write_template_arg (TREE_OPERAND (expr, 0));
3668 18 : write_char ('E');
3669 18 : return;
3670 : }
3671 : }
3672 18 : if (TYPE_P (TREE_OPERAND (expr, 0)))
3673 : {
3674 9 : write_string ("at");
3675 9 : write_type (TREE_OPERAND (expr, 0));
3676 : }
3677 : else
3678 9 : goto normal_expr;
3679 : }
3680 11006273 : else if (code == SCOPE_REF
3681 11006273 : || code == BASELINK)
3682 : {
3683 316573 : tree scope, member;
3684 316573 : if (code == SCOPE_REF)
3685 : {
3686 316540 : scope = TREE_OPERAND (expr, 0);
3687 316540 : member = TREE_OPERAND (expr, 1);
3688 316540 : if (BASELINK_P (member))
3689 21 : member = BASELINK_FUNCTIONS (member);
3690 : }
3691 : else
3692 : {
3693 33 : scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (expr));
3694 33 : member = BASELINK_FUNCTIONS (expr);
3695 : }
3696 :
3697 : /* If the MEMBER is a real declaration, then the qualifying
3698 : scope was not dependent. Ideally, we would not have a
3699 : SCOPE_REF in those cases, but sometimes we do. If the second
3700 : argument is a DECL, then the name must not have been
3701 : dependent. */
3702 316573 : if (DECL_P (member))
3703 : write_expression (member);
3704 : else
3705 : {
3706 312387 : gcc_assert (code != BASELINK || BASELINK_QUALIFIED_P (expr));
3707 312354 : write_string ("sr");
3708 312354 : write_type (scope);
3709 312354 : write_member_name (member);
3710 : }
3711 : }
3712 10689700 : else if (INDIRECT_REF_P (expr)
3713 470545 : && TREE_TYPE (TREE_OPERAND (expr, 0))
3714 11076998 : && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr, 0))))
3715 : {
3716 264815 : write_expression (TREE_OPERAND (expr, 0));
3717 : }
3718 10424885 : else if (identifier_p (expr))
3719 : {
3720 : /* An operator name appearing as a dependent name needs to be
3721 : specially marked to disambiguate between a use of the operator
3722 : name and a use of the operator in an expression. */
3723 254012 : if (IDENTIFIER_ANY_OP_P (expr))
3724 7 : write_string ("on");
3725 254012 : write_unqualified_id (expr);
3726 : }
3727 10170873 : else if (dependent_splice_p (expr))
3728 50 : write_splice (expr);
3729 10170823 : else if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
3730 : {
3731 4278279 : tree fn = TREE_OPERAND (expr, 0);
3732 5654919 : if (!identifier_p (fn))
3733 4278276 : fn = OVL_NAME (fn);
3734 4278279 : if (IDENTIFIER_ANY_OP_P (fn))
3735 3 : write_string ("on");
3736 4278279 : write_unqualified_id (fn);
3737 4278279 : write_template_args (TREE_OPERAND (expr, 1));
3738 : }
3739 5892544 : else if (TREE_CODE (expr) == MODOP_EXPR)
3740 : {
3741 87 : enum tree_code subop = TREE_CODE (TREE_OPERAND (expr, 1));
3742 87 : const char *name = OVL_OP_INFO (true, subop)->mangled_name;
3743 :
3744 87 : write_string (name);
3745 87 : write_expression (TREE_OPERAND (expr, 0));
3746 87 : write_expression (TREE_OPERAND (expr, 2));
3747 : }
3748 5892457 : else if (code == NEW_EXPR || code == VEC_NEW_EXPR)
3749 : {
3750 : /* ::= [gs] nw <expression>* _ <type> E
3751 : ::= [gs] nw <expression>* _ <type> <initializer>
3752 : ::= [gs] na <expression>* _ <type> E
3753 : ::= [gs] na <expression>* _ <type> <initializer>
3754 : <initializer> ::= pi <expression>* E */
3755 160092 : tree placement = TREE_OPERAND (expr, 0);
3756 160092 : tree type = TREE_OPERAND (expr, 1);
3757 160092 : tree nelts = TREE_OPERAND (expr, 2);
3758 160092 : tree init = TREE_OPERAND (expr, 3);
3759 160092 : tree t;
3760 :
3761 160092 : gcc_assert (code == NEW_EXPR);
3762 160092 : if (TREE_OPERAND (expr, 2))
3763 12 : code = VEC_NEW_EXPR;
3764 :
3765 160092 : if (NEW_EXPR_USE_GLOBAL (expr))
3766 160067 : write_string ("gs");
3767 :
3768 160092 : write_string (OVL_OP_INFO (false, code)->mangled_name);
3769 :
3770 320159 : for (t = placement; t; t = TREE_CHAIN (t))
3771 160067 : write_expression (TREE_VALUE (t));
3772 :
3773 160092 : write_char ('_');
3774 :
3775 160092 : if (nelts)
3776 : {
3777 12 : ++processing_template_decl;
3778 : /* Avoid compute_array_index_type complaints about
3779 : non-constant nelts. */
3780 12 : tree max = cp_build_binary_op (input_location, MINUS_EXPR,
3781 : fold_convert (sizetype, nelts),
3782 : size_one_node,
3783 : tf_warning_or_error);
3784 12 : max = maybe_constant_value (max);
3785 12 : tree domain = build_index_type (max);
3786 12 : type = build_cplus_array_type (type, domain);
3787 12 : --processing_template_decl;
3788 : }
3789 160092 : write_type (type);
3790 :
3791 160080 : if (init && TREE_CODE (init) == TREE_LIST
3792 320166 : && DIRECT_LIST_INIT_P (TREE_VALUE (init)))
3793 : write_expression (TREE_VALUE (init));
3794 : else
3795 : {
3796 160089 : if (init)
3797 160077 : write_string ("pi");
3798 160077 : if (init && init != void_node)
3799 320142 : for (t = init; t; t = TREE_CHAIN (t))
3800 160071 : write_expression (TREE_VALUE (t));
3801 160089 : write_char ('E');
3802 : }
3803 : }
3804 : else if (code == DELETE_EXPR || code == VEC_DELETE_EXPR)
3805 : {
3806 12 : gcc_assert (code == DELETE_EXPR);
3807 12 : if (DELETE_EXPR_USE_VEC (expr))
3808 6 : code = VEC_DELETE_EXPR;
3809 :
3810 12 : if (DELETE_EXPR_USE_GLOBAL (expr))
3811 6 : write_string ("gs");
3812 :
3813 12 : write_string (OVL_OP_INFO (false, code)->mangled_name);
3814 :
3815 12 : write_expression (TREE_OPERAND (expr, 0));
3816 : }
3817 : else if (code == THROW_EXPR)
3818 : {
3819 8 : tree op = TREE_OPERAND (expr, 0);
3820 8 : if (op)
3821 : {
3822 5 : write_string ("tw");
3823 5 : write_expression (op);
3824 : }
3825 : else
3826 3 : write_string ("tr");
3827 : }
3828 : else if (code == NOEXCEPT_EXPR)
3829 : {
3830 6 : write_string ("nx");
3831 6 : write_expression (TREE_OPERAND (expr, 0));
3832 : }
3833 : else if (code == CONSTRUCTOR)
3834 : {
3835 176718 : bool braced_init = BRACE_ENCLOSED_INITIALIZER_P (expr);
3836 176718 : tree etype = TREE_TYPE (expr);
3837 :
3838 176718 : if (braced_init)
3839 97 : write_string ("il");
3840 : else
3841 : {
3842 176621 : write_string ("tl");
3843 176621 : write_type (etype);
3844 : }
3845 :
3846 : /* If this is an undigested initializer, mangle it as written.
3847 : COMPOUND_LITERAL_P doesn't actually distinguish between digested and
3848 : undigested braced casts, but it should work to use it to distinguish
3849 : between braced casts in a template signature (undigested) and template
3850 : parm object values (digested), and all CONSTRUCTORS that get here
3851 : should be one of those two cases. */
3852 176718 : bool undigested = braced_init || COMPOUND_LITERAL_P (expr);
3853 176317 : if (undigested || !zero_init_expr_p (expr))
3854 : {
3855 : /* Convert braced initializer lists to STRING_CSTs so that
3856 : A<"Foo"> mangles the same as A<{'F', 'o', 'o', 0}> while
3857 : still using the latter mangling for strings that
3858 : originated as braced initializer lists. */
3859 155871 : expr = braced_lists_to_strings (etype, expr);
3860 :
3861 155871 : if (TREE_CODE (expr) == CONSTRUCTOR)
3862 : {
3863 155863 : vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (expr);
3864 155863 : unsigned last_nonzero = UINT_MAX;
3865 155863 : constructor_elt *ce;
3866 :
3867 155863 : if (!undigested)
3868 375055 : for (HOST_WIDE_INT i = 0; vec_safe_iterate (elts, i, &ce); ++i)
3869 219593 : if ((TREE_CODE (etype) == UNION_TYPE
3870 37 : && ce->index != first_field (etype))
3871 219619 : || !zero_init_expr_p (ce->value))
3872 : last_nonzero = i;
3873 :
3874 155863 : tree prev_field = NULL_TREE;
3875 155863 : if (undigested || last_nonzero != UINT_MAX)
3876 373110 : for (HOST_WIDE_INT i = 0; vec_safe_iterate (elts, i, &ce); ++i)
3877 : {
3878 219563 : if (i > last_nonzero)
3879 : break;
3880 217083 : if (!undigested && !CONSTRUCTOR_NO_CLEARING (expr)
3881 217247 : && (TREE_CODE (etype) == RECORD_TYPE
3882 215211 : || TREE_CODE (etype) == ARRAY_TYPE))
3883 : {
3884 : /* Write out any implicit non-trailing zeros
3885 : (which we neglected to do before v21). */
3886 215174 : if (TREE_CODE (etype) == RECORD_TYPE)
3887 : {
3888 133345 : tree field;
3889 133345 : if (i == 0)
3890 120036 : field = first_field (etype);
3891 : else
3892 13309 : field = DECL_CHAIN (prev_field);
3893 133757 : for (;;)
3894 : {
3895 133551 : field = next_subobject_field (field);
3896 133551 : if (field == ce->index)
3897 : break;
3898 206 : if (abi_check (21))
3899 : {
3900 196 : tree type = TREE_TYPE (field), expr;
3901 196 : if (REFLECTION_TYPE_P (type))
3902 0 : expr = get_null_reflection ();
3903 : else
3904 196 : expr = build_zero_cst (type);
3905 196 : write_expression (expr);
3906 : }
3907 206 : field = DECL_CHAIN (field);
3908 206 : }
3909 : }
3910 81829 : else if (TREE_CODE (etype) == ARRAY_TYPE)
3911 : {
3912 81829 : unsigned HOST_WIDE_INT j;
3913 81829 : if (i == 0)
3914 : j = 0;
3915 : else
3916 47064 : j = 1 + tree_to_uhwi (prev_field);
3917 81829 : unsigned HOST_WIDE_INT k;
3918 81829 : if (TREE_CODE (ce->index) == RANGE_EXPR)
3919 12 : k = tree_to_uhwi (TREE_OPERAND (ce->index, 0));
3920 : else
3921 81817 : k = tree_to_uhwi (ce->index);
3922 81829 : tree zero = NULL_TREE;
3923 83599 : for (; j < k; ++j)
3924 1770 : if (abi_check (21))
3925 : {
3926 1188 : if (!zero)
3927 30 : zero = build_zero_cst (TREE_TYPE (etype));
3928 1188 : write_expression (zero);
3929 : }
3930 : }
3931 : }
3932 :
3933 217247 : if (!undigested && TREE_CODE (etype) == UNION_TYPE)
3934 : {
3935 : /* Express the active member as a designator. */
3936 37 : write_string ("di");
3937 37 : write_unqualified_name (ce->index);
3938 : }
3939 217247 : unsigned reps = 1;
3940 217247 : if (ce->index && TREE_CODE (ce->index) == RANGE_EXPR)
3941 12 : reps = range_expr_nelts (ce->index);
3942 217247 : if (TREE_CODE (ce->value) == RAW_DATA_CST)
3943 : {
3944 30 : gcc_assert (reps == 1);
3945 30 : unsigned int len = RAW_DATA_LENGTH (ce->value);
3946 : /* If this is the last non-zero element, skip
3947 : zeros at the end. */
3948 30 : if (i == last_nonzero)
3949 282 : while (len)
3950 : {
3951 282 : if (RAW_DATA_POINTER (ce->value)[len - 1])
3952 : break;
3953 : --len;
3954 : }
3955 30 : tree valtype = TREE_TYPE (ce->value);
3956 3906 : for (unsigned int i = 0; i < len; ++i)
3957 : {
3958 3876 : write_char ('L');
3959 3876 : write_type (valtype);
3960 3876 : unsigned HOST_WIDE_INT v;
3961 3876 : if (!TYPE_UNSIGNED (valtype)
3962 780 : && TYPE_PRECISION (valtype) == BITS_PER_UNIT
3963 4656 : && RAW_DATA_SCHAR_ELT (ce->value, i) < 0)
3964 : {
3965 0 : write_char ('n');
3966 0 : v = -RAW_DATA_SCHAR_ELT (ce->value, i);
3967 : }
3968 : else
3969 3876 : v = RAW_DATA_UCHAR_ELT (ce->value, i);
3970 3876 : write_unsigned_number (v);
3971 3876 : write_char ('E');
3972 : }
3973 : }
3974 : else
3975 434452 : for (unsigned j = 0; j < reps; ++j)
3976 217235 : write_expression (ce->value);
3977 217247 : prev_field = ce->index;
3978 217247 : if (prev_field && TREE_CODE (prev_field) == RANGE_EXPR)
3979 12 : prev_field = TREE_OPERAND (prev_field, 1);
3980 : }
3981 : }
3982 : else
3983 : {
3984 8 : gcc_assert (TREE_CODE (expr) == STRING_CST);
3985 8 : write_expression (expr);
3986 : }
3987 : }
3988 176718 : write_char ('E');
3989 : }
3990 : else if (code == LAMBDA_EXPR)
3991 : {
3992 : /* [temp.over.link] Two lambda-expressions are never considered
3993 : equivalent.
3994 :
3995 : So just use the closure type mangling. */
3996 1408 : write_char ('L');
3997 1408 : write_type (LAMBDA_EXPR_CLOSURE (expr));
3998 1408 : write_char ('E');
3999 : }
4000 : else if (code == REQUIRES_EXPR)
4001 533986 : write_requires_expr (expr);
4002 5020227 : else if (dependent_name (expr))
4003 : {
4004 120257 : tree name = dependent_name (expr);
4005 120257 : if (IDENTIFIER_ANY_OP_P (name))
4006 : {
4007 9 : if (abi_check (16))
4008 6 : write_string ("on");
4009 : }
4010 120257 : write_unqualified_id (name);
4011 : }
4012 : else
4013 : {
4014 4899970 : normal_expr:
4015 4900103 : int i, len;
4016 4900103 : const char *name;
4017 :
4018 : /* When we bind a variable or function to a non-type template
4019 : argument with reference type, we create an ADDR_EXPR to show
4020 : the fact that the entity's address has been taken. But, we
4021 : don't actually want to output a mangling code for the `&'. */
4022 4900103 : if (TREE_CODE (expr) == ADDR_EXPR
4023 7353 : && TREE_TYPE (expr)
4024 4903561 : && TYPE_REF_P (TREE_TYPE (expr)))
4025 : {
4026 0 : expr = TREE_OPERAND (expr, 0);
4027 0 : if (DECL_P (expr))
4028 : {
4029 : write_expression (expr);
4030 : return;
4031 : }
4032 :
4033 0 : code = TREE_CODE (expr);
4034 : }
4035 :
4036 4900103 : if (code == COMPONENT_REF)
4037 : {
4038 200127 : tree ob = TREE_OPERAND (expr, 0);
4039 :
4040 200127 : if (TREE_CODE (ob) == ARROW_EXPR)
4041 : {
4042 320 : write_string (OVL_OP_INFO (false, code)->mangled_name);
4043 320 : ob = TREE_OPERAND (ob, 0);
4044 320 : write_expression (ob);
4045 : }
4046 199807 : else if (write_base_ref (expr))
4047 : return;
4048 199798 : else if (!is_dummy_object (ob))
4049 : {
4050 199792 : write_string ("dt");
4051 199792 : write_expression (ob);
4052 : }
4053 : /* else, for a non-static data member with no associated object (in
4054 : unevaluated context), use the unresolved-name mangling. */
4055 :
4056 200118 : write_member_name (TREE_OPERAND (expr, 1));
4057 200118 : return;
4058 : }
4059 :
4060 : /* If it wasn't any of those, recursively expand the expression. */
4061 4699976 : name = OVL_OP_INFO (false, code)->mangled_name;
4062 :
4063 : /* We used to mangle const_cast and static_cast like a C cast. */
4064 4699976 : if (code == CONST_CAST_EXPR
4065 4699976 : || code == STATIC_CAST_EXPR)
4066 : {
4067 265 : if (!abi_check (6))
4068 15 : name = OVL_OP_INFO (false, CAST_EXPR)->mangled_name;
4069 : }
4070 :
4071 4699976 : if (name == NULL)
4072 : {
4073 3 : switch (code)
4074 : {
4075 3 : case TRAIT_EXPR:
4076 3 : error ("use of built-in trait %qE in function signature; "
4077 : "use library traits instead", expr);
4078 3 : break;
4079 :
4080 0 : case ERROR_MARK:
4081 0 : if (seen_error ())
4082 : break;
4083 : /* FALLTHROUGH */
4084 0 : default:
4085 0 : sorry ("mangling %C", code);
4086 0 : break;
4087 : }
4088 : return;
4089 : }
4090 : else
4091 4699973 : write_string (name);
4092 :
4093 4699973 : switch (code)
4094 : {
4095 2121494 : case CALL_EXPR:
4096 2121494 : {
4097 2121494 : tree fn = CALL_EXPR_FN (expr);
4098 :
4099 2121494 : if (TREE_CODE (fn) == ADDR_EXPR)
4100 0 : fn = TREE_OPERAND (fn, 0);
4101 :
4102 : /* Mangle a dependent name as the name, not whatever happens to
4103 : be the first function in the overload set. */
4104 2120771 : if (OVL_P (fn)
4105 2375299 : && type_dependent_expression_p_push (expr))
4106 253909 : fn = OVL_NAME (fn);
4107 :
4108 2121494 : write_expression (fn);
4109 : }
4110 :
4111 4890560 : for (i = 0; i < call_expr_nargs (expr); ++i)
4112 647572 : write_expression (CALL_EXPR_ARG (expr, i));
4113 2121494 : write_char ('E');
4114 2121494 : break;
4115 :
4116 161951 : case CAST_EXPR:
4117 161951 : write_type (TREE_TYPE (expr));
4118 161951 : if (list_length (TREE_OPERAND (expr, 0)) == 1)
4119 161773 : write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
4120 : else
4121 : {
4122 178 : tree args = TREE_OPERAND (expr, 0);
4123 178 : write_char ('_');
4124 190 : for (; args; args = TREE_CHAIN (args))
4125 12 : write_expression (TREE_VALUE (args));
4126 178 : write_char ('E');
4127 : }
4128 : break;
4129 :
4130 271 : case DYNAMIC_CAST_EXPR:
4131 271 : case REINTERPRET_CAST_EXPR:
4132 271 : case STATIC_CAST_EXPR:
4133 271 : case CONST_CAST_EXPR:
4134 271 : write_type (TREE_TYPE (expr));
4135 271 : write_expression (TREE_OPERAND (expr, 0));
4136 271 : break;
4137 :
4138 7551 : case PREINCREMENT_EXPR:
4139 7551 : case PREDECREMENT_EXPR:
4140 7551 : if (abi_check (6))
4141 7542 : write_char ('_');
4142 : /* Fall through. */
4143 :
4144 2416257 : default:
4145 : /* In the middle-end, some expressions have more operands than
4146 : they do in templates (and mangling). */
4147 2416257 : len = cp_tree_operand_length (expr);
4148 :
4149 8729590 : for (i = 0; i < len; ++i)
4150 : {
4151 3897076 : tree operand = TREE_OPERAND (expr, i);
4152 : /* As a GNU extension, the middle operand of a
4153 : conditional may be omitted. Since expression
4154 : manglings are supposed to represent the input token
4155 : stream, there's no good way to mangle such an
4156 : expression without extending the C++ ABI. */
4157 3897076 : if (code == COND_EXPR && i == 1 && !operand)
4158 : {
4159 3 : error ("omitted middle operand to %<?:%> operand "
4160 : "cannot be mangled");
4161 3 : continue;
4162 : }
4163 3897073 : else if (FOLD_EXPR_P (expr))
4164 : {
4165 : /* The first 'operand' of a fold-expression is the operator
4166 : that it folds over. */
4167 513664 : if (i == 0)
4168 : {
4169 256695 : int fcode = TREE_INT_CST_LOW (operand);
4170 256695 : write_string (OVL_OP_INFO (false, fcode)->mangled_name);
4171 256695 : continue;
4172 256695 : }
4173 256969 : else if (code == BINARY_LEFT_FOLD_EXPR)
4174 : {
4175 : /* The order of operands of the binary left and right
4176 : folds is the same, but we want to mangle them in
4177 : lexical order, i.e. non-pack first. */
4178 542 : if (i == 1)
4179 271 : operand = FOLD_EXPR_INIT (expr);
4180 : else
4181 271 : operand = FOLD_EXPR_PACK (expr);
4182 : }
4183 256969 : if (PACK_EXPANSION_P (operand))
4184 256695 : operand = PACK_EXPANSION_PATTERN (operand);
4185 : }
4186 3640378 : write_expression (operand);
4187 : }
4188 : }
4189 : }
4190 : }
4191 :
4192 : /* Non-terminal <reflection>.
4193 :
4194 : <reflection> ::= nu # null reflection
4195 : ::= vl <expression> # value
4196 : ::= ob <expression> # object
4197 : ::= vr <variable name> # variable
4198 : ::= sb <sb name> # structured binding
4199 : ::= fn <function encoding> # function
4200 : ::= pa [ <nonnegative number> ] _ <encoding> # fn param
4201 : ::= en <prefix> <unqualified-name> # enumerator
4202 : ::= an [ <nonnegative number> ] _ # annotation
4203 : ::= ta <alias prefix> <alias unqualified-name>
4204 : [ <alias template-args> ] _ <type> # type alias
4205 : ::= ty <type> # type
4206 : ::= dm <prefix> <unqualified-name> # ns data member
4207 : ::= da <prefix> [ <nonnegative number> ] _ # empty anon union
4208 : # data member
4209 : ::= un <prefix> [ <nonnegative number> ] _ # unnamed bitfld
4210 : ::= ct [ <prefix> ] <unqualified-name> # class template
4211 : ::= ft [ <prefix> ] <unqualified-name> # function template
4212 : ::= vt [ <prefix> ] <unqualified-name> # variable template
4213 : ::= at [ <prefix> ] <unqualified-name> # alias template
4214 : ::= co [ <prefix> ] <unqualified-name> # concept
4215 : ::= na [ <prefix> ] <unqualified-name> # namespace alias
4216 : ::= ns [ <prefix> ] <unqualified-name> # namespace
4217 : ::= gs # ^^::
4218 : ::= tt <template-template-param> # templ templ param
4219 : ::= de <expression> # dependent expr
4220 : ::= ba [ <nonnegative number> ] _ <type> # dir. base cls rel
4221 : ::= ds <type> _ [ <unqualified-name> ] _
4222 : [ <alignment number> ] _ [ <bit-width number> ] _
4223 : [ n ] [ <template-arg>* ] # data member spec */
4224 :
4225 : static void
4226 1550 : write_reflection (tree refl)
4227 : {
4228 1550 : char prefix[3];
4229 1550 : tree arg = reflection_mangle_prefix (refl, prefix);
4230 1550 : if (strcmp (prefix, "dm") == 0
4231 220 : && DECL_NAME (arg) == NULL_TREE
4232 12 : && ANON_AGGR_TYPE_P (TREE_TYPE (arg))
4233 1562 : && anon_aggr_naming_decl (TREE_TYPE (arg)) == NULL_TREE)
4234 12 : strcpy (prefix, "da");
4235 1550 : write_string (prefix);
4236 : /* If there is no argument, nothing further needs to be mangled. */
4237 1550 : if (arg == NULL_TREE)
4238 32 : return;
4239 1518 : if (strcmp (prefix, "vl") == 0 || strcmp (prefix, "ob") == 0)
4240 22 : write_expression (arg);
4241 1496 : else if (strcmp (prefix, "vr") == 0 || strcmp (prefix, "sb") == 0)
4242 234 : write_name (arg, 0);
4243 1262 : else if (strcmp (prefix, "fn") == 0)
4244 196 : write_encoding (arg);
4245 1066 : else if (strcmp (prefix, "pa") == 0)
4246 : {
4247 82 : tree fn = DECL_CONTEXT (arg);
4248 : /* DECL_PARM_INDEX is 1-based but here we want a 0-based index. */
4249 82 : const int idx = DECL_PARM_INDEX (arg) - 1;
4250 82 : write_compact_number (idx);
4251 82 : write_encoding (fn);
4252 : }
4253 984 : else if (strcmp (prefix, "en") == 0)
4254 : {
4255 26 : write_prefix (decl_mangling_context (arg));
4256 26 : write_unqualified_name (arg);
4257 : }
4258 958 : else if (strcmp (prefix, "an") == 0)
4259 10 : write_compact_number (tree_to_uhwi (arg));
4260 948 : else if (strcmp (prefix, "ta") == 0)
4261 : {
4262 28 : arg = TYPE_NAME (arg);
4263 : /* Can't use write_prefix (arg) here instead of
4264 : write_prefix + write_unqualified_name + optional
4265 : write_template_args, it shouldn't be
4266 : remembered among substitutions. */
4267 28 : write_prefix (decl_mangling_context (arg));
4268 28 : if (modules_p ())
4269 0 : maybe_write_module (arg);
4270 28 : write_source_name (DECL_NAME (arg));
4271 28 : tree template_info = maybe_template_info (arg);
4272 28 : if (template_info)
4273 4 : write_template_args (TI_ARGS (template_info));
4274 28 : write_char ('_');
4275 28 : write_type (DECL_ORIGINAL_TYPE (arg));
4276 : }
4277 920 : else if (strcmp (prefix, "ty") == 0)
4278 300 : write_type (arg);
4279 620 : else if (strcmp (prefix, "dm") == 0)
4280 : {
4281 208 : tree ctx = decl_mangling_context (arg);
4282 424 : while (ctx && ANON_UNION_TYPE_P (ctx))
4283 8 : ctx = decl_mangling_context (TYPE_NAME (ctx));
4284 208 : write_prefix (ctx);
4285 208 : write_unqualified_name (arg);
4286 : }
4287 412 : else if (strcmp (prefix, "da") == 0)
4288 : {
4289 12 : int idx = 0;
4290 12 : tree ctx = decl_mangling_context (arg);
4291 198 : for (tree f = TYPE_FIELDS (ctx); f; f = DECL_CHAIN (f))
4292 198 : if (f == arg)
4293 : break;
4294 186 : else if (TREE_CODE (f) == FIELD_DECL
4295 18 : && DECL_NAME (f) == NULL_TREE
4296 18 : && ANON_AGGR_TYPE_P (TREE_TYPE (f))
4297 204 : && anon_aggr_naming_decl (TREE_TYPE (f)) == NULL_TREE)
4298 18 : ++idx;
4299 12 : write_prefix (ctx);
4300 12 : write_compact_number (idx);
4301 : }
4302 400 : else if (strcmp (prefix, "un") == 0)
4303 : {
4304 8 : tree ctx = DECL_CONTEXT (arg);
4305 8 : int idx = 0;
4306 142 : for (tree f = TYPE_FIELDS (ctx); f; f = DECL_CHAIN (f))
4307 142 : if (f == arg)
4308 : break;
4309 134 : else if (TREE_CODE (f) == FIELD_DECL && DECL_UNNAMED_BIT_FIELD (f))
4310 6 : ++idx;
4311 8 : write_prefix (decl_mangling_context (arg));
4312 8 : write_compact_number (idx);
4313 : }
4314 392 : else if (strcmp (prefix, "ct") == 0
4315 354 : || strcmp (prefix, "ft") == 0
4316 308 : || strcmp (prefix, "vt") == 0
4317 290 : || strcmp (prefix, "at") == 0
4318 272 : || strcmp (prefix, "co") == 0
4319 258 : || strcmp (prefix, "na") == 0
4320 248 : || strcmp (prefix, "ns") == 0)
4321 : {
4322 276 : write_prefix (decl_mangling_context (arg));
4323 276 : write_unqualified_name (STRIP_TEMPLATE (arg));
4324 : }
4325 116 : else if (strcmp (prefix, "ba") == 0)
4326 : {
4327 26 : gcc_assert (TREE_CODE (arg) == TREE_BINFO);
4328 : tree c = arg, base_binfo;
4329 52 : while (BINFO_INHERITANCE_CHAIN (c))
4330 : c = BINFO_INHERITANCE_CHAIN (c);
4331 :
4332 : unsigned idx;
4333 30 : for (idx = 0; BINFO_BASE_ITERATE (c, idx, base_binfo); idx++)
4334 30 : if (base_binfo == arg)
4335 : break;
4336 26 : write_compact_number (idx);
4337 26 : write_type (BINFO_TYPE (c));
4338 : }
4339 90 : else if (strcmp (prefix, "ds") == 0)
4340 : {
4341 84 : gcc_assert (TREE_CODE (arg) == TREE_VEC);
4342 84 : write_type (TREE_VEC_ELT (arg, 0));
4343 84 : write_char ('_');
4344 84 : if (TREE_VEC_ELT (arg, 1))
4345 80 : write_unqualified_id (TREE_VEC_ELT (arg, 1));
4346 84 : write_char ('_');
4347 84 : if (TREE_VEC_ELT (arg, 2))
4348 2 : write_number (tree_to_shwi (TREE_VEC_ELT (arg, 2)), 0, 10);
4349 84 : write_char ('_');
4350 84 : if (TREE_VEC_ELT (arg, 3))
4351 6 : write_number (tree_to_shwi (TREE_VEC_ELT (arg, 3)), 0, 10);
4352 84 : write_char ('_');
4353 84 : if (integer_nonzerop (TREE_VEC_ELT (arg, 4)))
4354 2 : write_char ('n');
4355 90 : for (int i = 5; i < TREE_VEC_LENGTH (arg); ++i)
4356 6 : write_template_arg (REFLECT_EXPR_HANDLE (TREE_VEC_ELT (arg, i)));
4357 : }
4358 6 : else if (strcmp (prefix, "tt") == 0)
4359 : {
4360 2 : gcc_assert (DECL_TEMPLATE_TEMPLATE_PARM_P (arg));
4361 2 : write_template_template_param (TREE_TYPE (arg));
4362 : }
4363 4 : else if (strcmp (prefix, "de") == 0)
4364 4 : write_expression (arg);
4365 : else
4366 0 : gcc_unreachable ();
4367 : }
4368 :
4369 : /* Mangle a dependent splice.
4370 :
4371 : <splice> ::= DS <expression> [ <template-args> ] E
4372 :
4373 : TODO: This is only a proposed mangling.
4374 : See <https://github.com/itanium-cxx-abi/cxx-abi/issues/208>. */
4375 :
4376 : static void
4377 108 : write_splice (tree sp)
4378 : {
4379 108 : write_string ("DS");
4380 :
4381 108 : if (TREE_CODE (sp) == SPLICE_SCOPE)
4382 58 : sp = SPLICE_SCOPE_EXPR (sp);
4383 108 : gcc_assert (dependent_splice_p (sp));
4384 108 : if (TREE_CODE (sp) == TEMPLATE_ID_EXPR)
4385 : {
4386 4 : write_expression (TREE_OPERAND (TREE_OPERAND (sp, 0), 0));
4387 4 : write_template_args (TREE_OPERAND (sp, 1));
4388 : }
4389 : else
4390 104 : write_expression (TREE_OPERAND (sp, 0));
4391 :
4392 108 : write_char ('E');
4393 108 : }
4394 :
4395 : /* Literal subcase of non-terminal <template-arg>.
4396 :
4397 : "Literal arguments, e.g. "A<42L>", are encoded with their type
4398 : and value. Negative integer values are preceded with "n"; for
4399 : example, "A<-42L>" becomes "1AILln42EE". The bool value false is
4400 : encoded as 0, true as 1." */
4401 :
4402 : static void
4403 95774204 : write_template_arg_literal (const tree value)
4404 : {
4405 95774204 : if (TREE_CODE (value) == STRING_CST)
4406 : /* Temporarily mangle strings as braced initializer lists. */
4407 1667 : write_string ("tl");
4408 : else
4409 95772537 : write_char ('L');
4410 :
4411 95774204 : tree valtype = TREE_TYPE (value);
4412 95774204 : write_type (valtype);
4413 :
4414 : /* Write a null member pointer value as (type)0, regardless of its
4415 : real representation. */
4416 95774204 : if (null_member_pointer_value_p (value))
4417 264 : write_integer_cst (integer_zero_node);
4418 : else
4419 95773940 : switch (TREE_CODE (value))
4420 : {
4421 24330 : case CONST_DECL:
4422 24330 : write_integer_cst (DECL_INITIAL (value));
4423 24330 : break;
4424 :
4425 95743844 : case INTEGER_CST:
4426 95743844 : gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
4427 : || integer_zerop (value) || integer_onep (value));
4428 95743844 : if (!(abi_version_at_least (14)
4429 95736974 : && NULLPTR_TYPE_P (TREE_TYPE (value))))
4430 95743788 : write_integer_cst (value);
4431 : break;
4432 :
4433 2543 : case REAL_CST:
4434 2543 : write_real_cst (value);
4435 2543 : break;
4436 :
4437 6 : case COMPLEX_CST:
4438 6 : if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST
4439 6 : && TREE_CODE (TREE_IMAGPART (value)) == INTEGER_CST)
4440 : {
4441 3 : write_integer_cst (TREE_REALPART (value));
4442 3 : write_char ('_');
4443 3 : write_integer_cst (TREE_IMAGPART (value));
4444 : }
4445 3 : else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST
4446 3 : && TREE_CODE (TREE_IMAGPART (value)) == REAL_CST)
4447 : {
4448 3 : write_real_cst (TREE_REALPART (value));
4449 3 : write_char ('_');
4450 3 : write_real_cst (TREE_IMAGPART (value));
4451 : }
4452 : else
4453 0 : gcc_unreachable ();
4454 : break;
4455 :
4456 1667 : case STRING_CST:
4457 1667 : {
4458 : /* Mangle strings the same as braced initializer lists. */
4459 1667 : unsigned n = TREE_STRING_LENGTH (value);
4460 1667 : const char *str = TREE_STRING_POINTER (value);
4461 :
4462 : /* Count the number of trailing nuls and subtract them from
4463 : STRSIZE because they don't need to be mangled. */
4464 4638 : for (const char *p = str + n - 1; ; --p)
4465 : {
4466 4638 : if (*p || p == str)
4467 : {
4468 1667 : n -= str + n - !!*p - p;
4469 1667 : break;
4470 : }
4471 : }
4472 1667 : tree eltype = TREE_TYPE (valtype);
4473 11784 : for (const char *p = str; n--; ++p)
4474 : {
4475 10117 : write_char ('L');
4476 10117 : write_type (eltype);
4477 10117 : write_unsigned_number (*(const unsigned char*)p);
4478 10117 : write_string ("E");
4479 : }
4480 : break;
4481 : }
4482 :
4483 1550 : case REFLECT_EXPR:
4484 1550 : write_reflection (value);
4485 1550 : break;
4486 :
4487 0 : default:
4488 0 : gcc_unreachable ();
4489 : }
4490 :
4491 95774204 : write_char ('E');
4492 95774204 : }
4493 :
4494 : /* Non-terminal <template-arg>.
4495 :
4496 : <template-arg> ::= <type> # type
4497 : ::= L <type> </value/ number> E # literal
4498 : ::= LZ <name> E # external name
4499 : ::= X <expression> E # expression */
4500 :
4501 : static void
4502 770021688 : write_template_arg (tree node)
4503 : {
4504 770021688 : enum tree_code code = TREE_CODE (node);
4505 :
4506 770021688 : MANGLE_TRACE_TREE ("template-arg", node);
4507 :
4508 : /* A template template parameter's argument list contains TREE_LIST
4509 : nodes of which the value field is the actual argument. */
4510 770021688 : if (code == TREE_LIST)
4511 : {
4512 0 : node = TREE_VALUE (node);
4513 : /* If it's a decl, deal with its type instead. */
4514 0 : if (DECL_P (node))
4515 : {
4516 0 : node = TREE_TYPE (node);
4517 0 : code = TREE_CODE (node);
4518 : }
4519 : }
4520 :
4521 770021688 : if (VAR_P (node) && DECL_NTTP_OBJECT_P (node))
4522 : /* We want to mangle the argument, not the var we stored it in. */
4523 51496 : node = tparm_object_argument (node);
4524 :
4525 : /* Strip a conversion added by convert_nontype_argument. */
4526 770021688 : if (TREE_CODE (node) == IMPLICIT_CONV_EXPR)
4527 78 : node = TREE_OPERAND (node, 0);
4528 770021688 : if (REFERENCE_REF_P (node))
4529 282 : node = TREE_OPERAND (node, 0);
4530 770021688 : if (TREE_CODE (node) == NOP_EXPR
4531 770021688 : && TYPE_REF_P (TREE_TYPE (node)))
4532 : {
4533 : /* Template parameters can be of reference type. To maintain
4534 : internal consistency, such arguments use a conversion from
4535 : address of object to reference type. */
4536 276 : gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
4537 276 : node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
4538 : }
4539 :
4540 770021688 : if (TREE_CODE (node) == BASELINK
4541 770021688 : && !type_unknown_p (node))
4542 : {
4543 : /* Before v6 we wrongly wrapped a class-scope function in X/E. */
4544 18 : if (abi_check (6))
4545 12 : node = BASELINK_FUNCTIONS (node);
4546 : }
4547 :
4548 770021688 : if (ARGUMENT_PACK_P (node))
4549 : {
4550 : /* Expand the template argument pack. */
4551 10090614 : tree args = ARGUMENT_PACK_ARGS (node);
4552 10090614 : int i, length = TREE_VEC_LENGTH (args);
4553 10090614 : if (abi_check (6))
4554 10090596 : write_char ('J');
4555 : else
4556 18 : write_char ('I');
4557 24607421 : for (i = 0; i < length; ++i)
4558 14516807 : write_template_arg (TREE_VEC_ELT (args, i));
4559 10090614 : write_char ('E');
4560 : }
4561 759931074 : else if (TYPE_P (node))
4562 662955762 : write_type (node);
4563 96975312 : else if (code == TEMPLATE_DECL)
4564 : /* A template appearing as a template arg is a template template arg. */
4565 799962 : write_template_template_arg (node);
4566 95368863 : else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
4567 806487 : || code == CONST_DECL
4568 810221 : || null_member_pointer_value_p (node)
4569 96985423 : || code == REFLECT_EXPR)
4570 95366571 : write_template_arg_literal (node);
4571 808779 : else if (code == EXCESS_PRECISION_EXPR
4572 808779 : && TREE_CODE (TREE_OPERAND (node, 0)) == REAL_CST)
4573 0 : write_template_arg_literal (fold_convert (TREE_TYPE (node),
4574 : TREE_OPERAND (node, 0)));
4575 808779 : else if (DECL_P (node))
4576 : {
4577 295 : write_char ('L');
4578 : /* Until ABI version 3, the underscore before the mangled name
4579 : was incorrectly omitted. */
4580 295 : if (!abi_check (3))
4581 21 : write_char ('Z');
4582 : else
4583 274 : write_string ("_Z");
4584 295 : write_encoding (node);
4585 295 : write_char ('E');
4586 : }
4587 : else
4588 : {
4589 : /* Template arguments may be expressions. */
4590 808484 : write_char ('X');
4591 808484 : write_expression (node);
4592 808484 : write_char ('E');
4593 : }
4594 770021688 : }
4595 :
4596 : /* <template-template-arg>
4597 : ::= <name>
4598 : ::= <substitution> */
4599 :
4600 : static void
4601 799962 : write_template_template_arg (const tree decl)
4602 : {
4603 799962 : MANGLE_TRACE_TREE ("template-template-arg", decl);
4604 :
4605 799962 : if (find_substitution (decl))
4606 : return;
4607 717230 : write_name (decl, /*ignore_local_scope=*/0);
4608 717230 : add_substitution (decl);
4609 : }
4610 :
4611 :
4612 : /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
4613 :
4614 : <array-type> ::= A [</dimension/ number>] _ </element/ type>
4615 : ::= A <expression> _ </element/ type>
4616 :
4617 : "Array types encode the dimension (number of elements) and the
4618 : element type. For variable length arrays, the dimension (but not
4619 : the '_' separator) is omitted."
4620 : Note that for flexible array members, like for other arrays of
4621 : unspecified size, the dimension is also omitted. */
4622 :
4623 : static void
4624 1577649 : write_array_type (const tree type)
4625 : {
4626 1577649 : write_char ('A');
4627 1577649 : if (TYPE_DOMAIN (type))
4628 : {
4629 400137 : tree index_type;
4630 :
4631 400137 : index_type = TYPE_DOMAIN (type);
4632 : /* The INDEX_TYPE gives the upper and lower bounds of the array.
4633 : It's null for flexible array members which have no upper bound
4634 : (this is a change from GCC 5 and prior where such members were
4635 : incorrectly mangled as zero-length arrays). */
4636 400137 : if (tree max = TYPE_MAX_VALUE (index_type))
4637 : {
4638 400137 : if (TREE_CODE (max) == INTEGER_CST)
4639 : {
4640 : /* The ABI specifies that we should mangle the number of
4641 : elements in the array, not the largest allowed index. */
4642 236726 : offset_int wmax = wi::to_offset (max) + 1;
4643 : /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
4644 : number of elements as zero. */
4645 236726 : wmax = wi::zext (wmax, TYPE_PRECISION (TREE_TYPE (max)));
4646 236726 : gcc_assert (wi::fits_uhwi_p (wmax));
4647 236726 : write_unsigned_number (wmax.to_uhwi ());
4648 : }
4649 : else
4650 : {
4651 163411 : gcc_checking_assert (TREE_CODE (max) == MINUS_EXPR
4652 : && integer_onep (TREE_OPERAND (max, 1)));
4653 163411 : max = TREE_OPERAND (max, 0);
4654 163411 : write_expression (max);
4655 : }
4656 : }
4657 : }
4658 1577649 : write_char ('_');
4659 1577649 : write_type (TREE_TYPE (type));
4660 1577649 : }
4661 :
4662 : /* Non-terminal <pointer-to-member-type> for pointer-to-member
4663 : variables. TYPE is a pointer-to-member POINTER_TYPE.
4664 :
4665 : <pointer-to-member-type> ::= M </class/ type> </member/ type> */
4666 :
4667 : static void
4668 285739 : write_pointer_to_member_type (const tree type)
4669 : {
4670 285739 : write_char ('M');
4671 285739 : write_type (TYPE_PTRMEM_CLASS_TYPE (type));
4672 285739 : write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
4673 285739 : }
4674 :
4675 : /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
4676 : TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
4677 : TEMPLATE_PARM_INDEX.
4678 :
4679 : <template-param> ::= T </parameter/ number> _ */
4680 :
4681 : static void
4682 29377541 : write_template_param (const tree parm)
4683 : {
4684 29377541 : int parm_index;
4685 29377541 : int level;
4686 :
4687 29377541 : MANGLE_TRACE_TREE ("template-parm", parm);
4688 :
4689 29377541 : switch (TREE_CODE (parm))
4690 : {
4691 28593952 : case TEMPLATE_TYPE_PARM:
4692 28593952 : case TEMPLATE_TEMPLATE_PARM:
4693 28593952 : case BOUND_TEMPLATE_TEMPLATE_PARM:
4694 28593952 : parm_index = TEMPLATE_TYPE_IDX (parm);
4695 28593952 : level = TEMPLATE_TYPE_LEVEL (parm);
4696 28593952 : break;
4697 :
4698 783589 : case TEMPLATE_PARM_INDEX:
4699 783589 : parm_index = TEMPLATE_PARM_IDX (parm);
4700 783589 : level = TEMPLATE_PARM_LEVEL (parm);
4701 783589 : break;
4702 :
4703 0 : default:
4704 0 : gcc_unreachable ();
4705 : }
4706 :
4707 29377541 : write_char ('T');
4708 29377541 : if (level > 1)
4709 : {
4710 28648 : if (abi_check (19))
4711 : {
4712 28636 : write_char ('L');
4713 28636 : write_compact_number (level - 1);
4714 : }
4715 : }
4716 : /* NUMBER as it appears in the mangling is (-1)-indexed, with the
4717 : earliest template param denoted by `_'. */
4718 29377541 : write_compact_number (parm_index);
4719 29377541 : }
4720 :
4721 : /* <template-template-param>
4722 : ::= <template-param>
4723 : ::= <substitution> */
4724 :
4725 : static void
4726 631 : write_template_template_param (const tree parm)
4727 : {
4728 631 : tree templ = NULL_TREE;
4729 :
4730 : /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
4731 : template template parameter. The substitution candidate here is
4732 : only the template. */
4733 631 : if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
4734 : {
4735 536 : templ
4736 536 : = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
4737 536 : if (find_substitution (templ))
4738 : return;
4739 : }
4740 :
4741 : /* <template-param> encodes only the template parameter position,
4742 : not its template arguments, which is fine here. */
4743 631 : write_template_param (parm);
4744 631 : if (templ)
4745 536 : add_substitution (templ);
4746 : }
4747 :
4748 : /* Non-terminal <substitution>.
4749 :
4750 : <substitution> ::= S <seq-id> _
4751 : ::= S_ */
4752 :
4753 : static void
4754 181831039 : write_substitution (const int seq_id)
4755 : {
4756 181831039 : MANGLE_TRACE ("substitution", "");
4757 :
4758 181831039 : write_char ('S');
4759 181831039 : if (seq_id > 0)
4760 158393156 : write_number (seq_id - 1, /*unsigned=*/1, 36);
4761 181831039 : write_char ('_');
4762 181831039 : }
4763 :
4764 : /* Start mangling ENTITY. */
4765 :
4766 : static inline void
4767 232066931 : start_mangling (const tree entity)
4768 : {
4769 232066931 : G = {};
4770 232066931 : G.entity = entity;
4771 232066931 : obstack_free (&name_obstack, name_base);
4772 232066931 : mangle_obstack = &name_obstack;
4773 232066931 : name_base = obstack_alloc (&name_obstack, 0);
4774 232066931 : }
4775 :
4776 : /* Done with mangling. Release the data. */
4777 :
4778 : static void
4779 232066931 : finish_mangling_internal (void)
4780 : {
4781 : /* Clear all the substitutions. */
4782 232066931 : vec_safe_truncate (G.substitutions, 0);
4783 :
4784 232066931 : if (G.mod)
4785 7820 : mangle_module_fini ();
4786 :
4787 : /* Null-terminate the string. */
4788 232066931 : write_char ('\0');
4789 232066931 : }
4790 :
4791 :
4792 : /* Like finish_mangling_internal, but return the mangled string. */
4793 :
4794 : static inline const char *
4795 455767 : finish_mangling (void)
4796 : {
4797 455767 : finish_mangling_internal ();
4798 455767 : return (const char *) obstack_finish (mangle_obstack);
4799 : }
4800 :
4801 : /* Like finish_mangling_internal, but return an identifier. */
4802 :
4803 : static tree
4804 231611164 : finish_mangling_get_identifier (void)
4805 : {
4806 231611164 : finish_mangling_internal ();
4807 : /* Don't obstack_finish here, and the next start_mangling will
4808 : remove the identifier. */
4809 231611164 : return get_identifier ((const char *) obstack_base (mangle_obstack));
4810 : }
4811 :
4812 : /* Initialize data structures for mangling. */
4813 :
4814 : void
4815 101479 : init_mangle (void)
4816 : {
4817 101479 : gcc_obstack_init (&name_obstack);
4818 101479 : name_base = obstack_alloc (&name_obstack, 0);
4819 101479 : vec_alloc (G.substitutions, 0);
4820 :
4821 : /* Cache these identifiers for quick comparison when checking for
4822 : standard substitutions. */
4823 101479 : subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
4824 101479 : subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
4825 101479 : subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
4826 101479 : subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
4827 101479 : subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
4828 101479 : subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
4829 101479 : }
4830 :
4831 : /* Generate a mangling for MODULE's global initializer fn. */
4832 :
4833 : tree
4834 2069 : mangle_module_global_init (int module)
4835 : {
4836 2069 : start_mangling (NULL_TREE);
4837 :
4838 2069 : write_string ("_ZGI");
4839 2069 : write_module (module, true);
4840 :
4841 2069 : return finish_mangling_get_identifier ();
4842 : }
4843 :
4844 : /* Generate the mangled name of DECL. */
4845 :
4846 : static tree
4847 224949221 : mangle_decl_string (const tree decl)
4848 : {
4849 224949221 : tree result;
4850 224949221 : tree saved_fn = current_function_decl;
4851 :
4852 : /* We shouldn't be trying to mangle an uninstantiated template. */
4853 224949221 : gcc_assert (!type_dependent_expression_p (decl));
4854 :
4855 224949221 : current_function_decl = NULL_TREE;
4856 224949221 : iloc_sentinel ils (DECL_SOURCE_LOCATION (decl));
4857 :
4858 224949221 : start_mangling (decl);
4859 :
4860 224949221 : if (TREE_CODE (decl) == TYPE_DECL)
4861 338871 : write_type (TREE_TYPE (decl));
4862 : else
4863 224610350 : write_mangled_name (decl, true);
4864 :
4865 224949221 : result = finish_mangling_get_identifier ();
4866 224949221 : if (DEBUG_MANGLE)
4867 : fprintf (stderr, "mangle_decl_string = '%s'\n\n",
4868 : IDENTIFIER_POINTER (result));
4869 :
4870 224949221 : current_function_decl = saved_fn;
4871 224949221 : return result;
4872 224949221 : }
4873 :
4874 : /* Return an identifier for the external mangled name of DECL. */
4875 :
4876 : static tree
4877 168180024 : get_mangled_id (tree decl)
4878 : {
4879 168180024 : tree id = mangle_decl_string (decl);
4880 168180024 : return targetm.mangle_decl_assembler_name (decl, id);
4881 : }
4882 :
4883 : /* Create an identifier for the external mangled name of DECL. */
4884 :
4885 : void
4886 168188695 : mangle_decl (const tree decl)
4887 : {
4888 168188695 : tree id;
4889 168188695 : bool dep;
4890 :
4891 : /* Don't bother mangling uninstantiated templates. */
4892 168188695 : ++processing_template_decl;
4893 168188695 : if (TREE_CODE (decl) == TYPE_DECL)
4894 339356 : dep = dependent_type_p (TREE_TYPE (decl));
4895 : else
4896 334373677 : dep = (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
4897 279769483 : && any_dependent_template_arguments_p (DECL_TI_ARGS (decl)));
4898 168188695 : --processing_template_decl;
4899 168188695 : if (dep)
4900 : return;
4901 :
4902 : /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
4903 : It is not needed to assign names to anonymous namespace, but we use the
4904 : "<anon>" marker to be able to tell if type is C++ ODR type or type
4905 : produced by other language. */
4906 168180509 : if (TREE_CODE (decl) == TYPE_DECL
4907 339356 : && TYPE_STUB_DECL (TREE_TYPE (decl))
4908 168509138 : && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl))))
4909 485 : id = get_identifier ("<anon>");
4910 : else
4911 : {
4912 168180024 : gcc_assert (TREE_CODE (decl) != TYPE_DECL
4913 : || !no_linkage_check (TREE_TYPE (decl), true));
4914 168180024 : if (abi_version_at_least (10))
4915 168061986 : if (tree fn = decl_function_context (decl))
4916 3674258 : maybe_check_abi_tags (fn, decl);
4917 168180024 : id = get_mangled_id (decl);
4918 : }
4919 168180509 : SET_DECL_ASSEMBLER_NAME (decl, id);
4920 :
4921 168180509 : if (G.need_cxx17_warning
4922 168180509 : && (TREE_PUBLIC (decl) || DECL_REALLY_EXTERN (decl)))
4923 10 : warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wnoexcept_type,
4924 : "mangled name for %qD will change in C++17 because the "
4925 : "exception specification is part of a function type",
4926 : decl);
4927 :
4928 168180509 : if (id != DECL_NAME (decl)
4929 : /* Don't do this for a fake symbol we aren't going to emit anyway. */
4930 165557999 : && TREE_CODE (decl) != TYPE_DECL
4931 333399152 : && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl))
4932 : {
4933 144363672 : int save_ver = flag_abi_version;
4934 144363672 : tree id2 = NULL_TREE;
4935 :
4936 144363672 : if (!DECL_REALLY_EXTERN (decl))
4937 : {
4938 86860160 : record_mangling (decl, G.need_abi_warning);
4939 :
4940 86860160 : if (!G.need_abi_warning)
4941 : return;
4942 :
4943 37731 : flag_abi_version = flag_abi_compat_version;
4944 37731 : id2 = mangle_decl_string (decl);
4945 37731 : id2 = targetm.mangle_decl_assembler_name (decl, id2);
4946 37731 : flag_abi_version = save_ver;
4947 :
4948 37731 : if (id2 != id)
4949 37615 : note_mangling_alias (decl, id2);
4950 : }
4951 :
4952 57541243 : if (warn_abi)
4953 : {
4954 56731661 : const char fabi_version[] = "-fabi-version";
4955 :
4956 56731661 : if (flag_abi_compat_version != warn_abi_version
4957 56730934 : || id2 == NULL_TREE)
4958 : {
4959 56731466 : flag_abi_version = warn_abi_version;
4960 56731466 : id2 = mangle_decl_string (decl);
4961 56731466 : id2 = targetm.mangle_decl_assembler_name (decl, id2);
4962 : }
4963 56731661 : flag_abi_version = save_ver;
4964 :
4965 56731661 : if (id2 == id)
4966 : /* OK. */;
4967 266 : else if (warn_abi_version != 0
4968 266 : && abi_version_at_least (warn_abi_version))
4969 222 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
4970 : "the mangled name of %qD changed between "
4971 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4972 : G.entity, fabi_version, warn_abi_version, id2,
4973 : fabi_version, save_ver, id);
4974 : else
4975 44 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
4976 : "the mangled name of %qD changes between "
4977 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4978 : G.entity, fabi_version, save_ver, id,
4979 : fabi_version, warn_abi_version, id2);
4980 : }
4981 :
4982 57541243 : flag_abi_version = save_ver;
4983 : }
4984 : }
4985 :
4986 : /* Generate the mangled representation of TYPE. */
4987 :
4988 : const char *
4989 455767 : mangle_type_string (const tree type)
4990 : {
4991 455767 : const char *result;
4992 :
4993 455767 : start_mangling (type);
4994 455767 : write_type (type);
4995 455767 : result = finish_mangling ();
4996 455767 : if (DEBUG_MANGLE)
4997 : fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
4998 455767 : return result;
4999 : }
5000 :
5001 : /* Create an identifier for the mangled name of a special component
5002 : for belonging to TYPE. CODE is the ABI-specified code for this
5003 : component. */
5004 :
5005 : static tree
5006 5834787 : mangle_special_for_type (const tree type, const char *code)
5007 : {
5008 5834787 : tree result;
5009 :
5010 : /* We don't have an actual decl here for the special component, so
5011 : we can't just process the <encoded-name>. Instead, fake it. */
5012 5834787 : start_mangling (type);
5013 :
5014 : /* Start the mangling. */
5015 5834787 : write_string ("_Z");
5016 5834787 : write_string (code);
5017 :
5018 : /* Add the type. */
5019 5834787 : write_type (type);
5020 5834787 : result = finish_mangling_get_identifier ();
5021 :
5022 5834787 : if (DEBUG_MANGLE)
5023 : fprintf (stderr, "mangle_special_for_type = %s\n\n",
5024 : IDENTIFIER_POINTER (result));
5025 :
5026 5834787 : return result;
5027 : }
5028 :
5029 : /* Create an identifier for the mangled representation of the typeinfo
5030 : structure for TYPE. */
5031 :
5032 : tree
5033 3337018 : mangle_typeinfo_for_type (const tree type)
5034 : {
5035 3337018 : return mangle_special_for_type (type, "TI");
5036 : }
5037 :
5038 : /* Create an identifier for the mangled name of the NTBS containing
5039 : the mangled name of TYPE. */
5040 :
5041 : tree
5042 447413 : mangle_typeinfo_string_for_type (const tree type)
5043 : {
5044 447413 : return mangle_special_for_type (type, "TS");
5045 : }
5046 :
5047 : /* Create an identifier for the mangled name of the vtable for TYPE. */
5048 :
5049 : tree
5050 1862443 : mangle_vtbl_for_type (const tree type)
5051 : {
5052 1862443 : return mangle_special_for_type (type, "TV");
5053 : }
5054 :
5055 : /* Returns an identifier for the mangled name of the VTT for TYPE. */
5056 :
5057 : tree
5058 187913 : mangle_vtt_for_type (const tree type)
5059 : {
5060 187913 : return mangle_special_for_type (type, "TT");
5061 : }
5062 :
5063 : /* Returns an identifier for the mangled name of the decomposition
5064 : artificial variable DECL. DECLS is the vector of the VAR_DECLs
5065 : for the identifier-list. */
5066 :
5067 : tree
5068 889 : mangle_decomp (const tree decl, vec<tree> &decls)
5069 : {
5070 889 : gcc_assert (!type_dependent_expression_p (decl));
5071 :
5072 889 : location_t saved_loc = input_location;
5073 889 : input_location = DECL_SOURCE_LOCATION (decl);
5074 :
5075 889 : check_abi_tags (decl);
5076 889 : start_mangling (decl);
5077 889 : write_string ("_Z");
5078 :
5079 889 : tree context = decl_mangling_context (decl);
5080 889 : gcc_assert (context != NULL_TREE);
5081 :
5082 889 : bool nested = false;
5083 889 : bool local = false;
5084 889 : if (DECL_NAMESPACE_STD_P (context))
5085 9 : write_string ("St");
5086 880 : else if (TREE_CODE (context) == FUNCTION_DECL)
5087 : {
5088 267 : local = true;
5089 267 : write_char ('Z');
5090 267 : write_encoding (context);
5091 267 : write_char ('E');
5092 : }
5093 613 : else if (context != global_namespace)
5094 : {
5095 100 : nested = true;
5096 100 : write_char ('N');
5097 100 : write_prefix (context);
5098 : }
5099 :
5100 889 : write_string ("DC");
5101 889 : unsigned int i;
5102 889 : tree d;
5103 2944 : FOR_EACH_VEC_ELT (decls, i, d)
5104 2055 : write_unqualified_name (d);
5105 889 : write_char ('E');
5106 :
5107 889 : if (tree tags = get_abi_tags (decl))
5108 : {
5109 : /* We didn't emit ABI tags for structured bindings before ABI 19. */
5110 30 : if (!G.need_abi_warning
5111 30 : && TREE_PUBLIC (decl)
5112 120 : && abi_warn_or_compat_version_crosses (19))
5113 30 : G.need_abi_warning = 1;
5114 :
5115 30 : if (abi_version_at_least (19))
5116 30 : write_abi_tags (tags);
5117 : }
5118 :
5119 889 : if (nested)
5120 100 : write_char ('E');
5121 789 : else if (local && DECL_DISCRIMINATOR_P (decl))
5122 267 : write_discriminator (discriminator_for_local_entity (decl));
5123 :
5124 889 : tree id = finish_mangling_get_identifier ();
5125 889 : if (DEBUG_MANGLE)
5126 : fprintf (stderr, "mangle_decomp = '%s'\n\n",
5127 : IDENTIFIER_POINTER (id));
5128 :
5129 889 : input_location = saved_loc;
5130 :
5131 889 : if (warn_abi && G.need_abi_warning)
5132 : {
5133 0 : const char fabi_version[] = "-fabi-version";
5134 0 : tree id2 = id;
5135 0 : int save_ver = flag_abi_version;
5136 :
5137 0 : if (flag_abi_version != warn_abi_version)
5138 : {
5139 0 : flag_abi_version = warn_abi_version;
5140 0 : id2 = mangle_decomp (decl, decls);
5141 0 : flag_abi_version = save_ver;
5142 : }
5143 :
5144 0 : if (id2 == id)
5145 : /* OK. */;
5146 0 : else if (warn_abi_version != 0
5147 0 : && abi_version_at_least (warn_abi_version))
5148 0 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
5149 : "the mangled name of %qD changed between "
5150 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
5151 : G.entity, fabi_version, warn_abi_version, id2,
5152 : fabi_version, save_ver, id);
5153 : else
5154 0 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
5155 : "the mangled name of %qD changes between "
5156 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
5157 : G.entity, fabi_version, save_ver, id,
5158 : fabi_version, warn_abi_version, id2);
5159 : }
5160 :
5161 889 : return id;
5162 : }
5163 :
5164 : /* Return an identifier for a construction vtable group. TYPE is
5165 : the most derived class in the hierarchy; BINFO is the base
5166 : subobject for which this construction vtable group will be used.
5167 :
5168 : This mangling isn't part of the ABI specification; in the ABI
5169 : specification, the vtable group is dumped in the same COMDAT as the
5170 : main vtable, and is referenced only from that vtable, so it doesn't
5171 : need an external name. For binary formats without COMDAT sections,
5172 : though, we need external names for the vtable groups.
5173 :
5174 : We use the production
5175 :
5176 : <special-name> ::= TC <type> <offset number> _ <base type> */
5177 :
5178 : tree
5179 257304 : mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
5180 : {
5181 257304 : tree result;
5182 :
5183 257304 : start_mangling (type);
5184 :
5185 257304 : write_string ("_Z");
5186 257304 : write_string ("TC");
5187 257304 : write_type (type);
5188 257304 : write_integer_cst (BINFO_OFFSET (binfo));
5189 257304 : write_char ('_');
5190 257304 : write_type (BINFO_TYPE (binfo));
5191 :
5192 257304 : result = finish_mangling_get_identifier ();
5193 257304 : if (DEBUG_MANGLE)
5194 : fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n",
5195 : IDENTIFIER_POINTER (result));
5196 257304 : return result;
5197 : }
5198 :
5199 : /* Mangle a this pointer or result pointer adjustment.
5200 :
5201 : <call-offset> ::= h <fixed offset number> _
5202 : ::= v <fixed offset number> _ <virtual offset number> _ */
5203 :
5204 : static void
5205 491850 : mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
5206 : {
5207 491850 : write_char (virtual_offset ? 'v' : 'h');
5208 :
5209 : /* For either flavor, write the fixed offset. */
5210 491850 : write_integer_cst (fixed_offset);
5211 491850 : write_char ('_');
5212 :
5213 : /* For a virtual thunk, add the virtual offset. */
5214 491850 : if (virtual_offset)
5215 : {
5216 368252 : write_integer_cst (virtual_offset);
5217 368252 : write_char ('_');
5218 : }
5219 491850 : }
5220 :
5221 : /* Return an identifier for the mangled name of a this-adjusting or
5222 : covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
5223 : to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
5224 : is a virtual thunk, and it is the vtbl offset in
5225 : bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
5226 : zero for a covariant thunk. Note, that FN_DECL might be a covariant
5227 : thunk itself. A covariant thunk name always includes the adjustment
5228 : for the this pointer, even if there is none.
5229 :
5230 : <special-name> ::= T <call-offset> <base encoding>
5231 : ::= Tc <this_adjust call-offset> <result_adjust call-offset>
5232 : <base encoding> */
5233 :
5234 : tree
5235 491463 : mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
5236 : tree virtual_offset, tree thunk)
5237 : {
5238 491463 : tree result;
5239 :
5240 491463 : if (abi_version_at_least (11))
5241 491460 : maybe_check_abi_tags (fn_decl, thunk, 11);
5242 :
5243 491463 : start_mangling (fn_decl);
5244 :
5245 491463 : write_string ("_Z");
5246 491463 : write_char ('T');
5247 :
5248 491463 : if (!this_adjusting)
5249 : {
5250 : /* Covariant thunk with no this adjustment */
5251 217 : write_char ('c');
5252 217 : mangle_call_offset (integer_zero_node, NULL_TREE);
5253 217 : mangle_call_offset (fixed_offset, virtual_offset);
5254 : }
5255 491246 : else if (!DECL_THUNK_P (fn_decl))
5256 : /* Plain this adjusting thunk. */
5257 491076 : mangle_call_offset (fixed_offset, virtual_offset);
5258 : else
5259 : {
5260 : /* This adjusting thunk to covariant thunk. */
5261 170 : write_char ('c');
5262 170 : mangle_call_offset (fixed_offset, virtual_offset);
5263 170 : fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
5264 170 : virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
5265 170 : if (virtual_offset)
5266 124 : virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
5267 170 : mangle_call_offset (fixed_offset, virtual_offset);
5268 170 : fn_decl = THUNK_TARGET (fn_decl);
5269 : }
5270 :
5271 : /* Scoped name. */
5272 491463 : write_encoding (fn_decl);
5273 :
5274 491463 : result = finish_mangling_get_identifier ();
5275 491463 : if (DEBUG_MANGLE)
5276 : fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result));
5277 491463 : return result;
5278 : }
5279 :
5280 : /* Handle ABI backwards compatibility for past bugs where we didn't call
5281 : check_abi_tags in places where it's needed: call check_abi_tags and warn if
5282 : it makes a difference. If FOR_DECL is non-null, it's the declaration
5283 : that we're actually trying to mangle; if it's null, we're mangling the
5284 : guard variable for T. */
5285 :
5286 : static void
5287 4170580 : maybe_check_abi_tags (tree t, tree for_decl, int ver)
5288 : {
5289 4170580 : if (DECL_ASSEMBLER_NAME_SET_P (t))
5290 : return;
5291 :
5292 826177 : tree oldtags = get_abi_tags (t);
5293 :
5294 826177 : mangle_decl (t);
5295 :
5296 826177 : tree newtags = get_abi_tags (t);
5297 826177 : if (newtags && newtags != oldtags
5298 36 : && abi_version_crosses (ver))
5299 : {
5300 12 : if (for_decl && DECL_THUNK_P (for_decl))
5301 3 : warning_at (DECL_SOURCE_LOCATION (t), OPT_Wabi,
5302 : "the mangled name of a thunk for %qD changes between "
5303 : "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
5304 : t, flag_abi_version, warn_abi_version);
5305 9 : else if (for_decl)
5306 6 : warning_at (DECL_SOURCE_LOCATION (for_decl), OPT_Wabi,
5307 : "the mangled name of %qD changes between "
5308 : "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
5309 : for_decl, flag_abi_version, warn_abi_version);
5310 : else
5311 3 : warning_at (DECL_SOURCE_LOCATION (t), OPT_Wabi,
5312 : "the mangled name of the initialization guard variable "
5313 : "for %qD changes between %<-fabi-version=%d%> and "
5314 : "%<-fabi-version=%d%>",
5315 : t, flag_abi_version, warn_abi_version);
5316 : }
5317 : }
5318 :
5319 : /* Write out the appropriate string for this variable when generating
5320 : another mangled name based on this one. */
5321 :
5322 : static void
5323 7630 : write_guarded_var_name (const tree variable)
5324 : {
5325 7630 : if (DECL_NAME (variable)
5326 7630 : && startswith (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR"))
5327 : /* The name of a guard variable for a reference temporary should refer
5328 : to the reference, not the temporary. */
5329 6 : write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
5330 7624 : else if (DECL_DECOMPOSITION_P (variable)
5331 751 : && DECL_NAME (variable) == NULL_TREE
5332 7896 : && startswith (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (variable)),
5333 : "_Z"))
5334 : /* The name of a guard variable for a structured binding needs special
5335 : casing. */
5336 272 : write_string (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (variable)) + 2);
5337 : else
5338 7352 : write_name (variable, /*ignore_local_scope=*/0);
5339 7630 : }
5340 :
5341 : /* Return an identifier for the name of an initialization guard
5342 : variable for indicated VARIABLE. */
5343 :
5344 : tree
5345 4868 : mangle_guard_variable (const tree variable)
5346 : {
5347 4868 : if (abi_version_at_least (10))
5348 4862 : maybe_check_abi_tags (variable);
5349 4868 : start_mangling (variable);
5350 4868 : write_string ("_ZGV");
5351 4868 : write_guarded_var_name (variable);
5352 4868 : return finish_mangling_get_identifier ();
5353 : }
5354 :
5355 : /* Return an identifier for the name of a thread_local initialization
5356 : function for VARIABLE. */
5357 :
5358 : tree
5359 1190 : mangle_tls_init_fn (const tree variable)
5360 : {
5361 1190 : check_abi_tags (variable);
5362 1190 : start_mangling (variable);
5363 1190 : write_string ("_ZTH");
5364 1190 : write_guarded_var_name (variable);
5365 1190 : return finish_mangling_get_identifier ();
5366 : }
5367 :
5368 : /* Return an identifier for the name of a thread_local wrapper
5369 : function for VARIABLE. */
5370 :
5371 : #define TLS_WRAPPER_PREFIX "_ZTW"
5372 :
5373 : tree
5374 749 : mangle_tls_wrapper_fn (const tree variable)
5375 : {
5376 749 : check_abi_tags (variable);
5377 749 : start_mangling (variable);
5378 749 : write_string (TLS_WRAPPER_PREFIX);
5379 749 : write_guarded_var_name (variable);
5380 749 : return finish_mangling_get_identifier ();
5381 : }
5382 :
5383 : /* Return true iff FN is a thread_local wrapper function. */
5384 :
5385 : bool
5386 2659197 : decl_tls_wrapper_p (const tree fn)
5387 : {
5388 2659197 : if (TREE_CODE (fn) != FUNCTION_DECL)
5389 : return false;
5390 2117129 : tree name = DECL_NAME (fn);
5391 2117129 : return startswith (IDENTIFIER_POINTER (name), TLS_WRAPPER_PREFIX);
5392 : }
5393 :
5394 : /* Return an identifier for the name of a temporary variable used to
5395 : initialize a static reference. This is now part of the ABI. */
5396 :
5397 : tree
5398 823 : mangle_ref_init_variable (const tree variable)
5399 : {
5400 823 : start_mangling (variable);
5401 823 : write_string ("_ZGR");
5402 823 : check_abi_tags (variable);
5403 823 : write_guarded_var_name (variable);
5404 : /* Avoid name clashes with aggregate initialization of multiple
5405 : references at once. */
5406 823 : write_compact_number (current_ref_temp_count++);
5407 823 : return finish_mangling_get_identifier ();
5408 : }
5409 :
5410 : /* Return an identifier for the mangled name of a C++20 template parameter
5411 : object for template argument EXPR. */
5412 :
5413 : tree
5414 67801 : mangle_template_parm_object (tree expr)
5415 : {
5416 67801 : start_mangling (expr);
5417 67801 : write_string ("_ZTAX");
5418 67801 : write_expression (expr);
5419 67801 : write_char ('E');
5420 67801 : return finish_mangling_get_identifier ();
5421 : }
5422 :
5423 : /* Given a CLASS_TYPE, such as a record for std::bad_exception this
5424 : function generates a mangled name for the vtable map variable of
5425 : the class type. For example, if the class type is
5426 : "std::bad_exception", the mangled name for the class is
5427 : "St13bad_exception". This function would generate the name
5428 : "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
5429 : "_VTV<std::bad_exception>::__vtable_map". */
5430 :
5431 :
5432 : char *
5433 6 : get_mangled_vtable_map_var_name (tree class_type)
5434 : {
5435 6 : char *var_name = NULL;
5436 6 : const char *prefix = "_ZN4_VTVI";
5437 6 : const char *postfix = "E12__vtable_mapE";
5438 :
5439 6 : gcc_assert (TREE_CODE (class_type) == RECORD_TYPE);
5440 :
5441 6 : tree class_id = DECL_ASSEMBLER_NAME (TYPE_NAME (class_type));
5442 :
5443 6 : if (strstr (IDENTIFIER_POINTER (class_id), "<anon>") != NULL)
5444 : {
5445 0 : class_id = get_mangled_id (TYPE_NAME (class_type));
5446 0 : vtbl_register_mangled_name (TYPE_NAME (class_type), class_id);
5447 : }
5448 :
5449 6 : unsigned int len = strlen (IDENTIFIER_POINTER (class_id)) +
5450 : strlen (prefix) +
5451 6 : strlen (postfix) + 1;
5452 :
5453 6 : var_name = (char *) xmalloc (len);
5454 :
5455 6 : sprintf (var_name, "%s%s%s", prefix, IDENTIFIER_POINTER (class_id), postfix);
5456 :
5457 6 : return var_name;
5458 : }
5459 :
5460 : #include "gt-cp-mangle.h"
|
