Commit | Line | Data |
---|---|---|
de17c821 | 1 | /* Helper routines for C++ support in GDB. |
61baf725 | 2 | Copyright (C) 2002-2017 Free Software Foundation, Inc. |
de17c821 DJ |
3 | |
4 | Contributed by MontaVista Software. | |
5 | ||
6 | This file is part of GDB. | |
7 | ||
8 | This program is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 10 | the Free Software Foundation; either version 3 of the License, or |
de17c821 DJ |
11 | (at your option) any later version. |
12 | ||
13 | This program is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 19 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
de17c821 DJ |
20 | |
21 | #include "defs.h" | |
22 | #include "cp-support.h" | |
de17c821 | 23 | #include "demangle.h" |
9219021c | 24 | #include "gdbcmd.h" |
b6429628 DC |
25 | #include "dictionary.h" |
26 | #include "objfiles.h" | |
27 | #include "frame.h" | |
28 | #include "symtab.h" | |
29 | #include "block.h" | |
b2a7f303 | 30 | #include "complaints.h" |
362ff856 | 31 | #include "gdbtypes.h" |
12907978 KS |
32 | #include "expression.h" |
33 | #include "value.h" | |
c4aeac85 | 34 | #include "cp-abi.h" |
22cee43f | 35 | #include "namespace.h" |
992c7d70 | 36 | #include <signal.h> |
173981bc | 37 | #include "gdb_setjmp.h" |
f88e9fd3 DJ |
38 | #include "safe-ctype.h" |
39 | ||
fb4c6eba DJ |
40 | #define d_left(dc) (dc)->u.s_binary.left |
41 | #define d_right(dc) (dc)->u.s_binary.right | |
b2a7f303 | 42 | |
fb4c6eba | 43 | /* Functions related to demangled name parsing. */ |
b2a7f303 DC |
44 | |
45 | static unsigned int cp_find_first_component_aux (const char *name, | |
46 | int permissive); | |
47 | ||
48 | static void demangled_name_complaint (const char *name); | |
b6429628 DC |
49 | |
50 | /* Functions/variables related to overload resolution. */ | |
51 | ||
7322dca9 | 52 | static int sym_return_val_size = -1; |
b6429628 DC |
53 | static int sym_return_val_index; |
54 | static struct symbol **sym_return_val; | |
55 | ||
8d577d32 DC |
56 | static void overload_list_add_symbol (struct symbol *sym, |
57 | const char *oload_name); | |
58 | ||
59 | static void make_symbol_overload_list_using (const char *func_name, | |
fe978cb0 | 60 | const char *the_namespace); |
8d577d32 DC |
61 | |
62 | static void make_symbol_overload_list_qualified (const char *func_name); | |
63 | ||
9219021c DC |
64 | /* The list of "maint cplus" commands. */ |
65 | ||
5c4e30ca | 66 | struct cmd_list_element *maint_cplus_cmd_list = NULL; |
9219021c | 67 | |
3a93a0c2 KS |
68 | /* A list of typedefs which should not be substituted by replace_typedefs. */ |
69 | static const char * const ignore_typedefs[] = | |
70 | { | |
71 | "std::istream", "std::iostream", "std::ostream", "std::string" | |
72 | }; | |
73 | ||
74 | static void | |
75 | replace_typedefs (struct demangle_parse_info *info, | |
2621e0fd TT |
76 | struct demangle_component *ret_comp, |
77 | canonicalization_ftype *finder, | |
78 | void *data); | |
3a93a0c2 KS |
79 | |
80 | /* A convenience function to copy STRING into OBSTACK, returning a pointer | |
81 | to the newly allocated string and saving the number of bytes saved in LEN. | |
82 | ||
83 | It does not copy the terminating '\0' byte! */ | |
84 | ||
85 | static char * | |
86 | copy_string_to_obstack (struct obstack *obstack, const char *string, | |
87 | long *len) | |
88 | { | |
89 | *len = strlen (string); | |
224c3ddb | 90 | return (char *) obstack_copy (obstack, string, *len); |
3a93a0c2 KS |
91 | } |
92 | ||
f88e9fd3 DJ |
93 | /* Return 1 if STRING is clearly already in canonical form. This |
94 | function is conservative; things which it does not recognize are | |
95 | assumed to be non-canonical, and the parser will sort them out | |
96 | afterwards. This speeds up the critical path for alphanumeric | |
97 | identifiers. */ | |
98 | ||
99 | static int | |
100 | cp_already_canonical (const char *string) | |
101 | { | |
102 | /* Identifier start character [a-zA-Z_]. */ | |
103 | if (!ISIDST (string[0])) | |
104 | return 0; | |
105 | ||
106 | /* These are the only two identifiers which canonicalize to other | |
107 | than themselves or an error: unsigned -> unsigned int and | |
108 | signed -> int. */ | |
109 | if (string[0] == 'u' && strcmp (&string[1], "nsigned") == 0) | |
110 | return 0; | |
111 | else if (string[0] == 's' && strcmp (&string[1], "igned") == 0) | |
112 | return 0; | |
113 | ||
114 | /* Identifier character [a-zA-Z0-9_]. */ | |
115 | while (ISIDNUM (string[1])) | |
116 | string++; | |
117 | ||
118 | if (string[1] == '\0') | |
119 | return 1; | |
120 | else | |
121 | return 0; | |
122 | } | |
9219021c | 123 | |
3a93a0c2 KS |
124 | /* Inspect the given RET_COMP for its type. If it is a typedef, |
125 | replace the node with the typedef's tree. | |
126 | ||
127 | Returns 1 if any typedef substitutions were made, 0 otherwise. */ | |
128 | ||
129 | static int | |
130 | inspect_type (struct demangle_parse_info *info, | |
2621e0fd TT |
131 | struct demangle_component *ret_comp, |
132 | canonicalization_ftype *finder, | |
133 | void *data) | |
3a93a0c2 KS |
134 | { |
135 | int i; | |
136 | char *name; | |
137 | struct symbol *sym; | |
3a93a0c2 KS |
138 | |
139 | /* Copy the symbol's name from RET_COMP and look it up | |
140 | in the symbol table. */ | |
141 | name = (char *) alloca (ret_comp->u.s_name.len + 1); | |
142 | memcpy (name, ret_comp->u.s_name.s, ret_comp->u.s_name.len); | |
143 | name[ret_comp->u.s_name.len] = '\0'; | |
144 | ||
145 | /* Ignore any typedefs that should not be substituted. */ | |
146 | for (i = 0; i < ARRAY_SIZE (ignore_typedefs); ++i) | |
147 | { | |
148 | if (strcmp (name, ignore_typedefs[i]) == 0) | |
149 | return 0; | |
150 | } | |
151 | ||
152 | sym = NULL; | |
3a93a0c2 | 153 | |
492d29ea PA |
154 | TRY |
155 | { | |
d12307c1 | 156 | sym = lookup_symbol (name, 0, VAR_DOMAIN, 0).symbol; |
492d29ea PA |
157 | } |
158 | CATCH (except, RETURN_MASK_ALL) | |
159 | { | |
160 | return 0; | |
161 | } | |
162 | END_CATCH | |
163 | ||
164 | if (sym != NULL) | |
3a93a0c2 KS |
165 | { |
166 | struct type *otype = SYMBOL_TYPE (sym); | |
167 | ||
2621e0fd TT |
168 | if (finder != NULL) |
169 | { | |
170 | const char *new_name = (*finder) (otype, data); | |
171 | ||
172 | if (new_name != NULL) | |
173 | { | |
174 | ret_comp->u.s_name.s = new_name; | |
175 | ret_comp->u.s_name.len = strlen (new_name); | |
176 | return 1; | |
177 | } | |
178 | ||
179 | return 0; | |
180 | } | |
181 | ||
74921315 KS |
182 | /* If the type is a typedef or namespace alias, replace it. */ |
183 | if (TYPE_CODE (otype) == TYPE_CODE_TYPEDEF | |
184 | || TYPE_CODE (otype) == TYPE_CODE_NAMESPACE) | |
3a93a0c2 KS |
185 | { |
186 | long len; | |
187 | int is_anon; | |
188 | struct type *type; | |
c8b23b3f | 189 | std::unique_ptr<demangle_parse_info> i; |
3a93a0c2 KS |
190 | |
191 | /* Get the real type of the typedef. */ | |
192 | type = check_typedef (otype); | |
193 | ||
74921315 KS |
194 | /* If the symbol is a namespace and its type name is no different |
195 | than the name we looked up, this symbol is not a namespace | |
196 | alias and does not need to be substituted. */ | |
197 | if (TYPE_CODE (otype) == TYPE_CODE_NAMESPACE | |
198 | && strcmp (TYPE_NAME (type), name) == 0) | |
199 | return 0; | |
200 | ||
3a93a0c2 KS |
201 | is_anon = (TYPE_TAG_NAME (type) == NULL |
202 | && (TYPE_CODE (type) == TYPE_CODE_ENUM | |
203 | || TYPE_CODE (type) == TYPE_CODE_STRUCT | |
204 | || TYPE_CODE (type) == TYPE_CODE_UNION)); | |
205 | if (is_anon) | |
206 | { | |
207 | struct type *last = otype; | |
208 | ||
209 | /* Find the last typedef for the type. */ | |
210 | while (TYPE_TARGET_TYPE (last) != NULL | |
211 | && (TYPE_CODE (TYPE_TARGET_TYPE (last)) | |
212 | == TYPE_CODE_TYPEDEF)) | |
213 | last = TYPE_TARGET_TYPE (last); | |
214 | ||
215 | /* If there is only one typedef for this anonymous type, | |
216 | do not substitute it. */ | |
217 | if (type == otype) | |
218 | return 0; | |
219 | else | |
220 | /* Use the last typedef seen as the type for this | |
221 | anonymous type. */ | |
222 | type = last; | |
223 | } | |
224 | ||
d7e74731 | 225 | string_file buf; |
492d29ea | 226 | TRY |
d7e74731 PA |
227 | { |
228 | type_print (type, "", &buf, -1); | |
229 | } | |
3a93a0c2 KS |
230 | /* If type_print threw an exception, there is little point |
231 | in continuing, so just bow out gracefully. */ | |
492d29ea | 232 | CATCH (except, RETURN_MASK_ERROR) |
3a93a0c2 | 233 | { |
3a93a0c2 KS |
234 | return 0; |
235 | } | |
492d29ea | 236 | END_CATCH |
3a93a0c2 | 237 | |
d7e74731 PA |
238 | len = buf.size (); |
239 | name = (char *) obstack_copy0 (&info->obstack, buf.c_str (), len); | |
3a93a0c2 KS |
240 | |
241 | /* Turn the result into a new tree. Note that this | |
242 | tree will contain pointers into NAME, so NAME cannot | |
243 | be free'd until all typedef conversion is done and | |
244 | the final result is converted into a string. */ | |
245 | i = cp_demangled_name_to_comp (name, NULL); | |
246 | if (i != NULL) | |
247 | { | |
248 | /* Merge the two trees. */ | |
c8b23b3f | 249 | cp_merge_demangle_parse_infos (info, ret_comp, i.get ()); |
3a93a0c2 KS |
250 | |
251 | /* Replace any newly introduced typedefs -- but not | |
252 | if the type is anonymous (that would lead to infinite | |
253 | looping). */ | |
254 | if (!is_anon) | |
2621e0fd | 255 | replace_typedefs (info, ret_comp, finder, data); |
3a93a0c2 KS |
256 | } |
257 | else | |
258 | { | |
259 | /* This shouldn't happen unless the type printer has | |
260 | output something that the name parser cannot grok. | |
261 | Nonetheless, an ounce of prevention... | |
262 | ||
263 | Canonicalize the name again, and store it in the | |
264 | current node (RET_COMP). */ | |
2f408ecb | 265 | std::string canon = cp_canonicalize_string_no_typedefs (name); |
3a93a0c2 | 266 | |
2f408ecb | 267 | if (!canon.empty ()) |
3a93a0c2 | 268 | { |
2f408ecb PA |
269 | /* Copy the canonicalization into the obstack. */ |
270 | name = copy_string_to_obstack (&info->obstack, canon.c_str (), &len); | |
3a93a0c2 KS |
271 | } |
272 | ||
273 | ret_comp->u.s_name.s = name; | |
274 | ret_comp->u.s_name.len = len; | |
275 | } | |
276 | ||
277 | return 1; | |
278 | } | |
279 | } | |
280 | ||
281 | return 0; | |
282 | } | |
283 | ||
284 | /* Replace any typedefs appearing in the qualified name | |
285 | (DEMANGLE_COMPONENT_QUAL_NAME) represented in RET_COMP for the name parse | |
286 | given in INFO. */ | |
287 | ||
288 | static void | |
289 | replace_typedefs_qualified_name (struct demangle_parse_info *info, | |
2621e0fd TT |
290 | struct demangle_component *ret_comp, |
291 | canonicalization_ftype *finder, | |
292 | void *data) | |
3a93a0c2 | 293 | { |
d7e74731 | 294 | string_file buf; |
3a93a0c2 KS |
295 | struct demangle_component *comp = ret_comp; |
296 | ||
297 | /* Walk each node of the qualified name, reconstructing the name of | |
298 | this element. With every node, check for any typedef substitutions. | |
299 | If a substitution has occurred, replace the qualified name node | |
300 | with a DEMANGLE_COMPONENT_NAME node representing the new, typedef- | |
301 | substituted name. */ | |
302 | while (comp->type == DEMANGLE_COMPONENT_QUAL_NAME) | |
303 | { | |
304 | if (d_left (comp)->type == DEMANGLE_COMPONENT_NAME) | |
305 | { | |
fe978cb0 | 306 | struct demangle_component newobj; |
3a93a0c2 | 307 | |
d7e74731 | 308 | buf.write (d_left (comp)->u.s_name.s, d_left (comp)->u.s_name.len); |
fe978cb0 | 309 | newobj.type = DEMANGLE_COMPONENT_NAME; |
29592bde PA |
310 | newobj.u.s_name.s |
311 | = (char *) obstack_copy0 (&info->obstack, | |
312 | buf.c_str (), buf.size ()); | |
313 | newobj.u.s_name.len = buf.size (); | |
fe978cb0 | 314 | if (inspect_type (info, &newobj, finder, data)) |
3a93a0c2 | 315 | { |
29592bde | 316 | char *s; |
3a93a0c2 KS |
317 | long slen; |
318 | ||
319 | /* A typedef was substituted in NEW. Convert it to a | |
320 | string and replace the top DEMANGLE_COMPONENT_QUAL_NAME | |
321 | node. */ | |
322 | ||
d7e74731 | 323 | buf.clear (); |
29592bde PA |
324 | gdb::unique_xmalloc_ptr<char> n |
325 | = cp_comp_to_string (&newobj, 100); | |
3a93a0c2 KS |
326 | if (n == NULL) |
327 | { | |
328 | /* If something went astray, abort typedef substitutions. */ | |
3a93a0c2 KS |
329 | return; |
330 | } | |
331 | ||
29592bde | 332 | s = copy_string_to_obstack (&info->obstack, n.get (), &slen); |
3a93a0c2 KS |
333 | |
334 | d_left (ret_comp)->type = DEMANGLE_COMPONENT_NAME; | |
335 | d_left (ret_comp)->u.s_name.s = s; | |
336 | d_left (ret_comp)->u.s_name.len = slen; | |
337 | d_right (ret_comp) = d_right (comp); | |
338 | comp = ret_comp; | |
339 | continue; | |
340 | } | |
341 | } | |
342 | else | |
343 | { | |
344 | /* The current node is not a name, so simply replace any | |
345 | typedefs in it. Then print it to the stream to continue | |
346 | checking for more typedefs in the tree. */ | |
2621e0fd | 347 | replace_typedefs (info, d_left (comp), finder, data); |
29592bde PA |
348 | gdb::unique_xmalloc_ptr<char> name |
349 | = cp_comp_to_string (d_left (comp), 100); | |
3a93a0c2 KS |
350 | if (name == NULL) |
351 | { | |
352 | /* If something went astray, abort typedef substitutions. */ | |
3a93a0c2 KS |
353 | return; |
354 | } | |
29592bde | 355 | buf.puts (name.get ()); |
3a93a0c2 | 356 | } |
2621e0fd | 357 | |
d7e74731 | 358 | buf.write ("::", 2); |
3a93a0c2 KS |
359 | comp = d_right (comp); |
360 | } | |
361 | ||
362 | /* If the next component is DEMANGLE_COMPONENT_NAME, save the qualified | |
363 | name assembled above and append the name given by COMP. Then use this | |
364 | reassembled name to check for a typedef. */ | |
365 | ||
366 | if (comp->type == DEMANGLE_COMPONENT_NAME) | |
367 | { | |
d7e74731 | 368 | buf.write (comp->u.s_name.s, comp->u.s_name.len); |
3a93a0c2 KS |
369 | |
370 | /* Replace the top (DEMANGLE_COMPONENT_QUAL_NAME) node | |
371 | with a DEMANGLE_COMPONENT_NAME node containing the whole | |
372 | name. */ | |
373 | ret_comp->type = DEMANGLE_COMPONENT_NAME; | |
29592bde PA |
374 | ret_comp->u.s_name.s |
375 | = (char *) obstack_copy0 (&info->obstack, | |
376 | buf.c_str (), buf.size ()); | |
377 | ret_comp->u.s_name.len = buf.size (); | |
2621e0fd | 378 | inspect_type (info, ret_comp, finder, data); |
3a93a0c2 KS |
379 | } |
380 | else | |
2621e0fd | 381 | replace_typedefs (info, comp, finder, data); |
3a93a0c2 KS |
382 | } |
383 | ||
384 | ||
385 | /* A function to check const and volatile qualifiers for argument types. | |
386 | ||
387 | "Parameter declarations that differ only in the presence | |
388 | or absence of `const' and/or `volatile' are equivalent." | |
389 | C++ Standard N3290, clause 13.1.3 #4. */ | |
390 | ||
391 | static void | |
392 | check_cv_qualifiers (struct demangle_component *ret_comp) | |
393 | { | |
394 | while (d_left (ret_comp) != NULL | |
395 | && (d_left (ret_comp)->type == DEMANGLE_COMPONENT_CONST | |
396 | || d_left (ret_comp)->type == DEMANGLE_COMPONENT_VOLATILE)) | |
397 | { | |
398 | d_left (ret_comp) = d_left (d_left (ret_comp)); | |
399 | } | |
400 | } | |
401 | ||
402 | /* Walk the parse tree given by RET_COMP, replacing any typedefs with | |
403 | their basic types. */ | |
404 | ||
405 | static void | |
406 | replace_typedefs (struct demangle_parse_info *info, | |
2621e0fd TT |
407 | struct demangle_component *ret_comp, |
408 | canonicalization_ftype *finder, | |
409 | void *data) | |
3a93a0c2 KS |
410 | { |
411 | if (ret_comp) | |
412 | { | |
2621e0fd TT |
413 | if (finder != NULL |
414 | && (ret_comp->type == DEMANGLE_COMPONENT_NAME | |
415 | || ret_comp->type == DEMANGLE_COMPONENT_QUAL_NAME | |
416 | || ret_comp->type == DEMANGLE_COMPONENT_TEMPLATE | |
417 | || ret_comp->type == DEMANGLE_COMPONENT_BUILTIN_TYPE)) | |
418 | { | |
29592bde PA |
419 | gdb::unique_xmalloc_ptr<char> local_name |
420 | = cp_comp_to_string (ret_comp, 10); | |
2621e0fd TT |
421 | |
422 | if (local_name != NULL) | |
423 | { | |
492d29ea | 424 | struct symbol *sym = NULL; |
2621e0fd TT |
425 | |
426 | sym = NULL; | |
492d29ea | 427 | TRY |
2621e0fd | 428 | { |
29592bde PA |
429 | sym = lookup_symbol (local_name.get (), 0, |
430 | VAR_DOMAIN, 0).symbol; | |
2621e0fd | 431 | } |
492d29ea PA |
432 | CATCH (except, RETURN_MASK_ALL) |
433 | { | |
434 | } | |
435 | END_CATCH | |
436 | ||
492d29ea | 437 | if (sym != NULL) |
2621e0fd TT |
438 | { |
439 | struct type *otype = SYMBOL_TYPE (sym); | |
440 | const char *new_name = (*finder) (otype, data); | |
441 | ||
442 | if (new_name != NULL) | |
443 | { | |
444 | ret_comp->type = DEMANGLE_COMPONENT_NAME; | |
445 | ret_comp->u.s_name.s = new_name; | |
446 | ret_comp->u.s_name.len = strlen (new_name); | |
447 | return; | |
448 | } | |
449 | } | |
450 | } | |
451 | } | |
452 | ||
3a93a0c2 KS |
453 | switch (ret_comp->type) |
454 | { | |
455 | case DEMANGLE_COMPONENT_ARGLIST: | |
456 | check_cv_qualifiers (ret_comp); | |
457 | /* Fall through */ | |
458 | ||
459 | case DEMANGLE_COMPONENT_FUNCTION_TYPE: | |
460 | case DEMANGLE_COMPONENT_TEMPLATE: | |
461 | case DEMANGLE_COMPONENT_TEMPLATE_ARGLIST: | |
462 | case DEMANGLE_COMPONENT_TYPED_NAME: | |
2621e0fd TT |
463 | replace_typedefs (info, d_left (ret_comp), finder, data); |
464 | replace_typedefs (info, d_right (ret_comp), finder, data); | |
3a93a0c2 KS |
465 | break; |
466 | ||
467 | case DEMANGLE_COMPONENT_NAME: | |
2621e0fd | 468 | inspect_type (info, ret_comp, finder, data); |
3a93a0c2 KS |
469 | break; |
470 | ||
471 | case DEMANGLE_COMPONENT_QUAL_NAME: | |
2621e0fd | 472 | replace_typedefs_qualified_name (info, ret_comp, finder, data); |
3a93a0c2 KS |
473 | break; |
474 | ||
475 | case DEMANGLE_COMPONENT_LOCAL_NAME: | |
476 | case DEMANGLE_COMPONENT_CTOR: | |
477 | case DEMANGLE_COMPONENT_ARRAY_TYPE: | |
478 | case DEMANGLE_COMPONENT_PTRMEM_TYPE: | |
2621e0fd | 479 | replace_typedefs (info, d_right (ret_comp), finder, data); |
3a93a0c2 KS |
480 | break; |
481 | ||
482 | case DEMANGLE_COMPONENT_CONST: | |
483 | case DEMANGLE_COMPONENT_RESTRICT: | |
484 | case DEMANGLE_COMPONENT_VOLATILE: | |
485 | case DEMANGLE_COMPONENT_VOLATILE_THIS: | |
486 | case DEMANGLE_COMPONENT_CONST_THIS: | |
487 | case DEMANGLE_COMPONENT_RESTRICT_THIS: | |
488 | case DEMANGLE_COMPONENT_POINTER: | |
489 | case DEMANGLE_COMPONENT_REFERENCE: | |
e4347c89 | 490 | case DEMANGLE_COMPONENT_RVALUE_REFERENCE: |
2621e0fd | 491 | replace_typedefs (info, d_left (ret_comp), finder, data); |
3a93a0c2 KS |
492 | break; |
493 | ||
494 | default: | |
495 | break; | |
496 | } | |
497 | } | |
498 | } | |
499 | ||
2f408ecb PA |
500 | /* Parse STRING and convert it to canonical form, resolving any |
501 | typedefs. If parsing fails, or if STRING is already canonical, | |
502 | return the empty string. Otherwise return the canonical form. If | |
503 | FINDER is not NULL, then type components are passed to FINDER to be | |
504 | looked up. DATA is passed verbatim to FINDER. */ | |
3a93a0c2 | 505 | |
2f408ecb | 506 | std::string |
2621e0fd TT |
507 | cp_canonicalize_string_full (const char *string, |
508 | canonicalization_ftype *finder, | |
509 | void *data) | |
3a93a0c2 | 510 | { |
2f408ecb | 511 | std::string ret; |
3a93a0c2 | 512 | unsigned int estimated_len; |
c8b23b3f | 513 | std::unique_ptr<demangle_parse_info> info; |
3a93a0c2 | 514 | |
3a93a0c2 KS |
515 | estimated_len = strlen (string) * 2; |
516 | info = cp_demangled_name_to_comp (string, NULL); | |
517 | if (info != NULL) | |
518 | { | |
519 | /* Replace all the typedefs in the tree. */ | |
c8b23b3f | 520 | replace_typedefs (info.get (), info->tree, finder, data); |
3a93a0c2 KS |
521 | |
522 | /* Convert the tree back into a string. */ | |
29592bde PA |
523 | gdb::unique_xmalloc_ptr<char> us = cp_comp_to_string (info->tree, |
524 | estimated_len); | |
e88e8651 | 525 | gdb_assert (us); |
3a93a0c2 | 526 | |
e88e8651 | 527 | ret = us.get (); |
3a93a0c2 KS |
528 | /* Finally, compare the original string with the computed |
529 | name, returning NULL if they are the same. */ | |
2f408ecb PA |
530 | if (ret == string) |
531 | return std::string (); | |
3a93a0c2 KS |
532 | } |
533 | ||
534 | return ret; | |
535 | } | |
536 | ||
2621e0fd TT |
537 | /* Like cp_canonicalize_string_full, but always passes NULL for |
538 | FINDER. */ | |
539 | ||
2f408ecb | 540 | std::string |
2621e0fd TT |
541 | cp_canonicalize_string_no_typedefs (const char *string) |
542 | { | |
543 | return cp_canonicalize_string_full (string, NULL, NULL); | |
544 | } | |
545 | ||
f88e9fd3 | 546 | /* Parse STRING and convert it to canonical form. If parsing fails, |
2f408ecb PA |
547 | or if STRING is already canonical, return the empty string. |
548 | Otherwise return the canonical form. */ | |
9219021c | 549 | |
2f408ecb | 550 | std::string |
fb4c6eba DJ |
551 | cp_canonicalize_string (const char *string) |
552 | { | |
c8b23b3f | 553 | std::unique_ptr<demangle_parse_info> info; |
f88e9fd3 | 554 | unsigned int estimated_len; |
9219021c | 555 | |
f88e9fd3 | 556 | if (cp_already_canonical (string)) |
2f408ecb | 557 | return std::string (); |
9219021c | 558 | |
3a93a0c2 KS |
559 | info = cp_demangled_name_to_comp (string, NULL); |
560 | if (info == NULL) | |
2f408ecb | 561 | return std::string (); |
9219021c | 562 | |
f88e9fd3 | 563 | estimated_len = strlen (string) * 2; |
e88e8651 YQ |
564 | gdb::unique_xmalloc_ptr<char> us (cp_comp_to_string (info->tree, |
565 | estimated_len)); | |
9219021c | 566 | |
e88e8651 | 567 | if (!us) |
9934703b JK |
568 | { |
569 | warning (_("internal error: string \"%s\" failed to be canonicalized"), | |
570 | string); | |
2f408ecb | 571 | return std::string (); |
9934703b JK |
572 | } |
573 | ||
e88e8651 YQ |
574 | std::string ret (us.get ()); |
575 | ||
2f408ecb PA |
576 | if (ret == string) |
577 | return std::string (); | |
de17c821 | 578 | |
fb4c6eba DJ |
579 | return ret; |
580 | } | |
de17c821 | 581 | |
aff410f1 MS |
582 | /* Convert a mangled name to a demangle_component tree. *MEMORY is |
583 | set to the block of used memory that should be freed when finished | |
584 | with the tree. DEMANGLED_P is set to the char * that should be | |
585 | freed when finished with the tree, or NULL if none was needed. | |
586 | OPTIONS will be passed to the demangler. */ | |
de17c821 | 587 | |
c8b23b3f | 588 | static std::unique_ptr<demangle_parse_info> |
fb4c6eba DJ |
589 | mangled_name_to_comp (const char *mangled_name, int options, |
590 | void **memory, char **demangled_p) | |
de17c821 | 591 | { |
fb4c6eba | 592 | char *demangled_name; |
de17c821 | 593 | |
fb4c6eba DJ |
594 | /* If it looks like a v3 mangled name, then try to go directly |
595 | to trees. */ | |
596 | if (mangled_name[0] == '_' && mangled_name[1] == 'Z') | |
de17c821 | 597 | { |
3a93a0c2 KS |
598 | struct demangle_component *ret; |
599 | ||
aff410f1 MS |
600 | ret = cplus_demangle_v3_components (mangled_name, |
601 | options, memory); | |
fb4c6eba DJ |
602 | if (ret) |
603 | { | |
c8b23b3f | 604 | std::unique_ptr<demangle_parse_info> info (new demangle_parse_info); |
3a93a0c2 | 605 | info->tree = ret; |
fb4c6eba | 606 | *demangled_p = NULL; |
3a93a0c2 | 607 | return info; |
fb4c6eba | 608 | } |
de17c821 DJ |
609 | } |
610 | ||
aff410f1 MS |
611 | /* If it doesn't, or if that failed, then try to demangle the |
612 | name. */ | |
8de20a37 | 613 | demangled_name = gdb_demangle (mangled_name, options); |
fb4c6eba DJ |
614 | if (demangled_name == NULL) |
615 | return NULL; | |
616 | ||
aff410f1 MS |
617 | /* If we could demangle the name, parse it to build the component |
618 | tree. */ | |
c8b23b3f TT |
619 | std::unique_ptr<demangle_parse_info> info |
620 | = cp_demangled_name_to_comp (demangled_name, NULL); | |
de17c821 | 621 | |
3a93a0c2 | 622 | if (info == NULL) |
fb4c6eba | 623 | { |
6c761d9c | 624 | xfree (demangled_name); |
fb4c6eba DJ |
625 | return NULL; |
626 | } | |
de17c821 | 627 | |
fb4c6eba | 628 | *demangled_p = demangled_name; |
3a93a0c2 | 629 | return info; |
de17c821 DJ |
630 | } |
631 | ||
632 | /* Return the name of the class containing method PHYSNAME. */ | |
633 | ||
634 | char * | |
31c27f77 | 635 | cp_class_name_from_physname (const char *physname) |
de17c821 | 636 | { |
de237128 | 637 | void *storage = NULL; |
29592bde PA |
638 | char *demangled_name = NULL; |
639 | gdb::unique_xmalloc_ptr<char> ret; | |
5e5100cb | 640 | struct demangle_component *ret_comp, *prev_comp, *cur_comp; |
c8b23b3f | 641 | std::unique_ptr<demangle_parse_info> info; |
fb4c6eba DJ |
642 | int done; |
643 | ||
3a93a0c2 KS |
644 | info = mangled_name_to_comp (physname, DMGL_ANSI, |
645 | &storage, &demangled_name); | |
646 | if (info == NULL) | |
de17c821 DJ |
647 | return NULL; |
648 | ||
fb4c6eba | 649 | done = 0; |
3a93a0c2 | 650 | ret_comp = info->tree; |
5e5100cb | 651 | |
aff410f1 MS |
652 | /* First strip off any qualifiers, if we have a function or |
653 | method. */ | |
fb4c6eba DJ |
654 | while (!done) |
655 | switch (ret_comp->type) | |
656 | { | |
fb4c6eba DJ |
657 | case DEMANGLE_COMPONENT_CONST: |
658 | case DEMANGLE_COMPONENT_RESTRICT: | |
659 | case DEMANGLE_COMPONENT_VOLATILE: | |
660 | case DEMANGLE_COMPONENT_CONST_THIS: | |
661 | case DEMANGLE_COMPONENT_RESTRICT_THIS: | |
662 | case DEMANGLE_COMPONENT_VOLATILE_THIS: | |
663 | case DEMANGLE_COMPONENT_VENDOR_TYPE_QUAL: | |
fb4c6eba DJ |
664 | ret_comp = d_left (ret_comp); |
665 | break; | |
5e5100cb DJ |
666 | default: |
667 | done = 1; | |
668 | break; | |
669 | } | |
670 | ||
671 | /* If what we have now is a function, discard the argument list. */ | |
672 | if (ret_comp->type == DEMANGLE_COMPONENT_TYPED_NAME) | |
673 | ret_comp = d_left (ret_comp); | |
674 | ||
675 | /* If what we have now is a template, strip off the template | |
676 | arguments. The left subtree may be a qualified name. */ | |
677 | if (ret_comp->type == DEMANGLE_COMPONENT_TEMPLATE) | |
678 | ret_comp = d_left (ret_comp); | |
679 | ||
aff410f1 MS |
680 | /* What we have now should be a name, possibly qualified. |
681 | Additional qualifiers could live in the left subtree or the right | |
682 | subtree. Find the last piece. */ | |
5e5100cb DJ |
683 | done = 0; |
684 | prev_comp = NULL; | |
685 | cur_comp = ret_comp; | |
686 | while (!done) | |
687 | switch (cur_comp->type) | |
688 | { | |
689 | case DEMANGLE_COMPONENT_QUAL_NAME: | |
690 | case DEMANGLE_COMPONENT_LOCAL_NAME: | |
691 | prev_comp = cur_comp; | |
692 | cur_comp = d_right (cur_comp); | |
693 | break; | |
fb4c6eba | 694 | case DEMANGLE_COMPONENT_TEMPLATE: |
5e5100cb | 695 | case DEMANGLE_COMPONENT_NAME: |
fb4c6eba DJ |
696 | case DEMANGLE_COMPONENT_CTOR: |
697 | case DEMANGLE_COMPONENT_DTOR: | |
698 | case DEMANGLE_COMPONENT_OPERATOR: | |
699 | case DEMANGLE_COMPONENT_EXTENDED_OPERATOR: | |
700 | done = 1; | |
701 | break; | |
702 | default: | |
703 | done = 1; | |
5e5100cb | 704 | cur_comp = NULL; |
fb4c6eba DJ |
705 | break; |
706 | } | |
707 | ||
5e5100cb | 708 | if (cur_comp != NULL && prev_comp != NULL) |
de17c821 | 709 | { |
5e5100cb | 710 | /* We want to discard the rightmost child of PREV_COMP. */ |
fb4c6eba | 711 | *prev_comp = *d_left (prev_comp); |
aff410f1 MS |
712 | /* The ten is completely arbitrary; we don't have a good |
713 | estimate. */ | |
5e5100cb | 714 | ret = cp_comp_to_string (ret_comp, 10); |
de17c821 DJ |
715 | } |
716 | ||
fb4c6eba | 717 | xfree (storage); |
3a93a0c2 | 718 | xfree (demangled_name); |
29592bde | 719 | return ret.release (); |
de17c821 DJ |
720 | } |
721 | ||
aff410f1 MS |
722 | /* Return the child of COMP which is the basename of a method, |
723 | variable, et cetera. All scope qualifiers are discarded, but | |
724 | template arguments will be included. The component tree may be | |
725 | modified. */ | |
de17c821 | 726 | |
5e5100cb DJ |
727 | static struct demangle_component * |
728 | unqualified_name_from_comp (struct demangle_component *comp) | |
de17c821 | 729 | { |
5e5100cb | 730 | struct demangle_component *ret_comp = comp, *last_template; |
fb4c6eba DJ |
731 | int done; |
732 | ||
fb4c6eba | 733 | done = 0; |
5e5100cb | 734 | last_template = NULL; |
fb4c6eba DJ |
735 | while (!done) |
736 | switch (ret_comp->type) | |
737 | { | |
738 | case DEMANGLE_COMPONENT_QUAL_NAME: | |
739 | case DEMANGLE_COMPONENT_LOCAL_NAME: | |
fb4c6eba DJ |
740 | ret_comp = d_right (ret_comp); |
741 | break; | |
5e5100cb DJ |
742 | case DEMANGLE_COMPONENT_TYPED_NAME: |
743 | ret_comp = d_left (ret_comp); | |
744 | break; | |
745 | case DEMANGLE_COMPONENT_TEMPLATE: | |
746 | gdb_assert (last_template == NULL); | |
747 | last_template = ret_comp; | |
748 | ret_comp = d_left (ret_comp); | |
749 | break; | |
fb4c6eba DJ |
750 | case DEMANGLE_COMPONENT_CONST: |
751 | case DEMANGLE_COMPONENT_RESTRICT: | |
752 | case DEMANGLE_COMPONENT_VOLATILE: | |
753 | case DEMANGLE_COMPONENT_CONST_THIS: | |
754 | case DEMANGLE_COMPONENT_RESTRICT_THIS: | |
755 | case DEMANGLE_COMPONENT_VOLATILE_THIS: | |
756 | case DEMANGLE_COMPONENT_VENDOR_TYPE_QUAL: | |
757 | ret_comp = d_left (ret_comp); | |
758 | break; | |
759 | case DEMANGLE_COMPONENT_NAME: | |
fb4c6eba DJ |
760 | case DEMANGLE_COMPONENT_CTOR: |
761 | case DEMANGLE_COMPONENT_DTOR: | |
762 | case DEMANGLE_COMPONENT_OPERATOR: | |
763 | case DEMANGLE_COMPONENT_EXTENDED_OPERATOR: | |
764 | done = 1; | |
765 | break; | |
766 | default: | |
5e5100cb | 767 | return NULL; |
fb4c6eba DJ |
768 | break; |
769 | } | |
770 | ||
5e5100cb DJ |
771 | if (last_template) |
772 | { | |
773 | d_left (last_template) = ret_comp; | |
774 | return last_template; | |
775 | } | |
776 | ||
777 | return ret_comp; | |
778 | } | |
779 | ||
780 | /* Return the name of the method whose linkage name is PHYSNAME. */ | |
781 | ||
782 | char * | |
783 | method_name_from_physname (const char *physname) | |
784 | { | |
de237128 | 785 | void *storage = NULL; |
29592bde PA |
786 | char *demangled_name = NULL; |
787 | gdb::unique_xmalloc_ptr<char> ret; | |
5e5100cb | 788 | struct demangle_component *ret_comp; |
c8b23b3f | 789 | std::unique_ptr<demangle_parse_info> info; |
5e5100cb | 790 | |
3a93a0c2 KS |
791 | info = mangled_name_to_comp (physname, DMGL_ANSI, |
792 | &storage, &demangled_name); | |
793 | if (info == NULL) | |
5e5100cb DJ |
794 | return NULL; |
795 | ||
3a93a0c2 | 796 | ret_comp = unqualified_name_from_comp (info->tree); |
5e5100cb | 797 | |
fb4c6eba | 798 | if (ret_comp != NULL) |
aff410f1 MS |
799 | /* The ten is completely arbitrary; we don't have a good |
800 | estimate. */ | |
fb4c6eba DJ |
801 | ret = cp_comp_to_string (ret_comp, 10); |
802 | ||
803 | xfree (storage); | |
3a93a0c2 | 804 | xfree (demangled_name); |
29592bde | 805 | return ret.release (); |
fb4c6eba | 806 | } |
de17c821 | 807 | |
5e5100cb DJ |
808 | /* If FULL_NAME is the demangled name of a C++ function (including an |
809 | arg list, possibly including namespace/class qualifications), | |
810 | return a new string containing only the function name (without the | |
811 | arg list/class qualifications). Otherwise, return NULL. The | |
812 | caller is responsible for freeing the memory in question. */ | |
813 | ||
814 | char * | |
815 | cp_func_name (const char *full_name) | |
816 | { | |
29592bde | 817 | gdb::unique_xmalloc_ptr<char> ret; |
5e5100cb | 818 | struct demangle_component *ret_comp; |
c8b23b3f | 819 | std::unique_ptr<demangle_parse_info> info; |
5e5100cb | 820 | |
3a93a0c2 KS |
821 | info = cp_demangled_name_to_comp (full_name, NULL); |
822 | if (!info) | |
5e5100cb DJ |
823 | return NULL; |
824 | ||
3a93a0c2 | 825 | ret_comp = unqualified_name_from_comp (info->tree); |
5e5100cb | 826 | |
5e5100cb DJ |
827 | if (ret_comp != NULL) |
828 | ret = cp_comp_to_string (ret_comp, 10); | |
829 | ||
29592bde | 830 | return ret.release (); |
5e5100cb DJ |
831 | } |
832 | ||
833 | /* DEMANGLED_NAME is the name of a function, including parameters and | |
834 | (optionally) a return type. Return the name of the function without | |
835 | parameters or return type, or NULL if we can not parse the name. */ | |
836 | ||
109483d9 | 837 | gdb::unique_xmalloc_ptr<char> |
3567439c | 838 | cp_remove_params (const char *demangled_name) |
5e5100cb | 839 | { |
109483d9 | 840 | bool done = false; |
5e5100cb | 841 | struct demangle_component *ret_comp; |
c8b23b3f | 842 | std::unique_ptr<demangle_parse_info> info; |
29592bde | 843 | gdb::unique_xmalloc_ptr<char> ret; |
5e5100cb DJ |
844 | |
845 | if (demangled_name == NULL) | |
846 | return NULL; | |
847 | ||
3a93a0c2 KS |
848 | info = cp_demangled_name_to_comp (demangled_name, NULL); |
849 | if (info == NULL) | |
5e5100cb DJ |
850 | return NULL; |
851 | ||
852 | /* First strip off any qualifiers, if we have a function or method. */ | |
3a93a0c2 | 853 | ret_comp = info->tree; |
5e5100cb DJ |
854 | while (!done) |
855 | switch (ret_comp->type) | |
856 | { | |
857 | case DEMANGLE_COMPONENT_CONST: | |
858 | case DEMANGLE_COMPONENT_RESTRICT: | |
859 | case DEMANGLE_COMPONENT_VOLATILE: | |
860 | case DEMANGLE_COMPONENT_CONST_THIS: | |
861 | case DEMANGLE_COMPONENT_RESTRICT_THIS: | |
862 | case DEMANGLE_COMPONENT_VOLATILE_THIS: | |
863 | case DEMANGLE_COMPONENT_VENDOR_TYPE_QUAL: | |
864 | ret_comp = d_left (ret_comp); | |
865 | break; | |
866 | default: | |
109483d9 | 867 | done = true; |
5e5100cb DJ |
868 | break; |
869 | } | |
870 | ||
871 | /* What we have now should be a function. Return its name. */ | |
872 | if (ret_comp->type == DEMANGLE_COMPONENT_TYPED_NAME) | |
873 | ret = cp_comp_to_string (d_left (ret_comp), 10); | |
874 | ||
109483d9 | 875 | return ret; |
5e5100cb DJ |
876 | } |
877 | ||
fb4c6eba DJ |
878 | /* Here are some random pieces of trivia to keep in mind while trying |
879 | to take apart demangled names: | |
de17c821 | 880 | |
fb4c6eba DJ |
881 | - Names can contain function arguments or templates, so the process |
882 | has to be, to some extent recursive: maybe keep track of your | |
883 | depth based on encountering <> and (). | |
884 | ||
885 | - Parentheses don't just have to happen at the end of a name: they | |
886 | can occur even if the name in question isn't a function, because | |
887 | a template argument might be a type that's a function. | |
888 | ||
889 | - Conversely, even if you're trying to deal with a function, its | |
890 | demangled name might not end with ')': it could be a const or | |
891 | volatile class method, in which case it ends with "const" or | |
892 | "volatile". | |
893 | ||
894 | - Parentheses are also used in anonymous namespaces: a variable | |
895 | 'foo' in an anonymous namespace gets demangled as "(anonymous | |
896 | namespace)::foo". | |
897 | ||
898 | - And operator names can contain parentheses or angle brackets. */ | |
899 | ||
900 | /* FIXME: carlton/2003-03-13: We have several functions here with | |
901 | overlapping functionality; can we combine them? Also, do they | |
902 | handle all the above considerations correctly? */ | |
de17c821 | 903 | |
9219021c DC |
904 | |
905 | /* This returns the length of first component of NAME, which should be | |
906 | the demangled name of a C++ variable/function/method/etc. | |
907 | Specifically, it returns the index of the first colon forming the | |
908 | boundary of the first component: so, given 'A::foo' or 'A::B::foo' | |
909 | it returns the 1, and given 'foo', it returns 0. */ | |
910 | ||
b2a7f303 DC |
911 | /* The character in NAME indexed by the return value is guaranteed to |
912 | always be either ':' or '\0'. */ | |
9219021c DC |
913 | |
914 | /* NOTE: carlton/2003-03-13: This function is currently only intended | |
915 | for internal use: it's probably not entirely safe when called on | |
b2a7f303 DC |
916 | user-generated input, because some of the 'index += 2' lines in |
917 | cp_find_first_component_aux might go past the end of malformed | |
918 | input. */ | |
919 | ||
920 | unsigned int | |
921 | cp_find_first_component (const char *name) | |
922 | { | |
923 | return cp_find_first_component_aux (name, 0); | |
924 | } | |
925 | ||
926 | /* Helper function for cp_find_first_component. Like that function, | |
927 | it returns the length of the first component of NAME, but to make | |
928 | the recursion easier, it also stops if it reaches an unexpected ')' | |
929 | or '>' if the value of PERMISSIVE is nonzero. */ | |
9219021c | 930 | |
b2a7f303 DC |
931 | static unsigned int |
932 | cp_find_first_component_aux (const char *name, int permissive) | |
9219021c | 933 | { |
9219021c | 934 | unsigned int index = 0; |
0f20eeea DC |
935 | /* Operator names can show up in unexpected places. Since these can |
936 | contain parentheses or angle brackets, they can screw up the | |
937 | recursion. But not every string 'operator' is part of an | |
938 | operater name: e.g. you could have a variable 'cooperator'. So | |
939 | this variable tells us whether or not we should treat the string | |
940 | 'operator' as starting an operator. */ | |
941 | int operator_possible = 1; | |
9219021c DC |
942 | |
943 | for (;; ++index) | |
944 | { | |
945 | switch (name[index]) | |
946 | { | |
947 | case '<': | |
948 | /* Template; eat it up. The calls to cp_first_component | |
949 | should only return (I hope!) when they reach the '>' | |
950 | terminating the component or a '::' between two | |
951 | components. (Hence the '+ 2'.) */ | |
952 | index += 1; | |
b2a7f303 | 953 | for (index += cp_find_first_component_aux (name + index, 1); |
9219021c | 954 | name[index] != '>'; |
b2a7f303 | 955 | index += cp_find_first_component_aux (name + index, 1)) |
9219021c | 956 | { |
b2a7f303 DC |
957 | if (name[index] != ':') |
958 | { | |
959 | demangled_name_complaint (name); | |
960 | return strlen (name); | |
961 | } | |
9219021c DC |
962 | index += 2; |
963 | } | |
0f20eeea | 964 | operator_possible = 1; |
9219021c DC |
965 | break; |
966 | case '(': | |
967 | /* Similar comment as to '<'. */ | |
968 | index += 1; | |
b2a7f303 | 969 | for (index += cp_find_first_component_aux (name + index, 1); |
9219021c | 970 | name[index] != ')'; |
b2a7f303 | 971 | index += cp_find_first_component_aux (name + index, 1)) |
9219021c | 972 | { |
b2a7f303 DC |
973 | if (name[index] != ':') |
974 | { | |
975 | demangled_name_complaint (name); | |
976 | return strlen (name); | |
977 | } | |
9219021c DC |
978 | index += 2; |
979 | } | |
0f20eeea | 980 | operator_possible = 1; |
9219021c DC |
981 | break; |
982 | case '>': | |
983 | case ')': | |
b2a7f303 | 984 | if (permissive) |
7a20f2c2 | 985 | return index; |
b2a7f303 DC |
986 | else |
987 | { | |
988 | demangled_name_complaint (name); | |
989 | return strlen (name); | |
990 | } | |
9219021c | 991 | case '\0': |
9219021c | 992 | return index; |
1cafadb4 DB |
993 | case ':': |
994 | /* ':' marks a component iff the next character is also a ':'. | |
995 | Otherwise it is probably malformed input. */ | |
996 | if (name[index + 1] == ':') | |
997 | return index; | |
998 | break; | |
0f20eeea DC |
999 | case 'o': |
1000 | /* Operator names can screw up the recursion. */ | |
1001 | if (operator_possible | |
8090b426 | 1002 | && startswith (name + index, CP_OPERATOR_STR)) |
0f20eeea | 1003 | { |
8090b426 | 1004 | index += CP_OPERATOR_LEN; |
f88e9fd3 | 1005 | while (ISSPACE(name[index])) |
0f20eeea DC |
1006 | ++index; |
1007 | switch (name[index]) | |
1008 | { | |
cf325299 PA |
1009 | case '\0': |
1010 | return index; | |
0f20eeea DC |
1011 | /* Skip over one less than the appropriate number of |
1012 | characters: the for loop will skip over the last | |
1013 | one. */ | |
1014 | case '<': | |
1015 | if (name[index + 1] == '<') | |
1016 | index += 1; | |
1017 | else | |
1018 | index += 0; | |
1019 | break; | |
1020 | case '>': | |
1021 | case '-': | |
1022 | if (name[index + 1] == '>') | |
1023 | index += 1; | |
1024 | else | |
1025 | index += 0; | |
1026 | break; | |
1027 | case '(': | |
1028 | index += 1; | |
1029 | break; | |
1030 | default: | |
1031 | index += 0; | |
1032 | break; | |
1033 | } | |
1034 | } | |
1035 | operator_possible = 0; | |
1036 | break; | |
1037 | case ' ': | |
1038 | case ',': | |
1039 | case '.': | |
1040 | case '&': | |
1041 | case '*': | |
1042 | /* NOTE: carlton/2003-04-18: I'm not sure what the precise | |
1043 | set of relevant characters are here: it's necessary to | |
1044 | include any character that can show up before 'operator' | |
1045 | in a demangled name, and it's safe to include any | |
1046 | character that can't be part of an identifier's name. */ | |
1047 | operator_possible = 1; | |
1048 | break; | |
9219021c | 1049 | default: |
0f20eeea | 1050 | operator_possible = 0; |
9219021c DC |
1051 | break; |
1052 | } | |
1053 | } | |
1054 | } | |
1055 | ||
b2a7f303 DC |
1056 | /* Complain about a demangled name that we don't know how to parse. |
1057 | NAME is the demangled name in question. */ | |
1058 | ||
1059 | static void | |
1060 | demangled_name_complaint (const char *name) | |
1061 | { | |
1062 | complaint (&symfile_complaints, | |
1063 | "unexpected demangled name '%s'", name); | |
1064 | } | |
1065 | ||
9219021c DC |
1066 | /* If NAME is the fully-qualified name of a C++ |
1067 | function/variable/method/etc., this returns the length of its | |
1068 | entire prefix: all of the namespaces and classes that make up its | |
1069 | name. Given 'A::foo', it returns 1, given 'A::B::foo', it returns | |
1070 | 4, given 'foo', it returns 0. */ | |
1071 | ||
1072 | unsigned int | |
1073 | cp_entire_prefix_len (const char *name) | |
1074 | { | |
1075 | unsigned int current_len = cp_find_first_component (name); | |
1076 | unsigned int previous_len = 0; | |
1077 | ||
1078 | while (name[current_len] != '\0') | |
1079 | { | |
1080 | gdb_assert (name[current_len] == ':'); | |
1081 | previous_len = current_len; | |
1082 | /* Skip the '::'. */ | |
1083 | current_len += 2; | |
1084 | current_len += cp_find_first_component (name + current_len); | |
1085 | } | |
1086 | ||
1087 | return previous_len; | |
1088 | } | |
1089 | ||
b6429628 DC |
1090 | /* Overload resolution functions. */ |
1091 | ||
8d577d32 DC |
1092 | /* Test to see if SYM is a symbol that we haven't seen corresponding |
1093 | to a function named OLOAD_NAME. If so, add it to the current | |
aff410f1 | 1094 | completion list. */ |
b6429628 DC |
1095 | |
1096 | static void | |
aff410f1 MS |
1097 | overload_list_add_symbol (struct symbol *sym, |
1098 | const char *oload_name) | |
b6429628 DC |
1099 | { |
1100 | int newsize; | |
1101 | int i; | |
109483d9 | 1102 | gdb::unique_xmalloc_ptr<char> sym_name; |
b6429628 | 1103 | |
aff410f1 MS |
1104 | /* If there is no type information, we can't do anything, so |
1105 | skip. */ | |
b6429628 DC |
1106 | if (SYMBOL_TYPE (sym) == NULL) |
1107 | return; | |
1108 | ||
aff410f1 | 1109 | /* skip any symbols that we've already considered. */ |
b6429628 | 1110 | for (i = 0; i < sym_return_val_index; ++i) |
8d577d32 DC |
1111 | if (strcmp (SYMBOL_LINKAGE_NAME (sym), |
1112 | SYMBOL_LINKAGE_NAME (sym_return_val[i])) == 0) | |
b6429628 DC |
1113 | return; |
1114 | ||
1115 | /* Get the demangled name without parameters */ | |
3567439c | 1116 | sym_name = cp_remove_params (SYMBOL_NATURAL_NAME (sym)); |
b6429628 DC |
1117 | if (!sym_name) |
1118 | return; | |
1119 | ||
1120 | /* skip symbols that cannot match */ | |
109483d9 PA |
1121 | if (strcmp (sym_name.get (), oload_name) != 0) |
1122 | return; | |
b6429628 | 1123 | |
aff410f1 MS |
1124 | /* We have a match for an overload instance, so add SYM to the |
1125 | current list of overload instances */ | |
b6429628 DC |
1126 | if (sym_return_val_index + 3 > sym_return_val_size) |
1127 | { | |
1128 | newsize = (sym_return_val_size *= 2) * sizeof (struct symbol *); | |
aff410f1 MS |
1129 | sym_return_val = (struct symbol **) |
1130 | xrealloc ((char *) sym_return_val, newsize); | |
b6429628 DC |
1131 | } |
1132 | sym_return_val[sym_return_val_index++] = sym; | |
1133 | sym_return_val[sym_return_val_index] = NULL; | |
1134 | } | |
1135 | ||
1136 | /* Return a null-terminated list of pointers to function symbols that | |
8d577d32 | 1137 | are named FUNC_NAME and are visible within NAMESPACE. */ |
b6429628 DC |
1138 | |
1139 | struct symbol ** | |
8d577d32 | 1140 | make_symbol_overload_list (const char *func_name, |
fe978cb0 | 1141 | const char *the_namespace) |
b6429628 | 1142 | { |
8d577d32 | 1143 | struct cleanup *old_cleanups; |
245040d7 | 1144 | const char *name; |
b6429628 | 1145 | |
8d577d32 DC |
1146 | sym_return_val_size = 100; |
1147 | sym_return_val_index = 0; | |
8d749320 | 1148 | sym_return_val = XNEWVEC (struct symbol *, sym_return_val_size + 1); |
8d577d32 | 1149 | sym_return_val[0] = NULL; |
b6429628 | 1150 | |
8d577d32 DC |
1151 | old_cleanups = make_cleanup (xfree, sym_return_val); |
1152 | ||
fe978cb0 | 1153 | make_symbol_overload_list_using (func_name, the_namespace); |
8d577d32 | 1154 | |
fe978cb0 | 1155 | if (the_namespace[0] == '\0') |
245040d7 SW |
1156 | name = func_name; |
1157 | else | |
1158 | { | |
1159 | char *concatenated_name | |
224c3ddb | 1160 | = (char *) alloca (strlen (the_namespace) + 2 + strlen (func_name) + 1); |
fe978cb0 | 1161 | strcpy (concatenated_name, the_namespace); |
245040d7 SW |
1162 | strcat (concatenated_name, "::"); |
1163 | strcat (concatenated_name, func_name); | |
1164 | name = concatenated_name; | |
1165 | } | |
1166 | ||
1167 | make_symbol_overload_list_qualified (name); | |
1168 | ||
8d577d32 DC |
1169 | discard_cleanups (old_cleanups); |
1170 | ||
1171 | return sym_return_val; | |
1172 | } | |
1173 | ||
245040d7 SW |
1174 | /* Add all symbols with a name matching NAME in BLOCK to the overload |
1175 | list. */ | |
1176 | ||
1177 | static void | |
1178 | make_symbol_overload_list_block (const char *name, | |
1179 | const struct block *block) | |
1180 | { | |
8157b174 | 1181 | struct block_iterator iter; |
245040d7 SW |
1182 | struct symbol *sym; |
1183 | ||
358d6ab3 | 1184 | ALL_BLOCK_SYMBOLS_WITH_NAME (block, name, iter, sym) |
245040d7 SW |
1185 | overload_list_add_symbol (sym, name); |
1186 | } | |
1187 | ||
7322dca9 SW |
1188 | /* Adds the function FUNC_NAME from NAMESPACE to the overload set. */ |
1189 | ||
1190 | static void | |
1191 | make_symbol_overload_list_namespace (const char *func_name, | |
fe978cb0 | 1192 | const char *the_namespace) |
7322dca9 | 1193 | { |
245040d7 SW |
1194 | const char *name; |
1195 | const struct block *block = NULL; | |
1196 | ||
fe978cb0 | 1197 | if (the_namespace[0] == '\0') |
245040d7 | 1198 | name = func_name; |
7322dca9 SW |
1199 | else |
1200 | { | |
1201 | char *concatenated_name | |
224c3ddb | 1202 | = (char *) alloca (strlen (the_namespace) + 2 + strlen (func_name) + 1); |
c5504eaf | 1203 | |
fe978cb0 | 1204 | strcpy (concatenated_name, the_namespace); |
7322dca9 SW |
1205 | strcat (concatenated_name, "::"); |
1206 | strcat (concatenated_name, func_name); | |
245040d7 | 1207 | name = concatenated_name; |
7322dca9 | 1208 | } |
245040d7 SW |
1209 | |
1210 | /* Look in the static block. */ | |
1211 | block = block_static_block (get_selected_block (0)); | |
eeaafae2 JK |
1212 | if (block) |
1213 | make_symbol_overload_list_block (name, block); | |
245040d7 SW |
1214 | |
1215 | /* Look in the global block. */ | |
1216 | block = block_global_block (block); | |
eeaafae2 JK |
1217 | if (block) |
1218 | make_symbol_overload_list_block (name, block); | |
245040d7 | 1219 | |
7322dca9 SW |
1220 | } |
1221 | ||
aff410f1 MS |
1222 | /* Search the namespace of the given type and namespace of and public |
1223 | base types. */ | |
7322dca9 SW |
1224 | |
1225 | static void | |
1226 | make_symbol_overload_list_adl_namespace (struct type *type, | |
1227 | const char *func_name) | |
1228 | { | |
fe978cb0 | 1229 | char *the_namespace; |
0d5cff50 | 1230 | const char *type_name; |
7322dca9 SW |
1231 | int i, prefix_len; |
1232 | ||
aff410f1 | 1233 | while (TYPE_CODE (type) == TYPE_CODE_PTR |
aa006118 | 1234 | || TYPE_IS_REFERENCE (type) |
7322dca9 SW |
1235 | || TYPE_CODE (type) == TYPE_CODE_ARRAY |
1236 | || TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
1237 | { | |
1238 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
1239 | type = check_typedef(type); | |
1240 | else | |
1241 | type = TYPE_TARGET_TYPE (type); | |
1242 | } | |
1243 | ||
1244 | type_name = TYPE_NAME (type); | |
1245 | ||
7d3fe98e SW |
1246 | if (type_name == NULL) |
1247 | return; | |
1248 | ||
7322dca9 SW |
1249 | prefix_len = cp_entire_prefix_len (type_name); |
1250 | ||
1251 | if (prefix_len != 0) | |
1252 | { | |
224c3ddb | 1253 | the_namespace = (char *) alloca (prefix_len + 1); |
fe978cb0 PA |
1254 | strncpy (the_namespace, type_name, prefix_len); |
1255 | the_namespace[prefix_len] = '\0'; | |
7322dca9 | 1256 | |
fe978cb0 | 1257 | make_symbol_overload_list_namespace (func_name, the_namespace); |
7322dca9 SW |
1258 | } |
1259 | ||
1260 | /* Check public base type */ | |
4753d33b | 1261 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
7322dca9 SW |
1262 | for (i = 0; i < TYPE_N_BASECLASSES (type); i++) |
1263 | { | |
1264 | if (BASETYPE_VIA_PUBLIC (type, i)) | |
aff410f1 MS |
1265 | make_symbol_overload_list_adl_namespace (TYPE_BASECLASS (type, |
1266 | i), | |
7322dca9 SW |
1267 | func_name); |
1268 | } | |
1269 | } | |
1270 | ||
b021a221 | 1271 | /* Adds the overload list overload candidates for FUNC_NAME found |
aff410f1 | 1272 | through argument dependent lookup. */ |
7322dca9 SW |
1273 | |
1274 | struct symbol ** | |
1275 | make_symbol_overload_list_adl (struct type **arg_types, int nargs, | |
1276 | const char *func_name) | |
1277 | { | |
1278 | int i; | |
1279 | ||
1280 | gdb_assert (sym_return_val_size != -1); | |
1281 | ||
1282 | for (i = 1; i <= nargs; i++) | |
aff410f1 MS |
1283 | make_symbol_overload_list_adl_namespace (arg_types[i - 1], |
1284 | func_name); | |
7322dca9 SW |
1285 | |
1286 | return sym_return_val; | |
1287 | } | |
1288 | ||
aff410f1 MS |
1289 | /* Used for cleanups to reset the "searched" flag in case of an |
1290 | error. */ | |
19c0c0f8 UW |
1291 | |
1292 | static void | |
1293 | reset_directive_searched (void *data) | |
1294 | { | |
9a3c8263 | 1295 | struct using_direct *direct = (struct using_direct *) data; |
19c0c0f8 UW |
1296 | direct->searched = 0; |
1297 | } | |
1298 | ||
8d577d32 DC |
1299 | /* This applies the using directives to add namespaces to search in, |
1300 | and then searches for overloads in all of those namespaces. It | |
1301 | adds the symbols found to sym_return_val. Arguments are as in | |
1302 | make_symbol_overload_list. */ | |
1303 | ||
1304 | static void | |
1305 | make_symbol_overload_list_using (const char *func_name, | |
fe978cb0 | 1306 | const char *the_namespace) |
8d577d32 | 1307 | { |
19c0c0f8 | 1308 | struct using_direct *current; |
4c3376c8 | 1309 | const struct block *block; |
8d577d32 DC |
1310 | |
1311 | /* First, go through the using directives. If any of them apply, | |
1312 | look in the appropriate namespaces for new functions to match | |
1313 | on. */ | |
b6429628 | 1314 | |
4c3376c8 SW |
1315 | for (block = get_selected_block (0); |
1316 | block != NULL; | |
1317 | block = BLOCK_SUPERBLOCK (block)) | |
1318 | for (current = block_using (block); | |
1319 | current != NULL; | |
1320 | current = current->next) | |
1321 | { | |
19c0c0f8 UW |
1322 | /* Prevent recursive calls. */ |
1323 | if (current->searched) | |
1324 | continue; | |
1325 | ||
aff410f1 MS |
1326 | /* If this is a namespace alias or imported declaration ignore |
1327 | it. */ | |
4c3376c8 SW |
1328 | if (current->alias != NULL || current->declaration != NULL) |
1329 | continue; | |
1330 | ||
fe978cb0 | 1331 | if (strcmp (the_namespace, current->import_dest) == 0) |
19c0c0f8 | 1332 | { |
aff410f1 MS |
1333 | /* Mark this import as searched so that the recursive call |
1334 | does not search it again. */ | |
19c0c0f8 UW |
1335 | struct cleanup *old_chain; |
1336 | current->searched = 1; | |
aff410f1 MS |
1337 | old_chain = make_cleanup (reset_directive_searched, |
1338 | current); | |
19c0c0f8 | 1339 | |
aff410f1 MS |
1340 | make_symbol_overload_list_using (func_name, |
1341 | current->import_src); | |
19c0c0f8 UW |
1342 | |
1343 | current->searched = 0; | |
1344 | discard_cleanups (old_chain); | |
1345 | } | |
4c3376c8 | 1346 | } |
b6429628 | 1347 | |
8d577d32 | 1348 | /* Now, add names for this namespace. */ |
fe978cb0 | 1349 | make_symbol_overload_list_namespace (func_name, the_namespace); |
8d577d32 | 1350 | } |
b6429628 | 1351 | |
8d577d32 DC |
1352 | /* This does the bulk of the work of finding overloaded symbols. |
1353 | FUNC_NAME is the name of the overloaded function we're looking for | |
1354 | (possibly including namespace info). */ | |
b6429628 | 1355 | |
8d577d32 DC |
1356 | static void |
1357 | make_symbol_overload_list_qualified (const char *func_name) | |
1358 | { | |
43f3e411 | 1359 | struct compunit_symtab *cust; |
8d577d32 DC |
1360 | struct objfile *objfile; |
1361 | const struct block *b, *surrounding_static_block = 0; | |
b6429628 | 1362 | |
aff410f1 MS |
1363 | /* Look through the partial symtabs for all symbols which begin by |
1364 | matching FUNC_NAME. Make sure we read that symbol table in. */ | |
b6429628 | 1365 | |
ccefe4c4 TT |
1366 | ALL_OBJFILES (objfile) |
1367 | { | |
1368 | if (objfile->sf) | |
1369 | objfile->sf->qf->expand_symtabs_for_function (objfile, func_name); | |
1370 | } | |
b6429628 DC |
1371 | |
1372 | /* Search upwards from currently selected frame (so that we can | |
1373 | complete on local vars. */ | |
1374 | ||
1375 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) | |
245040d7 | 1376 | make_symbol_overload_list_block (func_name, b); |
b6429628 | 1377 | |
8d577d32 DC |
1378 | surrounding_static_block = block_static_block (get_selected_block (0)); |
1379 | ||
b6429628 DC |
1380 | /* Go through the symtabs and check the externs and statics for |
1381 | symbols which match. */ | |
1382 | ||
43f3e411 | 1383 | ALL_COMPUNITS (objfile, cust) |
b6429628 DC |
1384 | { |
1385 | QUIT; | |
43f3e411 | 1386 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cust), GLOBAL_BLOCK); |
245040d7 | 1387 | make_symbol_overload_list_block (func_name, b); |
b6429628 DC |
1388 | } |
1389 | ||
43f3e411 | 1390 | ALL_COMPUNITS (objfile, cust) |
b6429628 DC |
1391 | { |
1392 | QUIT; | |
43f3e411 | 1393 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cust), STATIC_BLOCK); |
b6429628 DC |
1394 | /* Don't do this block twice. */ |
1395 | if (b == surrounding_static_block) | |
1396 | continue; | |
245040d7 | 1397 | make_symbol_overload_list_block (func_name, b); |
b6429628 | 1398 | } |
8d577d32 DC |
1399 | } |
1400 | ||
aff410f1 | 1401 | /* Lookup the rtti type for a class name. */ |
362ff856 MC |
1402 | |
1403 | struct type * | |
1404 | cp_lookup_rtti_type (const char *name, struct block *block) | |
1405 | { | |
1406 | struct symbol * rtti_sym; | |
1407 | struct type * rtti_type; | |
1408 | ||
82c7be31 DE |
1409 | /* Use VAR_DOMAIN here as NAME may be a typedef. PR 18141, 18417. |
1410 | Classes "live" in both STRUCT_DOMAIN and VAR_DOMAIN. */ | |
d12307c1 | 1411 | rtti_sym = lookup_symbol (name, block, VAR_DOMAIN, NULL).symbol; |
362ff856 MC |
1412 | |
1413 | if (rtti_sym == NULL) | |
1414 | { | |
8a3fe4f8 | 1415 | warning (_("RTTI symbol not found for class '%s'"), name); |
362ff856 MC |
1416 | return NULL; |
1417 | } | |
1418 | ||
1419 | if (SYMBOL_CLASS (rtti_sym) != LOC_TYPEDEF) | |
1420 | { | |
8a3fe4f8 | 1421 | warning (_("RTTI symbol for class '%s' is not a type"), name); |
362ff856 MC |
1422 | return NULL; |
1423 | } | |
1424 | ||
82c7be31 | 1425 | rtti_type = check_typedef (SYMBOL_TYPE (rtti_sym)); |
362ff856 MC |
1426 | |
1427 | switch (TYPE_CODE (rtti_type)) | |
1428 | { | |
4753d33b | 1429 | case TYPE_CODE_STRUCT: |
362ff856 MC |
1430 | break; |
1431 | case TYPE_CODE_NAMESPACE: | |
1432 | /* chastain/2003-11-26: the symbol tables often contain fake | |
1433 | symbols for namespaces with the same name as the struct. | |
1434 | This warning is an indication of a bug in the lookup order | |
1435 | or a bug in the way that the symbol tables are populated. */ | |
8a3fe4f8 | 1436 | warning (_("RTTI symbol for class '%s' is a namespace"), name); |
362ff856 MC |
1437 | return NULL; |
1438 | default: | |
8a3fe4f8 | 1439 | warning (_("RTTI symbol for class '%s' has bad type"), name); |
362ff856 MC |
1440 | return NULL; |
1441 | } | |
1442 | ||
1443 | return rtti_type; | |
1444 | } | |
b6429628 | 1445 | |
992c7d70 GB |
1446 | #ifdef HAVE_WORKING_FORK |
1447 | ||
1448 | /* If nonzero, attempt to catch crashes in the demangler and print | |
1449 | useful debugging information. */ | |
1450 | ||
1451 | static int catch_demangler_crashes = 1; | |
1452 | ||
992c7d70 GB |
1453 | /* Stack context and environment for demangler crash recovery. */ |
1454 | ||
1455 | static SIGJMP_BUF gdb_demangle_jmp_buf; | |
1456 | ||
1457 | /* If nonzero, attempt to dump core from the signal handler. */ | |
1458 | ||
1459 | static int gdb_demangle_attempt_core_dump = 1; | |
1460 | ||
1461 | /* Signal handler for gdb_demangle. */ | |
1462 | ||
1463 | static void | |
1464 | gdb_demangle_signal_handler (int signo) | |
1465 | { | |
1466 | if (gdb_demangle_attempt_core_dump) | |
1467 | { | |
1468 | if (fork () == 0) | |
1469 | dump_core (); | |
1470 | ||
1471 | gdb_demangle_attempt_core_dump = 0; | |
1472 | } | |
1473 | ||
1474 | SIGLONGJMP (gdb_demangle_jmp_buf, signo); | |
1475 | } | |
1476 | ||
1477 | #endif | |
1478 | ||
8de20a37 TT |
1479 | /* A wrapper for bfd_demangle. */ |
1480 | ||
1481 | char * | |
1482 | gdb_demangle (const char *name, int options) | |
1483 | { | |
992c7d70 GB |
1484 | char *result = NULL; |
1485 | int crash_signal = 0; | |
1486 | ||
1487 | #ifdef HAVE_WORKING_FORK | |
1488 | #if defined (HAVE_SIGACTION) && defined (SA_RESTART) | |
1489 | struct sigaction sa, old_sa; | |
1490 | #else | |
a40805d4 | 1491 | sighandler_t ofunc; |
992c7d70 GB |
1492 | #endif |
1493 | static int core_dump_allowed = -1; | |
1494 | ||
1495 | if (core_dump_allowed == -1) | |
1496 | { | |
1497 | core_dump_allowed = can_dump_core (LIMIT_CUR); | |
1498 | ||
1499 | if (!core_dump_allowed) | |
1500 | gdb_demangle_attempt_core_dump = 0; | |
1501 | } | |
1502 | ||
1503 | if (catch_demangler_crashes) | |
1504 | { | |
1505 | #if defined (HAVE_SIGACTION) && defined (SA_RESTART) | |
1506 | sa.sa_handler = gdb_demangle_signal_handler; | |
1507 | sigemptyset (&sa.sa_mask); | |
91b52240 | 1508 | #ifdef HAVE_SIGALTSTACK |
992c7d70 | 1509 | sa.sa_flags = SA_ONSTACK; |
91b52240 GB |
1510 | #else |
1511 | sa.sa_flags = 0; | |
1512 | #endif | |
992c7d70 GB |
1513 | sigaction (SIGSEGV, &sa, &old_sa); |
1514 | #else | |
a40805d4 | 1515 | ofunc = signal (SIGSEGV, gdb_demangle_signal_handler); |
992c7d70 GB |
1516 | #endif |
1517 | ||
1518 | crash_signal = SIGSETJMP (gdb_demangle_jmp_buf); | |
1519 | } | |
1520 | #endif | |
1521 | ||
1522 | if (crash_signal == 0) | |
1523 | result = bfd_demangle (NULL, name, options); | |
1524 | ||
1525 | #ifdef HAVE_WORKING_FORK | |
1526 | if (catch_demangler_crashes) | |
1527 | { | |
1528 | #if defined (HAVE_SIGACTION) && defined (SA_RESTART) | |
1529 | sigaction (SIGSEGV, &old_sa, NULL); | |
1530 | #else | |
1531 | signal (SIGSEGV, ofunc); | |
1532 | #endif | |
1533 | ||
1534 | if (crash_signal != 0) | |
1535 | { | |
1536 | static int error_reported = 0; | |
1537 | ||
1538 | if (!error_reported) | |
1539 | { | |
6ad94bc7 TT |
1540 | std::string short_msg |
1541 | = string_printf (_("unable to demangle '%s' " | |
1542 | "(demangler failed with signal %d)"), | |
1543 | name, crash_signal); | |
992c7d70 | 1544 | |
6ad94bc7 TT |
1545 | std::string long_msg |
1546 | = string_printf ("%s:%d: %s: %s", __FILE__, __LINE__, | |
1547 | "demangler-warning", short_msg.c_str ()); | |
992c7d70 | 1548 | |
223ffa71 TT |
1549 | target_terminal::scoped_restore_terminal_state term_state; |
1550 | target_terminal::ours_for_output (); | |
c509f1e1 | 1551 | |
992c7d70 GB |
1552 | begin_line (); |
1553 | if (core_dump_allowed) | |
1554 | fprintf_unfiltered (gdb_stderr, | |
1555 | _("%s\nAttempting to dump core.\n"), | |
6ad94bc7 | 1556 | long_msg.c_str ()); |
992c7d70 | 1557 | else |
6ad94bc7 | 1558 | warn_cant_dump_core (long_msg.c_str ()); |
992c7d70 | 1559 | |
6ad94bc7 | 1560 | demangler_warning (__FILE__, __LINE__, "%s", short_msg.c_str ()); |
992c7d70 GB |
1561 | |
1562 | error_reported = 1; | |
1563 | } | |
1564 | ||
1565 | result = NULL; | |
1566 | } | |
1567 | } | |
1568 | #endif | |
1569 | ||
1570 | return result; | |
8de20a37 TT |
1571 | } |
1572 | ||
8b302db8 TT |
1573 | /* See cp-support.h. */ |
1574 | ||
1575 | int | |
1576 | gdb_sniff_from_mangled_name (const char *mangled, char **demangled) | |
1577 | { | |
1578 | *demangled = gdb_demangle (mangled, DMGL_PARAMS | DMGL_ANSI); | |
1579 | return *demangled != NULL; | |
1580 | } | |
1581 | ||
9219021c DC |
1582 | /* Don't allow just "maintenance cplus". */ |
1583 | ||
1584 | static void | |
981a3fb3 | 1585 | maint_cplus_command (const char *arg, int from_tty) |
9219021c | 1586 | { |
3e43a32a MS |
1587 | printf_unfiltered (_("\"maintenance cplus\" must be followed " |
1588 | "by the name of a command.\n")); | |
aff410f1 MS |
1589 | help_list (maint_cplus_cmd_list, |
1590 | "maintenance cplus ", | |
635c7e8a | 1591 | all_commands, gdb_stdout); |
9219021c DC |
1592 | } |
1593 | ||
1594 | /* This is a front end for cp_find_first_component, for unit testing. | |
1595 | Be careful when using it: see the NOTE above | |
1596 | cp_find_first_component. */ | |
1597 | ||
1598 | static void | |
4a475551 | 1599 | first_component_command (const char *arg, int from_tty) |
9219021c | 1600 | { |
c836824f AR |
1601 | int len; |
1602 | char *prefix; | |
1603 | ||
1604 | if (!arg) | |
1605 | return; | |
1606 | ||
1607 | len = cp_find_first_component (arg); | |
224c3ddb | 1608 | prefix = (char *) alloca (len + 1); |
9219021c DC |
1609 | |
1610 | memcpy (prefix, arg, len); | |
1611 | prefix[len] = '\0'; | |
1612 | ||
1613 | printf_unfiltered ("%s\n", prefix); | |
1614 | } | |
1615 | ||
57651221 | 1616 | /* Implement "info vtbl". */ |
c4aeac85 TT |
1617 | |
1618 | static void | |
1619 | info_vtbl_command (char *arg, int from_tty) | |
1620 | { | |
1621 | struct value *value; | |
1622 | ||
1623 | value = parse_and_eval (arg); | |
1624 | cplus_print_vtable (value); | |
1625 | } | |
1626 | ||
9219021c DC |
1627 | void |
1628 | _initialize_cp_support (void) | |
1629 | { | |
aff410f1 MS |
1630 | add_prefix_cmd ("cplus", class_maintenance, |
1631 | maint_cplus_command, | |
1632 | _("C++ maintenance commands."), | |
1633 | &maint_cplus_cmd_list, | |
1634 | "maintenance cplus ", | |
1635 | 0, &maintenancelist); | |
1636 | add_alias_cmd ("cp", "cplus", | |
1637 | class_maintenance, 1, | |
1638 | &maintenancelist); | |
1639 | ||
1640 | add_cmd ("first_component", | |
1641 | class_maintenance, | |
1642 | first_component_command, | |
1a966eab | 1643 | _("Print the first class/namespace component of NAME."), |
9219021c | 1644 | &maint_cplus_cmd_list); |
c4aeac85 TT |
1645 | |
1646 | add_info ("vtbl", info_vtbl_command, | |
57651221 | 1647 | _("Show the virtual function table for a C++ object.\n\ |
c4aeac85 TT |
1648 | Usage: info vtbl EXPRESSION\n\ |
1649 | Evaluate EXPRESSION and display the virtual function table for the\n\ | |
1650 | resulting object.")); | |
992c7d70 GB |
1651 | |
1652 | #ifdef HAVE_WORKING_FORK | |
1653 | add_setshow_boolean_cmd ("catch-demangler-crashes", class_maintenance, | |
1654 | &catch_demangler_crashes, _("\ | |
1655 | Set whether to attempt to catch demangler crashes."), _("\ | |
1656 | Show whether to attempt to catch demangler crashes."), _("\ | |
1657 | If enabled GDB will attempt to catch demangler crashes and\n\ | |
1658 | display the offending symbol."), | |
1659 | NULL, | |
1660 | NULL, | |
1661 | &maintenance_set_cmdlist, | |
1662 | &maintenance_show_cmdlist); | |
1663 | #endif | |
9219021c | 1664 | } |