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 14575150 : abi_check (int ver)
285 : {
286 72710393 : if (abi_warn_or_compat_version_crosses (ver))
287 87813 : G.need_abi_warning = true;
288 14575150 : 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 1413818107 : maybe_template_info (const tree decl)
296 : {
297 1413818107 : 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 539279241 : const tree type = TREE_TYPE (decl);
302 :
303 539279241 : if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type))
304 429319982 : return TYPE_TEMPLATE_INFO (type);
305 : }
306 : else
307 : {
308 : /* Check if the template is a primary template. */
309 874538866 : if (DECL_LANG_SPECIFIC (decl) != NULL
310 873233607 : && VAR_OR_FUNCTION_DECL_P (decl)
311 743013483 : && DECL_TEMPLATE_INFO (decl)
312 1455791128 : && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)))
313 89364558 : 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 3316095 : write_exception_spec (tree spec)
365 : {
366 :
367 3316095 : if (!spec || spec == noexcept_false_spec)
368 : /* Nothing. */
369 : return;
370 :
371 37516 : if (!flag_noexcept_type)
372 : {
373 17 : G.need_cxx17_warning = true;
374 17 : return;
375 : }
376 :
377 37499 : if (spec == noexcept_true_spec || spec == empty_except_spec)
378 37484 : 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 4957631583 : canonicalize_for_substitution (tree node)
406 : {
407 : /* For a TYPE_DECL, use the type instead. */
408 4957631583 : if (TREE_CODE (node) == TYPE_DECL)
409 5086 : node = TREE_TYPE (node);
410 4957631583 : if (TYPE_P (node)
411 3644247547 : && TYPE_CANONICAL (node) != node
412 5369437183 : && TYPE_MAIN_VARIANT (node) != node)
413 : {
414 117108818 : 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 117108818 : 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 28462 : node = build_qualified_type (TYPE_MAIN_VARIANT (node),
422 28462 : TYPE_QUALS (node));
423 : else
424 117080356 : node = cp_build_qualified_type (TYPE_MAIN_VARIANT (node),
425 : cp_type_quals (node));
426 117108818 : if (FUNC_OR_METHOD_TYPE_P (node))
427 : {
428 28471 : node = build_ref_qualified_type (node, type_memfn_rqual (orig));
429 28471 : tree r = canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig));
430 28471 : if (flag_noexcept_type)
431 28427 : node = build_exception_variant (node, r);
432 : else
433 : /* Set the warning flag if appropriate. */
434 44 : write_exception_spec (r);
435 : }
436 : }
437 4957631583 : 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 1285026941 : add_substitution (tree node)
445 : {
446 1285026941 : tree c;
447 :
448 1285026941 : 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 1285026941 : c = canonicalize_for_substitution (node);
454 1285026941 : 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 1285026941 : node = c;
458 :
459 : /* Make sure NODE isn't already a candidate. */
460 1285026941 : if (flag_checking)
461 : {
462 : int i;
463 : tree candidate;
464 :
465 6660717363 : FOR_EACH_VEC_SAFE_ELT (G.substitutions, i, candidate)
466 5375690538 : if (candidate)
467 : {
468 5375683060 : gcc_assert (!(DECL_P (node) && node == candidate));
469 5375683060 : 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 1285026941 : vec_safe_push (G.substitutions, node);
476 :
477 1285026941 : if (DEBUG_MANGLE)
478 : dump_substitution_candidates ();
479 1285026941 : }
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 4350634995 : is_std_substitution (const tree node,
488 : const substitution_identifier_index_t index)
489 : {
490 4350634995 : tree type = NULL_TREE;
491 4350634995 : tree decl = NULL_TREE;
492 :
493 8676338097 : auto std_substitution_p = [&] (tree decl, tree type)
494 : {
495 4325703102 : if (!DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl)))
496 : return false;
497 :
498 1671808238 : if (!(TYPE_LANG_SPECIFIC (type) && TYPE_TEMPLATE_INFO (type)))
499 : return false;
500 :
501 1243212274 : tree tmpl = TYPE_TI_TEMPLATE (type);
502 1243212274 : if (DECL_NAME (tmpl) != subst_identifiers[index])
503 : return false;
504 :
505 148443596 : if (modules_p () && get_originating_module (tmpl, true) >= 0)
506 27 : return false;
507 :
508 : return true;
509 4350634995 : };
510 :
511 4350634995 : if (TREE_CODE (node) == TYPE_DECL || DECL_CLASS_TEMPLATE_P (node))
512 : {
513 3438509288 : type = TREE_TYPE (node);
514 3438509288 : decl = node;
515 : }
516 912125707 : else if (CLASS_TYPE_P (node))
517 : {
518 4895337 : type = node;
519 4895337 : 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 907230370 : 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 3443404625 : 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 1906942771 : get_abi_tags (tree t)
540 : {
541 1906942771 : if (!t || TREE_CODE (t) == NAMESPACE_DECL)
542 : return NULL_TREE;
543 :
544 1777587346 : if (DECL_P (t) && DECL_DECLARES_TYPE_P (t))
545 477882151 : t = TREE_TYPE (t);
546 :
547 1777587346 : if (TREE_CODE (t) == TEMPLATE_DECL && DECL_TEMPLATE_RESULT (t))
548 : {
549 17539303 : tree tags = get_abi_tags (DECL_TEMPLATE_RESULT (t));
550 : /* We used to overlook abi_tag on function and variable templates. */
551 17539303 : if (tags && abi_check (19))
552 10 : return tags;
553 : else
554 : return NULL_TREE;
555 : }
556 :
557 1760048043 : tree attrs;
558 1760048043 : if (TYPE_P (t))
559 1530179352 : attrs = TYPE_ATTRIBUTES (t);
560 : else
561 229868691 : attrs = DECL_ATTRIBUTES (t);
562 :
563 1760048043 : tree tags = lookup_attribute ("abi_tag", attrs);
564 1760048043 : if (tags)
565 12209458 : 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 6977935 : is_std_substitution_char (const tree node,
576 : const substitution_identifier_index_t index)
577 : {
578 6977935 : tree args;
579 : /* Check NODE's name is ::std::identifier. */
580 6977935 : if (!is_std_substitution (node, index))
581 : return 0;
582 : /* Figure out its template args. */
583 4418923 : if (DECL_P (node))
584 0 : args = DECL_TI_ARGS (node);
585 4418923 : else if (CLASS_TYPE_P (node))
586 4418923 : 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 4418923 : return
592 4418923 : TREE_VEC_LENGTH (args) == 1
593 4418923 : && 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 2367898739 : find_substitution (tree node)
632 : {
633 2367898739 : int i;
634 2367898739 : const int size = vec_safe_length (G.substitutions);
635 2367898739 : tree decl;
636 2367898739 : tree type;
637 2367898739 : const char *abbr = NULL;
638 :
639 2367898739 : 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 2367898739 : node = canonicalize_for_substitution (node);
646 :
647 : /* Check for builtin substitutions. */
648 :
649 2367898739 : decl = TYPE_P (node) ? TYPE_NAME (node) : node;
650 2367898739 : type = TYPE_P (node) ? node : TREE_TYPE (node);
651 :
652 : /* Check for std::allocator. */
653 2367898739 : if (decl
654 2198518693 : && is_std_substitution (decl, SUBID_ALLOCATOR)
655 2510814427 : && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)))
656 : abbr = "Sa";
657 :
658 : /* Check for std::basic_string. */
659 2302524340 : 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 2302368463 : else if (TYPE_P (node)
688 1530158723 : && cp_type_quals (type) == TYPE_UNQUALIFIED
689 1442504041 : && CLASS_TYPE_P (type)
690 607650290 : && CLASSTYPE_USE_TEMPLATE (type)
691 2750463278 : && CLASSTYPE_TEMPLATE_INFO (type) != NULL)
692 : {
693 : /* First, check for the template
694 : args <char, std::char_traits<char> > . */
695 448094815 : tree args = CLASSTYPE_TI_ARGS (type);
696 448094815 : if (TREE_VEC_LENGTH (args) == 2
697 139845495 : && template_args_equal (TREE_VEC_ELT (args, 0), char_type_node)
698 454993719 : && is_std_substitution_char (TREE_VEC_ELT (args, 1),
699 : SUBID_CHAR_TRAITS))
700 : {
701 : /* Got them. Is this basic_istream? */
702 4339898 : if (is_std_substitution (decl, SUBID_BASIC_ISTREAM))
703 : abbr = "Si";
704 : /* Or basic_ostream? */
705 4027902 : else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM))
706 : abbr = "So";
707 : /* Or basic_iostream? */
708 3626273 : else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM))
709 2138132358 : abbr = "Sd";
710 : }
711 : }
712 :
713 : /* Check for namespace std. */
714 1854273648 : else if (decl && DECL_NAMESPACE_STD_P (decl))
715 : {
716 229766381 : write_string ("St");
717 229766381 : return 1;
718 : }
719 :
720 2138132358 : tree tags = NULL_TREE;
721 2138132358 : if (OVERLOAD_TYPE_P (node) || DECL_CLASS_TEMPLATE_P (node))
722 1052297201 : tags = get_abi_tags (type);
723 : /* Now check the list of available substitutions for this mangling
724 : operation. */
725 2138132358 : if (!abbr || tags)
726 9276153684 : for (i = 0; i < size; ++i)
727 7386004955 : 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 7385994885 : if (decl == candidate
732 7322869076 : || (TYPE_P (candidate) && type && TYPE_P (node)
733 3229513085 : && same_type_p (type, candidate))
734 14591450246 : || NESTED_TEMPLATE_MATCH (node, candidate))
735 : {
736 181569535 : write_substitution (i);
737 181569535 : return 1;
738 : }
739 : }
740 :
741 1890148729 : if (!abbr)
742 : /* No substitution found. */
743 : return 0;
744 :
745 66414100 : write_string (abbr);
746 66414100 : 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 224708295 : unmangled_name_p (const tree decl)
761 : {
762 224708295 : if (TREE_CODE (decl) == FUNCTION_DECL)
763 : {
764 : /* The names of `extern "C"' functions are not mangled. */
765 190562810 : return (DECL_EXTERN_C_FUNCTION_P (decl)
766 : /* But overloaded operator names *are* mangled. */
767 2288677 : && !DECL_OVERLOADED_OPERATOR_P (decl));
768 : }
769 34145485 : else if (VAR_P (decl))
770 : {
771 : /* extern "C" declarations aren't mangled. */
772 34142102 : if (DECL_NAMESPACE_SCOPE_P (decl) && DECL_EXTERN_C_P (decl))
773 : return true;
774 :
775 : /* static variables are mangled. */
776 33928185 : if (!DECL_EXTERNAL_LINKAGE_P (decl))
777 : return false;
778 :
779 : /* Other variables at non-global scope are mangled. */
780 33709903 : if (CP_DECL_CONTEXT (decl) != global_namespace)
781 : return false;
782 :
783 : /* Variable template instantiations are mangled. */
784 124349 : if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
785 122955 : && variable_template_p (DECL_TI_TEMPLATE (decl)))
786 : return false;
787 :
788 : /* Declarations with ABI tags are mangled. */
789 113643 : if (get_abi_tags (decl))
790 : return false;
791 :
792 : // Declarations attached to a named module are mangled
793 113297 : 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 224708295 : write_mangled_name (const tree decl, bool top_level)
811 : {
812 224708295 : MANGLE_TRACE_TREE ("mangled-name", decl);
813 :
814 224708295 : check_abi_tags (decl);
815 :
816 224708295 : if (unmangled_name_p (decl))
817 : {
818 2615770 : if (top_level)
819 2615483 : 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 222092525 : write_string ("_Z");
834 222092525 : write_encoding (decl);
835 : }
836 :
837 : /* If this is a coroutine helper, then append an appropriate string to
838 : identify which. */
839 224708295 : 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 224708295 : }
849 :
850 : /* Returns true if the return type of DECL is part of its signature, and
851 : therefore its mangling. */
852 :
853 : bool
854 381743260 : mangle_return_type_p (tree decl)
855 : {
856 381743260 : return (!DECL_CONSTRUCTOR_P (decl)
857 320408620 : && !DECL_DESTRUCTOR_P (decl)
858 305934179 : && !DECL_CONV_FN_P (decl)
859 684867372 : && maybe_template_info (decl));
860 : }
861 :
862 : /* <constraint-expression> ::= <expression> */
863 :
864 : static void
865 3286940 : 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 424531932 : 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 424531932 : if (constraints && abi_check (19))
888 : {
889 : tree probe = constraints;
890 : while (probe
891 347834 : && !cp_expr_location (probe)
892 384078 : && TREE_CODE (probe) == TRUTH_ANDIF_EXPR)
893 : {
894 282 : tree op1 = TREE_OPERAND (probe, 1);
895 535 : probe = (cp_expr_location (op1) ? op1
896 253 : : TREE_OPERAND (probe, 0));
897 : }
898 347552 : if (probe && cp_expr_location (probe))
899 : {
900 311590 : write_char ('Q');
901 311590 : write_constraint_expression (probe);
902 : }
903 : }
904 424531932 : }
905 :
906 : /* <type-constraint> ::= <name> */
907 :
908 : static void
909 141760 : write_type_constraint (tree cnst)
910 : {
911 141760 : if (!cnst)
912 : return;
913 :
914 141760 : gcc_checking_assert (TREE_CODE (cnst) == TEMPLATE_ID_EXPR);
915 :
916 141760 : tree concept_decl = get_concept_check_template (cnst);
917 141760 : write_name (concept_decl, 0);
918 141760 : tree args = TREE_OPERAND (cnst, 1);
919 141760 : if (TREE_VEC_LENGTH (args) > 1)
920 : {
921 51867 : TEMPLATE_ARGS_TYPE_CONSTRAINT_P (args) = true;
922 51867 : write_template_args (args);
923 : }
924 : }
925 :
926 : /* <encoding> ::= <function name> <bare-function-type>
927 : ::= <data name> */
928 :
929 : static void
930 227731516 : write_encoding (const tree decl)
931 : {
932 227731516 : MANGLE_TRACE_TREE ("encoding", decl);
933 :
934 227731516 : 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 11015 : if (DECL_OVERLOADED_OPERATOR_P (decl))
939 3 : write_name (decl, /*ignore_local_scope=*/0);
940 : else
941 11012 : write_source_name (DECL_NAME (decl));
942 : return;
943 : }
944 :
945 227720501 : write_name (decl, /*ignore_local_scope=*/0);
946 227720501 : if (TREE_CODE (decl) == FUNCTION_DECL)
947 : {
948 193901909 : tree fn_type;
949 193901909 : tree d;
950 :
951 193901909 : if (maybe_template_info (decl))
952 : {
953 17396628 : 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 17396628 : d = NULL_TREE;
959 : }
960 : else
961 : {
962 176505281 : fn_type = TREE_TYPE (decl);
963 176505281 : d = decl;
964 : }
965 :
966 193901909 : write_bare_function_type (fn_type,
967 193901909 : mangle_return_type_p (decl),
968 : d);
969 :
970 193901909 : if (tree c = get_trailing_function_requirements (decl))
971 2994395 : if (abi_check (19))
972 : {
973 2975347 : ++G.parm_depth;
974 2975347 : write_char ('Q');
975 2975347 : write_constraint_expression (c);
976 2975347 : --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 8533 : mangle_module_component (tree comp, bool partition_p)
992 : {
993 8533 : write_char ('W');
994 8533 : if (partition_p)
995 220 : write_char ('P');
996 8533 : write_source_name (comp);
997 :
998 : // Module substitutions use the same number-space as entity
999 : // substitutions, but are orthogonal.
1000 8533 : vec_safe_push (G.substitutions, NULL_TREE);
1001 8533 : 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 8282 : write_module (int m, bool include_partition)
1016 : {
1017 8282 : G.mod = true;
1018 0 : mangle_module (m, include_partition);
1019 0 : }
1020 :
1021 : static void
1022 1805926 : maybe_write_module (tree decl)
1023 : {
1024 1805926 : if (!DECL_NAMESPACE_SCOPE_P (decl))
1025 : return;
1026 :
1027 1282723 : if (!TREE_PUBLIC (STRIP_TEMPLATE (decl)))
1028 : return;
1029 :
1030 1273771 : if (TREE_CODE (decl) == NAMESPACE_DECL)
1031 : return;
1032 :
1033 966658 : int m = get_originating_module (decl, true);
1034 966658 : if (m >= 0)
1035 6216 : 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 2109238271 : decl_mangling_context (tree decl)
1043 : {
1044 2109238419 : tree tcontext = targetm.cxx.decl_mangling_context (decl);
1045 :
1046 2109238419 : if (tcontext != NULL_TREE)
1047 : return tcontext;
1048 :
1049 2109238419 : if (TREE_CODE (decl) == TEMPLATE_DECL
1050 2109238419 : && DECL_TEMPLATE_RESULT (decl))
1051 : decl = DECL_TEMPLATE_RESULT (decl);
1052 :
1053 2109238419 : if (TREE_CODE (decl) == TYPE_DECL
1054 3103618362 : && LAMBDA_TYPE_P (TREE_TYPE (decl)))
1055 : {
1056 6066880 : tree extra = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl));
1057 6066880 : if (extra)
1058 : return extra;
1059 6015 : tcontext = CP_DECL_CONTEXT (decl);
1060 6185 : 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 2103171539 : else if (template_type_parameter_p (decl))
1067 : /* template type parms have no mangling context. */
1068 : return NULL_TREE;
1069 :
1070 2103176508 : tcontext = CP_DECL_CONTEXT (decl);
1071 :
1072 2103176508 : if (member_like_constrained_friend_p (decl))
1073 85440 : tcontext = DECL_FRIEND_CONTEXT (decl);
1074 :
1075 : /* Ignore the artificial declare reduction functions. */
1076 2103176508 : if (tcontext
1077 2103176508 : && TREE_CODE (tcontext) == FUNCTION_DECL
1078 2109134581 : && 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 562173957 : write_name (tree decl, const int ignore_local_scope)
1097 : {
1098 562173957 : tree context;
1099 :
1100 562173957 : MANGLE_TRACE_TREE ("name", decl);
1101 :
1102 562173957 : 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 329850549 : decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl)));
1107 : }
1108 :
1109 562173957 : context = decl_mangling_context (decl);
1110 :
1111 562173957 : gcc_assert (context != NULL_TREE);
1112 :
1113 2810388844 : 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 562173957 : if (context == global_namespace
1124 550280409 : || DECL_NAMESPACE_STD_P (context)
1125 327299021 : || (ignore_local_scope
1126 5146984 : && (TREE_CODE (context) == FUNCTION_DECL
1127 3560665 : || (abi_version_at_least (7)
1128 3560665 : && TREE_CODE (context) == PARM_DECL))))
1129 : {
1130 : /* Is this a template instance? */
1131 236461285 : if (tree info = maybe_template_info (decl))
1132 : {
1133 : /* Yes: use <unscoped-template-name>. */
1134 197237704 : 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 197237704 : tree parms = (TREE_CODE (decl) == FUNCTION_DECL
1139 202205016 : ? DECL_TEMPLATE_PARMS (TI_TEMPLATE (info))
1140 4967312 : : NULL_TREE);
1141 197237704 : write_template_args (TI_ARGS (info), parms);
1142 : }
1143 : else
1144 : /* Everything else gets an <unqualified-name>. */
1145 39223581 : 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 325712672 : 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 1027887403 : while (context != global_namespace)
1162 : {
1163 : /* Make sure we're always dealing with decls. */
1164 710882350 : if (TYPE_P (context))
1165 225557261 : context = TYPE_NAME (context);
1166 : /* Is this a function? */
1167 710882350 : if (TREE_CODE (context) == FUNCTION_DECL
1168 705735732 : || TREE_CODE (context) == PARM_DECL)
1169 : {
1170 : /* Yes, we have local scope. Use the <local-name>
1171 : production for the innermost function scope. */
1172 5146984 : write_local_name (context, local_entity, decl);
1173 5146984 : return;
1174 : }
1175 : /* Up one scope level. */
1176 705735366 : local_entity = context;
1177 705735366 : 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 320565688 : write_nested_name (decl);
1185 : }
1186 : }
1187 :
1188 : /* <unscoped-name> ::= <unqualified-name>
1189 : ::= St <unqualified-name> # ::std:: */
1190 :
1191 : static void
1192 168535696 : write_unscoped_name (const tree decl)
1193 : {
1194 168535696 : tree context = decl_mangling_context (decl);
1195 :
1196 168535696 : MANGLE_TRACE_TREE ("unscoped-name", decl);
1197 :
1198 : /* Is DECL in ::std? */
1199 168535696 : if (DECL_NAMESPACE_STD_P (context))
1200 : {
1201 158009396 : write_string ("St");
1202 158009396 : 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 10526300 : gcc_assert (context == global_namespace
1210 : || TREE_CODE (context) == PARM_DECL
1211 : || TREE_CODE (context) == FUNCTION_DECL);
1212 :
1213 10526300 : write_unqualified_name (decl);
1214 : }
1215 168535696 : }
1216 :
1217 : /* <unscoped-template-name> ::= <unscoped-name>
1218 : ::= <substitution> */
1219 :
1220 : static void
1221 197237704 : write_unscoped_template_name (const tree decl)
1222 : {
1223 197237704 : MANGLE_TRACE_TREE ("unscoped-template-name", decl);
1224 :
1225 197237704 : if (find_substitution (decl))
1226 : return;
1227 129312115 : write_unscoped_name (decl);
1228 129312115 : 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 323283784 : write_nested_name (const tree decl)
1242 : {
1243 323283784 : MANGLE_TRACE_TREE ("nested-name", decl);
1244 :
1245 323283784 : write_char ('N');
1246 :
1247 : /* Write CV-qualifiers, if this is an iobj member function. */
1248 323283784 : if (TREE_CODE (decl) == FUNCTION_DECL
1249 323283784 : && DECL_IOBJ_MEMBER_FUNCTION_P (decl))
1250 : {
1251 153061487 : if (DECL_VOLATILE_MEMFUNC_P (decl))
1252 8869160 : write_char ('V');
1253 153061487 : if (DECL_CONST_MEMFUNC_P (decl))
1254 46529485 : write_char ('K');
1255 153061487 : if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl)))
1256 : {
1257 155220 : if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl)))
1258 96857 : write_char ('O');
1259 : else
1260 58363 : write_char ('R');
1261 : }
1262 : }
1263 141266869 : else if (DECL_DECLARES_FUNCTION_P (decl)
1264 170222297 : && DECL_XOBJ_MEMBER_FUNCTION_P (decl))
1265 5457 : write_char ('H');
1266 :
1267 : /* Is this a template instance? */
1268 323283784 : if (tree info = maybe_template_info (decl))
1269 : {
1270 : /* Yes, use <template-prefix>. */
1271 55826070 : write_template_prefix (decl);
1272 55826070 : write_template_args (TI_ARGS (info));
1273 : }
1274 267457714 : else if ((!abi_version_at_least (10) || TREE_CODE (decl) == TYPE_DECL)
1275 346171477 : && TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1276 : {
1277 2718093 : tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1278 2718093 : if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1279 : {
1280 50569 : write_template_prefix (decl);
1281 50569 : write_template_args (TREE_OPERAND (name, 1));
1282 : }
1283 : else
1284 : {
1285 2667524 : write_prefix (decl_mangling_context (decl));
1286 2667524 : write_unqualified_name (decl);
1287 : }
1288 : }
1289 : else
1290 : {
1291 : /* No, just use <prefix> */
1292 264739621 : write_prefix (decl_mangling_context (decl));
1293 264739621 : write_unqualified_name (decl);
1294 : }
1295 323283784 : write_char ('E');
1296 323283784 : }
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 666638413 : write_prefix (const tree node)
1308 : {
1309 666638413 : tree decl;
1310 :
1311 666638413 : if (node == NULL
1312 666638413 : || node == global_namespace)
1313 : return;
1314 :
1315 642700845 : MANGLE_TRACE_TREE ("prefix", node);
1316 :
1317 642700845 : if (TREE_CODE (node) == DECLTYPE_TYPE
1318 642700737 : || TREE_CODE (node) == TRAIT_TYPE)
1319 : {
1320 111 : write_type (node);
1321 111 : return;
1322 : }
1323 :
1324 642700734 : if (TREE_CODE (node) == SPLICE_SCOPE)
1325 : {
1326 10 : write_splice (node);
1327 10 : return;
1328 : }
1329 :
1330 642700724 : if (find_substitution (node))
1331 : return;
1332 :
1333 353080422 : tree template_info = NULL_TREE;
1334 353080422 : 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 132984686 : if (TREE_CODE (node) == FUNCTION_DECL
1342 129425025 : || TREE_CODE (node) == PARM_DECL)
1343 : return;
1344 :
1345 129424689 : decl = node;
1346 129424689 : template_info = maybe_template_info (decl);
1347 : }
1348 : else
1349 : {
1350 : /* Node is a type. */
1351 220095736 : decl = TYPE_NAME (node);
1352 : /* The DECL might not point at the node. */
1353 220095736 : if (CLASSTYPE_TEMPLATE_ID_P (node))
1354 166415865 : template_info = TYPE_TEMPLATE_INFO (node);
1355 : }
1356 :
1357 349520425 : if (TREE_CODE (node) == TEMPLATE_TYPE_PARM)
1358 12412 : write_template_param (node);
1359 349508013 : else if (template_info)
1360 : /* Templated. */
1361 : {
1362 166458184 : write_template_prefix (decl);
1363 166458184 : write_template_args (TI_ARGS (template_info));
1364 : }
1365 183049829 : else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE)
1366 : {
1367 138101 : tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl));
1368 138101 : if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1369 : {
1370 119433 : write_template_prefix (decl);
1371 119433 : write_template_args (TREE_OPERAND (name, 1));
1372 : }
1373 : else
1374 : {
1375 18668 : write_prefix (decl_mangling_context (decl));
1376 18668 : write_unqualified_name (decl);
1377 : }
1378 : }
1379 : else
1380 : /* Not templated. */
1381 : {
1382 182911728 : write_prefix (decl_mangling_context (decl));
1383 182911728 : write_unqualified_name (decl);
1384 182911728 : if (VAR_P (decl)
1385 182911728 : || TREE_CODE (decl) == FIELD_DECL)
1386 : {
1387 : /* <data-member-prefix> := <member source-name> M */
1388 26807 : 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 26807 : if (!abi_check (18))
1394 : return;
1395 : }
1396 : }
1397 :
1398 349520293 : add_substitution (node);
1399 : }
1400 :
1401 : /* <template-prefix> ::= <prefix> <template component>
1402 : ::= <template-param>
1403 : ::= <substitution> */
1404 :
1405 : static void
1406 222454256 : write_template_prefix (const tree node)
1407 : {
1408 222454256 : tree decl = DECL_P (node) ? node : TYPE_NAME (node);
1409 222454256 : tree type = DECL_P (node) ? TREE_TYPE (node) : node;
1410 222454256 : tree context = decl_mangling_context (decl);
1411 222454256 : tree templ;
1412 222454256 : tree substitution;
1413 :
1414 222454256 : MANGLE_TRACE_TREE ("template-prefix", node);
1415 :
1416 : /* Find the template decl. */
1417 222454256 : if (tree info = maybe_template_info (decl))
1418 222283268 : templ = TI_TEMPLATE (info);
1419 170988 : else if (TREE_CODE (type) == TYPENAME_TYPE)
1420 : /* For a typename type, all we have is the name. */
1421 170002 : 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 222454256 : if (context && TYPE_P (context))
1452 11432462 : substitution = build_tree_list (context, templ);
1453 : else
1454 : substitution = templ;
1455 :
1456 222454256 : if (find_substitution (substitution))
1457 : return;
1458 :
1459 216301200 : if (TREE_TYPE (templ)
1460 216301200 : && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM)
1461 986 : write_template_param (TREE_TYPE (templ));
1462 : else
1463 : {
1464 216300214 : write_prefix (context);
1465 216300214 : write_unqualified_name (decl);
1466 : }
1467 :
1468 216301200 : 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 5017153 : write_unqualified_id (tree identifier)
1507 : {
1508 5017153 : if (IDENTIFIER_CONV_OP_P (identifier))
1509 15 : write_conversion_operator_name (TREE_TYPE (identifier));
1510 5017138 : else if (IDENTIFIER_OVL_OP_P (identifier))
1511 : {
1512 52607 : const ovl_op_info_t *ovl_op = IDENTIFIER_OVL_OP_INFO (identifier);
1513 52607 : write_string (ovl_op->mangled_name);
1514 52607 : }
1515 4964531 : else if (UDLIT_OPER_P (identifier))
1516 0 : write_literal_operator_name (identifier);
1517 : else
1518 4964531 : write_source_name (identifier);
1519 5017153 : }
1520 :
1521 : static void
1522 835177349 : write_unqualified_name (tree decl)
1523 : {
1524 835177349 : MANGLE_TRACE_TREE ("unqualified-name", decl);
1525 :
1526 835177349 : if (modules_p ())
1527 1805926 : maybe_write_module (decl);
1528 :
1529 835177349 : if (identifier_p (decl))
1530 : {
1531 0 : write_unqualified_id (decl);
1532 0 : return;
1533 : }
1534 :
1535 835177349 : bool found = false;
1536 :
1537 835177349 : if (DECL_NAME (decl) == NULL_TREE
1538 835177349 : && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
1539 21 : decl = anon_aggr_naming_decl (TREE_TYPE (decl));
1540 835177328 : 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 835165529 : else if (DECL_DECLARES_FUNCTION_P (decl))
1547 : {
1548 193901369 : found = true;
1549 :
1550 : /* A constrained hidden friend is mangled like a member function, with
1551 : the name prefixed by 'F'. */
1552 193901369 : if (member_like_constrained_friend_p (decl))
1553 21360 : write_char ('F');
1554 :
1555 387802738 : if (DECL_CONSTRUCTOR_P (decl))
1556 30781913 : write_special_name_constructor (decl);
1557 163119456 : else if (DECL_DESTRUCTOR_P (decl))
1558 7481199 : write_special_name_destructor (decl);
1559 155638257 : else if (DECL_CONV_FN_P (decl))
1560 : {
1561 : /* Conversion operator. Handle it right here.
1562 : <operator> ::= cv <type> */
1563 2804790 : tree type;
1564 2804790 : 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 2804189 : else if (FNDECL_USED_AUTO (decl))
1571 60 : type = DECL_SAVED_AUTO_RETURN_TYPE (decl);
1572 : else
1573 2804129 : type = DECL_CONV_FN_TYPE (decl);
1574 2804790 : write_conversion_operator_name (type);
1575 : }
1576 152833467 : else if (DECL_OVERLOADED_OPERATOR_P (decl))
1577 : {
1578 34916929 : tree t;
1579 34916929 : if (!(t = DECL_RAMP_FN (decl)))
1580 34916537 : t = decl;
1581 34916929 : const char *mangled_name
1582 34916929 : = (ovl_op_info[DECL_ASSIGNMENT_OPERATOR_P (t)]
1583 34916929 : [DECL_OVERLOADED_OPERATOR_CODE_RAW (t)].mangled_name);
1584 34916929 : write_string (mangled_name);
1585 : }
1586 117916538 : else if (UDLIT_OPER_P (DECL_NAME (decl)))
1587 308278 : write_literal_operator_name (DECL_NAME (decl));
1588 : else
1589 : found = false;
1590 : }
1591 :
1592 76304929 : if (found)
1593 : /* OK */;
1594 758872441 : else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl)
1595 124788 : && DECL_NAMESPACE_SCOPE_P (decl)
1596 758943791 : && decl_linkage (decl) == lk_internal)
1597 : {
1598 60078 : MANGLE_TRACE_TREE ("local-source-name", decl);
1599 60078 : write_char ('L');
1600 60078 : 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 758812363 : tree type = TREE_TYPE (decl);
1607 :
1608 758812363 : if (TREE_CODE (decl) == TYPE_DECL
1609 758812363 : && enum_with_enumerator_for_linkage_p (type))
1610 20 : write_unnamed_enum_name (type);
1611 1126427583 : else if (TREE_CODE (decl) == TYPE_DECL && TYPE_UNNAMED_P (type))
1612 1478 : write_unnamed_type_name (type);
1613 1099741730 : else if (TREE_CODE (decl) == TYPE_DECL && LAMBDA_TYPE_P (type))
1614 2363254 : write_closure_type_name (type);
1615 : else
1616 756447611 : 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 835177349 : if (tree tmpl = most_general_template (decl))
1625 : {
1626 491424231 : tree res = DECL_TEMPLATE_RESULT (tmpl);
1627 491424231 : if (res == NULL_TREE)
1628 : /* UNBOUND_CLASS_TEMPLATE. */;
1629 491424228 : else if (DECL_DECLARES_TYPE_P (decl))
1630 : decl = res;
1631 170064714 : 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 835177277 : tree tags = get_abi_tags (decl);
1664 188934299 : if (TREE_CODE (decl) == FUNCTION_DECL && DECL_CONV_FN_P (decl)
1665 837982067 : && 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 835177277 : write_abi_tags (tags);
1672 : }
1673 :
1674 : /* Write the unqualified-name for a conversion operator to TYPE. */
1675 :
1676 : static void
1677 2804805 : write_conversion_operator_name (const tree type)
1678 : {
1679 2804805 : write_string ("cv");
1680 2804805 : write_type (type);
1681 2804805 : }
1682 :
1683 : /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
1684 :
1685 : <source-name> ::= </length/ number> <identifier> */
1686 :
1687 : static void
1688 761504240 : write_source_name (tree identifier)
1689 : {
1690 761504240 : MANGLE_TRACE_TREE ("source-name", identifier);
1691 :
1692 761504240 : write_unsigned_number (IDENTIFIER_LENGTH (identifier));
1693 761504240 : write_identifier (IDENTIFIER_POINTER (identifier));
1694 761504240 : }
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 505870 : sorted_abi_tags (tree tags, bool ignore_inherited_p)
1713 : {
1714 505870 : vec<tree, va_gc> * vec = make_tree_vector();
1715 :
1716 848838 : for (tree t = tags; t; t = TREE_CHAIN (t))
1717 : {
1718 342968 : if (ABI_TAG_NOT_MANGLED (t)
1719 342968 : || (ignore_inherited_p && ABI_TAG_INHERITED (t)))
1720 6 : continue;
1721 342962 : tree str = TREE_VALUE (t);
1722 342962 : vec_safe_push (vec, str);
1723 : }
1724 :
1725 505870 : vec->qsort (tree_string_cmp);
1726 :
1727 505870 : 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 835177385 : write_abi_tags (tree tags)
1735 : {
1736 835177385 : if (tags == NULL_TREE)
1737 835177385 : return;
1738 :
1739 342836 : vec<tree, va_gc> * vec = sorted_abi_tags (tags, /*ignore_inherited_p=*/false);
1740 :
1741 342836 : unsigned i; tree str;
1742 1028535 : FOR_EACH_VEC_ELT (*vec, i, str)
1743 : {
1744 342863 : write_string ("B");
1745 342863 : write_unsigned_number (TREE_STRING_LENGTH (str) - 1);
1746 342863 : write_identifier (TREE_STRING_POINTER (str));
1747 : }
1748 :
1749 342836 : 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 308278 : write_literal_operator_name (tree identifier)
1776 : {
1777 308278 : const char* suffix = UDLIT_OP_SUFFIX (identifier);
1778 308278 : write_identifier (UDLIT_OP_MANGLED_PREFIX);
1779 308278 : write_unsigned_number (strlen (suffix));
1780 308278 : write_identifier (suffix);
1781 308278 : }
1782 :
1783 : /* Encode 0 as _, and 1+ as n-1_. */
1784 :
1785 : static void
1786 32084415 : write_compact_number (int num)
1787 : {
1788 32084415 : gcc_checking_assert (num >= 0);
1789 32084415 : if (num > 0)
1790 12422752 : write_unsigned_number (num - 1);
1791 32084415 : write_char ('_');
1792 32084415 : }
1793 :
1794 : /* Return how many unnamed types precede TYPE in its enclosing class. */
1795 :
1796 : static int
1797 809 : nested_anon_class_index (tree type)
1798 : {
1799 809 : int index = 0;
1800 809 : tree member = TYPE_FIELDS (TYPE_CONTEXT (type));
1801 21944 : for (; member; member = DECL_CHAIN (member))
1802 21944 : if (DECL_IMPLICIT_TYPEDEF_P (member))
1803 : {
1804 1269 : tree memtype = TREE_TYPE (member);
1805 1269 : 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 1478 : write_unnamed_type_name (const tree type)
1821 : {
1822 1478 : int discriminator;
1823 1478 : MANGLE_TRACE_TREE ("unnamed-type-name", type);
1824 :
1825 1478 : if (TYPE_FUNCTION_SCOPE_P (type))
1826 328 : discriminator = discriminator_for_local_entity (TYPE_NAME (type));
1827 1150 : else if (TYPE_CLASS_SCOPE_P (type))
1828 809 : 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 1137 : write_string ("Ut");
1838 1137 : 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 8593979 : template_parm_natural_p (tree arg, tree parm)
1857 : {
1858 8593979 : tree decl = TREE_VALUE (parm);
1859 :
1860 : /* A template parameter is "natural" if: */
1861 :
1862 8593979 : if (template_parameter_pack_p (decl))
1863 : {
1864 841134 : tree args = ARGUMENT_PACK_ARGS (arg);
1865 841134 : 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 658912 : 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 8411757 : 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 8402617 : else if (TREE_CODE (decl) == TYPE_DECL)
1892 7374958 : 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 1027659 : 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 1027659 : 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 114275 : write_template_param_decl (tree parm)
1920 : {
1921 114275 : tree decl = TREE_VALUE (parm);
1922 :
1923 114275 : if (template_parameter_pack_p (decl))
1924 41221 : write_string ("Tp");
1925 :
1926 114275 : switch (TREE_CODE (decl))
1927 : {
1928 48058 : case PARM_DECL:
1929 48058 : {
1930 48058 : write_string ("Tn");
1931 :
1932 48058 : 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 48058 : if (tree c = (is_auto (type)
1936 52344 : ? TEMPLATE_PARM_CONSTRAINTS (parm)
1937 4286 : : 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 48036 : 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 65866 : case TYPE_DECL:
1966 65866 : if (tree c = TEMPLATE_PARM_CONSTRAINTS (parm))
1967 : {
1968 36219 : 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 36219 : if (TREE_CODE (decl) == TYPE_DECL)
1974 : {
1975 36219 : write_string ("Tk");
1976 36219 : 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 114275 : }
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 516056 : write_closure_template_head (tree tmpl)
1994 : {
1995 516056 : bool any = false;
1996 :
1997 : // We only need one level of template parms
1998 516056 : tree parms = DECL_TEMPLATE_PARMS (tmpl);
1999 516056 : tree inner = INNERMOST_TEMPLATE_PARMS (parms);
2000 :
2001 589442 : for (int ix = 0, len = TREE_VEC_LENGTH (inner); ix != len; ix++)
2002 : {
2003 534444 : tree parm = TREE_VEC_ELT (inner, ix);
2004 534444 : if (parm == error_mark_node)
2005 0 : continue;
2006 :
2007 534444 : 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 516056 : write_tparms_constraints (TEMPLATE_PARMS_CONSTRAINTS (parms));
2017 :
2018 516056 : 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 2363254 : write_closure_type_name (const tree type)
2026 : {
2027 2363254 : tree fn = lambda_function (type);
2028 2363254 : tree lambda = CLASSTYPE_LAMBDA_EXPR (type);
2029 2363254 : tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
2030 :
2031 2363254 : MANGLE_TRACE_TREE ("closure-type-name", type);
2032 :
2033 2363254 : write_string ("Ul");
2034 :
2035 2363254 : if (auto ti = maybe_template_info (fn))
2036 516056 : 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 2363254 : write_method_parms (parms, TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE, fn);
2043 2363254 : write_char ('E');
2044 2363254 : if ((LAMBDA_EXPR_SCOPE_SIG_DISCRIMINATOR (lambda)
2045 2363254 : != LAMBDA_EXPR_SCOPE_ONLY_DISCRIMINATOR (lambda))
2046 3200938 : && abi_warn_or_compat_version_crosses (18))
2047 288 : G.need_abi_warning = true;
2048 4726508 : write_compact_number (abi_version_at_least (18)
2049 2362732 : ? LAMBDA_EXPR_SCOPE_SIG_DISCRIMINATOR (lambda)
2050 522 : : LAMBDA_EXPR_SCOPE_ONLY_DISCRIMINATOR (lambda));
2051 2363254 : }
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 1029858534 : hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base,
2061 : char *buffer, const unsigned int min_digits)
2062 : {
2063 1029858534 : static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
2064 1029858534 : unsigned digits = 0;
2065 :
2066 2559955151 : while (number)
2067 : {
2068 1530096617 : unsigned HOST_WIDE_INT d = number / base;
2069 :
2070 1530096617 : *--buffer = base_digits[number - d * base];
2071 1530096617 : digits++;
2072 1530096617 : number = d;
2073 : }
2074 1084556333 : while (digits < min_digits)
2075 : {
2076 54697799 : *--buffer = base_digits[0];
2077 54697799 : digits++;
2078 : }
2079 1029858534 : return digits;
2080 : }
2081 :
2082 : /* Non-terminal <number>.
2083 :
2084 : <number> ::= [n] </decimal integer/> */
2085 :
2086 : static void
2087 1029858246 : write_number (unsigned HOST_WIDE_INT number, const int unsigned_p,
2088 : const unsigned int base)
2089 : {
2090 1029858246 : char buffer[sizeof (HOST_WIDE_INT) * 8];
2091 1029858246 : unsigned count = 0;
2092 :
2093 1029858246 : if (!unsigned_p && (HOST_WIDE_INT) number < 0)
2094 : {
2095 0 : write_char ('n');
2096 0 : number = -((HOST_WIDE_INT) number);
2097 : }
2098 1029858246 : count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1);
2099 1029858246 : write_chars (buffer + sizeof (buffer) - count, count);
2100 1029858246 : }
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 96679444 : write_integer_cst (const tree cst)
2108 : {
2109 96679444 : int sign = tree_int_cst_sgn (cst);
2110 96679444 : widest_int abs_value = wi::abs (wi::to_widest (cst));
2111 96679444 : 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 96 : char buffer[sizeof (HOST_WIDE_INT) * 8 * 2];
2116 96 : unsigned HOST_WIDE_INT chunk;
2117 96 : unsigned chunk_digits;
2118 96 : char *ptr = buffer + sizeof (buffer);
2119 96 : unsigned count = 0;
2120 96 : tree n, base, type;
2121 96 : int done;
2122 :
2123 : /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is
2124 : representable. */
2125 96 : chunk = 1000000000;
2126 96 : chunk_digits = 9;
2127 :
2128 96 : if (sizeof (HOST_WIDE_INT) >= 8)
2129 : {
2130 : /* It is at least 64 bits, so 10^18 is representable. */
2131 96 : chunk_digits = 18;
2132 96 : chunk *= chunk;
2133 : }
2134 :
2135 96 : type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst));
2136 96 : base = build_int_cstu (type, chunk);
2137 96 : n = wide_int_to_tree (type, wi::to_wide (cst));
2138 :
2139 96 : if (sign < 0)
2140 : {
2141 0 : write_char ('n');
2142 0 : n = fold_build1_loc (input_location, NEGATE_EXPR, type, n);
2143 : }
2144 288 : do
2145 : {
2146 288 : tree d = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, n, base);
2147 288 : tree tmp = fold_build2_loc (input_location, MULT_EXPR, type, d, base);
2148 288 : unsigned c;
2149 :
2150 288 : done = integer_zerop (d);
2151 288 : tmp = fold_build2_loc (input_location, MINUS_EXPR, type, n, tmp);
2152 384 : c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr,
2153 : done ? 1 : chunk_digits);
2154 288 : ptr -= c;
2155 288 : count += c;
2156 288 : n = d;
2157 : }
2158 288 : while (!done);
2159 96 : write_chars (ptr, count);
2160 : }
2161 : else
2162 : {
2163 : /* A small num. */
2164 96679348 : if (sign < 0)
2165 497115 : write_char ('n');
2166 96679348 : write_unsigned_number (abs_value.to_uhwi ());
2167 : }
2168 96679444 : }
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 763208307 : write_identifier (const char *identifier)
2263 : {
2264 763208307 : MANGLE_TRACE ("identifier", identifier);
2265 763208307 : write_string (identifier);
2266 763208307 : }
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 30781913 : write_special_name_constructor (const tree ctor)
2279 : {
2280 30781913 : write_char ('C');
2281 30781913 : bool new_inh = (flag_new_inheriting_ctors
2282 61548099 : && DECL_INHERITED_CTOR (ctor));
2283 162528 : if (new_inh)
2284 162528 : write_char ('I');
2285 30781913 : if (DECL_BASE_CONSTRUCTOR_P (ctor))
2286 6346623 : 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 24435290 : else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor))
2291 18092134 : write_char ('4');
2292 : else
2293 : {
2294 6343156 : gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor));
2295 6343156 : write_char ('1');
2296 : }
2297 30781913 : if (new_inh)
2298 325056 : write_type (DECL_INHERITED_CTOR_BASE (ctor));
2299 30781913 : }
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 7481199 : write_special_name_destructor (const tree dtor)
2310 : {
2311 7481199 : if (DECL_DELETING_DESTRUCTOR_P (dtor))
2312 631911 : write_string ("D0");
2313 6849288 : else if (DECL_BASE_DESTRUCTOR_P (dtor))
2314 1632359 : write_string ("D2");
2315 5216929 : 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 2977802 : write_string ("D4");
2320 : else
2321 : {
2322 2239127 : gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor));
2323 2239127 : write_string ("D1");
2324 : }
2325 7481199 : }
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 2855803 : discriminator_for_local_entity (tree entity)
2333 : {
2334 2855803 : if (!DECL_LANG_SPECIFIC (entity))
2335 : {
2336 : /* Some decls, like __FUNCTION__, don't need a discriminator. */
2337 31966 : gcc_checking_assert (DECL_ARTIFICIAL (entity));
2338 : return 0;
2339 : }
2340 5502329 : else if (tree disc = DECL_DISCRIMINATOR (entity))
2341 496 : 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 2855475 : write_discriminator (const int discriminator)
2369 : {
2370 : /* If discriminator is zero, don't write anything. Otherwise... */
2371 2855475 : 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 2855475 : }
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 5146984 : write_local_name (tree function, const tree local_entity,
2397 : const tree entity)
2398 : {
2399 5146984 : tree parm = NULL_TREE;
2400 :
2401 5146984 : MANGLE_TRACE_TREE ("local-name", entity);
2402 :
2403 5146984 : if (TREE_CODE (function) == PARM_DECL)
2404 : {
2405 366 : parm = function;
2406 366 : function = DECL_CONTEXT (parm);
2407 : }
2408 :
2409 5146984 : write_char ('Z');
2410 5146984 : write_encoding (function);
2411 5146984 : write_char ('E');
2412 :
2413 : /* For this purpose, parameters are numbered from right-to-left. */
2414 5146984 : 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 5146984 : 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 5146984 : write_name (entity, /*ignore_local_scope=*/1);
2433 5146984 : if (DECL_DISCRIMINATOR_P (local_entity)
2434 15262966 : && !(TREE_CODE (local_entity) == TYPE_DECL
2435 14908407 : && TYPE_ANON_P (TREE_TYPE (local_entity))))
2436 2855208 : write_discriminator (discriminator_for_local_entity (local_entity));
2437 : }
2438 5146984 : }
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 1304705909 : 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 1304705918 : int is_builtin_type = 0;
2474 :
2475 1304705918 : MANGLE_TRACE_TREE ("type", type);
2476 :
2477 1304705918 : if (type == error_mark_node)
2478 : return;
2479 :
2480 1304705903 : type = canonicalize_for_substitution (type);
2481 1304705903 : if (find_substitution (type))
2482 : return;
2483 :
2484 :
2485 1190737537 : 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 83954405 : tree t = TYPE_MAIN_VARIANT (type);
2492 83954405 : 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 83954405 : gcc_assert (t != type);
2501 83954405 : 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 83947680 : write_type (t);
2520 : }
2521 1106783132 : 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 1570570 : write_array_type (type);
2526 : else
2527 : {
2528 1105212562 : tree type_orig = type;
2529 :
2530 : /* See through any typedefs. */
2531 1105212562 : type = TYPE_MAIN_VARIANT (type);
2532 1105212562 : if (FUNC_OR_METHOD_TYPE_P (type))
2533 3309350 : 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 1105212562 : if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
2539 16206 : type = TREE_TYPE (first_field (type));
2540 :
2541 1105212562 : if (TYPE_PTRDATAMEM_P (type))
2542 17082 : write_pointer_to_member_type (type);
2543 : else
2544 : {
2545 : /* Handle any target-specific fundamental types. */
2546 1105195480 : const char *target_mangling
2547 1105195480 : = targetm.mangle_type (type_orig);
2548 :
2549 1105195480 : if (target_mangling)
2550 : {
2551 9846010 : write_string (target_mangling);
2552 : /* Add substitutions for types other than fundamental
2553 : types. */
2554 9846010 : 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 1095349470 : switch (TREE_CODE (type))
2563 : {
2564 589943838 : case VOID_TYPE:
2565 589943838 : case BOOLEAN_TYPE:
2566 589943838 : case INTEGER_TYPE: /* Includes wchar_t. */
2567 589943838 : case REAL_TYPE:
2568 589943838 : case FIXED_POINT_TYPE:
2569 589943838 : {
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 589943838 : write_builtin_type (TYPE_MAIN_VARIANT (type));
2574 589943838 : ++is_builtin_type;
2575 : }
2576 589943838 : break;
2577 :
2578 689108 : case COMPLEX_TYPE:
2579 689108 : write_char ('C');
2580 689108 : write_type (TREE_TYPE (type));
2581 689108 : break;
2582 :
2583 3309350 : case FUNCTION_TYPE:
2584 3309350 : case METHOD_TYPE:
2585 3309350 : write_function_type (type);
2586 3309350 : break;
2587 :
2588 328708711 : case UNION_TYPE:
2589 328708711 : case RECORD_TYPE:
2590 328708711 : case ENUMERAL_TYPE:
2591 : /* A pointer-to-member function is represented as a special
2592 : RECORD_TYPE, so check for this first. */
2593 328708711 : if (TYPE_PTRMEMFUNC_P (type))
2594 268495 : write_pointer_to_member_type (type);
2595 : else
2596 328440216 : write_class_enum_type (type);
2597 : break;
2598 :
2599 2718096 : case TYPENAME_TYPE:
2600 2718096 : case UNBOUND_CLASS_TEMPLATE:
2601 : /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like
2602 : ordinary nested names. */
2603 2718096 : write_nested_name (TYPE_STUB_DECL (type));
2604 2718096 : break;
2605 :
2606 135710610 : case POINTER_TYPE:
2607 135710610 : case REFERENCE_TYPE:
2608 135710610 : if (TYPE_PTR_P (type))
2609 58418703 : write_char ('P');
2610 77291907 : else if (TYPE_REF_IS_RVALUE (type))
2611 12987820 : write_char ('O');
2612 : else
2613 64304087 : write_char ('R');
2614 135710610 : {
2615 135710610 : 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 135710610 : if (TREE_CODE (target) == FUNCTION_TYPE)
2622 : {
2623 11371875 : if (abi_warn_or_compat_version_crosses (5)
2624 2274729 : && TYPE_QUALS (target) != TYPE_UNQUALIFIED)
2625 3 : G.need_abi_warning = 1;
2626 2274723 : if (abi_version_at_least (5))
2627 2274294 : target = build_qualified_type (target, TYPE_UNQUALIFIED);
2628 : }
2629 135710610 : write_type (target);
2630 : }
2631 135710610 : break;
2632 :
2633 29284539 : case TEMPLATE_TYPE_PARM:
2634 29284539 : if (is_auto (type))
2635 : {
2636 744681 : if (template_placeholder_p (type)
2637 744681 : && 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 744648 : if (AUTO_IS_DECLTYPE (type))
2647 22728 : write_identifier ("Dc");
2648 : else
2649 721920 : write_identifier ("Da");
2650 : ++is_builtin_type;
2651 : break;
2652 : }
2653 : /* fall through. */
2654 28539858 : case TEMPLATE_PARM_INDEX:
2655 28539858 : write_template_param (type);
2656 28539858 : 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 35203 : case VECTOR_TYPE:
2669 35203 : if (abi_version_at_least (4))
2670 : {
2671 35188 : write_string ("Dv");
2672 : /* Non-constant vector size would be encoded with
2673 : _ expression, but we don't support that yet. */
2674 35188 : write_unsigned_number (TYPE_VECTOR_SUBPARTS (type)
2675 : .to_constant ());
2676 35188 : write_char ('_');
2677 35188 : }
2678 : else
2679 15 : write_string ("U8__vector");
2680 175970 : if (abi_warn_or_compat_version_crosses (4))
2681 15 : G.need_abi_warning = 1;
2682 35203 : write_type (TREE_TYPE (type));
2683 35203 : break;
2684 :
2685 3473075 : case TYPE_PACK_EXPANSION:
2686 3473075 : write_string ("Dp");
2687 3473075 : write_type (PACK_EXPANSION_PATTERN (type));
2688 3473075 : break;
2689 :
2690 449087 : case DECLTYPE_TYPE:
2691 : /* These shouldn't make it into mangling. */
2692 449087 : 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 449087 : 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 449078 : write_char ('D');
2726 449078 : if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type))
2727 550 : write_char ('t');
2728 : else
2729 448528 : write_char ('T');
2730 449078 : ++cp_unevaluated_operand;
2731 449078 : write_expression (DECLTYPE_TYPE_EXPR (type));
2732 449078 : --cp_unevaluated_operand;
2733 449078 : write_char ('E');
2734 449078 : break;
2735 :
2736 803517 : case NULLPTR_TYPE:
2737 803517 : write_string ("Dn");
2738 803517 : if (abi_check (7))
2739 : ++is_builtin_type;
2740 : break;
2741 :
2742 223606 : case META_TYPE:
2743 223606 : write_string ("Dm");
2744 223606 : ++is_builtin_type;
2745 223606 : 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 1180081315 : if (!is_builtin_type)
2789 589175911 : 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 12544 : mangle_type_attribute_p (tree name)
2810 : {
2811 12544 : const attribute_spec *as = lookup_attribute_spec (name);
2812 12544 : 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 1191006032 : write_CV_qualifiers_for_type (const tree type)
2841 : {
2842 1191006032 : 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 1191006032 : if (!OVERLOAD_TYPE_P (type))
2856 : {
2857 826841682 : auto_vec<tree> vec;
2858 826854226 : for (tree a = TYPE_ATTRIBUTES (type); a; a = TREE_CHAIN (a))
2859 12544 : if (mangle_type_attribute_p (get_attribute_name (a)))
2860 33 : vec.safe_push (a);
2861 4133448187 : if (abi_warn_or_compat_version_crosses (10) && !vec.is_empty ())
2862 0 : G.need_abi_warning = true;
2863 826841682 : if (abi_version_at_least (10))
2864 : {
2865 826593025 : vec.qsort (attr_strcmp);
2866 826841748 : 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 826841682 : }
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 1191006032 : cp_cv_quals quals = TYPE_QUALS (type);
2896 :
2897 1191006032 : if (quals & TYPE_QUAL_RESTRICT)
2898 : {
2899 43 : write_char ('r');
2900 43 : ++num_qualifiers;
2901 : }
2902 1191006032 : if (quals & TYPE_QUAL_VOLATILE)
2903 : {
2904 550416 : write_char ('V');
2905 550416 : ++num_qualifiers;
2906 : }
2907 1191006032 : if (quals & TYPE_QUAL_CONST)
2908 : {
2909 83883935 : write_char ('K');
2910 83883935 : ++num_qualifiers;
2911 : }
2912 :
2913 1191006032 : 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 589943838 : write_builtin_type (tree type)
2942 : {
2943 589943838 : if (TYPE_CANONICAL (type))
2944 589943838 : type = TYPE_CANONICAL (type);
2945 :
2946 589943838 : switch (TREE_CODE (type))
2947 : {
2948 79542088 : case VOID_TYPE:
2949 79542088 : write_char ('v');
2950 79542088 : break;
2951 :
2952 50527813 : case BOOLEAN_TYPE:
2953 50527813 : write_char ('b');
2954 50527813 : break;
2955 :
2956 441337453 : 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 441337453 : if (type == wchar_type_node)
2960 44357427 : write_char ('w');
2961 396980026 : else if (type == char8_type_node)
2962 23389126 : write_string ("Du");
2963 373590900 : else if (type == char16_type_node)
2964 23139691 : write_string ("Ds");
2965 350451209 : else if (type == char32_type_node)
2966 25809134 : write_string ("Di");
2967 : else
2968 : {
2969 324642089 : size_t itk;
2970 : /* Assume TYPE is one of the shared integer type nodes. Find
2971 : it in the array of these nodes. */
2972 324642075 : iagain:
2973 2060173418 : for (itk = 0; itk < itk_none; ++itk)
2974 2058594855 : if (integer_types[itk] != NULL_TREE
2975 2049123477 : && integer_type_codes[itk] != '\0'
2976 2045966351 : && type == integer_types[itk])
2977 : {
2978 : /* Print the corresponding single-letter code. */
2979 323063526 : write_char (integer_type_codes[itk]);
2980 323063526 : break;
2981 : }
2982 :
2983 324642089 : if (itk == itk_none)
2984 : {
2985 1578563 : tree t = c_common_type_for_mode (TYPE_MODE (type),
2986 1578563 : TYPE_UNSIGNED (type));
2987 1578563 : if (type != t)
2988 : {
2989 14 : type = t;
2990 14 : goto iagain;
2991 : }
2992 :
2993 1578549 : if (TYPE_PRECISION (type) == 128)
2994 2210585 : 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 18536484 : case REAL_TYPE:
3021 18536484 : if (type == float_type_node)
3022 6022600 : write_char ('f');
3023 12513884 : else if (type == double_type_node)
3024 10040952 : write_char ('d');
3025 2472932 : else if (type == long_double_type_node)
3026 0 : write_char ('e');
3027 2472932 : else if (type == dfloat32_type_node)
3028 6152 : write_string ("Df");
3029 2466780 : else if (type == dfloat64_type_node)
3030 6041 : write_string ("Dd");
3031 2460739 : else if (type == dfloat128_type_node)
3032 6008 : write_string ("De");
3033 2454731 : else if (type == float16_type_node)
3034 0 : write_string ("DF16_");
3035 2454731 : else if (type == float32_type_node)
3036 810990 : write_string ("DF32_");
3037 1643741 : else if (type == float64_type_node)
3038 812734 : write_string ("DF64_");
3039 831007 : else if (type == float128_type_node)
3040 771467 : write_string ("DF128_");
3041 59540 : else if (type == float32x_type_node)
3042 29770 : write_string ("DF32x");
3043 29770 : else if (type == float64x_type_node)
3044 29770 : 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 589943838 : }
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 3316051 : write_function_type (const tree type)
3066 : {
3067 3316051 : 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 3316051 : if (TREE_CODE (type) == METHOD_TYPE)
3073 : {
3074 : /* The first parameter must be a POINTER_TYPE pointing to the
3075 : `this' parameter. */
3076 268495 : tree this_type = class_of_this_parm (type);
3077 268495 : write_CV_qualifiers_for_type (this_type);
3078 : }
3079 :
3080 3316051 : write_exception_spec (TYPE_RAISES_EXCEPTIONS (type));
3081 :
3082 3316051 : if (tx_safe_fn_type_p (type))
3083 24 : write_string ("Dx");
3084 :
3085 3316051 : 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 3316051 : write_bare_function_type (type, /*include_return_type_p=*/1,
3099 : /*decl=*/NULL);
3100 3316051 : 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 3316051 : write_char ('E');
3108 3316051 : }
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 197217960 : write_bare_function_type (const tree type, const int include_return_type_p,
3117 : const tree decl)
3118 : {
3119 197217960 : MANGLE_TRACE_TREE ("bare-function-type", type);
3120 :
3121 : /* Mangle the return type, if requested. */
3122 197217960 : if (include_return_type_p)
3123 17729214 : write_type (TREE_TYPE (type));
3124 :
3125 : /* Now mangle the types of the arguments. */
3126 197217960 : ++G.parm_depth;
3127 197217960 : write_method_parms (TYPE_ARG_TYPES (type),
3128 197217960 : TREE_CODE (type) == METHOD_TYPE,
3129 : decl);
3130 197217960 : --G.parm_depth;
3131 197217960 : }
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 199581214 : write_method_parms (tree parm_types, const int method_p, const tree decl)
3141 : {
3142 199581214 : tree first_parm_type;
3143 378449749 : 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 199581214 : 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 199581214 : if (method_p)
3157 : {
3158 155690594 : parm_types = TREE_CHAIN (parm_types);
3159 155690594 : parm_decl = parm_decl ? DECL_CHAIN (parm_decl) : NULL_TREE;
3160 :
3161 155733386 : while (parm_decl && DECL_ARTIFICIAL (parm_decl))
3162 : {
3163 42792 : parm_types = TREE_CHAIN (parm_types);
3164 42792 : parm_decl = DECL_CHAIN (parm_decl);
3165 : }
3166 :
3167 155690594 : 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 199581214 : for (first_parm_type = parm_types;
3173 624403640 : parm_types;
3174 424822426 : parm_types = TREE_CHAIN (parm_types))
3175 : {
3176 424822426 : tree parm = TREE_VALUE (parm_types);
3177 424822426 : 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 199535864 : if (parm_types == first_parm_type)
3183 66836435 : write_type (parm);
3184 : /* If the parm list is terminated with a void type, it's
3185 : fixed-length. */
3186 199535864 : varargs_p = 0;
3187 : /* A void type better be the last one. */
3188 199535864 : gcc_assert (TREE_CHAIN (parm_types) == NULL);
3189 : }
3190 : else
3191 225286562 : write_type (parm);
3192 : }
3193 :
3194 199581214 : if (varargs_p)
3195 : /* <builtin-type> ::= z # ellipsis */
3196 45350 : write_char ('z');
3197 199581214 : }
3198 :
3199 : /* <class-enum-type> ::= <name> */
3200 :
3201 : static void
3202 328440216 : write_class_enum_type (const tree type)
3203 : {
3204 328440216 : write_name (TYPE_NAME (type), /*ignore_local_scope=*/0);
3205 328440216 : }
3206 :
3207 : /* Mangle a requirement REQ in a requires-expression. */
3208 :
3209 : static void
3210 557079 : write_requirement (tree req)
3211 : {
3212 557079 : tree op = TREE_OPERAND (req, 0);
3213 :
3214 557079 : switch (tree_code code = TREE_CODE (req))
3215 : {
3216 : /* # simple-requirement or compound-requirement
3217 : <requirement> ::= X <expression> [ N ] [ R <type-constraint> ] */
3218 556661 : case SIMPLE_REQ:
3219 556661 : case COMPOUND_REQ:
3220 556661 : write_char ('X');
3221 556661 : write_expression (op);
3222 556661 : if (code == SIMPLE_REQ)
3223 : break;
3224 105522 : if (COMPOUND_REQ_NOEXCEPT_P (req))
3225 3 : write_char ('N');
3226 105522 : if (tree constr = TREE_OPERAND (req, 1))
3227 : {
3228 105519 : write_char ('R');
3229 105519 : write_type_constraint (PLACEHOLDER_TYPE_CONSTRAINTS (constr));
3230 : }
3231 : break;
3232 :
3233 : /* <requirement> ::= T <type> # type-requirement */
3234 415 : case TYPE_REQ:
3235 415 : write_char ('T');
3236 415 : write_type (op);
3237 415 : break;
3238 :
3239 : /* <requirement> ::= Q <constraint-expression> # nested-requirement */
3240 3 : case NESTED_REQ:
3241 3 : write_char ('Q');
3242 3 : write_constraint_expression (op);
3243 3 : break;
3244 :
3245 0 : default:
3246 0 : gcc_unreachable ();
3247 : }
3248 557079 : }
3249 :
3250 : /* # requires { ... }
3251 : <expression> ::= rq <requirement>+ E
3252 : # requires (...) { ... }
3253 : <expression> ::= rQ <bare-function-type> _ <requirement>+ E */
3254 :
3255 : static void
3256 530187 : write_requires_expr (tree expr)
3257 : {
3258 530187 : tree parms = REQUIRES_EXPR_PARMS (expr);
3259 530187 : if (parms)
3260 : {
3261 90232 : write_string ("rQ");
3262 90232 : ++G.parm_depth;
3263 180913 : for (; parms; parms = DECL_CHAIN (parms))
3264 90681 : write_type (cv_unqualified (TREE_TYPE (parms)));
3265 90232 : --G.parm_depth;
3266 90232 : write_char ('_');
3267 : }
3268 : else
3269 439955 : write_string ("rq");
3270 :
3271 1087266 : for (tree reqs = REQUIRES_EXPR_REQS (expr); reqs;
3272 557079 : reqs = TREE_CHAIN (reqs))
3273 557079 : write_requirement (TREE_VALUE (reqs));
3274 :
3275 530187 : write_char ('E');
3276 530187 : }
3277 :
3278 : /* Non-terminal <template-args>. ARGS is a TREE_VEC of template
3279 : arguments.
3280 :
3281 : <template-args> ::= I <template-arg>* [Q <constraint-expr>] E */
3282 :
3283 : static void
3284 424015876 : write_template_args (tree args, tree parms /*= NULL_TREE*/)
3285 : {
3286 424015876 : int i;
3287 424015876 : int length = 0;
3288 :
3289 424015876 : MANGLE_TRACE_TREE ("template-args", args);
3290 :
3291 424015876 : write_char ('I');
3292 :
3293 424015876 : if (args)
3294 424015876 : length = TREE_VEC_LENGTH (args);
3295 :
3296 424015876 : tree constraints = NULL_TREE;
3297 424015876 : if (parms)
3298 : {
3299 4967312 : constraints = TEMPLATE_PARMS_CONSTRAINTS (parms);
3300 4967312 : parms = INNERMOST_TEMPLATE_PARMS (parms);
3301 : }
3302 :
3303 424015876 : if (args && length && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC)
3304 : {
3305 : /* We have nested template args. We want the innermost template
3306 : argument list. */
3307 6241784 : args = TREE_VEC_ELT (args, length - 1);
3308 6241784 : length = TREE_VEC_LENGTH (args);
3309 : }
3310 424015876 : if (TEMPLATE_ARGS_TYPE_CONSTRAINT_P (args))
3311 : /* Skip the constrained type. */
3312 : i = 1;
3313 : else
3314 423964009 : i = 0;
3315 424015876 : bool implicit_parm_scope = false;
3316 1178567285 : for (; i < length; ++i)
3317 : {
3318 754551409 : tree arg = TREE_VEC_ELT (args, i);
3319 754551409 : if (parms)
3320 : {
3321 8593979 : tree parm = TREE_VEC_ELT (parms, i);
3322 8593979 : tree decl = TREE_VALUE (parm);
3323 8593979 : if (DECL_IMPLICIT_TEMPLATE_PARM_P (decl)
3324 8593979 : && !implicit_parm_scope)
3325 : {
3326 : /* The rest of the template parameters are based on generic
3327 : function parameters, so any expressions in their
3328 : type-constraints are in parameter scope. */
3329 9653 : implicit_parm_scope = true;
3330 9653 : ++G.parm_depth;
3331 : }
3332 8593979 : if (!template_parm_natural_p (arg, parm)
3333 8593979 : && abi_check (19))
3334 40668 : write_template_param_decl (parm);
3335 : }
3336 754551409 : write_template_arg (arg);
3337 : }
3338 424015876 : if (implicit_parm_scope)
3339 9653 : --G.parm_depth;
3340 :
3341 424015876 : write_tparms_constraints (constraints);
3342 :
3343 424015876 : write_char ('E');
3344 424015876 : }
3345 :
3346 : /* Write out the
3347 : <unqualified-name>
3348 : <unqualified-name> <template-args>
3349 : part of SCOPE_REF or COMPONENT_REF mangling. */
3350 :
3351 : static void
3352 508961 : write_member_name (tree member)
3353 : {
3354 508961 : if (identifier_p (member))
3355 : {
3356 372310 : if (IDENTIFIER_ANY_OP_P (member))
3357 : {
3358 52603 : if (abi_check (11))
3359 52579 : write_string ("on");
3360 : }
3361 372310 : write_unqualified_id (member);
3362 : }
3363 136651 : else if (DECL_P (member))
3364 : {
3365 1296 : if (ANON_AGGR_TYPE_P (TREE_TYPE (member)))
3366 : ;
3367 1290 : else if (DECL_OVERLOADED_OPERATOR_P (member))
3368 : {
3369 15 : if (abi_check (16))
3370 9 : write_string ("on");
3371 : }
3372 1296 : write_unqualified_name (member);
3373 : }
3374 135355 : else if (TREE_CODE (member) == TEMPLATE_ID_EXPR)
3375 : {
3376 271 : tree name = TREE_OPERAND (member, 0);
3377 271 : name = OVL_FIRST (name);
3378 271 : write_member_name (name);
3379 271 : write_template_args (TREE_OPERAND (member, 1));
3380 : }
3381 : else
3382 135084 : write_expression (member);
3383 508961 : }
3384 :
3385 : /* EXPR is a base COMPONENT_REF; write the minimized base conversion path for
3386 : converting to BASE, or just the conversion of EXPR if BASE is null.
3387 :
3388 : "Given a fully explicit base path P := C_n -> ... -> C_0, the minimized base
3389 : path Min(P) is defined as follows: let C_i be the last element for which the
3390 : conversion to C_0 is unambiguous; if that element is C_n, the minimized path
3391 : is C_n -> C_0; otherwise, the minimized path is Min(C_n -> ... -> C_i) ->
3392 : C_0."
3393 :
3394 : We mangle the conversion to C_i if it's different from C_n. */
3395 :
3396 : static bool
3397 196278 : write_base_ref (tree expr, tree base = NULL_TREE)
3398 : {
3399 196278 : if (TREE_CODE (expr) != COMPONENT_REF)
3400 : return false;
3401 :
3402 196272 : tree field = TREE_OPERAND (expr, 1);
3403 :
3404 196272 : if (TREE_CODE (field) != FIELD_DECL || !DECL_FIELD_IS_BASE (field))
3405 : return false;
3406 :
3407 18 : tree object = TREE_OPERAND (expr, 0);
3408 :
3409 18 : tree binfo = NULL_TREE;
3410 18 : if (base)
3411 : {
3412 9 : tree cur = TREE_TYPE (object);
3413 9 : binfo = lookup_base (cur, base, ba_unique, NULL, tf_none);
3414 : }
3415 : else
3416 : /* We're at the end of the base conversion chain, so it can't be
3417 : ambiguous. */
3418 9 : base = TREE_TYPE (field);
3419 :
3420 18 : if (binfo == error_mark_node)
3421 : {
3422 : /* cur->base is ambiguous, so make the conversion to
3423 : last explicit, expressed as a cast (last&)object. */
3424 3 : tree last = TREE_TYPE (expr);
3425 3 : write_string (OVL_OP_INFO (false, CAST_EXPR)->mangled_name);
3426 3 : write_type (build_reference_type (last));
3427 3 : write_expression (object);
3428 : }
3429 15 : else if (write_base_ref (object, base))
3430 : /* cur->base is unambiguous, but we had another base conversion
3431 : underneath and wrote it out. */;
3432 : else
3433 : /* No more base conversions, just write out the object. */
3434 6 : write_expression (object);
3435 :
3436 : return true;
3437 : }
3438 :
3439 : /* The number of elements spanned by a RANGE_EXPR. */
3440 :
3441 : unsigned HOST_WIDE_INT
3442 24 : range_expr_nelts (tree expr)
3443 : {
3444 24 : tree lo = TREE_OPERAND (expr, 0);
3445 24 : tree hi = TREE_OPERAND (expr, 1);
3446 24 : return tree_to_uhwi (hi) - tree_to_uhwi (lo) + 1;
3447 : }
3448 :
3449 : /* <expression> ::= <unary operator-name> <expression>
3450 : ::= <binary operator-name> <expression> <expression>
3451 : ::= <expr-primary>
3452 :
3453 : <expr-primary> ::= <template-param>
3454 : ::= L <type> <value number> E # literal
3455 : ::= L <mangled-name> E # external name
3456 : ::= st <type> # sizeof
3457 : ::= sr <type> <unqualified-name> # dependent name
3458 : ::= sr <type> <unqualified-name> <template-args>
3459 : ::= L Dm <value reflection> E # C++26 reflection
3460 : # value [proposed]
3461 : ::= <splice> # C++26 dependent splice [proposed] */
3462 :
3463 : static void
3464 12582623 : write_expression (tree expr)
3465 : {
3466 13013222 : enum tree_code code = TREE_CODE (expr);
3467 :
3468 13013222 : if (TREE_CODE (expr) == TARGET_EXPR)
3469 : {
3470 0 : expr = TARGET_EXPR_INITIAL (expr);
3471 0 : code = TREE_CODE (expr);
3472 : }
3473 :
3474 : /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer
3475 : argument is converted (via qualification conversions) to another type. */
3476 13576851 : while (CONVERT_EXPR_CODE_P (code)
3477 13454772 : || code == IMPLICIT_CONV_EXPR
3478 13454640 : || location_wrapper_p (expr)
3479 : /* Parentheses aren't mangled. */
3480 13013588 : || code == PAREN_EXPR
3481 13013588 : || code == NON_LVALUE_EXPR
3482 26590439 : || (code == VIEW_CONVERT_EXPR
3483 366 : && TREE_CODE (TREE_OPERAND (expr, 0)) == TEMPLATE_PARM_INDEX))
3484 : {
3485 563629 : expr = TREE_OPERAND (expr, 0);
3486 563629 : code = TREE_CODE (expr);
3487 : }
3488 :
3489 13013222 : if (code == BASELINK
3490 13013222 : && (!type_unknown_p (expr)
3491 769382 : || !BASELINK_QUALIFIED_P (expr)))
3492 : {
3493 784745 : expr = BASELINK_FUNCTIONS (expr);
3494 784745 : code = TREE_CODE (expr);
3495 : }
3496 :
3497 : /* Handle pointers-to-members by making them look like expression
3498 : nodes. */
3499 13013222 : if (code == PTRMEM_CST)
3500 : {
3501 7790 : expr = build_nt (ADDR_EXPR,
3502 : build_qualified_name (/*type=*/NULL_TREE,
3503 3895 : PTRMEM_CST_CLASS (expr),
3504 3895 : PTRMEM_CST_MEMBER (expr),
3505 : /*template_p=*/false));
3506 3895 : code = TREE_CODE (expr);
3507 : }
3508 :
3509 : /* Handle template parameters. */
3510 13013222 : if (code == TEMPLATE_TYPE_PARM
3511 13013222 : || code == TEMPLATE_TEMPLATE_PARM
3512 13013222 : || code == BOUND_TEMPLATE_TEMPLATE_PARM
3513 13009220 : || code == TEMPLATE_PARM_INDEX)
3514 782228 : write_template_param (expr);
3515 : /* Handle literals. */
3516 12230994 : else if (TREE_CODE_CLASS (code) == tcc_constant
3517 11848861 : || code == CONST_DECL
3518 11848861 : || code == REFLECT_EXPR)
3519 406697 : write_template_arg_literal (expr);
3520 11824297 : else if (code == EXCESS_PRECISION_EXPR
3521 11824297 : && TREE_CODE (TREE_OPERAND (expr, 0)) == REAL_CST)
3522 0 : write_template_arg_literal (fold_convert (TREE_TYPE (expr),
3523 : TREE_OPERAND (expr, 0)));
3524 11824297 : else if (code == PARM_DECL && DECL_ARTIFICIAL (expr))
3525 : {
3526 121146 : gcc_assert (id_equal (DECL_NAME (expr), "this"));
3527 121146 : write_string ("fpT");
3528 : }
3529 11703151 : else if (code == PARM_DECL)
3530 : {
3531 : /* A function parameter used in a late-specified return type. */
3532 353957 : int index = DECL_PARM_INDEX (expr);
3533 353957 : int level = DECL_PARM_LEVEL (expr);
3534 353957 : int delta = G.parm_depth - level + 1;
3535 353957 : gcc_assert (index >= 1);
3536 353957 : write_char ('f');
3537 353957 : if (delta != 0)
3538 : {
3539 167294 : gcc_checking_assert (delta > 0);
3540 167294 : if (abi_check (5))
3541 : {
3542 : /* Let L be the number of function prototype scopes from the
3543 : innermost one (in which the parameter reference occurs) up
3544 : to (and including) the one containing the declaration of
3545 : the referenced parameter. If the parameter declaration
3546 : clause of the innermost function prototype scope has been
3547 : completely seen, it is not counted (in that case -- which
3548 : is perhaps the most common -- L can be zero). */
3549 167291 : write_char ('L');
3550 167291 : write_unsigned_number (delta - 1);
3551 : }
3552 : }
3553 353957 : write_char ('p');
3554 353957 : write_compact_number (index - 1);
3555 : }
3556 11349194 : else if (DECL_P (expr))
3557 : {
3558 373690 : write_char ('L');
3559 373690 : write_mangled_name (expr, false);
3560 373690 : write_char ('E');
3561 : }
3562 10975504 : else if (TREE_CODE (expr) == SIZEOF_EXPR)
3563 : {
3564 6696 : tree op = TREE_OPERAND (expr, 0);
3565 :
3566 6696 : if (PACK_EXPANSION_P (op))
3567 : {
3568 5450 : sizeof_pack:
3569 5453 : if (abi_check (11))
3570 : {
3571 : /* sZ rather than szDp. */
3572 5444 : write_string ("sZ");
3573 5444 : write_expression (PACK_EXPANSION_PATTERN (op));
3574 : return;
3575 : }
3576 : }
3577 :
3578 1255 : if (SIZEOF_EXPR_TYPE_P (expr))
3579 : {
3580 0 : write_string ("st");
3581 0 : write_type (TREE_TYPE (op));
3582 : }
3583 1255 : else if (ARGUMENT_PACK_P (op))
3584 : {
3585 15 : tree args = ARGUMENT_PACK_ARGS (op);
3586 15 : int length = TREE_VEC_LENGTH (args);
3587 15 : if (abi_check (10))
3588 : {
3589 : /* Before v19 we wrongly mangled all single pack expansions with
3590 : sZ, but now only for expressions, as types ICEd (95298). */
3591 12 : if (length == 1)
3592 : {
3593 9 : tree arg = TREE_VEC_ELT (args, 0);
3594 9 : if (TREE_CODE (arg) == EXPR_PACK_EXPANSION
3595 9 : && !abi_check (19))
3596 : {
3597 3 : op = arg;
3598 3 : goto sizeof_pack;
3599 : }
3600 : }
3601 :
3602 : /* sP <template-arg>* E # sizeof...(T), size of a captured
3603 : template parameter pack from an alias template */
3604 9 : write_string ("sP");
3605 24 : for (int i = 0; i < length; ++i)
3606 15 : write_template_arg (TREE_VEC_ELT (args, i));
3607 9 : write_char ('E');
3608 : }
3609 : else
3610 : {
3611 : /* In GCC 5 we represented this sizeof wrong, with the effect
3612 : that we mangled it as the last element of the pack. */
3613 3 : tree arg = TREE_VEC_ELT (args, length-1);
3614 3 : if (TYPE_P (op))
3615 : {
3616 3 : write_string ("st");
3617 3 : write_type (arg);
3618 : }
3619 : else
3620 : {
3621 0 : write_string ("sz");
3622 0 : write_expression (arg);
3623 : }
3624 : }
3625 : }
3626 1240 : else if (TYPE_P (TREE_OPERAND (expr, 0)))
3627 : {
3628 1116 : write_string ("st");
3629 1116 : write_type (TREE_OPERAND (expr, 0));
3630 : }
3631 : else
3632 124 : goto normal_expr;
3633 : }
3634 10968808 : else if (code == PACK_INDEX_EXPR)
3635 : {
3636 : /* https://github.com/itanium-cxx-abi/cxx-abi/issues/175. */
3637 37 : write_string ("sy");
3638 37 : if (TREE_CODE (PACK_INDEX_PACK (expr)) == TREE_VEC)
3639 : {
3640 2 : write_char ('J');
3641 20 : for (int i = 0; i < TREE_VEC_LENGTH (PACK_INDEX_PACK (expr));
3642 : ++i)
3643 8 : write_template_arg (TREE_VEC_ELT (PACK_INDEX_PACK (expr), i));
3644 2 : write_char ('E');
3645 : }
3646 : else
3647 : /* sy rather than sysp. */
3648 35 : write_expression (PACK_EXPANSION_PATTERN (PACK_INDEX_PACK (expr)));
3649 37 : write_expression (PACK_INDEX_INDEX (expr));
3650 : }
3651 10968771 : else if (TREE_CODE (expr) == ALIGNOF_EXPR)
3652 : {
3653 36 : if (!ALIGNOF_EXPR_STD_P (expr))
3654 : {
3655 24 : if (abi_check (16))
3656 : {
3657 : /* We used to mangle __alignof__ like alignof. */
3658 18 : write_string ("u11__alignof__");
3659 18 : write_template_arg (TREE_OPERAND (expr, 0));
3660 18 : write_char ('E');
3661 18 : return;
3662 : }
3663 : }
3664 18 : if (TYPE_P (TREE_OPERAND (expr, 0)))
3665 : {
3666 9 : write_string ("at");
3667 9 : write_type (TREE_OPERAND (expr, 0));
3668 : }
3669 : else
3670 9 : goto normal_expr;
3671 : }
3672 10968735 : else if (code == SCOPE_REF
3673 10968735 : || code == BASELINK)
3674 : {
3675 316335 : tree scope, member;
3676 316335 : if (code == SCOPE_REF)
3677 : {
3678 316302 : scope = TREE_OPERAND (expr, 0);
3679 316302 : member = TREE_OPERAND (expr, 1);
3680 316302 : if (BASELINK_P (member))
3681 21 : member = BASELINK_FUNCTIONS (member);
3682 : }
3683 : else
3684 : {
3685 33 : scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (expr));
3686 33 : member = BASELINK_FUNCTIONS (expr);
3687 : }
3688 :
3689 : /* If the MEMBER is a real declaration, then the qualifying
3690 : scope was not dependent. Ideally, we would not have a
3691 : SCOPE_REF in those cases, but sometimes we do. If the second
3692 : argument is a DECL, then the name must not have been
3693 : dependent. */
3694 316335 : if (DECL_P (member))
3695 : write_expression (member);
3696 : else
3697 : {
3698 312149 : gcc_assert (code != BASELINK || BASELINK_QUALIFIED_P (expr));
3699 312116 : write_string ("sr");
3700 312116 : write_type (scope);
3701 312116 : write_member_name (member);
3702 : }
3703 : }
3704 10652400 : else if (INDIRECT_REF_P (expr)
3705 464341 : && TREE_TYPE (TREE_OPERAND (expr, 0))
3706 11033548 : && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr, 0))))
3707 : {
3708 258893 : write_expression (TREE_OPERAND (expr, 0));
3709 : }
3710 10393507 : else if (identifier_p (expr))
3711 : {
3712 : /* An operator name appearing as a dependent name needs to be
3713 : specially marked to disambiguate between a use of the operator
3714 : name and a use of the operator in an expression. */
3715 253500 : if (IDENTIFIER_ANY_OP_P (expr))
3716 7 : write_string ("on");
3717 253500 : write_unqualified_id (expr);
3718 : }
3719 10140007 : else if (dependent_splice_p (expr))
3720 50 : write_splice (expr);
3721 10139957 : else if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
3722 : {
3723 4271234 : tree fn = TREE_OPERAND (expr, 0);
3724 5646263 : if (!identifier_p (fn))
3725 4271231 : fn = OVL_NAME (fn);
3726 4271234 : if (IDENTIFIER_ANY_OP_P (fn))
3727 3 : write_string ("on");
3728 4271234 : write_unqualified_id (fn);
3729 4271234 : write_template_args (TREE_OPERAND (expr, 1));
3730 : }
3731 5868723 : else if (TREE_CODE (expr) == MODOP_EXPR)
3732 : {
3733 87 : enum tree_code subop = TREE_CODE (TREE_OPERAND (expr, 1));
3734 87 : const char *name = OVL_OP_INFO (true, subop)->mangled_name;
3735 :
3736 87 : write_string (name);
3737 87 : write_expression (TREE_OPERAND (expr, 0));
3738 87 : write_expression (TREE_OPERAND (expr, 2));
3739 : }
3740 5868636 : else if (code == NEW_EXPR || code == VEC_NEW_EXPR)
3741 : {
3742 : /* ::= [gs] nw <expression>* _ <type> E
3743 : ::= [gs] nw <expression>* _ <type> <initializer>
3744 : ::= [gs] na <expression>* _ <type> E
3745 : ::= [gs] na <expression>* _ <type> <initializer>
3746 : <initializer> ::= pi <expression>* E */
3747 159941 : tree placement = TREE_OPERAND (expr, 0);
3748 159941 : tree type = TREE_OPERAND (expr, 1);
3749 159941 : tree nelts = TREE_OPERAND (expr, 2);
3750 159941 : tree init = TREE_OPERAND (expr, 3);
3751 159941 : tree t;
3752 :
3753 159941 : gcc_assert (code == NEW_EXPR);
3754 159941 : if (TREE_OPERAND (expr, 2))
3755 12 : code = VEC_NEW_EXPR;
3756 :
3757 159941 : if (NEW_EXPR_USE_GLOBAL (expr))
3758 159916 : write_string ("gs");
3759 :
3760 159941 : write_string (OVL_OP_INFO (false, code)->mangled_name);
3761 :
3762 319857 : for (t = placement; t; t = TREE_CHAIN (t))
3763 159916 : write_expression (TREE_VALUE (t));
3764 :
3765 159941 : write_char ('_');
3766 :
3767 159941 : if (nelts)
3768 : {
3769 12 : ++processing_template_decl;
3770 : /* Avoid compute_array_index_type complaints about
3771 : non-constant nelts. */
3772 12 : tree max = cp_build_binary_op (input_location, MINUS_EXPR,
3773 : fold_convert (sizetype, nelts),
3774 : size_one_node,
3775 : tf_warning_or_error);
3776 12 : max = maybe_constant_value (max);
3777 12 : tree domain = build_index_type (max);
3778 12 : type = build_cplus_array_type (type, domain);
3779 12 : --processing_template_decl;
3780 : }
3781 159941 : write_type (type);
3782 :
3783 159929 : if (init && TREE_CODE (init) == TREE_LIST
3784 319864 : && DIRECT_LIST_INIT_P (TREE_VALUE (init)))
3785 : write_expression (TREE_VALUE (init));
3786 : else
3787 : {
3788 159938 : if (init)
3789 159926 : write_string ("pi");
3790 159926 : if (init && init != void_node)
3791 319840 : for (t = init; t; t = TREE_CHAIN (t))
3792 159920 : write_expression (TREE_VALUE (t));
3793 159938 : write_char ('E');
3794 : }
3795 : }
3796 : else if (code == DELETE_EXPR || code == VEC_DELETE_EXPR)
3797 : {
3798 12 : gcc_assert (code == DELETE_EXPR);
3799 12 : if (DELETE_EXPR_USE_VEC (expr))
3800 6 : code = VEC_DELETE_EXPR;
3801 :
3802 12 : if (DELETE_EXPR_USE_GLOBAL (expr))
3803 6 : write_string ("gs");
3804 :
3805 12 : write_string (OVL_OP_INFO (false, code)->mangled_name);
3806 :
3807 12 : write_expression (TREE_OPERAND (expr, 0));
3808 : }
3809 : else if (code == THROW_EXPR)
3810 : {
3811 8 : tree op = TREE_OPERAND (expr, 0);
3812 8 : if (op)
3813 : {
3814 5 : write_string ("tw");
3815 5 : write_expression (op);
3816 : }
3817 : else
3818 3 : write_string ("tr");
3819 : }
3820 : else if (code == NOEXCEPT_EXPR)
3821 : {
3822 6 : write_string ("nx");
3823 6 : write_expression (TREE_OPERAND (expr, 0));
3824 : }
3825 : else if (code == CONSTRUCTOR)
3826 : {
3827 176637 : bool braced_init = BRACE_ENCLOSED_INITIALIZER_P (expr);
3828 176637 : tree etype = TREE_TYPE (expr);
3829 :
3830 176637 : if (braced_init)
3831 97 : write_string ("il");
3832 : else
3833 : {
3834 176540 : write_string ("tl");
3835 176540 : write_type (etype);
3836 : }
3837 :
3838 : /* If this is an undigested initializer, mangle it as written.
3839 : COMPOUND_LITERAL_P doesn't actually distinguish between digested and
3840 : undigested braced casts, but it should work to use it to distinguish
3841 : between braced casts in a template signature (undigested) and template
3842 : parm object values (digested), and all CONSTRUCTORS that get here
3843 : should be one of those two cases. */
3844 176637 : bool undigested = braced_init || COMPOUND_LITERAL_P (expr);
3845 176236 : if (undigested || !zero_init_expr_p (expr))
3846 : {
3847 : /* Convert braced initializer lists to STRING_CSTs so that
3848 : A<"Foo"> mangles the same as A<{'F', 'o', 'o', 0}> while
3849 : still using the latter mangling for strings that
3850 : originated as braced initializer lists. */
3851 155871 : expr = braced_lists_to_strings (etype, expr);
3852 :
3853 155871 : if (TREE_CODE (expr) == CONSTRUCTOR)
3854 : {
3855 155863 : vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (expr);
3856 155863 : unsigned last_nonzero = UINT_MAX;
3857 155863 : constructor_elt *ce;
3858 :
3859 155863 : if (!undigested)
3860 375055 : for (HOST_WIDE_INT i = 0; vec_safe_iterate (elts, i, &ce); ++i)
3861 219593 : if ((TREE_CODE (etype) == UNION_TYPE
3862 37 : && ce->index != first_field (etype))
3863 219619 : || !zero_init_expr_p (ce->value))
3864 : last_nonzero = i;
3865 :
3866 155863 : tree prev_field = NULL_TREE;
3867 155863 : if (undigested || last_nonzero != UINT_MAX)
3868 373110 : for (HOST_WIDE_INT i = 0; vec_safe_iterate (elts, i, &ce); ++i)
3869 : {
3870 219563 : if (i > last_nonzero)
3871 : break;
3872 217083 : if (!undigested && !CONSTRUCTOR_NO_CLEARING (expr)
3873 217247 : && (TREE_CODE (etype) == RECORD_TYPE
3874 215211 : || TREE_CODE (etype) == ARRAY_TYPE))
3875 : {
3876 : /* Write out any implicit non-trailing zeros
3877 : (which we neglected to do before v21). */
3878 215174 : if (TREE_CODE (etype) == RECORD_TYPE)
3879 : {
3880 133345 : tree field;
3881 133345 : if (i == 0)
3882 120036 : field = first_field (etype);
3883 : else
3884 13309 : field = DECL_CHAIN (prev_field);
3885 133757 : for (;;)
3886 : {
3887 133551 : field = next_subobject_field (field);
3888 133551 : if (field == ce->index)
3889 : break;
3890 206 : if (abi_check (21))
3891 196 : write_expression (build_zero_cst
3892 196 : (TREE_TYPE (field)));
3893 206 : field = DECL_CHAIN (field);
3894 : }
3895 : }
3896 81829 : else if (TREE_CODE (etype) == ARRAY_TYPE)
3897 : {
3898 81829 : unsigned HOST_WIDE_INT j;
3899 81829 : if (i == 0)
3900 : j = 0;
3901 : else
3902 47064 : j = 1 + tree_to_uhwi (prev_field);
3903 81829 : unsigned HOST_WIDE_INT k;
3904 81829 : if (TREE_CODE (ce->index) == RANGE_EXPR)
3905 12 : k = tree_to_uhwi (TREE_OPERAND (ce->index, 0));
3906 : else
3907 81817 : k = tree_to_uhwi (ce->index);
3908 81829 : tree zero = NULL_TREE;
3909 83599 : for (; j < k; ++j)
3910 1770 : if (abi_check (21))
3911 : {
3912 1188 : if (!zero)
3913 30 : zero = build_zero_cst (TREE_TYPE (etype));
3914 1188 : write_expression (zero);
3915 : }
3916 : }
3917 : }
3918 :
3919 217247 : if (!undigested && TREE_CODE (etype) == UNION_TYPE)
3920 : {
3921 : /* Express the active member as a designator. */
3922 37 : write_string ("di");
3923 37 : write_unqualified_name (ce->index);
3924 : }
3925 217247 : unsigned reps = 1;
3926 217247 : if (ce->index && TREE_CODE (ce->index) == RANGE_EXPR)
3927 12 : reps = range_expr_nelts (ce->index);
3928 217247 : if (TREE_CODE (ce->value) == RAW_DATA_CST)
3929 : {
3930 30 : gcc_assert (reps == 1);
3931 30 : unsigned int len = RAW_DATA_LENGTH (ce->value);
3932 : /* If this is the last non-zero element, skip
3933 : zeros at the end. */
3934 30 : if (i == last_nonzero)
3935 282 : while (len)
3936 : {
3937 282 : if (RAW_DATA_POINTER (ce->value)[len - 1])
3938 : break;
3939 : --len;
3940 : }
3941 30 : tree valtype = TREE_TYPE (ce->value);
3942 3906 : for (unsigned int i = 0; i < len; ++i)
3943 : {
3944 3876 : write_char ('L');
3945 3876 : write_type (valtype);
3946 3876 : unsigned HOST_WIDE_INT v;
3947 3876 : if (!TYPE_UNSIGNED (valtype)
3948 780 : && TYPE_PRECISION (valtype) == BITS_PER_UNIT
3949 4656 : && RAW_DATA_SCHAR_ELT (ce->value, i) < 0)
3950 : {
3951 0 : write_char ('n');
3952 0 : v = -RAW_DATA_SCHAR_ELT (ce->value, i);
3953 : }
3954 : else
3955 3876 : v = RAW_DATA_UCHAR_ELT (ce->value, i);
3956 3876 : write_unsigned_number (v);
3957 3876 : write_char ('E');
3958 : }
3959 : }
3960 : else
3961 434452 : for (unsigned j = 0; j < reps; ++j)
3962 217235 : write_expression (ce->value);
3963 217247 : prev_field = ce->index;
3964 217247 : if (prev_field && TREE_CODE (prev_field) == RANGE_EXPR)
3965 12 : prev_field = TREE_OPERAND (prev_field, 1);
3966 : }
3967 : }
3968 : else
3969 : {
3970 8 : gcc_assert (TREE_CODE (expr) == STRING_CST);
3971 8 : write_expression (expr);
3972 : }
3973 : }
3974 176637 : write_char ('E');
3975 : }
3976 : else if (code == LAMBDA_EXPR)
3977 : {
3978 : /* [temp.over.link] Two lambda-expressions are never considered
3979 : equivalent.
3980 :
3981 : So just use the closure type mangling. */
3982 1408 : write_char ('L');
3983 1408 : write_type (LAMBDA_EXPR_CLOSURE (expr));
3984 1408 : write_char ('E');
3985 : }
3986 : else if (code == REQUIRES_EXPR)
3987 530187 : write_requires_expr (expr);
3988 5000437 : else if (dependent_name (expr))
3989 : {
3990 120029 : tree name = dependent_name (expr);
3991 120029 : if (IDENTIFIER_ANY_OP_P (name))
3992 : {
3993 9 : if (abi_check (16))
3994 6 : write_string ("on");
3995 : }
3996 120029 : write_unqualified_id (name);
3997 : }
3998 : else
3999 : {
4000 4880408 : normal_expr:
4001 4880541 : int i, len;
4002 4880541 : const char *name;
4003 :
4004 : /* When we bind a variable or function to a non-type template
4005 : argument with reference type, we create an ADDR_EXPR to show
4006 : the fact that the entity's address has been taken. But, we
4007 : don't actually want to output a mangling code for the `&'. */
4008 4880541 : if (TREE_CODE (expr) == ADDR_EXPR
4009 7353 : && TREE_TYPE (expr)
4010 4883999 : && TYPE_REF_P (TREE_TYPE (expr)))
4011 : {
4012 0 : expr = TREE_OPERAND (expr, 0);
4013 0 : if (DECL_P (expr))
4014 : {
4015 : write_expression (expr);
4016 : return;
4017 : }
4018 :
4019 0 : code = TREE_CODE (expr);
4020 : }
4021 :
4022 4880541 : if (code == COMPONENT_REF)
4023 : {
4024 196583 : tree ob = TREE_OPERAND (expr, 0);
4025 :
4026 196583 : if (TREE_CODE (ob) == ARROW_EXPR)
4027 : {
4028 320 : write_string (OVL_OP_INFO (false, code)->mangled_name);
4029 320 : ob = TREE_OPERAND (ob, 0);
4030 320 : write_expression (ob);
4031 : }
4032 196263 : else if (write_base_ref (expr))
4033 : return;
4034 196254 : else if (!is_dummy_object (ob))
4035 : {
4036 196248 : write_string ("dt");
4037 196248 : write_expression (ob);
4038 : }
4039 : /* else, for a non-static data member with no associated object (in
4040 : unevaluated context), use the unresolved-name mangling. */
4041 :
4042 196574 : write_member_name (TREE_OPERAND (expr, 1));
4043 196574 : return;
4044 : }
4045 :
4046 : /* If it wasn't any of those, recursively expand the expression. */
4047 4683958 : name = OVL_OP_INFO (false, code)->mangled_name;
4048 :
4049 : /* We used to mangle const_cast and static_cast like a C cast. */
4050 4683958 : if (code == CONST_CAST_EXPR
4051 4683958 : || code == STATIC_CAST_EXPR)
4052 : {
4053 265 : if (!abi_check (6))
4054 15 : name = OVL_OP_INFO (false, CAST_EXPR)->mangled_name;
4055 : }
4056 :
4057 4683958 : if (name == NULL)
4058 : {
4059 3 : switch (code)
4060 : {
4061 3 : case TRAIT_EXPR:
4062 3 : error ("use of built-in trait %qE in function signature; "
4063 : "use library traits instead", expr);
4064 3 : break;
4065 :
4066 0 : default:
4067 0 : sorry ("mangling %C", code);
4068 0 : break;
4069 : }
4070 : return;
4071 : }
4072 : else
4073 4683955 : write_string (name);
4074 :
4075 4683955 : switch (code)
4076 : {
4077 2115279 : case CALL_EXPR:
4078 2115279 : {
4079 2115279 : tree fn = CALL_EXPR_FN (expr);
4080 :
4081 2115279 : if (TREE_CODE (fn) == ADDR_EXPR)
4082 0 : fn = TREE_OPERAND (fn, 0);
4083 :
4084 : /* Mangle a dependent name as the name, not whatever happens to
4085 : be the first function in the overload set. */
4086 2114572 : if (OVL_P (fn)
4087 2368572 : && type_dependent_expression_p_push (expr))
4088 253397 : fn = OVL_NAME (fn);
4089 :
4090 2115279 : write_expression (fn);
4091 : }
4092 :
4093 4876908 : for (i = 0; i < call_expr_nargs (expr); ++i)
4094 646350 : write_expression (CALL_EXPR_ARG (expr, i));
4095 2115279 : write_char ('E');
4096 2115279 : break;
4097 :
4098 161767 : case CAST_EXPR:
4099 161767 : write_type (TREE_TYPE (expr));
4100 161767 : if (list_length (TREE_OPERAND (expr, 0)) == 1)
4101 161622 : write_expression (TREE_VALUE (TREE_OPERAND (expr, 0)));
4102 : else
4103 : {
4104 145 : tree args = TREE_OPERAND (expr, 0);
4105 145 : write_char ('_');
4106 157 : for (; args; args = TREE_CHAIN (args))
4107 12 : write_expression (TREE_VALUE (args));
4108 145 : write_char ('E');
4109 : }
4110 : break;
4111 :
4112 271 : case DYNAMIC_CAST_EXPR:
4113 271 : case REINTERPRET_CAST_EXPR:
4114 271 : case STATIC_CAST_EXPR:
4115 271 : case CONST_CAST_EXPR:
4116 271 : write_type (TREE_TYPE (expr));
4117 271 : write_expression (TREE_OPERAND (expr, 0));
4118 271 : break;
4119 :
4120 7551 : case PREINCREMENT_EXPR:
4121 7551 : case PREDECREMENT_EXPR:
4122 7551 : if (abi_check (6))
4123 7542 : write_char ('_');
4124 : /* Fall through. */
4125 :
4126 2406638 : default:
4127 : /* In the middle-end, some expressions have more operands than
4128 : they do in templates (and mangling). */
4129 2406638 : len = cp_tree_operand_length (expr);
4130 :
4131 8692128 : for (i = 0; i < len; ++i)
4132 : {
4133 3878852 : tree operand = TREE_OPERAND (expr, i);
4134 : /* As a GNU extension, the middle operand of a
4135 : conditional may be omitted. Since expression
4136 : manglings are supposed to represent the input token
4137 : stream, there's no good way to mangle such an
4138 : expression without extending the C++ ABI. */
4139 3878852 : if (code == COND_EXPR && i == 1 && !operand)
4140 : {
4141 3 : error ("omitted middle operand to %<?:%> operand "
4142 : "cannot be mangled");
4143 3 : continue;
4144 : }
4145 3878849 : else if (FOLD_EXPR_P (expr))
4146 : {
4147 : /* The first 'operand' of a fold-expression is the operator
4148 : that it folds over. */
4149 513266 : if (i == 0)
4150 : {
4151 256496 : int fcode = TREE_INT_CST_LOW (operand);
4152 256496 : write_string (OVL_OP_INFO (false, fcode)->mangled_name);
4153 256496 : continue;
4154 256496 : }
4155 256770 : else if (code == BINARY_LEFT_FOLD_EXPR)
4156 : {
4157 : /* The order of operands of the binary left and right
4158 : folds is the same, but we want to mangle them in
4159 : lexical order, i.e. non-pack first. */
4160 542 : if (i == 1)
4161 271 : operand = FOLD_EXPR_INIT (expr);
4162 : else
4163 271 : operand = FOLD_EXPR_PACK (expr);
4164 : }
4165 256770 : if (PACK_EXPANSION_P (operand))
4166 256496 : operand = PACK_EXPANSION_PATTERN (operand);
4167 : }
4168 3622353 : write_expression (operand);
4169 : }
4170 : }
4171 : }
4172 : }
4173 :
4174 : /* Non-terminal <reflection>.
4175 :
4176 : <reflection> ::= nu # null reflection
4177 : ::= vl <expression> # value
4178 : ::= ob <expression> # object
4179 : ::= vr <variable name> # variable
4180 : ::= sb <sb name> # structured binding
4181 : ::= fn <function encoding> # function
4182 : ::= pa [ <nonnegative number> ] _ <encoding> # fn param
4183 : ::= en <prefix> <unqualified-name> # enumerator
4184 : ::= an [ <nonnegative number> ] _ # annotation
4185 : ::= ta <alias prefix> <alias unqualified-name>
4186 : [ <alias template-args> ] _ <type> # type alias
4187 : ::= ty <type> # type
4188 : ::= dm <prefix> <unqualified-name> # ns data member
4189 : ::= da <prefix> [ <nonnegative number> ] _ # empty anon union
4190 : # data member
4191 : ::= un <prefix> [ <nonnegative number> ] _ # unnamed bitfld
4192 : ::= ct [ <prefix> ] <unqualified-name> # class template
4193 : ::= ft [ <prefix> ] <unqualified-name> # function template
4194 : ::= vt [ <prefix> ] <unqualified-name> # variable template
4195 : ::= at [ <prefix> ] <unqualified-name> # alias template
4196 : ::= co [ <prefix> ] <unqualified-name> # concept
4197 : ::= na [ <prefix> ] <unqualified-name> # namespace alias
4198 : ::= ns [ <prefix> ] <unqualified-name> # namespace
4199 : ::= gs # ^^::
4200 : ::= tt <template-template-param> # templ templ param
4201 : ::= de <expression> # dependent expr
4202 : ::= ba [ <nonnegative number> ] _ <type> # dir. base cls rel
4203 : ::= ds <type> _ [ <unqualified-name> ] _
4204 : [ <alignment number> ] _ [ <bit-width number> ] _
4205 : [ n ] [ <template-arg>* ] # data member spec */
4206 :
4207 : static void
4208 1550 : write_reflection (tree refl)
4209 : {
4210 1550 : char prefix[3];
4211 1550 : tree arg = reflection_mangle_prefix (refl, prefix);
4212 1550 : if (strcmp (prefix, "dm") == 0
4213 220 : && DECL_NAME (arg) == NULL_TREE
4214 12 : && ANON_AGGR_TYPE_P (TREE_TYPE (arg))
4215 1562 : && anon_aggr_naming_decl (TREE_TYPE (arg)) == NULL_TREE)
4216 12 : strcpy (prefix, "da");
4217 1550 : write_string (prefix);
4218 : /* If there is no argument, nothing further needs to be mangled. */
4219 1550 : if (arg == NULL_TREE)
4220 32 : return;
4221 1518 : if (strcmp (prefix, "vl") == 0 || strcmp (prefix, "ob") == 0)
4222 22 : write_expression (arg);
4223 1496 : else if (strcmp (prefix, "vr") == 0 || strcmp (prefix, "sb") == 0)
4224 234 : write_name (arg, 0);
4225 1262 : else if (strcmp (prefix, "fn") == 0)
4226 196 : write_encoding (arg);
4227 1066 : else if (strcmp (prefix, "pa") == 0)
4228 : {
4229 82 : tree fn = DECL_CONTEXT (arg);
4230 : /* DECL_PARM_INDEX is 1-based but here we want a 0-based index. */
4231 82 : const int idx = DECL_PARM_INDEX (arg) - 1;
4232 82 : write_compact_number (idx);
4233 82 : write_encoding (fn);
4234 : }
4235 984 : else if (strcmp (prefix, "en") == 0)
4236 : {
4237 26 : write_prefix (decl_mangling_context (arg));
4238 26 : write_unqualified_name (arg);
4239 : }
4240 958 : else if (strcmp (prefix, "an") == 0)
4241 10 : write_compact_number (tree_to_uhwi (arg));
4242 948 : else if (strcmp (prefix, "ta") == 0)
4243 : {
4244 28 : arg = TYPE_NAME (arg);
4245 : /* Can't use write_prefix (arg) here instead of
4246 : write_prefix + write_unqualified_name + optional
4247 : write_template_args, it shouldn't be
4248 : remembered among substitutions. */
4249 28 : write_prefix (decl_mangling_context (arg));
4250 28 : if (modules_p ())
4251 0 : maybe_write_module (arg);
4252 28 : write_source_name (DECL_NAME (arg));
4253 28 : tree template_info = maybe_template_info (arg);
4254 28 : if (template_info)
4255 4 : write_template_args (TI_ARGS (template_info));
4256 28 : write_char ('_');
4257 28 : write_type (DECL_ORIGINAL_TYPE (arg));
4258 : }
4259 920 : else if (strcmp (prefix, "ty") == 0)
4260 300 : write_type (arg);
4261 620 : else if (strcmp (prefix, "dm") == 0)
4262 : {
4263 208 : tree ctx = decl_mangling_context (arg);
4264 424 : while (ctx && ANON_UNION_TYPE_P (ctx))
4265 8 : ctx = decl_mangling_context (TYPE_NAME (ctx));
4266 208 : write_prefix (ctx);
4267 208 : write_unqualified_name (arg);
4268 : }
4269 412 : else if (strcmp (prefix, "da") == 0)
4270 : {
4271 12 : int idx = 0;
4272 12 : tree ctx = decl_mangling_context (arg);
4273 198 : for (tree f = TYPE_FIELDS (ctx); f; f = DECL_CHAIN (f))
4274 198 : if (f == arg)
4275 : break;
4276 186 : else if (TREE_CODE (f) == FIELD_DECL
4277 18 : && DECL_NAME (f) == NULL_TREE
4278 18 : && ANON_AGGR_TYPE_P (TREE_TYPE (f))
4279 204 : && anon_aggr_naming_decl (TREE_TYPE (f)) == NULL_TREE)
4280 18 : ++idx;
4281 12 : write_prefix (ctx);
4282 12 : write_compact_number (idx);
4283 : }
4284 400 : else if (strcmp (prefix, "un") == 0)
4285 : {
4286 8 : tree ctx = DECL_CONTEXT (arg);
4287 8 : int idx = 0;
4288 142 : for (tree f = TYPE_FIELDS (ctx); f; f = DECL_CHAIN (f))
4289 142 : if (f == arg)
4290 : break;
4291 134 : else if (TREE_CODE (f) == FIELD_DECL && DECL_UNNAMED_BIT_FIELD (f))
4292 6 : ++idx;
4293 8 : write_prefix (decl_mangling_context (arg));
4294 8 : write_compact_number (idx);
4295 : }
4296 392 : else if (strcmp (prefix, "ct") == 0
4297 354 : || strcmp (prefix, "ft") == 0
4298 308 : || strcmp (prefix, "vt") == 0
4299 290 : || strcmp (prefix, "at") == 0
4300 272 : || strcmp (prefix, "co") == 0
4301 258 : || strcmp (prefix, "na") == 0
4302 248 : || strcmp (prefix, "ns") == 0)
4303 : {
4304 276 : write_prefix (decl_mangling_context (arg));
4305 276 : write_unqualified_name (STRIP_TEMPLATE (arg));
4306 : }
4307 116 : else if (strcmp (prefix, "ba") == 0)
4308 : {
4309 26 : gcc_assert (TREE_CODE (arg) == TREE_BINFO);
4310 : tree c = arg, base_binfo;
4311 52 : while (BINFO_INHERITANCE_CHAIN (c))
4312 : c = BINFO_INHERITANCE_CHAIN (c);
4313 :
4314 : unsigned idx;
4315 30 : for (idx = 0; BINFO_BASE_ITERATE (c, idx, base_binfo); idx++)
4316 30 : if (base_binfo == arg)
4317 : break;
4318 26 : write_compact_number (idx);
4319 26 : write_type (BINFO_TYPE (c));
4320 : }
4321 90 : else if (strcmp (prefix, "ds") == 0)
4322 : {
4323 84 : gcc_assert (TREE_CODE (arg) == TREE_VEC);
4324 84 : write_type (TREE_VEC_ELT (arg, 0));
4325 84 : write_char ('_');
4326 84 : if (TREE_VEC_ELT (arg, 1))
4327 80 : write_unqualified_id (TREE_VEC_ELT (arg, 1));
4328 84 : write_char ('_');
4329 84 : if (TREE_VEC_ELT (arg, 2))
4330 2 : write_number (tree_to_shwi (TREE_VEC_ELT (arg, 2)), 0, 10);
4331 84 : write_char ('_');
4332 84 : if (TREE_VEC_ELT (arg, 3))
4333 6 : write_number (tree_to_shwi (TREE_VEC_ELT (arg, 3)), 0, 10);
4334 84 : write_char ('_');
4335 84 : if (integer_nonzerop (TREE_VEC_ELT (arg, 4)))
4336 2 : write_char ('n');
4337 90 : for (int i = 5; i < TREE_VEC_LENGTH (arg); ++i)
4338 6 : write_template_arg (REFLECT_EXPR_HANDLE (TREE_VEC_ELT (arg, i)));
4339 : }
4340 6 : else if (strcmp (prefix, "tt") == 0)
4341 : {
4342 2 : gcc_assert (DECL_TEMPLATE_TEMPLATE_PARM_P (arg));
4343 2 : write_template_template_param (TREE_TYPE (arg));
4344 : }
4345 4 : else if (strcmp (prefix, "de") == 0)
4346 4 : write_expression (arg);
4347 : else
4348 0 : gcc_unreachable ();
4349 : }
4350 :
4351 : /* Mangle a dependent splice.
4352 :
4353 : <splice> ::= DS <expression> [ <template-args> ] E
4354 :
4355 : TODO: This is only a proposed mangling.
4356 : See <https://github.com/itanium-cxx-abi/cxx-abi/issues/208>. */
4357 :
4358 : static void
4359 108 : write_splice (tree sp)
4360 : {
4361 108 : write_string ("DS");
4362 :
4363 108 : if (TREE_CODE (sp) == SPLICE_SCOPE)
4364 58 : sp = SPLICE_SCOPE_EXPR (sp);
4365 108 : gcc_assert (dependent_splice_p (sp));
4366 108 : if (TREE_CODE (sp) == TEMPLATE_ID_EXPR)
4367 : {
4368 4 : write_expression (TREE_OPERAND (TREE_OPERAND (sp, 0), 0));
4369 4 : write_template_args (TREE_OPERAND (sp, 1));
4370 : }
4371 : else
4372 104 : write_expression (TREE_OPERAND (sp, 0));
4373 :
4374 108 : write_char ('E');
4375 108 : }
4376 :
4377 : /* Literal subcase of non-terminal <template-arg>.
4378 :
4379 : "Literal arguments, e.g. "A<42L>", are encoded with their type
4380 : and value. Negative integer values are preceded with "n"; for
4381 : example, "A<-42L>" becomes "1AILln42EE". The bool value false is
4382 : encoded as 0, true as 1." */
4383 :
4384 : static void
4385 95568522 : write_template_arg_literal (const tree value)
4386 : {
4387 95568522 : if (TREE_CODE (value) == STRING_CST)
4388 : /* Temporarily mangle strings as braced initializer lists. */
4389 1667 : write_string ("tl");
4390 : else
4391 95566855 : write_char ('L');
4392 :
4393 95568522 : tree valtype = TREE_TYPE (value);
4394 95568522 : write_type (valtype);
4395 :
4396 : /* Write a null member pointer value as (type)0, regardless of its
4397 : real representation. */
4398 95568522 : if (null_member_pointer_value_p (value))
4399 264 : write_integer_cst (integer_zero_node);
4400 : else
4401 95568258 : switch (TREE_CODE (value))
4402 : {
4403 24308 : case CONST_DECL:
4404 24308 : write_integer_cst (DECL_INITIAL (value));
4405 24308 : break;
4406 :
4407 95538184 : case INTEGER_CST:
4408 95538184 : gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node)
4409 : || integer_zerop (value) || integer_onep (value));
4410 95538184 : if (!(abi_version_at_least (14)
4411 95531314 : && NULLPTR_TYPE_P (TREE_TYPE (value))))
4412 95538128 : write_integer_cst (value);
4413 : break;
4414 :
4415 2543 : case REAL_CST:
4416 2543 : write_real_cst (value);
4417 2543 : break;
4418 :
4419 6 : case COMPLEX_CST:
4420 6 : if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST
4421 6 : && TREE_CODE (TREE_IMAGPART (value)) == INTEGER_CST)
4422 : {
4423 3 : write_integer_cst (TREE_REALPART (value));
4424 3 : write_char ('_');
4425 3 : write_integer_cst (TREE_IMAGPART (value));
4426 : }
4427 3 : else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST
4428 3 : && TREE_CODE (TREE_IMAGPART (value)) == REAL_CST)
4429 : {
4430 3 : write_real_cst (TREE_REALPART (value));
4431 3 : write_char ('_');
4432 3 : write_real_cst (TREE_IMAGPART (value));
4433 : }
4434 : else
4435 0 : gcc_unreachable ();
4436 : break;
4437 :
4438 1667 : case STRING_CST:
4439 1667 : {
4440 : /* Mangle strings the same as braced initializer lists. */
4441 1667 : unsigned n = TREE_STRING_LENGTH (value);
4442 1667 : const char *str = TREE_STRING_POINTER (value);
4443 :
4444 : /* Count the number of trailing nuls and subtract them from
4445 : STRSIZE because they don't need to be mangled. */
4446 4638 : for (const char *p = str + n - 1; ; --p)
4447 : {
4448 4638 : if (*p || p == str)
4449 : {
4450 1667 : n -= str + n - !!*p - p;
4451 1667 : break;
4452 : }
4453 : }
4454 1667 : tree eltype = TREE_TYPE (valtype);
4455 11784 : for (const char *p = str; n--; ++p)
4456 : {
4457 10117 : write_char ('L');
4458 10117 : write_type (eltype);
4459 10117 : write_unsigned_number (*(const unsigned char*)p);
4460 10117 : write_string ("E");
4461 : }
4462 : break;
4463 : }
4464 :
4465 1550 : case REFLECT_EXPR:
4466 1550 : write_reflection (value);
4467 1550 : break;
4468 :
4469 0 : default:
4470 0 : gcc_unreachable ();
4471 : }
4472 :
4473 95568522 : write_char ('E');
4474 95568522 : }
4475 :
4476 : /* Non-terminal <template-arg>.
4477 :
4478 : <template-arg> ::= <type> # type
4479 : ::= L <type> </value/ number> E # literal
4480 : ::= LZ <name> E # external name
4481 : ::= X <expression> E # expression */
4482 :
4483 : static void
4484 769062109 : write_template_arg (tree node)
4485 : {
4486 769062109 : enum tree_code code = TREE_CODE (node);
4487 :
4488 769062109 : MANGLE_TRACE_TREE ("template-arg", node);
4489 :
4490 : /* A template template parameter's argument list contains TREE_LIST
4491 : nodes of which the value field is the actual argument. */
4492 769062109 : if (code == TREE_LIST)
4493 : {
4494 0 : node = TREE_VALUE (node);
4495 : /* If it's a decl, deal with its type instead. */
4496 0 : if (DECL_P (node))
4497 : {
4498 0 : node = TREE_TYPE (node);
4499 0 : code = TREE_CODE (node);
4500 : }
4501 : }
4502 :
4503 769062109 : if (VAR_P (node) && DECL_NTTP_OBJECT_P (node))
4504 : /* We want to mangle the argument, not the var we stored it in. */
4505 51474 : node = tparm_object_argument (node);
4506 :
4507 : /* Strip a conversion added by convert_nontype_argument. */
4508 769062109 : if (TREE_CODE (node) == IMPLICIT_CONV_EXPR)
4509 78 : node = TREE_OPERAND (node, 0);
4510 769062109 : if (REFERENCE_REF_P (node))
4511 282 : node = TREE_OPERAND (node, 0);
4512 769062109 : if (TREE_CODE (node) == NOP_EXPR
4513 769062109 : && TYPE_REF_P (TREE_TYPE (node)))
4514 : {
4515 : /* Template parameters can be of reference type. To maintain
4516 : internal consistency, such arguments use a conversion from
4517 : address of object to reference type. */
4518 276 : gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR);
4519 276 : node = TREE_OPERAND (TREE_OPERAND (node, 0), 0);
4520 : }
4521 :
4522 769062109 : if (TREE_CODE (node) == BASELINK
4523 769062109 : && !type_unknown_p (node))
4524 : {
4525 : /* Before v6 we wrongly wrapped a class-scope function in X/E. */
4526 18 : if (abi_check (6))
4527 12 : node = BASELINK_FUNCTIONS (node);
4528 : }
4529 :
4530 769062109 : if (ARGUMENT_PACK_P (node))
4531 : {
4532 : /* Expand the template argument pack. */
4533 10079291 : tree args = ARGUMENT_PACK_ARGS (node);
4534 10079291 : int i, length = TREE_VEC_LENGTH (args);
4535 10079291 : if (abi_check (6))
4536 10079273 : write_char ('J');
4537 : else
4538 18 : write_char ('I');
4539 24589927 : for (i = 0; i < length; ++i)
4540 14510636 : write_template_arg (TREE_VEC_ELT (args, i));
4541 10079291 : write_char ('E');
4542 : }
4543 758982818 : else if (TYPE_P (node))
4544 662213814 : write_type (node);
4545 96769004 : else if (code == TEMPLATE_DECL)
4546 : /* A template appearing as a template arg is a template template arg. */
4547 799583 : write_template_template_arg (node);
4548 95164117 : else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST)
4549 805304 : || code == CONST_DECL
4550 809038 : || null_member_pointer_value_p (node)
4551 96778311 : || code == REFLECT_EXPR)
4552 95161825 : write_template_arg_literal (node);
4553 807596 : else if (code == EXCESS_PRECISION_EXPR
4554 807596 : && TREE_CODE (TREE_OPERAND (node, 0)) == REAL_CST)
4555 0 : write_template_arg_literal (fold_convert (TREE_TYPE (node),
4556 : TREE_OPERAND (node, 0)));
4557 807596 : else if (DECL_P (node))
4558 : {
4559 295 : write_char ('L');
4560 : /* Until ABI version 3, the underscore before the mangled name
4561 : was incorrectly omitted. */
4562 295 : if (!abi_check (3))
4563 21 : write_char ('Z');
4564 : else
4565 274 : write_string ("_Z");
4566 295 : write_encoding (node);
4567 295 : write_char ('E');
4568 : }
4569 : else
4570 : {
4571 : /* Template arguments may be expressions. */
4572 807301 : write_char ('X');
4573 807301 : write_expression (node);
4574 807301 : write_char ('E');
4575 : }
4576 769062109 : }
4577 :
4578 : /* <template-template-arg>
4579 : ::= <name>
4580 : ::= <substitution> */
4581 :
4582 : static void
4583 799583 : write_template_template_arg (const tree decl)
4584 : {
4585 799583 : MANGLE_TRACE_TREE ("template-template-arg", decl);
4586 :
4587 799583 : if (find_substitution (decl))
4588 : return;
4589 716880 : write_name (decl, /*ignore_local_scope=*/0);
4590 716880 : add_substitution (decl);
4591 : }
4592 :
4593 :
4594 : /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE.
4595 :
4596 : <array-type> ::= A [</dimension/ number>] _ </element/ type>
4597 : ::= A <expression> _ </element/ type>
4598 :
4599 : "Array types encode the dimension (number of elements) and the
4600 : element type. For variable length arrays, the dimension (but not
4601 : the '_' separator) is omitted."
4602 : Note that for flexible array members, like for other arrays of
4603 : unspecified size, the dimension is also omitted. */
4604 :
4605 : static void
4606 1570570 : write_array_type (const tree type)
4607 : {
4608 1570570 : write_char ('A');
4609 1570570 : if (TYPE_DOMAIN (type))
4610 : {
4611 393875 : tree index_type;
4612 :
4613 393875 : index_type = TYPE_DOMAIN (type);
4614 : /* The INDEX_TYPE gives the upper and lower bounds of the array.
4615 : It's null for flexible array members which have no upper bound
4616 : (this is a change from GCC 5 and prior where such members were
4617 : incorrectly mangled as zero-length arrays). */
4618 393875 : if (tree max = TYPE_MAX_VALUE (index_type))
4619 : {
4620 393875 : if (TREE_CODE (max) == INTEGER_CST)
4621 : {
4622 : /* The ABI specifies that we should mangle the number of
4623 : elements in the array, not the largest allowed index. */
4624 233392 : offset_int wmax = wi::to_offset (max) + 1;
4625 : /* Truncate the result - this will mangle [0, SIZE_INT_MAX]
4626 : number of elements as zero. */
4627 233392 : wmax = wi::zext (wmax, TYPE_PRECISION (TREE_TYPE (max)));
4628 233392 : gcc_assert (wi::fits_uhwi_p (wmax));
4629 233392 : write_unsigned_number (wmax.to_uhwi ());
4630 : }
4631 : else
4632 : {
4633 160483 : gcc_checking_assert (TREE_CODE (max) == MINUS_EXPR
4634 : && integer_onep (TREE_OPERAND (max, 1)));
4635 160483 : max = TREE_OPERAND (max, 0);
4636 160483 : write_expression (max);
4637 : }
4638 : }
4639 : }
4640 1570570 : write_char ('_');
4641 1570570 : write_type (TREE_TYPE (type));
4642 1570570 : }
4643 :
4644 : /* Non-terminal <pointer-to-member-type> for pointer-to-member
4645 : variables. TYPE is a pointer-to-member POINTER_TYPE.
4646 :
4647 : <pointer-to-member-type> ::= M </class/ type> </member/ type> */
4648 :
4649 : static void
4650 285577 : write_pointer_to_member_type (const tree type)
4651 : {
4652 285577 : write_char ('M');
4653 285577 : write_type (TYPE_PTRMEM_CLASS_TYPE (type));
4654 285577 : write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type));
4655 285577 : }
4656 :
4657 : /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM,
4658 : TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a
4659 : TEMPLATE_PARM_INDEX.
4660 :
4661 : <template-param> ::= T </parameter/ number> _ */
4662 :
4663 : static void
4664 29336115 : write_template_param (const tree parm)
4665 : {
4666 29336115 : int parm_index;
4667 29336115 : int level;
4668 :
4669 29336115 : MANGLE_TRACE_TREE ("template-parm", parm);
4670 :
4671 29336115 : switch (TREE_CODE (parm))
4672 : {
4673 28557889 : case TEMPLATE_TYPE_PARM:
4674 28557889 : case TEMPLATE_TEMPLATE_PARM:
4675 28557889 : case BOUND_TEMPLATE_TEMPLATE_PARM:
4676 28557889 : parm_index = TEMPLATE_TYPE_IDX (parm);
4677 28557889 : level = TEMPLATE_TYPE_LEVEL (parm);
4678 28557889 : break;
4679 :
4680 778226 : case TEMPLATE_PARM_INDEX:
4681 778226 : parm_index = TEMPLATE_PARM_IDX (parm);
4682 778226 : level = TEMPLATE_PARM_LEVEL (parm);
4683 778226 : break;
4684 :
4685 0 : default:
4686 0 : gcc_unreachable ();
4687 : }
4688 :
4689 29336115 : write_char ('T');
4690 29336115 : if (level > 1)
4691 : {
4692 28640 : if (abi_check (19))
4693 : {
4694 28628 : write_char ('L');
4695 28628 : write_compact_number (level - 1);
4696 : }
4697 : }
4698 : /* NUMBER as it appears in the mangling is (-1)-indexed, with the
4699 : earliest template param denoted by `_'. */
4700 29336115 : write_compact_number (parm_index);
4701 29336115 : }
4702 :
4703 : /* <template-template-param>
4704 : ::= <template-param>
4705 : ::= <substitution> */
4706 :
4707 : static void
4708 631 : write_template_template_param (const tree parm)
4709 : {
4710 631 : tree templ = NULL_TREE;
4711 :
4712 : /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the
4713 : template template parameter. The substitution candidate here is
4714 : only the template. */
4715 631 : if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
4716 : {
4717 536 : templ
4718 536 : = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm));
4719 536 : if (find_substitution (templ))
4720 : return;
4721 : }
4722 :
4723 : /* <template-param> encodes only the template parameter position,
4724 : not its template arguments, which is fine here. */
4725 631 : write_template_param (parm);
4726 631 : if (templ)
4727 536 : add_substitution (templ);
4728 : }
4729 :
4730 : /* Non-terminal <substitution>.
4731 :
4732 : <substitution> ::= S <seq-id> _
4733 : ::= S_ */
4734 :
4735 : static void
4736 181569960 : write_substitution (const int seq_id)
4737 : {
4738 181569960 : MANGLE_TRACE ("substitution", "");
4739 :
4740 181569960 : write_char ('S');
4741 181569960 : if (seq_id > 0)
4742 158150382 : write_number (seq_id - 1, /*unsigned=*/1, 36);
4743 181569960 : write_char ('_');
4744 181569960 : }
4745 :
4746 : /* Start mangling ENTITY. */
4747 :
4748 : static inline void
4749 231786651 : start_mangling (const tree entity)
4750 : {
4751 231786651 : G = {};
4752 231786651 : G.entity = entity;
4753 231786651 : obstack_free (&name_obstack, name_base);
4754 231786651 : mangle_obstack = &name_obstack;
4755 231786651 : name_base = obstack_alloc (&name_obstack, 0);
4756 231786651 : }
4757 :
4758 : /* Done with mangling. Release the data. */
4759 :
4760 : static void
4761 231786651 : finish_mangling_internal (void)
4762 : {
4763 : /* Clear all the substitutions. */
4764 231786651 : vec_safe_truncate (G.substitutions, 0);
4765 :
4766 231786651 : if (G.mod)
4767 7811 : mangle_module_fini ();
4768 :
4769 : /* Null-terminate the string. */
4770 231786651 : write_char ('\0');
4771 231786651 : }
4772 :
4773 :
4774 : /* Like finish_mangling_internal, but return the mangled string. */
4775 :
4776 : static inline const char *
4777 455484 : finish_mangling (void)
4778 : {
4779 455484 : finish_mangling_internal ();
4780 455484 : return (const char *) obstack_finish (mangle_obstack);
4781 : }
4782 :
4783 : /* Like finish_mangling_internal, but return an identifier. */
4784 :
4785 : static tree
4786 231331167 : finish_mangling_get_identifier (void)
4787 : {
4788 231331167 : finish_mangling_internal ();
4789 : /* Don't obstack_finish here, and the next start_mangling will
4790 : remove the identifier. */
4791 231331167 : return get_identifier ((const char *) obstack_base (mangle_obstack));
4792 : }
4793 :
4794 : /* Initialize data structures for mangling. */
4795 :
4796 : void
4797 100712 : init_mangle (void)
4798 : {
4799 100712 : gcc_obstack_init (&name_obstack);
4800 100712 : name_base = obstack_alloc (&name_obstack, 0);
4801 100712 : vec_alloc (G.substitutions, 0);
4802 :
4803 : /* Cache these identifiers for quick comparison when checking for
4804 : standard substitutions. */
4805 100712 : subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator");
4806 100712 : subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string");
4807 100712 : subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits");
4808 100712 : subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream");
4809 100712 : subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream");
4810 100712 : subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream");
4811 100712 : }
4812 :
4813 : /* Generate a mangling for MODULE's global initializer fn. */
4814 :
4815 : tree
4816 2066 : mangle_module_global_init (int module)
4817 : {
4818 2066 : start_mangling (NULL_TREE);
4819 :
4820 2066 : write_string ("_ZGI");
4821 2066 : write_module (module, true);
4822 :
4823 2066 : return finish_mangling_get_identifier ();
4824 : }
4825 :
4826 : /* Generate the mangled name of DECL. */
4827 :
4828 : static tree
4829 224672620 : mangle_decl_string (const tree decl)
4830 : {
4831 224672620 : tree result;
4832 224672620 : tree saved_fn = current_function_decl;
4833 :
4834 : /* We shouldn't be trying to mangle an uninstantiated template. */
4835 224672620 : gcc_assert (!type_dependent_expression_p (decl));
4836 :
4837 224672620 : current_function_decl = NULL_TREE;
4838 224672620 : iloc_sentinel ils (DECL_SOURCE_LOCATION (decl));
4839 :
4840 224672620 : start_mangling (decl);
4841 :
4842 224672620 : if (TREE_CODE (decl) == TYPE_DECL)
4843 338015 : write_type (TREE_TYPE (decl));
4844 : else
4845 224334605 : write_mangled_name (decl, true);
4846 :
4847 224672620 : result = finish_mangling_get_identifier ();
4848 224672620 : if (DEBUG_MANGLE)
4849 : fprintf (stderr, "mangle_decl_string = '%s'\n\n",
4850 : IDENTIFIER_POINTER (result));
4851 :
4852 224672620 : current_function_decl = saved_fn;
4853 224672620 : return result;
4854 224672620 : }
4855 :
4856 : /* Return an identifier for the external mangled name of DECL. */
4857 :
4858 : static tree
4859 167957991 : get_mangled_id (tree decl)
4860 : {
4861 167957991 : tree id = mangle_decl_string (decl);
4862 167957991 : return targetm.mangle_decl_assembler_name (decl, id);
4863 : }
4864 :
4865 : /* Create an identifier for the external mangled name of DECL. */
4866 :
4867 : void
4868 167966660 : mangle_decl (const tree decl)
4869 : {
4870 167966660 : tree id;
4871 167966660 : bool dep;
4872 :
4873 : /* Don't bother mangling uninstantiated templates. */
4874 167966660 : ++processing_template_decl;
4875 167966660 : if (TREE_CODE (decl) == TYPE_DECL)
4876 338500 : dep = dependent_type_p (TREE_TYPE (decl));
4877 : else
4878 333937564 : dep = (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
4879 279388082 : && any_dependent_template_arguments_p (DECL_TI_ARGS (decl)));
4880 167966660 : --processing_template_decl;
4881 167966660 : if (dep)
4882 : return;
4883 :
4884 : /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging.
4885 : It is not needed to assign names to anonymous namespace, but we use the
4886 : "<anon>" marker to be able to tell if type is C++ ODR type or type
4887 : produced by other language. */
4888 167958476 : if (TREE_CODE (decl) == TYPE_DECL
4889 338500 : && TYPE_STUB_DECL (TREE_TYPE (decl))
4890 168286377 : && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl))))
4891 485 : id = get_identifier ("<anon>");
4892 : else
4893 : {
4894 167957991 : gcc_assert (TREE_CODE (decl) != TYPE_DECL
4895 : || !no_linkage_check (TREE_TYPE (decl), true));
4896 167957991 : if (abi_version_at_least (10))
4897 167839953 : if (tree fn = decl_function_context (decl))
4898 3671330 : maybe_check_abi_tags (fn, decl);
4899 167957991 : id = get_mangled_id (decl);
4900 : }
4901 167958476 : SET_DECL_ASSEMBLER_NAME (decl, id);
4902 :
4903 167958476 : if (G.need_cxx17_warning
4904 167958476 : && (TREE_PUBLIC (decl) || DECL_REALLY_EXTERN (decl)))
4905 10 : warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wnoexcept_type,
4906 : "mangled name for %qD will change in C++17 because the "
4907 : "exception specification is part of a function type",
4908 : decl);
4909 :
4910 167958476 : if (id != DECL_NAME (decl)
4911 : /* Don't do this for a fake symbol we aren't going to emit anyway. */
4912 165343021 : && TREE_CODE (decl) != TYPE_DECL
4913 332962997 : && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl))
4914 : {
4915 144171435 : int save_ver = flag_abi_version;
4916 144171435 : tree id2 = NULL_TREE;
4917 :
4918 144171435 : if (!DECL_REALLY_EXTERN (decl))
4919 : {
4920 86723028 : record_mangling (decl, G.need_abi_warning);
4921 :
4922 86723028 : if (!G.need_abi_warning)
4923 : return;
4924 :
4925 37169 : flag_abi_version = flag_abi_compat_version;
4926 37169 : id2 = mangle_decl_string (decl);
4927 37169 : id2 = targetm.mangle_decl_assembler_name (decl, id2);
4928 37169 : flag_abi_version = save_ver;
4929 :
4930 37169 : if (id2 != id)
4931 37053 : note_mangling_alias (decl, id2);
4932 : }
4933 :
4934 57485576 : if (warn_abi)
4935 : {
4936 56677655 : const char fabi_version[] = "-fabi-version";
4937 :
4938 56677655 : if (flag_abi_compat_version != warn_abi_version
4939 56676928 : || id2 == NULL_TREE)
4940 : {
4941 56677460 : flag_abi_version = warn_abi_version;
4942 56677460 : id2 = mangle_decl_string (decl);
4943 56677460 : id2 = targetm.mangle_decl_assembler_name (decl, id2);
4944 : }
4945 56677655 : flag_abi_version = save_ver;
4946 :
4947 56677655 : if (id2 == id)
4948 : /* OK. */;
4949 266 : else if (warn_abi_version != 0
4950 266 : && abi_version_at_least (warn_abi_version))
4951 222 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
4952 : "the mangled name of %qD changed between "
4953 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4954 : G.entity, fabi_version, warn_abi_version, id2,
4955 : fabi_version, save_ver, id);
4956 : else
4957 44 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
4958 : "the mangled name of %qD changes between "
4959 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
4960 : G.entity, fabi_version, save_ver, id,
4961 : fabi_version, warn_abi_version, id2);
4962 : }
4963 :
4964 57485576 : flag_abi_version = save_ver;
4965 : }
4966 : }
4967 :
4968 : /* Generate the mangled representation of TYPE. */
4969 :
4970 : const char *
4971 455484 : mangle_type_string (const tree type)
4972 : {
4973 455484 : const char *result;
4974 :
4975 455484 : start_mangling (type);
4976 455484 : write_type (type);
4977 455484 : result = finish_mangling ();
4978 455484 : if (DEBUG_MANGLE)
4979 : fprintf (stderr, "mangle_type_string = '%s'\n\n", result);
4980 455484 : return result;
4981 : }
4982 :
4983 : /* Create an identifier for the mangled name of a special component
4984 : for belonging to TYPE. CODE is the ABI-specified code for this
4985 : component. */
4986 :
4987 : static tree
4988 5831903 : mangle_special_for_type (const tree type, const char *code)
4989 : {
4990 5831903 : tree result;
4991 :
4992 : /* We don't have an actual decl here for the special component, so
4993 : we can't just process the <encoded-name>. Instead, fake it. */
4994 5831903 : start_mangling (type);
4995 :
4996 : /* Start the mangling. */
4997 5831903 : write_string ("_Z");
4998 5831903 : write_string (code);
4999 :
5000 : /* Add the type. */
5001 5831903 : write_type (type);
5002 5831903 : result = finish_mangling_get_identifier ();
5003 :
5004 5831903 : if (DEBUG_MANGLE)
5005 : fprintf (stderr, "mangle_special_for_type = %s\n\n",
5006 : IDENTIFIER_POINTER (result));
5007 :
5008 5831903 : return result;
5009 : }
5010 :
5011 : /* Create an identifier for the mangled representation of the typeinfo
5012 : structure for TYPE. */
5013 :
5014 : tree
5015 3335248 : mangle_typeinfo_for_type (const tree type)
5016 : {
5017 3335248 : return mangle_special_for_type (type, "TI");
5018 : }
5019 :
5020 : /* Create an identifier for the mangled name of the NTBS containing
5021 : the mangled name of TYPE. */
5022 :
5023 : tree
5024 447130 : mangle_typeinfo_string_for_type (const tree type)
5025 : {
5026 447130 : return mangle_special_for_type (type, "TS");
5027 : }
5028 :
5029 : /* Create an identifier for the mangled name of the vtable for TYPE. */
5030 :
5031 : tree
5032 1861724 : mangle_vtbl_for_type (const tree type)
5033 : {
5034 1861724 : return mangle_special_for_type (type, "TV");
5035 : }
5036 :
5037 : /* Returns an identifier for the mangled name of the VTT for TYPE. */
5038 :
5039 : tree
5040 187801 : mangle_vtt_for_type (const tree type)
5041 : {
5042 187801 : return mangle_special_for_type (type, "TT");
5043 : }
5044 :
5045 : /* Returns an identifier for the mangled name of the decomposition
5046 : artificial variable DECL. DECLS is the vector of the VAR_DECLs
5047 : for the identifier-list. */
5048 :
5049 : tree
5050 889 : mangle_decomp (const tree decl, vec<tree> &decls)
5051 : {
5052 889 : gcc_assert (!type_dependent_expression_p (decl));
5053 :
5054 889 : location_t saved_loc = input_location;
5055 889 : input_location = DECL_SOURCE_LOCATION (decl);
5056 :
5057 889 : check_abi_tags (decl);
5058 889 : start_mangling (decl);
5059 889 : write_string ("_Z");
5060 :
5061 889 : tree context = decl_mangling_context (decl);
5062 889 : gcc_assert (context != NULL_TREE);
5063 :
5064 889 : bool nested = false;
5065 889 : bool local = false;
5066 889 : if (DECL_NAMESPACE_STD_P (context))
5067 9 : write_string ("St");
5068 880 : else if (TREE_CODE (context) == FUNCTION_DECL)
5069 : {
5070 267 : local = true;
5071 267 : write_char ('Z');
5072 267 : write_encoding (context);
5073 267 : write_char ('E');
5074 : }
5075 613 : else if (context != global_namespace)
5076 : {
5077 100 : nested = true;
5078 100 : write_char ('N');
5079 100 : write_prefix (context);
5080 : }
5081 :
5082 889 : write_string ("DC");
5083 889 : unsigned int i;
5084 889 : tree d;
5085 2944 : FOR_EACH_VEC_ELT (decls, i, d)
5086 2055 : write_unqualified_name (d);
5087 889 : write_char ('E');
5088 :
5089 889 : if (tree tags = get_abi_tags (decl))
5090 : {
5091 : /* We didn't emit ABI tags for structured bindings before ABI 19. */
5092 30 : if (!G.need_abi_warning
5093 30 : && TREE_PUBLIC (decl)
5094 120 : && abi_warn_or_compat_version_crosses (19))
5095 30 : G.need_abi_warning = 1;
5096 :
5097 30 : if (abi_version_at_least (19))
5098 30 : write_abi_tags (tags);
5099 : }
5100 :
5101 889 : if (nested)
5102 100 : write_char ('E');
5103 789 : else if (local && DECL_DISCRIMINATOR_P (decl))
5104 267 : write_discriminator (discriminator_for_local_entity (decl));
5105 :
5106 889 : tree id = finish_mangling_get_identifier ();
5107 889 : if (DEBUG_MANGLE)
5108 : fprintf (stderr, "mangle_decomp = '%s'\n\n",
5109 : IDENTIFIER_POINTER (id));
5110 :
5111 889 : input_location = saved_loc;
5112 :
5113 889 : if (warn_abi && G.need_abi_warning)
5114 : {
5115 0 : const char fabi_version[] = "-fabi-version";
5116 0 : tree id2 = id;
5117 0 : int save_ver = flag_abi_version;
5118 :
5119 0 : if (flag_abi_version != warn_abi_version)
5120 : {
5121 0 : flag_abi_version = warn_abi_version;
5122 0 : id2 = mangle_decomp (decl, decls);
5123 0 : flag_abi_version = save_ver;
5124 : }
5125 :
5126 0 : if (id2 == id)
5127 : /* OK. */;
5128 0 : else if (warn_abi_version != 0
5129 0 : && abi_version_at_least (warn_abi_version))
5130 0 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
5131 : "the mangled name of %qD changed between "
5132 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
5133 : G.entity, fabi_version, warn_abi_version, id2,
5134 : fabi_version, save_ver, id);
5135 : else
5136 0 : warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi,
5137 : "the mangled name of %qD changes between "
5138 : "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)",
5139 : G.entity, fabi_version, save_ver, id,
5140 : fabi_version, warn_abi_version, id2);
5141 : }
5142 :
5143 889 : return id;
5144 : }
5145 :
5146 : /* Return an identifier for a construction vtable group. TYPE is
5147 : the most derived class in the hierarchy; BINFO is the base
5148 : subobject for which this construction vtable group will be used.
5149 :
5150 : This mangling isn't part of the ABI specification; in the ABI
5151 : specification, the vtable group is dumped in the same COMDAT as the
5152 : main vtable, and is referenced only from that vtable, so it doesn't
5153 : need an external name. For binary formats without COMDAT sections,
5154 : though, we need external names for the vtable groups.
5155 :
5156 : We use the production
5157 :
5158 : <special-name> ::= TC <type> <offset number> _ <base type> */
5159 :
5160 : tree
5161 257156 : mangle_ctor_vtbl_for_type (const tree type, const tree binfo)
5162 : {
5163 257156 : tree result;
5164 :
5165 257156 : start_mangling (type);
5166 :
5167 257156 : write_string ("_Z");
5168 257156 : write_string ("TC");
5169 257156 : write_type (type);
5170 257156 : write_integer_cst (BINFO_OFFSET (binfo));
5171 257156 : write_char ('_');
5172 257156 : write_type (BINFO_TYPE (binfo));
5173 :
5174 257156 : result = finish_mangling_get_identifier ();
5175 257156 : if (DEBUG_MANGLE)
5176 : fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n",
5177 : IDENTIFIER_POINTER (result));
5178 257156 : return result;
5179 : }
5180 :
5181 : /* Mangle a this pointer or result pointer adjustment.
5182 :
5183 : <call-offset> ::= h <fixed offset number> _
5184 : ::= v <fixed offset number> _ <virtual offset number> _ */
5185 :
5186 : static void
5187 491554 : mangle_call_offset (const tree fixed_offset, const tree virtual_offset)
5188 : {
5189 491554 : write_char (virtual_offset ? 'v' : 'h');
5190 :
5191 : /* For either flavor, write the fixed offset. */
5192 491554 : write_integer_cst (fixed_offset);
5193 491554 : write_char ('_');
5194 :
5195 : /* For a virtual thunk, add the virtual offset. */
5196 491554 : if (virtual_offset)
5197 : {
5198 368028 : write_integer_cst (virtual_offset);
5199 368028 : write_char ('_');
5200 : }
5201 491554 : }
5202 :
5203 : /* Return an identifier for the mangled name of a this-adjusting or
5204 : covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment
5205 : to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this
5206 : is a virtual thunk, and it is the vtbl offset in
5207 : bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and
5208 : zero for a covariant thunk. Note, that FN_DECL might be a covariant
5209 : thunk itself. A covariant thunk name always includes the adjustment
5210 : for the this pointer, even if there is none.
5211 :
5212 : <special-name> ::= T <call-offset> <base encoding>
5213 : ::= Tc <this_adjust call-offset> <result_adjust call-offset>
5214 : <base encoding> */
5215 :
5216 : tree
5217 491167 : mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset,
5218 : tree virtual_offset, tree thunk)
5219 : {
5220 491167 : tree result;
5221 :
5222 491167 : if (abi_version_at_least (11))
5223 491164 : maybe_check_abi_tags (fn_decl, thunk, 11);
5224 :
5225 491167 : start_mangling (fn_decl);
5226 :
5227 491167 : write_string ("_Z");
5228 491167 : write_char ('T');
5229 :
5230 491167 : if (!this_adjusting)
5231 : {
5232 : /* Covariant thunk with no this adjustment */
5233 217 : write_char ('c');
5234 217 : mangle_call_offset (integer_zero_node, NULL_TREE);
5235 217 : mangle_call_offset (fixed_offset, virtual_offset);
5236 : }
5237 490950 : else if (!DECL_THUNK_P (fn_decl))
5238 : /* Plain this adjusting thunk. */
5239 490780 : mangle_call_offset (fixed_offset, virtual_offset);
5240 : else
5241 : {
5242 : /* This adjusting thunk to covariant thunk. */
5243 170 : write_char ('c');
5244 170 : mangle_call_offset (fixed_offset, virtual_offset);
5245 170 : fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl));
5246 170 : virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl);
5247 170 : if (virtual_offset)
5248 124 : virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
5249 170 : mangle_call_offset (fixed_offset, virtual_offset);
5250 170 : fn_decl = THUNK_TARGET (fn_decl);
5251 : }
5252 :
5253 : /* Scoped name. */
5254 491167 : write_encoding (fn_decl);
5255 :
5256 491167 : result = finish_mangling_get_identifier ();
5257 491167 : if (DEBUG_MANGLE)
5258 : fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result));
5259 491167 : return result;
5260 : }
5261 :
5262 : /* Handle ABI backwards compatibility for past bugs where we didn't call
5263 : check_abi_tags in places where it's needed: call check_abi_tags and warn if
5264 : it makes a difference. If FOR_DECL is non-null, it's the declaration
5265 : that we're actually trying to mangle; if it's null, we're mangling the
5266 : guard variable for T. */
5267 :
5268 : static void
5269 4167353 : maybe_check_abi_tags (tree t, tree for_decl, int ver)
5270 : {
5271 4167353 : if (DECL_ASSEMBLER_NAME_SET_P (t))
5272 : return;
5273 :
5274 825651 : tree oldtags = get_abi_tags (t);
5275 :
5276 825651 : mangle_decl (t);
5277 :
5278 825651 : tree newtags = get_abi_tags (t);
5279 825651 : if (newtags && newtags != oldtags
5280 36 : && abi_version_crosses (ver))
5281 : {
5282 12 : if (for_decl && DECL_THUNK_P (for_decl))
5283 3 : warning_at (DECL_SOURCE_LOCATION (t), OPT_Wabi,
5284 : "the mangled name of a thunk for %qD changes between "
5285 : "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
5286 : t, flag_abi_version, warn_abi_version);
5287 9 : else if (for_decl)
5288 6 : warning_at (DECL_SOURCE_LOCATION (for_decl), OPT_Wabi,
5289 : "the mangled name of %qD changes between "
5290 : "%<-fabi-version=%d%> and %<-fabi-version=%d%>",
5291 : for_decl, flag_abi_version, warn_abi_version);
5292 : else
5293 3 : warning_at (DECL_SOURCE_LOCATION (t), OPT_Wabi,
5294 : "the mangled name of the initialization guard variable "
5295 : "for %qD changes between %<-fabi-version=%d%> and "
5296 : "%<-fabi-version=%d%>",
5297 : t, flag_abi_version, warn_abi_version);
5298 : }
5299 : }
5300 :
5301 : /* Write out the appropriate string for this variable when generating
5302 : another mangled name based on this one. */
5303 :
5304 : static void
5305 7624 : write_guarded_var_name (const tree variable)
5306 : {
5307 7624 : if (DECL_NAME (variable)
5308 7624 : && startswith (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR"))
5309 : /* The name of a guard variable for a reference temporary should refer
5310 : to the reference, not the temporary. */
5311 6 : write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4);
5312 7618 : else if (DECL_DECOMPOSITION_P (variable)
5313 751 : && DECL_NAME (variable) == NULL_TREE
5314 7890 : && startswith (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (variable)),
5315 : "_Z"))
5316 : /* The name of a guard variable for a structured binding needs special
5317 : casing. */
5318 272 : write_string (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (variable)) + 2);
5319 : else
5320 7346 : write_name (variable, /*ignore_local_scope=*/0);
5321 7624 : }
5322 :
5323 : /* Return an identifier for the name of an initialization guard
5324 : variable for indicated VARIABLE. */
5325 :
5326 : tree
5327 4865 : mangle_guard_variable (const tree variable)
5328 : {
5329 4865 : if (abi_version_at_least (10))
5330 4859 : maybe_check_abi_tags (variable);
5331 4865 : start_mangling (variable);
5332 4865 : write_string ("_ZGV");
5333 4865 : write_guarded_var_name (variable);
5334 4865 : return finish_mangling_get_identifier ();
5335 : }
5336 :
5337 : /* Return an identifier for the name of a thread_local initialization
5338 : function for VARIABLE. */
5339 :
5340 : tree
5341 1190 : mangle_tls_init_fn (const tree variable)
5342 : {
5343 1190 : check_abi_tags (variable);
5344 1190 : start_mangling (variable);
5345 1190 : write_string ("_ZTH");
5346 1190 : write_guarded_var_name (variable);
5347 1190 : return finish_mangling_get_identifier ();
5348 : }
5349 :
5350 : /* Return an identifier for the name of a thread_local wrapper
5351 : function for VARIABLE. */
5352 :
5353 : #define TLS_WRAPPER_PREFIX "_ZTW"
5354 :
5355 : tree
5356 749 : mangle_tls_wrapper_fn (const tree variable)
5357 : {
5358 749 : check_abi_tags (variable);
5359 749 : start_mangling (variable);
5360 749 : write_string (TLS_WRAPPER_PREFIX);
5361 749 : write_guarded_var_name (variable);
5362 749 : return finish_mangling_get_identifier ();
5363 : }
5364 :
5365 : /* Return true iff FN is a thread_local wrapper function. */
5366 :
5367 : bool
5368 2653016 : decl_tls_wrapper_p (const tree fn)
5369 : {
5370 2653016 : if (TREE_CODE (fn) != FUNCTION_DECL)
5371 : return false;
5372 2112748 : tree name = DECL_NAME (fn);
5373 2112748 : return startswith (IDENTIFIER_POINTER (name), TLS_WRAPPER_PREFIX);
5374 : }
5375 :
5376 : /* Return an identifier for the name of a temporary variable used to
5377 : initialize a static reference. This is now part of the ABI. */
5378 :
5379 : tree
5380 820 : mangle_ref_init_variable (const tree variable)
5381 : {
5382 820 : start_mangling (variable);
5383 820 : write_string ("_ZGR");
5384 820 : check_abi_tags (variable);
5385 820 : write_guarded_var_name (variable);
5386 : /* Avoid name clashes with aggregate initialization of multiple
5387 : references at once. */
5388 820 : write_compact_number (current_ref_temp_count++);
5389 820 : return finish_mangling_get_identifier ();
5390 : }
5391 :
5392 : /* Return an identifier for the mangled name of a C++20 template parameter
5393 : object for template argument EXPR. */
5394 :
5395 : tree
5396 67742 : mangle_template_parm_object (tree expr)
5397 : {
5398 67742 : start_mangling (expr);
5399 67742 : write_string ("_ZTAX");
5400 67742 : write_expression (expr);
5401 67742 : write_char ('E');
5402 67742 : return finish_mangling_get_identifier ();
5403 : }
5404 :
5405 : /* Given a CLASS_TYPE, such as a record for std::bad_exception this
5406 : function generates a mangled name for the vtable map variable of
5407 : the class type. For example, if the class type is
5408 : "std::bad_exception", the mangled name for the class is
5409 : "St13bad_exception". This function would generate the name
5410 : "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as:
5411 : "_VTV<std::bad_exception>::__vtable_map". */
5412 :
5413 :
5414 : char *
5415 6 : get_mangled_vtable_map_var_name (tree class_type)
5416 : {
5417 6 : char *var_name = NULL;
5418 6 : const char *prefix = "_ZN4_VTVI";
5419 6 : const char *postfix = "E12__vtable_mapE";
5420 :
5421 6 : gcc_assert (TREE_CODE (class_type) == RECORD_TYPE);
5422 :
5423 6 : tree class_id = DECL_ASSEMBLER_NAME (TYPE_NAME (class_type));
5424 :
5425 6 : if (strstr (IDENTIFIER_POINTER (class_id), "<anon>") != NULL)
5426 : {
5427 0 : class_id = get_mangled_id (TYPE_NAME (class_type));
5428 0 : vtbl_register_mangled_name (TYPE_NAME (class_type), class_id);
5429 : }
5430 :
5431 6 : unsigned int len = strlen (IDENTIFIER_POINTER (class_id)) +
5432 : strlen (prefix) +
5433 6 : strlen (postfix) + 1;
5434 :
5435 6 : var_name = (char *) xmalloc (len);
5436 :
5437 6 : sprintf (var_name, "%s%s%s", prefix, IDENTIFIER_POINTER (class_id), postfix);
5438 :
5439 6 : return var_name;
5440 : }
5441 :
5442 : #include "gt-cp-mangle.h"
|
