]>
Commit | Line | Data |
---|---|---|
a5b4465c | 1 | /* Name mangling for the 3.0 -*- C++ -*- ABI. |
fbd26352 | 2 | Copyright (C) 2000-2019 Free Software Foundation, Inc. |
de5ccbfb | 3 | Written by Alex Samuel <samuel@codesourcery.com> |
98eaf693 | 4 | |
6f0d25a6 | 5 | This file is part of GCC. |
98eaf693 | 6 | |
6f0d25a6 | 7 | GCC is free software; you can redistribute it and/or modify it |
98eaf693 | 8 | under the terms of the GNU General Public License as published by |
aa139c3f | 9 | the Free Software Foundation; either version 3, or (at your option) |
98eaf693 | 10 | any later version. |
11 | ||
6f0d25a6 | 12 | GCC is distributed in the hope that it will be useful, but |
98eaf693 | 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 | ||
aa139c3f | 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/>. */ | |
98eaf693 | 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 | ||
653e5405 | 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 | |
074ab442 | 45 | mangle_thunk: thunk function or entry */ |
98eaf693 | 46 | |
47 | #include "config.h" | |
48 | #include "system.h" | |
805e22b2 | 49 | #include "coretypes.h" |
4cba6f60 | 50 | #include "target.h" |
51 | #include "vtable-verify.h" | |
4cba6f60 | 52 | #include "cp-tree.h" |
4cba6f60 | 53 | #include "stringpool.h" |
54 | #include "cgraph.h" | |
9ed99284 | 55 | #include "stor-layout.h" |
e100aadc | 56 | #include "flags.h" |
399fbdbd | 57 | #include "attribs.h" |
98eaf693 | 58 | |
59 | /* Debugging support. */ | |
60 | ||
61 | /* Define DEBUG_MANGLE to enable very verbose trace messages. */ | |
62 | #ifndef DEBUG_MANGLE | |
63 | #define DEBUG_MANGLE 0 | |
64 | #endif | |
65 | ||
66 | /* Macros for tracing the write_* functions. */ | |
67 | #if DEBUG_MANGLE | |
68 | # define MANGLE_TRACE(FN, INPUT) \ | |
0a8caa99 | 69 | fprintf (stderr, " %-24s: %-24s\n", (FN), (INPUT)) |
98eaf693 | 70 | # define MANGLE_TRACE_TREE(FN, NODE) \ |
71 | fprintf (stderr, " %-24s: %-24s (%p)\n", \ | |
f3d35d4d | 72 | (FN), get_tree_code_name (TREE_CODE (NODE)), (void *) (NODE)) |
98eaf693 | 73 | #else |
74 | # define MANGLE_TRACE(FN, INPUT) | |
75 | # define MANGLE_TRACE_TREE(FN, NODE) | |
76 | #endif | |
77 | ||
3160db1d | 78 | /* Nonzero if NODE is a class template-id. We can't rely on |
8762fbe2 | 79 | CLASSTYPE_USE_TEMPLATE here because of tricky bugs in the parser |
80 | that hard to distinguish A<T> from A, where A<T> is the type as | |
81 | instantiated outside of the template, and A is the type used | |
bbb9efab | 82 | without parameters inside the template. */ |
18f2b9d5 | 83 | #define CLASSTYPE_TEMPLATE_ID_P(NODE) \ |
49a669e2 | 84 | (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \ |
85 | || (CLASS_TYPE_P (NODE) \ | |
86 | && CLASSTYPE_TEMPLATE_INFO (NODE) != NULL \ | |
87 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE)))) | |
98eaf693 | 88 | |
229a58b1 | 89 | /* For deciding whether to set G.need_abi_warning, we need to consider both |
90 | warn_abi_version and flag_abi_compat_version. */ | |
91 | #define abi_warn_or_compat_version_crosses(N) \ | |
92 | (abi_version_crosses (N) || abi_compat_version_crosses (N)) | |
93 | ||
2b463b9a | 94 | /* And sometimes we can simplify the code path if we don't need to worry about |
95 | previous ABIs. */ | |
96 | #define abi_flag_at_least(flag,N) (flag == 0 || flag >= N) | |
97 | #define any_abi_below(N) \ | |
98 | (!abi_version_at_least (N) \ | |
99 | || !abi_flag_at_least (warn_abi_version, (N)) \ | |
100 | || !abi_flag_at_least (flag_abi_compat_version, (N))) | |
101 | ||
98eaf693 | 102 | /* Things we only need one of. This module is not reentrant. */ |
6dc50383 | 103 | struct GTY(()) globals { |
98eaf693 | 104 | /* An array of the current substitution candidates, in the order |
105 | we've seen them. */ | |
f1f41a6c | 106 | vec<tree, va_gc> *substitutions; |
16497dfb | 107 | |
18f2b9d5 | 108 | /* The entity that is being mangled. */ |
f13b585c | 109 | tree GTY ((skip)) entity; |
18f2b9d5 | 110 | |
4d7aaf8e | 111 | /* How many parameter scopes we are inside. */ |
112 | int parm_depth; | |
113 | ||
18f2b9d5 | 114 | /* True if the mangling will be different in a future version of the |
115 | ABI. */ | |
116 | bool need_abi_warning; | |
2e9e9363 | 117 | |
118 | /* True if the mangling will be different in C++17 mode. */ | |
40e2decb | 119 | bool need_cxx17_warning; |
6dc50383 | 120 | }; |
f13b585c | 121 | |
122 | static GTY (()) globals G; | |
123 | ||
124 | /* The obstack on which we build mangled names. */ | |
125 | static struct obstack *mangle_obstack; | |
126 | ||
127 | /* The obstack on which we build mangled names that are not going to | |
128 | be IDENTIFIER_NODEs. */ | |
129 | static struct obstack name_obstack; | |
130 | ||
1eff44ec | 131 | /* The first object on the name_obstack; we use this to free memory |
132 | allocated on the name_obstack. */ | |
f13b585c | 133 | static void *name_base; |
98eaf693 | 134 | |
135 | /* Indices into subst_identifiers. These are identifiers used in | |
136 | special substitution rules. */ | |
137 | typedef enum | |
138 | { | |
139 | SUBID_ALLOCATOR, | |
140 | SUBID_BASIC_STRING, | |
141 | SUBID_CHAR_TRAITS, | |
142 | SUBID_BASIC_ISTREAM, | |
143 | SUBID_BASIC_OSTREAM, | |
144 | SUBID_BASIC_IOSTREAM, | |
145 | SUBID_MAX | |
146 | } | |
147 | substitution_identifier_index_t; | |
148 | ||
149 | /* For quick substitution checks, look up these common identifiers | |
150 | once only. */ | |
652c3635 | 151 | static GTY(()) tree subst_identifiers[SUBID_MAX]; |
98eaf693 | 152 | |
153 | /* Single-letter codes for builtin integer types, defined in | |
154 | <builtin-type>. These are indexed by integer_type_kind values. */ | |
b14b6cce | 155 | static const char |
98eaf693 | 156 | integer_type_codes[itk_none] = |
157 | { | |
158 | 'c', /* itk_char */ | |
159 | 'a', /* itk_signed_char */ | |
160 | 'h', /* itk_unsigned_char */ | |
161 | 's', /* itk_short */ | |
162 | 't', /* itk_unsigned_short */ | |
163 | 'i', /* itk_int */ | |
164 | 'j', /* itk_unsigned_int */ | |
165 | 'l', /* itk_long */ | |
166 | 'm', /* itk_unsigned_long */ | |
167 | 'x', /* itk_long_long */ | |
6388cfe2 | 168 | 'y', /* itk_unsigned_long_long */ |
9f75f026 | 169 | /* __intN types are handled separately */ |
170 | '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0' | |
98eaf693 | 171 | }; |
172 | ||
61e3d157 | 173 | static int decl_is_template_id (const tree, tree* const); |
8762fbe2 | 174 | |
98eaf693 | 175 | /* Functions for handling substitutions. */ |
176 | ||
61e3d157 | 177 | static inline tree canonicalize_for_substitution (tree); |
178 | static void add_substitution (tree); | |
179 | static inline int is_std_substitution (const tree, | |
180 | const substitution_identifier_index_t); | |
181 | static inline int is_std_substitution_char (const tree, | |
182 | const substitution_identifier_index_t); | |
183 | static int find_substitution (tree); | |
184 | static void mangle_call_offset (const tree, const tree); | |
98eaf693 | 185 | |
186 | /* Functions for emitting mangled representations of things. */ | |
187 | ||
1da3f78a | 188 | static void write_mangled_name (const tree, bool); |
61e3d157 | 189 | static void write_encoding (const tree); |
190 | static void write_name (tree, const int); | |
d4701f6c | 191 | static void write_abi_tags (tree); |
61e3d157 | 192 | static void write_unscoped_name (const tree); |
193 | static void write_unscoped_template_name (const tree); | |
194 | static void write_nested_name (const tree); | |
195 | static void write_prefix (const tree); | |
196 | static void write_template_prefix (const tree); | |
42a2bdf5 | 197 | static void write_unqualified_name (tree); |
61e3d157 | 198 | static void write_conversion_operator_name (const tree); |
199 | static void write_source_name (tree); | |
244db24d | 200 | static void write_literal_operator_name (tree); |
a8b75081 | 201 | static void write_unnamed_type_name (const tree); |
202 | static void write_closure_type_name (const tree); | |
61e3d157 | 203 | static int hwint_to_ascii (unsigned HOST_WIDE_INT, const unsigned int, char *, |
204 | const unsigned int); | |
205 | static void write_number (unsigned HOST_WIDE_INT, const int, | |
206 | const unsigned int); | |
a8b75081 | 207 | static void write_compact_number (int num); |
61e3d157 | 208 | static void write_integer_cst (const tree); |
209 | static void write_real_cst (const tree); | |
210 | static void write_identifier (const char *); | |
211 | static void write_special_name_constructor (const tree); | |
212 | static void write_special_name_destructor (const tree); | |
213 | static void write_type (tree); | |
214 | static int write_CV_qualifiers_for_type (const tree); | |
215 | static void write_builtin_type (tree); | |
216 | static void write_function_type (const tree); | |
217 | static void write_bare_function_type (const tree, const int, const tree); | |
218 | static void write_method_parms (tree, const int, const tree); | |
219 | static void write_class_enum_type (const tree); | |
220 | static void write_template_args (tree); | |
221 | static void write_expression (tree); | |
222 | static void write_template_arg_literal (const tree); | |
223 | static void write_template_arg (tree); | |
224 | static void write_template_template_arg (const tree); | |
225 | static void write_array_type (const tree); | |
226 | static void write_pointer_to_member_type (const tree); | |
227 | static void write_template_param (const tree); | |
228 | static void write_template_template_param (const tree); | |
229 | static void write_substitution (const int); | |
230 | static int discriminator_for_local_entity (tree); | |
231 | static int discriminator_for_string_literal (tree, tree); | |
232 | static void write_discriminator (const int); | |
a8b75081 | 233 | static void write_local_name (tree, const tree, const tree); |
61e3d157 | 234 | static void dump_substitution_candidates (void); |
dfecde36 | 235 | static tree mangle_decl_string (const tree); |
a4a311c3 | 236 | static void maybe_check_abi_tags (tree, tree = NULL_TREE, int = 10); |
2b463b9a | 237 | static bool equal_abi_tags (tree, tree); |
98eaf693 | 238 | |
239 | /* Control functions. */ | |
240 | ||
dfecde36 | 241 | static inline void start_mangling (const tree); |
61e3d157 | 242 | static tree mangle_special_for_type (const tree, const char *); |
98eaf693 | 243 | |
244 | /* Append a single character to the end of the mangled | |
245 | representation. */ | |
653e5405 | 246 | #define write_char(CHAR) \ |
f13b585c | 247 | obstack_1grow (mangle_obstack, (CHAR)) |
98eaf693 | 248 | |
47cd6605 | 249 | /* Append a sized buffer to the end of the mangled representation. */ |
653e5405 | 250 | #define write_chars(CHAR, LEN) \ |
f13b585c | 251 | obstack_grow (mangle_obstack, (CHAR), (LEN)) |
2ec35239 | 252 | |
98eaf693 | 253 | /* Append a NUL-terminated string to the end of the mangled |
254 | representation. */ | |
653e5405 | 255 | #define write_string(STRING) \ |
f13b585c | 256 | obstack_grow (mangle_obstack, (STRING), strlen (STRING)) |
98eaf693 | 257 | |
3160db1d | 258 | /* Nonzero if NODE1 and NODE2 are both TREE_LIST nodes and have the |
f753592a | 259 | same purpose (context, which may be a type) and value (template |
98eaf693 | 260 | decl). See write_template_prefix for more information on what this |
261 | is used for. */ | |
653e5405 | 262 | #define NESTED_TEMPLATE_MATCH(NODE1, NODE2) \ |
263 | (TREE_CODE (NODE1) == TREE_LIST \ | |
264 | && TREE_CODE (NODE2) == TREE_LIST \ | |
265 | && ((TYPE_P (TREE_PURPOSE (NODE1)) \ | |
266 | && same_type_p (TREE_PURPOSE (NODE1), TREE_PURPOSE (NODE2))) \ | |
267 | || TREE_PURPOSE (NODE1) == TREE_PURPOSE (NODE2)) \ | |
98eaf693 | 268 | && TREE_VALUE (NODE1) == TREE_VALUE (NODE2)) |
269 | ||
e75e76ea | 270 | /* Write out an unsigned quantity in base 10. */ |
653e5405 | 271 | #define write_unsigned_number(NUMBER) \ |
0a8caa99 | 272 | write_number ((NUMBER), /*unsigned_p=*/1, 10) |
e75e76ea | 273 | |
22b930cb | 274 | /* If DECL is a template instance (including the uninstantiated template |
275 | itself), return nonzero and, if TEMPLATE_INFO is non-NULL, set | |
276 | *TEMPLATE_INFO to its template info. Otherwise return zero. */ | |
8762fbe2 | 277 | |
278 | static int | |
61e3d157 | 279 | decl_is_template_id (const tree decl, tree* const template_info) |
8762fbe2 | 280 | { |
281 | if (TREE_CODE (decl) == TYPE_DECL) | |
282 | { | |
283 | /* TYPE_DECLs are handled specially. Look at its type to decide | |
284 | if this is a template instantiation. */ | |
61e3d157 | 285 | const tree type = TREE_TYPE (decl); |
8762fbe2 | 286 | |
287 | if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_ID_P (type)) | |
288 | { | |
289 | if (template_info != NULL) | |
290 | /* For a templated TYPE_DECL, the template info is hanging | |
291 | off the type. */ | |
18f2b9d5 | 292 | *template_info = TYPE_TEMPLATE_INFO (type); |
8762fbe2 | 293 | return 1; |
294 | } | |
9031d10b | 295 | } |
8762fbe2 | 296 | else |
297 | { | |
298 | /* Check if this is a primary template. */ | |
299 | if (DECL_LANG_SPECIFIC (decl) != NULL | |
22b930cb | 300 | && VAR_OR_FUNCTION_DECL_P (decl) |
301 | && DECL_TEMPLATE_INFO (decl) | |
8762fbe2 | 302 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)) |
303 | && TREE_CODE (decl) != TEMPLATE_DECL) | |
304 | { | |
305 | if (template_info != NULL) | |
306 | /* For most templated decls, the template info is hanging | |
307 | off the decl. */ | |
308 | *template_info = DECL_TEMPLATE_INFO (decl); | |
309 | return 1; | |
310 | } | |
311 | } | |
312 | ||
313 | /* It's not a template id. */ | |
314 | return 0; | |
315 | } | |
316 | ||
98eaf693 | 317 | /* Produce debugging output of current substitution candidates. */ |
318 | ||
319 | static void | |
eb32e911 | 320 | dump_substitution_candidates (void) |
98eaf693 | 321 | { |
322 | unsigned i; | |
db5d9b05 | 323 | tree el; |
98eaf693 | 324 | |
325 | fprintf (stderr, " ++ substitutions "); | |
f1f41a6c | 326 | FOR_EACH_VEC_ELT (*G.substitutions, i, el) |
98eaf693 | 327 | { |
98eaf693 | 328 | const char *name = "???"; |
329 | ||
330 | if (i > 0) | |
331 | fprintf (stderr, " "); | |
332 | if (DECL_P (el)) | |
333 | name = IDENTIFIER_POINTER (DECL_NAME (el)); | |
334 | else if (TREE_CODE (el) == TREE_LIST) | |
335 | name = IDENTIFIER_POINTER (DECL_NAME (TREE_VALUE (el))); | |
336 | else if (TYPE_NAME (el)) | |
eb192f47 | 337 | name = TYPE_NAME_STRING (el); |
98eaf693 | 338 | fprintf (stderr, " S%d_ = ", i - 1); |
9031d10b | 339 | if (TYPE_P (el) && |
340 | (CP_TYPE_RESTRICT_P (el) | |
341 | || CP_TYPE_VOLATILE_P (el) | |
98eaf693 | 342 | || CP_TYPE_CONST_P (el))) |
343 | fprintf (stderr, "CV-"); | |
9031d10b | 344 | fprintf (stderr, "%s (%s at %p)\n", |
f3d35d4d | 345 | name, get_tree_code_name (TREE_CODE (el)), (void *) el); |
98eaf693 | 346 | } |
347 | } | |
348 | ||
2e9e9363 | 349 | /* <exception-spec> ::= |
350 | Do -- non-throwing exception specification | |
351 | DO <expression> E -- computed (instantiation-dependent) noexcept | |
352 | Dw <type>* E -- throw (types) */ | |
353 | ||
354 | static void | |
355 | write_exception_spec (tree spec) | |
356 | { | |
357 | ||
358 | if (!spec || spec == noexcept_false_spec) | |
359 | /* Nothing. */ | |
360 | return; | |
361 | ||
362 | if (!flag_noexcept_type) | |
363 | { | |
40e2decb | 364 | G.need_cxx17_warning = true; |
2e9e9363 | 365 | return; |
366 | } | |
367 | ||
4afe894b | 368 | if (spec == noexcept_true_spec || spec == empty_except_spec) |
2e9e9363 | 369 | write_string ("Do"); |
4afe894b | 370 | else if (tree expr = TREE_PURPOSE (spec)) |
2e9e9363 | 371 | { |
4afe894b | 372 | /* noexcept (expr) */ |
373 | gcc_assert (uses_template_parms (expr)); | |
2e9e9363 | 374 | write_string ("DO"); |
4afe894b | 375 | write_expression (expr); |
2e9e9363 | 376 | write_char ('E'); |
377 | } | |
378 | else | |
379 | { | |
4afe894b | 380 | /* throw (type-list) */ |
2e9e9363 | 381 | write_string ("Dw"); |
382 | for (tree t = spec; t; t = TREE_CHAIN (t)) | |
383 | write_type (TREE_VALUE (t)); | |
384 | write_char ('E'); | |
385 | } | |
386 | } | |
387 | ||
98eaf693 | 388 | /* Both decls and types can be substitution candidates, but sometimes |
389 | they refer to the same thing. For instance, a TYPE_DECL and | |
390 | RECORD_TYPE for the same class refer to the same thing, and should | |
755edffd | 391 | be treated accordingly in substitutions. This function returns a |
98eaf693 | 392 | canonicalized tree node representing NODE that is used when adding |
393 | and substitution candidates and finding matches. */ | |
394 | ||
395 | static inline tree | |
61e3d157 | 396 | canonicalize_for_substitution (tree node) |
98eaf693 | 397 | { |
398 | /* For a TYPE_DECL, use the type instead. */ | |
399 | if (TREE_CODE (node) == TYPE_DECL) | |
400 | node = TREE_TYPE (node); | |
2fb61329 | 401 | if (TYPE_P (node) |
402 | && TYPE_CANONICAL (node) != node | |
403 | && TYPE_MAIN_VARIANT (node) != node) | |
f962c310 | 404 | { |
2ba14c1f | 405 | tree orig = node; |
2fb61329 | 406 | /* Here we want to strip the topmost typedef only. |
407 | We need to do that so is_std_substitution can do proper | |
408 | name matching. */ | |
f962c310 | 409 | if (TREE_CODE (node) == FUNCTION_TYPE) |
410 | /* Use build_qualified_type and TYPE_QUALS here to preserve | |
411 | the old buggy mangling of attribute noreturn with abi<5. */ | |
412 | node = build_qualified_type (TYPE_MAIN_VARIANT (node), | |
413 | TYPE_QUALS (node)); | |
414 | else | |
415 | node = cp_build_qualified_type (TYPE_MAIN_VARIANT (node), | |
416 | cp_type_quals (node)); | |
2ba14c1f | 417 | if (TREE_CODE (node) == FUNCTION_TYPE |
418 | || TREE_CODE (node) == METHOD_TYPE) | |
2e9e9363 | 419 | { |
420 | node = build_ref_qualified_type (node, type_memfn_rqual (orig)); | |
421 | tree r = canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (orig)); | |
422 | if (flag_noexcept_type) | |
423 | node = build_exception_variant (node, r); | |
424 | else | |
425 | /* Set the warning flag if appropriate. */ | |
426 | write_exception_spec (r); | |
427 | } | |
f962c310 | 428 | } |
98eaf693 | 429 | return node; |
430 | } | |
431 | ||
432 | /* Add NODE as a substitution candidate. NODE must not already be on | |
433 | the list of candidates. */ | |
434 | ||
435 | static void | |
61e3d157 | 436 | add_substitution (tree node) |
98eaf693 | 437 | { |
438 | tree c; | |
439 | ||
440 | if (DEBUG_MANGLE) | |
9031d10b | 441 | fprintf (stderr, " ++ add_substitution (%s at %10p)\n", |
f3d35d4d | 442 | get_tree_code_name (TREE_CODE (node)), (void *) node); |
98eaf693 | 443 | |
444 | /* Get the canonicalized substitution candidate for NODE. */ | |
445 | c = canonicalize_for_substitution (node); | |
446 | if (DEBUG_MANGLE && c != node) | |
447 | fprintf (stderr, " ++ using candidate (%s at %10p)\n", | |
f3d35d4d | 448 | get_tree_code_name (TREE_CODE (node)), (void *) node); |
98eaf693 | 449 | node = c; |
450 | ||
98eaf693 | 451 | /* Make sure NODE isn't already a candidate. */ |
5e8689fb | 452 | if (flag_checking) |
453 | { | |
454 | int i; | |
455 | tree candidate; | |
456 | ||
457 | FOR_EACH_VEC_SAFE_ELT (G.substitutions, i, candidate) | |
458 | { | |
459 | gcc_assert (!(DECL_P (node) && node == candidate)); | |
460 | gcc_assert (!(TYPE_P (node) && TYPE_P (candidate) | |
092b1d6f | 461 | && same_type_p (node, candidate))); |
5e8689fb | 462 | } |
463 | } | |
98eaf693 | 464 | |
465 | /* Put the decl onto the varray of substitution candidates. */ | |
f1f41a6c | 466 | vec_safe_push (G.substitutions, node); |
98eaf693 | 467 | |
468 | if (DEBUG_MANGLE) | |
469 | dump_substitution_candidates (); | |
470 | } | |
471 | ||
3160db1d | 472 | /* Helper function for find_substitution. Returns nonzero if NODE, |
98eaf693 | 473 | which may be a decl or a CLASS_TYPE, is a template-id with template |
474 | name of substitution_index[INDEX] in the ::std namespace. */ | |
475 | ||
9031d10b | 476 | static inline int |
61e3d157 | 477 | is_std_substitution (const tree node, |
478 | const substitution_identifier_index_t index) | |
98eaf693 | 479 | { |
480 | tree type = NULL; | |
481 | tree decl = NULL; | |
482 | ||
483 | if (DECL_P (node)) | |
484 | { | |
485 | type = TREE_TYPE (node); | |
486 | decl = node; | |
487 | } | |
488 | else if (CLASS_TYPE_P (node)) | |
489 | { | |
490 | type = node; | |
491 | decl = TYPE_NAME (node); | |
492 | } | |
9031d10b | 493 | else |
98eaf693 | 494 | /* These are not the droids you're looking for. */ |
495 | return 0; | |
496 | ||
f753592a | 497 | return (DECL_NAMESPACE_STD_P (CP_DECL_CONTEXT (decl)) |
9031d10b | 498 | && TYPE_LANG_SPECIFIC (type) |
18f2b9d5 | 499 | && TYPE_TEMPLATE_INFO (type) |
9031d10b | 500 | && (DECL_NAME (TYPE_TI_TEMPLATE (type)) |
f753592a | 501 | == subst_identifiers[index])); |
98eaf693 | 502 | } |
503 | ||
b795d0cb | 504 | /* Return the ABI tags (the TREE_VALUE of the "abi_tag" attribute entry) for T, |
505 | which can be a decl or type. */ | |
506 | ||
507 | static tree | |
508 | get_abi_tags (tree t) | |
509 | { | |
510 | if (!t || TREE_CODE (t) == NAMESPACE_DECL) | |
511 | return NULL_TREE; | |
512 | ||
513 | if (DECL_P (t) && DECL_DECLARES_TYPE_P (t)) | |
514 | t = TREE_TYPE (t); | |
515 | ||
516 | tree attrs; | |
517 | if (TYPE_P (t)) | |
518 | attrs = TYPE_ATTRIBUTES (t); | |
519 | else | |
520 | attrs = DECL_ATTRIBUTES (t); | |
521 | ||
522 | tree tags = lookup_attribute ("abi_tag", attrs); | |
523 | if (tags) | |
524 | tags = TREE_VALUE (tags); | |
525 | return tags; | |
526 | } | |
527 | ||
3160db1d | 528 | /* Helper function for find_substitution. Returns nonzero if NODE, |
98eaf693 | 529 | which may be a decl or a CLASS_TYPE, is the template-id |
530 | ::std::identifier<char>, where identifier is | |
531 | substitution_index[INDEX]. */ | |
532 | ||
533 | static inline int | |
61e3d157 | 534 | is_std_substitution_char (const tree node, |
535 | const substitution_identifier_index_t index) | |
98eaf693 | 536 | { |
537 | tree args; | |
538 | /* Check NODE's name is ::std::identifier. */ | |
539 | if (!is_std_substitution (node, index)) | |
540 | return 0; | |
541 | /* Figure out its template args. */ | |
542 | if (DECL_P (node)) | |
9031d10b | 543 | args = DECL_TI_ARGS (node); |
98eaf693 | 544 | else if (CLASS_TYPE_P (node)) |
545 | args = CLASSTYPE_TI_ARGS (node); | |
546 | else | |
547 | /* Oops, not a template. */ | |
548 | return 0; | |
549 | /* NODE's template arg list should be <char>. */ | |
9031d10b | 550 | return |
98eaf693 | 551 | TREE_VEC_LENGTH (args) == 1 |
552 | && TREE_VEC_ELT (args, 0) == char_type_node; | |
553 | } | |
554 | ||
555 | /* Check whether a substitution should be used to represent NODE in | |
556 | the mangling. | |
557 | ||
558 | First, check standard special-case substitutions. | |
559 | ||
9031d10b | 560 | <substitution> ::= St |
653e5405 | 561 | # ::std |
98eaf693 | 562 | |
653e5405 | 563 | ::= Sa |
98eaf693 | 564 | # ::std::allocator |
565 | ||
653e5405 | 566 | ::= Sb |
567 | # ::std::basic_string | |
98eaf693 | 568 | |
653e5405 | 569 | ::= Ss |
570 | # ::std::basic_string<char, | |
98eaf693 | 571 | ::std::char_traits<char>, |
572 | ::std::allocator<char> > | |
573 | ||
653e5405 | 574 | ::= Si |
575 | # ::std::basic_istream<char, ::std::char_traits<char> > | |
98eaf693 | 576 | |
653e5405 | 577 | ::= So |
578 | # ::std::basic_ostream<char, ::std::char_traits<char> > | |
98eaf693 | 579 | |
653e5405 | 580 | ::= Sd |
581 | # ::std::basic_iostream<char, ::std::char_traits<char> > | |
98eaf693 | 582 | |
583 | Then examine the stack of currently available substitution | |
584 | candidates for entities appearing earlier in the same mangling | |
585 | ||
586 | If a substitution is found, write its mangled representation and | |
3160db1d | 587 | return nonzero. If none is found, just return zero. */ |
98eaf693 | 588 | |
589 | static int | |
61e3d157 | 590 | find_substitution (tree node) |
98eaf693 | 591 | { |
592 | int i; | |
f1f41a6c | 593 | const int size = vec_safe_length (G.substitutions); |
98eaf693 | 594 | tree decl; |
595 | tree type; | |
7cd4e87d | 596 | const char *abbr = NULL; |
98eaf693 | 597 | |
598 | if (DEBUG_MANGLE) | |
599 | fprintf (stderr, " ++ find_substitution (%s at %p)\n", | |
f3d35d4d | 600 | get_tree_code_name (TREE_CODE (node)), (void *) node); |
98eaf693 | 601 | |
602 | /* Obtain the canonicalized substitution representation for NODE. | |
603 | This is what we'll compare against. */ | |
604 | node = canonicalize_for_substitution (node); | |
605 | ||
606 | /* Check for builtin substitutions. */ | |
607 | ||
608 | decl = TYPE_P (node) ? TYPE_NAME (node) : node; | |
609 | type = TYPE_P (node) ? node : TREE_TYPE (node); | |
610 | ||
611 | /* Check for std::allocator. */ | |
9031d10b | 612 | if (decl |
f753592a | 613 | && is_std_substitution (decl, SUBID_ALLOCATOR) |
614 | && !CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl))) | |
7cd4e87d | 615 | abbr = "Sa"; |
98eaf693 | 616 | |
617 | /* Check for std::basic_string. */ | |
7cd4e87d | 618 | else if (decl && is_std_substitution (decl, SUBID_BASIC_STRING)) |
98eaf693 | 619 | { |
e75e76ea | 620 | if (TYPE_P (node)) |
98eaf693 | 621 | { |
9031d10b | 622 | /* If this is a type (i.e. a fully-qualified template-id), |
623 | check for | |
653e5405 | 624 | std::basic_string <char, |
625 | std::char_traits<char>, | |
98eaf693 | 626 | std::allocator<char> > . */ |
3119c950 | 627 | if (cp_type_quals (type) == TYPE_UNQUALIFIED |
98eaf693 | 628 | && CLASSTYPE_USE_TEMPLATE (type)) |
629 | { | |
630 | tree args = CLASSTYPE_TI_ARGS (type); | |
631 | if (TREE_VEC_LENGTH (args) == 3 | |
b7f68aff | 632 | && same_type_p (TREE_VEC_ELT (args, 0), char_type_node) |
98eaf693 | 633 | && is_std_substitution_char (TREE_VEC_ELT (args, 1), |
634 | SUBID_CHAR_TRAITS) | |
635 | && is_std_substitution_char (TREE_VEC_ELT (args, 2), | |
636 | SUBID_ALLOCATOR)) | |
7cd4e87d | 637 | abbr = "Ss"; |
98eaf693 | 638 | } |
639 | } | |
640 | else | |
641 | /* Substitute for the template name only if this isn't a type. */ | |
7cd4e87d | 642 | abbr = "Sb"; |
98eaf693 | 643 | } |
644 | ||
645 | /* Check for basic_{i,o,io}stream. */ | |
7cd4e87d | 646 | else if (TYPE_P (node) |
647 | && cp_type_quals (type) == TYPE_UNQUALIFIED | |
648 | && CLASS_TYPE_P (type) | |
649 | && CLASSTYPE_USE_TEMPLATE (type) | |
650 | && CLASSTYPE_TEMPLATE_INFO (type) != NULL) | |
98eaf693 | 651 | { |
9031d10b | 652 | /* First, check for the template |
98eaf693 | 653 | args <char, std::char_traits<char> > . */ |
654 | tree args = CLASSTYPE_TI_ARGS (type); | |
655 | if (TREE_VEC_LENGTH (args) == 2 | |
e4f430b5 | 656 | && TYPE_P (TREE_VEC_ELT (args, 0)) |
b7f68aff | 657 | && same_type_p (TREE_VEC_ELT (args, 0), char_type_node) |
98eaf693 | 658 | && is_std_substitution_char (TREE_VEC_ELT (args, 1), |
659 | SUBID_CHAR_TRAITS)) | |
660 | { | |
661 | /* Got them. Is this basic_istream? */ | |
290031a3 | 662 | if (is_std_substitution (decl, SUBID_BASIC_ISTREAM)) |
7cd4e87d | 663 | abbr = "Si"; |
98eaf693 | 664 | /* Or basic_ostream? */ |
290031a3 | 665 | else if (is_std_substitution (decl, SUBID_BASIC_OSTREAM)) |
7cd4e87d | 666 | abbr = "So"; |
98eaf693 | 667 | /* Or basic_iostream? */ |
290031a3 | 668 | else if (is_std_substitution (decl, SUBID_BASIC_IOSTREAM)) |
7cd4e87d | 669 | abbr = "Sd"; |
98eaf693 | 670 | } |
671 | } | |
672 | ||
673 | /* Check for namespace std. */ | |
7cd4e87d | 674 | else if (decl && DECL_NAMESPACE_STD_P (decl)) |
98eaf693 | 675 | { |
676 | write_string ("St"); | |
677 | return 1; | |
678 | } | |
679 | ||
7cd4e87d | 680 | tree tags = NULL_TREE; |
776bb221 | 681 | if (OVERLOAD_TYPE_P (node) || DECL_CLASS_TEMPLATE_P (node)) |
b795d0cb | 682 | tags = get_abi_tags (type); |
98eaf693 | 683 | /* Now check the list of available substitutions for this mangling |
47cd6605 | 684 | operation. */ |
7cd4e87d | 685 | if (!abbr || tags) for (i = 0; i < size; ++i) |
98eaf693 | 686 | { |
f1f41a6c | 687 | tree candidate = (*G.substitutions)[i]; |
98eaf693 | 688 | /* NODE is a matched to a candidate if it's the same decl node or |
689 | if it's the same type. */ | |
690 | if (decl == candidate | |
272bba4d | 691 | || (TYPE_P (candidate) && type && TYPE_P (node) |
98eaf693 | 692 | && same_type_p (type, candidate)) |
693 | || NESTED_TEMPLATE_MATCH (node, candidate)) | |
694 | { | |
695 | write_substitution (i); | |
696 | return 1; | |
697 | } | |
698 | } | |
699 | ||
7cd4e87d | 700 | if (!abbr) |
701 | /* No substitution found. */ | |
702 | return 0; | |
703 | ||
704 | write_string (abbr); | |
705 | if (tags) | |
706 | { | |
707 | /* If there are ABI tags on the abbreviation, it becomes | |
708 | a substitution candidate. */ | |
709 | write_abi_tags (tags); | |
710 | add_substitution (node); | |
711 | } | |
712 | return 1; | |
98eaf693 | 713 | } |
714 | ||
527cb890 | 715 | /* Returns whether DECL's symbol name should be the plain unqualified-id |
716 | rather than a more complicated mangled name. */ | |
717 | ||
718 | static bool | |
719 | unmangled_name_p (const tree decl) | |
720 | { | |
721 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
722 | { | |
723 | /* The names of `extern "C"' functions are not mangled. */ | |
724 | return (DECL_EXTERN_C_FUNCTION_P (decl) | |
725 | /* But overloaded operator names *are* mangled. */ | |
726 | && !DECL_OVERLOADED_OPERATOR_P (decl)); | |
727 | } | |
728 | else if (VAR_P (decl)) | |
729 | { | |
730 | /* static variables are mangled. */ | |
731 | if (!DECL_EXTERNAL_LINKAGE_P (decl)) | |
732 | return false; | |
733 | ||
734 | /* extern "C" declarations aren't mangled. */ | |
735 | if (DECL_EXTERN_C_P (decl)) | |
736 | return true; | |
737 | ||
738 | /* Other variables at non-global scope are mangled. */ | |
739 | if (CP_DECL_CONTEXT (decl) != global_namespace) | |
740 | return false; | |
741 | ||
742 | /* Variable template instantiations are mangled. */ | |
743 | if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl) | |
744 | && variable_template_p (DECL_TI_TEMPLATE (decl))) | |
745 | return false; | |
746 | ||
747 | /* Declarations with ABI tags are mangled. */ | |
b795d0cb | 748 | if (get_abi_tags (decl)) |
527cb890 | 749 | return false; |
750 | ||
751 | /* The names of non-static global variables aren't mangled. */ | |
752 | return true; | |
753 | } | |
754 | ||
755 | return false; | |
756 | } | |
98eaf693 | 757 | |
1da3f78a | 758 | /* TOP_LEVEL is true, if this is being called at outermost level of |
759 | mangling. It should be false when mangling a decl appearing in an | |
760 | expression within some other mangling. | |
9031d10b | 761 | |
1da3f78a | 762 | <mangled-name> ::= _Z <encoding> */ |
98eaf693 | 763 | |
89df180d | 764 | static void |
1da3f78a | 765 | write_mangled_name (const tree decl, bool top_level) |
98eaf693 | 766 | { |
767 | MANGLE_TRACE_TREE ("mangled-name", decl); | |
768 | ||
527cb890 | 769 | check_abi_tags (decl); |
9031d10b | 770 | |
527cb890 | 771 | if (unmangled_name_p (decl)) |
772 | { | |
1da3f78a | 773 | if (top_level) |
774 | write_string (IDENTIFIER_POINTER (DECL_NAME (decl))); | |
775 | else | |
776 | { | |
777 | /* The standard notes: "The <encoding> of an extern "C" | |
653e5405 | 778 | function is treated like global-scope data, i.e. as its |
779 | <source-name> without a type." We cannot write | |
780 | overloaded operators that way though, because it contains | |
781 | characters invalid in assembler. */ | |
f591db9a | 782 | write_string ("_Z"); |
1da3f78a | 783 | write_source_name (DECL_NAME (decl)); |
784 | } | |
785 | } | |
98eaf693 | 786 | else |
98eaf693 | 787 | { |
788 | write_string ("_Z"); | |
789 | write_encoding (decl); | |
790 | } | |
791 | } | |
792 | ||
527cb890 | 793 | /* Returns true if the return type of DECL is part of its signature, and |
794 | therefore its mangling. */ | |
795 | ||
796 | bool | |
797 | mangle_return_type_p (tree decl) | |
798 | { | |
799 | return (!DECL_CONSTRUCTOR_P (decl) | |
800 | && !DECL_DESTRUCTOR_P (decl) | |
801 | && !DECL_CONV_FN_P (decl) | |
802 | && decl_is_template_id (decl, NULL)); | |
803 | } | |
804 | ||
98eaf693 | 805 | /* <encoding> ::= <function name> <bare-function-type> |
b7f68aff | 806 | ::= <data name> */ |
98eaf693 | 807 | |
808 | static void | |
61e3d157 | 809 | write_encoding (const tree decl) |
98eaf693 | 810 | { |
811 | MANGLE_TRACE_TREE ("encoding", decl); | |
812 | ||
98eaf693 | 813 | if (DECL_LANG_SPECIFIC (decl) && DECL_EXTERN_C_FUNCTION_P (decl)) |
814 | { | |
9d8c6ec8 | 815 | /* For overloaded operators write just the mangled name |
816 | without arguments. */ | |
817 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
818 | write_name (decl, /*ignore_local_scope=*/0); | |
819 | else | |
820 | write_source_name (DECL_NAME (decl)); | |
98eaf693 | 821 | return; |
822 | } | |
823 | ||
bbb9efab | 824 | write_name (decl, /*ignore_local_scope=*/0); |
98eaf693 | 825 | if (TREE_CODE (decl) == FUNCTION_DECL) |
826 | { | |
827 | tree fn_type; | |
d5460724 | 828 | tree d; |
2e9e9363 | 829 | bool tmpl = decl_is_template_id (decl, NULL); |
98eaf693 | 830 | |
2e9e9363 | 831 | if (tmpl) |
d5460724 | 832 | { |
833 | fn_type = get_mostly_instantiated_function_type (decl); | |
834 | /* FN_TYPE will not have parameter types for in-charge or | |
835 | VTT parameters. Therefore, we pass NULL_TREE to | |
836 | write_bare_function_type -- otherwise, it will get | |
837 | confused about which artificial parameters to skip. */ | |
838 | d = NULL_TREE; | |
839 | } | |
98eaf693 | 840 | else |
d5460724 | 841 | { |
842 | fn_type = TREE_TYPE (decl); | |
843 | d = decl; | |
844 | } | |
98eaf693 | 845 | |
9031d10b | 846 | write_bare_function_type (fn_type, |
527cb890 | 847 | mangle_return_type_p (decl), |
d5460724 | 848 | d); |
98eaf693 | 849 | } |
98eaf693 | 850 | } |
851 | ||
a8b75081 | 852 | /* Lambdas can have a bit more context for mangling, specifically VAR_DECL |
853 | or PARM_DECL context, which doesn't belong in DECL_CONTEXT. */ | |
854 | ||
855 | static tree | |
856 | decl_mangling_context (tree decl) | |
857 | { | |
16a1895e | 858 | tree tcontext = targetm.cxx.decl_mangling_context (decl); |
859 | ||
860 | if (tcontext != NULL_TREE) | |
861 | return tcontext; | |
862 | ||
5e410273 | 863 | if (TREE_CODE (decl) == TEMPLATE_DECL |
864 | && DECL_TEMPLATE_RESULT (decl)) | |
865 | decl = DECL_TEMPLATE_RESULT (decl); | |
866 | ||
a8b75081 | 867 | if (TREE_CODE (decl) == TYPE_DECL |
868 | && LAMBDA_TYPE_P (TREE_TYPE (decl))) | |
869 | { | |
870 | tree extra = LAMBDA_TYPE_EXTRA_SCOPE (TREE_TYPE (decl)); | |
871 | if (extra) | |
872 | return extra; | |
873 | } | |
e422db1c | 874 | else if (template_type_parameter_p (decl)) |
8a03d6ff | 875 | /* template type parms have no mangling context. */ |
876 | return NULL_TREE; | |
a8b75081 | 877 | return CP_DECL_CONTEXT (decl); |
878 | } | |
879 | ||
98eaf693 | 880 | /* <name> ::= <unscoped-name> |
653e5405 | 881 | ::= <unscoped-template-name> <template-args> |
98eaf693 | 882 | ::= <nested-name> |
9031d10b | 883 | ::= <local-name> |
bbb9efab | 884 | |
3160db1d | 885 | If IGNORE_LOCAL_SCOPE is nonzero, this production of <name> is |
bbb9efab | 886 | called from <local-name>, which mangles the enclosing scope |
887 | elsewhere and then uses this function to mangle just the part | |
888 | underneath the function scope. So don't use the <local-name> | |
889 | production, to avoid an infinite recursion. */ | |
98eaf693 | 890 | |
891 | static void | |
61e3d157 | 892 | write_name (tree decl, const int ignore_local_scope) |
98eaf693 | 893 | { |
e75e76ea | 894 | tree context; |
895 | ||
98eaf693 | 896 | MANGLE_TRACE_TREE ("name", decl); |
897 | ||
8762fbe2 | 898 | if (TREE_CODE (decl) == TYPE_DECL) |
899 | { | |
900 | /* In case this is a typedef, fish out the corresponding | |
901 | TYPE_DECL for the main variant. */ | |
902 | decl = TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (decl))); | |
8762fbe2 | 903 | } |
a8b75081 | 904 | |
905 | context = decl_mangling_context (decl); | |
62164d4c | 906 | |
f7b5b4ed | 907 | gcc_assert (context != NULL_TREE); |
908 | ||
229a58b1 | 909 | if (abi_warn_or_compat_version_crosses (7) |
74b777e5 | 910 | && ignore_local_scope |
911 | && TREE_CODE (context) == PARM_DECL) | |
912 | G.need_abi_warning = 1; | |
913 | ||
57b47eb0 | 914 | /* A decl in :: or ::std scope is treated specially. The former is |
915 | mangled using <unscoped-name> or <unscoped-template-name>, the | |
916 | latter with a special substitution. Also, a name that is | |
917 | directly in a local function scope is also mangled with | |
918 | <unscoped-name> rather than a full <nested-name>. */ | |
f7b5b4ed | 919 | if (context == global_namespace |
57b47eb0 | 920 | || DECL_NAMESPACE_STD_P (context) |
dc78d83a | 921 | || (ignore_local_scope |
922 | && (TREE_CODE (context) == FUNCTION_DECL | |
923 | || (abi_version_at_least (7) | |
924 | && TREE_CODE (context) == PARM_DECL)))) | |
98eaf693 | 925 | { |
8762fbe2 | 926 | tree template_info; |
927 | /* Is this a template instance? */ | |
928 | if (decl_is_template_id (decl, &template_info)) | |
98eaf693 | 929 | { |
8762fbe2 | 930 | /* Yes: use <unscoped-template-name>. */ |
931 | write_unscoped_template_name (TI_TEMPLATE (template_info)); | |
932 | write_template_args (TI_ARGS (template_info)); | |
98eaf693 | 933 | } |
934 | else | |
935 | /* Everything else gets an <unqualified-name>. */ | |
936 | write_unscoped_name (decl); | |
937 | } | |
98eaf693 | 938 | else |
bbb9efab | 939 | { |
940 | /* Handle local names, unless we asked not to (that is, invoked | |
653e5405 | 941 | under <local-name>, to handle only the part of the name under |
942 | the local scope). */ | |
bbb9efab | 943 | if (!ignore_local_scope) |
653e5405 | 944 | { |
bbb9efab | 945 | /* Scan up the list of scope context, looking for a |
946 | function. If we find one, this entity is in local | |
947 | function scope. local_entity tracks context one scope | |
948 | level down, so it will contain the element that's | |
949 | directly in that function's scope, either decl or one of | |
950 | its enclosing scopes. */ | |
951 | tree local_entity = decl; | |
f7b5b4ed | 952 | while (context != global_namespace) |
bbb9efab | 953 | { |
954 | /* Make sure we're always dealing with decls. */ | |
f7b5b4ed | 955 | if (TYPE_P (context)) |
bbb9efab | 956 | context = TYPE_NAME (context); |
957 | /* Is this a function? */ | |
a8b75081 | 958 | if (TREE_CODE (context) == FUNCTION_DECL |
959 | || TREE_CODE (context) == PARM_DECL) | |
bbb9efab | 960 | { |
961 | /* Yes, we have local scope. Use the <local-name> | |
962 | production for the innermost function scope. */ | |
963 | write_local_name (context, local_entity, decl); | |
964 | return; | |
965 | } | |
966 | /* Up one scope level. */ | |
967 | local_entity = context; | |
a8b75081 | 968 | context = decl_mangling_context (context); |
bbb9efab | 969 | } |
970 | ||
971 | /* No local scope found? Fall through to <nested-name>. */ | |
972 | } | |
973 | ||
974 | /* Other decls get a <nested-name> to encode their scope. */ | |
975 | write_nested_name (decl); | |
976 | } | |
98eaf693 | 977 | } |
978 | ||
979 | /* <unscoped-name> ::= <unqualified-name> | |
653e5405 | 980 | ::= St <unqualified-name> # ::std:: */ |
98eaf693 | 981 | |
982 | static void | |
61e3d157 | 983 | write_unscoped_name (const tree decl) |
98eaf693 | 984 | { |
16a1895e | 985 | tree context = decl_mangling_context (decl); |
98eaf693 | 986 | |
987 | MANGLE_TRACE_TREE ("unscoped-name", decl); | |
988 | ||
989 | /* Is DECL in ::std? */ | |
990 | if (DECL_NAMESPACE_STD_P (context)) | |
991 | { | |
992 | write_string ("St"); | |
993 | write_unqualified_name (decl); | |
994 | } | |
092b1d6f | 995 | else |
996 | { | |
997 | /* If not, it should be either in the global namespace, or directly | |
f7b5b4ed | 998 | in a local function scope. A lambda can also be mangled in the |
999 | scope of a default argument. */ | |
9031d10b | 1000 | gcc_assert (context == global_namespace |
f7b5b4ed | 1001 | || TREE_CODE (context) == PARM_DECL |
092b1d6f | 1002 | || TREE_CODE (context) == FUNCTION_DECL); |
9031d10b | 1003 | |
092b1d6f | 1004 | write_unqualified_name (decl); |
1005 | } | |
98eaf693 | 1006 | } |
1007 | ||
1008 | /* <unscoped-template-name> ::= <unscoped-name> | |
653e5405 | 1009 | ::= <substitution> */ |
98eaf693 | 1010 | |
1011 | static void | |
61e3d157 | 1012 | write_unscoped_template_name (const tree decl) |
98eaf693 | 1013 | { |
1014 | MANGLE_TRACE_TREE ("unscoped-template-name", decl); | |
1015 | ||
1016 | if (find_substitution (decl)) | |
1017 | return; | |
1018 | write_unscoped_name (decl); | |
1019 | add_substitution (decl); | |
1020 | } | |
1021 | ||
1022 | /* Write the nested name, including CV-qualifiers, of DECL. | |
1023 | ||
2ba14c1f | 1024 | <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix> <unqualified-name> E |
1025 | ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix> <template-args> E | |
98eaf693 | 1026 | |
2ba14c1f | 1027 | <ref-qualifier> ::= R # & ref-qualifier |
1028 | ::= O # && ref-qualifier | |
98eaf693 | 1029 | <CV-qualifiers> ::= [r] [V] [K] */ |
1030 | ||
1031 | static void | |
61e3d157 | 1032 | write_nested_name (const tree decl) |
98eaf693 | 1033 | { |
8762fbe2 | 1034 | tree template_info; |
1035 | ||
98eaf693 | 1036 | MANGLE_TRACE_TREE ("nested-name", decl); |
1037 | ||
1038 | write_char ('N'); | |
9031d10b | 1039 | |
98eaf693 | 1040 | /* Write CV-qualifiers, if this is a member function. */ |
9031d10b | 1041 | if (TREE_CODE (decl) == FUNCTION_DECL |
98eaf693 | 1042 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1043 | { | |
1044 | if (DECL_VOLATILE_MEMFUNC_P (decl)) | |
1045 | write_char ('V'); | |
1046 | if (DECL_CONST_MEMFUNC_P (decl)) | |
1047 | write_char ('K'); | |
2ba14c1f | 1048 | if (FUNCTION_REF_QUALIFIED (TREE_TYPE (decl))) |
1049 | { | |
1050 | if (FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (decl))) | |
1051 | write_char ('O'); | |
1052 | else | |
1053 | write_char ('R'); | |
1054 | } | |
98eaf693 | 1055 | } |
1056 | ||
8762fbe2 | 1057 | /* Is this a template instance? */ |
1058 | if (decl_is_template_id (decl, &template_info)) | |
98eaf693 | 1059 | { |
8762fbe2 | 1060 | /* Yes, use <template-prefix>. */ |
98eaf693 | 1061 | write_template_prefix (decl); |
8762fbe2 | 1062 | write_template_args (TI_ARGS (template_info)); |
98eaf693 | 1063 | } |
42af8c2a | 1064 | else if ((!abi_version_at_least (10) || TREE_CODE (decl) == TYPE_DECL) |
fbfe1b55 | 1065 | && TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE) |
4682b6fe | 1066 | { |
1067 | tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl)); | |
1068 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
1069 | { | |
1070 | write_template_prefix (decl); | |
1071 | write_template_args (TREE_OPERAND (name, 1)); | |
1072 | } | |
1073 | else | |
1074 | { | |
7abd84e4 | 1075 | write_prefix (decl_mangling_context (decl)); |
4682b6fe | 1076 | write_unqualified_name (decl); |
1077 | } | |
1078 | } | |
98eaf693 | 1079 | else |
1080 | { | |
8762fbe2 | 1081 | /* No, just use <prefix> */ |
272bba4d | 1082 | write_prefix (decl_mangling_context (decl)); |
bbb9efab | 1083 | write_unqualified_name (decl); |
98eaf693 | 1084 | } |
1085 | write_char ('E'); | |
1086 | } | |
1087 | ||
18f2b9d5 | 1088 | /* <prefix> ::= <prefix> <unqualified-name> |
653e5405 | 1089 | ::= <template-param> |
1090 | ::= <template-prefix> <template-args> | |
c5a7bf9e | 1091 | ::= <decltype> |
98eaf693 | 1092 | ::= # empty |
1093 | ::= <substitution> */ | |
1094 | ||
1095 | static void | |
61e3d157 | 1096 | write_prefix (const tree node) |
98eaf693 | 1097 | { |
1098 | tree decl; | |
8762fbe2 | 1099 | /* Non-NULL if NODE represents a template-id. */ |
1100 | tree template_info = NULL; | |
1101 | ||
98eaf693 | 1102 | if (node == NULL |
1103 | || node == global_namespace) | |
1104 | return; | |
1105 | ||
a8b75081 | 1106 | MANGLE_TRACE_TREE ("prefix", node); |
1107 | ||
c5a7bf9e | 1108 | if (TREE_CODE (node) == DECLTYPE_TYPE) |
1109 | { | |
1110 | write_type (node); | |
1111 | return; | |
1112 | } | |
1113 | ||
98eaf693 | 1114 | if (find_substitution (node)) |
1115 | return; | |
1116 | ||
8762fbe2 | 1117 | if (DECL_P (node)) |
98eaf693 | 1118 | { |
a8b75081 | 1119 | /* If this is a function or parm decl, that means we've hit function |
bbb9efab | 1120 | scope, so this prefix must be for a local name. In this |
1121 | case, we're under the <local-name> production, which encodes | |
1122 | the enclosing function scope elsewhere. So don't continue | |
1123 | here. */ | |
a8b75081 | 1124 | if (TREE_CODE (node) == FUNCTION_DECL |
1125 | || TREE_CODE (node) == PARM_DECL) | |
bbb9efab | 1126 | return; |
1127 | ||
8762fbe2 | 1128 | decl = node; |
1129 | decl_is_template_id (decl, &template_info); | |
98eaf693 | 1130 | } |
8762fbe2 | 1131 | else |
8762fbe2 | 1132 | { |
18f2b9d5 | 1133 | /* Node is a type. */ |
8762fbe2 | 1134 | decl = TYPE_NAME (node); |
1135 | if (CLASSTYPE_TEMPLATE_ID_P (node)) | |
18f2b9d5 | 1136 | template_info = TYPE_TEMPLATE_INFO (node); |
8762fbe2 | 1137 | } |
1138 | ||
f591db9a | 1139 | if (TREE_CODE (node) == TEMPLATE_TYPE_PARM) |
18f2b9d5 | 1140 | write_template_param (node); |
1141 | else if (template_info != NULL) | |
8762fbe2 | 1142 | /* Templated. */ |
98eaf693 | 1143 | { |
8762fbe2 | 1144 | write_template_prefix (decl); |
1145 | write_template_args (TI_ARGS (template_info)); | |
98eaf693 | 1146 | } |
4682b6fe | 1147 | else if (TREE_CODE (TREE_TYPE (decl)) == TYPENAME_TYPE) |
1148 | { | |
1149 | tree name = TYPENAME_TYPE_FULLNAME (TREE_TYPE (decl)); | |
1150 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
1151 | { | |
1152 | write_template_prefix (decl); | |
1153 | write_template_args (TREE_OPERAND (name, 1)); | |
1154 | } | |
1155 | else | |
1156 | { | |
7abd84e4 | 1157 | write_prefix (decl_mangling_context (decl)); |
4682b6fe | 1158 | write_unqualified_name (decl); |
1159 | } | |
1160 | } | |
98eaf693 | 1161 | else |
1162 | /* Not templated. */ | |
1163 | { | |
a8b75081 | 1164 | write_prefix (decl_mangling_context (decl)); |
bbb9efab | 1165 | write_unqualified_name (decl); |
80a58eb0 | 1166 | if (VAR_P (decl) |
a8b75081 | 1167 | || TREE_CODE (decl) == FIELD_DECL) |
1168 | { | |
1169 | /* <data-member-prefix> := <member source-name> M */ | |
1170 | write_char ('M'); | |
1171 | return; | |
1172 | } | |
98eaf693 | 1173 | } |
1174 | ||
1175 | add_substitution (node); | |
1176 | } | |
1177 | ||
1178 | /* <template-prefix> ::= <prefix> <template component> | |
653e5405 | 1179 | ::= <template-param> |
1180 | ::= <substitution> */ | |
98eaf693 | 1181 | |
1182 | static void | |
61e3d157 | 1183 | write_template_prefix (const tree node) |
98eaf693 | 1184 | { |
1185 | tree decl = DECL_P (node) ? node : TYPE_NAME (node); | |
1186 | tree type = DECL_P (node) ? TREE_TYPE (node) : node; | |
7abd84e4 | 1187 | tree context = decl_mangling_context (decl); |
8762fbe2 | 1188 | tree template_info; |
607a5d68 | 1189 | tree templ; |
98eaf693 | 1190 | tree substitution; |
1191 | ||
1192 | MANGLE_TRACE_TREE ("template-prefix", node); | |
1193 | ||
1194 | /* Find the template decl. */ | |
8762fbe2 | 1195 | if (decl_is_template_id (decl, &template_info)) |
607a5d68 | 1196 | templ = TI_TEMPLATE (template_info); |
4682b6fe | 1197 | else if (TREE_CODE (type) == TYPENAME_TYPE) |
1198 | /* For a typename type, all we have is the name. */ | |
1199 | templ = DECL_NAME (decl); | |
98eaf693 | 1200 | else |
092b1d6f | 1201 | { |
1202 | gcc_assert (CLASSTYPE_TEMPLATE_ID_P (type)); | |
9031d10b | 1203 | |
607a5d68 | 1204 | templ = TYPE_TI_TEMPLATE (type); |
092b1d6f | 1205 | } |
98eaf693 | 1206 | |
f753592a | 1207 | /* For a member template, though, the template name for the |
1208 | innermost name must have all the outer template levels | |
1209 | instantiated. For instance, consider | |
1210 | ||
1211 | template<typename T> struct Outer { | |
1212 | template<typename U> struct Inner {}; | |
1213 | }; | |
1214 | ||
1215 | The template name for `Inner' in `Outer<int>::Inner<float>' is | |
1216 | `Outer<int>::Inner<U>'. In g++, we don't instantiate the template | |
1217 | levels separately, so there's no TEMPLATE_DECL available for this | |
1218 | (there's only `Outer<T>::Inner<U>'). | |
1219 | ||
1220 | In order to get the substitutions right, we create a special | |
1221 | TREE_LIST to represent the substitution candidate for a nested | |
1222 | template. The TREE_PURPOSE is the template's context, fully | |
1223 | instantiated, and the TREE_VALUE is the TEMPLATE_DECL for the inner | |
1224 | template. | |
1225 | ||
1226 | So, for the example above, `Outer<int>::Inner' is represented as a | |
1227 | substitution candidate by a TREE_LIST whose purpose is `Outer<int>' | |
1228 | and whose value is `Outer<T>::Inner<U>'. */ | |
c57ab0e8 | 1229 | if (context && TYPE_P (context)) |
607a5d68 | 1230 | substitution = build_tree_list (context, templ); |
f753592a | 1231 | else |
607a5d68 | 1232 | substitution = templ; |
98eaf693 | 1233 | |
1234 | if (find_substitution (substitution)) | |
1235 | return; | |
1236 | ||
4682b6fe | 1237 | if (TREE_TYPE (templ) |
f591db9a | 1238 | && TREE_CODE (TREE_TYPE (templ)) == TEMPLATE_TEMPLATE_PARM) |
607a5d68 | 1239 | write_template_param (TREE_TYPE (templ)); |
18f2b9d5 | 1240 | else |
1241 | { | |
1242 | write_prefix (context); | |
1243 | write_unqualified_name (decl); | |
1244 | } | |
98eaf693 | 1245 | |
1246 | add_substitution (substitution); | |
1247 | } | |
1248 | ||
aa996a7a | 1249 | /* As the list of identifiers for the structured binding declaration |
1250 | DECL is likely gone, try to recover the DC <source-name>+ E portion | |
1251 | from its mangled name. Return pointer to the DC and set len to | |
1252 | the length up to and including the terminating E. On failure | |
1253 | return NULL. */ | |
1254 | ||
1255 | static const char * | |
1256 | find_decomp_unqualified_name (tree decl, size_t *len) | |
1257 | { | |
1258 | const char *p = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); | |
1259 | const char *end = p + IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl)); | |
1260 | bool nested = false; | |
1261 | if (strncmp (p, "_Z", 2)) | |
1262 | return NULL; | |
1263 | p += 2; | |
1264 | if (!strncmp (p, "St", 2)) | |
1265 | p += 2; | |
1266 | else if (*p == 'N') | |
1267 | { | |
1268 | nested = true; | |
1269 | ++p; | |
1270 | while (ISDIGIT (p[0])) | |
1271 | { | |
1272 | char *e; | |
1273 | long num = strtol (p, &e, 10); | |
1274 | if (num >= 1 && num < end - e) | |
1275 | p = e + num; | |
1276 | else | |
1277 | break; | |
1278 | } | |
1279 | } | |
1280 | if (strncmp (p, "DC", 2)) | |
1281 | return NULL; | |
1282 | if (nested) | |
1283 | { | |
1284 | if (end[-1] != 'E') | |
1285 | return NULL; | |
1286 | --end; | |
1287 | } | |
1288 | if (end[-1] != 'E') | |
1289 | return NULL; | |
1290 | *len = end - p; | |
1291 | return p; | |
1292 | } | |
1293 | ||
98eaf693 | 1294 | /* We don't need to handle thunks, vtables, or VTTs here. Those are |
9031d10b | 1295 | mangled through special entry points. |
98eaf693 | 1296 | |
1297 | <unqualified-name> ::= <operator-name> | |
9031d10b | 1298 | ::= <special-name> |
9751796f | 1299 | ::= <source-name> |
a8b75081 | 1300 | ::= <unnamed-type-name> |
9751796f | 1301 | ::= <local-source-name> |
1302 | ||
1303 | <local-source-name> ::= L <source-name> <discriminator> */ | |
98eaf693 | 1304 | |
c44a7393 | 1305 | static void |
1306 | write_unqualified_id (tree identifier) | |
1307 | { | |
991449b2 | 1308 | if (IDENTIFIER_CONV_OP_P (identifier)) |
c44a7393 | 1309 | write_conversion_operator_name (TREE_TYPE (identifier)); |
816659f9 | 1310 | else if (IDENTIFIER_OVL_OP_P (identifier)) |
c44a7393 | 1311 | { |
a543234d | 1312 | const ovl_op_info_t *ovl_op = IDENTIFIER_OVL_OP_INFO (identifier); |
1313 | write_string (ovl_op->mangled_name); | |
c44a7393 | 1314 | } |
244db24d | 1315 | else if (UDLIT_OPER_P (identifier)) |
1316 | write_literal_operator_name (identifier); | |
c44a7393 | 1317 | else |
1318 | write_source_name (identifier); | |
1319 | } | |
1320 | ||
98eaf693 | 1321 | static void |
42a2bdf5 | 1322 | write_unqualified_name (tree decl) |
98eaf693 | 1323 | { |
1324 | MANGLE_TRACE_TREE ("unqualified-name", decl); | |
1325 | ||
694683bb | 1326 | if (identifier_p (decl)) |
c44a7393 | 1327 | { |
1328 | write_unqualified_id (decl); | |
1329 | return; | |
1330 | } | |
1331 | ||
d4701f6c | 1332 | bool found = false; |
1333 | ||
39e70cbf | 1334 | if (DECL_NAME (decl) == NULL_TREE) |
2336da2a | 1335 | { |
d4701f6c | 1336 | found = true; |
2336da2a | 1337 | gcc_assert (DECL_ASSEMBLER_NAME_SET_P (decl)); |
aa996a7a | 1338 | const char *decomp_str = NULL; |
1339 | size_t decomp_len = 0; | |
1340 | if (VAR_P (decl) | |
1341 | && DECL_DECOMPOSITION_P (decl) | |
1342 | && DECL_NAME (decl) == NULL_TREE | |
1343 | && DECL_NAMESPACE_SCOPE_P (decl)) | |
1344 | decomp_str = find_decomp_unqualified_name (decl, &decomp_len); | |
1345 | if (decomp_str) | |
1346 | write_chars (decomp_str, decomp_len); | |
1347 | else | |
1348 | write_source_name (DECL_ASSEMBLER_NAME (decl)); | |
2336da2a | 1349 | } |
39e70cbf | 1350 | else if (DECL_DECLARES_FUNCTION_P (decl)) |
98eaf693 | 1351 | { |
d4701f6c | 1352 | found = true; |
39e70cbf | 1353 | if (DECL_CONSTRUCTOR_P (decl)) |
1354 | write_special_name_constructor (decl); | |
1355 | else if (DECL_DESTRUCTOR_P (decl)) | |
1356 | write_special_name_destructor (decl); | |
1357 | else if (DECL_CONV_FN_P (decl)) | |
33927c59 | 1358 | { |
39e70cbf | 1359 | /* Conversion operator. Handle it right here. |
1360 | <operator> ::= cv <type> */ | |
1361 | tree type; | |
1362 | if (decl_is_template_id (decl, NULL)) | |
1363 | { | |
1364 | tree fn_type; | |
1365 | fn_type = get_mostly_instantiated_function_type (decl); | |
1366 | type = TREE_TYPE (fn_type); | |
1367 | } | |
18bb3b80 | 1368 | else if (FNDECL_USED_AUTO (decl)) |
c40a8e3a | 1369 | type = DECL_SAVED_AUTO_RETURN_TYPE (decl); |
39e70cbf | 1370 | else |
1371 | type = DECL_CONV_FN_TYPE (decl); | |
1372 | write_conversion_operator_name (type); | |
1373 | } | |
1374 | else if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
1375 | { | |
ca16a224 | 1376 | const char *mangled_name |
2cc899e0 | 1377 | = (ovl_op_info[DECL_ASSIGNMENT_OPERATOR_P (decl)] |
1378 | [DECL_OVERLOADED_OPERATOR_CODE_RAW (decl)].mangled_name); | |
ca16a224 | 1379 | write_string (mangled_name); |
33927c59 | 1380 | } |
244db24d | 1381 | else if (UDLIT_OPER_P (DECL_NAME (decl))) |
1382 | write_literal_operator_name (DECL_NAME (decl)); | |
33927c59 | 1383 | else |
39e70cbf | 1384 | found = false; |
98eaf693 | 1385 | } |
39e70cbf | 1386 | |
d4701f6c | 1387 | if (found) |
1388 | /* OK */; | |
1389 | else if (VAR_OR_FUNCTION_DECL_P (decl) && ! TREE_PUBLIC (decl) | |
1390 | && DECL_NAMESPACE_SCOPE_P (decl) | |
1391 | && decl_linkage (decl) == lk_internal) | |
9751796f | 1392 | { |
1393 | MANGLE_TRACE_TREE ("local-source-name", decl); | |
1394 | write_char ('L'); | |
1395 | write_source_name (DECL_NAME (decl)); | |
1396 | /* The default discriminator is 1, and that's all we ever use, | |
1397 | so there's no code to output one here. */ | |
1398 | } | |
98eaf693 | 1399 | else |
a8b75081 | 1400 | { |
1401 | tree type = TREE_TYPE (decl); | |
1402 | ||
1403 | if (TREE_CODE (decl) == TYPE_DECL | |
4f86cbb0 | 1404 | && TYPE_UNNAMED_P (type)) |
a8b75081 | 1405 | write_unnamed_type_name (type); |
1406 | else if (TREE_CODE (decl) == TYPE_DECL | |
1407 | && LAMBDA_TYPE_P (type)) | |
1408 | write_closure_type_name (type); | |
1409 | else | |
1410 | write_source_name (DECL_NAME (decl)); | |
1411 | } | |
d4701f6c | 1412 | |
2b463b9a | 1413 | /* We use the ABI tags from the primary class template, ignoring tags on any |
42a2bdf5 | 1414 | specializations. This is necessary because C++ doesn't require a |
2b463b9a | 1415 | specialization to be declared before it is used unless the use requires a |
1416 | complete type, but we need to get the tags right on incomplete types as | |
1417 | well. */ | |
42a2bdf5 | 1418 | if (tree tmpl = most_general_template (decl)) |
2b463b9a | 1419 | { |
1420 | tree res = DECL_TEMPLATE_RESULT (tmpl); | |
1421 | if (res == NULL_TREE) | |
1422 | /* UNBOUND_CLASS_TEMPLATE. */; | |
1423 | else if (DECL_DECLARES_TYPE_P (decl)) | |
1424 | decl = res; | |
1425 | else if (any_abi_below (11)) | |
1426 | { | |
1427 | /* ABI v10 implicit tags on the template. */ | |
1428 | tree mtags = missing_abi_tags (res); | |
1429 | /* Explicit tags on the template. */ | |
1430 | tree ttags = get_abi_tags (res); | |
1431 | /* Tags on the instantiation. */ | |
1432 | tree dtags = get_abi_tags (decl); | |
1433 | ||
1434 | if (mtags && abi_warn_or_compat_version_crosses (10)) | |
1435 | G.need_abi_warning = 1; | |
1436 | ||
1437 | /* Add the v10 tags to the explicit tags now. */ | |
1438 | mtags = chainon (mtags, ttags); | |
1439 | ||
1440 | if (!G.need_abi_warning | |
1441 | && abi_warn_or_compat_version_crosses (11) | |
1442 | && !equal_abi_tags (dtags, mtags)) | |
1443 | G.need_abi_warning = 1; | |
1444 | ||
1445 | if (!abi_version_at_least (10)) | |
1446 | /* In abi <10, we only got the explicit tags. */ | |
1447 | decl = res; | |
1448 | else if (flag_abi_version == 10) | |
1449 | { | |
1450 | /* In ABI 10, we want explict and implicit tags. */ | |
1451 | write_abi_tags (mtags); | |
1452 | return; | |
1453 | } | |
1454 | } | |
1455 | } | |
1456 | ||
1457 | tree tags = get_abi_tags (decl); | |
b3b6f5b5 | 1458 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_CONV_FN_P (decl) |
1459 | && any_abi_below (11)) | |
1460 | if (tree mtags = missing_abi_tags (decl)) | |
1461 | { | |
1462 | if (abi_warn_or_compat_version_crosses (11)) | |
1463 | G.need_abi_warning = true; | |
1464 | if (!abi_version_at_least (11)) | |
1465 | tags = chainon (mtags, tags); | |
1466 | } | |
2b463b9a | 1467 | write_abi_tags (tags); |
98eaf693 | 1468 | } |
1469 | ||
94302392 | 1470 | /* Write the unqualified-name for a conversion operator to TYPE. */ |
1471 | ||
1472 | static void | |
61e3d157 | 1473 | write_conversion_operator_name (const tree type) |
94302392 | 1474 | { |
1475 | write_string ("cv"); | |
1476 | write_type (type); | |
1477 | } | |
1478 | ||
9031d10b | 1479 | /* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE. |
98eaf693 | 1480 | |
1481 | <source-name> ::= </length/ number> <identifier> */ | |
1482 | ||
1483 | static void | |
61e3d157 | 1484 | write_source_name (tree identifier) |
98eaf693 | 1485 | { |
1486 | MANGLE_TRACE_TREE ("source-name", identifier); | |
1487 | ||
e75e76ea | 1488 | write_unsigned_number (IDENTIFIER_LENGTH (identifier)); |
98eaf693 | 1489 | write_identifier (IDENTIFIER_POINTER (identifier)); |
1490 | } | |
1491 | ||
d4701f6c | 1492 | /* Compare two TREE_STRINGs like strcmp. */ |
1493 | ||
1494 | int | |
1495 | tree_string_cmp (const void *p1, const void *p2) | |
1496 | { | |
1497 | if (p1 == p2) | |
1498 | return 0; | |
1499 | tree s1 = *(const tree*)p1; | |
1500 | tree s2 = *(const tree*)p2; | |
1501 | return strcmp (TREE_STRING_POINTER (s1), | |
1502 | TREE_STRING_POINTER (s2)); | |
1503 | } | |
1504 | ||
2b463b9a | 1505 | /* Return the TREE_LIST of TAGS as a sorted VEC. */ |
d4701f6c | 1506 | |
2b463b9a | 1507 | static vec<tree, va_gc> * |
1508 | sorted_abi_tags (tree tags) | |
d4701f6c | 1509 | { |
f1f41a6c | 1510 | vec<tree, va_gc> * vec = make_tree_vector(); |
d4701f6c | 1511 | |
1512 | for (tree t = tags; t; t = TREE_CHAIN (t)) | |
1513 | { | |
9d78c80e | 1514 | if (ABI_TAG_IMPLICIT (t)) |
1515 | continue; | |
d4701f6c | 1516 | tree str = TREE_VALUE (t); |
f1f41a6c | 1517 | vec_safe_push (vec, str); |
d4701f6c | 1518 | } |
1519 | ||
f1f41a6c | 1520 | vec->qsort (tree_string_cmp); |
d4701f6c | 1521 | |
2b463b9a | 1522 | return vec; |
1523 | } | |
1524 | ||
1525 | /* ID is the name of a function or type with abi_tags attribute TAGS. | |
1526 | Write out the name, suitably decorated. */ | |
1527 | ||
1528 | static void | |
1529 | write_abi_tags (tree tags) | |
1530 | { | |
1531 | if (tags == NULL_TREE) | |
1532 | return; | |
1533 | ||
1534 | vec<tree, va_gc> * vec = sorted_abi_tags (tags); | |
1535 | ||
d4701f6c | 1536 | unsigned i; tree str; |
f1f41a6c | 1537 | FOR_EACH_VEC_ELT (*vec, i, str) |
d4701f6c | 1538 | { |
1539 | write_string ("B"); | |
1540 | write_unsigned_number (TREE_STRING_LENGTH (str) - 1); | |
1541 | write_identifier (TREE_STRING_POINTER (str)); | |
1542 | } | |
1543 | ||
1544 | release_tree_vector (vec); | |
1545 | } | |
1546 | ||
2b463b9a | 1547 | /* True iff the TREE_LISTS T1 and T2 of ABI tags are equivalent. */ |
1548 | ||
1549 | static bool | |
1550 | equal_abi_tags (tree t1, tree t2) | |
1551 | { | |
1552 | releasing_vec v1 = sorted_abi_tags (t1); | |
1553 | releasing_vec v2 = sorted_abi_tags (t2); | |
1554 | ||
1555 | unsigned len1 = v1->length(); | |
1556 | if (len1 != v2->length()) | |
1557 | return false; | |
1558 | for (unsigned i = 0; i < len1; ++i) | |
1559 | if (tree_string_cmp (v1[i], v2[i]) != 0) | |
1560 | return false; | |
1561 | return true; | |
1562 | } | |
1563 | ||
244db24d | 1564 | /* Write a user-defined literal operator. |
b9eba7af | 1565 | ::= li <source-name> # "" <source-name> |
244db24d | 1566 | IDENTIFIER is an LITERAL_IDENTIFIER_NODE. */ |
1567 | ||
1568 | static void | |
1569 | write_literal_operator_name (tree identifier) | |
1570 | { | |
1571 | const char* suffix = UDLIT_OP_SUFFIX (identifier); | |
b9eba7af | 1572 | write_identifier (UDLIT_OP_MANGLED_PREFIX); |
1573 | write_unsigned_number (strlen (suffix)); | |
1574 | write_identifier (suffix); | |
244db24d | 1575 | } |
1576 | ||
a8b75081 | 1577 | /* Encode 0 as _, and 1+ as n-1_. */ |
1578 | ||
1579 | static void | |
1580 | write_compact_number (int num) | |
1581 | { | |
1582 | if (num > 0) | |
1583 | write_unsigned_number (num - 1); | |
1584 | write_char ('_'); | |
1585 | } | |
1586 | ||
fb5d6a4f | 1587 | /* Return how many unnamed types precede TYPE in its enclosing class. */ |
1588 | ||
1589 | static int | |
1590 | nested_anon_class_index (tree type) | |
1591 | { | |
1592 | int index = 0; | |
1593 | tree member = TYPE_FIELDS (TYPE_CONTEXT (type)); | |
1767a056 | 1594 | for (; member; member = DECL_CHAIN (member)) |
fb5d6a4f | 1595 | if (DECL_IMPLICIT_TYPEDEF_P (member)) |
1596 | { | |
1597 | tree memtype = TREE_TYPE (member); | |
1598 | if (memtype == type) | |
1599 | return index; | |
4f86cbb0 | 1600 | else if (TYPE_UNNAMED_P (memtype)) |
fb5d6a4f | 1601 | ++index; |
1602 | } | |
1603 | ||
70a397b0 | 1604 | if (seen_error ()) |
1605 | return -1; | |
1606 | ||
fb5d6a4f | 1607 | gcc_unreachable (); |
1608 | } | |
1609 | ||
1610 | /* <unnamed-type-name> ::= Ut [ <nonnegative number> ] _ */ | |
1611 | ||
a8b75081 | 1612 | static void |
a49c5913 | 1613 | write_unnamed_type_name (const tree type) |
a8b75081 | 1614 | { |
fb5d6a4f | 1615 | int discriminator; |
a8b75081 | 1616 | MANGLE_TRACE_TREE ("unnamed-type-name", type); |
1617 | ||
fb5d6a4f | 1618 | if (TYPE_FUNCTION_SCOPE_P (type)) |
772b23aa | 1619 | discriminator = discriminator_for_local_entity (TYPE_NAME (type)); |
fb5d6a4f | 1620 | else if (TYPE_CLASS_SCOPE_P (type)) |
1621 | discriminator = nested_anon_class_index (type); | |
1622 | else | |
1623 | { | |
1624 | gcc_assert (no_linkage_check (type, /*relaxed_p=*/true)); | |
1625 | /* Just use the old mangling at namespace scope. */ | |
1626 | write_source_name (TYPE_IDENTIFIER (type)); | |
1627 | return; | |
1628 | } | |
1629 | ||
a8b75081 | 1630 | write_string ("Ut"); |
fb5d6a4f | 1631 | write_compact_number (discriminator); |
a8b75081 | 1632 | } |
1633 | ||
1634 | /* <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _ | |
1635 | <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda has no parameters */ | |
1636 | ||
1637 | static void | |
1638 | write_closure_type_name (const tree type) | |
1639 | { | |
1640 | tree fn = lambda_function (type); | |
1641 | tree lambda = CLASSTYPE_LAMBDA_EXPR (type); | |
1642 | tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
1643 | ||
1644 | MANGLE_TRACE_TREE ("closure-type-name", type); | |
1645 | ||
1646 | write_string ("Ul"); | |
43936711 | 1647 | write_method_parms (parms, /*method_p=*/1, fn); |
a8b75081 | 1648 | write_char ('E'); |
1649 | write_compact_number (LAMBDA_EXPR_DISCRIMINATOR (lambda)); | |
1650 | } | |
1651 | ||
2ec35239 | 1652 | /* Convert NUMBER to ascii using base BASE and generating at least |
1653 | MIN_DIGITS characters. BUFFER points to the _end_ of the buffer | |
1654 | into which to store the characters. Returns the number of | |
88aa6d3e | 1655 | characters generated (these will be laid out in advance of where |
2ec35239 | 1656 | BUFFER points). */ |
1657 | ||
1658 | static int | |
61e3d157 | 1659 | hwint_to_ascii (unsigned HOST_WIDE_INT number, const unsigned int base, |
1660 | char *buffer, const unsigned int min_digits) | |
2ec35239 | 1661 | { |
1662 | static const char base_digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; | |
1663 | unsigned digits = 0; | |
9031d10b | 1664 | |
2ec35239 | 1665 | while (number) |
1666 | { | |
1667 | unsigned HOST_WIDE_INT d = number / base; | |
9031d10b | 1668 | |
2ec35239 | 1669 | *--buffer = base_digits[number - d * base]; |
1670 | digits++; | |
1671 | number = d; | |
1672 | } | |
1673 | while (digits < min_digits) | |
1674 | { | |
1675 | *--buffer = base_digits[0]; | |
1676 | digits++; | |
1677 | } | |
1678 | return digits; | |
1679 | } | |
1680 | ||
98eaf693 | 1681 | /* Non-terminal <number>. |
1682 | ||
1683 | <number> ::= [n] </decimal integer/> */ | |
1684 | ||
1685 | static void | |
61e3d157 | 1686 | write_number (unsigned HOST_WIDE_INT number, const int unsigned_p, |
1687 | const unsigned int base) | |
98eaf693 | 1688 | { |
2ec35239 | 1689 | char buffer[sizeof (HOST_WIDE_INT) * 8]; |
1690 | unsigned count = 0; | |
98eaf693 | 1691 | |
e75e76ea | 1692 | if (!unsigned_p && (HOST_WIDE_INT) number < 0) |
98eaf693 | 1693 | { |
1694 | write_char ('n'); | |
e75e76ea | 1695 | number = -((HOST_WIDE_INT) number); |
98eaf693 | 1696 | } |
2ec35239 | 1697 | count = hwint_to_ascii (number, base, buffer + sizeof (buffer), 1); |
1698 | write_chars (buffer + sizeof (buffer) - count, count); | |
98eaf693 | 1699 | } |
1700 | ||
2ec35239 | 1701 | /* Write out an integral CST in decimal. Most numbers are small, and |
1702 | representable in a HOST_WIDE_INT. Occasionally we'll have numbers | |
47cd6605 | 1703 | bigger than that, which we must deal with. */ |
98eaf693 | 1704 | |
1705 | static inline void | |
61e3d157 | 1706 | write_integer_cst (const tree cst) |
98eaf693 | 1707 | { |
2ec35239 | 1708 | int sign = tree_int_cst_sgn (cst); |
e1d65c9f | 1709 | widest_int abs_value = wi::abs (wi::to_widest (cst)); |
1710 | if (!wi::fits_uhwi_p (abs_value)) | |
e75e76ea | 1711 | { |
2ec35239 | 1712 | /* A bignum. We do this in chunks, each of which fits in a |
47cd6605 | 1713 | HOST_WIDE_INT. */ |
2ec35239 | 1714 | char buffer[sizeof (HOST_WIDE_INT) * 8 * 2]; |
1715 | unsigned HOST_WIDE_INT chunk; | |
1716 | unsigned chunk_digits; | |
1717 | char *ptr = buffer + sizeof (buffer); | |
1718 | unsigned count = 0; | |
1719 | tree n, base, type; | |
1720 | int done; | |
1721 | ||
1722 | /* HOST_WIDE_INT must be at least 32 bits, so 10^9 is | |
47cd6605 | 1723 | representable. */ |
2ec35239 | 1724 | chunk = 1000000000; |
1725 | chunk_digits = 9; | |
9031d10b | 1726 | |
2ec35239 | 1727 | if (sizeof (HOST_WIDE_INT) >= 8) |
1728 | { | |
47cd6605 | 1729 | /* It is at least 64 bits, so 10^18 is representable. */ |
2ec35239 | 1730 | chunk_digits = 18; |
1731 | chunk *= chunk; | |
1732 | } | |
9031d10b | 1733 | |
4070745f | 1734 | type = c_common_signed_or_unsigned_type (1, TREE_TYPE (cst)); |
7016c612 | 1735 | base = build_int_cstu (type, chunk); |
e3d0f65c | 1736 | n = wide_int_to_tree (type, wi::to_wide (cst)); |
2ec35239 | 1737 | |
1738 | if (sign < 0) | |
1739 | { | |
1740 | write_char ('n'); | |
389dd41b | 1741 | n = fold_build1_loc (input_location, NEGATE_EXPR, type, n); |
2ec35239 | 1742 | } |
1743 | do | |
1744 | { | |
389dd41b | 1745 | tree d = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, n, base); |
1746 | tree tmp = fold_build2_loc (input_location, MULT_EXPR, type, d, base); | |
2ec35239 | 1747 | unsigned c; |
61e3d157 | 1748 | |
2ec35239 | 1749 | done = integer_zerop (d); |
389dd41b | 1750 | tmp = fold_build2_loc (input_location, MINUS_EXPR, type, n, tmp); |
f9ae6f95 | 1751 | c = hwint_to_ascii (TREE_INT_CST_LOW (tmp), 10, ptr, |
831d52a2 | 1752 | done ? 1 : chunk_digits); |
2ec35239 | 1753 | ptr -= c; |
1754 | count += c; | |
1755 | n = d; | |
1756 | } | |
1757 | while (!done); | |
1758 | write_chars (ptr, count); | |
1759 | } | |
9031d10b | 1760 | else |
2ec35239 | 1761 | { |
1762 | /* A small num. */ | |
2ec35239 | 1763 | if (sign < 0) |
e1d65c9f | 1764 | write_char ('n'); |
1765 | write_unsigned_number (abs_value.to_uhwi ()); | |
e75e76ea | 1766 | } |
98eaf693 | 1767 | } |
1768 | ||
9031d10b | 1769 | /* Write out a floating-point literal. |
1770 | ||
cc116129 | 1771 | "Floating-point literals are encoded using the bit pattern of the |
1772 | target processor's internal representation of that number, as a | |
1773 | fixed-length lowercase hexadecimal string, high-order bytes first | |
1774 | (even if the target processor would store low-order bytes first). | |
1775 | The "n" prefix is not used for floating-point literals; the sign | |
1776 | bit is encoded with the rest of the number. | |
1777 | ||
1778 | Here are some examples, assuming the IEEE standard representation | |
1779 | for floating point numbers. (Spaces are for readability, not | |
1780 | part of the encoding.) | |
1781 | ||
653e5405 | 1782 | 1.0f Lf 3f80 0000 E |
1783 | -1.0f Lf bf80 0000 E | |
1784 | 1.17549435e-38f Lf 0080 0000 E | |
1785 | 1.40129846e-45f Lf 0000 0001 E | |
1786 | 0.0f Lf 0000 0000 E" | |
cc116129 | 1787 | |
1788 | Caller is responsible for the Lx and the E. */ | |
1789 | static void | |
61e3d157 | 1790 | write_real_cst (const tree value) |
cc116129 | 1791 | { |
f591db9a | 1792 | long target_real[4]; /* largest supported float */ |
b18dea91 | 1793 | /* Buffer for eight hex digits in a 32-bit number but big enough |
1794 | even for 64-bit long to avoid warnings. */ | |
1795 | char buffer[17]; | |
f591db9a | 1796 | int i, limit, dir; |
1797 | ||
1798 | tree type = TREE_TYPE (value); | |
299dd9fa | 1799 | int words = GET_MODE_BITSIZE (SCALAR_FLOAT_TYPE_MODE (type)) / 32; |
f591db9a | 1800 | |
1801 | real_to_target (target_real, &TREE_REAL_CST (value), | |
1802 | TYPE_MODE (type)); | |
1803 | ||
1804 | /* The value in target_real is in the target word order, | |
1805 | so we must write it out backward if that happens to be | |
1806 | little-endian. write_number cannot be used, it will | |
1807 | produce uppercase. */ | |
1808 | if (FLOAT_WORDS_BIG_ENDIAN) | |
1809 | i = 0, limit = words, dir = 1; | |
cc116129 | 1810 | else |
f591db9a | 1811 | i = words - 1, limit = -1, dir = -1; |
1812 | ||
1813 | for (; i != limit; i += dir) | |
cc116129 | 1814 | { |
f591db9a | 1815 | sprintf (buffer, "%08lx", (unsigned long) target_real[i]); |
1816 | write_chars (buffer, 8); | |
cc116129 | 1817 | } |
1818 | } | |
1819 | ||
98eaf693 | 1820 | /* Non-terminal <identifier>. |
1821 | ||
1822 | <identifier> ::= </unqualified source code identifier> */ | |
1823 | ||
1824 | static void | |
61e3d157 | 1825 | write_identifier (const char *identifier) |
98eaf693 | 1826 | { |
1827 | MANGLE_TRACE ("identifier", identifier); | |
1828 | write_string (identifier); | |
1829 | } | |
1830 | ||
1831 | /* Handle constructor productions of non-terminal <special-name>. | |
9031d10b | 1832 | CTOR is a constructor FUNCTION_DECL. |
98eaf693 | 1833 | |
1834 | <special-name> ::= C1 # complete object constructor | |
653e5405 | 1835 | ::= C2 # base object constructor |
1836 | ::= C3 # complete object allocating constructor | |
98eaf693 | 1837 | |
468088ac | 1838 | Currently, allocating constructors are never used. */ |
98eaf693 | 1839 | |
1840 | static void | |
61e3d157 | 1841 | write_special_name_constructor (const tree ctor) |
98eaf693 | 1842 | { |
7896267d | 1843 | write_char ('C'); |
1844 | bool new_inh = (flag_new_inheriting_ctors | |
1845 | && DECL_INHERITED_CTOR (ctor)); | |
1846 | if (new_inh) | |
1847 | write_char ('I'); | |
092b1d6f | 1848 | if (DECL_BASE_CONSTRUCTOR_P (ctor)) |
7896267d | 1849 | write_char ('2'); |
468088ac | 1850 | /* This is the old-style "[unified]" constructor. |
1851 | In some cases, we may emit this function and call | |
1852 | it from the clones in order to share code and save space. */ | |
1853 | else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (ctor)) | |
7896267d | 1854 | write_char ('4'); |
f2b8a47d | 1855 | else |
092b1d6f | 1856 | { |
468088ac | 1857 | gcc_assert (DECL_COMPLETE_CONSTRUCTOR_P (ctor)); |
7896267d | 1858 | write_char ('1'); |
092b1d6f | 1859 | } |
7896267d | 1860 | if (new_inh) |
1861 | write_type (DECL_INHERITED_CTOR_BASE (ctor)); | |
98eaf693 | 1862 | } |
1863 | ||
1864 | /* Handle destructor productions of non-terminal <special-name>. | |
9031d10b | 1865 | DTOR is a destructor FUNCTION_DECL. |
98eaf693 | 1866 | |
1867 | <special-name> ::= D0 # deleting (in-charge) destructor | |
653e5405 | 1868 | ::= D1 # complete object (in-charge) destructor |
468088ac | 1869 | ::= D2 # base object (not-in-charge) destructor */ |
98eaf693 | 1870 | |
1871 | static void | |
61e3d157 | 1872 | write_special_name_destructor (const tree dtor) |
98eaf693 | 1873 | { |
1874 | if (DECL_DELETING_DESTRUCTOR_P (dtor)) | |
1875 | write_string ("D0"); | |
98eaf693 | 1876 | else if (DECL_BASE_DESTRUCTOR_P (dtor)) |
1877 | write_string ("D2"); | |
468088ac | 1878 | else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (dtor)) |
1879 | /* This is the old-style "[unified]" destructor. | |
1880 | In some cases, we may emit this function and call | |
1881 | it from the clones in order to share code and save space. */ | |
1882 | write_string ("D4"); | |
f2b8a47d | 1883 | else |
092b1d6f | 1884 | { |
468088ac | 1885 | gcc_assert (DECL_COMPLETE_DESTRUCTOR_P (dtor)); |
092b1d6f | 1886 | write_string ("D1"); |
1887 | } | |
98eaf693 | 1888 | } |
1889 | ||
1890 | /* Return the discriminator for ENTITY appearing inside | |
772b23aa | 1891 | FUNCTION. The discriminator is the lexical ordinal of VAR or TYPE among |
1892 | entities with the same name and kind in the same FUNCTION. */ | |
98eaf693 | 1893 | |
1894 | static int | |
61e3d157 | 1895 | discriminator_for_local_entity (tree entity) |
98eaf693 | 1896 | { |
772b23aa | 1897 | if (!DECL_LANG_SPECIFIC (entity)) |
fb5d6a4f | 1898 | { |
772b23aa | 1899 | /* Some decls, like __FUNCTION__, don't need a discriminator. */ |
1900 | gcc_checking_assert (DECL_ARTIFICIAL (entity)); | |
1901 | return 0; | |
9031d10b | 1902 | } |
772b23aa | 1903 | else if (tree disc = DECL_DISCRIMINATOR (entity)) |
1904 | return TREE_INT_CST_LOW (disc); | |
fb5d6a4f | 1905 | else |
772b23aa | 1906 | /* The first entity with a particular name doesn't get |
1907 | DECL_DISCRIMINATOR set up. */ | |
1908 | return 0; | |
98eaf693 | 1909 | } |
1910 | ||
1911 | /* Return the discriminator for STRING, a string literal used inside | |
63eff20d | 1912 | FUNCTION. The discriminator is the lexical ordinal of STRING among |
98eaf693 | 1913 | string literals used in FUNCTION. */ |
1914 | ||
1915 | static int | |
a49c5913 | 1916 | discriminator_for_string_literal (tree /*function*/, |
1917 | tree /*string*/) | |
98eaf693 | 1918 | { |
1919 | /* For now, we don't discriminate amongst string literals. */ | |
1920 | return 0; | |
1921 | } | |
1922 | ||
a2929a3a | 1923 | /* <discriminator> := _ <number> # when number < 10 |
1924 | := __ <number> _ # when number >= 10 | |
98eaf693 | 1925 | |
1926 | The discriminator is used only for the second and later occurrences | |
1927 | of the same name within a single function. In this case <number> is | |
1928 | n - 2, if this is the nth occurrence, in lexical order. */ | |
1929 | ||
1930 | static void | |
61e3d157 | 1931 | write_discriminator (const int discriminator) |
98eaf693 | 1932 | { |
47cd6605 | 1933 | /* If discriminator is zero, don't write anything. Otherwise... */ |
98eaf693 | 1934 | if (discriminator > 0) |
1935 | { | |
1936 | write_char ('_'); | |
32d3ed1d | 1937 | if (discriminator - 1 >= 10) |
a2929a3a | 1938 | { |
a2929a3a | 1939 | if (abi_warn_or_compat_version_crosses (11)) |
1940 | G.need_abi_warning = 1; | |
32d3ed1d | 1941 | if (abi_version_at_least (11)) |
1942 | write_char ('_'); | |
a2929a3a | 1943 | } |
5a4fcef0 | 1944 | write_unsigned_number (discriminator - 1); |
a2929a3a | 1945 | if (abi_version_at_least (11) && discriminator - 1 >= 10) |
1946 | write_char ('_'); | |
98eaf693 | 1947 | } |
1948 | } | |
1949 | ||
1950 | /* Mangle the name of a function-scope entity. FUNCTION is the | |
a8b75081 | 1951 | FUNCTION_DECL for the enclosing function, or a PARM_DECL for lambdas in |
1952 | default argument scope. ENTITY is the decl for the entity itself. | |
1953 | LOCAL_ENTITY is the entity that's directly scoped in FUNCTION_DECL, | |
1954 | either ENTITY itself or an enclosing scope of ENTITY. | |
98eaf693 | 1955 | |
1956 | <local-name> := Z <function encoding> E <entity name> [<discriminator>] | |
a8b75081 | 1957 | := Z <function encoding> E s [<discriminator>] |
1958 | := Z <function encoding> Ed [ <parameter number> ] _ <entity name> */ | |
98eaf693 | 1959 | |
1960 | static void | |
a8b75081 | 1961 | write_local_name (tree function, const tree local_entity, |
61e3d157 | 1962 | const tree entity) |
98eaf693 | 1963 | { |
a8b75081 | 1964 | tree parm = NULL_TREE; |
1965 | ||
98eaf693 | 1966 | MANGLE_TRACE_TREE ("local-name", entity); |
1967 | ||
a8b75081 | 1968 | if (TREE_CODE (function) == PARM_DECL) |
1969 | { | |
1970 | parm = function; | |
1971 | function = DECL_CONTEXT (parm); | |
1972 | } | |
1973 | ||
98eaf693 | 1974 | write_char ('Z'); |
1975 | write_encoding (function); | |
1976 | write_char ('E'); | |
a8b75081 | 1977 | |
1978 | /* For this purpose, parameters are numbered from right-to-left. */ | |
1979 | if (parm) | |
1980 | { | |
1981 | tree t; | |
1982 | int i = 0; | |
1767a056 | 1983 | for (t = DECL_ARGUMENTS (function); t; t = DECL_CHAIN (t)) |
a8b75081 | 1984 | { |
1985 | if (t == parm) | |
1986 | i = 1; | |
1987 | else if (i) | |
1988 | ++i; | |
1989 | } | |
1990 | write_char ('d'); | |
1991 | write_compact_number (i - 1); | |
1992 | } | |
1993 | ||
98eaf693 | 1994 | if (TREE_CODE (entity) == STRING_CST) |
1995 | { | |
1996 | write_char ('s'); | |
9031d10b | 1997 | write_discriminator (discriminator_for_string_literal (function, |
98eaf693 | 1998 | entity)); |
1999 | } | |
2000 | else | |
2001 | { | |
bbb9efab | 2002 | /* Now the <entity name>. Let write_name know its being called |
2003 | from <local-name>, so it doesn't try to process the enclosing | |
2004 | function scope again. */ | |
2005 | write_name (entity, /*ignore_local_scope=*/1); | |
772b23aa | 2006 | if (DECL_DISCRIMINATOR_P (local_entity) |
2007 | && !(TREE_CODE (local_entity) == TYPE_DECL | |
2008 | && (LAMBDA_TYPE_P (TREE_TYPE (local_entity)) | |
2009 | || TYPE_UNNAMED_P (TREE_TYPE (local_entity))))) | |
2010 | write_discriminator (discriminator_for_local_entity (local_entity)); | |
98eaf693 | 2011 | } |
2012 | } | |
2013 | ||
9031d10b | 2014 | /* Non-terminals <type> and <CV-qualifier>. |
98eaf693 | 2015 | |
2016 | <type> ::= <builtin-type> | |
653e5405 | 2017 | ::= <function-type> |
2018 | ::= <class-enum-type> | |
2019 | ::= <array-type> | |
2020 | ::= <pointer-to-member-type> | |
2021 | ::= <template-param> | |
2022 | ::= <substitution> | |
2023 | ::= <CV-qualifier> | |
2024 | ::= P <type> # pointer-to | |
2025 | ::= R <type> # reference-to | |
2026 | ::= C <type> # complex pair (C 2000) | |
2027 | ::= G <type> # imaginary (C 2000) [not supported] | |
2028 | ::= U <source-name> <type> # vendor extended type qualifier | |
98eaf693 | 2029 | |
63949b38 | 2030 | C++0x extensions |
2031 | ||
2032 | <type> ::= RR <type> # rvalue reference-to | |
34da8800 | 2033 | <type> ::= Dt <expression> # decltype of an id-expression or |
2034 | # class member access | |
2035 | <type> ::= DT <expression> # decltype of an expression | |
6fe11077 | 2036 | <type> ::= Dn # decltype of nullptr |
63949b38 | 2037 | |
98eaf693 | 2038 | TYPE is a type node. */ |
2039 | ||
9031d10b | 2040 | static void |
61e3d157 | 2041 | write_type (tree type) |
98eaf693 | 2042 | { |
3160db1d | 2043 | /* This gets set to nonzero if TYPE turns out to be a (possibly |
98eaf693 | 2044 | CV-qualified) builtin type. */ |
2045 | int is_builtin_type = 0; | |
2046 | ||
2047 | MANGLE_TRACE_TREE ("type", type); | |
2048 | ||
0cd69b17 | 2049 | if (type == error_mark_node) |
2050 | return; | |
2051 | ||
f962c310 | 2052 | type = canonicalize_for_substitution (type); |
98eaf693 | 2053 | if (find_substitution (type)) |
2054 | return; | |
9031d10b | 2055 | |
8df5a43d | 2056 | |
98eaf693 | 2057 | if (write_CV_qualifiers_for_type (type) > 0) |
2058 | /* If TYPE was CV-qualified, we just wrote the qualifiers; now | |
2059 | mangle the unqualified type. The recursive call is needed here | |
755edffd | 2060 | since both the qualified and unqualified types are substitution |
98eaf693 | 2061 | candidates. */ |
2ba14c1f | 2062 | { |
2063 | tree t = TYPE_MAIN_VARIANT (type); | |
399fbdbd | 2064 | if (TYPE_ATTRIBUTES (t) && !OVERLOAD_TYPE_P (t)) |
6d02e6b2 | 2065 | { |
2066 | tree attrs = NULL_TREE; | |
2067 | if (tx_safe_fn_type_p (type)) | |
2068 | attrs = tree_cons (get_identifier ("transaction_safe"), | |
2069 | NULL_TREE, attrs); | |
2070 | t = cp_build_type_attribute_variant (t, attrs); | |
2071 | } | |
399fbdbd | 2072 | gcc_assert (t != type); |
2ba14c1f | 2073 | if (TREE_CODE (t) == FUNCTION_TYPE |
2074 | || TREE_CODE (t) == METHOD_TYPE) | |
862e5b6d | 2075 | { |
2076 | t = build_ref_qualified_type (t, type_memfn_rqual (type)); | |
c2ca6e19 | 2077 | if (flag_noexcept_type) |
2078 | { | |
2079 | tree r = TYPE_RAISES_EXCEPTIONS (type); | |
2080 | t = build_exception_variant (t, r); | |
2081 | } | |
399fbdbd | 2082 | if (abi_version_at_least (8) |
2083 | || type == TYPE_MAIN_VARIANT (type)) | |
862e5b6d | 2084 | /* Avoid adding the unqualified function type as a substitution. */ |
2085 | write_function_type (t); | |
2086 | else | |
2087 | write_type (t); | |
229a58b1 | 2088 | if (abi_warn_or_compat_version_crosses (8)) |
74b777e5 | 2089 | G.need_abi_warning = 1; |
862e5b6d | 2090 | } |
2091 | else | |
2092 | write_type (t); | |
2ba14c1f | 2093 | } |
621eb26c | 2094 | else if (TREE_CODE (type) == ARRAY_TYPE) |
2095 | /* It is important not to use the TYPE_MAIN_VARIANT of TYPE here | |
2096 | so that the cv-qualification of the element type is available | |
2097 | in write_array_type. */ | |
2098 | write_array_type (type); | |
98eaf693 | 2099 | else |
e75e76ea | 2100 | { |
eddcdde1 | 2101 | tree type_orig = type; |
2102 | ||
e75e76ea | 2103 | /* See through any typedefs. */ |
2104 | type = TYPE_MAIN_VARIANT (type); | |
2ba14c1f | 2105 | if (TREE_CODE (type) == FUNCTION_TYPE |
2106 | || TREE_CODE (type) == METHOD_TYPE) | |
e5122931 | 2107 | type = cxx_copy_lang_qualifiers (type, type_orig); |
e75e76ea | 2108 | |
480e417f | 2109 | /* According to the C++ ABI, some library classes are passed the |
2110 | same as the scalar type of their single member and use the same | |
2111 | mangling. */ | |
2112 | if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type)) | |
2113 | type = TREE_TYPE (first_field (type)); | |
2114 | ||
05765a91 | 2115 | if (TYPE_PTRDATAMEM_P (type)) |
120c0017 | 2116 | write_pointer_to_member_type (type); |
eddcdde1 | 2117 | else |
2118 | { | |
333715c2 | 2119 | /* Handle any target-specific fundamental types. */ |
2120 | const char *target_mangling | |
eddcdde1 | 2121 | = targetm.mangle_type (type_orig); |
333715c2 | 2122 | |
2123 | if (target_mangling) | |
2124 | { | |
2125 | write_string (target_mangling); | |
43bf2fc5 | 2126 | /* Add substitutions for types other than fundamental |
2127 | types. */ | |
c21c015b | 2128 | if (!VOID_TYPE_P (type) |
43bf2fc5 | 2129 | && TREE_CODE (type) != INTEGER_TYPE |
2130 | && TREE_CODE (type) != REAL_TYPE | |
2131 | && TREE_CODE (type) != BOOLEAN_TYPE) | |
2132 | add_substitution (type); | |
333715c2 | 2133 | return; |
2134 | } | |
2135 | ||
eddcdde1 | 2136 | switch (TREE_CODE (type)) |
2137 | { | |
2138 | case VOID_TYPE: | |
2139 | case BOOLEAN_TYPE: | |
2140 | case INTEGER_TYPE: /* Includes wchar_t. */ | |
2141 | case REAL_TYPE: | |
e4583147 | 2142 | case FIXED_POINT_TYPE: |
eddcdde1 | 2143 | { |
2144 | /* If this is a typedef, TYPE may not be one of | |
2145 | the standard builtin type nodes, but an alias of one. Use | |
2146 | TYPE_MAIN_VARIANT to get to the underlying builtin type. */ | |
2147 | write_builtin_type (TYPE_MAIN_VARIANT (type)); | |
2148 | ++is_builtin_type; | |
2149 | } | |
2150 | break; | |
2151 | ||
2152 | case COMPLEX_TYPE: | |
2153 | write_char ('C'); | |
2154 | write_type (TREE_TYPE (type)); | |
2155 | break; | |
2156 | ||
2157 | case FUNCTION_TYPE: | |
2158 | case METHOD_TYPE: | |
2159 | write_function_type (type); | |
2160 | break; | |
2161 | ||
2162 | case UNION_TYPE: | |
2163 | case RECORD_TYPE: | |
2164 | case ENUMERAL_TYPE: | |
2165 | /* A pointer-to-member function is represented as a special | |
2166 | RECORD_TYPE, so check for this first. */ | |
2167 | if (TYPE_PTRMEMFUNC_P (type)) | |
2168 | write_pointer_to_member_type (type); | |
2169 | else | |
2170 | write_class_enum_type (type); | |
2171 | break; | |
2172 | ||
2173 | case TYPENAME_TYPE: | |
2174 | case UNBOUND_CLASS_TEMPLATE: | |
2175 | /* We handle TYPENAME_TYPEs and UNBOUND_CLASS_TEMPLATEs like | |
2176 | ordinary nested names. */ | |
2177 | write_nested_name (TYPE_STUB_DECL (type)); | |
2178 | break; | |
2179 | ||
2180 | case POINTER_TYPE: | |
eddcdde1 | 2181 | case REFERENCE_TYPE: |
c21c015b | 2182 | if (TYPE_PTR_P (type)) |
80e93d60 | 2183 | write_char ('P'); |
2184 | else if (TYPE_REF_IS_RVALUE (type)) | |
2185 | write_char ('O'); | |
c4692e04 | 2186 | else |
2187 | write_char ('R'); | |
80e93d60 | 2188 | { |
2189 | tree target = TREE_TYPE (type); | |
2190 | /* Attribute const/noreturn are not reflected in mangling. | |
2191 | We strip them here rather than at a lower level because | |
2192 | a typedef or template argument can have function type | |
2193 | with function-cv-quals (that use the same representation), | |
2194 | but you can't have a pointer/reference to such a type. */ | |
74b777e5 | 2195 | if (TREE_CODE (target) == FUNCTION_TYPE) |
2196 | { | |
229a58b1 | 2197 | if (abi_warn_or_compat_version_crosses (5) |
74b777e5 | 2198 | && TYPE_QUALS (target) != TYPE_UNQUALIFIED) |
2199 | G.need_abi_warning = 1; | |
2200 | if (abi_version_at_least (5)) | |
2201 | target = build_qualified_type (target, TYPE_UNQUALIFIED); | |
2202 | } | |
80e93d60 | 2203 | write_type (target); |
2204 | } | |
eddcdde1 | 2205 | break; |
2206 | ||
2207 | case TEMPLATE_TYPE_PARM: | |
1610993e | 2208 | if (is_auto (type)) |
2209 | { | |
5357d7fd | 2210 | if (AUTO_IS_DECLTYPE (type)) |
2211 | write_identifier ("Dc"); | |
2212 | else | |
2213 | write_identifier ("Da"); | |
1610993e | 2214 | ++is_builtin_type; |
2215 | break; | |
2216 | } | |
e3533433 | 2217 | /* fall through. */ |
eddcdde1 | 2218 | case TEMPLATE_PARM_INDEX: |
2219 | write_template_param (type); | |
2220 | break; | |
2221 | ||
2222 | case TEMPLATE_TEMPLATE_PARM: | |
2223 | write_template_template_param (type); | |
2224 | break; | |
2225 | ||
2226 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
2227 | write_template_template_param (type); | |
2228 | write_template_args | |
2229 | (TI_ARGS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (type))); | |
2230 | break; | |
2231 | ||
2232 | case VECTOR_TYPE: | |
29e2e80a | 2233 | if (abi_version_at_least (4)) |
2234 | { | |
2235 | write_string ("Dv"); | |
2236 | /* Non-constant vector size would be encoded with | |
2237 | _ expression, but we don't support that yet. */ | |
f08ee65f | 2238 | write_unsigned_number (TYPE_VECTOR_SUBPARTS (type) |
2239 | .to_constant ()); | |
29e2e80a | 2240 | write_char ('_'); |
2241 | } | |
2242 | else | |
74b777e5 | 2243 | write_string ("U8__vector"); |
229a58b1 | 2244 | if (abi_warn_or_compat_version_crosses (4)) |
74b777e5 | 2245 | G.need_abi_warning = 1; |
eddcdde1 | 2246 | write_type (TREE_TYPE (type)); |
2247 | break; | |
2248 | ||
2249 | case TYPE_PACK_EXPANSION: | |
4682b6fe | 2250 | write_string ("Dp"); |
eddcdde1 | 2251 | write_type (PACK_EXPANSION_PATTERN (type)); |
2252 | break; | |
2253 | ||
34da8800 | 2254 | case DECLTYPE_TYPE: |
a8b75081 | 2255 | /* These shouldn't make it into mangling. */ |
2256 | gcc_assert (!DECLTYPE_FOR_LAMBDA_CAPTURE (type) | |
a75d43a4 | 2257 | && !DECLTYPE_FOR_LAMBDA_PROXY (type)); |
a8b75081 | 2258 | |
87d553db | 2259 | /* In ABI <5, we stripped decltype of a plain decl. */ |
74b777e5 | 2260 | if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)) |
4d7aaf8e | 2261 | { |
2262 | tree expr = DECLTYPE_TYPE_EXPR (type); | |
2263 | tree etype = NULL_TREE; | |
2264 | switch (TREE_CODE (expr)) | |
2265 | { | |
2266 | case VAR_DECL: | |
2267 | case PARM_DECL: | |
2268 | case RESULT_DECL: | |
2269 | case FUNCTION_DECL: | |
2270 | case CONST_DECL: | |
2271 | case TEMPLATE_PARM_INDEX: | |
2272 | etype = TREE_TYPE (expr); | |
2273 | break; | |
2274 | ||
2275 | default: | |
2276 | break; | |
2277 | } | |
2278 | ||
2279 | if (etype && !type_uses_auto (etype)) | |
2280 | { | |
229a58b1 | 2281 | if (abi_warn_or_compat_version_crosses (5)) |
74b777e5 | 2282 | G.need_abi_warning = 1; |
2283 | if (!abi_version_at_least (5)) | |
2284 | { | |
2285 | write_type (etype); | |
2286 | return; | |
2287 | } | |
4d7aaf8e | 2288 | } |
2289 | } | |
2290 | ||
34da8800 | 2291 | write_char ('D'); |
2292 | if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)) | |
2293 | write_char ('t'); | |
2294 | else | |
2295 | write_char ('T'); | |
48d94ede | 2296 | ++cp_unevaluated_operand; |
34da8800 | 2297 | write_expression (DECLTYPE_TYPE_EXPR (type)); |
48d94ede | 2298 | --cp_unevaluated_operand; |
34da8800 | 2299 | write_char ('E'); |
2300 | break; | |
2301 | ||
fa67d8e8 | 2302 | case NULLPTR_TYPE: |
2303 | write_string ("Dn"); | |
fbcdace8 | 2304 | if (abi_version_at_least (7)) |
2305 | ++is_builtin_type; | |
229a58b1 | 2306 | if (abi_warn_or_compat_version_crosses (7)) |
74b777e5 | 2307 | G.need_abi_warning = 1; |
fa67d8e8 | 2308 | break; |
2309 | ||
e56ff3c4 | 2310 | case TYPEOF_TYPE: |
2311 | sorry ("mangling typeof, use decltype instead"); | |
2312 | break; | |
2313 | ||
8de5c43e | 2314 | case UNDERLYING_TYPE: |
2315 | sorry ("mangling __underlying_type"); | |
2316 | break; | |
2317 | ||
c7ca48ea | 2318 | case LANG_TYPE: |
fa67d8e8 | 2319 | /* fall through. */ |
c7ca48ea | 2320 | |
eddcdde1 | 2321 | default: |
2322 | gcc_unreachable (); | |
2323 | } | |
e75e76ea | 2324 | } |
2325 | } | |
98eaf693 | 2326 | |
2327 | /* Types other than builtin types are substitution candidates. */ | |
2328 | if (!is_builtin_type) | |
2329 | add_substitution (type); | |
2330 | } | |
2331 | ||
399fbdbd | 2332 | /* qsort callback for sorting a vector of attribute entries. */ |
2333 | ||
2334 | static int | |
2335 | attr_strcmp (const void *p1, const void *p2) | |
2336 | { | |
2337 | tree a1 = *(const tree*)p1; | |
2338 | tree a2 = *(const tree*)p2; | |
2339 | ||
2340 | const attribute_spec *as1 = lookup_attribute_spec (get_attribute_name (a1)); | |
2341 | const attribute_spec *as2 = lookup_attribute_spec (get_attribute_name (a2)); | |
2342 | ||
2343 | return strcmp (as1->name, as2->name); | |
2344 | } | |
2345 | ||
98eaf693 | 2346 | /* Non-terminal <CV-qualifiers> for type nodes. Returns the number of |
2347 | CV-qualifiers written for TYPE. | |
2348 | ||
2349 | <CV-qualifiers> ::= [r] [V] [K] */ | |
2350 | ||
2351 | static int | |
61e3d157 | 2352 | write_CV_qualifiers_for_type (const tree type) |
98eaf693 | 2353 | { |
2354 | int num_qualifiers = 0; | |
2355 | ||
2356 | /* The order is specified by: | |
2357 | ||
2358 | "In cases where multiple order-insensitive qualifiers are | |
2359 | present, they should be ordered 'K' (closest to the base type), | |
399fbdbd | 2360 | 'V', 'r', and 'U' (farthest from the base type) ..." */ |
2361 | ||
2362 | /* Mangle attributes that affect type identity as extended qualifiers. | |
2363 | ||
399fbdbd | 2364 | We don't do this with classes and enums because their attributes |
2365 | are part of their definitions, not something added on. */ | |
2366 | ||
e07f1d23 | 2367 | if (!OVERLOAD_TYPE_P (type)) |
399fbdbd | 2368 | { |
2369 | auto_vec<tree> vec; | |
2370 | for (tree a = TYPE_ATTRIBUTES (type); a; a = TREE_CHAIN (a)) | |
2371 | { | |
2372 | tree name = get_attribute_name (a); | |
2373 | const attribute_spec *as = lookup_attribute_spec (name); | |
2374 | if (as && as->affects_type_identity | |
6d02e6b2 | 2375 | && !is_attribute_p ("transaction_safe", name) |
399fbdbd | 2376 | && !is_attribute_p ("abi_tag", name)) |
2377 | vec.safe_push (a); | |
2378 | } | |
229a58b1 | 2379 | if (abi_warn_or_compat_version_crosses (10) && !vec.is_empty ()) |
e07f1d23 | 2380 | G.need_abi_warning = true; |
2381 | if (abi_version_at_least (10)) | |
399fbdbd | 2382 | { |
e07f1d23 | 2383 | vec.qsort (attr_strcmp); |
2384 | while (!vec.is_empty()) | |
399fbdbd | 2385 | { |
e07f1d23 | 2386 | tree a = vec.pop(); |
2387 | const attribute_spec *as | |
2388 | = lookup_attribute_spec (get_attribute_name (a)); | |
2389 | ||
2390 | write_char ('U'); | |
2391 | write_unsigned_number (strlen (as->name)); | |
2392 | write_string (as->name); | |
2393 | if (TREE_VALUE (a)) | |
399fbdbd | 2394 | { |
e07f1d23 | 2395 | write_char ('I'); |
2396 | for (tree args = TREE_VALUE (a); args; | |
2397 | args = TREE_CHAIN (args)) | |
2398 | { | |
2399 | tree arg = TREE_VALUE (args); | |
2400 | write_template_arg (arg); | |
2401 | } | |
2402 | write_char ('E'); | |
399fbdbd | 2403 | } |
399fbdbd | 2404 | |
e07f1d23 | 2405 | ++num_qualifiers; |
2406 | } | |
399fbdbd | 2407 | } |
2408 | } | |
621eb26c | 2409 | |
399fbdbd | 2410 | /* Note that we do not use cp_type_quals below; given "const |
621eb26c | 2411 | int[3]", the "const" is emitted with the "int", not with the |
2412 | array. */ | |
ce494fcf | 2413 | cp_cv_quals quals = TYPE_QUALS (type); |
98eaf693 | 2414 | |
ce494fcf | 2415 | if (quals & TYPE_QUAL_RESTRICT) |
98eaf693 | 2416 | { |
2417 | write_char ('r'); | |
2418 | ++num_qualifiers; | |
2419 | } | |
ce494fcf | 2420 | if (quals & TYPE_QUAL_VOLATILE) |
98eaf693 | 2421 | { |
2422 | write_char ('V'); | |
2423 | ++num_qualifiers; | |
2424 | } | |
ce494fcf | 2425 | if (quals & TYPE_QUAL_CONST) |
98eaf693 | 2426 | { |
2427 | write_char ('K'); | |
2428 | ++num_qualifiers; | |
2429 | } | |
2430 | ||
2431 | return num_qualifiers; | |
2432 | } | |
2433 | ||
9031d10b | 2434 | /* Non-terminal <builtin-type>. |
98eaf693 | 2435 | |
9031d10b | 2436 | <builtin-type> ::= v # void |
653e5405 | 2437 | ::= b # bool |
2438 | ::= w # wchar_t | |
2439 | ::= c # char | |
2440 | ::= a # signed char | |
2441 | ::= h # unsigned char | |
2442 | ::= s # short | |
2443 | ::= t # unsigned short | |
2444 | ::= i # int | |
2445 | ::= j # unsigned int | |
2446 | ::= l # long | |
2447 | ::= m # unsigned long | |
2448 | ::= x # long long, __int64 | |
2449 | ::= y # unsigned long long, __int64 | |
2450 | ::= n # __int128 | |
2451 | ::= o # unsigned __int128 | |
2452 | ::= f # float | |
2453 | ::= d # double | |
2454 | ::= e # long double, __float80 | |
2455 | ::= g # __float128 [not supported] | |
2456 | ::= u <source-name> # vendor extended type */ | |
98eaf693 | 2457 | |
9031d10b | 2458 | static void |
61e3d157 | 2459 | write_builtin_type (tree type) |
98eaf693 | 2460 | { |
9a984729 | 2461 | if (TYPE_CANONICAL (type)) |
2462 | type = TYPE_CANONICAL (type); | |
2463 | ||
98eaf693 | 2464 | switch (TREE_CODE (type)) |
2465 | { | |
2466 | case VOID_TYPE: | |
2467 | write_char ('v'); | |
2468 | break; | |
2469 | ||
2470 | case BOOLEAN_TYPE: | |
2471 | write_char ('b'); | |
2472 | break; | |
2473 | ||
2474 | case INTEGER_TYPE: | |
82362779 | 2475 | /* TYPE may still be wchar_t, char8_t, char16_t, or char32_t, since that |
924bbf02 | 2476 | isn't in integer_type_nodes. */ |
84ea6a1d | 2477 | if (type == wchar_type_node) |
98eaf693 | 2478 | write_char ('w'); |
82362779 | 2479 | else if (type == char8_type_node) |
2480 | write_string ("Du"); | |
924bbf02 | 2481 | else if (type == char16_type_node) |
4682b6fe | 2482 | write_string ("Ds"); |
924bbf02 | 2483 | else if (type == char32_type_node) |
4682b6fe | 2484 | write_string ("Di"); |
98eaf693 | 2485 | else |
2486 | { | |
2487 | size_t itk; | |
2488 | /* Assume TYPE is one of the shared integer type nodes. Find | |
2489 | it in the array of these nodes. */ | |
90a83261 | 2490 | iagain: |
98eaf693 | 2491 | for (itk = 0; itk < itk_none; ++itk) |
890d0caa | 2492 | if (integer_types[itk] != NULL_TREE |
9f75f026 | 2493 | && integer_type_codes[itk] != '\0' |
890d0caa | 2494 | && type == integer_types[itk]) |
98eaf693 | 2495 | { |
2496 | /* Print the corresponding single-letter code. */ | |
2497 | write_char (integer_type_codes[itk]); | |
2498 | break; | |
2499 | } | |
52eb8ed3 | 2500 | |
98eaf693 | 2501 | if (itk == itk_none) |
90a83261 | 2502 | { |
771d21fa | 2503 | tree t = c_common_type_for_mode (TYPE_MODE (type), |
78a8ed03 | 2504 | TYPE_UNSIGNED (type)); |
42a8ab57 | 2505 | if (type != t) |
52eb8ed3 | 2506 | { |
42a8ab57 | 2507 | type = t; |
2508 | goto iagain; | |
52eb8ed3 | 2509 | } |
42a8ab57 | 2510 | |
2511 | if (TYPE_PRECISION (type) == 128) | |
2512 | write_char (TYPE_UNSIGNED (type) ? 'o' : 'n'); | |
6526d3a8 | 2513 | else |
2514 | { | |
42a8ab57 | 2515 | /* Allow for cases where TYPE is not one of the shared |
2516 | integer type nodes and write a "vendor extended builtin | |
2517 | type" with a name the form intN or uintN, respectively. | |
2518 | Situations like this can happen if you have an | |
2519 | __attribute__((__mode__(__SI__))) type and use exotic | |
9fb415cc | 2520 | switches like '-mint8' on AVR. Of course, this is |
2521 | undefined by the C++ ABI (and '-mint8' is not even | |
2522 | Standard C conforming), but when using such special | |
2523 | options you're pretty much in nowhere land anyway. */ | |
42a8ab57 | 2524 | const char *prefix; |
2525 | char prec[11]; /* up to ten digits for an unsigned */ | |
2526 | ||
2527 | prefix = TYPE_UNSIGNED (type) ? "uint" : "int"; | |
2528 | sprintf (prec, "%u", (unsigned) TYPE_PRECISION (type)); | |
2529 | write_char ('u'); /* "vendor extended builtin type" */ | |
2530 | write_unsigned_number (strlen (prefix) + strlen (prec)); | |
2531 | write_string (prefix); | |
2532 | write_string (prec); | |
6526d3a8 | 2533 | } |
90a83261 | 2534 | } |
98eaf693 | 2535 | } |
2536 | break; | |
2537 | ||
2538 | case REAL_TYPE: | |
c93d719b | 2539 | if (type == float_type_node) |
98eaf693 | 2540 | write_char ('f'); |
c93d719b | 2541 | else if (type == double_type_node) |
98eaf693 | 2542 | write_char ('d'); |
84ea6a1d | 2543 | else if (type == long_double_type_node) |
98eaf693 | 2544 | write_char ('e'); |
dcd70a22 | 2545 | else if (type == dfloat32_type_node) |
2546 | write_string ("Df"); | |
2547 | else if (type == dfloat64_type_node) | |
2548 | write_string ("Dd"); | |
2549 | else if (type == dfloat128_type_node) | |
2550 | write_string ("De"); | |
98eaf693 | 2551 | else |
092b1d6f | 2552 | gcc_unreachable (); |
98eaf693 | 2553 | break; |
2554 | ||
e4583147 | 2555 | case FIXED_POINT_TYPE: |
2556 | write_string ("DF"); | |
2557 | if (GET_MODE_IBIT (TYPE_MODE (type)) > 0) | |
2558 | write_unsigned_number (GET_MODE_IBIT (TYPE_MODE (type))); | |
2559 | if (type == fract_type_node | |
2560 | || type == sat_fract_type_node | |
2561 | || type == accum_type_node | |
2562 | || type == sat_accum_type_node) | |
2563 | write_char ('i'); | |
2564 | else if (type == unsigned_fract_type_node | |
2565 | || type == sat_unsigned_fract_type_node | |
2566 | || type == unsigned_accum_type_node | |
2567 | || type == sat_unsigned_accum_type_node) | |
2568 | write_char ('j'); | |
2569 | else if (type == short_fract_type_node | |
2570 | || type == sat_short_fract_type_node | |
2571 | || type == short_accum_type_node | |
2572 | || type == sat_short_accum_type_node) | |
2573 | write_char ('s'); | |
2574 | else if (type == unsigned_short_fract_type_node | |
2575 | || type == sat_unsigned_short_fract_type_node | |
2576 | || type == unsigned_short_accum_type_node | |
2577 | || type == sat_unsigned_short_accum_type_node) | |
2578 | write_char ('t'); | |
2579 | else if (type == long_fract_type_node | |
2580 | || type == sat_long_fract_type_node | |
2581 | || type == long_accum_type_node | |
2582 | || type == sat_long_accum_type_node) | |
2583 | write_char ('l'); | |
2584 | else if (type == unsigned_long_fract_type_node | |
2585 | || type == sat_unsigned_long_fract_type_node | |
2586 | || type == unsigned_long_accum_type_node | |
2587 | || type == sat_unsigned_long_accum_type_node) | |
2588 | write_char ('m'); | |
2589 | else if (type == long_long_fract_type_node | |
2590 | || type == sat_long_long_fract_type_node | |
2591 | || type == long_long_accum_type_node | |
2592 | || type == sat_long_long_accum_type_node) | |
2593 | write_char ('x'); | |
2594 | else if (type == unsigned_long_long_fract_type_node | |
2595 | || type == sat_unsigned_long_long_fract_type_node | |
2596 | || type == unsigned_long_long_accum_type_node | |
2597 | || type == sat_unsigned_long_long_accum_type_node) | |
2598 | write_char ('y'); | |
2599 | else | |
2600 | sorry ("mangling unknown fixed point type"); | |
2601 | write_unsigned_number (GET_MODE_FBIT (TYPE_MODE (type))); | |
2602 | if (TYPE_SATURATING (type)) | |
2603 | write_char ('s'); | |
2604 | else | |
2605 | write_char ('n'); | |
2606 | break; | |
2607 | ||
98eaf693 | 2608 | default: |
092b1d6f | 2609 | gcc_unreachable (); |
98eaf693 | 2610 | } |
2611 | } | |
2612 | ||
2613 | /* Non-terminal <function-type>. NODE is a FUNCTION_TYPE or | |
aa6b4383 | 2614 | METHOD_TYPE. The return type is mangled before the parameter |
2615 | types. | |
98eaf693 | 2616 | |
2ba14c1f | 2617 | <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E */ |
98eaf693 | 2618 | |
2619 | static void | |
61e3d157 | 2620 | write_function_type (const tree type) |
98eaf693 | 2621 | { |
2622 | MANGLE_TRACE_TREE ("function-type", type); | |
2623 | ||
58274fe8 | 2624 | /* For a pointer to member function, the function type may have |
2625 | cv-qualifiers, indicating the quals for the artificial 'this' | |
2626 | parameter. */ | |
2627 | if (TREE_CODE (type) == METHOD_TYPE) | |
2628 | { | |
2629 | /* The first parameter must be a POINTER_TYPE pointing to the | |
2630 | `this' parameter. */ | |
a8d966c1 | 2631 | tree this_type = class_of_this_parm (type); |
58274fe8 | 2632 | write_CV_qualifiers_for_type (this_type); |
2633 | } | |
2634 | ||
2e9e9363 | 2635 | write_exception_spec (TYPE_RAISES_EXCEPTIONS (type)); |
2636 | ||
6d02e6b2 | 2637 | if (tx_safe_fn_type_p (type)) |
2638 | write_string ("Dx"); | |
2639 | ||
98eaf693 | 2640 | write_char ('F'); |
2641 | /* We don't track whether or not a type is `extern "C"'. Note that | |
2642 | you can have an `extern "C"' function that does not have | |
2643 | `extern "C"' type, and vice versa: | |
2644 | ||
2645 | extern "C" typedef void function_t(); | |
2646 | function_t f; // f has C++ linkage, but its type is | |
653e5405 | 2647 | // `extern "C"' |
98eaf693 | 2648 | |
2649 | typedef void function_t(); | |
2650 | extern "C" function_t f; // Vice versa. | |
2651 | ||
2652 | See [dcl.link]. */ | |
9031d10b | 2653 | write_bare_function_type (type, /*include_return_type_p=*/1, |
7c8696b2 | 2654 | /*decl=*/NULL); |
2ba14c1f | 2655 | if (FUNCTION_REF_QUALIFIED (type)) |
2656 | { | |
2657 | if (FUNCTION_RVALUE_QUALIFIED (type)) | |
2658 | write_char ('O'); | |
2659 | else | |
2660 | write_char ('R'); | |
2661 | } | |
98eaf693 | 2662 | write_char ('E'); |
2663 | } | |
2664 | ||
7c8696b2 | 2665 | /* Non-terminal <bare-function-type>. TYPE is a FUNCTION_TYPE or |
3160db1d | 2666 | METHOD_TYPE. If INCLUDE_RETURN_TYPE is nonzero, the return value |
7c8696b2 | 2667 | is mangled before the parameter types. If non-NULL, DECL is |
c93d719b | 2668 | FUNCTION_DECL for the function whose type is being emitted. */ |
98eaf693 | 2669 | |
2670 | static void | |
61e3d157 | 2671 | write_bare_function_type (const tree type, const int include_return_type_p, |
2672 | const tree decl) | |
98eaf693 | 2673 | { |
2674 | MANGLE_TRACE_TREE ("bare-function-type", type); | |
2675 | ||
2676 | /* Mangle the return type, if requested. */ | |
c93d719b | 2677 | if (include_return_type_p) |
98eaf693 | 2678 | write_type (TREE_TYPE (type)); |
2679 | ||
2680 | /* Now mangle the types of the arguments. */ | |
4d7aaf8e | 2681 | ++G.parm_depth; |
9031d10b | 2682 | write_method_parms (TYPE_ARG_TYPES (type), |
7c8696b2 | 2683 | TREE_CODE (type) == METHOD_TYPE, |
2684 | decl); | |
4d7aaf8e | 2685 | --G.parm_depth; |
98eaf693 | 2686 | } |
2687 | ||
2688 | /* Write the mangled representation of a method parameter list of | |
3160db1d | 2689 | types given in PARM_TYPES. If METHOD_P is nonzero, the function is |
7c8696b2 | 2690 | considered a non-static method, and the this parameter is omitted. |
2691 | If non-NULL, DECL is the FUNCTION_DECL for the function whose | |
2692 | parameters are being emitted. */ | |
98eaf693 | 2693 | |
2694 | static void | |
61e3d157 | 2695 | write_method_parms (tree parm_types, const int method_p, const tree decl) |
98eaf693 | 2696 | { |
7c8696b2 | 2697 | tree first_parm_type; |
2698 | tree parm_decl = decl ? DECL_ARGUMENTS (decl) : NULL_TREE; | |
2699 | ||
98eaf693 | 2700 | /* Assume this parameter type list is variable-length. If it ends |
2701 | with a void type, then it's not. */ | |
2702 | int varargs_p = 1; | |
2703 | ||
2704 | /* If this is a member function, skip the first arg, which is the | |
9031d10b | 2705 | this pointer. |
98eaf693 | 2706 | "Member functions do not encode the type of their implicit this |
9031d10b | 2707 | parameter." |
2708 | ||
7c8696b2 | 2709 | Similarly, there's no need to mangle artificial parameters, like |
2710 | the VTT parameters for constructors and destructors. */ | |
98eaf693 | 2711 | if (method_p) |
98eaf693 | 2712 | { |
7c8696b2 | 2713 | parm_types = TREE_CHAIN (parm_types); |
1767a056 | 2714 | parm_decl = parm_decl ? DECL_CHAIN (parm_decl) : NULL_TREE; |
98eaf693 | 2715 | |
7c8696b2 | 2716 | while (parm_decl && DECL_ARTIFICIAL (parm_decl)) |
2717 | { | |
2718 | parm_types = TREE_CHAIN (parm_types); | |
1767a056 | 2719 | parm_decl = DECL_CHAIN (parm_decl); |
7c8696b2 | 2720 | } |
b4c5b883 | 2721 | |
2722 | if (decl && ctor_omit_inherited_parms (decl)) | |
2723 | /* Bring back parameters omitted from an inherited ctor. */ | |
2724 | parm_types = FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (decl)); | |
7c8696b2 | 2725 | } |
2726 | ||
9031d10b | 2727 | for (first_parm_type = parm_types; |
2728 | parm_types; | |
7c8696b2 | 2729 | parm_types = TREE_CHAIN (parm_types)) |
2730 | { | |
2731 | tree parm = TREE_VALUE (parm_types); | |
e3cfe3ce | 2732 | if (parm == void_type_node) |
98eaf693 | 2733 | { |
2734 | /* "Empty parameter lists, whether declared as () or | |
2735 | conventionally as (void), are encoded with a void parameter | |
2736 | (v)." */ | |
7c8696b2 | 2737 | if (parm_types == first_parm_type) |
98eaf693 | 2738 | write_type (parm); |
2739 | /* If the parm list is terminated with a void type, it's | |
2740 | fixed-length. */ | |
2741 | varargs_p = 0; | |
2742 | /* A void type better be the last one. */ | |
b4df430b | 2743 | gcc_assert (TREE_CHAIN (parm_types) == NULL); |
98eaf693 | 2744 | } |
2745 | else | |
2746 | write_type (parm); | |
2747 | } | |
2748 | ||
2749 | if (varargs_p) | |
2750 | /* <builtin-type> ::= z # ellipsis */ | |
2751 | write_char ('z'); | |
2752 | } | |
2753 | ||
2754 | /* <class-enum-type> ::= <name> */ | |
2755 | ||
9031d10b | 2756 | static void |
61e3d157 | 2757 | write_class_enum_type (const tree type) |
98eaf693 | 2758 | { |
bbb9efab | 2759 | write_name (TYPE_NAME (type), /*ignore_local_scope=*/0); |
98eaf693 | 2760 | } |
2761 | ||
2762 | /* Non-terminal <template-args>. ARGS is a TREE_VEC of template | |
2763 | arguments. | |
2764 | ||
f59dc0de | 2765 | <template-args> ::= I <template-arg>* E */ |
98eaf693 | 2766 | |
2767 | static void | |
61e3d157 | 2768 | write_template_args (tree args) |
98eaf693 | 2769 | { |
25f4fc1e | 2770 | int i; |
f59dc0de | 2771 | int length = 0; |
9031d10b | 2772 | |
98eaf693 | 2773 | MANGLE_TRACE_TREE ("template-args", args); |
2774 | ||
94302392 | 2775 | write_char ('I'); |
98eaf693 | 2776 | |
f59dc0de | 2777 | if (args) |
2778 | length = TREE_VEC_LENGTH (args); | |
94302392 | 2779 | |
fbfe1b55 | 2780 | if (args && length && TREE_CODE (TREE_VEC_ELT (args, 0)) == TREE_VEC) |
94302392 | 2781 | { |
25f4fc1e | 2782 | /* We have nested template args. We want the innermost template |
2783 | argument list. */ | |
2784 | args = TREE_VEC_ELT (args, length - 1); | |
2785 | length = TREE_VEC_LENGTH (args); | |
98eaf693 | 2786 | } |
25f4fc1e | 2787 | for (i = 0; i < length; ++i) |
2788 | write_template_arg (TREE_VEC_ELT (args, i)); | |
9031d10b | 2789 | |
98eaf693 | 2790 | write_char ('E'); |
2791 | } | |
2792 | ||
4682b6fe | 2793 | /* Write out the |
2794 | <unqualified-name> | |
2795 | <unqualified-name> <template-args> | |
2796 | part of SCOPE_REF or COMPONENT_REF mangling. */ | |
2797 | ||
2798 | static void | |
2799 | write_member_name (tree member) | |
2800 | { | |
991449b2 | 2801 | if (identifier_p (member)) |
322066d8 | 2802 | { |
991449b2 | 2803 | if (abi_version_at_least (11) && IDENTIFIER_ANY_OP_P (member)) |
2804 | { | |
2805 | write_string ("on"); | |
2806 | if (abi_warn_or_compat_version_crosses (11)) | |
2807 | G.need_abi_warning = 1; | |
2808 | } | |
2809 | write_unqualified_id (member); | |
322066d8 | 2810 | } |
4682b6fe | 2811 | else if (DECL_P (member)) |
fb3127b9 | 2812 | write_unqualified_name (member); |
4682b6fe | 2813 | else if (TREE_CODE (member) == TEMPLATE_ID_EXPR) |
2814 | { | |
2815 | tree name = TREE_OPERAND (member, 0); | |
6767ca9a | 2816 | name = OVL_FIRST (name); |
4682b6fe | 2817 | write_member_name (name); |
2818 | write_template_args (TREE_OPERAND (member, 1)); | |
2819 | } | |
2820 | else | |
2821 | write_expression (member); | |
2822 | } | |
2823 | ||
98eaf693 | 2824 | /* <expression> ::= <unary operator-name> <expression> |
2825 | ::= <binary operator-name> <expression> <expression> | |
2826 | ::= <expr-primary> | |
2827 | ||
2828 | <expr-primary> ::= <template-param> | |
653e5405 | 2829 | ::= L <type> <value number> E # literal |
2830 | ::= L <mangled-name> E # external name | |
34eac767 | 2831 | ::= st <type> # sizeof |
2832 | ::= sr <type> <unqualified-name> # dependent name | |
653e5405 | 2833 | ::= sr <type> <unqualified-name> <template-args> */ |
98eaf693 | 2834 | |
2835 | static void | |
61e3d157 | 2836 | write_expression (tree expr) |
98eaf693 | 2837 | { |
3986b463 | 2838 | enum tree_code code = TREE_CODE (expr); |
98eaf693 | 2839 | |
1ed9e78d | 2840 | if (TREE_CODE (expr) == TARGET_EXPR) |
2841 | { | |
2842 | expr = TARGET_EXPR_INITIAL (expr); | |
2843 | code = TREE_CODE (expr); | |
2844 | } | |
2845 | ||
f0474a47 | 2846 | /* Skip NOP_EXPR and CONVERT_EXPR. They can occur when (say) a pointer |
2847 | argument is converted (via qualification conversions) to another type. */ | |
2848 | while (CONVERT_EXPR_CODE_P (code) | |
d76863c8 | 2849 | || location_wrapper_p (expr) |
07850d16 | 2850 | /* Parentheses aren't mangled. */ |
2851 | || code == PAREN_EXPR | |
1ed9e78d | 2852 | || code == NON_LVALUE_EXPR |
2853 | || (code == VIEW_CONVERT_EXPR | |
2854 | && TREE_CODE (TREE_OPERAND (expr, 0)) == TEMPLATE_PARM_INDEX)) | |
b312a686 | 2855 | { |
2856 | expr = TREE_OPERAND (expr, 0); | |
2857 | code = TREE_CODE (expr); | |
2858 | } | |
2859 | ||
8272c334 | 2860 | if (code == BASELINK |
2861 | && (!type_unknown_p (expr) | |
2862 | || !BASELINK_QUALIFIED_P (expr))) | |
0e5cde0c | 2863 | { |
2864 | expr = BASELINK_FUNCTIONS (expr); | |
2865 | code = TREE_CODE (expr); | |
2866 | } | |
2867 | ||
98eaf693 | 2868 | /* Handle pointers-to-members by making them look like expression |
2869 | nodes. */ | |
2870 | if (code == PTRMEM_CST) | |
2871 | { | |
2872 | expr = build_nt (ADDR_EXPR, | |
fbb01da7 | 2873 | build_qualified_name (/*type=*/NULL_TREE, |
2874 | PTRMEM_CST_CLASS (expr), | |
2875 | PTRMEM_CST_MEMBER (expr), | |
2876 | /*template_p=*/false)); | |
98eaf693 | 2877 | code = TREE_CODE (expr); |
2878 | } | |
2879 | ||
47cd6605 | 2880 | /* Handle template parameters. */ |
9031d10b | 2881 | if (code == TEMPLATE_TYPE_PARM |
98eaf693 | 2882 | || code == TEMPLATE_TEMPLATE_PARM |
1e93ca27 | 2883 | || code == BOUND_TEMPLATE_TEMPLATE_PARM |
2884 | || code == TEMPLATE_PARM_INDEX) | |
98eaf693 | 2885 | write_template_param (expr); |
2886 | /* Handle literals. */ | |
ce45a448 | 2887 | else if (TREE_CODE_CLASS (code) == tcc_constant |
f591db9a | 2888 | || code == CONST_DECL) |
98eaf693 | 2889 | write_template_arg_literal (expr); |
56f83c40 | 2890 | else if (code == PARM_DECL && DECL_ARTIFICIAL (expr)) |
2891 | { | |
e34c848a | 2892 | gcc_assert (id_equal (DECL_NAME (expr), "this")); |
56f83c40 | 2893 | write_string ("fpT"); |
2894 | } | |
34eac767 | 2895 | else if (code == PARM_DECL) |
2896 | { | |
e92154af | 2897 | /* A function parameter used in a late-specified return type. */ |
32d008d9 | 2898 | int index = DECL_PARM_INDEX (expr); |
4d7aaf8e | 2899 | int level = DECL_PARM_LEVEL (expr); |
2900 | int delta = G.parm_depth - level + 1; | |
32d008d9 | 2901 | gcc_assert (index >= 1); |
4d7aaf8e | 2902 | write_char ('f'); |
2903 | if (delta != 0) | |
2904 | { | |
87d553db | 2905 | if (abi_version_at_least (5)) |
4d7aaf8e | 2906 | { |
2907 | /* Let L be the number of function prototype scopes from the | |
2908 | innermost one (in which the parameter reference occurs) up | |
2909 | to (and including) the one containing the declaration of | |
2910 | the referenced parameter. If the parameter declaration | |
2911 | clause of the innermost function prototype scope has been | |
2912 | completely seen, it is not counted (in that case -- which | |
2913 | is perhaps the most common -- L can be zero). */ | |
2914 | write_char ('L'); | |
2915 | write_unsigned_number (delta - 1); | |
2916 | } | |
229a58b1 | 2917 | if (abi_warn_or_compat_version_crosses (5)) |
4d7aaf8e | 2918 | G.need_abi_warning = true; |
2919 | } | |
2920 | write_char ('p'); | |
a8b75081 | 2921 | write_compact_number (index - 1); |
34eac767 | 2922 | } |
98eaf693 | 2923 | else if (DECL_P (expr)) |
2924 | { | |
2925 | write_char ('L'); | |
1da3f78a | 2926 | write_mangled_name (expr, false); |
98eaf693 | 2927 | write_char ('E'); |
2928 | } | |
17fdf85c | 2929 | else if (TREE_CODE (expr) == SIZEOF_EXPR) |
121296ee | 2930 | { |
17fdf85c | 2931 | tree op = TREE_OPERAND (expr, 0); |
2932 | ||
2933 | if (PACK_EXPANSION_P (op)) | |
2934 | { | |
2935 | if (abi_warn_or_compat_version_crosses (11)) | |
2936 | G.need_abi_warning = true; | |
2937 | if (abi_version_at_least (11)) | |
2938 | { | |
2939 | /* sZ rather than szDp. */ | |
2940 | write_string ("sZ"); | |
2941 | write_expression (PACK_EXPANSION_PATTERN (op)); | |
2942 | return; | |
2943 | } | |
2944 | } | |
2945 | ||
2946 | if (SIZEOF_EXPR_TYPE_P (expr)) | |
2947 | { | |
2948 | write_string ("st"); | |
2949 | write_type (TREE_TYPE (op)); | |
2950 | } | |
2951 | else if (ARGUMENT_PACK_P (op)) | |
2952 | { | |
2953 | tree args = ARGUMENT_PACK_ARGS (op); | |
2954 | int length = TREE_VEC_LENGTH (args); | |
2955 | if (abi_warn_or_compat_version_crosses (10)) | |
2956 | G.need_abi_warning = true; | |
2957 | if (abi_version_at_least (10)) | |
2958 | { | |
2959 | /* sP <template-arg>* E # sizeof...(T), size of a captured | |
2960 | template parameter pack from an alias template */ | |
2961 | write_string ("sP"); | |
2962 | for (int i = 0; i < length; ++i) | |
2963 | write_template_arg (TREE_VEC_ELT (args, i)); | |
2964 | write_char ('E'); | |
2965 | } | |
2966 | else | |
2967 | { | |
2968 | /* In GCC 5 we represented this sizeof wrong, with the effect | |
2969 | that we mangled it as the last element of the pack. */ | |
2970 | tree arg = TREE_VEC_ELT (args, length-1); | |
2971 | if (TYPE_P (op)) | |
2972 | { | |
2973 | write_string ("st"); | |
2974 | write_type (arg); | |
2975 | } | |
2976 | else | |
2977 | { | |
2978 | write_string ("sz"); | |
2979 | write_expression (arg); | |
2980 | } | |
2981 | } | |
2982 | } | |
2983 | else if (TYPE_P (TREE_OPERAND (expr, 0))) | |
2984 | { | |
2985 | write_string ("st"); | |
2986 | write_type (TREE_OPERAND (expr, 0)); | |
2987 | } | |
2988 | else | |
2989 | goto normal_expr; | |
74c75ba5 | 2990 | } |
e92154af | 2991 | else if (TREE_CODE (expr) == ALIGNOF_EXPR |
2992 | && TYPE_P (TREE_OPERAND (expr, 0))) | |
2993 | { | |
2994 | write_string ("at"); | |
2995 | write_type (TREE_OPERAND (expr, 0)); | |
2996 | } | |
8272c334 | 2997 | else if (code == SCOPE_REF |
2998 | || code == BASELINK) | |
94302392 | 2999 | { |
8272c334 | 3000 | tree scope, member; |
3001 | if (code == SCOPE_REF) | |
3002 | { | |
3003 | scope = TREE_OPERAND (expr, 0); | |
3004 | member = TREE_OPERAND (expr, 1); | |
af48cea2 | 3005 | if (BASELINK_P (member)) |
3006 | member = BASELINK_FUNCTIONS (member); | |
8272c334 | 3007 | } |
3008 | else | |
3009 | { | |
3010 | scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (expr)); | |
3011 | member = BASELINK_FUNCTIONS (expr); | |
3012 | } | |
94302392 | 3013 | |
3014 | /* If the MEMBER is a real declaration, then the qualifying | |
3015 | scope was not dependent. Ideally, we would not have a | |
3016 | SCOPE_REF in those cases, but sometimes we do. If the second | |
3017 | argument is a DECL, then the name must not have been | |
3018 | dependent. */ | |
f591db9a | 3019 | if (DECL_P (member)) |
94302392 | 3020 | write_expression (member); |
3021 | else | |
3022 | { | |
94302392 | 3023 | write_string ("sr"); |
3024 | write_type (scope); | |
c44a7393 | 3025 | write_member_name (member); |
94302392 | 3026 | } |
3027 | } | |
86ccc124 | 3028 | else if (INDIRECT_REF_P (expr) |
e92154af | 3029 | && TREE_TYPE (TREE_OPERAND (expr, 0)) |
90ad495b | 3030 | && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (expr, 0)))) |
e92154af | 3031 | { |
3032 | write_expression (TREE_OPERAND (expr, 0)); | |
3033 | } | |
694683bb | 3034 | else if (identifier_p (expr)) |
c44a7393 | 3035 | { |
3036 | /* An operator name appearing as a dependent name needs to be | |
3037 | specially marked to disambiguate between a use of the operator | |
3038 | name and a use of the operator in an expression. */ | |
991449b2 | 3039 | if (IDENTIFIER_ANY_OP_P (expr)) |
c44a7393 | 3040 | write_string ("on"); |
3041 | write_unqualified_id (expr); | |
3042 | } | |
3043 | else if (TREE_CODE (expr) == TEMPLATE_ID_EXPR) | |
3044 | { | |
3045 | tree fn = TREE_OPERAND (expr, 0); | |
6767ca9a | 3046 | fn = OVL_NAME (fn); |
991449b2 | 3047 | if (IDENTIFIER_ANY_OP_P (fn)) |
c44a7393 | 3048 | write_string ("on"); |
3049 | write_unqualified_id (fn); | |
3050 | write_template_args (TREE_OPERAND (expr, 1)); | |
3051 | } | |
cc5f60f5 | 3052 | else if (TREE_CODE (expr) == MODOP_EXPR) |
3053 | { | |
3054 | enum tree_code subop = TREE_CODE (TREE_OPERAND (expr, 1)); | |
ca16a224 | 3055 | const char *name = OVL_OP_INFO (true, subop)->mangled_name; |
3056 | ||
cc5f60f5 | 3057 | write_string (name); |
3058 | write_expression (TREE_OPERAND (expr, 0)); | |
3059 | write_expression (TREE_OPERAND (expr, 2)); | |
3060 | } | |
2d847c18 | 3061 | else if (code == NEW_EXPR || code == VEC_NEW_EXPR) |
3062 | { | |
3063 | /* ::= [gs] nw <expression>* _ <type> E | |
3064 | ::= [gs] nw <expression>* _ <type> <initializer> | |
3065 | ::= [gs] na <expression>* _ <type> E | |
3066 | ::= [gs] na <expression>* _ <type> <initializer> | |
3067 | <initializer> ::= pi <expression>* E */ | |
3068 | tree placement = TREE_OPERAND (expr, 0); | |
3069 | tree type = TREE_OPERAND (expr, 1); | |
3070 | tree nelts = TREE_OPERAND (expr, 2); | |
3071 | tree init = TREE_OPERAND (expr, 3); | |
3072 | tree t; | |
3073 | ||
3074 | gcc_assert (code == NEW_EXPR); | |
3075 | if (TREE_OPERAND (expr, 2)) | |
3076 | code = VEC_NEW_EXPR; | |
3077 | ||
3078 | if (NEW_EXPR_USE_GLOBAL (expr)) | |
3079 | write_string ("gs"); | |
3080 | ||
ca16a224 | 3081 | write_string (OVL_OP_INFO (false, code)->mangled_name); |
2d847c18 | 3082 | |
3083 | for (t = placement; t; t = TREE_CHAIN (t)) | |
3084 | write_expression (TREE_VALUE (t)); | |
3085 | ||
3086 | write_char ('_'); | |
3087 | ||
3088 | if (nelts) | |
3089 | { | |
3090 | tree domain; | |
3091 | ++processing_template_decl; | |
3092 | domain = compute_array_index_type (NULL_TREE, nelts, | |
3093 | tf_warning_or_error); | |
3094 | type = build_cplus_array_type (type, domain); | |
3095 | --processing_template_decl; | |
3096 | } | |
3097 | write_type (type); | |
3098 | ||
3099 | if (init && TREE_CODE (init) == TREE_LIST | |
8e8713cd | 3100 | && DIRECT_LIST_INIT_P (TREE_VALUE (init))) |
2d847c18 | 3101 | write_expression (TREE_VALUE (init)); |
3102 | else | |
3103 | { | |
3104 | if (init) | |
3105 | write_string ("pi"); | |
3ab4693e | 3106 | if (init && init != void_node) |
2d847c18 | 3107 | for (t = init; t; t = TREE_CHAIN (t)) |
3108 | write_expression (TREE_VALUE (t)); | |
3109 | write_char ('E'); | |
3110 | } | |
3111 | } | |
3112 | else if (code == DELETE_EXPR || code == VEC_DELETE_EXPR) | |
3113 | { | |
3114 | gcc_assert (code == DELETE_EXPR); | |
3115 | if (DELETE_EXPR_USE_VEC (expr)) | |
3116 | code = VEC_DELETE_EXPR; | |
3117 | ||
3118 | if (DELETE_EXPR_USE_GLOBAL (expr)) | |
3119 | write_string ("gs"); | |
3120 | ||
ca16a224 | 3121 | write_string (OVL_OP_INFO (false, code)->mangled_name); |
2d847c18 | 3122 | |
3123 | write_expression (TREE_OPERAND (expr, 0)); | |
3124 | } | |
3125 | else if (code == THROW_EXPR) | |
3126 | { | |
3127 | tree op = TREE_OPERAND (expr, 0); | |
3128 | if (op) | |
3129 | { | |
3130 | write_string ("tw"); | |
3131 | write_expression (op); | |
3132 | } | |
3133 | else | |
3134 | write_string ("tr"); | |
3135 | } | |
3136 | else if (code == CONSTRUCTOR) | |
3137 | { | |
b11751dc | 3138 | bool braced_init = BRACE_ENCLOSED_INITIALIZER_P (expr); |
3139 | tree etype = TREE_TYPE (expr); | |
2d847c18 | 3140 | |
b11751dc | 3141 | if (braced_init) |
2d847c18 | 3142 | write_string ("il"); |
3143 | else | |
3144 | { | |
3145 | write_string ("tl"); | |
b11751dc | 3146 | write_type (etype); |
3147 | } | |
3148 | ||
3149 | if (!initializer_zerop (expr) || !trivial_type_p (etype)) | |
3150 | { | |
3151 | /* Convert braced initializer lists to STRING_CSTs so that | |
3152 | A<"Foo"> mangles the same as A<{'F', 'o', 'o', 0}> while | |
3153 | still using the latter mangling for strings that | |
3154 | originated as braced initializer lists. */ | |
3155 | expr = braced_lists_to_strings (etype, expr); | |
3156 | ||
3157 | if (TREE_CODE (expr) == CONSTRUCTOR) | |
3158 | { | |
3159 | vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (expr); | |
3160 | unsigned last_nonzero = -1, i; | |
3161 | tree val; | |
3162 | ||
3163 | FOR_EACH_CONSTRUCTOR_VALUE (elts, i, val) | |
3164 | if (!initializer_zerop (val)) | |
3165 | last_nonzero = i; | |
3166 | ||
3167 | FOR_EACH_CONSTRUCTOR_VALUE (elts, i, val) | |
3168 | { | |
3169 | if (i > last_nonzero) | |
3170 | break; | |
3171 | write_expression (val); | |
3172 | } | |
3173 | } | |
3174 | else | |
3175 | { | |
3176 | gcc_assert (TREE_CODE (expr) == STRING_CST); | |
3177 | write_expression (expr); | |
3178 | } | |
2d847c18 | 3179 | } |
2d847c18 | 3180 | write_char ('E'); |
3181 | } | |
9c093b14 | 3182 | else if (code == LAMBDA_EXPR) |
3183 | { | |
3184 | /* [temp.over.link] Two lambda-expressions are never considered | |
3185 | equivalent. | |
3186 | ||
3187 | So just use the closure type mangling. */ | |
3188 | write_string ("tl"); | |
3189 | write_type (LAMBDA_EXPR_CLOSURE (expr)); | |
3190 | write_char ('E'); | |
3191 | } | |
2d847c18 | 3192 | else if (dependent_name (expr)) |
3193 | { | |
3194 | write_unqualified_id (dependent_name (expr)); | |
3195 | } | |
98eaf693 | 3196 | else |
3197 | { | |
17fdf85c | 3198 | normal_expr: |
e9b1be72 | 3199 | int i, len; |
e92154af | 3200 | const char *name; |
98eaf693 | 3201 | |
148e86d7 | 3202 | /* When we bind a variable or function to a non-type template |
3203 | argument with reference type, we create an ADDR_EXPR to show | |
3204 | the fact that the entity's address has been taken. But, we | |
3205 | don't actually want to output a mangling code for the `&'. */ | |
3206 | if (TREE_CODE (expr) == ADDR_EXPR | |
3207 | && TREE_TYPE (expr) | |
90ad495b | 3208 | && TYPE_REF_P (TREE_TYPE (expr))) |
e75e76ea | 3209 | { |
3210 | expr = TREE_OPERAND (expr, 0); | |
3211 | if (DECL_P (expr)) | |
3212 | { | |
3213 | write_expression (expr); | |
3214 | return; | |
3215 | } | |
148e86d7 | 3216 | |
e75e76ea | 3217 | code = TREE_CODE (expr); |
3218 | } | |
94302392 | 3219 | |
59280ded | 3220 | if (code == COMPONENT_REF) |
3221 | { | |
3222 | tree ob = TREE_OPERAND (expr, 0); | |
3223 | ||
3224 | if (TREE_CODE (ob) == ARROW_EXPR) | |
3225 | { | |
ca16a224 | 3226 | write_string (OVL_OP_INFO (false, code)->mangled_name); |
59280ded | 3227 | ob = TREE_OPERAND (ob, 0); |
dc66dd88 | 3228 | write_expression (ob); |
59280ded | 3229 | } |
dc66dd88 | 3230 | else if (!is_dummy_object (ob)) |
3231 | { | |
3232 | write_string ("dt"); | |
3233 | write_expression (ob); | |
3234 | } | |
3235 | /* else, for a non-static data member with no associated object (in | |
3236 | unevaluated context), use the unresolved-name mangling. */ | |
59280ded | 3237 | |
59280ded | 3238 | write_member_name (TREE_OPERAND (expr, 1)); |
3239 | return; | |
3240 | } | |
3241 | ||
98eaf693 | 3242 | /* If it wasn't any of those, recursively expand the expression. */ |
ca16a224 | 3243 | name = OVL_OP_INFO (false, code)->mangled_name; |
2d847c18 | 3244 | |
3245 | /* We used to mangle const_cast and static_cast like a C cast. */ | |
74b777e5 | 3246 | if (code == CONST_CAST_EXPR |
3247 | || code == STATIC_CAST_EXPR) | |
2d847c18 | 3248 | { |
229a58b1 | 3249 | if (abi_warn_or_compat_version_crosses (6)) |
74b777e5 | 3250 | G.need_abi_warning = 1; |
3251 | if (!abi_version_at_least (6)) | |
ca16a224 | 3252 | name = OVL_OP_INFO (false, CAST_EXPR)->mangled_name; |
2d847c18 | 3253 | } |
3254 | ||
e92154af | 3255 | if (name == NULL) |
3256 | { | |
c5d17c88 | 3257 | switch (code) |
3258 | { | |
3259 | case TRAIT_EXPR: | |
3260 | error ("use of built-in trait %qE in function signature; " | |
3261 | "use library traits instead", expr); | |
3262 | break; | |
3263 | ||
3264 | default: | |
3265 | sorry ("mangling %C", code); | |
3266 | break; | |
3267 | } | |
e92154af | 3268 | return; |
3269 | } | |
3270 | else | |
3271 | write_string (name); | |
98eaf693 | 3272 | |
ee95f490 | 3273 | switch (code) |
98eaf693 | 3274 | { |
653e5405 | 3275 | case CALL_EXPR: |
c6ac8f0e | 3276 | { |
3277 | tree fn = CALL_EXPR_FN (expr); | |
3278 | ||
3279 | if (TREE_CODE (fn) == ADDR_EXPR) | |
3280 | fn = TREE_OPERAND (fn, 0); | |
3281 | ||
3282 | /* Mangle a dependent name as the name, not whatever happens to | |
3283 | be the first function in the overload set. */ | |
3284 | if ((TREE_CODE (fn) == FUNCTION_DECL | |
3285 | || TREE_CODE (fn) == OVERLOAD) | |
3286 | && type_dependent_expression_p_push (expr)) | |
6767ca9a | 3287 | fn = OVL_NAME (fn); |
c6ac8f0e | 3288 | |
c44a7393 | 3289 | write_expression (fn); |
c6ac8f0e | 3290 | } |
3291 | ||
34eac767 | 3292 | for (i = 0; i < call_expr_nargs (expr); ++i) |
3293 | write_expression (CALL_EXPR_ARG (expr, i)); | |
3294 | write_char ('E'); | |
653e5405 | 3295 | break; |
33df020e | 3296 | |
ee95f490 | 3297 | case CAST_EXPR: |
3298 | write_type (TREE_TYPE (expr)); | |
e92154af | 3299 | if (list_length (TREE_OPERAND (expr, 0)) == 1) |
d6828f49 | 3300 | write_expression (TREE_VALUE (TREE_OPERAND (expr, 0))); |
e92154af | 3301 | else |
3302 | { | |
3303 | tree args = TREE_OPERAND (expr, 0); | |
3304 | write_char ('_'); | |
3305 | for (; args; args = TREE_CHAIN (args)) | |
3306 | write_expression (TREE_VALUE (args)); | |
3307 | write_char ('E'); | |
3308 | } | |
ee95f490 | 3309 | break; |
3310 | ||
2d847c18 | 3311 | case DYNAMIC_CAST_EXPR: |
3312 | case REINTERPRET_CAST_EXPR: | |
ee95f490 | 3313 | case STATIC_CAST_EXPR: |
3314 | case CONST_CAST_EXPR: | |
3315 | write_type (TREE_TYPE (expr)); | |
3316 | write_expression (TREE_OPERAND (expr, 0)); | |
3317 | break; | |
3318 | ||
2d847c18 | 3319 | case PREINCREMENT_EXPR: |
3320 | case PREDECREMENT_EXPR: | |
3321 | if (abi_version_at_least (6)) | |
3322 | write_char ('_'); | |
229a58b1 | 3323 | if (abi_warn_or_compat_version_crosses (6)) |
2d847c18 | 3324 | G.need_abi_warning = 1; |
3325 | /* Fall through. */ | |
e92154af | 3326 | |
ee95f490 | 3327 | default: |
e9b1be72 | 3328 | /* In the middle-end, some expressions have more operands than |
3329 | they do in templates (and mangling). */ | |
d558fa9c | 3330 | len = cp_tree_operand_length (expr); |
e9b1be72 | 3331 | |
3332 | for (i = 0; i < len; ++i) | |
716521b5 | 3333 | { |
3334 | tree operand = TREE_OPERAND (expr, i); | |
fbb01da7 | 3335 | /* As a GNU extension, the middle operand of a |
716521b5 | 3336 | conditional may be omitted. Since expression |
3337 | manglings are supposed to represent the input token | |
3338 | stream, there's no good way to mangle such an | |
3339 | expression without extending the C++ ABI. */ | |
3340 | if (code == COND_EXPR && i == 1 && !operand) | |
3341 | { | |
1e5fcbe2 | 3342 | error ("omitted middle operand to %<?:%> operand " |
716521b5 | 3343 | "cannot be mangled"); |
3344 | continue; | |
3345 | } | |
c09c7fa4 | 3346 | else if (FOLD_EXPR_P (expr)) |
3347 | { | |
3348 | /* The first 'operand' of a fold-expression is the operator | |
3349 | that it folds over. */ | |
3350 | if (i == 0) | |
3351 | { | |
3352 | int fcode = TREE_INT_CST_LOW (operand); | |
ca16a224 | 3353 | write_string (OVL_OP_INFO (false, fcode)->mangled_name); |
c09c7fa4 | 3354 | continue; |
3355 | } | |
3356 | else if (code == BINARY_LEFT_FOLD_EXPR) | |
3357 | { | |
3358 | /* The order of operands of the binary left and right | |
3359 | folds is the same, but we want to mangle them in | |
3360 | lexical order, i.e. non-pack first. */ | |
3361 | if (i == 1) | |
3362 | operand = FOLD_EXPR_INIT (expr); | |
3363 | else | |
3364 | operand = FOLD_EXPR_PACK (expr); | |
3365 | } | |
3366 | if (PACK_EXPANSION_P (operand)) | |
3367 | operand = PACK_EXPANSION_PATTERN (operand); | |
3368 | } | |
716521b5 | 3369 | write_expression (operand); |
3370 | } | |
98eaf693 | 3371 | } |
98eaf693 | 3372 | } |
3373 | } | |
3374 | ||
9031d10b | 3375 | /* Literal subcase of non-terminal <template-arg>. |
98eaf693 | 3376 | |
3377 | "Literal arguments, e.g. "A<42L>", are encoded with their type | |
3378 | and value. Negative integer values are preceded with "n"; for | |
3379 | example, "A<-42L>" becomes "1AILln42EE". The bool value false is | |
cc116129 | 3380 | encoded as 0, true as 1." */ |
98eaf693 | 3381 | |
3382 | static void | |
61e3d157 | 3383 | write_template_arg_literal (const tree value) |
98eaf693 | 3384 | { |
b11751dc | 3385 | if (TREE_CODE (value) == STRING_CST) |
3386 | /* Temporarily mangle strings as braced initializer lists. */ | |
3387 | write_string ("tl"); | |
3388 | else | |
3389 | write_char ('L'); | |
3390 | ||
3391 | tree valtype = TREE_TYPE (value); | |
3392 | write_type (valtype); | |
98eaf693 | 3393 | |
b5cdaa0b | 3394 | /* Write a null member pointer value as (type)0, regardless of its |
3395 | real representation. */ | |
3396 | if (null_member_pointer_value_p (value)) | |
3397 | write_integer_cst (integer_zero_node); | |
3398 | else | |
3399 | switch (TREE_CODE (value)) | |
3400 | { | |
3401 | case CONST_DECL: | |
3402 | write_integer_cst (DECL_INITIAL (value)); | |
3403 | break; | |
9031d10b | 3404 | |
b5cdaa0b | 3405 | case INTEGER_CST: |
3406 | gcc_assert (!same_type_p (TREE_TYPE (value), boolean_type_node) | |
3407 | || integer_zerop (value) || integer_onep (value)); | |
3408 | write_integer_cst (value); | |
3409 | break; | |
092b1d6f | 3410 | |
b5cdaa0b | 3411 | case REAL_CST: |
3412 | write_real_cst (value); | |
3413 | break; | |
98eaf693 | 3414 | |
193dc72f | 3415 | case COMPLEX_CST: |
3416 | if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST | |
3417 | && TREE_CODE (TREE_IMAGPART (value)) == INTEGER_CST) | |
3418 | { | |
3419 | write_integer_cst (TREE_REALPART (value)); | |
3420 | write_char ('_'); | |
3421 | write_integer_cst (TREE_IMAGPART (value)); | |
3422 | } | |
3423 | else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST | |
3424 | && TREE_CODE (TREE_IMAGPART (value)) == REAL_CST) | |
3425 | { | |
3426 | write_real_cst (TREE_REALPART (value)); | |
3427 | write_char ('_'); | |
3428 | write_real_cst (TREE_IMAGPART (value)); | |
3429 | } | |
3430 | else | |
3431 | gcc_unreachable (); | |
3432 | break; | |
3433 | ||
b5cdaa0b | 3434 | case STRING_CST: |
b11751dc | 3435 | { |
3436 | /* Mangle strings the same as braced initializer lists. */ | |
3437 | unsigned n = TREE_STRING_LENGTH (value); | |
3438 | const char *str = TREE_STRING_POINTER (value); | |
3439 | ||
3440 | /* Count the number of trailing nuls and subtract them from | |
3441 | STRSIZE because they don't need to be mangled. */ | |
3442 | for (const char *p = str + n - 1; ; --p) | |
3443 | { | |
3444 | if (*p || p == str) | |
3445 | { | |
3446 | n -= str + n - !!*p - p; | |
3447 | break; | |
3448 | } | |
3449 | } | |
3450 | tree eltype = TREE_TYPE (valtype); | |
3451 | for (const char *p = str; n--; ++p) | |
3452 | { | |
3453 | write_char ('L'); | |
3454 | write_type (eltype); | |
3455 | write_unsigned_number (*(const unsigned char*)p); | |
3456 | write_string ("E"); | |
3457 | } | |
3458 | break; | |
3459 | } | |
99fddf6e | 3460 | |
b5cdaa0b | 3461 | default: |
3462 | gcc_unreachable (); | |
3463 | } | |
9031d10b | 3464 | |
98eaf693 | 3465 | write_char ('E'); |
3466 | } | |
3467 | ||
9031d10b | 3468 | /* Non-terminal <template-arg>. |
98eaf693 | 3469 | |
653e5405 | 3470 | <template-arg> ::= <type> # type |
3471 | ::= L <type> </value/ number> E # literal | |
3472 | ::= LZ <name> E # external name | |
3473 | ::= X <expression> E # expression */ | |
98eaf693 | 3474 | |
3475 | static void | |
61e3d157 | 3476 | write_template_arg (tree node) |
98eaf693 | 3477 | { |
3478 | enum tree_code code = TREE_CODE (node); | |
3479 | ||
3480 | MANGLE_TRACE_TREE ("template-arg", node); | |
3481 | ||
a5268b2f | 3482 | /* A template template parameter's argument list contains TREE_LIST |
dfea972c | 3483 | nodes of which the value field is the actual argument. */ |
98eaf693 | 3484 | if (code == TREE_LIST) |
3485 | { | |
3486 | node = TREE_VALUE (node); | |
3487 | /* If it's a decl, deal with its type instead. */ | |
3488 | if (DECL_P (node)) | |
3489 | { | |
3490 | node = TREE_TYPE (node); | |
3491 | code = TREE_CODE (node); | |
3492 | } | |
3493 | } | |
9031d10b | 3494 | |
95f798aa | 3495 | if (template_parm_object_p (node)) |
3496 | /* We want to mangle the argument, not the var we stored it in. */ | |
3497 | node = DECL_INITIAL (node); | |
3498 | ||
44677b54 | 3499 | /* Strip a conversion added by convert_nontype_argument. */ |
3500 | if (TREE_CODE (node) == IMPLICIT_CONV_EXPR) | |
3501 | node = TREE_OPERAND (node, 0); | |
80fe9b6a | 3502 | if (REFERENCE_REF_P (node)) |
3503 | node = TREE_OPERAND (node, 0); | |
25f4fc1e | 3504 | if (TREE_CODE (node) == NOP_EXPR |
90ad495b | 3505 | && TYPE_REF_P (TREE_TYPE (node))) |
25f4fc1e | 3506 | { |
3507 | /* Template parameters can be of reference type. To maintain | |
3508 | internal consistency, such arguments use a conversion from | |
3509 | address of object to reference type. */ | |
b4df430b | 3510 | gcc_assert (TREE_CODE (TREE_OPERAND (node, 0)) == ADDR_EXPR); |
f591db9a | 3511 | node = TREE_OPERAND (TREE_OPERAND (node, 0), 0); |
25f4fc1e | 3512 | } |
98eaf693 | 3513 | |
2d847c18 | 3514 | if (TREE_CODE (node) == BASELINK |
3515 | && !type_unknown_p (node)) | |
3516 | { | |
3517 | if (abi_version_at_least (6)) | |
3518 | node = BASELINK_FUNCTIONS (node); | |
229a58b1 | 3519 | if (abi_warn_or_compat_version_crosses (6)) |
2d847c18 | 3520 | /* We wrongly wrapped a class-scope function in X/E. */ |
3521 | G.need_abi_warning = 1; | |
3522 | } | |
3523 | ||
d95d815d | 3524 | if (ARGUMENT_PACK_P (node)) |
3525 | { | |
3526 | /* Expand the template argument pack. */ | |
3527 | tree args = ARGUMENT_PACK_ARGS (node); | |
3528 | int i, length = TREE_VEC_LENGTH (args); | |
2d847c18 | 3529 | if (abi_version_at_least (6)) |
3530 | write_char ('J'); | |
3531 | else | |
74b777e5 | 3532 | write_char ('I'); |
229a58b1 | 3533 | if (abi_warn_or_compat_version_crosses (6)) |
74b777e5 | 3534 | G.need_abi_warning = 1; |
d95d815d | 3535 | for (i = 0; i < length; ++i) |
3536 | write_template_arg (TREE_VEC_ELT (args, i)); | |
4682b6fe | 3537 | write_char ('E'); |
d95d815d | 3538 | } |
3539 | else if (TYPE_P (node)) | |
98eaf693 | 3540 | write_type (node); |
3541 | else if (code == TEMPLATE_DECL) | |
3542 | /* A template appearing as a template arg is a template template arg. */ | |
3543 | write_template_template_arg (node); | |
ce45a448 | 3544 | else if ((TREE_CODE_CLASS (code) == tcc_constant && code != PTRMEM_CST) |
f591db9a | 3545 | || code == CONST_DECL |
b5cdaa0b | 3546 | || null_member_pointer_value_p (node)) |
d5f9419c | 3547 | write_template_arg_literal (node); |
98eaf693 | 3548 | else if (DECL_P (node)) |
3549 | { | |
3550 | write_char ('L'); | |
f10ff0e0 | 3551 | /* Until ABI version 3, the underscore before the mangled name |
3552 | was incorrectly omitted. */ | |
3553 | if (!abi_version_at_least (3)) | |
74b777e5 | 3554 | write_char ('Z'); |
f10ff0e0 | 3555 | else |
3556 | write_string ("_Z"); | |
229a58b1 | 3557 | if (abi_warn_or_compat_version_crosses (3)) |
74b777e5 | 3558 | G.need_abi_warning = 1; |
98eaf693 | 3559 | write_encoding (node); |
3560 | write_char ('E'); | |
3561 | } | |
98eaf693 | 3562 | else |
3563 | { | |
3564 | /* Template arguments may be expressions. */ | |
3565 | write_char ('X'); | |
3566 | write_expression (node); | |
3567 | write_char ('E'); | |
3568 | } | |
3569 | } | |
3570 | ||
3571 | /* <template-template-arg> | |
3572 | ::= <name> | |
3573 | ::= <substitution> */ | |
3574 | ||
9140e457 | 3575 | static void |
61e3d157 | 3576 | write_template_template_arg (const tree decl) |
98eaf693 | 3577 | { |
3578 | MANGLE_TRACE_TREE ("template-template-arg", decl); | |
3579 | ||
3580 | if (find_substitution (decl)) | |
3581 | return; | |
bbb9efab | 3582 | write_name (decl, /*ignore_local_scope=*/0); |
98eaf693 | 3583 | add_substitution (decl); |
3584 | } | |
3585 | ||
3586 | ||
9031d10b | 3587 | /* Non-terminal <array-type>. TYPE is an ARRAY_TYPE. |
98eaf693 | 3588 | |
9031d10b | 3589 | <array-type> ::= A [</dimension/ number>] _ </element/ type> |
653e5405 | 3590 | ::= A <expression> _ </element/ type> |
98eaf693 | 3591 | |
3592 | "Array types encode the dimension (number of elements) and the | |
6b94e133 | 3593 | element type. For variable length arrays, the dimension (but not |
3594 | the '_' separator) is omitted." | |
3595 | Note that for flexible array members, like for other arrays of | |
3596 | unspecified size, the dimension is also omitted. */ | |
98eaf693 | 3597 | |
61e3d157 | 3598 | static void |
3599 | write_array_type (const tree type) | |
98eaf693 | 3600 | { |
3601 | write_char ('A'); | |
3602 | if (TYPE_DOMAIN (type)) | |
3603 | { | |
3604 | tree index_type; | |
98eaf693 | 3605 | |
3606 | index_type = TYPE_DOMAIN (type); | |
6b94e133 | 3607 | /* The INDEX_TYPE gives the upper and lower bounds of the array. |
3608 | It's null for flexible array members which have no upper bound | |
3609 | (this is a change from GCC 5 and prior where such members were | |
3610 | incorrectly mangled as zero-length arrays). */ | |
3611 | if (tree max = TYPE_MAX_VALUE (index_type)) | |
f753592a | 3612 | { |
6b94e133 | 3613 | if (TREE_CODE (max) == INTEGER_CST) |
3614 | { | |
3615 | /* The ABI specifies that we should mangle the number of | |
3616 | elements in the array, not the largest allowed index. */ | |
3617 | offset_int wmax = wi::to_offset (max) + 1; | |
3618 | /* Truncate the result - this will mangle [0, SIZE_INT_MAX] | |
3619 | number of elements as zero. */ | |
3620 | wmax = wi::zext (wmax, TYPE_PRECISION (TREE_TYPE (max))); | |
3621 | gcc_assert (wi::fits_uhwi_p (wmax)); | |
3622 | write_unsigned_number (wmax.to_uhwi ()); | |
3623 | } | |
3624 | else | |
3625 | { | |
3626 | max = TREE_OPERAND (max, 0); | |
3627 | write_expression (max); | |
3628 | } | |
1cd6548d | 3629 | } |
98eaf693 | 3630 | } |
3631 | write_char ('_'); | |
3632 | write_type (TREE_TYPE (type)); | |
3633 | } | |
3634 | ||
3635 | /* Non-terminal <pointer-to-member-type> for pointer-to-member | |
3636 | variables. TYPE is a pointer-to-member POINTER_TYPE. | |
3637 | ||
3638 | <pointer-to-member-type> ::= M </class/ type> </member/ type> */ | |
3639 | ||
3640 | static void | |
61e3d157 | 3641 | write_pointer_to_member_type (const tree type) |
98eaf693 | 3642 | { |
3643 | write_char ('M'); | |
58274fe8 | 3644 | write_type (TYPE_PTRMEM_CLASS_TYPE (type)); |
98eaf693 | 3645 | write_type (TYPE_PTRMEM_POINTED_TO_TYPE (type)); |
3646 | } | |
3647 | ||
3648 | /* Non-terminal <template-param>. PARM is a TEMPLATE_TYPE_PARM, | |
1e93ca27 | 3649 | TEMPLATE_TEMPLATE_PARM, BOUND_TEMPLATE_TEMPLATE_PARM or a |
3650 | TEMPLATE_PARM_INDEX. | |
98eaf693 | 3651 | |
ef4534a3 | 3652 | <template-param> ::= T </parameter/ number> _ */ |
98eaf693 | 3653 | |
3654 | static void | |
61e3d157 | 3655 | write_template_param (const tree parm) |
98eaf693 | 3656 | { |
3657 | int parm_index; | |
3658 | ||
3659 | MANGLE_TRACE_TREE ("template-parm", parm); | |
3660 | ||
3661 | switch (TREE_CODE (parm)) | |
3662 | { | |
3663 | case TEMPLATE_TYPE_PARM: | |
3664 | case TEMPLATE_TEMPLATE_PARM: | |
1e93ca27 | 3665 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
98eaf693 | 3666 | parm_index = TEMPLATE_TYPE_IDX (parm); |
3667 | break; | |
3668 | ||
3669 | case TEMPLATE_PARM_INDEX: | |
3670 | parm_index = TEMPLATE_PARM_IDX (parm); | |
3671 | break; | |
3672 | ||
3673 | default: | |
092b1d6f | 3674 | gcc_unreachable (); |
98eaf693 | 3675 | } |
3676 | ||
3677 | write_char ('T'); | |
3678 | /* NUMBER as it appears in the mangling is (-1)-indexed, with the | |
3679 | earliest template param denoted by `_'. */ | |
a8b75081 | 3680 | write_compact_number (parm_index); |
98eaf693 | 3681 | } |
3682 | ||
3683 | /* <template-template-param> | |
653e5405 | 3684 | ::= <template-param> |
98eaf693 | 3685 | ::= <substitution> */ |
3686 | ||
3687 | static void | |
61e3d157 | 3688 | write_template_template_param (const tree parm) |
98eaf693 | 3689 | { |
607a5d68 | 3690 | tree templ = NULL_TREE; |
98eaf693 | 3691 | |
3692 | /* PARM, a TEMPLATE_TEMPLATE_PARM, is an instantiation of the | |
3693 | template template parameter. The substitution candidate here is | |
3694 | only the template. */ | |
1e93ca27 | 3695 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) |
98eaf693 | 3696 | { |
607a5d68 | 3697 | templ |
98eaf693 | 3698 | = TI_TEMPLATE (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm)); |
607a5d68 | 3699 | if (find_substitution (templ)) |
98eaf693 | 3700 | return; |
3701 | } | |
3702 | ||
3703 | /* <template-param> encodes only the template parameter position, | |
3704 | not its template arguments, which is fine here. */ | |
3705 | write_template_param (parm); | |
607a5d68 | 3706 | if (templ) |
3707 | add_substitution (templ); | |
98eaf693 | 3708 | } |
3709 | ||
9031d10b | 3710 | /* Non-terminal <substitution>. |
98eaf693 | 3711 | |
3712 | <substitution> ::= S <seq-id> _ | |
653e5405 | 3713 | ::= S_ */ |
98eaf693 | 3714 | |
3715 | static void | |
61e3d157 | 3716 | write_substitution (const int seq_id) |
98eaf693 | 3717 | { |
3718 | MANGLE_TRACE ("substitution", ""); | |
3719 | ||
3720 | write_char ('S'); | |
3721 | if (seq_id > 0) | |
e75e76ea | 3722 | write_number (seq_id - 1, /*unsigned=*/1, 36); |
98eaf693 | 3723 | write_char ('_'); |
3724 | } | |
3725 | ||
18f2b9d5 | 3726 | /* Start mangling ENTITY. */ |
98eaf693 | 3727 | |
3728 | static inline void | |
dfecde36 | 3729 | start_mangling (const tree entity) |
98eaf693 | 3730 | { |
18f2b9d5 | 3731 | G.entity = entity; |
3732 | G.need_abi_warning = false; | |
40e2decb | 3733 | G.need_cxx17_warning = false; |
dfecde36 | 3734 | obstack_free (&name_obstack, name_base); |
3735 | mangle_obstack = &name_obstack; | |
3736 | name_base = obstack_alloc (&name_obstack, 0); | |
98eaf693 | 3737 | } |
3738 | ||
dfecde36 | 3739 | /* Done with mangling. If WARN is true, and the name of G.entity will |
3740 | be mangled differently in a future version of the ABI, issue a | |
3741 | warning. */ | |
98eaf693 | 3742 | |
dfecde36 | 3743 | static void |
74b777e5 | 3744 | finish_mangling_internal (void) |
98eaf693 | 3745 | { |
3746 | /* Clear all the substitutions. */ | |
f1f41a6c | 3747 | vec_safe_truncate (G.substitutions, 0); |
98eaf693 | 3748 | |
3749 | /* Null-terminate the string. */ | |
3750 | write_char ('\0'); | |
dfecde36 | 3751 | } |
3752 | ||
98eaf693 | 3753 | |
dfecde36 | 3754 | /* Like finish_mangling_internal, but return the mangled string. */ |
3755 | ||
3756 | static inline const char * | |
74b777e5 | 3757 | finish_mangling (void) |
dfecde36 | 3758 | { |
74b777e5 | 3759 | finish_mangling_internal (); |
f13b585c | 3760 | return (const char *) obstack_finish (mangle_obstack); |
98eaf693 | 3761 | } |
3762 | ||
dfecde36 | 3763 | /* Like finish_mangling_internal, but return an identifier. */ |
3764 | ||
3765 | static tree | |
74b777e5 | 3766 | finish_mangling_get_identifier (void) |
dfecde36 | 3767 | { |
74b777e5 | 3768 | finish_mangling_internal (); |
dfecde36 | 3769 | /* Don't obstack_finish here, and the next start_mangling will |
3770 | remove the identifier. */ | |
4cd09d28 | 3771 | return get_identifier ((const char *) obstack_base (mangle_obstack)); |
dfecde36 | 3772 | } |
3773 | ||
98eaf693 | 3774 | /* Initialize data structures for mangling. */ |
3775 | ||
3776 | void | |
eb32e911 | 3777 | init_mangle (void) |
98eaf693 | 3778 | { |
f13b585c | 3779 | gcc_obstack_init (&name_obstack); |
3780 | name_base = obstack_alloc (&name_obstack, 0); | |
f1f41a6c | 3781 | vec_alloc (G.substitutions, 0); |
98eaf693 | 3782 | |
3783 | /* Cache these identifiers for quick comparison when checking for | |
3784 | standard substitutions. */ | |
3785 | subst_identifiers[SUBID_ALLOCATOR] = get_identifier ("allocator"); | |
3786 | subst_identifiers[SUBID_BASIC_STRING] = get_identifier ("basic_string"); | |
3787 | subst_identifiers[SUBID_CHAR_TRAITS] = get_identifier ("char_traits"); | |
3788 | subst_identifiers[SUBID_BASIC_ISTREAM] = get_identifier ("basic_istream"); | |
3789 | subst_identifiers[SUBID_BASIC_OSTREAM] = get_identifier ("basic_ostream"); | |
3790 | subst_identifiers[SUBID_BASIC_IOSTREAM] = get_identifier ("basic_iostream"); | |
3791 | } | |
3792 | ||
3793 | /* Generate the mangled name of DECL. */ | |
3794 | ||
dfecde36 | 3795 | static tree |
61e3d157 | 3796 | mangle_decl_string (const tree decl) |
98eaf693 | 3797 | { |
dfecde36 | 3798 | tree result; |
df63172d | 3799 | location_t saved_loc = input_location; |
3800 | tree saved_fn = NULL_TREE; | |
3801 | bool template_p = false; | |
3802 | ||
97de3401 | 3803 | /* We shouldn't be trying to mangle an uninstantiated template. */ |
3804 | gcc_assert (!type_dependent_expression_p (decl)); | |
3805 | ||
df63172d | 3806 | if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl)) |
3807 | { | |
3808 | struct tinst_level *tl = current_instantiation (); | |
f5cb81c6 | 3809 | if ((!tl || tl->maybe_get_node () != decl) |
6ba663d6 | 3810 | && push_tinst_level (decl)) |
df63172d | 3811 | { |
3812 | template_p = true; | |
3813 | saved_fn = current_function_decl; | |
df63172d | 3814 | current_function_decl = NULL_TREE; |
3815 | } | |
3816 | } | |
3817 | input_location = DECL_SOURCE_LOCATION (decl); | |
98eaf693 | 3818 | |
dfecde36 | 3819 | start_mangling (decl); |
98eaf693 | 3820 | |
3821 | if (TREE_CODE (decl) == TYPE_DECL) | |
3822 | write_type (TREE_TYPE (decl)); | |
3823 | else | |
1da3f78a | 3824 | write_mangled_name (decl, true); |
9031d10b | 3825 | |
74b777e5 | 3826 | result = finish_mangling_get_identifier (); |
98eaf693 | 3827 | if (DEBUG_MANGLE) |
dfecde36 | 3828 | fprintf (stderr, "mangle_decl_string = '%s'\n\n", |
3829 | IDENTIFIER_POINTER (result)); | |
df63172d | 3830 | |
3831 | if (template_p) | |
3832 | { | |
3833 | pop_tinst_level (); | |
3834 | current_function_decl = saved_fn; | |
3835 | } | |
3836 | input_location = saved_loc; | |
3837 | ||
98eaf693 | 3838 | return result; |
3839 | } | |
3840 | ||
3e5c885b | 3841 | /* Return an identifier for the external mangled name of DECL. */ |
3842 | ||
3843 | static tree | |
3844 | get_mangled_id (tree decl) | |
3845 | { | |
3846 | tree id = mangle_decl_string (decl); | |
3847 | return targetm.mangle_decl_assembler_name (decl, id); | |
3848 | } | |
3849 | ||
98eaf693 | 3850 | /* Create an identifier for the external mangled name of DECL. */ |
3851 | ||
7e64c604 | 3852 | void |
61e3d157 | 3853 | mangle_decl (const tree decl) |
98eaf693 | 3854 | { |
71d3f205 | 3855 | tree id; |
3856 | bool dep; | |
3857 | ||
3858 | /* Don't bother mangling uninstantiated templates. */ | |
3859 | ++processing_template_decl; | |
3860 | if (TREE_CODE (decl) == TYPE_DECL) | |
3861 | dep = dependent_type_p (TREE_TYPE (decl)); | |
3862 | else | |
3863 | dep = (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl) | |
3864 | && any_dependent_template_arguments_p (DECL_TI_ARGS (decl))); | |
3865 | --processing_template_decl; | |
3866 | if (dep) | |
3867 | return; | |
3868 | ||
960a5573 | 3869 | /* During LTO we keep mangled names of TYPE_DECLs for ODR type merging. |
3870 | It is not needed to assign names to anonymous namespace, but we use the | |
3871 | "<anon>" marker to be able to tell if type is C++ ODR type or type | |
3872 | produced by other language. */ | |
3873 | if (TREE_CODE (decl) == TYPE_DECL | |
3874 | && TYPE_STUB_DECL (TREE_TYPE (decl)) | |
3875 | && !TREE_PUBLIC (TYPE_STUB_DECL (TREE_TYPE (decl)))) | |
3876 | id = get_identifier ("<anon>"); | |
3877 | else | |
3878 | { | |
3879 | gcc_assert (TREE_CODE (decl) != TYPE_DECL | |
3880 | || !no_linkage_check (TREE_TYPE (decl), true)); | |
f67cece7 | 3881 | if (abi_version_at_least (10)) |
3882 | if (tree fn = decl_function_context (decl)) | |
3883 | maybe_check_abi_tags (fn, decl); | |
960a5573 | 3884 | id = get_mangled_id (decl); |
3885 | } | |
97a424bc | 3886 | SET_DECL_ASSEMBLER_NAME (decl, id); |
20009fe3 | 3887 | |
40e2decb | 3888 | if (G.need_cxx17_warning |
a08fc382 | 3889 | && (TREE_PUBLIC (decl) || DECL_REALLY_EXTERN (decl))) |
957a727b | 3890 | warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wnoexcept_type, |
2e9e9363 | 3891 | "mangled name for %qD will change in C++17 because the " |
3892 | "exception specification is part of a function type", | |
3893 | decl); | |
3894 | ||
6ad47359 | 3895 | if (id != DECL_NAME (decl) |
fb5491a0 | 3896 | /* Don't do this for a fake symbol we aren't going to emit anyway. */ |
a1d8686f | 3897 | && TREE_CODE (decl) != TYPE_DECL |
c6e04fca | 3898 | && !DECL_MAYBE_IN_CHARGE_CDTOR_P (decl)) |
20009fe3 | 3899 | { |
c6b4d6c1 | 3900 | int save_ver = flag_abi_version; |
3901 | tree id2 = NULL_TREE; | |
6ad47359 | 3902 | |
c6b4d6c1 | 3903 | if (!DECL_REALLY_EXTERN (decl)) |
6ad47359 | 3904 | { |
e845448c | 3905 | record_mangling (decl, G.need_abi_warning); |
6ad47359 | 3906 | |
c6b4d6c1 | 3907 | if (!G.need_abi_warning) |
3908 | return; | |
20009fe3 | 3909 | |
c6b4d6c1 | 3910 | flag_abi_version = flag_abi_compat_version; |
3911 | id2 = mangle_decl_string (decl); | |
3912 | id2 = targetm.mangle_decl_assembler_name (decl, id2); | |
3913 | flag_abi_version = save_ver; | |
20009fe3 | 3914 | |
c6b4d6c1 | 3915 | if (id2 != id) |
3916 | note_mangling_alias (decl, id2); | |
3917 | } | |
74b777e5 | 3918 | |
3919 | if (warn_abi) | |
3920 | { | |
8c41abe8 | 3921 | const char fabi_version[] = "-fabi-version"; |
3922 | ||
c6b4d6c1 | 3923 | if (flag_abi_compat_version != warn_abi_version |
3924 | || id2 == NULL_TREE) | |
229a58b1 | 3925 | { |
3926 | flag_abi_version = warn_abi_version; | |
3927 | id2 = mangle_decl_string (decl); | |
3928 | id2 = targetm.mangle_decl_assembler_name (decl, id2); | |
3929 | } | |
a5b4465c | 3930 | flag_abi_version = save_ver; |
229a58b1 | 3931 | |
3932 | if (id2 == id) | |
3933 | /* OK. */; | |
3934 | else if (warn_abi_version != 0 | |
3935 | && abi_version_at_least (warn_abi_version)) | |
66ed189d | 3936 | warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi, |
3937 | "the mangled name of %qD changed between " | |
8c41abe8 | 3938 | "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)", |
3939 | G.entity, fabi_version, warn_abi_version, id2, | |
3940 | fabi_version, save_ver, id); | |
74b777e5 | 3941 | else |
66ed189d | 3942 | warning_at (DECL_SOURCE_LOCATION (G.entity), OPT_Wabi, |
3943 | "the mangled name of %qD changes between " | |
8c41abe8 | 3944 | "%<%s=%d%> (%qD) and %<%s=%d%> (%qD)", |
3945 | G.entity, fabi_version, save_ver, id, | |
3946 | fabi_version, warn_abi_version, id2); | |
74b777e5 | 3947 | } |
3948 | ||
229a58b1 | 3949 | flag_abi_version = save_ver; |
a03f54f4 | 3950 | } |
98eaf693 | 3951 | } |
3952 | ||
ec46af50 | 3953 | /* Generate the mangled representation of TYPE. */ |
98eaf693 | 3954 | |
3955 | const char * | |
ec46af50 | 3956 | mangle_type_string (const tree type) |
98eaf693 | 3957 | { |
3958 | const char *result; | |
3959 | ||
dfecde36 | 3960 | start_mangling (type); |
98eaf693 | 3961 | write_type (type); |
74b777e5 | 3962 | result = finish_mangling (); |
98eaf693 | 3963 | if (DEBUG_MANGLE) |
3964 | fprintf (stderr, "mangle_type_string = '%s'\n\n", result); | |
3965 | return result; | |
3966 | } | |
3967 | ||
98eaf693 | 3968 | /* Create an identifier for the mangled name of a special component |
3969 | for belonging to TYPE. CODE is the ABI-specified code for this | |
3970 | component. */ | |
3971 | ||
3972 | static tree | |
61e3d157 | 3973 | mangle_special_for_type (const tree type, const char *code) |
98eaf693 | 3974 | { |
dfecde36 | 3975 | tree result; |
98eaf693 | 3976 | |
3977 | /* We don't have an actual decl here for the special component, so | |
3978 | we can't just process the <encoded-name>. Instead, fake it. */ | |
dfecde36 | 3979 | start_mangling (type); |
98eaf693 | 3980 | |
3981 | /* Start the mangling. */ | |
3982 | write_string ("_Z"); | |
3983 | write_string (code); | |
3984 | ||
3985 | /* Add the type. */ | |
3986 | write_type (type); | |
74b777e5 | 3987 | result = finish_mangling_get_identifier (); |
98eaf693 | 3988 | |
3989 | if (DEBUG_MANGLE) | |
dfecde36 | 3990 | fprintf (stderr, "mangle_special_for_type = %s\n\n", |
3991 | IDENTIFIER_POINTER (result)); | |
98eaf693 | 3992 | |
dfecde36 | 3993 | return result; |
98eaf693 | 3994 | } |
3995 | ||
3996 | /* Create an identifier for the mangled representation of the typeinfo | |
3997 | structure for TYPE. */ | |
3998 | ||
3999 | tree | |
61e3d157 | 4000 | mangle_typeinfo_for_type (const tree type) |
98eaf693 | 4001 | { |
4002 | return mangle_special_for_type (type, "TI"); | |
4003 | } | |
4004 | ||
4005 | /* Create an identifier for the mangled name of the NTBS containing | |
4006 | the mangled name of TYPE. */ | |
4007 | ||
4008 | tree | |
61e3d157 | 4009 | mangle_typeinfo_string_for_type (const tree type) |
98eaf693 | 4010 | { |
4011 | return mangle_special_for_type (type, "TS"); | |
4012 | } | |
4013 | ||
4014 | /* Create an identifier for the mangled name of the vtable for TYPE. */ | |
4015 | ||
4016 | tree | |
61e3d157 | 4017 | mangle_vtbl_for_type (const tree type) |
98eaf693 | 4018 | { |
4019 | return mangle_special_for_type (type, "TV"); | |
4020 | } | |
4021 | ||
4022 | /* Returns an identifier for the mangled name of the VTT for TYPE. */ | |
4023 | ||
4024 | tree | |
61e3d157 | 4025 | mangle_vtt_for_type (const tree type) |
98eaf693 | 4026 | { |
4027 | return mangle_special_for_type (type, "TT"); | |
4028 | } | |
4029 | ||
a6f4466c | 4030 | /* Returns an identifier for the mangled name of the decomposition |
4031 | artificial variable DECL. DECLS is the vector of the VAR_DECLs | |
4032 | for the identifier-list. */ | |
4033 | ||
4034 | tree | |
4035 | mangle_decomp (const tree decl, vec<tree> &decls) | |
4036 | { | |
4037 | gcc_assert (!type_dependent_expression_p (decl)); | |
4038 | ||
4039 | location_t saved_loc = input_location; | |
4040 | input_location = DECL_SOURCE_LOCATION (decl); | |
4041 | ||
4042 | start_mangling (decl); | |
4043 | write_string ("_Z"); | |
4044 | ||
4045 | tree context = decl_mangling_context (decl); | |
4046 | gcc_assert (context != NULL_TREE); | |
4047 | ||
4048 | bool nested = false; | |
4049 | if (DECL_NAMESPACE_STD_P (context)) | |
4050 | write_string ("St"); | |
4051 | else if (context != global_namespace) | |
4052 | { | |
4053 | nested = true; | |
4054 | write_char ('N'); | |
4055 | write_prefix (decl_mangling_context (decl)); | |
4056 | } | |
4057 | ||
4058 | write_string ("DC"); | |
4059 | unsigned int i; | |
4060 | tree d; | |
4061 | FOR_EACH_VEC_ELT (decls, i, d) | |
4062 | write_unqualified_name (d); | |
4063 | write_char ('E'); | |
4064 | ||
4065 | if (nested) | |
4066 | write_char ('E'); | |
4067 | ||
4068 | tree id = finish_mangling_get_identifier (); | |
4069 | if (DEBUG_MANGLE) | |
4070 | fprintf (stderr, "mangle_decomp = '%s'\n\n", | |
4071 | IDENTIFIER_POINTER (id)); | |
4072 | ||
4073 | input_location = saved_loc; | |
4074 | return id; | |
4075 | } | |
4076 | ||
98eaf693 | 4077 | /* Return an identifier for a construction vtable group. TYPE is |
4078 | the most derived class in the hierarchy; BINFO is the base | |
9031d10b | 4079 | subobject for which this construction vtable group will be used. |
98eaf693 | 4080 | |
4081 | This mangling isn't part of the ABI specification; in the ABI | |
4082 | specification, the vtable group is dumped in the same COMDAT as the | |
4083 | main vtable, and is referenced only from that vtable, so it doesn't | |
4084 | need an external name. For binary formats without COMDAT sections, | |
9031d10b | 4085 | though, we need external names for the vtable groups. |
98eaf693 | 4086 | |
4087 | We use the production | |
4088 | ||
4089 | <special-name> ::= CT <type> <offset number> _ <base type> */ | |
4090 | ||
4091 | tree | |
61e3d157 | 4092 | mangle_ctor_vtbl_for_type (const tree type, const tree binfo) |
98eaf693 | 4093 | { |
dfecde36 | 4094 | tree result; |
98eaf693 | 4095 | |
dfecde36 | 4096 | start_mangling (type); |
98eaf693 | 4097 | |
4098 | write_string ("_Z"); | |
4099 | write_string ("TC"); | |
4100 | write_type (type); | |
4101 | write_integer_cst (BINFO_OFFSET (binfo)); | |
4102 | write_char ('_'); | |
4103 | write_type (BINFO_TYPE (binfo)); | |
4104 | ||
74b777e5 | 4105 | result = finish_mangling_get_identifier (); |
98eaf693 | 4106 | if (DEBUG_MANGLE) |
dfecde36 | 4107 | fprintf (stderr, "mangle_ctor_vtbl_for_type = %s\n\n", |
4108 | IDENTIFIER_POINTER (result)); | |
4109 | return result; | |
98eaf693 | 4110 | } |
4111 | ||
805e22b2 | 4112 | /* Mangle a this pointer or result pointer adjustment. |
9031d10b | 4113 | |
805e22b2 | 4114 | <call-offset> ::= h <fixed offset number> _ |
4115 | ::= v <fixed offset number> _ <virtual offset number> _ */ | |
9031d10b | 4116 | |
805e22b2 | 4117 | static void |
61e3d157 | 4118 | mangle_call_offset (const tree fixed_offset, const tree virtual_offset) |
805e22b2 | 4119 | { |
71b1859a | 4120 | write_char (virtual_offset ? 'v' : 'h'); |
98eaf693 | 4121 | |
805e22b2 | 4122 | /* For either flavor, write the fixed offset. */ |
4123 | write_integer_cst (fixed_offset); | |
4124 | write_char ('_'); | |
4125 | ||
4126 | /* For a virtual thunk, add the virtual offset. */ | |
4127 | if (virtual_offset) | |
4128 | { | |
4129 | write_integer_cst (virtual_offset); | |
4130 | write_char ('_'); | |
4131 | } | |
4132 | } | |
4133 | ||
4134 | /* Return an identifier for the mangled name of a this-adjusting or | |
4135 | covariant thunk to FN_DECL. FIXED_OFFSET is the initial adjustment | |
4136 | to this used to find the vptr. If VIRTUAL_OFFSET is non-NULL, this | |
4137 | is a virtual thunk, and it is the vtbl offset in | |
f1d555e3 | 4138 | bytes. THIS_ADJUSTING is nonzero for a this adjusting thunk and |
805e22b2 | 4139 | zero for a covariant thunk. Note, that FN_DECL might be a covariant |
4140 | thunk itself. A covariant thunk name always includes the adjustment | |
4141 | for the this pointer, even if there is none. | |
4142 | ||
4143 | <special-name> ::= T <call-offset> <base encoding> | |
653e5405 | 4144 | ::= Tc <this_adjust call-offset> <result_adjust call-offset> |
074ab442 | 4145 | <base encoding> */ |
98eaf693 | 4146 | |
4147 | tree | |
61e3d157 | 4148 | mangle_thunk (tree fn_decl, const int this_adjusting, tree fixed_offset, |
a4a311c3 | 4149 | tree virtual_offset, tree thunk) |
98eaf693 | 4150 | { |
dfecde36 | 4151 | tree result; |
9031d10b | 4152 | |
a4a311c3 | 4153 | if (abi_version_at_least (11)) |
4154 | maybe_check_abi_tags (fn_decl, thunk, 11); | |
4155 | ||
dfecde36 | 4156 | start_mangling (fn_decl); |
98eaf693 | 4157 | |
4158 | write_string ("_Z"); | |
98eaf693 | 4159 | write_char ('T'); |
9031d10b | 4160 | |
71b1859a | 4161 | if (!this_adjusting) |
805e22b2 | 4162 | { |
4163 | /* Covariant thunk with no this adjustment */ | |
4164 | write_char ('c'); | |
4165 | mangle_call_offset (integer_zero_node, NULL_TREE); | |
4166 | mangle_call_offset (fixed_offset, virtual_offset); | |
4167 | } | |
71b1859a | 4168 | else if (!DECL_THUNK_P (fn_decl)) |
4169 | /* Plain this adjusting thunk. */ | |
4170 | mangle_call_offset (fixed_offset, virtual_offset); | |
98eaf693 | 4171 | else |
98eaf693 | 4172 | { |
805e22b2 | 4173 | /* This adjusting thunk to covariant thunk. */ |
4174 | write_char ('c'); | |
4175 | mangle_call_offset (fixed_offset, virtual_offset); | |
71b1859a | 4176 | fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn_decl)); |
4177 | virtual_offset = THUNK_VIRTUAL_OFFSET (fn_decl); | |
4178 | if (virtual_offset) | |
4179 | virtual_offset = BINFO_VPTR_FIELD (virtual_offset); | |
4180 | mangle_call_offset (fixed_offset, virtual_offset); | |
4181 | fn_decl = THUNK_TARGET (fn_decl); | |
98eaf693 | 4182 | } |
4183 | ||
4184 | /* Scoped name. */ | |
4185 | write_encoding (fn_decl); | |
4186 | ||
74b777e5 | 4187 | result = finish_mangling_get_identifier (); |
98eaf693 | 4188 | if (DEBUG_MANGLE) |
dfecde36 | 4189 | fprintf (stderr, "mangle_thunk = %s\n\n", IDENTIFIER_POINTER (result)); |
4190 | return result; | |
98eaf693 | 4191 | } |
4192 | ||
b2c95551 | 4193 | /* Handle ABI backwards compatibility for past bugs where we didn't call |
4194 | check_abi_tags in places where it's needed: call check_abi_tags and warn if | |
f67cece7 | 4195 | it makes a difference. If FOR_DECL is non-null, it's the declaration |
4196 | that we're actually trying to mangle; if it's null, we're mangling the | |
4197 | guard variable for T. */ | |
b2c95551 | 4198 | |
4199 | static void | |
a4a311c3 | 4200 | maybe_check_abi_tags (tree t, tree for_decl, int ver) |
b2c95551 | 4201 | { |
f67cece7 | 4202 | if (DECL_ASSEMBLER_NAME_SET_P (t)) |
4203 | return; | |
4204 | ||
b795d0cb | 4205 | tree oldtags = get_abi_tags (t); |
b2c95551 | 4206 | |
f67cece7 | 4207 | mangle_decl (t); |
b2c95551 | 4208 | |
b795d0cb | 4209 | tree newtags = get_abi_tags (t); |
4210 | if (newtags && newtags != oldtags | |
a4a311c3 | 4211 | && abi_version_crosses (ver)) |
f67cece7 | 4212 | { |
a4a311c3 | 4213 | if (for_decl && DECL_THUNK_P (for_decl)) |
4214 | warning_at (DECL_SOURCE_LOCATION (t), OPT_Wabi, | |
4215 | "the mangled name of a thunk for %qD changes between " | |
2f6d557f | 4216 | "%<-fabi-version=%d%> and %<-fabi-version=%d%>", |
a4a311c3 | 4217 | t, flag_abi_version, warn_abi_version); |
4218 | else if (for_decl) | |
f67cece7 | 4219 | warning_at (DECL_SOURCE_LOCATION (for_decl), OPT_Wabi, |
4220 | "the mangled name of %qD changes between " | |
2f6d557f | 4221 | "%<-fabi-version=%d%> and %<-fabi-version=%d%>", |
f67cece7 | 4222 | for_decl, flag_abi_version, warn_abi_version); |
4223 | else | |
4224 | warning_at (DECL_SOURCE_LOCATION (t), OPT_Wabi, | |
67af79be | 4225 | "the mangled name of the initialization guard variable " |
2f6d557f | 4226 | "for %qD changes between %<-fabi-version=%d%> and " |
4227 | "%<-fabi-version=%d%>", | |
f67cece7 | 4228 | t, flag_abi_version, warn_abi_version); |
4229 | } | |
b2c95551 | 4230 | } |
4231 | ||
462819c8 | 4232 | /* Write out the appropriate string for this variable when generating |
4233 | another mangled name based on this one. */ | |
98eaf693 | 4234 | |
462819c8 | 4235 | static void |
4236 | write_guarded_var_name (const tree variable) | |
98eaf693 | 4237 | { |
580d697f | 4238 | if (DECL_NAME (variable) |
4239 | && strncmp (IDENTIFIER_POINTER (DECL_NAME (variable)), "_ZGR", 4) == 0) | |
ca106ab1 | 4240 | /* The name of a guard variable for a reference temporary should refer |
4241 | to the reference, not the temporary. */ | |
4242 | write_string (IDENTIFIER_POINTER (DECL_NAME (variable)) + 4); | |
4243 | else | |
f67cece7 | 4244 | write_name (variable, /*ignore_local_scope=*/0); |
462819c8 | 4245 | } |
4246 | ||
4247 | /* Return an identifier for the name of an initialization guard | |
4248 | variable for indicated VARIABLE. */ | |
4249 | ||
4250 | tree | |
4251 | mangle_guard_variable (const tree variable) | |
4252 | { | |
f67cece7 | 4253 | if (abi_version_at_least (10)) |
4254 | maybe_check_abi_tags (variable); | |
462819c8 | 4255 | start_mangling (variable); |
4256 | write_string ("_ZGV"); | |
4257 | write_guarded_var_name (variable); | |
74b777e5 | 4258 | return finish_mangling_get_identifier (); |
462819c8 | 4259 | } |
4260 | ||
4261 | /* Return an identifier for the name of a thread_local initialization | |
4262 | function for VARIABLE. */ | |
4263 | ||
4264 | tree | |
4265 | mangle_tls_init_fn (const tree variable) | |
4266 | { | |
e1c52611 | 4267 | check_abi_tags (variable); |
462819c8 | 4268 | start_mangling (variable); |
4269 | write_string ("_ZTH"); | |
4270 | write_guarded_var_name (variable); | |
74b777e5 | 4271 | return finish_mangling_get_identifier (); |
462819c8 | 4272 | } |
4273 | ||
4274 | /* Return an identifier for the name of a thread_local wrapper | |
4275 | function for VARIABLE. */ | |
4276 | ||
4277 | #define TLS_WRAPPER_PREFIX "_ZTW" | |
4278 | ||
4279 | tree | |
4280 | mangle_tls_wrapper_fn (const tree variable) | |
4281 | { | |
e1c52611 | 4282 | check_abi_tags (variable); |
462819c8 | 4283 | start_mangling (variable); |
4284 | write_string (TLS_WRAPPER_PREFIX); | |
4285 | write_guarded_var_name (variable); | |
74b777e5 | 4286 | return finish_mangling_get_identifier (); |
98eaf693 | 4287 | } |
47fc2356 | 4288 | |
462819c8 | 4289 | /* Return true iff FN is a thread_local wrapper function. */ |
4290 | ||
4291 | bool | |
4292 | decl_tls_wrapper_p (const tree fn) | |
4293 | { | |
4294 | if (TREE_CODE (fn) != FUNCTION_DECL) | |
4295 | return false; | |
4296 | tree name = DECL_NAME (fn); | |
4297 | return strncmp (IDENTIFIER_POINTER (name), TLS_WRAPPER_PREFIX, | |
4298 | strlen (TLS_WRAPPER_PREFIX)) == 0; | |
4299 | } | |
4300 | ||
ca106ab1 | 4301 | /* Return an identifier for the name of a temporary variable used to |
8c89c5fc | 4302 | initialize a static reference. This is now part of the ABI. */ |
c7b89256 | 4303 | |
ca106ab1 | 4304 | tree |
61e3d157 | 4305 | mangle_ref_init_variable (const tree variable) |
ca106ab1 | 4306 | { |
dfecde36 | 4307 | start_mangling (variable); |
ca106ab1 | 4308 | write_string ("_ZGR"); |
b2c95551 | 4309 | check_abi_tags (variable); |
ca106ab1 | 4310 | write_name (variable, /*ignore_local_scope=*/0); |
c7b89256 | 4311 | /* Avoid name clashes with aggregate initialization of multiple |
4312 | references at once. */ | |
8c89c5fc | 4313 | write_compact_number (current_ref_temp_count++); |
74b777e5 | 4314 | return finish_mangling_get_identifier (); |
ca106ab1 | 4315 | } |
95f798aa | 4316 | |
4317 | /* Return an identifier for the mangled name of a C++20 template parameter | |
4318 | object for template argument EXPR. */ | |
4319 | ||
4320 | tree | |
4321 | mangle_template_parm_object (tree expr) | |
4322 | { | |
4323 | start_mangling (expr); | |
4324 | write_string ("_ZTAX"); | |
4325 | write_expression (expr); | |
4326 | write_char ('E'); | |
4327 | return finish_mangling_get_identifier (); | |
4328 | } | |
47fc2356 | 4329 | \f |
b710ec85 | 4330 | /* Given a CLASS_TYPE, such as a record for std::bad_exception this |
4331 | function generates a mangled name for the vtable map variable of | |
4332 | the class type. For example, if the class type is | |
4333 | "std::bad_exception", the mangled name for the class is | |
4334 | "St13bad_exception". This function would generate the name | |
4335 | "_ZN4_VTVISt13bad_exceptionE12__vtable_mapE", which unmangles as: | |
4336 | "_VTV<std::bad_exception>::__vtable_map". */ | |
4337 | ||
4338 | ||
4339 | char * | |
4340 | get_mangled_vtable_map_var_name (tree class_type) | |
4341 | { | |
4342 | char *var_name = NULL; | |
4343 | const char *prefix = "_ZN4_VTVI"; | |
4344 | const char *postfix = "E12__vtable_mapE"; | |
4345 | ||
4346 | gcc_assert (TREE_CODE (class_type) == RECORD_TYPE); | |
4347 | ||
4348 | tree class_id = DECL_ASSEMBLER_NAME (TYPE_NAME (class_type)); | |
68a98a70 | 4349 | |
4350 | if (strstr (IDENTIFIER_POINTER (class_id), "<anon>") != NULL) | |
4351 | { | |
4352 | class_id = get_mangled_id (TYPE_NAME (class_type)); | |
4353 | vtbl_register_mangled_name (TYPE_NAME (class_type), class_id); | |
4354 | } | |
4355 | ||
b710ec85 | 4356 | unsigned int len = strlen (IDENTIFIER_POINTER (class_id)) + |
4357 | strlen (prefix) + | |
4358 | strlen (postfix) + 1; | |
4359 | ||
4360 | var_name = (char *) xmalloc (len); | |
4361 | ||
4362 | sprintf (var_name, "%s%s%s", prefix, IDENTIFIER_POINTER (class_id), postfix); | |
4363 | ||
4364 | return var_name; | |
4365 | } | |
4366 | ||
652c3635 | 4367 | #include "gt-cp-mangle.h" |