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