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